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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2402.02475 | Jiaxiang Dong | Jiaxiang Dong, Haixu Wu, Yuxuan Wang, Yunzhong Qiu, Li Zhang, Jianmin
Wang, Mingsheng Long | TimeSiam: A Pre-Training Framework for Siamese Time-Series Modeling | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time series pre-training has recently garnered wide attention for its
potential to reduce labeling expenses and benefit various downstream tasks.
Prior methods are mainly based on pre-training techniques well-acknowledged in
vision or language, such as masked modeling and contrastive learning. However,
randomly maski... | [
{
"created": "Sun, 4 Feb 2024 13:10:51 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Jun 2024 07:46:26 GMT",
"version": "v2"
}
] | 2024-06-10 | [
[
"Dong",
"Jiaxiang",
""
],
[
"Wu",
"Haixu",
""
],
[
"Wang",
"Yuxuan",
""
],
[
"Qiu",
"Yunzhong",
""
],
[
"Zhang",
"Li",
""
],
[
"Wang",
"Jianmin",
""
],
[
"Long",
"Mingsheng",
""
]
] | Time series pre-training has recently garnered wide attention for its potential to reduce labeling expenses and benefit various downstream tasks. Prior methods are mainly based on pre-training techniques well-acknowledged in vision or language, such as masked modeling and contrastive learning. However, randomly masking... |
1709.03187 | Darren Chitty | Darren M. Chitty | Applying ACO To Large Scale TSP Instances | null | UK Workshop on Computational Intelligence, pp. 104-118. Springer,
Cham, 2017 | 10.1007/978-3-319-66939-7_9 | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ant Colony Optimisation (ACO) is a well known metaheuristic that has proven
successful at solving Travelling Salesman Problems (TSP). However, ACO suffers
from two issues; the first is that the technique has significant memory
requirements for storing pheromone levels on edges between cities and second,
the iterative... | [
{
"created": "Sun, 10 Sep 2017 22:21:36 GMT",
"version": "v1"
}
] | 2017-09-12 | [
[
"Chitty",
"Darren M.",
""
]
] | Ant Colony Optimisation (ACO) is a well known metaheuristic that has proven successful at solving Travelling Salesman Problems (TSP). However, ACO suffers from two issues; the first is that the technique has significant memory requirements for storing pheromone levels on edges between cities and second, the iterative p... |
2010.13814 | Constantin Orasan | Hadeel Saadany, Constantin Orasan | Is it Great or Terrible? Preserving Sentiment in Neural Machine
Translation of Arabic Reviews | null | Proceedings of the Fifth Arabic Natural Language Processing
Workshop WANLP 2020 | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Since the advent of Neural Machine Translation (NMT) approaches there has
been a tremendous improvement in the quality of automatic translation. However,
NMT output still lacks accuracy in some low-resource languages and sometimes
makes major errors that need extensive post-editing. This is particularly
noticeable wi... | [
{
"created": "Mon, 26 Oct 2020 18:01:52 GMT",
"version": "v1"
}
] | 2021-10-01 | [
[
"Saadany",
"Hadeel",
""
],
[
"Orasan",
"Constantin",
""
]
] | Since the advent of Neural Machine Translation (NMT) approaches there has been a tremendous improvement in the quality of automatic translation. However, NMT output still lacks accuracy in some low-resource languages and sometimes makes major errors that need extensive post-editing. This is particularly noticeable with... |
1712.03931 | Manolis Savva | Manolis Savva, Angel X. Chang, Alexey Dosovitskiy, Thomas Funkhouser,
Vladlen Koltun | MINOS: Multimodal Indoor Simulator for Navigation in Complex
Environments | MINOS is a simulator designed to support research on end-to-end
navigation | null | null | null | cs.LG cs.AI cs.CV cs.GR cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present MINOS, a simulator designed to support the development of
multisensory models for goal-directed navigation in complex indoor
environments. The simulator leverages large datasets of complex 3D environments
and supports flexible configuration of multimodal sensor suites. We use MINOS
to benchmark deep-learni... | [
{
"created": "Mon, 11 Dec 2017 18:24:58 GMT",
"version": "v1"
}
] | 2017-12-12 | [
[
"Savva",
"Manolis",
""
],
[
"Chang",
"Angel X.",
""
],
[
"Dosovitskiy",
"Alexey",
""
],
[
"Funkhouser",
"Thomas",
""
],
[
"Koltun",
"Vladlen",
""
]
] | We present MINOS, a simulator designed to support the development of multisensory models for goal-directed navigation in complex indoor environments. The simulator leverages large datasets of complex 3D environments and supports flexible configuration of multimodal sensor suites. We use MINOS to benchmark deep-learning... |
1909.08058 | Shadi Albarqouni Ph.D. | Agnieszka Tomczack, Nassir Navab, Shadi Albarqouni | Learn to Estimate Labels Uncertainty for Quality Assurance | Under Review | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Learning sets the state-of-the-art in many challenging tasks showing
outstanding performance in a broad range of applications. Despite its success,
it still lacks robustness hindering its adoption in medical applications.
Modeling uncertainty, through Bayesian Inference and Monte-Carlo dropout, has
been successf... | [
{
"created": "Tue, 17 Sep 2019 19:43:57 GMT",
"version": "v1"
}
] | 2019-09-19 | [
[
"Tomczack",
"Agnieszka",
""
],
[
"Navab",
"Nassir",
""
],
[
"Albarqouni",
"Shadi",
""
]
] | Deep Learning sets the state-of-the-art in many challenging tasks showing outstanding performance in a broad range of applications. Despite its success, it still lacks robustness hindering its adoption in medical applications. Modeling uncertainty, through Bayesian Inference and Monte-Carlo dropout, has been successful... |
2208.01232 | Dazhen Deng | Dazhen Deng, Aoyu Wu, Huamin Qu, Yingcai Wu | DashBot: Insight-Driven Dashboard Generation Based on Deep Reinforcement
Learning | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Analytical dashboards are popular in business intelligence to facilitate
insight discovery with multiple charts. However, creating an effective
dashboard is highly demanding, which requires users to have adequate data
analysis background and be familiar with professional tools, such as Power BI.
To create a dashboard... | [
{
"created": "Tue, 2 Aug 2022 03:48:02 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Aug 2022 02:50:08 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Sep 2022 04:37:18 GMT",
"version": "v3"
}
] | 2022-09-14 | [
[
"Deng",
"Dazhen",
""
],
[
"Wu",
"Aoyu",
""
],
[
"Qu",
"Huamin",
""
],
[
"Wu",
"Yingcai",
""
]
] | Analytical dashboards are popular in business intelligence to facilitate insight discovery with multiple charts. However, creating an effective dashboard is highly demanding, which requires users to have adequate data analysis background and be familiar with professional tools, such as Power BI. To create a dashboard, ... |
1611.05250 | Jose Caballero | Jose Caballero, Christian Ledig, Andrew Aitken, Alejandro Acosta,
Johannes Totz, Zehan Wang, Wenzhe Shi | Real-Time Video Super-Resolution with Spatio-Temporal Networks and
Motion Compensation | Changes: * Uploaded Vid4 results (footnote 1). * Added references
[14, 29] as spatial-transformer prior art. * Fixed typos | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional neural networks have enabled accurate image super-resolution in
real-time. However, recent attempts to benefit from temporal correlations in
video super-resolution have been limited to naive or inefficient architectures.
In this paper, we introduce spatio-temporal sub-pixel convolution networks that
eff... | [
{
"created": "Wed, 16 Nov 2016 12:25:08 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Apr 2017 11:53:26 GMT",
"version": "v2"
}
] | 2017-04-11 | [
[
"Caballero",
"Jose",
""
],
[
"Ledig",
"Christian",
""
],
[
"Aitken",
"Andrew",
""
],
[
"Acosta",
"Alejandro",
""
],
[
"Totz",
"Johannes",
""
],
[
"Wang",
"Zehan",
""
],
[
"Shi",
"Wenzhe",
""
]
] | Convolutional neural networks have enabled accurate image super-resolution in real-time. However, recent attempts to benefit from temporal correlations in video super-resolution have been limited to naive or inefficient architectures. In this paper, we introduce spatio-temporal sub-pixel convolution networks that effec... |
1302.1419 | Lixin Shen | Lixin Shen and Bruce W. Suter | Blind One-Bit Compressive Sampling | 27 pages and 10 figures | null | null | null | cs.IT math.IT math.NA | http://creativecommons.org/licenses/publicdomain/ | The problem of 1-bit compressive sampling is addressed in this paper. We
introduce an optimization model for reconstruction of sparse signals from 1-bit
measurements. The model targets a solution that has the least l0-norm among all
signals satisfying consistency constraints stemming from the 1-bit
measurements. An a... | [
{
"created": "Wed, 6 Feb 2013 16:16:47 GMT",
"version": "v1"
}
] | 2013-02-07 | [
[
"Shen",
"Lixin",
""
],
[
"Suter",
"Bruce W.",
""
]
] | The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least l0-norm among all signals satisfying consistency constraints stemming from the 1-bit measurements. An alg... |
1804.05017 | Yangming Zhou | Qi Wang, Yuhang Xia, Yangming Zhou, Tong Ruan, Daqi Gao, Ping He | Incorporating Dictionaries into Deep Neural Networks for the Chinese
Clinical Named Entity Recognition | 21 pages, 6 figures | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clinical Named Entity Recognition (CNER) aims to identify and classify
clinical terms such as diseases, symptoms, treatments, exams, and body parts in
electronic health records, which is a fundamental and crucial task for clinical
and translational research. In recent years, deep neural networks have achieved
signifi... | [
{
"created": "Fri, 13 Apr 2018 16:36:44 GMT",
"version": "v1"
}
] | 2018-04-16 | [
[
"Wang",
"Qi",
""
],
[
"Xia",
"Yuhang",
""
],
[
"Zhou",
"Yangming",
""
],
[
"Ruan",
"Tong",
""
],
[
"Gao",
"Daqi",
""
],
[
"He",
"Ping",
""
]
] | Clinical Named Entity Recognition (CNER) aims to identify and classify clinical terms such as diseases, symptoms, treatments, exams, and body parts in electronic health records, which is a fundamental and crucial task for clinical and translational research. In recent years, deep neural networks have achieved significa... |
1707.05233 | Marek Rei | Marek Rei | Detecting Off-topic Responses to Visual Prompts | The 12th Workshop on Innovative Use of NLP for Building Educational
Applications (BEA 2017) | null | null | null | cs.CL cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automated methods for essay scoring have made great progress in recent years,
achieving accuracies very close to human annotators. However, a known weakness
of such automated scorers is not taking into account the semantic relevance of
the submitted text. While there is existing work on detecting answer relevance
giv... | [
{
"created": "Mon, 17 Jul 2017 15:31:20 GMT",
"version": "v1"
}
] | 2017-07-18 | [
[
"Rei",
"Marek",
""
]
] | Automated methods for essay scoring have made great progress in recent years, achieving accuracies very close to human annotators. However, a known weakness of such automated scorers is not taking into account the semantic relevance of the submitted text. While there is existing work on detecting answer relevance given... |
2305.07537 | Junjia Chen | Junjia Chen and Zhibin Pan | Saturated Non-Monotonic Activation Functions | null | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Activation functions are essential to deep learning networks. Popular and
versatile activation functions are mostly monotonic functions, some
non-monotonic activation functions are being explored and show promising
performance. But by introducing non-monotonicity, they also alter the positive
input, which is proved t... | [
{
"created": "Fri, 12 May 2023 15:01:06 GMT",
"version": "v1"
},
{
"created": "Thu, 25 May 2023 06:41:18 GMT",
"version": "v2"
}
] | 2023-05-26 | [
[
"Chen",
"Junjia",
""
],
[
"Pan",
"Zhibin",
""
]
] | Activation functions are essential to deep learning networks. Popular and versatile activation functions are mostly monotonic functions, some non-monotonic activation functions are being explored and show promising performance. But by introducing non-monotonicity, they also alter the positive input, which is proved to ... |
2311.15842 | Mathieu Ducroux | Mathieu Ducroux | IPv6 Bitcoin-Certified Addresses | 8 pages, 2 figures, 3 tables, to be published in 2023 IEEE Future
Networks World Forum (FNWF) | null | 10.1109/FNWF58287.2023.10520605 | null | cs.CR cs.NI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | A pivotal feature of IPv6 is its plug-and-play capability that enables hosts
to integrate seamlessly into networks. In the absence of a trusted authority or
security infrastructure, the challenge for hosts is generating their own
address and verifying ownership of others. Cryptographically Generated
Addresses (CGA) s... | [
{
"created": "Mon, 27 Nov 2023 14:08:31 GMT",
"version": "v1"
}
] | 2024-06-19 | [
[
"Ducroux",
"Mathieu",
""
]
] | A pivotal feature of IPv6 is its plug-and-play capability that enables hosts to integrate seamlessly into networks. In the absence of a trusted authority or security infrastructure, the challenge for hosts is generating their own address and verifying ownership of others. Cryptographically Generated Addresses (CGA) sol... |
2208.09163 | Fiona Anting Tan Ms | Fiona Anting Tan, Xinyu Zuo and See-Kiong Ng | UniCausal: Unified Benchmark and Repository for Causal Text Mining | 15 pages include References | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Current causal text mining datasets vary in objectives, data coverage, and
annotation schemes. These inconsistent efforts prevent modeling capabilities
and fair comparisons of model performance. Furthermore, few datasets include
cause-effect span annotations, which are needed for end-to-end causal relation
extraction... | [
{
"created": "Fri, 19 Aug 2022 06:14:05 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Apr 2023 09:02:50 GMT",
"version": "v2"
}
] | 2023-04-17 | [
[
"Tan",
"Fiona Anting",
""
],
[
"Zuo",
"Xinyu",
""
],
[
"Ng",
"See-Kiong",
""
]
] | Current causal text mining datasets vary in objectives, data coverage, and annotation schemes. These inconsistent efforts prevent modeling capabilities and fair comparisons of model performance. Furthermore, few datasets include cause-effect span annotations, which are needed for end-to-end causal relation extraction. ... |
1904.10112 | Yan Yan | Yan Yan, Yi Xu, Qihang Lin, Lijun Zhang, Tianbao Yang | Stochastic Primal-Dual Algorithms with Faster Convergence than
$O(1/\sqrt{T})$ for Problems without Bilinear Structure | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Previous studies on stochastic primal-dual algorithms for solving min-max
problems with faster convergence heavily rely on the bilinear structure of the
problem, which restricts their applicability to a narrowed range of problems.
The main contribution of this paper is the design and analysis of new
stochastic primal... | [
{
"created": "Tue, 23 Apr 2019 01:04:12 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Dec 2019 21:40:26 GMT",
"version": "v2"
}
] | 2019-12-20 | [
[
"Yan",
"Yan",
""
],
[
"Xu",
"Yi",
""
],
[
"Lin",
"Qihang",
""
],
[
"Zhang",
"Lijun",
""
],
[
"Yang",
"Tianbao",
""
]
] | Previous studies on stochastic primal-dual algorithms for solving min-max problems with faster convergence heavily rely on the bilinear structure of the problem, which restricts their applicability to a narrowed range of problems. The main contribution of this paper is the design and analysis of new stochastic primal-d... |
1810.13332 | Sebastien Henry | Siraprapa Wattanakul (DISP), S\'ebastien Henry (DISP), Mohand Lounes
Bentaha (DISP), Napaporn Reeveerakul, Yacine Ouzrout (DISP) | Improving risk management by using smart containers for real-time
traceability | null | 9th International Conference on Logistics and Transport (ICLT
2017), Nov 2017, Bangkok, Thailand. 2017 | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This research proposes implications of application functions by using the
chain traceability data acquired from the Smart Object attached with Extended
Real-time Data (SO-ERD: e.g. smart container, smart pallet, etc.) to improve
risk management at the level of the logistics chain. Recent applications using
traceabili... | [
{
"created": "Wed, 31 Oct 2018 15:22:28 GMT",
"version": "v1"
}
] | 2018-11-01 | [
[
"Wattanakul",
"Siraprapa",
"",
"DISP"
],
[
"Henry",
"Sébastien",
"",
"DISP"
],
[
"Bentaha",
"Mohand Lounes",
"",
"DISP"
],
[
"Reeveerakul",
"Napaporn",
"",
"DISP"
],
[
"Ouzrout",
"Yacine",
"",
"DISP"
]
] | This research proposes implications of application functions by using the chain traceability data acquired from the Smart Object attached with Extended Real-time Data (SO-ERD: e.g. smart container, smart pallet, etc.) to improve risk management at the level of the logistics chain. Recent applications using traceability... |
2202.09312 | Mikhail Khodak | Mikhail Khodak, Maria-Florina Balcan, Ameet Talwalkar, Sergei
Vassilvitskii | Learning Predictions for Algorithms with Predictions | NeurIPS 2022 camera-ready | null | null | null | cs.LG cs.AI cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A burgeoning paradigm in algorithm design is the field of algorithms with
predictions, in which algorithms can take advantage of a possibly-imperfect
prediction of some aspect of the problem. While much work has focused on using
predictions to improve competitive ratios, running times, or other performance
measures, ... | [
{
"created": "Fri, 18 Feb 2022 17:25:43 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Oct 2022 14:08:38 GMT",
"version": "v2"
}
] | 2022-10-18 | [
[
"Khodak",
"Mikhail",
""
],
[
"Balcan",
"Maria-Florina",
""
],
[
"Talwalkar",
"Ameet",
""
],
[
"Vassilvitskii",
"Sergei",
""
]
] | A burgeoning paradigm in algorithm design is the field of algorithms with predictions, in which algorithms can take advantage of a possibly-imperfect prediction of some aspect of the problem. While much work has focused on using predictions to improve competitive ratios, running times, or other performance measures, le... |
1709.09268 | Kamran Kowsari | Kamran Kowsari, Nima Bari, Roman Vichr, Farhad A. Goodarzi | FSL-BM: Fuzzy Supervised Learning with Binary Meta-Feature for
Classification | FICC2018 | null | 10.1007/978-3-030-03405-4_46 | null | cs.LG cs.AI stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a novel real-time Fuzzy Supervised Learning with Binary
Meta-Feature (FSL-BM) for big data classification task. The study of real-time
algorithms addresses several major concerns, which are namely: accuracy, memory
consumption, and ability to stretch assumptions and time complexity. Attaining
a ... | [
{
"created": "Tue, 26 Sep 2017 21:52:41 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Nov 2017 23:34:10 GMT",
"version": "v2"
}
] | 2020-12-09 | [
[
"Kowsari",
"Kamran",
""
],
[
"Bari",
"Nima",
""
],
[
"Vichr",
"Roman",
""
],
[
"Goodarzi",
"Farhad A.",
""
]
] | This paper introduces a novel real-time Fuzzy Supervised Learning with Binary Meta-Feature (FSL-BM) for big data classification task. The study of real-time algorithms addresses several major concerns, which are namely: accuracy, memory consumption, and ability to stretch assumptions and time complexity. Attaining a fa... |
1807.05670 | Arman Ahmadian | Arman Ahmadian and Hyuncheol Park | Wireless Powered Communication Networks: TDD or FDD? | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we compare two common modes of duplexing in wireless powered
communication networks (WPCN); namely TDD and FDD. So far, TDD has been the
most widely used duplexing technique due to its simplicity. Yet, TDD does not
allow the energy transmitter to function continuously, which means to deliver
the same a... | [
{
"created": "Mon, 16 Jul 2018 04:03:20 GMT",
"version": "v1"
}
] | 2018-07-17 | [
[
"Ahmadian",
"Arman",
""
],
[
"Park",
"Hyuncheol",
""
]
] | In this paper, we compare two common modes of duplexing in wireless powered communication networks (WPCN); namely TDD and FDD. So far, TDD has been the most widely used duplexing technique due to its simplicity. Yet, TDD does not allow the energy transmitter to function continuously, which means to deliver the same amo... |
2303.14504 | Frederic Legoll | Francois-Baptiste Cartiaux, Alain Ehrlacher, Frederic Legoll, Alex
Libal and Julien Reygner | Probabilistic formulation of Miner's rule and application to structural
fatigue | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The standard stress-based approach to fatigue is based on the use of S-N
curves. They are obtained by applying cyclic loading of constant amplitude $S$
to identical and standardised specimens until they fail. The S-N curves
actually depend on a reference probability $p$: for a given cycle amplitude
$S$, they provide ... | [
{
"created": "Sat, 25 Mar 2023 15:50:35 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Mar 2023 11:00:04 GMT",
"version": "v2"
}
] | 2023-03-29 | [
[
"Cartiaux",
"Francois-Baptiste",
""
],
[
"Ehrlacher",
"Alain",
""
],
[
"Legoll",
"Frederic",
""
],
[
"Libal",
"Alex",
""
],
[
"Reygner",
"Julien",
""
]
] | The standard stress-based approach to fatigue is based on the use of S-N curves. They are obtained by applying cyclic loading of constant amplitude $S$ to identical and standardised specimens until they fail. The S-N curves actually depend on a reference probability $p$: for a given cycle amplitude $S$, they provide th... |
2307.06737 | Miroslav Purkrabek | Miroslav Purkrabek and Jiri Matas | Improving 2D Human Pose Estimation in Rare Camera Views with Synthetic
Data | https://mirapurkrabek.github.io/RePoGen-paper/ | null | 10.1109/FG59268.2024.10582011 | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Methods and datasets for human pose estimation focus predominantly on side-
and front-view scenarios. We overcome the limitation by leveraging synthetic
data and introduce RePoGen (RarE POses GENerator), an SMPL-based method for
generating synthetic humans with comprehensive control over pose and view.
Experiments on... | [
{
"created": "Thu, 13 Jul 2023 13:17:50 GMT",
"version": "v1"
},
{
"created": "Sat, 20 Apr 2024 11:53:13 GMT",
"version": "v2"
}
] | 2024-07-16 | [
[
"Purkrabek",
"Miroslav",
""
],
[
"Matas",
"Jiri",
""
]
] | Methods and datasets for human pose estimation focus predominantly on side- and front-view scenarios. We overcome the limitation by leveraging synthetic data and introduce RePoGen (RarE POses GENerator), an SMPL-based method for generating synthetic humans with comprehensive control over pose and view. Experiments on t... |
1503.08877 | Michael Isard | Michael Isard, Mart\'in Abadi | Falkirk Wheel: Rollback Recovery for Dataflow Systems | DRAFT work in progress | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new model for rollback recovery in distributed dataflow systems.
We explain existing rollback schemes by assigning a logical time to each event
such as a message delivery. If some processors fail during an execution, the
system rolls back by selecting a set of logical times for each processor. The
effect... | [
{
"created": "Tue, 31 Mar 2015 00:06:05 GMT",
"version": "v1"
}
] | 2015-04-01 | [
[
"Isard",
"Michael",
""
],
[
"Abadi",
"Martín",
""
]
] | We present a new model for rollback recovery in distributed dataflow systems. We explain existing rollback schemes by assigning a logical time to each event such as a message delivery. If some processors fail during an execution, the system rolls back by selecting a set of logical times for each processor. The effect o... |
2407.07436 | Xu Zhu | Xu Zhu, Yufei Ma, Xiaoguang Li, and Tiejun Li | Alternating Subspace Approximate Message Passing | 19 pages, 6 figures | null | null | null | cs.IT math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Numerous renowned algorithms for tackling the compressed sensing problem
employ an alternating strategy, which typically involves data matching in one
module and denoising in another. Based on an in-depth analysis of the
connection between the message passing and operator splitting, we present a
novel approach, the A... | [
{
"created": "Wed, 10 Jul 2024 07:45:31 GMT",
"version": "v1"
}
] | 2024-07-11 | [
[
"Zhu",
"Xu",
""
],
[
"Ma",
"Yufei",
""
],
[
"Li",
"Xiaoguang",
""
],
[
"Li",
"Tiejun",
""
]
] | Numerous renowned algorithms for tackling the compressed sensing problem employ an alternating strategy, which typically involves data matching in one module and denoising in another. Based on an in-depth analysis of the connection between the message passing and operator splitting, we present a novel approach, the Alt... |
1009.2651 | Qiyu Sun | Qiyu Sun and Michael Unser | Left-Inverses of Fractional Laplacian and Sparse Stochastic Processes | Advances in Computational Mathematics, accepted | null | null | null | cs.IT math.IT math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The fractional Laplacian $(-\triangle)^{\gamma/2}$ commutes with the primary
coordination transformations in the Euclidean space $\RR^d$: dilation,
translation and rotation, and has tight link to splines, fractals and stable
Levy processes. For $0<\gamma<d$, its inverse is the classical Riesz potential
$I_\gamma$ whi... | [
{
"created": "Tue, 14 Sep 2010 13:17:51 GMT",
"version": "v1"
}
] | 2010-09-15 | [
[
"Sun",
"Qiyu",
""
],
[
"Unser",
"Michael",
""
]
] | The fractional Laplacian $(-\triangle)^{\gamma/2}$ commutes with the primary coordination transformations in the Euclidean space $\RR^d$: dilation, translation and rotation, and has tight link to splines, fractals and stable Levy processes. For $0<\gamma<d$, its inverse is the classical Riesz potential $I_\gamma$ which... |
1907.01216 | Moshe Kravchik | Moshe Kravchik, Asaf Shabtai | Efficient Cyber Attacks Detection in Industrial Control Systems Using
Lightweight Neural Networks and PCA | null | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Industrial control systems (ICSs) are widely used and vital to industry and
society. Their failure can have severe impact on both economics and human life.
Hence, these systems have become an attractive target for attacks, both
physical and cyber. A number of attack detection methods have been proposed,
however they ... | [
{
"created": "Tue, 2 Jul 2019 07:58:42 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Oct 2019 16:55:00 GMT",
"version": "v2"
}
] | 2019-10-02 | [
[
"Kravchik",
"Moshe",
""
],
[
"Shabtai",
"Asaf",
""
]
] | Industrial control systems (ICSs) are widely used and vital to industry and society. Their failure can have severe impact on both economics and human life. Hence, these systems have become an attractive target for attacks, both physical and cyber. A number of attack detection methods have been proposed, however they ar... |
2407.05549 | Dario Tscholl | Dario Tscholl, Brian Gunter | SSPARE: Space Solar Power Autonomously Reconfigurable Elements | 8 pages, 7 figures, preprint | null | null | null | cs.RO astro-ph.IM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | GEO communication satellites generate significant revenue but can only
function reliably for approximately 10 years on orbit. One of the main drivers
that limits the reliability of a GEO satellite is the electric power system,
and in particular, anomalies related to batteries and degradation of the solar
arrays. Give... | [
{
"created": "Mon, 8 Jul 2024 01:55:57 GMT",
"version": "v1"
}
] | 2024-07-09 | [
[
"Tscholl",
"Dario",
""
],
[
"Gunter",
"Brian",
""
]
] | GEO communication satellites generate significant revenue but can only function reliably for approximately 10 years on orbit. One of the main drivers that limits the reliability of a GEO satellite is the electric power system, and in particular, anomalies related to batteries and degradation of the solar arrays. Given ... |
1206.5959 | David Adjiashvili | David Adjiashvili and Marco Senatore | The Online Replacement Path Problem | 18 pages | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a natural online variant of the replacement path problem. The
\textit{replacement path problem} asks to find for a given graph $G = (V,E)$,
two designated vertices $s,t\in V$ and a shortest $s$-$t$ path $P$ in $G$, a
\textit{replacement path} $P_e$ for every edge $e$ on the path $P$. The
replacement path $P_... | [
{
"created": "Tue, 26 Jun 2012 11:38:44 GMT",
"version": "v1"
}
] | 2012-06-27 | [
[
"Adjiashvili",
"David",
""
],
[
"Senatore",
"Marco",
""
]
] | We study a natural online variant of the replacement path problem. The \textit{replacement path problem} asks to find for a given graph $G = (V,E)$, two designated vertices $s,t\in V$ and a shortest $s$-$t$ path $P$ in $G$, a \textit{replacement path} $P_e$ for every edge $e$ on the path $P$. The replacement path $P_e$... |
1908.03046 | Matej Hoffmann | Petr Svarny, Michael Tesar, Jan Kristof Behrens, Matej Hoffmann | Safe physical HRI: Toward a unified treatment of speed and separation
monitoring together with power and force limiting | 8 pages, 6 figures | Intelligent Robots and Systems (IROS), 2019 IEEE/RSJ International
Conference on, pp. 7574-7581 | 10.1109/IROS40897.2019.8968463 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | So-called collaborative robots are a current trend in industrial robotics.
However, they still face many problems in practical application such as reduced
speed to ascertain their collaborativeness. The standards prescribe two
regimes: (i) speed and separation monitoring and (ii) power and force limiting,
where the f... | [
{
"created": "Thu, 8 Aug 2019 12:58:33 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Aug 2020 08:25:04 GMT",
"version": "v2"
}
] | 2020-09-01 | [
[
"Svarny",
"Petr",
""
],
[
"Tesar",
"Michael",
""
],
[
"Behrens",
"Jan Kristof",
""
],
[
"Hoffmann",
"Matej",
""
]
] | So-called collaborative robots are a current trend in industrial robotics. However, they still face many problems in practical application such as reduced speed to ascertain their collaborativeness. The standards prescribe two regimes: (i) speed and separation monitoring and (ii) power and force limiting, where the for... |
1203.0512 | Martin Bachwerk | Martin Bachwerk and Carl Vogel | Establishing linguistic conventions in task-oriented primeval dialogue | 8 pages, 5 figures. In proceedings of the COST 2102 International
Conference, Budapest, Hungary, September 7-10, 2010, Revised Selected Papers | Analysis of Verbal and Nonverbal Communication and Enactment. The
Processing Issues. Lecture Notes in Computer Science, Volume 6800/2011, 2011,
pp. 48-55 | 10.1007/978-3-642-25775-9_4 | null | cs.CL cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we claim that language is likely to have emerged as a
mechanism for coordinating the solution of complex tasks. To confirm this
thesis, computer simulations are performed based on the coordination task
presented by Garrod & Anderson (1987). The role of success in task-oriented
dialogue is analytically ... | [
{
"created": "Fri, 2 Mar 2012 16:25:13 GMT",
"version": "v1"
}
] | 2012-03-05 | [
[
"Bachwerk",
"Martin",
""
],
[
"Vogel",
"Carl",
""
]
] | In this paper, we claim that language is likely to have emerged as a mechanism for coordinating the solution of complex tasks. To confirm this thesis, computer simulations are performed based on the coordination task presented by Garrod & Anderson (1987). The role of success in task-oriented dialogue is analytically ev... |
2303.04327 | Mrinal Verghese | Mrinal Verghese and Chris Atkeson | Using Memory-Based Learning to Solve Tasks with State-Action Constraints | 8 pages, 3 figures, accepted to the International Conference on
Robotics and Automation 2023 | null | null | null | cs.RO cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Tasks where the set of possible actions depend discontinuously on the state
pose a significant challenge for current reinforcement learning algorithms. For
example, a locked door must be first unlocked, and then the handle turned
before the door can be opened. The sequential nature of these tasks makes
obtaining fina... | [
{
"created": "Wed, 8 Mar 2023 02:00:26 GMT",
"version": "v1"
}
] | 2023-03-09 | [
[
"Verghese",
"Mrinal",
""
],
[
"Atkeson",
"Chris",
""
]
] | Tasks where the set of possible actions depend discontinuously on the state pose a significant challenge for current reinforcement learning algorithms. For example, a locked door must be first unlocked, and then the handle turned before the door can be opened. The sequential nature of these tasks makes obtaining final ... |
1504.06475 | Sebastian Wild | Raphael Reitzig and Sebastian Wild | A Practical and Worst-Case Efficient Algorithm for Divisor Methods of
Apportionment | (v4 adds missing figures in v3) | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Proportional apportionment is the problem of assigning seats to parties
according to their relative share of votes. Divisor methods are the de-facto
standard solution, used in many countries.
In recent literature, there are two algorithms that implement divisor
methods: one by Cheng and Eppstein (ISAAC, 2014) has w... | [
{
"created": "Fri, 24 Apr 2015 11:37:00 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Sep 2015 14:05:14 GMT",
"version": "v2"
},
{
"created": "Wed, 15 Mar 2017 14:39:09 GMT",
"version": "v3"
},
{
"created": "Tue, 5 Dec 2017 16:38:10 GMT",
"version": "v4"
}
] | 2017-12-06 | [
[
"Reitzig",
"Raphael",
""
],
[
"Wild",
"Sebastian",
""
]
] | Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms that implement divisor methods: one by Cheng and Eppstein (ISAAC, 2014) has worst... |
1608.00929 | Hao Tang | Hao Tang, Weiran Wang, Kevin Gimpel, Karen Livescu | Efficient Segmental Cascades for Speech Recognition | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Discriminative segmental models offer a way to incorporate flexible feature
functions into speech recognition. However, their appeal has been limited by
their computational requirements, due to the large number of possible segments
to consider. Multi-pass cascades of segmental models introduce features of
increasing ... | [
{
"created": "Tue, 2 Aug 2016 18:45:53 GMT",
"version": "v1"
}
] | 2016-08-03 | [
[
"Tang",
"Hao",
""
],
[
"Wang",
"Weiran",
""
],
[
"Gimpel",
"Kevin",
""
],
[
"Livescu",
"Karen",
""
]
] | Discriminative segmental models offer a way to incorporate flexible feature functions into speech recognition. However, their appeal has been limited by their computational requirements, due to the large number of possible segments to consider. Multi-pass cascades of segmental models introduce features of increasing co... |
1108.3631 | EPTCS | Vesa Halava (Department of Mathematics, University of Turku), Tero
Harju (Department of Mathematics, University of Turku), Tomi K\"arki
(Department of Mathematics and 2Department of Teacher Education, University
of Turku) | A new proof for the decidability of D0L ultimate periodicity | In Proceedings WORDS 2011, arXiv:1108.3412 | EPTCS 63, 2011, pp. 147-151 | 10.4204/EPTCS.63.20 | null | cs.FL cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give a new proof for the decidability of the D0L ultimate periodicity
problem based on the decidability of p-periodicity of morphic words adapted to
the approach of Harju and Linna.
| [
{
"created": "Thu, 18 Aug 2011 03:53:58 GMT",
"version": "v1"
}
] | 2011-08-19 | [
[
"Halava",
"Vesa",
"",
"Department of Mathematics, University of Turku"
],
[
"Harju",
"Tero",
"",
"Department of Mathematics, University of Turku"
],
[
"Kärki",
"Tomi",
"",
"Department of Mathematics and 2Department of Teacher Education, University\n of Turk... | We give a new proof for the decidability of the D0L ultimate periodicity problem based on the decidability of p-periodicity of morphic words adapted to the approach of Harju and Linna. |
2204.03140 | Yafei Hu | Yafei Hu, Junyi Geng, Chen Wang, John Keller, and Sebastian Scherer | Off-Policy Evaluation with Online Adaptation for Robot Exploration in
Challenging Environments | Published in RA-L 2023 | null | null | null | cs.RO cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomous exploration has many important applications. However, classic
information gain-based or frontier-based exploration only relies on the robot
current state to determine the immediate exploration goal, which lacks the
capability of predicting the value of future states and thus leads to
inefficient exploratio... | [
{
"created": "Thu, 7 Apr 2022 00:46:57 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Jan 2023 19:17:22 GMT",
"version": "v2"
},
{
"created": "Wed, 24 May 2023 20:18:32 GMT",
"version": "v3"
}
] | 2023-05-26 | [
[
"Hu",
"Yafei",
""
],
[
"Geng",
"Junyi",
""
],
[
"Wang",
"Chen",
""
],
[
"Keller",
"John",
""
],
[
"Scherer",
"Sebastian",
""
]
] | Autonomous exploration has many important applications. However, classic information gain-based or frontier-based exploration only relies on the robot current state to determine the immediate exploration goal, which lacks the capability of predicting the value of future states and thus leads to inefficient exploration ... |
2101.11211 | Vinayak Naik | Vinayak Naik and Anish Arora | Harvest: A Reliable and Energy Efficient Bulk Data Collection Service
for Large Scale Wireless Sensor Networks | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | We present a bulk data collection service, Harvest, for energy constrained
wireless sensor nodes. To increase spatial reuse and thereby decrease latency,
Harvest performs concurrent, pipelined exfiltration from multiple nodes to a
base station. To this end, it uses a distance-k coloring of the nodes, notably
with a c... | [
{
"created": "Wed, 27 Jan 2021 05:38:17 GMT",
"version": "v1"
}
] | 2021-01-28 | [
[
"Naik",
"Vinayak",
""
],
[
"Arora",
"Anish",
""
]
] | We present a bulk data collection service, Harvest, for energy constrained wireless sensor nodes. To increase spatial reuse and thereby decrease latency, Harvest performs concurrent, pipelined exfiltration from multiple nodes to a base station. To this end, it uses a distance-k coloring of the nodes, notably with a con... |
1705.00441 | Marzieh Fadaee | Marzieh Fadaee, Arianna Bisazza, Christof Monz | Learning Topic-Sensitive Word Representations | 5 pages, 1 figure, Accepted at ACL 2017 | null | 10.18653/v1/P17-2070 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed word representations are widely used for modeling words in NLP
tasks. Most of the existing models generate one representation per word and do
not consider different meanings of a word. We present two approaches to learn
multiple topic-sensitive representations per word by using Hierarchical
Dirichlet Proc... | [
{
"created": "Mon, 1 May 2017 08:16:56 GMT",
"version": "v1"
}
] | 2018-02-14 | [
[
"Fadaee",
"Marzieh",
""
],
[
"Bisazza",
"Arianna",
""
],
[
"Monz",
"Christof",
""
]
] | Distributed word representations are widely used for modeling words in NLP tasks. Most of the existing models generate one representation per word and do not consider different meanings of a word. We present two approaches to learn multiple topic-sensitive representations per word by using Hierarchical Dirichlet Proces... |
2203.14033 | Qiyu Sun | Qiyu Sun, Jinbao Fang, Wei Xing Zheng, Yang Tang | Aggressive Quadrotor Flight Using Curiosity-Driven Reinforcement
Learning | null | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ability to perform aggressive movements, which are called aggressive
flights, is important for quadrotors during navigation. However, aggressive
quadrotor flights are still a great challenge to practical applications. The
existing solutions to aggressive flights heavily rely on a predefined
trajectory, which is a... | [
{
"created": "Sat, 26 Mar 2022 09:29:23 GMT",
"version": "v1"
}
] | 2022-03-29 | [
[
"Sun",
"Qiyu",
""
],
[
"Fang",
"Jinbao",
""
],
[
"Zheng",
"Wei Xing",
""
],
[
"Tang",
"Yang",
""
]
] | The ability to perform aggressive movements, which are called aggressive flights, is important for quadrotors during navigation. However, aggressive quadrotor flights are still a great challenge to practical applications. The existing solutions to aggressive flights heavily rely on a predefined trajectory, which is a t... |
2102.00519 | Sagi Marcovich | Sagi Marcovich and Eitan Yaakobi | The Zero Cubes Free and Cubes Unique Multidimensional Constraints | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies two families of constraints for two-dimensional and
multidimensional arrays. The first family requires that a multidimensional
array will not contain a cube of zeros of some fixed size and the second
constraint imposes that there will not be two identical cubes of a given size
in the array. These c... | [
{
"created": "Sun, 31 Jan 2021 19:43:18 GMT",
"version": "v1"
}
] | 2021-02-02 | [
[
"Marcovich",
"Sagi",
""
],
[
"Yaakobi",
"Eitan",
""
]
] | This paper studies two families of constraints for two-dimensional and multidimensional arrays. The first family requires that a multidimensional array will not contain a cube of zeros of some fixed size and the second constraint imposes that there will not be two identical cubes of a given size in the array. These con... |
2310.15587 | Lena Sophia Bolliger | Lena S. Bolliger, David R. Reich, Patrick Haller, Deborah N. Jakobi,
Paul Prasse, Lena A. J\"ager | ScanDL: A Diffusion Model for Generating Synthetic Scanpaths on Texts | EMNLP 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Eye movements in reading play a crucial role in psycholinguistic research
studying the cognitive mechanisms underlying human language processing. More
recently, the tight coupling between eye movements and cognition has also been
leveraged for language-related machine learning tasks such as the
interpretability, enha... | [
{
"created": "Tue, 24 Oct 2023 07:52:19 GMT",
"version": "v1"
}
] | 2023-10-25 | [
[
"Bolliger",
"Lena S.",
""
],
[
"Reich",
"David R.",
""
],
[
"Haller",
"Patrick",
""
],
[
"Jakobi",
"Deborah N.",
""
],
[
"Prasse",
"Paul",
""
],
[
"Jäger",
"Lena A.",
""
]
] | Eye movements in reading play a crucial role in psycholinguistic research studying the cognitive mechanisms underlying human language processing. More recently, the tight coupling between eye movements and cognition has also been leveraged for language-related machine learning tasks such as the interpretability, enhanc... |
2402.03289 | Animesh Basak Chowdhury | Matthew DeLorenzo, Animesh Basak Chowdhury, Vasudev Gohil, Shailja
Thakur, Ramesh Karri, Siddharth Garg, Jeyavijayan Rajendran | Make Every Move Count: LLM-based High-Quality RTL Code Generation Using
MCTS | null | null | null | null | cs.LG cs.AI cs.AR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Existing large language models (LLMs) for register transfer level code
generation face challenges like compilation failures and suboptimal power,
performance, and area (PPA) efficiency. This is due to the lack of PPA
awareness in conventional transformer decoding algorithms. In response, we
present an automated trans... | [
{
"created": "Mon, 5 Feb 2024 18:47:04 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"DeLorenzo",
"Matthew",
""
],
[
"Chowdhury",
"Animesh Basak",
""
],
[
"Gohil",
"Vasudev",
""
],
[
"Thakur",
"Shailja",
""
],
[
"Karri",
"Ramesh",
""
],
[
"Garg",
"Siddharth",
""
],
[
"Rajendran",
"Jeyavijayan",... | Existing large language models (LLMs) for register transfer level code generation face challenges like compilation failures and suboptimal power, performance, and area (PPA) efficiency. This is due to the lack of PPA awareness in conventional transformer decoding algorithms. In response, we present an automated transfo... |
2110.11191 | Bruno Degardin | Bruno Degardin, Jo\~ao Neves, Vasco Lopes, Jo\~ao Brito, Ehsan
Yaghoubi and Hugo Proen\c{c}a | Generative Adversarial Graph Convolutional Networks for Human Action
Synthesis | Published as a conference paper at WACV 2022. Code and pretrained
models available at https://github.com/DegardinBruno/Kinetic-GAN | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Synthesising the spatial and temporal dynamics of the human body skeleton
remains a challenging task, not only in terms of the quality of the generated
shapes, but also of their diversity, particularly to synthesise realistic body
movements of a specific action (action conditioning). In this paper, we propose
Kinetic... | [
{
"created": "Thu, 21 Oct 2021 15:01:32 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Oct 2021 10:06:39 GMT",
"version": "v2"
},
{
"created": "Mon, 25 Oct 2021 07:25:28 GMT",
"version": "v3"
}
] | 2021-10-26 | [
[
"Degardin",
"Bruno",
""
],
[
"Neves",
"João",
""
],
[
"Lopes",
"Vasco",
""
],
[
"Brito",
"João",
""
],
[
"Yaghoubi",
"Ehsan",
""
],
[
"Proença",
"Hugo",
""
]
] | Synthesising the spatial and temporal dynamics of the human body skeleton remains a challenging task, not only in terms of the quality of the generated shapes, but also of their diversity, particularly to synthesise realistic body movements of a specific action (action conditioning). In this paper, we propose Kinetic-G... |
1704.00605 | Daniel Lemire | Wojciech Mu{\l}a and Daniel Lemire | Faster Base64 Encoding and Decoding Using AVX2 Instructions | software at https://github.com/lemire/fastbase64 | ACM Transactions on the Web 12 (3), 2018 | 10.1145/3132709 | null | cs.MS cs.PF | http://creativecommons.org/licenses/by/4.0/ | Web developers use base64 formats to include images, fonts, sounds and other
resources directly inside HTML, JavaScript, JSON and XML files. We estimate
that billions of base64 messages are decoded every day. We are motivated to
improve the efficiency of base64 encoding and decoding. Compared to
state-of-the-art impl... | [
{
"created": "Thu, 30 Mar 2017 19:04:09 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Apr 2017 00:25:35 GMT",
"version": "v2"
},
{
"created": "Sat, 12 Aug 2017 03:04:27 GMT",
"version": "v3"
},
{
"created": "Wed, 17 Jan 2018 19:27:41 GMT",
"version": "v4"
},
{
"c... | 2019-01-08 | [
[
"Muła",
"Wojciech",
""
],
[
"Lemire",
"Daniel",
""
]
] | Web developers use base64 formats to include images, fonts, sounds and other resources directly inside HTML, JavaScript, JSON and XML files. We estimate that billions of base64 messages are decoded every day. We are motivated to improve the efficiency of base64 encoding and decoding. Compared to state-of-the-art implem... |
2312.12781 | Mrinal Mathur | Mrinal Mathur, Sergey Plis | DynaLay: An Introspective Approach to Dynamic Layer Selection for Deep
Networks | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | Deep learning models have become increasingly computationally intensive,
requiring extensive computational resources and time for both training and
inference. A significant contributing factor to this challenge is the uniform
computational effort expended on each input example, regardless of its
complexity. We introd... | [
{
"created": "Wed, 20 Dec 2023 05:55:05 GMT",
"version": "v1"
}
] | 2023-12-21 | [
[
"Mathur",
"Mrinal",
""
],
[
"Plis",
"Sergey",
""
]
] | Deep learning models have become increasingly computationally intensive, requiring extensive computational resources and time for both training and inference. A significant contributing factor to this challenge is the uniform computational effort expended on each input example, regardless of its complexity. We introduc... |
1502.05443 | Frans A. Oliehoek | Frans A. Oliehoek and Matthijs T.J. Spaan and Stefan Witwicki | Influence-Optimistic Local Values for Multiagent Planning --- Extended
Version | Long version of IJCAI 2015 paper (and extended abstract at AAMAS
2015) | null | null | null | cs.AI cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have seen the development of methods for multiagent planning
under uncertainty that scale to tens or even hundreds of agents. However, most
of these methods either make restrictive assumptions on the problem domain, or
provide approximate solutions without any guarantees on quality. Methods in the
former... | [
{
"created": "Wed, 18 Feb 2015 23:42:24 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Jul 2015 08:58:50 GMT",
"version": "v2"
}
] | 2015-07-21 | [
[
"Oliehoek",
"Frans A.",
""
],
[
"Spaan",
"Matthijs T. J.",
""
],
[
"Witwicki",
"Stefan",
""
]
] | Recent years have seen the development of methods for multiagent planning under uncertainty that scale to tens or even hundreds of agents. However, most of these methods either make restrictive assumptions on the problem domain, or provide approximate solutions without any guarantees on quality. Methods in the former c... |
1909.13717 | Ana Valeria Gonzalez-Gardu\~no | Ana Valeria Gonzalez, Isabelle Augenstein and Anders S{\o}gaard | Retrieval-based Goal-Oriented Dialogue Generation | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most research on dialogue has focused either on dialogue generation for
openended chit chat or on state tracking for goal-directed dialogue. In this
work, we explore a hybrid approach to goal-oriented dialogue generation that
combines retrieval from past history with a hierarchical, neural
encoder-decoder architectur... | [
{
"created": "Mon, 30 Sep 2019 14:02:53 GMT",
"version": "v1"
}
] | 2019-10-01 | [
[
"Gonzalez",
"Ana Valeria",
""
],
[
"Augenstein",
"Isabelle",
""
],
[
"Søgaard",
"Anders",
""
]
] | Most research on dialogue has focused either on dialogue generation for openended chit chat or on state tracking for goal-directed dialogue. In this work, we explore a hybrid approach to goal-oriented dialogue generation that combines retrieval from past history with a hierarchical, neural encoder-decoder architecture.... |
2006.14763 | Zakaria Mhammedi | Zakaria Mhammedi, Benjamin Guedj, Robert C. Williamson | PAC-Bayesian Bound for the Conditional Value at Risk | null | NeurIPS 2020 | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Conditional Value at Risk (CVaR) is a family of "coherent risk measures"
which generalize the traditional mathematical expectation. Widely used in
mathematical finance, it is garnering increasing interest in machine learning,
e.g., as an alternate approach to regularization, and as a means for ensuring
fairness. This... | [
{
"created": "Fri, 26 Jun 2020 02:55:24 GMT",
"version": "v1"
}
] | 2020-11-17 | [
[
"Mhammedi",
"Zakaria",
""
],
[
"Guedj",
"Benjamin",
""
],
[
"Williamson",
"Robert C.",
""
]
] | Conditional Value at Risk (CVaR) is a family of "coherent risk measures" which generalize the traditional mathematical expectation. Widely used in mathematical finance, it is garnering increasing interest in machine learning, e.g., as an alternate approach to regularization, and as a means for ensuring fairness. This p... |
2110.07905 | Guoliang Lin | Guoliang Lin, Hanlu Chu, Hanjiang Lai | Towards Better Plasticity-Stability Trade-off in Incremental Learning: A
Simple Linear Connector | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Plasticity-stability dilemma is a main problem for incremental learning,
where plasticity is referring to the ability to learn new knowledge, and
stability retains the knowledge of previous tasks. Many methods tackle this
problem by storing previous samples, while in some applications, training data
from previous tas... | [
{
"created": "Fri, 15 Oct 2021 07:37:20 GMT",
"version": "v1"
},
{
"created": "Sat, 12 Mar 2022 09:21:31 GMT",
"version": "v2"
},
{
"created": "Tue, 15 Mar 2022 01:35:53 GMT",
"version": "v3"
}
] | 2022-03-16 | [
[
"Lin",
"Guoliang",
""
],
[
"Chu",
"Hanlu",
""
],
[
"Lai",
"Hanjiang",
""
]
] | Plasticity-stability dilemma is a main problem for incremental learning, where plasticity is referring to the ability to learn new knowledge, and stability retains the knowledge of previous tasks. Many methods tackle this problem by storing previous samples, while in some applications, training data from previous tasks... |
2311.07014 | Yulong Li | Fatema Hasan, Yulong Li, James Foulds, Shimei Pan, Bishwaranjan
Bhattacharjee | Teach me with a Whisper: Enhancing Large Language Models for Analyzing
Spoken Transcripts using Speech Embeddings | 11 pages | null | null | null | cs.CL cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Speech data has rich acoustic and paralinguistic information with important
cues for understanding a speaker's tone, emotion, and intent, yet traditional
large language models such as BERT do not incorporate this information. There
has been an increased interest in multi-modal language models leveraging audio
and/or ... | [
{
"created": "Mon, 13 Nov 2023 01:53:12 GMT",
"version": "v1"
}
] | 2023-11-14 | [
[
"Hasan",
"Fatema",
""
],
[
"Li",
"Yulong",
""
],
[
"Foulds",
"James",
""
],
[
"Pan",
"Shimei",
""
],
[
"Bhattacharjee",
"Bishwaranjan",
""
]
] | Speech data has rich acoustic and paralinguistic information with important cues for understanding a speaker's tone, emotion, and intent, yet traditional large language models such as BERT do not incorporate this information. There has been an increased interest in multi-modal language models leveraging audio and/or vi... |
1605.00371 | Lorenzo Clemente Lorenzo Clemente | Lorenzo Clemente and Pawe{\l} Parys and Sylvain Salvati and Igor
Walukiewicz | The Diagonal Problem for Higher-Order Recursion Schemes is Decidable | technical report; to appear in LICS'16 | null | null | null | cs.FL cs.LO | http://creativecommons.org/licenses/by/4.0/ | A non-deterministic recursion scheme recognizes a language of finite trees.
This very expressive model can simulate, among others, higher-order pushdown
automata with collapse. We show decidability of the diagonal problem for
schemes. This result has several interesting consequences. In particular, it
gives an algori... | [
{
"created": "Mon, 2 May 2016 07:15:16 GMT",
"version": "v1"
}
] | 2016-05-03 | [
[
"Clemente",
"Lorenzo",
""
],
[
"Parys",
"Paweł",
""
],
[
"Salvati",
"Sylvain",
""
],
[
"Walukiewicz",
"Igor",
""
]
] | A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This result has several interesting consequences. In particular, it gives an algorith... |
1911.08252 | Furao Shen | Junyi An, Fengshan Liu, Jian Zhao, Furao Shen | IC-Network: Efficient Structure for Convolutional Neural Networks | 9 pages, 4 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural networks have been widely used, and most networks achieve excellent
performance by stacking certain types of basic units. Compared to increasing
the depth and width of the network, designing more effective basic units has
become an important research topic. Inspired by the elastic collision model in
physics, w... | [
{
"created": "Tue, 19 Nov 2019 13:26:06 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Jan 2020 07:13:37 GMT",
"version": "v2"
},
{
"created": "Wed, 3 Jun 2020 02:58:07 GMT",
"version": "v3"
},
{
"created": "Thu, 4 Jun 2020 15:05:47 GMT",
"version": "v4"
}
] | 2020-06-05 | [
[
"An",
"Junyi",
""
],
[
"Liu",
"Fengshan",
""
],
[
"Zhao",
"Jian",
""
],
[
"Shen",
"Furao",
""
]
] | Neural networks have been widely used, and most networks achieve excellent performance by stacking certain types of basic units. Compared to increasing the depth and width of the network, designing more effective basic units has become an important research topic. Inspired by the elastic collision model in physics, we ... |
2208.00791 | Xue Yu | Yu Xue, Jiafeng Qin | Partial Connection Based on Channel Attention for Differentiable Neural
Architecture Search | 10 pages, 10 figures Y. Xue and J. Qin, "Partial Connection Based on
Channel Attention for Differentiable Neural Architecture Search," in IEEE
Transactions on Industrial Informatics, 2022, doi: 10.1109/TII.2022.3184700 | null | 10.1109/TII.2022.3184700 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differentiable neural architecture search (DARTS), as a gradient-guided
search method, greatly reduces the cost of computation and speeds up the
search. In DARTS, the architecture parameters are introduced to the candidate
operations, but the parameters of some weight-equipped operations may not be
trained well in th... | [
{
"created": "Mon, 1 Aug 2022 12:05:55 GMT",
"version": "v1"
}
] | 2022-08-02 | [
[
"Xue",
"Yu",
""
],
[
"Qin",
"Jiafeng",
""
]
] | Differentiable neural architecture search (DARTS), as a gradient-guided search method, greatly reduces the cost of computation and speeds up the search. In DARTS, the architecture parameters are introduced to the candidate operations, but the parameters of some weight-equipped operations may not be trained well in the ... |
1910.11509 | Wassim Bouachir | Imanne El Maachi, Guillaume-Alexandre Bilodeau, Wassim Bouachir | Deep 1D-Convnet for accurate Parkinson disease detection and severity
prediction from gait | Source code available at
https://github.com/imanneelmaachi/Parkinson-disease-detection-and-severity-prediction-from-gait | Expert Systems with Applications, 113075 (2019) | 10.1016/j.eswa.2019.113075 | null | cs.LG cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diagnosing Parkinson's disease is a complex task that requires the evaluation
of several motor and non-motor symptoms. During diagnosis, gait abnormalities
are among the important symptoms that physicians should consider. However, gait
evaluation is challenging and relies on the expertise and subjectivity of
clinicia... | [
{
"created": "Fri, 25 Oct 2019 03:14:54 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Oct 2019 02:03:44 GMT",
"version": "v2"
},
{
"created": "Fri, 22 Nov 2019 02:23:21 GMT",
"version": "v3"
},
{
"created": "Sat, 16 May 2020 18:50:52 GMT",
"version": "v4"
}
] | 2020-05-19 | [
[
"Maachi",
"Imanne El",
""
],
[
"Bilodeau",
"Guillaume-Alexandre",
""
],
[
"Bouachir",
"Wassim",
""
]
] | Diagnosing Parkinson's disease is a complex task that requires the evaluation of several motor and non-motor symptoms. During diagnosis, gait abnormalities are among the important symptoms that physicians should consider. However, gait evaluation is challenging and relies on the expertise and subjectivity of clinicians... |
2404.11370 | Lujain Ibrahim | Lujain Ibrahim, Luc Rocher, Ana Valdivia | Characterizing and modeling harms from interactions with design patterns
in AI interfaces | Fixed issue with subsection titles | null | null | null | cs.HC cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The proliferation of applications using artificial intelligence (AI) systems
has led to a growing number of users interacting with these systems through
sophisticated interfaces. Human-computer interaction research has long shown
that interfaces shape both user behavior and user perception of technical
capabilities a... | [
{
"created": "Wed, 17 Apr 2024 13:30:45 GMT",
"version": "v1"
},
{
"created": "Sat, 20 Apr 2024 15:04:57 GMT",
"version": "v2"
},
{
"created": "Mon, 20 May 2024 19:23:52 GMT",
"version": "v3"
}
] | 2024-05-22 | [
[
"Ibrahim",
"Lujain",
""
],
[
"Rocher",
"Luc",
""
],
[
"Valdivia",
"Ana",
""
]
] | The proliferation of applications using artificial intelligence (AI) systems has led to a growing number of users interacting with these systems through sophisticated interfaces. Human-computer interaction research has long shown that interfaces shape both user behavior and user perception of technical capabilities and... |
2108.01063 | Anjum Anjum | Tashvik Dhamija, Anjum, Rahul Katarya | Comparative Analysis of Machine Learning and Deep Learning Algorithms
for Detection of Online Hate Speech | 10 pages | Advances in Materials Science and Engineering - Select Proceedings
of CAMSE 2020,Paper_ID_ 95 | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | In the day and age of social media, users have become prone to online hate
speech. Several attempts have been made to classify hate speech using machine
learning but the state-of-the-art models are not robust enough for practical
applications. This is attributed to the use of primitive NLP feature
engineering techniq... | [
{
"created": "Fri, 23 Apr 2021 04:19:15 GMT",
"version": "v1"
}
] | 2021-08-03 | [
[
"Dhamija",
"Tashvik",
""
],
[
"Anjum",
"",
""
],
[
"Katarya",
"Rahul",
""
]
] | In the day and age of social media, users have become prone to online hate speech. Several attempts have been made to classify hate speech using machine learning but the state-of-the-art models are not robust enough for practical applications. This is attributed to the use of primitive NLP feature engineering technique... |
2202.07133 | Chuqing Hu | Chuqing Hu, Sinclair Hudson, Martin Ethier, Mohammad Al-Sharman, Derek
Rayside, William Melek | Sim-to-Real Domain Adaptation for Lane Detection and Classification in
Autonomous Driving | Accepted by IV 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While supervised detection and classification frameworks in autonomous
driving require large labelled datasets to converge, Unsupervised Domain
Adaptation (UDA) approaches, facilitated by synthetic data generated from
photo-real simulated environments, are considered low-cost and less
time-consuming solutions. In thi... | [
{
"created": "Tue, 15 Feb 2022 02:10:14 GMT",
"version": "v1"
},
{
"created": "Mon, 30 May 2022 12:12:24 GMT",
"version": "v2"
}
] | 2022-05-31 | [
[
"Hu",
"Chuqing",
""
],
[
"Hudson",
"Sinclair",
""
],
[
"Ethier",
"Martin",
""
],
[
"Al-Sharman",
"Mohammad",
""
],
[
"Rayside",
"Derek",
""
],
[
"Melek",
"William",
""
]
] | While supervised detection and classification frameworks in autonomous driving require large labelled datasets to converge, Unsupervised Domain Adaptation (UDA) approaches, facilitated by synthetic data generated from photo-real simulated environments, are considered low-cost and less time-consuming solutions. In this ... |
2402.15680 | Qian Ma | Qian Ma, Hongliang Chi, Hengrui Zhang, Kay Liu, Zhiwei Zhang, Lu
Cheng, Suhang Wang, Philip S. Yu, Yao Ma | Overcoming Pitfalls in Graph Contrastive Learning Evaluation: Toward
Comprehensive Benchmarks | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rise of self-supervised learning, which operates without the need for
labeled data, has garnered significant interest within the graph learning
community. This enthusiasm has led to the development of numerous Graph
Contrastive Learning (GCL) techniques, all aiming to create a versatile graph
encoder that leverag... | [
{
"created": "Sat, 24 Feb 2024 01:47:56 GMT",
"version": "v1"
}
] | 2024-02-27 | [
[
"Ma",
"Qian",
""
],
[
"Chi",
"Hongliang",
""
],
[
"Zhang",
"Hengrui",
""
],
[
"Liu",
"Kay",
""
],
[
"Zhang",
"Zhiwei",
""
],
[
"Cheng",
"Lu",
""
],
[
"Wang",
"Suhang",
""
],
[
"Yu",
"Philip S.",... | The rise of self-supervised learning, which operates without the need for labeled data, has garnered significant interest within the graph learning community. This enthusiasm has led to the development of numerous Graph Contrastive Learning (GCL) techniques, all aiming to create a versatile graph encoder that leverages... |
2309.09231 | Stefano Maria Nicoletti | Stefano M. Nicoletti and Milan Lopuha\"a-Zwakenberg and E. Moritz Hahn
and Mari\"elle Stoelinga | ATM: a Logic for Quantitative Security Properties on Attack Trees | null | null | null | null | cs.CR cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Critical infrastructure systems - for which high reliability and availability
are paramount - must operate securely. Attack trees (ATs) are hierarchical
diagrams that offer a flexible modelling language used to assess how systems
can be attacked. ATs are widely employed both in industry and academia but - in
spite of... | [
{
"created": "Sun, 17 Sep 2023 10:07:00 GMT",
"version": "v1"
},
{
"created": "Fri, 17 May 2024 14:19:00 GMT",
"version": "v2"
}
] | 2024-05-20 | [
[
"Nicoletti",
"Stefano M.",
""
],
[
"Lopuhaä-Zwakenberg",
"Milan",
""
],
[
"Hahn",
"E. Moritz",
""
],
[
"Stoelinga",
"Mariëlle",
""
]
] | Critical infrastructure systems - for which high reliability and availability are paramount - must operate securely. Attack trees (ATs) are hierarchical diagrams that offer a flexible modelling language used to assess how systems can be attacked. ATs are widely employed both in industry and academia but - in spite of t... |
2302.02450 | Raphael Araujo Sampaio | Raphael Araujo Sampaio, Joaquim Dias Garcia, Marcus Poggi, Thibaut
Vidal | Regularization and Optimization in Model-Based Clustering | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to their conceptual simplicity, k-means algorithm variants have been
extensively used for unsupervised cluster analysis. However, one main
shortcoming of these algorithms is that they essentially fit a mixture of
identical spherical Gaussians to data that vastly deviates from such a
distribution. In comparison, g... | [
{
"created": "Sun, 5 Feb 2023 18:22:29 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Feb 2024 18:40:58 GMT",
"version": "v2"
}
] | 2024-02-06 | [
[
"Sampaio",
"Raphael Araujo",
""
],
[
"Garcia",
"Joaquim Dias",
""
],
[
"Poggi",
"Marcus",
""
],
[
"Vidal",
"Thibaut",
""
]
] | Due to their conceptual simplicity, k-means algorithm variants have been extensively used for unsupervised cluster analysis. However, one main shortcoming of these algorithms is that they essentially fit a mixture of identical spherical Gaussians to data that vastly deviates from such a distribution. In comparison, gen... |
2202.03349 | Elias Wirth | Elias Wirth, Sebastian Pokutta | Conditional Gradients for the Approximate Vanishing Ideal | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The vanishing ideal of a set of points $X\subseteq \mathbb{R}^n$ is the set
of polynomials that evaluate to $0$ over all points $\mathbf{x} \in X$ and
admits an efficient representation by a finite set of polynomials called
generators. To accommodate the noise in the data set, we introduce the pairwise
conditional gr... | [
{
"created": "Mon, 7 Feb 2022 16:48:49 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Jun 2022 09:07:52 GMT",
"version": "v10"
},
{
"created": "Fri, 3 Jun 2022 10:34:51 GMT",
"version": "v11"
},
{
"created": "Mon, 12 Sep 2022 12:36:42 GMT",
"version": "v12"
},
{
"c... | 2024-02-15 | [
[
"Wirth",
"Elias",
""
],
[
"Pokutta",
"Sebastian",
""
]
] | The vanishing ideal of a set of points $X\subseteq \mathbb{R}^n$ is the set of polynomials that evaluate to $0$ over all points $\mathbf{x} \in X$ and admits an efficient representation by a finite set of polynomials called generators. To accommodate the noise in the data set, we introduce the pairwise conditional grad... |
2206.08898 | Soroush Abbasi Koohpayegani | Soroush Abbasi Koohpayegani, Hamed Pirsiavash | SimA: Simple Softmax-free Attention for Vision Transformers | Code is available here: https://github.com/UCDvision/sima | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, vision transformers have become very popular. However, deploying
them in many applications is computationally expensive partly due to the
Softmax layer in the attention block. We introduce a simple but effective,
Softmax-free attention block, SimA, which normalizes query and key matrices
with simple $\ell_1... | [
{
"created": "Fri, 17 Jun 2022 17:15:01 GMT",
"version": "v1"
},
{
"created": "Sat, 23 Mar 2024 06:43:47 GMT",
"version": "v2"
}
] | 2024-03-26 | [
[
"Koohpayegani",
"Soroush Abbasi",
""
],
[
"Pirsiavash",
"Hamed",
""
]
] | Recently, vision transformers have become very popular. However, deploying them in many applications is computationally expensive partly due to the Softmax layer in the attention block. We introduce a simple but effective, Softmax-free attention block, SimA, which normalizes query and key matrices with simple $\ell_1$-... |
1902.04987 | Christoph Heindl | Christoph Heindl, Sebastian Zambal, Thomas Ponitz, Andreas Pichler and
Josef Scharinger | 3D Robot Pose Estimation from 2D Images | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the task of locating articulated poses of multiple
robots in images. Our approach simultaneously infers the number of robots in a
scene, identifies joint locations and estimates sparse depth maps around joint
locations. The proposed method applies staged convolutional feature detectors
to 2D imag... | [
{
"created": "Wed, 13 Feb 2019 16:26:31 GMT",
"version": "v1"
}
] | 2019-02-14 | [
[
"Heindl",
"Christoph",
""
],
[
"Zambal",
"Sebastian",
""
],
[
"Ponitz",
"Thomas",
""
],
[
"Pichler",
"Andreas",
""
],
[
"Scharinger",
"Josef",
""
]
] | This paper considers the task of locating articulated poses of multiple robots in images. Our approach simultaneously infers the number of robots in a scene, identifies joint locations and estimates sparse depth maps around joint locations. The proposed method applies staged convolutional feature detectors to 2D image ... |
1905.02825 | Emma Tosch | Emma Tosch, Kaleigh Clary, John Foley, David Jensen | Toybox: A Suite of Environments for Experimental Evaluation of Deep
Reinforcement Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evaluation of deep reinforcement learning (RL) is inherently challenging. In
particular, learned policies are largely opaque, and hypotheses about the
behavior of deep RL agents are difficult to test in black-box environments.
Considerable effort has gone into addressing opacity, but almost no effort has
been devoted... | [
{
"created": "Tue, 7 May 2019 22:21:50 GMT",
"version": "v1"
}
] | 2019-05-09 | [
[
"Tosch",
"Emma",
""
],
[
"Clary",
"Kaleigh",
""
],
[
"Foley",
"John",
""
],
[
"Jensen",
"David",
""
]
] | Evaluation of deep reinforcement learning (RL) is inherently challenging. In particular, learned policies are largely opaque, and hypotheses about the behavior of deep RL agents are difficult to test in black-box environments. Considerable effort has gone into addressing opacity, but almost no effort has been devoted t... |
1710.01547 | Mark Noone | Mark Noone, Aidan Mooney | Visual and Textual Programming Languages: A Systematic Review of the
Literature | 18 pages (including 2 bibliography pages), 3 figures | Journal of Computers in Education, 2018 | 10.1007/s40692-018-0101-5 | null | cs.CY cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is well documented, and has been the topic of much research, that Computer
Science courses tend to have higher than average drop out rates at third level.
This is a problem that needs to be addressed with urgency but also caution. The
required number of Computer Science graduates is growing every year but the
numb... | [
{
"created": "Wed, 4 Oct 2017 11:03:40 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Dec 2017 16:35:33 GMT",
"version": "v2"
}
] | 2018-03-21 | [
[
"Noone",
"Mark",
""
],
[
"Mooney",
"Aidan",
""
]
] | It is well documented, and has been the topic of much research, that Computer Science courses tend to have higher than average drop out rates at third level. This is a problem that needs to be addressed with urgency but also caution. The required number of Computer Science graduates is growing every year but the number... |
2406.03210 | Yang Zhang | Yang Zhang, Keqin Bao, Ming Yan, Wenjie Wang, Fuli Feng and Xiangnan
He | Text-like Encoding of Collaborative Information in Large Language Models
for Recommendation | Accepted by ACL 2024 | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When adapting Large Language Models for Recommendation (LLMRec), it is
crucial to integrate collaborative information. Existing methods achieve this
by learning collaborative embeddings in LLMs' latent space from scratch or by
mapping from external models. However, they fail to represent the information
in a text-lik... | [
{
"created": "Wed, 5 Jun 2024 12:45:25 GMT",
"version": "v1"
}
] | 2024-06-06 | [
[
"Zhang",
"Yang",
""
],
[
"Bao",
"Keqin",
""
],
[
"Yan",
"Ming",
""
],
[
"Wang",
"Wenjie",
""
],
[
"Feng",
"Fuli",
""
],
[
"He",
"Xiangnan",
""
]
] | When adapting Large Language Models for Recommendation (LLMRec), it is crucial to integrate collaborative information. Existing methods achieve this by learning collaborative embeddings in LLMs' latent space from scratch or by mapping from external models. However, they fail to represent the information in a text-like ... |
1412.6286 | Wendelin B\"ohmer | Wendelin B\"ohmer and Klaus Obermayer | Regression with Linear Factored Functions | Under review as conference paper at ECML/PKDD 2015 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many applications that use empirically estimated functions face a curse of
dimensionality, because the integrals over most function classes must be
approximated by sampling. This paper introduces a novel regression-algorithm
that learns linear factored functions (LFF). This class of functions has
structural propertie... | [
{
"created": "Fri, 19 Dec 2014 11:01:21 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Feb 2015 14:53:35 GMT",
"version": "v2"
},
{
"created": "Mon, 30 Mar 2015 15:14:20 GMT",
"version": "v3"
}
] | 2015-03-31 | [
[
"Böhmer",
"Wendelin",
""
],
[
"Obermayer",
"Klaus",
""
]
] | Many applications that use empirically estimated functions face a curse of dimensionality, because the integrals over most function classes must be approximated by sampling. This paper introduces a novel regression-algorithm that learns linear factored functions (LFF). This class of functions has structural properties ... |
0705.0909 | Giacomo Bacci | Giacomo Bacci, Marco Luise, H. Vincent Poor | Game-Theoretic Power Control in Impulse Radio UWB Wireless Networks | Appeared in the Proceedings of the 13th European Wireless Conference,
Paris, France, April 1-4, 2007 | null | null | null | cs.GT cs.IT math.IT | null | In this paper, a game-theoretic model for studying power control for wireless
data networks in frequency-selective multipath environments is analyzed. The
uplink of an impulse-radio ultrawideband system is considered. The effects of
self-interference and multiple-access interference on the performance of Rake
receive... | [
{
"created": "Mon, 7 May 2007 13:58:01 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Bacci",
"Giacomo",
""
],
[
"Luise",
"Marco",
""
],
[
"Poor",
"H. Vincent",
""
]
] | In this paper, a game-theoretic model for studying power control for wireless data networks in frequency-selective multipath environments is analyzed. The uplink of an impulse-radio ultrawideband system is considered. The effects of self-interference and multiple-access interference on the performance of Rake receivers... |
2112.15250 | Quanquan Gu | Jinghui Chen and Yuan Cao and Quanquan Gu | Benign Overfitting in Adversarially Robust Linear Classification | 24 pages, 5 figures | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | "Benign overfitting", where classifiers memorize noisy training data yet
still achieve a good generalization performance, has drawn great attention in
the machine learning community. To explain this surprising phenomenon, a series
of works have provided theoretical justification in over-parameterized linear
regressio... | [
{
"created": "Fri, 31 Dec 2021 00:27:31 GMT",
"version": "v1"
}
] | 2022-01-03 | [
[
"Chen",
"Jinghui",
""
],
[
"Cao",
"Yuan",
""
],
[
"Gu",
"Quanquan",
""
]
] | "Benign overfitting", where classifiers memorize noisy training data yet still achieve a good generalization performance, has drawn great attention in the machine learning community. To explain this surprising phenomenon, a series of works have provided theoretical justification in over-parameterized linear regression,... |
1010.3132 | Ewa Matusiak | Ewa Matusiak and Yonina C. Eldar | Sub-Nyquist Sampling of Short Pulses | 28 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop sub-Nyquist sampling systems for analog signals comprised of
several, possibly overlapping, finite duration pulses with unknown shapes and
time positions. Efficient sampling schemes when either the pulse shape or the
locations of the pulses are known have been previously developed. To the best
of our knowl... | [
{
"created": "Fri, 15 Oct 2010 11:45:16 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Apr 2011 08:44:04 GMT",
"version": "v2"
},
{
"created": "Tue, 20 Dec 2011 11:56:35 GMT",
"version": "v3"
}
] | 2015-03-17 | [
[
"Matusiak",
"Ewa",
""
],
[
"Eldar",
"Yonina C.",
""
]
] | We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sampling schemes when either the pulse shape or the locations of the pulses are known have been previously developed. To the best of our knowled... |
1404.4478 | Deepak Rajendraprasad | L. Sunil Chandran, Deepak Rajendraprasad and Marek Tesa\v{r} | Rainbow Colouring of Split Graphs | This is the full version of a paper to be presented at ICGT 2014.
This complements the results in arXiv:1205.1670 (which were presented in
COCOON 2013), and both will be merged into a single journal submission | null | null | null | cs.DM cs.CC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A rainbow path in an edge coloured graph is a path in which no two edges are
coloured the same. A rainbow colouring of a connected graph G is a colouring of
the edges of G such that every pair of vertices in G is connected by at least
one rainbow path. The minimum number of colours required to rainbow colour G is
cal... | [
{
"created": "Thu, 17 Apr 2014 10:41:32 GMT",
"version": "v1"
}
] | 2014-04-18 | [
[
"Chandran",
"L. Sunil",
""
],
[
"Rajendraprasad",
"Deepak",
""
],
[
"Tesař",
"Marek",
""
]
] | A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one rainbow path. The minimum number of colours required to rainbow colour G is calle... |
1712.04694 | Atchutananda Surampudi | Atchutananda Surampudi and Radha Krishna Ganti | Interference Characterization in Downlink Li-Fi Optical Attocell
Networks | Submitted to the IEEE/OSA Journal of Lightwave Technology | null | 10.1109/JLT.2018.2836932 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wireless access to data using visible light, popularly known as
light-fidelity (Li-Fi), is one of the key emerging technologies which promises
huge bandwidths and data rates. In Li-Fi, the data is modulated on optical
intensities and transmitted and detected using light-emitting-diodes (LED) and
photodiodes respectiv... | [
{
"created": "Wed, 13 Dec 2017 10:49:10 GMT",
"version": "v1"
}
] | 2018-08-01 | [
[
"Surampudi",
"Atchutananda",
""
],
[
"Ganti",
"Radha Krishna",
""
]
] | Wireless access to data using visible light, popularly known as light-fidelity (Li-Fi), is one of the key emerging technologies which promises huge bandwidths and data rates. In Li-Fi, the data is modulated on optical intensities and transmitted and detected using light-emitting-diodes (LED) and photodiodes respectivel... |
1806.07223 | Christian H\"ager | Christoffer Fougstedt, Christian H\"ager, Lars Svensson, Henry D.
Pfister, Per Larsson-Edefors | ASIC Implementation of Time-Domain Digital Backpropagation with
Deep-Learned Chromatic Dispersion Filters | 3 pages, 3 figures, updated reference list, added one sentence in the
result section for clarity | null | null | null | cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider time-domain digital backpropagation with chromatic dispersion
filters jointly optimized and quantized using machine-learning techniques.
Compared to the baseline implementations, we show improved BER performance and
>40% power dissipation reductions in 28-nm CMOS.
| [
{
"created": "Tue, 19 Jun 2018 13:42:33 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Jun 2018 00:35:46 GMT",
"version": "v2"
}
] | 2018-06-21 | [
[
"Fougstedt",
"Christoffer",
""
],
[
"Häger",
"Christian",
""
],
[
"Svensson",
"Lars",
""
],
[
"Pfister",
"Henry D.",
""
],
[
"Larsson-Edefors",
"Per",
""
]
] | We consider time-domain digital backpropagation with chromatic dispersion filters jointly optimized and quantized using machine-learning techniques. Compared to the baseline implementations, we show improved BER performance and >40% power dissipation reductions in 28-nm CMOS. |
2106.13574 | Jaros{\l}aw Samelak | Jaros{\l}aw Samelak, Marek Doma\'nski | Multiview Video Compression Using Advanced HEVC Screen Content Coding | null | null | null | null | cs.MM cs.CV | http://creativecommons.org/licenses/by/4.0/ | The paper presents a new approach to multiview video coding using Screen
Content Coding. It is assumed that for a time instant the frames corresponding
to all views are packed into a single frame, i.e. the frame-compatible approach
to multiview coding is applied. For such coding scenario, the paper
demonstrates that ... | [
{
"created": "Fri, 25 Jun 2021 11:53:48 GMT",
"version": "v1"
}
] | 2021-06-28 | [
[
"Samelak",
"Jarosław",
""
],
[
"Domański",
"Marek",
""
]
] | The paper presents a new approach to multiview video coding using Screen Content Coding. It is assumed that for a time instant the frames corresponding to all views are packed into a single frame, i.e. the frame-compatible approach to multiview coding is applied. For such coding scenario, the paper demonstrates that Sc... |
2404.00793 | Lourens Touwen | Lourens Touwen, Doina Bucur, Remco van der Hofstad, Alessandro
Garavaglia, Nelly Litvak | Learning the mechanisms of network growth | Main text: 13 pages, 4 figures. Supplementary: 12 pages; Textual
changes | Scientific Reports, volume 14, Article number: 11866 (2024) | 10.1038/s41598-024-61940-4 10.1038/s41598-024-61940-4 | null | cs.SI math.PR stat.ML | http://creativecommons.org/licenses/by/4.0/ | We propose a novel model-selection method for dynamic networks. Our approach
involves training a classifier on a large body of synthetic network data. The
data is generated by simulating nine state-of-the-art random graph models for
dynamic networks, with parameter range chosen to ensure exponential growth of
the net... | [
{
"created": "Sun, 31 Mar 2024 20:38:59 GMT",
"version": "v1"
},
{
"created": "Tue, 14 May 2024 01:19:12 GMT",
"version": "v2"
},
{
"created": "Mon, 27 May 2024 17:52:07 GMT",
"version": "v3"
}
] | 2024-05-28 | [
[
"Touwen",
"Lourens",
""
],
[
"Bucur",
"Doina",
""
],
[
"van der Hofstad",
"Remco",
""
],
[
"Garavaglia",
"Alessandro",
""
],
[
"Litvak",
"Nelly",
""
]
] | We propose a novel model-selection method for dynamic networks. Our approach involves training a classifier on a large body of synthetic network data. The data is generated by simulating nine state-of-the-art random graph models for dynamic networks, with parameter range chosen to ensure exponential growth of the netwo... |
2403.04001 | Suzan Ece Ada | Suzan Ece Ada, Hanne Say, Emre Ugur, Erhan Oztop | Bidirectional Progressive Neural Networks with Episodic Return Progress
for Emergent Task Sequencing and Robotic Skill Transfer | 9 pages, 5 figures | null | null | null | cs.RO cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human brain and behavior provide a rich venue that can inspire novel control
and learning methods for robotics. In an attempt to exemplify such a
development by inspiring how humans acquire knowledge and transfer skills among
tasks, we introduce a novel multi-task reinforcement learning framework named
Episodic Retur... | [
{
"created": "Wed, 6 Mar 2024 19:17:49 GMT",
"version": "v1"
}
] | 2024-03-08 | [
[
"Ada",
"Suzan Ece",
""
],
[
"Say",
"Hanne",
""
],
[
"Ugur",
"Emre",
""
],
[
"Oztop",
"Erhan",
""
]
] | Human brain and behavior provide a rich venue that can inspire novel control and learning methods for robotics. In an attempt to exemplify such a development by inspiring how humans acquire knowledge and transfer skills among tasks, we introduce a novel multi-task reinforcement learning framework named Episodic Return ... |
2302.12862 | Ewen Wang | Ewen Wang, Ajay Kannan, Yuefeng Liang, Boyi Chen, Mosharaf Chowdhury | FLINT: A Platform for Federated Learning Integration | Preprint for MLSys 2023 | null | null | null | cs.LG cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-device federated learning (FL) has been well-studied from algorithmic,
system scalability, and training speed perspectives. Nonetheless, moving from
centralized training to cross-device FL for millions or billions of devices
presents many risks, including performance loss, developer inertia, poor user
experienc... | [
{
"created": "Fri, 24 Feb 2023 19:38:03 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Mar 2023 00:06:55 GMT",
"version": "v2"
}
] | 2023-03-14 | [
[
"Wang",
"Ewen",
""
],
[
"Kannan",
"Ajay",
""
],
[
"Liang",
"Yuefeng",
""
],
[
"Chen",
"Boyi",
""
],
[
"Chowdhury",
"Mosharaf",
""
]
] | Cross-device federated learning (FL) has been well-studied from algorithmic, system scalability, and training speed perspectives. Nonetheless, moving from centralized training to cross-device FL for millions or billions of devices presents many risks, including performance loss, developer inertia, poor user experience,... |
1402.5492 | \"Ozg\"ur \"Ozkan | Pooya Davoodi, Jeremy T. Fineman, John Iacono, \"Ozg\"ur \"Ozkan | Cache-Oblivious Persistence | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Partial persistence is a general transformation that takes a data structure
and allows queries to be executed on any past state of the structure. The
cache-oblivious model is the leading model of a modern multi-level memory
hierarchy.We present the first general transformation for making
cache-oblivious model data st... | [
{
"created": "Sat, 22 Feb 2014 08:08:23 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Jul 2014 04:56:48 GMT",
"version": "v2"
}
] | 2014-07-02 | [
[
"Davoodi",
"Pooya",
""
],
[
"Fineman",
"Jeremy T.",
""
],
[
"Iacono",
"John",
""
],
[
"Özkan",
"Özgür",
""
]
] | Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy.We present the first general transformation for making cache-oblivious model data stru... |
1606.05982 | Lawrence Ong | Lawrence Ong | Optimal Finite-Length and Asymptotic Index Codes for Five or Fewer
Receivers | Author final manuscript | null | 10.1109/TIT.2017.2748562 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Index coding models broadcast networks in which a sender sends different
messages to different receivers simultaneously, where each receiver may know
some of the messages a priori. The aim is to find the minimum (normalised)
index codelength that the sender sends. This paper considers unicast index
coding, where each... | [
{
"created": "Mon, 20 Jun 2016 06:28:57 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Sep 2017 00:06:00 GMT",
"version": "v2"
}
] | 2017-09-05 | [
[
"Ong",
"Lawrence",
""
]
] | Index coding models broadcast networks in which a sender sends different messages to different receivers simultaneously, where each receiver may know some of the messages a priori. The aim is to find the minimum (normalised) index codelength that the sender sends. This paper considers unicast index coding, where each r... |
2404.08676 | Simone Tedeschi | Simone Tedeschi, Felix Friedrich, Patrick Schramowski, Kristian
Kersting, Roberto Navigli, Huu Nguyen, Bo Li | ALERT: A Comprehensive Benchmark for Assessing Large Language Models'
Safety through Red Teaming | 17 pages, preprint | null | null | null | cs.CL cs.CY cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | When building Large Language Models (LLMs), it is paramount to bear safety in
mind and protect them with guardrails. Indeed, LLMs should never generate
content promoting or normalizing harmful, illegal, or unethical behavior that
may contribute to harm to individuals or society. This principle applies to
both normal ... | [
{
"created": "Sat, 6 Apr 2024 15:01:47 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Jun 2024 07:23:06 GMT",
"version": "v2"
},
{
"created": "Mon, 24 Jun 2024 08:50:22 GMT",
"version": "v3"
}
] | 2024-06-25 | [
[
"Tedeschi",
"Simone",
""
],
[
"Friedrich",
"Felix",
""
],
[
"Schramowski",
"Patrick",
""
],
[
"Kersting",
"Kristian",
""
],
[
"Navigli",
"Roberto",
""
],
[
"Nguyen",
"Huu",
""
],
[
"Li",
"Bo",
""
]
] | When building Large Language Models (LLMs), it is paramount to bear safety in mind and protect them with guardrails. Indeed, LLMs should never generate content promoting or normalizing harmful, illegal, or unethical behavior that may contribute to harm to individuals or society. This principle applies to both normal an... |
1406.2909 | Nino Antulov-Fantulin | Nino Antulov-Fantulin, Alen Lancic, Tomislav Smuc, Hrvoje Stefancic,
Mile Sikic | Identification of Patient Zero in Static and Temporal Networks -
Robustness and Limitations | Additional experiments and results regarding the detectability limits
are included in v2. Supplemental material is added in the Ancillary files
section on this arXiv page | Phys. Rev. Lett. 114, 248701 (2015) | 10.1103/PhysRevLett.114.248701 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detection of patient-zero can give new insights to the epidemiologists about
the nature of first transmissions into a population. In this paper, we study
the statistical inference problem of detecting the source of epidemics from a
snapshot of spreading on an arbitrary network structure. By using exact
analytic calcu... | [
{
"created": "Wed, 11 Jun 2014 14:08:19 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Jun 2015 13:23:11 GMT",
"version": "v2"
}
] | 2015-06-24 | [
[
"Antulov-Fantulin",
"Nino",
""
],
[
"Lancic",
"Alen",
""
],
[
"Smuc",
"Tomislav",
""
],
[
"Stefancic",
"Hrvoje",
""
],
[
"Sikic",
"Mile",
""
]
] | Detection of patient-zero can give new insights to the epidemiologists about the nature of first transmissions into a population. In this paper, we study the statistical inference problem of detecting the source of epidemics from a snapshot of spreading on an arbitrary network structure. By using exact analytic calcula... |
2202.10141 | Rui Kang | Rui Kang, Hongzhi Wang | Dynamic Relation Repairing for Knowledge Enhancement | 12 Pages | IEEE Transactions on Knowledge and Data Engineering, 2021 | 10.1109/TKDE.2021.3101237 | null | cs.DB | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Dynamic relation repair aims to efficiently validate and repair the instances
for knowledge graph enhancement (KGE), where KGE captures missing relations
from unstructured data and leads to noisy facts to the knowledge graph. With
the prosperity of unstructured data, an online approach is asked to clean the
new RDF t... | [
{
"created": "Mon, 21 Feb 2022 11:37:27 GMT",
"version": "v1"
}
] | 2022-02-22 | [
[
"Kang",
"Rui",
""
],
[
"Wang",
"Hongzhi",
""
]
] | Dynamic relation repair aims to efficiently validate and repair the instances for knowledge graph enhancement (KGE), where KGE captures missing relations from unstructured data and leads to noisy facts to the knowledge graph. With the prosperity of unstructured data, an online approach is asked to clean the new RDF tup... |
2001.05132 | Farzaneh Derakhshan | Farzaneh Derakhshan, Frank Pfenning | Strong Progress for Session-Typed Processes in a Linear Metalogic with
Circular Proofs | null | null | null | null | cs.LO cs.PL | http://creativecommons.org/licenses/by/4.0/ | We introduce an infinitary first order linear logic with least and greatest
fixed points. To ensure cut elimination, we impose a validity condition on
infinite derivations. Our calculus is designed to reason about rich signatures
of mutually defined inductive and coinductive linear predicates. In a major
case study w... | [
{
"created": "Wed, 15 Jan 2020 04:47:39 GMT",
"version": "v1"
},
{
"created": "Sun, 7 Mar 2021 17:33:54 GMT",
"version": "v2"
}
] | 2021-03-09 | [
[
"Derakhshan",
"Farzaneh",
""
],
[
"Pfenning",
"Frank",
""
]
] | We introduce an infinitary first order linear logic with least and greatest fixed points. To ensure cut elimination, we impose a validity condition on infinite derivations. Our calculus is designed to reason about rich signatures of mutually defined inductive and coinductive linear predicates. In a major case study we ... |
2011.12059 | Fan Wang | Fan Wang | Infrared small target detection based on isotropic constraint under
complex background | null | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Infrared search and tracking (IRST) system has been widely concerned and
applied in the area of national defence. Small target detection under complex
background is a very challenging task in the development of system algorithm.
Low signal-to-clutter ratio (SCR) of target and the interference caused by
irregular back... | [
{
"created": "Tue, 24 Nov 2020 12:25:05 GMT",
"version": "v1"
}
] | 2020-11-25 | [
[
"Wang",
"Fan",
""
]
] | Infrared search and tracking (IRST) system has been widely concerned and applied in the area of national defence. Small target detection under complex background is a very challenging task in the development of system algorithm. Low signal-to-clutter ratio (SCR) of target and the interference caused by irregular backgr... |
1110.2200 | M. Fox | M. Fox, D. Long | Modelling Mixed Discrete-Continuous Domains for Planning | null | Journal Of Artificial Intelligence Research, Volume 27, pages
235-297, 2006 | 10.1613/jair.2044 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present pddl+, a planning domain description language for
modelling mixed discrete-continuous planning domains. We describe the syntax
and modelling style of pddl+, showing that the language makes convenient the
modelling of complex time-dependent effects. We provide a formal semantics for
pddl+ by m... | [
{
"created": "Mon, 10 Oct 2011 21:16:30 GMT",
"version": "v1"
}
] | 2011-10-12 | [
[
"Fox",
"M.",
""
],
[
"Long",
"D.",
""
]
] | In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl+, showing that the language makes convenient the modelling of complex time-dependent effects. We provide a formal semantics for pddl+ by map... |
2104.00234 | Xiushan Nie | Xinfang Liu, Xiushan Nie (Member, IEEE), Zhifang Tan, Jie Guo, Yilong
Yin | A Survey on Natural Language Video Localization | null | null | null | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Natural language video localization (NLVL), which aims to locate a target
moment from a video that semantically corresponds to a text query, is a novel
and challenging task. Toward this end, in this paper, we present a
comprehensive survey of the NLVL algorithms, where we first propose the
pipeline of NLVL, and then ... | [
{
"created": "Thu, 1 Apr 2021 03:30:45 GMT",
"version": "v1"
}
] | 2021-04-02 | [
[
"Liu",
"Xinfang",
"",
"Member, IEEE"
],
[
"Nie",
"Xiushan",
"",
"Member, IEEE"
],
[
"Tan",
"Zhifang",
""
],
[
"Guo",
"Jie",
""
],
[
"Yin",
"Yilong",
""
]
] | Natural language video localization (NLVL), which aims to locate a target moment from a video that semantically corresponds to a text query, is a novel and challenging task. Toward this end, in this paper, we present a comprehensive survey of the NLVL algorithms, where we first propose the pipeline of NLVL, and then ca... |
2010.04700 | Jamie Alnasir PhD | Jamie J Alnasir | Distributed Computing in a Pandemic: A Review of Technologies Available
for Tackling COVID-19 | 20 pages (14 excl. refs), 3 tables | ADCAIJ: Advances in Distributed Computing and Artificial
Intelligence Journal, 11(1), 9-43 (2022) | 10.14201/adcaij.27337 | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The current COVID-19 global pandemic caused by the SARS-CoV-2 betacoronavirus
has resulted in over a million deaths and is having a grave socio-economic
impact, hence there is an urgency to find solutions to key research challenges.
Much of this COVID-19 research depends on distributed computing. In this
article, I r... | [
{
"created": "Fri, 9 Oct 2020 17:40:11 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Nov 2020 18:37:15 GMT",
"version": "v2"
},
{
"created": "Tue, 18 May 2021 15:10:47 GMT",
"version": "v3"
}
] | 2022-06-14 | [
[
"Alnasir",
"Jamie J",
""
]
] | The current COVID-19 global pandemic caused by the SARS-CoV-2 betacoronavirus has resulted in over a million deaths and is having a grave socio-economic impact, hence there is an urgency to find solutions to key research challenges. Much of this COVID-19 research depends on distributed computing. In this article, I rev... |
1805.01407 | Sebastiano Vigna | David Blackman, Sebastiano Vigna | Scrambled Linear Pseudorandom Number Generators | null | null | null | null | cs.DS cs.CR cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | $\mathbf F_2$-linear pseudorandom number generators are very popular due to
their high speed, to the ease with which generators with a sizable state space
can be created, and to their provable theoretical properties. However, they
suffer from linear artifacts that show as failures in linearity-related
statistical tes... | [
{
"created": "Thu, 3 May 2018 16:22:23 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Aug 2019 11:01:41 GMT",
"version": "v2"
},
{
"created": "Mon, 28 Mar 2022 14:45:50 GMT",
"version": "v3"
}
] | 2022-03-29 | [
[
"Blackman",
"David",
""
],
[
"Vigna",
"Sebastiano",
""
]
] | $\mathbf F_2$-linear pseudorandom number generators are very popular due to their high speed, to the ease with which generators with a sizable state space can be created, and to their provable theoretical properties. However, they suffer from linear artifacts that show as failures in linearity-related statistical tests... |
2403.15139 | Yipeng Qin | Yuanbang Liang, Bhavesh Garg, Paul L Rosin, Yipeng Qin | Deep Generative Model based Rate-Distortion for Image Downscaling
Assessment | Accepted at CVPR 2024 | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose Image Downscaling Assessment by Rate-Distortion
(IDA-RD), a novel measure to quantitatively evaluate image downscaling
algorithms. In contrast to image-based methods that measure the quality of
downscaled images, ours is process-based that draws ideas from rate-distortion
theory to measure t... | [
{
"created": "Fri, 22 Mar 2024 11:48:09 GMT",
"version": "v1"
}
] | 2024-03-25 | [
[
"Liang",
"Yuanbang",
""
],
[
"Garg",
"Bhavesh",
""
],
[
"Rosin",
"Paul L",
""
],
[
"Qin",
"Yipeng",
""
]
] | In this paper, we propose Image Downscaling Assessment by Rate-Distortion (IDA-RD), a novel measure to quantitatively evaluate image downscaling algorithms. In contrast to image-based methods that measure the quality of downscaled images, ours is process-based that draws ideas from rate-distortion theory to measure the... |
1910.05341 | Sebastian Scholze | Sebastian Scholze, Fulya Feryal Horozal, Marie-Saphira Flug, Ana
Teresa Correia | Persistence and Big Data Analytics Architectures for Smart Connected
Vehicles | International Workshop on Reconfigurable and Communicationcentric
Cyber-Physical Systems ReCoCyPS 2019 (arXiv:1909.05617) | null | null | ReCoCyPS/2019/04 | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Up until recently, relational databases were considered as the de-facto
technology for persisting and managing large volumes of data. This came to
change with the emergence of enterprises producing extremely large datasets and
having unprecedentedly high availability requirements. The need for levels of
availability ... | [
{
"created": "Fri, 11 Oct 2019 13:26:42 GMT",
"version": "v1"
}
] | 2019-10-15 | [
[
"Scholze",
"Sebastian",
""
],
[
"Horozal",
"Fulya Feryal",
""
],
[
"Flug",
"Marie-Saphira",
""
],
[
"Correia",
"Ana Teresa",
""
]
] | Up until recently, relational databases were considered as the de-facto technology for persisting and managing large volumes of data. This came to change with the emergence of enterprises producing extremely large datasets and having unprecedentedly high availability requirements. The need for levels of availability be... |
1912.00682 | Duong Nguyen | Duong Nguyen, Rodolphe Vadaine, Guillaume Hajduch, Ren\'e Garello, and
Ronan Fablet | GeoTrackNet-A Maritime Anomaly Detector using Probabilistic Neural
Network Representation of AIS Tracks and A Contrario Detection | IEEE Transactions on Intelligent Transportation Systems | null | 10.1109/TITS.2021.3055614 | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Representing maritime traffic patterns and detecting anomalies from them are
key to vessel monitoring and maritime situational awareness. We propose a novel
approach -- referred to as GeoTrackNet -- for maritime anomaly detection from
AIS data streams. Our model exploits state-of-the-art neural network schemes to
lea... | [
{
"created": "Mon, 2 Dec 2019 11:04:56 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Jan 2021 12:22:43 GMT",
"version": "v2"
},
{
"created": "Sun, 24 Jan 2021 21:03:37 GMT",
"version": "v3"
},
{
"created": "Tue, 2 Feb 2021 12:57:09 GMT",
"version": "v4"
},
{
"crea... | 2021-02-12 | [
[
"Nguyen",
"Duong",
""
],
[
"Vadaine",
"Rodolphe",
""
],
[
"Hajduch",
"Guillaume",
""
],
[
"Garello",
"René",
""
],
[
"Fablet",
"Ronan",
""
]
] | Representing maritime traffic patterns and detecting anomalies from them are key to vessel monitoring and maritime situational awareness. We propose a novel approach -- referred to as GeoTrackNet -- for maritime anomaly detection from AIS data streams. Our model exploits state-of-the-art neural network schemes to learn... |
2402.05453 | Zhenlong Liu | Zhenlong Liu, Lei Feng, Huiping Zhuang, Xiaofeng Cao, Hongxin Wei | Mitigating Privacy Risk in Membership Inference by Convex-Concave Loss | Accepted by ICML 2024 | null | null | null | cs.LG cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning models are susceptible to membership inference attacks
(MIAs), which aim to infer whether a sample is in the training set. Existing
work utilizes gradient ascent to enlarge the loss variance of training data,
alleviating the privacy risk. However, optimizing toward a reverse direction
may cause the m... | [
{
"created": "Thu, 8 Feb 2024 07:14:17 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Jun 2024 08:10:56 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Jun 2024 05:51:47 GMT",
"version": "v3"
}
] | 2024-06-19 | [
[
"Liu",
"Zhenlong",
""
],
[
"Feng",
"Lei",
""
],
[
"Zhuang",
"Huiping",
""
],
[
"Cao",
"Xiaofeng",
""
],
[
"Wei",
"Hongxin",
""
]
] | Machine learning models are susceptible to membership inference attacks (MIAs), which aim to infer whether a sample is in the training set. Existing work utilizes gradient ascent to enlarge the loss variance of training data, alleviating the privacy risk. However, optimizing toward a reverse direction may cause the mod... |
1901.08286 | Yuan Zhang | Yuan Zhang, Dong Wang, Yan Zhang | Neural IR Meets Graph Embedding: A Ranking Model for Product Search | A preliminary version of the work to appear in TheWebConf'19
(formerly, WWW'19) | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, neural models for information retrieval are becoming increasingly
popular. They provide effective approaches for product search due to their
competitive advantages in semantic matching. However, it is challenging to use
graph-based features, though proved very useful in IR literature, in these
neural approa... | [
{
"created": "Thu, 24 Jan 2019 08:48:16 GMT",
"version": "v1"
}
] | 2019-01-25 | [
[
"Zhang",
"Yuan",
""
],
[
"Wang",
"Dong",
""
],
[
"Zhang",
"Yan",
""
]
] | Recently, neural models for information retrieval are becoming increasingly popular. They provide effective approaches for product search due to their competitive advantages in semantic matching. However, it is challenging to use graph-based features, though proved very useful in IR literature, in these neural approach... |
2010.09884 | Elaine Shi | Gilad Asharov, Wei-Kai Lin, Elaine Shi | Sorting Short Keys in Circuits of Size o(n log n) | SODA'21 | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the classical problem of sorting an input array containing $n$
elements, where each element is described with a $k$-bit comparison-key and a
$w$-bit payload. A long-standing open problem is whether there exist $(k + w)
\cdot o(n \log n)$-sized boolean circuits for sorting. We show that one can
overcome th... | [
{
"created": "Thu, 15 Oct 2020 13:17:44 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Oct 2020 20:31:54 GMT",
"version": "v2"
}
] | 2020-10-28 | [
[
"Asharov",
"Gilad",
""
],
[
"Lin",
"Wei-Kai",
""
],
[
"Shi",
"Elaine",
""
]
] | We consider the classical problem of sorting an input array containing $n$ elements, where each element is described with a $k$-bit comparison-key and a $w$-bit payload. A long-standing open problem is whether there exist $(k + w) \cdot o(n \log n)$-sized boolean circuits for sorting. We show that one can overcome the ... |
2209.12491 | Yufeng Shi | Yufeng Shi, Shujian Yu, Duanquan Xu, Xinge You | Information-Theoretic Hashing for Zero-Shot Cross-Modal Retrieval | null | null | null | null | cs.LG cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Zero-shot cross-modal retrieval (ZS-CMR) deals with the retrieval problem
among heterogenous data from unseen classes. Typically, to guarantee
generalization, the pre-defined class embeddings from natural language
processing (NLP) models are used to build a common space. In this paper,
instead of using an extra NLP m... | [
{
"created": "Mon, 26 Sep 2022 08:05:20 GMT",
"version": "v1"
}
] | 2022-09-27 | [
[
"Shi",
"Yufeng",
""
],
[
"Yu",
"Shujian",
""
],
[
"Xu",
"Duanquan",
""
],
[
"You",
"Xinge",
""
]
] | Zero-shot cross-modal retrieval (ZS-CMR) deals with the retrieval problem among heterogenous data from unseen classes. Typically, to guarantee generalization, the pre-defined class embeddings from natural language processing (NLP) models are used to build a common space. In this paper, instead of using an extra NLP mod... |
2208.06003 | Na Young Ahn | Na Young Ahn and Dong Hoon Lee | Security of IoT Device: Perspective Forensic/Anti-Forensic Issues on
Invalid Area of NAND Flash Memory | IEEE Access, early published by July 14, 2022 | null | 10.1109/ACCESS.2022.3190957 | null | cs.CR cs.AR | http://creativecommons.org/licenses/by/4.0/ | NAND flash memory-based IoT device can potentially still leave behind
original personal data in an invalid area even if the data has been deleted. In
this paper, we raise the forensic issue of original data remaining in unmanaged
blocks caused by NAND flash memory and introduce methods for secure deletion of
such dat... | [
{
"created": "Tue, 2 Aug 2022 01:18:00 GMT",
"version": "v1"
}
] | 2022-08-15 | [
[
"Ahn",
"Na Young",
""
],
[
"Lee",
"Dong Hoon",
""
]
] | NAND flash memory-based IoT device can potentially still leave behind original personal data in an invalid area even if the data has been deleted. In this paper, we raise the forensic issue of original data remaining in unmanaged blocks caused by NAND flash memory and introduce methods for secure deletion of such data ... |
1710.02921 | Yasmine Badr | Yasmine Badr and Puneet Gupta | Hotspot-aware DSA Grouping and Mask Assignment | 5 pages | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Directed Self Assembly (DSA), poor printing of guiding templates can cause
misassembly resulting in high defect probability. Therefore, hotspots should be
avoided in the choice of the DSA groups. Accordingly, Directed Self-Assembly
(DSA) technologies which use Multiple Patterning (MP) to print the guiding
template... | [
{
"created": "Mon, 9 Oct 2017 02:55:33 GMT",
"version": "v1"
}
] | 2017-10-10 | [
[
"Badr",
"Yasmine",
""
],
[
"Gupta",
"Puneet",
""
]
] | In Directed Self Assembly (DSA), poor printing of guiding templates can cause misassembly resulting in high defect probability. Therefore, hotspots should be avoided in the choice of the DSA groups. Accordingly, Directed Self-Assembly (DSA) technologies which use Multiple Patterning (MP) to print the guiding templates ... |
2405.20819 | Arunkumar Pennathur | Alejandra Martinez, Laura Tovar, Carla Irigoyen Amparan, Karen
Gonzalez, Prajina Edayath, Priyadarshini Pennathur, and Arunkumar Pennathur | Heuristic evaluations of back support, shoulder support, hand grip
strength support, and sit-stand support exoskeletons using universal design
principles | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Occupational exoskeletons promise to reduce the incidence of musculoskeletal
injuries; however, we do not know if their designs allow universal use by all
workers. We also do not know how easy the tasks of assembling, donning,
doffing, and disassembling exoskeletons are. The purpose of our study was to
heuristically ... | [
{
"created": "Fri, 31 May 2024 14:14:14 GMT",
"version": "v1"
}
] | 2024-06-03 | [
[
"Martinez",
"Alejandra",
""
],
[
"Tovar",
"Laura",
""
],
[
"Amparan",
"Carla Irigoyen",
""
],
[
"Gonzalez",
"Karen",
""
],
[
"Edayath",
"Prajina",
""
],
[
"Pennathur",
"Priyadarshini",
""
],
[
"Pennathur",
"Aru... | Occupational exoskeletons promise to reduce the incidence of musculoskeletal injuries; however, we do not know if their designs allow universal use by all workers. We also do not know how easy the tasks of assembling, donning, doffing, and disassembling exoskeletons are. The purpose of our study was to heuristically ev... |
2111.15099 | Tristan Milne | Tristan Milne, \'Etienne Bilocq, Adrian Nachman | Trust the Critics: Generatorless and Multipurpose WGANs with Initial
Convergence Guarantees | 20 pages, 8 figures | null | null | null | cs.LG cs.CV cs.NE math.OC | http://creativecommons.org/licenses/by/4.0/ | Inspired by ideas from optimal transport theory we present Trust the Critics
(TTC), a new algorithm for generative modelling. This algorithm eliminates the
trainable generator from a Wasserstein GAN; instead, it iteratively modifies
the source data using gradient descent on a sequence of trained critic
networks. This... | [
{
"created": "Tue, 30 Nov 2021 03:36:44 GMT",
"version": "v1"
}
] | 2021-12-01 | [
[
"Milne",
"Tristan",
""
],
[
"Bilocq",
"Étienne",
""
],
[
"Nachman",
"Adrian",
""
]
] | Inspired by ideas from optimal transport theory we present Trust the Critics (TTC), a new algorithm for generative modelling. This algorithm eliminates the trainable generator from a Wasserstein GAN; instead, it iteratively modifies the source data using gradient descent on a sequence of trained critic networks. This i... |
1909.11508 | Neelanjan Bhowmik | Neelanjan Bhowmik, Qian Wang, Yona Falinie A. Gaus, Marcin Szarek,
Toby P. Breckon | The Good, the Bad and the Ugly: Evaluating Convolutional Neural Networks
for Prohibited Item Detection Using Real and Synthetically Composited X-ray
Imagery | null | In Proc. British Machine Vision Conference Workshops, BMVA, 2019 | null | null | cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting prohibited items in X-ray security imagery is pivotal in
maintaining border and transport security against a wide range of threat
profiles. Convolutional Neural Networks (CNN) with the support of a significant
volume of data have brought advancement in such automated prohibited object
detection and classifi... | [
{
"created": "Wed, 25 Sep 2019 14:16:16 GMT",
"version": "v1"
}
] | 2019-09-26 | [
[
"Bhowmik",
"Neelanjan",
""
],
[
"Wang",
"Qian",
""
],
[
"Gaus",
"Yona Falinie A.",
""
],
[
"Szarek",
"Marcin",
""
],
[
"Breckon",
"Toby P.",
""
]
] | Detecting prohibited items in X-ray security imagery is pivotal in maintaining border and transport security against a wide range of threat profiles. Convolutional Neural Networks (CNN) with the support of a significant volume of data have brought advancement in such automated prohibited object detection and classifica... |
1405.3532 | Eric Rowland | Aline Parreau, Michel Rigo, Eric Rowland, Elise Vandomme | A new approach to the $2$-regularity of the $\ell$-abelian complexity of
$2$-automatic sequences | 44 pages, 2 figures; publication version | The Electronic Journal of Combinatorics 22 (2015) #P1.27 (44
pages) | null | null | cs.FL math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove that a sequence satisfying a certain symmetry property is
$2$-regular in the sense of Allouche and Shallit, i.e., the $\mathbb{Z}$-module
generated by its $2$-kernel is finitely generated. We apply this theorem to
develop a general approach for studying the $\ell$-abelian complexity of
$2$-automatic sequence... | [
{
"created": "Wed, 14 May 2014 15:19:23 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Feb 2015 12:36:39 GMT",
"version": "v2"
}
] | 2023-09-04 | [
[
"Parreau",
"Aline",
""
],
[
"Rigo",
"Michel",
""
],
[
"Rowland",
"Eric",
""
],
[
"Vandomme",
"Elise",
""
]
] | We prove that a sequence satisfying a certain symmetry property is $2$-regular in the sense of Allouche and Shallit, i.e., the $\mathbb{Z}$-module generated by its $2$-kernel is finitely generated. We apply this theorem to develop a general approach for studying the $\ell$-abelian complexity of $2$-automatic sequences.... |
1809.08678 | Shuaa Alharbi | Shuaa S. Alharbi, Cigdem Sazak, Carl J. Nelson and Boguslaw Obara | Curvilinear Structure Enhancement by Multiscale Top-Hat Tensor in 2D/3D
Images | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A wide range of biomedical applications requires enhancement, detection,
quantification and modelling of curvilinear structures in 2D and 3D images.
Curvilinear structure enhancement is a crucial step for further analysis, but
many of the enhancement approaches still suffer from contrast variations and
noise. This ca... | [
{
"created": "Sun, 23 Sep 2018 20:58:58 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Jan 2019 20:55:27 GMT",
"version": "v2"
}
] | 2019-01-08 | [
[
"Alharbi",
"Shuaa S.",
""
],
[
"Sazak",
"Cigdem",
""
],
[
"Nelson",
"Carl J.",
""
],
[
"Obara",
"Boguslaw",
""
]
] | A wide range of biomedical applications requires enhancement, detection, quantification and modelling of curvilinear structures in 2D and 3D images. Curvilinear structure enhancement is a crucial step for further analysis, but many of the enhancement approaches still suffer from contrast variations and noise. This can ... |
2306.07893 | Fan Yao | Fan Yao, Chuanhao Li, Karthik Abinav Sankararaman, Yiming Liao, Yan
Zhu, Qifan Wang, Hongning Wang, Haifeng Xu | Rethinking Incentives in Recommender Systems: Are Monotone Rewards
Always Beneficial? | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The past decade has witnessed the flourishing of a new profession as media
content creators, who rely on revenue streams from online content
recommendation platforms. The reward mechanism employed by these platforms
creates a competitive environment among creators which affect their production
choices and, consequent... | [
{
"created": "Tue, 13 Jun 2023 16:38:47 GMT",
"version": "v1"
},
{
"created": "Sun, 9 Jul 2023 17:30:23 GMT",
"version": "v2"
}
] | 2023-07-11 | [
[
"Yao",
"Fan",
""
],
[
"Li",
"Chuanhao",
""
],
[
"Sankararaman",
"Karthik Abinav",
""
],
[
"Liao",
"Yiming",
""
],
[
"Zhu",
"Yan",
""
],
[
"Wang",
"Qifan",
""
],
[
"Wang",
"Hongning",
""
],
[
"Xu",
... | The past decade has witnessed the flourishing of a new profession as media content creators, who rely on revenue streams from online content recommendation platforms. The reward mechanism employed by these platforms creates a competitive environment among creators which affect their production choices and, consequently... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.