id stringlengths 9 10 | submitter stringlengths 1 64 ⌀ | authors stringlengths 4 20.7k | title stringlengths 4 246 | comments stringlengths 1 523 ⌀ | journal-ref stringlengths 4 404 ⌀ | doi stringlengths 11 153 ⌀ | report-no stringlengths 2 254 ⌀ | categories stringlengths 5 98 | license stringclasses 9
values | orig_abstract stringlengths 14 3.35k | versions listlengths 1 60 | update_date stringlengths 10 10 | authors_parsed listlengths 1 1.35k | abstract stringlengths 11 3.34k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1405.3824 | Federico Chesani | Marco Gavanelli, Stefano Bragaglia, Michela Milano, Federico Chesani,
Elisa Marengo, Paolo Cagnoli | Multi-Criteria Optimal Planning for Energy Policies in CLP | Accepted at ICLP2014 Conference as Technical Communication, due to
appear in Theory and Practice of Logic Programming (TPLP) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the policy making process a number of disparate and diverse issues such as
economic development, environmental aspects, as well as the social acceptance
of the policy, need to be considered. A single person might not have all the
required expertises, and decision support systems featuring optimization
components c... | [
{
"created": "Thu, 15 May 2014 12:48:35 GMT",
"version": "v1"
}
] | 2014-05-16 | [
[
"Gavanelli",
"Marco",
""
],
[
"Bragaglia",
"Stefano",
""
],
[
"Milano",
"Michela",
""
],
[
"Chesani",
"Federico",
""
],
[
"Marengo",
"Elisa",
""
],
[
"Cagnoli",
"Paolo",
""
]
] | In the policy making process a number of disparate and diverse issues such as economic development, environmental aspects, as well as the social acceptance of the policy, need to be considered. A single person might not have all the required expertises, and decision support systems featuring optimization components can... |
2010.04678 | Christos Psarras M.Sc. | Christos Psarras, Lars Karlsson, Rasmus Bro and Paolo Bientinesi | Concurrent Alternating Least Squares for multiple simultaneous Canonical
Polyadic Decompositions | null | null | 10.1145/3519383 | null | cs.MS cs.LG cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tensor decompositions, such as CANDECOMP/PARAFAC (CP), are widely used in a
variety of applications, such as chemometrics, signal processing, and machine
learning. A broadly used method for computing such decompositions relies on the
Alternating Least Squares (ALS) algorithm. When the number of components is
small, r... | [
{
"created": "Fri, 9 Oct 2020 16:55:46 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Sep 2021 11:27:58 GMT",
"version": "v2"
}
] | 2022-05-02 | [
[
"Psarras",
"Christos",
""
],
[
"Karlsson",
"Lars",
""
],
[
"Bro",
"Rasmus",
""
],
[
"Bientinesi",
"Paolo",
""
]
] | Tensor decompositions, such as CANDECOMP/PARAFAC (CP), are widely used in a variety of applications, such as chemometrics, signal processing, and machine learning. A broadly used method for computing such decompositions relies on the Alternating Least Squares (ALS) algorithm. When the number of components is small, reg... |
2407.02424 | Benjamin Rodatz | Benjamin Rodatz, Ian Fan, Tuomas Laakkonen, Neil John Ortega, Thomas
Hoffman, Vincent Wang-Mascianica | A Pattern Language for Machine Learning Tasks | null | null | null | null | cs.LG math.CT | http://creativecommons.org/licenses/by/4.0/ | Idealised as universal approximators, learners such as neural networks can be
viewed as "variable functions" that may become one of a range of concrete
functions after training. In the same way that equations constrain the possible
values of variables in algebra, we may view objective functions as constraints
on the ... | [
{
"created": "Tue, 2 Jul 2024 16:50:27 GMT",
"version": "v1"
}
] | 2024-07-03 | [
[
"Rodatz",
"Benjamin",
""
],
[
"Fan",
"Ian",
""
],
[
"Laakkonen",
"Tuomas",
""
],
[
"Ortega",
"Neil John",
""
],
[
"Hoffman",
"Thomas",
""
],
[
"Wang-Mascianica",
"Vincent",
""
]
] | Idealised as universal approximators, learners such as neural networks can be viewed as "variable functions" that may become one of a range of concrete functions after training. In the same way that equations constrain the possible values of variables in algebra, we may view objective functions as constraints on the be... |
2109.12195 | Sukhpal Singh Gill | Sukhpal Singh Gill | A Manifesto for Modern Fog and Edge Computing: Vision, New Paradigms,
Opportunities, and Future Directions | 27 pages, 4 Figures, Preprint version - Published by EAI/Springer
Innovations in Communication and Computing. Springer, Cham | in Operationalizing Multi-Cloud Environments. EAI/Springer
Innovations in Communication and Computing. pp 237-253 (2021) | 10.1007/978-3-030-74402-1_13 | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | The advancements in the use of Internet of Things (IoT) devices is increasing
continuously and generating huge amounts of data in a fast manner. Cloud
computing is an important paradigm which processes and manages user data
effectively. Further, fog and edge computing paradigms are introduced to
improve user service ... | [
{
"created": "Sun, 19 Sep 2021 09:25:18 GMT",
"version": "v1"
}
] | 2022-03-01 | [
[
"Gill",
"Sukhpal Singh",
""
]
] | The advancements in the use of Internet of Things (IoT) devices is increasing continuously and generating huge amounts of data in a fast manner. Cloud computing is an important paradigm which processes and manages user data effectively. Further, fog and edge computing paradigms are introduced to improve user service by... |
2303.00910 | Tomoya Kamimura | Yusuke Sakurai, Tomoya Kamimura, Yuki Sakamoto, Shohei Nishii, Kodai
Sato, Yuta Fujiwara, and Akihito Sano | Bipedal Robot Running: Human-like Actuation Timing Using Fast and Slow
Adaptations | 17 pages, 13 figures, accepted to Advanced Robotics | null | null | null | cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | We have been developing human-sized biped robots based on passive dynamic
mechanisms. In human locomotion, the muscles activate at the same rate relative
to the gait cycle during running. To achieve adaptive running for robots, such
characteristics should be reproduced to yield the desired effect, In this
study, we d... | [
{
"created": "Thu, 2 Mar 2023 02:12:21 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Nov 2023 05:40:05 GMT",
"version": "v2"
},
{
"created": "Thu, 14 Mar 2024 03:32:55 GMT",
"version": "v3"
}
] | 2024-03-15 | [
[
"Sakurai",
"Yusuke",
""
],
[
"Kamimura",
"Tomoya",
""
],
[
"Sakamoto",
"Yuki",
""
],
[
"Nishii",
"Shohei",
""
],
[
"Sato",
"Kodai",
""
],
[
"Fujiwara",
"Yuta",
""
],
[
"Sano",
"Akihito",
""
]
] | We have been developing human-sized biped robots based on passive dynamic mechanisms. In human locomotion, the muscles activate at the same rate relative to the gait cycle during running. To achieve adaptive running for robots, such characteristics should be reproduced to yield the desired effect, In this study, we des... |
2302.01744 | Yuanfang Chen | Yuanfang Chen, Muhammad Alam, Xiaohua Xu | Communication Security in the Internet of Vehicles based Industrial
Value Chain | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Internet of Vehicles (IoV) is formed by connecting vehicles to Internet
of Things. It enables vehicles to ubiquitously access to the information of
customers (drivers), suppliers, and even producers to structure an IoV-based
industrial value chain. Nevertheless, with the increase in vehicle networking
and the inf... | [
{
"created": "Sat, 14 Jan 2023 17:08:33 GMT",
"version": "v1"
}
] | 2023-02-06 | [
[
"Chen",
"Yuanfang",
""
],
[
"Alam",
"Muhammad",
""
],
[
"Xu",
"Xiaohua",
""
]
] | The Internet of Vehicles (IoV) is formed by connecting vehicles to Internet of Things. It enables vehicles to ubiquitously access to the information of customers (drivers), suppliers, and even producers to structure an IoV-based industrial value chain. Nevertheless, with the increase in vehicle networking and the infor... |
2312.16896 | Suho Shin | Seyed Esmaeili, MohammadTaghi Hajiaghayi, Suho Shin | Replication-proof Bandit Mechanism Design | null | null | null | null | cs.GT cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a problem of designing replication-proof bandit mechanisms when
agents strategically register or replicate their own arms to maximize their
payoff. We consider Bayesian agents who are unaware of ex-post realization of
their own arms' mean rewards, which is the first to study Bayesian extension of
Shin et al.... | [
{
"created": "Thu, 28 Dec 2023 08:36:35 GMT",
"version": "v1"
}
] | 2023-12-29 | [
[
"Esmaeili",
"Seyed",
""
],
[
"Hajiaghayi",
"MohammadTaghi",
""
],
[
"Shin",
"Suho",
""
]
] | We study a problem of designing replication-proof bandit mechanisms when agents strategically register or replicate their own arms to maximize their payoff. We consider Bayesian agents who are unaware of ex-post realization of their own arms' mean rewards, which is the first to study Bayesian extension of Shin et al. (... |
1610.00291 | Xianxu Hou | Xianxu Hou, Linlin Shen, Ke Sun, Guoping Qiu | Deep Feature Consistent Variational Autoencoder | WACV | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel method for constructing Variational Autoencoder (VAE).
Instead of using pixel-by-pixel loss, we enforce deep feature consistency
between the input and the output of a VAE, which ensures the VAE's output to
preserve the spatial correlation characteristics of the input, thus leading the
output to hav... | [
{
"created": "Sun, 2 Oct 2016 15:48:36 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Mar 2024 13:41:19 GMT",
"version": "v2"
}
] | 2024-03-21 | [
[
"Hou",
"Xianxu",
""
],
[
"Shen",
"Linlin",
""
],
[
"Sun",
"Ke",
""
],
[
"Qiu",
"Guoping",
""
]
] | We present a novel method for constructing Variational Autoencoder (VAE). Instead of using pixel-by-pixel loss, we enforce deep feature consistency between the input and the output of a VAE, which ensures the VAE's output to preserve the spatial correlation characteristics of the input, thus leading the output to have ... |
2310.19427 | Kyowoon Lee | Kyowoon Lee, Seongun Kim and Jaesik Choi | Refining Diffusion Planner for Reliable Behavior Synthesis by Automatic
Detection of Infeasible Plans | NeurIPS 2023. First two authors contributed equally. Code at
http://github.com/leekwoon/rgg | null | null | null | cs.LG cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | Diffusion-based planning has shown promising results in long-horizon,
sparse-reward tasks by training trajectory diffusion models and conditioning
the sampled trajectories using auxiliary guidance functions. However, due to
their nature as generative models, diffusion models are not guaranteed to
generate feasible pl... | [
{
"created": "Mon, 30 Oct 2023 10:35:42 GMT",
"version": "v1"
}
] | 2023-10-31 | [
[
"Lee",
"Kyowoon",
""
],
[
"Kim",
"Seongun",
""
],
[
"Choi",
"Jaesik",
""
]
] | Diffusion-based planning has shown promising results in long-horizon, sparse-reward tasks by training trajectory diffusion models and conditioning the sampled trajectories using auxiliary guidance functions. However, due to their nature as generative models, diffusion models are not guaranteed to generate feasible plan... |
2402.13542 | Yue Yu | Lingxi Zhang, Yue Yu, Kuan Wang, Chao Zhang | ARL2: Aligning Retrievers for Black-box Large Language Models via
Self-guided Adaptive Relevance Labeling | ACL 2024 | ACL 2024 | null | null | cs.CL cs.AI cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Retrieval-augmented generation enhances large language models (LLMs) by
incorporating relevant information from external knowledge sources. This
enables LLMs to adapt to specific domains and mitigate hallucinations in
knowledge-intensive tasks. However, existing retrievers are often misaligned
with LLMs due to their ... | [
{
"created": "Wed, 21 Feb 2024 05:41:34 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Jun 2024 05:17:24 GMT",
"version": "v2"
}
] | 2024-06-05 | [
[
"Zhang",
"Lingxi",
""
],
[
"Yu",
"Yue",
""
],
[
"Wang",
"Kuan",
""
],
[
"Zhang",
"Chao",
""
]
] | Retrieval-augmented generation enhances large language models (LLMs) by incorporating relevant information from external knowledge sources. This enables LLMs to adapt to specific domains and mitigate hallucinations in knowledge-intensive tasks. However, existing retrievers are often misaligned with LLMs due to their se... |
2201.12872 | Ying-Xin Wu | Ying-Xin Wu, Xiang Wang, An Zhang, Xiangnan He, Tat-Seng Chua | Discovering Invariant Rationales for Graph Neural Networks | ICLR 2022 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intrinsic interpretability of graph neural networks (GNNs) is to find a small
subset of the input graph's features -- rationale -- which guides the model
prediction. Unfortunately, the leading rationalization models often rely on
data biases, especially shortcut features, to compose rationales and make
predictions wi... | [
{
"created": "Sun, 30 Jan 2022 16:43:40 GMT",
"version": "v1"
}
] | 2022-02-01 | [
[
"Wu",
"Ying-Xin",
""
],
[
"Wang",
"Xiang",
""
],
[
"Zhang",
"An",
""
],
[
"He",
"Xiangnan",
""
],
[
"Chua",
"Tat-Seng",
""
]
] | Intrinsic interpretability of graph neural networks (GNNs) is to find a small subset of the input graph's features -- rationale -- which guides the model prediction. Unfortunately, the leading rationalization models often rely on data biases, especially shortcut features, to compose rationales and make predictions with... |
1901.00884 | Jeremiah Johnson | Jeremiah Johnson | Subspace Match Probably Does Not Accurately Assess the Similarity of
Learned Representations | null | null | null | null | cs.LG cs.NE math.AC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning informative representations of data is one of the primary goals of
deep learning, but there is still little understanding as to what
representations a neural network actually learns. To better understand this,
subspace match was recently proposed as a method for assessing the similarity
of the representation... | [
{
"created": "Thu, 3 Jan 2019 19:17:45 GMT",
"version": "v1"
}
] | 2019-01-07 | [
[
"Johnson",
"Jeremiah",
""
]
] | Learning informative representations of data is one of the primary goals of deep learning, but there is still little understanding as to what representations a neural network actually learns. To better understand this, subspace match was recently proposed as a method for assessing the similarity of the representations ... |
2207.07243 | Anita Mahinpei | Anita Mahinpei, Zona Kostic, Chris Tanner | LineCap: Line Charts for Data Visualization Captioning Models | null | null | null | null | cs.CV cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data visualization captions help readers understand the purpose of a
visualization and are crucial for individuals with visual impairments. The
prevalence of poor figure captions and the successful application of deep
learning approaches to image captioning motivate the use of similar techniques
for automated figure ... | [
{
"created": "Fri, 15 Jul 2022 00:35:59 GMT",
"version": "v1"
}
] | 2022-07-18 | [
[
"Mahinpei",
"Anita",
""
],
[
"Kostic",
"Zona",
""
],
[
"Tanner",
"Chris",
""
]
] | Data visualization captions help readers understand the purpose of a visualization and are crucial for individuals with visual impairments. The prevalence of poor figure captions and the successful application of deep learning approaches to image captioning motivate the use of similar techniques for automated figure ca... |
1607.01486 | Dinuka Abeywardena Dr | Dinuka Abeywardena, Shoudong Huang, Ben Barnes, Gamini Dissanayake,
Sarath Kodagoda | Fast, On-board, Model-aided Visual-Inertial Odometry System for
Quadrotor Micro Aerial Vehicles | 8 pages | Published in 2016 IEEE International Conference on Robotics and
Automation (ICRA) | 10.1109/ICRA.2016.7487290 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main contribution of this paper is a high frequency, low-complexity,
on-board visual-inertial odometry system for quadrotor micro air vehicles. The
system consists of an extended Kalman filter (EKF) based state estimation
algorithm that fuses information from a low cost MEMS inertial measurement unit
acquired at ... | [
{
"created": "Wed, 6 Jul 2016 06:28:18 GMT",
"version": "v1"
}
] | 2016-07-07 | [
[
"Abeywardena",
"Dinuka",
""
],
[
"Huang",
"Shoudong",
""
],
[
"Barnes",
"Ben",
""
],
[
"Dissanayake",
"Gamini",
""
],
[
"Kodagoda",
"Sarath",
""
]
] | The main contribution of this paper is a high frequency, low-complexity, on-board visual-inertial odometry system for quadrotor micro air vehicles. The system consists of an extended Kalman filter (EKF) based state estimation algorithm that fuses information from a low cost MEMS inertial measurement unit acquired at 20... |
2106.02287 | Cha\"im van Toledo | Cha\"im van Toledo, Friso van Dijk, Marco Spruit | Dutch Named Entity Recognition and De-identification Methods for the
Human Resource Domain | null | International Journal on Natural Language Computing (IJNLC) Vol.9,
No.6, December 2020 | 10.5121/ijnlc.2020.9602 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The human resource (HR) domain contains various types of privacy-sensitive
textual data, such as e-mail correspondence and performance appraisal. Doing
research on these documents brings several challenges, one of them
anonymisation. In this paper, we evaluate the current Dutch text
de-identification methods for the ... | [
{
"created": "Fri, 4 Jun 2021 06:59:25 GMT",
"version": "v1"
}
] | 2021-06-07 | [
[
"van Toledo",
"Chaïm",
""
],
[
"van Dijk",
"Friso",
""
],
[
"Spruit",
"Marco",
""
]
] | The human resource (HR) domain contains various types of privacy-sensitive textual data, such as e-mail correspondence and performance appraisal. Doing research on these documents brings several challenges, one of them anonymisation. In this paper, we evaluate the current Dutch text de-identification methods for the HR... |
2011.03098 | Yongsheng Bai | Yongsheng Bai, Halil Sezen, Alper Yilmaz | End-to-end Deep Learning Methods for Automated Damage Detection in
Extreme Events at Various Scales | null | null | null | null | cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robust Mask R-CNN (Mask Regional Convolu-tional Neural Network) methods are
proposed and tested for automatic detection of cracks on structures or their
components that may be damaged during extreme events, such as earth-quakes. We
curated a new dataset with 2,021 labeled images for training and validation and
aimed ... | [
{
"created": "Thu, 5 Nov 2020 21:21:19 GMT",
"version": "v1"
}
] | 2020-11-20 | [
[
"Bai",
"Yongsheng",
""
],
[
"Sezen",
"Halil",
""
],
[
"Yilmaz",
"Alper",
""
]
] | Robust Mask R-CNN (Mask Regional Convolu-tional Neural Network) methods are proposed and tested for automatic detection of cracks on structures or their components that may be damaged during extreme events, such as earth-quakes. We curated a new dataset with 2,021 labeled images for training and validation and aimed to... |
2406.17339 | Ioannis Krikidis | I. Krikidis, C. Psomas, A. K. Singh and K. Jamieson | Optimizing Configuration Selection in Reconfigurable-Antenna MIMO
Systems: Physics-Inspired Heuristic Solvers | arXiv admin note: text overlap with arXiv:2403.12571 | IEEE Transactions on Communications, 2004 | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reconfigurable antenna multiple-input multiple-output (MIMO) is a
foundational technology for the continuing evolution of cellular systems,
including upcoming 6G communication systems. In this paper, we address the
problem of flexible/reconfigurable antenna configuration selection for
point-to-point MIMO antenna syst... | [
{
"created": "Tue, 25 Jun 2024 07:53:15 GMT",
"version": "v1"
}
] | 2024-06-26 | [
[
"Krikidis",
"I.",
""
],
[
"Psomas",
"C.",
""
],
[
"Singh",
"A. K.",
""
],
[
"Jamieson",
"K.",
""
]
] | Reconfigurable antenna multiple-input multiple-output (MIMO) is a foundational technology for the continuing evolution of cellular systems, including upcoming 6G communication systems. In this paper, we address the problem of flexible/reconfigurable antenna configuration selection for point-to-point MIMO antenna system... |
1808.09935 | Pinkesh Badjatiya | Pinkesh Badjatiya, Litton J Kurisinkel, Manish Gupta, and Vasudeva
Varma | Attention-based Neural Text Segmentation | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Text segmentation plays an important role in various Natural Language
Processing (NLP) tasks like summarization, context understanding, document
indexing and document noise removal. Previous methods for this task require
manual feature engineering, huge memory requirements and large execution times.
To the best of ou... | [
{
"created": "Wed, 29 Aug 2018 17:29:12 GMT",
"version": "v1"
}
] | 2018-08-30 | [
[
"Badjatiya",
"Pinkesh",
""
],
[
"Kurisinkel",
"Litton J",
""
],
[
"Gupta",
"Manish",
""
],
[
"Varma",
"Vasudeva",
""
]
] | Text segmentation plays an important role in various Natural Language Processing (NLP) tasks like summarization, context understanding, document indexing and document noise removal. Previous methods for this task require manual feature engineering, huge memory requirements and large execution times. To the best of our ... |
1606.03864 | Dirk Weissenborn | Dirk Weissenborn | Neural Associative Memory for Dual-Sequence Modeling | To appear in RepL4NLP at ACL 2016 | null | null | null | cs.NE cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many important NLP problems can be posed as dual-sequence or
sequence-to-sequence modeling tasks. Recent advances in building end-to-end
neural architectures have been highly successful in solving such tasks. In this
work we propose a new architecture for dual-sequence modeling that is based on
associative memory. We... | [
{
"created": "Mon, 13 Jun 2016 09:08:04 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Jun 2016 07:59:18 GMT",
"version": "v2"
}
] | 2016-06-15 | [
[
"Weissenborn",
"Dirk",
""
]
] | Many important NLP problems can be posed as dual-sequence or sequence-to-sequence modeling tasks. Recent advances in building end-to-end neural architectures have been highly successful in solving such tasks. In this work we propose a new architecture for dual-sequence modeling that is based on associative memory. We d... |
1703.05341 | Petr Ro\v{c}kai | Petr Ro\v{c}kai, Vladim\'ir \v{S}till, Ivana \v{c}ern\'a, Ji\v{r}\'i
Barnat | DiVM: Model Checking with LLVM and Graph Memory | 2017-04-19 / revision 3: add a missing author to arxiv metadata
2017-03-31 / revision 2: now with an experimental evaluation | null | 10.1016/j.jss.2018.04.026 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we introduce the concept of a virtual machine with
graph-organised memory as a versatile backend for both explicit-state and
abstraction-driven verification of software. Our virtual machine uses the LLVM
IR as its instruction set, enriched with a small set of hypercalls. We show
that the provided hyper... | [
{
"created": "Wed, 15 Mar 2017 18:29:50 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Apr 2017 07:02:20 GMT",
"version": "v2"
},
{
"created": "Wed, 19 Apr 2017 08:42:54 GMT",
"version": "v3"
}
] | 2019-07-10 | [
[
"Ročkai",
"Petr",
""
],
[
"Štill",
"Vladimír",
""
],
[
"černá",
"Ivana",
""
],
[
"Barnat",
"Jiří",
""
]
] | In this paper, we introduce the concept of a virtual machine with graph-organised memory as a versatile backend for both explicit-state and abstraction-driven verification of software. Our virtual machine uses the LLVM IR as its instruction set, enriched with a small set of hypercalls. We show that the provided hyperca... |
2101.07116 | Yong Huang | Yong Huang, Ben Chen, Daiming Qu | LNSMM: Eye Gaze Estimation With Local Network Share Multiview Multitask | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Eye gaze estimation has become increasingly significant in computer vision.In
this paper,we systematically study the mainstream of eye gaze estimation
methods,propose a novel methodology to estimate eye gaze points and eye gaze
directions simultaneously.First,we construct a local sharing network for
feature extractio... | [
{
"created": "Mon, 18 Jan 2021 15:14:24 GMT",
"version": "v1"
}
] | 2021-01-19 | [
[
"Huang",
"Yong",
""
],
[
"Chen",
"Ben",
""
],
[
"Qu",
"Daiming",
""
]
] | Eye gaze estimation has become increasingly significant in computer vision.In this paper,we systematically study the mainstream of eye gaze estimation methods,propose a novel methodology to estimate eye gaze points and eye gaze directions simultaneously.First,we construct a local sharing network for feature extraction ... |
1107.2693 | Nicolaie Popescu-Bodorin | Nicolaie Popescu-Bodorin | A Fuzzy View on k-Means Based Signal Quantization with Application in
Iris Segmentation | 4, pages, 3 figures, 17th Telecommunications Forum TELFOR 2009,
Belgrade, Serbia | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper shows that the k-means quantization of a signal can be interpreted
both as a crisp indicator function and as a fuzzy membership assignment
describing fuzzy clusters and fuzzy boundaries. Combined crisp and fuzzy
indicator functions are defined here as natural generalizations of the ordinary
crisp and fuzzy... | [
{
"created": "Wed, 13 Jul 2011 22:46:58 GMT",
"version": "v1"
}
] | 2011-07-15 | [
[
"Popescu-Bodorin",
"Nicolaie",
""
]
] | This paper shows that the k-means quantization of a signal can be interpreted both as a crisp indicator function and as a fuzzy membership assignment describing fuzzy clusters and fuzzy boundaries. Combined crisp and fuzzy indicator functions are defined here as natural generalizations of the ordinary crisp and fuzzy i... |
1707.00506 | Ana Freire | Akshay Kumar Chaturvedi, Filipa Peleja, Ana Freire | Recommender System for News Articles using Supervised Learning | 36 pages | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the last decade we have observed a mass increase of information, in
particular information that is shared through smartphones. Consequently, the
amount of information that is available does not allow the average user to be
aware of all his options. In this context, recommender systems use a number of
techniques to... | [
{
"created": "Mon, 3 Jul 2017 12:27:17 GMT",
"version": "v1"
}
] | 2017-07-04 | [
[
"Chaturvedi",
"Akshay Kumar",
""
],
[
"Peleja",
"Filipa",
""
],
[
"Freire",
"Ana",
""
]
] | In the last decade we have observed a mass increase of information, in particular information that is shared through smartphones. Consequently, the amount of information that is available does not allow the average user to be aware of all his options. In this context, recommender systems use a number of techniques to h... |
2105.00274 | Patrick Koopmann | Patrick Koopmann | Signature-Based Abduction with Fresh Individuals and Complex Concepts
for Description Logics (Extended Version) | Extended version of a paper accepted at IJCAI-2021, 20 pages, 3
figures | null | null | null | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a knowledge base and an observation as a set of facts, ABox abduction
aims at computing a hypothesis that, when added to the knowledge base, is
sufficient to entail the observation. In signature-based ABox abduction, the
hypothesis is further required to use only names from a given set. This form of
abduction h... | [
{
"created": "Sat, 1 May 2021 14:55:46 GMT",
"version": "v1"
}
] | 2021-05-04 | [
[
"Koopmann",
"Patrick",
""
]
] | Given a knowledge base and an observation as a set of facts, ABox abduction aims at computing a hypothesis that, when added to the knowledge base, is sufficient to entail the observation. In signature-based ABox abduction, the hypothesis is further required to use only names from a given set. This form of abduction has... |
1704.00438 | Jian Zhao | Lin Xiong, Jayashree Karlekar, Jian Zhao, Yi Cheng, Yan Xu, Jiashi
Feng, Sugiri Pranata, Shengmei Shen | A Good Practice Towards Top Performance of Face Recognition: Transferred
Deep Feature Fusion | 13 pages, 10 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Unconstrained face recognition performance evaluations have traditionally
focused on Labeled Faces in the Wild (LFW) dataset for imagery and the
YouTubeFaces (YTF) dataset for videos in the last couple of years. Spectacular
progress in this field has resulted in saturation on verification and
identification accuracie... | [
{
"created": "Mon, 3 Apr 2017 06:11:43 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Feb 2018 05:37:41 GMT",
"version": "v2"
}
] | 2018-02-12 | [
[
"Xiong",
"Lin",
""
],
[
"Karlekar",
"Jayashree",
""
],
[
"Zhao",
"Jian",
""
],
[
"Cheng",
"Yi",
""
],
[
"Xu",
"Yan",
""
],
[
"Feng",
"Jiashi",
""
],
[
"Pranata",
"Sugiri",
""
],
[
"Shen",
"Sheng... | Unconstrained face recognition performance evaluations have traditionally focused on Labeled Faces in the Wild (LFW) dataset for imagery and the YouTubeFaces (YTF) dataset for videos in the last couple of years. Spectacular progress in this field has resulted in saturation on verification and identification accuracies ... |
2212.08876 | Ronald Rousseau | Leo Egghe and Ronald Rousseau | The generalized e-bundle | null | null | null | null | cs.SI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In previous work, we introduced the notion of an impact bundle, showing how
e.g., the h-index and the g-index can lead to such a bundle. Here we extend the
set of impact bundles by a new impact bundle, based on the Zhang e-index. It
is, moreover, shown that some other plausible definitions do not lead to an
impact bu... | [
{
"created": "Sat, 17 Dec 2022 14:08:05 GMT",
"version": "v1"
}
] | 2022-12-20 | [
[
"Egghe",
"Leo",
""
],
[
"Rousseau",
"Ronald",
""
]
] | In previous work, we introduced the notion of an impact bundle, showing how e.g., the h-index and the g-index can lead to such a bundle. Here we extend the set of impact bundles by a new impact bundle, based on the Zhang e-index. It is, moreover, shown that some other plausible definitions do not lead to an impact bund... |
2403.06082 | Harshavardhan Adepu | Harshavardhan Adepu, Zhanpeng Zeng, Li Zhang, Vikas Singh | FrameQuant: Flexible Low-Bit Quantization for Transformers | 25 pages, 15 figures | null | null | null | cs.LG cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformers are the backbone of powerful foundation models for many Vision
and Natural Language Processing tasks. But their compute and memory/storage
footprint is large, and so, serving such models is expensive often requiring
high-end hardware. To mitigate this difficulty, Post-Training Quantization
seeks to modif... | [
{
"created": "Sun, 10 Mar 2024 04:01:49 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Jul 2024 05:59:31 GMT",
"version": "v2"
}
] | 2024-08-01 | [
[
"Adepu",
"Harshavardhan",
""
],
[
"Zeng",
"Zhanpeng",
""
],
[
"Zhang",
"Li",
""
],
[
"Singh",
"Vikas",
""
]
] | Transformers are the backbone of powerful foundation models for many Vision and Natural Language Processing tasks. But their compute and memory/storage footprint is large, and so, serving such models is expensive often requiring high-end hardware. To mitigate this difficulty, Post-Training Quantization seeks to modify ... |
1401.7006 | Aria Ghasemian Sahebi | Aria G. Sahebi and S. Sandeep Pradhan | Polar Codes for Some Multi-terminal Communications Problems | arXiv admin note: substantial text overlap with arXiv:1401.6482 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is shown that polar coding schemes achieve the known achievable rate
regions for several multi-terminal communications problems including lossy
distributed source coding, multiple access channels and multiple descriptions
coding. The results are valid for arbitrary alphabet sizes (binary or
nonbinary) and arbitrar... | [
{
"created": "Sat, 25 Jan 2014 05:13:23 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Apr 2014 02:12:00 GMT",
"version": "v2"
}
] | 2014-04-29 | [
[
"Sahebi",
"Aria G.",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] | It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The results are valid for arbitrary alphabet sizes (binary or nonbinary) and arbitrary ... |
2003.03744 | Jinghua Zhang | Jinghua Zhang, Chen Li, Frank Kulwa, Xin Zhao, Changhao Sun, Zihan Li,
Tao Jiang, Hong Li, and Shouliang Qi | A Multi-scale CNN-CRF Framework for Environmental Microorganism Image
Segmentation | null | BioMed Research International, vol. 2020, Article ID 4621403, 27
pages, 2020 | 10.1155/2020/4621403 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To assist researchers to identify Environmental Microorganisms (EMs)
effectively, a Multiscale CNN-CRF (MSCC) framework for the EM image
segmentation is proposed in this paper. There are two parts in this framework:
The first is a novel pixel-level segmentation approach, using a newly
introduced Convolutional Neural ... | [
{
"created": "Sun, 8 Mar 2020 08:30:30 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Jul 2020 12:32:51 GMT",
"version": "v2"
}
] | 2021-02-25 | [
[
"Zhang",
"Jinghua",
""
],
[
"Li",
"Chen",
""
],
[
"Kulwa",
"Frank",
""
],
[
"Zhao",
"Xin",
""
],
[
"Sun",
"Changhao",
""
],
[
"Li",
"Zihan",
""
],
[
"Jiang",
"Tao",
""
],
[
"Li",
"Hong",
""
... | To assist researchers to identify Environmental Microorganisms (EMs) effectively, a Multiscale CNN-CRF (MSCC) framework for the EM image segmentation is proposed in this paper. There are two parts in this framework: The first is a novel pixel-level segmentation approach, using a newly introduced Convolutional Neural Ne... |
2004.09838 | Yiming Peng | Yiming Peng, Hisao Ishibuchi | A Decomposition-based Large-scale Multi-modal Multi-objective
Optimization Algorithm | 8 pages, 8 figures, 3 tables. Accepted by the 2020 IEEE Congress on
Evolutionary Computation (IEEE CEC) | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A multi-modal multi-objective optimization problem is a special kind of
multi-objective optimization problem with multiple Pareto subsets. In this
paper, we propose an efficient multi-modal multi-objective optimization
algorithm based on the widely used MOEA/D algorithm. In our proposed algorithm,
each weight vector ... | [
{
"created": "Tue, 21 Apr 2020 09:18:54 GMT",
"version": "v1"
}
] | 2020-04-22 | [
[
"Peng",
"Yiming",
""
],
[
"Ishibuchi",
"Hisao",
""
]
] | A multi-modal multi-objective optimization problem is a special kind of multi-objective optimization problem with multiple Pareto subsets. In this paper, we propose an efficient multi-modal multi-objective optimization algorithm based on the widely used MOEA/D algorithm. In our proposed algorithm, each weight vector ha... |
1610.07728 | Xiang Jiang | Xiang Jiang, Shikui Wei, Ruizhen Zhao, Yao Zhao, Xindong Wu | Camera Fingerprint: A New Perspective for Identifying User's Identity | 12 pages, 7 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Identifying user's identity is a key problem in many data mining
applications, such as product recommendation, customized content delivery and
criminal identification. Given a set of accounts from the same or different
social network platforms, user identification attempts to identify all accounts
belonging to the sa... | [
{
"created": "Tue, 25 Oct 2016 04:31:55 GMT",
"version": "v1"
}
] | 2016-10-26 | [
[
"Jiang",
"Xiang",
""
],
[
"Wei",
"Shikui",
""
],
[
"Zhao",
"Ruizhen",
""
],
[
"Zhao",
"Yao",
""
],
[
"Wu",
"Xindong",
""
]
] | Identifying user's identity is a key problem in many data mining applications, such as product recommendation, customized content delivery and criminal identification. Given a set of accounts from the same or different social network platforms, user identification attempts to identify all accounts belonging to the same... |
2405.19731 | Yuqing Xiong | Yuqing Xiong | Some New Approaches to MPI Implementations | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper provides some new approaches to MPI implementations to improve MPI
performance. These approaches include dynamically composable libraries,
reducing average layer numbers of MPI libraries, and a single entity of
MPI-network, MPI-protocol, and MPI.
| [
{
"created": "Thu, 30 May 2024 06:23:00 GMT",
"version": "v1"
}
] | 2024-05-31 | [
[
"Xiong",
"Yuqing",
""
]
] | This paper provides some new approaches to MPI implementations to improve MPI performance. These approaches include dynamically composable libraries, reducing average layer numbers of MPI libraries, and a single entity of MPI-network, MPI-protocol, and MPI. |
2407.14984 | Praveen Damacharla | Vinod Kumar Maddineni, Naga Babu Koganti and Praveen Damacharla | Enhancing Microgrid Performance Prediction with Attention-based Deep
Learning Models | 2024 11th International Conference on Information Technology,
Computer, and Electrical Engineering (ICITACEE) | null | null | null | cs.LG cs.AI cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | In this research, an effort is made to address microgrid systems' operational
challenges, characterized by power oscillations that eventually contribute to
grid instability. An integrated strategy is proposed, leveraging the strengths
of convolutional and Gated Recurrent Unit (GRU) layers. This approach is aimed
at e... | [
{
"created": "Sat, 20 Jul 2024 21:24:11 GMT",
"version": "v1"
}
] | 2024-07-23 | [
[
"Maddineni",
"Vinod Kumar",
""
],
[
"Koganti",
"Naga Babu",
""
],
[
"Damacharla",
"Praveen",
""
]
] | In this research, an effort is made to address microgrid systems' operational challenges, characterized by power oscillations that eventually contribute to grid instability. An integrated strategy is proposed, leveraging the strengths of convolutional and Gated Recurrent Unit (GRU) layers. This approach is aimed at eff... |
2303.11606 | Jingi Ju | Jingi Ju, Hyeoncheol Noh, Yooseung Wang, Minseok Seo, Dong-Geol Choi | CAFS: Class Adaptive Framework for Semi-Supervised Semantic Segmentation | 13 pages, 9 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Semi-supervised semantic segmentation learns a model for classifying pixels
into specific classes using a few labeled samples and numerous unlabeled
images. The recent leading approach is consistency regularization by
selftraining with pseudo-labeling pixels having high confidences for unlabeled
images. However, usin... | [
{
"created": "Tue, 21 Mar 2023 05:56:53 GMT",
"version": "v1"
}
] | 2023-03-22 | [
[
"Ju",
"Jingi",
""
],
[
"Noh",
"Hyeoncheol",
""
],
[
"Wang",
"Yooseung",
""
],
[
"Seo",
"Minseok",
""
],
[
"Choi",
"Dong-Geol",
""
]
] | Semi-supervised semantic segmentation learns a model for classifying pixels into specific classes using a few labeled samples and numerous unlabeled images. The recent leading approach is consistency regularization by selftraining with pseudo-labeling pixels having high confidences for unlabeled images. However, using ... |
2306.09792 | Haolin Li | Yuyang Miao, Haolin Li | GPINN: Physics-informed Neural Network with Graph Embedding | null | null | null | null | cs.LG cs.CE physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work proposes a Physics-informed Neural Network framework with Graph
Embedding (GPINN) to perform PINN in graph, i.e. topological space instead of
traditional Euclidean space, for improved problem-solving efficiency. The
method integrates topological data into the neural network's computations,
which significant... | [
{
"created": "Fri, 16 Jun 2023 12:03:39 GMT",
"version": "v1"
}
] | 2023-06-19 | [
[
"Miao",
"Yuyang",
""
],
[
"Li",
"Haolin",
""
]
] | This work proposes a Physics-informed Neural Network framework with Graph Embedding (GPINN) to perform PINN in graph, i.e. topological space instead of traditional Euclidean space, for improved problem-solving efficiency. The method integrates topological data into the neural network's computations, which significantly... |
2405.14909 | Shunnosuke Ikeda | Shunnosuke Ikeda, Naoki Nishimura and Shunji Umetani | Interpretable Price Bounds Estimation with Shape Constraints in Price
Optimization | null | null | null | null | cs.GT cs.AI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the interpretable estimation of price bounds within the
context of price optimization. In recent years, price optimization methods have
become indispensable for maximizing revenues and profits. However, effectively
applying these methods to real-world pricing operations remains a significant
chal... | [
{
"created": "Thu, 23 May 2024 10:30:16 GMT",
"version": "v1"
}
] | 2024-05-27 | [
[
"Ikeda",
"Shunnosuke",
""
],
[
"Nishimura",
"Naoki",
""
],
[
"Umetani",
"Shunji",
""
]
] | This paper addresses the interpretable estimation of price bounds within the context of price optimization. In recent years, price optimization methods have become indispensable for maximizing revenues and profits. However, effectively applying these methods to real-world pricing operations remains a significant challe... |
2108.07685 | Guiju Ping | Guiju Ping, Mahdi Abolfazli Esfahani, Han Wang | Visual Enhanced 3D Point Cloud Reconstruction from A Single Image | 8 pages | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Solving the challenging problem of 3D object reconstruction from a single
image appropriately gives existing technologies the ability to perform with a
single monocular camera rather than requiring depth sensors. In recent years,
thanks to the development of deep learning, 3D reconstruction of a single image
has demo... | [
{
"created": "Tue, 17 Aug 2021 15:31:35 GMT",
"version": "v1"
}
] | 2021-08-18 | [
[
"Ping",
"Guiju",
""
],
[
"Esfahani",
"Mahdi Abolfazli",
""
],
[
"Wang",
"Han",
""
]
] | Solving the challenging problem of 3D object reconstruction from a single image appropriately gives existing technologies the ability to perform with a single monocular camera rather than requiring depth sensors. In recent years, thanks to the development of deep learning, 3D reconstruction of a single image has demons... |
2102.04331 | Ali Karimi | Ali Karimi, Ramin Toosi, Mohammad Ali Akhaee | Soccer Event Detection Using Deep Learning | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Event detection is an important step in extracting knowledge from the video.
In this paper, we propose a deep learning approach to detect events in a soccer
match emphasizing the distinction between images of red and yellow cards and
the correct detection of the images of selected events from other images. This
metho... | [
{
"created": "Mon, 8 Feb 2021 16:37:47 GMT",
"version": "v1"
}
] | 2021-02-09 | [
[
"Karimi",
"Ali",
""
],
[
"Toosi",
"Ramin",
""
],
[
"Akhaee",
"Mohammad Ali",
""
]
] | Event detection is an important step in extracting knowledge from the video. In this paper, we propose a deep learning approach to detect events in a soccer match emphasizing the distinction between images of red and yellow cards and the correct detection of the images of selected events from other images. This method ... |
2109.01429 | Tom Gilat | Tom Gilat | Smooth Surfaces via Nets of Geodesics | Includes the theoretical work regarding Minimal Gaussian Curvature
Surface | null | null | null | cs.CG cs.NA math.NA | http://creativecommons.org/licenses/by/4.0/ | The goal of this study is to provide a method for computing the following:
Given a network of curves in 3d (satisfying a condition at the intersection
points), compute efficiently a smooth surface such that the curves are
geodesics on it. This work can serve as a base for engineers who wish to
implement computations ... | [
{
"created": "Fri, 3 Sep 2021 10:43:26 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Mar 2022 10:45:11 GMT",
"version": "v2"
},
{
"created": "Mon, 3 Jun 2024 08:04:31 GMT",
"version": "v3"
}
] | 2024-06-04 | [
[
"Gilat",
"Tom",
""
]
] | The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it. This work can serve as a base for engineers who wish to implement computations of... |
2203.08414 | Mark Hamilton | Mark Hamilton, Zhoutong Zhang, Bharath Hariharan, Noah Snavely,
William T. Freeman | Unsupervised Semantic Segmentation by Distilling Feature Correspondences | null | null | null | null | cs.CV cs.AI cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Unsupervised semantic segmentation aims to discover and localize semantically
meaningful categories within image corpora without any form of annotation. To
solve this task, algorithms must produce features for every pixel that are both
semantically meaningful and compact enough to form distinct clusters. Unlike
previ... | [
{
"created": "Wed, 16 Mar 2022 06:08:47 GMT",
"version": "v1"
}
] | 2022-03-17 | [
[
"Hamilton",
"Mark",
""
],
[
"Zhang",
"Zhoutong",
""
],
[
"Hariharan",
"Bharath",
""
],
[
"Snavely",
"Noah",
""
],
[
"Freeman",
"William T.",
""
]
] | Unsupervised semantic segmentation aims to discover and localize semantically meaningful categories within image corpora without any form of annotation. To solve this task, algorithms must produce features for every pixel that are both semantically meaningful and compact enough to form distinct clusters. Unlike previou... |
2305.14814 | Samuel Vaiter | Nicolas Keriven (CNRS, IRISA), Samuel Vaiter (CNRS, LJAD) | What functions can Graph Neural Networks compute on random graphs? The
role of Positional Encoding | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We aim to deepen the theoretical understanding of Graph Neural Networks
(GNNs) on large graphs, with a focus on their expressive power. Existing
analyses relate this notion to the graph isomorphism problem, which is mostly
relevant for graphs of small sizes, or studied graph classification or
regression tasks, while ... | [
{
"created": "Wed, 24 May 2023 07:09:53 GMT",
"version": "v1"
}
] | 2023-05-25 | [
[
"Keriven",
"Nicolas",
"",
"CNRS, IRISA"
],
[
"Vaiter",
"Samuel",
"",
"CNRS, LJAD"
]
] | We aim to deepen the theoretical understanding of Graph Neural Networks (GNNs) on large graphs, with a focus on their expressive power. Existing analyses relate this notion to the graph isomorphism problem, which is mostly relevant for graphs of small sizes, or studied graph classification or regression tasks, while pr... |
1102.4178 | Ivan Jureta | Ivan Jureta, Alexander Borgida, Neil A. Ernst | Mixed-Variable Requirements Roadmaps and their Role in the Requirements
Engineering of Adaptive Systems | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The requirements roadmap concept is introduced as a solution to the problem
of the requirements engineering of adaptive systems. The concept requires a new
general definition of the requirements problem which allows for quantitative
(numeric) variables, together with qualitative (binary boolean) propositional
variabl... | [
{
"created": "Mon, 21 Feb 2011 10:14:56 GMT",
"version": "v1"
}
] | 2015-03-19 | [
[
"Jureta",
"Ivan",
""
],
[
"Borgida",
"Alexander",
""
],
[
"Ernst",
"Neil A.",
""
]
] | The requirements roadmap concept is introduced as a solution to the problem of the requirements engineering of adaptive systems. The concept requires a new general definition of the requirements problem which allows for quantitative (numeric) variables, together with qualitative (binary boolean) propositional variables... |
1404.1695 | Serge Stinckwich | Congduc Pham, Fumitoshi Matsuno, Serge Stinckwich | Proceedings of Third Workshop on Robots and Sensors integration in
future rescue INformation system (ROSIN 2013) | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This is the proceedings of the third workshop on Robots and Sensors
integration in future rescue INformation system (ROSIN 2013)
| [
{
"created": "Mon, 7 Apr 2014 08:54:17 GMT",
"version": "v1"
}
] | 2014-04-08 | [
[
"Pham",
"Congduc",
""
],
[
"Matsuno",
"Fumitoshi",
""
],
[
"Stinckwich",
"Serge",
""
]
] | This is the proceedings of the third workshop on Robots and Sensors integration in future rescue INformation system (ROSIN 2013) |
1910.14648 | Howard H. Yang | Howard H. Yang, Ahmed Arafa, Tony Q. S. Quek, H. Vincent Poor | Age-Based Scheduling Policy for Federated Learning in Mobile Edge
Networks | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning (FL) is a machine learning model that preserves data
privacy in the training process. Specifically, FL brings the model directly to
the user equipments (UEs) for local training, where an edge server periodically
collects the trained parameters to produce an improved model and sends it back
to the U... | [
{
"created": "Thu, 31 Oct 2019 17:36:34 GMT",
"version": "v1"
}
] | 2019-11-01 | [
[
"Yang",
"Howard H.",
""
],
[
"Arafa",
"Ahmed",
""
],
[
"Quek",
"Tony Q. S.",
""
],
[
"Poor",
"H. Vincent",
""
]
] | Federated learning (FL) is a machine learning model that preserves data privacy in the training process. Specifically, FL brings the model directly to the user equipments (UEs) for local training, where an edge server periodically collects the trained parameters to produce an improved model and sends it back to the UEs... |
2208.13769 | Erik Faust | Erik Faust, Alexander Schl\"uter, Henning M\"uller, Ralf M\"uller | A Lattice Boltzmann Method for nonlinear solid mechanics in the
reference configuration | 13 pages, 9 figures. Submitted to Computer Methods in Applied
Mechanics and Engineering | Comput Mech (2023) | 10.1007/s00466-023-02369-w | null | cs.CE | http://creativecommons.org/licenses/by/4.0/ | With a sufficiently fine discretisation, the Lattice Boltzmann Method (LBM)
mimics a second order Crank-Nicolson scheme for certain types of balance laws
(Farag et al. [2021]). This allows the explicit, highly parallelisable LBM to
efficiently solve the fundamental equations of solid mechanics: the
conservation of ma... | [
{
"created": "Thu, 25 Aug 2022 14:49:32 GMT",
"version": "v1"
}
] | 2023-07-27 | [
[
"Faust",
"Erik",
""
],
[
"Schlüter",
"Alexander",
""
],
[
"Müller",
"Henning",
""
],
[
"Müller",
"Ralf",
""
]
] | With a sufficiently fine discretisation, the Lattice Boltzmann Method (LBM) mimics a second order Crank-Nicolson scheme for certain types of balance laws (Farag et al. [2021]). This allows the explicit, highly parallelisable LBM to efficiently solve the fundamental equations of solid mechanics: the conservation of mass... |
2404.04886 | Xingyu Su | Xingyu Su, Xiaojie Zhu, Yang Li, Yong Li, Chi Chen, Paulo
Esteves-Ver\'issimo | PagPassGPT: Pattern Guided Password Guessing via Generative Pretrained
Transformer | Be accepted by DSN 2024 | null | null | null | cs.CR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Amidst the surge in deep learning-based password guessing models, challenges
of generating high-quality passwords and reducing duplicate passwords persist.
To address these challenges, we present PagPassGPT, a password guessing model
constructed on Generative Pretrained Transformer (GPT). It can perform pattern
guide... | [
{
"created": "Sun, 7 Apr 2024 09:06:14 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Jun 2024 03:05:01 GMT",
"version": "v2"
}
] | 2024-06-19 | [
[
"Su",
"Xingyu",
""
],
[
"Zhu",
"Xiaojie",
""
],
[
"Li",
"Yang",
""
],
[
"Li",
"Yong",
""
],
[
"Chen",
"Chi",
""
],
[
"Esteves-Veríssimo",
"Paulo",
""
]
] | Amidst the surge in deep learning-based password guessing models, challenges of generating high-quality passwords and reducing duplicate passwords persist. To address these challenges, we present PagPassGPT, a password guessing model constructed on Generative Pretrained Transformer (GPT). It can perform pattern guided ... |
2403.12199 | Dhia Elhaq Rzig | Alaa Houerbi, Rahul Ghanshyam Chavan, Dhia Elhaq Rzig, Foyzul Hassan | Empirical Analysis on CI/CD Pipeline Evolution in Machine Learning
Projects | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The growing popularity of machine learning (ML) and the integration of ML
components with other software artifacts has led to the use of continuous
integration and delivery (CI/CD) tools, such as Travis CI, GitHub Actions, etc.
that enable faster integration and testing for ML projects. Such CI/CD
configurations and ... | [
{
"created": "Mon, 18 Mar 2024 19:14:38 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Mar 2024 18:43:54 GMT",
"version": "v2"
},
{
"created": "Thu, 4 Apr 2024 20:07:38 GMT",
"version": "v3"
}
] | 2024-04-08 | [
[
"Houerbi",
"Alaa",
""
],
[
"Chavan",
"Rahul Ghanshyam",
""
],
[
"Rzig",
"Dhia Elhaq",
""
],
[
"Hassan",
"Foyzul",
""
]
] | The growing popularity of machine learning (ML) and the integration of ML components with other software artifacts has led to the use of continuous integration and delivery (CI/CD) tools, such as Travis CI, GitHub Actions, etc. that enable faster integration and testing for ML projects. Such CI/CD configurations and se... |
2403.01003 | Shizhe Lin | Shizhe Lin, Ryan Zheng He Liu, Ladan Tahvildari | FlaKat: A Machine Learning-Based Categorization Framework for Flaky
Tests | null | null | null | null | cs.SE cs.AI | http://creativecommons.org/licenses/by/4.0/ | Flaky tests can pass or fail non-deterministically, without alterations to a
software system. Such tests are frequently encountered by developers and hinder
the credibility of test suites. State-of-the-art research incorporates machine
learning solutions into flaky test detection and achieves reasonably good
accuracy... | [
{
"created": "Fri, 1 Mar 2024 22:00:44 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Lin",
"Shizhe",
""
],
[
"Liu",
"Ryan Zheng He",
""
],
[
"Tahvildari",
"Ladan",
""
]
] | Flaky tests can pass or fail non-deterministically, without alterations to a software system. Such tests are frequently encountered by developers and hinder the credibility of test suites. State-of-the-art research incorporates machine learning solutions into flaky test detection and achieves reasonably good accuracy. ... |
2404.17871 | Xiaoyu Zhang | Xiaoyu Zhang, Weipeng Jiang, Chao Shen, Qi Li, Qian Wang, Chenhao Lin,
Xiaohong Guan | A Survey of Deep Learning Library Testing Methods | 34 pages, 8 figures, 4 tables | null | null | null | cs.SE cs.AI | http://creativecommons.org/licenses/by/4.0/ | In recent years, software systems powered by deep learning (DL) techniques
have significantly facilitated people's lives in many aspects. As the backbone
of these DL systems, various DL libraries undertake the underlying optimization
and computation. However, like traditional software, DL libraries are not
immune to ... | [
{
"created": "Sat, 27 Apr 2024 11:42:13 GMT",
"version": "v1"
}
] | 2024-04-30 | [
[
"Zhang",
"Xiaoyu",
""
],
[
"Jiang",
"Weipeng",
""
],
[
"Shen",
"Chao",
""
],
[
"Li",
"Qi",
""
],
[
"Wang",
"Qian",
""
],
[
"Lin",
"Chenhao",
""
],
[
"Guan",
"Xiaohong",
""
]
] | In recent years, software systems powered by deep learning (DL) techniques have significantly facilitated people's lives in many aspects. As the backbone of these DL systems, various DL libraries undertake the underlying optimization and computation. However, like traditional software, DL libraries are not immune to bu... |
2406.07657 | Lichang Chen | Lichang Chen, Jiuhai Chen, Chenxi Liu, John Kirchenbauer, Davit
Soselia, Chen Zhu, Tom Goldstein, Tianyi Zhou, Heng Huang | OPTune: Efficient Online Preference Tuning | 16 pages, 7 figures | null | null | null | cs.LG cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning with human feedback~(RLHF) is critical for aligning
Large Language Models (LLMs) with human preference. Compared to the widely
studied offline version of RLHF, \emph{e.g.} direct preference optimization
(DPO), recent works have shown that the online variants achieve even better
alignment. Howev... | [
{
"created": "Tue, 11 Jun 2024 18:55:04 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Chen",
"Lichang",
""
],
[
"Chen",
"Jiuhai",
""
],
[
"Liu",
"Chenxi",
""
],
[
"Kirchenbauer",
"John",
""
],
[
"Soselia",
"Davit",
""
],
[
"Zhu",
"Chen",
""
],
[
"Goldstein",
"Tom",
""
],
[
"Zhou",
... | Reinforcement learning with human feedback~(RLHF) is critical for aligning Large Language Models (LLMs) with human preference. Compared to the widely studied offline version of RLHF, \emph{e.g.} direct preference optimization (DPO), recent works have shown that the online variants achieve even better alignment. However... |
2308.14716 | Ephraim Linder | Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan | Local Lipschitz Filters for Bounded-Range Functions with Applications to
Arbitrary Real-Valued Functions | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study local filters for the Lipschitz property of real-valued functions
$f: V \to [0,r]$, where the Lipschitz property is defined with respect to an
arbitrary undirected graph $G=(V,E)$. We give nearly optimal local Lipschitz
filters both with respect to $\ell_1$-distance and $\ell_0$-distance. Previous
work only ... | [
{
"created": "Mon, 28 Aug 2023 17:16:37 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Nov 2023 17:42:00 GMT",
"version": "v2"
},
{
"created": "Fri, 3 May 2024 17:27:26 GMT",
"version": "v3"
}
] | 2024-05-06 | [
[
"Lange",
"Jane",
""
],
[
"Linder",
"Ephraim",
""
],
[
"Raskhodnikova",
"Sofya",
""
],
[
"Vasilyan",
"Arsen",
""
]
] | We study local filters for the Lipschitz property of real-valued functions $f: V \to [0,r]$, where the Lipschitz property is defined with respect to an arbitrary undirected graph $G=(V,E)$. We give nearly optimal local Lipschitz filters both with respect to $\ell_1$-distance and $\ell_0$-distance. Previous work only co... |
1508.03599 | Gauri Joshi | Gauri Joshi, Emina Soljanin, and Gregory Wornell | Efficient Redundancy Techniques for Latency Reduction in Cloud Systems | accepted for publication in ACM Transactions on Modeling and
Performance Evaluation of Computing Systems | null | null | null | cs.DC cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In cloud computing systems, assigning a task to multiple servers and waiting
for the earliest copy to finish is an effective method to combat the
variability in response time of individual servers, and reduce latency. But
adding redundancy may result in higher cost of computing resources, as well as
an increase in qu... | [
{
"created": "Fri, 14 Aug 2015 18:37:10 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Oct 2015 17:28:35 GMT",
"version": "v2"
},
{
"created": "Wed, 12 Apr 2017 14:13:34 GMT",
"version": "v3"
}
] | 2017-04-13 | [
[
"Joshi",
"Gauri",
""
],
[
"Soljanin",
"Emina",
""
],
[
"Wornell",
"Gregory",
""
]
] | In cloud computing systems, assigning a task to multiple servers and waiting for the earliest copy to finish is an effective method to combat the variability in response time of individual servers, and reduce latency. But adding redundancy may result in higher cost of computing resources, as well as an increase in queu... |
2305.03429 | Eduardo C. Garrido-Merch\'an | Eduardo C. Garrido-Merch\'an, Jos\'e Luis Arroyo-Barrig\"uete, Roberto
Gozalo-Brizuela | Simulating H.P. Lovecraft horror literature with the ChatGPT large
language model | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a novel approach to simulating H.P. Lovecraft's
horror literature using the ChatGPT large language model, specifically the
GPT-4 architecture. Our study aims to generate text that emulates Lovecraft's
unique writing style and themes, while also examining the effectiveness of
prompt engineeri... | [
{
"created": "Fri, 5 May 2023 11:03:03 GMT",
"version": "v1"
}
] | 2023-05-17 | [
[
"Garrido-Merchán",
"Eduardo C.",
""
],
[
"Arroyo-Barrigüete",
"José Luis",
""
],
[
"Gozalo-Brizuela",
"Roberto",
""
]
] | In this paper, we present a novel approach to simulating H.P. Lovecraft's horror literature using the ChatGPT large language model, specifically the GPT-4 architecture. Our study aims to generate text that emulates Lovecraft's unique writing style and themes, while also examining the effectiveness of prompt engineering... |
1205.1171 | Kevin Wortman | Jeffrey M. White and Kevin A. Wortman | Divide-and-Conquer 3D Convex Hulls on the GPU | 11 pages, 9 figures | null | null | null | cs.DC cs.CG | http://creativecommons.org/licenses/by/3.0/ | We describe a pure divide-and-conquer parallel algorithm for computing 3D
convex hulls. We implement that algorithm on GPU hardware, and find a
significant speedup over comparable CPU implementations.
| [
{
"created": "Sun, 6 May 2012 01:33:15 GMT",
"version": "v1"
}
] | 2012-05-08 | [
[
"White",
"Jeffrey M.",
""
],
[
"Wortman",
"Kevin A.",
""
]
] | We describe a pure divide-and-conquer parallel algorithm for computing 3D convex hulls. We implement that algorithm on GPU hardware, and find a significant speedup over comparable CPU implementations. |
1811.06321 | Mason A. Porter | Baichuan Yuan, Hao Li, Andrea L. Bertozzi, P. Jeffrey Brantingham, and
Mason A. Porter | Multivariate Spatiotemporal Hawkes Processes and Network Reconstruction | null | null | null | null | cs.SI eess.SP nlin.AO physics.soc-ph stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is often latent network structure in spatial and temporal data and the
tools of network analysis can yield fascinating insights into such data. In
this paper, we develop a nonparametric method for network reconstruction from
spatiotemporal data sets using multivariate Hawkes processes. In contrast to
prior work... | [
{
"created": "Thu, 15 Nov 2018 12:50:36 GMT",
"version": "v1"
}
] | 2018-11-16 | [
[
"Yuan",
"Baichuan",
""
],
[
"Li",
"Hao",
""
],
[
"Bertozzi",
"Andrea L.",
""
],
[
"Brantingham",
"P. Jeffrey",
""
],
[
"Porter",
"Mason A.",
""
]
] | There is often latent network structure in spatial and temporal data and the tools of network analysis can yield fascinating insights into such data. In this paper, we develop a nonparametric method for network reconstruction from spatiotemporal data sets using multivariate Hawkes processes. In contrast to prior work o... |
1406.3976 | Inari Listenmaa | Ramona Enache, Inari Listenmaa, Prasanth Kolachina | Handling non-compositionality in multilingual CNLs | CNL workshop in COLING 2014 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we describe methods for handling multilingual
non-compositional constructions in the framework of GF. We specifically look at
methods to detect and extract non-compositional phrases from parallel texts and
propose methods to handle such constructions in GF grammars. We expect that the
methods to handle... | [
{
"created": "Mon, 16 Jun 2014 11:30:51 GMT",
"version": "v1"
}
] | 2014-06-17 | [
[
"Enache",
"Ramona",
""
],
[
"Listenmaa",
"Inari",
""
],
[
"Kolachina",
"Prasanth",
""
]
] | In this paper, we describe methods for handling multilingual non-compositional constructions in the framework of GF. We specifically look at methods to detect and extract non-compositional phrases from parallel texts and propose methods to handle such constructions in GF grammars. We expect that the methods to handle n... |
0908.0099 | R Doomun | Azeez Nureni Ayofe, Osunade Oluwaseyifunmitan | Approach To Solving Cybercrime And Cybersecurity | 11 Pages, International Journal of Computer Science and Information
Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423 | International Journal of Computer Science and Information
Security, IJCSIS July 2009, Vol. 3, No. 1, USA | null | null | cs.CY cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cybercrime is becoming ever more serious. Findings from 2002 Computer Crime
and Security Survey show an upward trend that demonstrates a need for a timely
review of existing approaches to fighting this new phenomenon in the
information age. In this paper, we provide an overview of Cybercrime and
present an internatio... | [
{
"created": "Sat, 1 Aug 2009 20:33:56 GMT",
"version": "v1"
}
] | 2009-08-04 | [
[
"Ayofe",
"Azeez Nureni",
""
],
[
"Oluwaseyifunmitan",
"Osunade",
""
]
] | Cybercrime is becoming ever more serious. Findings from 2002 Computer Crime and Security Survey show an upward trend that demonstrates a need for a timely review of existing approaches to fighting this new phenomenon in the information age. In this paper, we provide an overview of Cybercrime and present an internationa... |
1306.6056 | Aria Nosratinia | Thuy Van Nguyen, Aria Nosratinia, and Dariush Divsalar | Rate-Compatible Protograph-based LDPC Codes for Inter-Symbol
Interference Channels | 4 pages, 5 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This letter produces a family of rate-compatible protograph-based LDPC codes
approaching the independent and uniformly distributed (i.u.d.) capacity of
inter-symbol interference (ISI) channels. This problem is highly nontrivial due
to the joint design of structured (protograph-based) LDPC codes and the state
structur... | [
{
"created": "Tue, 25 Jun 2013 18:36:32 GMT",
"version": "v1"
}
] | 2013-06-26 | [
[
"Van Nguyen",
"Thuy",
""
],
[
"Nosratinia",
"Aria",
""
],
[
"Divsalar",
"Dariush",
""
]
] | This letter produces a family of rate-compatible protograph-based LDPC codes approaching the independent and uniformly distributed (i.u.d.) capacity of inter-symbol interference (ISI) channels. This problem is highly nontrivial due to the joint design of structured (protograph-based) LDPC codes and the state structure ... |
1106.0304 | Jes\'us Pardillo | Jes\'us Pardillo and Jose-Norberto Maz\'on | Using Ontologies for the Design of Data Warehouses | 15 pages, 2 figures | International Journal of Database Management Systems (IJDMS),
Vol.3, No.2, May 2011 | 10.5121/ijdms.2011.3205 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Obtaining an implementation of a data warehouse is a complex task that forces
designers to acquire wide knowledge of the domain, thus requiring a high level
of expertise and becoming it a prone-to-fail task. Based on our experience, we
have detected a set of situations we have faced up with in real-world projects
in ... | [
{
"created": "Wed, 1 Jun 2011 20:01:00 GMT",
"version": "v1"
}
] | 2011-06-03 | [
[
"Pardillo",
"Jesús",
""
],
[
"Mazón",
"Jose-Norberto",
""
]
] | Obtaining an implementation of a data warehouse is a complex task that forces designers to acquire wide knowledge of the domain, thus requiring a high level of expertise and becoming it a prone-to-fail task. Based on our experience, we have detected a set of situations we have faced up with in real-world projects in wh... |
2202.10005 | El\'ias Javier Garc\'ia Claro | E. J. Garc\'ia-Claro and Ismael Guti\'errez | On Grid Codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generating functions for the size of a $r$-sphere, with respect to the
Manhattan distance in an $n$-dimensional grid, are used to provide explicit
formulas for the minimum and maximum size of an $r$-ball centered at a point of
the grid. This allows us to offer versions of the Hamming and Gilbert-Varshamov
bounds for ... | [
{
"created": "Mon, 21 Feb 2022 06:04:42 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Mar 2022 04:38:09 GMT",
"version": "v2"
},
{
"created": "Sun, 10 Jul 2022 07:23:58 GMT",
"version": "v3"
},
{
"created": "Sat, 6 May 2023 00:38:52 GMT",
"version": "v4"
},
{
"cr... | 2024-06-27 | [
[
"García-Claro",
"E. J.",
""
],
[
"Gutiérrez",
"Ismael",
""
]
] | Generating functions for the size of a $r$-sphere, with respect to the Manhattan distance in an $n$-dimensional grid, are used to provide explicit formulas for the minimum and maximum size of an $r$-ball centered at a point of the grid. This allows us to offer versions of the Hamming and Gilbert-Varshamov bounds for co... |
2307.00077 | Jiaying Wu | Jiaying Wu, Bryan Hooi | DECOR: Degree-Corrected Social Graph Refinement for Fake News Detection | Accepted to KDD 2023 (Research Track) | null | 10.1145/3580305.3599298 | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | Recent efforts in fake news detection have witnessed a surge of interest in
using graph neural networks (GNNs) to exploit rich social context. Existing
studies generally leverage fixed graph structures, assuming that the graphs
accurately represent the related social engagements. However, edge noise
remains a critica... | [
{
"created": "Fri, 30 Jun 2023 18:31:48 GMT",
"version": "v1"
}
] | 2023-07-04 | [
[
"Wu",
"Jiaying",
""
],
[
"Hooi",
"Bryan",
""
]
] | Recent efforts in fake news detection have witnessed a surge of interest in using graph neural networks (GNNs) to exploit rich social context. Existing studies generally leverage fixed graph structures, assuming that the graphs accurately represent the related social engagements. However, edge noise remains a critical ... |
cs/0405015 | Darran Nathan | Darran Nathan, Kelvin Lim Mun Kit, Kelly Choo Hon Min, Philip Wong Jit
Chin, Andreas Weisensee | A High-Level Reconfigurable Computing Platform Software Frameworks | 4 pages, 8 figures | null | null | null | cs.AR | null | Reconfigurable computing refers to the use of processors, such as Field
Programmable Gate Arrays (FPGAs), that can be modified at the hardware level to
take on different processing tasks. A reconfigurable computing platform
describes the hardware and software base on top of which modular extensions can
be created, de... | [
{
"created": "Wed, 5 May 2004 01:56:22 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Nathan",
"Darran",
""
],
[
"Kit",
"Kelvin Lim Mun",
""
],
[
"Min",
"Kelly Choo Hon",
""
],
[
"Chin",
"Philip Wong Jit",
""
],
[
"Weisensee",
"Andreas",
""
]
] | Reconfigurable computing refers to the use of processors, such as Field Programmable Gate Arrays (FPGAs), that can be modified at the hardware level to take on different processing tasks. A reconfigurable computing platform describes the hardware and software base on top of which modular extensions can be created, depe... |
1506.08307 | Antonios Argyriou | Antonios Argyriou, Alberto Caballero Breva, Marc Aoun | Optimizing Data Forwarding from Body Area Networks in the Presence of
Body Shadowing with Dual Wireless Technology Nodes | null | IEEE Transactions on Mobile Computing, Volume 14, No. 3, Pages
632-645, March 2015 | 10.1109/TMC.2014.2321768 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we are concerned with the problem of data forwarding from a
wireless body area network (WBAN) to a gateway when body shadowing affects the
ability of WBAN nodes to communicate with the gateway. To solve this problem we
present a new WBAN architecture that uses two communication technologies. One
network... | [
{
"created": "Sat, 27 Jun 2015 16:16:59 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Argyriou",
"Antonios",
""
],
[
"Breva",
"Alberto Caballero",
""
],
[
"Aoun",
"Marc",
""
]
] | In this paper we are concerned with the problem of data forwarding from a wireless body area network (WBAN) to a gateway when body shadowing affects the ability of WBAN nodes to communicate with the gateway. To solve this problem we present a new WBAN architecture that uses two communication technologies. One network i... |
1911.05932 | Yuan Liu | Yuan Liu, Zehong Shen, Zhixuan Lin, Sida Peng, Hujun Bao, Xiaowei Zhou | GIFT: Learning Transformation-Invariant Dense Visual Descriptors via
Group CNNs | Accepted by NeurIPS 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Finding local correspondences between images with different viewpoints
requires local descriptors that are robust against geometric transformations.
An approach for transformation invariance is to integrate out the
transformations by pooling the features extracted from transformed versions of
an image. However, the f... | [
{
"created": "Thu, 14 Nov 2019 04:20:57 GMT",
"version": "v1"
}
] | 2019-11-15 | [
[
"Liu",
"Yuan",
""
],
[
"Shen",
"Zehong",
""
],
[
"Lin",
"Zhixuan",
""
],
[
"Peng",
"Sida",
""
],
[
"Bao",
"Hujun",
""
],
[
"Zhou",
"Xiaowei",
""
]
] | Finding local correspondences between images with different viewpoints requires local descriptors that are robust against geometric transformations. An approach for transformation invariance is to integrate out the transformations by pooling the features extracted from transformed versions of an image. However, the fea... |
2109.02303 | Zhengjia Li | Ziniu Wan, Zhengjia Li, Maoqing Tian, Jianbo Liu, Shuai Yi, Hongsheng
Li | Encoder-decoder with Multi-level Attention for 3D Human Shape and Pose
Estimation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 3D human shape and pose estimation is the essential task for human motion
analysis, which is widely used in many 3D applications. However, existing
methods cannot simultaneously capture the relations at multiple levels,
including spatial-temporal level and human joint level. Therefore they fail to
make accurate predi... | [
{
"created": "Mon, 6 Sep 2021 09:06:17 GMT",
"version": "v1"
}
] | 2021-09-07 | [
[
"Wan",
"Ziniu",
""
],
[
"Li",
"Zhengjia",
""
],
[
"Tian",
"Maoqing",
""
],
[
"Liu",
"Jianbo",
""
],
[
"Yi",
"Shuai",
""
],
[
"Li",
"Hongsheng",
""
]
] | 3D human shape and pose estimation is the essential task for human motion analysis, which is widely used in many 3D applications. However, existing methods cannot simultaneously capture the relations at multiple levels, including spatial-temporal level and human joint level. Therefore they fail to make accurate predict... |
1306.4534 | Antonio Lima | Antonio Lima, Manlio De Domenico, Veljko Pejovic, Mirco Musolesi | Exploiting Cellular Data for Disease Containment and Information
Campaigns Strategies in Country-Wide Epidemics | 9 pages, 9 figures. Appeared in Proceedings of NetMob 2013. Boston,
MA, USA. May 2013 | null | null | School of Computer Science University of Birmingham Technical Report
CSR-13-01 | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human mobility is one of the key factors at the basis of the spreading of
diseases in a population. Containment strategies are usually devised on
movement scenarios based on coarse-grained assumptions. Mobility phone data
provide a unique opportunity for building models and defining strategies based
on very precise i... | [
{
"created": "Wed, 19 Jun 2013 13:22:11 GMT",
"version": "v1"
}
] | 2013-06-20 | [
[
"Lima",
"Antonio",
""
],
[
"De Domenico",
"Manlio",
""
],
[
"Pejovic",
"Veljko",
""
],
[
"Musolesi",
"Mirco",
""
]
] | Human mobility is one of the key factors at the basis of the spreading of diseases in a population. Containment strategies are usually devised on movement scenarios based on coarse-grained assumptions. Mobility phone data provide a unique opportunity for building models and defining strategies based on very precise inf... |
2010.06037 | Mart\'in Mu\~noz | Mart\'in Mu\~noz and Cristian Riveros | Streaming enumeration on nested documents | 39 pages | null | null | null | cs.DB cs.DS cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Some of the most relevant document schemas used online, such as XML and JSON,
have a nested format. In the last decade, the task of extracting data from
nested documents over streams has become especially relevant. We focus on the
streaming evaluation of queries with outputs of varied sizes over nested
documents. We ... | [
{
"created": "Mon, 12 Oct 2020 21:26:31 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Dec 2021 14:28:38 GMT",
"version": "v2"
},
{
"created": "Fri, 7 Jan 2022 20:01:30 GMT",
"version": "v3"
}
] | 2022-01-11 | [
[
"Muñoz",
"Martín",
""
],
[
"Riveros",
"Cristian",
""
]
] | Some of the most relevant document schemas used online, such as XML and JSON, have a nested format. In the last decade, the task of extracting data from nested documents over streams has become especially relevant. We focus on the streaming evaluation of queries with outputs of varied sizes over nested documents. We mo... |
2405.00204 | Robert Vacareanu | Robert Vacareanu, Anurag Pratik, Evangelia Spiliopoulou, Zheng Qi,
Giovanni Paolini, Neha Anna John, Jie Ma, Yassine Benajiba, Miguel
Ballesteros | General Purpose Verification for Chain of Thought Prompting | 22 pages, preprint | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Many of the recent capabilities demonstrated by Large Language Models (LLMs)
arise primarily from their ability to exploit contextual information. In this
paper, we explore ways to improve reasoning capabilities of LLMs through (1)
exploration of different chains of thought and (2) validation of the individual
steps ... | [
{
"created": "Tue, 30 Apr 2024 21:15:17 GMT",
"version": "v1"
}
] | 2024-05-02 | [
[
"Vacareanu",
"Robert",
""
],
[
"Pratik",
"Anurag",
""
],
[
"Spiliopoulou",
"Evangelia",
""
],
[
"Qi",
"Zheng",
""
],
[
"Paolini",
"Giovanni",
""
],
[
"John",
"Neha Anna",
""
],
[
"Ma",
"Jie",
""
],
[
... | Many of the recent capabilities demonstrated by Large Language Models (LLMs) arise primarily from their ability to exploit contextual information. In this paper, we explore ways to improve reasoning capabilities of LLMs through (1) exploration of different chains of thought and (2) validation of the individual steps of... |
2109.10217 | Gillis Hermans | Gillis Hermans, Thomas Winters, Luc De Raedt | Shape Inference and Grammar Induction for Example-based Procedural
Generation | null | International Conference on Computational Creativity 12 (2021)
342-349 | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Designers increasingly rely on procedural generation for automatic generation
of content in various industries. These techniques require extensive knowledge
of the desired content, and about how to actually implement such procedural
methods. Algorithms for learning interpretable generative models from example
content... | [
{
"created": "Tue, 21 Sep 2021 14:41:56 GMT",
"version": "v1"
}
] | 2021-09-22 | [
[
"Hermans",
"Gillis",
""
],
[
"Winters",
"Thomas",
""
],
[
"De Raedt",
"Luc",
""
]
] | Designers increasingly rely on procedural generation for automatic generation of content in various industries. These techniques require extensive knowledge of the desired content, and about how to actually implement such procedural methods. Algorithms for learning interpretable generative models from example content c... |
2305.19713 | Zhouxing Shi | Zhouxing Shi, Yihan Wang, Fan Yin, Xiangning Chen, Kai-Wei Chang,
Cho-Jui Hsieh | Red Teaming Language Model Detectors with Language Models | Preprint. Accepted by TACL | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | The prevalence and strong capability of large language models (LLMs) present
significant safety and ethical risks if exploited by malicious users. To
prevent the potentially deceptive usage of LLMs, recent works have proposed
algorithms to detect LLM-generated text and protect LLMs. In this paper, we
investigate the ... | [
{
"created": "Wed, 31 May 2023 10:08:37 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Oct 2023 05:56:52 GMT",
"version": "v2"
}
] | 2023-10-20 | [
[
"Shi",
"Zhouxing",
""
],
[
"Wang",
"Yihan",
""
],
[
"Yin",
"Fan",
""
],
[
"Chen",
"Xiangning",
""
],
[
"Chang",
"Kai-Wei",
""
],
[
"Hsieh",
"Cho-Jui",
""
]
] | The prevalence and strong capability of large language models (LLMs) present significant safety and ethical risks if exploited by malicious users. To prevent the potentially deceptive usage of LLMs, recent works have proposed algorithms to detect LLM-generated text and protect LLMs. In this paper, we investigate the ro... |
1707.05852 | Yaakov Oshman | Nitai Stein and Yaakov Oshman | Double-Opportunity Estimation via Altruism | 21 pages, 5 figures. This version has been accepted for publication
in the IEEE Transactions on Aerospace and Electronic Systems | null | 10.1109/TAES.2022.3203687 | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A novel approach, based on the notion of altruism, is presented to
cooperative parameter estimation in a system comprising two information-sharing
agents. The underlying assumption is that the overall two-agent scheme can
reach desired performance level even if only one of the agents performs
satisfactorily, hence th... | [
{
"created": "Tue, 18 Jul 2017 20:44:25 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Jan 2022 21:37:11 GMT",
"version": "v2"
},
{
"created": "Wed, 31 Aug 2022 07:56:52 GMT",
"version": "v3"
}
] | 2022-09-27 | [
[
"Stein",
"Nitai",
""
],
[
"Oshman",
"Yaakov",
""
]
] | A novel approach, based on the notion of altruism, is presented to cooperative parameter estimation in a system comprising two information-sharing agents. The underlying assumption is that the overall two-agent scheme can reach desired performance level even if only one of the agents performs satisfactorily, hence ther... |
2311.00144 | Jiaqi Wang | Xi Li, Songhe Wang, Chen Wu, Hao Zhou, Jiaqi Wang | Backdoor Threats from Compromised Foundation Models to Federated
Learning | This paper has been accepted by FL@FM-NeurIPS 23 (International
Workshop on Federated Learning in the Age of Foundation Models in Conjunction
with NeurIPS 2023). The corresponding author is Jiaqi Wang (jqwang@psu.edu) | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Federated learning (FL) represents a novel paradigm to machine learning,
addressing critical issues related to data privacy and security, yet suffering
from data insufficiency and imbalance. The emergence of foundation models (FMs)
provides a promising solution to the problems with FL. For instance, FMs could
serve a... | [
{
"created": "Tue, 31 Oct 2023 20:39:54 GMT",
"version": "v1"
}
] | 2023-11-02 | [
[
"Li",
"Xi",
""
],
[
"Wang",
"Songhe",
""
],
[
"Wu",
"Chen",
""
],
[
"Zhou",
"Hao",
""
],
[
"Wang",
"Jiaqi",
""
]
] | Federated learning (FL) represents a novel paradigm to machine learning, addressing critical issues related to data privacy and security, yet suffering from data insufficiency and imbalance. The emergence of foundation models (FMs) provides a promising solution to the problems with FL. For instance, FMs could serve as ... |
0906.1763 | Behnood Gholami | Behnood Gholami (1), Allen R. Tannenbaum (2 and 3) and Wassim M.
Haddad (1) ((1) School of Aerospace Engineering, Georgia Institute of
Technology (2) School of Electrical & Computer Engineering, Georgia Institute
of Technology, (3) Department of Biomedical Engineering, Georgia Institute of
Technology) | Segmentation of Facial Expressions Using Semi-Definite Programming and
Generalized Principal Component Analysis | Corrected for typos and spacing errors | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we use semi-definite programming and generalized principal
component analysis (GPCA) to distinguish between two or more different facial
expressions. In the first step, semi-definite programming is used to reduce the
dimension of the image data and "unfold" the manifold which the data points
(correspon... | [
{
"created": "Tue, 9 Jun 2009 19:50:10 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Jun 2009 20:53:21 GMT",
"version": "v2"
}
] | 2009-06-10 | [
[
"Gholami",
"Behnood",
"",
"2 and 3"
],
[
"Tannenbaum",
"Allen R.",
"",
"2 and 3"
],
[
"Haddad",
"Wassim M.",
""
]
] | In this paper, we use semi-definite programming and generalized principal component analysis (GPCA) to distinguish between two or more different facial expressions. In the first step, semi-definite programming is used to reduce the dimension of the image data and "unfold" the manifold which the data points (correspondi... |
2311.12440 | Mozhgan Pourmoradnasseri | Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Sadok Ben Yahia, Amnir
Hadachi | A Random Walk Approach for Simulation-Based Continuous Dynamic Traffic
Assignment | null | null | null | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new simulation-based approach to address the stochastic
Dynamic Traffic Assignment (DTA) problem, focusing on large congested networks
and dynamic settings. The proposed methodology incorporates a random walk model
inspired by the theoretical concept of the \textit{equivalent impedance}
method, ... | [
{
"created": "Tue, 21 Nov 2023 08:54:05 GMT",
"version": "v1"
}
] | 2023-11-22 | [
[
"Khoshkhah",
"Kaveh",
""
],
[
"Pourmoradnasseri",
"Mozhgan",
""
],
[
"Yahia",
"Sadok Ben",
""
],
[
"Hadachi",
"Amnir",
""
]
] | This paper presents a new simulation-based approach to address the stochastic Dynamic Traffic Assignment (DTA) problem, focusing on large congested networks and dynamic settings. The proposed methodology incorporates a random walk model inspired by the theoretical concept of the \textit{equivalent impedance} method, sp... |
2302.11180 | Minghai Qin | Minghai Qin, Chao Sun, Jaco Hofmann, Dejan Vucinic | DISCO: Distributed Inference with Sparse Communications | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Deep neural networks (DNNs) have great potential to solve many real-world
problems, but they usually require an extensive amount of computation and
memory. It is of great difficulty to deploy a large DNN model to a single
resource-limited device with small memory capacity. Distributed computing is a
common approach t... | [
{
"created": "Wed, 22 Feb 2023 07:20:34 GMT",
"version": "v1"
}
] | 2023-02-23 | [
[
"Qin",
"Minghai",
""
],
[
"Sun",
"Chao",
""
],
[
"Hofmann",
"Jaco",
""
],
[
"Vucinic",
"Dejan",
""
]
] | Deep neural networks (DNNs) have great potential to solve many real-world problems, but they usually require an extensive amount of computation and memory. It is of great difficulty to deploy a large DNN model to a single resource-limited device with small memory capacity. Distributed computing is a common approach to ... |
2302.12963 | An Chen | An Chen, Zhigang Ren, Muyi Wang, Hui Chen, Haoxi Leng, Shuai Liu | A Surrogate-Assisted Highly Cooperative Coevolutionary Algorithm for
Hyperparameter Optimization in Deep Convolutional Neural Network | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional neural networks (CNNs) have gained remarkable success in recent
years. However, their performance highly relies on the architecture
hyperparameters, and finding proper hyperparameters for a deep CNN is a
challenging optimization problem owing to its high-dimensional and
computationally expensive charact... | [
{
"created": "Sat, 25 Feb 2023 02:50:58 GMT",
"version": "v1"
}
] | 2023-02-28 | [
[
"Chen",
"An",
""
],
[
"Ren",
"Zhigang",
""
],
[
"Wang",
"Muyi",
""
],
[
"Chen",
"Hui",
""
],
[
"Leng",
"Haoxi",
""
],
[
"Liu",
"Shuai",
""
]
] | Convolutional neural networks (CNNs) have gained remarkable success in recent years. However, their performance highly relies on the architecture hyperparameters, and finding proper hyperparameters for a deep CNN is a challenging optimization problem owing to its high-dimensional and computationally expensive character... |
1109.6276 | Sriram Vishwanath | Fabio Fernandes, Sriram Vishwanath | Lattices for Physical-layer Secrecy: A Computational Perspective | accepted to the Physical Layer Secrecy Workshop at ICC 2011 | null | null | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we use the hardness of quantization over general lattices as
the basis of developing a physical layer secrecy system. Assuming that the
channel state observed by the legitimate receiver and the eavesdropper are
distinct, this asymmetry is used to develop a cryptosystem that resembles the
McEliece crypt... | [
{
"created": "Wed, 28 Sep 2011 17:26:21 GMT",
"version": "v1"
}
] | 2011-09-29 | [
[
"Fernandes",
"Fabio",
""
],
[
"Vishwanath",
"Sriram",
""
]
] | In this paper, we use the hardness of quantization over general lattices as the basis of developing a physical layer secrecy system. Assuming that the channel state observed by the legitimate receiver and the eavesdropper are distinct, this asymmetry is used to develop a cryptosystem that resembles the McEliece cryptos... |
2203.00655 | Vanessa Rodrigues Coelho Leite | Vanessa R. C. Leite, Zhe Su, Adrian M. Whatley, Giacomo Indiveri | A hardware-software co-design approach to minimize the use of memory
resources in multi-core neuromorphic processors | null | null | null | null | cs.NE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Both in electronics and biology, physical implementations of neural networks
have severe energy and memory constraints. We propose a hardware-software
co-design approach for minimizing the use of memory resources in multi-core
neuromorphic processors, by taking inspiration from biological neural networks.
We use this... | [
{
"created": "Tue, 1 Mar 2022 17:59:55 GMT",
"version": "v1"
}
] | 2022-03-02 | [
[
"Leite",
"Vanessa R. C.",
""
],
[
"Su",
"Zhe",
""
],
[
"Whatley",
"Adrian M.",
""
],
[
"Indiveri",
"Giacomo",
""
]
] | Both in electronics and biology, physical implementations of neural networks have severe energy and memory constraints. We propose a hardware-software co-design approach for minimizing the use of memory resources in multi-core neuromorphic processors, by taking inspiration from biological neural networks. We use this a... |
2102.00883 | Eduardo Gallo | Eduardo Gallo | Stochastic High Fidelity Simulation and Scenarios for Testing of Fixed
Wing Autonomous GNSS-Denied Navigation Algorithms | 25 pages, 17 figures | null | null | null | cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by-sa/4.0/ | Autonomous unmanned aerial vehicle (UAV) inertial navigation exhibits an
extreme dependency on the availability of global navigation satellite systems
(GNSS) signals, without which it incurs in a slow but unavoidable position
drift that may ultimately lead to the loss of the platform if the GNSS signals
are not resto... | [
{
"created": "Mon, 1 Feb 2021 14:46:01 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Feb 2021 10:10:35 GMT",
"version": "v2"
},
{
"created": "Wed, 1 Dec 2021 14:24:29 GMT",
"version": "v3"
}
] | 2021-12-02 | [
[
"Gallo",
"Eduardo",
""
]
] | Autonomous unmanned aerial vehicle (UAV) inertial navigation exhibits an extreme dependency on the availability of global navigation satellite systems (GNSS) signals, without which it incurs in a slow but unavoidable position drift that may ultimately lead to the loss of the platform if the GNSS signals are not restore... |
2101.10163 | Weiwei Wan | Mohamed Raessa, Weiwei Wan, and Kensuke Harada | Planning to Repose Long and Heavy Objects Considering a Combination of
Regrasp and Constrained Drooping | null | null | 10.1108/AA-01-2021-0008 | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | This paper presents a hierarchical motion planner for planning the
manipulation motion to repose long and heavy objects considering external
support surfaces. The planner includes a task level layer and a motion level
layer. We formulate the manipulation planning problem at the task level by
considering grasp poses a... | [
{
"created": "Mon, 25 Jan 2021 15:23:05 GMT",
"version": "v1"
}
] | 2021-08-10 | [
[
"Raessa",
"Mohamed",
""
],
[
"Wan",
"Weiwei",
""
],
[
"Harada",
"Kensuke",
""
]
] | This paper presents a hierarchical motion planner for planning the manipulation motion to repose long and heavy objects considering external support surfaces. The planner includes a task level layer and a motion level layer. We formulate the manipulation planning problem at the task level by considering grasp poses as ... |
2310.17688 | Jan Markus Brauner | Yoshua Bengio, Geoffrey Hinton, Andrew Yao, Dawn Song, Pieter Abbeel,
Trevor Darrell, Yuval Noah Harari, Ya-Qin Zhang, Lan Xue, Shai
Shalev-Shwartz, Gillian Hadfield, Jeff Clune, Tegan Maharaj, Frank Hutter,
At{\i}l{\i}m G\"une\c{s} Baydin, Sheila McIlraith, Qiqi Gao, Ashwin Acharya,
David Krueger, Anca Dragan,... | Managing extreme AI risks amid rapid progress | Published in Science:
https://www.science.org/doi/10.1126/science.adn0117 | null | 10.1126/science.adn0117 | null | cs.CY cs.AI cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Artificial Intelligence (AI) is progressing rapidly, and companies are
shifting their focus to developing generalist AI systems that can autonomously
act and pursue goals. Increases in capabilities and autonomy may soon massively
amplify AI's impact, with risks that include large-scale social harms,
malicious uses, a... | [
{
"created": "Thu, 26 Oct 2023 17:59:06 GMT",
"version": "v1"
},
{
"created": "Sun, 12 Nov 2023 14:33:20 GMT",
"version": "v2"
},
{
"created": "Wed, 22 May 2024 16:19:38 GMT",
"version": "v3"
}
] | 2024-05-24 | [
[
"Bengio",
"Yoshua",
""
],
[
"Hinton",
"Geoffrey",
""
],
[
"Yao",
"Andrew",
""
],
[
"Song",
"Dawn",
""
],
[
"Abbeel",
"Pieter",
""
],
[
"Darrell",
"Trevor",
""
],
[
"Harari",
"Yuval Noah",
""
],
[
"Z... | Artificial Intelligence (AI) is progressing rapidly, and companies are shifting their focus to developing generalist AI systems that can autonomously act and pursue goals. Increases in capabilities and autonomy may soon massively amplify AI's impact, with risks that include large-scale social harms, malicious uses, and... |
2401.06323 | Marcus Abate | Marcus Abate, Yun Chang, Nathan Hughes, Luca Carlone | Kimera2: Robust and Accurate Metric-Semantic SLAM in the Real World | Presented at ISER 2023 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present improvements to Kimera, an open-source metric-semantic
visual-inertial SLAM library. In particular, we enhance Kimera-VIO, the
visual-inertial odometry pipeline powering Kimera, to support better feature
tracking, more efficient keyframe selection, and various input modalities (eg
monocular, stereo, and RG... | [
{
"created": "Fri, 12 Jan 2024 02:25:04 GMT",
"version": "v1"
}
] | 2024-01-15 | [
[
"Abate",
"Marcus",
""
],
[
"Chang",
"Yun",
""
],
[
"Hughes",
"Nathan",
""
],
[
"Carlone",
"Luca",
""
]
] | We present improvements to Kimera, an open-source metric-semantic visual-inertial SLAM library. In particular, we enhance Kimera-VIO, the visual-inertial odometry pipeline powering Kimera, to support better feature tracking, more efficient keyframe selection, and various input modalities (eg monocular, stereo, and RGB-... |
2404.14066 | Xuzheng Yu | Xuzheng Yu, Chen Jiang, Xingning Dong, Tian Gan, Ming Yang, Qingpei
Guo | SHE-Net: Syntax-Hierarchy-Enhanced Text-Video Retrieval | null | null | null | null | cs.CV cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The user base of short video apps has experienced unprecedented growth in
recent years, resulting in a significant demand for video content analysis. In
particular, text-video retrieval, which aims to find the top matching videos
given text descriptions from a vast video corpus, is an essential function, the
primary ... | [
{
"created": "Mon, 22 Apr 2024 10:23:59 GMT",
"version": "v1"
},
{
"created": "Mon, 6 May 2024 13:41:44 GMT",
"version": "v2"
}
] | 2024-05-07 | [
[
"Yu",
"Xuzheng",
""
],
[
"Jiang",
"Chen",
""
],
[
"Dong",
"Xingning",
""
],
[
"Gan",
"Tian",
""
],
[
"Yang",
"Ming",
""
],
[
"Guo",
"Qingpei",
""
]
] | The user base of short video apps has experienced unprecedented growth in recent years, resulting in a significant demand for video content analysis. In particular, text-video retrieval, which aims to find the top matching videos given text descriptions from a vast video corpus, is an essential function, the primary ch... |
2311.01870 | Jinrui Yang | Jinrui Yang, Timothy Baldwin, Trevor Cohn | Multi-EuP: The Multilingual European Parliament Dataset for Analysis of
Bias in Information Retrieval | Accepted at The 3rd Multilingual Representation Learning (MRL)
Workshop (co-located with EMNLP 2023) | https://aclanthology.org/2023.mrl-1.21 | 10.18653/v1/2023.mrl-1.21 | null | cs.CL cs.AI cs.IR | http://creativecommons.org/licenses/by/4.0/ | We present Multi-EuP, a new multilingual benchmark dataset, comprising 22K
multi-lingual documents collected from the European Parliament, spanning 24
languages. This dataset is designed to investigate fairness in a multilingual
information retrieval (IR) context to analyze both language and demographic
bias in a ran... | [
{
"created": "Fri, 3 Nov 2023 12:29:11 GMT",
"version": "v1"
}
] | 2024-02-13 | [
[
"Yang",
"Jinrui",
""
],
[
"Baldwin",
"Timothy",
""
],
[
"Cohn",
"Trevor",
""
]
] | We present Multi-EuP, a new multilingual benchmark dataset, comprising 22K multi-lingual documents collected from the European Parliament, spanning 24 languages. This dataset is designed to investigate fairness in a multilingual information retrieval (IR) context to analyze both language and demographic bias in a ranki... |
2210.16535 | Luca Castri | Luca Castri, Sariah Mghames, Marc Hanheide, Nicola Bellotto | Causal Discovery of Dynamic Models for Predicting Human Spatial
Interactions | Published at 2022 International Conference on Social Robotics (ICSR) | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Exploiting robots for activities in human-shared environments, whether
warehouses, shopping centres or hospitals, calls for such robots to understand
the underlying physical interactions between nearby agents and objects. In
particular, modelling cause-and-effect relations between the latter can help to
predict unobs... | [
{
"created": "Sat, 29 Oct 2022 08:56:48 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Feb 2023 18:56:32 GMT",
"version": "v2"
}
] | 2023-02-21 | [
[
"Castri",
"Luca",
""
],
[
"Mghames",
"Sariah",
""
],
[
"Hanheide",
"Marc",
""
],
[
"Bellotto",
"Nicola",
""
]
] | Exploiting robots for activities in human-shared environments, whether warehouses, shopping centres or hospitals, calls for such robots to understand the underlying physical interactions between nearby agents and objects. In particular, modelling cause-and-effect relations between the latter can help to predict unobser... |
2112.00494 | Oskar Skibski | Oskar Skibski | Closeness Centrality via the Condorcet Principle | null | null | null | null | cs.SI cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We uncover a new relation between Closeness centrality and the Condorcet
principle. We define a Condorcet winner in a graph as a node that compared to
any other node is closer to more nodes. In other words, if we assume that nodes
vote on a closer candidate, a Condorcet winner would win a two-candidate
election again... | [
{
"created": "Wed, 1 Dec 2021 13:44:14 GMT",
"version": "v1"
}
] | 2021-12-02 | [
[
"Skibski",
"Oskar",
""
]
] | We uncover a new relation between Closeness centrality and the Condorcet principle. We define a Condorcet winner in a graph as a node that compared to any other node is closer to more nodes. In other words, if we assume that nodes vote on a closer candidate, a Condorcet winner would win a two-candidate election against... |
2308.10631 | Ioan-Adrian Cosma Mr. | Adrian Cosma, Emilian Radoi | PsyMo: A Dataset for Estimating Self-Reported Psychological Traits from
Gait | Accepted at 2024 IEEE/CVF Winter Conference on Applications of
Computer Vision (WACV) | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Psychological trait estimation from external factors such as movement and
appearance is a challenging and long-standing problem in psychology, and is
principally based on the psychological theory of embodiment. To date, attempts
to tackle this problem have utilized private small-scale datasets with
intrusive body-att... | [
{
"created": "Mon, 21 Aug 2023 11:06:43 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Oct 2023 09:49:46 GMT",
"version": "v2"
},
{
"created": "Wed, 22 Nov 2023 09:53:36 GMT",
"version": "v3"
}
] | 2023-11-23 | [
[
"Cosma",
"Adrian",
""
],
[
"Radoi",
"Emilian",
""
]
] | Psychological trait estimation from external factors such as movement and appearance is a challenging and long-standing problem in psychology, and is principally based on the psychological theory of embodiment. To date, attempts to tackle this problem have utilized private small-scale datasets with intrusive body-attac... |
1708.01348 | Bowei Chen | Bowei Chen, Jingmin Huang, Yufei Huang, Stefanos Kollias and Shigang
Yue | Combining guaranteed and spot markets in display advertising: Selling
guaranteed page views with stochastic demand | null | European Journal of Operational Research, 280(3):1144-1159, 2020 | 10.1016/j.ejor.2019.07.067 | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While page views are often sold instantly through real-time auctions when
users visit websites, they can also be sold in advance via guaranteed
contracts. In this paper, we present a dynamic programming model to study how
an online publisher should optimally allocate and price page views between
guaranteed and spot m... | [
{
"created": "Fri, 4 Aug 2017 01:32:42 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Nov 2017 00:01:46 GMT",
"version": "v2"
},
{
"created": "Mon, 31 Dec 2018 16:20:41 GMT",
"version": "v3"
},
{
"created": "Mon, 29 Apr 2019 20:20:54 GMT",
"version": "v4"
},
{
"cre... | 2019-12-12 | [
[
"Chen",
"Bowei",
""
],
[
"Huang",
"Jingmin",
""
],
[
"Huang",
"Yufei",
""
],
[
"Kollias",
"Stefanos",
""
],
[
"Yue",
"Shigang",
""
]
] | While page views are often sold instantly through real-time auctions when users visit websites, they can also be sold in advance via guaranteed contracts. In this paper, we present a dynamic programming model to study how an online publisher should optimally allocate and price page views between guaranteed and spot mar... |
2209.02522 | Mickael Cormier | Andreas Specker, Mickael Cormier, J\"urgen Beyerer | UPAR: Unified Pedestrian Attribute Recognition and Person Retrieval | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recognizing soft-biometric pedestrian attributes is essential in video
surveillance and fashion retrieval. Recent works show promising results on
single datasets. Nevertheless, the generalization ability of these methods
under different attribute distributions, viewpoints, varying illumination, and
low resolutions re... | [
{
"created": "Tue, 6 Sep 2022 14:20:56 GMT",
"version": "v1"
}
] | 2022-09-07 | [
[
"Specker",
"Andreas",
""
],
[
"Cormier",
"Mickael",
""
],
[
"Beyerer",
"Jürgen",
""
]
] | Recognizing soft-biometric pedestrian attributes is essential in video surveillance and fashion retrieval. Recent works show promising results on single datasets. Nevertheless, the generalization ability of these methods under different attribute distributions, viewpoints, varying illumination, and low resolutions rema... |
1801.02134 | Somayeh Kafaie | Somayeh Kafaie, Yuanzhu Chen, Mohamed Hossam Ahmed, Octavia A. Dobre | FlexONC: Joint Cooperative Forwarding and Network Coding with Precise
Encoding Conditions | 15 pages, 27 figures | IEEE Transactions on Vehicular Technology, Vol. 66, No. 8, pp.
7262-7277, Aug. 2017 | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, network coding has emerged as an innovative method that
helps a wireless network approach its maximum capacity, by combining multiple
unicasts in one broadcast. However, the majority of research conducted in this
area is yet to fully utilize the broadcasting nature of wireless networks, and
still ass... | [
{
"created": "Sun, 7 Jan 2018 05:28:09 GMT",
"version": "v1"
}
] | 2018-01-09 | [
[
"Kafaie",
"Somayeh",
""
],
[
"Chen",
"Yuanzhu",
""
],
[
"Ahmed",
"Mohamed Hossam",
""
],
[
"Dobre",
"Octavia A.",
""
]
] | In recent years, network coding has emerged as an innovative method that helps a wireless network approach its maximum capacity, by combining multiple unicasts in one broadcast. However, the majority of research conducted in this area is yet to fully utilize the broadcasting nature of wireless networks, and still assum... |
1905.00976 | Somdeb Majumdar | Shauharda Khadka, Somdeb Majumdar, Tarek Nassar, Zach Dwiel, Evren
Tumer, Santiago Miret, Yinyin Liu, Kagan Tumer | Collaborative Evolutionary Reinforcement Learning | Added link to public Github repo. Minor editorial changes. Order of
authors modified to reflect ICML submission | Proceedings of the 36th International Conference on Machine
Learning, Long Beach, California, PMLR 97, 2019 | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep reinforcement learning algorithms have been successfully applied to a
range of challenging control tasks. However, these methods typically struggle
with achieving effective exploration and are extremely sensitive to the choice
of hyperparameters. One reason is that most approaches use a noisy version of
their op... | [
{
"created": "Thu, 2 May 2019 21:45:03 GMT",
"version": "v1"
},
{
"created": "Mon, 6 May 2019 21:44:24 GMT",
"version": "v2"
}
] | 2020-10-13 | [
[
"Khadka",
"Shauharda",
""
],
[
"Majumdar",
"Somdeb",
""
],
[
"Nassar",
"Tarek",
""
],
[
"Dwiel",
"Zach",
""
],
[
"Tumer",
"Evren",
""
],
[
"Miret",
"Santiago",
""
],
[
"Liu",
"Yinyin",
""
],
[
"Tume... | Deep reinforcement learning algorithms have been successfully applied to a range of challenging control tasks. However, these methods typically struggle with achieving effective exploration and are extremely sensitive to the choice of hyperparameters. One reason is that most approaches use a noisy version of their oper... |
2408.08210 | Javier Gonzalez | Javier Gonz\'alez and Aditya V. Nori | Does Reasoning Emerge? Examining the Probabilities of Causation in Large
Language Models | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recent advances in AI have been significantly driven by the capabilities of
large language models (LLMs) to solve complex problems in ways that resemble
human thinking. However, there is an ongoing debate about the extent to which
LLMs are capable of actual reasoning. Central to this debate are two key
probabilistic ... | [
{
"created": "Thu, 15 Aug 2024 15:19:11 GMT",
"version": "v1"
}
] | 2024-08-16 | [
[
"González",
"Javier",
""
],
[
"Nori",
"Aditya V.",
""
]
] | Recent advances in AI have been significantly driven by the capabilities of large language models (LLMs) to solve complex problems in ways that resemble human thinking. However, there is an ongoing debate about the extent to which LLMs are capable of actual reasoning. Central to this debate are two key probabilistic co... |
2209.08809 | Stefano Cresci | Amaury Trujillo, Stefano Cresci | One of Many: Assessing User-level Effects of Moderation Interventions on
r/The_Donald | Accepted at ACM WebSci'23 | The 15th International ACM Web Science Conference (WebSci 2023) | 10.1145/3578503.3583626 | null | cs.SI cs.CY cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Evaluating the effects of moderation interventions is a task of paramount
importance, as it allows assessing the success of content moderation processes.
So far, intervention effects have been almost solely evaluated at the
aggregated platform or community levels. Here, we carry out a multidimensional
evaluation of t... | [
{
"created": "Mon, 19 Sep 2022 07:46:18 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Sep 2022 06:53:11 GMT",
"version": "v2"
},
{
"created": "Thu, 29 Sep 2022 14:14:25 GMT",
"version": "v3"
},
{
"created": "Wed, 1 Mar 2023 10:44:23 GMT",
"version": "v4"
}
] | 2023-03-02 | [
[
"Trujillo",
"Amaury",
""
],
[
"Cresci",
"Stefano",
""
]
] | Evaluating the effects of moderation interventions is a task of paramount importance, as it allows assessing the success of content moderation processes. So far, intervention effects have been almost solely evaluated at the aggregated platform or community levels. Here, we carry out a multidimensional evaluation of the... |
2302.05526 | Takumi Tada | Takumi Tada and Kazuya Haraguchi | A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected
Induced Subgraphs | The preliminary version of the paper has been submitted to IWOCA 2023 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a set system $(V,{\mathcal C}\subseteq 2^V)$, we call a subset
$C\in{\mathcal C}$ a component. A nonempty subset $Y\subseteq C$ is a minimal
removable set (MRS) of $C$ if $C\setminus Y\in{\mathcal C}$ and no proper
nonempty subset $Z\subsetneq Y$ satisfies $C\setminus Z\in{\mathcal C}$. In
this paper, we consider... | [
{
"created": "Fri, 10 Feb 2023 22:09:53 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"Tada",
"Takumi",
""
],
[
"Haraguchi",
"Kazuya",
""
]
] | For a set system $(V,{\mathcal C}\subseteq 2^V)$, we call a subset $C\in{\mathcal C}$ a component. A nonempty subset $Y\subseteq C$ is a minimal removable set (MRS) of $C$ if $C\setminus Y\in{\mathcal C}$ and no proper nonempty subset $Z\subsetneq Y$ satisfies $C\setminus Z\in{\mathcal C}$. In this paper, we consider t... |
1508.01572 | Yukio Hayashi | Yukio Hayashi | Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a
MSQ Network | 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of
Collective Adaptive Systems) at The 9th IEEE International Conference on
SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 2015 | null | 10.1109/SASOW.2015.11 | null | cs.DC cs.NI cs.SI nlin.AO physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An interrelation between a topological design of network and efficient
algorithm on it is important for its applications to communication or
transportation systems. In this paper, we propose a design principle for a
reliable routing in a store-carry-forward manner based on autonomously moving
message-ferries on a spe... | [
{
"created": "Fri, 7 Aug 2015 00:06:30 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Aug 2015 01:54:51 GMT",
"version": "v2"
},
{
"created": "Tue, 1 Sep 2015 02:07:01 GMT",
"version": "v3"
}
] | 2016-11-18 | [
[
"Hayashi",
"Yukio",
""
]
] | An interrelation between a topological design of network and efficient algorithm on it is important for its applications to communication or transportation systems. In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a speci... |
2101.04788 | Jayesh Gupta | Shushman Choudhury, Jayesh K. Gupta, Peter Morales, Mykel J.
Kochenderfer | Scalable Anytime Planning for Multi-Agent MDPs | First two authors contributed equally. Accepted at AAMAS 2021 | null | null | null | cs.AI cs.MA | http://creativecommons.org/licenses/by/4.0/ | We present a scalable tree search planning algorithm for large multi-agent
sequential decision problems that require dynamic collaboration. Teams of
agents need to coordinate decisions in many domains, but naive approaches fail
due to the exponential growth of the joint action space with the number of
agents. We circ... | [
{
"created": "Tue, 12 Jan 2021 22:50:17 GMT",
"version": "v1"
}
] | 2021-01-14 | [
[
"Choudhury",
"Shushman",
""
],
[
"Gupta",
"Jayesh K.",
""
],
[
"Morales",
"Peter",
""
],
[
"Kochenderfer",
"Mykel J.",
""
]
] | We present a scalable tree search planning algorithm for large multi-agent sequential decision problems that require dynamic collaboration. Teams of agents need to coordinate decisions in many domains, but naive approaches fail due to the exponential growth of the joint action space with the number of agents. We circum... |
2203.03515 | Christian Reichenb\"acher | Christian Reichenb\"acher, Maximilian Rasch, Zafer Kayatas, Florian
Wirthm\"uller, Jochen Hipp, Thao Dang, Oliver Bringmann | Identifying Scenarios in Field Data to Enable Validation of Highly
Automated Driving Systems | 9 pages, 5 figures | In Proceedings of the 8th International Conference on Vehicle
Technology and Intelligent Transport Systems - VEHITS, 134-142, 2022 | 10.5220/0011081500003191 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scenario-based approaches for the validation of highly automated driving
functions are based on the search for safety-critical characteristics of
driving scenarios using software-in-the-loop simulations. This search requires
information about the shape and probability of scenarios in real-world traffic.
The scope of ... | [
{
"created": "Mon, 7 Mar 2022 16:58:32 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Mar 2022 19:57:12 GMT",
"version": "v2"
},
{
"created": "Wed, 4 May 2022 11:49:39 GMT",
"version": "v3"
}
] | 2022-05-05 | [
[
"Reichenbächer",
"Christian",
""
],
[
"Rasch",
"Maximilian",
""
],
[
"Kayatas",
"Zafer",
""
],
[
"Wirthmüller",
"Florian",
""
],
[
"Hipp",
"Jochen",
""
],
[
"Dang",
"Thao",
""
],
[
"Bringmann",
"Oliver",
""... | Scenario-based approaches for the validation of highly automated driving functions are based on the search for safety-critical characteristics of driving scenarios using software-in-the-loop simulations. This search requires information about the shape and probability of scenarios in real-world traffic. The scope of th... |
1810.06933 | Dennis Eschweiler | Dennis Eschweiler, Thiago V. Spina, Rohan C. Choudhury, Elliot
Meyerowitz, Alexandre Cunha, Johannes Stegmaier | CNN-based Preprocessing to Optimize Watershed-based Cell Segmentation in
3D Confocal Microscopy Images | 5 pages, 4 figures, 1 table | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The quantitative analysis of cellular membranes helps understanding
developmental processes at the cellular level. Particularly 3D microscopic
image data offers valuable insights into cell dynamics, but error-free
automatic segmentation remains challenging due to the huge amount of data
generated and strong variation... | [
{
"created": "Tue, 16 Oct 2018 11:30:54 GMT",
"version": "v1"
}
] | 2018-10-17 | [
[
"Eschweiler",
"Dennis",
""
],
[
"Spina",
"Thiago V.",
""
],
[
"Choudhury",
"Rohan C.",
""
],
[
"Meyerowitz",
"Elliot",
""
],
[
"Cunha",
"Alexandre",
""
],
[
"Stegmaier",
"Johannes",
""
]
] | The quantitative analysis of cellular membranes helps understanding developmental processes at the cellular level. Particularly 3D microscopic image data offers valuable insights into cell dynamics, but error-free automatic segmentation remains challenging due to the huge amount of data generated and strong variations ... |
2305.17337 | Sijia Wang | Sijia Wang, Alexander Hanbo Li, Henry Zhu, Sheng Zhang, Chung-Wei
Hang, Pramuditha Perera, Jie Ma, William Wang, Zhiguo Wang, Vittorio
Castelli, Bing Xiang, Patrick Ng | Benchmarking Diverse-Modal Entity Linking with Generative Models | 15 pages. ACL 2023 | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Entities can be expressed in diverse formats, such as texts, images, or
column names and cell values in tables. While existing entity linking (EL)
models work well on per modality configuration, such as text-only EL, visual
grounding, or schema linking, it is more challenging to design a unified model
for diverse mod... | [
{
"created": "Sat, 27 May 2023 02:38:46 GMT",
"version": "v1"
}
] | 2023-05-30 | [
[
"Wang",
"Sijia",
""
],
[
"Li",
"Alexander Hanbo",
""
],
[
"Zhu",
"Henry",
""
],
[
"Zhang",
"Sheng",
""
],
[
"Hang",
"Chung-Wei",
""
],
[
"Perera",
"Pramuditha",
""
],
[
"Ma",
"Jie",
""
],
[
"Wang",
... | Entities can be expressed in diverse formats, such as texts, images, or column names and cell values in tables. While existing entity linking (EL) models work well on per modality configuration, such as text-only EL, visual grounding, or schema linking, it is more challenging to design a unified model for diverse modal... |
2306.09318 | Myles Foley | Myles Foley, Mia Wang, Zoe M, Chris Hicks, Vasilios Mavroudis | Inroads into Autonomous Network Defence using Explained Reinforcement
Learning | null | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Computer network defence is a complicated task that has necessitated a high
degree of human involvement. However, with recent advancements in machine
learning, fully autonomous network defence is becoming increasingly plausible.
This paper introduces an end-to-end methodology for studying attack strategies,
designing... | [
{
"created": "Thu, 15 Jun 2023 17:53:14 GMT",
"version": "v1"
}
] | 2023-06-16 | [
[
"Foley",
"Myles",
""
],
[
"Wang",
"Mia",
""
],
[
"M",
"Zoe",
""
],
[
"Hicks",
"Chris",
""
],
[
"Mavroudis",
"Vasilios",
""
]
] | Computer network defence is a complicated task that has necessitated a high degree of human involvement. However, with recent advancements in machine learning, fully autonomous network defence is becoming increasingly plausible. This paper introduces an end-to-end methodology for studying attack strategies, designing d... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.