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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1508.03101 | Jason McEwen | J. D. McEwen, M. B\"uttner, B. Leistedt, H. V. Peiris and Y. Wiaux | A novel sampling theorem on the rotation group | 5 pages, 2 figures, minor changes to match version accepted for
publication. Code available at http://www.sothree.org | IEEE Signal Processing Letters. Vol. 22, No. 12, 2015, pp
2425-2429 | 10.1109/LSP.2015.2490676 | null | cs.IT astro-ph.IM math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a novel sampling theorem for functions defined on the
three-dimensional rotation group SO(3) by connecting the rotation group to the
three-torus through a periodic extension. Our sampling theorem requires $4L^3$
samples to capture all of the information content of a signal band-limited at
$L$, reducing the... | [
{
"created": "Thu, 13 Aug 2015 02:11:23 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Jan 2016 12:23:41 GMT",
"version": "v2"
}
] | 2016-01-11 | [
[
"McEwen",
"J. D.",
""
],
[
"Büttner",
"M.",
""
],
[
"Leistedt",
"B.",
""
],
[
"Peiris",
"H. V.",
""
],
[
"Wiaux",
"Y.",
""
]
] | We develop a novel sampling theorem for functions defined on the three-dimensional rotation group SO(3) by connecting the rotation group to the three-torus through a periodic extension. Our sampling theorem requires $4L^3$ samples to capture all of the information content of a signal band-limited at $L$, reducing the n... |
1007.1484 | David Eppstein | Erin Chambers and David Eppstein | Flows in One-Crossing-Minor-Free Graphs | 16 pages, 4 figures | J. Graph Algorithms & Applications 17(3): 201-220, 2013 | 10.7155/jgaa.00291 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the maximum flow problem in directed H-minor-free graphs where H can
be drawn in the plane with one crossing. If a structural decomposition of the
graph as a clique-sum of planar graphs and graphs of constant complexity is
given, we show that a maximum flow can be computed in O(n log n) time. In
particular, ... | [
{
"created": "Thu, 8 Jul 2010 23:24:59 GMT",
"version": "v1"
}
] | 2015-07-16 | [
[
"Chambers",
"Erin",
""
],
[
"Eppstein",
"David",
""
]
] | We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in the plane with one crossing. If a structural decomposition of the graph as a clique-sum of planar graphs and graphs of constant complexity is given, we show that a maximum flow can be computed in O(n log n) time. In particular, ma... |
1501.06158 | Adi Vardi | Yossi Azar and Adi Vardi | TSP with Time Windows and Service Time | arXiv admin note: substantial text overlap with arXiv:1309.0251 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider TSP with time windows and service time. In this problem we
receive a sequence of requests for a service at nodes in a metric space and a
time window for each request. The goal of the online algorithm is to maximize
the number of requests served during their time window. The time to traverse an
edge is the... | [
{
"created": "Sun, 25 Jan 2015 13:52:36 GMT",
"version": "v1"
}
] | 2015-01-27 | [
[
"Azar",
"Yossi",
""
],
[
"Vardi",
"Adi",
""
]
] | We consider TSP with time windows and service time. In this problem we receive a sequence of requests for a service at nodes in a metric space and a time window for each request. The goal of the online algorithm is to maximize the number of requests served during their time window. The time to traverse an edge is the d... |
2103.16025 | Sen Tian | Sen Tian, Panos Ipeirotis | On the Predictability of Utilizing Rank Percentile to Evaluate
Scientific Impact | The dataset and the code to reproduce the results in this paper are
available online at https://github.com/sentian/SciImpactRanking | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bibliographic metrics are commonly utilized for evaluation purposes within
academia, often in conjunction with other metrics. These metrics vary widely
across fields and change with the seniority of the scholar; consequently, the
only way to interpret these values is by comparison with other academics within
the same... | [
{
"created": "Tue, 30 Mar 2021 02:07:58 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jul 2021 04:04:23 GMT",
"version": "v2"
},
{
"created": "Thu, 16 Dec 2021 06:39:16 GMT",
"version": "v3"
}
] | 2021-12-17 | [
[
"Tian",
"Sen",
""
],
[
"Ipeirotis",
"Panos",
""
]
] | Bibliographic metrics are commonly utilized for evaluation purposes within academia, often in conjunction with other metrics. These metrics vary widely across fields and change with the seniority of the scholar; consequently, the only way to interpret these values is by comparison with other academics within the same f... |
1612.08534 | Fang Zhao | Fang Zhao, Jiashi Feng, Jian Zhao, Wenhan Yang, Shuicheng Yan | Robust LSTM-Autoencoders for Face De-Occlusion in the Wild | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Face recognition techniques have been developed significantly in recent
years. However, recognizing faces with partial occlusion is still challenging
for existing face recognizers which is heavily desired in real-world
applications concerning surveillance and security. Although much research
effort has been devoted t... | [
{
"created": "Tue, 27 Dec 2016 08:36:48 GMT",
"version": "v1"
}
] | 2016-12-28 | [
[
"Zhao",
"Fang",
""
],
[
"Feng",
"Jiashi",
""
],
[
"Zhao",
"Jian",
""
],
[
"Yang",
"Wenhan",
""
],
[
"Yan",
"Shuicheng",
""
]
] | Face recognition techniques have been developed significantly in recent years. However, recognizing faces with partial occlusion is still challenging for existing face recognizers which is heavily desired in real-world applications concerning surveillance and security. Although much research effort has been devoted to ... |
2209.14599 | Toan Pham Van | Toan Pham Van, Linh Bao Doan, Thanh Tung Nguyen, Duc Trung Tran, Quan
Van Nguyen, Dinh Viet Sang | Online pseudo labeling for polyp segmentation with momentum networks | Accepted in KSE 2022 | null | null | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | Semantic segmentation is an essential task in developing medical image
diagnosis systems. However, building an annotated medical dataset is expensive.
Thus, semi-supervised methods are significant in this circumstance. In
semi-supervised learning, the quality of labels plays a crucial role in model
performance. In th... | [
{
"created": "Thu, 29 Sep 2022 07:33:54 GMT",
"version": "v1"
}
] | 2022-09-30 | [
[
"Van",
"Toan Pham",
""
],
[
"Doan",
"Linh Bao",
""
],
[
"Nguyen",
"Thanh Tung",
""
],
[
"Tran",
"Duc Trung",
""
],
[
"Van Nguyen",
"Quan",
""
],
[
"Sang",
"Dinh Viet",
""
]
] | Semantic segmentation is an essential task in developing medical image diagnosis systems. However, building an annotated medical dataset is expensive. Thus, semi-supervised methods are significant in this circumstance. In semi-supervised learning, the quality of labels plays a crucial role in model performance. In this... |
2007.07316 | Nisarg Shah | Safwan Hossain, Nisarg Shah | The Effect of Strategic Noise in Linear Regression | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We build on an emerging line of work which studies strategic manipulations in
training data provided to machine learning algorithms. Specifically, we focus
on the ubiquitous task of linear regression. Prior work focused on the design
of strategyproof algorithms, which aim to prevent such manipulations altogether
by a... | [
{
"created": "Tue, 14 Jul 2020 19:28:19 GMT",
"version": "v1"
}
] | 2020-07-16 | [
[
"Hossain",
"Safwan",
""
],
[
"Shah",
"Nisarg",
""
]
] | We build on an emerging line of work which studies strategic manipulations in training data provided to machine learning algorithms. Specifically, we focus on the ubiquitous task of linear regression. Prior work focused on the design of strategyproof algorithms, which aim to prevent such manipulations altogether by ali... |
1901.03285 | Fabian Steiner | Alexandru Dominic Git, Bal\'azs Matuz, Fabian Steiner | Protograph-Based LDPC Code Design for Probabilistic Shaping with On-Off
Keying | Invited Paper for CISS 2019 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work investigates protograph-based LDPC codes for the AWGN channel with
OOK modulation. A non-uniform distribution of the OOK modulation symbols is
considered to improve the power efficiency especially for low SNRs. To this
end, a specific transmitter architecture based on time sharing is proposed that
allows pr... | [
{
"created": "Thu, 10 Jan 2019 17:29:35 GMT",
"version": "v1"
}
] | 2019-01-11 | [
[
"Git",
"Alexandru Dominic",
""
],
[
"Matuz",
"Balázs",
""
],
[
"Steiner",
"Fabian",
""
]
] | This work investigates protograph-based LDPC codes for the AWGN channel with OOK modulation. A non-uniform distribution of the OOK modulation symbols is considered to improve the power efficiency especially for low SNRs. To this end, a specific transmitter architecture based on time sharing is proposed that allows prob... |
2105.10880 | Yang Li | Yang Li, Hermawan Mulyono, Ying Chen, Zhiyin Lu, Desmond Chan | RtFPS: An Interactive Map that Visualizes and Predicts Wildfires in the
US | Source code: https://github.com/yangland/rtfps | null | null | null | cs.LG cs.HC cs.IR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Climate change has largely impacted our daily lives. As one of its
consequences, we are experiencing more wildfires. In the year 2020, wildfires
burned a record number of 8,888,297 acres in the US. To awaken people's
attention to climate change, and to visualize the current risk of wildfires, We
developed RtFPS, "Rea... | [
{
"created": "Sun, 23 May 2021 08:07:01 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Jun 2021 01:58:27 GMT",
"version": "v2"
}
] | 2021-06-23 | [
[
"Li",
"Yang",
""
],
[
"Mulyono",
"Hermawan",
""
],
[
"Chen",
"Ying",
""
],
[
"Lu",
"Zhiyin",
""
],
[
"Chan",
"Desmond",
""
]
] | Climate change has largely impacted our daily lives. As one of its consequences, we are experiencing more wildfires. In the year 2020, wildfires burned a record number of 8,888,297 acres in the US. To awaken people's attention to climate change, and to visualize the current risk of wildfires, We developed RtFPS, "Real-... |
2403.10842 | Mohammad Ali Labbaf Khaniki | Mohammad Ali Labbaf-Khaniki, Mohammad Manthouri | Twin Transformer using Gated Dynamic Learnable Attention mechanism for
Fault Detection and Diagnosis in the Tennessee Eastman Process | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fault detection and diagnosis (FDD) is a crucial task for ensuring the safety
and efficiency of industrial processes. We propose a novel FDD methodology for
the Tennessee Eastman Process (TEP), a widely used benchmark for chemical
process control. The model employs two separate Transformer branches, enabling
independ... | [
{
"created": "Sat, 16 Mar 2024 07:40:23 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Apr 2024 18:37:10 GMT",
"version": "v2"
},
{
"created": "Fri, 21 Jun 2024 07:04:49 GMT",
"version": "v3"
}
] | 2024-06-24 | [
[
"Labbaf-Khaniki",
"Mohammad Ali",
""
],
[
"Manthouri",
"Mohammad",
""
]
] | Fault detection and diagnosis (FDD) is a crucial task for ensuring the safety and efficiency of industrial processes. We propose a novel FDD methodology for the Tennessee Eastman Process (TEP), a widely used benchmark for chemical process control. The model employs two separate Transformer branches, enabling independen... |
2101.05634 | Renato Stoffalette Joao | Renato Stoffalette Jo\~ao and Pavlos Fafalios and Stefan Dietze | Better Together -- An Ensemble Learner for Combining the Results of
Ready-made Entity Linking Systems | SAC '20: Proceedings of the 35th Annual ACM Symposium on Applied
Computing | null | 10.1145/3341105.3373883 | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Entity linking (EL) is the task of automatically identifying entity mentions
in text and resolving them to a corresponding entity in a reference knowledge
base like Wikipedia. Throughout the past decade, a plethora of EL systems and
pipelines have become available, where performance of individual systems varies
heavi... | [
{
"created": "Thu, 14 Jan 2021 14:42:57 GMT",
"version": "v1"
}
] | 2021-01-15 | [
[
"João",
"Renato Stoffalette",
""
],
[
"Fafalios",
"Pavlos",
""
],
[
"Dietze",
"Stefan",
""
]
] | Entity linking (EL) is the task of automatically identifying entity mentions in text and resolving them to a corresponding entity in a reference knowledge base like Wikipedia. Throughout the past decade, a plethora of EL systems and pipelines have become available, where performance of individual systems varies heavily... |
1009.4386 | David Malone | Minyu Fang, David Malone, Ken R. Duffy, and Douglas J. Leith | Decentralised Learning MACs for Collision-free Access in WLANs | null | Springer Wireless Networks 2013, Volume 19, Issue 1, pp 83-98 | 10.1007/s11276-012-0452-1 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By combining the features of CSMA and TDMA, fully decentralised WLAN MAC
schemes have recently been proposed that converge to collision-free schedules.
In this paper we describe a MAC with optimal long-run throughput that is almost
decentralised. We then design two \changed{schemes} that are practically
realisable, d... | [
{
"created": "Wed, 22 Sep 2010 15:24:12 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Mar 2011 16:42:44 GMT",
"version": "v2"
}
] | 2013-09-19 | [
[
"Fang",
"Minyu",
""
],
[
"Malone",
"David",
""
],
[
"Duffy",
"Ken R.",
""
],
[
"Leith",
"Douglas J.",
""
]
] | By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a MAC with optimal long-run throughput that is almost decentralised. We then design two \changed{schemes} that are practically realisable, dec... |
2308.04336 | Krzysztof Turowski | Alan Frieze and Krzysztof Turowski and Wojciech Szpankowski | On the concentration of the maximum degree in the duplication-divergence
models | null | null | null | null | cs.DM | http://creativecommons.org/licenses/by/4.0/ | We present a rigorous and precise analysis of the maximum degree and the
average degree in a dynamic duplication-divergence graph model introduced by
Sol\'e, Pastor-Satorras et al. in which the graph grows according to a
duplication-divergence mechanism, i.e. by iteratively creating a copy of some
node and then rando... | [
{
"created": "Tue, 8 Aug 2023 15:30:07 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Dec 2023 17:29:17 GMT",
"version": "v2"
}
] | 2023-12-07 | [
[
"Frieze",
"Alan",
""
],
[
"Turowski",
"Krzysztof",
""
],
[
"Szpankowski",
"Wojciech",
""
]
] | We present a rigorous and precise analysis of the maximum degree and the average degree in a dynamic duplication-divergence graph model introduced by Sol\'e, Pastor-Satorras et al. in which the graph grows according to a duplication-divergence mechanism, i.e. by iteratively creating a copy of some node and then randoml... |
1702.00616 | Fedor Sandomirskiy | Anna Bogomolnaia, Herve Moulin, Fedor Sandomirskiy, Elena Yanovskaya | Competitive division of a mixed manna | 33 pages, 13 figures; this paper subsumes arXiv:1608.01540 and
arXiv:1610.03745 | null | null | null | cs.GT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A mixed manna contains goods (that everyone likes), bads (that everyone
dislikes), as well as items that are goods to some agents, but bads or satiated
to others.
If all items are goods and utility functions are homothetic, concave (and
monotone), the Competitive Equilibrium with Equal Incomes maximizes the Nash
pr... | [
{
"created": "Thu, 2 Feb 2017 11:07:53 GMT",
"version": "v1"
}
] | 2017-02-03 | [
[
"Bogomolnaia",
"Anna",
""
],
[
"Moulin",
"Herve",
""
],
[
"Sandomirskiy",
"Fedor",
""
],
[
"Yanovskaya",
"Elena",
""
]
] | A mixed manna contains goods (that everyone likes), bads (that everyone dislikes), as well as items that are goods to some agents, but bads or satiated to others. If all items are goods and utility functions are homothetic, concave (and monotone), the Competitive Equilibrium with Equal Incomes maximizes the Nash produc... |
1503.03585 | Jascha Sohl-Dickstein | Jascha Sohl-Dickstein, Eric A. Weiss, Niru Maheswaranathan, Surya
Ganguli | Deep Unsupervised Learning using Nonequilibrium Thermodynamics | null | null | null | null | cs.LG cond-mat.dis-nn q-bio.NC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A central problem in machine learning involves modeling complex data-sets
using highly flexible families of probability distributions in which learning,
sampling, inference, and evaluation are still analytically or computationally
tractable. Here, we develop an approach that simultaneously achieves both
flexibility a... | [
{
"created": "Thu, 12 Mar 2015 04:51:37 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Apr 2015 06:48:02 GMT",
"version": "v2"
},
{
"created": "Wed, 29 Apr 2015 06:00:20 GMT",
"version": "v3"
},
{
"created": "Wed, 13 May 2015 01:57:49 GMT",
"version": "v4"
},
{
"cr... | 2015-11-20 | [
[
"Sohl-Dickstein",
"Jascha",
""
],
[
"Weiss",
"Eric A.",
""
],
[
"Maheswaranathan",
"Niru",
""
],
[
"Ganguli",
"Surya",
""
]
] | A central problem in machine learning involves modeling complex data-sets using highly flexible families of probability distributions in which learning, sampling, inference, and evaluation are still analytically or computationally tractable. Here, we develop an approach that simultaneously achieves both flexibility and... |
1811.06166 | Tianchi Huang | Tianchi Huang, Xin Yao, Chenglei Wu, Rui-Xiao Zhang, Zhangyuan Pang,
Lifeng Sun | Tiyuntsong: A Self-Play Reinforcement Learning Approach for ABR Video
Streaming | Published in ICME 2019 | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing reinforcement learning~(RL)-based adaptive bitrate~(ABR) approaches
outperform the previous fixed control rules based methods by improving the
Quality of Experience~(QoE) score, as the QoE metric can hardly provide clear
guidance for optimization, finally resulting in the unexpected strategies. In
this paper... | [
{
"created": "Thu, 15 Nov 2018 04:29:49 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Feb 2019 14:05:02 GMT",
"version": "v2"
},
{
"created": "Thu, 2 May 2019 14:40:30 GMT",
"version": "v3"
}
] | 2019-05-03 | [
[
"Huang",
"Tianchi",
""
],
[
"Yao",
"Xin",
""
],
[
"Wu",
"Chenglei",
""
],
[
"Zhang",
"Rui-Xiao",
""
],
[
"Pang",
"Zhangyuan",
""
],
[
"Sun",
"Lifeng",
""
]
] | Existing reinforcement learning~(RL)-based adaptive bitrate~(ABR) approaches outperform the previous fixed control rules based methods by improving the Quality of Experience~(QoE) score, as the QoE metric can hardly provide clear guidance for optimization, finally resulting in the unexpected strategies. In this paper, ... |
2002.06816 | Pamela K. Douglas | Pamela K. Douglas, Farzad Vasheghani Farahani | On the Similarity of Deep Learning Representations Across Didactic and
Adversarial Examples | 2 figures | Med NeurIPS 2019 | null | null | cs.CV cs.LG eess.IV q-bio.NC | http://creativecommons.org/licenses/by/4.0/ | The increasing use of deep neural networks (DNNs) has motivated a parallel
endeavor: the design of adversaries that profit from successful
misclassifications. However, not all adversarial examples are crafted for
malicious purposes. For example, real world systems often contain physical,
temporal, and sampling variab... | [
{
"created": "Mon, 17 Feb 2020 07:49:20 GMT",
"version": "v1"
}
] | 2020-02-18 | [
[
"Douglas",
"Pamela K.",
""
],
[
"Farahani",
"Farzad Vasheghani",
""
]
] | The increasing use of deep neural networks (DNNs) has motivated a parallel endeavor: the design of adversaries that profit from successful misclassifications. However, not all adversarial examples are crafted for malicious purposes. For example, real world systems often contain physical, temporal, and sampling variabil... |
2403.14639 | Andrei Khurshudov | Andrei Khurshudov | On Defining Smart Cities using Transformer Neural Networks | 16 pages, 2 fugures | International Journal of Computer and Technology Vol 24 (2024)
ISSN: 2277-3061 | 10.24297/ijct.v24i.9579 | null | cs.CY cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Cities worldwide are rapidly adopting smart technologies, transforming urban
life. Despite this trend, a universally accepted definition of 'smart city'
remains elusive. Past efforts to define it have not yielded a consensus, as
evidenced by the numerous definitions in use. In this paper, we endeavored to
create a ne... | [
{
"created": "Tue, 20 Feb 2024 18:34:24 GMT",
"version": "v1"
}
] | 2024-03-25 | [
[
"Khurshudov",
"Andrei",
""
]
] | Cities worldwide are rapidly adopting smart technologies, transforming urban life. Despite this trend, a universally accepted definition of 'smart city' remains elusive. Past efforts to define it have not yielded a consensus, as evidenced by the numerous definitions in use. In this paper, we endeavored to create a new ... |
2311.14726 | Frank Heyen | Frank Heyen, Alejandro Gabino Diaz Mendoza, Quynh Quang Ngo, Michael
Sedlmair | Visual Guitar Tab Comparison | Late-breaking demo for ISMIR 2023
https://ismir2023program.ismir.net/lbd_357.html | null | null | null | cs.HC cs.GR | http://creativecommons.org/licenses/by/4.0/ | We designed a visual interface for comparing different guitar tablature (tab)
versions of the same piece. By automatically aligning the bars of these
versions and visually encoding different metrics, our interface helps determine
similarity, difficulty, and correctness. During our design, we collected and
integrated ... | [
{
"created": "Mon, 20 Nov 2023 11:09:59 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Heyen",
"Frank",
""
],
[
"Mendoza",
"Alejandro Gabino Diaz",
""
],
[
"Ngo",
"Quynh Quang",
""
],
[
"Sedlmair",
"Michael",
""
]
] | We designed a visual interface for comparing different guitar tablature (tab) versions of the same piece. By automatically aligning the bars of these versions and visually encoding different metrics, our interface helps determine similarity, difficulty, and correctness. During our design, we collected and integrated fe... |
2211.13339 | Bilal Farooq | Daniel Opoku Mensah and Godwin Badu-Marfo and Bilal Farooq | Robustness Analysis of Deep Learning Models for Population Synthesis | arXiv admin note: text overlap with arXiv:2203.03489,
arXiv:1909.07689 by other authors | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep generative models have become useful for synthetic data generation,
particularly population synthesis. The models implicitly learn the probability
distribution of a dataset and can draw samples from a distribution. Several
models have been proposed, but their performance is only tested on a single
cross-sectiona... | [
{
"created": "Wed, 23 Nov 2022 22:55:55 GMT",
"version": "v1"
}
] | 2022-11-28 | [
[
"Mensah",
"Daniel Opoku",
""
],
[
"Badu-Marfo",
"Godwin",
""
],
[
"Farooq",
"Bilal",
""
]
] | Deep generative models have become useful for synthetic data generation, particularly population synthesis. The models implicitly learn the probability distribution of a dataset and can draw samples from a distribution. Several models have been proposed, but their performance is only tested on a single cross-sectional ... |
1811.02658 | George Kesidis | Yujia Wang, David J. Miller, George Kesidis | When Not to Classify: Detection of Reverse Engineering Attacks on DNN
Image Classifiers | null | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses detection of a reverse engineering (RE) attack targeting
a deep neural network (DNN) image classifier; by querying, RE's aim is to
discover the classifier's decision rule. RE can enable test-time evasion
attacks, which require knowledge of the classifier. Recently, we proposed a
quite effective a... | [
{
"created": "Wed, 31 Oct 2018 20:59:49 GMT",
"version": "v1"
}
] | 2018-11-08 | [
[
"Wang",
"Yujia",
""
],
[
"Miller",
"David J.",
""
],
[
"Kesidis",
"George",
""
]
] | This paper addresses detection of a reverse engineering (RE) attack targeting a deep neural network (DNN) image classifier; by querying, RE's aim is to discover the classifier's decision rule. RE can enable test-time evasion attacks, which require knowledge of the classifier. Recently, we proposed a quite effective app... |
2007.00752 | Ana Nora Evans | Ana Nora Evans, Bradford Campbell, Mary Lou Soffa | Is Rust Used Safely by Software Developers? | null | null | 10.1145/3377811.3380413 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rust, an emerging programming language with explosive growth, provides a
robust type system that enables programmers to write memory-safe and data-race
free code. To allow access to a machine's hardware and to support low-level
performance optimizations, a second language, Unsafe Rust, is embedded in Rust.
It contain... | [
{
"created": "Wed, 1 Jul 2020 21:00:25 GMT",
"version": "v1"
}
] | 2020-07-03 | [
[
"Evans",
"Ana Nora",
""
],
[
"Campbell",
"Bradford",
""
],
[
"Soffa",
"Mary Lou",
""
]
] | Rust, an emerging programming language with explosive growth, provides a robust type system that enables programmers to write memory-safe and data-race free code. To allow access to a machine's hardware and to support low-level performance optimizations, a second language, Unsafe Rust, is embedded in Rust. It contains ... |
2305.19107 | Lijian Xu | Ziyu Ni, Linda Wei, Lijian Xu, Simon Yu, Qing Xia, Hongsheng Li and
Shaoting Zhang | Voxel2Hemodynamics: An End-to-end Deep Learning Method for Predicting
Coronary Artery Hemodynamics | 8pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Local hemodynamic forces play an important role in determining the functional
significance of coronary arterial stenosis and understanding the mechanism of
coronary disease progression. Computational fluid dynamics (CFD) have been
widely performed to simulate hemodynamics non-invasively from coronary computed
tomogra... | [
{
"created": "Tue, 30 May 2023 15:12:52 GMT",
"version": "v1"
}
] | 2023-05-31 | [
[
"Ni",
"Ziyu",
""
],
[
"Wei",
"Linda",
""
],
[
"Xu",
"Lijian",
""
],
[
"Yu",
"Simon",
""
],
[
"Xia",
"Qing",
""
],
[
"Li",
"Hongsheng",
""
],
[
"Zhang",
"Shaoting",
""
]
] | Local hemodynamic forces play an important role in determining the functional significance of coronary arterial stenosis and understanding the mechanism of coronary disease progression. Computational fluid dynamics (CFD) have been widely performed to simulate hemodynamics non-invasively from coronary computed tomograph... |
2402.05407 | Xinyi Hu | Xinyi Hu, Nikolaos Pappas, Howard H. Yang | Version age-based client scheduling policy for federated learning | 5 pages, 4 figures, ICASSP 2024 | null | null | null | cs.LG cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated Learning (FL) has emerged as a privacy-preserving machine learning
paradigm facilitating collaborative training across multiple clients without
sharing local data. Despite advancements in edge device capabilities,
communication bottlenecks present challenges in aggregating a large number of
clients; only a ... | [
{
"created": "Thu, 8 Feb 2024 04:48:51 GMT",
"version": "v1"
}
] | 2024-02-09 | [
[
"Hu",
"Xinyi",
""
],
[
"Pappas",
"Nikolaos",
""
],
[
"Yang",
"Howard H.",
""
]
] | Federated Learning (FL) has emerged as a privacy-preserving machine learning paradigm facilitating collaborative training across multiple clients without sharing local data. Despite advancements in edge device capabilities, communication bottlenecks present challenges in aggregating a large number of clients; only a po... |
2407.08990 | Yue Zhang | Yue Zhang, Woyu Zhang, Shaocong Wang, Ning Lin, Yifei Yu, Yangu He, Bo
Wang, Hao Jiang, Peng Lin, Xiaoxin Xu, Xiaojuan Qi, Zhongrui Wang, Xumeng
Zhang, Dashan Shang, Qi Liu, Kwang-Ting Cheng and Ming Liu | Dynamic neural network with memristive CIM and CAM for 2D and 3D vision | In press | null | null | null | cs.AR cs.AI cs.ET cs.NE | http://creativecommons.org/licenses/by/4.0/ | The brain is dynamic, associative and efficient. It reconfigures by
associating the inputs with past experiences, with fused memory and processing.
In contrast, AI models are static, unable to associate inputs with past
experiences, and run on digital computers with physically separated memory and
processing. We prop... | [
{
"created": "Fri, 12 Jul 2024 04:55:57 GMT",
"version": "v1"
}
] | 2024-07-15 | [
[
"Zhang",
"Yue",
""
],
[
"Zhang",
"Woyu",
""
],
[
"Wang",
"Shaocong",
""
],
[
"Lin",
"Ning",
""
],
[
"Yu",
"Yifei",
""
],
[
"He",
"Yangu",
""
],
[
"Wang",
"Bo",
""
],
[
"Jiang",
"Hao",
""
]... | The brain is dynamic, associative and efficient. It reconfigures by associating the inputs with past experiences, with fused memory and processing. In contrast, AI models are static, unable to associate inputs with past experiences, and run on digital computers with physically separated memory and processing. We propos... |
2312.07250 | Lifeng Han Dr | Lifeng Han, Serge Gladkoff, Gleb Erofeev, Irina Sorokina, Betty
Galiano, Goran Nenadic | Neural Machine Translation of Clinical Text: An Empirical Investigation
into Multilingual Pre-Trained Language Models and Transfer-Learning | Accepted by Frontiers in Digital Health - Health Informatics | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We conduct investigations on clinical text machine translation by examining
multilingual neural network models using deep learning such as Transformer
based structures. Furthermore, to address the language resource imbalance
issue, we also carry out experiments using a transfer learning methodology
based on massive m... | [
{
"created": "Tue, 12 Dec 2023 13:26:42 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Feb 2024 12:08:47 GMT",
"version": "v2"
}
] | 2024-02-22 | [
[
"Han",
"Lifeng",
""
],
[
"Gladkoff",
"Serge",
""
],
[
"Erofeev",
"Gleb",
""
],
[
"Sorokina",
"Irina",
""
],
[
"Galiano",
"Betty",
""
],
[
"Nenadic",
"Goran",
""
]
] | We conduct investigations on clinical text machine translation by examining multilingual neural network models using deep learning such as Transformer based structures. Furthermore, to address the language resource imbalance issue, we also carry out experiments using a transfer learning methodology based on massive mul... |
1511.00310 | Daniel Lokshtanov | Daniel Lokshtanov | Parameterized Integer Quadratic Programming: Variables and Coefficients | Added algorithm for undounded IQP's | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the Integer Quadratic Programming problem input is an n*n integer matrix
Q, an m*n integer matrix A and an m-dimensional integer vector b. The task is
to find a vector x in Z^n, minimizing x^TQx, subject to Ax <= b. We give a
fixed parameter tractable algorithm for Integer Quadratic Programming
parameterized by n+... | [
{
"created": "Sun, 1 Nov 2015 21:47:44 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Apr 2017 11:39:57 GMT",
"version": "v2"
}
] | 2017-04-11 | [
[
"Lokshtanov",
"Daniel",
""
]
] | In the Integer Quadratic Programming problem input is an n*n integer matrix Q, an m*n integer matrix A and an m-dimensional integer vector b. The task is to find a vector x in Z^n, minimizing x^TQx, subject to Ax <= b. We give a fixed parameter tractable algorithm for Integer Quadratic Programming parameterized by n+a.... |
2209.01541 | Shihan Lin | Shihan Lin, Rui Xin, Aayush Goel, Xiaowei Yang | InviCloak: An End-to-End Approach to Privacy and Performance in Web
Content Distribution | null | The ACM Conference on Computer and Communications Security 2022 | 10.1145/3548606.3559336 | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In today's web ecosystem, a website that uses a Content Delivery Network
(CDN) shares its Transport Layer Security (TLS) private key or session key with
the CDN. In this paper, we present the design and implementation of InviCloak,
a system that protects the confidentiality and integrity of a user and a
website's pri... | [
{
"created": "Sun, 4 Sep 2022 06:38:27 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Sep 2022 19:30:21 GMT",
"version": "v2"
},
{
"created": "Sun, 18 Sep 2022 11:17:35 GMT",
"version": "v3"
}
] | 2023-01-27 | [
[
"Lin",
"Shihan",
""
],
[
"Xin",
"Rui",
""
],
[
"Goel",
"Aayush",
""
],
[
"Yang",
"Xiaowei",
""
]
] | In today's web ecosystem, a website that uses a Content Delivery Network (CDN) shares its Transport Layer Security (TLS) private key or session key with the CDN. In this paper, we present the design and implementation of InviCloak, a system that protects the confidentiality and integrity of a user and a website's priva... |
2205.08706 | Xun Xu | Xun Xu, Manh Cuong Nguyen, Yasin Yazici, Kangkang Lu, Hlaing Min,
Chuan-Sheng Foo | SemiCurv: Semi-Supervised Curvilinear Structure Segmentation | IEEE Transactions on Image Processing | null | 10.1109/TIP.2022.3189823 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Recent work on curvilinear structure segmentation has mostly focused on
backbone network design and loss engineering. The challenge of collecting
labelled data, an expensive and labor intensive process, has been overlooked.
While labelled data is expensive to obtain, unlabelled data is often readily
available. In thi... | [
{
"created": "Wed, 18 May 2022 03:52:17 GMT",
"version": "v1"
},
{
"created": "Thu, 19 May 2022 05:48:42 GMT",
"version": "v2"
}
] | 2022-09-07 | [
[
"Xu",
"Xun",
""
],
[
"Nguyen",
"Manh Cuong",
""
],
[
"Yazici",
"Yasin",
""
],
[
"Lu",
"Kangkang",
""
],
[
"Min",
"Hlaing",
""
],
[
"Foo",
"Chuan-Sheng",
""
]
] | Recent work on curvilinear structure segmentation has mostly focused on backbone network design and loss engineering. The challenge of collecting labelled data, an expensive and labor intensive process, has been overlooked. While labelled data is expensive to obtain, unlabelled data is often readily available. In this ... |
1706.03549 | Fran\c{c}ois Ollivier | John Masse and Clara Masse and Fran\c{c}ois Ollivier | Automatic differentiation of hybrid models Illustrated by Diffedge
Graphic Methodology. (Survey) | 47 p. Source files from computer experiments available | null | null | null | cs.SY cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the automatic differentiation of hybrid models, viz. models
that may contain delays, logical tests and discontinuities or loops. We
consider differentiation with respect to parameters, initial conditions or the
time. We emphasize the case of a small number of derivations and iterated
differentiations a... | [
{
"created": "Mon, 12 Jun 2017 10:20:59 GMT",
"version": "v1"
}
] | 2017-06-13 | [
[
"Masse",
"John",
""
],
[
"Masse",
"Clara",
""
],
[
"Ollivier",
"François",
""
]
] | We investigate the automatic differentiation of hybrid models, viz. models that may contain delays, logical tests and discontinuities or loops. We consider differentiation with respect to parameters, initial conditions or the time. We emphasize the case of a small number of derivations and iterated differentiations are... |
2205.15204 | Yanhong Annie Liu | Yanhong A. Liu, Scott D. Stoller, Yi Tong, Bo Lin, K. Tuncay Tekle | Programming with rules and everything else, seamlessly | null | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Logic rules are powerful for expressing complex reasoning and analysis
problems. At the same time, they are inconvenient or impossible to use for many
other aspects of applications. Integrating rules in a language with sets and
functions, and furthermore with updates to objects, has been a subject of
significant stud... | [
{
"created": "Mon, 30 May 2022 15:59:03 GMT",
"version": "v1"
}
] | 2022-05-31 | [
[
"Liu",
"Yanhong A.",
""
],
[
"Stoller",
"Scott D.",
""
],
[
"Tong",
"Yi",
""
],
[
"Lin",
"Bo",
""
],
[
"Tekle",
"K. Tuncay",
""
]
] | Logic rules are powerful for expressing complex reasoning and analysis problems. At the same time, they are inconvenient or impossible to use for many other aspects of applications. Integrating rules in a language with sets and functions, and furthermore with updates to objects, has been a subject of significant study.... |
2001.06680 | Guanbin Li | Jie Wu, Guanbin Li, Si Liu, Liang Lin | Tree-Structured Policy based Progressive Reinforcement Learning for
Temporally Language Grounding in Video | To appear in AAAI2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Temporally language grounding in untrimmed videos is a newly-raised task in
video understanding. Most of the existing methods suffer from inferior
efficiency, lacking interpretability, and deviating from the human perception
mechanism. Inspired by human's coarse-to-fine decision-making paradigm, we
formulate a novel ... | [
{
"created": "Sat, 18 Jan 2020 15:08:04 GMT",
"version": "v1"
}
] | 2020-01-22 | [
[
"Wu",
"Jie",
""
],
[
"Li",
"Guanbin",
""
],
[
"Liu",
"Si",
""
],
[
"Lin",
"Liang",
""
]
] | Temporally language grounding in untrimmed videos is a newly-raised task in video understanding. Most of the existing methods suffer from inferior efficiency, lacking interpretability, and deviating from the human perception mechanism. Inspired by human's coarse-to-fine decision-making paradigm, we formulate a novel Tr... |
2107.12778 | Majid Forghani-Elahabad | Majid Forghani-elahabad | Assessing the performance of smart grid communication networks under
both time and budget constraints | null | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The smart grid concept has emerged to address the existing problems in the
traditional electric grid, which has been functioning for more than a hundred
years. The most crucial difference between traditional grids and smart grids is
the communication infrastructure applied to the latter. However, coupling
between the... | [
{
"created": "Tue, 27 Jul 2021 12:43:43 GMT",
"version": "v1"
}
] | 2021-07-28 | [
[
"Forghani-elahabad",
"Majid",
""
]
] | The smart grid concept has emerged to address the existing problems in the traditional electric grid, which has been functioning for more than a hundred years. The most crucial difference between traditional grids and smart grids is the communication infrastructure applied to the latter. However, coupling between these... |
2309.09635 | Colin M. Gray | Colin M. Gray and Thomas Mildner and Nataliia Bielova | Temporal Analysis of Dark Patterns: A Case Study of a User's Odyssey to
Conquer Prime Membership Cancellation through the "Iliad Flow" | null | null | null | null | cs.HC cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Dark patterns are ubiquitous in digital systems, impacting users throughout
their journeys on many popular apps and websites. While substantial efforts
from the research community in the last five years have led to consolidated
taxonomies of dark patterns, including an emerging ontology, most applications
of these de... | [
{
"created": "Mon, 18 Sep 2023 10:12:52 GMT",
"version": "v1"
}
] | 2023-09-19 | [
[
"Gray",
"Colin M.",
""
],
[
"Mildner",
"Thomas",
""
],
[
"Bielova",
"Nataliia",
""
]
] | Dark patterns are ubiquitous in digital systems, impacting users throughout their journeys on many popular apps and websites. While substantial efforts from the research community in the last five years have led to consolidated taxonomies of dark patterns, including an emerging ontology, most applications of these desc... |
1901.09892 | Xiaolei Liu | Xiaolei Liu, Yuheng Luo, Xiaosong Zhang, Qingxin Zhu | A Black-box Attack on Neural Networks Based on Swarm Evolutionary
Algorithm | null | null | 10.1007/978-3-030-55304-3_14 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural networks play an increasingly important role in the field of machine
learning and are included in many applications in society. Unfortunately,
neural networks suffer from adversarial samples generated to attack them.
However, most of the generation approaches either assume that the attacker has
full knowledge ... | [
{
"created": "Sat, 26 Jan 2019 10:25:57 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Liu",
"Xiaolei",
""
],
[
"Luo",
"Yuheng",
""
],
[
"Zhang",
"Xiaosong",
""
],
[
"Zhu",
"Qingxin",
""
]
] | Neural networks play an increasingly important role in the field of machine learning and are included in many applications in society. Unfortunately, neural networks suffer from adversarial samples generated to attack them. However, most of the generation approaches either assume that the attacker has full knowledge of... |
2208.00790 | Zhouyingcheng Liao | Zhouyingcheng Liao, Jimei Yang, Jun Saito, Gerard Pons-Moll, Yang Zhou | Skeleton-free Pose Transfer for Stylized 3D Characters | Accepted at ECCV 2022. Project website https://zycliao.github.io/sfpt | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the first method that automatically transfers poses between
stylized 3D characters without skeletal rigging. In contrast to previous
attempts to learn pose transformations on fixed or topology-equivalent skeleton
templates, our method focuses on a novel scenario to handle skeleton-free
characters with dive... | [
{
"created": "Thu, 28 Jul 2022 20:05:57 GMT",
"version": "v1"
}
] | 2022-08-02 | [
[
"Liao",
"Zhouyingcheng",
""
],
[
"Yang",
"Jimei",
""
],
[
"Saito",
"Jun",
""
],
[
"Pons-Moll",
"Gerard",
""
],
[
"Zhou",
"Yang",
""
]
] | We present the first method that automatically transfers poses between stylized 3D characters without skeletal rigging. In contrast to previous attempts to learn pose transformations on fixed or topology-equivalent skeleton templates, our method focuses on a novel scenario to handle skeleton-free characters with divers... |
1110.0271 | Miguel Angel Martin-Delgado | Miguel-Angel Martin-Delgado | Alan Turing and the Origins of Complexity | Invited contribution to 'ARBOR: scientific journal of CSIC' special
edition devoted to commemorate the Year of Alan Turing. This special issue is
entitled "The Legacy of Alan Turing". Coordinators: Manuel de Leon, Alberto
Ibort and David Martin de Diego | ARBOR Vol 189, No 764 (2013), a083 | 10.3989/arbor.2013.i764. | null | cs.CC cond-mat.stat-mech quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The 75th anniversary of Turing's seminal paper and his centennial year
anniversary occur in 2011 and 2012, respectively. It is natural to review and
assess Turing's contributions in diverse fields in the light of new
developments that his thoughts has triggered in many scientific communities.
Here, the main idea is t... | [
{
"created": "Mon, 3 Oct 2011 06:21:55 GMT",
"version": "v1"
}
] | 2014-02-10 | [
[
"Martin-Delgado",
"Miguel-Angel",
""
]
] | The 75th anniversary of Turing's seminal paper and his centennial year anniversary occur in 2011 and 2012, respectively. It is natural to review and assess Turing's contributions in diverse fields in the light of new developments that his thoughts has triggered in many scientific communities. Here, the main idea is to ... |
2407.05996 | Moritz Reuss | Moritz Reuss, \"Omer Erdin\c{c} Ya\u{g}murlu, Fabian Wenzel, Rudolf
Lioutikov | Multimodal Diffusion Transformer: Learning Versatile Behavior from
Multimodal Goals | RSS 2024 | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | This work introduces the Multimodal Diffusion Transformer (MDT), a novel
diffusion policy framework, that excels at learning versatile behavior from
multimodal goal specifications with few language annotations. MDT leverages a
diffusion-based multimodal transformer backbone and two self-supervised
auxiliary objective... | [
{
"created": "Mon, 8 Jul 2024 14:46:44 GMT",
"version": "v1"
}
] | 2024-07-09 | [
[
"Reuss",
"Moritz",
""
],
[
"Yağmurlu",
"Ömer Erdinç",
""
],
[
"Wenzel",
"Fabian",
""
],
[
"Lioutikov",
"Rudolf",
""
]
] | This work introduces the Multimodal Diffusion Transformer (MDT), a novel diffusion policy framework, that excels at learning versatile behavior from multimodal goal specifications with few language annotations. MDT leverages a diffusion-based multimodal transformer backbone and two self-supervised auxiliary objectives ... |
2211.06001 | Yong Hong | Yong Hong, Deren Li, Shupei Luo, Xin Chen, Yi Yang, Mi Wang | An Improved End-to-End Multi-Target Tracking Method Based on Transformer
Self-Attention | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This study proposes an improved end-to-end multi-target tracking algorithm
that adapts to multi-view multi-scale scenes based on the self-attentive
mechanism of the transformer's encoder-decoder structure. A multi-dimensional
feature extraction backbone network is combined with a self-built semantic
raster map, which... | [
{
"created": "Fri, 11 Nov 2022 04:58:46 GMT",
"version": "v1"
}
] | 2022-11-14 | [
[
"Hong",
"Yong",
""
],
[
"Li",
"Deren",
""
],
[
"Luo",
"Shupei",
""
],
[
"Chen",
"Xin",
""
],
[
"Yang",
"Yi",
""
],
[
"Wang",
"Mi",
""
]
] | This study proposes an improved end-to-end multi-target tracking algorithm that adapts to multi-view multi-scale scenes based on the self-attentive mechanism of the transformer's encoder-decoder structure. A multi-dimensional feature extraction backbone network is combined with a self-built semantic raster map, which i... |
2207.10245 | Oskar van der Wal MSc | Oskar van der Wal, Jaap Jumelet, Katrin Schulz, Willem Zuidema | The Birth of Bias: A case study on the evolution of gender bias in an
English language model | Accepted at the 4th Workshop on Gender Bias in Natural Language
Processing (NAACL, 2022) | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Detecting and mitigating harmful biases in modern language models are widely
recognized as crucial, open problems. In this paper, we take a step back and
investigate how language models come to be biased in the first place. We use a
relatively small language model, using the LSTM architecture trained on an
English Wi... | [
{
"created": "Thu, 21 Jul 2022 00:59:04 GMT",
"version": "v1"
}
] | 2022-07-22 | [
[
"van der Wal",
"Oskar",
""
],
[
"Jumelet",
"Jaap",
""
],
[
"Schulz",
"Katrin",
""
],
[
"Zuidema",
"Willem",
""
]
] | Detecting and mitigating harmful biases in modern language models are widely recognized as crucial, open problems. In this paper, we take a step back and investigate how language models come to be biased in the first place. We use a relatively small language model, using the LSTM architecture trained on an English Wiki... |
1902.01642 | Peer-Olaf Siebers | Daniel Stroud, Christian Wagner, Peer-Olaf Siebers | Agent-Based Simulation Modelling for Reflecting on Consequences of
Digital Mental Health | 16 pages, 18 figures, 3 tables, working paper | null | null | null | cs.MA cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The premise of this working paper is based around agent-based simulation
models and how to go about creating them from given incomplete information.
Agent-based simulations are stochastic simulations that revolve around groups
of agents that each have their own characteristics and can make decisions. Such
simulations... | [
{
"created": "Tue, 5 Feb 2019 11:15:55 GMT",
"version": "v1"
}
] | 2019-02-06 | [
[
"Stroud",
"Daniel",
""
],
[
"Wagner",
"Christian",
""
],
[
"Siebers",
"Peer-Olaf",
""
]
] | The premise of this working paper is based around agent-based simulation models and how to go about creating them from given incomplete information. Agent-based simulations are stochastic simulations that revolve around groups of agents that each have their own characteristics and can make decisions. Such simulations c... |
1111.0432 | Sangkyun Lee | Sangkyun Lee and Stephen J. Wright | Approximate Stochastic Subgradient Estimation Training for Support
Vector Machines | An extended version of the ICPRAM 2012 paper | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Subgradient algorithms for training support vector machines have been quite
successful for solving large-scale and online learning problems. However, they
have been restricted to linear kernels and strongly convex formulations. This
paper describes efficient subgradient approaches without such limitations. Our
approa... | [
{
"created": "Wed, 2 Nov 2011 09:24:26 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Nov 2011 13:33:27 GMT",
"version": "v2"
}
] | 2011-11-04 | [
[
"Lee",
"Sangkyun",
""
],
[
"Wright",
"Stephen J.",
""
]
] | Subgradient algorithms for training support vector machines have been quite successful for solving large-scale and online learning problems. However, they have been restricted to linear kernels and strongly convex formulations. This paper describes efficient subgradient approaches without such limitations. Our approach... |
1405.6922 | Omid Aghazadeh | Omid Aghazadeh and Stefan Carlsson | Large Scale, Large Margin Classification using Indefinite Similarity
Measures | null | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the success of the popular kernelized support vector machines, they
have two major limitations: they are restricted to Positive Semi-Definite (PSD)
kernels, and their training complexity scales at least quadratically with the
size of the data. Many natural measures of similarity between pairs of samples
are n... | [
{
"created": "Tue, 27 May 2014 14:18:26 GMT",
"version": "v1"
}
] | 2014-05-28 | [
[
"Aghazadeh",
"Omid",
""
],
[
"Carlsson",
"Stefan",
""
]
] | Despite the success of the popular kernelized support vector machines, they have two major limitations: they are restricted to Positive Semi-Definite (PSD) kernels, and their training complexity scales at least quadratically with the size of the data. Many natural measures of similarity between pairs of samples are not... |
1007.5406 | Markus Lohrey | Markus Lohrey, Sebastian Maneth and Roy Mennicke | Tree structure compression with RePair | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we introduce a new linear time compression algorithm, called
"Re-pair for Trees", which compresses ranked ordered trees using linear
straight-line context-free tree grammars. Such grammars generalize
straight-line context-free string grammars and allow basic tree operations,
like traversal along edges, t... | [
{
"created": "Fri, 30 Jul 2010 10:14:21 GMT",
"version": "v1"
}
] | 2010-08-02 | [
[
"Lohrey",
"Markus",
""
],
[
"Maneth",
"Sebastian",
""
],
[
"Mennicke",
"Roy",
""
]
] | In this work we introduce a new linear time compression algorithm, called "Re-pair for Trees", which compresses ranked ordered trees using linear straight-line context-free tree grammars. Such grammars generalize straight-line context-free string grammars and allow basic tree operations, like traversal along edges, to ... |
1404.4936 | Tao Zhou | Jin-Hu Liu, Tao Zhou, Zi-Ke Zhang, Zimo Yang, Chuang Liu, Wei-Min Li | Promoting cold-start items in recommender systems | 6 pages, 6 figures | null | 10.1371/journal.pone.0113457 | null | cs.IR cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As one of major challenges, cold-start problem plagues nearly all recommender
systems. In particular, new items will be overlooked, impeding the development
of new products online. Given limited resources, how to utilize the knowledge
of recommender systems and design efficient marketing strategy for new items is
ext... | [
{
"created": "Sat, 19 Apr 2014 08:16:47 GMT",
"version": "v1"
}
] | 2015-06-19 | [
[
"Liu",
"Jin-Hu",
""
],
[
"Zhou",
"Tao",
""
],
[
"Zhang",
"Zi-Ke",
""
],
[
"Yang",
"Zimo",
""
],
[
"Liu",
"Chuang",
""
],
[
"Li",
"Wei-Min",
""
]
] | As one of major challenges, cold-start problem plagues nearly all recommender systems. In particular, new items will be overlooked, impeding the development of new products online. Given limited resources, how to utilize the knowledge of recommender systems and design efficient marketing strategy for new items is extre... |
2005.04865 | Nithin V. Sabu | Nithin V. Sabu, Neeraj Varshney and Abhishek K. Gupta | 3-D Diffusive Molecular Communication with Two Fully-Absorbing
Receivers: Hitting Probability and Performance Analysis | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Exact analytical channel models for molecular communication via diffusion
(MCvD) systems involving multiple fully absorbing receivers (FARs) in a
three-dimensional (3- D) medium are hard to obtain due to the mathematical
intractability of corresponding diffusion equations. This work, therefore,
consider an MCvD syste... | [
{
"created": "Mon, 11 May 2020 05:19:37 GMT",
"version": "v1"
},
{
"created": "Sun, 5 Jul 2020 05:46:43 GMT",
"version": "v2"
},
{
"created": "Mon, 14 Sep 2020 14:07:45 GMT",
"version": "v3"
}
] | 2020-09-15 | [
[
"Sabu",
"Nithin V.",
""
],
[
"Varshney",
"Neeraj",
""
],
[
"Gupta",
"Abhishek K.",
""
]
] | Exact analytical channel models for molecular communication via diffusion (MCvD) systems involving multiple fully absorbing receivers (FARs) in a three-dimensional (3- D) medium are hard to obtain due to the mathematical intractability of corresponding diffusion equations. This work, therefore, consider an MCvD system ... |
2106.15968 | Salvatore Vilella | Salvatore Vilella, Alfonso Semeraro, Daniela Paolotti, Giancarlo Ruffo | The Impact of Disinformation on a Controversial Debate on Social Media | null | EPJ Data Science volume 11, Article number: 29 (2022) | 10.1140/epjds/s13688-022-00342-w | null | cs.SI cs.CY | http://creativecommons.org/licenses/by/4.0/ | In this work we study how pervasive is the presence of disinformation in the
Italian debate around immigration on Twitter and the role of automated accounts
in the diffusion of such content. By characterising the Twitter users with an
\textit{Untrustworthiness} score, that tells us how frequently they engage with
dis... | [
{
"created": "Wed, 30 Jun 2021 10:29:07 GMT",
"version": "v1"
}
] | 2023-02-03 | [
[
"Vilella",
"Salvatore",
""
],
[
"Semeraro",
"Alfonso",
""
],
[
"Paolotti",
"Daniela",
""
],
[
"Ruffo",
"Giancarlo",
""
]
] | In this work we study how pervasive is the presence of disinformation in the Italian debate around immigration on Twitter and the role of automated accounts in the diffusion of such content. By characterising the Twitter users with an \textit{Untrustworthiness} score, that tells us how frequently they engage with disin... |
1808.07586 | Michael Ekstrand | Michael D. Ekstrand and Daniel Kluver | Exploring Author Gender in Book Rating and Recommendation | Expanded version under review | null | null | null | cs.IR cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Collaborative filtering algorithms find useful patterns in rating and
consumption data and exploit these patterns to guide users to good items. Many
of the patterns in rating datasets reflect important real-world differences
between the various users and items in the data; other patterns may be
irrelevant or possibly... | [
{
"created": "Wed, 22 Aug 2018 23:00:26 GMT",
"version": "v1"
},
{
"created": "Sat, 25 Jul 2020 00:14:02 GMT",
"version": "v2"
}
] | 2020-07-28 | [
[
"Ekstrand",
"Michael D.",
""
],
[
"Kluver",
"Daniel",
""
]
] | Collaborative filtering algorithms find useful patterns in rating and consumption data and exploit these patterns to guide users to good items. Many of the patterns in rating datasets reflect important real-world differences between the various users and items in the data; other patterns may be irrelevant or possibly u... |
2401.11611 | Xihaier Luo | Xihaier Luo, Wei Xu, Yihui Ren, Shinjae Yoo, Balu Nadiga | Continuous Field Reconstruction from Sparse Observations with Implicit
Neural Networks | 25 pages,21 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Reliably reconstructing physical fields from sparse sensor data is a
challenge that frequently arises in many scientific domains. In practice, the
process generating the data often is not understood to sufficient accuracy.
Therefore, there is a growing interest in using the deep neural network route
to address the pr... | [
{
"created": "Sun, 21 Jan 2024 22:18:29 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Luo",
"Xihaier",
""
],
[
"Xu",
"Wei",
""
],
[
"Ren",
"Yihui",
""
],
[
"Yoo",
"Shinjae",
""
],
[
"Nadiga",
"Balu",
""
]
] | Reliably reconstructing physical fields from sparse sensor data is a challenge that frequently arises in many scientific domains. In practice, the process generating the data often is not understood to sufficient accuracy. Therefore, there is a growing interest in using the deep neural network route to address the prob... |
1202.0467 | Walid Saad | Walid Saad, Zhu Han, Rong Zheng, Are Hj{\o}rungnes, Tamer Ba\c{s}ar,
and H. Vincent Poor | Coalitional Games in Partition Form for Joint Spectrum Sensing and
Access in Cognitive Radio Networks | IEEE Journal on Selected Topics in Signal Processing (JSTSP), Special
Issue on Game Theory, to appear, 2012 | null | 10.1109/JSTSP.2011.2175699 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unlicensed secondary users (SUs) in cognitive radio networks are subject to
an inherent tradeoff between spectrum sensing and spectrum access. Although
each SU has an incentive to sense the primary user (PU) channels for locating
spectrum holes, this exploration of the spectrum can come at the expense of a
shorter tr... | [
{
"created": "Thu, 2 Feb 2012 15:38:09 GMT",
"version": "v1"
}
] | 2015-06-04 | [
[
"Saad",
"Walid",
""
],
[
"Han",
"Zhu",
""
],
[
"Zheng",
"Rong",
""
],
[
"Hjørungnes",
"Are",
""
],
[
"Başar",
"Tamer",
""
],
[
"Poor",
"H. Vincent",
""
]
] | Unlicensed secondary users (SUs) in cognitive radio networks are subject to an inherent tradeoff between spectrum sensing and spectrum access. Although each SU has an incentive to sense the primary user (PU) channels for locating spectrum holes, this exploration of the spectrum can come at the expense of a shorter tran... |
1904.08138 | Feiyang Chen | Feiyang Chen, Ziqian Luo, Yanyan Xu, Dengfeng Ke | Complementary Fusion of Multi-Features and Multi-Modalities in Sentiment
Analysis | Accepted by AAAI2020 Workshop: AffCon2020 | null | null | null | cs.CL cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Sentiment analysis, mostly based on text, has been rapidly developing in the
last decade and has attracted widespread attention in both academia and
industry. However, the information in the real world usually comes from
multiple modalities, such as audio and text. Therefore, in this paper, based on
audio and text, w... | [
{
"created": "Wed, 17 Apr 2019 08:46:53 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Apr 2019 02:43:45 GMT",
"version": "v2"
},
{
"created": "Thu, 25 Apr 2019 03:40:18 GMT",
"version": "v3"
},
{
"created": "Mon, 22 Jul 2019 02:22:51 GMT",
"version": "v4"
},
{
"c... | 2019-12-12 | [
[
"Chen",
"Feiyang",
""
],
[
"Luo",
"Ziqian",
""
],
[
"Xu",
"Yanyan",
""
],
[
"Ke",
"Dengfeng",
""
]
] | Sentiment analysis, mostly based on text, has been rapidly developing in the last decade and has attracted widespread attention in both academia and industry. However, the information in the real world usually comes from multiple modalities, such as audio and text. Therefore, in this paper, based on audio and text, we ... |
2308.07081 | Jivnesh Sandhan | Jivnesh Sandhan, Amruta Barbadikar, Malay Maity, Pavankumar Satuluri,
Tushar Sandhan, Ravi M. Gupta, Pawan Goyal and Laxmidhar Behera | Aesthetics of Sanskrit Poetry from the Perspective of Computational
Linguistics: A Case Study Analysis on Siksastaka | 15 pages | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Sanskrit poetry has played a significant role in shaping the literary and
cultural landscape of the Indian subcontinent for centuries. However, not much
attention has been devoted to uncovering the hidden beauty of Sanskrit poetry
in computational linguistics. This article explores the intersection of
Sanskrit poetry... | [
{
"created": "Mon, 14 Aug 2023 11:26:25 GMT",
"version": "v1"
}
] | 2023-08-15 | [
[
"Sandhan",
"Jivnesh",
""
],
[
"Barbadikar",
"Amruta",
""
],
[
"Maity",
"Malay",
""
],
[
"Satuluri",
"Pavankumar",
""
],
[
"Sandhan",
"Tushar",
""
],
[
"Gupta",
"Ravi M.",
""
],
[
"Goyal",
"Pawan",
""
],
... | Sanskrit poetry has played a significant role in shaping the literary and cultural landscape of the Indian subcontinent for centuries. However, not much attention has been devoted to uncovering the hidden beauty of Sanskrit poetry in computational linguistics. This article explores the intersection of Sanskrit poetry a... |
2104.08549 | Muhammad Nabeel | Maxim Penner, Muhammad Nabeel, J\"urgen Peissig | Link-Level Performance Evaluation of IMT-2020 Candidate Technology:
DECT-2020 New Radio | 6 pages, 5 figures, 3 tables | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ETSI has recently introduced the DECT-2020 New Radio (NR) as an IMT-2020
candidate technology for the mMTC and URLLC use cases. To consider DECT-2020 NR
as an IMT-2020 technology, the ITU-R has determined different independent
evaluation groups to assess its performance against the IMT-2020 requirements.
These in... | [
{
"created": "Sat, 17 Apr 2021 14:00:33 GMT",
"version": "v1"
}
] | 2021-04-20 | [
[
"Penner",
"Maxim",
""
],
[
"Nabeel",
"Muhammad",
""
],
[
"Peissig",
"Jürgen",
""
]
] | The ETSI has recently introduced the DECT-2020 New Radio (NR) as an IMT-2020 candidate technology for the mMTC and URLLC use cases. To consider DECT-2020 NR as an IMT-2020 technology, the ITU-R has determined different independent evaluation groups to assess its performance against the IMT-2020 requirements. These inde... |
1611.06547 | Henk Moed | Henk F. Moed | A critical comparative analysis of five world university rankings | Author copy of a paper accepted for publication in Scientometrics, 15
Nov. 2016 v2 | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To provide users insight into the value and limits of world university
rankings, a comparative analysis is conducted of 5 ranking systems: ARWU,
Leiden, THE, QS and U-Multirank. It links these systems with one another at the
level of individual institutions, and analyses the overlap in institutional
coverage, geograp... | [
{
"created": "Sun, 20 Nov 2016 17:06:50 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Dec 2016 14:14:04 GMT",
"version": "v2"
}
] | 2016-12-06 | [
[
"Moed",
"Henk F.",
""
]
] | To provide users insight into the value and limits of world university rankings, a comparative analysis is conducted of 5 ranking systems: ARWU, Leiden, THE, QS and U-Multirank. It links these systems with one another at the level of individual institutions, and analyses the overlap in institutional coverage, geographi... |
2103.14191 | Marcelo De Abranches | Marcelo Abranches, Karl Olson and Eric Keller | Infinity: A Scalable Infrastructure for In-Network Applications | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | Network programmability is an area of research both defined by its potential
and its current limitations. While programmable hardware enables customization
of device operation, tailoring processing to finely tuned objectives, limited
resources stifle much of the capability and scalability desired for future
technolog... | [
{
"created": "Fri, 26 Mar 2021 00:55:08 GMT",
"version": "v1"
}
] | 2021-03-29 | [
[
"Abranches",
"Marcelo",
""
],
[
"Olson",
"Karl",
""
],
[
"Keller",
"Eric",
""
]
] | Network programmability is an area of research both defined by its potential and its current limitations. While programmable hardware enables customization of device operation, tailoring processing to finely tuned objectives, limited resources stifle much of the capability and scalability desired for future technologie... |
2307.09533 | Aditya Potukuchi | Charlie Carlson, Ewan Davies, Alexandra Kolla, and Aditya Potukuchi | Approximately counting independent sets in dense bipartite graphs via
subspace enumeration | 15 pages | null | null | null | cs.DS math.CO | http://creativecommons.org/licenses/by/4.0/ | We give a randomized algorithm that approximates the number of independent
sets in a dense, regular bipartite graph -- in the language of approximate
counting, we give an FPRAS for #BIS on the class of dense, regular bipartite
graphs. Efficient counting algorithms typically apply to ``high-temperature''
problems on b... | [
{
"created": "Tue, 18 Jul 2023 18:23:24 GMT",
"version": "v1"
}
] | 2023-07-20 | [
[
"Carlson",
"Charlie",
""
],
[
"Davies",
"Ewan",
""
],
[
"Kolla",
"Alexandra",
""
],
[
"Potukuchi",
"Aditya",
""
]
] | We give a randomized algorithm that approximates the number of independent sets in a dense, regular bipartite graph -- in the language of approximate counting, we give an FPRAS for #BIS on the class of dense, regular bipartite graphs. Efficient counting algorithms typically apply to ``high-temperature'' problems on bou... |
2012.01037 | Baohan Xu | Rui An, Xingtian Shi, Baohan Xu | Fast Automatic Feature Selection for Multi-Period Sliding Window
Aggregate in Time Series | ICDM 2020 | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | As one of the most well-known artificial feature sampler, the sliding window
is widely used in scenarios where spatial and temporal information exists, such
as computer vision, natural language process, data stream, and time series.
Among which time series is common in many scenarios like credit card payment,
user be... | [
{
"created": "Wed, 2 Dec 2020 09:14:30 GMT",
"version": "v1"
}
] | 2020-12-03 | [
[
"An",
"Rui",
""
],
[
"Shi",
"Xingtian",
""
],
[
"Xu",
"Baohan",
""
]
] | As one of the most well-known artificial feature sampler, the sliding window is widely used in scenarios where spatial and temporal information exists, such as computer vision, natural language process, data stream, and time series. Among which time series is common in many scenarios like credit card payment, user beha... |
2106.12659 | Stephen Kelly | Stephen Kelly, Tatiana Voegerl, Wolfgang Banzhaf, Cedric Gondro | Evolving Hierarchical Memory-Prediction Machines in Multi-Task
Reinforcement Learning | null | null | null | null | cs.NE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | A fundamental aspect of behaviour is the ability to encode salient features
of experience in memory and use these memories, in combination with current
sensory information, to predict the best action for each situation such that
long-term objectives are maximized. The world is highly dynamic, and
behavioural agents m... | [
{
"created": "Wed, 23 Jun 2021 21:34:32 GMT",
"version": "v1"
}
] | 2021-06-25 | [
[
"Kelly",
"Stephen",
""
],
[
"Voegerl",
"Tatiana",
""
],
[
"Banzhaf",
"Wolfgang",
""
],
[
"Gondro",
"Cedric",
""
]
] | A fundamental aspect of behaviour is the ability to encode salient features of experience in memory and use these memories, in combination with current sensory information, to predict the best action for each situation such that long-term objectives are maximized. The world is highly dynamic, and behavioural agents mus... |
2006.09074 | Amir Lellouche | Uriel Feige, Amir Lellouche | Quantitative Group Testing and the rank of random matrices | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a random Bernoulli matrix $ A\in \{0,1\}^{m\times n} $, an integer $ 0<
k < n $ and the vector $ y:=Ax $, where $ x \in \{0,1\}^n $ is of Hamming
weight $ k $, the objective in the {\em Quantitative Group Testing} (QGT)
problem is to recover $ x $. This problem is more difficult the smaller $m$ is.
For paramete... | [
{
"created": "Tue, 16 Jun 2020 11:08:22 GMT",
"version": "v1"
}
] | 2020-06-17 | [
[
"Feige",
"Uriel",
""
],
[
"Lellouche",
"Amir",
""
]
] | Given a random Bernoulli matrix $ A\in \{0,1\}^{m\times n} $, an integer $ 0< k < n $ and the vector $ y:=Ax $, where $ x \in \{0,1\}^n $ is of Hamming weight $ k $, the objective in the {\em Quantitative Group Testing} (QGT) problem is to recover $ x $. This problem is more difficult the smaller $m$ is. For parameter ... |
0906.0205 | Forrest Sheng Bao | Yuanlin Zhang and Forrest Sheng Bao | A Survey of Tree Convex Sets Test | 13 pages, 5 figures, 2 tables | null | null | null | cs.DS cs.CC | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Tree convex sets refer to a collection of sets such that each set in the
collection is a subtree of a tree whose nodes are the elements of these sets.
They extend the concept of row convex sets each of which is an interval over a
total ordering of the elements of those sets. They have been applied to
identify tractab... | [
{
"created": "Mon, 1 Jun 2009 03:54:42 GMT",
"version": "v1"
}
] | 2009-06-03 | [
[
"Zhang",
"Yuanlin",
""
],
[
"Bao",
"Forrest Sheng",
""
]
] | Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total ordering of the elements of those sets. They have been applied to identify tractable... |
2303.12454 | Hannes Waclawek | Stefan Huber, Hannes Waclawek | $\mathcal{C}^k$-continuous Spline Approximation with TensorFlow Gradient
Descent Optimizers | This preprint has not undergone peer review or any post-submission
improvements or corrections. The Version of Record of this contribution is
published in Computer Aided Systems Theory - EUROCAST 2022 and is available
online at https://doi.org/10.1007/978-3-031-25312-6_68 | Moreno-D\'iaz, R., Pichler, F., Quesada-Arencibia, A. (eds)
Computer Aided Systems Theory - EUROCAST 2022. EUROCAST 2022. Lecture Notes
in Computer Science, vol 13789. Springer, Cham | 10.1007/978-3-031-25312-6_68 | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this work we present an "out-of-the-box" application of Machine Learning
(ML) optimizers for an industrial optimization problem. We introduce a
piecewise polynomial model (spline) for fitting of $\mathcal{C}^k$-continuos
functions, which can be deployed in a cam approximation setting. We then use
the gradient desc... | [
{
"created": "Wed, 22 Mar 2023 10:52:21 GMT",
"version": "v1"
}
] | 2023-03-23 | [
[
"Huber",
"Stefan",
""
],
[
"Waclawek",
"Hannes",
""
]
] | In this work we present an "out-of-the-box" application of Machine Learning (ML) optimizers for an industrial optimization problem. We introduce a piecewise polynomial model (spline) for fitting of $\mathcal{C}^k$-continuos functions, which can be deployed in a cam approximation setting. We then use the gradient descen... |
2106.08867 | Tim Murray-Browne | Tim Murray-Browne and Panagiotis Tigas | Latent Mappings: Generating Open-Ended Expressive Mappings Using
Variational Autoencoders | Published at the International Conference on New Interfaces for
Musical Expression, June 2021. 3000 word short paper. 5 figures plus video
which may be seen at https://timmb.com/sonified-body-r-and-d-lab | null | null | null | cs.HC cs.MM | http://creativecommons.org/licenses/by/4.0/ | In many contexts, creating mappings for gestural interactions can form part
of an artistic process. Creators seeking a mapping that is expressive, novel,
and affords them a sense of authorship may not know how to program it up in a
signal processing patch. Tools like Wekinator and MIMIC allow creators to use
supervis... | [
{
"created": "Wed, 16 Jun 2021 15:40:53 GMT",
"version": "v1"
}
] | 2021-06-17 | [
[
"Murray-Browne",
"Tim",
""
],
[
"Tigas",
"Panagiotis",
""
]
] | In many contexts, creating mappings for gestural interactions can form part of an artistic process. Creators seeking a mapping that is expressive, novel, and affords them a sense of authorship may not know how to program it up in a signal processing patch. Tools like Wekinator and MIMIC allow creators to use supervised... |
2104.00210 | Jaeyong Chung | Phuoc Pham, Jacob Abraham, Jaeyong Chung | Training Multi-bit Quantized and Binarized Networks with A Learnable
Symmetric Quantizer | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Quantizing weights and activations of deep neural networks is essential for
deploying them in resource-constrained devices, or cloud platforms for at-scale
services. While binarization is a special case of quantization, this extreme
case often leads to several training difficulties, and necessitates specialized
model... | [
{
"created": "Thu, 1 Apr 2021 02:33:31 GMT",
"version": "v1"
}
] | 2021-04-02 | [
[
"Pham",
"Phuoc",
""
],
[
"Abraham",
"Jacob",
""
],
[
"Chung",
"Jaeyong",
""
]
] | Quantizing weights and activations of deep neural networks is essential for deploying them in resource-constrained devices, or cloud platforms for at-scale services. While binarization is a special case of quantization, this extreme case often leads to several training difficulties, and necessitates specialized models ... |
1704.03764 | Rodrigo Bruno Mr. | Rodrigo Bruno, Lu\'is Oliveira, Paulo Ferreira | NG2C: Pretenuring N-Generational GC for HotSpot Big Data Applications | Accepted at ISMM'17 | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Big Data applications suffer from unpredictable and unacceptably high pause
times due to Garbage Collection (GC). This is the case in latency-sensitive
applications such as on-line credit-card fraud detection, graph-based computing
for analysis on social networks, etc. Such pauses compromise latency
requirements of t... | [
{
"created": "Wed, 12 Apr 2017 14:03:32 GMT",
"version": "v1"
}
] | 2017-04-13 | [
[
"Bruno",
"Rodrigo",
""
],
[
"Oliveira",
"Luís",
""
],
[
"Ferreira",
"Paulo",
""
]
] | Big Data applications suffer from unpredictable and unacceptably high pause times due to Garbage Collection (GC). This is the case in latency-sensitive applications such as on-line credit-card fraud detection, graph-based computing for analysis on social networks, etc. Such pauses compromise latency requirements of the... |
1810.12566 | Yi-Chen Chen | Yi-Chen Chen, Chia-Hao Shen, Sung-Feng Huang, Hung-yi Lee, Lin-shan
Lee | Almost-unsupervised Speech Recognition with Close-to-zero Resource Based
on Phonetic Structures Learned from Very Small Unpaired Speech and Text Data | null | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Producing a large amount of annotated speech data for training ASR systems
remains difficult for more than 95% of languages all over the world which are
low-resourced. However, we note human babies start to learn the language by the
sounds of a small number of exemplar words without hearing a large amount of
data. We... | [
{
"created": "Tue, 30 Oct 2018 08:11:45 GMT",
"version": "v1"
}
] | 2018-10-31 | [
[
"Chen",
"Yi-Chen",
""
],
[
"Shen",
"Chia-Hao",
""
],
[
"Huang",
"Sung-Feng",
""
],
[
"Lee",
"Hung-yi",
""
],
[
"Lee",
"Lin-shan",
""
]
] | Producing a large amount of annotated speech data for training ASR systems remains difficult for more than 95% of languages all over the world which are low-resourced. However, we note human babies start to learn the language by the sounds of a small number of exemplar words without hearing a large amount of data. We i... |
2405.06983 | Muhammad Umar Farooq Qaisar | Muhammad Umar Farooq Qaisar, Weijie Yuan, Paolo Bellavista, Guangjie
Han, and Adeel Ahmed | ISAC-Assisted Wireless Rechargeable Sensor Networks with Multiple Mobile
Charging Vehicles | Accepted for publication in the Special Issue Q1'2024, "Integrating
Sensing and Communication for Ubiquitous Internet of Things," IEEE Internet
of Things Magazine | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | As IoT-based wireless sensor networks (WSNs) become more prevalent, the issue
of energy shortages becomes more pressing. One potential solution is the use of
wireless power transfer (WPT) technology, which is the key to building a new
shape of wireless rechargeable sensor networks (WRSNs). However, efficient
charging... | [
{
"created": "Sat, 11 May 2024 10:41:54 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Qaisar",
"Muhammad Umar Farooq",
""
],
[
"Yuan",
"Weijie",
""
],
[
"Bellavista",
"Paolo",
""
],
[
"Han",
"Guangjie",
""
],
[
"Ahmed",
"Adeel",
""
]
] | As IoT-based wireless sensor networks (WSNs) become more prevalent, the issue of energy shortages becomes more pressing. One potential solution is the use of wireless power transfer (WPT) technology, which is the key to building a new shape of wireless rechargeable sensor networks (WRSNs). However, efficient charging a... |
1804.06111 | Biao Xiang | Biao Xiang, Ziqi Liu, Jun Zhou, Xiaolong Li | Feature Propagation on Graph: A New Perspective to Graph Representation
Learning | null | null | null | null | cs.SI cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study feature propagation on graph, an inference process involved in graph
representation learning tasks. It's to spread the features over the whole graph
to the $t$-th orders, thus to expand the end's features. The process has been
successfully adopted in graph embedding or graph neural networks, however few
work... | [
{
"created": "Tue, 17 Apr 2018 08:54:19 GMT",
"version": "v1"
}
] | 2018-04-18 | [
[
"Xiang",
"Biao",
""
],
[
"Liu",
"Ziqi",
""
],
[
"Zhou",
"Jun",
""
],
[
"Li",
"Xiaolong",
""
]
] | We study feature propagation on graph, an inference process involved in graph representation learning tasks. It's to spread the features over the whole graph to the $t$-th orders, thus to expand the end's features. The process has been successfully adopted in graph embedding or graph neural networks, however few works ... |
cs/0506074 | Paolo Liberatore | Paolo Liberatore | Redundancy in Logic II: 2CNF and Horn Propositional Formulae | Corrected figures on Theorem 10; added and modified some references | null | 10.1016/j.artint.2007.06.003 | null | cs.AI cs.LO | null | We report complexity results about redundancy of formulae in 2CNF form. We
first consider the problem of checking redundancy and show some algorithms that
are slightly better than the trivial one. We then analyze problems related to
finding irredundant equivalent subsets (I.E.S.) of a given set. The concept of
cyclic... | [
{
"created": "Fri, 17 Jun 2005 19:28:29 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Jun 2005 15:07:15 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Jun 2005 14:16:22 GMT",
"version": "v3"
}
] | 2021-04-12 | [
[
"Liberatore",
"Paolo",
""
]
] | We report complexity results about redundancy of formulae in 2CNF form. We first consider the problem of checking redundancy and show some algorithms that are slightly better than the trivial one. We then analyze problems related to finding irredundant equivalent subsets (I.E.S.) of a given set. The concept of cyclicit... |
1901.03264 | Alex Dytso | Alex Dytso, Semih Yagli, H. Vincent Poor, Shlomo Shamai (Shitz) | The Capacity Achieving Distribution for the Amplitude Constrained
Additive Gaussian Channel: An Upper Bound on the Number of Mass Points | Keywords: Amplitude constraint, power constraint, additive vector
Gaussian noise channel, capacity, discrete distributions | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies an $n$-dimensional additive Gaussian noise channel with a
peak-power-constrained input.
It is well known that, in this case, when $n=1$ the capacity-achieving input
distribution is discrete with finitely many mass points, and when $n>1$ the
capacity-achieving input distribution is supported on fi... | [
{
"created": "Thu, 10 Jan 2019 16:51:08 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Jan 2019 23:04:10 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Aug 2019 21:52:48 GMT",
"version": "v3"
},
{
"created": "Fri, 15 Nov 2019 02:40:44 GMT",
"version": "v4"
}
] | 2019-11-18 | [
[
"Dytso",
"Alex",
"",
"Shitz"
],
[
"Yagli",
"Semih",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] | This paper studies an $n$-dimensional additive Gaussian noise channel with a peak-power-constrained input. It is well known that, in this case, when $n=1$ the capacity-achieving input distribution is discrete with finitely many mass points, and when $n>1$ the capacity-achieving input distribution is supported on finite... |
2002.04335 | Eren Sezener | Eren Sezener and Peter Dayan | Static and Dynamic Values of Computation in MCTS | Presented in UAI 2020 | PMLR 124:31-40, 2020 | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Monte-Carlo Tree Search (MCTS) is one of the most-widely used methods for
planning, and has powered many recent advances in artificial intelligence. In
MCTS, one typically performs computations (i.e., simulations) to collect
statistics about the possible future consequences of actions, and then chooses
accordingly. M... | [
{
"created": "Tue, 11 Feb 2020 12:05:58 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Nov 2020 12:28:19 GMT",
"version": "v2"
}
] | 2020-11-20 | [
[
"Sezener",
"Eren",
""
],
[
"Dayan",
"Peter",
""
]
] | Monte-Carlo Tree Search (MCTS) is one of the most-widely used methods for planning, and has powered many recent advances in artificial intelligence. In MCTS, one typically performs computations (i.e., simulations) to collect statistics about the possible future consequences of actions, and then chooses accordingly. Man... |
1905.11392 | Suihua Cai | Wenchao Lin, Suihua Cai, Baodian Wei, Xiao Ma | Successive Cancellation List Decoding of Semi-random Unit Memory
Convolutional Codes | Submitted to IEEE Transactions on Information Theory. arXiv admin
note: substantial text overlap with arXiv:1902.09808 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present in this paper a special class of unit memory convolutional codes
(UMCCs), called semi-random UMCCs (SRUMCCs), where the information block is
first encoded by a short block code and then transmitted in a block Markov
(random) superposition manner. We propose a successive cancellation list
decoding algorithm... | [
{
"created": "Mon, 27 May 2019 10:20:32 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Jul 2020 01:57:20 GMT",
"version": "v2"
}
] | 2020-07-27 | [
[
"Lin",
"Wenchao",
""
],
[
"Cai",
"Suihua",
""
],
[
"Wei",
"Baodian",
""
],
[
"Ma",
"Xiao",
""
]
] | We present in this paper a special class of unit memory convolutional codes (UMCCs), called semi-random UMCCs (SRUMCCs), where the information block is first encoded by a short block code and then transmitted in a block Markov (random) superposition manner. We propose a successive cancellation list decoding algorithm, ... |
2006.06135 | Zhi Xu | Devavrat Shah, Dogyoon Song, Zhi Xu, Yuzhe Yang | Sample Efficient Reinforcement Learning via Low-Rank Matrix Estimation | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the question of learning $Q$-function in a sample efficient
manner for reinforcement learning with continuous state and action spaces under
a generative model. If $Q$-function is Lipschitz continuous, then the minimal
sample complexity for estimating $\epsilon$-optimal $Q$-function is known to
scale as ${... | [
{
"created": "Thu, 11 Jun 2020 00:55:35 GMT",
"version": "v1"
}
] | 2020-06-12 | [
[
"Shah",
"Devavrat",
""
],
[
"Song",
"Dogyoon",
""
],
[
"Xu",
"Zhi",
""
],
[
"Yang",
"Yuzhe",
""
]
] | We consider the question of learning $Q$-function in a sample efficient manner for reinforcement learning with continuous state and action spaces under a generative model. If $Q$-function is Lipschitz continuous, then the minimal sample complexity for estimating $\epsilon$-optimal $Q$-function is known to scale as ${\O... |
2402.08096 | Andrew Bai | Andrew Bai, Chih-Kuan Yeh, Cho-Jui Hsieh, Ankur Taly | Which Pretrain Samples to Rehearse when Finetuning Pretrained Models? | 17 pages, 13 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Fine-tuning pretrained foundational models on specific tasks is now the de
facto approach for text and vision tasks. A known pitfall of this approach is
the forgetting of pretraining knowledge that happens during finetuning.
Rehearsing samples randomly from the pretrain dataset is a common approach to
alleviate such ... | [
{
"created": "Mon, 12 Feb 2024 22:32:12 GMT",
"version": "v1"
}
] | 2024-02-14 | [
[
"Bai",
"Andrew",
""
],
[
"Yeh",
"Chih-Kuan",
""
],
[
"Hsieh",
"Cho-Jui",
""
],
[
"Taly",
"Ankur",
""
]
] | Fine-tuning pretrained foundational models on specific tasks is now the de facto approach for text and vision tasks. A known pitfall of this approach is the forgetting of pretraining knowledge that happens during finetuning. Rehearsing samples randomly from the pretrain dataset is a common approach to alleviate such fo... |
2004.13254 | Martin Skrodzki | Martin Skrodzki | How the deprecation of Java applets affected online visualization
frameworks -- a case study | null | VisGap - The Gap between Visualization Research and Visualization
Software, The Eurographics Association, 2020 | 10.2312/visgap.20201111 | RIKEN-iTHEMS-Report-20 | cs.SE cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The JavaView visualization framework was designed at the end of the 1990s as
a software that provides - among other services - easy, interactive geometry
visualizations on web pages. We discuss how this and other design goals were
met and present several applications to highlight the contemporary use-cases of
the fra... | [
{
"created": "Tue, 28 Apr 2020 02:51:55 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Apr 2020 07:02:09 GMT",
"version": "v2"
}
] | 2020-06-11 | [
[
"Skrodzki",
"Martin",
""
]
] | The JavaView visualization framework was designed at the end of the 1990s as a software that provides - among other services - easy, interactive geometry visualizations on web pages. We discuss how this and other design goals were met and present several applications to highlight the contemporary use-cases of the frame... |
2405.02454 | Michael Burnham | Michael Burnham | What is Sentiment Meant to Mean to Language Models? | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Sentiment analysis is one of the most widely used techniques in text
analysis. Recent advancements with Large Language Models have made it more
accurate and accessible than ever, allowing researchers to classify text with
only a plain English prompt. However, "sentiment" entails a wide variety of
concepts depending o... | [
{
"created": "Fri, 3 May 2024 19:37:37 GMT",
"version": "v1"
}
] | 2024-05-07 | [
[
"Burnham",
"Michael",
""
]
] | Sentiment analysis is one of the most widely used techniques in text analysis. Recent advancements with Large Language Models have made it more accurate and accessible than ever, allowing researchers to classify text with only a plain English prompt. However, "sentiment" entails a wide variety of concepts depending on ... |
1910.04209 | Jerry Ma | Jerry Ma, Denis Yarats | On the adequacy of untuned warmup for adaptive optimization | AAAI 2021 | null | null | null | cs.LG cs.NE stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Adaptive optimization algorithms such as Adam are widely used in deep
learning. The stability of such algorithms is often improved with a warmup
schedule for the learning rate. Motivated by the difficulty of choosing and
tuning warmup schedules, recent work proposes automatic variance rectification
of Adam's adaptive... | [
{
"created": "Wed, 9 Oct 2019 19:25:03 GMT",
"version": "v1"
},
{
"created": "Sun, 13 Dec 2020 01:58:24 GMT",
"version": "v2"
},
{
"created": "Sat, 20 Mar 2021 03:43:16 GMT",
"version": "v3"
}
] | 2021-03-23 | [
[
"Ma",
"Jerry",
""
],
[
"Yarats",
"Denis",
""
]
] | Adaptive optimization algorithms such as Adam are widely used in deep learning. The stability of such algorithms is often improved with a warmup schedule for the learning rate. Motivated by the difficulty of choosing and tuning warmup schedules, recent work proposes automatic variance rectification of Adam's adaptive l... |
2112.06810 | Animesh Trivedi | Peter-Jan Gootzen and Animesh Trivedi | Bento and the Art of Repeated Research | null | null | null | null | cs.OS cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bento provides a new approach to developing file systems, with safety and
high-velocity development in mind. This is achieved by using Rust, a modern and
memory-safe systems programming language, and by providing a framework to run a
single file system implementation in kernel space with the VFS or in user space
with... | [
{
"created": "Mon, 13 Dec 2021 17:13:00 GMT",
"version": "v1"
}
] | 2021-12-15 | [
[
"Gootzen",
"Peter-Jan",
""
],
[
"Trivedi",
"Animesh",
""
]
] | Bento provides a new approach to developing file systems, with safety and high-velocity development in mind. This is achieved by using Rust, a modern and memory-safe systems programming language, and by providing a framework to run a single file system implementation in kernel space with the VFS or in user space with F... |
2005.10187 | Leonardo Maccari | Leonardo Maccari, Valeria Cagno | Do we need a Contact Tracing App? | null | null | null | null | cs.CY cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of this paper is to shed some light on the usefulness of a contact
tracing smartphone app for the containment of the COVID-19 pandemic. We review
the basics of contact tracing during the spread of a virus, we contextualize
the numbers to the case of COVID-19 and we analyse the state of the art for
proximity ... | [
{
"created": "Wed, 20 May 2020 16:50:57 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Jul 2020 13:50:57 GMT",
"version": "v2"
}
] | 2020-07-30 | [
[
"Maccari",
"Leonardo",
""
],
[
"Cagno",
"Valeria",
""
]
] | The goal of this paper is to shed some light on the usefulness of a contact tracing smartphone app for the containment of the COVID-19 pandemic. We review the basics of contact tracing during the spread of a virus, we contextualize the numbers to the case of COVID-19 and we analyse the state of the art for proximity de... |
1611.05172 | Charith Perera | Luiz H. Nunes, Julio C. Estrella, Charith Perera, Stephan
Reiff-Marganiec, Alexandre N. Delbem | Multi-criteria IoT Resource Discovery: A Comparative Analysis | Software: Practice and Experience | Software: Practice and Experience 2017 | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The growth of real world objects with embedded and globally networked sensors
allows to consolidate the Internet of Things paradigm and increase the number
of applications in the domains of ubiquitous and context-aware computing. The
merging between Cloud Computing and Internet of Things named Cloud of Things
will be... | [
{
"created": "Wed, 16 Nov 2016 07:26:46 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Nunes",
"Luiz H.",
""
],
[
"Estrella",
"Julio C.",
""
],
[
"Perera",
"Charith",
""
],
[
"Reiff-Marganiec",
"Stephan",
""
],
[
"Delbem",
"Alexandre N.",
""
]
] | The growth of real world objects with embedded and globally networked sensors allows to consolidate the Internet of Things paradigm and increase the number of applications in the domains of ubiquitous and context-aware computing. The merging between Cloud Computing and Internet of Things named Cloud of Things will be t... |
cs/0602056 | Domenico Camarda Dr. | Dino Borri, Domenico Camarda | Building Scenarios for Environmental Management and Planning: An
IT-Based Approach | null | null | null | null | cs.MA | null | Oftentimes, the need to build multidiscipline knowledge bases, oriented to
policy scenarios, entails the involvement of stakeholders in manifold domains,
with a juxtaposition of different languages whose semantics can hardly allow
inter-domain transfers. A useful support for planning is the building up of
durable IT ... | [
{
"created": "Wed, 15 Feb 2006 14:46:05 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Borri",
"Dino",
""
],
[
"Camarda",
"Domenico",
""
]
] | Oftentimes, the need to build multidiscipline knowledge bases, oriented to policy scenarios, entails the involvement of stakeholders in manifold domains, with a juxtaposition of different languages whose semantics can hardly allow inter-domain transfers. A useful support for planning is the building up of durable IT ba... |
1606.03077 | Ilias Diakonikolas | Ilias Diakonikolas and Daniel M. Kane and Alistair Stewart | Efficient Robust Proper Learning of Log-concave Distributions | null | null | null | null | cs.DS cs.LG math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the {\em robust proper learning} of univariate log-concave
distributions (over continuous and discrete domains). Given a set of samples
drawn from an unknown target distribution, we want to compute a log-concave
hypothesis distribution that is as close as possible to the target, in total
variation distance. ... | [
{
"created": "Thu, 9 Jun 2016 19:32:20 GMT",
"version": "v1"
}
] | 2016-06-10 | [
[
"Diakonikolas",
"Ilias",
""
],
[
"Kane",
"Daniel M.",
""
],
[
"Stewart",
"Alistair",
""
]
] | We study the {\em robust proper learning} of univariate log-concave distributions (over continuous and discrete domains). Given a set of samples drawn from an unknown target distribution, we want to compute a log-concave hypothesis distribution that is as close as possible to the target, in total variation distance. In... |
1504.05218 | Kiril Solovey | Kiril Solovey and Jingjin Yu and Or Zamir and Dan Halperin | Motion Planning for Unlabeled Discs with Optimality Guarantees | null | null | null | null | cs.CG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of path planning for unlabeled (indistinguishable)
unit-disc robots in a planar environment cluttered with polygonal obstacles. We
introduce an algorithm which minimizes the total path length, i.e., the sum of
lengths of the individual paths. Our algorithm is guaranteed to find a solution
if one ... | [
{
"created": "Mon, 20 Apr 2015 20:24:13 GMT",
"version": "v1"
}
] | 2015-04-22 | [
[
"Solovey",
"Kiril",
""
],
[
"Yu",
"Jingjin",
""
],
[
"Zamir",
"Or",
""
],
[
"Halperin",
"Dan",
""
]
] | We study the problem of path planning for unlabeled (indistinguishable) unit-disc robots in a planar environment cluttered with polygonal obstacles. We introduce an algorithm which minimizes the total path length, i.e., the sum of lengths of the individual paths. Our algorithm is guaranteed to find a solution if one ex... |
2404.19149 | Evangelos Ververas | Evangelos Ververas, Rolandos Alexandros Potamias, Jifei Song, Jiankang
Deng, Stefanos Zafeiriou | SAGS: Structure-Aware 3D Gaussian Splatting | 15 pages, 8 figures, 3 tables | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Following the advent of NeRFs, 3D Gaussian Splatting (3D-GS) has paved the
way to real-time neural rendering overcoming the computational burden of
volumetric methods. Following the pioneering work of 3D-GS, several methods
have attempted to achieve compressible and high-fidelity performance
alternatives. However, by... | [
{
"created": "Mon, 29 Apr 2024 23:26:30 GMT",
"version": "v1"
}
] | 2024-05-01 | [
[
"Ververas",
"Evangelos",
""
],
[
"Potamias",
"Rolandos Alexandros",
""
],
[
"Song",
"Jifei",
""
],
[
"Deng",
"Jiankang",
""
],
[
"Zafeiriou",
"Stefanos",
""
]
] | Following the advent of NeRFs, 3D Gaussian Splatting (3D-GS) has paved the way to real-time neural rendering overcoming the computational burden of volumetric methods. Following the pioneering work of 3D-GS, several methods have attempted to achieve compressible and high-fidelity performance alternatives. However, by e... |
2312.00575 | Khai Loong Aw | Khai Loong Aw, Syrielle Montariol, Badr AlKhamissi, Martin Schrimpf,
Antoine Bosselut | Instruction-tuning Aligns LLMs to the Human Brain | COLM 2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Instruction-tuning is a widely adopted finetuning method that enables large
language models (LLMs) to generate output that more closely resembles human
responses. However, no studies have shown that instruction-tuning actually
teaches LLMs to process language in a similar manner as humans. We investigate
the effect o... | [
{
"created": "Fri, 1 Dec 2023 13:31:02 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Aug 2024 04:33:58 GMT",
"version": "v2"
}
] | 2024-08-12 | [
[
"Aw",
"Khai Loong",
""
],
[
"Montariol",
"Syrielle",
""
],
[
"AlKhamissi",
"Badr",
""
],
[
"Schrimpf",
"Martin",
""
],
[
"Bosselut",
"Antoine",
""
]
] | Instruction-tuning is a widely adopted finetuning method that enables large language models (LLMs) to generate output that more closely resembles human responses. However, no studies have shown that instruction-tuning actually teaches LLMs to process language in a similar manner as humans. We investigate the effect of ... |
2210.13212 | Weilong Guan | Weilong Guan, Kaihan Yang, Yinsheng Chen, Zhong Guan | A Dimension-Augmented Physics-Informed Neural Network (DaPINN) with High
Level Accuracy and Efficiency | 33 pages, 12 figures | null | 10.1016/j.jcp.2023.112360 | null | cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Physics-informed neural networks (PINNs) have been widely applied in
different fields due to their effectiveness in solving partial differential
equations (PDEs). However, the accuracy and efficiency of PINNs need to be
considerably improved for scientific and commercial use. To address this issue,
we systematically ... | [
{
"created": "Wed, 19 Oct 2022 15:54:37 GMT",
"version": "v1"
}
] | 2023-08-16 | [
[
"Guan",
"Weilong",
""
],
[
"Yang",
"Kaihan",
""
],
[
"Chen",
"Yinsheng",
""
],
[
"Guan",
"Zhong",
""
]
] | Physics-informed neural networks (PINNs) have been widely applied in different fields due to their effectiveness in solving partial differential equations (PDEs). However, the accuracy and efficiency of PINNs need to be considerably improved for scientific and commercial use. To address this issue, we systematically pr... |
1203.6096 | Yehuda Afek | Yehuda Afek and Eli Gafni | Asynchrony from Synchrony | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider synchronous dynamic networks which like radio networks may have
asymmetric communication links, and are affected by communication rather than
processor failures. In this paper we investigate the minimal message
survivability in a per round basis that allows for the minimal global
cooperation, i.e., allows... | [
{
"created": "Tue, 27 Mar 2012 22:26:02 GMT",
"version": "v1"
}
] | 2012-03-29 | [
[
"Afek",
"Yehuda",
""
],
[
"Gafni",
"Eli",
""
]
] | We consider synchronous dynamic networks which like radio networks may have asymmetric communication links, and are affected by communication rather than processor failures. In this paper we investigate the minimal message survivability in a per round basis that allows for the minimal global cooperation, i.e., allows t... |
cs/0412023 | Praveen Boinee | P. Boinee, F. Barbarino, A. De Angelis | Multidimensional data classification with artificial neural networks | 8 pages, 4 figures, Submitted to EURASIP Journal on Applied Signal
Processing, 2004 | null | null | null | cs.NE cs.AI | null | Multi-dimensional data classification is an important and challenging problem
in many astro-particle experiments. Neural networks have proved to be versatile
and robust in multi-dimensional data classification. In this article we shall
study the classification of gamma from the hadrons for the MAGIC Experiment.
Two n... | [
{
"created": "Mon, 6 Dec 2004 20:23:15 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Boinee",
"P.",
""
],
[
"Barbarino",
"F.",
""
],
[
"De Angelis",
"A.",
""
]
] | Multi-dimensional data classification is an important and challenging problem in many astro-particle experiments. Neural networks have proved to be versatile and robust in multi-dimensional data classification. In this article we shall study the classification of gamma from the hadrons for the MAGIC Experiment. Two neu... |
2112.07179 | Mahdi Fahmideh | Mahdi Fahmideh, Anuradha Gunawardana, Shiping Chen, Jun Shen, Brian
Yecies | Blockchain Developments and Innovations | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Blockchain has received expanding interest from various domains.
Institutions, enterprises, governments, and agencies are interested in
Blockchain potential to augment their software systems. The unique requirements
and characteristics of Blockchain platforms raise new challenges involving
extensive enhancement to co... | [
{
"created": "Tue, 14 Dec 2021 05:51:58 GMT",
"version": "v1"
}
] | 2021-12-15 | [
[
"Fahmideh",
"Mahdi",
""
],
[
"Gunawardana",
"Anuradha",
""
],
[
"Chen",
"Shiping",
""
],
[
"Shen",
"Jun",
""
],
[
"Yecies",
"Brian",
""
]
] | Blockchain has received expanding interest from various domains. Institutions, enterprises, governments, and agencies are interested in Blockchain potential to augment their software systems. The unique requirements and characteristics of Blockchain platforms raise new challenges involving extensive enhancement to conv... |
2102.10685 | Esha Shandilya | Esha Shandilya, Yiwen Wang, Xuan Zhao and Mingming Fan | EvoK: Connecting loved ones through Heart Rate sharing | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | In this work, we present EvoK, a new way of sharing one's heart rate with
feedback from their close contacts to alleviate social isolation and
loneliness. EvoK consists of a pair of wearable prototype devices (i.e., sender
and receiver). The sender is designed as a headband enabling continuous sensing
of heart rate w... | [
{
"created": "Sun, 21 Feb 2021 21:04:16 GMT",
"version": "v1"
}
] | 2021-02-23 | [
[
"Shandilya",
"Esha",
""
],
[
"Wang",
"Yiwen",
""
],
[
"Zhao",
"Xuan",
""
],
[
"Fan",
"Mingming",
""
]
] | In this work, we present EvoK, a new way of sharing one's heart rate with feedback from their close contacts to alleviate social isolation and loneliness. EvoK consists of a pair of wearable prototype devices (i.e., sender and receiver). The sender is designed as a headband enabling continuous sensing of heart rate wit... |
2101.05469 | Jason Wei | Jason Wei, Chengyu Huang, Shiqi Xu, Soroush Vosoughi | Text Augmentation in a Multi-Task View | Accepted to EACL 2021 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Traditional data augmentation aims to increase the coverage of the input
distribution by generating augmented examples that strongly resemble original
samples in an online fashion where augmented examples dominate training. In
this paper, we propose an alternative perspective -- a multi-task view (MTV) of
data augmen... | [
{
"created": "Thu, 14 Jan 2021 05:59:23 GMT",
"version": "v1"
}
] | 2021-01-15 | [
[
"Wei",
"Jason",
""
],
[
"Huang",
"Chengyu",
""
],
[
"Xu",
"Shiqi",
""
],
[
"Vosoughi",
"Soroush",
""
]
] | Traditional data augmentation aims to increase the coverage of the input distribution by generating augmented examples that strongly resemble original samples in an online fashion where augmented examples dominate training. In this paper, we propose an alternative perspective -- a multi-task view (MTV) of data augmenta... |
2008.03868 | Xiaoming Chen | Jianhang Chu, Xiaoming Chen, Caijun Zhong, Zhaoyang Zhang | Robust Design for NOMA-based Multi-Beam LEO Satellite Internet of Things | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the issue of massive access in a beyond
fifth-generation (B5G) multi-beam low earth orbit (LEO) satellite internet of
things (IoT) network in the presence of channel phase uncertainty due to
channel state information (CSI) conveyance from the devices to the satellite
via the gateway. Rat... | [
{
"created": "Mon, 10 Aug 2020 02:41:45 GMT",
"version": "v1"
}
] | 2020-08-11 | [
[
"Chu",
"Jianhang",
""
],
[
"Chen",
"Xiaoming",
""
],
[
"Zhong",
"Caijun",
""
],
[
"Zhang",
"Zhaoyang",
""
]
] | In this paper, we investigate the issue of massive access in a beyond fifth-generation (B5G) multi-beam low earth orbit (LEO) satellite internet of things (IoT) network in the presence of channel phase uncertainty due to channel state information (CSI) conveyance from the devices to the satellite via the gateway. Rathe... |
2007.06122 | Ya Xiao | Ya Xiao, Yang Zhao, Nicholas Allen, Nathan Keynes, Danfeng (Daphne)
Yao, Cristina Cifuentes | Industrial Experience of Finding Cryptographic Vulnerabilities in
Large-scale Codebases | 8 pages, 5 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Enterprise environment often screens large-scale (millions of lines of code)
codebases with static analysis tools to find bugs and vulnerabilities. Parfait
is a static code analysis tool used in Oracle to find security vulnerabilities
in industrial codebases. Recently, many studies show that there are complicated
cry... | [
{
"created": "Sun, 12 Jul 2020 22:52:40 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Jan 2022 22:06:04 GMT",
"version": "v2"
}
] | 2022-01-04 | [
[
"Xiao",
"Ya",
"",
"Daphne"
],
[
"Zhao",
"Yang",
"",
"Daphne"
],
[
"Allen",
"Nicholas",
"",
"Daphne"
],
[
"Keynes",
"Nathan",
"",
"Daphne"
],
[
"Danfeng",
"",
"",
"Daphne"
],
[
"Yao",
"",
""
],
[
... | Enterprise environment often screens large-scale (millions of lines of code) codebases with static analysis tools to find bugs and vulnerabilities. Parfait is a static code analysis tool used in Oracle to find security vulnerabilities in industrial codebases. Recently, many studies show that there are complicated crypt... |
1909.12483 | Zhijie Yang | Xiting Zhao, Zhijie Yang and S\"oren Schwertfeger | Mapping with Reflection -- Detection and Utilization of Reflection in 3D
Lidar Scans | Accepted at SSRR 2020 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a method to detect reflection of 3D light detection and
ranging (Lidar) scans and uses it to classify the points and also map objects
outside the line of sight. Our software uses several approaches to analyze the
point cloud, including intensity peak detection, dual return detection, plane
fitting... | [
{
"created": "Fri, 27 Sep 2019 03:43:44 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Oct 2020 05:42:47 GMT",
"version": "v2"
}
] | 2020-10-28 | [
[
"Zhao",
"Xiting",
""
],
[
"Yang",
"Zhijie",
""
],
[
"Schwertfeger",
"Sören",
""
]
] | This paper presents a method to detect reflection of 3D light detection and ranging (Lidar) scans and uses it to classify the points and also map objects outside the line of sight. Our software uses several approaches to analyze the point cloud, including intensity peak detection, dual return detection, plane fitting, ... |
1207.5497 | Yongge Wang | Yongge Wang | Password Protected Smart Card and Memory Stick Authentication Against
Off-line Dictionary Attacks | null | SEC 2012, IFIP AICT 376, pp. 489-500, 2012 | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study the security requirements for remote authentication
with password protected smart card. In recent years, several protocols for
password-based authenticated key exchange have been proposed. These protocols
are used for the protection of password based authentication between a client
and a remot... | [
{
"created": "Mon, 23 Jul 2012 19:49:57 GMT",
"version": "v1"
}
] | 2012-07-24 | [
[
"Wang",
"Yongge",
""
]
] | In this paper, we study the security requirements for remote authentication with password protected smart card. In recent years, several protocols for password-based authenticated key exchange have been proposed. These protocols are used for the protection of password based authentication between a client and a remote ... |
2304.11835 | Yonggan Fu | Yonggan Fu, Yuecheng Li, Chenghui Li, Jason Saragih, Peizhao Zhang,
Xiaoliang Dai, Yingyan Lin | Auto-CARD: Efficient and Robust Codec Avatar Driving for Real-time
Mobile Telepresence | Accepted by CVPR 2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Real-time and robust photorealistic avatars for telepresence in AR/VR have
been highly desired for enabling immersive photorealistic telepresence.
However, there still exists one key bottleneck: the considerable computational
expense needed to accurately infer facial expressions captured from
headset-mounted cameras ... | [
{
"created": "Mon, 24 Apr 2023 05:45:12 GMT",
"version": "v1"
}
] | 2023-04-25 | [
[
"Fu",
"Yonggan",
""
],
[
"Li",
"Yuecheng",
""
],
[
"Li",
"Chenghui",
""
],
[
"Saragih",
"Jason",
""
],
[
"Zhang",
"Peizhao",
""
],
[
"Dai",
"Xiaoliang",
""
],
[
"Lin",
"Yingyan",
""
]
] | Real-time and robust photorealistic avatars for telepresence in AR/VR have been highly desired for enabling immersive photorealistic telepresence. However, there still exists one key bottleneck: the considerable computational expense needed to accurately infer facial expressions captured from headset-mounted cameras wi... |
2308.08343 | Jordan Awan | Jordan Awan and Aishwarya Ramasethu | Optimizing Noise for $f$-Differential Privacy via Anti-Concentration and
Stochastic Dominance | 17 pages before appendix, 25 pages total, 6 figures | null | null | null | cs.CR math.PR math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we establish anti-concentration inequalities for additive
noise mechanisms which achieve $f$-differential privacy ($f$-DP), a notion of
privacy phrased in terms of a tradeoff function (a.k.a. ROC curve) $f$ which
limits the ability of an adversary to determine which individuals were in the
database. We... | [
{
"created": "Wed, 16 Aug 2023 13:09:27 GMT",
"version": "v1"
}
] | 2023-08-17 | [
[
"Awan",
"Jordan",
""
],
[
"Ramasethu",
"Aishwarya",
""
]
] | In this paper, we establish anti-concentration inequalities for additive noise mechanisms which achieve $f$-differential privacy ($f$-DP), a notion of privacy phrased in terms of a tradeoff function (a.k.a. ROC curve) $f$ which limits the ability of an adversary to determine which individuals were in the database. We s... |
1802.03594 | \'Alvaro Peris | \'Alvaro Peris and Francisco Casacuberta | Online Learning for Effort Reduction in Interactive Neural Machine
Translation | Accepted in Computer Speech & Language | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Neural machine translation systems require large amounts of training data and
resources. Even with this, the quality of the translations may be insufficient
for some users or domains. In such cases, the output of the system must be
revised by a human agent. This can be done in a post-editing stage or following
an int... | [
{
"created": "Sat, 10 Feb 2018 14:07:58 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Apr 2019 08:18:33 GMT",
"version": "v2"
}
] | 2019-04-09 | [
[
"Peris",
"Álvaro",
""
],
[
"Casacuberta",
"Francisco",
""
]
] | Neural machine translation systems require large amounts of training data and resources. Even with this, the quality of the translations may be insufficient for some users or domains. In such cases, the output of the system must be revised by a human agent. This can be done in a post-editing stage or following an inter... |
1701.06790 | Rachid Echahed | Rachid Echahed and Aude Maignan | Parallel Graph Rewriting with Overlapping Rules | 26 pages | null | null | null | cs.FL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We tackle the problem of simultaneous transformations of networks represented
as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or
parallel rewrite relations over complex structures such as graphs: (i) those
which transform disjoint subgraphs in parallel and hence can be simulated by
successi... | [
{
"created": "Tue, 24 Jan 2017 10:02:55 GMT",
"version": "v1"
}
] | 2017-01-25 | [
[
"Echahed",
"Rachid",
""
],
[
"Maignan",
"Aude",
""
]
] | We tackle the problem of simultaneous transformations of networks represented as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or parallel rewrite relations over complex structures such as graphs: (i) those which transform disjoint subgraphs in parallel and hence can be simulated by successive... |
2001.07049 | Lukas Holzbaur | Lukas Holzbaur, Camilla Hollanti, Antonia Wachter-Zeh | Computational Code-Based Single-Server Private Information Retrieval | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A new computational private information retrieval (PIR) scheme based on
random linear codes is presented. A matrix of messages from a McEliece scheme
is used to query the server with carefully chosen errors. The server responds
with the sum of the scalar multiple of the rows of the query matrix and the
files. The use... | [
{
"created": "Mon, 20 Jan 2020 10:31:56 GMT",
"version": "v1"
},
{
"created": "Thu, 14 May 2020 15:58:04 GMT",
"version": "v2"
}
] | 2020-05-15 | [
[
"Holzbaur",
"Lukas",
""
],
[
"Hollanti",
"Camilla",
""
],
[
"Wachter-Zeh",
"Antonia",
""
]
] | A new computational private information retrieval (PIR) scheme based on random linear codes is presented. A matrix of messages from a McEliece scheme is used to query the server with carefully chosen errors. The server responds with the sum of the scalar multiple of the rows of the query matrix and the files. The user ... |
2006.10916 | Seyed Esmaeili | Seyed A. Esmaeili, Brian Brubach, Leonidas Tsepenekas, John P.
Dickerson | Probabilistic Fair Clustering | null | null | null | null | cs.LG cs.AI cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In clustering problems, a central decision-maker is given a complete metric
graph over vertices and must provide a clustering of vertices that minimizes
some objective function. In fair clustering problems, vertices are endowed with
a color (e.g., membership in a group), and the features of a valid clustering
might a... | [
{
"created": "Fri, 19 Jun 2020 01:34:21 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Nov 2021 10:12:10 GMT",
"version": "v2"
},
{
"created": "Fri, 2 Jun 2023 20:04:45 GMT",
"version": "v3"
}
] | 2023-06-06 | [
[
"Esmaeili",
"Seyed A.",
""
],
[
"Brubach",
"Brian",
""
],
[
"Tsepenekas",
"Leonidas",
""
],
[
"Dickerson",
"John P.",
""
]
] | In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color (e.g., membership in a group), and the features of a valid clustering might als... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.