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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2310.06474 | Yue Deng | Yue Deng, Wenxuan Zhang, Sinno Jialin Pan, Lidong Bing | Multilingual Jailbreak Challenges in Large Language Models | ICLR 2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While large language models (LLMs) exhibit remarkable capabilities across a
wide range of tasks, they pose potential safety concerns, such as the
``jailbreak'' problem, wherein malicious instructions can manipulate LLMs to
exhibit undesirable behavior. Although several preventive measures have been
developed to mitig... | [
{
"created": "Tue, 10 Oct 2023 09:44:06 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Feb 2024 08:28:35 GMT",
"version": "v2"
},
{
"created": "Mon, 4 Mar 2024 04:03:54 GMT",
"version": "v3"
}
] | 2024-03-05 | [
[
"Deng",
"Yue",
""
],
[
"Zhang",
"Wenxuan",
""
],
[
"Pan",
"Sinno Jialin",
""
],
[
"Bing",
"Lidong",
""
]
] | While large language models (LLMs) exhibit remarkable capabilities across a wide range of tasks, they pose potential safety concerns, such as the ``jailbreak'' problem, wherein malicious instructions can manipulate LLMs to exhibit undesirable behavior. Although several preventive measures have been developed to mitigat... |
2403.17376 | Kenneth Granlund | Dheepak Khatri and Kenneth Granlund | Theoretical Analysis of Quality of Conventional Beamforming for Phased
Microphone Arrays | null | null | null | null | cs.SD eess.AS | http://creativecommons.org/licenses/by-nc-nd/4.0/ | A theoretical study is performed to analyze the directional response of
different types of microphone array designs. 1-D (linear) and 2-D (planar)
microphone array types are considered, and the delay and sum beamforming and
conventional beamforming techniques are employed to localize the sound source.
A non-dimension... | [
{
"created": "Sun, 24 Mar 2024 10:18:04 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Khatri",
"Dheepak",
""
],
[
"Granlund",
"Kenneth",
""
]
] | A theoretical study is performed to analyze the directional response of different types of microphone array designs. 1-D (linear) and 2-D (planar) microphone array types are considered, and the delay and sum beamforming and conventional beamforming techniques are employed to localize the sound source. A non-dimensional... |
cs/0205033 | Neal Young | Neal E. Young | On-Line File Caching | ACM-SIAM Symposium on Discrete Algorithms (1998) | Algorithmica 33:371-383 (2002) | 10.1007/s00453-001-0124-5 | null | cs.DS cs.CC cs.NI | null | In the on-line file-caching problem problem, the input is a sequence of
requests for files, given on-line (one at a time). Each file has a non-negative
size and a non-negative retrieval cost. The problem is to decide which files to
keep in a fixed-size cache so as to minimize the sum of the retrieval costs for
files ... | [
{
"created": "Sat, 18 May 2002 02:04:59 GMT",
"version": "v1"
}
] | 2015-06-02 | [
[
"Young",
"Neal E.",
""
]
] | In the on-line file-caching problem problem, the input is a sequence of requests for files, given on-line (one at a time). Each file has a non-negative size and a non-negative retrieval cost. The problem is to decide which files to keep in a fixed-size cache so as to minimize the sum of the retrieval costs for files th... |
1504.00954 | Talya Eden | Talya Eden, Amit Levi, Dana Ron, C. Seshadhri | Approximately Counting Triangles in Sublinear Time | To appear in the 56th Annual IEEE Symposium on Foundations of
Computer Science (FOCS 2015) | null | 10.1109/FOCS.2015.44 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of estimating the number of triangles in a graph.
This problem has been extensively studied in both theory and practice, but all
existing algorithms read the entire graph. In this work we design a {\em
sublinear-time\/} algorithm for approximating the number of triangles in a
graph, where the ... | [
{
"created": "Fri, 3 Apr 2015 22:40:41 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Aug 2015 06:19:43 GMT",
"version": "v2"
},
{
"created": "Tue, 22 Sep 2015 08:39:07 GMT",
"version": "v3"
}
] | 2016-11-17 | [
[
"Eden",
"Talya",
""
],
[
"Levi",
"Amit",
""
],
[
"Ron",
"Dana",
""
],
[
"Seshadhri",
"C.",
""
]
] | We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a {\em sublinear-time\/} algorithm for approximating the number of triangles in a graph, where the al... |
1711.05818 | Yanjie Dong | Yanjie Dong and Md. Jahangir Hossain and Julian Cheng and Victor C. M.
Leung | Fronthaul-Aware Group Sparse Precoding and Signal Splitting in SWIPT
C-RAN | Accepted by IEEE Globecom 2017 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the precoding, remote radio head (RRH) selection and signal
splitting in the simultaneous wireless information and power transferring
(SWIPT) cloud radio access networks \mbox{(C-RANs)}. The objective is to
minimize the power consumption of the SWIPT C-RAN. Different from the existing
literature, we co... | [
{
"created": "Wed, 15 Nov 2017 21:43:20 GMT",
"version": "v1"
}
] | 2017-11-17 | [
[
"Dong",
"Yanjie",
""
],
[
"Hossain",
"Md. Jahangir",
""
],
[
"Cheng",
"Julian",
""
],
[
"Leung",
"Victor C. M.",
""
]
] | We investigate the precoding, remote radio head (RRH) selection and signal splitting in the simultaneous wireless information and power transferring (SWIPT) cloud radio access networks \mbox{(C-RANs)}. The objective is to minimize the power consumption of the SWIPT C-RAN. Different from the existing literature, we cons... |
2105.02298 | Nikita Polyanskii | Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev | Optimal Codes Correcting Localized Deletions | 10 pages, a full version of the paper accepted to 2021 IEEE ISIT | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of constructing codes that can correct deletions that
are localized within a certain part of the codeword that is unknown a priori.
Namely, the model that we study is when at most $k$ deletions occur in a window
of size $k$, where the positions of the deletions within this window are not
neces... | [
{
"created": "Wed, 5 May 2021 19:39:11 GMT",
"version": "v1"
}
] | 2021-05-07 | [
[
"Bitar",
"Rawad",
""
],
[
"Hanna",
"Serge Kas",
""
],
[
"Polyanskii",
"Nikita",
""
],
[
"Vorobyev",
"Ilya",
""
]
] | We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most $k$ deletions occur in a window of size $k$, where the positions of the deletions within this window are not necessa... |
2109.10733 | Sk Shahnawaz | Samayan Bhattacharya, Sk Shahnawaz | Animal inspired Application of a Variant of Mel Spectrogram for Seismic
Data Processing | 6 pages, 5 figures, 1 table | null | 10.13140/RG.2.2.30040.42247 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Predicting disaster events from seismic data is of paramount importance and
can save thousands of lives, especially in earthquake-prone areas and
habitations around volcanic craters. The drastic rise in the number of seismic
monitoring stations in recent years has allowed the collection of a huge
quantity of data, ou... | [
{
"created": "Wed, 22 Sep 2021 13:41:57 GMT",
"version": "v1"
}
] | 2021-09-23 | [
[
"Bhattacharya",
"Samayan",
""
],
[
"Shahnawaz",
"Sk",
""
]
] | Predicting disaster events from seismic data is of paramount importance and can save thousands of lives, especially in earthquake-prone areas and habitations around volcanic craters. The drastic rise in the number of seismic monitoring stations in recent years has allowed the collection of a huge quantity of data, outp... |
2103.01555 | Linda Lastrico | Linda Lastrico, Alessandro Carf\`i, Alessia Vignolo, Alessandra
Sciutti, Fulvio Mastrogiovanni and Francesco Rea | Careful with That! Observation of Human Movements to Estimate Objects
Properties | Preprint version - 13th International Workshop of Human-Friendly
Robotics (HFR 2020) | Human-Friendly Robotics, SPAR 18 (2020) 127-141 | 10.1007/978-3-030-71356-0_10 | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Humans are very effective at interpreting subtle properties of the partner's
movement and use this skill to promote smooth interactions. Therefore, robotic
platforms that support human partners in daily activities should acquire
similar abilities. In this work we focused on the features of human motor
actions that co... | [
{
"created": "Tue, 2 Mar 2021 08:14:56 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Mar 2021 10:15:40 GMT",
"version": "v2"
}
] | 2021-03-11 | [
[
"Lastrico",
"Linda",
""
],
[
"Carfì",
"Alessandro",
""
],
[
"Vignolo",
"Alessia",
""
],
[
"Sciutti",
"Alessandra",
""
],
[
"Mastrogiovanni",
"Fulvio",
""
],
[
"Rea",
"Francesco",
""
]
] | Humans are very effective at interpreting subtle properties of the partner's movement and use this skill to promote smooth interactions. Therefore, robotic platforms that support human partners in daily activities should acquire similar abilities. In this work we focused on the features of human motor actions that comm... |
2107.05473 | Hung-Wei Tseng | Kuan-Chieh Hsu and Hung-Wei Tseng | GPTPU: Accelerating Applications using Edge Tensor Processing Units | This paper is a pre-print of a paper in the 2021 SC, the
International Conference for High Performance Computing, Networking, Storage
and Analysis | null | null | null | cs.DC cs.PF eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural network (NN) accelerators have been integrated into a wide-spectrum of
computer systems to accommodate the rapidly growing demands for artificial
intelligence (AI) and machine learning (ML) applications. NN accelerators share
the idea of providing native hardware support for operations on
multidimensional tens... | [
{
"created": "Tue, 22 Jun 2021 18:03:22 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Jul 2021 06:04:21 GMT",
"version": "v2"
}
] | 2021-07-14 | [
[
"Hsu",
"Kuan-Chieh",
""
],
[
"Tseng",
"Hung-Wei",
""
]
] | Neural network (NN) accelerators have been integrated into a wide-spectrum of computer systems to accommodate the rapidly growing demands for artificial intelligence (AI) and machine learning (ML) applications. NN accelerators share the idea of providing native hardware support for operations on multidimensional tensor... |
2312.08509 | Pooja Kulkarni | Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta | Approximating APS under Submodular and XOS valuations with Binary
Marginals | null | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | We study the problem of fairly dividing indivisible goods among a set of
agents under the fairness notion of Any Price Share (APS). APS is known to
dominate the widely studied Maximin share (MMS). Since an exact APS allocation
may not exist, the focus has traditionally been on the computation of
approximate APS alloc... | [
{
"created": "Wed, 13 Dec 2023 20:46:22 GMT",
"version": "v1"
}
] | 2023-12-15 | [
[
"Kulkarni",
"Pooja",
""
],
[
"Kulkarni",
"Rucha",
""
],
[
"Mehta",
"Ruta",
""
]
] | We study the problem of fairly dividing indivisible goods among a set of agents under the fairness notion of Any Price Share (APS). APS is known to dominate the widely studied Maximin share (MMS). Since an exact APS allocation may not exist, the focus has traditionally been on the computation of approximate APS allocat... |
2212.08541 | Euan Ong | Euan Ong and Petar Veli\v{c}kovi\'c | Learnable Commutative Monoids for Graph Neural Networks | Accepted to the proceedings of the First Learning on Graphs
Conference (LoG 2022) | null | null | null | cs.LG cs.AI stat.ML | http://creativecommons.org/licenses/by/4.0/ | Graph neural networks (GNNs) have been shown to be highly sensitive to the
choice of aggregation function. While summing over a node's neighbours can
approximate any permutation-invariant function over discrete inputs,
Cohen-Karlik et al. [2020] proved there are set-aggregation problems for which
summing cannot gener... | [
{
"created": "Fri, 16 Dec 2022 15:43:41 GMT",
"version": "v1"
}
] | 2022-12-19 | [
[
"Ong",
"Euan",
""
],
[
"Veličković",
"Petar",
""
]
] | Graph neural networks (GNNs) have been shown to be highly sensitive to the choice of aggregation function. While summing over a node's neighbours can approximate any permutation-invariant function over discrete inputs, Cohen-Karlik et al. [2020] proved there are set-aggregation problems for which summing cannot general... |
2306.07785 | T. N. Vijaykumar | Conor Green, Cole Nelson, Mithuna Thottethodi, and T. N. Vijaykumar | SafeBet: Secure, Simple, and Fast Speculative Execution | null | null | null | null | cs.AR cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spectre attacks exploit microprocessor speculative execution to read and
transmit forbidden data outside the attacker's trust domain and sandbox. Recent
hardware schemes allow potentially-unsafe speculative accesses but prevent the
secret's transmission by delaying most access-dependent instructions even in
the predo... | [
{
"created": "Tue, 13 Jun 2023 14:07:52 GMT",
"version": "v1"
}
] | 2023-06-14 | [
[
"Green",
"Conor",
""
],
[
"Nelson",
"Cole",
""
],
[
"Thottethodi",
"Mithuna",
""
],
[
"Vijaykumar",
"T. N.",
""
]
] | Spectre attacks exploit microprocessor speculative execution to read and transmit forbidden data outside the attacker's trust domain and sandbox. Recent hardware schemes allow potentially-unsafe speculative accesses but prevent the secret's transmission by delaying most access-dependent instructions even in the predomi... |
1905.07505 | Changkyu Song | Changkyu Song and Abdeslam Boularias | Object Rearrangement with Nested Nonprehensile Manipulation Actions | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the problem of rearrangement planning, i.e finding a
sequence of manipulation actions that displace multiple objects from an initial
configuration to a given goal configuration. Rearrangement is a critical skill
for robots so that they can effectively operate in confined spaces that contain
clutt... | [
{
"created": "Fri, 17 May 2019 23:58:41 GMT",
"version": "v1"
}
] | 2019-05-21 | [
[
"Song",
"Changkyu",
""
],
[
"Boularias",
"Abdeslam",
""
]
] | This paper considers the problem of rearrangement planning, i.e finding a sequence of manipulation actions that displace multiple objects from an initial configuration to a given goal configuration. Rearrangement is a critical skill for robots so that they can effectively operate in confined spaces that contain clutter... |
2406.07996 | Qiong Wu | Zhiyu Shao, Qiong Wu, Pingyi Fan, Nan Cheng, Qiang Fan, Jiangzhou Wang | Semantic-Aware Resource Allocation Based on Deep Reinforcement Learning
for 5G-V2X HetNets | This paper has been submitted to IEEE Letter.The source code has been
released at:
https://github.com/qiongwu86/Semantic-Aware-Resource-Allocation-Based-on-Deep-Reinforcement-Learning-for-5G-V2X-HetNets | null | null | null | cs.NI eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This letter proposes a semantic-aware resource allocation (SARA) framework
with flexible duty cycle (DC) coexistence mechanism (SARADC) for 5G-V2X
Heterogeneous Network (HetNets) based on deep reinforcement learning (DRL)
proximal policy optimization (PPO). Specifically, we investigate V2X networks
within a two-tiere... | [
{
"created": "Wed, 12 Jun 2024 08:42:23 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Shao",
"Zhiyu",
""
],
[
"Wu",
"Qiong",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Cheng",
"Nan",
""
],
[
"Fan",
"Qiang",
""
],
[
"Wang",
"Jiangzhou",
""
]
] | This letter proposes a semantic-aware resource allocation (SARA) framework with flexible duty cycle (DC) coexistence mechanism (SARADC) for 5G-V2X Heterogeneous Network (HetNets) based on deep reinforcement learning (DRL) proximal policy optimization (PPO). Specifically, we investigate V2X networks within a two-tiered ... |
2312.10082 | Jibril Frej | Jibril Frej and Neel Shah and Marta Kne\v{z}evi\'c and Tanya
Nazaretsky and Tanja K\"aser | Finding Paths for Explainable MOOC Recommendation: A Learner Perspective | null | null | 10.1145/3636555.3636898 | null | cs.IR cs.LG | http://creativecommons.org/licenses/by/4.0/ | The increasing availability of Massive Open Online Courses (MOOCs) has
created a necessity for personalized course recommendation systems. These
systems often combine neural networks with Knowledge Graphs (KGs) to achieve
richer representations of learners and courses. While these enriched
representations allow more ... | [
{
"created": "Mon, 11 Dec 2023 15:27:22 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Frej",
"Jibril",
""
],
[
"Shah",
"Neel",
""
],
[
"Knežević",
"Marta",
""
],
[
"Nazaretsky",
"Tanya",
""
],
[
"Käser",
"Tanja",
""
]
] | The increasing availability of Massive Open Online Courses (MOOCs) has created a necessity for personalized course recommendation systems. These systems often combine neural networks with Knowledge Graphs (KGs) to achieve richer representations of learners and courses. While these enriched representations allow more ac... |
1406.5910 | Roman Shapovalov | Roman Shapovalov, Dmitry Vetrov, Anton Osokin, Pushmeet Kohli | Multi-utility Learning: Structured-output Learning with Multiple
Annotation-specific Loss Functions | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structured-output learning is a challenging problem; particularly so because
of the difficulty in obtaining large datasets of fully labelled instances for
training. In this paper we try to overcome this difficulty by presenting a
multi-utility learning framework for structured prediction that can learn from
training ... | [
{
"created": "Mon, 23 Jun 2014 14:06:24 GMT",
"version": "v1"
}
] | 2014-06-24 | [
[
"Shapovalov",
"Roman",
""
],
[
"Vetrov",
"Dmitry",
""
],
[
"Osokin",
"Anton",
""
],
[
"Kohli",
"Pushmeet",
""
]
] | Structured-output learning is a challenging problem; particularly so because of the difficulty in obtaining large datasets of fully labelled instances for training. In this paper we try to overcome this difficulty by presenting a multi-utility learning framework for structured prediction that can learn from training in... |
2206.10175 | Xiujuan Zhu | Ying Hu, Xiujuan Zhu, Yunlong Li, Hao Huang, and Liang He | A Multi-grained based Attention Network for Semi-supervised Sound Event
Detection | null | INTERSPEECH 2022 | 10.21437/Interspeech.2022-767 | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sound event detection (SED) is an interesting but challenging task due to the
scarcity of data and diverse sound events in real life. This paper presents a
multi-grained based attention network (MGA-Net) for semi-supervised sound event
detection. To obtain the feature representations related to sound events, a
residu... | [
{
"created": "Tue, 21 Jun 2022 08:15:27 GMT",
"version": "v1"
}
] | 2022-11-01 | [
[
"Hu",
"Ying",
""
],
[
"Zhu",
"Xiujuan",
""
],
[
"Li",
"Yunlong",
""
],
[
"Huang",
"Hao",
""
],
[
"He",
"Liang",
""
]
] | Sound event detection (SED) is an interesting but challenging task due to the scarcity of data and diverse sound events in real life. This paper presents a multi-grained based attention network (MGA-Net) for semi-supervised sound event detection. To obtain the feature representations related to sound events, a residual... |
2008.06826 | Guan-An Wang | Guan'an Wang, Shaogang Gong, Jian Cheng and Zengguang Hou | Faster Person Re-Identification | accepted by ECCV2020, https://github.com/wangguanan/light-reid | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fast person re-identification (ReID) aims to search person images quickly and
accurately. The main idea of recent fast ReID methods is the hashing algorithm,
which learns compact binary codes and performs fast Hamming distance and
counting sort. However, a very long code is needed for high accuracy (e.g.
2048), which... | [
{
"created": "Sun, 16 Aug 2020 03:02:49 GMT",
"version": "v1"
}
] | 2020-08-18 | [
[
"Wang",
"Guan'an",
""
],
[
"Gong",
"Shaogang",
""
],
[
"Cheng",
"Jian",
""
],
[
"Hou",
"Zengguang",
""
]
] | Fast person re-identification (ReID) aims to search person images quickly and accurately. The main idea of recent fast ReID methods is the hashing algorithm, which learns compact binary codes and performs fast Hamming distance and counting sort. However, a very long code is needed for high accuracy (e.g. 2048), which c... |
1705.03078 | Toby Pereira | Toby Pereira | An Anthropic Argument against the Future Existence of Superintelligent
Artificial Intelligence | 11 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper uses anthropic reasoning to argue for a reduced likelihood that
superintelligent AI will come into existence in the future. To make this
argument, a new principle is introduced: the Super-Strong Self-Sampling
Assumption (SSSSA), building on the Self-Sampling Assumption (SSA) and the
Strong Self-Sampling As... | [
{
"created": "Mon, 8 May 2017 20:37:45 GMT",
"version": "v1"
}
] | 2017-05-10 | [
[
"Pereira",
"Toby",
""
]
] | This paper uses anthropic reasoning to argue for a reduced likelihood that superintelligent AI will come into existence in the future. To make this argument, a new principle is introduced: the Super-Strong Self-Sampling Assumption (SSSSA), building on the Self-Sampling Assumption (SSA) and the Strong Self-Sampling Assu... |
0908.3634 | Dominique Duval | Dominique Duval (LJK), C\'esar Dominguez | A parameterization process as a categorical construction | null | null | null | null | cs.LO math.CT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The parameterization process used in the symbolic computation systems Kenzo
and EAT is studied here as a general construction in a categorical framework.
This parameterization process starts from a given specification and builds a
parameterized specification by transforming some operations into parameterized
operatio... | [
{
"created": "Tue, 25 Aug 2009 15:31:18 GMT",
"version": "v1"
}
] | 2009-08-26 | [
[
"Duval",
"Dominique",
"",
"LJK"
],
[
"Dominguez",
"César",
""
]
] | The parameterization process used in the symbolic computation systems Kenzo and EAT is studied here as a general construction in a categorical framework. This parameterization process starts from a given specification and builds a parameterized specification by transforming some operations into parameterized operations... |
1103.5197 | Parisa Babaheidarian | Parisa Babaheidarian and Somayeh Salimi and Mohammad Reza Aref | A New Secret key Agreement Scheme in a Four-Terminal Network | 6 pages, 3 figures | null | null | null | cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A new scenario for generating a secret key and two private keys among three
Terminals in the presence of an external eavesdropper is considered. Terminals
1, 2 and 3 intend to share a common secret key concealed from the external
eavesdropper (Terminal 4) and simultaneously, each of Terminals 1 and 2 intends
to share... | [
{
"created": "Sun, 27 Mar 2011 11:08:07 GMT",
"version": "v1"
}
] | 2011-03-29 | [
[
"Babaheidarian",
"Parisa",
""
],
[
"Salimi",
"Somayeh",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] | A new scenario for generating a secret key and two private keys among three Terminals in the presence of an external eavesdropper is considered. Terminals 1, 2 and 3 intend to share a common secret key concealed from the external eavesdropper (Terminal 4) and simultaneously, each of Terminals 1 and 2 intends to share a... |
2403.05302 | Sorav Bansal | Abhishek Rose and Sorav Bansal | Modeling Dynamic (De)Allocations of Local Memory for Translation
Validation | null | null | 10.1145/3649863 | null | cs.PL | http://creativecommons.org/licenses/by/4.0/ | End-to-End Translation Validation is the problem of verifying the executable
code generated by a compiler against the corresponding input source code for a
single compilation. This becomes particularly hard in the presence of
dynamically-allocated local memory where addresses of local memory may be
observed by the pr... | [
{
"created": "Fri, 8 Mar 2024 13:31:50 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Mar 2024 09:19:01 GMT",
"version": "v2"
}
] | 2024-03-14 | [
[
"Rose",
"Abhishek",
""
],
[
"Bansal",
"Sorav",
""
]
] | End-to-End Translation Validation is the problem of verifying the executable code generated by a compiler against the corresponding input source code for a single compilation. This becomes particularly hard in the presence of dynamically-allocated local memory where addresses of local memory may be observed by the prog... |
1307.4983 | Gholamreza Alirezaei | Gholamreza Alirezaei | A Sharp Double Inequality for the Inverse Tangent Function | Submitted to the Transactions on Information Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The inverse tangent function can be bounded by different inequalities, for
example by Shafer's inequality. In this publication, we propose a new sharp
double inequality, consisting of a lower and an upper bound, for the inverse
tangent function. In particular, we sharpen Shafer's inequality and calculate
the best cor... | [
{
"created": "Thu, 18 Jul 2013 15:34:25 GMT",
"version": "v1"
}
] | 2013-07-19 | [
[
"Alirezaei",
"Gholamreza",
""
]
] | The inverse tangent function can be bounded by different inequalities, for example by Shafer's inequality. In this publication, we propose a new sharp double inequality, consisting of a lower and an upper bound, for the inverse tangent function. In particular, we sharpen Shafer's inequality and calculate the best corre... |
1811.07157 | Gurkirt Singh | Gurkirt Singh, Fabio Cuzzolin | Recurrent Convolutions for Causal 3D CNNs | Workshop on Large Scale Holistic Video Understanding, ICCVW, 2019 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, three dimensional (3D) convolutional neural networks (CNNs) have
emerged as dominant methods to capture spatiotemporal representations in
videos, by adding to pre-existing 2D CNNs a third, temporal dimension. Such 3D
CNNs, however, are anti-causal (i.e., they exploit information from both the
past and the f... | [
{
"created": "Sat, 17 Nov 2018 13:07:30 GMT",
"version": "v1"
},
{
"created": "Sat, 31 Aug 2019 09:28:25 GMT",
"version": "v2"
}
] | 2019-09-04 | [
[
"Singh",
"Gurkirt",
""
],
[
"Cuzzolin",
"Fabio",
""
]
] | Recently, three dimensional (3D) convolutional neural networks (CNNs) have emerged as dominant methods to capture spatiotemporal representations in videos, by adding to pre-existing 2D CNNs a third, temporal dimension. Such 3D CNNs, however, are anti-causal (i.e., they exploit information from both the past and the fut... |
2401.08238 | Giovanni Braglia | Giovanni Braglia, Davide Tebaldi and Luigi Biagiotti | Phase-free Dynamic Movement Primitives Applied to Kinesthetic Guidance
in Robotic Co-manipulation Tasks | 15 pages, 17 figures | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Whenever a robotic task needs to be defined and adapted based on a reference
motion, Dynamic Movement Primitives (DMP) represent a standard and efficient
method for encoding it. The nominal trajectory is typically obtained through a
Programming by Demonstration (PbD) approach, where the robot is taught a
specific tas... | [
{
"created": "Tue, 16 Jan 2024 09:49:19 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Jun 2024 07:07:56 GMT",
"version": "v2"
}
] | 2024-06-05 | [
[
"Braglia",
"Giovanni",
""
],
[
"Tebaldi",
"Davide",
""
],
[
"Biagiotti",
"Luigi",
""
]
] | Whenever a robotic task needs to be defined and adapted based on a reference motion, Dynamic Movement Primitives (DMP) represent a standard and efficient method for encoding it. The nominal trajectory is typically obtained through a Programming by Demonstration (PbD) approach, where the robot is taught a specific task ... |
2407.11418 | Liana Patel | Liana Patel, Siddharth Jha, Carlos Guestrin, Matei Zaharia | LOTUS: Enabling Semantic Queries with LLMs Over Tables of Unstructured
and Structured Data | null | null | null | null | cs.DB cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | The semantic capabilities of language models (LMs) have the potential to
enable rich analytics and reasoning over vast knowledge corpora. Unfortunately,
existing systems lack high-level abstractions to perform semantic queries at
scale. We introduce semantic operators, a declarative programming interface
that extends... | [
{
"created": "Tue, 16 Jul 2024 06:19:14 GMT",
"version": "v1"
}
] | 2024-07-17 | [
[
"Patel",
"Liana",
""
],
[
"Jha",
"Siddharth",
""
],
[
"Guestrin",
"Carlos",
""
],
[
"Zaharia",
"Matei",
""
]
] | The semantic capabilities of language models (LMs) have the potential to enable rich analytics and reasoning over vast knowledge corpora. Unfortunately, existing systems lack high-level abstractions to perform semantic queries at scale. We introduce semantic operators, a declarative programming interface that extends t... |
2011.12024 | Haoxi Ran | Haoxi Ran, Guangfu Wang, Li Lu | RIN: Textured Human Model Recovery and Imitation with a Single Image | The experiments is incompleted | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human imitation has become topical recently, driven by GAN's ability to
disentangle human pose and body content. However, the latest methods hardly
focus on 3D information, and to avoid self-occlusion, a massive amount of input
images are needed. In this paper, we propose RIN, a novel volume-based
framework for recon... | [
{
"created": "Tue, 24 Nov 2020 11:04:35 GMT",
"version": "v1"
},
{
"created": "Sun, 29 Nov 2020 05:03:23 GMT",
"version": "v2"
},
{
"created": "Thu, 4 Mar 2021 07:17:18 GMT",
"version": "v3"
},
{
"created": "Sat, 14 Aug 2021 12:19:46 GMT",
"version": "v4"
}
] | 2021-08-17 | [
[
"Ran",
"Haoxi",
""
],
[
"Wang",
"Guangfu",
""
],
[
"Lu",
"Li",
""
]
] | Human imitation has become topical recently, driven by GAN's ability to disentangle human pose and body content. However, the latest methods hardly focus on 3D information, and to avoid self-occlusion, a massive amount of input images are needed. In this paper, we propose RIN, a novel volume-based framework for reconst... |
1309.4713 | Patrizio Angelini | Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson | SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs | 21 pages, 10 figures, 14 references | null | null | null | cs.DS cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that every $n$-vertex planar graph admits a simultaneous embedding
with no mapping and with fixed edges with any $(n/2)$-vertex planar graph. In
order to achieve this result, we prove that every $n$-vertex plane graph has an
induced outerplane subgraph containing at least $n/2$ vertices. Also, we show
that ev... | [
{
"created": "Wed, 18 Sep 2013 17:22:52 GMT",
"version": "v1"
}
] | 2013-09-19 | [
[
"Angelini",
"Patrizio",
""
],
[
"Evans",
"William",
""
],
[
"Frati",
"Fabrizio",
""
],
[
"Gudmundsson",
"Joachim",
""
]
] | We show that every $n$-vertex planar graph admits a simultaneous embedding with no mapping and with fixed edges with any $(n/2)$-vertex planar graph. In order to achieve this result, we prove that every $n$-vertex plane graph has an induced outerplane subgraph containing at least $n/2$ vertices. Also, we show that ever... |
1710.03349 | Loet Leydesdorff | Jordan A Comins, Stephanie A Carmack, Loet Leydesdorff | Patent Citation Spectroscopy (PCS): Algorithmic retrieval of landmark
patents | null | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One essential component in the construction of patent landscapes in
biomedical research and development (R&D) is identifying the most seminal
patents. Hitherto, the identification of seminal patents required subject
matter experts within biomedical areas. In this brief communication, we report
an analytical method an... | [
{
"created": "Mon, 9 Oct 2017 23:29:43 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Oct 2017 14:01:38 GMT",
"version": "v2"
}
] | 2017-10-17 | [
[
"Comins",
"Jordan A",
""
],
[
"Carmack",
"Stephanie A",
""
],
[
"Leydesdorff",
"Loet",
""
]
] | One essential component in the construction of patent landscapes in biomedical research and development (R&D) is identifying the most seminal patents. Hitherto, the identification of seminal patents required subject matter experts within biomedical areas. In this brief communication, we report an analytical method and ... |
2006.12576 | Patrick Hart C | Patrick Hart, Alois Knoll | Graph Neural Networks and Reinforcement Learning for Behavior Generation
in Semantic Environments | null | null | null | null | cs.LG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most reinforcement learning approaches used in behavior generation utilize
vectorial information as input. However, this requires the network to have a
pre-defined input-size -- in semantic environments this means assuming the
maximum number of vehicles. Additionally, this vectorial representation is not
invariant to... | [
{
"created": "Mon, 22 Jun 2020 19:24:52 GMT",
"version": "v1"
}
] | 2020-06-24 | [
[
"Hart",
"Patrick",
""
],
[
"Knoll",
"Alois",
""
]
] | Most reinforcement learning approaches used in behavior generation utilize vectorial information as input. However, this requires the network to have a pre-defined input-size -- in semantic environments this means assuming the maximum number of vehicles. Additionally, this vectorial representation is not invariant to t... |
2111.03135 | Linjun Zhang | Maya Burhanpurkar, Zhun Deng, Cynthia Dwork, Linjun Zhang | Scaffolding Sets | 32 pages, 4 figures | null | null | null | cs.LG cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predictors map individual instances in a population to the interval $[0,1]$.
For a collection $\mathcal C$ of subsets of a population, a predictor is
multi-calibrated with respect to $\mathcal C$ if it is simultaneously
calibrated on each set in $\mathcal C$. We initiate the study of the
construction of scaffolding s... | [
{
"created": "Thu, 4 Nov 2021 20:01:58 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Nov 2021 03:00:56 GMT",
"version": "v2"
}
] | 2021-11-18 | [
[
"Burhanpurkar",
"Maya",
""
],
[
"Deng",
"Zhun",
""
],
[
"Dwork",
"Cynthia",
""
],
[
"Zhang",
"Linjun",
""
]
] | Predictors map individual instances in a population to the interval $[0,1]$. For a collection $\mathcal C$ of subsets of a population, a predictor is multi-calibrated with respect to $\mathcal C$ if it is simultaneously calibrated on each set in $\mathcal C$. We initiate the study of the construction of scaffolding set... |
2308.10504 | Ebenezer Isaac | Ebenezer R.H.P. Isaac and Akshat Sharma | Adaptive Thresholding Heuristic for KPI Anomaly Detection | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-nc-nd/4.0/ | A plethora of outlier detectors have been explored in the time series domain,
however, in a business sense, not all outliers are anomalies of interest.
Existing anomaly detection solutions are confined to certain outlier detectors
limiting their applicability to broader anomaly detection use cases. Network
KPIs (Key ... | [
{
"created": "Mon, 21 Aug 2023 06:45:28 GMT",
"version": "v1"
}
] | 2023-08-22 | [
[
"Isaac",
"Ebenezer R. H. P.",
""
],
[
"Sharma",
"Akshat",
""
]
] | A plethora of outlier detectors have been explored in the time series domain, however, in a business sense, not all outliers are anomalies of interest. Existing anomaly detection solutions are confined to certain outlier detectors limiting their applicability to broader anomaly detection use cases. Network KPIs (Key Pe... |
1302.4808 | Christian Cachin | Christian Cachin and Olga Ohrimenko | Verifying the Consistency of Remote Untrusted Services with
Conflict-Free Operations | A predecessor of this paper with a slightly different title appears
in the proceedings of OPODIS 2014, Lecture Notes in Computer Science,
vol.~8878, Springer, 2014 | null | 10.1007/978-3-319-14472-6_1 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A group of mutually trusting clients outsources a computation service to a
remote server, which they do not fully trust and that may be subject to
attacks. The clients do not communicate with each other and would like to
verify the correctness of the remote computation and the consistency of the
server's responses. T... | [
{
"created": "Wed, 20 Feb 2013 05:22:35 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Dec 2013 08:41:17 GMT",
"version": "v2"
},
{
"created": "Fri, 30 Jan 2015 20:37:21 GMT",
"version": "v3"
},
{
"created": "Mon, 26 Mar 2018 13:13:10 GMT",
"version": "v4"
}
] | 2018-03-28 | [
[
"Cachin",
"Christian",
""
],
[
"Ohrimenko",
"Olga",
""
]
] | A group of mutually trusting clients outsources a computation service to a remote server, which they do not fully trust and that may be subject to attacks. The clients do not communicate with each other and would like to verify the correctness of the remote computation and the consistency of the server's responses. Thi... |
1512.07827 | Tao You | Tao You, Ben-Chang Shia, Zhong-Yuan Zhang | Community Detection in Complex Networks Using Density-based Clustering
Algorithm | null | null | 10.1016/j.physa.2016.07.025 | null | cs.SI physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Like clustering analysis, community detection aims at assigning nodes in a
network into different communities. Fdp is a recently proposed density-based
clustering algorithm which does not need the number of clusters as prior input
and the result is insensitive to its parameter. However, Fdp cannot be directly
applied... | [
{
"created": "Thu, 24 Dec 2015 14:56:05 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Dec 2015 16:02:32 GMT",
"version": "v2"
},
{
"created": "Sun, 31 Jan 2016 11:02:56 GMT",
"version": "v3"
}
] | 2016-09-21 | [
[
"You",
"Tao",
""
],
[
"Shia",
"Ben-Chang",
""
],
[
"Zhang",
"Zhong-Yuan",
""
]
] | Like clustering analysis, community detection aims at assigning nodes in a network into different communities. Fdp is a recently proposed density-based clustering algorithm which does not need the number of clusters as prior input and the result is insensitive to its parameter. However, Fdp cannot be directly applied t... |
2012.01671 | Ying-Chiao Liao | Chuan-Chi Wang, Ying-Chiao Liao, Chia-Heng Tu, Ming-Chang Kao, Wen-Yew
Liang, Shih-Hao Hung | ResPerfNet: Deep Residual Learning for Regressional Performance Modeling
of Deep Neural Networks | null | null | null | null | cs.LG cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid advancements of computing technology facilitate the development of
diverse deep learning applications. Unfortunately, the efficiency of parallel
computing infrastructures varies widely with neural network models, which
hinders the exploration of the design space to find high-performance neural
network archi... | [
{
"created": "Thu, 3 Dec 2020 03:02:42 GMT",
"version": "v1"
}
] | 2020-12-04 | [
[
"Wang",
"Chuan-Chi",
""
],
[
"Liao",
"Ying-Chiao",
""
],
[
"Tu",
"Chia-Heng",
""
],
[
"Kao",
"Ming-Chang",
""
],
[
"Liang",
"Wen-Yew",
""
],
[
"Hung",
"Shih-Hao",
""
]
] | The rapid advancements of computing technology facilitate the development of diverse deep learning applications. Unfortunately, the efficiency of parallel computing infrastructures varies widely with neural network models, which hinders the exploration of the design space to find high-performance neural network archite... |
2307.16864 | Jiehua Chen | Jiehua Chen and Christian Hatschka and Sofia Simola | Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections
with (Nearly) Structured Preferences | A conference version appeared in ECAI 2023 | null | null | null | cs.MA cs.DS cs.GT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We investigate winner determination for two popular proportional
representation systems: the Monroe and Chamberlin-Courant (abbrv. CC) systems.
Our study focuses on (nearly) single-peaked resp. single-crossing preferences.
We show that for single-crossing approval preferences, winner determination of
the Monroe rule ... | [
{
"created": "Mon, 31 Jul 2023 17:21:21 GMT",
"version": "v1"
}
] | 2023-08-01 | [
[
"Chen",
"Jiehua",
""
],
[
"Hatschka",
"Christian",
""
],
[
"Simola",
"Sofia",
""
]
] | We investigate winner determination for two popular proportional representation systems: the Monroe and Chamberlin-Courant (abbrv. CC) systems. Our study focuses on (nearly) single-peaked resp. single-crossing preferences. We show that for single-crossing approval preferences, winner determination of the Monroe rule is... |
2203.01188 | Piyush Kumar Garg | Piyush Kumar Garg and Roshni Chakraborty and Sourav Kumar Dandapat | EnDSUM: Entropy and Diversity based Disaster Tweet Summarization | null | null | null | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | The huge amount of information shared in Twitter during disaster events are
utilized by government agencies and humanitarian organizations to ensure quick
crisis response and provide situational updates. However, the huge number of
tweets posted makes manual identification of the relevant tweets impossible. To
addres... | [
{
"created": "Wed, 2 Mar 2022 15:38:18 GMT",
"version": "v1"
}
] | 2022-03-03 | [
[
"Garg",
"Piyush Kumar",
""
],
[
"Chakraborty",
"Roshni",
""
],
[
"Dandapat",
"Sourav Kumar",
""
]
] | The huge amount of information shared in Twitter during disaster events are utilized by government agencies and humanitarian organizations to ensure quick crisis response and provide situational updates. However, the huge number of tweets posted makes manual identification of the relevant tweets impossible. To address ... |
1309.6797 | Petr Golovach | Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, and Micha{\l}
Pilipczuk | Minimizing Rosenthal Potential in Multicast Games | null | null | null | null | cs.GT cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A multicast game is a network design game modelling how selfish
non-cooperative agents build and maintain one-to-many network communication.
There is a special source node and a collection of agents located at
corresponding terminals. Each agent is interested in selecting a route from the
special source to its termin... | [
{
"created": "Thu, 26 Sep 2013 11:08:47 GMT",
"version": "v1"
}
] | 2013-09-27 | [
[
"Fomin",
"Fedor V.",
""
],
[
"Golovach",
"Petr A.",
""
],
[
"Nederlof",
"Jesper",
""
],
[
"Pilipczuk",
"Michał",
""
]
] | A multicast game is a network design game modelling how selfish non-cooperative agents build and maintain one-to-many network communication. There is a special source node and a collection of agents located at corresponding terminals. Each agent is interested in selecting a route from the special source to its terminal... |
1905.05243 | Hanxiang Hao | Hanxiang Hao, David G\"uera, J\'anos Horv\'ath, Amy R. Reibman and
Edward J. Delp | Robustness Analysis of Face Obscuration | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Face obscuration is needed by law enforcement and mass media outlets to
guarantee privacy. Sharing sensitive content where obscuration or redaction
techniques have failed to completely remove all identifiable traces can lead to
many legal and social issues. Hence, we need to be able to systematically
measure the face... | [
{
"created": "Mon, 13 May 2019 19:03:35 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Oct 2019 20:30:48 GMT",
"version": "v2"
}
] | 2019-10-17 | [
[
"Hao",
"Hanxiang",
""
],
[
"Güera",
"David",
""
],
[
"Horváth",
"János",
""
],
[
"Reibman",
"Amy R.",
""
],
[
"Delp",
"Edward J.",
""
]
] | Face obscuration is needed by law enforcement and mass media outlets to guarantee privacy. Sharing sensitive content where obscuration or redaction techniques have failed to completely remove all identifiable traces can lead to many legal and social issues. Hence, we need to be able to systematically measure the face o... |
2404.10267 | Jiahao Wang | Jiahao Wang, Caixia Yan, Haonan Lin, Weizhan Zhang, Mengmeng Wang,
Tieliang Gong, Guang Dai, Hao Sun | OneActor: Consistent Character Generation via Cluster-Conditioned
Guidance | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text-to-image diffusion models benefit artists with high-quality image
generation. Yet their stochastic nature hinders artists from creating
consistent images of the same subject. Existing methods try to tackle this
challenge and generate consistent content in various ways. However, they either
depend on external res... | [
{
"created": "Tue, 16 Apr 2024 03:45:45 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Jul 2024 13:03:00 GMT",
"version": "v2"
}
] | 2024-07-15 | [
[
"Wang",
"Jiahao",
""
],
[
"Yan",
"Caixia",
""
],
[
"Lin",
"Haonan",
""
],
[
"Zhang",
"Weizhan",
""
],
[
"Wang",
"Mengmeng",
""
],
[
"Gong",
"Tieliang",
""
],
[
"Dai",
"Guang",
""
],
[
"Sun",
"Ha... | Text-to-image diffusion models benefit artists with high-quality image generation. Yet their stochastic nature hinders artists from creating consistent images of the same subject. Existing methods try to tackle this challenge and generate consistent content in various ways. However, they either depend on external restr... |
2207.04638 | Carl Qi | Carl Qi, Xingyu Lin, David Held | Learning Closed-loop Dough Manipulation Using a Differentiable Reset
Module | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deformable object manipulation has many applications such as cooking and
laundry folding in our daily lives. Manipulating elastoplastic objects such as
dough is particularly challenging because dough lacks a compact state
representation and requires contact-rich interactions. We consider the task of
flattening a piec... | [
{
"created": "Mon, 11 Jul 2022 05:38:46 GMT",
"version": "v1"
}
] | 2022-07-12 | [
[
"Qi",
"Carl",
""
],
[
"Lin",
"Xingyu",
""
],
[
"Held",
"David",
""
]
] | Deformable object manipulation has many applications such as cooking and laundry folding in our daily lives. Manipulating elastoplastic objects such as dough is particularly challenging because dough lacks a compact state representation and requires contact-rich interactions. We consider the task of flattening a piece ... |
2102.08058 | Jinbao Zhu | Jinbao Zhu, Qifa Yan, Xiaohu Tang, and Ying Miao | Capacity-Achieving Private Information Retrieval Schemes from Uncoded
Storage Constrained Servers with Low Sub-packetization | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates reducing sub-packetization of capacity-achieving
schemes for uncoded Storage Constrained Private Information Retrieval (SC-PIR)
systems. In the SC-PIR system, a user aims to retrieve one out of $K$ files
from $N$ servers while revealing nothing about its identity to any individual
server, in w... | [
{
"created": "Tue, 16 Feb 2021 10:11:47 GMT",
"version": "v1"
}
] | 2021-02-17 | [
[
"Zhu",
"Jinbao",
""
],
[
"Yan",
"Qifa",
""
],
[
"Tang",
"Xiaohu",
""
],
[
"Miao",
"Ying",
""
]
] | This paper investigates reducing sub-packetization of capacity-achieving schemes for uncoded Storage Constrained Private Information Retrieval (SC-PIR) systems. In the SC-PIR system, a user aims to retrieve one out of $K$ files from $N$ servers while revealing nothing about its identity to any individual server, in whi... |
2302.12018 | Ryan Benkert | Ryan Benkert, Mohit Prabhushankar, Ghassan AlRegib, Armin Pacharmi,
and Enrique Corona | Gaussian Switch Sampling: A Second Order Approach to Active Learning | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | In active learning, acquisition functions define informativeness directly on
the representation position within the model manifold. However, for most
machine learning models (in particular neural networks) this representation is
not fixed due to the training pool fluctuations in between active learning
rounds. Theref... | [
{
"created": "Thu, 16 Feb 2023 15:24:56 GMT",
"version": "v1"
}
] | 2023-02-24 | [
[
"Benkert",
"Ryan",
""
],
[
"Prabhushankar",
"Mohit",
""
],
[
"AlRegib",
"Ghassan",
""
],
[
"Pacharmi",
"Armin",
""
],
[
"Corona",
"Enrique",
""
]
] | In active learning, acquisition functions define informativeness directly on the representation position within the model manifold. However, for most machine learning models (in particular neural networks) this representation is not fixed due to the training pool fluctuations in between active learning rounds. Therefor... |
1908.00948 | Stefan Lattner | Stefan Lattner and Maarten Grachten | High-Level Control of Drum Track Generation Using Learned Patterns of
Rhythmic Interaction | Paper accepted at the IEEE Workshop on Applications of Signal
Processing to Audio and Acoustics (WASPAA 2019), New Paltz, New York, U.S.A.,
October 20-23; 6 pages, 3 figures, 1 table | null | null | null | cs.SD cs.HC cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spurred by the potential of deep learning, computational music generation has
gained renewed academic interest. A crucial issue in music generation is that
of user control, especially in scenarios where the music generation process is
conditioned on existing musical material. Here we propose a model for
conditional k... | [
{
"created": "Fri, 2 Aug 2019 16:39:02 GMT",
"version": "v1"
}
] | 2019-08-05 | [
[
"Lattner",
"Stefan",
""
],
[
"Grachten",
"Maarten",
""
]
] | Spurred by the potential of deep learning, computational music generation has gained renewed academic interest. A crucial issue in music generation is that of user control, especially in scenarios where the music generation process is conditioned on existing musical material. Here we propose a model for conditional kic... |
2205.08020 | Polina Binder | Polina Binder, Meghan Lawler, LaShadric Grady, Neil Carlson, Sumudu
Leelananda, Svetlana Belyanskaya, Joe Franklin, Nicolas Tilmans, Henri
Palacci | Partial Product Aware Machine Learning on DNA-Encoded Libraries | 8 pages, 5 figures; Published at the MLDD workshop, ICLR 2022 | null | null | null | cs.LG q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | DNA encoded libraries (DELs) are used for rapid large-scale screening of
small molecules against a protein target. These combinatorial libraries are
built through several cycles of chemistry and DNA ligation, producing large
sets of DNA-tagged molecules. Training machine learning models on DEL data has
been shown to ... | [
{
"created": "Mon, 16 May 2022 23:18:02 GMT",
"version": "v1"
}
] | 2022-05-18 | [
[
"Binder",
"Polina",
""
],
[
"Lawler",
"Meghan",
""
],
[
"Grady",
"LaShadric",
""
],
[
"Carlson",
"Neil",
""
],
[
"Leelananda",
"Sumudu",
""
],
[
"Belyanskaya",
"Svetlana",
""
],
[
"Franklin",
"Joe",
""
],... | DNA encoded libraries (DELs) are used for rapid large-scale screening of small molecules against a protein target. These combinatorial libraries are built through several cycles of chemistry and DNA ligation, producing large sets of DNA-tagged molecules. Training machine learning models on DEL data has been shown to be... |
1612.02975 | Dharmendra Kumar | Dharmendra Kumar, Debasis Mitra, Bhargab B. Bhattacharya | On Fault-Tolerant Design of Exclusive-OR Gates in QCA | 9 pages, 26 figures, Microprocessors and Microsystems Journal
(communicated) | null | null | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Design paradigms of logic circuits with Quantum-dot Cellular Automata (QCA)
have been extensively studied in the recent past. Unfortunately, due to the
lack of mature fabrication support, QCA-based circuits often suffer from
various types of manufacturing defects and variations, and therefore, are
unreliable and erro... | [
{
"created": "Fri, 9 Dec 2016 11:08:14 GMT",
"version": "v1"
}
] | 2016-12-12 | [
[
"Kumar",
"Dharmendra",
""
],
[
"Mitra",
"Debasis",
""
],
[
"Bhattacharya",
"Bhargab B.",
""
]
] | Design paradigms of logic circuits with Quantum-dot Cellular Automata (QCA) have been extensively studied in the recent past. Unfortunately, due to the lack of mature fabrication support, QCA-based circuits often suffer from various types of manufacturing defects and variations, and therefore, are unreliable and error-... |
2108.05576 | Arafat Aldhaqm Dr | Muhammed Ahmed Saleh, Siti Hajar Othman, Arafat Al-Dhaqm, Mahmoud
Ahmad Al-Khasawneh | Common Investigation Process Model for Internet of Things Forensics | 6 pages, 5 figuers, 76 references | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Internet of Things Forensics (IoTFs) is a new discipline in digital forensics
science used in the detection, acquisition, preservation, rebuilding,
analyzing, and the presentation of evidence from IoT environments. IoTFs
discipline still suffers from several issues and challenges that have in the
recent past been doc... | [
{
"created": "Thu, 12 Aug 2021 07:49:05 GMT",
"version": "v1"
}
] | 2021-08-13 | [
[
"Saleh",
"Muhammed Ahmed",
""
],
[
"Othman",
"Siti Hajar",
""
],
[
"Al-Dhaqm",
"Arafat",
""
],
[
"Al-Khasawneh",
"Mahmoud Ahmad",
""
]
] | Internet of Things Forensics (IoTFs) is a new discipline in digital forensics science used in the detection, acquisition, preservation, rebuilding, analyzing, and the presentation of evidence from IoT environments. IoTFs discipline still suffers from several issues and challenges that have in the recent past been docum... |
2202.10845 | Kun-Ting Chen | Kun-Ting Chen, Tim Dwyer, Yalong Yang, Benjamin Bach, Kim Marriott | GAN'SDA Wrap: Geographic And Network Structured Data on surfaces that
Wrap around | null | null | 10.1145/3491102.3501928 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are many methods for projecting spherical maps onto the plane.
Interactive versions of these projections allow the user to centre the region
of interest. However, the effects of such interaction have not previously been
evaluated. In a study with 120 participants we find interaction provides
significantly more ... | [
{
"created": "Tue, 22 Feb 2022 12:15:41 GMT",
"version": "v1"
}
] | 2022-02-23 | [
[
"Chen",
"Kun-Ting",
""
],
[
"Dwyer",
"Tim",
""
],
[
"Yang",
"Yalong",
""
],
[
"Bach",
"Benjamin",
""
],
[
"Marriott",
"Kim",
""
]
] | There are many methods for projecting spherical maps onto the plane. Interactive versions of these projections allow the user to centre the region of interest. However, the effects of such interaction have not previously been evaluated. In a study with 120 participants we find interaction provides significantly more ac... |
1907.12690 | Byunghyun Ban | Byunghyun Ban, Soobin Kim | Control of nonlinear, complex and black-boxed greenhouse system with
reinforcement learning | 4 pages, 2 figures, 1 table. 2 pages of supplementary information.
Published on ICTC 2017 | 2017 International Conference on Information and Communication
Technology Convergence (ICTC) | 10.1109/ICTC.2017.8190813 | null | cs.LG cs.AI cs.SY eess.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern control theories such as systems engineering approaches try to solve
nonlinear system problems by revelation of causal relationship or
co-relationship among the components; most of those approaches focus on control
of sophisticatedly modeled white-boxed systems. We suggest an application of
actor-critic reinfo... | [
{
"created": "Tue, 30 Jul 2019 00:06:47 GMT",
"version": "v1"
}
] | 2021-01-07 | [
[
"Ban",
"Byunghyun",
""
],
[
"Kim",
"Soobin",
""
]
] | Modern control theories such as systems engineering approaches try to solve nonlinear system problems by revelation of causal relationship or co-relationship among the components; most of those approaches focus on control of sophisticatedly modeled white-boxed systems. We suggest an application of actor-critic reinforc... |
0801.0649 | Frederic Prost | F. Prost and C. Zerrari | A logical analysis of entanglement and separability in quantum
higher-order functions | 19 pages | null | 10.1007/978-3-642-03745-0_25 | null | cs.LO | null | We present a logical separability analysis for a functional quantum
computation language. This logic is inspired by previous works on logical
analysis of aliasing for imperative functional programs. Both analyses share
similarities notably because they are highly non-compositional. Quantum setting
is harder to deal w... | [
{
"created": "Fri, 4 Jan 2008 10:12:59 GMT",
"version": "v1"
}
] | 2015-05-13 | [
[
"Prost",
"F.",
""
],
[
"Zerrari",
"C.",
""
]
] | We present a logical separability analysis for a functional quantum computation language. This logic is inspired by previous works on logical analysis of aliasing for imperative functional programs. Both analyses share similarities notably because they are highly non-compositional. Quantum setting is harder to deal wit... |
2401.06411 | Robert Aviles S | Robert S. Aviles, Xi Li, Lei Lu, Zhaorui Ni, Peter A. Beerel | An Efficient and Scalable Clocking Assignment Algorithm for
Multi-Threaded Multi-Phase Single Flux Quantum Circuits | null | null | null | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A key distinguishing feature of single flux quantum (SFQ) circuits is that
each logic gate is clocked. This feature forces the introduction of
path-balancing flip-flops to ensure proper synchronization of inputs at each
gate. This paper proposes a polynomial time complexity approximation algorithm
for clocking assign... | [
{
"created": "Fri, 12 Jan 2024 07:12:40 GMT",
"version": "v1"
}
] | 2024-01-15 | [
[
"Aviles",
"Robert S.",
""
],
[
"Li",
"Xi",
""
],
[
"Lu",
"Lei",
""
],
[
"Ni",
"Zhaorui",
""
],
[
"Beerel",
"Peter A.",
""
]
] | A key distinguishing feature of single flux quantum (SFQ) circuits is that each logic gate is clocked. This feature forces the introduction of path-balancing flip-flops to ensure proper synchronization of inputs at each gate. This paper proposes a polynomial time complexity approximation algorithm for clocking assignme... |
2008.12183 | Zhengbang Zha | Zhengbang Zha and Lei Hu | Some classes of power functions with low c-differential uniformity over
finite fields | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Functions with low c-differential uniformity have optimal resistance to some
types of differential cryptanalysis. In this paper, we investigate the
c-differential uniformity of power functions over finite fields. Based on some
known almost perfect nonlinear functions, we present several classes of power
functions $f(... | [
{
"created": "Thu, 27 Aug 2020 15:17:29 GMT",
"version": "v1"
}
] | 2020-08-28 | [
[
"Zha",
"Zhengbang",
""
],
[
"Hu",
"Lei",
""
]
] | Functions with low c-differential uniformity have optimal resistance to some types of differential cryptanalysis. In this paper, we investigate the c-differential uniformity of power functions over finite fields. Based on some known almost perfect nonlinear functions, we present several classes of power functions $f(x)... |
2209.06159 | Jelena Luketina | Jelena Luketina, Sebastian Flennerhag, Yannick Schroecker, David Abel,
Tom Zahavy, Satinder Singh | Meta-Gradients in Non-Stationary Environments | 16 pages, 9 figures, CoLLAs 2022 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Meta-gradient methods (Xu et al., 2018; Zahavy et al., 2020) offer a
promising solution to the problem of hyperparameter selection and adaptation in
non-stationary reinforcement learning problems. However, the properties of
meta-gradients in such environments have not been systematically studied. In
this work, we bri... | [
{
"created": "Tue, 13 Sep 2022 17:05:10 GMT",
"version": "v1"
}
] | 2022-09-14 | [
[
"Luketina",
"Jelena",
""
],
[
"Flennerhag",
"Sebastian",
""
],
[
"Schroecker",
"Yannick",
""
],
[
"Abel",
"David",
""
],
[
"Zahavy",
"Tom",
""
],
[
"Singh",
"Satinder",
""
]
] | Meta-gradient methods (Xu et al., 2018; Zahavy et al., 2020) offer a promising solution to the problem of hyperparameter selection and adaptation in non-stationary reinforcement learning problems. However, the properties of meta-gradients in such environments have not been systematically studied. In this work, we bring... |
1706.04347 | Vikram Kumar | Vikram Kumar, Reza Arablouei, Brano Kusy, Raja Jurdak, and Neil W.
Bergmann | WLS-Based Self-Localization Using Perturbed Anchor Positions and RSSI
Measurements | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of self-localization by a resource-constrained node
within a network given radio signal strength indicator (RSSI) measurements from
a set of anchor nodes where the RSSI measurements as well as the anchor
position information are subject to perturbation. In order to achieve a
computationally ef... | [
{
"created": "Wed, 14 Jun 2017 07:52:35 GMT",
"version": "v1"
}
] | 2017-06-15 | [
[
"Kumar",
"Vikram",
""
],
[
"Arablouei",
"Reza",
""
],
[
"Kusy",
"Brano",
""
],
[
"Jurdak",
"Raja",
""
],
[
"Bergmann",
"Neil W.",
""
]
] | We consider the problem of self-localization by a resource-constrained node within a network given radio signal strength indicator (RSSI) measurements from a set of anchor nodes where the RSSI measurements as well as the anchor position information are subject to perturbation. In order to achieve a computationally effi... |
1412.1194 | Feng Shi | Feng Shi, Robert Laganiere, Emil Petriu | Gradient Boundary Histograms for Action Recognition | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a high efficient local spatiotemporal descriptor,
called gradient boundary histograms (GBH). The proposed GBH descriptor is built
on simple spatio-temporal gradients, which are fast to compute. We demonstrate
that it can better represent local structure and motion than other
gradient-based descr... | [
{
"created": "Wed, 3 Dec 2014 05:23:03 GMT",
"version": "v1"
}
] | 2014-12-04 | [
[
"Shi",
"Feng",
""
],
[
"Laganiere",
"Robert",
""
],
[
"Petriu",
"Emil",
""
]
] | This paper introduces a high efficient local spatiotemporal descriptor, called gradient boundary histograms (GBH). The proposed GBH descriptor is built on simple spatio-temporal gradients, which are fast to compute. We demonstrate that it can better represent local structure and motion than other gradient-based descrip... |
2405.20216 | Sanghyeon Na | Sanghyeon Na, Yonggyu Kim, Hyunjoon Lee | Boost Your Own Human Image Generation Model via Direct Preference
Optimization with AI Feedback | 28 pages, 18 figures | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The generation of high-quality human images through text-to-image (T2I)
methods is a significant yet challenging task. Distinct from general image
generation, human image synthesis must satisfy stringent criteria related to
human pose, anatomy, and alignment with textual prompts, making it particularly
difficult to a... | [
{
"created": "Thu, 30 May 2024 16:18:05 GMT",
"version": "v1"
}
] | 2024-05-31 | [
[
"Na",
"Sanghyeon",
""
],
[
"Kim",
"Yonggyu",
""
],
[
"Lee",
"Hyunjoon",
""
]
] | The generation of high-quality human images through text-to-image (T2I) methods is a significant yet challenging task. Distinct from general image generation, human image synthesis must satisfy stringent criteria related to human pose, anatomy, and alignment with textual prompts, making it particularly difficult to ach... |
1708.05192 | Cong Wang | Leidi Zhao, Raheem Lawhorn, Siddharth Patil, Steve Susanibar, Lu Lu,
Cong Wang, Bo Ouyang | Multiform Adaptive Robot Skill Learning from Humans | Accepted to 2017 Dynamic Systems and Control Conference (DSCC),
Tysons Corner, VA, October 11-13 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object manipulation is a basic element in everyday human lives. Robotic
manipulation has progressed from maneuvering single-rigid-body objects with
firm grasping to maneuvering soft objects and handling contact-rich actions.
Meanwhile, technologies such as robot learning from demonstration have enabled
humans to intu... | [
{
"created": "Thu, 17 Aug 2017 10:03:32 GMT",
"version": "v1"
}
] | 2017-08-18 | [
[
"Zhao",
"Leidi",
""
],
[
"Lawhorn",
"Raheem",
""
],
[
"Patil",
"Siddharth",
""
],
[
"Susanibar",
"Steve",
""
],
[
"Lu",
"Lu",
""
],
[
"Wang",
"Cong",
""
],
[
"Ouyang",
"Bo",
""
]
] | Object manipulation is a basic element in everyday human lives. Robotic manipulation has progressed from maneuvering single-rigid-body objects with firm grasping to maneuvering soft objects and handling contact-rich actions. Meanwhile, technologies such as robot learning from demonstration have enabled humans to intuit... |
1204.1225 | Nasrin Jaberi | Masnida Emami, Ali Setayesh, Nasrin Jaberi | Distributed computing of Seismic Imaging Algorithms | null | null | null | null | cs.DC physics.geo-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The primary use of technical computing in the oil and gas industries is for
seismic imaging of the earth's subsurface, driven by the business need for
making well-informed drilling decisions during petroleum exploration and
production. Since each oil/gas well in exploration areas costs several tens of
millions of dol... | [
{
"created": "Thu, 5 Apr 2012 13:43:23 GMT",
"version": "v1"
}
] | 2012-04-06 | [
[
"Emami",
"Masnida",
""
],
[
"Setayesh",
"Ali",
""
],
[
"Jaberi",
"Nasrin",
""
]
] | The primary use of technical computing in the oil and gas industries is for seismic imaging of the earth's subsurface, driven by the business need for making well-informed drilling decisions during petroleum exploration and production. Since each oil/gas well in exploration areas costs several tens of millions of dolla... |
cs/0504104 | Neal E. Young | Marek Chrobak and Claire Kenyon and Neal E. Young | The reverse greedy algorithm for the metric k-median problem | to appear in IPL. preliminary version in COCOON '05 | Information Processing Letters 97:68-72(2006) | 10.1016/j.ipl.2005.09.009 | null | cs.DS | null | The Reverse Greedy algorithm (RGreedy) for the k-median problem works as
follows. It starts by placing facilities on all nodes. At each step, it removes
a facility to minimize the resulting total distance from the customers to the
remaining facilities. It stops when k facilities remain. We prove that, if the
distance... | [
{
"created": "Wed, 27 Apr 2005 19:36:08 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Sep 2005 17:43:50 GMT",
"version": "v2"
}
] | 2015-06-02 | [
[
"Chrobak",
"Marek",
""
],
[
"Kenyon",
"Claire",
""
],
[
"Young",
"Neal E.",
""
]
] | The Reverse Greedy algorithm (RGreedy) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the resulting total distance from the customers to the remaining facilities. It stops when k facilities remain. We prove that, if the distance f... |
2308.05247 | Emiliano De Cristofaro | Mohammad Hammas Saeed, Kostantinos Papadamou, Jeremy Blackburn,
Emiliano De Cristofaro, Gianluca Stringhini | TUBERAIDER: Attributing Coordinated Hate Attacks on YouTube Videos to
their Source Communities | Accepted for publication at the 18th International AAAI Conference on
Web and Social Media (ICWSM 2024). Please cite accordingly | null | null | null | cs.SI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Alas, coordinated hate attacks, or raids, are becoming increasingly common
online. In a nutshell, these are perpetrated by a group of aggressors who
organize and coordinate operations on a platform (e.g., 4chan) to target
victims on another community (e.g., YouTube). In this paper, we focus on
attributing raids to th... | [
{
"created": "Wed, 9 Aug 2023 22:41:19 GMT",
"version": "v1"
},
{
"created": "Sun, 23 Jun 2024 00:48:49 GMT",
"version": "v2"
}
] | 2024-06-25 | [
[
"Saeed",
"Mohammad Hammas",
""
],
[
"Papadamou",
"Kostantinos",
""
],
[
"Blackburn",
"Jeremy",
""
],
[
"De Cristofaro",
"Emiliano",
""
],
[
"Stringhini",
"Gianluca",
""
]
] | Alas, coordinated hate attacks, or raids, are becoming increasingly common online. In a nutshell, these are perpetrated by a group of aggressors who organize and coordinate operations on a platform (e.g., 4chan) to target victims on another community (e.g., YouTube). In this paper, we focus on attributing raids to thei... |
1909.01779 | Matthia Sabatelli | Matthia Sabatelli, Gilles Louppe, Pierre Geurts, Marco A. Wiering | Approximating two value functions instead of one: towards characterizing
a new family of Deep Reinforcement Learning algorithms | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper makes one step forward towards characterizing a new family of
\textit{model-free} Deep Reinforcement Learning (DRL) algorithms. The aim of
these algorithms is to jointly learn an approximation of the state-value
function ($V$), alongside an approximation of the state-action value function
($Q$). Our analys... | [
{
"created": "Sun, 1 Sep 2019 10:29:54 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Oct 2019 09:06:37 GMT",
"version": "v2"
}
] | 2019-10-15 | [
[
"Sabatelli",
"Matthia",
""
],
[
"Louppe",
"Gilles",
""
],
[
"Geurts",
"Pierre",
""
],
[
"Wiering",
"Marco A.",
""
]
] | This paper makes one step forward towards characterizing a new family of \textit{model-free} Deep Reinforcement Learning (DRL) algorithms. The aim of these algorithms is to jointly learn an approximation of the state-value function ($V$), alongside an approximation of the state-action value function ($Q$). Our analysis... |
1809.02176 | Zhangjie Cao | Zhongyi Pei, Zhangjie Cao, Mingsheng Long, and Jianmin Wang | Multi-Adversarial Domain Adaptation | AAAI 2018 Oral. arXiv admin note: substantial text overlap with
arXiv:1705.10667, arXiv:1707.07901 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in deep domain adaptation reveal that adversarial learning
can be embedded into deep networks to learn transferable features that reduce
distribution discrepancy between the source and target domains. Existing domain
adversarial adaptation methods based on single domain discriminator only align
the so... | [
{
"created": "Tue, 4 Sep 2018 20:54:48 GMT",
"version": "v1"
}
] | 2018-09-10 | [
[
"Pei",
"Zhongyi",
""
],
[
"Cao",
"Zhangjie",
""
],
[
"Long",
"Mingsheng",
""
],
[
"Wang",
"Jianmin",
""
]
] | Recent advances in deep domain adaptation reveal that adversarial learning can be embedded into deep networks to learn transferable features that reduce distribution discrepancy between the source and target domains. Existing domain adversarial adaptation methods based on single domain discriminator only align the sour... |
2109.14337 | Romain Ducrocq | Romain Ducrocq and Nadir Farhi | Deep Reinforcement Q-Learning for Intelligent Traffic Signal Control
with Partial Detection | 9 pages | null | null | null | cs.LG cs.SY eess.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intelligent traffic signal controllers, applying DQN algorithms to traffic
light policy optimization, efficiently reduce traffic congestion by adjusting
traffic signals to real-time traffic. Most propositions in the literature
however consider that all vehicles at the intersection are detected, an
unrealistic scenari... | [
{
"created": "Wed, 29 Sep 2021 10:42:33 GMT",
"version": "v1"
}
] | 2021-09-30 | [
[
"Ducrocq",
"Romain",
""
],
[
"Farhi",
"Nadir",
""
]
] | Intelligent traffic signal controllers, applying DQN algorithms to traffic light policy optimization, efficiently reduce traffic congestion by adjusting traffic signals to real-time traffic. Most propositions in the literature however consider that all vehicles at the intersection are detected, an unrealistic scenario.... |
1605.07990 | Thang N. Dinh | Hung T. Nguyen, My T. Thai, and Thang N. Dinh | Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in
Billion-scale Networks | Correct the errors in the proofs for SSA/D-SSA. Update D-SSA to
estimate \epsilon(s) instead of \delta(s) | null | null | null | cs.SI cs.DS physics.soc-ph | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Influence Maximization (IM), that seeks a small set of key users who spread
the influence widely into the network, is a core problem in multiple domains.
It finds applications in viral marketing, epidemic control, and assessing
cascading failures within complex systems. Despite the huge amount of effort,
IM in billio... | [
{
"created": "Wed, 25 May 2016 18:15:01 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Sep 2016 14:40:39 GMT",
"version": "v2"
},
{
"created": "Wed, 22 Feb 2017 05:15:27 GMT",
"version": "v3"
}
] | 2017-02-23 | [
[
"Nguyen",
"Hung T.",
""
],
[
"Thai",
"My T.",
""
],
[
"Dinh",
"Thang N.",
""
]
] | Influence Maximization (IM), that seeks a small set of key users who spread the influence widely into the network, is a core problem in multiple domains. It finds applications in viral marketing, epidemic control, and assessing cascading failures within complex systems. Despite the huge amount of effort, IM in billion-... |
2208.14302 | Samet Bayram | Samet Bayram and Kenneth Barner | A Black-Box Attack on Optical Character Recognition Systems | 11 Pages, CVMI-2022 | null | null | null | cs.CV cs.CR cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Adversarial machine learning is an emerging area showing the vulnerability of
deep learning models. Exploring attack methods to challenge state of the art
artificial intelligence (A.I.) models is an area of critical concern. The
reliability and robustness of such A.I. models are one of the major concerns
with an incr... | [
{
"created": "Tue, 30 Aug 2022 14:36:27 GMT",
"version": "v1"
}
] | 2022-08-31 | [
[
"Bayram",
"Samet",
""
],
[
"Barner",
"Kenneth",
""
]
] | Adversarial machine learning is an emerging area showing the vulnerability of deep learning models. Exploring attack methods to challenge state of the art artificial intelligence (A.I.) models is an area of critical concern. The reliability and robustness of such A.I. models are one of the major concerns with an increa... |
2312.05805 | Kelley Ann Yohe | Kelley Ann Yohe | Towards Global, Socio-Economic, and Culturally Aware Recommender Systems | null | null | null | null | cs.IR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommender systems have gained increasing attention to personalise consumer
preferences. While these systems have primarily focused on applications such as
advertisement recommendations (e.g., Google), personalized suggestions (e.g.,
Netflix and Spotify), and retail selection (e.g., Amazon), there is potential
for t... | [
{
"created": "Sun, 10 Dec 2023 07:36:06 GMT",
"version": "v1"
}
] | 2023-12-12 | [
[
"Yohe",
"Kelley Ann",
""
]
] | Recommender systems have gained increasing attention to personalise consumer preferences. While these systems have primarily focused on applications such as advertisement recommendations (e.g., Google), personalized suggestions (e.g., Netflix and Spotify), and retail selection (e.g., Amazon), there is potential for the... |
2207.07740 | Quoc Hung Ngo | Quoc Hung Ngo, Tahar Kechadi, Nhien-An Le-Khac | Knowledge Representation in Digital Agriculture: A Step Towards
Standardised Model | null | Computers and Electronics in Agriculture 199 (2022): 107127 | 10.1016/j.compag.2022.107127 | null | cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In recent years, data science has evolved significantly. Data analysis and
mining processes become routines in all sectors of the economy where datasets
are available. Vast data repositories have been collected, curated, stored, and
used for extracting knowledge. And this is becoming commonplace. Subsequently,
we ext... | [
{
"created": "Fri, 15 Jul 2022 20:31:56 GMT",
"version": "v1"
}
] | 2022-07-19 | [
[
"Ngo",
"Quoc Hung",
""
],
[
"Kechadi",
"Tahar",
""
],
[
"Le-Khac",
"Nhien-An",
""
]
] | In recent years, data science has evolved significantly. Data analysis and mining processes become routines in all sectors of the economy where datasets are available. Vast data repositories have been collected, curated, stored, and used for extracting knowledge. And this is becoming commonplace. Subsequently, we extra... |
2109.02109 | Damiano Zanotto | Yufeng Zhang, Shuai Li, Karen J. Nolan, and Damiano Zanotto | Shaping Individualized Impedance Landscapes for Gait Training via
Reinforcement Learning | in IEEE Transactions on Medical Robotics and Bionics, 2022 | null | 10.1109/TMRB.2021.3137971 | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Assist-as-needed (AAN) control aims at promoting therapeutic outcomes in
robot-assisted rehabilitation by encouraging patients' active participation.
Impedance control is used by most AAN controllers to create a compliant force
field around a target motion to ensure tracking accuracy while allowing
moderate kinematic... | [
{
"created": "Sun, 5 Sep 2021 16:03:02 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jan 2022 16:19:04 GMT",
"version": "v2"
}
] | 2022-01-04 | [
[
"Zhang",
"Yufeng",
""
],
[
"Li",
"Shuai",
""
],
[
"Nolan",
"Karen J.",
""
],
[
"Zanotto",
"Damiano",
""
]
] | Assist-as-needed (AAN) control aims at promoting therapeutic outcomes in robot-assisted rehabilitation by encouraging patients' active participation. Impedance control is used by most AAN controllers to create a compliant force field around a target motion to ensure tracking accuracy while allowing moderate kinematic e... |
1910.14627 | Zhaojun Wang | Zhun Fan, Zhaojun Wang, Xiaomin Zhu, Bingliang Hu, Anmin Zou, and
Dongwei Bao | An Automatic Design Framework of Swarm Pattern Formation based on
Multi-objective Genetic Programming | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most existing swarm pattern formation methods depend on a predefined gene
regulatory network (GRN) structure that requires designers' priori knowledge,
which is difficult to adapt to complex and changeable environments. To
dynamically adapt to the complex and changeable environments, we propose an
automatic design fr... | [
{
"created": "Thu, 31 Oct 2019 17:12:36 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Nov 2019 17:08:45 GMT",
"version": "v2"
}
] | 2019-11-04 | [
[
"Fan",
"Zhun",
""
],
[
"Wang",
"Zhaojun",
""
],
[
"Zhu",
"Xiaomin",
""
],
[
"Hu",
"Bingliang",
""
],
[
"Zou",
"Anmin",
""
],
[
"Bao",
"Dongwei",
""
]
] | Most existing swarm pattern formation methods depend on a predefined gene regulatory network (GRN) structure that requires designers' priori knowledge, which is difficult to adapt to complex and changeable environments. To dynamically adapt to the complex and changeable environments, we propose an automatic design fram... |
2107.04632 | Mart\'i Pedemonte | Mart\'i Pedemonte, Jordi Vitri\`a and \'Alvaro Parafita (Universitat
de Barcelona) | Algorithmic Causal Effect Identification with causaleffect | 40 pages, 27 figures | null | null | null | cs.MS cs.AI math.ST stat.TH | http://creativecommons.org/licenses/by/4.0/ | Our evolution as a species made a huge step forward when we understood the
relationships between causes and effects. These associations may be trivial for
some events, but they are not in complex scenarios. To rigorously prove that
some occurrences are caused by others, causal theory and causal inference were
formali... | [
{
"created": "Fri, 9 Jul 2021 19:00:33 GMT",
"version": "v1"
}
] | 2021-07-13 | [
[
"Pedemonte",
"Martí",
"",
"Universitat\n de Barcelona"
],
[
"Vitrià",
"Jordi",
"",
"Universitat\n de Barcelona"
],
[
"Parafita",
"Álvaro",
"",
"Universitat\n de Barcelona"
]
] | Our evolution as a species made a huge step forward when we understood the relationships between causes and effects. These associations may be trivial for some events, but they are not in complex scenarios. To rigorously prove that some occurrences are caused by others, causal theory and causal inference were formalize... |
2005.01389 | Elwin Huaman | Elwin Huaman, Elias K\"arle, Dieter Fensel | Knowledge Graph Validation | null | null | null | null | cs.DB cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge graphs (KGs) have shown to be an important asset of large companies
like Google and Microsoft. KGs play an important role in providing structured
and semantically rich information, making them available to people and
machines, and supplying accurate, correct and reliable knowledge. To do so a
critical task ... | [
{
"created": "Mon, 4 May 2020 11:09:11 GMT",
"version": "v1"
}
] | 2020-05-05 | [
[
"Huaman",
"Elwin",
""
],
[
"Kärle",
"Elias",
""
],
[
"Fensel",
"Dieter",
""
]
] | Knowledge graphs (KGs) have shown to be an important asset of large companies like Google and Microsoft. KGs play an important role in providing structured and semantically rich information, making them available to people and machines, and supplying accurate, correct and reliable knowledge. To do so a critical task is... |
2407.05090 | Dianshu Liao | Dianshu Liao, Shidong Pan, Siyuan Yang, Yitong Wang, Yanjie Zhao,
Zhenchang Xing, Xiaoyu Sun | Automatically Analyzing Performance Issues in Android Apps: How Far Are
We? | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Performance plays a critical role in ensuring the smooth operation of any
mobile application, directly influencing user engagement and retention. Android
applications are no exception. However, unlike functionality issues,
performance issues are more challenging to discover as their root causes are
sophisticated and ... | [
{
"created": "Sat, 6 Jul 2024 14:43:40 GMT",
"version": "v1"
}
] | 2024-07-09 | [
[
"Liao",
"Dianshu",
""
],
[
"Pan",
"Shidong",
""
],
[
"Yang",
"Siyuan",
""
],
[
"Wang",
"Yitong",
""
],
[
"Zhao",
"Yanjie",
""
],
[
"Xing",
"Zhenchang",
""
],
[
"Sun",
"Xiaoyu",
""
]
] | Performance plays a critical role in ensuring the smooth operation of any mobile application, directly influencing user engagement and retention. Android applications are no exception. However, unlike functionality issues, performance issues are more challenging to discover as their root causes are sophisticated and ty... |
1302.6854 | Hong Xu | Hong Xu, Philippe Smets | Evidential Reasoning with Conditional Belief Functions | Appears in Proceedings of the Tenth Conference on Uncertainty in
Artificial Intelligence (UAI1994) | null | null | UAI-P-1994-PG-598-605 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the existing evidential networks with belief functions, the relations
among the variables are always represented by joint belief functions on the
product space of the involved variables. In this paper, we use conditional
belief functions to represent such relations in the network and show some
relations of these t... | [
{
"created": "Wed, 27 Feb 2013 14:20:41 GMT",
"version": "v1"
}
] | 2013-02-28 | [
[
"Xu",
"Hong",
""
],
[
"Smets",
"Philippe",
""
]
] | In the existing evidential networks with belief functions, the relations among the variables are always represented by joint belief functions on the product space of the involved variables. In this paper, we use conditional belief functions to represent such relations in the network and show some relations of these two... |
2305.16357 | Himanshu Gupta | Ujjwala Anantheswaran and Himanshu Gupta and Mihir Parmar and Kuntal
Kumar Pal and Chitta Baral | EDM3: Event Detection as Multi-task Text Generation | 9 pages, 4 figures, 10 tables, 5 Page appendix | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event detection refers to identifying event occurrences in a text and
comprises of two subtasks; event identification and classification. We present
EDM3, a novel approach for Event Detection that formulates three generative
tasks: identification, classification, and combined detection. We show that
EDM3 helps to lea... | [
{
"created": "Thu, 25 May 2023 06:25:16 GMT",
"version": "v1"
}
] | 2023-05-29 | [
[
"Anantheswaran",
"Ujjwala",
""
],
[
"Gupta",
"Himanshu",
""
],
[
"Parmar",
"Mihir",
""
],
[
"Pal",
"Kuntal Kumar",
""
],
[
"Baral",
"Chitta",
""
]
] | Event detection refers to identifying event occurrences in a text and comprises of two subtasks; event identification and classification. We present EDM3, a novel approach for Event Detection that formulates three generative tasks: identification, classification, and combined detection. We show that EDM3 helps to learn... |
2305.11681 | Li Ding | Li Ding, Edward Pantridge, Lee Spector | Probabilistic Lexicase Selection | GECCO 2023 | null | 10.1145/3583131.3590375 | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Lexicase selection is a widely used parent selection algorithm in genetic
programming, known for its success in various task domains such as program
synthesis, symbolic regression, and machine learning. Due to its non-parametric
and recursive nature, calculating the probability of each individual being
selected by le... | [
{
"created": "Fri, 19 May 2023 13:57:04 GMT",
"version": "v1"
}
] | 2023-05-22 | [
[
"Ding",
"Li",
""
],
[
"Pantridge",
"Edward",
""
],
[
"Spector",
"Lee",
""
]
] | Lexicase selection is a widely used parent selection algorithm in genetic programming, known for its success in various task domains such as program synthesis, symbolic regression, and machine learning. Due to its non-parametric and recursive nature, calculating the probability of each individual being selected by lexi... |
1612.04460 | Vered Shwartz | Vered Shwartz, Enrico Santus, and Dominik Schlechtweg | Hypernyms under Siege: Linguistically-motivated Artillery for Hypernymy
Detection | EACL 2017. 9 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The fundamental role of hypernymy in NLP has motivated the development of
many methods for the automatic identification of this relation, most of which
rely on word distribution. We investigate an extensive number of such
unsupervised measures, using several distributional semantic models that differ
by context type ... | [
{
"created": "Wed, 14 Dec 2016 02:28:29 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Jan 2017 08:41:18 GMT",
"version": "v2"
}
] | 2017-01-10 | [
[
"Shwartz",
"Vered",
""
],
[
"Santus",
"Enrico",
""
],
[
"Schlechtweg",
"Dominik",
""
]
] | The fundamental role of hypernymy in NLP has motivated the development of many methods for the automatic identification of this relation, most of which rely on word distribution. We investigate an extensive number of such unsupervised measures, using several distributional semantic models that differ by context type an... |
2007.03040 | Arun Ganesh | Arun Ganesh, Aaron Sy | Near-Linear Time Edit Distance for Indel Channels | Appears in WABI 2020 | null | null | null | cs.DS q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the following model for sampling pairs of strings: $s_1$ is a
uniformly random bitstring of length $n$, and $s_2$ is the bitstring arrived at
by applying substitutions, insertions, and deletions to each bit of $s_1$ with
some probability. We show that the edit distance between $s_1$ and $s_2$ can be
compu... | [
{
"created": "Mon, 6 Jul 2020 19:58:58 GMT",
"version": "v1"
}
] | 2020-07-08 | [
[
"Ganesh",
"Arun",
""
],
[
"Sy",
"Aaron",
""
]
] | We consider the following model for sampling pairs of strings: $s_1$ is a uniformly random bitstring of length $n$, and $s_2$ is the bitstring arrived at by applying substitutions, insertions, and deletions to each bit of $s_1$ with some probability. We show that the edit distance between $s_1$ and $s_2$ can be compute... |
2408.00098 | Dickens Kwesiga | Dickness Kwesiga, Angshuman Guin, and Michael Hunter | Adaptive Transit Signal Priority based on Deep Reinforcement Learning
and Connected Vehicles in a Traffic Microsimulation Environment | null | null | null | null | cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | Model free reinforcement learning (RL) provides a potential alternative to
earlier formulations of adaptive transit signal priority (TSP) algorithms based
on mathematical programming that require complex and nonlinear objective
functions. This study extends RL - based traffic control to include TSP. Using
a microscop... | [
{
"created": "Wed, 31 Jul 2024 18:17:22 GMT",
"version": "v1"
}
] | 2024-08-02 | [
[
"Kwesiga",
"Dickness",
""
],
[
"Guin",
"Angshuman",
""
],
[
"Hunter",
"Michael",
""
]
] | Model free reinforcement learning (RL) provides a potential alternative to earlier formulations of adaptive transit signal priority (TSP) algorithms based on mathematical programming that require complex and nonlinear objective functions. This study extends RL - based traffic control to include TSP. Using a microscopic... |
0809.3357 | Sushmita Ruj | Sushmita Ruj and Bimal Roy | More on Combinatorial Batch Codes | null | null | null | null | cs.CR cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Paterson, Stinson and Wei \cite{PSW} introduced Combinatorial batch codes,
which are combinatorial description of Batch code. Batch codes were first
presented by Ishai, Kushilevita, Ostrovsky and Sahai \cite{IKOS} in STOC'04. In
this paper we answer some of the questions put forward by Paterson, Stinson and
Wei and g... | [
{
"created": "Fri, 19 Sep 2008 12:16:14 GMT",
"version": "v1"
}
] | 2008-10-01 | [
[
"Ruj",
"Sushmita",
""
],
[
"Roy",
"Bimal",
""
]
] | Paterson, Stinson and Wei \cite{PSW} introduced Combinatorial batch codes, which are combinatorial description of Batch code. Batch codes were first presented by Ishai, Kushilevita, Ostrovsky and Sahai \cite{IKOS} in STOC'04. In this paper we answer some of the questions put forward by Paterson, Stinson and Wei and giv... |
2006.01818 | Haw-Minn Lu | Haw-minn Lu, Adrian Kwong, Jose Unpingco | Securing Your Collaborative Jupyter Notebooks in the Cloud using
Container and Load Balancing Services | Accepted and submitted to 19th Python in Science Conference. (SciPy
2020) | null | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Jupyter has become the go-to platform for developing data applications but
data and security concerns, especially when dealing with healthcare, have
become paramount for many institutions and applications dealing with sensitive
information. How then can we continue to enjoy the data analysis and machine
learning oppo... | [
{
"created": "Tue, 2 Jun 2020 17:52:32 GMT",
"version": "v1"
}
] | 2020-06-03 | [
[
"Lu",
"Haw-minn",
""
],
[
"Kwong",
"Adrian",
""
],
[
"Unpingco",
"Jose",
""
]
] | Jupyter has become the go-to platform for developing data applications but data and security concerns, especially when dealing with healthcare, have become paramount for many institutions and applications dealing with sensitive information. How then can we continue to enjoy the data analysis and machine learning opport... |
2105.00689 | Michael Kompatscher | Michael Kompatscher | CSAT and CEQV for nilpotent Maltsev algebras of Fitting length > 2 | 23 pages | null | null | null | cs.CC math.RA | http://creativecommons.org/licenses/by/4.0/ | The circuit satisfaction problem CSAT(A) of an algebra A is the problem of
deciding whether an equation over A (encoded by two circuits) has a solution or
not. While solving systems of equations over finite algebras is either in P or
NP-complete, no such dichotomy result is known for CSAT(A). In fact, Idziak,
Kawalek... | [
{
"created": "Mon, 3 May 2021 08:51:57 GMT",
"version": "v1"
},
{
"created": "Sun, 6 Aug 2023 16:41:14 GMT",
"version": "v2"
}
] | 2023-08-08 | [
[
"Kompatscher",
"Michael",
""
]
] | The circuit satisfaction problem CSAT(A) of an algebra A is the problem of deciding whether an equation over A (encoded by two circuits) has a solution or not. While solving systems of equations over finite algebras is either in P or NP-complete, no such dichotomy result is known for CSAT(A). In fact, Idziak, Kawalek a... |
2403.01631 | Zeyuan Hu | Zeyuan Hu and Daniel P. Miranker | TreeTracker Join: Turning the Tide When a Tuple Fails to Join | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many important query processing methods proactively use semijoins or
semijoin-like filters to delete dangling tuples, i.e., tuples that do not
appear in the final query result. Semijoin methods can achieve formal
optimality but have high upfront cost in practice. Filter methods reduce the
cost but lose the optimality... | [
{
"created": "Sun, 3 Mar 2024 22:34:19 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Hu",
"Zeyuan",
""
],
[
"Miranker",
"Daniel P.",
""
]
] | Many important query processing methods proactively use semijoins or semijoin-like filters to delete dangling tuples, i.e., tuples that do not appear in the final query result. Semijoin methods can achieve formal optimality but have high upfront cost in practice. Filter methods reduce the cost but lose the optimality g... |
1603.03898 | Ananthanarayanan Chockalingam | T. Lakshmi Narasimhan and A. Chockalingam | On the Capacity and Performance of Generalized Spatial Modulation | Expanded version of the IEEE Communications Letters paper | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generalized spatial modulation (GSM) uses $N$ antenna elements but fewer
radio frequency (RF) chains ($R$) at the transmitter. Spatial modulation and
spatial multiplexing are special cases of GSM with $R=1$ and $R=N$,
respectively. In GSM, apart from conveying information bits through $R$
modulation symbols, informat... | [
{
"created": "Sat, 12 Mar 2016 12:04:07 GMT",
"version": "v1"
}
] | 2016-03-15 | [
[
"Narasimhan",
"T. Lakshmi",
""
],
[
"Chockalingam",
"A.",
""
]
] | Generalized spatial modulation (GSM) uses $N$ antenna elements but fewer radio frequency (RF) chains ($R$) at the transmitter. Spatial modulation and spatial multiplexing are special cases of GSM with $R=1$ and $R=N$, respectively. In GSM, apart from conveying information bits through $R$ modulation symbols, informatio... |
2005.00635 | Paiheng Xu | Zach Wood-Doughty, Paiheng Xu, Xiao Liu, Mark Dredze | Using Noisy Self-Reports to Predict Twitter User Demographics | The first two authors had an equal contribution. Accepted to
SocialNLP @ NAACL 2021 | null | 10.18653/v1/2021.socialnlp-1.11 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computational social science studies often contextualize content analysis
within standard demographics. Since demographics are unavailable on many social
media platforms (e.g. Twitter) numerous studies have inferred demographics
automatically. Despite many studies presenting proof of concept inference of
race and eth... | [
{
"created": "Fri, 1 May 2020 22:10:35 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Jul 2021 08:02:36 GMT",
"version": "v2"
}
] | 2021-07-13 | [
[
"Wood-Doughty",
"Zach",
""
],
[
"Xu",
"Paiheng",
""
],
[
"Liu",
"Xiao",
""
],
[
"Dredze",
"Mark",
""
]
] | Computational social science studies often contextualize content analysis within standard demographics. Since demographics are unavailable on many social media platforms (e.g. Twitter) numerous studies have inferred demographics automatically. Despite many studies presenting proof of concept inference of race and ethni... |
1503.05273 | Abhisek Ukil | A. Ukil, W. Siti | Feeder Load Balancing using Fuzzy Logic and Combinatorial
Optimization-based Implementation | 11 pages | Electric Power Systems Research, Elsevier, vol. 78, issue 11, pp.
1922-1932, 2008 | 10.1016/j.epsr.2008.03.020 | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The distribution system problems, such as planning, loss minimization, and
energy restoration, usually involve the phase balancing or network
reconfiguration procedures. The determination of an optimal phase balance is,
in general, a combinatorial optimization problem. This paper proposes a novel
reconfiguration of t... | [
{
"created": "Wed, 18 Mar 2015 03:09:30 GMT",
"version": "v1"
}
] | 2015-03-19 | [
[
"Ukil",
"A.",
""
],
[
"Siti",
"W.",
""
]
] | The distribution system problems, such as planning, loss minimization, and energy restoration, usually involve the phase balancing or network reconfiguration procedures. The determination of an optimal phase balance is, in general, a combinatorial optimization problem. This paper proposes a novel reconfiguration of the... |
2002.01541 | Gleb Pogudin | Manfred Buchacher, Manuel Kauers, Gleb Pogudin | Separating Variables in Bivariate Polynomial Ideals | null | null | null | null | cs.SC math.AC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an algorithm which for any given ideal $I\subseteq\mathbb{K}
[x,y]$ finds all elements of $I$ that have the form $f(x) - g(y)$, i.e., all
elements in which no monomial is a multiple of $xy$.
| [
{
"created": "Tue, 4 Feb 2020 21:18:00 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Jun 2020 14:50:38 GMT",
"version": "v2"
}
] | 2020-06-08 | [
[
"Buchacher",
"Manfred",
""
],
[
"Kauers",
"Manuel",
""
],
[
"Pogudin",
"Gleb",
""
]
] | We present an algorithm which for any given ideal $I\subseteq\mathbb{K} [x,y]$ finds all elements of $I$ that have the form $f(x) - g(y)$, i.e., all elements in which no monomial is a multiple of $xy$. |
1107.1943 | Gopalakrishnan Tr Nair | T. R. Gopalakrishnan Nair, Kavitha Sooda, M. B. Yashoda | Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path
Routing Problems using Immigrants and Memory Schemes | 5 pages,6 figures, International Conference on Frontiers of Computer
Science, 7TH TO 9TH August 2011, JN Tata Convention Centre, IISc,Bangalore,
India | null | null | null | cs.NE cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Internet Routing, the static shortest path (SP) problem has been addressed
using well known intelligent optimization techniques like artificial neural
networks, genetic algorithms (GAs) and particle swarm optimization. Advancement
in wireless communication lead more and more mobile wireless networks, such as
mobil... | [
{
"created": "Mon, 11 Jul 2011 06:51:16 GMT",
"version": "v1"
}
] | 2011-07-12 | [
[
"Nair",
"T. R. Gopalakrishnan",
""
],
[
"Sooda",
"Kavitha",
""
],
[
"Yashoda",
"M. B.",
""
]
] | In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile ... |
1607.06349 | Michele Mancini | Michele Mancini, Gabriele Costante, Paolo Valigi and Thomas
A.Ciarfuglia | Fast Robust Monocular Depth Estimation for Obstacle Detection with Fully
Convolutional Networks | Accepted for publication in the Proceedings of the 2016 IEEE/RSJ
International Conference on Intelligent Robots and Systems (IROS 2016) | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Obstacle Detection is a central problem for any robotic system, and critical
for autonomous systems that travel at high speeds in unpredictable environment.
This is often achieved through scene depth estimation, by various means. When
fast motion is considered, the detection range must be longer enough to allow
for s... | [
{
"created": "Thu, 21 Jul 2016 14:49:07 GMT",
"version": "v1"
}
] | 2016-07-22 | [
[
"Mancini",
"Michele",
""
],
[
"Costante",
"Gabriele",
""
],
[
"Valigi",
"Paolo",
""
],
[
"Ciarfuglia",
"Thomas A.",
""
]
] | Obstacle Detection is a central problem for any robotic system, and critical for autonomous systems that travel at high speeds in unpredictable environment. This is often achieved through scene depth estimation, by various means. When fast motion is considered, the detection range must be longer enough to allow for saf... |
1505.03236 | Jensi | R. Jensi and G. Wiselin Jiji | Hybrid data clustering approach using K-Means and Flower Pollination
Algorithm | 11 pages, Journal. Advanced Computational Intelligence: An
International Journal (ACII), Vol.2, No.2, April 2015 | null | null | null | cs.LG cs.IR cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data clustering is a technique for clustering set of objects into known
number of groups. Several approaches are widely applied to data clustering so
that objects within the clusters are similar and objects in different clusters
are far away from each other. K-Means, is one of the familiar center based
clustering alg... | [
{
"created": "Wed, 13 May 2015 04:24:50 GMT",
"version": "v1"
}
] | 2015-05-14 | [
[
"Jensi",
"R.",
""
],
[
"Jiji",
"G. Wiselin",
""
]
] | Data clustering is a technique for clustering set of objects into known number of groups. Several approaches are widely applied to data clustering so that objects within the clusters are similar and objects in different clusters are far away from each other. K-Means, is one of the familiar center based clustering algor... |
2102.04639 | Jie Mei | Jie Mei, Jenq-Neng Hwang, Suzanne Romain, Craig Rose, Braden Moore,
Kelsey Magrane | Absolute 3D Pose Estimation and Length Measurement of Severely Deformed
Fish from Monocular Videos in Longline Fishing | Accepted to ICASSP2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Monocular absolute 3D fish pose estimation allows for efficient fish length
measurement in the longline fisheries, where fishes are under severe
deformation during the catching process. This task is challenging since it
requires locating absolute 3D fish keypoints based on a short monocular video
clip. Unlike related... | [
{
"created": "Tue, 9 Feb 2021 04:15:51 GMT",
"version": "v1"
}
] | 2021-02-10 | [
[
"Mei",
"Jie",
""
],
[
"Hwang",
"Jenq-Neng",
""
],
[
"Romain",
"Suzanne",
""
],
[
"Rose",
"Craig",
""
],
[
"Moore",
"Braden",
""
],
[
"Magrane",
"Kelsey",
""
]
] | Monocular absolute 3D fish pose estimation allows for efficient fish length measurement in the longline fisheries, where fishes are under severe deformation during the catching process. This task is challenging since it requires locating absolute 3D fish keypoints based on a short monocular video clip. Unlike related w... |
2405.02800 | Chungman Lim | Chungman Lim, Gunhyuk Park, and Hasti Seifi | Designing Distinguishable Mid-Air Ultrasound Tactons with Temporal
Parameters | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mid-air ultrasound technology offers new design opportunities for contactless
tactile patterns (i.e., Tactons) in user applications. Yet, few guidelines
exist for making ultrasound Tactons easy to distinguish for users. In this
paper, we investigated the distinguishability of temporal parameters of
ultrasound Tactons... | [
{
"created": "Sun, 5 May 2024 03:10:45 GMT",
"version": "v1"
}
] | 2024-05-07 | [
[
"Lim",
"Chungman",
""
],
[
"Park",
"Gunhyuk",
""
],
[
"Seifi",
"Hasti",
""
]
] | Mid-air ultrasound technology offers new design opportunities for contactless tactile patterns (i.e., Tactons) in user applications. Yet, few guidelines exist for making ultrasound Tactons easy to distinguish for users. In this paper, we investigated the distinguishability of temporal parameters of ultrasound Tactons i... |
1509.09152 | Frederick Benaben | Frederick Benaben, Wenxin Mu, Nicolas Boissel-Dallier, Anne-Marie
Barthe-Delano\"e, Sarah Zribi, Herve Pingaud | Supporting interoperability of collaborative networks through
engineering of a service-based Mediation Information System (MISE 2.0) | \<10.1080/17517575.2014.928949\> | Enterprise Information Systems, Taylor \& Francis: STM,
Behavioural Science and Public Health Titles, 2015, 9 (5-6), pp.556-582 | 10.1080/17517575.2014.928949 | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Mediation Information System Engineering project is currently finishing
its second iteration (MISE 2.0). The main objective of this scientific project
is to provide any emerging collaborative situation with methods and tools to
deploy a Mediation Information System (MIS). MISE 2.0 aims at defining and
designing a... | [
{
"created": "Wed, 30 Sep 2015 12:35:39 GMT",
"version": "v1"
}
] | 2015-10-01 | [
[
"Benaben",
"Frederick",
""
],
[
"Mu",
"Wenxin",
""
],
[
"Boissel-Dallier",
"Nicolas",
""
],
[
"Barthe-Delanoë",
"Anne-Marie",
""
],
[
"Zribi",
"Sarah",
""
],
[
"Pingaud",
"Herve",
""
]
] | The Mediation Information System Engineering project is currently finishing its second iteration (MISE 2.0). The main objective of this scientific project is to provide any emerging collaborative situation with methods and tools to deploy a Mediation Information System (MIS). MISE 2.0 aims at defining and designing a s... |
1705.04108 | Mohammed Al-Imari | Mohammed Al-Imari, Pei Xiao, Muhammad Ali Imran, and Rahim Tafazolli | Uplink Non-Orthogonal Multiple Access for 5G Wireless Networks | Presented in the International Symposium on Wireless Communications
Systems (ISWCS), 2014 | null | 10.1109/ISWCS.2014.6933459 | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Orthogonal Frequency Division Multiple Access (OFDMA) as well as other
orthogonal multiple access techniques fail to achieve the system capacity limit
in the uplink due to the exclusivity in resource allocation. This issue is more
prominent when fairness among the users is considered in the system. Current
Non-Orthog... | [
{
"created": "Thu, 11 May 2017 10:54:41 GMT",
"version": "v1"
}
] | 2017-05-12 | [
[
"Al-Imari",
"Mohammed",
""
],
[
"Xiao",
"Pei",
""
],
[
"Imran",
"Muhammad Ali",
""
],
[
"Tafazolli",
"Rahim",
""
]
] | Orthogonal Frequency Division Multiple Access (OFDMA) as well as other orthogonal multiple access techniques fail to achieve the system capacity limit in the uplink due to the exclusivity in resource allocation. This issue is more prominent when fairness among the users is considered in the system. Current Non-Orthogon... |
1801.00184 | Raeid Saqur | Raeid Saqur | H4-Writer: A Text Entry Method Designed For Gaze Controlled Environment
with Low KSPC and Spatial Footprint | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new text entry technique, namely H4-Writer, designed
for gaze controlled environments and aimed at reducing average KSPC . and
spatial footprint. It also presents an empirical evaluation of this proposed
system by using three different input devices: mouse, gamepad, and eye tracker.
The experime... | [
{
"created": "Sat, 30 Dec 2017 19:43:04 GMT",
"version": "v1"
}
] | 2018-01-03 | [
[
"Saqur",
"Raeid",
""
]
] | This paper presents a new text entry technique, namely H4-Writer, designed for gaze controlled environments and aimed at reducing average KSPC . and spatial footprint. It also presents an empirical evaluation of this proposed system by using three different input devices: mouse, gamepad, and eye tracker. The experiment... |
2112.04095 | Feng Zhou | Jackie Ayoub, Lilit Avetisyan, Mustapha Makki, Feng Zhou | An Investigation of Drivers' Dynamic Situational Trust in Conditionally
Automated Driving | null | null | null | null | cs.HC cs.RO | http://creativecommons.org/licenses/by/4.0/ | Understanding how trust is built over time is essential, as trust plays an
important role in the acceptance and adoption of automated vehicles (AVs). This
study aimed to investigate the effects of system performance and participants'
trust preconditions on dynamic situational trust during takeover transitions.
We eva... | [
{
"created": "Wed, 8 Dec 2021 03:47:20 GMT",
"version": "v1"
}
] | 2021-12-09 | [
[
"Ayoub",
"Jackie",
""
],
[
"Avetisyan",
"Lilit",
""
],
[
"Makki",
"Mustapha",
""
],
[
"Zhou",
"Feng",
""
]
] | Understanding how trust is built over time is essential, as trust plays an important role in the acceptance and adoption of automated vehicles (AVs). This study aimed to investigate the effects of system performance and participants' trust preconditions on dynamic situational trust during takeover transitions. We evalu... |
1203.1647 | Sheng Yu | Sheng Yu and Subhash Kak | A Survey of Prediction Using Social Media | 20 pages | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social media comprises interactive applications and platforms for creating,
sharing and exchange of user-generated contents. The past ten years have
brought huge growth in social media, especially online social networking
services, and it is changing our ways to organize and communicate. It
aggregates opinions and fe... | [
{
"created": "Wed, 7 Mar 2012 22:14:00 GMT",
"version": "v1"
}
] | 2012-03-09 | [
[
"Yu",
"Sheng",
""
],
[
"Kak",
"Subhash",
""
]
] | Social media comprises interactive applications and platforms for creating, sharing and exchange of user-generated contents. The past ten years have brought huge growth in social media, especially online social networking services, and it is changing our ways to organize and communicate. It aggregates opinions and feel... |
2402.05643 | Lior Cohen | Lior Cohen, Kaixin Wang, Bingyi Kang, Shie Mannor | Improving Token-Based World Models with Parallel Observation Prediction | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Motivated by the success of Transformers when applied to sequences of
discrete symbols, token-based world models (TBWMs) were recently proposed as
sample-efficient methods. In TBWMs, the world model consumes agent experience
as a language-like sequence of tokens, where each observation constitutes a
sub-sequence. How... | [
{
"created": "Thu, 8 Feb 2024 12:58:07 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Feb 2024 15:38:11 GMT",
"version": "v2"
},
{
"created": "Mon, 27 May 2024 12:18:18 GMT",
"version": "v3"
},
{
"created": "Tue, 28 May 2024 08:10:37 GMT",
"version": "v4"
},
{
"cr... | 2024-05-30 | [
[
"Cohen",
"Lior",
""
],
[
"Wang",
"Kaixin",
""
],
[
"Kang",
"Bingyi",
""
],
[
"Mannor",
"Shie",
""
]
] | Motivated by the success of Transformers when applied to sequences of discrete symbols, token-based world models (TBWMs) were recently proposed as sample-efficient methods. In TBWMs, the world model consumes agent experience as a language-like sequence of tokens, where each observation constitutes a sub-sequence. Howev... |
2109.05343 | Yige Hong | Yige Hong, Weina Wang | Sharp Waiting-Time Bounds for Multiserver Jobs | 48 pages, 3 figures | null | null | null | cs.PF math.PR | http://creativecommons.org/licenses/by/4.0/ | Multiserver jobs, which are jobs that occupy multiple servers simultaneously
during service, are prevalent in today's computing clusters. But little is
known about the delay performance of systems with multiserver jobs. We consider
queueing models for multiserver jobs in scaling regimes where the system load
becomes ... | [
{
"created": "Sat, 11 Sep 2021 18:59:44 GMT",
"version": "v1"
},
{
"created": "Sun, 27 Mar 2022 03:35:56 GMT",
"version": "v2"
},
{
"created": "Thu, 13 Apr 2023 20:13:32 GMT",
"version": "v3"
}
] | 2023-04-17 | [
[
"Hong",
"Yige",
""
],
[
"Wang",
"Weina",
""
]
] | Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service, are prevalent in today's computing clusters. But little is known about the delay performance of systems with multiserver jobs. We consider queueing models for multiserver jobs in scaling regimes where the system load becomes he... |
1501.02282 | Miquel Moret\'o Dr | David Prat, Cristobal Ortega, Marc Casas, Miquel Moret\'o, Mateo
Valero | Adaptive and application dependent runtime guided hardware prefetcher
reconfiguration on the IBM POWER7 | Part of ADAPT Workshop proceedings, 2015 (arXiv:1412.2347) | null | null | ADAPT/2015/07 | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hardware data prefetcher engines have been extensively used to reduce the
impact of memory latency. However, microprocessors' hardware prefetcher engines
do not include any automatic hardware control able to dynamically tune their
operation. This lacking architectural feature causes systems to operate with
prefetcher... | [
{
"created": "Fri, 9 Jan 2015 22:05:22 GMT",
"version": "v1"
}
] | 2015-01-13 | [
[
"Prat",
"David",
""
],
[
"Ortega",
"Cristobal",
""
],
[
"Casas",
"Marc",
""
],
[
"Moretó",
"Miquel",
""
],
[
"Valero",
"Mateo",
""
]
] | Hardware data prefetcher engines have been extensively used to reduce the impact of memory latency. However, microprocessors' hardware prefetcher engines do not include any automatic hardware control able to dynamically tune their operation. This lacking architectural feature causes systems to operate with prefetchers ... |
2305.04380 | Ezgi Ozyilkan | Ezgi Ozyilkan, Johannes Ball\'e, Elza Erkip | Learned Wyner-Ziv Compressors Recover Binning | to be appearing in ISIT 2023 | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider lossy compression of an information source when the decoder has
lossless access to a correlated one. This setup, also known as the Wyner-Ziv
problem, is a special case of distributed source coding. To this day,
real-world applications of this problem have neither been fully developed nor
heavily investiga... | [
{
"created": "Sun, 7 May 2023 21:41:25 GMT",
"version": "v1"
}
] | 2023-05-09 | [
[
"Ozyilkan",
"Ezgi",
""
],
[
"Ballé",
"Johannes",
""
],
[
"Erkip",
"Elza",
""
]
] | We consider lossy compression of an information source when the decoder has lossless access to a correlated one. This setup, also known as the Wyner-Ziv problem, is a special case of distributed source coding. To this day, real-world applications of this problem have neither been fully developed nor heavily investigate... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.