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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0812.1012 | Kamesh Munagala | Sudipto Guha and Kamesh Munagala | Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization
Problems | Journal version of the paper "Model-driven Optimization using
Adaptive Probes" that appeared in the ACM-SIAM Symposium on Discrete
Algorithms (SODA), 2007 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In several applications such as databases, planning, and sensor networks,
parameters such as selectivity, load, or sensed values are known only with some
associated uncertainty. The performance of such a system (as captured by some
objective function over the parameters) is significantly improved if some of
these par... | [
{
"created": "Thu, 4 Dec 2008 19:48:16 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Sep 2009 14:17:22 GMT",
"version": "v2"
},
{
"created": "Thu, 28 Jan 2010 15:08:30 GMT",
"version": "v3"
}
] | 2010-01-28 | [
[
"Guha",
"Sudipto",
""
],
[
"Munagala",
"Kamesh",
""
]
] | In several applications such as databases, planning, and sensor networks, parameters such as selectivity, load, or sensed values are known only with some associated uncertainty. The performance of such a system (as captured by some objective function over the parameters) is significantly improved if some of these param... |
1302.1334 | Yuriy Parzhin | Yuri Parzhin | Principles of modal and vector theory of formal intelligence systems | 34 pages, 8 figures | null | null | null | cs.AI | http://creativecommons.org/licenses/by/3.0/ | The paper considers the class of information systems capable of solving
heuristic problems on basis of formal theory that was termed modal and vector
theory of formal intelligent systems (FIS). The paper justifies the
construction of FIS resolution algorithm, defines the main features of these
systems and proves theo... | [
{
"created": "Wed, 6 Feb 2013 12:16:33 GMT",
"version": "v1"
}
] | 2013-02-07 | [
[
"Parzhin",
"Yuri",
""
]
] | The paper considers the class of information systems capable of solving heuristic problems on basis of formal theory that was termed modal and vector theory of formal intelligent systems (FIS). The paper justifies the construction of FIS resolution algorithm, defines the main features of these systems and proves theore... |
2407.17478 | Clara Ziche | Clara Ziche and Giovanni Apruzzese | LLM4PM: A case study on using Large Language Models for Process Modeling
in Enterprise Organizations | 10 pages, 6 figures | null | null | null | cs.HC cs.AI cs.CL cs.CY cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We investigate the potential of using Large Language Models (LLM) to support
process model creation in organizational contexts. Specifically, we carry out a
case study wherein we develop and test an LLM-based chatbot, PRODIGY (PROcess
moDellIng Guidance for You), in a multinational company, the Hilti Group. We
are pa... | [
{
"created": "Mon, 1 Jul 2024 19:57:36 GMT",
"version": "v1"
}
] | 2024-07-26 | [
[
"Ziche",
"Clara",
""
],
[
"Apruzzese",
"Giovanni",
""
]
] | We investigate the potential of using Large Language Models (LLM) to support process model creation in organizational contexts. Specifically, we carry out a case study wherein we develop and test an LLM-based chatbot, PRODIGY (PROcess moDellIng Guidance for You), in a multinational company, the Hilti Group. We are part... |
2212.12964 | Steffen Becker | Franziska Herbert and Steffen Becker and Annalina Buckmann and Marvin
Kowalewski and Jonas Hielscher and Yasemin Acar and Markus D\"urmuth and
Yixin Zou and M. Angela Sasse | Digital Security -- A Question of Perspective. A Large-Scale Telephone
Survey with Four At-Risk User Groups | null | null | 10.1109/SP54263.2024.00027 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates the digital security experiences of four at-risk user
groups in Germany, including older adults (70+), teenagers (14-17), people with
migration backgrounds, and people with low formal education. Using
computer-assisted telephone interviews, we sampled 250 participants per group,
representative... | [
{
"created": "Sun, 25 Dec 2022 22:11:57 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Sep 2023 20:25:38 GMT",
"version": "v2"
}
] | 2024-02-29 | [
[
"Herbert",
"Franziska",
""
],
[
"Becker",
"Steffen",
""
],
[
"Buckmann",
"Annalina",
""
],
[
"Kowalewski",
"Marvin",
""
],
[
"Hielscher",
"Jonas",
""
],
[
"Acar",
"Yasemin",
""
],
[
"Dürmuth",
"Markus",
""
... | This paper investigates the digital security experiences of four at-risk user groups in Germany, including older adults (70+), teenagers (14-17), people with migration backgrounds, and people with low formal education. Using computer-assisted telephone interviews, we sampled 250 participants per group, representative o... |
2111.03363 | Aidmar Wainakh | Aidmar Wainakh, Ephraim Zimmer, Sandeep Subedi, Jens Keim, Tim Grube,
Shankar Karuppayah, Alejandro Sanchez Guinea, Max M\"uhlh\"auser | Federated Learning Attacks Revisited: A Critical Discussion of Gaps,
Assumptions, and Evaluation Setups | In Section 5.2, incomplete information are mentioned on reference [9]
("How To Backdoor Federated Learning"). This part of text will be revised and
enriched | null | null | null | cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Federated learning (FL) enables a set of entities to collaboratively train a
machine learning model without sharing their sensitive data, thus, mitigating
some privacy concerns. However, an increasing number of works in the literature
propose attacks that can manipulate the model and disclose information about
the tr... | [
{
"created": "Fri, 5 Nov 2021 10:07:34 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jan 2022 08:30:00 GMT",
"version": "v2"
}
] | 2022-01-04 | [
[
"Wainakh",
"Aidmar",
""
],
[
"Zimmer",
"Ephraim",
""
],
[
"Subedi",
"Sandeep",
""
],
[
"Keim",
"Jens",
""
],
[
"Grube",
"Tim",
""
],
[
"Karuppayah",
"Shankar",
""
],
[
"Guinea",
"Alejandro Sanchez",
""
],... | Federated learning (FL) enables a set of entities to collaboratively train a machine learning model without sharing their sensitive data, thus, mitigating some privacy concerns. However, an increasing number of works in the literature propose attacks that can manipulate the model and disclose information about the trai... |
1308.1279 | Russell Brown | Russell A. Brown | Barycentric Coordinates as Interpolants | 8 pages, 1 figure | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Barycentric coordinates are frequently used as interpolants to shade computer
graphics images. A simple equation transforms barycentric coordinates from
screen space into eye space in order to undo the perspective transformation and
permit accurate interpolative shading of texture maps. This technique is
amenable to ... | [
{
"created": "Tue, 6 Aug 2013 14:15:42 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Aug 2013 13:39:44 GMT",
"version": "v2"
},
{
"created": "Thu, 8 Aug 2013 14:09:09 GMT",
"version": "v3"
},
{
"created": "Thu, 23 Oct 2014 09:46:57 GMT",
"version": "v4"
},
{
"crea... | 2014-10-31 | [
[
"Brown",
"Russell A.",
""
]
] | Barycentric coordinates are frequently used as interpolants to shade computer graphics images. A simple equation transforms barycentric coordinates from screen space into eye space in order to undo the perspective transformation and permit accurate interpolative shading of texture maps. This technique is amenable to co... |
2210.12877 | Chidera Biringa | Chidera Biringa and G\"okhan Kul | A Secure Design Pattern Approach Toward Tackling Lateral-Injection
Attacks | 4 pages, 3 figures. Accepted to The 15th IEEE International
Conference on Security of Information and Networks (SIN) | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Software weaknesses that create attack surfaces for adversarial exploits,
such as lateral SQL injection (LSQLi) attacks, are usually introduced during
the design phase of software development. Security design patterns are
sometimes applied to tackle these weaknesses. However, due to the stealthy
nature of lateral-bas... | [
{
"created": "Sun, 23 Oct 2022 23:02:52 GMT",
"version": "v1"
}
] | 2022-10-25 | [
[
"Biringa",
"Chidera",
""
],
[
"Kul",
"Gökhan",
""
]
] | Software weaknesses that create attack surfaces for adversarial exploits, such as lateral SQL injection (LSQLi) attacks, are usually introduced during the design phase of software development. Security design patterns are sometimes applied to tackle these weaknesses. However, due to the stealthy nature of lateral-based... |
2305.09779 | Ali Gorji | Ali Gorji, Andisheh Amrollahi, Andreas Krause | A Scalable Walsh-Hadamard Regularizer to Overcome the Low-degree
Spectral Bias of Neural Networks | Accepted for the 39th Conference on Uncertainty in Artificial
Intelligence (UAI 2023) | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Despite the capacity of neural nets to learn arbitrary functions, models
trained through gradient descent often exhibit a bias towards ``simpler''
functions. Various notions of simplicity have been introduced to characterize
this behavior. Here, we focus on the case of neural networks with discrete
(zero-one), high-d... | [
{
"created": "Tue, 16 May 2023 20:06:01 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Jun 2023 09:10:14 GMT",
"version": "v2"
}
] | 2023-06-13 | [
[
"Gorji",
"Ali",
""
],
[
"Amrollahi",
"Andisheh",
""
],
[
"Krause",
"Andreas",
""
]
] | Despite the capacity of neural nets to learn arbitrary functions, models trained through gradient descent often exhibit a bias towards ``simpler'' functions. Various notions of simplicity have been introduced to characterize this behavior. Here, we focus on the case of neural networks with discrete (zero-one), high-dim... |
2103.08006 | Hamid Majidi Balanji | Hamid Majidi Balanji, and Ali Emre Turgut | Vision based range and bearing algorithm for robot swarms | 2 pages, 3 figures, 2018 Turkey Robotic Conference (TORK 2018) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel computer vision the algorithm proposed for the
on-line range and bearing detection of the robot swarms. Results demonstrated
the reliability of the proposed vision system such that it can be used for the
robot swarms applications.
| [
{
"created": "Sun, 14 Mar 2021 19:35:39 GMT",
"version": "v1"
}
] | 2021-03-16 | [
[
"Balanji",
"Hamid Majidi",
""
],
[
"Turgut",
"Ali Emre",
""
]
] | This paper presents a novel computer vision the algorithm proposed for the on-line range and bearing detection of the robot swarms. Results demonstrated the reliability of the proposed vision system such that it can be used for the robot swarms applications. |
1704.06178 | Andrea Esuli | Fabio Carrara, Andrea Esuli, Fabrizio Falchi, Alejandro Moreo
Fern\'andez | Exploring epoch-dependent stochastic residual networks | Preliminary report | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recently proposed stochastic residual networks selectively activate or
bypass the layers during training, based on independent stochastic choices,
each of which following a probability distribution that is fixed in advance. In
this paper we present a first exploration on the use of an epoch-dependent
distribution... | [
{
"created": "Thu, 20 Apr 2017 15:08:28 GMT",
"version": "v1"
}
] | 2017-04-21 | [
[
"Carrara",
"Fabio",
""
],
[
"Esuli",
"Andrea",
""
],
[
"Falchi",
"Fabrizio",
""
],
[
"Fernández",
"Alejandro Moreo",
""
]
] | The recently proposed stochastic residual networks selectively activate or bypass the layers during training, based on independent stochastic choices, each of which following a probability distribution that is fixed in advance. In this paper we present a first exploration on the use of an epoch-dependent distribution, ... |
2312.11399 | Chris Hokamp | Chris Hokamp and Demian Gholipour Ghalandari and Parsa Ghaffari | News Signals: An NLP Library for Text and Time Series | EMNLP NLP-OSS Workshop, December 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We present an open-source Python library for building and using datasets
where inputs are clusters of textual data, and outputs are sequences of real
values representing one or more time series signals. The news-signals library
supports diverse data science and NLP problem settings related to the
prediction of time s... | [
{
"created": "Mon, 18 Dec 2023 18:02:41 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Hokamp",
"Chris",
""
],
[
"Ghalandari",
"Demian Gholipour",
""
],
[
"Ghaffari",
"Parsa",
""
]
] | We present an open-source Python library for building and using datasets where inputs are clusters of textual data, and outputs are sequences of real values representing one or more time series signals. The news-signals library supports diverse data science and NLP problem settings related to the prediction of time ser... |
2201.05576 | Jayati Deshmukh | Srinath Srinivasa and Jayati Deshmukh | AI and the Sense of Self | Previous version of this paper was published in Jijnasa 2021 | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | After several winters, AI is center-stage once again, with current advances
enabling a vast array of AI applications. This renewed wave of AI has brought
back to the fore several questions from the past, about philosophical
foundations of intelligence and common sense -- predominantly motivated by
ethical concerns of... | [
{
"created": "Fri, 7 Jan 2022 10:54:06 GMT",
"version": "v1"
}
] | 2022-01-17 | [
[
"Srinivasa",
"Srinath",
""
],
[
"Deshmukh",
"Jayati",
""
]
] | After several winters, AI is center-stage once again, with current advances enabling a vast array of AI applications. This renewed wave of AI has brought back to the fore several questions from the past, about philosophical foundations of intelligence and common sense -- predominantly motivated by ethical concerns of A... |
2407.07606 | Katrien Beuls | Jonas Doumen, Veronica Juliana Schmalz, Katrien Beuls and Paul Van
Eecke | The Computational Learning of Construction Grammars: State of the Art
and Prospective Roadmap | Peer-reviewed author's draft of a journal article to appear in
Constructions and Frames (2025) | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper documents and reviews the state of the art concerning
computational models of construction grammar learning. It brings together prior
work on the computational learning of form-meaning pairings, which has so far
been studied in several distinct areas of research. The goal of this paper is
threefold. First ... | [
{
"created": "Wed, 10 Jul 2024 12:45:02 GMT",
"version": "v1"
}
] | 2024-07-11 | [
[
"Doumen",
"Jonas",
""
],
[
"Schmalz",
"Veronica Juliana",
""
],
[
"Beuls",
"Katrien",
""
],
[
"Van Eecke",
"Paul",
""
]
] | This paper documents and reviews the state of the art concerning computational models of construction grammar learning. It brings together prior work on the computational learning of form-meaning pairings, which has so far been studied in several distinct areas of research. The goal of this paper is threefold. First of... |
2001.04284 | Thomas Ehrhard | Thomas Ehrhard (IRIF (UMR\_8243)) | On the linear structure of cones | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For encompassing the limitations of probabilistic coherence spaces which do
not seem to provide natural interpretations of continuous data types such as
the real line, Ehrhard and al. introduced a model of probabilistic higher order
computation based on (positive) cones, and a class of totally monotone
functions that... | [
{
"created": "Mon, 13 Jan 2020 14:32:46 GMT",
"version": "v1"
}
] | 2020-01-14 | [
[
"Ehrhard",
"Thomas",
"",
"IRIF"
]
] | For encompassing the limitations of probabilistic coherence spaces which do not seem to provide natural interpretations of continuous data types such as the real line, Ehrhard and al. introduced a model of probabilistic higher order computation based on (positive) cones, and a class of totally monotone functions that t... |
2204.11677 | Philipp Christmann | Philipp Christmann, Rishiraj Saha Roy, Gerhard Weikum | Conversational Question Answering on Heterogeneous Sources | SIGIR 2022 Research Track Long Paper | null | null | null | cs.IR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Conversational question answering (ConvQA) tackles sequential information
needs where contexts in follow-up questions are left implicit. Current ConvQA
systems operate over homogeneous sources of information: either a knowledge
base (KB), or a text corpus, or a collection of tables. This paper addresses
the novel iss... | [
{
"created": "Mon, 25 Apr 2022 14:13:44 GMT",
"version": "v1"
},
{
"created": "Fri, 30 Jun 2023 12:32:03 GMT",
"version": "v2"
}
] | 2023-07-03 | [
[
"Christmann",
"Philipp",
""
],
[
"Roy",
"Rishiraj Saha",
""
],
[
"Weikum",
"Gerhard",
""
]
] | Conversational question answering (ConvQA) tackles sequential information needs where contexts in follow-up questions are left implicit. Current ConvQA systems operate over homogeneous sources of information: either a knowledge base (KB), or a text corpus, or a collection of tables. This paper addresses the novel issue... |
1404.7041 | Weiyu Xu | Kumar Vijay Mishra, Myung Cho, Anton Kruger and Weiyu Xu | Super-resolution Line Spectrum Estimation with Block Priors | 7 pages, double column | null | null | null | cs.IT math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of super-resolution line spectrum estimation of an
undersampled signal with block prior information. The component frequencies of
the signal are assumed to take arbitrary continuous values in known frequency
blocks. We formulate a general semidefinite program to recover these
continuous-valued ... | [
{
"created": "Mon, 28 Apr 2014 16:22:19 GMT",
"version": "v1"
}
] | 2014-04-29 | [
[
"Mishra",
"Kumar Vijay",
""
],
[
"Cho",
"Myung",
""
],
[
"Kruger",
"Anton",
""
],
[
"Xu",
"Weiyu",
""
]
] | We address the problem of super-resolution line spectrum estimation of an undersampled signal with block prior information. The component frequencies of the signal are assumed to take arbitrary continuous values in known frequency blocks. We formulate a general semidefinite program to recover these continuous-valued fr... |
2104.08835 | Qinyuan Ye | Qinyuan Ye, Bill Yuchen Lin, Xiang Ren | CrossFit: A Few-shot Learning Challenge for Cross-task Generalization in
NLP | Accepted to EMNLP 2021. Camera-ready version. Code:
https://github.com/INK-USC/CrossFit | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Humans can learn a new language task efficiently with only few examples, by
leveraging their knowledge obtained when learning prior tasks. In this paper,
we explore whether and how such cross-task generalization ability can be
acquired, and further applied to build better few-shot learners across diverse
NLP tasks. W... | [
{
"created": "Sun, 18 Apr 2021 12:14:46 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Sep 2021 22:36:50 GMT",
"version": "v2"
}
] | 2021-10-04 | [
[
"Ye",
"Qinyuan",
""
],
[
"Lin",
"Bill Yuchen",
""
],
[
"Ren",
"Xiang",
""
]
] | Humans can learn a new language task efficiently with only few examples, by leveraging their knowledge obtained when learning prior tasks. In this paper, we explore whether and how such cross-task generalization ability can be acquired, and further applied to build better few-shot learners across diverse NLP tasks. We ... |
1911.10516 | Weijia Zhang | Weijia Zhang, Hao Liu, Yanchi Liu, Jingbo Zhou, Hui Xiong | Semi-Supervised Hierarchical Recurrent Graph Neural Network for
City-Wide Parking Availability Prediction | 8 pages, 9 figures, AAAI-2020 | null | null | null | cs.LG eess.SP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ability to predict city-wide parking availability is crucial for the
successful development of Parking Guidance and Information (PGI) systems.
Indeed, the effective prediction of city-wide parking availability can improve
parking efficiency, help urban planning, and ultimately alleviate city
congestion. However, ... | [
{
"created": "Sun, 24 Nov 2019 12:17:04 GMT",
"version": "v1"
}
] | 2019-12-02 | [
[
"Zhang",
"Weijia",
""
],
[
"Liu",
"Hao",
""
],
[
"Liu",
"Yanchi",
""
],
[
"Zhou",
"Jingbo",
""
],
[
"Xiong",
"Hui",
""
]
] | The ability to predict city-wide parking availability is crucial for the successful development of Parking Guidance and Information (PGI) systems. Indeed, the effective prediction of city-wide parking availability can improve parking efficiency, help urban planning, and ultimately alleviate city congestion. However, it... |
1310.2778 | Guillaume Cheze | Alin Bostan (INRIA Saclay - Ile de France, MSR - INRIA), Guillaume
Ch\`eze (IMT), Thomas Cluzeau (XLIM), Jacques-Arthur Weil (XLIM) | Efficient Algorithms for Computing Rational First Integrals and Darboux
Polynomials of Planar Polynomial Vector Fields | null | null | null | null | cs.SC cs.DS math.CA nlin.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present fast algorithms for computing rational first integrals with
bounded degree of a planar polynomial vector field. Our approach is inspired by
an idea of Ferragut and Giacomini. We improve upon their work by proving that
rational first integrals can be computed via systems of linear equations
instead of syste... | [
{
"created": "Thu, 10 Oct 2013 11:39:24 GMT",
"version": "v1"
}
] | 2013-10-11 | [
[
"Bostan",
"Alin",
"",
"INRIA Saclay - Ile de France, MSR - INRIA"
],
[
"Chèze",
"Guillaume",
"",
"IMT"
],
[
"Cluzeau",
"Thomas",
"",
"XLIM"
],
[
"Weil",
"Jacques-Arthur",
"",
"XLIM"
]
] | We present fast algorithms for computing rational first integrals with bounded degree of a planar polynomial vector field. Our approach is inspired by an idea of Ferragut and Giacomini. We improve upon their work by proving that rational first integrals can be computed via systems of linear equations instead of systems... |
1904.02530 | Hamidreza Kasaei | S. Hamidreza Kasaei, Nima Shafii, Luis Seabra Lopes, Ana Maria Tome | Interactive Open-Ended Object, Affordance and Grasp Learning for Robotic
Manipulation | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Service robots are expected to autonomously and efficiently work in
human-centric environments. For this type of robots, object perception and
manipulation are challenging tasks due to need for accurate and real-time
response. This paper presents an interactive open-ended learning approach to
recognize multiple objec... | [
{
"created": "Thu, 4 Apr 2019 13:10:24 GMT",
"version": "v1"
}
] | 2019-04-05 | [
[
"Kasaei",
"S. Hamidreza",
""
],
[
"Shafii",
"Nima",
""
],
[
"Lopes",
"Luis Seabra",
""
],
[
"Tome",
"Ana Maria",
""
]
] | Service robots are expected to autonomously and efficiently work in human-centric environments. For this type of robots, object perception and manipulation are challenging tasks due to need for accurate and real-time response. This paper presents an interactive open-ended learning approach to recognize multiple objects... |
1910.01722 | Osnat Mokryn | Hadar Miller and Osnat Mokryn | Constant State of Change: Engagement Inequality in Temporal Dynamic
Networks | arXiv admin note: substantial text overlap with arXiv:1809.09613 | PLOS ONE 15(4): e0231035 (2020) | 10.1371/journal.pone.0231035 | null | cs.SI physics.data-an stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The temporal changes in complex systems of interactions have excited the
research community in recent years as they encompass understandings on their
dynamics and evolution. From the collective dynamics of organizations and
online communities to the spreading of information and fake news, to name a
few, temporal dyna... | [
{
"created": "Thu, 3 Oct 2019 21:12:57 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Apr 2020 19:25:59 GMT",
"version": "v2"
}
] | 2020-04-15 | [
[
"Miller",
"Hadar",
""
],
[
"Mokryn",
"Osnat",
""
]
] | The temporal changes in complex systems of interactions have excited the research community in recent years as they encompass understandings on their dynamics and evolution. From the collective dynamics of organizations and online communities to the spreading of information and fake news, to name a few, temporal dynami... |
2004.00554 | Tao Lu | Bin Wang, Tao Lu, Yanduo Zhang | Feature-Driven Super-Resolution for Object Detection | 4 pages, 3 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although some convolutional neural networks (CNNs) based super-resolution
(SR) algorithms yield good visual performances on single images recently. Most
of them focus on perfect perceptual quality but ignore specific needs of
subsequent detection task. This paper proposes a simple but powerful
feature-driven super-re... | [
{
"created": "Wed, 1 Apr 2020 16:33:07 GMT",
"version": "v1"
}
] | 2020-04-02 | [
[
"Wang",
"Bin",
""
],
[
"Lu",
"Tao",
""
],
[
"Zhang",
"Yanduo",
""
]
] | Although some convolutional neural networks (CNNs) based super-resolution (SR) algorithms yield good visual performances on single images recently. Most of them focus on perfect perceptual quality but ignore specific needs of subsequent detection task. This paper proposes a simple but powerful feature-driven super-reso... |
2006.11026 | Carola Doerr | Arina Buzdalova, Carola Doerr, Anna Rodionova | Hybridizing the 1/5-th Success Rule with Q-Learning for Controlling the
Mutation Rate of an Evolutionary Algorithm | To appear in the Proceedings of Parallel Problem Solving from Nature
(PPSN'2020) | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is well known that evolutionary algorithms (EAs) achieve peak performance
only when their parameters are suitably tuned to the given problem. Even more,
it is known that the best parameter values can change during the optimization
process. Parameter control mechanisms are techniques developed to identify and
to tr... | [
{
"created": "Fri, 19 Jun 2020 09:12:49 GMT",
"version": "v1"
}
] | 2020-06-22 | [
[
"Buzdalova",
"Arina",
""
],
[
"Doerr",
"Carola",
""
],
[
"Rodionova",
"Anna",
""
]
] | It is well known that evolutionary algorithms (EAs) achieve peak performance only when their parameters are suitably tuned to the given problem. Even more, it is known that the best parameter values can change during the optimization process. Parameter control mechanisms are techniques developed to identify and to trac... |
2212.01736 | Min Qiu | Min Qiu and Yu-Chih Huang and Jinhong Yuan | Downlink Transmission with Heterogeneous URLLC Services: Discrete
Signaling With Single-User Decoding | 16 pages, 7 figures, accepted by IEEE Journal on Selected Areas in
Communications | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of designing downlink transmission schemes for supporting
heterogeneous ultra-reliable low-latency communications (URLLC) and/or with
other types of services is investigated. We consider the broadcast channel,
where the base station sends superimposed signals to multiple users. Under
heterogeneous blockle... | [
{
"created": "Sun, 4 Dec 2022 04:00:19 GMT",
"version": "v1"
},
{
"created": "Tue, 2 May 2023 13:18:50 GMT",
"version": "v2"
}
] | 2023-05-03 | [
[
"Qiu",
"Min",
""
],
[
"Huang",
"Yu-Chih",
""
],
[
"Yuan",
"Jinhong",
""
]
] | The problem of designing downlink transmission schemes for supporting heterogeneous ultra-reliable low-latency communications (URLLC) and/or with other types of services is investigated. We consider the broadcast channel, where the base station sends superimposed signals to multiple users. Under heterogeneous blockleng... |
1807.09751 | Han Xiao | Han Xiao, Yidong Chen, Xiaodong Shi | Multi-Perspective Neural Architecture for Recommendation System | null | null | null | null | cs.IR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Currently, there starts a research trend to leverage neural architecture for
recommendation systems. Though several deep recommender models are proposed,
most methods are too simple to characterize users' complex preference. In this
paper, for a fine-grain analysis, users' ratings are explained from multiple
perspect... | [
{
"created": "Thu, 12 Jul 2018 05:06:39 GMT",
"version": "v1"
}
] | 2018-07-26 | [
[
"Xiao",
"Han",
""
],
[
"Chen",
"Yidong",
""
],
[
"Shi",
"Xiaodong",
""
]
] | Currently, there starts a research trend to leverage neural architecture for recommendation systems. Though several deep recommender models are proposed, most methods are too simple to characterize users' complex preference. In this paper, for a fine-grain analysis, users' ratings are explained from multiple perspectiv... |
1905.09777 | Oded Stein | Oded Stein, Alec Jacobson, Max Wardetzky and Eitan Grinspun | A Smoothness Energy without Boundary Distortion for Curved Surfaces | 17 pages, 18 figures | null | 10.1145/3377406 | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current quadratic smoothness energies for curved surfaces either exhibit
distortions near the boundary due to zero Neumann boundary conditions, or they
do not correctly account for intrinsic curvature, which leads to
unnatural-looking behavior away from the boundary. This leads to an unfortunate
trade-off: one can ei... | [
{
"created": "Thu, 23 May 2019 17:04:31 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Apr 2020 23:08:09 GMT",
"version": "v2"
}
] | 2020-04-29 | [
[
"Stein",
"Oded",
""
],
[
"Jacobson",
"Alec",
""
],
[
"Wardetzky",
"Max",
""
],
[
"Grinspun",
"Eitan",
""
]
] | Current quadratic smoothness energies for curved surfaces either exhibit distortions near the boundary due to zero Neumann boundary conditions, or they do not correctly account for intrinsic curvature, which leads to unnatural-looking behavior away from the boundary. This leads to an unfortunate trade-off: one can eith... |
1811.09961 | Bo Pang | Bo Pang, Kaiwen Zha, Hanwen Cao, Chen Shi, Cewu Lu | Deep RNN Framework for Visual Sequential Applications | 10 pages, 7 figures, CVPR 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extracting temporal and representation features efficiently plays a pivotal
role in understanding visual sequence information. To deal with this, we
propose a new recurrent neural framework that can be stacked deep effectively.
There are mainly two novel designs in our deep RNN framework: one is a new RNN
module call... | [
{
"created": "Sun, 25 Nov 2018 06:34:29 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Nov 2018 08:04:56 GMT",
"version": "v2"
},
{
"created": "Wed, 28 Nov 2018 09:34:28 GMT",
"version": "v3"
},
{
"created": "Fri, 25 Oct 2019 03:55:16 GMT",
"version": "v4"
}
] | 2019-10-28 | [
[
"Pang",
"Bo",
""
],
[
"Zha",
"Kaiwen",
""
],
[
"Cao",
"Hanwen",
""
],
[
"Shi",
"Chen",
""
],
[
"Lu",
"Cewu",
""
]
] | Extracting temporal and representation features efficiently plays a pivotal role in understanding visual sequence information. To deal with this, we propose a new recurrent neural framework that can be stacked deep effectively. There are mainly two novel designs in our deep RNN framework: one is a new RNN module called... |
2309.16882 | Shaoming Xu | Shaoming Xu, Ankush Khandelwal, Arvind Renganathan, Vipin Kumar | Message Propagation Through Time: An Algorithm for Sequence Dependency
Retention in Time Series Modeling | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time series modeling, a crucial area in science, often encounters challenges
when training Machine Learning (ML) models like Recurrent Neural Networks
(RNNs) using the conventional mini-batch training strategy that assumes
independent and identically distributed (IID) samples and initializes RNNs with
zero hidden sta... | [
{
"created": "Thu, 28 Sep 2023 22:38:18 GMT",
"version": "v1"
}
] | 2023-10-02 | [
[
"Xu",
"Shaoming",
""
],
[
"Khandelwal",
"Ankush",
""
],
[
"Renganathan",
"Arvind",
""
],
[
"Kumar",
"Vipin",
""
]
] | Time series modeling, a crucial area in science, often encounters challenges when training Machine Learning (ML) models like Recurrent Neural Networks (RNNs) using the conventional mini-batch training strategy that assumes independent and identically distributed (IID) samples and initializes RNNs with zero hidden state... |
1408.3764 | Loren Schwiebert | Loren Schwiebert, Eyad Hailat, Kamel Rushaidat, Jason Mick, and
Jeffrey Potoff | An Efficient Cell List Implementation for Monte Carlo Simulation on GPUs | 30 pages | null | null | null | cs.DC physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Maximizing the performance potential of the modern day GPU architecture
requires judicious utilization of available parallel resources. Although
dramatic reductions can often be obtained through straightforward mappings,
further performance improvements often require algorithmic redesigns to more
closely exploit the ... | [
{
"created": "Sat, 16 Aug 2014 19:30:37 GMT",
"version": "v1"
}
] | 2014-08-19 | [
[
"Schwiebert",
"Loren",
""
],
[
"Hailat",
"Eyad",
""
],
[
"Rushaidat",
"Kamel",
""
],
[
"Mick",
"Jason",
""
],
[
"Potoff",
"Jeffrey",
""
]
] | Maximizing the performance potential of the modern day GPU architecture requires judicious utilization of available parallel resources. Although dramatic reductions can often be obtained through straightforward mappings, further performance improvements often require algorithmic redesigns to more closely exploit the ta... |
2310.13441 | Guillaume Allais | Guillaume Allais | Seamless, Correct, and Generic Programming over Serialised Data | As submitted to JFP | null | null | null | cs.PL | http://creativecommons.org/licenses/by/4.0/ | In typed functional languages, one can typically only manipulate data in a
type-safe manner if it first has been deserialised into an in-memory tree
represented as a graph of nodes-as-structs and subterms-as-pointers.
We demonstrate how we can use QTT as implemented in \idris{} to define a
small universe of seriali... | [
{
"created": "Fri, 20 Oct 2023 12:09:17 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Apr 2024 16:18:36 GMT",
"version": "v2"
}
] | 2024-04-29 | [
[
"Allais",
"Guillaume",
""
]
] | In typed functional languages, one can typically only manipulate data in a type-safe manner if it first has been deserialised into an in-memory tree represented as a graph of nodes-as-structs and subterms-as-pointers. We demonstrate how we can use QTT as implemented in \idris{} to define a small universe of serialised ... |
1307.4308 | Junichiro Fukuyama | Junichiro Fukuyama | An Alternative Proof of the Exponential Monotone Complexity of the
Clique Function | arXiv admin note: substantial text overlap with arXiv:1305.3218 | null | null | null | cs.CC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In 1985, Razborov discovered a proof that the monotone circuit complexity of
the clique problem is super-polynomial. Alon and Boppana improved the result
into exponential lower bound exp(\Omega(n / \log n)^{1/3})) of a monotone
circuit C to compute cliques of size (1/4) (n / log n)^{2/3}, where n is the
number of ver... | [
{
"created": "Tue, 16 Jul 2013 15:29:16 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Sep 2013 07:36:13 GMT",
"version": "v2"
}
] | 2013-09-10 | [
[
"Fukuyama",
"Junichiro",
""
]
] | In 1985, Razborov discovered a proof that the monotone circuit complexity of the clique problem is super-polynomial. Alon and Boppana improved the result into exponential lower bound exp(\Omega(n / \log n)^{1/3})) of a monotone circuit C to compute cliques of size (1/4) (n / log n)^{2/3}, where n is the number of verti... |
2109.14364 | Keshav Kolluru | Keshav Kolluru, Martin Rezk, Pat Verga, William W. Cohen and Partha
Talukdar | Multilingual Fact Linking | AKBC 2021 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Knowledge-intensive NLP tasks can benefit from linking natural language text
with facts from a Knowledge Graph (KG). Although facts themselves are
language-agnostic, the fact labels (i.e., language-specific representation of
the fact) in the KG are often present only in a few languages. This makes it
challenging to l... | [
{
"created": "Wed, 29 Sep 2021 11:50:44 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Oct 2021 03:58:54 GMT",
"version": "v2"
}
] | 2021-10-04 | [
[
"Kolluru",
"Keshav",
""
],
[
"Rezk",
"Martin",
""
],
[
"Verga",
"Pat",
""
],
[
"Cohen",
"William W.",
""
],
[
"Talukdar",
"Partha",
""
]
] | Knowledge-intensive NLP tasks can benefit from linking natural language text with facts from a Knowledge Graph (KG). Although facts themselves are language-agnostic, the fact labels (i.e., language-specific representation of the fact) in the KG are often present only in a few languages. This makes it challenging to lin... |
1805.11179 | Octavio Narvaez Aroche | Octavio Narvaez-Aroche and Pierre-Jean Meyer and Murat Arcak and
Andrew Packard | Reachability Analysis for Robustness Evaluation of the Sit-To-Stand
Movement for Powered Lower Limb Orthoses | 14 pages, 19 figures, DSCC 2018 Submission | null | 10.1115/DSCC2018-9066 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A sensitivity-based approach for computing over-approximations of reachable
sets, in the presence of constant parameter uncertainties and a single initial
state, is used to analyze a three-link planar robot modeling a Powered Lower
Limb Orthosis and its user. Given the nature of the mappings relating the state
and pa... | [
{
"created": "Mon, 28 May 2018 21:27:04 GMT",
"version": "v1"
}
] | 2020-11-26 | [
[
"Narvaez-Aroche",
"Octavio",
""
],
[
"Meyer",
"Pierre-Jean",
""
],
[
"Arcak",
"Murat",
""
],
[
"Packard",
"Andrew",
""
]
] | A sensitivity-based approach for computing over-approximations of reachable sets, in the presence of constant parameter uncertainties and a single initial state, is used to analyze a three-link planar robot modeling a Powered Lower Limb Orthosis and its user. Given the nature of the mappings relating the state and para... |
1408.2157 | Tobias Christiani | Tobias Christiani and Rasmus Pagh | Generating k-independent variables in constant time | Accepted to The 55th Annual Symposium on Foundations of Computer
Science (FOCS 2014). Copyright IEEE | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The generation of pseudorandom elements over finite fields is fundamental to
the time, space and randomness complexity of randomized algorithms and data
structures. We consider the problem of generating $k$-independent random values
over a finite field $\mathbb{F}$ in a word RAM model equipped with constant
time addi... | [
{
"created": "Sat, 9 Aug 2014 21:42:05 GMT",
"version": "v1"
}
] | 2014-08-12 | [
[
"Christiani",
"Tobias",
""
],
[
"Pagh",
"Rasmus",
""
]
] | The generation of pseudorandom elements over finite fields is fundamental to the time, space and randomness complexity of randomized algorithms and data structures. We consider the problem of generating $k$-independent random values over a finite field $\mathbb{F}$ in a word RAM model equipped with constant time additi... |
2202.01451 | Nikhil Singh | Nikhil Singh and Anupam Saxena | Topology Optimization with Tetra-kai-decahedra and Spheroidal Masks | null | null | null | null | cs.CE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | A novel meshing scheme, based on regular tetra-kai-decahedron, also referred
to as truncated octahedron, cells is presented for use in spatial topology
optimization. A tetra-kai-decahedron mesh ensures face connectivity between
elements thereby eliminating singular solutions from the solution space.
Various other ben... | [
{
"created": "Thu, 3 Feb 2022 08:03:46 GMT",
"version": "v1"
}
] | 2022-02-04 | [
[
"Singh",
"Nikhil",
""
],
[
"Saxena",
"Anupam",
""
]
] | A novel meshing scheme, based on regular tetra-kai-decahedron, also referred to as truncated octahedron, cells is presented for use in spatial topology optimization. A tetra-kai-decahedron mesh ensures face connectivity between elements thereby eliminating singular solutions from the solution space. Various other benef... |
1802.02556 | Huan Li | Huan Li, Richard Peng, Liren Shan, Yuhao Yi, Zhongzhi Zhang | Current Flow Group Closeness Centrality for Complex Networks | 31 pages, 4 figures | WWW'2019 | 10.1145/3308558.3313490 | null | cs.DS cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current flow closeness centrality (CFCC) has a better discriminating ability
than the ordinary closeness centrality based on shortest paths. In this paper,
we extend this notion to a group of vertices in a weighted graph, and then
study the problem of finding a subset $S$ of $k$ vertices to maximize its CFCC
$C(S)$, ... | [
{
"created": "Wed, 7 Feb 2018 18:30:40 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Feb 2018 19:30:05 GMT",
"version": "v2"
}
] | 2019-02-25 | [
[
"Li",
"Huan",
""
],
[
"Peng",
"Richard",
""
],
[
"Shan",
"Liren",
""
],
[
"Yi",
"Yuhao",
""
],
[
"Zhang",
"Zhongzhi",
""
]
] | Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to a group of vertices in a weighted graph, and then study the problem of finding a subset $S$ of $k$ vertices to maximize its CFCC $C(S)$, bo... |
2401.16841 | Eric M\"uller | Eric M\"uller, Moritz Althaus, Elias Arnold, Philipp Spilger,
Christian Pehle, Johannes Schemmel | jaxsnn: Event-driven Gradient Estimation for Analog Neuromorphic
Hardware | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditional neuromorphic hardware architectures rely on event-driven
computation, where the asynchronous transmission of events, such as spikes,
triggers local computations within synapses and neurons. While machine learning
frameworks are commonly used for gradient-based training, their emphasis on
dense data struct... | [
{
"created": "Tue, 30 Jan 2024 09:27:13 GMT",
"version": "v1"
}
] | 2024-01-31 | [
[
"Müller",
"Eric",
""
],
[
"Althaus",
"Moritz",
""
],
[
"Arnold",
"Elias",
""
],
[
"Spilger",
"Philipp",
""
],
[
"Pehle",
"Christian",
""
],
[
"Schemmel",
"Johannes",
""
]
] | Traditional neuromorphic hardware architectures rely on event-driven computation, where the asynchronous transmission of events, such as spikes, triggers local computations within synapses and neurons. While machine learning frameworks are commonly used for gradient-based training, their emphasis on dense data structur... |
2101.11351 | Dario Stein | Dario Stein, Sam Staton | Compositional Semantics for Probabilistic Programs with Exact
Conditioning | 16 pages, 5 figures | null | null | null | cs.PL cs.AI cs.LO math.CT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We define a probabilistic programming language for Gaussian random variables
with a first-class exact conditioning construct. We give operational,
denotational and equational semantics for this language, establishing
convenient properties like exchangeability of conditions. Conditioning on
equality of continuous rand... | [
{
"created": "Wed, 27 Jan 2021 12:31:18 GMT",
"version": "v1"
}
] | 2021-01-28 | [
[
"Stein",
"Dario",
""
],
[
"Staton",
"Sam",
""
]
] | We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational and equational semantics for this language, establishing convenient properties like exchangeability of conditions. Conditioning on equality of continuous random... |
2203.10157 | Jon\'a\v{s} Kulh\'anek | Jon\'a\v{s} Kulh\'anek and Erik Derner and Torsten Sattler and Robert
Babu\v{s}ka | ViewFormer: NeRF-free Neural Rendering from Few Images Using
Transformers | ECCV 2022 poster | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Novel view synthesis is a long-standing problem. In this work, we consider a
variant of the problem where we are given only a few context views sparsely
covering a scene or an object. The goal is to predict novel viewpoints in the
scene, which requires learning priors. The current state of the art is based on
Neural ... | [
{
"created": "Fri, 18 Mar 2022 21:08:23 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Jul 2022 06:03:51 GMT",
"version": "v2"
}
] | 2022-07-22 | [
[
"Kulhánek",
"Jonáš",
""
],
[
"Derner",
"Erik",
""
],
[
"Sattler",
"Torsten",
""
],
[
"Babuška",
"Robert",
""
]
] | Novel view synthesis is a long-standing problem. In this work, we consider a variant of the problem where we are given only a few context views sparsely covering a scene or an object. The goal is to predict novel viewpoints in the scene, which requires learning priors. The current state of the art is based on Neural Ra... |
2102.04897 | Zeyu Zheng | Zeyu Zheng, Vivek Veeriah, Risto Vuorio, Richard Lewis, Satinder Singh | Learning State Representations from Random Deep Action-conditional
Predictions | NeurIPS 2021 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Our main contribution in this work is an empirical finding that random
General Value Functions (GVFs), i.e., deep action-conditional predictions --
random both in what feature of observations they predict as well as in the
sequence of actions the predictions are conditioned upon -- form good auxiliary
tasks for reinf... | [
{
"created": "Tue, 9 Feb 2021 15:53:22 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Nov 2021 18:19:02 GMT",
"version": "v2"
}
] | 2021-11-09 | [
[
"Zheng",
"Zeyu",
""
],
[
"Veeriah",
"Vivek",
""
],
[
"Vuorio",
"Risto",
""
],
[
"Lewis",
"Richard",
""
],
[
"Singh",
"Satinder",
""
]
] | Our main contribution in this work is an empirical finding that random General Value Functions (GVFs), i.e., deep action-conditional predictions -- random both in what feature of observations they predict as well as in the sequence of actions the predictions are conditioned upon -- form good auxiliary tasks for reinfor... |
2311.14678 | Kate Saunders | Kate R. Saunders, Owen Forbes, Jess K. Hopf, Charlotte R. Patterson,
Sarah A. Vollert, Kaitlyn Brown, Raiha Browning, Miguel Canizares, Richard S.
Cottrell, Lanxi Li, Catherine J.S. Kim, Tace P. Stewart, Connie Susilawati,
Xiang Y. Zhao, Kate J. Helmstedt | Data-driven recommendations for enhancing real-time natural hazard
warnings, communication, and response | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The effectiveness and adequacy of natural hazard warnings hinges on the
availability of data and its transformation into actionable knowledge for the
public. Real-time warning communication and emergency response therefore need
to be evaluated from a data science perspective. However, there are currently
gaps between... | [
{
"created": "Wed, 1 Nov 2023 02:59:45 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Saunders",
"Kate R.",
""
],
[
"Forbes",
"Owen",
""
],
[
"Hopf",
"Jess K.",
""
],
[
"Patterson",
"Charlotte R.",
""
],
[
"Vollert",
"Sarah A.",
""
],
[
"Brown",
"Kaitlyn",
""
],
[
"Browning",
"Raiha",
""
... | The effectiveness and adequacy of natural hazard warnings hinges on the availability of data and its transformation into actionable knowledge for the public. Real-time warning communication and emergency response therefore need to be evaluated from a data science perspective. However, there are currently gaps between e... |
2107.13681 | David Doty | Ho-Lin Chen, David Doty, Wyatt Reeves, David Soloveichik | Rate-Independent Computation in Continuous Chemical Reaction Networks | accepted to JACM (https://doi.org/10.1145/3590776); preliminary
version appeared in ITCS 2014: http://doi.org/10.1145/2554797.2554827 | null | 10.1145/3590776 | null | cs.ET q-bio.MN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Coupled chemical interactions in a well-mixed solution are commonly
formalized as chemical reaction networks (CRNs). However, despite the
widespread use of CRNs in the natural sciences, the range of computational
behaviors exhibited by CRNs is not well understood. Here we study the following
problem: what functions $... | [
{
"created": "Thu, 29 Jul 2021 00:37:07 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Oct 2022 16:57:27 GMT",
"version": "v2"
},
{
"created": "Fri, 7 Apr 2023 21:30:44 GMT",
"version": "v3"
}
] | 2023-04-11 | [
[
"Chen",
"Ho-Lin",
""
],
[
"Doty",
"David",
""
],
[
"Reeves",
"Wyatt",
""
],
[
"Soloveichik",
"David",
""
]
] | Coupled chemical interactions in a well-mixed solution are commonly formalized as chemical reaction networks (CRNs). However, despite the widespread use of CRNs in the natural sciences, the range of computational behaviors exhibited by CRNs is not well understood. Here we study the following problem: what functions $f:... |
1611.03056 | Amr Abed | Amr S. Abed, Charles Clancy, David S. Levy | Intrusion Detection System for Applications using Linux Containers | The final publication is available at
http://link.springer.com/chapter/10.1007%2F978-3-319-24858-5_8. arXiv admin
note: substantial text overlap with arXiv:1611.03053 | STM 2015. LNCS, vol. 9331, pp. 123-135. Springer, Heidelberg
(2015) | 10.1007/978-3-319-24858-5_8 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Linux containers are gaining increasing traction in both individual and
industrial use, and as these containers get integrated into mission-critical
systems, real-time detection of malicious cyber attacks becomes a critical
operational requirement. This paper introduces a real-time host-based intrusion
detection syst... | [
{
"created": "Wed, 9 Nov 2016 19:37:55 GMT",
"version": "v1"
}
] | 2017-01-05 | [
[
"Abed",
"Amr S.",
""
],
[
"Clancy",
"Charles",
""
],
[
"Levy",
"David S.",
""
]
] | Linux containers are gaining increasing traction in both individual and industrial use, and as these containers get integrated into mission-critical systems, real-time detection of malicious cyber attacks becomes a critical operational requirement. This paper introduces a real-time host-based intrusion detection system... |
2106.12307 | Mats Richter | Mats L. Richter, Julius Sch\"oning, Anna Wiedenroth, Ulf Krumnack | Should You Go Deeper? Optimizing Convolutional Neural Network
Architectures without Training by Receptive Field Analysis | Preprint | null | 10.1109/ICMLA52953.2021.00159 | null | cs.LG cs.AI cs.NE stat.ML | http://creativecommons.org/licenses/by/4.0/ | When optimizing convolutional neural networks (CNN) for a specific
image-based task, specialists commonly overshoot the number of convolutional
layers in their designs. By implication, these CNNs are unnecessarily resource
intensive to train and deploy, with diminishing beneficial effects on the
predictive performanc... | [
{
"created": "Wed, 23 Jun 2021 11:04:16 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Oct 2021 19:19:25 GMT",
"version": "v2"
}
] | 2022-06-23 | [
[
"Richter",
"Mats L.",
""
],
[
"Schöning",
"Julius",
""
],
[
"Wiedenroth",
"Anna",
""
],
[
"Krumnack",
"Ulf",
""
]
] | When optimizing convolutional neural networks (CNN) for a specific image-based task, specialists commonly overshoot the number of convolutional layers in their designs. By implication, these CNNs are unnecessarily resource intensive to train and deploy, with diminishing beneficial effects on the predictive performance.... |
2205.12471 | Kun Qian | Yukun Huang, Kun Qian, Zhou Yu | Learning a Better Initialization for Soft Prompts via Meta-Learning | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Prompt tuning (PT) is an effective approach to adapting pre-trained language
models to downstream tasks. Without a good initialization, prompt tuning
doesn't perform well under few-shot settings. So pre-trained prompt tuning
(PPT) is proposed to initialize prompts by leveraging pre-training data. We
propose MetaPT (M... | [
{
"created": "Wed, 25 May 2022 03:50:23 GMT",
"version": "v1"
}
] | 2022-05-26 | [
[
"Huang",
"Yukun",
""
],
[
"Qian",
"Kun",
""
],
[
"Yu",
"Zhou",
""
]
] | Prompt tuning (PT) is an effective approach to adapting pre-trained language models to downstream tasks. Without a good initialization, prompt tuning doesn't perform well under few-shot settings. So pre-trained prompt tuning (PPT) is proposed to initialize prompts by leveraging pre-training data. We propose MetaPT (Met... |
1503.07903 | Safia Haloui | Safia Haloui | Codes from Jacobian surfaces | null | null | null | null | cs.IT math.AG math.IT math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is concerned with some Algebraic Geometry codes on Jacobians of
genus 2 curves. We derive a lower bound for the minimum distance of these codes
from an upper "Weil type" bound for the number of rational points on
irreducible (possibly singular or non-absolutely irreducible) curves lying on
an abelian surfa... | [
{
"created": "Thu, 26 Mar 2015 21:12:08 GMT",
"version": "v1"
}
] | 2015-03-30 | [
[
"Haloui",
"Safia",
""
]
] | This paper is concerned with some Algebraic Geometry codes on Jacobians of genus 2 curves. We derive a lower bound for the minimum distance of these codes from an upper "Weil type" bound for the number of rational points on irreducible (possibly singular or non-absolutely irreducible) curves lying on an abelian surface... |
2212.04638 | Aoyang Liu | Yansong Tang, Jinpeng Liu, Aoyang Liu, Bin Yang, Wenxun Dai, Yongming
Rao, Jiwen Lu, Jie Zhou, Xiu Li | FLAG3D: A 3D Fitness Activity Dataset with Language Instruction | Accepted to CVPR2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the continuously thriving popularity around the world, fitness activity
analytic has become an emerging research topic in computer vision. While a
variety of new tasks and algorithms have been proposed recently, there are
growing hunger for data resources involved in high-quality data, fine-grained
labels, and d... | [
{
"created": "Fri, 9 Dec 2022 02:33:33 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Apr 2023 13:31:03 GMT",
"version": "v2"
}
] | 2023-04-20 | [
[
"Tang",
"Yansong",
""
],
[
"Liu",
"Jinpeng",
""
],
[
"Liu",
"Aoyang",
""
],
[
"Yang",
"Bin",
""
],
[
"Dai",
"Wenxun",
""
],
[
"Rao",
"Yongming",
""
],
[
"Lu",
"Jiwen",
""
],
[
"Zhou",
"Jie",
... | With the continuously thriving popularity around the world, fitness activity analytic has become an emerging research topic in computer vision. While a variety of new tasks and algorithms have been proposed recently, there are growing hunger for data resources involved in high-quality data, fine-grained labels, and div... |
1607.01838 | Chengcheng Wang | Chengcheng Wang, Yonggang Zhang, Bicheng Ying, and Ali H. Sayed | Coordinate-Descent Diffusion Learning by Networked Agents | Accepted for publication | null | 10.1109/TSP.2017.2757903 | null | cs.MA cs.DC cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work examines the mean-square error performance of diffusion stochastic
algorithms under a generalized coordinate-descent scheme. In this setting, the
adaptation step by each agent is limited to a random subset of the coordinates
of its stochastic gradient vector. The selection of coordinates varies randomly
fro... | [
{
"created": "Wed, 6 Jul 2016 23:18:04 GMT",
"version": "v1"
},
{
"created": "Wed, 11 Oct 2017 01:38:44 GMT",
"version": "v2"
}
] | 2017-10-12 | [
[
"Wang",
"Chengcheng",
""
],
[
"Zhang",
"Yonggang",
""
],
[
"Ying",
"Bicheng",
""
],
[
"Sayed",
"Ali H.",
""
]
] | This work examines the mean-square error performance of diffusion stochastic algorithms under a generalized coordinate-descent scheme. In this setting, the adaptation step by each agent is limited to a random subset of the coordinates of its stochastic gradient vector. The selection of coordinates varies randomly from ... |
2312.13295 | Christoph Gadermaier | Markus Kloimwieder, Christoph Gadermaier | A functional scripting interface to an object oriented C++ library | 10 pages, code highlighted in color | null | null | null | cs.PL | http://creativecommons.org/licenses/by/4.0/ | The object oriented programming paradigm is widely used in science and
engineering. Many open and commercial libraries are written in C++ and
increasingly provide bindings to Python, which is much easier to learn, but
still partly encourages the use of object oriented programming. However,
scientific ideas are much m... | [
{
"created": "Sun, 17 Dec 2023 12:18:26 GMT",
"version": "v1"
}
] | 2023-12-22 | [
[
"Kloimwieder",
"Markus",
""
],
[
"Gadermaier",
"Christoph",
""
]
] | The object oriented programming paradigm is widely used in science and engineering. Many open and commercial libraries are written in C++ and increasingly provide bindings to Python, which is much easier to learn, but still partly encourages the use of object oriented programming. However, scientific ideas are much mor... |
2108.01330 | Dalia Papuc | M.K. Aguilera, N. Ben-David, R. Guerraoui, D. Papuc, A. Xygkis, I.
Zablotchi | Frugal Byzantine Computing | This paper is an extended version of the DISC 2021 paper | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditional techniques for handling Byzantine failures are expensive: digital
signatures are too costly, while using $3f{+}1$ replicas is uneconomical ($f$
denotes the maximum number of Byzantine processes). We seek algorithms that
reduce the number of replicas to $2f{+}1$ and minimize the number of
signatures. While... | [
{
"created": "Tue, 3 Aug 2021 07:14:31 GMT",
"version": "v1"
}
] | 2021-08-04 | [
[
"Aguilera",
"M. K.",
""
],
[
"Ben-David",
"N.",
""
],
[
"Guerraoui",
"R.",
""
],
[
"Papuc",
"D.",
""
],
[
"Xygkis",
"A.",
""
],
[
"Zablotchi",
"I.",
""
]
] | Traditional techniques for handling Byzantine failures are expensive: digital signatures are too costly, while using $3f{+}1$ replicas is uneconomical ($f$ denotes the maximum number of Byzantine processes). We seek algorithms that reduce the number of replicas to $2f{+}1$ and minimize the number of signatures. While t... |
2203.06457 | MInsoo Lee | Minsoo Lee, Chaeyeon Chung, Hojun Cho, Minjung Kim, Sanghun Jung,
Jaegul Choo, and Minhyuk Sung | 3D-GIF: 3D-Controllable Object Generation via Implicit Factorized
Representations | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | While NeRF-based 3D-aware image generation methods enable viewpoint control,
limitations still remain to be adopted to various 3D applications. Due to their
view-dependent and light-entangled volume representation, the 3D geometry
presents unrealistic quality and the color should be re-rendered for every
desired view... | [
{
"created": "Sat, 12 Mar 2022 15:23:17 GMT",
"version": "v1"
}
] | 2022-03-15 | [
[
"Lee",
"Minsoo",
""
],
[
"Chung",
"Chaeyeon",
""
],
[
"Cho",
"Hojun",
""
],
[
"Kim",
"Minjung",
""
],
[
"Jung",
"Sanghun",
""
],
[
"Choo",
"Jaegul",
""
],
[
"Sung",
"Minhyuk",
""
]
] | While NeRF-based 3D-aware image generation methods enable viewpoint control, limitations still remain to be adopted to various 3D applications. Due to their view-dependent and light-entangled volume representation, the 3D geometry presents unrealistic quality and the color should be re-rendered for every desired viewpo... |
2309.16269 | Youbin Jeon | Youbin Jeon and Sangheon Pack | Hierarchical Network Data Analytics Framework for B5G Network
Automation: Design and Implementation | 7 pages | null | null | null | cs.NI cs.LG cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 5G introduced modularized network functions (NFs) to support emerging
services in a more flexible and elastic manner. To mitigate the complexity in
such modularized NF management, automated network operation and management are
indispensable, and thus the 3rd generation partnership project (3GPP) has
introduced a netw... | [
{
"created": "Thu, 28 Sep 2023 09:04:58 GMT",
"version": "v1"
}
] | 2023-09-29 | [
[
"Jeon",
"Youbin",
""
],
[
"Pack",
"Sangheon",
""
]
] | 5G introduced modularized network functions (NFs) to support emerging services in a more flexible and elastic manner. To mitigate the complexity in such modularized NF management, automated network operation and management are indispensable, and thus the 3rd generation partnership project (3GPP) has introduced a networ... |
1912.13490 | Giovanni Granato G | Giovanni Granato and Gianluca Baldassarre | A Neurocomputational Account of Flexible Goal-directed Cognition and
Consciousness: The Goal-Aligning Representation Internal Manipulation Theory
(GARIM) | null | null | null | null | cs.AI cs.LG cs.NE q-bio.NC stat.ML | http://creativecommons.org/licenses/by/4.0/ | Goal-directed manipulation of representations is a key element of human
flexible behaviour, while consciousness is often related to several aspects of
higher-order cognition and human flexibility. Currently these two phenomena are
only partially integrated (e.g., see Neurorepresentationalism) and this (a)
limits our ... | [
{
"created": "Tue, 31 Dec 2019 18:45:33 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Dec 2022 14:37:15 GMT",
"version": "v2"
},
{
"created": "Wed, 25 Oct 2023 07:56:24 GMT",
"version": "v3"
},
{
"created": "Fri, 27 Oct 2023 12:08:01 GMT",
"version": "v4"
}
] | 2023-10-30 | [
[
"Granato",
"Giovanni",
""
],
[
"Baldassarre",
"Gianluca",
""
]
] | Goal-directed manipulation of representations is a key element of human flexible behaviour, while consciousness is often related to several aspects of higher-order cognition and human flexibility. Currently these two phenomena are only partially integrated (e.g., see Neurorepresentationalism) and this (a) limits our un... |
2209.05274 | Quan Zhou | Quan Zhou, Jakub Marecek, Robert N. Shorten | Fairness in Forecasting of Observations of Linear Dynamical Systems | Journal version of Zhou et al. [arXiv:2006.07315, AAAI 2021] | Journal of Artificial Intelligence Research, Volume 76, 2023 | 10.1613/jair.1.14050 | null | cs.LG cs.SY eess.SY math.DS math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In machine learning, training data often capture the behaviour of multiple
subgroups of some underlying human population. This behaviour can often be
modelled as observations of an unknown dynamical system with an unobserved
state. When the training data for the subgroups are not controlled carefully,
however, under-... | [
{
"created": "Mon, 12 Sep 2022 14:32:12 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Sep 2022 12:14:51 GMT",
"version": "v2"
},
{
"created": "Wed, 8 Mar 2023 23:14:14 GMT",
"version": "v3"
},
{
"created": "Mon, 15 May 2023 20:13:53 GMT",
"version": "v4"
}
] | 2023-05-17 | [
[
"Zhou",
"Quan",
""
],
[
"Marecek",
"Jakub",
""
],
[
"Shorten",
"Robert N.",
""
]
] | In machine learning, training data often capture the behaviour of multiple subgroups of some underlying human population. This behaviour can often be modelled as observations of an unknown dynamical system with an unobserved state. When the training data for the subgroups are not controlled carefully, however, under-re... |
2210.08901 | Xuran Pan | Xuran Pan, Tianzhu Ye, Dongchen Han, Shiji Song, Gao Huang | Contrastive Language-Image Pre-Training with Knowledge Graphs | Accepted by NeurIPS2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have witnessed the fast development of large-scale pre-training
frameworks that can extract multi-modal representations in a unified form and
achieve promising performances when transferred to downstream tasks.
Nevertheless, existing approaches mainly focus on pre-training with simple
image-text pairs, w... | [
{
"created": "Mon, 17 Oct 2022 09:49:22 GMT",
"version": "v1"
}
] | 2022-10-18 | [
[
"Pan",
"Xuran",
""
],
[
"Ye",
"Tianzhu",
""
],
[
"Han",
"Dongchen",
""
],
[
"Song",
"Shiji",
""
],
[
"Huang",
"Gao",
""
]
] | Recent years have witnessed the fast development of large-scale pre-training frameworks that can extract multi-modal representations in a unified form and achieve promising performances when transferred to downstream tasks. Nevertheless, existing approaches mainly focus on pre-training with simple image-text pairs, whi... |
1904.12936 | Amirreza Shaban | Amirreza Shaban, Amir Rahimi, Shray Bansal, Stephen Gould, Byron
Boots, Richard Hartley | Learning to Find Common Objects Across Few Image Collections | ICCV 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a collection of bags where each bag is a set of images, our goal is to
select one image from each bag such that the selected images are from the same
object class. We model the selection as an energy minimization problem with
unary and pairwise potential functions. Inspired by recent few-shot learning
algorithm... | [
{
"created": "Mon, 29 Apr 2019 20:26:40 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Aug 2019 01:08:21 GMT",
"version": "v2"
}
] | 2019-08-20 | [
[
"Shaban",
"Amirreza",
""
],
[
"Rahimi",
"Amir",
""
],
[
"Bansal",
"Shray",
""
],
[
"Gould",
"Stephen",
""
],
[
"Boots",
"Byron",
""
],
[
"Hartley",
"Richard",
""
]
] | Given a collection of bags where each bag is a set of images, our goal is to select one image from each bag such that the selected images are from the same object class. We model the selection as an energy minimization problem with unary and pairwise potential functions. Inspired by recent few-shot learning algorithms,... |
2212.07998 | Dimitri Bertsekas | Dimitri Bertsekas | Rollout Algorithms and Approximate Dynamic Programming for Bayesian
Optimization and Sequential Estimation | null | null | null | null | cs.AI cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | We provide a unifying approximate dynamic programming framework that applies
to a broad variety of problems involving sequential estimation. We consider
first the construction of surrogate cost functions for the purposes of
optimization, and we focus on the special case of Bayesian optimization, using
the rollout alg... | [
{
"created": "Thu, 15 Dec 2022 17:50:23 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Dec 2022 14:19:03 GMT",
"version": "v2"
},
{
"created": "Thu, 29 Dec 2022 05:13:39 GMT",
"version": "v3"
}
] | 2023-01-02 | [
[
"Bertsekas",
"Dimitri",
""
]
] | We provide a unifying approximate dynamic programming framework that applies to a broad variety of problems involving sequential estimation. We consider first the construction of surrogate cost functions for the purposes of optimization, and we focus on the special case of Bayesian optimization, using the rollout algor... |
1803.09492 | Jussi Hanhirova | Jussi Hanhirova, Teemu K\"am\"ar\"ainen, Sipi Sepp\"al\"a, Matti
Siekkinen, Vesa Hirvisalo, Antti Yl\"a-J\"a\"aski | Latency and Throughput Characterization of Convolutional Neural Networks
for Mobile Computer Vision | 13 pages, 18 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study performance characteristics of convolutional neural networks (CNN)
for mobile computer vision systems. CNNs have proven to be a powerful and
efficient approach to implement such systems. However, the system performance
depends largely on the utilization of hardware accelerators, which are able to
speed up th... | [
{
"created": "Mon, 26 Mar 2018 09:49:03 GMT",
"version": "v1"
}
] | 2018-03-28 | [
[
"Hanhirova",
"Jussi",
""
],
[
"Kämäräinen",
"Teemu",
""
],
[
"Seppälä",
"Sipi",
""
],
[
"Siekkinen",
"Matti",
""
],
[
"Hirvisalo",
"Vesa",
""
],
[
"Ylä-Jääski",
"Antti",
""
]
] | We study performance characteristics of convolutional neural networks (CNN) for mobile computer vision systems. CNNs have proven to be a powerful and efficient approach to implement such systems. However, the system performance depends largely on the utilization of hardware accelerators, which are able to speed up the ... |
2110.11579 | Ziv Scully | Ziv Scully, Mor Harchol-Balter | How to Schedule Near-Optimally under Real-World Constraints | null | null | null | null | cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scheduling is a critical part of practical computer systems, and scheduling
has also been extensively studied from a theoretical perspective.
Unfortunately, there is a gap between theory and practice, as the optimal
scheduling policies presented by theory can be difficult or impossible to
perfectly implement in pract... | [
{
"created": "Fri, 22 Oct 2021 04:15:19 GMT",
"version": "v1"
}
] | 2021-10-25 | [
[
"Scully",
"Ziv",
""
],
[
"Harchol-Balter",
"Mor",
""
]
] | Scheduling is a critical part of practical computer systems, and scheduling has also been extensively studied from a theoretical perspective. Unfortunately, there is a gap between theory and practice, as the optimal scheduling policies presented by theory can be difficult or impossible to perfectly implement in practic... |
1809.02910 | Tsang-Kai Chang | Tsang-Kai Chang, Shengkang Chen, and Ankur Mehta | Localization Algorithm with Circular Representation in 2D and its
Similarity to Mammalian Brains | 8 pages, 2 figures, submitted to the IEEE Robotics and Automation
Letters (RA-L) journal with the option for presentation at RSS | null | null | null | cs.RO q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extended Kalman filter (EKF) does not guarantee consistent mean and
covariance under linearization, even though it is the main framework for
robotic localization. While Lie group improves the modeling of the state space
in localization, the EKF on Lie group still relies on the arbitrary Gaussian
assumption in face of... | [
{
"created": "Sun, 9 Sep 2018 01:54:21 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Jan 2019 03:56:57 GMT",
"version": "v2"
}
] | 2019-01-28 | [
[
"Chang",
"Tsang-Kai",
""
],
[
"Chen",
"Shengkang",
""
],
[
"Mehta",
"Ankur",
""
]
] | Extended Kalman filter (EKF) does not guarantee consistent mean and covariance under linearization, even though it is the main framework for robotic localization. While Lie group improves the modeling of the state space in localization, the EKF on Lie group still relies on the arbitrary Gaussian assumption in face of n... |
0805.2854 | Feng Xia | Feng Xia, Longhua Ma, Jinxiang Dong and Youxian Sun | Network QoS Management in Cyber-Physical Systems | To appear in The 2008 Int.Conf. on Embedded Software and Systems
(ICESS), Chengdu, China, July 2008 | null | null | null | cs.NI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Technical advances in ubiquitous sensing, embedded computing, and wireless
communication are leading to a new generation of engineered systems called
cyber-physical systems (CPS). CPS promises to transform the way we interact
with the physical world just as the Internet transformed how we interact with
one another. B... | [
{
"created": "Mon, 19 May 2008 12:49:11 GMT",
"version": "v1"
}
] | 2008-12-18 | [
[
"Xia",
"Feng",
""
],
[
"Ma",
"Longhua",
""
],
[
"Dong",
"Jinxiang",
""
],
[
"Sun",
"Youxian",
""
]
] | Technical advances in ubiquitous sensing, embedded computing, and wireless communication are leading to a new generation of engineered systems called cyber-physical systems (CPS). CPS promises to transform the way we interact with the physical world just as the Internet transformed how we interact with one another. Bef... |
2004.13181 | Sheldon Tan | Wentian Jin, Sheriff Sadiqbatcha, Jinwei Zhang, Sheldon X.-D. Tan | EM-GAN: Fast Stress Analysis for Multi-Segment Interconnect Using
Generative Adversarial Networks | null | null | null | null | cs.LG cs.NE eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a fast transient hydrostatic stress analysis for
electromigration (EM) failure assessment for multi-segment interconnects using
generative adversarial networks (GANs). Our work leverages the image synthesis
feature of GAN-based generative deep neural networks. The stress evaluation of
multi-... | [
{
"created": "Mon, 27 Apr 2020 21:18:11 GMT",
"version": "v1"
}
] | 2020-04-29 | [
[
"Jin",
"Wentian",
""
],
[
"Sadiqbatcha",
"Sheriff",
""
],
[
"Zhang",
"Jinwei",
""
],
[
"Tan",
"Sheldon X. -D.",
""
]
] | In this paper, we propose a fast transient hydrostatic stress analysis for electromigration (EM) failure assessment for multi-segment interconnects using generative adversarial networks (GANs). Our work leverages the image synthesis feature of GAN-based generative deep neural networks. The stress evaluation of multi-se... |
2009.11796 | Neha Kaushik | Niladri Chatterjee, Neha Kaushik | Automatic Extraction of Agriculture Terms from Domain Text: A Survey of
Tools and Techniques | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Agriculture is a key component in any country's development. Domain-specific
knowledge resources serve to gain insight into the domain. Existing knowledge
resources such as AGROVOC and NAL Thesaurus are developed and maintained by the
domain experts. Population of terms into these knowledge resources can be
automated... | [
{
"created": "Thu, 24 Sep 2020 16:38:44 GMT",
"version": "v1"
}
] | 2020-09-25 | [
[
"Chatterjee",
"Niladri",
""
],
[
"Kaushik",
"Neha",
""
]
] | Agriculture is a key component in any country's development. Domain-specific knowledge resources serve to gain insight into the domain. Existing knowledge resources such as AGROVOC and NAL Thesaurus are developed and maintained by the domain experts. Population of terms into these knowledge resources can be automated b... |
2402.13545 | Guandong Li | Guandong Li, Xian Yang, Wenpin Ma | A Two-Stage Dual-Path Framework for Text Tampering Detection and
Recognition | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Document tamper detection has always been an important aspect of tamper
detection. Before the advent of deep learning, document tamper detection was
difficult. We have made some explorations in the field of text tamper detection
based on deep learning. Our Ps tamper detection method includes three steps:
feature assi... | [
{
"created": "Wed, 21 Feb 2024 05:54:42 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Feb 2024 02:12:19 GMT",
"version": "v2"
}
] | 2024-02-23 | [
[
"Li",
"Guandong",
""
],
[
"Yang",
"Xian",
""
],
[
"Ma",
"Wenpin",
""
]
] | Document tamper detection has always been an important aspect of tamper detection. Before the advent of deep learning, document tamper detection was difficult. We have made some explorations in the field of text tamper detection based on deep learning. Our Ps tamper detection method includes three steps: feature assist... |
2308.08451 | Shenghui Cheng | Xiangyu Li, Yuqing Fan, Shenghui Cheng | AIGC In China: Current Developments And Future Outlook | null | null | null | null | cs.AI cs.CY | http://creativecommons.org/licenses/by/4.0/ | The increasing attention given to AI Generated Content (AIGC) has brought a
profound impact on various aspects of daily life, industrial manufacturing, and
the academic sector. Recognizing the global trends and competitiveness in AIGC
development, this study aims to analyze China's current status in the field.
The in... | [
{
"created": "Mon, 14 Aug 2023 13:55:38 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Aug 2023 07:23:13 GMT",
"version": "v2"
}
] | 2023-08-22 | [
[
"Li",
"Xiangyu",
""
],
[
"Fan",
"Yuqing",
""
],
[
"Cheng",
"Shenghui",
""
]
] | The increasing attention given to AI Generated Content (AIGC) has brought a profound impact on various aspects of daily life, industrial manufacturing, and the academic sector. Recognizing the global trends and competitiveness in AIGC development, this study aims to analyze China's current status in the field. The inve... |
2403.13667 | Zixuan Wang | Zixuan Wang, Jia Jia, Shikun Sun, Haozhe Wu, Rong Han, Zhenyu Li, Di
Tang, Jiaqing Zhou, Jiebo Luo | DanceCamera3D: 3D Camera Movement Synthesis with Music and Dance | Accept to CVPR 2024 | null | null | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Choreographers determine what the dances look like, while cameramen determine
the final presentation of dances. Recently, various methods and datasets have
showcased the feasibility of dance synthesis. However, camera movement
synthesis with music and dance remains an unsolved challenging problem due to
the scarcity ... | [
{
"created": "Wed, 20 Mar 2024 15:24:57 GMT",
"version": "v1"
}
] | 2024-03-21 | [
[
"Wang",
"Zixuan",
""
],
[
"Jia",
"Jia",
""
],
[
"Sun",
"Shikun",
""
],
[
"Wu",
"Haozhe",
""
],
[
"Han",
"Rong",
""
],
[
"Li",
"Zhenyu",
""
],
[
"Tang",
"Di",
""
],
[
"Zhou",
"Jiaqing",
""
... | Choreographers determine what the dances look like, while cameramen determine the final presentation of dances. Recently, various methods and datasets have showcased the feasibility of dance synthesis. However, camera movement synthesis with music and dance remains an unsolved challenging problem due to the scarcity of... |
2110.02453 | Lin Zheng | Lin Zheng, Huijie Pan, Lingpeng Kong | Ripple Attention for Visual Perception with Sub-quadratic Complexity | 19 pages, 2 figures, ICML 2022 camera ready | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformer architectures are now central to sequence modeling tasks. At its
heart is the attention mechanism, which enables effective modeling of long-term
dependencies in a sequence. Recently, transformers have been successfully
applied in the computer vision domain, where 2D images are first segmented into
patches... | [
{
"created": "Wed, 6 Oct 2021 02:00:38 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Jun 2022 13:59:31 GMT",
"version": "v2"
}
] | 2022-06-16 | [
[
"Zheng",
"Lin",
""
],
[
"Pan",
"Huijie",
""
],
[
"Kong",
"Lingpeng",
""
]
] | Transformer architectures are now central to sequence modeling tasks. At its heart is the attention mechanism, which enables effective modeling of long-term dependencies in a sequence. Recently, transformers have been successfully applied in the computer vision domain, where 2D images are first segmented into patches a... |
2407.13214 | Lu Gan | Lu Gan and Xi Li | TXL-PBC: a freely accessible labeled peripheral blood cell dataset | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a recent study, we found that publicly BCCD and BCD datasets have
significant issues such as labeling errors, insufficient sample size, and poor
data quality. To address these problems, we performed sample deletion,
re-labeling, and integration of these two datasets. Additionally, we introduced
the PBC and Raabin-... | [
{
"created": "Thu, 18 Jul 2024 06:54:49 GMT",
"version": "v1"
}
] | 2024-07-19 | [
[
"Gan",
"Lu",
""
],
[
"Li",
"Xi",
""
]
] | In a recent study, we found that publicly BCCD and BCD datasets have significant issues such as labeling errors, insufficient sample size, and poor data quality. To address these problems, we performed sample deletion, re-labeling, and integration of these two datasets. Additionally, we introduced the PBC and Raabin-WB... |
2310.19990 | Ankur Nath | Ankur Nath, Alan Kuhnle | Unveiling the Limits of Learned Local Search Heuristics: Are You the
Mightiest of the Meek? | null | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | In recent years, combining neural networks with local search heuristics has
become popular in the field of combinatorial optimization. Despite its
considerable computational demands, this approach has exhibited promising
outcomes with minimal manual engineering. However, we have identified three
critical limitations ... | [
{
"created": "Mon, 30 Oct 2023 20:16:42 GMT",
"version": "v1"
}
] | 2023-11-01 | [
[
"Nath",
"Ankur",
""
],
[
"Kuhnle",
"Alan",
""
]
] | In recent years, combining neural networks with local search heuristics has become popular in the field of combinatorial optimization. Despite its considerable computational demands, this approach has exhibited promising outcomes with minimal manual engineering. However, we have identified three critical limitations in... |
2105.07157 | Yuyang Wei | Yuyang Wei, Yijun Yu, Minxue Pan, Tian Zhang | A Feature Table approach to decomposing monolithic applications into
microservices | null | null | 10.1145/3457913.3457939 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Microservice architecture refers to the use of numerous small-scale and
independently deployed services, instead of encapsulating all functions into
one monolith. It has been a challenge in software engineering to decompose a
monolithic system into smaller parts. In this paper, we propose the Feature
Table approach, ... | [
{
"created": "Sat, 15 May 2021 07:08:30 GMT",
"version": "v1"
}
] | 2021-05-18 | [
[
"Wei",
"Yuyang",
""
],
[
"Yu",
"Yijun",
""
],
[
"Pan",
"Minxue",
""
],
[
"Zhang",
"Tian",
""
]
] | Microservice architecture refers to the use of numerous small-scale and independently deployed services, instead of encapsulating all functions into one monolith. It has been a challenge in software engineering to decompose a monolithic system into smaller parts. In this paper, we propose the Feature Table approach, a ... |
2109.14286 | Maximilian Hils | Maximilian Hils, Daniel W. Woods, Rainer B\"ohme | Conflicting Privacy Preference Signals in the Wild | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Privacy preference signals allow users to express preferences over how their
personal data is processed. These signals become important in determining
privacy outcomes when they reference an enforceable legal basis, as is the case
with recent signals such as the Global Privacy Control and the Transparency &
Consent F... | [
{
"created": "Wed, 29 Sep 2021 09:10:47 GMT",
"version": "v1"
}
] | 2021-09-30 | [
[
"Hils",
"Maximilian",
""
],
[
"Woods",
"Daniel W.",
""
],
[
"Böhme",
"Rainer",
""
]
] | Privacy preference signals allow users to express preferences over how their personal data is processed. These signals become important in determining privacy outcomes when they reference an enforceable legal basis, as is the case with recent signals such as the Global Privacy Control and the Transparency & Consent Fra... |
2110.15525 | Bin Wang | Kaitai Zhang, Bin Wang, C.-C. Jay Kuo | PEDENet: Image Anomaly Localization via Patch Embedding and Density
Estimation | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A neural network targeting at unsupervised image anomaly localization, called
the PEDENet, is proposed in this work. PEDENet contains a patch embedding (PE)
network, a density estimation (DE) network, and an auxiliary network called the
location prediction (LP) network. The PE network takes local image patches as
inp... | [
{
"created": "Fri, 29 Oct 2021 03:52:56 GMT",
"version": "v1"
}
] | 2021-11-01 | [
[
"Zhang",
"Kaitai",
""
],
[
"Wang",
"Bin",
""
],
[
"Kuo",
"C. -C. Jay",
""
]
] | A neural network targeting at unsupervised image anomaly localization, called the PEDENet, is proposed in this work. PEDENet contains a patch embedding (PE) network, a density estimation (DE) network, and an auxiliary network called the location prediction (LP) network. The PE network takes local image patches as input... |
2010.00796 | Chenguang Zhu | Donghan Yu, Chenguang Zhu, Yiming Yang, Michael Zeng | JAKET: Joint Pre-training of Knowledge Graph and Language Understanding | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge graphs (KGs) contain rich information about world knowledge,
entities and relations. Thus, they can be great supplements to existing
pre-trained language models. However, it remains a challenge to efficiently
integrate information from KG into language modeling. And the understanding of
a knowledge graph re... | [
{
"created": "Fri, 2 Oct 2020 05:53:36 GMT",
"version": "v1"
}
] | 2020-10-05 | [
[
"Yu",
"Donghan",
""
],
[
"Zhu",
"Chenguang",
""
],
[
"Yang",
"Yiming",
""
],
[
"Zeng",
"Michael",
""
]
] | Knowledge graphs (KGs) contain rich information about world knowledge, entities and relations. Thus, they can be great supplements to existing pre-trained language models. However, it remains a challenge to efficiently integrate information from KG into language modeling. And the understanding of a knowledge graph requ... |
1504.03880 | Martin Zimmermann | Peter Faymonville and Martin Zimmermann | Parametric Linear Dynamic Logic (full version) | Accepted for publication at Information and Computation. A
preliminary version of this work appeared in GandALF 2014 (arXiv:1408.5957) | null | null | null | cs.LO cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear
Dynamic Logic (LDL) by temporal operators equipped with parameters that bound
their scope. LDL itself was proposed as an extension of Linear Temporal Logic
(LTL) that is able to express all omega-regular specifications while still
maintaining m... | [
{
"created": "Wed, 15 Apr 2015 12:19:52 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Dec 2015 14:57:53 GMT",
"version": "v2"
}
] | 2015-12-08 | [
[
"Faymonville",
"Peter",
""
],
[
"Zimmermann",
"Martin",
""
]
] | We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL itself was proposed as an extension of Linear Temporal Logic (LTL) that is able to express all omega-regular specifications while still maintaining man... |
2310.00840 | Tianjian Li | Tianjian Li, Haoran Xu, Philipp Koehn, Daniel Khashabi, Kenton Murray | Error Norm Truncation: Robust Training in the Presence of Data Noise for
Text Generation Models | ICLR 2024 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Text generation models are notoriously vulnerable to errors in the training
data. With the wide-spread availability of massive amounts of web-crawled data
becoming more commonplace, how can we enhance the robustness of models trained
on a massive amount of noisy web-crawled text? In our work, we propose Error
Norm Tr... | [
{
"created": "Mon, 2 Oct 2023 01:30:27 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Mar 2024 19:28:38 GMT",
"version": "v2"
}
] | 2024-03-20 | [
[
"Li",
"Tianjian",
""
],
[
"Xu",
"Haoran",
""
],
[
"Koehn",
"Philipp",
""
],
[
"Khashabi",
"Daniel",
""
],
[
"Murray",
"Kenton",
""
]
] | Text generation models are notoriously vulnerable to errors in the training data. With the wide-spread availability of massive amounts of web-crawled data becoming more commonplace, how can we enhance the robustness of models trained on a massive amount of noisy web-crawled text? In our work, we propose Error Norm Trun... |
1203.5742 | Marin\^es Guerreiro | Raul Antonio Ferraz, Marin\^es Guerreiro, and C\'esar Polcino Milies | G-equivalence in group algebras and minimal abelian codes | 8 pages, 4 tables | null | null | null | cs.IT math.GR math.IT math.RA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let G be a finite abelian group and F a field such that char(F) does not
divide |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian
code is an ideal of FG. Two codes I and J of FG are G-equivalent if there
exists an automorphism of G whose linear extension to FG maps I onto J In this
paper we give... | [
{
"created": "Mon, 26 Mar 2012 17:43:03 GMT",
"version": "v1"
}
] | 2012-03-27 | [
[
"Ferraz",
"Raul Antonio",
""
],
[
"Guerreiro",
"Marinês",
""
],
[
"Milies",
"César Polcino",
""
]
] | Let G be a finite abelian group and F a field such that char(F) does not divide |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I and J of FG are G-equivalent if there exists an automorphism of G whose linear extension to FG maps I onto J In this paper we give a... |
2102.03443 | Jesus Tordesillas Torres | Andrea Tagliabue, Jesus Tordesillas, Xiaoyi Cai, Angel
Santamaria-Navarro, Jonathan P. How, Luca Carlone, Ali-akbar Agha-mohammadi | LION: Lidar-Inertial Observability-Aware Navigator for Vision-Denied
Environments | 2020 International Symposium on Experimental Robotics (ISER 2020) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | State estimation for robots navigating in GPS-denied and
perceptually-degraded environments, such as underground tunnels, mines and
planetary subsurface voids, remains challenging in robotics. Towards this goal,
we present LION (Lidar-Inertial Observability-Aware Navigator), which is part
of the state estimation fram... | [
{
"created": "Fri, 5 Feb 2021 23:12:29 GMT",
"version": "v1"
}
] | 2021-02-09 | [
[
"Tagliabue",
"Andrea",
""
],
[
"Tordesillas",
"Jesus",
""
],
[
"Cai",
"Xiaoyi",
""
],
[
"Santamaria-Navarro",
"Angel",
""
],
[
"How",
"Jonathan P.",
""
],
[
"Carlone",
"Luca",
""
],
[
"Agha-mohammadi",
"Ali-akb... | State estimation for robots navigating in GPS-denied and perceptually-degraded environments, such as underground tunnels, mines and planetary subsurface voids, remains challenging in robotics. Towards this goal, we present LION (Lidar-Inertial Observability-Aware Navigator), which is part of the state estimation framew... |
1805.00780 | Maren Awiszus | Maren Awiszus, Stella Gra{\ss}hof, Felix Kuhnke, J\"orn Ostermann | Unsupervised Features for Facial Expression Intensity Estimation over
Time | Accepted for CVPR 2018 Workshop Track | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The diversity of facial shapes and motions among persons is one of the
greatest challenges for automatic analysis of facial expressions. In this
paper, we propose a feature describing expression intensity over time, while
being invariant to person and the type of performed expression. Our feature is
a weighted combin... | [
{
"created": "Wed, 2 May 2018 13:12:05 GMT",
"version": "v1"
},
{
"created": "Thu, 3 May 2018 07:15:26 GMT",
"version": "v2"
}
] | 2018-05-04 | [
[
"Awiszus",
"Maren",
""
],
[
"Graßhof",
"Stella",
""
],
[
"Kuhnke",
"Felix",
""
],
[
"Ostermann",
"Jörn",
""
]
] | The diversity of facial shapes and motions among persons is one of the greatest challenges for automatic analysis of facial expressions. In this paper, we propose a feature describing expression intensity over time, while being invariant to person and the type of performed expression. Our feature is a weighted combinat... |
2301.05892 | Pau Gall\'es Ravent\'os | Pau Gall\'es, Katalin Takats and Javier Marin | Object Detection performance variation on compressed satellite image
datasets with iquaflow | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | A lot of work has been done to reach the best possible performance of
predictive models on images. There are fewer studies about the resilience of
these models when they are trained on image datasets that suffer modifications
altering their original quality. Yet this is a common problem that is often
encountered in t... | [
{
"created": "Sat, 14 Jan 2023 11:20:27 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Jan 2023 14:21:07 GMT",
"version": "v2"
}
] | 2023-01-19 | [
[
"Gallés",
"Pau",
""
],
[
"Takats",
"Katalin",
""
],
[
"Marin",
"Javier",
""
]
] | A lot of work has been done to reach the best possible performance of predictive models on images. There are fewer studies about the resilience of these models when they are trained on image datasets that suffer modifications altering their original quality. Yet this is a common problem that is often encountered in the... |
1504.03212 | Carola Doerr | Benjamin Doerr and Carola Doerr | Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th
Rule in Discrete Settings | This is the full version of a paper that is to appear at GECCO 2015 | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While evolutionary algorithms are known to be very successful for a broad
range of applications, the algorithm designer is often left with many
algorithmic choices, for example, the size of the population, the mutation
rates, and the crossover rates of the algorithm. These parameters are known to
have a crucial influ... | [
{
"created": "Mon, 13 Apr 2015 15:16:00 GMT",
"version": "v1"
}
] | 2015-04-14 | [
[
"Doerr",
"Benjamin",
""
],
[
"Doerr",
"Carola",
""
]
] | While evolutionary algorithms are known to be very successful for a broad range of applications, the algorithm designer is often left with many algorithmic choices, for example, the size of the population, the mutation rates, and the crossover rates of the algorithm. These parameters are known to have a crucial influen... |
2012.14592 | Hazem Torfah | Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah | Synthesizing Approximate Implementations for Unrealizable Specifications | Published at CAV 2019 | null | 10.1007/978-3-030-25540-4_13 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The unrealizability of a specification is often due to the assumption that
the behavior of the environment is unrestricted. In this paper, we present
algorithms for synthesis in bounded environments, where the environment can
only generate input sequences that are ultimately periodic words (lassos) with
finite repres... | [
{
"created": "Tue, 29 Dec 2020 03:57:45 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Dimitrova",
"Rayna",
""
],
[
"Finkbeiner",
"Bernd",
""
],
[
"Torfah",
"Hazem",
""
]
] | The unrealizability of a specification is often due to the assumption that the behavior of the environment is unrestricted. In this paper, we present algorithms for synthesis in bounded environments, where the environment can only generate input sequences that are ultimately periodic words (lassos) with finite represen... |
1811.05250 | Pan Zhou | Pan Zhou, Wenwen Yang, Wei Chen, Yanfeng Wang, Jia Jia | Modality Attention for End-to-End Audio-visual Speech Recognition | accepted by ICASSP2019 | null | null | null | cs.CL cs.CV cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Audio-visual speech recognition (AVSR) system is thought to be one of the
most promising solutions for robust speech recognition, especially in noisy
environment. In this paper, we propose a novel multimodal attention based
method for audio-visual speech recognition which could automatically learn the
fused represent... | [
{
"created": "Tue, 13 Nov 2018 12:28:03 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Apr 2019 04:21:06 GMT",
"version": "v2"
}
] | 2019-04-24 | [
[
"Zhou",
"Pan",
""
],
[
"Yang",
"Wenwen",
""
],
[
"Chen",
"Wei",
""
],
[
"Wang",
"Yanfeng",
""
],
[
"Jia",
"Jia",
""
]
] | Audio-visual speech recognition (AVSR) system is thought to be one of the most promising solutions for robust speech recognition, especially in noisy environment. In this paper, we propose a novel multimodal attention based method for audio-visual speech recognition which could automatically learn the fused representat... |
1705.05684 | Rafael Pereira Pires | Rafael Pires and Daniel Gavril and Pascal Felber and Emanuel Onica and
Marcelo Pasin | A lightweight MapReduce framework for secure processing with SGX | 8 pages WACC@CCGRID International Workshop on Assured Cloud Computing
and QoS aware Big Data | 2017 17th IEEE/ACM International Symposium on Cluster, Cloud and
Grid Computing | 10.1109/CCGRID.2017.129 | null | cs.DC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | MapReduce is a programming model used extensively for parallel data
processing in distributed environments. A wide range of algorithms were
implemented using MapReduce, from simple tasks like sorting and searching up to
complex clustering and machine learning operations. Many of these
implementations are part of serv... | [
{
"created": "Tue, 16 May 2017 12:46:38 GMT",
"version": "v1"
}
] | 2017-05-17 | [
[
"Pires",
"Rafael",
""
],
[
"Gavril",
"Daniel",
""
],
[
"Felber",
"Pascal",
""
],
[
"Onica",
"Emanuel",
""
],
[
"Pasin",
"Marcelo",
""
]
] | MapReduce is a programming model used extensively for parallel data processing in distributed environments. A wide range of algorithms were implemented using MapReduce, from simple tasks like sorting and searching up to complex clustering and machine learning operations. Many of these implementations are part of servic... |
2205.09214 | Yong Niu | Jing Li, Yong Niu, Hao Wu, Bo Ai, Sheng Chen, Zhiyong Feng, Zhangdui
Zhong, Ning Wang | Mobility Support for Millimeter Wave Communications: Opportunities and
Challenges | 25 pages,11 figures,journal | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Millimeter-wave (mmWave) communication technology offers a potential and
promising solution to support 5G and B5G wireless networks in dynamic scenarios
and applications. However, mobility introduces many challenges as well as
opportunities to mmWave applications. To address these problems, we conduct a
survey of the... | [
{
"created": "Wed, 18 May 2022 20:59:14 GMT",
"version": "v1"
}
] | 2022-05-20 | [
[
"Li",
"Jing",
""
],
[
"Niu",
"Yong",
""
],
[
"Wu",
"Hao",
""
],
[
"Ai",
"Bo",
""
],
[
"Chen",
"Sheng",
""
],
[
"Feng",
"Zhiyong",
""
],
[
"Zhong",
"Zhangdui",
""
],
[
"Wang",
"Ning",
""
]
... | Millimeter-wave (mmWave) communication technology offers a potential and promising solution to support 5G and B5G wireless networks in dynamic scenarios and applications. However, mobility introduces many challenges as well as opportunities to mmWave applications. To address these problems, we conduct a survey of the o... |
2408.05715 | Zhi-Cun Lyu | Zhi-Cun Lyu, Xin-Ye Li, Zheng Xie, Ming Li | Top Pass: Improve Code Generation by Pass@k-Maximized Code Ranking | Accepted by Frontier of Computer Science | null | null | null | cs.AI cs.SE | http://creativecommons.org/licenses/by/4.0/ | Code generation has been greatly enhanced by the profound advancements in
Large Language Models (LLMs) recently. Nevertheless, such LLM-based code
generation approaches still struggle to generate error-free code in a few tries
when faced with complex problems. To address this, the prevailing strategy is
to sample a h... | [
{
"created": "Sun, 11 Aug 2024 07:53:51 GMT",
"version": "v1"
}
] | 2024-08-13 | [
[
"Lyu",
"Zhi-Cun",
""
],
[
"Li",
"Xin-Ye",
""
],
[
"Xie",
"Zheng",
""
],
[
"Li",
"Ming",
""
]
] | Code generation has been greatly enhanced by the profound advancements in Large Language Models (LLMs) recently. Nevertheless, such LLM-based code generation approaches still struggle to generate error-free code in a few tries when faced with complex problems. To address this, the prevailing strategy is to sample a hug... |
2002.05511 | Sanna Wager C | Sanna Wager, George Tzanetakis, Cheng-i Wang, Minje Kim | Deep Autotuner: a Pitch Correcting Network for Singing Performances | arXiv admin note: text overlap with arXiv:1902.00956 | IEEE International Conference on Acoustics, Speech, and Signal
Processing (ICASSP), 2020 | null | null | cs.SD cs.LG eess.AS stat.ML | http://creativecommons.org/publicdomain/zero/1.0/ | We introduce a data-driven approach to automatic pitch correction of solo
singing performances. The proposed approach predicts note-wise pitch shifts
from the relationship between the respective spectrograms of the singing and
accompaniment. This approach differs from commercial systems, where vocal track
notes are u... | [
{
"created": "Wed, 12 Feb 2020 01:33:56 GMT",
"version": "v1"
}
] | 2020-02-25 | [
[
"Wager",
"Sanna",
""
],
[
"Tzanetakis",
"George",
""
],
[
"Wang",
"Cheng-i",
""
],
[
"Kim",
"Minje",
""
]
] | We introduce a data-driven approach to automatic pitch correction of solo singing performances. The proposed approach predicts note-wise pitch shifts from the relationship between the respective spectrograms of the singing and accompaniment. This approach differs from commercial systems, where vocal track notes are usu... |
0803.0515 | Christopher Pearson | Christopher Pearson, Celina Gibbs, Yvonne Coady | Intuitive Source Code Visualization Tools for Improving Student
Comprehension: BRICS | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Even relatively simple code analysis can be a daunting task for many first
year students. Perceived complexity, coupled with foreign and harsh syntax,
often outstrips the ability for students to take in what they are seeing in
terms of their verbal memory. That is, first year students often lack the
experience to enc... | [
{
"created": "Tue, 4 Mar 2008 18:46:49 GMT",
"version": "v1"
}
] | 2008-03-05 | [
[
"Pearson",
"Christopher",
""
],
[
"Gibbs",
"Celina",
""
],
[
"Coady",
"Yvonne",
""
]
] | Even relatively simple code analysis can be a daunting task for many first year students. Perceived complexity, coupled with foreign and harsh syntax, often outstrips the ability for students to take in what they are seeing in terms of their verbal memory. That is, first year students often lack the experience to encod... |
2407.15131 | Jun Young Park | Junyoung Park, Myeonggu Kang, Yunki Han, Yanggon Kim, Jaekang Shin,
Lee-Sup Kim | Token-Picker: Accelerating Attention in Text Generation with Minimized
Memory Transfer via Probability Estimation | To appear in the proceedings of 61st Design Automation Conference
(DAC) | null | null | null | cs.AR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The attention mechanism in text generation is memory-bounded due to its
sequential characteristics. Therefore, off-chip memory accesses should be
minimized for faster execution. Although previous methods addressed this by
pruning unimportant tokens, they fall short in selectively removing tokens with
near-zero attent... | [
{
"created": "Sun, 21 Jul 2024 11:56:54 GMT",
"version": "v1"
}
] | 2024-07-23 | [
[
"Park",
"Junyoung",
""
],
[
"Kang",
"Myeonggu",
""
],
[
"Han",
"Yunki",
""
],
[
"Kim",
"Yanggon",
""
],
[
"Shin",
"Jaekang",
""
],
[
"Kim",
"Lee-Sup",
""
]
] | The attention mechanism in text generation is memory-bounded due to its sequential characteristics. Therefore, off-chip memory accesses should be minimized for faster execution. Although previous methods addressed this by pruning unimportant tokens, they fall short in selectively removing tokens with near-zero attentio... |
1901.11010 | Thorsten Wissmann | Mirai Ikebuchi and Keisuke Nakano | On properties of $B$-terms | Journal version in Logical Methods in Computer Science. arXiv admin
note: substantial text overlap with arXiv:1703.10938 | Logical Methods in Computer Science, Volume 16, Issue 2 (June 2,
2020) lmcs:5156 | 10.23638/LMCS-16(2:8)2020 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | $B$-terms are built from the $B$ combinator alone defined by $B\equiv\lambda
fgx. f(g~x)$, which is well known as a function composition operator. This
paper investigates an interesting property of $B$-terms, that is, whether
repetitive right applications of a $B$-term cycles or not. We discuss
conditions for $B$-ter... | [
{
"created": "Wed, 30 Jan 2019 04:24:03 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Nov 2019 08:35:03 GMT",
"version": "v2"
},
{
"created": "Mon, 1 Jun 2020 11:29:40 GMT",
"version": "v3"
}
] | 2023-06-22 | [
[
"Ikebuchi",
"Mirai",
""
],
[
"Nakano",
"Keisuke",
""
]
] | $B$-terms are built from the $B$ combinator alone defined by $B\equiv\lambda fgx. f(g~x)$, which is well known as a function composition operator. This paper investigates an interesting property of $B$-terms, that is, whether repetitive right applications of a $B$-term cycles or not. We discuss conditions for $B$-terms... |
1704.03672 | Mario Gleirscher | Mario Gleirscher and Carmen Carlan | Arguing from Hazard Analysis in Safety Cases: A Modular Argument Pattern | null | null | 10.1109/HASE.2017.15 | null | cs.SE cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We observed that safety arguments are prone to stay too abstract, e.g.
solutions refer to large packages, argument strategies to complex reasoning
steps, contexts and assumptions lack traceability. These issues can reduce the
confidence we require of such arguments. In this paper, we investigate the
construction of c... | [
{
"created": "Wed, 12 Apr 2017 09:41:30 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Feb 2018 20:03:55 GMT",
"version": "v2"
}
] | 2021-01-29 | [
[
"Gleirscher",
"Mario",
""
],
[
"Carlan",
"Carmen",
""
]
] | We observed that safety arguments are prone to stay too abstract, e.g. solutions refer to large packages, argument strategies to complex reasoning steps, contexts and assumptions lack traceability. These issues can reduce the confidence we require of such arguments. In this paper, we investigate the construction of con... |
1909.01432 | Kai Zhou | Kai Zhou, Tomasz P. Michalak, and Yevgeniy Vorobeychik | Adversarial Robustness of Similarity-Based Link Prediction | ICDM 2019 | null | null | null | cs.AI cs.CR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Link prediction is one of the fundamental problems in social network
analysis. A common set of techniques for link prediction rely on similarity
metrics which use the topology of the observed subnetwork to quantify the
likelihood of unobserved links. Recently, similarity metrics for link
prediction have been shown to... | [
{
"created": "Tue, 3 Sep 2019 20:20:45 GMT",
"version": "v1"
}
] | 2019-09-05 | [
[
"Zhou",
"Kai",
""
],
[
"Michalak",
"Tomasz P.",
""
],
[
"Vorobeychik",
"Yevgeniy",
""
]
] | Link prediction is one of the fundamental problems in social network analysis. A common set of techniques for link prediction rely on similarity metrics which use the topology of the observed subnetwork to quantify the likelihood of unobserved links. Recently, similarity metrics for link prediction have been shown to b... |
2112.12597 | Mubin Ul Haque | Mubin Ul Haque and M. Ali Babar | Well Begun is Half Done: An Empirical Study of Exploitability & Impact
of Base-Image Vulnerabilities | null | null | null | null | cs.CR cs.SE | http://creativecommons.org/licenses/by/4.0/ | Container technology, (e.g., Docker) is being widely adopted for deploying
software infrastructures or applications in the form of container images.
Security vulnerabilities in the container images are a primary concern for
developing containerized software. Exploitation of the vulnerabilities could
result in disastr... | [
{
"created": "Tue, 21 Dec 2021 07:41:02 GMT",
"version": "v1"
}
] | 2021-12-24 | [
[
"Haque",
"Mubin Ul",
""
],
[
"Babar",
"M. Ali",
""
]
] | Container technology, (e.g., Docker) is being widely adopted for deploying software infrastructures or applications in the form of container images. Security vulnerabilities in the container images are a primary concern for developing containerized software. Exploitation of the vulnerabilities could result in disastrou... |
1711.09057 | Alejandro Torre\~no | Alejandro Torre\~no, Eva Onaindia, Anton\'in Komenda, Michal
\v{S}tolba | Cooperative Multi-Agent Planning: A Survey | 34 pages, 4 figures, 4 tables | ACM Computing Surveys, Volume 50, Number 6, Article 84.
Publication date: November 2017 | 10.1145/3128584 | null | cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cooperative multi-agent planning (MAP) is a relatively recent research field
that combines technologies, algorithms and techniques developed by the
Artificial Intelligence Planning and Multi-Agent Systems communities. While
planning has been generally treated as a single-agent task, MAP generalizes
this concept by co... | [
{
"created": "Fri, 24 Nov 2017 17:43:14 GMT",
"version": "v1"
}
] | 2017-11-27 | [
[
"Torreño",
"Alejandro",
""
],
[
"Onaindia",
"Eva",
""
],
[
"Komenda",
"Antonín",
""
],
[
"Štolba",
"Michal",
""
]
] | Cooperative multi-agent planning (MAP) is a relatively recent research field that combines technologies, algorithms and techniques developed by the Artificial Intelligence Planning and Multi-Agent Systems communities. While planning has been generally treated as a single-agent task, MAP generalizes this concept by cons... |
2309.13501 | Rundong Gan | Rundong Gan, Le Wang, Xiaodong Lin | Why Trick Me: The Honeypot Traps on Decentralized Exchanges | null | null | 10.1145/3605768.3623546 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Decentralized Exchanges (DEXs) are one of the most important infrastructures
in the world of Decentralized Finance (DeFi) and are generally considered more
reliable than centralized exchanges (CEXs). However, some well-known
decentralized exchanges (e.g., Uniswap) allow the deployment of any unaudited
ERC20 tokens, r... | [
{
"created": "Sat, 23 Sep 2023 23:43:41 GMT",
"version": "v1"
}
] | 2023-09-26 | [
[
"Gan",
"Rundong",
""
],
[
"Wang",
"Le",
""
],
[
"Lin",
"Xiaodong",
""
]
] | Decentralized Exchanges (DEXs) are one of the most important infrastructures in the world of Decentralized Finance (DeFi) and are generally considered more reliable than centralized exchanges (CEXs). However, some well-known decentralized exchanges (e.g., Uniswap) allow the deployment of any unaudited ERC20 tokens, res... |
1512.01921 | Nariman Farsad Dr. | Nariman Farsad, Weisi Guo, Chan-Byoung Chae, Andrew Eckford | Stable Distributions as Noise Models for Molecular Communication | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we consider diffusion-based molecular communication timing
channels. Three different timing channels are presented based on three
different modulation techniques, i.e., i) modulation of the release timing of
the information particles, ii) modulation on the time between two consecutive
information partic... | [
{
"created": "Mon, 7 Dec 2015 06:06:54 GMT",
"version": "v1"
}
] | 2015-12-08 | [
[
"Farsad",
"Nariman",
""
],
[
"Guo",
"Weisi",
""
],
[
"Chae",
"Chan-Byoung",
""
],
[
"Eckford",
"Andrew",
""
]
] | In this work, we consider diffusion-based molecular communication timing channels. Three different timing channels are presented based on three different modulation techniques, i.e., i) modulation of the release timing of the information particles, ii) modulation on the time between two consecutive information particle... |
2402.15215 | Meng Jiang | Meng Jiang, Keqin Bao, Jizhi Zhang, Wenjie Wang, Zhengyi Yang, Fuli
Feng, Xiangnan He | Item-side Fairness of Large Language Model-based Recommendation System | Accepted by the Proceedings of the ACM Web Conference 2024 | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommendation systems for Web content distribution intricately connect to
the information access and exposure opportunities for vulnerable populations.
The emergence of Large Language Models-based Recommendation System (LRS) may
introduce additional societal challenges to recommendation systems due to the
inherent b... | [
{
"created": "Fri, 23 Feb 2024 09:24:04 GMT",
"version": "v1"
}
] | 2024-02-26 | [
[
"Jiang",
"Meng",
""
],
[
"Bao",
"Keqin",
""
],
[
"Zhang",
"Jizhi",
""
],
[
"Wang",
"Wenjie",
""
],
[
"Yang",
"Zhengyi",
""
],
[
"Feng",
"Fuli",
""
],
[
"He",
"Xiangnan",
""
]
] | Recommendation systems for Web content distribution intricately connect to the information access and exposure opportunities for vulnerable populations. The emergence of Large Language Models-based Recommendation System (LRS) may introduce additional societal challenges to recommendation systems due to the inherent bia... |
2112.08740 | Zhikang Wang | Zhikang Wang, Feng Zhu, Shixiang Tang, Rui Zhao, Lihuo He, Jiangning
Song | Feature Erasing and Diffusion Network for Occluded Person
Re-Identification | 10 pages, 5 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Occluded person re-identification (ReID) aims at matching occluded person
images to holistic ones across different camera views. Target Pedestrians (TP)
are usually disturbed by Non-Pedestrian Occlusions (NPO) and NonTarget
Pedestrians (NTP). Previous methods mainly focus on increasing model's
robustness against NPO ... | [
{
"created": "Thu, 16 Dec 2021 09:47:17 GMT",
"version": "v1"
},
{
"created": "Thu, 31 Mar 2022 03:17:26 GMT",
"version": "v2"
}
] | 2022-04-01 | [
[
"Wang",
"Zhikang",
""
],
[
"Zhu",
"Feng",
""
],
[
"Tang",
"Shixiang",
""
],
[
"Zhao",
"Rui",
""
],
[
"He",
"Lihuo",
""
],
[
"Song",
"Jiangning",
""
]
] | Occluded person re-identification (ReID) aims at matching occluded person images to holistic ones across different camera views. Target Pedestrians (TP) are usually disturbed by Non-Pedestrian Occlusions (NPO) and NonTarget Pedestrians (NTP). Previous methods mainly focus on increasing model's robustness against NPO wh... |
2402.12891 | Tim Michels | Tim Michels, Daniel M\"ackelmann and Reinhard Koch | Mind the Exit Pupil Gap: Revisiting the Intrinsics of a Standard
Plenoptic Camera | 29 pages, 16 figures, Accepted for publication in MDPI Sensors,
Special Issue 'Short-Range Optical 3D Scanning and 3D Data Processing ' | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Among the common applications of plenoptic cameras are depth reconstruction
and post-shot refocusing. These require a calibration relating the camera-side
light field to that of the scene. Numerous methods with this goal have been
developed based on thin lens models for the plenoptic camera's main lens and
microlense... | [
{
"created": "Tue, 20 Feb 2024 10:35:51 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Apr 2024 09:26:07 GMT",
"version": "v2"
}
] | 2024-04-08 | [
[
"Michels",
"Tim",
""
],
[
"Mäckelmann",
"Daniel",
""
],
[
"Koch",
"Reinhard",
""
]
] | Among the common applications of plenoptic cameras are depth reconstruction and post-shot refocusing. These require a calibration relating the camera-side light field to that of the scene. Numerous methods with this goal have been developed based on thin lens models for the plenoptic camera's main lens and microlenses.... |
1704.01992 | Shirin Jalali | Sajjad Beygi, Shirin Jalali, Arian Maleki, Urbashi Mitra | An efficient algorithm for compression-based compressed sensing | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern image and video compression codes employ elaborate structures existing
in such signals to encode them into few number of bits. Compressed sensing
recovery algorithms on the other hand use such signals' structures to recover
them from few linear observations. Despite the steady progress in the field of
compress... | [
{
"created": "Thu, 6 Apr 2017 19:23:08 GMT",
"version": "v1"
}
] | 2017-04-10 | [
[
"Beygi",
"Sajjad",
""
],
[
"Jalali",
"Shirin",
""
],
[
"Maleki",
"Arian",
""
],
[
"Mitra",
"Urbashi",
""
]
] | Modern image and video compression codes employ elaborate structures existing in such signals to encode them into few number of bits. Compressed sensing recovery algorithms on the other hand use such signals' structures to recover them from few linear observations. Despite the steady progress in the field of compressed... |
2010.03680 | Yaqing Wang | Yaqing Wang, Subhabrata Mukherjee, Haoda Chu, Yuancheng Tu, Ming Wu,
Jing Gao, Ahmed Hassan Awadallah | Adaptive Self-training for Few-shot Neural Sequence Labeling | null | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sequence labeling is an important technique employed for many Natural
Language Processing (NLP) tasks, such as Named Entity Recognition (NER), slot
tagging for dialog systems and semantic parsing. Large-scale pre-trained
language models obtain very good performance on these tasks when fine-tuned on
large amounts of t... | [
{
"created": "Wed, 7 Oct 2020 22:29:05 GMT",
"version": "v1"
},
{
"created": "Fri, 11 Dec 2020 17:16:57 GMT",
"version": "v2"
}
] | 2020-12-14 | [
[
"Wang",
"Yaqing",
""
],
[
"Mukherjee",
"Subhabrata",
""
],
[
"Chu",
"Haoda",
""
],
[
"Tu",
"Yuancheng",
""
],
[
"Wu",
"Ming",
""
],
[
"Gao",
"Jing",
""
],
[
"Awadallah",
"Ahmed Hassan",
""
]
] | Sequence labeling is an important technique employed for many Natural Language Processing (NLP) tasks, such as Named Entity Recognition (NER), slot tagging for dialog systems and semantic parsing. Large-scale pre-trained language models obtain very good performance on these tasks when fine-tuned on large amounts of tas... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.