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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1807.11836 | Jean Pierre Char | Jean Pierre Char | Inferring the ground truth through crowdsourcing | 6 pages, 1 figure, Intelligent Systems seminar SS18 | null | null | null | cs.LG cs.HC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Universally valid ground truth is almost impossible to obtain or would come
at a very high cost. For supervised learning without universally valid ground
truth, a recommended approach is applying crowdsourcing: Gathering a large data
set annotated by multiple individuals of varying possibly expertise levels and
infer... | [
{
"created": "Tue, 31 Jul 2018 14:21:32 GMT",
"version": "v1"
}
] | 2018-08-01 | [
[
"Char",
"Jean Pierre",
""
]
] | Universally valid ground truth is almost impossible to obtain or would come at a very high cost. For supervised learning without universally valid ground truth, a recommended approach is applying crowdsourcing: Gathering a large data set annotated by multiple individuals of varying possibly expertise levels and inferri... |
2102.13355 | Andreas Liesenfeld | Andreas Liesenfeld, G\'abor Parti, Yu-Yin Hsu, Chu-Ren Huang | Predicting gender and age categories in English conversations using
lexical, non-lexical, and turn-taking features | 10 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper examines gender and age salience and (stereo)typicality in British
English talk with the aim to predict gender and age categories based on
lexical, phrasal and turn-taking features. We examine the SpokenBNC, a corpus
of around 11.4 million words of British English conversations and identify
behavioural dif... | [
{
"created": "Fri, 26 Feb 2021 08:23:08 GMT",
"version": "v1"
}
] | 2021-03-01 | [
[
"Liesenfeld",
"Andreas",
""
],
[
"Parti",
"Gábor",
""
],
[
"Hsu",
"Yu-Yin",
""
],
[
"Huang",
"Chu-Ren",
""
]
] | This paper examines gender and age salience and (stereo)typicality in British English talk with the aim to predict gender and age categories based on lexical, phrasal and turn-taking features. We examine the SpokenBNC, a corpus of around 11.4 million words of British English conversations and identify behavioural diffe... |
1804.11088 | Wei-Yu Lai | Wei-Yu Lai and Tien-Ruey Hsiang | A Linear-Time Approximation Algorithm for the Orthogonal Terrain
Guarding Problem | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the 1.5-dimensional orthogonal terrain guarding
problem. In this problem, we assign an x-monotone chain T because each edge is
either horizontal or vertical, and determine the minimal number of vertex
guards for all vertices of T. A vertex vi sees a point p on T if the line
segment connecti... | [
{
"created": "Mon, 30 Apr 2018 09:12:57 GMT",
"version": "v1"
},
{
"created": "Wed, 9 May 2018 09:36:59 GMT",
"version": "v2"
}
] | 2018-05-10 | [
[
"Lai",
"Wei-Yu",
""
],
[
"Hsiang",
"Tien-Ruey",
""
]
] | In this paper, we consider the 1.5-dimensional orthogonal terrain guarding problem. In this problem, we assign an x-monotone chain T because each edge is either horizontal or vertical, and determine the minimal number of vertex guards for all vertices of T. A vertex vi sees a point p on T if the line segment connecting... |
2005.04177 | Jay DeYoung | Jay DeYoung, Eric Lehman, Ben Nye, Iain J. Marshall, Byron C. Wallace | Evidence Inference 2.0: More Data, Better Models | Accepted as workshop paper into BioNLP Updated results from SciBERT
to Biomed RoBERTa | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How do we most effectively treat a disease or condition? Ideally, we could
consult a database of evidence gleaned from clinical trials to answer such
questions. Unfortunately, no such database exists; clinical trial results are
instead disseminated primarily via lengthy natural language articles. Perusing
all such ar... | [
{
"created": "Fri, 8 May 2020 17:16:35 GMT",
"version": "v1"
},
{
"created": "Thu, 14 May 2020 14:55:33 GMT",
"version": "v2"
}
] | 2020-05-15 | [
[
"DeYoung",
"Jay",
""
],
[
"Lehman",
"Eric",
""
],
[
"Nye",
"Ben",
""
],
[
"Marshall",
"Iain J.",
""
],
[
"Wallace",
"Byron C.",
""
]
] | How do we most effectively treat a disease or condition? Ideally, we could consult a database of evidence gleaned from clinical trials to answer such questions. Unfortunately, no such database exists; clinical trial results are instead disseminated primarily via lengthy natural language articles. Perusing all such arti... |
2211.16773 | Xiao Yu | Xiao Yu, Qingyang Wu, Kun Qian, Zhou Yu | KRLS: Improving End-to-End Response Generation in Task Oriented Dialog
with Reinforced Keywords Learning | Accepted at EMNLP 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In task-oriented dialogs (TOD), reinforcement learning (RL) algorithms train
a model to directly optimize response for task-related metrics. However, RL
needs to perform exploration, which can be time-consuming due to the slow
auto-regressive sequence generation process. We investigate an approach to
create a more ef... | [
{
"created": "Wed, 30 Nov 2022 06:27:46 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Dec 2022 06:56:04 GMT",
"version": "v2"
},
{
"created": "Tue, 20 Dec 2022 05:31:07 GMT",
"version": "v3"
},
{
"created": "Tue, 23 May 2023 04:09:31 GMT",
"version": "v4"
},
{
"c... | 2023-10-23 | [
[
"Yu",
"Xiao",
""
],
[
"Wu",
"Qingyang",
""
],
[
"Qian",
"Kun",
""
],
[
"Yu",
"Zhou",
""
]
] | In task-oriented dialogs (TOD), reinforcement learning (RL) algorithms train a model to directly optimize response for task-related metrics. However, RL needs to perform exploration, which can be time-consuming due to the slow auto-regressive sequence generation process. We investigate an approach to create a more effi... |
2104.04040 | Paul Beaujean | Paul Beaujean and Florian Sikora and Florian Yger | Scaling up graph homomorphism for classification via sampling | 17 pages, 1 figure | null | null | null | cs.LG cs.DS | http://creativecommons.org/licenses/by/4.0/ | Feature generation is an open topic of investigation in graph machine
learning. In this paper, we study the use of graph homomorphism density
features as a scalable alternative to homomorphism numbers which retain similar
theoretical properties and ability to take into account inductive bias. For
this, we propose a h... | [
{
"created": "Thu, 8 Apr 2021 20:25:37 GMT",
"version": "v1"
}
] | 2021-04-12 | [
[
"Beaujean",
"Paul",
""
],
[
"Sikora",
"Florian",
""
],
[
"Yger",
"Florian",
""
]
] | Feature generation is an open topic of investigation in graph machine learning. In this paper, we study the use of graph homomorphism density features as a scalable alternative to homomorphism numbers which retain similar theoretical properties and ability to take into account inductive bias. For this, we propose a hig... |
1606.00892 | Mary Tate | Jacques Louis Du Preez, Mary Tate and Alireza Nili | Developing a Methodology for Online Service Failure Prevention:
Reporting on an Action Design Research Project-in-Progress | ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
Information Systems 2015 (arXiv:1605.01032) | null | null | ACIS/2015/47 | cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The increasing use of online channels for service delivery raises new
challenges in service failure prevention. This work-in-progress paper reports
on the first phase of an action-design research project to develop a service
failure prevention methodology. In this paper we review the literature on
online services, fa... | [
{
"created": "Sat, 28 May 2016 03:38:17 GMT",
"version": "v1"
}
] | 2016-06-06 | [
[
"Preez",
"Jacques Louis Du",
""
],
[
"Tate",
"Mary",
""
],
[
"Nili",
"Alireza",
""
]
] | The increasing use of online channels for service delivery raises new challenges in service failure prevention. This work-in-progress paper reports on the first phase of an action-design research project to develop a service failure prevention methodology. In this paper we review the literature on online services, fail... |
1707.04892 | Ahmad Steef | Ahmad Steef, M. N. Shamma, A. Alkhatib | A secure approach for embedding message text on an elliptic curve
defined over prime fields, and building 'EC-RSA-ELGamal' Cryptographic System | Elliptic Curve Cryptography, embedding message text on an elliptic
curve, RSA Algorithm,
https://sites.google.com/site/ijcsis/vol-15-no-6-jun-2017 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new probabilistic approach to embedding message text on
an elliptic curve, by using the concept of the RSA Algorithm and its security,
and such approach allows us discovering the message from the point, only
according to the security of the RSA Algorithm. By mixing between the concept
of this ap... | [
{
"created": "Sun, 16 Jul 2017 14:49:36 GMT",
"version": "v1"
}
] | 2017-07-18 | [
[
"Steef",
"Ahmad",
""
],
[
"Shamma",
"M. N.",
""
],
[
"Alkhatib",
"A.",
""
]
] | This paper presents a new probabilistic approach to embedding message text on an elliptic curve, by using the concept of the RSA Algorithm and its security, and such approach allows us discovering the message from the point, only according to the security of the RSA Algorithm. By mixing between the concept of this appr... |
2006.04787 | Sitan Chen | Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau | Classification Under Misspecification: Halfspaces, Generalized Linear
Models, and Connections to Evolvability | 52 pages, v2: updated references | null | null | null | cs.LG cs.DS math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we revisit some classic problems on classification under
misspecification. In particular, we study the problem of learning halfspaces
under Massart noise with rate $\eta$. In a recent work, Diakonikolas,
Goulekakis, and Tzamos resolved a long-standing problem by giving the first
efficient algorithm for ... | [
{
"created": "Mon, 8 Jun 2020 17:59:11 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Sep 2023 14:40:02 GMT",
"version": "v2"
}
] | 2023-09-21 | [
[
"Chen",
"Sitan",
""
],
[
"Koehler",
"Frederic",
""
],
[
"Moitra",
"Ankur",
""
],
[
"Yau",
"Morris",
""
]
] | In this paper we revisit some classic problems on classification under misspecification. In particular, we study the problem of learning halfspaces under Massart noise with rate $\eta$. In a recent work, Diakonikolas, Goulekakis, and Tzamos resolved a long-standing problem by giving the first efficient algorithm for le... |
2407.03877 | Daniel P. Szabo | Krist\'of B\'erczi, Tam\'as Kir\'aly, Daniel P. Szabo | Multiway Cuts with a Choice of Representatives | null | null | 10.4230/LIPIcs.MFCS.2024.18 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study several generalizations of multiway cut where the
terminals can be chosen as \emph{representatives} from sets of
\emph{candidates} $T_1,\ldots,T_q$. In this setting, one is allowed to choose
these representatives so that the minimum-weight cut separating these sets
\emph{via their representati... | [
{
"created": "Thu, 4 Jul 2024 12:14:37 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Bérczi",
"Kristóf",
""
],
[
"Király",
"Tamás",
""
],
[
"Szabo",
"Daniel P.",
""
]
] | In this paper, we study several generalizations of multiway cut where the terminals can be chosen as \emph{representatives} from sets of \emph{candidates} $T_1,\ldots,T_q$. In this setting, one is allowed to choose these representatives so that the minimum-weight cut separating these sets \emph{via their representative... |
2405.10845 | Jin L.C. Guo | Jin L.C. Guo, Jan-Philipp Stegh\"ofer, Andreas Vogelsang, Jane
Cleland-Huang | Natural Language Processing for Requirements Traceability | Book Chapter in the Handbook of Natural Language Processing for
Requirements Engineering | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traceability, the ability to trace relevant software artifacts to support
reasoning about the quality of the software and its development process, plays
a crucial role in requirements and software engineering, particularly for
safety-critical systems. In this chapter, we provide a comprehensive overview
of the repres... | [
{
"created": "Fri, 17 May 2024 15:17:00 GMT",
"version": "v1"
}
] | 2024-05-20 | [
[
"Guo",
"Jin L. C.",
""
],
[
"Steghöfer",
"Jan-Philipp",
""
],
[
"Vogelsang",
"Andreas",
""
],
[
"Cleland-Huang",
"Jane",
""
]
] | Traceability, the ability to trace relevant software artifacts to support reasoning about the quality of the software and its development process, plays a crucial role in requirements and software engineering, particularly for safety-critical systems. In this chapter, we provide a comprehensive overview of the represen... |
2306.16050 | Yao Li | Jie Ning, Jiebao Sun, Yao Li, Zhichang Guo, Wangmeng Zuo | Evaluating Similitude and Robustness of Deep Image Denoising Models via
Adversarial Attack | null | null | null | null | cs.CV cs.LG eess.IV | http://creativecommons.org/licenses/by/4.0/ | Deep neural networks (DNNs) have shown superior performance comparing to
traditional image denoising algorithms. However, DNNs are inevitably vulnerable
while facing adversarial attacks. In this paper, we propose an adversarial
attack method named denoising-PGD which can successfully attack all the current
deep denoi... | [
{
"created": "Wed, 28 Jun 2023 09:30:59 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Jul 2023 02:40:02 GMT",
"version": "v2"
}
] | 2023-07-10 | [
[
"Ning",
"Jie",
""
],
[
"Sun",
"Jiebao",
""
],
[
"Li",
"Yao",
""
],
[
"Guo",
"Zhichang",
""
],
[
"Zuo",
"Wangmeng",
""
]
] | Deep neural networks (DNNs) have shown superior performance comparing to traditional image denoising algorithms. However, DNNs are inevitably vulnerable while facing adversarial attacks. In this paper, we propose an adversarial attack method named denoising-PGD which can successfully attack all the current deep denoisi... |
2209.14426 | Kaveh Fathian | Jacqueline Ankenbauer, Kaveh Fathian, Jonathan P. How | View-Invariant Localization using Semantic Objects in Changing
Environments | null | null | null | null | cs.RO cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper proposes a novel framework for real-time localization and
egomotion tracking of a vehicle in a reference map. The core idea is to map the
semantic objects observed by the vehicle and register them to their
corresponding objects in the reference map. While several recent works have
leveraged semantic inform... | [
{
"created": "Wed, 28 Sep 2022 21:26:38 GMT",
"version": "v1"
}
] | 2022-09-30 | [
[
"Ankenbauer",
"Jacqueline",
""
],
[
"Fathian",
"Kaveh",
""
],
[
"How",
"Jonathan P.",
""
]
] | This paper proposes a novel framework for real-time localization and egomotion tracking of a vehicle in a reference map. The core idea is to map the semantic objects observed by the vehicle and register them to their corresponding objects in the reference map. While several recent works have leveraged semantic informat... |
1306.3767 | Simon Harper | Simon Harper, Tianyi Chen, and Yeliz Yesilada | Controlled Experimentation in Naturalistic Mobile Settings | 12 pages, 3 tables | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Performing controlled user experiments on small devices in naturalistic
mobile settings has always proved to be a difficult undertaking for many Human
Factors researchers. Difficulties exist, not least, because mimicking natural
small device usage suffers from a lack of unobtrusive data to guide
experimental design, ... | [
{
"created": "Mon, 17 Jun 2013 08:36:11 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Jun 2013 06:57:13 GMT",
"version": "v2"
}
] | 2013-06-19 | [
[
"Harper",
"Simon",
""
],
[
"Chen",
"Tianyi",
""
],
[
"Yesilada",
"Yeliz",
""
]
] | Performing controlled user experiments on small devices in naturalistic mobile settings has always proved to be a difficult undertaking for many Human Factors researchers. Difficulties exist, not least, because mimicking natural small device usage suffers from a lack of unobtrusive data to guide experimental design, an... |
1909.05700 | Ante Qu | Alejandro M. Castro, Ante Qu, Naveen Kuppuswamy, Alex Alspach, and
Michael Sherman | A Transition-Aware Method for the Simulation of Compliant Contact with
Regularized Friction | Published in IEEE RA-L and accepted to ICRA 2020. The first two
authors contributed equally to this work. Copyright 2020 IEEE. Personal use
of this material is permitted. Permission from IEEE must be obtained for all
other uses, in any current or future media. The supplemental video is
available publicly at htt... | in IEEE Robotics and Automation Letters, vol. 5, no. 2, pp.
1859-1866, April 2020 | 10.1109/LRA.2020.2969933 | null | cs.RO cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multibody simulation with frictional contact has been a challenging subject
of research for the past thirty years. Rigid-body assumptions are commonly used
to approximate the physics of contact, and together with Coulomb friction, lead
to challenging-to-solve nonlinear complementarity problems (NCP). On the other
han... | [
{
"created": "Thu, 12 Sep 2019 14:16:23 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Sep 2019 15:16:33 GMT",
"version": "v2"
},
{
"created": "Mon, 20 Apr 2020 00:49:53 GMT",
"version": "v3"
}
] | 2020-04-21 | [
[
"Castro",
"Alejandro M.",
""
],
[
"Qu",
"Ante",
""
],
[
"Kuppuswamy",
"Naveen",
""
],
[
"Alspach",
"Alex",
""
],
[
"Sherman",
"Michael",
""
]
] | Multibody simulation with frictional contact has been a challenging subject of research for the past thirty years. Rigid-body assumptions are commonly used to approximate the physics of contact, and together with Coulomb friction, lead to challenging-to-solve nonlinear complementarity problems (NCP). On the other hand,... |
2406.07933 | Chris Yuhao Liu | Chris Yuhao Liu, Yaxuan Wang, Jeffrey Flanigan, Yang Liu | Large Language Model Unlearning via Embedding-Corrupted Prompts | 55 pages, 4 figures, 66 tables | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Large language models (LLMs) have advanced to encompass extensive knowledge
across diverse domains. Yet controlling what a large language model should not
know is important for ensuring alignment and thus safe use. However, accurately
and efficiently unlearning knowledge from an LLM remains challenging due to the
pot... | [
{
"created": "Wed, 12 Jun 2024 06:56:20 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Liu",
"Chris Yuhao",
""
],
[
"Wang",
"Yaxuan",
""
],
[
"Flanigan",
"Jeffrey",
""
],
[
"Liu",
"Yang",
""
]
] | Large language models (LLMs) have advanced to encompass extensive knowledge across diverse domains. Yet controlling what a large language model should not know is important for ensuring alignment and thus safe use. However, accurately and efficiently unlearning knowledge from an LLM remains challenging due to the poten... |
1101.0133 | Nihar Shah | K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar | Enabling Node Repair in Any Erasure Code for Distributed Storage | IEEE International Symposium on Information Theory (ISIT) 2011 (to be
presented) | null | 10.1109/ISIT.2011.6033732 | null | cs.IT cs.DC cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Erasure codes are an efficient means of storing data across a network in
comparison to data replication, as they tend to reduce the amount of data
stored in the network and offer increased resilience in the presence of node
failures. The codes perform poorly though, when repair of a failed node is
called for, as they... | [
{
"created": "Thu, 30 Dec 2010 19:00:00 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Jun 2011 10:10:00 GMT",
"version": "v2"
}
] | 2016-11-17 | [
[
"Rashmi",
"K. V.",
""
],
[
"Shah",
"Nihar B.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] | Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they t... |
2401.17168 | Sergey Pupyrev | Amir Ayupov and Maksim Panchenko and Sergey Pupyrev | Stale Profile Matching | ACM SIGPLAN 33rd International Conference on Compiler Construction
(CC 2024) | null | null | null | cs.PL cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Profile-guided optimizations rely on profile data for directing compilers to
generate optimized code. To achieve the maximum performance boost, profile data
needs to be collected on the same version of the binary that is being
optimized. In practice however, there is typically a gap between the profile
collection and... | [
{
"created": "Tue, 30 Jan 2024 16:56:32 GMT",
"version": "v1"
}
] | 2024-01-31 | [
[
"Ayupov",
"Amir",
""
],
[
"Panchenko",
"Maksim",
""
],
[
"Pupyrev",
"Sergey",
""
]
] | Profile-guided optimizations rely on profile data for directing compilers to generate optimized code. To achieve the maximum performance boost, profile data needs to be collected on the same version of the binary that is being optimized. In practice however, there is typically a gap between the profile collection and t... |
2011.11860 | Yixin Liu | Zhao Li, Yixin Liu, Zhen Zhang, Shirui Pan, Jianliang Gao, Jiajun Bu | Cyclic Label Propagation for Graph Semi-supervised Learning | 19 pages, 4 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph neural networks (GNNs) have emerged as effective approaches for graph
analysis, especially in the scenario of semi-supervised learning. Despite its
success, GNN often suffers from over-smoothing and over-fitting problems, which
affects its performance on node classification tasks. We analyze that an
alternative... | [
{
"created": "Tue, 24 Nov 2020 02:55:40 GMT",
"version": "v1"
}
] | 2020-11-25 | [
[
"Li",
"Zhao",
""
],
[
"Liu",
"Yixin",
""
],
[
"Zhang",
"Zhen",
""
],
[
"Pan",
"Shirui",
""
],
[
"Gao",
"Jianliang",
""
],
[
"Bu",
"Jiajun",
""
]
] | Graph neural networks (GNNs) have emerged as effective approaches for graph analysis, especially in the scenario of semi-supervised learning. Despite its success, GNN often suffers from over-smoothing and over-fitting problems, which affects its performance on node classification tasks. We analyze that an alternative m... |
1308.3174 | Jesse Shore | Benjamin Lubin, Jesse Shore and Vatche Ishakian | Communication Network Design: Balancing Modularity and Mixing via
Optimal Graph Spectra | null | null | null | null | cs.SI cs.GT cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By leveraging information technologies, organizations now have the ability to
design their communication networks and crowdsourcing platforms to pursue
various performance goals, but existing research on network design does not
account for the specific features of social networks, such as the notion of
teams. We fill... | [
{
"created": "Wed, 14 Aug 2013 16:29:28 GMT",
"version": "v1"
}
] | 2013-08-15 | [
[
"Lubin",
"Benjamin",
""
],
[
"Shore",
"Jesse",
""
],
[
"Ishakian",
"Vatche",
""
]
] | By leveraging information technologies, organizations now have the ability to design their communication networks and crowdsourcing platforms to pursue various performance goals, but existing research on network design does not account for the specific features of social networks, such as the notion of teams. We fill t... |
2106.08013 | Man Zhou | Man Zhou, Qian Wang (Senior Member, IEEE), Qi Li (Senior Member,
IEEE), Peipei Jiang, Jingxiao Yang, Chao Shen (Senior Member, IEEE), Cong
Wang (Fellow, IEEE), and Shouhong Ding | Securing Face Liveness Detection Using Unforgeable Lip Motion Patterns | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Face authentication usually utilizes deep learning models to verify users
with high recognition accuracy. However, face authentication systems are
vulnerable to various attacks that cheat the models by manipulating the digital
counterparts of human faces. So far, lots of liveness detection schemes have
been developed... | [
{
"created": "Tue, 15 Jun 2021 09:46:46 GMT",
"version": "v1"
}
] | 2021-06-16 | [
[
"Zhou",
"Man",
"",
"Senior Member, IEEE"
],
[
"Wang",
"Qian",
"",
"Senior Member, IEEE"
],
[
"Li",
"Qi",
"",
"Senior Member,\n IEEE"
],
[
"Jiang",
"Peipei",
"",
"Senior Member, IEEE"
],
[
"Yang",
"Jingxiao",
"",
"Seni... | Face authentication usually utilizes deep learning models to verify users with high recognition accuracy. However, face authentication systems are vulnerable to various attacks that cheat the models by manipulating the digital counterparts of human faces. So far, lots of liveness detection schemes have been developed t... |
2404.17452 | Richard Michael | Richard Michael, Simon Bartels, Miguel Gonz\'alez-Duque, Yevgen
Zainchkovskyy, Jes Frellsen, S{\o}ren Hauberg, Wouter Boomsma | A Continuous Relaxation for Discrete Bayesian Optimization | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-sa/4.0/ | To optimize efficiently over discrete data and with only few available target
observations is a challenge in Bayesian optimization. We propose a continuous
relaxation of the objective function and show that inference and optimization
can be computationally tractable. We consider in particular the optimization
domain ... | [
{
"created": "Fri, 26 Apr 2024 14:47:40 GMT",
"version": "v1"
}
] | 2024-04-29 | [
[
"Michael",
"Richard",
""
],
[
"Bartels",
"Simon",
""
],
[
"González-Duque",
"Miguel",
""
],
[
"Zainchkovskyy",
"Yevgen",
""
],
[
"Frellsen",
"Jes",
""
],
[
"Hauberg",
"Søren",
""
],
[
"Boomsma",
"Wouter",
"... | To optimize efficiently over discrete data and with only few available target observations is a challenge in Bayesian optimization. We propose a continuous relaxation of the objective function and show that inference and optimization can be computationally tractable. We consider in particular the optimization domain wh... |
2309.10801 | Diane Uwacu | Diane Uwacu, Ananya Yammanuru, Keerthana Nallamotu, Vasu Chalasani,
Marco Morales, Nancy M. Amato | Hierarchical Annotated Skeleton-Guided Tree-based Motion Planning | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a hierarchical tree-based motion planning strategy, HAS-RRT,
guided by the workspace skeleton to solve motion planning problems in robotics
and computational biology. Relying on the information about the connectivity of
the workspace and the ranking of available paths in the workspace, the strategy
priorit... | [
{
"created": "Tue, 19 Sep 2023 17:46:36 GMT",
"version": "v1"
}
] | 2023-09-20 | [
[
"Uwacu",
"Diane",
""
],
[
"Yammanuru",
"Ananya",
""
],
[
"Nallamotu",
"Keerthana",
""
],
[
"Chalasani",
"Vasu",
""
],
[
"Morales",
"Marco",
""
],
[
"Amato",
"Nancy M.",
""
]
] | We present a hierarchical tree-based motion planning strategy, HAS-RRT, guided by the workspace skeleton to solve motion planning problems in robotics and computational biology. Relying on the information about the connectivity of the workspace and the ranking of available paths in the workspace, the strategy prioritiz... |
2104.12574 | Yang Liu | Yang Liu, Luiz G. Hafemann, Michael Jamieson, Mehrsan Javan | Detecting and Matching Related Objects with One Proposal Multiple
Predictions | CVPR workshop 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tracking players in sports videos is commonly done in a tracking-by-detection
framework, first detecting players in each frame, and then performing
association over time. While for some sports tracking players is sufficient for
game analysis, sports like hockey, tennis and polo may require additional
detections, that... | [
{
"created": "Fri, 23 Apr 2021 14:37:10 GMT",
"version": "v1"
}
] | 2021-04-27 | [
[
"Liu",
"Yang",
""
],
[
"Hafemann",
"Luiz G.",
""
],
[
"Jamieson",
"Michael",
""
],
[
"Javan",
"Mehrsan",
""
]
] | Tracking players in sports videos is commonly done in a tracking-by-detection framework, first detecting players in each frame, and then performing association over time. While for some sports tracking players is sufficient for game analysis, sports like hockey, tennis and polo may require additional detections, that i... |
2202.11055 | Mihir Kulkarni | Paolo De Petris, Huan Nguyen, Mihir Dharmadhikari, Mihir Kulkarni,
Nikhil Khedekar, Frank Mascarich, Kostas Alexis | RMF-Owl: A Collision-Tolerant Flying Robot for Autonomous Subterranean
Exploration | 8 pages, 9 figures. Submitted to the International Conference on
Unmanned Aircraft Systems, 2022 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work presents the design, hardware realization, autonomous exploration
and object detection capabilities of RMF-Owl, a new collision-tolerant aerial
robot tailored for resilient autonomous subterranean exploration. The system is
custom built for underground exploration with focus on collision tolerance,
resilien... | [
{
"created": "Tue, 22 Feb 2022 17:36:29 GMT",
"version": "v1"
}
] | 2022-02-23 | [
[
"De Petris",
"Paolo",
""
],
[
"Nguyen",
"Huan",
""
],
[
"Dharmadhikari",
"Mihir",
""
],
[
"Kulkarni",
"Mihir",
""
],
[
"Khedekar",
"Nikhil",
""
],
[
"Mascarich",
"Frank",
""
],
[
"Alexis",
"Kostas",
""
]
... | This work presents the design, hardware realization, autonomous exploration and object detection capabilities of RMF-Owl, a new collision-tolerant aerial robot tailored for resilient autonomous subterranean exploration. The system is custom built for underground exploration with focus on collision tolerance, resilient ... |
1601.01228 | Maumita Bhattacharya | J. West and Maumita Bhattacharya | Some Experimental Issues in Financial Fraud Detection: An Investigation | J. West and Maumita Bhattacharya. "Some Experimental Issues in
Financial Fraud Detection: An Investigation", In the Proceedings of The 5th
International Symposium on Cloud and Service Computing (SC2 2015), IEEE CS
Press | null | null | null | cs.CR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Financial fraud detection is an important problem with a number of design
aspects to consider. Issues such as algorithm selection and performance
analysis will affect the perceived ability of proposed solutions, so for
auditors and re-searchers to be able to sufficiently detect financial fraud it
is necessary that th... | [
{
"created": "Wed, 6 Jan 2016 16:18:43 GMT",
"version": "v1"
}
] | 2016-01-07 | [
[
"West",
"J.",
""
],
[
"Bhattacharya",
"Maumita",
""
]
] | Financial fraud detection is an important problem with a number of design aspects to consider. Issues such as algorithm selection and performance analysis will affect the perceived ability of proposed solutions, so for auditors and re-searchers to be able to sufficiently detect financial fraud it is necessary that thes... |
1904.00338 | Huazhen Fang | Chuan Yan and Huazhen Fang | Observer-Based Distributed Leader-Follower Tracking Control: A New
Perspective and Results | International Journal of Control 2019 | null | 10.1080/00207179.2019.1580770 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Leader-follower tracking control design has received significant attention in
recent years due to its important and wide applications. Considering a
multi-agent system composed of a leader and multiple followers, this paper
proposes and investigates a new perspective into this problem: can we enable a
follower to est... | [
{
"created": "Sun, 31 Mar 2019 04:25:21 GMT",
"version": "v1"
}
] | 2019-04-02 | [
[
"Yan",
"Chuan",
""
],
[
"Fang",
"Huazhen",
""
]
] | Leader-follower tracking control design has received significant attention in recent years due to its important and wide applications. Considering a multi-agent system composed of a leader and multiple followers, this paper proposes and investigates a new perspective into this problem: can we enable a follower to estim... |
1903.08969 | Sayed Chhattan Shah | Sayed Chhattan Shah | An Energy-Efficient Resource Management System for a Mobile Ad Hoc Cloud | 19 Pages | IEEE ACCESS 2019 | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, mobile ad hoc clouds have emerged as a promising technology for
mobile cyber-physical system applications, such as mobile intelligent video
surveillance and smart homes. Resource management plays a key role in
maximizing resource utilization and application performance in mobile ad hoc
clouds. Unlike resour... | [
{
"created": "Thu, 21 Mar 2019 13:03:53 GMT",
"version": "v1"
}
] | 2019-03-22 | [
[
"Shah",
"Sayed Chhattan",
""
]
] | Recently, mobile ad hoc clouds have emerged as a promising technology for mobile cyber-physical system applications, such as mobile intelligent video surveillance and smart homes. Resource management plays a key role in maximizing resource utilization and application performance in mobile ad hoc clouds. Unlike resource... |
2309.15782 | Vipin Gautam | Vipin Gautam, Shitala Prasad and Sharad Sinha | Joint-YODNet: A Light-weight Object Detector for UAVs to Achieve Above
100fps | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Small object detection via UAV (Unmanned Aerial Vehicle) images captured from
drones and radar is a complex task with several formidable challenges. This
domain encompasses numerous complexities that impede the accurate detection and
localization of small objects. To address these challenges, we propose a novel
metho... | [
{
"created": "Wed, 27 Sep 2023 16:57:04 GMT",
"version": "v1"
}
] | 2023-09-28 | [
[
"Gautam",
"Vipin",
""
],
[
"Prasad",
"Shitala",
""
],
[
"Sinha",
"Sharad",
""
]
] | Small object detection via UAV (Unmanned Aerial Vehicle) images captured from drones and radar is a complex task with several formidable challenges. This domain encompasses numerous complexities that impede the accurate detection and localization of small objects. To address these challenges, we propose a novel method ... |
2104.12874 | Soo Hyun Ryu | Soo Hyun Ryu and Richard L. Lewis | Accounting for Agreement Phenomena in Sentence Comprehension with
Transformer Language Models: Effects of Similarity-based Interference on
Surprisal and Attention | CMCL 2021 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We advance a novel explanation of similarity-based interference effects in
subject-verb and reflexive pronoun agreement processing, grounded in surprisal
values computed from a pretrained large-scale Transformer model, GPT-2.
Specifically, we show that surprisal of the verb or reflexive pronoun predicts
facilitatory ... | [
{
"created": "Mon, 26 Apr 2021 20:46:54 GMT",
"version": "v1"
}
] | 2021-04-28 | [
[
"Ryu",
"Soo Hyun",
""
],
[
"Lewis",
"Richard L.",
""
]
] | We advance a novel explanation of similarity-based interference effects in subject-verb and reflexive pronoun agreement processing, grounded in surprisal values computed from a pretrained large-scale Transformer model, GPT-2. Specifically, we show that surprisal of the verb or reflexive pronoun predicts facilitatory in... |
2009.03586 | Aijun Zhang | Zebin Yang and Aijun Zhang | Hyperparameter Optimization via Sequential Uniform Designs | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hyperparameter optimization (HPO) plays a central role in the automated
machine learning (AutoML). It is a challenging task as the response surfaces of
hyperparameters are generally unknown, hence essentially a global optimization
problem. This paper reformulates HPO as a computer experiment and proposes a
novel sequ... | [
{
"created": "Tue, 8 Sep 2020 08:55:02 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Jun 2021 09:12:26 GMT",
"version": "v2"
}
] | 2021-06-18 | [
[
"Yang",
"Zebin",
""
],
[
"Zhang",
"Aijun",
""
]
] | Hyperparameter optimization (HPO) plays a central role in the automated machine learning (AutoML). It is a challenging task as the response surfaces of hyperparameters are generally unknown, hence essentially a global optimization problem. This paper reformulates HPO as a computer experiment and proposes a novel sequen... |
2007.05828 | Ka-Ho Chow | Ka-Ho Chow, Ling Liu, Mehmet Emre Gursoy, Stacey Truex, Wenqi Wei,
Yanzhao Wu | Understanding Object Detection Through An Adversarial Lens | null | null | null | null | cs.CR cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks based object detection models have revolutionized
computer vision and fueled the development of a wide range of visual
recognition applications. However, recent studies have revealed that deep
object detectors can be compromised under adversarial attacks, causing a victim
detector to detect no ob... | [
{
"created": "Sat, 11 Jul 2020 18:41:47 GMT",
"version": "v1"
}
] | 2020-07-14 | [
[
"Chow",
"Ka-Ho",
""
],
[
"Liu",
"Ling",
""
],
[
"Gursoy",
"Mehmet Emre",
""
],
[
"Truex",
"Stacey",
""
],
[
"Wei",
"Wenqi",
""
],
[
"Wu",
"Yanzhao",
""
]
] | Deep neural networks based object detection models have revolutionized computer vision and fueled the development of a wide range of visual recognition applications. However, recent studies have revealed that deep object detectors can be compromised under adversarial attacks, causing a victim detector to detect no obje... |
2105.01423 | Bilal Thonnam Thodi | Bilal Thonnam Thodi, Zaid Saeed Khan, Saif Eddin Jabari and Monica
Menendez | Learning Traffic Speed Dynamics from Visualizations | 8 pages, 9 figures; Submitted to the 2021 IEEE International
Intelligent Transportation Systems Conference (ITSC) | The 2021 IEEE International Intelligent Transportation Systems
Conference (ITSC), 2021, pp.1239-1244 | 10.1109/ITSC48978.2021.9564541 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Space-time visualizations of macroscopic or microscopic traffic variables is
a qualitative tool used by traffic engineers to understand and analyze
different aspects of road traffic dynamics. We present a deep learning method
to learn the macroscopic traffic speed dynamics from these space-time
visualizations, and de... | [
{
"created": "Tue, 4 May 2021 11:17:43 GMT",
"version": "v1"
}
] | 2022-04-12 | [
[
"Thodi",
"Bilal Thonnam",
""
],
[
"Khan",
"Zaid Saeed",
""
],
[
"Jabari",
"Saif Eddin",
""
],
[
"Menendez",
"Monica",
""
]
] | Space-time visualizations of macroscopic or microscopic traffic variables is a qualitative tool used by traffic engineers to understand and analyze different aspects of road traffic dynamics. We present a deep learning method to learn the macroscopic traffic speed dynamics from these space-time visualizations, and demo... |
1911.12303 | Shantanu Chakraborty D.Eng. | Shantanu Chakraborty, Tim Baarslag, Michael Kaisers | Automated Peer-to-peer Negotiation for Energy Contract Settlements in
Residential Cooperatives | arXiv admin note: substantial text overlap with arXiv:1807.10978 | null | null | null | cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an automated peer-to-peer negotiation strategy for
settling energy contracts among prosumers in a Residential Energy Cooperative
considering heterogeneity prosumer preferences. The heterogeneity arises from
prosumers' evaluation of energy contracts through multiple societal and
environmental crite... | [
{
"created": "Tue, 26 Nov 2019 02:28:01 GMT",
"version": "v1"
}
] | 2019-11-28 | [
[
"Chakraborty",
"Shantanu",
""
],
[
"Baarslag",
"Tim",
""
],
[
"Kaisers",
"Michael",
""
]
] | This paper presents an automated peer-to-peer negotiation strategy for settling energy contracts among prosumers in a Residential Energy Cooperative considering heterogeneity prosumer preferences. The heterogeneity arises from prosumers' evaluation of energy contracts through multiple societal and environmental criteri... |
2102.11530 | Kanji Tanaka | Kanji Tanaka | Domain-invariant NBV Planner for Active Cross-domain Self-localization | 5 pages, 5 figures, technical report | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pole-like landmark has received increasing attention as a domain-invariant
visual cue for visual robot self-localization across domains (e.g., seasons,
times of day, weathers). However, self-localization using pole-like landmarks
can be ill-posed for a passive observer, as many viewpoints may not provide any
pole-lik... | [
{
"created": "Tue, 23 Feb 2021 07:36:45 GMT",
"version": "v1"
}
] | 2021-02-24 | [
[
"Tanaka",
"Kanji",
""
]
] | Pole-like landmark has received increasing attention as a domain-invariant visual cue for visual robot self-localization across domains (e.g., seasons, times of day, weathers). However, self-localization using pole-like landmarks can be ill-posed for a passive observer, as many viewpoints may not provide any pole-like ... |
2212.13245 | Roozbeh Aghili | Roozbeh Aghili, Heng Li, Foutse Khomh | Studying the Characteristics of AIOps Projects on GitHub | 46 pages, 8 pages of references, 14 figures, 16 tables | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Artificial Intelligence for IT Operations (AIOps) leverages AI approaches to
handle the massive amount of data generated during the operations of software
systems. Prior works have proposed various AIOps solutions to support different
tasks in system operations and maintenance, such as anomaly detection. In this
stud... | [
{
"created": "Mon, 26 Dec 2022 18:24:45 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Sep 2023 22:02:17 GMT",
"version": "v2"
}
] | 2023-09-07 | [
[
"Aghili",
"Roozbeh",
""
],
[
"Li",
"Heng",
""
],
[
"Khomh",
"Foutse",
""
]
] | Artificial Intelligence for IT Operations (AIOps) leverages AI approaches to handle the massive amount of data generated during the operations of software systems. Prior works have proposed various AIOps solutions to support different tasks in system operations and maintenance, such as anomaly detection. In this study,... |
2011.07368 | Bhaskar Mitra | Bhaskar Mitra, Sebastian Hofstatter, Hamed Zamani and Nick Craswell | Conformer-Kernel with Query Term Independence at TREC 2020 Deep Learning
Track | null | null | null | null | cs.IR cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We benchmark Conformer-Kernel models under the strict blind evaluation
setting of the TREC 2020 Deep Learning track. In particular, we study the
impact of incorporating: (i) Explicit term matching to complement matching
based on learned representations (i.e., the "Duet principle"), (ii) query term
independence (i.e.,... | [
{
"created": "Sat, 14 Nov 2020 19:03:24 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Feb 2021 23:57:45 GMT",
"version": "v2"
}
] | 2021-02-15 | [
[
"Mitra",
"Bhaskar",
""
],
[
"Hofstatter",
"Sebastian",
""
],
[
"Zamani",
"Hamed",
""
],
[
"Craswell",
"Nick",
""
]
] | We benchmark Conformer-Kernel models under the strict blind evaluation setting of the TREC 2020 Deep Learning track. In particular, we study the impact of incorporating: (i) Explicit term matching to complement matching based on learned representations (i.e., the "Duet principle"), (ii) query term independence (i.e., t... |
1505.00157 | Yang Huang | Yang Huang and Bruno Clerckx | Joint Wireless Information and Power Transfer for an Autonomous Multiple
Antenna Relay System | Accepted to IEEE Communications Letters | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Considering a three-node multiple antenna relay system, this paper proposes a
two-phase amplify-and-forward (AF) relaying protocol, which enables the
autonomous relay to simultaneously harvest wireless power from the source
information signal and from an energy signal conveyed by the destination. We
first study this ... | [
{
"created": "Fri, 1 May 2015 11:23:30 GMT",
"version": "v1"
}
] | 2015-05-04 | [
[
"Huang",
"Yang",
""
],
[
"Clerckx",
"Bruno",
""
]
] | Considering a three-node multiple antenna relay system, this paper proposes a two-phase amplify-and-forward (AF) relaying protocol, which enables the autonomous relay to simultaneously harvest wireless power from the source information signal and from an energy signal conveyed by the destination. We first study this en... |
2312.12133 | Wooju Lee | Wooju Lee, Dasol Hong, Hyungtae Lim, and Hyun Myung | Object-Aware Domain Generalization for Object Detection | Accepted by AAAI-24. The first two authors contributed equally | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Single-domain generalization (S-DG) aims to generalize a model to unseen
environments with a single-source domain. However, most S-DG approaches have
been conducted in the field of classification. When these approaches are
applied to object detection, the semantic features of some objects can be
damaged, which can le... | [
{
"created": "Tue, 19 Dec 2023 13:11:35 GMT",
"version": "v1"
}
] | 2023-12-20 | [
[
"Lee",
"Wooju",
""
],
[
"Hong",
"Dasol",
""
],
[
"Lim",
"Hyungtae",
""
],
[
"Myung",
"Hyun",
""
]
] | Single-domain generalization (S-DG) aims to generalize a model to unseen environments with a single-source domain. However, most S-DG approaches have been conducted in the field of classification. When these approaches are applied to object detection, the semantic features of some objects can be damaged, which can lead... |
1708.05847 | Patricia Bouyer | Patricia Bouyer, Serge Haddad, Vincent Jug\'e | Unbounded product-form Petri nets | 31 pages | null | null | null | cs.PF cs.DM cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computing steady-state distributions in infinite-state stochastic systems is
in general a very dificult task. Product-form Petri nets are those Petri nets
for which the steady-state distribution can be described as a natural product
corresponding, up to a normalising constant, to an exponentiation of the
markings. Ho... | [
{
"created": "Sat, 19 Aug 2017 14:06:03 GMT",
"version": "v1"
}
] | 2017-08-22 | [
[
"Bouyer",
"Patricia",
""
],
[
"Haddad",
"Serge",
""
],
[
"Jugé",
"Vincent",
""
]
] | Computing steady-state distributions in infinite-state stochastic systems is in general a very dificult task. Product-form Petri nets are those Petri nets for which the steady-state distribution can be described as a natural product corresponding, up to a normalising constant, to an exponentiation of the markings. Howe... |
1608.06132 | J\"orn Fischer | J. Fischer, P. Manoonpong, S. Lackner | Reconstructing Neural Parameters and Synapses of arbitrary
interconnected Neurons from their Simulated Spiking Activity | 6 pages, 7 figures | null | null | null | cs.NE q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To understand the behavior of a neural circuit it is a presupposition that we
have a model of the dynamical system describing this circuit. This model is
determined by several parameters, including not only the synaptic weights, but
also the parameters of each neuron. Existing works mainly concentrate on either
the s... | [
{
"created": "Mon, 22 Aug 2016 11:47:18 GMT",
"version": "v1"
}
] | 2016-08-23 | [
[
"Fischer",
"J.",
""
],
[
"Manoonpong",
"P.",
""
],
[
"Lackner",
"S.",
""
]
] | To understand the behavior of a neural circuit it is a presupposition that we have a model of the dynamical system describing this circuit. This model is determined by several parameters, including not only the synaptic weights, but also the parameters of each neuron. Existing works mainly concentrate on either the syn... |
2202.03814 | Maarten Buyl | Maarten Buyl, Tijl De Bie | Optimal Transport of Classifiers to Fairness | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | In past work on fairness in machine learning, the focus has been on forcing
the prediction of classifiers to have similar statistical properties for people
of different demographics. To reduce the violation of these properties,
fairness methods usually simply rescale the classifier scores, ignoring
similarities and d... | [
{
"created": "Tue, 8 Feb 2022 12:16:24 GMT",
"version": "v1"
},
{
"created": "Tue, 31 May 2022 14:20:06 GMT",
"version": "v2"
},
{
"created": "Tue, 29 Nov 2022 22:11:08 GMT",
"version": "v3"
}
] | 2022-12-02 | [
[
"Buyl",
"Maarten",
""
],
[
"De Bie",
"Tijl",
""
]
] | In past work on fairness in machine learning, the focus has been on forcing the prediction of classifiers to have similar statistical properties for people of different demographics. To reduce the violation of these properties, fairness methods usually simply rescale the classifier scores, ignoring similarities and dis... |
2010.15665 | Noah Goodall | Noah J. Goodall | Machine Ethics and Automated Vehicles | 12 pages | In: Meyer G., Beiker S. (eds) Road Vehicle Automation. Lecture
Notes in Mobility. Springer, Cham (2014) | 10.1007/978-3-319-05990-7_9 | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Road vehicle travel at a reasonable speed involves some risk, even when using
computer-controlled driving with failure-free hardware and perfect sensing. A
fully-automated vehicle must continuously decide how to allocate this risk
without a human driver's oversight. These are ethical decisions, particularly
in instan... | [
{
"created": "Thu, 29 Oct 2020 15:14:47 GMT",
"version": "v1"
}
] | 2020-10-30 | [
[
"Goodall",
"Noah J.",
""
]
] | Road vehicle travel at a reasonable speed involves some risk, even when using computer-controlled driving with failure-free hardware and perfect sensing. A fully-automated vehicle must continuously decide how to allocate this risk without a human driver's oversight. These are ethical decisions, particularly in instance... |
1603.07779 | Thomas Watson | Thomas Watson | Nonnegative Rank vs. Binary Rank | null | Chicago Journal of Theoretical Computer Science 2016, Article 2,
pages 1-13 | 10.4086/cjtcs.2016.002 | null | cs.CC cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated by (and using tools from) communication complexity, we investigate
the relationship between the following two ranks of a $0$-$1$ matrix: its
nonnegative rank and its binary rank (the $\log$ of the latter being the
unambiguous nondeterministic communication complexity). We prove that for
partial $0$-$1$ matr... | [
{
"created": "Thu, 24 Mar 2016 23:21:41 GMT",
"version": "v1"
}
] | 2016-03-28 | [
[
"Watson",
"Thomas",
""
]
] | Motivated by (and using tools from) communication complexity, we investigate the relationship between the following two ranks of a $0$-$1$ matrix: its nonnegative rank and its binary rank (the $\log$ of the latter being the unambiguous nondeterministic communication complexity). We prove that for partial $0$-$1$ matric... |
2012.05901 | Jia-Bin Huang | Johannes Kopf, Xuejian Rong, Jia-Bin Huang | Robust Consistent Video Depth Estimation | Project website: https://robust-cvd.github.io/ | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | We present an algorithm for estimating consistent dense depth maps and camera
poses from a monocular video. We integrate a learning-based depth prior, in the
form of a convolutional neural network trained for single-image depth
estimation, with geometric optimization, to estimate a smooth camera trajectory
as well as... | [
{
"created": "Thu, 10 Dec 2020 18:59:48 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Jun 2021 03:33:03 GMT",
"version": "v2"
}
] | 2021-06-23 | [
[
"Kopf",
"Johannes",
""
],
[
"Rong",
"Xuejian",
""
],
[
"Huang",
"Jia-Bin",
""
]
] | We present an algorithm for estimating consistent dense depth maps and camera poses from a monocular video. We integrate a learning-based depth prior, in the form of a convolutional neural network trained for single-image depth estimation, with geometric optimization, to estimate a smooth camera trajectory as well as d... |
1410.0478 | Subhadip Basu | Nibaran Das, Sandip Pramanik, Subhadip Basu, Punam Kumar Saha, Ram
Sarkar, Mahantapas Kundu, Mita Nasipuri | Recognition of Handwritten Bangla Basic Characters and Digits using
Convex Hull based Feature Set | null | 2009 International Conference on Artificial Intelligence and
Pattern Recognition, At Orlando, Florida pp. 380-386 | 10.13140/2.1.3689.4089 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In dealing with the problem of recognition of handwritten character patterns
of varying shapes and sizes, selection of a proper feature set is important to
achieve high recognition performance. The current research aims to evaluate the
performance of the convex hull based feature set, i.e. 125 features in all
compute... | [
{
"created": "Thu, 2 Oct 2014 08:26:38 GMT",
"version": "v1"
}
] | 2014-10-03 | [
[
"Das",
"Nibaran",
""
],
[
"Pramanik",
"Sandip",
""
],
[
"Basu",
"Subhadip",
""
],
[
"Saha",
"Punam Kumar",
""
],
[
"Sarkar",
"Ram",
""
],
[
"Kundu",
"Mahantapas",
""
],
[
"Nasipuri",
"Mita",
""
]
] | In dealing with the problem of recognition of handwritten character patterns of varying shapes and sizes, selection of a proper feature set is important to achieve high recognition performance. The current research aims to evaluate the performance of the convex hull based feature set, i.e. 125 features in all computed ... |
1403.6331 | P{\aa}l Gr{\o}n{\aa}s Drange | P{\aa}l Gr{\o}n{\aa}s Drange, Markus Sortland Dregi, Pim van 't Hof | On the Computational Complexity of Vertex Integrity and Component Order
Connectivity | A preliminary version of this paper already appeared in the
conference proceedings of ISAAC 2014 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Weighted Vertex Integrity (wVI) problem takes as input an $n$-vertex
graph $G$, a weight function $w:V(G)\to\mathbb{N}$, and an integer $p$. The
task is to decide if there exists a set $X\subseteq V(G)$ such that the weight
of $X$ plus the weight of a heaviest component of $G-X$ is at most $p$. Among
other result... | [
{
"created": "Tue, 25 Mar 2014 13:11:09 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Dec 2014 11:32:17 GMT",
"version": "v2"
}
] | 2014-12-05 | [
[
"Drange",
"Pål Grønås",
""
],
[
"Dregi",
"Markus Sortland",
""
],
[
"Hof",
"Pim van 't",
""
]
] | The Weighted Vertex Integrity (wVI) problem takes as input an $n$-vertex graph $G$, a weight function $w:V(G)\to\mathbb{N}$, and an integer $p$. The task is to decide if there exists a set $X\subseteq V(G)$ such that the weight of $X$ plus the weight of a heaviest component of $G-X$ is at most $p$. Among other results,... |
2403.05049 | Yunpeng Qu | Yunpeng Qu, Kun Yuan, Kai Zhao, Qizhi Xie, Jinhua Hao, Ming Sun and
Chao Zhou | XPSR: Cross-modal Priors for Diffusion-based Image Super-Resolution | 19 pages, 7 figures; including supplementary material | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diffusion-based methods, endowed with a formidable generative prior, have
received increasing attention in Image Super-Resolution (ISR) recently.
However, as low-resolution (LR) images often undergo severe degradation, it is
challenging for ISR models to perceive the semantic and degradation
information, resulting in... | [
{
"created": "Fri, 8 Mar 2024 04:52:22 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jul 2024 16:31:19 GMT",
"version": "v2"
}
] | 2024-07-22 | [
[
"Qu",
"Yunpeng",
""
],
[
"Yuan",
"Kun",
""
],
[
"Zhao",
"Kai",
""
],
[
"Xie",
"Qizhi",
""
],
[
"Hao",
"Jinhua",
""
],
[
"Sun",
"Ming",
""
],
[
"Zhou",
"Chao",
""
]
] | Diffusion-based methods, endowed with a formidable generative prior, have received increasing attention in Image Super-Resolution (ISR) recently. However, as low-resolution (LR) images often undergo severe degradation, it is challenging for ISR models to perceive the semantic and degradation information, resulting in r... |
2001.11164 | Zihan Liu | Zihan Liu, Genta Indra Winata, Samuel Cahyawijaya, Andrea Madotto,
Zhaojiang Lin, Pascale Fung | On the Importance of Word Order Information in Cross-lingual Sequence
Labeling | Accepted in AAAI-2021 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Word order variances generally exist in different languages. In this paper,
we hypothesize that cross-lingual models that fit into the word order of the
source language might fail to handle target languages. To verify this
hypothesis, we investigate whether making models insensitive to the word order
of the source la... | [
{
"created": "Thu, 30 Jan 2020 03:35:44 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Feb 2020 12:18:32 GMT",
"version": "v2"
},
{
"created": "Thu, 19 Mar 2020 15:31:19 GMT",
"version": "v3"
},
{
"created": "Tue, 8 Dec 2020 11:04:04 GMT",
"version": "v4"
}
] | 2020-12-09 | [
[
"Liu",
"Zihan",
""
],
[
"Winata",
"Genta Indra",
""
],
[
"Cahyawijaya",
"Samuel",
""
],
[
"Madotto",
"Andrea",
""
],
[
"Lin",
"Zhaojiang",
""
],
[
"Fung",
"Pascale",
""
]
] | Word order variances generally exist in different languages. In this paper, we hypothesize that cross-lingual models that fit into the word order of the source language might fail to handle target languages. To verify this hypothesis, we investigate whether making models insensitive to the word order of the source lang... |
2308.13249 | Yunzhu Pan | Yunzhu Pan, Nian Li, Chen Gao, Jianxin Chang, Yanan Niu, Yang Song,
Depeng Jin, Yong Li | Learning and Optimization of Implicit Negative Feedback for Industrial
Short-video Recommender System | Accepted by CIKM'23 | null | 10.1145/3583780.3615482 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Short-video recommendation is one of the most important recommendation
applications in today's industrial information systems. Compared with other
recommendation tasks, the enormous amount of feedback is the most typical
characteristic. Specifically, in short-video recommendation, the
easiest-to-collect user feedback... | [
{
"created": "Fri, 25 Aug 2023 08:54:27 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Mar 2024 11:51:01 GMT",
"version": "v2"
}
] | 2024-03-06 | [
[
"Pan",
"Yunzhu",
""
],
[
"Li",
"Nian",
""
],
[
"Gao",
"Chen",
""
],
[
"Chang",
"Jianxin",
""
],
[
"Niu",
"Yanan",
""
],
[
"Song",
"Yang",
""
],
[
"Jin",
"Depeng",
""
],
[
"Li",
"Yong",
""
... | Short-video recommendation is one of the most important recommendation applications in today's industrial information systems. Compared with other recommendation tasks, the enormous amount of feedback is the most typical characteristic. Specifically, in short-video recommendation, the easiest-to-collect user feedback i... |
1607.06676 | Grasha Jacob Mrs | Grasha Jacob, R. Shenbagavalli, S. Karthika | Detection of surface defects on ceramic tiles based on morphological
techniques | 9 pages, 11 figures | null | null | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | Ceramic tiles have become very popular and are used in the flooring of
offices and shopping malls. As testing the quality of tiles manually in a
highly polluted environment in the manufacturing industry is a labor-intensive
and time consuming process, analysis is carried out on the tile images. This
paper discusses a... | [
{
"created": "Thu, 21 Jul 2016 08:25:41 GMT",
"version": "v1"
}
] | 2016-07-25 | [
[
"Jacob",
"Grasha",
""
],
[
"Shenbagavalli",
"R.",
""
],
[
"Karthika",
"S.",
""
]
] | Ceramic tiles have become very popular and are used in the flooring of offices and shopping malls. As testing the quality of tiles manually in a highly polluted environment in the manufacturing industry is a labor-intensive and time consuming process, analysis is carried out on the tile images. This paper discusses an ... |
2010.10117 | Peter Gangl | Peter Gangl and Stefan K\"othe and Christiane Mellak and Alessio
Cesarano and Annette M\"utze | Multi-objective free-form shape optimization of a synchronous reluctance
machine | 6 pages, 7 figures, proceedings to IGTE Symposium Graz 2020 | null | null | null | cs.CE math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper deals with the design optimization of a synchronous reluctance
machine to be used in an X-ray tube, where the goal is to maximize the torque,
by means of gradient-based free-form shape optimization. The presented approach
is based on the mathematical concept of shape derivatives and allows to obtain
new mo... | [
{
"created": "Tue, 20 Oct 2020 08:16:54 GMT",
"version": "v1"
}
] | 2020-10-21 | [
[
"Gangl",
"Peter",
""
],
[
"Köthe",
"Stefan",
""
],
[
"Mellak",
"Christiane",
""
],
[
"Cesarano",
"Alessio",
""
],
[
"Mütze",
"Annette",
""
]
] | This paper deals with the design optimization of a synchronous reluctance machine to be used in an X-ray tube, where the goal is to maximize the torque, by means of gradient-based free-form shape optimization. The presented approach is based on the mathematical concept of shape derivatives and allows to obtain new moto... |
1709.08359 | Robert Brijder | Robert Brijder, Floris Geerts, Jan Van den Bussche, Timmy Weerwag | On the expressive power of query languages for matrices | 21 pages, 3 figures | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the expressive power of $\mathsf{MATLANG}$, a formal language
for matrix manipulation based on common matrix operations and linear algebra.
The language can be extended with the operation $\mathsf{inv}$ of inverting a
matrix. In $\mathsf{MATLANG}+\mathsf{inv}$ we can compute the transitive
closure of d... | [
{
"created": "Mon, 25 Sep 2017 08:05:00 GMT",
"version": "v1"
}
] | 2017-09-26 | [
[
"Brijder",
"Robert",
""
],
[
"Geerts",
"Floris",
""
],
[
"Bussche",
"Jan Van den",
""
],
[
"Weerwag",
"Timmy",
""
]
] | We investigate the expressive power of $\mathsf{MATLANG}$, a formal language for matrix manipulation based on common matrix operations and linear algebra. The language can be extended with the operation $\mathsf{inv}$ of inverting a matrix. In $\mathsf{MATLANG}+\mathsf{inv}$ we can compute the transitive closure of dir... |
2209.04126 | Tatsuya Hiraoka | Tatsuya Hiraoka | MaxMatch-Dropout: Subword Regularization for WordPiece | Accepted to appear at COLING2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a subword regularization method for WordPiece, which uses a
maximum matching algorithm for tokenization. The proposed method,
MaxMatch-Dropout, randomly drops words in a search using the maximum matching
algorithm. It realizes finetuning with subword regularization for popular
pretrained language models su... | [
{
"created": "Fri, 9 Sep 2022 05:41:26 GMT",
"version": "v1"
}
] | 2022-09-12 | [
[
"Hiraoka",
"Tatsuya",
""
]
] | We present a subword regularization method for WordPiece, which uses a maximum matching algorithm for tokenization. The proposed method, MaxMatch-Dropout, randomly drops words in a search using the maximum matching algorithm. It realizes finetuning with subword regularization for popular pretrained language models such... |
2206.04992 | Xiaoxia Xu | Xiaoxia Xu, Yuanwei Liu, Xidong Mu, Qimei Chen, Hao Jiang, and Zhiguo
Ding | Artificial Intelligence Enabled NOMA Towards Next Generation Multiple
Access | This article has been accepted by IEEE Wireless Communications
Magazine | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article focuses on the application of artificial intelligence (AI) in
non-orthogonal multiple-access (NOMA), which aims to achieve automated,
adaptive, and high-efficiency multi-user communications towards next generation
multiple access (NGMA). First, the limitations of current scenario-specific
multiple-antenn... | [
{
"created": "Fri, 10 Jun 2022 10:59:56 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Sep 2022 19:29:03 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Dec 2022 09:28:57 GMT",
"version": "v3"
}
] | 2022-12-14 | [
[
"Xu",
"Xiaoxia",
""
],
[
"Liu",
"Yuanwei",
""
],
[
"Mu",
"Xidong",
""
],
[
"Chen",
"Qimei",
""
],
[
"Jiang",
"Hao",
""
],
[
"Ding",
"Zhiguo",
""
]
] | This article focuses on the application of artificial intelligence (AI) in non-orthogonal multiple-access (NOMA), which aims to achieve automated, adaptive, and high-efficiency multi-user communications towards next generation multiple access (NGMA). First, the limitations of current scenario-specific multiple-antenna ... |
1907.01647 | Yong Liu Stephen | Yong Liu, Yingtai Xiao, Qiong Wu, Chunyan Miao, Juyong Zhang | Bandit Learning for Diversified Interactive Recommendation | null | null | null | null | cs.IR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interactive recommender systems that enable the interactions between users
and the recommender system have attracted increasing research attentions.
Previous methods mainly focus on optimizing recommendation accuracy. However,
they usually ignore the diversity of the recommendation results, thus usually
results in un... | [
{
"created": "Mon, 1 Jul 2019 03:52:55 GMT",
"version": "v1"
}
] | 2019-07-04 | [
[
"Liu",
"Yong",
""
],
[
"Xiao",
"Yingtai",
""
],
[
"Wu",
"Qiong",
""
],
[
"Miao",
"Chunyan",
""
],
[
"Zhang",
"Juyong",
""
]
] | Interactive recommender systems that enable the interactions between users and the recommender system have attracted increasing research attentions. Previous methods mainly focus on optimizing recommendation accuracy. However, they usually ignore the diversity of the recommendation results, thus usually results in unsa... |
2107.05328 | Xiaofeng Liu | Yinchuan Li, Xiaofeng Liu, Yunfeng Shao, Qing Wang and Yanhui Geng | Structured Directional Pruning via Perturbation Orthogonal Projection | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structured pruning is an effective compression technique to reduce the
computation of neural networks, which is usually achieved by adding
perturbations to reduce network parameters at the cost of slightly increasing
training loss. A more reasonable approach is to find a sparse minimizer along
the flat minimum valley... | [
{
"created": "Mon, 12 Jul 2021 11:35:47 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Oct 2021 14:18:35 GMT",
"version": "v2"
}
] | 2021-10-22 | [
[
"Li",
"Yinchuan",
""
],
[
"Liu",
"Xiaofeng",
""
],
[
"Shao",
"Yunfeng",
""
],
[
"Wang",
"Qing",
""
],
[
"Geng",
"Yanhui",
""
]
] | Structured pruning is an effective compression technique to reduce the computation of neural networks, which is usually achieved by adding perturbations to reduce network parameters at the cost of slightly increasing training loss. A more reasonable approach is to find a sparse minimizer along the flat minimum valley f... |
2406.12769 | Xiangming Zhu | Xiangming Zhu, Huayu Deng, Haochen Yuan, Yunbo Wang, Xiaokang Yang | Latent Intuitive Physics: Learning to Transfer Hidden Physics from A 3D
Video | Published as a conference paper at ICLR 2024 | null | null | null | cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce latent intuitive physics, a transfer learning framework for
physics simulation that can infer hidden properties of fluids from a single 3D
video and simulate the observed fluid in novel scenes. Our key insight is to
use latent features drawn from a learnable prior distribution conditioned on
the underlyi... | [
{
"created": "Tue, 18 Jun 2024 16:37:44 GMT",
"version": "v1"
}
] | 2024-08-06 | [
[
"Zhu",
"Xiangming",
""
],
[
"Deng",
"Huayu",
""
],
[
"Yuan",
"Haochen",
""
],
[
"Wang",
"Yunbo",
""
],
[
"Yang",
"Xiaokang",
""
]
] | We introduce latent intuitive physics, a transfer learning framework for physics simulation that can infer hidden properties of fluids from a single 3D video and simulate the observed fluid in novel scenes. Our key insight is to use latent features drawn from a learnable prior distribution conditioned on the underlying... |
2308.10649 | Pawan Kumar | Sajal Khandelwal, Pawan Kumar, Syed Azeemuddin | Reinforcement Learning Based Sensor Optimization for Bio-markers | 7 pages, 4 tables | null | null | null | cs.LG cs.NE eess.SP | http://creativecommons.org/licenses/by/4.0/ | Radio frequency (RF) biosensors, in particular those based on inter-digitated
capacitors (IDCs), are pivotal in areas like biomedical diagnosis, remote
sensing, and wireless communication. Despite their advantages of low cost and
easy fabrication, their sensitivity can be hindered by design imperfections,
environment... | [
{
"created": "Mon, 21 Aug 2023 11:36:54 GMT",
"version": "v1"
}
] | 2023-08-22 | [
[
"Khandelwal",
"Sajal",
""
],
[
"Kumar",
"Pawan",
""
],
[
"Azeemuddin",
"Syed",
""
]
] | Radio frequency (RF) biosensors, in particular those based on inter-digitated capacitors (IDCs), are pivotal in areas like biomedical diagnosis, remote sensing, and wireless communication. Despite their advantages of low cost and easy fabrication, their sensitivity can be hindered by design imperfections, environmental... |
2302.01984 | Nathan Roll | Nathan Roll, Calbert Graham, Simon Todd | PSST! Prosodic Speech Segmentation with Transformers | 5 pages, 3 figures. For associated repository, see
https://github.com/Nathan-Roll1/psst | null | 10.18653/v1/2023.conll-1.31 | null | cs.CL cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Self-attention mechanisms have enabled transformers to achieve
superhuman-level performance on many speech-to-text (STT) tasks, yet the
challenge of automatic prosodic segmentation has remained unsolved. In this
paper we finetune Whisper, a pretrained STT model, to annotate intonation unit
(IU) boundaries by repurpos... | [
{
"created": "Fri, 3 Feb 2023 20:09:17 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Roll",
"Nathan",
""
],
[
"Graham",
"Calbert",
""
],
[
"Todd",
"Simon",
""
]
] | Self-attention mechanisms have enabled transformers to achieve superhuman-level performance on many speech-to-text (STT) tasks, yet the challenge of automatic prosodic segmentation has remained unsolved. In this paper we finetune Whisper, a pretrained STT model, to annotate intonation unit (IU) boundaries by repurposin... |
2004.04686 | Niklas K\"uhl | Niklas K\"uhl, Marc Goutier, Robin Hirt, Gerhard Satzger | Machine Learning in Artificial Intelligence: Towards a Common
Understanding | Hawaii International Conference on System Sciences (HICSS-52) 2019 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The application of "machine learning" and "artificial intelligence" has
become popular within the last decade. Both terms are frequently used in
science and media, sometimes interchangeably, sometimes with different
meanings. In this work, we aim to clarify the relationship between these terms
and, in particular, to ... | [
{
"created": "Fri, 27 Mar 2020 19:09:57 GMT",
"version": "v1"
}
] | 2020-04-10 | [
[
"Kühl",
"Niklas",
""
],
[
"Goutier",
"Marc",
""
],
[
"Hirt",
"Robin",
""
],
[
"Satzger",
"Gerhard",
""
]
] | The application of "machine learning" and "artificial intelligence" has become popular within the last decade. Both terms are frequently used in science and media, sometimes interchangeably, sometimes with different meanings. In this work, we aim to clarify the relationship between these terms and, in particular, to sp... |
2302.11443 | Tim Niklas Uhl | Peter Sanders and Tim Niklas Uhl | Engineering a Distributed-Memory Triangle Counting Algorithm | 11 pages, 8 figures, to be published in 2023 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), St. Petersburg, FL,
USA, pp. 702-712 | 2023 IEEE International Parallel and Distributed Processing
Symposium (IPDPS) | 10.1109/IPDPS54959.2023.00076 | null | cs.DC cs.DS cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Counting triangles in a graph and incident to each vertex is a fundamental
and frequently considered task of graph analysis. We consider how to
efficiently do this for huge graphs using massively parallel distributed-memory
machines. Unsurprisingly, the main issue is to reduce communication between
processors. We ach... | [
{
"created": "Wed, 22 Feb 2023 15:26:44 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Jul 2023 11:03:53 GMT",
"version": "v2"
}
] | 2023-07-24 | [
[
"Sanders",
"Peter",
""
],
[
"Uhl",
"Tim Niklas",
""
]
] | Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs using massively parallel distributed-memory machines. Unsurprisingly, the main issue is to reduce communication between processors. We achie... |
2303.00284 | Yichi Zhang | Yichi Zhang, Zijian Zhu, Hang Su, Jun Zhu, Shibao Zheng, Yuan He, Hui
Xue | To Make Yourself Invisible with Adversarial Semantic Contours | 11 pages, 7 figures, published in Computer Vision and Image
Understanding in 2023 | Computer Vision and Image Understanding 230C (2023) 103659 | 10.1016/j.cviu.2023.103659 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Modern object detectors are vulnerable to adversarial examples, which may
bring risks to real-world applications. The sparse attack is an important task
which, compared with the popular adversarial perturbation on the whole image,
needs to select the potential pixels that is generally regularized by an
$\ell_0$-norm ... | [
{
"created": "Wed, 1 Mar 2023 07:22:39 GMT",
"version": "v1"
}
] | 2023-03-02 | [
[
"Zhang",
"Yichi",
""
],
[
"Zhu",
"Zijian",
""
],
[
"Su",
"Hang",
""
],
[
"Zhu",
"Jun",
""
],
[
"Zheng",
"Shibao",
""
],
[
"He",
"Yuan",
""
],
[
"Xue",
"Hui",
""
]
] | Modern object detectors are vulnerable to adversarial examples, which may bring risks to real-world applications. The sparse attack is an important task which, compared with the popular adversarial perturbation on the whole image, needs to select the potential pixels that is generally regularized by an $\ell_0$-norm co... |
2308.14029 | Zhenghao Liu PhD. | Zhenghao Liu, Sen Mei, Chenyan Xiong, Xiaohua Li, Shi Yu, Zhiyuan Liu,
Yu Gu, Ge Yu | Text Matching Improves Sequential Recommendation by Reducing Popularity
Biases | Accepted by CIKM 2023 | null | null | null | cs.IR cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper proposes Text mAtching based SequenTial rEcommendation model
(TASTE), which maps items and users in an embedding space and recommends items
by matching their text representations. TASTE verbalizes items and user-item
interactions using identifiers and attributes of items. To better characterize
user behavi... | [
{
"created": "Sun, 27 Aug 2023 07:44:33 GMT",
"version": "v1"
}
] | 2023-08-29 | [
[
"Liu",
"Zhenghao",
""
],
[
"Mei",
"Sen",
""
],
[
"Xiong",
"Chenyan",
""
],
[
"Li",
"Xiaohua",
""
],
[
"Yu",
"Shi",
""
],
[
"Liu",
"Zhiyuan",
""
],
[
"Gu",
"Yu",
""
],
[
"Yu",
"Ge",
""
]
] | This paper proposes Text mAtching based SequenTial rEcommendation model (TASTE), which maps items and users in an embedding space and recommends items by matching their text representations. TASTE verbalizes items and user-item interactions using identifiers and attributes of items. To better characterize user behavior... |
1204.6445 | Heng Guo | Jin-Yi Cai, Heng Guo and Tyson Williams | A Complete Dichotomy Rises from the Capture of Vanishing Signatures | Author accepted manuscript | SIAM J. Comput. 45(5), 1671-1728, 2016 | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove a complexity dichotomy theorem for Holant problems over an arbitrary
set of complex-valued symmetric constraint functions F on Boolean variables.
This extends and unifies all previous dichotomies for Holant problems on
symmetric constraint functions (taking values without a finite modulus). We
define and cha... | [
{
"created": "Sun, 29 Apr 2012 00:22:39 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Jul 2013 13:42:13 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Jan 2018 13:53:53 GMT",
"version": "v3"
}
] | 2018-01-11 | [
[
"Cai",
"Jin-Yi",
""
],
[
"Guo",
"Heng",
""
],
[
"Williams",
"Tyson",
""
]
] | We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions F on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric constraint functions (taking values without a finite modulus). We define and chara... |
1808.03736 | Renata Wong | Renata Wong | An Implementation, Empirical Evaluation and Proposed Improvement for
Bidirectional Splitting Method for Argumentation Frameworks under Stable
Semantics | 19 pages | Journal of Artificial Intelligence and Applications, Vol.9, No.4,
2018, pp. 11-29 | 10.5121/ijaia.2018.9402 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Abstract argumentation frameworks are formal systems that facilitate
obtaining conclusions from non-monotonic knowledge systems. Within such a
system, an argumentation semantics is defined as a set of arguments with some
desired qualities, for example, that the elements are not in conflict with each
other. Splitting ... | [
{
"created": "Sat, 11 Aug 2018 01:52:57 GMT",
"version": "v1"
}
] | 2018-08-14 | [
[
"Wong",
"Renata",
""
]
] | Abstract argumentation frameworks are formal systems that facilitate obtaining conclusions from non-monotonic knowledge systems. Within such a system, an argumentation semantics is defined as a set of arguments with some desired qualities, for example, that the elements are not in conflict with each other. Splitting an... |
1807.01620 | Dominique Duval | Dominique Duval (LJK) | Logical rules as fractions and logics as sketches | null | null | null | null | cs.LO math.CT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this short paper, using category theory, we argue that logical rules can
be seen as fractions and logics as limit sketches.
| [
{
"created": "Wed, 4 Jul 2018 14:44:44 GMT",
"version": "v1"
}
] | 2018-07-05 | [
[
"Duval",
"Dominique",
"",
"LJK"
]
] | In this short paper, using category theory, we argue that logical rules can be seen as fractions and logics as limit sketches. |
2406.19804 | Cheng Peng | Cheng Peng, Rulong Wang, Yong Xiao | Rateless Stochastic Coding for Delay-constrained Semantic Communication | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of joint source-channel coding with distortion and
perception constraints from a rateless perspective, the purpose of which is to
settle the balance between reliability (distortion/perception) and
effectiveness (rate) of transmission over uncertain channels. We find a new
finite-blocklength bo... | [
{
"created": "Fri, 28 Jun 2024 10:27:06 GMT",
"version": "v1"
}
] | 2024-07-01 | [
[
"Peng",
"Cheng",
""
],
[
"Wang",
"Rulong",
""
],
[
"Xiao",
"Yong",
""
]
] | We consider the problem of joint source-channel coding with distortion and perception constraints from a rateless perspective, the purpose of which is to settle the balance between reliability (distortion/perception) and effectiveness (rate) of transmission over uncertain channels. We find a new finite-blocklength boun... |
1902.01107 | Boya Di | Boya Di, Lingyang Song, Yonghui Li, Geoffrey Ye Li | TCM-NOMA: Joint Multi-user Codeword Design and Detection in Trellis
Coded Modulation based NOMA for Beyond 5G | null | null | 10.1109/JSTSP.2019.2899500 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel non-orthogonal multiple access (NOMA)
scheme based on trellis-coded modulation (TCM). Different from those in the
traditional code-domain NOMA, the incoming data streams of multiple users are
jointly coded and mapped to the codewords so as to improve the coding gain of
the system wit... | [
{
"created": "Mon, 4 Feb 2019 10:13:14 GMT",
"version": "v1"
}
] | 2019-06-26 | [
[
"Di",
"Boya",
""
],
[
"Song",
"Lingyang",
""
],
[
"Li",
"Yonghui",
""
],
[
"Li",
"Geoffrey Ye",
""
]
] | In this paper, we propose a novel non-orthogonal multiple access (NOMA) scheme based on trellis-coded modulation (TCM). Different from those in the traditional code-domain NOMA, the incoming data streams of multiple users are jointly coded and mapped to the codewords so as to improve the coding gain of the system witho... |
1507.00522 | Young JIn Chun | Young Jin Chun, Simon L. Cotton, Mazen O. Hasna, Ali Ghrayeb | A Stochastic Geometry Based Approach to Modeling Interference
Correlation in Cooperative Relay Networks | Submitted to IEEE Transactions on Wireless Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Future wireless networks are expected to be a convergence of many diverse
network technologies and architectures, such as cellular networks, wireless
local area networks, sensor networks, and device to device communications.
Through cooperation between dissimilar wireless devices, this new combined
network topology p... | [
{
"created": "Thu, 2 Jul 2015 11:09:19 GMT",
"version": "v1"
}
] | 2015-07-03 | [
[
"Chun",
"Young Jin",
""
],
[
"Cotton",
"Simon L.",
""
],
[
"Hasna",
"Mazen O.",
""
],
[
"Ghrayeb",
"Ali",
""
]
] | Future wireless networks are expected to be a convergence of many diverse network technologies and architectures, such as cellular networks, wireless local area networks, sensor networks, and device to device communications. Through cooperation between dissimilar wireless devices, this new combined network topology pro... |
2209.01252 | Jeannie Lee | Emran Poh, Kyrin Liong, Jeannie Lee | Mixed Reality for Mechanical Design and Assembly Planning | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Design for Manufacturing and Assembly (DFMA) is a crucial design stage within
the heavy vehicle manufacturing process that involves optimising the order and
feasibility of the parts assembly process to reduce manufacturing complexity
and overall cost. Existing work has focused on conducting DFMA within virtual
enviro... | [
{
"created": "Fri, 2 Sep 2022 19:41:29 GMT",
"version": "v1"
}
] | 2022-09-07 | [
[
"Poh",
"Emran",
""
],
[
"Liong",
"Kyrin",
""
],
[
"Lee",
"Jeannie",
""
]
] | Design for Manufacturing and Assembly (DFMA) is a crucial design stage within the heavy vehicle manufacturing process that involves optimising the order and feasibility of the parts assembly process to reduce manufacturing complexity and overall cost. Existing work has focused on conducting DFMA within virtual environm... |
2105.14520 | Jianfeng Li | Jianfeng Li, Junqiao Zhao, Shuangfu Song, Tiantian Feng | Unsupervised Joint Learning of Depth, Optical Flow, Ego-motion from
Video | 9 pages, 4 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Estimating geometric elements such as depth, camera motion, and optical flow
from images is an important part of the robot's visual perception. We use a
joint self-supervised method to estimate the three geometric elements. Depth
network, optical flow network and camera motion network are independent of each
other bu... | [
{
"created": "Sun, 30 May 2021 12:39:48 GMT",
"version": "v1"
}
] | 2021-06-01 | [
[
"Li",
"Jianfeng",
""
],
[
"Zhao",
"Junqiao",
""
],
[
"Song",
"Shuangfu",
""
],
[
"Feng",
"Tiantian",
""
]
] | Estimating geometric elements such as depth, camera motion, and optical flow from images is an important part of the robot's visual perception. We use a joint self-supervised method to estimate the three geometric elements. Depth network, optical flow network and camera motion network are independent of each other but ... |
2012.00302 | Masaki Aida | Kakeru Ohki, Ayako Hashizume, Masaki Aida | Independence of the Fundamental Equation of the Oscillation Model on
Algebraic Representations: Social Media Echo Chamber Effect | 4 pages, no figure, IEICE ICETC 2020. arXiv admin note: substantial
text overlap with arXiv:2011.13372 | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the oscillation model that describes the user dynamics of online social
networks, it is known that the fundamental equation can explicitly describe the
causal relationship between the network structure and user dynamics. The
fundamental equation uses algebra that satisfies the anti-commutation relation,
and its ma... | [
{
"created": "Tue, 1 Dec 2020 06:55:33 GMT",
"version": "v1"
}
] | 2020-12-02 | [
[
"Ohki",
"Kakeru",
""
],
[
"Hashizume",
"Ayako",
""
],
[
"Aida",
"Masaki",
""
]
] | In the oscillation model that describes the user dynamics of online social networks, it is known that the fundamental equation can explicitly describe the causal relationship between the network structure and user dynamics. The fundamental equation uses algebra that satisfies the anti-commutation relation, and its matr... |
1601.07157 | Robert Merkel | Robert Merkel and James Georgeson | Cloud-Based Distributed Mutation Analysis | 12 pages including appendix | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mutation Testing is a fault-based software testing technique which is too
computationally expensive for industrial use. Cloud-based distributed computing
clusters, taking advantage of the MapReduce programming paradigm, represent a
method by which the long running time can be reduced. In this paper, we
describe an ar... | [
{
"created": "Tue, 26 Jan 2016 20:35:45 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Jan 2016 03:38:43 GMT",
"version": "v2"
}
] | 2016-01-29 | [
[
"Merkel",
"Robert",
""
],
[
"Georgeson",
"James",
""
]
] | Mutation Testing is a fault-based software testing technique which is too computationally expensive for industrial use. Cloud-based distributed computing clusters, taking advantage of the MapReduce programming paradigm, represent a method by which the long running time can be reduced. In this paper, we describe an arch... |
1910.11073 | Geoffroy Chaussonnet | Geoffroy Chaussonnet, Christian Lieber, Yan Yikang, Wenda Gu, Andreas
Bartschat, Markus Reischl, Rainer Koch, Ralf Mikut and Hans-J\"org Bauer | Towards DeepSpray: Using Convolutional Neural Network to post-process
Shadowgraphy Images of Liquid Atomization | Technical report, 22 pages, 29 figures | null | 10.5445/IR/1000097897/v3 | null | cs.CV physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This technical report investigates the potential of Convolutional Neural
Networks to post-process images from primary atomization. Three tasks are
investigated. First, the detection and segmentation of liquid droplets in
degraded optical conditions. Second, the detection of overlapping ellipses and
the prediction of ... | [
{
"created": "Fri, 11 Oct 2019 03:00:52 GMT",
"version": "v1"
}
] | 2019-10-25 | [
[
"Chaussonnet",
"Geoffroy",
""
],
[
"Lieber",
"Christian",
""
],
[
"Yikang",
"Yan",
""
],
[
"Gu",
"Wenda",
""
],
[
"Bartschat",
"Andreas",
""
],
[
"Reischl",
"Markus",
""
],
[
"Koch",
"Rainer",
""
],
[
... | This technical report investigates the potential of Convolutional Neural Networks to post-process images from primary atomization. Three tasks are investigated. First, the detection and segmentation of liquid droplets in degraded optical conditions. Second, the detection of overlapping ellipses and the prediction of th... |
2208.00902 | Yitong Zhang | Yitong Zhang, Sophia Bano, Ann-Sophie Page, Jan Deprest, Danail
Stoyanov, Francisco Vasconcelos | Retrieval of surgical phase transitions using reinforcement learning | Accepted by MICCAI 2022 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In minimally invasive surgery, surgical workflow segmentation from video
analysis is a well studied topic. The conventional approach defines it as a
multi-class classification problem, where individual video frames are
attributed a surgical phase label.
We introduce a novel reinforcement learning formulation for of... | [
{
"created": "Mon, 1 Aug 2022 14:43:15 GMT",
"version": "v1"
}
] | 2022-08-02 | [
[
"Zhang",
"Yitong",
""
],
[
"Bano",
"Sophia",
""
],
[
"Page",
"Ann-Sophie",
""
],
[
"Deprest",
"Jan",
""
],
[
"Stoyanov",
"Danail",
""
],
[
"Vasconcelos",
"Francisco",
""
]
] | In minimally invasive surgery, surgical workflow segmentation from video analysis is a well studied topic. The conventional approach defines it as a multi-class classification problem, where individual video frames are attributed a surgical phase label. We introduce a novel reinforcement learning formulation for offlin... |
1903.10885 | Kripasindhu Sarkar | Kripasindhu Sarkar, Kiran Varanasi, Didier Stricker | Learning Quadrangulated Patches For 3D Shape Processing | arXiv admin note: substantial text overlap with arXiv:1709.06868 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a system for surface completion and inpainting of 3D shapes using
generative models, learnt on local patches. Our method uses a novel encoding of
height map based local patches parameterized using 3D mesh quadrangulation of
the low resolution input shape. This provides us sufficient amount of local 3D
patc... | [
{
"created": "Mon, 25 Mar 2019 16:54:59 GMT",
"version": "v1"
}
] | 2019-03-27 | [
[
"Sarkar",
"Kripasindhu",
""
],
[
"Varanasi",
"Kiran",
""
],
[
"Stricker",
"Didier",
""
]
] | We propose a system for surface completion and inpainting of 3D shapes using generative models, learnt on local patches. Our method uses a novel encoding of height map based local patches parameterized using 3D mesh quadrangulation of the low resolution input shape. This provides us sufficient amount of local 3D patche... |
1912.11735 | Soheil Abbasloo | Soheil Abbasloo, Chen-Yu Yen, H. Jonathan Chao | Wanna Make Your TCP Scheme Great for Cellular Networks? Let Machines Do
It for You! | Under Review | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Can we instead of designing just another new TCP, design a TCP
\textit{plug-in} which can boost the performance of the existing/future TCP
designs in cellular networks? To answer this question, we introduce DeepCC
plug-in. DeepCC leverages deep reinforcement learning (DRL), a modern
decision-making tool, to steer TCP... | [
{
"created": "Thu, 26 Dec 2019 00:49:26 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Jan 2020 22:59:01 GMT",
"version": "v2"
},
{
"created": "Tue, 23 Jun 2020 14:14:04 GMT",
"version": "v3"
}
] | 2020-06-24 | [
[
"Abbasloo",
"Soheil",
""
],
[
"Yen",
"Chen-Yu",
""
],
[
"Chao",
"H. Jonathan",
""
]
] | Can we instead of designing just another new TCP, design a TCP \textit{plug-in} which can boost the performance of the existing/future TCP designs in cellular networks? To answer this question, we introduce DeepCC plug-in. DeepCC leverages deep reinforcement learning (DRL), a modern decision-making tool, to steer TCP t... |
1510.07254 | Jian-Jia Chen | Jian-Jia Chen | Federated Scheduling Admits No Constant Speedup Factors for
Constrained-Deadline DAG Task Systems | in Real-Time Systems Journal 2016 | null | 10.1007/s11241-016-9255-2 | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the federated scheduling approaches in multiprocessor systems, a task
either 1) is restricted to execute sequentially on a single processor or 2) has
exclusive access to the assigned processors. There have been several positive
results to conduct good federated scheduling policies, which have constant
speedup fact... | [
{
"created": "Sun, 25 Oct 2015 14:46:12 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Jun 2016 19:56:30 GMT",
"version": "v2"
}
] | 2016-06-23 | [
[
"Chen",
"Jian-Jia",
""
]
] | In the federated scheduling approaches in multiprocessor systems, a task either 1) is restricted to execute sequentially on a single processor or 2) has exclusive access to the assigned processors. There have been several positive results to conduct good federated scheduling policies, which have constant speedup factor... |
2305.17832 | Takahiro Wada | Yujiro Tamura, Takahiro Wada, and Hailong Liu | Generating Visual Information for Motion Sickness Reduction Using a
Computational Model Based on SVC Theory | null | 2023 IEEE 26th International Conference on Intelligent
Transportation Systems (ITSC) | 10.1109/ITSC57777.2023.10422244 | null | cs.HC q-bio.NC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | With the advancements in automated driving, there is concern that motion
sickness will increase as non-driving-related tasks increase. Therefore,
techniques to reduce motion sickness have drawn much attention. Research
studies have attempted to estimate motion sickness using computational models
for controlling it. A... | [
{
"created": "Mon, 29 May 2023 00:27:25 GMT",
"version": "v1"
}
] | 2024-06-25 | [
[
"Tamura",
"Yujiro",
""
],
[
"Wada",
"Takahiro",
""
],
[
"Liu",
"Hailong",
""
]
] | With the advancements in automated driving, there is concern that motion sickness will increase as non-driving-related tasks increase. Therefore, techniques to reduce motion sickness have drawn much attention. Research studies have attempted to estimate motion sickness using computational models for controlling it. Amo... |
2305.09973 | Abhranil Chatterjee | Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj | Border Complexity of Symbolic Determinant under Rank One Restriction | null | null | null | null | cs.CC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | VBP is the class of polynomial families that can be computed by the
determinant of a symbolic matrix of the form $A_0 + \sum_{i=1}^n A_ix_i$ where
the size of each $A_i$ is polynomial in the number of variables (equivalently,
computable by polynomial-sized algebraic branching programs (ABP)). A major
open problem in ... | [
{
"created": "Wed, 17 May 2023 06:12:36 GMT",
"version": "v1"
}
] | 2023-05-18 | [
[
"Chatterjee",
"Abhranil",
""
],
[
"Ghosh",
"Sumanta",
""
],
[
"Gurjar",
"Rohit",
""
],
[
"Raj",
"Roshan",
""
]
] | VBP is the class of polynomial families that can be computed by the determinant of a symbolic matrix of the form $A_0 + \sum_{i=1}^n A_ix_i$ where the size of each $A_i$ is polynomial in the number of variables (equivalently, computable by polynomial-sized algebraic branching programs (ABP)). A major open problem in ge... |
1605.07905 | Thomas Riedl | Thomas J. Riedl, Todd P. Coleman and Andrew C. Singer | Timing Channel: Achievable Rate in the Finite Block-Length Regime | Full technical report on the work originally presented at the
Information Theory Workshop (ITW) in 2011 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The exponential server timing channel is known to be the simplest, and in
some sense canonical, queuing timing channel. The capacity of this
infinite-memory channel is known. Here, we discuss practical finite-length
restrictions on the codewords and attempt to understand the maximal rate that
can be achieved for a ta... | [
{
"created": "Wed, 25 May 2016 14:45:19 GMT",
"version": "v1"
}
] | 2016-05-26 | [
[
"Riedl",
"Thomas J.",
""
],
[
"Coleman",
"Todd P.",
""
],
[
"Singer",
"Andrew C.",
""
]
] | The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the codewords and attempt to understand the maximal rate that can be achieved for a targ... |
0706.0869 | Edward Aboufadel | Edward Aboufadel, Timothy Armstrong, Elizabeth Smietana | Position Coding | 14 pages, 7 figures | null | null | null | cs.IT math.CO math.IT | null | A position coding pattern is an array of symbols in which subarrays of a
certain fixed size appear at most once. So, each subarray uniquely identifies a
location in the larger array, which means there is a bijection of some sort
from this set of subarrays to a set of coordinates. The key to Fly Pentop
Computer paper ... | [
{
"created": "Wed, 6 Jun 2007 17:09:21 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Aboufadel",
"Edward",
""
],
[
"Armstrong",
"Timothy",
""
],
[
"Smietana",
"Elizabeth",
""
]
] | A position coding pattern is an array of symbols in which subarrays of a certain fixed size appear at most once. So, each subarray uniquely identifies a location in the larger array, which means there is a bijection of some sort from this set of subarrays to a set of coordinates. The key to Fly Pentop Computer paper an... |
2401.17602 | Yuelyu Ji | Yuelyu Ji, Zeshui Yu and Yanshan Wang | Assertion Detection Large Language Model In-context Learning LoRA
Fine-tuning | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | In this study, we aim to address the task of assertion detection when
extracting medical concepts from clinical notes, a key process in clinical
natural language processing (NLP). Assertion detection in clinical NLP usually
involves identifying assertion types for medical concepts in the clinical text,
namely certain... | [
{
"created": "Wed, 31 Jan 2024 05:11:00 GMT",
"version": "v1"
}
] | 2024-02-01 | [
[
"Ji",
"Yuelyu",
""
],
[
"Yu",
"Zeshui",
""
],
[
"Wang",
"Yanshan",
""
]
] | In this study, we aim to address the task of assertion detection when extracting medical concepts from clinical notes, a key process in clinical natural language processing (NLP). Assertion detection in clinical NLP usually involves identifying assertion types for medical concepts in the clinical text, namely certainty... |
2010.08886 | Kinjal Shah | Sourabh Kulkarni, Kinjal Divesh Shah, Nimar Arora, Xiaoyan Wang, Yucen
Lily Li, Nazanin Khosravani Tehrani, Michael Tingley, David Noursi, Narjes
Torabi, Sepehr Akhavan Masouleh, Eric Lippert, and Erik Meijer | PPL Bench: Evaluation Framework For Probabilistic Programming Languages | 6 pages, PROBPROG 2020 | null | null | null | cs.PL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce PPL Bench, a new benchmark for evaluating Probabilistic
Programming Languages (PPLs) on a variety of statistical models. The benchmark
includes data generation and evaluation code for a number of models as well as
implementations in some common PPLs. All of the benchmark code and PPL
implementations are ... | [
{
"created": "Sat, 17 Oct 2020 23:12:23 GMT",
"version": "v1"
}
] | 2020-10-20 | [
[
"Kulkarni",
"Sourabh",
""
],
[
"Shah",
"Kinjal Divesh",
""
],
[
"Arora",
"Nimar",
""
],
[
"Wang",
"Xiaoyan",
""
],
[
"Li",
"Yucen Lily",
""
],
[
"Tehrani",
"Nazanin Khosravani",
""
],
[
"Tingley",
"Michael",
... | We introduce PPL Bench, a new benchmark for evaluating Probabilistic Programming Languages (PPLs) on a variety of statistical models. The benchmark includes data generation and evaluation code for a number of models as well as implementations in some common PPLs. All of the benchmark code and PPL implementations are av... |
2405.10143 | Debangshu Banerjee | Debangshu Banerjee, Gagandeep Singh | Relational DNN Verification With Cross Executional Bound Refinement | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | We focus on verifying relational properties defined over deep neural networks
(DNNs) such as robustness against universal adversarial perturbations (UAP),
certified worst-case hamming distance for binary string classifications, etc.
Precise verification of these properties requires reasoning about multiple
executions... | [
{
"created": "Thu, 16 May 2024 14:35:50 GMT",
"version": "v1"
}
] | 2024-05-17 | [
[
"Banerjee",
"Debangshu",
""
],
[
"Singh",
"Gagandeep",
""
]
] | We focus on verifying relational properties defined over deep neural networks (DNNs) such as robustness against universal adversarial perturbations (UAP), certified worst-case hamming distance for binary string classifications, etc. Precise verification of these properties requires reasoning about multiple executions o... |
1809.00654 | Ravi Shankar Mr | Ravi Shankar, Yamini Chandrakar, Radhika Sinha, Ritesh Kumar Mishra | PEP Analysis of Selective Decode and Forward Protocol over Keyhole
Fading | MICRO 2017 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide a closed form upper bound formulation for the average
pairwise-error probability (PEP) of selective decode and forward (SDF)
cooperation protocol for a keyhole (pinhole) channel condition. We have
employed orthogonal space-time block-code scheme (OSTBC) in conjunction with
multi-antenna (MIMO) technology. ... | [
{
"created": "Mon, 3 Sep 2018 16:55:38 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Sep 2018 14:43:01 GMT",
"version": "v2"
}
] | 2018-09-11 | [
[
"Shankar",
"Ravi",
""
],
[
"Chandrakar",
"Yamini",
""
],
[
"Sinha",
"Radhika",
""
],
[
"Mishra",
"Ritesh Kumar",
""
]
] | We provide a closed form upper bound formulation for the average pairwise-error probability (PEP) of selective decode and forward (SDF) cooperation protocol for a keyhole (pinhole) channel condition. We have employed orthogonal space-time block-code scheme (OSTBC) in conjunction with multi-antenna (MIMO) technology. We... |
1702.04642 | Zhibin Niu | Dawei Cheng, Zhibin Niu, Yi Tu, Liqing Zhang | Prediction defaults for networked-guarantee loans | 6 pages,7 figures | 2018 24th International Conference on Pattern Recognition (ICPR) | 10.1109/ICPR.2018.8545474 | null | cs.CE cs.SI q-fin.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Networked-guarantee loans may cause the systemic risk related concern of the
government and banks in China. The prediction of default of enterprise loans is
a typical extremely imbalanced prediction problem, and the networked-guarantee
make this problem more difficult to solve. Since the guaranteed loan is a debt
obl... | [
{
"created": "Wed, 15 Feb 2017 15:00:12 GMT",
"version": "v1"
},
{
"created": "Wed, 13 May 2020 10:17:11 GMT",
"version": "v2"
},
{
"created": "Fri, 15 May 2020 07:45:23 GMT",
"version": "v3"
},
{
"created": "Mon, 18 May 2020 08:18:12 GMT",
"version": "v4"
},
{
"c... | 2020-06-09 | [
[
"Cheng",
"Dawei",
""
],
[
"Niu",
"Zhibin",
""
],
[
"Tu",
"Yi",
""
],
[
"Zhang",
"Liqing",
""
]
] | Networked-guarantee loans may cause the systemic risk related concern of the government and banks in China. The prediction of default of enterprise loans is a typical extremely imbalanced prediction problem, and the networked-guarantee make this problem more difficult to solve. Since the guaranteed loan is a debt oblig... |
2312.02599 | Chuan Huang | Chuan Huang, Gustaf Hendeby, Hassen Fourati, Christophe Prieur, and
Isaac Skog | MAINS: A Magnetic Field Aided Inertial Navigation System for Indoor
Positioning | fix a missing reference | null | null | null | cs.RO eess.SP | http://creativecommons.org/licenses/by/4.0/ | A Magnetic field Aided Inertial Navigation System (MAINS) for indoor
navigation is proposed in this paper. MAINS leverages an array of magnetometers
to measure spatial variations in the magnetic field, which are then used to
estimate the displacement and orientation changes of the system, thereby aiding
the inertial ... | [
{
"created": "Tue, 5 Dec 2023 09:18:12 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Mar 2024 13:44:22 GMT",
"version": "v2"
},
{
"created": "Tue, 23 Apr 2024 18:22:46 GMT",
"version": "v3"
}
] | 2024-04-25 | [
[
"Huang",
"Chuan",
""
],
[
"Hendeby",
"Gustaf",
""
],
[
"Fourati",
"Hassen",
""
],
[
"Prieur",
"Christophe",
""
],
[
"Skog",
"Isaac",
""
]
] | A Magnetic field Aided Inertial Navigation System (MAINS) for indoor navigation is proposed in this paper. MAINS leverages an array of magnetometers to measure spatial variations in the magnetic field, which are then used to estimate the displacement and orientation changes of the system, thereby aiding the inertial na... |
2403.19113 | Vipula Rawte | Vipula Rawte, S.M Towhidul Islam Tonmoy, Krishnav Rajbangshi, Shravani
Nag, Aman Chadha, Amit P. Sheth, Amitava Das | FACTOID: FACtual enTailment fOr hallucInation Detection | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | The widespread adoption of Large Language Models (LLMs) has facilitated
numerous benefits. However, hallucination is a significant concern. In
response, Retrieval Augmented Generation (RAG) has emerged as a highly
promising paradigm to improve LLM outputs by grounding them in factual
information. RAG relies on textua... | [
{
"created": "Thu, 28 Mar 2024 03:09:42 GMT",
"version": "v1"
}
] | 2024-03-29 | [
[
"Rawte",
"Vipula",
""
],
[
"Tonmoy",
"S. M Towhidul Islam",
""
],
[
"Rajbangshi",
"Krishnav",
""
],
[
"Nag",
"Shravani",
""
],
[
"Chadha",
"Aman",
""
],
[
"Sheth",
"Amit P.",
""
],
[
"Das",
"Amitava",
""
... | The widespread adoption of Large Language Models (LLMs) has facilitated numerous benefits. However, hallucination is a significant concern. In response, Retrieval Augmented Generation (RAG) has emerged as a highly promising paradigm to improve LLM outputs by grounding them in factual information. RAG relies on textual ... |
2305.04357 | Fabio Massimo Zennaro | Fabio Massimo Zennaro, Paolo Turrini, Theodoros Damoulas | Quantifying Consistency and Information Loss for Causal Abstraction
Learning | 9 pages, 9 pages appendix, 2 figures, IJCAI 2023 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structural causal models provide a formalism to express causal relations
between variables of interest. Models and variables can represent a system at
different levels of abstraction, whereby relations may be coarsened and refined
according to the need of a modeller. However, switching between different
levels of abs... | [
{
"created": "Sun, 7 May 2023 19:10:28 GMT",
"version": "v1"
}
] | 2023-05-09 | [
[
"Zennaro",
"Fabio Massimo",
""
],
[
"Turrini",
"Paolo",
""
],
[
"Damoulas",
"Theodoros",
""
]
] | Structural causal models provide a formalism to express causal relations between variables of interest. Models and variables can represent a system at different levels of abstraction, whereby relations may be coarsened and refined according to the need of a modeller. However, switching between different levels of abstr... |
1212.5288 | Mahdy Nabaee | Mahdy Nabaee and Fabrice Labeau | Quantized Network Coding for Correlated Sources | Submitted for IEEE Transactions on Signal Processing | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-adaptive joint source network coding of correlated sources is discussed
in this paper. By studying the information flow in the network, we propose
quantized network coding as an alternative for packet forwarding. This
technique has both network coding and distributed source coding advantages,
simultaneously. Quan... | [
{
"created": "Thu, 20 Dec 2012 22:28:43 GMT",
"version": "v1"
}
] | 2012-12-24 | [
[
"Nabaee",
"Mahdy",
""
],
[
"Labeau",
"Fabrice",
""
]
] | Non-adaptive joint source network coding of correlated sources is discussed in this paper. By studying the information flow in the network, we propose quantized network coding as an alternative for packet forwarding. This technique has both network coding and distributed source coding advantages, simultaneously. Quanti... |
2109.06736 | Christian Hansen | Christian Hansen | Sequential Modelling with Applications to Music Recommendation,
Fact-Checking, and Speed Reading | PhD Thesis, University of Copenhagen, Faculty of Science | null | null | null | cs.IR cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sequential modelling entails making sense of sequential data, which naturally
occurs in a wide array of domains. One example is systems that interact with
users, log user actions and behaviour, and make recommendations of items of
potential interest to users on the basis of their previous interactions. In
such cases,... | [
{
"created": "Sat, 11 Sep 2021 08:05:48 GMT",
"version": "v1"
}
] | 2021-09-15 | [
[
"Hansen",
"Christian",
""
]
] | Sequential modelling entails making sense of sequential data, which naturally occurs in a wide array of domains. One example is systems that interact with users, log user actions and behaviour, and make recommendations of items of potential interest to users on the basis of their previous interactions. In such cases, t... |
1901.02393 | Maryam Negahbani | Suman K. Bera, Deeparnab Chakrabarty, Nicolas J. Flores, Maryam
Negahbani | Fair Algorithms for Clustering | null | null | null | null | cs.DS cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of finding low-cost Fair Clusterings in data where each
data point may belong to many protected groups. Our work significantly
generalizes the seminal work of Chierichetti et.al. (NIPS 2017) as follows.
- We allow the user to specify the parameters that define fair
representation. More precisel... | [
{
"created": "Tue, 8 Jan 2019 16:39:16 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Jun 2019 14:01:05 GMT",
"version": "v2"
}
] | 2019-06-18 | [
[
"Bera",
"Suman K.",
""
],
[
"Chakrabarty",
"Deeparnab",
""
],
[
"Flores",
"Nicolas J.",
""
],
[
"Negahbani",
"Maryam",
""
]
] | We study the problem of finding low-cost Fair Clusterings in data where each data point may belong to many protected groups. Our work significantly generalizes the seminal work of Chierichetti et.al. (NIPS 2017) as follows. - We allow the user to specify the parameters that define fair representation. More precisely, t... |
1503.01868 | Yao Wang | Wenfei Cao, Yao Wang, Jian Sun, Deyu Meng, Can Yang, Andrzej Cichocki,
Zongben Xu | Total Variation Regularized Tensor RPCA for Background Subtraction from
Compressive Measurements | To appear in IEEE TIP | null | 10.1109/TIP.2016.2579262 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Background subtraction has been a fundamental and widely studied task in
video analysis, with a wide range of applications in video surveillance,
teleconferencing and 3D modeling. Recently, motivated by compressive imaging,
background subtraction from compressive measurements (BSCM) is becoming an
active research tas... | [
{
"created": "Fri, 6 Mar 2015 08:00:43 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Mar 2015 03:20:34 GMT",
"version": "v2"
},
{
"created": "Mon, 10 Aug 2015 14:50:48 GMT",
"version": "v3"
},
{
"created": "Sun, 5 Jun 2016 17:46:14 GMT",
"version": "v4"
}
] | 2016-08-24 | [
[
"Cao",
"Wenfei",
""
],
[
"Wang",
"Yao",
""
],
[
"Sun",
"Jian",
""
],
[
"Meng",
"Deyu",
""
],
[
"Yang",
"Can",
""
],
[
"Cichocki",
"Andrzej",
""
],
[
"Xu",
"Zongben",
""
]
] | Background subtraction has been a fundamental and widely studied task in video analysis, with a wide range of applications in video surveillance, teleconferencing and 3D modeling. Recently, motivated by compressive imaging, background subtraction from compressive measurements (BSCM) is becoming an active research task ... |
2105.11541 | Qing Ping | Tao Tu, Qing Ping, Govind Thattai, Gokhan Tur, Prem Natarajan | Learning Better Visual Dialog Agents with Pretrained Visual-Linguistic
Representation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | GuessWhat?! is a two-player visual dialog guessing game where player A asks a
sequence of yes/no questions (Questioner) and makes a final guess (Guesser)
about a target object in an image, based on answers from player B (Oracle).
Based on this dialog history between the Questioner and the Oracle, a Guesser
makes a fi... | [
{
"created": "Mon, 24 May 2021 21:09:20 GMT",
"version": "v1"
}
] | 2021-05-26 | [
[
"Tu",
"Tao",
""
],
[
"Ping",
"Qing",
""
],
[
"Thattai",
"Govind",
""
],
[
"Tur",
"Gokhan",
""
],
[
"Natarajan",
"Prem",
""
]
] | GuessWhat?! is a two-player visual dialog guessing game where player A asks a sequence of yes/no questions (Questioner) and makes a final guess (Guesser) about a target object in an image, based on answers from player B (Oracle). Based on this dialog history between the Questioner and the Oracle, a Guesser makes a fina... |
2406.10935 | Ashish Kumar | Ashish Kumar, Daneul Kim, Jaesik Park, Laxmidhar Behera | Pick-or-Mix: Dynamic Channel Sampling for ConvNets | Published in Computer Vision and Pattern Recognition (CVPR 2024) | Proceedings of the IEEE/CVF Conference on Computer Vision and
Pattern Recognition (CVPR), 2024 | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Channel pruning approaches for convolutional neural networks (ConvNets)
deactivate the channels, statically or dynamically, and require special
implementation. In addition, channel squeezing in representative ConvNets is
carried out via 1x1 convolutions which dominates a large portion of
computations and network para... | [
{
"created": "Sun, 16 Jun 2024 13:33:09 GMT",
"version": "v1"
}
] | 2024-06-18 | [
[
"Kumar",
"Ashish",
""
],
[
"Kim",
"Daneul",
""
],
[
"Park",
"Jaesik",
""
],
[
"Behera",
"Laxmidhar",
""
]
] | Channel pruning approaches for convolutional neural networks (ConvNets) deactivate the channels, statically or dynamically, and require special implementation. In addition, channel squeezing in representative ConvNets is carried out via 1x1 convolutions which dominates a large portion of computations and network parame... |
1807.01012 | Weinan Chen | Weinan Chen and Lei Zhu and Yisheng Guan and C. Ronald Kube and Hong
Zhang | Submap-based Pose-graph Visual SLAM: A Robust Visual Exploration and
Localization System | 2018 IEEE/RSJ International Conference on Intelligent Robots and
Systems (IROS 2018) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For VSLAM (Visual Simultaneous Localization and Mapping), localization is a
challenging task, especially for some challenging situations: textureless
frames, motion blur, etc.. To build a robust exploration and localization
system in a given space or environment, a submap-based VSLAM system is proposed
in this paper.... | [
{
"created": "Tue, 3 Jul 2018 08:17:37 GMT",
"version": "v1"
}
] | 2018-07-04 | [
[
"Chen",
"Weinan",
""
],
[
"Zhu",
"Lei",
""
],
[
"Guan",
"Yisheng",
""
],
[
"Kube",
"C. Ronald",
""
],
[
"Zhang",
"Hong",
""
]
] | For VSLAM (Visual Simultaneous Localization and Mapping), localization is a challenging task, especially for some challenging situations: textureless frames, motion blur, etc.. To build a robust exploration and localization system in a given space or environment, a submap-based VSLAM system is proposed in this paper. O... |
2112.11944 | Jacob Armstrong | J. Armstrong, D. Clifton | Continual learning of longitudinal health records | 15 pages, 5 figures | 2022 IEEE-EMBS International Conference on Biomedical and Health
Informatics (BHI) | 10.1109/BHI56158.2022.9926878 | 9926878 | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Continual learning denotes machine learning methods which can adapt to new
environments while retaining and reusing knowledge gained from past
experiences. Such methods address two issues encountered by models in
non-stationary environments: ungeneralisability to new data, and the
catastrophic forgetting of previous ... | [
{
"created": "Wed, 22 Dec 2021 15:08:45 GMT",
"version": "v1"
}
] | 2023-03-28 | [
[
"Armstrong",
"J.",
""
],
[
"Clifton",
"D.",
""
]
] | Continual learning denotes machine learning methods which can adapt to new environments while retaining and reusing knowledge gained from past experiences. Such methods address two issues encountered by models in non-stationary environments: ungeneralisability to new data, and the catastrophic forgetting of previous kn... |
2207.00151 | Yiming Huo | Yiming Huo | Space Broadband Access: The Race Has Just Begun | 8 pages, 3 figures, 2 tables. Accepted by IEEE Magazine
(https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2) | null | 10.1109/MC.2022.3160472 | null | cs.NI cs.ET cs.SY eess.SP eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have witnessed an exponential growth of the commercial space
industry, including rocket launch, satellite network deployment, private space
travel, and even extraterrestrial colonization. Several trends are predicted in
this unprecedented transition to an era of space-enabled broadband access.
| [
{
"created": "Fri, 6 May 2022 19:27:08 GMT",
"version": "v1"
}
] | 2022-07-04 | [
[
"Huo",
"Yiming",
""
]
] | Recent years have witnessed an exponential growth of the commercial space industry, including rocket launch, satellite network deployment, private space travel, and even extraterrestrial colonization. Several trends are predicted in this unprecedented transition to an era of space-enabled broadband access. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.