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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2210.06594 | Raghavendra Addanki | Raghavendra Addanki, David Arbour, Tung Mai, Cameron Musco, Anup Rao | Sample Constrained Treatment Effect Estimation | Conference on Neural Information Processing Systems (NeurIPS) 2022 | null | null | null | cs.LG cs.AI cs.DS econ.EM stat.ME | http://creativecommons.org/licenses/by/4.0/ | Treatment effect estimation is a fundamental problem in causal inference. We
focus on designing efficient randomized controlled trials, to accurately
estimate the effect of some treatment on a population of $n$ individuals. In
particular, we study sample-constrained treatment effect estimation, where we
must select a... | [
{
"created": "Wed, 12 Oct 2022 21:13:47 GMT",
"version": "v1"
}
] | 2022-10-14 | [
[
"Addanki",
"Raghavendra",
""
],
[
"Arbour",
"David",
""
],
[
"Mai",
"Tung",
""
],
[
"Musco",
"Cameron",
""
],
[
"Rao",
"Anup",
""
]
] | Treatment effect estimation is a fundamental problem in causal inference. We focus on designing efficient randomized controlled trials, to accurately estimate the effect of some treatment on a population of $n$ individuals. In particular, we study sample-constrained treatment effect estimation, where we must select a s... |
cs/9909015 | Joseph Y. Halpern | Francis C. Chu and Joseph Y. Halpern | A decision-theoretic approach to reliable message delivery | This is the full version of a paper that appears in the Proceedings
of the 12th International Symposium on Distributed Computing, 1998, pp. 89-10 | null | null | null | cs.DC | null | We argue that the tools of decision theory need to be taken more seriously in
the specification and analysis of systems. We illustrate this by considering a
simple problem involving reliable communication, showing how considerations of
utility and probability can be used to decide when it is worth sending
heartbeat m... | [
{
"created": "Tue, 21 Sep 1999 20:51:37 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Chu",
"Francis C.",
""
],
[
"Halpern",
"Joseph Y.",
""
]
] | We argue that the tools of decision theory need to be taken more seriously in the specification and analysis of systems. We illustrate this by considering a simple problem involving reliable communication, showing how considerations of utility and probability can be used to decide when it is worth sending heartbeat mes... |
2002.09866 | Yossi Adi | Yossi Adi, Yaniv Nemcovsky, Alex Schwing, Tamir Hazan | On the generalization of bayesian deep nets for multi-class
classification | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generalization bounds which assess the difference between the true risk and
the empirical risk have been studied extensively. However, to obtain bounds,
current techniques use strict assumptions such as a uniformly bounded or a
Lipschitz loss function. To avoid these assumptions, in this paper, we propose
a new gener... | [
{
"created": "Sun, 23 Feb 2020 09:05:03 GMT",
"version": "v1"
}
] | 2020-02-25 | [
[
"Adi",
"Yossi",
""
],
[
"Nemcovsky",
"Yaniv",
""
],
[
"Schwing",
"Alex",
""
],
[
"Hazan",
"Tamir",
""
]
] | Generalization bounds which assess the difference between the true risk and the empirical risk have been studied extensively. However, to obtain bounds, current techniques use strict assumptions such as a uniformly bounded or a Lipschitz loss function. To avoid these assumptions, in this paper, we propose a new general... |
1606.00195 | Ioannis Marcoullis | Shlomi Dolev, Chryssis Georgiou, Ioannis Marcoullis, Elad M. Schiller | Self-stabilizing Reconfiguration | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current reconfiguration techniques are based on starting the system in a
consistent configuration, in which all participating entities are in their
initial state. Starting from that state, the system must preserve consistency
as long as a predefined churn rate of processors joins and leaves is not
violated, and unbou... | [
{
"created": "Wed, 1 Jun 2016 09:44:57 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Dec 2016 09:18:57 GMT",
"version": "v2"
}
] | 2016-12-07 | [
[
"Dolev",
"Shlomi",
""
],
[
"Georgiou",
"Chryssis",
""
],
[
"Marcoullis",
"Ioannis",
""
],
[
"Schiller",
"Elad M.",
""
]
] | Current reconfiguration techniques are based on starting the system in a consistent configuration, in which all participating entities are in their initial state. Starting from that state, the system must preserve consistency as long as a predefined churn rate of processors joins and leaves is not violated, and unbound... |
1207.1811 | George Katsirelos | George Katsirelos and Nina Narodytska and Toby Walsh | The SeqBin Constraint Revisited | Longer version of paper accepted at CP 2012 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We revisit the SeqBin constraint. This meta-constraint subsumes a number of
important global constraints like Change, Smooth and IncreasingNValue. We show
that the previously proposed filtering algorithm for SeqBin has two drawbacks
even under strong restrictions: it does not detect bounds disentailment and it
is not... | [
{
"created": "Sat, 7 Jul 2012 16:21:53 GMT",
"version": "v1"
}
] | 2015-03-20 | [
[
"Katsirelos",
"George",
""
],
[
"Narodytska",
"Nina",
""
],
[
"Walsh",
"Toby",
""
]
] | We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even under strong restrictions: it does not detect bounds disentailment and it is not i... |
2306.05239 | Xiao Wang | Bo Jiang, Chengguo Yuan, Xiao Wang, Zhimin Bao, Lin Zhu, Yonghong
Tian, Jin Tang | Point-Voxel Absorbing Graph Representation Learning for Event Stream
based Recognition | In Peer Review | null | null | null | cs.CV cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sampled point and voxel methods are usually employed to downsample the dense
events into sparse ones. After that, one popular way is to leverage a graph
model which treats the sparse points/voxels as nodes and adopts graph neural
networks (GNNs) to learn the representation of event data. Although good
performance can... | [
{
"created": "Thu, 8 Jun 2023 14:38:43 GMT",
"version": "v1"
},
{
"created": "Sat, 29 Jul 2023 12:18:38 GMT",
"version": "v2"
}
] | 2023-08-01 | [
[
"Jiang",
"Bo",
""
],
[
"Yuan",
"Chengguo",
""
],
[
"Wang",
"Xiao",
""
],
[
"Bao",
"Zhimin",
""
],
[
"Zhu",
"Lin",
""
],
[
"Tian",
"Yonghong",
""
],
[
"Tang",
"Jin",
""
]
] | Sampled point and voxel methods are usually employed to downsample the dense events into sparse ones. After that, one popular way is to leverage a graph model which treats the sparse points/voxels as nodes and adopts graph neural networks (GNNs) to learn the representation of event data. Although good performance can b... |
2211.15234 | Ruitian Wu | Jingwei Li, Ruitian Wu, Tzu-liang Huang, Zian Pan, Ming-chun Huang | Shoupa: An AI System for Early Diagnosis of Parkinson's Disease | 2 pages, 1 figure, accepted by IEEE/ACM CHASE 2022 (Poster
Presentation) | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Parkinson's Disease (PD) is a progressive nervous system disorder that has
affected more than 5.8 million people, especially the elderly. Due to the
complexity of its symptoms and its similarity to other neurological disorders,
early detection requires neurologists or PD specialists to be involved, which
is not acces... | [
{
"created": "Mon, 28 Nov 2022 11:32:17 GMT",
"version": "v1"
}
] | 2022-11-29 | [
[
"Li",
"Jingwei",
""
],
[
"Wu",
"Ruitian",
""
],
[
"Huang",
"Tzu-liang",
""
],
[
"Pan",
"Zian",
""
],
[
"Huang",
"Ming-chun",
""
]
] | Parkinson's Disease (PD) is a progressive nervous system disorder that has affected more than 5.8 million people, especially the elderly. Due to the complexity of its symptoms and its similarity to other neurological disorders, early detection requires neurologists or PD specialists to be involved, which is not accessi... |
2109.01860 | Taiping Yao | Zhihao Gu, Yang Chen, Taiping Yao, Shouhong Ding, Jilin Li, Feiyue
Huang, Lizhuang Ma | Spatiotemporal Inconsistency Learning for DeepFake Video Detection | To appear in ACM MM 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid development of facial manipulation techniques has aroused public
concerns in recent years. Following the success of deep learning, existing
methods always formulate DeepFake video detection as a binary classification
problem and develop frame-based and video-based solutions. However, little
attention has be... | [
{
"created": "Sat, 4 Sep 2021 13:05:37 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Sep 2021 09:05:29 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Oct 2021 05:15:08 GMT",
"version": "v3"
}
] | 2021-10-12 | [
[
"Gu",
"Zhihao",
""
],
[
"Chen",
"Yang",
""
],
[
"Yao",
"Taiping",
""
],
[
"Ding",
"Shouhong",
""
],
[
"Li",
"Jilin",
""
],
[
"Huang",
"Feiyue",
""
],
[
"Ma",
"Lizhuang",
""
]
] | The rapid development of facial manipulation techniques has aroused public concerns in recent years. Following the success of deep learning, existing methods always formulate DeepFake video detection as a binary classification problem and develop frame-based and video-based solutions. However, little attention has been... |
1201.5418 | Rafael Caballero | R. Caballero, M. Rodriguez-Artalejo and C. A. Romero-Diaz | A Transformation-based Implementation for CLP with Qualification and
Proximity | To appear in Theory and Practice of Logic Programming (TPLP). arXiv
admin note: significant text overlap with arXiv:1009.1976 | null | null | 12-R01-TPLP | cs.LO cs.PL | http://creativecommons.org/licenses/publicdomain/ | Uncertainty in logic programming has been widely investigated in the last
decades, leading to multiple extensions of the classical LP paradigm. However,
few of these are designed as extensions of the well-established and powerful
CLP scheme for Constraint Logic Programming. In a previous work we have
proposed the SQC... | [
{
"created": "Wed, 25 Jan 2012 23:47:26 GMT",
"version": "v1"
}
] | 2012-01-27 | [
[
"Caballero",
"R.",
""
],
[
"Rodriguez-Artalejo",
"M.",
""
],
[
"Romero-Diaz",
"C. A.",
""
]
] | Uncertainty in logic programming has been widely investigated in the last decades, leading to multiple extensions of the classical LP paradigm. However, few of these are designed as extensions of the well-established and powerful CLP scheme for Constraint Logic Programming. In a previous work we have proposed the SQCLP... |
2204.00679 | Arsha Nagrani | Arsha Nagrani, Paul Hongsuck Seo, Bryan Seybold, Anja Hauth, Santiago
Manen, Chen Sun and Cordelia Schmid | Learning Audio-Video Modalities from Image Captions | null | null | null | null | cs.CV cs.MM cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A major challenge in text-video and text-audio retrieval is the lack of
large-scale training data. This is unlike image-captioning, where datasets are
in the order of millions of samples. To close this gap we propose a new video
mining pipeline which involves transferring captions from image captioning
datasets to vi... | [
{
"created": "Fri, 1 Apr 2022 19:48:18 GMT",
"version": "v1"
}
] | 2022-04-05 | [
[
"Nagrani",
"Arsha",
""
],
[
"Seo",
"Paul Hongsuck",
""
],
[
"Seybold",
"Bryan",
""
],
[
"Hauth",
"Anja",
""
],
[
"Manen",
"Santiago",
""
],
[
"Sun",
"Chen",
""
],
[
"Schmid",
"Cordelia",
""
]
] | A major challenge in text-video and text-audio retrieval is the lack of large-scale training data. This is unlike image-captioning, where datasets are in the order of millions of samples. To close this gap we propose a new video mining pipeline which involves transferring captions from image captioning datasets to vide... |
2009.07970 | Bardia Yousefi | Hossein Memarzadeh Sharifipour, Bardia Yousefi, Xavier P.V. Maldague | Skeletonization and Reconstruction based on Graph Morphological
Transformations | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multiscale shape skeletonization on pixel adjacency graphs is an advanced
intriguing research subject in the field of image processing, computer vision
and data mining. The previous works in this area almost focused on the graph
vertices. We proposed novel structured based graph morphological
transformations based on... | [
{
"created": "Wed, 16 Sep 2020 22:58:06 GMT",
"version": "v1"
}
] | 2020-09-18 | [
[
"Sharifipour",
"Hossein Memarzadeh",
""
],
[
"Yousefi",
"Bardia",
""
],
[
"Maldague",
"Xavier P. V.",
""
]
] | Multiscale shape skeletonization on pixel adjacency graphs is an advanced intriguing research subject in the field of image processing, computer vision and data mining. The previous works in this area almost focused on the graph vertices. We proposed novel structured based graph morphological transformations based on e... |
1912.09264 | Yang Li | Yang Li and Hongbo Li | Improved quantum algorithm for the random subset sum problem | arXiv admin note: text overlap with arXiv:1907.04295 by other authors | null | null | null | cs.DS cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Solving random subset sum instances plays an important role in constructing
cryptographic systems. For the random subset sum problem, in 2013 Bernstein et
al. proposed a quantum algorithm with heuristic time complexity
$\widetilde{O}(2^{0.241n})$, where the "$\widetilde{O}$" symbol is used to omit
poly($\log n$) fact... | [
{
"created": "Wed, 18 Dec 2019 05:51:03 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Feb 2020 18:17:30 GMT",
"version": "v2"
}
] | 2020-02-14 | [
[
"Li",
"Yang",
""
],
[
"Li",
"Hongbo",
""
]
] | Solving random subset sum instances plays an important role in constructing cryptographic systems. For the random subset sum problem, in 2013 Bernstein et al. proposed a quantum algorithm with heuristic time complexity $\widetilde{O}(2^{0.241n})$, where the "$\widetilde{O}$" symbol is used to omit poly($\log n$) factor... |
2009.13257 | Zeev Nutov | Zeev Nutov | Approximation algorithms for connectivity augmentation problems | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Connectivity Augmentation problems we are given a graph $H=(V,E_H)$ and an
edge set $E$ on $V$, and seek a min-size edge set $J \subseteq E$ such that $H
\cup J$ has larger edge/node connectivity than $H$. In the Edge-Connectivity
Augmentation problem we need to increase the edge-connectivity by $1$. In the
Block-... | [
{
"created": "Mon, 28 Sep 2020 12:27:05 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Nov 2020 21:37:16 GMT",
"version": "v2"
}
] | 2020-11-17 | [
[
"Nutov",
"Zeev",
""
]
] | In Connectivity Augmentation problems we are given a graph $H=(V,E_H)$ and an edge set $E$ on $V$, and seek a min-size edge set $J \subseteq E$ such that $H \cup J$ has larger edge/node connectivity than $H$. In the Edge-Connectivity Augmentation problem we need to increase the edge-connectivity by $1$. In the Block-Tr... |
2104.12800 | Stanislav \v{Z}ivn\'y | Alex Brandts and Stanislav \v{Z}ivn\'y | Beyond PCSP (1-in-3,NAE) | Full version of an ICALP 2021 paper | Information and Computation 289, Part A, 104954 (2022) | 10.1016/j.ic.2022.104954 | null | cs.CC cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The promise constraint satisfaction problem (PCSP) is a recently introduced
vast generalisation of the constraint satisfaction problem (CSP) that captures
approximability of satisfiable instances. A PCSP instance comes with two forms
of each constraint: a strict one and a weak one. Given the promise that a
solution e... | [
{
"created": "Mon, 26 Apr 2021 18:00:41 GMT",
"version": "v1"
},
{
"created": "Sat, 12 Feb 2022 13:27:46 GMT",
"version": "v2"
},
{
"created": "Sun, 28 Aug 2022 19:14:35 GMT",
"version": "v3"
}
] | 2023-01-31 | [
[
"Brandts",
"Alex",
""
],
[
"Živný",
"Stanislav",
""
]
] | The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of each constraint: a strict one and a weak one. Given the promise that a solution exi... |
0704.0831 | Brooke Shrader | Brooke Shrader and Anthony Ephremides | On packet lengths and overhead for random linear coding over the erasure
channel | 5 pages, 5 figures, submitted to the 2007 International Wireless
Communications and Mobile Computing Conference | null | null | null | cs.IT math.IT | null | We assess the practicality of random network coding by illuminating the issue
of overhead and considering it in conjunction with increasingly long packets
sent over the erasure channel. We show that the transmission of increasingly
long packets, consisting of either of an increasing number of symbols per
packet or an... | [
{
"created": "Fri, 6 Apr 2007 02:25:40 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Shrader",
"Brooke",
""
],
[
"Ephremides",
"Anthony",
""
]
] | We assess the practicality of random network coding by illuminating the issue of overhead and considering it in conjunction with increasingly long packets sent over the erasure channel. We show that the transmission of increasingly long packets, consisting of either of an increasing number of symbols per packet or an i... |
2312.15863 | Hangyu Mao | Hangyu Mao, Rui Zhao, Ziyue Li, Zhiwei Xu, Hao Chen, Yiqun Chen, Bin
Zhang, Zhen Xiao, Junge Zhang, and Jiangjin Yin | PDiT: Interleaving Perception and Decision-making Transformers for Deep
Reinforcement Learning | Proc. of the 23rd International Conference on Autonomous Agents and
Multiagent Systems (AAMAS 2024, full paper with oral presentation). Cover our
preliminary study: arXiv:2212.14538 | null | null | null | cs.LG cs.AI cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Designing better deep networks and better reinforcement learning (RL)
algorithms are both important for deep RL. This work studies the former.
Specifically, the Perception and Decision-making Interleaving Transformer
(PDiT) network is proposed, which cascades two Transformers in a very natural
way: the perceiving one... | [
{
"created": "Tue, 26 Dec 2023 03:07:10 GMT",
"version": "v1"
}
] | 2023-12-27 | [
[
"Mao",
"Hangyu",
""
],
[
"Zhao",
"Rui",
""
],
[
"Li",
"Ziyue",
""
],
[
"Xu",
"Zhiwei",
""
],
[
"Chen",
"Hao",
""
],
[
"Chen",
"Yiqun",
""
],
[
"Zhang",
"Bin",
""
],
[
"Xiao",
"Zhen",
""
],... | Designing better deep networks and better reinforcement learning (RL) algorithms are both important for deep RL. This work studies the former. Specifically, the Perception and Decision-making Interleaving Transformer (PDiT) network is proposed, which cascades two Transformers in a very natural way: the perceiving one f... |
2105.03897 | Savas Ozkan | Savas Ozkan, Gozde Bozdagi Akar | Binarized Weight Error Networks With a Transition Regularization Term | Submitted to ICIP 2021 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper proposes a novel binarized weight network (BT) for a
resource-efficient neural structure. The proposed model estimates a binary
representation of weights by taking into account the approximation error with
an additional term. This model increases representation capacity and stability,
particularly for shal... | [
{
"created": "Sun, 9 May 2021 10:11:26 GMT",
"version": "v1"
}
] | 2021-05-11 | [
[
"Ozkan",
"Savas",
""
],
[
"Akar",
"Gozde Bozdagi",
""
]
] | This paper proposes a novel binarized weight network (BT) for a resource-efficient neural structure. The proposed model estimates a binary representation of weights by taking into account the approximation error with an additional term. This model increases representation capacity and stability, particularly for shallo... |
1907.07972 | Zulfat Miftahutdinov | Zulfat Miftahutdinov and Elena Tutubalina | Deep Neural Models for Medical Concept Normalization in User-Generated
Texts | This is preprint of the paper "Deep Neural Models for Medical Concept
Normalization in User-Generated Texts" to be published at ACL 2019 - 57th
Annual Meeting of the Association for Computational Linguistics, Proceedings
of the Student Research Workshop | ACL SRW 2019 | 10.18653/v1/P19-2055 | null | cs.CL cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we consider the medical concept normalization problem, i.e.,
the problem of mapping a health-related entity mention in a free-form text to a
concept in a controlled vocabulary, usually to the standard thesaurus in the
Unified Medical Language System (UMLS). This is a challenging task since
medical termi... | [
{
"created": "Thu, 18 Jul 2019 10:36:03 GMT",
"version": "v1"
}
] | 2023-11-21 | [
[
"Miftahutdinov",
"Zulfat",
""
],
[
"Tutubalina",
"Elena",
""
]
] | In this work, we consider the medical concept normalization problem, i.e., the problem of mapping a health-related entity mention in a free-form text to a concept in a controlled vocabulary, usually to the standard thesaurus in the Unified Medical Language System (UMLS). This is a challenging task since medical termino... |
1307.1461 | Sung Ho Chae | Sung Ho Chae, Changho Suh, and Sae-Young Chung | Degrees of Freedom of the Rank-deficient Interference Channel with
Feedback | The material in this paper will be presented in part at the IEEE
International Symposium on Information Theory (ISIT) 2013 and was in part
submitted to the Allerton Conference on Communication, Control, and Computing
2013 | null | 10.1109/TIT.2015.2428233 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the total degrees of freedom (DoF) of the K-user
rank-deficient interference channel with feedback. For the two-user case, we
characterize the total DoF by developing an achievable scheme and deriving a
matching upper bound. For the three-user case, we develop a new achievable
scheme which employs inte... | [
{
"created": "Thu, 4 Jul 2013 19:49:24 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Jul 2013 05:50:15 GMT",
"version": "v2"
}
] | 2016-11-17 | [
[
"Chae",
"Sung Ho",
""
],
[
"Suh",
"Changho",
""
],
[
"Chung",
"Sae-Young",
""
]
] | We investigate the total degrees of freedom (DoF) of the K-user rank-deficient interference channel with feedback. For the two-user case, we characterize the total DoF by developing an achievable scheme and deriving a matching upper bound. For the three-user case, we develop a new achievable scheme which employs interf... |
2312.04604 | Kyeongryeol Go | Kyeongryeol Go, Kye-Hyeon Kim | Transferable Candidate Proposal with Bounded Uncertainty | Accepted in NeurIPS 2023 Workshop on Adaptive Experimental Design and
Active Learning in the Real World | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | From an empirical perspective, the subset chosen through active learning
cannot guarantee an advantage over random sampling when transferred to another
model. While it underscores the significance of verifying transferability,
experimental design from previous works often neglected that the
informativeness of a data ... | [
{
"created": "Thu, 7 Dec 2023 08:47:28 GMT",
"version": "v1"
}
] | 2023-12-11 | [
[
"Go",
"Kyeongryeol",
""
],
[
"Kim",
"Kye-Hyeon",
""
]
] | From an empirical perspective, the subset chosen through active learning cannot guarantee an advantage over random sampling when transferred to another model. While it underscores the significance of verifying transferability, experimental design from previous works often neglected that the informativeness of a data su... |
2312.02859 | Alexandra Zytek | Alexandra Zytek, Wei-En Wang, Sofia Koukoura, and Kalyan
Veeramachaneni | Lessons from Usable ML Deployments and Application to Wind Turbine
Monitoring | Presented in XAI in Action: Past, Present, and Future Applications @
NeurIPS 2023. 8 pages, 3 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Through past experiences deploying what we call usable ML (one step beyond
explainable ML, including both explanations and other augmenting information)
to real-world domains, we have learned three key lessons. First, many
organizations are beginning to hire people who we call ``bridges'' because they
bridge the gap ... | [
{
"created": "Tue, 5 Dec 2023 16:13:50 GMT",
"version": "v1"
}
] | 2023-12-06 | [
[
"Zytek",
"Alexandra",
""
],
[
"Wang",
"Wei-En",
""
],
[
"Koukoura",
"Sofia",
""
],
[
"Veeramachaneni",
"Kalyan",
""
]
] | Through past experiences deploying what we call usable ML (one step beyond explainable ML, including both explanations and other augmenting information) to real-world domains, we have learned three key lessons. First, many organizations are beginning to hire people who we call ``bridges'' because they bridge the gap be... |
2112.01085 | Ziao Yang | Ziao Yang, Xiangrui Yang and Qifeng Lin | PTCT: Patches with 3D-Temporal Convolutional Transformer Network for
Precipitation Nowcasting | 9 pages, 3 figures | null | null | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Precipitation nowcasting is to predict the future rainfall intensity over a
short period of time, which mainly relies on the prediction of radar echo
sequences. Though convolutional neural network (CNN) and recurrent neural
network (RNN) are widely used to generate radar echo frames, they suffer from
inductive bias (... | [
{
"created": "Thu, 2 Dec 2021 10:05:01 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Jun 2022 04:50:30 GMT",
"version": "v2"
}
] | 2022-06-06 | [
[
"Yang",
"Ziao",
""
],
[
"Yang",
"Xiangrui",
""
],
[
"Lin",
"Qifeng",
""
]
] | Precipitation nowcasting is to predict the future rainfall intensity over a short period of time, which mainly relies on the prediction of radar echo sequences. Though convolutional neural network (CNN) and recurrent neural network (RNN) are widely used to generate radar echo frames, they suffer from inductive bias (i.... |
2310.08558 | Max Sobol Mark | Max Sobol Mark, Archit Sharma, Fahim Tajwar, Rafael Rafailov, Sergey
Levine, Chelsea Finn | Offline Retraining for Online RL: Decoupled Policy Learning to Mitigate
Exploration Bias | null | null | null | null | cs.LG cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | It is desirable for policies to optimistically explore new states and
behaviors during online reinforcement learning (RL) or fine-tuning, especially
when prior offline data does not provide enough state coverage. However,
exploration bonuses can bias the learned policy, and our experiments find that
naive, yet standa... | [
{
"created": "Thu, 12 Oct 2023 17:50:09 GMT",
"version": "v1"
}
] | 2023-10-13 | [
[
"Mark",
"Max Sobol",
""
],
[
"Sharma",
"Archit",
""
],
[
"Tajwar",
"Fahim",
""
],
[
"Rafailov",
"Rafael",
""
],
[
"Levine",
"Sergey",
""
],
[
"Finn",
"Chelsea",
""
]
] | It is desirable for policies to optimistically explore new states and behaviors during online reinforcement learning (RL) or fine-tuning, especially when prior offline data does not provide enough state coverage. However, exploration bonuses can bias the learned policy, and our experiments find that naive, yet standard... |
2108.10967 | Utkarsh Mall | Utkarsh Mall, Bharath Hariharan, and Kavita Bala | Field-Guide-Inspired Zero-Shot Learning | Accepted to ICCV 2021 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Modern recognition systems require large amounts of supervision to achieve
accuracy. Adapting to new domains requires significant data from experts, which
is onerous and can become too expensive. Zero-shot learning requires an
annotated set of attributes for a novel category. Annotating the full set of
attributes for... | [
{
"created": "Tue, 24 Aug 2021 21:36:05 GMT",
"version": "v1"
}
] | 2021-08-26 | [
[
"Mall",
"Utkarsh",
""
],
[
"Hariharan",
"Bharath",
""
],
[
"Bala",
"Kavita",
""
]
] | Modern recognition systems require large amounts of supervision to achieve accuracy. Adapting to new domains requires significant data from experts, which is onerous and can become too expensive. Zero-shot learning requires an annotated set of attributes for a novel category. Annotating the full set of attributes for a... |
1903.05266 | Tu Le | John A. Stankovic, Tu Le, Abdeltawab Hendawi, Yuan Tian | Hardware/Software Security Patches for Internet of Trillions of Things | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the rapid development of the Internet of Things, there are many
interacting devices and applications. One crucial challenge is how to provide
security. Our proposal for a new direction is to create "smart buttons" and
collections of them called "smart blankets" as hardware/software security
patches rather than s... | [
{
"created": "Tue, 12 Mar 2019 23:46:30 GMT",
"version": "v1"
}
] | 2019-03-14 | [
[
"Stankovic",
"John A.",
""
],
[
"Le",
"Tu",
""
],
[
"Hendawi",
"Abdeltawab",
""
],
[
"Tian",
"Yuan",
""
]
] | With the rapid development of the Internet of Things, there are many interacting devices and applications. One crucial challenge is how to provide security. Our proposal for a new direction is to create "smart buttons" and collections of them called "smart blankets" as hardware/software security patches rather than sof... |
2311.09178 | Marwah Sulaiman | Marwah Sulaiman, Zahraa Shehabeldin, Israa Fahmy, Mohammed Barakat,
Mohammed El-Naggar, Dareen Hussein, Moustafa Youssef, Hesham M. Eraqi | RBPGAN: Recurrent Back-Projection GAN for Video Super Resolution | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, video super resolution (VSR) has become a very impactful task in
the area of Computer Vision due to its various applications. In this paper, we
propose Recurrent Back-Projection Generative Adversarial Network (RBPGAN) for
VSR in an attempt to generate temporally coherent solutions while preserving
spatial d... | [
{
"created": "Wed, 15 Nov 2023 18:15:30 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Nov 2023 14:02:35 GMT",
"version": "v2"
},
{
"created": "Fri, 24 Nov 2023 11:47:25 GMT",
"version": "v3"
},
{
"created": "Sun, 10 Dec 2023 23:30:20 GMT",
"version": "v4"
}
] | 2023-12-12 | [
[
"Sulaiman",
"Marwah",
""
],
[
"Shehabeldin",
"Zahraa",
""
],
[
"Fahmy",
"Israa",
""
],
[
"Barakat",
"Mohammed",
""
],
[
"El-Naggar",
"Mohammed",
""
],
[
"Hussein",
"Dareen",
""
],
[
"Youssef",
"Moustafa",
"... | Recently, video super resolution (VSR) has become a very impactful task in the area of Computer Vision due to its various applications. In this paper, we propose Recurrent Back-Projection Generative Adversarial Network (RBPGAN) for VSR in an attempt to generate temporally coherent solutions while preserving spatial det... |
1311.5108 | Gildas Morvan | Jean-Baptiste Soyez, Gildas Morvan, Daniel Dupont, Rochdi Merzouki | A Methodology to Engineer and Validate Dynamic Multi-level Multi-agent
Based Simulations | Presented at 3th International Workshop on Multi-Agent Based
Simulation, Valencia, Spain, 5th June 2012 | Multi-Agent-Based Simulation XIII LNCS 7838 p 130-142, 2013 | 10.1007/978-3-642-38859-0_10 | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article proposes a methodology to model and simulate complex systems,
based on IRM4MLS, a generic agent-based meta-model able to deal with
multi-level systems. This methodology permits the engineering of dynamic
multi-level agent-based models, to represent complex systems over several
scales and domains of inter... | [
{
"created": "Wed, 20 Nov 2013 15:44:26 GMT",
"version": "v1"
}
] | 2013-11-21 | [
[
"Soyez",
"Jean-Baptiste",
""
],
[
"Morvan",
"Gildas",
""
],
[
"Dupont",
"Daniel",
""
],
[
"Merzouki",
"Rochdi",
""
]
] | This article proposes a methodology to model and simulate complex systems, based on IRM4MLS, a generic agent-based meta-model able to deal with multi-level systems. This methodology permits the engineering of dynamic multi-level agent-based models, to represent complex systems over several scales and domains of interes... |
2407.11038 | Dianhui Wang | Dianhui Wang and Gang Dang | Fuzzy Recurrent Stochastic Configuration Networks for Industrial Data
Analytics | null | null | null | null | cs.LG cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel neuro-fuzzy model, termed fuzzy recurrent
stochastic configuration networks (F-RSCNs), for industrial data analytics.
Unlike the original recurrent stochastic configuration network (RSCN), the
proposed F-RSCN is constructed by multiple sub-reservoirs, and each
sub-reservoir is associated w... | [
{
"created": "Sat, 6 Jul 2024 01:40:31 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Aug 2024 00:55:09 GMT",
"version": "v2"
}
] | 2024-08-14 | [
[
"Wang",
"Dianhui",
""
],
[
"Dang",
"Gang",
""
]
] | This paper presents a novel neuro-fuzzy model, termed fuzzy recurrent stochastic configuration networks (F-RSCNs), for industrial data analytics. Unlike the original recurrent stochastic configuration network (RSCN), the proposed F-RSCN is constructed by multiple sub-reservoirs, and each sub-reservoir is associated wit... |
0904.2375 | Navin Kashyap | Akiko Manada and Navin Kashyap | The Zeta Function of a Periodic-Finite-Type Shift | To appear in Proceedings of the 2009 IEEE International Symposium on
Information Theory (ISIT'09); 5 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The class of periodic-finite-type shifts (PFT's) is a class of sofic shifts
that strictly includes the class of shifts of finite type (SFT's), and the zeta
function of a PFT is a generating function for the number of periodic sequences
in the shift. In this paper, we derive a useful formula for the zeta function
of a... | [
{
"created": "Wed, 15 Apr 2009 18:56:15 GMT",
"version": "v1"
}
] | 2009-04-16 | [
[
"Manada",
"Akiko",
""
],
[
"Kashyap",
"Navin",
""
]
] | The class of periodic-finite-type shifts (PFT's) is a class of sofic shifts that strictly includes the class of shifts of finite type (SFT's), and the zeta function of a PFT is a generating function for the number of periodic sequences in the shift. In this paper, we derive a useful formula for the zeta function of a P... |
2207.04174 | Wes Robbins | Wes Robbins, Zanyar Zohourianshahzadi, and Jugal Kalita | Towards Multimodal Vision-Language Models Generating Non-Generic Text | null | 2021 International Conference on Natural Language Processing | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vision-language models can assess visual context in an image and generate
descriptive text. While the generated text may be accurate and syntactically
correct, it is often overly general. To address this, recent work has used
optical character recognition to supplement visual information with text
extracted from an i... | [
{
"created": "Sat, 9 Jul 2022 01:56:35 GMT",
"version": "v1"
}
] | 2022-07-12 | [
[
"Robbins",
"Wes",
""
],
[
"Zohourianshahzadi",
"Zanyar",
""
],
[
"Kalita",
"Jugal",
""
]
] | Vision-language models can assess visual context in an image and generate descriptive text. While the generated text may be accurate and syntactically correct, it is often overly general. To address this, recent work has used optical character recognition to supplement visual information with text extracted from an ima... |
2203.09777 | Brandon Khoo | Brandon B. G. Khoo, Chern Hong Lim, Raphael C.-W. Phan | Transferable Class-Modelling for Decentralized Source Attribution of
GAN-Generated Images | 21 pages, 8 figures. Code:
https://github.com/quarxilon/Generator_Attribution | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | GAN-generated deepfakes as a genre of digital images are gaining ground as
both catalysts of artistic expression and malicious forms of deception,
therefore demanding systems to enforce and accredit their ethical use. Existing
techniques for the source attribution of synthetic images identify subtle
intrinsic fingerp... | [
{
"created": "Fri, 18 Mar 2022 07:43:03 GMT",
"version": "v1"
}
] | 2022-03-21 | [
[
"Khoo",
"Brandon B. G.",
""
],
[
"Lim",
"Chern Hong",
""
],
[
"Phan",
"Raphael C. -W.",
""
]
] | GAN-generated deepfakes as a genre of digital images are gaining ground as both catalysts of artistic expression and malicious forms of deception, therefore demanding systems to enforce and accredit their ethical use. Existing techniques for the source attribution of synthetic images identify subtle intrinsic fingerpri... |
2007.09060 | Prateek Verma | Camille Noufi and Prateek Verma | Self-Supervised Learning of Context-Aware Pitch Prosody Representations | null | null | null | null | cs.SD cs.CV cs.IR cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In music and speech, meaning is derived at multiple levels of context.
Affect, for example, can be inferred both by a short sound token and by sonic
patterns over a longer temporal window such as an entire recording. In this
letter, we focus on inferring meaning from this dichotomy of contexts. We show
how contextual... | [
{
"created": "Fri, 17 Jul 2020 15:41:00 GMT",
"version": "v1"
},
{
"created": "Sat, 24 Oct 2020 02:10:05 GMT",
"version": "v2"
},
{
"created": "Thu, 25 Mar 2021 17:46:54 GMT",
"version": "v3"
},
{
"created": "Sun, 1 Aug 2021 05:16:48 GMT",
"version": "v4"
}
] | 2022-09-12 | [
[
"Noufi",
"Camille",
""
],
[
"Verma",
"Prateek",
""
]
] | In music and speech, meaning is derived at multiple levels of context. Affect, for example, can be inferred both by a short sound token and by sonic patterns over a longer temporal window such as an entire recording. In this letter, we focus on inferring meaning from this dichotomy of contexts. We show how contextual r... |
2310.20203 | Suman Sapkota | Suman Sapkota, Binod Bhattarai | Importance Estimation with Random Gradient for Neural Network Pruning | 7 pages, 2 figures, ICLR 2023 Workshop on Sparsity in Neural
Networks. arXiv admin note: text overlap with arXiv:2306.13203 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Global Neuron Importance Estimation is used to prune neural networks for
efficiency reasons. To determine the global importance of each neuron or
convolutional kernel, most of the existing methods either use activation or
gradient information or both, which demands abundant labelled examples. In this
work, we use heu... | [
{
"created": "Tue, 31 Oct 2023 06:00:17 GMT",
"version": "v1"
}
] | 2023-11-01 | [
[
"Sapkota",
"Suman",
""
],
[
"Bhattarai",
"Binod",
""
]
] | Global Neuron Importance Estimation is used to prune neural networks for efficiency reasons. To determine the global importance of each neuron or convolutional kernel, most of the existing methods either use activation or gradient information or both, which demands abundant labelled examples. In this work, we use heuri... |
2312.17612 | Florentia Afentaki | Florentia Afentaki, Gurol Saglam, Argyris Kokkinis, Kostas Siozios,
Georgios Zervakis, Mehdi B Tahoori | Bespoke Approximation of Multiplication-Accumulation and Activation
Targeting Printed Multilayer Perceptrons | Accepted for publication at the 42th IEEE/ACM International
Conference on Computer Aided Design (ICCAD) 2023, San Francisco, USA | null | 10.1109/ICCAD57390.2023.10323613 | null | cs.AR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Printed Electronics (PE) feature distinct and remarkable characteristics that
make them a prominent technology for achieving true ubiquitous computing. This
is particularly relevant in application domains that require conformal and
ultra-low cost solutions, which have experienced limited penetration of
computing unti... | [
{
"created": "Fri, 29 Dec 2023 14:16:11 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Feb 2024 11:14:22 GMT",
"version": "v2"
}
] | 2024-02-06 | [
[
"Afentaki",
"Florentia",
""
],
[
"Saglam",
"Gurol",
""
],
[
"Kokkinis",
"Argyris",
""
],
[
"Siozios",
"Kostas",
""
],
[
"Zervakis",
"Georgios",
""
],
[
"Tahoori",
"Mehdi B",
""
]
] | Printed Electronics (PE) feature distinct and remarkable characteristics that make them a prominent technology for achieving true ubiquitous computing. This is particularly relevant in application domains that require conformal and ultra-low cost solutions, which have experienced limited penetration of computing until ... |
1409.6226 | Ricardo Martins | Ricardo Martins, Jo\~ao Filipe Ferreira, Jorge Dias | Touch attention Bayesian models for robotic active haptic exploration of
heterogeneous surfaces | 8 pages, presented in IROS 2014, Chicago | Proceedings of 2014 IEEE/RSJ International Conference on
Intelligent Robots and Systems (IROS 2014), Chicago, USA, Sept. 14-18, 2014 | 10.1109/IROS.2014.6942711 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work contributes to the development of active haptic exploration
strategies of surfaces using robotic hands in environments with an unknown
structure. The architecture of the proposed approach consists two main Bayesian
models, implementing the touch attention mechanisms of the system. The model
pi_per perceives... | [
{
"created": "Mon, 22 Sep 2014 16:07:42 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Martins",
"Ricardo",
""
],
[
"Ferreira",
"João Filipe",
""
],
[
"Dias",
"Jorge",
""
]
] | This work contributes to the development of active haptic exploration strategies of surfaces using robotic hands in environments with an unknown structure. The architecture of the proposed approach consists two main Bayesian models, implementing the touch attention mechanisms of the system. The model pi_per perceives a... |
2307.10311 | Arnab Purkayastha | Shobhit Aggarwal, Arnab Purkayastha | SecureTrack- A contact tracing IoT platform for monitoring infectious
diseases | 22 Pages, 8 figures, To be published in "The Global Interdisciplinary
Green Cities Conference 2023 Business, Engineering, Art, Architecture,
Design, Political Science, International Relations, Applied Science &
Technology. " | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | The COVID-19 pandemic has highlighted the need for innovative solutions to
monitor and control the spread of infectious diseases. With the potential for
future pandemics and the risk of outbreaks particularly in academic
institutions, there is a pressing need for effective approaches to monitor and
manage such diseas... | [
{
"created": "Wed, 19 Jul 2023 01:57:42 GMT",
"version": "v1"
}
] | 2023-07-21 | [
[
"Aggarwal",
"Shobhit",
""
],
[
"Purkayastha",
"Arnab",
""
]
] | The COVID-19 pandemic has highlighted the need for innovative solutions to monitor and control the spread of infectious diseases. With the potential for future pandemics and the risk of outbreaks particularly in academic institutions, there is a pressing need for effective approaches to monitor and manage such diseases... |
2001.05467 | Tong Niu | Tong Niu, Mohit Bansal | AvgOut: A Simple Output-Probability Measure to Eliminate Dull Responses | AAAI 2020 (8 pages) | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many sequence-to-sequence dialogue models tend to generate safe,
uninformative responses. There have been various useful efforts on trying to
eliminate them. However, these approaches either improve decoding algorithms
during inference, rely on hand-crafted features, or employ complex models. In
our work, we build di... | [
{
"created": "Wed, 15 Jan 2020 18:32:06 GMT",
"version": "v1"
}
] | 2020-01-16 | [
[
"Niu",
"Tong",
""
],
[
"Bansal",
"Mohit",
""
]
] | Many sequence-to-sequence dialogue models tend to generate safe, uninformative responses. There have been various useful efforts on trying to eliminate them. However, these approaches either improve decoding algorithms during inference, rely on hand-crafted features, or employ complex models. In our work, we build dial... |
2208.11978 | Andrea Bedin | Andrea Bedin, Federico Chiariotti, Andrea Zanella | Joint Scheduling and Coding for Reliable, Latency-bounded Transmission
over Parallel Wireless Links | 7 pages, 6 figures. Accepted at IEEE Internet of Things Magazine | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | Several novel industrial applications involve human control of vehicles,
cranes, or mobile robots through various high-throughput feedback systems, such
as Virtual Reality (VR) and tactile/haptic signals. The near real-time
interaction between the system and the operator requires strict latency
constraints in packet ... | [
{
"created": "Thu, 25 Aug 2022 10:15:48 GMT",
"version": "v1"
}
] | 2022-08-26 | [
[
"Bedin",
"Andrea",
""
],
[
"Chiariotti",
"Federico",
""
],
[
"Zanella",
"Andrea",
""
]
] | Several novel industrial applications involve human control of vehicles, cranes, or mobile robots through various high-throughput feedback systems, such as Virtual Reality (VR) and tactile/haptic signals. The near real-time interaction between the system and the operator requires strict latency constraints in packet ex... |
2003.02587 | Fuli Feng | Fuli Feng, Xiangnan He, Hanwang Zhang, and Tat-Seng Chua | Cross-GCN: Enhancing Graph Convolutional Network with $k$-Order Feature
Interactions | Submitted to TKDE | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Convolutional Network (GCN) is an emerging technique that performs
learning and reasoning on graph data. It operates feature learning on the graph
structure, through aggregating the features of the neighbor nodes to obtain the
embedding of each target node. Owing to the strong representation power, recent
resea... | [
{
"created": "Thu, 5 Mar 2020 13:05:27 GMT",
"version": "v1"
}
] | 2020-03-06 | [
[
"Feng",
"Fuli",
""
],
[
"He",
"Xiangnan",
""
],
[
"Zhang",
"Hanwang",
""
],
[
"Chua",
"Tat-Seng",
""
]
] | Graph Convolutional Network (GCN) is an emerging technique that performs learning and reasoning on graph data. It operates feature learning on the graph structure, through aggregating the features of the neighbor nodes to obtain the embedding of each target node. Owing to the strong representation power, recent researc... |
1608.06753 | Shiyu Ji | Shiyu Ji | On the Correctness of Inverted Index Based Public-Key Searchable
Encryption Scheme for Multi-time Search | 3 pages, no figure | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this short note we argue that the state-of-art inverted index based public
key searchable encryption scheme proposed by Wang et al may not be completely
correct by giving a counterexample.
| [
{
"created": "Wed, 24 Aug 2016 08:42:17 GMT",
"version": "v1"
}
] | 2016-08-25 | [
[
"Ji",
"Shiyu",
""
]
] | In this short note we argue that the state-of-art inverted index based public key searchable encryption scheme proposed by Wang et al may not be completely correct by giving a counterexample. |
1812.03588 | Rodrigo de Lamare | R. M. Oliveira and R. C. de Lamare | Study of Puncturing Techniques for Polar Codes in 5G Cellular and IoT
Networks | 4 figures, 6 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a puncturing technique based on the channel polarization
index for the design of rate-compatible polar codes in the fifth generation
(5G) of wireless systems. The proposed strategy consists of two steps: we first
generate the codeword message; and then we reduce the length of the codeword
based on... | [
{
"created": "Mon, 10 Dec 2018 00:56:46 GMT",
"version": "v1"
}
] | 2018-12-11 | [
[
"Oliveira",
"R. M.",
""
],
[
"de Lamare",
"R. C.",
""
]
] | This paper presents a puncturing technique based on the channel polarization index for the design of rate-compatible polar codes in the fifth generation (5G) of wireless systems. The proposed strategy consists of two steps: we first generate the codeword message; and then we reduce the length of the codeword based on t... |
2005.04670 | Ali AlSoufi Dr. | Mohammed Ghanem, Ali Alsoufi | Interoperable Framework to Enhance Citizen Services in the Kingdom of
Bahrain | 4 pages, 1 figure, conference paper, 978-1-7281-3012-5/19/$31.00
\c{opyright}2019 IEEE | International Conference on Innovation and Intelligence for
Informatics, Computing, and Technologies (3ICT), University of Bahrain,
Kingdom of Bahrain, September 2019 | 10.1109/3ICT.2019.8910330 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Citizen records are scattered between different state organizations. It
wastes time, effort, and resources for both citizen and organization to
collect, maintain, and update records to fulfill citizen services.
Interoperability is a key element that enables seamless collaboration between
different entities. It requir... | [
{
"created": "Sun, 10 May 2020 14:00:54 GMT",
"version": "v1"
}
] | 2020-05-12 | [
[
"Ghanem",
"Mohammed",
""
],
[
"Alsoufi",
"Ali",
""
]
] | Citizen records are scattered between different state organizations. It wastes time, effort, and resources for both citizen and organization to collect, maintain, and update records to fulfill citizen services. Interoperability is a key element that enables seamless collaboration between different entities. It requires... |
2006.10284 | Savio Sciancalepore | Gabriele Oligeri, Savio Sciancalepore, Roberto Di Pietro | GNSS Spoofing Detection via Opportunistic IRIDIUM Signals | Accepted for the 13th Conference on Security and Privacy in Wireless
and Mobile Networks (WISEC), 2020 | null | 10.1145/3395351.3399350 | null | cs.CR eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study the privately-own IRIDIUM satellite constellation, to
provide a location service that is independent of the GNSS. In particular, we
apply our findings to propose a new GNSS spoofing detection solution,
exploiting unencrypted IRIDIUM Ring Alert (IRA) messages that are broadcast by
IRIDIUM satel... | [
{
"created": "Thu, 18 Jun 2020 05:34:04 GMT",
"version": "v1"
}
] | 2020-06-20 | [
[
"Oligeri",
"Gabriele",
""
],
[
"Sciancalepore",
"Savio",
""
],
[
"Di Pietro",
"Roberto",
""
]
] | In this paper, we study the privately-own IRIDIUM satellite constellation, to provide a location service that is independent of the GNSS. In particular, we apply our findings to propose a new GNSS spoofing detection solution, exploiting unencrypted IRIDIUM Ring Alert (IRA) messages that are broadcast by IRIDIUM satelli... |
cs/0302002 | Thomas Wolf | Matthew Pratola, Thomas Wolf | Optimizing GoTools' Search Heuristics using Genetic Algorithms | 23 pages, to appear in Journal of ICGA | null | null | null | cs.NE | null | GoTools is a program which solves life & death problems in the game of Go.
This paper describes experiments using a Genetic Algorithm to optimize
heuristic weights used by GoTools' tree-search. The complete set of heuristic
weights is composed of different subgroups, each of which can be optimized with
a suitable fit... | [
{
"created": "Sun, 2 Feb 2003 03:30:52 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Pratola",
"Matthew",
""
],
[
"Wolf",
"Thomas",
""
]
] | GoTools is a program which solves life & death problems in the game of Go. This paper describes experiments using a Genetic Algorithm to optimize heuristic weights used by GoTools' tree-search. The complete set of heuristic weights is composed of different subgroups, each of which can be optimized with a suitable fitne... |
1008.2688 | Tomoyuki Yamakami | Tomoyuki Yamakami | A Dichotomy Theorem for the Approximate Counting of Complex-Weighted
Bounded-Degree Boolean CSPs | A4, 10pt, 20 pages. This revised version improves its preliminary
version published under a slightly different title in the Proceedings of the
4th International Conference on Combinatorial Optimization and Applications
(COCOA 2010), Lecture Notes in Computer Science, Springer, Vol.6508 (Part I),
pp.285--299, Ka... | (journal version) Theoretical Computer Science, Vol.447,
pp.120-135, 2012 | 10.1007/978-3-642-17458-2_24 | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We determine the computational complexity of approximately counting the total
weight of variable assignments for every complex-weighted Boolean constraint
satisfaction problem (or CSP) with any number of additional unary (i.e., arity
1) constraints, particularly, when degrees of input instances are bounded from
above... | [
{
"created": "Mon, 16 Aug 2010 15:28:04 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Mar 2011 15:56:29 GMT",
"version": "v2"
},
{
"created": "Sun, 18 Mar 2012 07:26:41 GMT",
"version": "v3"
}
] | 2015-05-19 | [
[
"Yamakami",
"Tomoyuki",
""
]
] | We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1) constraints, particularly, when degrees of input instances are bounded from above b... |
2304.08746 | Naoto Ohsaka | Naoto Ohsaka | On Approximate Reconfigurability of Label Cover | 11 pages | null | null | null | cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a two-prover game $G$ and its two satisfying labelings
$\psi_\mathsf{s}$ and $\psi_\mathsf{t}$, the Label Cover Reconfiguration
problem asks whether $\psi_\mathsf{s}$ can be transformed into
$\psi_\mathsf{t}$ by repeatedly changing the value of a vertex while preserving
any intermediate labeling satisfying $G$.... | [
{
"created": "Tue, 18 Apr 2023 05:48:46 GMT",
"version": "v1"
}
] | 2023-04-19 | [
[
"Ohsaka",
"Naoto",
""
]
] | Given a two-prover game $G$ and its two satisfying labelings $\psi_\mathsf{s}$ and $\psi_\mathsf{t}$, the Label Cover Reconfiguration problem asks whether $\psi_\mathsf{s}$ can be transformed into $\psi_\mathsf{t}$ by repeatedly changing the value of a vertex while preserving any intermediate labeling satisfying $G$. W... |
1407.4032 | Arthur Milchior | Arthur Milchior | A Note on Higher Order and Variable Order Logic over Finite Models | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that descriptive complexity's result extends in High Order Logic to
capture the expressivity of Turing Machine which have a finite number of
alternation and whose time or space is bounded by a finite tower of
exponential. Hence we have a logical characterisation of ELEMENTARY. We also
consider the expressivit... | [
{
"created": "Tue, 15 Jul 2014 15:58:19 GMT",
"version": "v1"
}
] | 2014-07-16 | [
[
"Milchior",
"Arthur",
""
]
] | We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we have a logical characterisation of ELEMENTARY. We also consider the expressivity ... |
1807.00962 | Alex James Dr | Olga Krestinskaya, Alex Pappachen James, Leon O. Chua | Neuro-memristive Circuits for Edge Computing: A review | null | IEEE Transactions on Neural Networks and Learning Systems, 2019 | 10.1109/TNNLS.2019.2899262 | null | cs.ET cs.AI cs.AR cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The volume, veracity, variability, and velocity of data produced from the
ever-increasing network of sensors connected to Internet pose challenges for
power management, scalability, and sustainability of cloud computing
infrastructure. Increasing the data processing capability of edge computing
devices at lower power... | [
{
"created": "Sun, 1 Jul 2018 04:07:23 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Nov 2018 03:55:48 GMT",
"version": "v2"
}
] | 2019-02-19 | [
[
"Krestinskaya",
"Olga",
""
],
[
"James",
"Alex Pappachen",
""
],
[
"Chua",
"Leon O.",
""
]
] | The volume, veracity, variability, and velocity of data produced from the ever-increasing network of sensors connected to Internet pose challenges for power management, scalability, and sustainability of cloud computing infrastructure. Increasing the data processing capability of edge computing devices at lower power r... |
0904.4202 | Emmanuel Lochin | Pierre-Ugo Tournoux, Emmanuel Lochin, Jerome Lacan, Amine Bouabdallah,
Vincent Roca | On-the-fly erasure coding for real-time video applications | null | null | 10.1109/TMM.2011.2126564 | null | cs.NI cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a robust point-to-point transmission scheme: Tetrys,
that relies on a novel on-the-fly erasure coding concept which reduces the
delay for recovering lost data at the receiver side. In current erasure coding
schemes, the packets that are not rebuilt at the receiver side are either lost
or delayed... | [
{
"created": "Mon, 27 Apr 2009 16:09:33 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Feb 2010 07:23:23 GMT",
"version": "v2"
},
{
"created": "Fri, 12 Nov 2010 09:03:43 GMT",
"version": "v3"
},
{
"created": "Tue, 16 Nov 2010 12:41:51 GMT",
"version": "v4"
}
] | 2012-04-03 | [
[
"Tournoux",
"Pierre-Ugo",
""
],
[
"Lochin",
"Emmanuel",
""
],
[
"Lacan",
"Jerome",
""
],
[
"Bouabdallah",
"Amine",
""
],
[
"Roca",
"Vincent",
""
]
] | This paper introduces a robust point-to-point transmission scheme: Tetrys, that relies on a novel on-the-fly erasure coding concept which reduces the delay for recovering lost data at the receiver side. In current erasure coding schemes, the packets that are not rebuilt at the receiver side are either lost or delayed b... |
2003.11789 | Vitor Enes | Vitor Enes, Carlos Baquero, Tuanir Fran\c{c}a Rezende, Alexey Gotsman,
Matthieu Perrin, Pierre Sutra | State-Machine Replication for Planet-Scale Systems (Extended Version) | Extended version of a EuroSys'20 paper | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online applications now routinely replicate their data at multiple sites
around the world. In this paper we present Atlas, the first state-machine
replication protocol tailored for such planet-scale systems. Atlas does not
rely on a distinguished leader, so clients enjoy the same quality of service
independently of t... | [
{
"created": "Thu, 26 Mar 2020 08:24:26 GMT",
"version": "v1"
},
{
"created": "Mon, 18 May 2020 13:19:10 GMT",
"version": "v2"
}
] | 2020-05-19 | [
[
"Enes",
"Vitor",
""
],
[
"Baquero",
"Carlos",
""
],
[
"Rezende",
"Tuanir França",
""
],
[
"Gotsman",
"Alexey",
""
],
[
"Perrin",
"Matthieu",
""
],
[
"Sutra",
"Pierre",
""
]
] | Online applications now routinely replicate their data at multiple sites around the world. In this paper we present Atlas, the first state-machine replication protocol tailored for such planet-scale systems. Atlas does not rely on a distinguished leader, so clients enjoy the same quality of service independently of the... |
1509.04624 | Lingxiang Li | Lingxiang Li and Zhi Chen and Jun Fang and and Athina P. Petropulu | On the Secrecy Capacity of a MIMO Gaussian Wiretap Channel with a
Cooperative Jammer | 13 pages, 7 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the secrecy capacity of a helper-assisted Gaussian wiretap channel
with a source, a legitimate receiver, an eavesdropper and an external helper,
where each terminal is equipped with multiple antennas. Determining the secrecy
capacity in this scenario generally requires solving a nonconvex secrecy rate
maximi... | [
{
"created": "Tue, 15 Sep 2015 16:14:25 GMT",
"version": "v1"
}
] | 2015-09-16 | [
[
"Li",
"Lingxiang",
""
],
[
"Chen",
"Zhi",
""
],
[
"Fang",
"Jun",
""
],
[
"Petropulu",
"and Athina P.",
""
]
] | We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy capacity in this scenario generally requires solving a nonconvex secrecy rate maximiza... |
2306.03021 | Yu-Hsuan Chen | Yu-hsuan Chen, Levent Burak Kara, Jonathan Cagan | Automating Style Analysis and Visualization With Explainable AI -- Case
Studies on Brand Recognition | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Incorporating style-related objectives into shape design has been centrally
important to maximize product appeal. However, stylistic features such as
aesthetics and semantic attributes are hard to codify even for experts. As
such, algorithmic style capture and reuse have not fully benefited from
automated data-driven... | [
{
"created": "Mon, 5 Jun 2023 16:38:11 GMT",
"version": "v1"
}
] | 2023-06-06 | [
[
"Chen",
"Yu-hsuan",
""
],
[
"Kara",
"Levent Burak",
""
],
[
"Cagan",
"Jonathan",
""
]
] | Incorporating style-related objectives into shape design has been centrally important to maximize product appeal. However, stylistic features such as aesthetics and semantic attributes are hard to codify even for experts. As such, algorithmic style capture and reuse have not fully benefited from automated data-driven m... |
1901.00534 | Anna Smagina Mrs | Anna Smagina, Valentina Bozhkova, Sergey Gladilin, Dmitry Nikolaev | Linear colour segmentation revisited | null | Proc. SPIE 11041, Eleventh International Conference on Machine
Vision (ICMV 2018) | 10.1117/12.2523007 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we discuss the known algorithms for linear colour segmentation
based on a physical approach and propose a new modification of segmentation
algorithm. This algorithm is based on a region adjacency graph framework
without a pre-segmentation stage. Proposed edge weight functions are defined
from linear imag... | [
{
"created": "Wed, 2 Jan 2019 21:06:55 GMT",
"version": "v1"
}
] | 2019-03-26 | [
[
"Smagina",
"Anna",
""
],
[
"Bozhkova",
"Valentina",
""
],
[
"Gladilin",
"Sergey",
""
],
[
"Nikolaev",
"Dmitry",
""
]
] | In this work we discuss the known algorithms for linear colour segmentation based on a physical approach and propose a new modification of segmentation algorithm. This algorithm is based on a region adjacency graph framework without a pre-segmentation stage. Proposed edge weight functions are defined from linear image ... |
2103.04536 | Medhat Elsayed | Medhat Elsayed, Melike Erol-Kantarci | AI-enabled Future Wireless Networks: Challenges, Opportunities and Open
Issues | null | IEEE Vehicular Technology Magazine ( Volume: 14, Issue: 3, Sept.
2019) | 10.1109/MVT.2019.2919236 | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | A plethora of demanding services and use cases mandate a revolutionary shift
in the management of future wireless network resources. Indeed, when tight
quality of service demands of applications are combined with increased
complexity of the network, legacy network management routines will become
unfeasible in 6G. Art... | [
{
"created": "Mon, 8 Mar 2021 03:59:41 GMT",
"version": "v1"
}
] | 2021-03-09 | [
[
"Elsayed",
"Medhat",
""
],
[
"Erol-Kantarci",
"Melike",
""
]
] | A plethora of demanding services and use cases mandate a revolutionary shift in the management of future wireless network resources. Indeed, when tight quality of service demands of applications are combined with increased complexity of the network, legacy network management routines will become unfeasible in 6G. Artif... |
1709.07472 | Nicholas Rotella | Nicholas Rotella, Stefan Schaal and Ludovic Righetti | Unsupervised Contact Learning for Humanoid Estimation and Control | Submitted to the IEEE International Conference on Robotics and
Automation (ICRA) 2018 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work presents a method for contact state estimation using fuzzy
clustering to learn contact probability for full, six-dimensional humanoid
contacts. The data required for training is solely from proprioceptive sensors
- endeffector contact wrench sensors and inertial measurement units (IMUs) -
and the method is ... | [
{
"created": "Thu, 21 Sep 2017 18:23:54 GMT",
"version": "v1"
}
] | 2017-09-25 | [
[
"Rotella",
"Nicholas",
""
],
[
"Schaal",
"Stefan",
""
],
[
"Righetti",
"Ludovic",
""
]
] | This work presents a method for contact state estimation using fuzzy clustering to learn contact probability for full, six-dimensional humanoid contacts. The data required for training is solely from proprioceptive sensors - endeffector contact wrench sensors and inertial measurement units (IMUs) - and the method is co... |
1702.02422 | Anas Al-Oraiqat Dr. | Anas M. Al-Oraiqat | Parallel implementation of a vehicle rail dynamical model for multi-core
systems | 8 pages, 9 Figures | International Journal of advanced studies in Computer Science and
Engineering (IJASCSE) 2012 | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This research presents a model of a complex dynamic object running on a
multi-core system. Discretization and numerical integration for multibody
models of vehicle rail elements in the vertical longitudinal plane fluctuations
is considered. The implemented model and solution of the motion differential
equations allow... | [
{
"created": "Wed, 8 Feb 2017 13:45:50 GMT",
"version": "v1"
}
] | 2017-02-09 | [
[
"Al-Oraiqat",
"Anas M.",
""
]
] | This research presents a model of a complex dynamic object running on a multi-core system. Discretization and numerical integration for multibody models of vehicle rail elements in the vertical longitudinal plane fluctuations is considered. The implemented model and solution of the motion differential equations allow e... |
1006.2204 | Nan Rong | Joseph Y. Halpern, Nan Rong, Ashutosh Saxena | MDPs with Unawareness | 11 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Markov decision processes (MDPs) are widely used for modeling decision-making
problems in robotics, automated control, and economics. Traditional MDPs assume
that the decision maker (DM) knows all states and actions. However, this may
not be true in many situations of interest. We define a new framework, MDPs
with un... | [
{
"created": "Fri, 11 Jun 2010 06:18:27 GMT",
"version": "v1"
}
] | 2010-06-14 | [
[
"Halpern",
"Joseph Y.",
""
],
[
"Rong",
"Nan",
""
],
[
"Saxena",
"Ashutosh",
""
]
] | Markov decision processes (MDPs) are widely used for modeling decision-making problems in robotics, automated control, and economics. Traditional MDPs assume that the decision maker (DM) knows all states and actions. However, this may not be true in many situations of interest. We define a new framework, MDPs with unaw... |
2404.09814 | Man Wang | Man Wang, Zheng Shi, Yunfei Li, Xianda Wu, Weiqiang Tan, and Xinrong
Ye | A Novel HARQ-CC Assisted SCMA Scheme | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This letter proposes a novel hybrid automatic repeat request with chase
combining assisted sparse code multiple access (HARQ-CC-SCMA) scheme. Depending
on whether the same superimposed packet are retransmitted, synchronous and
asynchronous modes are considered for retransmissions. Moreover, factor graph
aggregation (... | [
{
"created": "Mon, 15 Apr 2024 14:12:12 GMT",
"version": "v1"
}
] | 2024-04-16 | [
[
"Wang",
"Man",
""
],
[
"Shi",
"Zheng",
""
],
[
"Li",
"Yunfei",
""
],
[
"Wu",
"Xianda",
""
],
[
"Tan",
"Weiqiang",
""
],
[
"Ye",
"Xinrong",
""
]
] | This letter proposes a novel hybrid automatic repeat request with chase combining assisted sparse code multiple access (HARQ-CC-SCMA) scheme. Depending on whether the same superimposed packet are retransmitted, synchronous and asynchronous modes are considered for retransmissions. Moreover, factor graph aggregation (FG... |
1906.03532 | S\'ebastien Arnold | S\'ebastien M. R. Arnold, Pierre-Antoine Manzagol, Reza Babanezhad,
Ioannis Mitliagkas, Nicolas Le Roux | Reducing the variance in online optimization by transporting past
gradients | Open-source implementation available at:
https://github.com/seba-1511/igt.pth | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most stochastic optimization methods use gradients once before discarding
them. While variance reduction methods have shown that reusing past gradients
can be beneficial when there is a finite number of datapoints, they do not
easily extend to the online setting. One issue is the staleness due to using
past gradients... | [
{
"created": "Sat, 8 Jun 2019 22:02:28 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Jun 2019 17:12:22 GMT",
"version": "v2"
}
] | 2019-06-19 | [
[
"Arnold",
"Sébastien M. R.",
""
],
[
"Manzagol",
"Pierre-Antoine",
""
],
[
"Babanezhad",
"Reza",
""
],
[
"Mitliagkas",
"Ioannis",
""
],
[
"Roux",
"Nicolas Le",
""
]
] | Most stochastic optimization methods use gradients once before discarding them. While variance reduction methods have shown that reusing past gradients can be beneficial when there is a finite number of datapoints, they do not easily extend to the online setting. One issue is the staleness due to using past gradients. ... |
1904.05390 | Joshua Brakensiek | Joshua Brakensiek and Aviad Rubinstein | Constant-factor approximation of near-linear edit distance in
near-linear time | 40 pages, 4 figures | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the edit distance between two strings of length $n$ can be
computed within a factor of $f(\epsilon)$ in $n^{1+\epsilon}$ time as long as
the edit distance is at least $n^{1-\delta}$ for some $\delta(\epsilon) > 0$.
| [
{
"created": "Wed, 10 Apr 2019 18:55:56 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Jan 2020 18:54:41 GMT",
"version": "v2"
}
] | 2020-01-29 | [
[
"Brakensiek",
"Joshua",
""
],
[
"Rubinstein",
"Aviad",
""
]
] | We show that the edit distance between two strings of length $n$ can be computed within a factor of $f(\epsilon)$ in $n^{1+\epsilon}$ time as long as the edit distance is at least $n^{1-\delta}$ for some $\delta(\epsilon) > 0$. |
2303.09658 | Min Hua | Min Hua, Cetengfei Zhang, Fanggang Zhang, Zhi Li, Xiaoli Yu, Hongming
Xu, Quan Zhou | Energy Management of Multi-mode Plug-in Hybrid Electric Vehicle using
Multi-agent Deep Reinforcement Learning | null | null | null | null | cs.RO cs.LG cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recently emerging multi-mode plug-in hybrid electric vehicle (PHEV)
technology is one of the pathways making contributions to decarbonization, and
its energy management requires multiple-input and multipleoutput (MIMO)
control. At the present, the existing methods usually decouple the MIMO control
into singleoutp... | [
{
"created": "Thu, 16 Mar 2023 21:31:55 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Aug 2023 00:36:11 GMT",
"version": "v2"
}
] | 2023-08-29 | [
[
"Hua",
"Min",
""
],
[
"Zhang",
"Cetengfei",
""
],
[
"Zhang",
"Fanggang",
""
],
[
"Li",
"Zhi",
""
],
[
"Yu",
"Xiaoli",
""
],
[
"Xu",
"Hongming",
""
],
[
"Zhou",
"Quan",
""
]
] | The recently emerging multi-mode plug-in hybrid electric vehicle (PHEV) technology is one of the pathways making contributions to decarbonization, and its energy management requires multiple-input and multipleoutput (MIMO) control. At the present, the existing methods usually decouple the MIMO control into singleoutput... |
2405.06209 | Corrine Yap | Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap | Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs | null | null | null | null | cs.DS math.CO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the worst-case mixing time of the global Kawasaki dynamics for the
fixed-magnetization Ising model on the class of graphs of maximum degree
$\Delta$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show
that below the tree uniqueness threshold, the Kawasaki dynamics mix rapidly for
all magnet... | [
{
"created": "Fri, 10 May 2024 02:45:54 GMT",
"version": "v1"
}
] | 2024-05-13 | [
[
"Kuchukova",
"Aiya",
""
],
[
"Pappik",
"Marcus",
""
],
[
"Perkins",
"Will",
""
],
[
"Yap",
"Corrine",
""
]
] | We study the worst-case mixing time of the global Kawasaki dynamics for the fixed-magnetization Ising model on the class of graphs of maximum degree $\Delta$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below the tree uniqueness threshold, the Kawasaki dynamics mix rapidly for all magnetiz... |
1611.09564 | Nhien-An Le-Khac | Muhammad Faheem, M-Tahar Kechadi, Nhien-An Le-Khac | Toward a new mobile cloud forensic framework | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Smartphones have created a significant impact on the day to day activities of
every individual. Now a days a wide range of Smartphone applications are
available and it necessitates high computing resources in order to build these
applications. Cloud computing offers enormous resources and extends services to
resource... | [
{
"created": "Tue, 29 Nov 2016 10:53:29 GMT",
"version": "v1"
}
] | 2016-11-30 | [
[
"Faheem",
"Muhammad",
""
],
[
"Kechadi",
"M-Tahar",
""
],
[
"Le-Khac",
"Nhien-An",
""
]
] | Smartphones have created a significant impact on the day to day activities of every individual. Now a days a wide range of Smartphone applications are available and it necessitates high computing resources in order to build these applications. Cloud computing offers enormous resources and extends services to resource-c... |
2101.02522 | Vincent Aranega | Ronie Salgado, Marcus Denker (RMOD), St\'ephane Ducasse (RMOD), Anne
Etien (RMOD), Vincent Aranega (RMOD) | Towards a Smart Data Processing and Storage Model | null | IWST20: International Workshop on Smalltalk Technologies, Sep
2020, Novi Sad, Serbia | null | null | cs.CL cs.PL cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In several domains it is crucial to store and manipulate data whose origin
needs to be completely traceable to guarantee the consistency, trustworthiness
and reliability on the data itself typically for ethical and legal reasons. It
is also important to guarantee that such properties are also carried further
when suc... | [
{
"created": "Thu, 7 Jan 2021 12:52:11 GMT",
"version": "v1"
}
] | 2021-01-08 | [
[
"Salgado",
"Ronie",
"",
"RMOD"
],
[
"Denker",
"Marcus",
"",
"RMOD"
],
[
"Ducasse",
"Stéphane",
"",
"RMOD"
],
[
"Etien",
"Anne",
"",
"RMOD"
],
[
"Aranega",
"Vincent",
"",
"RMOD"
]
] | In several domains it is crucial to store and manipulate data whose origin needs to be completely traceable to guarantee the consistency, trustworthiness and reliability on the data itself typically for ethical and legal reasons. It is also important to guarantee that such properties are also carried further when such ... |
2004.07699 | Stefano Dafarra | Stefano Dafarra | Predictive Whole-Body Control of Humanoid Robot Locomotion | This work is a Ph.D. thesis enclosing the following articles:
arXiv:1705.10638, arXiv:1807.05395, arXiv:2003.04633 and arXiv:2004.12083 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Humanoid robots are machines built with an anthropomorphic shape. Despite
decades of research into the subject, it is still challenging to tackle the
robot locomotion problem from an algorithmic point of view. For example, these
machines cannot achieve a constant forward body movement without exploiting
contacts with... | [
{
"created": "Thu, 16 Apr 2020 15:11:53 GMT",
"version": "v1"
}
] | 2020-04-28 | [
[
"Dafarra",
"Stefano",
""
]
] | Humanoid robots are machines built with an anthropomorphic shape. Despite decades of research into the subject, it is still challenging to tackle the robot locomotion problem from an algorithmic point of view. For example, these machines cannot achieve a constant forward body movement without exploiting contacts with t... |
2106.00641 | Jinlan Fu | Jinlan Fu, Xuanjing Huang, Pengfei Liu | SpanNER: Named Entity Re-/Recognition as Span Prediction | Accepted by ACL 2021 (Main track) | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Recent years have seen the paradigm shift of Named Entity Recognition (NER)
systems from sequence labeling to span prediction. Despite its preliminary
effectiveness, the span prediction model's architectural bias has not been
fully understood. In this paper, we first investigate the strengths and
weaknesses when the ... | [
{
"created": "Tue, 1 Jun 2021 17:11:42 GMT",
"version": "v1"
},
{
"created": "Sun, 6 Jun 2021 04:54:23 GMT",
"version": "v2"
}
] | 2021-06-08 | [
[
"Fu",
"Jinlan",
""
],
[
"Huang",
"Xuanjing",
""
],
[
"Liu",
"Pengfei",
""
]
] | Recent years have seen the paradigm shift of Named Entity Recognition (NER) systems from sequence labeling to span prediction. Despite its preliminary effectiveness, the span prediction model's architectural bias has not been fully understood. In this paper, we first investigate the strengths and weaknesses when the sp... |
2309.00811 | Zhen Shang | Zhen Shang (1), Jin-Kao Hao (2), Fei Ma (1) ((1) School of Economics
and Management, Chang'an University, China, (2) LERIA, Universit\'e d'Angers,
Angers, France) | A double-decomposition based parallel exact algorithm for the feedback
length minimization problem | This paper has been accepted by PeerJ Computer Science on August 28,
2023 | null | 10.7717/peerj-cs.1597 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Product development projects usually contain many interrelated activities
with complex information dependences, which induce activity rework, project
delay and cost overrun. To reduce negative impacts, scheduling interrelated
activities in an appropriate sequence is an important issue for project
managers. This study... | [
{
"created": "Sat, 2 Sep 2023 03:28:59 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Sep 2023 12:49:11 GMT",
"version": "v2"
}
] | 2023-09-14 | [
[
"Shang",
"Zhen",
""
],
[
"Hao",
"Jin-Kao",
""
],
[
"Ma",
"Fei",
""
]
] | Product development projects usually contain many interrelated activities with complex information dependences, which induce activity rework, project delay and cost overrun. To reduce negative impacts, scheduling interrelated activities in an appropriate sequence is an important issue for project managers. This study d... |
1409.5987 | Bo Li | Qizhi Fang, Bo Li, Xiaoming Sun, Jia Zhang, and Jialin Zhang | Computing the Least-core and Nucleolus for Threshold Cardinality
Matching Games | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cooperative games provide a framework for fair and stable profit allocation
in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are
such solution concepts that characterize stability of cooperation. In this
paper, we study the algorithmic issues on the least-core and nucleolus of
threshold car... | [
{
"created": "Sun, 21 Sep 2014 14:19:11 GMT",
"version": "v1"
}
] | 2014-09-23 | [
[
"Fang",
"Qizhi",
""
],
[
"Li",
"Bo",
""
],
[
"Sun",
"Xiaoming",
""
],
[
"Zhang",
"Jia",
""
],
[
"Zhang",
"Jialin",
""
]
] | Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are such solution concepts that characterize stability of cooperation. In this paper, we study the algorithmic issues on the least-core and nucleolus of threshold cardi... |
2402.11547 | Konstantinos Ntougias | Konstantinos Ntougias, Symeon Chatzinotas, Ioannis Krikidis | Hybrid RIS With Sub-Connected Active Partitions: Performance Analysis
and Transmission Design | null | null | null | null | cs.IT eess.SP math.IT | http://creativecommons.org/licenses/by/4.0/ | The emerging reflecting intelligent surface (RIS) technology promises to
enhance the capacity of wireless communication systems via passive reflect
beamforming. However, the product path loss limits its performance gains.
Fully-connected (FC) active RIS, which integrates reflect-type power amplifiers
into the RIS ele... | [
{
"created": "Sun, 18 Feb 2024 11:39:23 GMT",
"version": "v1"
}
] | 2024-02-20 | [
[
"Ntougias",
"Konstantinos",
""
],
[
"Chatzinotas",
"Symeon",
""
],
[
"Krikidis",
"Ioannis",
""
]
] | The emerging reflecting intelligent surface (RIS) technology promises to enhance the capacity of wireless communication systems via passive reflect beamforming. However, the product path loss limits its performance gains. Fully-connected (FC) active RIS, which integrates reflect-type power amplifiers into the RIS eleme... |
2207.08120 | Amihood Amir | Ora Amir and Amihood Amir and Aviezri Fraenkel and David Sarne | On the Practical Power of Automata in Pattern Matching | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The classical pattern matching paradigm is that of seeking occurrences of one
string - the pattern, in another - the text, where both strings are drawn from
an alphabet set $\Sigma$. Assuming the text length is $n$ and the pattern
length is $m$, this problem can naively be solved in time $O(nm)$. In Knuth,
Morris and... | [
{
"created": "Sun, 17 Jul 2022 09:08:13 GMT",
"version": "v1"
}
] | 2022-07-19 | [
[
"Amir",
"Ora",
""
],
[
"Amir",
"Amihood",
""
],
[
"Fraenkel",
"Aviezri",
""
],
[
"Sarne",
"David",
""
]
] | The classical pattern matching paradigm is that of seeking occurrences of one string - the pattern, in another - the text, where both strings are drawn from an alphabet set $\Sigma$. Assuming the text length is $n$ and the pattern length is $m$, this problem can naively be solved in time $O(nm)$. In Knuth, Morris and P... |
2308.05189 | Miguel-\'Angel Fern\'andez-Torres | Miguel-\'Angel Fern\'andez-Torres | Hierarchical Representations for Spatio-Temporal Visual Attention
Modeling and Understanding | PhD thesis | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This PhD. Thesis concerns the study and development of hierarchical
representations for spatio-temporal visual attention modeling and understanding
in video sequences. More specifically, we propose two computational models for
visual attention. First, we present a generative probabilistic model for
context-aware visu... | [
{
"created": "Wed, 9 Aug 2023 18:49:21 GMT",
"version": "v1"
}
] | 2023-08-11 | [
[
"Fernández-Torres",
"Miguel-Ángel",
""
]
] | This PhD. Thesis concerns the study and development of hierarchical representations for spatio-temporal visual attention modeling and understanding in video sequences. More specifically, we propose two computational models for visual attention. First, we present a generative probabilistic model for context-aware visual... |
1711.00549 | Anjishnu Kumar | Anjishnu Kumar, Arpit Gupta, Julian Chan, Sam Tucker, Bjorn
Hoffmeister, Markus Dreyer, Stanislav Peshterliev, Ankur Gandhe, Denis
Filiminov, Ariya Rastrow, Christian Monson and Agnika Kumar | Just ASK: Building an Architecture for Extensible Self-Service Spoken
Language Understanding | Published at the 1st Workshop on Conversational AI at NIPS 2017
(NIPS-WCAI) | null | null | null | cs.CL cs.AI cs.NE cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents the design of the machine learning architecture that
underlies the Alexa Skills Kit (ASK) a large scale Spoken Language
Understanding (SLU) Software Development Kit (SDK) that enables developers to
extend the capabilities of Amazon's virtual assistant, Alexa. At Amazon, the
infrastructure powers o... | [
{
"created": "Wed, 1 Nov 2017 22:10:11 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Nov 2017 09:19:37 GMT",
"version": "v2"
},
{
"created": "Fri, 24 Nov 2017 00:37:00 GMT",
"version": "v3"
},
{
"created": "Fri, 2 Mar 2018 13:58:04 GMT",
"version": "v4"
}
] | 2018-03-05 | [
[
"Kumar",
"Anjishnu",
""
],
[
"Gupta",
"Arpit",
""
],
[
"Chan",
"Julian",
""
],
[
"Tucker",
"Sam",
""
],
[
"Hoffmeister",
"Bjorn",
""
],
[
"Dreyer",
"Markus",
""
],
[
"Peshterliev",
"Stanislav",
""
],
[
... | This paper presents the design of the machine learning architecture that underlies the Alexa Skills Kit (ASK) a large scale Spoken Language Understanding (SLU) Software Development Kit (SDK) that enables developers to extend the capabilities of Amazon's virtual assistant, Alexa. At Amazon, the infrastructure powers ove... |
1802.04122 | Yang Zhang | Yang Zhang, Mathias Humbert, Tahleen Rahman, Cheng-Te Li, Jun Pang,
Michael Backes | Tagvisor: A Privacy Advisor for Sharing Hashtags | WWW 18 | null | null | null | cs.CR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hashtag has emerged as a widely used concept of popular culture and
campaigns, but its implications on people's privacy have not been investigated
so far. In this paper, we present the first systematic analysis of privacy
issues induced by hashtags. We concentrate in particular on location, which is
recognized as one... | [
{
"created": "Mon, 12 Feb 2018 15:35:48 GMT",
"version": "v1"
}
] | 2018-02-13 | [
[
"Zhang",
"Yang",
""
],
[
"Humbert",
"Mathias",
""
],
[
"Rahman",
"Tahleen",
""
],
[
"Li",
"Cheng-Te",
""
],
[
"Pang",
"Jun",
""
],
[
"Backes",
"Michael",
""
]
] | Hashtag has emerged as a widely used concept of popular culture and campaigns, but its implications on people's privacy have not been investigated so far. In this paper, we present the first systematic analysis of privacy issues induced by hashtags. We concentrate in particular on location, which is recognized as one o... |
2004.12108 | Mahawaga Arachchige Pathum Chamikara | M.A.P. Chamikara, P.Bertok, I.Khalil, D.Liu, S.Camtepe | Privacy Preserving Distributed Machine Learning with Federated Learning | null | null | 10.1016/j.comcom.2021.02.014 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Edge computing and distributed machine learning have advanced to a level that
can revolutionize a particular organization. Distributed devices such as the
Internet of Things (IoT) often produce a large amount of data, eventually
resulting in big data that can be vital in uncovering hidden patterns, and
other insights... | [
{
"created": "Sat, 25 Apr 2020 10:51:36 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Feb 2021 02:48:00 GMT",
"version": "v2"
}
] | 2021-03-01 | [
[
"Chamikara",
"M. A. P.",
""
],
[
"Bertok",
"P.",
""
],
[
"Khalil",
"I.",
""
],
[
"Liu",
"D.",
""
],
[
"Camtepe",
"S.",
""
]
] | Edge computing and distributed machine learning have advanced to a level that can revolutionize a particular organization. Distributed devices such as the Internet of Things (IoT) often produce a large amount of data, eventually resulting in big data that can be vital in uncovering hidden patterns, and other insights i... |
2103.00564 | Casper Benjamin Freksen | Casper Benjamin Freksen | An Introduction to Johnson-Lindenstrauss Transforms | The text was previously a main part of the introduction of my PhD
thesis, but it has been adapted to be self contained and serve as a
(hopefully good) starting point for readers interested in the topic | null | null | null | cs.DS cs.LG | http://creativecommons.org/licenses/by/4.0/ | Johnson--Lindenstrauss Transforms are powerful tools for reducing the
dimensionality of data while preserving key characteristics of that data, and
they have found use in many fields from machine learning to differential
privacy and more. This note explains what they are; it gives an overview of
their use and their d... | [
{
"created": "Sun, 28 Feb 2021 16:57:41 GMT",
"version": "v1"
}
] | 2021-03-02 | [
[
"Freksen",
"Casper Benjamin",
""
]
] | Johnson--Lindenstrauss Transforms are powerful tools for reducing the dimensionality of data while preserving key characteristics of that data, and they have found use in many fields from machine learning to differential privacy and more. This note explains what they are; it gives an overview of their use and their dev... |
1902.07958 | Mateus Espadoto | Mateus Espadoto, Nina S. T. Hirata, Alexandru C. Telea | Deep Learning Multidimensional Projections | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dimensionality reduction methods, also known as projections, are frequently
used for exploring multidimensional data in machine learning, data science, and
information visualization. Among these, t-SNE and its variants have become very
popular for their ability to visually separate distinct data clusters. However,
su... | [
{
"created": "Thu, 21 Feb 2019 10:50:44 GMT",
"version": "v1"
}
] | 2019-02-22 | [
[
"Espadoto",
"Mateus",
""
],
[
"Hirata",
"Nina S. T.",
""
],
[
"Telea",
"Alexandru C.",
""
]
] | Dimensionality reduction methods, also known as projections, are frequently used for exploring multidimensional data in machine learning, data science, and information visualization. Among these, t-SNE and its variants have become very popular for their ability to visually separate distinct data clusters. However, such... |
2309.10195 | Bo Peng | Bo Peng, Srinivasan Parthasarathy and Xia Ning | Multi-modality Meets Re-learning: Mitigating Negative Transfer in
Sequential Recommendation | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Learning effective recommendation models from sparse user interactions
represents a fundamental challenge in developing sequential recommendation
methods. Recently, pre-training-based methods have been developed to tackle
this challenge. Though promising, in this paper, we show that existing methods
suffer from the n... | [
{
"created": "Mon, 18 Sep 2023 22:54:36 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Sep 2023 13:25:49 GMT",
"version": "v2"
}
] | 2023-09-21 | [
[
"Peng",
"Bo",
""
],
[
"Parthasarathy",
"Srinivasan",
""
],
[
"Ning",
"Xia",
""
]
] | Learning effective recommendation models from sparse user interactions represents a fundamental challenge in developing sequential recommendation methods. Recently, pre-training-based methods have been developed to tackle this challenge. Though promising, in this paper, we show that existing methods suffer from the not... |
2211.12872 | Ashesh Ashesh | Ashesh, Alexander Krull, Moises Di Sante, Francesco Silvio Pasqualini,
Florian Jug | {\mu}Split: efficient image decomposition for microscopy data | Published at ICCV 2023. 10 pages, 7 figures, 9 pages supplement, 8
supplementary figures | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | We present {\mu}Split, a dedicated approach for trained image decomposition
in the context of fluorescence microscopy images. We find that best results
using regular deep architectures are achieved when large image patches are used
during training, making memory consumption the limiting factor to further
improving pe... | [
{
"created": "Wed, 23 Nov 2022 11:26:24 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Mar 2023 15:19:40 GMT",
"version": "v2"
},
{
"created": "Wed, 22 Mar 2023 10:05:15 GMT",
"version": "v3"
},
{
"created": "Tue, 15 Aug 2023 07:48:36 GMT",
"version": "v4"
},
{
"c... | 2023-08-21 | [
[
"Ashesh",
"",
""
],
[
"Krull",
"Alexander",
""
],
[
"Di Sante",
"Moises",
""
],
[
"Pasqualini",
"Francesco Silvio",
""
],
[
"Jug",
"Florian",
""
]
] | We present {\mu}Split, a dedicated approach for trained image decomposition in the context of fluorescence microscopy images. We find that best results using regular deep architectures are achieved when large image patches are used during training, making memory consumption the limiting factor to further improving perf... |
1603.04690 | Martin Skutella | Martin Skutella | A 2.542-Approximation for Precedence Constrained Single Machine
Scheduling with Release Dates and Total Weighted Completion Time Objective | null | null | null | null | cs.DM math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a $\sqrt{e}/(\sqrt{e}-1)$-approximation algorithm for the
nonpreemptive scheduling problem to minimize the total weighted completion time
of jobs on a single machine subject to release dates and precedence
constraints. The previously best known approximation algorithm dates back to
1997; its performance gu... | [
{
"created": "Tue, 15 Mar 2016 14:07:28 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Apr 2016 22:52:35 GMT",
"version": "v2"
}
] | 2016-04-25 | [
[
"Skutella",
"Martin",
""
]
] | We present a $\sqrt{e}/(\sqrt{e}-1)$-approximation algorithm for the nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on a single machine subject to release dates and precedence constraints. The previously best known approximation algorithm dates back to 1997; its performance guar... |
1511.06654 | Bing Wang | Bing Wang, Gang Wang, Kap Luk Chan and Li Wang | Tracklet Association by Online Target-Specific Metric Learning and
Coherent Dynamics Estimation | IEEE Transactions on Pattern Analysis and Machine Intelligence, in
press, 2016 | null | 10.1109/TPAMI.2016.2551245 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a novel method based on online target-specific
metric learning and coherent dynamics estimation for tracklet (track fragment)
association by network flow optimization in long-term multi-person tracking.
Our proposed framework aims to exploit appearance and motion cues to prevent
identity swi... | [
{
"created": "Fri, 20 Nov 2015 15:48:21 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Apr 2016 03:53:35 GMT",
"version": "v2"
}
] | 2016-04-25 | [
[
"Wang",
"Bing",
""
],
[
"Wang",
"Gang",
""
],
[
"Chan",
"Kap Luk",
""
],
[
"Wang",
"Li",
""
]
] | In this paper, we present a novel method based on online target-specific metric learning and coherent dynamics estimation for tracklet (track fragment) association by network flow optimization in long-term multi-person tracking. Our proposed framework aims to exploit appearance and motion cues to prevent identity switc... |
1504.03413 | Bhavya Kailkhura | Bhavya Kailkhura, Swastik Brahma, Pramod K. Varshney | Consensus based Detection in the Presence of Data Falsification Attacks | null | null | 10.1109/TSIPN.2016.2607119 | null | cs.SY cs.DC stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the problem of detection in distributed networks in the
presence of data falsification (Byzantine) attacks. Detection approaches
considered in the paper are based on fully distributed consensus algorithms,
where all of the nodes exchange information only with their neighbors in the
absence of a f... | [
{
"created": "Tue, 14 Apr 2015 03:43:05 GMT",
"version": "v1"
}
] | 2017-09-29 | [
[
"Kailkhura",
"Bhavya",
""
],
[
"Brahma",
"Swastik",
""
],
[
"Varshney",
"Pramod K.",
""
]
] | This paper considers the problem of detection in distributed networks in the presence of data falsification (Byzantine) attacks. Detection approaches considered in the paper are based on fully distributed consensus algorithms, where all of the nodes exchange information only with their neighbors in the absence of a fus... |
1812.09320 | Antzela Kosta | Antzela Kosta, Nikolaos Pappas, Anthony Ephremides, Vangelis Angelakis | The Cost of Delay in Status Updates and their Value: Non-linear Ageing | arXiv admin note: substantial text overlap with arXiv:1701.06927 | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a status update communication system consisting of a
source-destination link. A stochastic process is observed at the source, where
samples are extracted at random time instances, and delivered to the
destination, thus, providing status updates for the source. In this paper, we
expand the concept of infor... | [
{
"created": "Fri, 21 Dec 2018 13:37:35 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Sep 2019 12:44:23 GMT",
"version": "v2"
}
] | 2019-09-09 | [
[
"Kosta",
"Antzela",
""
],
[
"Pappas",
"Nikolaos",
""
],
[
"Ephremides",
"Anthony",
""
],
[
"Angelakis",
"Vangelis",
""
]
] | We consider a status update communication system consisting of a source-destination link. A stochastic process is observed at the source, where samples are extracted at random time instances, and delivered to the destination, thus, providing status updates for the source. In this paper, we expand the concept of informa... |
2211.08460 | Laura Nicolas-S\'aenz | Laura Nicol\'as-S\'aenz, Agapito Ledezma, Javier Pascau, Arrate
Mu\~noz-Barrutia | ABANICCO: A New Color Space for Multi-Label Pixel Classification and
Color Segmentation | Working Paper | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In any computer vision task involving color images, a necessary step is
classifying pixels according to color and segmenting the respective areas.
However, the development of methods able to successfully complete this task has
proven challenging, mainly due to the gap between human color perception,
linguistic color ... | [
{
"created": "Tue, 15 Nov 2022 19:26:51 GMT",
"version": "v1"
}
] | 2022-11-17 | [
[
"Nicolás-Sáenz",
"Laura",
""
],
[
"Ledezma",
"Agapito",
""
],
[
"Pascau",
"Javier",
""
],
[
"Muñoz-Barrutia",
"Arrate",
""
]
] | In any computer vision task involving color images, a necessary step is classifying pixels according to color and segmenting the respective areas. However, the development of methods able to successfully complete this task has proven challenging, mainly due to the gap between human color perception, linguistic color te... |
1403.6530 | L.A. Prashanth | Prashanth L.A. and Mohammad Ghavamzadeh | Variance-Constrained Actor-Critic Algorithms for Discounted and Average
Reward MDPs | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many sequential decision-making problems we may want to manage risk by
minimizing some measure of variability in rewards in addition to maximizing a
standard criterion. Variance related risk measures are among the most common
risk-sensitive criteria in finance and operations research. However, optimizing
many such... | [
{
"created": "Tue, 25 Mar 2014 23:00:50 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Mar 2015 15:42:31 GMT",
"version": "v2"
}
] | 2015-03-19 | [
[
"A.",
"Prashanth L.",
""
],
[
"Ghavamzadeh",
"Mohammad",
""
]
] | In many sequential decision-making problems we may want to manage risk by minimizing some measure of variability in rewards in addition to maximizing a standard criterion. Variance related risk measures are among the most common risk-sensitive criteria in finance and operations research. However, optimizing many such c... |
1507.00644 | Kevin Houston | Kevin Houston | Compressed Manifold Modes: Fast Calculation and Natural Ordering | null | null | null | null | cs.CG cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressed manifold modes are locally supported analogues of eigenfunctions
of the Laplace-Beltrami operator of a manifold. In this paper we describe an
algorithm for the calculation of modes for discrete manifolds that, in
experiments, requires on average 47% fewer iterations and 44% less time than
the previous algo... | [
{
"created": "Thu, 2 Jul 2015 16:06:26 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Jul 2015 13:40:58 GMT",
"version": "v2"
}
] | 2015-07-14 | [
[
"Houston",
"Kevin",
""
]
] | Compressed manifold modes are locally supported analogues of eigenfunctions of the Laplace-Beltrami operator of a manifold. In this paper we describe an algorithm for the calculation of modes for discrete manifolds that, in experiments, requires on average 47% fewer iterations and 44% less time than the previous algori... |
1709.03456 | Jawad Tayyub | Jawad Tayyub, Majd Hawasly, David C. Hogg and Anthony G. Cohn | CLAD: A Complex and Long Activities Dataset with Rich Crowdsourced
Annotations | null | null | 10.5518/249 | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a novel activity dataset which exhibits real-life and
diverse scenarios of complex, temporally-extended human activities and actions.
The dataset presents a set of videos of actors performing everyday activities
in a natural and unscripted manner. The dataset was recorded using a static
Kinect 2... | [
{
"created": "Mon, 11 Sep 2017 16:01:17 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Sep 2017 16:52:04 GMT",
"version": "v2"
}
] | 2017-09-22 | [
[
"Tayyub",
"Jawad",
""
],
[
"Hawasly",
"Majd",
""
],
[
"Hogg",
"David C.",
""
],
[
"Cohn",
"Anthony G.",
""
]
] | This paper introduces a novel activity dataset which exhibits real-life and diverse scenarios of complex, temporally-extended human activities and actions. The dataset presents a set of videos of actors performing everyday activities in a natural and unscripted manner. The dataset was recorded using a static Kinect 2 s... |
2102.10012 | Paul Weng | Ruibin Bai and Xinan Chen and Zhi-Long Chen and Tianxiang Cui and
Shuhui Gong and Wentao He and Xiaoping Jiang and Huan Jin and Jiahuan Jin and
Graham Kendall and Jiawei Li and Zheng Lu and Jianfeng Ren and Paul Weng and
Ning Xue and Huayan Zhang | Analytics and Machine Learning in Vehicle Routing Research | Submitted to International Journal of Production Research | null | null | null | cs.LG cs.AI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Vehicle Routing Problem (VRP) is one of the most intensively studied
combinatorial optimisation problems for which numerous models and algorithms
have been proposed. To tackle the complexities, uncertainties and dynamics
involved in real-world VRP applications, Machine Learning (ML) methods have
been used in comb... | [
{
"created": "Fri, 19 Feb 2021 16:26:17 GMT",
"version": "v1"
}
] | 2021-02-22 | [
[
"Bai",
"Ruibin",
""
],
[
"Chen",
"Xinan",
""
],
[
"Chen",
"Zhi-Long",
""
],
[
"Cui",
"Tianxiang",
""
],
[
"Gong",
"Shuhui",
""
],
[
"He",
"Wentao",
""
],
[
"Jiang",
"Xiaoping",
""
],
[
"Jin",
"H... | The Vehicle Routing Problem (VRP) is one of the most intensively studied combinatorial optimisation problems for which numerous models and algorithms have been proposed. To tackle the complexities, uncertainties and dynamics involved in real-world VRP applications, Machine Learning (ML) methods have been used in combin... |
1711.06774 | Orcun Karaca | Orcun Karaca, Pier Giuseppe Sessa, Neil Walton, Maryam Kamgarpour | Designing Coalition-Proof Reverse Auctions over Continuous Goods | null | IEEE Transactions on Automatic Control, 64(11), 4803-4810, 2019 | 10.1109/TAC.2019.2908717 | null | cs.GT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates reverse auctions that involve continuous values of
different types of goods, general nonconvex constraints, and second stage
costs. We seek to design the payment rules and conditions under which
coalitions of participants cannot influence the auction outcome in order to
obtain higher collectiv... | [
{
"created": "Fri, 17 Nov 2017 23:43:58 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Dec 2017 12:18:38 GMT",
"version": "v2"
},
{
"created": "Tue, 23 Jan 2018 11:23:59 GMT",
"version": "v3"
},
{
"created": "Thu, 6 Dec 2018 14:44:27 GMT",
"version": "v4"
},
{
"cr... | 2021-07-14 | [
[
"Karaca",
"Orcun",
""
],
[
"Sessa",
"Pier Giuseppe",
""
],
[
"Walton",
"Neil",
""
],
[
"Kamgarpour",
"Maryam",
""
]
] | This paper investigates reverse auctions that involve continuous values of different types of goods, general nonconvex constraints, and second stage costs. We seek to design the payment rules and conditions under which coalitions of participants cannot influence the auction outcome in order to obtain higher collective ... |
1909.06907 | Arjun Akula | Arjun R. Akula, Changsong Liu, Sari Saba-Sadiya, Hongjing Lu, Sinisa
Todorovic, Joyce Y. Chai, Song-Chun Zhu | X-ToM: Explaining with Theory-of-Mind for Gaining Justified Human Trust | A short version of this was presented at CVPR 2019 Workshop on
Explainable AI | null | null | null | cs.AI cs.CV cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new explainable AI (XAI) framework aimed at increasing justified
human trust and reliance in the AI machine through explanations. We pose
explanation as an iterative communication process, i.e. dialog, between the
machine and human user. More concretely, the machine generates sequence of
explanations in ... | [
{
"created": "Sun, 15 Sep 2019 23:24:32 GMT",
"version": "v1"
}
] | 2019-09-17 | [
[
"Akula",
"Arjun R.",
""
],
[
"Liu",
"Changsong",
""
],
[
"Saba-Sadiya",
"Sari",
""
],
[
"Lu",
"Hongjing",
""
],
[
"Todorovic",
"Sinisa",
""
],
[
"Chai",
"Joyce Y.",
""
],
[
"Zhu",
"Song-Chun",
""
]
] | We present a new explainable AI (XAI) framework aimed at increasing justified human trust and reliance in the AI machine through explanations. We pose explanation as an iterative communication process, i.e. dialog, between the machine and human user. More concretely, the machine generates sequence of explanations in a ... |
2106.07445 | Carl-Johann Simon-Gabriel | Carl-Johann Simon-Gabriel and Noman Ahmed Sheikh and Andreas Krause | PopSkipJump: Decision-Based Attack for Probabilistic Classifiers | ICML'21. Code available at https://github.com/cjsg/PopSkipJump . 9
pages & 7 figures in main part, 14 pages & 10 figures in appendix | null | null | null | cs.LG cs.CR cs.CV math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most current classifiers are vulnerable to adversarial examples, small input
perturbations that change the classification output. Many existing attack
algorithms cover various settings, from white-box to black-box classifiers, but
typically assume that the answers are deterministic and often fail when they
are not. W... | [
{
"created": "Mon, 14 Jun 2021 14:13:12 GMT",
"version": "v1"
}
] | 2021-06-15 | [
[
"Simon-Gabriel",
"Carl-Johann",
""
],
[
"Sheikh",
"Noman Ahmed",
""
],
[
"Krause",
"Andreas",
""
]
] | Most current classifiers are vulnerable to adversarial examples, small input perturbations that change the classification output. Many existing attack algorithms cover various settings, from white-box to black-box classifiers, but typically assume that the answers are deterministic and often fail when they are not. We ... |
2210.05243 | Xiangbin Liu | Xiangbin Liu, Junping Du, Meiyu Liang, Ang Li | Cross-modal Search Method of Technology Video based on Adversarial
Learning and Feature Fusion | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Technology videos contain rich multi-modal information. In cross-modal
information search, the data features of different modalities cannot be
compared directly, so the semantic gap between different modalities is a key
problem that needs to be solved. To address the above problems, this paper
proposes a novel Featur... | [
{
"created": "Tue, 11 Oct 2022 08:17:31 GMT",
"version": "v1"
}
] | 2022-10-12 | [
[
"Liu",
"Xiangbin",
""
],
[
"Du",
"Junping",
""
],
[
"Liang",
"Meiyu",
""
],
[
"Li",
"Ang",
""
]
] | Technology videos contain rich multi-modal information. In cross-modal information search, the data features of different modalities cannot be compared directly, so the semantic gap between different modalities is a key problem that needs to be solved. To address the above problems, this paper proposes a novel Feature ... |
1303.3164 | Uma Sawant | Uma Sawant and Soumen Chakrabarti | Features and Aggregators for Web-scale Entity Search | 10 pages, 12 figures including tables | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We focus on two research issues in entity search: scoring a document or
snippet that potentially supports a candidate entity, and aggregating scores
from different snippets into an entity score. Proximity scoring has been
studied in IR outside the scope of entity search. However, aggregation has been
hardwired except... | [
{
"created": "Wed, 13 Mar 2013 14:06:49 GMT",
"version": "v1"
}
] | 2013-03-14 | [
[
"Sawant",
"Uma",
""
],
[
"Chakrabarti",
"Soumen",
""
]
] | We focus on two research issues in entity search: scoring a document or snippet that potentially supports a candidate entity, and aggregating scores from different snippets into an entity score. Proximity scoring has been studied in IR outside the scope of entity search. However, aggregation has been hardwired except i... |
2208.07624 | Rosalia Tufano | Rosalia Tufano, Emad Aghajani, Gabriele Bavota | Don't Reinvent the Wheel: Towards Automatic Replacement of Custom
Implementations with APIs | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reusing code is a common practice in software development: It helps
developers speedup the implementation task while also reducing the chances of
introducing bugs, given the assumption that the reused code has been tested,
possibly in production. Despite these benefits, opportunities for reuse are not
always in plain... | [
{
"created": "Tue, 16 Aug 2022 09:20:00 GMT",
"version": "v1"
}
] | 2022-08-17 | [
[
"Tufano",
"Rosalia",
""
],
[
"Aghajani",
"Emad",
""
],
[
"Bavota",
"Gabriele",
""
]
] | Reusing code is a common practice in software development: It helps developers speedup the implementation task while also reducing the chances of introducing bugs, given the assumption that the reused code has been tested, possibly in production. Despite these benefits, opportunities for reuse are not always in plain s... |
1912.10558 | Renuka Sindhgatta | Renuka Sindhgatta, Chun Ouyang, Catarina Moreira | Exploring Interpretability for Predictive Process Analytics | 15 pages, 7 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern predictive analytics underpinned by machine learning techniques has
become a key enabler to the automation of data-driven decision making. In the
context of business process management, predictive analytics has been applied
to making predictions about the future state of an ongoing business process
instance, f... | [
{
"created": "Sun, 22 Dec 2019 23:09:34 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Mar 2020 10:42:45 GMT",
"version": "v2"
},
{
"created": "Mon, 8 Jun 2020 12:09:15 GMT",
"version": "v3"
}
] | 2020-06-09 | [
[
"Sindhgatta",
"Renuka",
""
],
[
"Ouyang",
"Chun",
""
],
[
"Moreira",
"Catarina",
""
]
] | Modern predictive analytics underpinned by machine learning techniques has become a key enabler to the automation of data-driven decision making. In the context of business process management, predictive analytics has been applied to making predictions about the future state of an ongoing business process instance, for... |
2406.15494 | Laszlo Kish | Mehmet Yildirim, Nasir Kenarangui, Robert Balog, Laszlo B. Kish,
Chanan Singh | Simple Cracking of (Noise-Based) Dynamic Watermarking in Smart Grids | Accepted for publication in Fluctuation and Noise Letters | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Previous research employing a conceptual approach with a digital twin has
demonstrated that (noise-based) dynamic watermarking is incapable of providing
unconditional security in smart electrical grid systems. However, the
implementation of digital twins can be prohibitively costly or infeasible due
to limited availa... | [
{
"created": "Tue, 18 Jun 2024 23:24:22 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Jun 2024 08:29:40 GMT",
"version": "v2"
}
] | 2024-06-28 | [
[
"Yildirim",
"Mehmet",
""
],
[
"Kenarangui",
"Nasir",
""
],
[
"Balog",
"Robert",
""
],
[
"Kish",
"Laszlo B.",
""
],
[
"Singh",
"Chanan",
""
]
] | Previous research employing a conceptual approach with a digital twin has demonstrated that (noise-based) dynamic watermarking is incapable of providing unconditional security in smart electrical grid systems. However, the implementation of digital twins can be prohibitively costly or infeasible due to limited availabl... |
2303.15940 | Gege Qi | Qi Gege and Yuefeng Chen and Xiaofeng Mao and Yao Zhu and Binyuan Hui
and Xiaodan Li and Rong Zhang and Hui Xue | TransAudio: Towards the Transferable Adversarial Audio Attack via
Learning Contextualized Perturbations | null | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a transfer-based attack against Automatic Speech Recognition (ASR)
systems, attacks are unable to access the architecture and parameters of the
target model. Existing attack methods are mostly investigated in voice
assistant scenarios with restricted voice commands, prohibiting their
applicability to more general ... | [
{
"created": "Tue, 28 Mar 2023 12:53:02 GMT",
"version": "v1"
}
] | 2023-03-29 | [
[
"Gege",
"Qi",
""
],
[
"Chen",
"Yuefeng",
""
],
[
"Mao",
"Xiaofeng",
""
],
[
"Zhu",
"Yao",
""
],
[
"Hui",
"Binyuan",
""
],
[
"Li",
"Xiaodan",
""
],
[
"Zhang",
"Rong",
""
],
[
"Xue",
"Hui",
""... | In a transfer-based attack against Automatic Speech Recognition (ASR) systems, attacks are unable to access the architecture and parameters of the target model. Existing attack methods are mostly investigated in voice assistant scenarios with restricted voice commands, prohibiting their applicability to more general AS... |
0908.3361 | Gene Golovchinsky | Laurent Denoue, Scott Carter, John Adcock, Gene Golovchinsky, and
Andreas Girgensohn | WebNC: efficient sharing of web applications | Presented at WWW 2009, Madrid, Spain | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | WebNC is a system for efficiently sharing, retrieving and viewing web
applications. Unlike existing screencasting and screensharing tools, WebNC is
optimized to work with web pages where a lot of scrolling happens. WebNC uses a
tile-based encoding to capture, transmit and deliver web applications, and
relies only on ... | [
{
"created": "Mon, 24 Aug 2009 05:34:57 GMT",
"version": "v1"
}
] | 2009-08-25 | [
[
"Denoue",
"Laurent",
""
],
[
"Carter",
"Scott",
""
],
[
"Adcock",
"John",
""
],
[
"Golovchinsky",
"Gene",
""
],
[
"Girgensohn",
"Andreas",
""
]
] | WebNC is a system for efficiently sharing, retrieving and viewing web applications. Unlike existing screencasting and screensharing tools, WebNC is optimized to work with web pages where a lot of scrolling happens. WebNC uses a tile-based encoding to capture, transmit and deliver web applications, and relies only on dy... |
1503.07551 | Helio M. de Oliveira | P. Carrion, H.M. de Oliveira and R.M. Campello de Souza | A Low-throughput Wavelet-based Steganography Audio Scheme | 2 pages, 1 figure, conference: 8th Brazilian Symposium on Information
and Computer System Security, 2008, Gramado, RS, Brazil | null | null | null | cs.MM cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents the preliminary of a novel scheme of steganography, and
introduces the idea of combining two secret keys in the operation. The first
secret key encrypts the text using a standard cryptographic scheme (e.g. IDEA,
SAFER+, etc.) prior to the wavelet audio decomposition. The way in which the
cipher te... | [
{
"created": "Thu, 5 Feb 2015 03:15:25 GMT",
"version": "v1"
}
] | 2015-03-27 | [
[
"Carrion",
"P.",
""
],
[
"de Oliveira",
"H. M.",
""
],
[
"de Souza",
"R. M. Campello",
""
]
] | This paper presents the preliminary of a novel scheme of steganography, and introduces the idea of combining two secret keys in the operation. The first secret key encrypts the text using a standard cryptographic scheme (e.g. IDEA, SAFER+, etc.) prior to the wavelet audio decomposition. The way in which the cipher text... |
2307.09683 | Qiao Jin | Qiao Jin, Robert Leaman, Zhiyong Lu | PubMed and Beyond: Biomedical Literature Search in the Age of Artificial
Intelligence | 27 pages, 6 figures, 36 tools | eBioMedicine, 2024 | 10.1016/j.ebiom.2024.104988 | null | cs.IR cs.AI cs.DL | http://creativecommons.org/licenses/by/4.0/ | Biomedical research yields a wealth of information, much of which is only
accessible through the literature. Consequently, literature search is an
essential tool for building on prior knowledge in clinical and biomedical
research. Although recent improvements in artificial intelligence have expanded
functionality bey... | [
{
"created": "Tue, 18 Jul 2023 23:35:53 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jul 2023 15:41:03 GMT",
"version": "v2"
},
{
"created": "Thu, 21 Sep 2023 13:55:48 GMT",
"version": "v3"
}
] | 2024-04-10 | [
[
"Jin",
"Qiao",
""
],
[
"Leaman",
"Robert",
""
],
[
"Lu",
"Zhiyong",
""
]
] | Biomedical research yields a wealth of information, much of which is only accessible through the literature. Consequently, literature search is an essential tool for building on prior knowledge in clinical and biomedical research. Although recent improvements in artificial intelligence have expanded functionality beyon... |
2311.07329 | Huanyu Wu | Huanyu Wu, Chentao Yue, Lei Zhang, Yonghui Li, and Muhammad Ali Imran | When Distributed Consensus Meets Wireless Connected Autonomous Systems:
A Review and A DAG-based Approach | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The connected and autonomous systems (CAS) and auto-driving era is coming
into our life. To support CAS applications such as AI-driven decision-making
and blockchain-based smart data management platform, data and message
exchange/dissemination is a fundamental element. The distributed message
broadcast and forward pr... | [
{
"created": "Mon, 13 Nov 2023 13:31:53 GMT",
"version": "v1"
}
] | 2023-11-14 | [
[
"Wu",
"Huanyu",
""
],
[
"Yue",
"Chentao",
""
],
[
"Zhang",
"Lei",
""
],
[
"Li",
"Yonghui",
""
],
[
"Imran",
"Muhammad Ali",
""
]
] | The connected and autonomous systems (CAS) and auto-driving era is coming into our life. To support CAS applications such as AI-driven decision-making and blockchain-based smart data management platform, data and message exchange/dissemination is a fundamental element. The distributed message broadcast and forward prot... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.