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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2007.02325 | Shuiqiao Yang | Jianlong Zhou, Hamad Zogan, Shuiqiao Yang, Shoaib Jameel, Guandong Xu,
Fang Chen | Detecting Community Depression Dynamics Due to COVID-19 Pandemic in
Australia | null | null | null | null | cs.SI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recent COVID-19 pandemic has caused unprecedented impact across the
globe. We have also witnessed millions of people with increased mental health
issues, such as depression, stress, worry, fear, disgust, sadness, and anxiety,
which have become one of the major public health concerns during this severe
health cris... | [
{
"created": "Sun, 5 Jul 2020 12:55:34 GMT",
"version": "v1"
}
] | 2020-07-07 | [
[
"Zhou",
"Jianlong",
""
],
[
"Zogan",
"Hamad",
""
],
[
"Yang",
"Shuiqiao",
""
],
[
"Jameel",
"Shoaib",
""
],
[
"Xu",
"Guandong",
""
],
[
"Chen",
"Fang",
""
]
] | The recent COVID-19 pandemic has caused unprecedented impact across the globe. We have also witnessed millions of people with increased mental health issues, such as depression, stress, worry, fear, disgust, sadness, and anxiety, which have become one of the major public health concerns during this severe health crisis... |
2407.03511 | Oleksandr Kuznetsov | Oleksandr Kuznetsov, Anton Yezhov, Vladyslav Yusiuk, and Kateryna
Kuznetsova | Scalable Zero-Knowledge Proofs for Verifying Cryptographic Hashing in
Blockchain Applications | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Zero-knowledge proofs (ZKPs) have emerged as a promising solution to address
the scalability challenges in modern blockchain systems. This study proposes a
methodology for generating and verifying ZKPs to ensure the computational
integrity of cryptographic hashing, specifically focusing on the SHA-256
algorithm. By l... | [
{
"created": "Wed, 3 Jul 2024 21:19:01 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Kuznetsov",
"Oleksandr",
""
],
[
"Yezhov",
"Anton",
""
],
[
"Yusiuk",
"Vladyslav",
""
],
[
"Kuznetsova",
"Kateryna",
""
]
] | Zero-knowledge proofs (ZKPs) have emerged as a promising solution to address the scalability challenges in modern blockchain systems. This study proposes a methodology for generating and verifying ZKPs to ensure the computational integrity of cryptographic hashing, specifically focusing on the SHA-256 algorithm. By lev... |
2305.04050 | Bar Karov | Bar Karov and Moni Naor | New Algorithms and Applications for Risk-Limiting Audits | A shorter version of this paper appears in the Proceeding of the 4th
Annual Symposium on Foundations of Responsible Computing, FORC 2023 | null | null | null | cs.CY cs.CR | http://creativecommons.org/licenses/by/4.0/ | Risk-limiting audits (RLAs) are a significant tool in increasing confidence
in the accuracy of elections. They consist of randomized algorithms which check
that an election's vote tally, as reported by a vote tabulation system,
corresponds to the correct candidates winning. If an initial vote count leads
to the wrong... | [
{
"created": "Sat, 6 May 2023 13:34:39 GMT",
"version": "v1"
}
] | 2023-05-09 | [
[
"Karov",
"Bar",
""
],
[
"Naor",
"Moni",
""
]
] | Risk-limiting audits (RLAs) are a significant tool in increasing confidence in the accuracy of elections. They consist of randomized algorithms which check that an election's vote tally, as reported by a vote tabulation system, corresponds to the correct candidates winning. If an initial vote count leads to the wrong e... |
2308.00538 | Lala Shakti Swarup Ray | Lala Shakti Swarup Ray, Vitor Fortes Rey, Bo Zhou, Sungho Suh, Paul
Lukowicz | PressureTransferNet: Human Attribute Guided Dynamic Ground Pressure
Profile Transfer using 3D simulated Pressure Maps | Activity and Behavior Computing 2023 | null | null | null | cs.CV cs.AI cs.GR eess.IV | http://creativecommons.org/licenses/by/4.0/ | We propose PressureTransferNet, a novel method for Human Activity Recognition
(HAR) using ground pressure information. Our approach generates body-specific
dynamic ground pressure profiles for specific activities by leveraging existing
pressure data from different individuals. PressureTransferNet is an
encoder-decode... | [
{
"created": "Tue, 1 Aug 2023 13:31:25 GMT",
"version": "v1"
}
] | 2023-08-02 | [
[
"Ray",
"Lala Shakti Swarup",
""
],
[
"Rey",
"Vitor Fortes",
""
],
[
"Zhou",
"Bo",
""
],
[
"Suh",
"Sungho",
""
],
[
"Lukowicz",
"Paul",
""
]
] | We propose PressureTransferNet, a novel method for Human Activity Recognition (HAR) using ground pressure information. Our approach generates body-specific dynamic ground pressure profiles for specific activities by leveraging existing pressure data from different individuals. PressureTransferNet is an encoder-decoder ... |
2401.03428 | Yuheng Cheng | Yuheng Cheng, Ceyao Zhang, Zhengwen Zhang, Xiangrui Meng, Sirui Hong,
Wenhao Li, Zihao Wang, Zekai Wang, Feng Yin, Junhua Zhao, Xiuqiang He | Exploring Large Language Model based Intelligent Agents: Definitions,
Methods, and Prospects | null | null | null | null | cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intelligent agents stand out as a potential path toward artificial general
intelligence (AGI). Thus, researchers have dedicated significant effort to
diverse implementations for them. Benefiting from recent progress in large
language models (LLMs), LLM-based agents that use universal natural language as
an interface ... | [
{
"created": "Sun, 7 Jan 2024 09:08:24 GMT",
"version": "v1"
}
] | 2024-01-09 | [
[
"Cheng",
"Yuheng",
""
],
[
"Zhang",
"Ceyao",
""
],
[
"Zhang",
"Zhengwen",
""
],
[
"Meng",
"Xiangrui",
""
],
[
"Hong",
"Sirui",
""
],
[
"Li",
"Wenhao",
""
],
[
"Wang",
"Zihao",
""
],
[
"Wang",
"Z... | Intelligent agents stand out as a potential path toward artificial general intelligence (AGI). Thus, researchers have dedicated significant effort to diverse implementations for them. Benefiting from recent progress in large language models (LLMs), LLM-based agents that use universal natural language as an interface ex... |
2401.04692 | Nils Rodrigues | Nils Rodrigues, Frederik L. Dennig, Vincent Brandt, Daniel A. Keim,
Daniel Weiskopf | Comparative Evaluation of Animated Scatter Plot Transitions | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scatter plots are popular for displaying 2D data, but in practice, many data
sets have more than two dimensions. For the analysis of such multivariate data,
it is often necessary to switch between scatter plots of different dimension
pairs, e.g., in a scatter plot matrix (SPLOM). Alternative approaches include a
"gra... | [
{
"created": "Tue, 9 Jan 2024 17:39:45 GMT",
"version": "v1"
}
] | 2024-01-10 | [
[
"Rodrigues",
"Nils",
""
],
[
"Dennig",
"Frederik L.",
""
],
[
"Brandt",
"Vincent",
""
],
[
"Keim",
"Daniel A.",
""
],
[
"Weiskopf",
"Daniel",
""
]
] | Scatter plots are popular for displaying 2D data, but in practice, many data sets have more than two dimensions. For the analysis of such multivariate data, it is often necessary to switch between scatter plots of different dimension pairs, e.g., in a scatter plot matrix (SPLOM). Alternative approaches include a "grand... |
cs/0309038 | Valmir Barbosa | V. C. Barbosa, L. C. D. Campos | A novel evolutionary formulation of the maximum independent set problem | null | Journal of Combinatorial Optimization 8 (2004), 419-437 | 10.1007/s10878-004-4835-9 | ES-615/03 | cs.NE | null | We introduce a novel evolutionary formulation of the problem of finding a
maximum independent set of a graph. The new formulation is based on the
relationship that exists between a graph's independence number and its acyclic
orientations. It views such orientations as individuals and evolves them with
the aid of evol... | [
{
"created": "Mon, 22 Sep 2003 13:05:51 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Barbosa",
"V. C.",
""
],
[
"Campos",
"L. C. D.",
""
]
] | We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolut... |
2309.11202 | Uduak Uboh | Uduak Uboh | Using Artificial Intelligence for the Automation of Knitting Patterns | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Knitting patterns are a crucial component in the creation and design of
knitted materials. Traditionally, these patterns were taught informally, but
thanks to advancements in technology, anyone interested in knitting can use the
patterns as a guide to start knitting. Perhaps because knitting is mostly a
hobby, with t... | [
{
"created": "Wed, 20 Sep 2023 10:38:08 GMT",
"version": "v1"
}
] | 2023-09-21 | [
[
"Uboh",
"Uduak",
""
]
] | Knitting patterns are a crucial component in the creation and design of knitted materials. Traditionally, these patterns were taught informally, but thanks to advancements in technology, anyone interested in knitting can use the patterns as a guide to start knitting. Perhaps because knitting is mostly a hobby, with the... |
2303.01070 | Xiaoyang Yu | Xiaoyang Yu, Youfang Lin, Xiangsen Wang, Sheng Han, Kai Lv | GHQ: Grouped Hybrid Q Learning for Heterogeneous Cooperative Multi-agent
Reinforcement Learning | null | null | 10.1007/s40747-024-01415-1 | null | cs.MA cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Previous deep multi-agent reinforcement learning (MARL) algorithms have
achieved impressive results, typically in homogeneous scenarios. However,
heterogeneous scenarios are also very common and usually harder to solve. In
this paper, we mainly discuss cooperative heterogeneous MARL problems in
Starcraft Multi-Agent ... | [
{
"created": "Thu, 2 Mar 2023 08:45:49 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Aug 2024 09:05:09 GMT",
"version": "v2"
}
] | 2024-08-15 | [
[
"Yu",
"Xiaoyang",
""
],
[
"Lin",
"Youfang",
""
],
[
"Wang",
"Xiangsen",
""
],
[
"Han",
"Sheng",
""
],
[
"Lv",
"Kai",
""
]
] | Previous deep multi-agent reinforcement learning (MARL) algorithms have achieved impressive results, typically in homogeneous scenarios. However, heterogeneous scenarios are also very common and usually harder to solve. In this paper, we mainly discuss cooperative heterogeneous MARL problems in Starcraft Multi-Agent Ch... |
1903.01888 | Luana Ruiz | Luana Ruiz, Fernando Gama and Alejandro Ribeiro | Gated Graph Convolutional Recurrent Neural Networks | Accepted at EUSIPCO 2019 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph processes model a number of important problems such as identifying the
epicenter of an earthquake or predicting weather. In this paper, we propose a
Graph Convolutional Recurrent Neural Network (GCRNN) architecture specifically
tailored to deal with these problems. GCRNNs use convolutional filter banks to
keep ... | [
{
"created": "Tue, 5 Mar 2019 15:13:02 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Jun 2019 14:15:19 GMT",
"version": "v2"
},
{
"created": "Thu, 27 Jun 2019 14:55:04 GMT",
"version": "v3"
}
] | 2019-06-28 | [
[
"Ruiz",
"Luana",
""
],
[
"Gama",
"Fernando",
""
],
[
"Ribeiro",
"Alejandro",
""
]
] | Graph processes model a number of important problems such as identifying the epicenter of an earthquake or predicting weather. In this paper, we propose a Graph Convolutional Recurrent Neural Network (GCRNN) architecture specifically tailored to deal with these problems. GCRNNs use convolutional filter banks to keep th... |
2211.05590 | Pierre-Alain Mo\"ellic | Raphael Joud, Pierre-Alain Moellic, Simon Pontie, Jean-Baptiste Rigaud | A Practical Introduction to Side-Channel Extraction of Deep Neural
Network Parameters | Accepted at Smart Card Research and Advanced Application Conference
(CARDIS 2022) | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Model extraction is a major threat for embedded deep neural network models
that leverages an extended attack surface. Indeed, by physically accessing a
device, an adversary may exploit side-channel leakages to extract critical
information of a model (i.e., its architecture or internal parameters).
Different adversari... | [
{
"created": "Thu, 10 Nov 2022 14:02:39 GMT",
"version": "v1"
}
] | 2022-11-11 | [
[
"Joud",
"Raphael",
""
],
[
"Moellic",
"Pierre-Alain",
""
],
[
"Pontie",
"Simon",
""
],
[
"Rigaud",
"Jean-Baptiste",
""
]
] | Model extraction is a major threat for embedded deep neural network models that leverages an extended attack surface. Indeed, by physically accessing a device, an adversary may exploit side-channel leakages to extract critical information of a model (i.e., its architecture or internal parameters). Different adversarial... |
1110.6384 | Serge Gaspers | Serge Gaspers and Stefan Szeider | Backdoors to Acyclic SAT | null | null | null | null | cs.DS cs.AI cs.CC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Backdoor sets, a notion introduced by Williams et al. in 2003, are certain
sets of key variables of a CNF formula F that make it easy to solve the
formula; by assigning truth values to the variables in a backdoor set, the
formula gets reduced to one or several polynomial-time solvable formulas. More
specifically, a w... | [
{
"created": "Fri, 28 Oct 2011 16:10:32 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Oct 2011 15:09:42 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Feb 2012 17:15:41 GMT",
"version": "v3"
}
] | 2012-02-22 | [
[
"Gaspers",
"Serge",
""
],
[
"Szeider",
"Stefan",
""
]
] | Backdoor sets, a notion introduced by Williams et al. in 2003, are certain sets of key variables of a CNF formula F that make it easy to solve the formula; by assigning truth values to the variables in a backdoor set, the formula gets reduced to one or several polynomial-time solvable formulas. More specifically, a wea... |
2406.09815 | Zhenrui Yue | Zhenrui Yue, Huimin Zeng, Lanyu Shang, Yifan Liu, Yang Zhang, Dong
Wang | Retrieval Augmented Fact Verification by Synthesizing Contrastive
Arguments | Accepted to ACL 2024 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid propagation of misinformation poses substantial risks to public
interest. To combat misinformation, large language models (LLMs) are adapted to
automatically verify claim credibility. Nevertheless, existing methods heavily
rely on the embedded knowledge within LLMs and / or black-box APIs for evidence
colle... | [
{
"created": "Fri, 14 Jun 2024 08:13:34 GMT",
"version": "v1"
}
] | 2024-06-17 | [
[
"Yue",
"Zhenrui",
""
],
[
"Zeng",
"Huimin",
""
],
[
"Shang",
"Lanyu",
""
],
[
"Liu",
"Yifan",
""
],
[
"Zhang",
"Yang",
""
],
[
"Wang",
"Dong",
""
]
] | The rapid propagation of misinformation poses substantial risks to public interest. To combat misinformation, large language models (LLMs) are adapted to automatically verify claim credibility. Nevertheless, existing methods heavily rely on the embedded knowledge within LLMs and / or black-box APIs for evidence collect... |
1911.11494 | Christopher Thraves Caro | Rosa Becerra and Christopher Thraves Caro | The Sitting Closer to Friends than Enemies Problem in Trees | 10 pages, 5 figures | null | null | null | cs.DM cs.CG math.CO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | A metric space $\mathcal{T}$ is a \emph{real tree} if for any pair of points
$x, y \in \mathcal{T}$ all topological embeddings $\sigma$ of the segment
$[0,1]$ into $\mathcal{T}$, such that $\sigma (0)=x$ and $\sigma (1)=y$, have
the same image (which is then a geodesic segment from $x$ to $y$). A
\emph{signed graph} ... | [
{
"created": "Tue, 26 Nov 2019 12:31:50 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Feb 2021 14:38:17 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Jul 2021 15:01:24 GMT",
"version": "v3"
}
] | 2021-07-06 | [
[
"Becerra",
"Rosa",
""
],
[
"Caro",
"Christopher Thraves",
""
]
] | A metric space $\mathcal{T}$ is a \emph{real tree} if for any pair of points $x, y \in \mathcal{T}$ all topological embeddings $\sigma$ of the segment $[0,1]$ into $\mathcal{T}$, such that $\sigma (0)=x$ and $\sigma (1)=y$, have the same image (which is then a geodesic segment from $x$ to $y$). A \emph{signed graph} is... |
1404.7335 | Florent Jacquemard | Florent Jacquemard (Inria Paris-Rocquencourt, STMS), Cl\'ement
Poncelet Sanchez (Inria Paris-Rocquencourt, STMS) | Antescofo Intermediate Representation | RR-8520 (2014) | null | null | null | cs.MM cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe an intermediate language designed as a medium-level internal
representation of programs of the interactive music system Antescofo. This
representation is independent both of the Antescofo source language and of the
architecture of the execution platform. It is used in tasks such as
verification of timings... | [
{
"created": "Tue, 29 Apr 2014 12:30:36 GMT",
"version": "v1"
}
] | 2014-04-30 | [
[
"Jacquemard",
"Florent",
"",
"Inria Paris-Rocquencourt, STMS"
],
[
"Sanchez",
"Clément Poncelet",
"",
"Inria Paris-Rocquencourt, STMS"
]
] | We describe an intermediate language designed as a medium-level internal representation of programs of the interactive music system Antescofo. This representation is independent both of the Antescofo source language and of the architecture of the execution platform. It is used in tasks such as verification of timings, ... |
2010.13903 | Denghui Zhang | Denghui Zhang, Yanchi Liu, Wei Cheng, Bo Zong, Jingchao Ni, Zhengzhang
Chen, Haifeng Chen, Hui Xiong | T$^2$-Net: A Semi-supervised Deep Model for Turbulence Forecasting | Accepted by ICDM 2020 | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Accurate air turbulence forecasting can help airlines avoid hazardous
turbulence, guide the routes that keep passengers safe, maximize efficiency,
and reduce costs. Traditional turbulence forecasting approaches heavily rely on
painstakingly customized turbulence indexes, which are less effective in
dynamic and comple... | [
{
"created": "Mon, 26 Oct 2020 21:14:15 GMT",
"version": "v1"
}
] | 2020-10-28 | [
[
"Zhang",
"Denghui",
""
],
[
"Liu",
"Yanchi",
""
],
[
"Cheng",
"Wei",
""
],
[
"Zong",
"Bo",
""
],
[
"Ni",
"Jingchao",
""
],
[
"Chen",
"Zhengzhang",
""
],
[
"Chen",
"Haifeng",
""
],
[
"Xiong",
"Hu... | Accurate air turbulence forecasting can help airlines avoid hazardous turbulence, guide the routes that keep passengers safe, maximize efficiency, and reduce costs. Traditional turbulence forecasting approaches heavily rely on painstakingly customized turbulence indexes, which are less effective in dynamic and complex ... |
1810.07273 | R.Stuart Geiger | R. Stuart Geiger, Aaron Halfaker | Operationalizing Conflict and Cooperation between Automated Software
Agents in Wikipedia: A Replication and Expansion of 'Even Good Bots Fight' | 33 pages. In ACM CSCW 2018 | Proc ACM on Human Computer Interaction. 1(2), Article 49. CSCW
2018 | 10.1145/3134684 | null | cs.CY cs.HC cs.SI | http://creativecommons.org/licenses/by/4.0/ | This paper replicates, extends, and refutes conclusions made in a study
published in PLoS ONE ("Even Good Bots Fight"), which claimed to identify
substantial levels of conflict between automated software agents (or bots) in
Wikipedia using purely quantitative methods. By applying an integrative
mixed-methods approach... | [
{
"created": "Tue, 16 Oct 2018 20:59:19 GMT",
"version": "v1"
}
] | 2018-10-18 | [
[
"Geiger",
"R. Stuart",
""
],
[
"Halfaker",
"Aaron",
""
]
] | This paper replicates, extends, and refutes conclusions made in a study published in PLoS ONE ("Even Good Bots Fight"), which claimed to identify substantial levels of conflict between automated software agents (or bots) in Wikipedia using purely quantitative methods. By applying an integrative mixed-methods approach d... |
2203.10470 | Yuanming Ren | Yuanming Ren, Shihao Shen, Yanli Ju, Xiaofei Wang, Wenyu Wang, Victor
C.M. Leung | EdgeMatrix: A Resources Redefined Edge-Cloud System for Prioritized
Services | null | null | null | null | cs.NI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The edge-cloud system has the potential to combine the advantages of
heterogeneous devices and truly realize ubiquitous computing. However, for
service providers to guarantee the Service-Level-Agreement (SLA) priorities,
the complex networked environment brings inherent challenges such as
multi-resource heterogeneity... | [
{
"created": "Sun, 20 Mar 2022 06:47:34 GMT",
"version": "v1"
}
] | 2022-03-22 | [
[
"Ren",
"Yuanming",
""
],
[
"Shen",
"Shihao",
""
],
[
"Ju",
"Yanli",
""
],
[
"Wang",
"Xiaofei",
""
],
[
"Wang",
"Wenyu",
""
],
[
"Leung",
"Victor C. M.",
""
]
] | The edge-cloud system has the potential to combine the advantages of heterogeneous devices and truly realize ubiquitous computing. However, for service providers to guarantee the Service-Level-Agreement (SLA) priorities, the complex networked environment brings inherent challenges such as multi-resource heterogeneity, ... |
2210.02576 | Yongbin Liu | Liu Yongbin, Liu Qingjie, Chen Jiaxin, Wang Yunhong | Reading Chinese in Natural Scenes with a Bag-of-Radicals Prior | Accepted by BMVC 2022 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scene text recognition (STR) on Latin datasets has been extensively studied
in recent years, and state-of-the-art (SOTA) models often reach high accuracy.
However, the performance on non-Latin transcripts, such as Chinese, is not
satisfactory. In this paper, we collect six open-source Chinese STR datasets
and evaluat... | [
{
"created": "Wed, 5 Oct 2022 21:56:09 GMT",
"version": "v1"
}
] | 2022-10-07 | [
[
"Yongbin",
"Liu",
""
],
[
"Qingjie",
"Liu",
""
],
[
"Jiaxin",
"Chen",
""
],
[
"Yunhong",
"Wang",
""
]
] | Scene text recognition (STR) on Latin datasets has been extensively studied in recent years, and state-of-the-art (SOTA) models often reach high accuracy. However, the performance on non-Latin transcripts, such as Chinese, is not satisfactory. In this paper, we collect six open-source Chinese STR datasets and evaluate ... |
2302.02048 | Junyuan Gao | Junyuan Gao, Yongpeng Wu, Tianya Li, and Wenjun Zhang | Energy Efficiency of MIMO Massive Unsourced Random Access with Finite
Blocklength | Accepted by IEEE Wireless Communications Letters | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | This paper investigates the energy efficiency of massive unsourced random
access~(URA) in multiple-input multiple-output quasi-static Rayleigh fading
channels. Specifically, we derive achievability and converse bounds on the
minimum required energy-per-bit under the per-user probability of error
constraint, where the... | [
{
"created": "Sat, 4 Feb 2023 01:11:18 GMT",
"version": "v1"
}
] | 2023-02-07 | [
[
"Gao",
"Junyuan",
""
],
[
"Wu",
"Yongpeng",
""
],
[
"Li",
"Tianya",
""
],
[
"Zhang",
"Wenjun",
""
]
] | This paper investigates the energy efficiency of massive unsourced random access~(URA) in multiple-input multiple-output quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum required energy-per-bit under the per-user probability of error constraint, where the c... |
2007.07155 | Mohammad Shojaeshafiei | Mohammad Shojaeshafiei, Letha Etzkorn, and Michael Anderson | multiple layers of fuzzy logic to quantify vulnerabilies in iot | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantifying vulnerabilities of network systems has been a highly
controversial issue in the fields of network security and IoT. Much research
has been conducted on this purpose; however, these have many ambiguities and
uncertainties. In this paper, we investigate the quantification of
vulnerability in the Department ... | [
{
"created": "Tue, 14 Jul 2020 16:14:51 GMT",
"version": "v1"
}
] | 2020-07-15 | [
[
"Shojaeshafiei",
"Mohammad",
""
],
[
"Etzkorn",
"Letha",
""
],
[
"Anderson",
"Michael",
""
]
] | Quantifying vulnerabilities of network systems has been a highly controversial issue in the fields of network security and IoT. Much research has been conducted on this purpose; however, these have many ambiguities and uncertainties. In this paper, we investigate the quantification of vulnerability in the Department of... |
2307.13661 | Henry DeYoung | Henry DeYoung and Andreia Mordido and Frank Pfenning and Ankush Das | Parametric Subtyping for Structural Parametric Polymorphism | 36 pages | null | null | null | cs.PL cs.LO | http://creativecommons.org/licenses/by/4.0/ | We study the interaction of structural subtyping with parametric polymorphism
and recursively defined type constructors. Although structural subtyping is
undecidable in this setting, we describe a notion of parametricity for type
constructors and then exploit it to define parametric subtyping, a conceptually
simple, ... | [
{
"created": "Tue, 25 Jul 2023 17:14:49 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Oct 2023 15:55:47 GMT",
"version": "v2"
}
] | 2023-10-30 | [
[
"DeYoung",
"Henry",
""
],
[
"Mordido",
"Andreia",
""
],
[
"Pfenning",
"Frank",
""
],
[
"Das",
"Ankush",
""
]
] | We study the interaction of structural subtyping with parametric polymorphism and recursively defined type constructors. Although structural subtyping is undecidable in this setting, we describe a notion of parametricity for type constructors and then exploit it to define parametric subtyping, a conceptually simple, de... |
1310.1362 | J. M. Landsberg | Fulvio Gesmundo, Jonathan Hauenstein, Christian Ikenmeyer, and JM
Landsberg | Complexity of linear circuits and geometry | 29 pages, final version to appear in FOCM | null | null | null | cs.CC math.AG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We use algebraic geometry to study matrix rigidity, and more generally, the
complexity of computing a matrix-vector product, continuing a study initiated
by Kumar, et. al. We (i) exhibit many non-obvious equations testing for
(border) rigidity, (ii) compute degrees of varieties associated to rigidity,
(iii) describe ... | [
{
"created": "Fri, 4 Oct 2013 18:34:45 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Mar 2015 19:36:21 GMT",
"version": "v2"
}
] | 2015-03-11 | [
[
"Gesmundo",
"Fulvio",
""
],
[
"Hauenstein",
"Jonathan",
""
],
[
"Ikenmeyer",
"Christian",
""
],
[
"Landsberg",
"JM",
""
]
] | We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border) rigidity, (ii) compute degrees of varieties associated to rigidity, (iii) describe al... |
2305.17179 | Tomasz Limisiewicz | Tomasz Limisiewicz and Ji\v{r}\'i Balhar and David Mare\v{c}ek | Tokenization Impacts Multilingual Language Modeling: Assessing
Vocabulary Allocation and Overlap Across Languages | in ACL Findings 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Multilingual language models have recently gained attention as a promising
solution for representing multiple languages in a single model. In this paper,
we propose new criteria to evaluate the quality of lexical representation and
vocabulary overlap observed in sub-word tokenizers. Our findings show that the
overlap... | [
{
"created": "Fri, 26 May 2023 18:06:49 GMT",
"version": "v1"
}
] | 2023-05-30 | [
[
"Limisiewicz",
"Tomasz",
""
],
[
"Balhar",
"Jiří",
""
],
[
"Mareček",
"David",
""
]
] | Multilingual language models have recently gained attention as a promising solution for representing multiple languages in a single model. In this paper, we propose new criteria to evaluate the quality of lexical representation and vocabulary overlap observed in sub-word tokenizers. Our findings show that the overlap o... |
2108.00382 | Matthew Andres Moreno | Matthew Andres Moreno, Santiago Rodriguez Papa, Alexander Lalejini,
Charles Ofria | SignalGP-Lite: Event Driven Genetic Programming Library for Large-Scale
Artificial Life Applications | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event-driven genetic programming representations have been shown to
outperform traditional imperative representations on interaction-intensive
problems. The event-driven approach organizes genome content into modules that
are triggered in response to environmental signals, simplifying simulation
design and implementa... | [
{
"created": "Sun, 1 Aug 2021 07:20:49 GMT",
"version": "v1"
}
] | 2021-08-03 | [
[
"Moreno",
"Matthew Andres",
""
],
[
"Papa",
"Santiago Rodriguez",
""
],
[
"Lalejini",
"Alexander",
""
],
[
"Ofria",
"Charles",
""
]
] | Event-driven genetic programming representations have been shown to outperform traditional imperative representations on interaction-intensive problems. The event-driven approach organizes genome content into modules that are triggered in response to environmental signals, simplifying simulation design and implementati... |
1706.09667 | Maxinder S. Kanwal | Maxinder S. Kanwal, Joshua A. Grochow, Nihat Ay | Comparing Information-Theoretic Measures of Complexity in Boltzmann
Machines | 16 pages, 7 figures; Appears in Entropy, Special Issue "Information
Geometry II" | Entropy (2017), 19(7), 310 | 10.3390/e19070310 | null | cs.IT cs.NE math.IT q-bio.NC | http://creativecommons.org/licenses/by/4.0/ | In the past three decades, many theoretical measures of complexity have been
proposed to help understand complex systems. In this work, for the first time,
we place these measures on a level playing field, to explore the qualitative
similarities and differences between them, and their shortcomings.
Specifically, usin... | [
{
"created": "Thu, 29 Jun 2017 10:39:15 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Jul 2017 01:01:49 GMT",
"version": "v2"
}
] | 2017-08-01 | [
[
"Kanwal",
"Maxinder S.",
""
],
[
"Grochow",
"Joshua A.",
""
],
[
"Ay",
"Nihat",
""
]
] | In the past three decades, many theoretical measures of complexity have been proposed to help understand complex systems. In this work, for the first time, we place these measures on a level playing field, to explore the qualitative similarities and differences between them, and their shortcomings. Specifically, using ... |
1508.04228 | Hyeji Kim | Hyeji Kim and Benjamin Nachman and Abbas El Gamal | Superposition Coding is Almost Always Optimal for the Poisson Broadcast
Channel | 17 pages, 11 figures, submitted to IEEE Transactions on Information
Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper shows that the capacity region of the continuous-time Poisson
broadcast channel is achieved via superposition coding for most channel
parameter values. Interestingly, the channel in some subset of these parameter
values does not belong to any of the existing classes of broadcast channels for
which superpos... | [
{
"created": "Tue, 18 Aug 2015 06:49:33 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Aug 2015 23:11:04 GMT",
"version": "v2"
}
] | 2015-08-28 | [
[
"Kim",
"Hyeji",
""
],
[
"Nachman",
"Benjamin",
""
],
[
"Gamal",
"Abbas El",
""
]
] | This paper shows that the capacity region of the continuous-time Poisson broadcast channel is achieved via superposition coding for most channel parameter values. Interestingly, the channel in some subset of these parameter values does not belong to any of the existing classes of broadcast channels for which superposit... |
1807.11241 | Mahendran Subramanian | Billy Woods, Mahendran Subramanian, Ali Shafti and A. Aldo Faisal | Mechanomyography based closed-loop Functional Electrical Stimulation
cycling system | Functional Electrical Stimulation Closed loop system, The 7th IEEE
RAS/EMBS International Conference on Biomedical Robotics and Biomechatronics
2018 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Functional Electrical Stimulation (FES) systems are successful in restoring
motor function and supporting paralyzed users. Commercially available FES
products are open loop, meaning that the system is unable to adapt to changing
conditions with the user and their muscles which results in muscle fatigue and
poor stimu... | [
{
"created": "Mon, 30 Jul 2018 08:59:14 GMT",
"version": "v1"
}
] | 2018-07-31 | [
[
"Woods",
"Billy",
""
],
[
"Subramanian",
"Mahendran",
""
],
[
"Shafti",
"Ali",
""
],
[
"Faisal",
"A. Aldo",
""
]
] | Functional Electrical Stimulation (FES) systems are successful in restoring motor function and supporting paralyzed users. Commercially available FES products are open loop, meaning that the system is unable to adapt to changing conditions with the user and their muscles which results in muscle fatigue and poor stimula... |
1711.05611 | David Bau iii | Bolei Zhou, David Bau, Aude Oliva, and Antonio Torralba | Interpreting Deep Visual Representations via Network Dissection | *B. Zhou and D. Bau contributed equally to this work. 15 pages, 27
figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of recent deep convolutional neural networks (CNNs) depends on
learning hidden representations that can summarize the important factors of
variation behind the data. However, CNNs often criticized as being black boxes
that lack interpretability, since they have millions of unexplained model
parameters. In... | [
{
"created": "Wed, 15 Nov 2017 15:05:25 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Jun 2018 15:38:31 GMT",
"version": "v2"
}
] | 2018-06-27 | [
[
"Zhou",
"Bolei",
""
],
[
"Bau",
"David",
""
],
[
"Oliva",
"Aude",
""
],
[
"Torralba",
"Antonio",
""
]
] | The success of recent deep convolutional neural networks (CNNs) depends on learning hidden representations that can summarize the important factors of variation behind the data. However, CNNs often criticized as being black boxes that lack interpretability, since they have millions of unexplained model parameters. In t... |
1812.01167 | Erik Demaine | Erik D. Demaine and Martin L. Demaine and David A. Huffman and Duks
Koschitz and Tomohiro Tachi | Conic Crease Patterns with Reflecting Rule Lines | 17 pages, 12 figures. In Origami^7: Proceedings of the 7th
International Meeting on Origami in Science, Mathematics and Education | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We characterize when two conic curved creases are compatible with each other,
when the rule lines must converge to conic foci and reflect at the crease.
Namely, two conics are compatible (can be connected by rule segments in a
foldable curved crease pattern) if and only if they have equal or reciprocal
eccentricity. ... | [
{
"created": "Tue, 4 Dec 2018 02:18:12 GMT",
"version": "v1"
}
] | 2018-12-05 | [
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Huffman",
"David A.",
""
],
[
"Koschitz",
"Duks",
""
],
[
"Tachi",
"Tomohiro",
""
]
] | We characterize when two conic curved creases are compatible with each other, when the rule lines must converge to conic foci and reflect at the crease. Namely, two conics are compatible (can be connected by rule segments in a foldable curved crease pattern) if and only if they have equal or reciprocal eccentricity. Th... |
1507.08569 | Mohsen Yaghoubi Suraki | Mohsen Yaghoubi Suraki, Morteza Yaghoubi Suraki, Leila SourakiAzad | HMIoT: A New Healthcare Model Based on Internet of Things | 8 pages, 9 figures, Journal | IJCSI International Journal of Computer Science Issues, Volume 12,
Issue 1, No 1, January 2015 ISSN (Print): 1694-0814 | ISSN (Online):
1694-0784 www.IJCSI.org | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent century, with developing of equipment, using of the internet and
things connected to the internet is growing. Therefore, the need for informing
in the process of expanding the scope of its application is very necessary and
important. These days, using intelligent and autonomous devices in our daily
lives ha... | [
{
"created": "Tue, 28 Jul 2015 20:18:18 GMT",
"version": "v1"
}
] | 2015-07-31 | [
[
"Suraki",
"Mohsen Yaghoubi",
""
],
[
"Suraki",
"Morteza Yaghoubi",
""
],
[
"SourakiAzad",
"Leila",
""
]
] | In recent century, with developing of equipment, using of the internet and things connected to the internet is growing. Therefore, the need for informing in the process of expanding the scope of its application is very necessary and important. These days, using intelligent and autonomous devices in our daily lives has ... |
2304.12931 | Victor Jung | Victor J.B. Jung, Arne Symons, Linyan Mei, Marian Verhelst, Luca
Benini | SALSA: Simulated Annealing based Loop-Ordering Scheduler for DNN
Accelerators | 5 pages, 6 figures, open-source at
https://github.com/ZigZag-Project/zigzag | null | null | null | cs.AR cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | To meet the growing need for computational power for DNNs, multiple
specialized hardware architectures have been proposed. Each DNN layer should be
mapped onto the hardware with the most efficient schedule, however, SotA
schedulers struggle to consistently provide optimum schedules in a reasonable
time across all DNN... | [
{
"created": "Thu, 20 Apr 2023 12:00:08 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Jun 2024 07:49:38 GMT",
"version": "v2"
}
] | 2024-06-17 | [
[
"Jung",
"Victor J. B.",
""
],
[
"Symons",
"Arne",
""
],
[
"Mei",
"Linyan",
""
],
[
"Verhelst",
"Marian",
""
],
[
"Benini",
"Luca",
""
]
] | To meet the growing need for computational power for DNNs, multiple specialized hardware architectures have been proposed. Each DNN layer should be mapped onto the hardware with the most efficient schedule, however, SotA schedulers struggle to consistently provide optimum schedules in a reasonable time across all DNN-H... |
1405.0641 | Xiaojun Wan | Xiaojun Wan | x-index: a fantastic new indicator for quantifying a scientist's
scientific impact | null | null | null | null | cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | h-index has become the most popular indicator for quantifying a scientist's
scientific impact in various scientific fields. h-index is defined as the
largest number of papers with citation number larger than or equal to h and it
treats each citation equally. However, different citations usually come from
different pa... | [
{
"created": "Sun, 4 May 2014 02:26:52 GMT",
"version": "v1"
}
] | 2014-05-06 | [
[
"Wan",
"Xiaojun",
""
]
] | h-index has become the most popular indicator for quantifying a scientist's scientific impact in various scientific fields. h-index is defined as the largest number of papers with citation number larger than or equal to h and it treats each citation equally. However, different citations usually come from different pape... |
2105.12990 | Tianyi Zhang | Tianyi Zhang, Jie Lin, Peng Hu, Bin Zhao, Mohamed M. Sabry Aly | PSRR-MaxpoolNMS: Pyramid Shifted MaxpoolNMS with Relationship Recovery | Accepted by CVPR2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-maximum Suppression (NMS) is an essential postprocessing step in modern
convolutional neural networks for object detection. Unlike convolutions which
are inherently parallel, the de-facto standard for NMS, namely GreedyNMS,
cannot be easily parallelized and thus could be the performance bottleneck in
convolutiona... | [
{
"created": "Thu, 27 May 2021 08:24:21 GMT",
"version": "v1"
}
] | 2021-05-28 | [
[
"Zhang",
"Tianyi",
""
],
[
"Lin",
"Jie",
""
],
[
"Hu",
"Peng",
""
],
[
"Zhao",
"Bin",
""
],
[
"Aly",
"Mohamed M. Sabry",
""
]
] | Non-maximum Suppression (NMS) is an essential postprocessing step in modern convolutional neural networks for object detection. Unlike convolutions which are inherently parallel, the de-facto standard for NMS, namely GreedyNMS, cannot be easily parallelized and thus could be the performance bottleneck in convolutional ... |
1003.1940 | Vamsi Kundeti | Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh | Efficient Parallel and Out of Core Algorithms for Constructing Large
Bi-directed de Bruijn Graphs | null | null | null | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Assembling genomic sequences from a set of overlapping reads is one of the
most fundamental problems in computational biology. Algorithms addressing the
assembly problem fall into two broad categories -- based on the data structures
which they employ. The first class uses an overlap/string graph and the second
type u... | [
{
"created": "Tue, 9 Mar 2010 17:54:01 GMT",
"version": "v1"
}
] | 2010-03-10 | [
[
"Kundeti",
"Vamsi",
""
],
[
"Rajasekaran",
"Sanguthevar",
""
],
[
"Dinh",
"Hieu",
""
]
] | Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories -- based on the data structures which they employ. The first class uses an overlap/string graph and the second type use... |
2401.00031 | Xiaoqian Liu | Xiaoqian Liu, Jianbin Jiao, Junge Zhang | Self-supervised Pretraining for Decision Foundation Model: Formulation,
Pipeline and Challenges | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Decision-making is a dynamic process requiring perception, memory, and
reasoning to make choices and find optimal policies. Traditional approaches to
decision-making suffer from sample efficiency and generalization, while
large-scale self-supervised pretraining has enabled fast adaptation with
fine-tuning or few-shot... | [
{
"created": "Fri, 29 Dec 2023 08:18:52 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Jan 2024 07:21:06 GMT",
"version": "v2"
}
] | 2024-01-08 | [
[
"Liu",
"Xiaoqian",
""
],
[
"Jiao",
"Jianbin",
""
],
[
"Zhang",
"Junge",
""
]
] | Decision-making is a dynamic process requiring perception, memory, and reasoning to make choices and find optimal policies. Traditional approaches to decision-making suffer from sample efficiency and generalization, while large-scale self-supervised pretraining has enabled fast adaptation with fine-tuning or few-shot l... |
1406.5153 | Ioannis Giotis | Josep D\'iaz, Ioannis Giotis, Lefteris Kirousis, Yiannis Mourtos,
Maria J. Serna | Optimizing the Social Cost of Congestion Games by Imposing Variable
Delays | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a new coordination mechanism for non-atomic congestion games that
leads to a (selfish) social cost which is arbitrarily close to the non-selfish
optimal. This mechanism does not incur any additional extra cost, like tolls,
which are usually differentiated from the social cost as expressed in terms of
dela... | [
{
"created": "Thu, 19 Jun 2014 19:05:40 GMT",
"version": "v1"
}
] | 2014-06-20 | [
[
"Díaz",
"Josep",
""
],
[
"Giotis",
"Ioannis",
""
],
[
"Kirousis",
"Lefteris",
""
],
[
"Mourtos",
"Yiannis",
""
],
[
"Serna",
"Maria J.",
""
]
] | We describe a new coordination mechanism for non-atomic congestion games that leads to a (selfish) social cost which is arbitrarily close to the non-selfish optimal. This mechanism does not incur any additional extra cost, like tolls, which are usually differentiated from the social cost as expressed in terms of delays... |
0901.0753 | Sung-eok Jeon | Sung-eok Jeon and Chuanyi Ji | Distributed Preemption Decisions: Probabilistic Graphical Model,
Algorithm and Near-Optimality | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cooperative decision making is a vision of future network management and
control. Distributed connection preemption is an important example where nodes
can make intelligent decisions on allocating resources and controlling traffic
flows for multi-class service networks. A challenge is that nodal decisions are
spatial... | [
{
"created": "Wed, 7 Jan 2009 04:36:58 GMT",
"version": "v1"
}
] | 2009-01-08 | [
[
"Jeon",
"Sung-eok",
""
],
[
"Ji",
"Chuanyi",
""
]
] | Cooperative decision making is a vision of future network management and control. Distributed connection preemption is an important example where nodes can make intelligent decisions on allocating resources and controlling traffic flows for multi-class service networks. A challenge is that nodal decisions are spatially... |
2305.13067 | Joe Stacey | Joe Stacey and Marek Rei | Distilling Robustness into Natural Language Inference Models with
Domain-Targeted Augmentation | Accepted at ACL Findings 2024 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge distillation optimises a smaller student model to behave similarly
to a larger teacher model, retaining some of the performance benefits. While
this method can improve results on in-distribution examples, it does not
necessarily generalise to out-of-distribution (OOD) settings. We investigate
two complement... | [
{
"created": "Mon, 22 May 2023 14:37:05 GMT",
"version": "v1"
},
{
"created": "Thu, 30 May 2024 10:00:14 GMT",
"version": "v2"
},
{
"created": "Wed, 24 Jul 2024 18:54:53 GMT",
"version": "v3"
}
] | 2024-07-26 | [
[
"Stacey",
"Joe",
""
],
[
"Rei",
"Marek",
""
]
] | Knowledge distillation optimises a smaller student model to behave similarly to a larger teacher model, retaining some of the performance benefits. While this method can improve results on in-distribution examples, it does not necessarily generalise to out-of-distribution (OOD) settings. We investigate two complementar... |
1403.2237 | Li Li | Li Li, Jun Pang, Yang Liu, Jun Sun, Jin Song Dong | Stateful Security Protocol Verification | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A long-standing research problem in security protocol design is how to
efficiently verify security protocols with tamper-resistant global states. In
this paper, we address this problem by first proposing a protocol specification
framework, which explicitly represents protocol execution states and state
transformation... | [
{
"created": "Mon, 10 Mar 2014 13:40:00 GMT",
"version": "v1"
}
] | 2014-03-11 | [
[
"Li",
"Li",
""
],
[
"Pang",
"Jun",
""
],
[
"Liu",
"Yang",
""
],
[
"Sun",
"Jun",
""
],
[
"Dong",
"Jin Song",
""
]
] | A long-standing research problem in security protocol design is how to efficiently verify security protocols with tamper-resistant global states. In this paper, we address this problem by first proposing a protocol specification framework, which explicitly represents protocol execution states and state transformations.... |
2312.01487 | Lung-Pan Cheng | Eden Cong-He Xu, Lung-Pan Cheng | BetterMinton Service: Analyzing the Badminton Service using Open Kinetic
Chain | 14 pages, The 9th Annual Conference of Taiwanese Association of
Computer-Human Interaction | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | We present a badminton training system that focuses on the backhand short
service. Unlike the prior motor skill training systems which focus on the
trainee's posture, our system analyzes the process of moving joints with the
open kinetic chain (OKC), which helps align movement and minimize muscle use
for better joint... | [
{
"created": "Sun, 3 Dec 2023 19:02:52 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Xu",
"Eden Cong-He",
""
],
[
"Cheng",
"Lung-Pan",
""
]
] | We present a badminton training system that focuses on the backhand short service. Unlike the prior motor skill training systems which focus on the trainee's posture, our system analyzes the process of moving joints with the open kinetic chain (OKC), which helps align movement and minimize muscle use for better joint c... |
2103.08306 | Bushra Sabir | Bushra Sabir, M. Ali Babar, Raj Gaire | ReinforceBug: A Framework to Generate Adversarial Textual Examples | Accepted in NAACL-HLT 2021 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Adversarial Examples (AEs) generated by perturbing original training examples
are useful in improving the robustness of Deep Learning (DL) based models. Most
prior works, generate AEs that are either unconscionable due to lexical errors
or semantically or functionally deviant from original examples. In this paper,
we... | [
{
"created": "Thu, 11 Mar 2021 05:35:51 GMT",
"version": "v1"
}
] | 2021-03-16 | [
[
"Sabir",
"Bushra",
""
],
[
"Babar",
"M. Ali",
""
],
[
"Gaire",
"Raj",
""
]
] | Adversarial Examples (AEs) generated by perturbing original training examples are useful in improving the robustness of Deep Learning (DL) based models. Most prior works, generate AEs that are either unconscionable due to lexical errors or semantically or functionally deviant from original examples. In this paper, we p... |
1703.05060 | Dave Zachariah | Dave Zachariah and Petre Stoica and Thomas B. Sch\"on | Online Learning for Distribution-Free Prediction | null | null | null | null | cs.LG stat.CO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop an online learning method for prediction, which is important in
problems with large and/or streaming data sets. We formulate the learning
approach using a covariance-fitting methodology, and show that the resulting
predictor has desirable computational and distribution-free properties: It is
implemented on... | [
{
"created": "Wed, 15 Mar 2017 10:20:32 GMT",
"version": "v1"
}
] | 2017-03-16 | [
[
"Zachariah",
"Dave",
""
],
[
"Stoica",
"Petre",
""
],
[
"Schön",
"Thomas B.",
""
]
] | We develop an online learning method for prediction, which is important in problems with large and/or streaming data sets. We formulate the learning approach using a covariance-fitting methodology, and show that the resulting predictor has desirable computational and distribution-free properties: It is implemented onli... |
1903.01003 | Mohamed Akrout | Ismail Akrout, Amal Feriani, Mohamed Akrout | Hacking Google reCAPTCHA v3 using Reinforcement Learning | Accepted for the Conference on Reinforcement Learning and Decision
Making (RLDM) 2019 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a Reinforcement Learning (RL) methodology to bypass Google
reCAPTCHA v3. We formulate the problem as a grid world where the agent learns
how to move the mouse and click on the reCAPTCHA button to receive a high
score. We study the performance of the agent when we vary the cell size of the
grid world and sh... | [
{
"created": "Sun, 3 Mar 2019 22:10:47 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Mar 2019 05:22:08 GMT",
"version": "v2"
},
{
"created": "Thu, 18 Apr 2019 16:22:33 GMT",
"version": "v3"
}
] | 2019-04-19 | [
[
"Akrout",
"Ismail",
""
],
[
"Feriani",
"Amal",
""
],
[
"Akrout",
"Mohamed",
""
]
] | We present a Reinforcement Learning (RL) methodology to bypass Google reCAPTCHA v3. We formulate the problem as a grid world where the agent learns how to move the mouse and click on the reCAPTCHA button to receive a high score. We study the performance of the agent when we vary the cell size of the grid world and show... |
1711.01262 | He Sun | He Sun and Luca Zanetti | Distributed Graph Clustering and Sparsification | null | null | null | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph clustering is a fundamental computational problem with a number of
applications in algorithm design, machine learning, data mining, and analysis
of social networks. Over the past decades, researchers have proposed a number
of algorithmic design methods for graph clustering. Most of these methods,
however, are b... | [
{
"created": "Fri, 3 Nov 2017 17:52:28 GMT",
"version": "v1"
}
] | 2017-11-06 | [
[
"Sun",
"He",
""
],
[
"Zanetti",
"Luca",
""
]
] | Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of algorithmic design methods for graph clustering. Most of these methods, however, are bas... |
2004.00140 | Ligong Han | Ligong Han, Robert F. Murphy, and Deva Ramanan | Learning Generative Models of Tissue Organization with Supervised GANs | Accepted at WACV-18 | null | null | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | A key step in understanding the spatial organization of cells and tissues is
the ability to construct generative models that accurately reflect that
organization. In this paper, we focus on building generative models of electron
microscope (EM) images in which the positions of cell membranes and
mitochondria have bee... | [
{
"created": "Tue, 31 Mar 2020 22:22:58 GMT",
"version": "v1"
}
] | 2020-04-02 | [
[
"Han",
"Ligong",
""
],
[
"Murphy",
"Robert F.",
""
],
[
"Ramanan",
"Deva",
""
]
] | A key step in understanding the spatial organization of cells and tissues is the ability to construct generative models that accurately reflect that organization. In this paper, we focus on building generative models of electron microscope (EM) images in which the positions of cell membranes and mitochondria have been ... |
1510.03891 | Juan-Pablo Ortega | Lyudmila Grigoryeva, Julie Henriques, Laurent Larger, and Juan-Pablo
Ortega | Nonlinear memory capacity of parallel time-delay reservoir computers in
the processing of multidimensional signals | 24 pages, 6 figures | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the reservoir design problem in the context of
delay-based reservoir computers for multidimensional input signals, parallel
architectures, and real-time multitasking. First, an approximating reservoir
model is presented in those frameworks that provides an explicit functional
link between the res... | [
{
"created": "Tue, 13 Oct 2015 20:56:49 GMT",
"version": "v1"
}
] | 2015-10-15 | [
[
"Grigoryeva",
"Lyudmila",
""
],
[
"Henriques",
"Julie",
""
],
[
"Larger",
"Laurent",
""
],
[
"Ortega",
"Juan-Pablo",
""
]
] | This paper addresses the reservoir design problem in the context of delay-based reservoir computers for multidimensional input signals, parallel architectures, and real-time multitasking. First, an approximating reservoir model is presented in those frameworks that provides an explicit functional link between the reser... |
2205.13430 | Ian Hunter | Ian Frederick Vigogne Goodbody Hunter | GNOLL: Efficient Software for Real-World Dice Notation and Extensions | 11 pages, 12 figures, Under Review for JCDCG^3 '22 | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | GNOLL ("GNOLL's Not *OLL") is a software library for dice notation. Unlike
previous papers, GNOLL's dice notation syntax is focused on parsing a language
that tabletop role-players and board gamers are already used to for specifying
dice rolls in many popular software applications. Existing implementations of
such a ... | [
{
"created": "Thu, 26 May 2022 15:35:38 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Jul 2022 13:55:55 GMT",
"version": "v2"
}
] | 2022-07-05 | [
[
"Hunter",
"Ian Frederick Vigogne Goodbody",
""
]
] | GNOLL ("GNOLL's Not *OLL") is a software library for dice notation. Unlike previous papers, GNOLL's dice notation syntax is focused on parsing a language that tabletop role-players and board gamers are already used to for specifying dice rolls in many popular software applications. Existing implementations of such a sy... |
1611.05660 | Henrik Barthels | Henrik Barthels, Paolo Bientinesi | The Matrix Chain Algorithm to Compile Linear Algebra Expressions | DSLDI 2016 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The matrix chain problem consists in finding the parenthesization of a matrix
product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar
operations. In practical applications, however, one frequently encounters more
complicated scenarios, where expressions involve transposition, inversion,
matrices with gi... | [
{
"created": "Thu, 17 Nov 2016 12:44:15 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Barthels",
"Henrik",
""
],
[
"Bientinesi",
"Paolo",
""
]
] | The matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated scenarios, where expressions involve transposition, inversion, matrices with give... |
2311.10793 | Chuang Yang | Chuang Yang, Kai Zhuang, Mulin Chen, Haozhao Ma, Xu Han, Tao Han,
Changxing Guo, Han Han, Bingxuan Zhao, and Qi Wang | Traffic Sign Interpretation in Real Road Scene | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most existing traffic sign-related works are dedicated to detecting and
recognizing part of traffic signs individually, which fails to analyze the
global semantic logic among signs and may convey inaccurate traffic
instruction. Following the above issues, we propose a traffic sign
interpretation (TSI) task, which aim... | [
{
"created": "Fri, 17 Nov 2023 02:30:36 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Nov 2023 10:23:46 GMT",
"version": "v2"
}
] | 2023-11-30 | [
[
"Yang",
"Chuang",
""
],
[
"Zhuang",
"Kai",
""
],
[
"Chen",
"Mulin",
""
],
[
"Ma",
"Haozhao",
""
],
[
"Han",
"Xu",
""
],
[
"Han",
"Tao",
""
],
[
"Guo",
"Changxing",
""
],
[
"Han",
"Han",
""
... | Most existing traffic sign-related works are dedicated to detecting and recognizing part of traffic signs individually, which fails to analyze the global semantic logic among signs and may convey inaccurate traffic instruction. Following the above issues, we propose a traffic sign interpretation (TSI) task, which aims ... |
2311.18046 | Srravya Chandhiramowuli | Srravya Chandhiramowuli, Alex Taylor, Sara Heitlinger, Ding Wang | Making Data Work Count | Accepted for publication at CSCW 2024. Forthcoming in the Proceedings
of the ACM on Human-Computer Interaction | null | null | null | cs.HC cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we examine the work of data annotation. Specifically, we focus
on the role of counting or quantification in organising annotation work. Based
on an ethnographic study of data annotation in two outsourcing centres in
India, we observe that counting practices and its associated logics are an
integral par... | [
{
"created": "Wed, 29 Nov 2023 19:45:14 GMT",
"version": "v1"
}
] | 2023-12-01 | [
[
"Chandhiramowuli",
"Srravya",
""
],
[
"Taylor",
"Alex",
""
],
[
"Heitlinger",
"Sara",
""
],
[
"Wang",
"Ding",
""
]
] | In this paper, we examine the work of data annotation. Specifically, we focus on the role of counting or quantification in organising annotation work. Based on an ethnographic study of data annotation in two outsourcing centres in India, we observe that counting practices and its associated logics are an integral part ... |
2208.13446 | Sabine Cornelsen | Sabine Cornelsen and Gregor Diatzko | Planar Confluent Orthogonal Drawings of 4-Modal Digraphs | Appears in the Proceedings of the 30th International Symposium on
Graph Drawing and Network Visualization (GD 2022) | null | null | null | cs.CG cs.DS | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph)
vertices are drawn as points in the plane and edges as orthogonal polylines
starting with a vertical segment and ending with a horizontal segment. Edges
may overlap in their first or last segment, but must not intersect otherwise.
PCODs can... | [
{
"created": "Mon, 29 Aug 2022 09:28:49 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Aug 2022 09:26:55 GMT",
"version": "v2"
}
] | 2022-09-01 | [
[
"Cornelsen",
"Sabine",
""
],
[
"Diatzko",
"Gregor",
""
]
] | In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may overlap in their first or last segment, but must not intersect otherwise. PCODs can b... |
2302.13408 | Lingjie Kong | Lingjie Kong, Pankaj Rajak, and Siamak Shakeri | Generative Models for 3D Point Clouds | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Point clouds are rich geometric data structures, where their three
dimensional structure offers an excellent domain for understanding the
representation learning and generative modeling in 3D space. In this work, we
aim to improve the performance of point cloud latent-space generative models by
experimenting with tra... | [
{
"created": "Sun, 26 Feb 2023 21:34:19 GMT",
"version": "v1"
}
] | 2023-02-28 | [
[
"Kong",
"Lingjie",
""
],
[
"Rajak",
"Pankaj",
""
],
[
"Shakeri",
"Siamak",
""
]
] | Point clouds are rich geometric data structures, where their three dimensional structure offers an excellent domain for understanding the representation learning and generative modeling in 3D space. In this work, we aim to improve the performance of point cloud latent-space generative models by experimenting with trans... |
2203.12707 | Yanwu Xu | Yanwu Xu, Shaoan Xie, Wenhao Wu, Kun Zhang, Mingming Gong and Kayhan
Batmanghelich | Maximum Spatial Perturbation Consistency for Unpaired Image-to-Image
Translation | CVPR 2022 accepted paper | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Unpaired image-to-image translation (I2I) is an ill-posed problem, as an
infinite number of translation functions can map the source domain distribution
to the target distribution. Therefore, much effort has been put into designing
suitable constraints, e.g., cycle consistency (CycleGAN), geometry consistency
(GCGAN)... | [
{
"created": "Wed, 23 Mar 2022 19:59:04 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Mar 2022 15:16:29 GMT",
"version": "v2"
}
] | 2022-03-30 | [
[
"Xu",
"Yanwu",
""
],
[
"Xie",
"Shaoan",
""
],
[
"Wu",
"Wenhao",
""
],
[
"Zhang",
"Kun",
""
],
[
"Gong",
"Mingming",
""
],
[
"Batmanghelich",
"Kayhan",
""
]
] | Unpaired image-to-image translation (I2I) is an ill-posed problem, as an infinite number of translation functions can map the source domain distribution to the target distribution. Therefore, much effort has been put into designing suitable constraints, e.g., cycle consistency (CycleGAN), geometry consistency (GCGAN), ... |
2303.15429 | Okko Makkonen | Okko Makkonen, Elif Sa\c{c}{\i}kara, Camilla Hollanti | Algebraic Geometry Codes for Secure Distributed Matrix Multiplication | 16 pages, 1 figure | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel construction for secure distributed matrix
multiplication (SDMM) based on algebraic geometry (AG) codes, which we call the
PoleGap SDMM scheme. The proposed construction is inspired by the GASP code,
where so-called gaps in a certain polynomial are utilized to achieve higher
communic... | [
{
"created": "Mon, 27 Mar 2023 17:53:25 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jun 2023 10:05:44 GMT",
"version": "v2"
}
] | 2023-06-12 | [
[
"Makkonen",
"Okko",
""
],
[
"Saçıkara",
"Elif",
""
],
[
"Hollanti",
"Camilla",
""
]
] | In this paper, we propose a novel construction for secure distributed matrix multiplication (SDMM) based on algebraic geometry (AG) codes, which we call the PoleGap SDMM scheme. The proposed construction is inspired by the GASP code, where so-called gaps in a certain polynomial are utilized to achieve higher communicat... |
1812.02969 | Delcho Donev | Delcho Donev and Georg B\"ocherer | Polar-Coded Pulse Position Modulation for the Poisson Channel | 7 pages, 9 figures | 2018 9th Advanced Satellite Multimedia Systems Conference and the
15th Signal Processing for Space Communications Workshop (ASMS/SPSC) | 10.1109/ASMS-SPSC.2018.8510721 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A polar-coded modulation scheme for deep-space optical communication is
proposed. The photon counting Poisson channel with pulse position modulation
(PPM) is considered. We use the fact that PPM is particularly well suited to be
used with multilevel codes to design a polar-coded modulation scheme for the
system in co... | [
{
"created": "Fri, 7 Dec 2018 10:34:56 GMT",
"version": "v1"
}
] | 2018-12-10 | [
[
"Donev",
"Delcho",
""
],
[
"Böcherer",
"Georg",
""
]
] | A polar-coded modulation scheme for deep-space optical communication is proposed. The photon counting Poisson channel with pulse position modulation (PPM) is considered. We use the fact that PPM is particularly well suited to be used with multilevel codes to design a polar-coded modulation scheme for the system in cons... |
1904.06962 | Manohar Kuse | Manohar Kuse, Shaojie Shen | Learning Whole-Image Descriptors for Real-time Loop Detection andKidnap
Recovery under Large Viewpoint Difference | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a real-time stereo visual-inertial-SLAM system which is able to
recover from complicatedkidnap scenarios and failures online in realtime. We
propose to learn the whole-image-descriptorin a weakly supervised manner based
on NetVLAD and decoupled convolutions. We analyse thetraining difficulties in
using sta... | [
{
"created": "Mon, 15 Apr 2019 11:01:04 GMT",
"version": "v1"
}
] | 2019-04-16 | [
[
"Kuse",
"Manohar",
""
],
[
"Shen",
"Shaojie",
""
]
] | We present a real-time stereo visual-inertial-SLAM system which is able to recover from complicatedkidnap scenarios and failures online in realtime. We propose to learn the whole-image-descriptorin a weakly supervised manner based on NetVLAD and decoupled convolutions. We analyse thetraining difficulties in using stand... |
2101.00008 | Farah Shamout | Munachiso Nwadike, Takumi Miyawaki, Esha Sarkar, Michail Maniatakos,
Farah Shamout | Explainability Matters: Backdoor Attacks on Medical Imaging | null | null | null | null | cs.CR cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks have been shown to be vulnerable to backdoor attacks,
which could be easily introduced to the training set prior to model training.
Recent work has focused on investigating backdoor attacks on natural images or
toy datasets. Consequently, the exact impact of backdoors is not yet fully
understood ... | [
{
"created": "Wed, 30 Dec 2020 09:41:19 GMT",
"version": "v1"
}
] | 2021-01-05 | [
[
"Nwadike",
"Munachiso",
""
],
[
"Miyawaki",
"Takumi",
""
],
[
"Sarkar",
"Esha",
""
],
[
"Maniatakos",
"Michail",
""
],
[
"Shamout",
"Farah",
""
]
] | Deep neural networks have been shown to be vulnerable to backdoor attacks, which could be easily introduced to the training set prior to model training. Recent work has focused on investigating backdoor attacks on natural images or toy datasets. Consequently, the exact impact of backdoors is not yet fully understood in... |
2308.12539 | Vipul Gupta | Vipul Gupta, Pranav Narayanan Venkit, Hugo Lauren\c{c}on, Shomir
Wilson, Rebecca J. Passonneau | CALM : A Multi-task Benchmark for Comprehensive Assessment of Language
Model Bias | null | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | As language models (LMs) become increasingly powerful and widely used, it is
important to quantify them for sociodemographic bias with potential for harm.
Prior measures of bias are sensitive to perturbations in the templates designed
to compare performance across social groups, due to factors such as low
diversity o... | [
{
"created": "Thu, 24 Aug 2023 03:53:55 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Jan 2024 01:09:01 GMT",
"version": "v2"
},
{
"created": "Thu, 8 Aug 2024 03:20:17 GMT",
"version": "v3"
}
] | 2024-08-09 | [
[
"Gupta",
"Vipul",
""
],
[
"Venkit",
"Pranav Narayanan",
""
],
[
"Laurençon",
"Hugo",
""
],
[
"Wilson",
"Shomir",
""
],
[
"Passonneau",
"Rebecca J.",
""
]
] | As language models (LMs) become increasingly powerful and widely used, it is important to quantify them for sociodemographic bias with potential for harm. Prior measures of bias are sensitive to perturbations in the templates designed to compare performance across social groups, due to factors such as low diversity or ... |
2205.08441 | Max Argus | Sergio Izquierdo, Max Argus, Thomas Brox | Conditional Visual Servoing for Multi-Step Tasks | null | null | null | null | cs.RO cs.CV cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Visual Servoing has been effectively used to move a robot into specific
target locations or to track a recorded demonstration. It does not require
manual programming, but it is typically limited to settings where one
demonstration maps to one environment state. We propose a modular approach to
extend visual servoing ... | [
{
"created": "Tue, 17 May 2022 15:34:54 GMT",
"version": "v1"
}
] | 2022-05-18 | [
[
"Izquierdo",
"Sergio",
""
],
[
"Argus",
"Max",
""
],
[
"Brox",
"Thomas",
""
]
] | Visual Servoing has been effectively used to move a robot into specific target locations or to track a recorded demonstration. It does not require manual programming, but it is typically limited to settings where one demonstration maps to one environment state. We propose a modular approach to extend visual servoing to... |
1602.07029 | Siddharth Reddy | Siddharth Reddy, Igor Labutov, Thorsten Joachims | Latent Skill Embedding for Personalized Lesson Sequence Recommendation | Under review by the ACM SIGKDD Conference on Knowledge Discovery and
Data Mining | null | null | null | cs.LG cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Students in online courses generate large amounts of data that can be used to
personalize the learning process and improve quality of education. In this
paper, we present the Latent Skill Embedding (LSE), a probabilistic model of
students and educational content that can be used to recommend personalized
sequences of... | [
{
"created": "Tue, 23 Feb 2016 04:20:40 GMT",
"version": "v1"
}
] | 2016-02-24 | [
[
"Reddy",
"Siddharth",
""
],
[
"Labutov",
"Igor",
""
],
[
"Joachims",
"Thorsten",
""
]
] | Students in online courses generate large amounts of data that can be used to personalize the learning process and improve quality of education. In this paper, we present the Latent Skill Embedding (LSE), a probabilistic model of students and educational content that can be used to recommend personalized sequences of l... |
2402.17615 | Artur Gaspar Da Silva | M\'ario S. Alvim, Artur Gaspar da Silva, Sophia Knight, and Frank
Valencia | A Multi-Agent Model for Opinion Evolution under Cognitive Biases | null | null | null | null | cs.MA cs.SI | http://creativecommons.org/licenses/by/4.0/ | We generalize the DeGroot model for opinion dynamics to better capture
realistic social scenarios. We introduce a model where each agent has their own
individual cognitive biases. Society is represented as a directed graph whose
edges indicate how much agents influence one another. Biases are represented as
the funct... | [
{
"created": "Tue, 27 Feb 2024 15:44:12 GMT",
"version": "v1"
}
] | 2024-02-28 | [
[
"Alvim",
"Mário S.",
""
],
[
"da Silva",
"Artur Gaspar",
""
],
[
"Knight",
"Sophia",
""
],
[
"Valencia",
"Frank",
""
]
] | We generalize the DeGroot model for opinion dynamics to better capture realistic social scenarios. We introduce a model where each agent has their own individual cognitive biases. Society is represented as a directed graph whose edges indicate how much agents influence one another. Biases are represented as the functio... |
2010.09254 | Jingang Wang | Yang Yang, Junmei Hao, Canjia Li, Zili Wang, Jingang Wang, Fuzheng
Zhang, Rao Fu, Peixu Hou, Gong Zhang, Zhongyuan Wang | Query-aware Tip Generation for Vertical Search | Accepted By CIKM 2020 Applied Research Track | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a concise form of user reviews, tips have unique advantages to explain the
search results, assist users' decision making, and further improve user
experience in vertical search scenarios. Existing work on tip generation does
not take query into consideration, which limits the impact of tips in search
scenarios. To... | [
{
"created": "Mon, 19 Oct 2020 06:48:40 GMT",
"version": "v1"
}
] | 2020-10-20 | [
[
"Yang",
"Yang",
""
],
[
"Hao",
"Junmei",
""
],
[
"Li",
"Canjia",
""
],
[
"Wang",
"Zili",
""
],
[
"Wang",
"Jingang",
""
],
[
"Zhang",
"Fuzheng",
""
],
[
"Fu",
"Rao",
""
],
[
"Hou",
"Peixu",
"... | As a concise form of user reviews, tips have unique advantages to explain the search results, assist users' decision making, and further improve user experience in vertical search scenarios. Existing work on tip generation does not take query into consideration, which limits the impact of tips in search scenarios. To a... |
0812.2990 | Frederic Mazoit | Fr\'ed\'eric Mazoit (LaBRI) | Tree-width of hypergraphs and surface duality | null | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Graph Minor III, Robertson and Seymour conjecture that the tree-width of a
planar graph and that of its dual differ by at most one. We prove that given a
hypergraph H on a surface of Euler genus k, the tree-width of H^* is at most
the maximum of tw(H) + 1 + k and the maximum size of a hyperedge of H^*.
| [
{
"created": "Tue, 16 Dec 2008 07:47:50 GMT",
"version": "v1"
}
] | 2008-12-17 | [
[
"Mazoit",
"Frédéric",
"",
"LaBRI"
]
] | In Graph Minor III, Robertson and Seymour conjecture that the tree-width of a planar graph and that of its dual differ by at most one. We prove that given a hypergraph H on a surface of Euler genus k, the tree-width of H^* is at most the maximum of tw(H) + 1 + k and the maximum size of a hyperedge of H^*. |
2306.17000 | Ce Zhang Dr. | Ce Zhang, Chengjie Zhang, Yiluan Guo, Lingji Chen, Michael Happold | MotionTrack: End-to-End Transformer-based Multi-Object Tracing with
LiDAR-Camera Fusion | This paper is accepted by CVPR WAD 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Multiple Object Tracking (MOT) is crucial to autonomous vehicle perception.
End-to-end transformer-based algorithms, which detect and track objects
simultaneously, show great potential for the MOT task. However, most existing
methods focus on image-based tracking with a single object category. In this
paper, we propo... | [
{
"created": "Thu, 29 Jun 2023 15:00:12 GMT",
"version": "v1"
}
] | 2023-06-30 | [
[
"Zhang",
"Ce",
""
],
[
"Zhang",
"Chengjie",
""
],
[
"Guo",
"Yiluan",
""
],
[
"Chen",
"Lingji",
""
],
[
"Happold",
"Michael",
""
]
] | Multiple Object Tracking (MOT) is crucial to autonomous vehicle perception. End-to-end transformer-based algorithms, which detect and track objects simultaneously, show great potential for the MOT task. However, most existing methods focus on image-based tracking with a single object category. In this paper, we propose... |
2402.05657 | Antoine Renard | Antoine Renard, Michel Rigo, Markus A. Whiteland | q-Parikh Matrices and q-deformed binomial coefficients of words | 26 pages, submitted | null | null | null | cs.FL cs.DM math.CO | http://creativecommons.org/licenses/by/4.0/ | We have introduced a q-deformation, i.e., a polynomial in q with natural
coefficients, of the binomial coefficient of two finite words u and v counting
the number of occurrences of v as a subword of u. In this paper, we examine the
q-deformation of Parikh matrices as introduced by E\u{g}ecio\u{g}lu in 2004.
Many cl... | [
{
"created": "Thu, 8 Feb 2024 13:21:26 GMT",
"version": "v1"
}
] | 2024-02-09 | [
[
"Renard",
"Antoine",
""
],
[
"Rigo",
"Michel",
""
],
[
"Whiteland",
"Markus A.",
""
]
] | We have introduced a q-deformation, i.e., a polynomial in q with natural coefficients, of the binomial coefficient of two finite words u and v counting the number of occurrences of v as a subword of u. In this paper, we examine the q-deformation of Parikh matrices as introduced by E\u{g}ecio\u{g}lu in 2004. Many classi... |
2003.00888 | Guus Engels | Guus Engels, Nerea Aranjuelo, Ignacio Arganda-Carreras, Marcos Nieto
and Oihana Otaegui | 3D Object Detection From LiDAR Data Using Distance Dependent Feature
Extraction | 10 pages, 8 figures, 6th International Conference on Vehicle
Technology and Intelligent Transport Systems (VEHITS 2020) | null | 10.5220/0009330402890300 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new approach to 3D object detection that leverages the
properties of the data obtained by a LiDAR sensor. State-of-the-art detectors
use neural network architectures based on assumptions valid for camera images.
However, point clouds obtained from LiDAR are fundamentally different. Most
detector... | [
{
"created": "Mon, 2 Mar 2020 13:16:35 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Mar 2020 07:47:20 GMT",
"version": "v2"
}
] | 2021-04-09 | [
[
"Engels",
"Guus",
""
],
[
"Aranjuelo",
"Nerea",
""
],
[
"Arganda-Carreras",
"Ignacio",
""
],
[
"Nieto",
"Marcos",
""
],
[
"Otaegui",
"Oihana",
""
]
] | This paper presents a new approach to 3D object detection that leverages the properties of the data obtained by a LiDAR sensor. State-of-the-art detectors use neural network architectures based on assumptions valid for camera images. However, point clouds obtained from LiDAR are fundamentally different. Most detectors ... |
2407.19951 | Muhammad Rashid | Muhammad Rashid, Elvio Amparore, Enrico Ferrari, Damiano Verda | Can I trust my anomaly detection system? A case study based on
explainable AI | World Conference on eXplainable Artificial Intelligence | null | 10.1007/978-3-031-63803-9_13 | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Generative models based on variational autoencoders are a popular technique
for detecting anomalies in images in a semi-supervised context. A common
approach employs the anomaly score to detect the presence of anomalies, and it
is known to reach high level of accuracy on benchmark datasets. However, since
anomaly sco... | [
{
"created": "Mon, 29 Jul 2024 12:39:07 GMT",
"version": "v1"
}
] | 2024-07-30 | [
[
"Rashid",
"Muhammad",
""
],
[
"Amparore",
"Elvio",
""
],
[
"Ferrari",
"Enrico",
""
],
[
"Verda",
"Damiano",
""
]
] | Generative models based on variational autoencoders are a popular technique for detecting anomalies in images in a semi-supervised context. A common approach employs the anomaly score to detect the presence of anomalies, and it is known to reach high level of accuracy on benchmark datasets. However, since anomaly score... |
2202.09039 | Manojkumar Parmar | Kanak Tekwani, Manojkumar Parmar | Critical Checkpoints for Evaluating Defence Models Against Adversarial
Attack and Robustness | 16 pages, 8 figures | null | null | null | cs.CR cs.AI cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | From past couple of years there is a cycle of researchers proposing a defence
model for adversaries in machine learning which is arguably defensible to most
of the existing attacks in restricted condition (they evaluate on some bounded
inputs or datasets). And then shortly another set of researcher finding the
vulner... | [
{
"created": "Fri, 18 Feb 2022 06:15:49 GMT",
"version": "v1"
}
] | 2022-02-21 | [
[
"Tekwani",
"Kanak",
""
],
[
"Parmar",
"Manojkumar",
""
]
] | From past couple of years there is a cycle of researchers proposing a defence model for adversaries in machine learning which is arguably defensible to most of the existing attacks in restricted condition (they evaluate on some bounded inputs or datasets). And then shortly another set of researcher finding the vulnerab... |
1802.09119 | Ruggiero Lovreglio | Ruggiero Lovreglio, Vicente Gonzalez, Zhenan Feng, Robert Amor,
Michael Spearpoint, Jared Thomas, Margaret Trotter, Rafael Sacks | Prototyping Virtual Reality Serious Games for Building Earthquake
Preparedness: The Auckland City Hospital Case Study | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Enhancing evacuee safety is a key factor in reducing the number of injuries
and deaths that result from earthquakes. One way this can be achieved is by
training occupants. Virtual Reality (VR) and Serious Games (SGs), represent
novel techniques that may overcome the limitations of traditional training
approaches. VR ... | [
{
"created": "Mon, 26 Feb 2018 01:08:51 GMT",
"version": "v1"
}
] | 2018-02-27 | [
[
"Lovreglio",
"Ruggiero",
""
],
[
"Gonzalez",
"Vicente",
""
],
[
"Feng",
"Zhenan",
""
],
[
"Amor",
"Robert",
""
],
[
"Spearpoint",
"Michael",
""
],
[
"Thomas",
"Jared",
""
],
[
"Trotter",
"Margaret",
""
],... | Enhancing evacuee safety is a key factor in reducing the number of injuries and deaths that result from earthquakes. One way this can be achieved is by training occupants. Virtual Reality (VR) and Serious Games (SGs), represent novel techniques that may overcome the limitations of traditional training approaches. VR an... |
1911.07988 | Ashwin Kallingal Joshy | Ashwin Kallingal Joshy, Wei Le | Invariant Diffs | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Software development is inherently incremental. Nowadays, many software
companies adopt an agile process and a shorter release cycle, where software
needs to be delivered faster with quality assurances. On the other hand, the
majority of existing program analysis tools still target single versions of
programs and are... | [
{
"created": "Mon, 18 Nov 2019 22:39:38 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Jun 2020 02:16:21 GMT",
"version": "v2"
}
] | 2020-07-01 | [
[
"Joshy",
"Ashwin Kallingal",
""
],
[
"Le",
"Wei",
""
]
] | Software development is inherently incremental. Nowadays, many software companies adopt an agile process and a shorter release cycle, where software needs to be delivered faster with quality assurances. On the other hand, the majority of existing program analysis tools still target single versions of programs and are s... |
1202.2820 | Christina Boucher | Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard and
Oren Weimann | On Approximating String Selection Problems with Outliers | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many problems in bioinformatics are about finding strings that approximately
represent a collection of given strings. We look at more general problems where
some input strings can be classified as outliers. The Close to Most Strings
problem is, given a set S of same-length strings, and a parameter d, find a
string x ... | [
{
"created": "Mon, 13 Feb 2012 19:09:26 GMT",
"version": "v1"
}
] | 2012-02-14 | [
[
"Boucher",
"Christina",
""
],
[
"Landau",
"Gad M.",
""
],
[
"Levy",
"Avivit",
""
],
[
"Pritchard",
"David",
""
],
[
"Weimann",
"Oren",
""
]
] | Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can be classified as outliers. The Close to Most Strings problem is, given a set S of same-length strings, and a parameter d, find a string x th... |
2206.08800 | Rasmus Haugaard | Rasmus Laurvig Haugaard, Anders Glent Buch, Thorbj{\o}rn Mosekj{\ae}r
Iversen | Self-supervised deep visual servoing for high precision peg-in-hole
insertion | Accepted at IEEE CASE 2022 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many industrial assembly tasks involve peg-in-hole like insertions with
sub-millimeter tolerances which are challenging, even in highly calibrated
robot cells. Visual servoing can be employed to increase the robustness towards
uncertainties in the system, however, state of the art methods either rely on
accurate 3D m... | [
{
"created": "Fri, 17 Jun 2022 14:29:21 GMT",
"version": "v1"
}
] | 2022-06-20 | [
[
"Haugaard",
"Rasmus Laurvig",
""
],
[
"Buch",
"Anders Glent",
""
],
[
"Iversen",
"Thorbjørn Mosekjær",
""
]
] | Many industrial assembly tasks involve peg-in-hole like insertions with sub-millimeter tolerances which are challenging, even in highly calibrated robot cells. Visual servoing can be employed to increase the robustness towards uncertainties in the system, however, state of the art methods either rely on accurate 3D mod... |
2305.06898 | Yujie Zeng | Yujie Zeng, Yiming Huang, Xiao-Long Ren, Linyuan L\"u | Identifying vital nodes through augmented random walks on higher-order
networks | null | null | null | null | cs.SI physics.soc-ph stat.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Empirical networks possess considerable heterogeneity of node connections,
resulting in a small portion of nodes playing crucial roles in network
structure and function. Yet, how to characterize nodes' influence and identify
vital nodes is by far still unclear in the study of networks with higher-order
interactions. ... | [
{
"created": "Thu, 11 May 2023 15:39:47 GMT",
"version": "v1"
},
{
"created": "Sat, 25 Nov 2023 08:40:04 GMT",
"version": "v2"
},
{
"created": "Sun, 3 Dec 2023 13:49:00 GMT",
"version": "v3"
}
] | 2023-12-05 | [
[
"Zeng",
"Yujie",
""
],
[
"Huang",
"Yiming",
""
],
[
"Ren",
"Xiao-Long",
""
],
[
"Lü",
"Linyuan",
""
]
] | Empirical networks possess considerable heterogeneity of node connections, resulting in a small portion of nodes playing crucial roles in network structure and function. Yet, how to characterize nodes' influence and identify vital nodes is by far still unclear in the study of networks with higher-order interactions. In... |
2106.09242 | Song Wang | Moshi Wei, Yuchao Huang, Jinqiu Yang, Junjie Wang, Song Wang | CoCoFuzzing: Testing Neural Code Models with Coverage-Guided Fuzzing | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by-sa/4.0/ | Deep learning-based code processing models have shown good performance for
tasks such as predicting method names, summarizing programs, and comment
generation. However, despite the tremendous progress, deep learning models are
often prone to adversarial attacks, which can significantly threaten the
robustness and gen... | [
{
"created": "Thu, 17 Jun 2021 04:33:37 GMT",
"version": "v1"
}
] | 2021-06-18 | [
[
"Wei",
"Moshi",
""
],
[
"Huang",
"Yuchao",
""
],
[
"Yang",
"Jinqiu",
""
],
[
"Wang",
"Junjie",
""
],
[
"Wang",
"Song",
""
]
] | Deep learning-based code processing models have shown good performance for tasks such as predicting method names, summarizing programs, and comment generation. However, despite the tremendous progress, deep learning models are often prone to adversarial attacks, which can significantly threaten the robustness and gener... |
2406.14015 | Qingpeng Cai | Qingpeng Cai, Kaiping Zheng, H.V. Jagadish, Beng Chin Ooi and James
Yip | CohortNet: Empowering Cohort Discovery for Interpretable Healthcare
Analytics | 10 pages, 12 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Cohort studies are of significant importance in the field of healthcare
analysis. However, existing methods typically involve manual, labor-intensive,
and expert-driven pattern definitions or rely on simplistic clustering
techniques that lack medical relevance. Automating cohort studies with
interpretable patterns ha... | [
{
"created": "Thu, 20 Jun 2024 06:12:23 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Cai",
"Qingpeng",
""
],
[
"Zheng",
"Kaiping",
""
],
[
"Jagadish",
"H. V.",
""
],
[
"Ooi",
"Beng Chin",
""
],
[
"Yip",
"James",
""
]
] | Cohort studies are of significant importance in the field of healthcare analysis. However, existing methods typically involve manual, labor-intensive, and expert-driven pattern definitions or rely on simplistic clustering techniques that lack medical relevance. Automating cohort studies with interpretable patterns has ... |
2406.02481 | Jakub Ho\'sci{\l}owicz | Jakub Hoscilowicz, Pawel Popiolek, Jan Rudkowski, Jedrzej Bieniasz,
Artur Janicki | Large Language Models as Carriers of Hidden Messages | Work in progress. Code is available at
https://github.com/j-hoscilowic/zurek-stegano | null | null | null | cs.CL cs.CR | http://creativecommons.org/licenses/by/4.0/ | With the help of simple fine-tuning, one can artificially embed hidden text
into large language models (LLMs). This text is revealed only when triggered by
a specific query to the LLM. Two primary applications are LLM fingerprinting
and steganography. In the context of LLM fingerprinting, a unique text
identifier (fi... | [
{
"created": "Tue, 4 Jun 2024 16:49:06 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Jul 2024 16:30:17 GMT",
"version": "v2"
}
] | 2024-07-30 | [
[
"Hoscilowicz",
"Jakub",
""
],
[
"Popiolek",
"Pawel",
""
],
[
"Rudkowski",
"Jan",
""
],
[
"Bieniasz",
"Jedrzej",
""
],
[
"Janicki",
"Artur",
""
]
] | With the help of simple fine-tuning, one can artificially embed hidden text into large language models (LLMs). This text is revealed only when triggered by a specific query to the LLM. Two primary applications are LLM fingerprinting and steganography. In the context of LLM fingerprinting, a unique text identifier (fing... |
2402.17767 | Arjun Gupta | Arjun Gupta, Michelle Zhang, Rishik Sathua, Saurabh Gupta | Opening Cabinets and Drawers in the Real World using a Commodity Mobile
Manipulator | Project webpage:
https://arjung128.github.io/opening-cabinets-and-drawers | null | null | null | cs.RO cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pulling open cabinets and drawers presents many difficult technical
challenges in perception (inferring articulation parameters for objects from
onboard sensors), planning (producing motion plans that conform to tight task
constraints), and control (making and maintaining contact while applying forces
on the environm... | [
{
"created": "Tue, 27 Feb 2024 18:58:54 GMT",
"version": "v1"
}
] | 2024-02-28 | [
[
"Gupta",
"Arjun",
""
],
[
"Zhang",
"Michelle",
""
],
[
"Sathua",
"Rishik",
""
],
[
"Gupta",
"Saurabh",
""
]
] | Pulling open cabinets and drawers presents many difficult technical challenges in perception (inferring articulation parameters for objects from onboard sensors), planning (producing motion plans that conform to tight task constraints), and control (making and maintaining contact while applying forces on the environmen... |
1707.06841 | Youmna Farag | Youmna Farag, Marek Rei, Ted Briscoe | An Error-Oriented Approach to Word Embedding Pre-Training | 10 pages, 2 figures, 4 tables, BEA 2017 | The 12th Workshop on Innovative Use of NLP for Building
Educational Applications (BEA 2017) | null | null | cs.CL cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel word embedding pre-training approach that exploits writing
errors in learners' scripts. We compare our method to previous models that tune
the embeddings based on script scores and the discrimination between correct
and corrupt word contexts in addition to the generic commonly-used embeddings
pre-t... | [
{
"created": "Fri, 21 Jul 2017 11:06:12 GMT",
"version": "v1"
}
] | 2019-07-05 | [
[
"Farag",
"Youmna",
""
],
[
"Rei",
"Marek",
""
],
[
"Briscoe",
"Ted",
""
]
] | We propose a novel word embedding pre-training approach that exploits writing errors in learners' scripts. We compare our method to previous models that tune the embeddings based on script scores and the discrimination between correct and corrupt word contexts in addition to the generic commonly-used embeddings pre-tra... |
2312.16812 | Zhang Chen | Zhan Li, Zhang Chen, Zhong Li, Yi Xu | Spacetime Gaussian Feature Splatting for Real-Time Dynamic View
Synthesis | Accepted to CVPR 2024. Project page:
https://oppo-us-research.github.io/SpacetimeGaussians-website/ | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Novel view synthesis of dynamic scenes has been an intriguing yet challenging
problem. Despite recent advancements, simultaneously achieving high-resolution
photorealistic results, real-time rendering, and compact storage remains a
formidable task. To address these challenges, we propose Spacetime Gaussian
Feature Sp... | [
{
"created": "Thu, 28 Dec 2023 04:14:55 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Apr 2024 22:31:18 GMT",
"version": "v2"
}
] | 2024-04-08 | [
[
"Li",
"Zhan",
""
],
[
"Chen",
"Zhang",
""
],
[
"Li",
"Zhong",
""
],
[
"Xu",
"Yi",
""
]
] | Novel view synthesis of dynamic scenes has been an intriguing yet challenging problem. Despite recent advancements, simultaneously achieving high-resolution photorealistic results, real-time rendering, and compact storage remains a formidable task. To address these challenges, we propose Spacetime Gaussian Feature Spla... |
2407.09902 | Ian Miller | Ian D. Miller, Fernando Cladera, Trey Smith, Camillo Jose Taylor,
Vijay Kumar | Air-Ground Collaboration with SPOMP: Semantic Panoramic Online Mapping
and Planning | Video: https://www.youtube.com/watch?v=ieNYH40buBo | IEEE Transactions on Field Robotics (2024) | 10.1109/TFR.2024.3424748 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mapping and navigation have gone hand-in-hand since long before robots
existed. Maps are a key form of communication, allowing someone who has never
been somewhere to nonetheless navigate that area successfully. In the context
of multi-robot systems, the maps and information that flow between robots are
necessary for... | [
{
"created": "Sat, 13 Jul 2024 14:37:44 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Miller",
"Ian D.",
""
],
[
"Cladera",
"Fernando",
""
],
[
"Smith",
"Trey",
""
],
[
"Taylor",
"Camillo Jose",
""
],
[
"Kumar",
"Vijay",
""
]
] | Mapping and navigation have gone hand-in-hand since long before robots existed. Maps are a key form of communication, allowing someone who has never been somewhere to nonetheless navigate that area successfully. In the context of multi-robot systems, the maps and information that flow between robots are necessary for e... |
1504.06746 | Francisco Monteiro | Jo\~ao S. Lemos, Francisco Ros\'ario, Francisco A. Monteiro, Jo\~ao
Xavier, Ant\'onio Rodrigues | Massive MIMO Full-Duplex Relaying with Optimal Power Allocation for
Independent Multipairs | Accepted to the 16th IEEE International Workshop on Signal Processing
Advances in Wireless Communications - SPAWC, Stockholm, Sweden 2015 | null | 10.1109/SPAWC.2015.7227049 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the help of an in-band full-duplex relay station, it is possible to
simultaneously transmit and receive signals from multiple users. The
performance of such system can be greatly increased when the relay station is
equipped with a large number of antennas on both transmitter and receiver
sides. In this paper, we... | [
{
"created": "Sat, 25 Apr 2015 18:39:57 GMT",
"version": "v1"
},
{
"created": "Tue, 12 May 2015 17:58:40 GMT",
"version": "v2"
}
] | 2016-11-17 | [
[
"Lemos",
"João S.",
""
],
[
"Rosário",
"Francisco",
""
],
[
"Monteiro",
"Francisco A.",
""
],
[
"Xavier",
"João",
""
],
[
"Rodrigues",
"António",
""
]
] | With the help of an in-band full-duplex relay station, it is possible to simultaneously transmit and receive signals from multiple users. The performance of such system can be greatly increased when the relay station is equipped with a large number of antennas on both transmitter and receiver sides. In this paper, we e... |
2404.14519 | Della Hendrickson | MIT Hardness Group, Della Hendrickson, Andy Tockman | Complexity of Planar Graph Orientation Consistency, Promise-Inference,
and Uniqueness, with Applications to Minesweeper Variants | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study three problems related to the computational complexity of the
popular game Minesweeper. The first is consistency: given a set of clues, is
there any arrangement of mines that satisfies it? This problem has been known
to be NP-complete since 2000, but our framework proves it as a side effect. The
second is in... | [
{
"created": "Mon, 22 Apr 2024 18:38:36 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"MIT Hardness Group",
"",
""
],
[
"Hendrickson",
"Della",
""
],
[
"Tockman",
"Andy",
""
]
] | We study three problems related to the computational complexity of the popular game Minesweeper. The first is consistency: given a set of clues, is there any arrangement of mines that satisfies it? This problem has been known to be NP-complete since 2000, but our framework proves it as a side effect. The second is infe... |
1711.09594 | Alan Lukezic | Alan Luke\v{z}i\v{c}, Luka \v{C}ehovin Zajc, Tom\'a\v{s} Voj\'i\v{r},
Ji\v{r}\'i Matas, Matej Kristan | FuCoLoT -- A Fully-Correlational Long-Term Tracker | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose FuCoLoT -- a Fully Correlational Long-term Tracker. It exploits
the novel DCF constrained filter learning method to design a detector that is
able to re-detect the target in the whole image efficiently. FuCoLoT maintains
several correlation filters trained on different time scales that act as the
detector ... | [
{
"created": "Mon, 27 Nov 2017 09:31:05 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Jan 2019 09:32:02 GMT",
"version": "v2"
}
] | 2019-01-15 | [
[
"Lukežič",
"Alan",
""
],
[
"Zajc",
"Luka Čehovin",
""
],
[
"Vojíř",
"Tomáš",
""
],
[
"Matas",
"Jiří",
""
],
[
"Kristan",
"Matej",
""
]
] | We propose FuCoLoT -- a Fully Correlational Long-term Tracker. It exploits the novel DCF constrained filter learning method to design a detector that is able to re-detect the target in the whole image efficiently. FuCoLoT maintains several correlation filters trained on different time scales that act as the detector co... |
2309.13939 | Irene Celino | Irene Celino and Heiko Paulheim | The Time Traveler's Guide to Semantic Web Research: Analyzing Fictitious
Research Themes in the ESWC "Next 20 Years" Track | 13 pages, 8 figures, 2 tables | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | What will Semantic Web research focus on in 20 years from now? We asked this
question to the community and collected their visions in the "Next 20 years"
track of ESWC 2023. We challenged the participants to submit "future" research
papers, as if they were submitting to the 2043 edition of the conference. The
submiss... | [
{
"created": "Mon, 25 Sep 2023 08:20:06 GMT",
"version": "v1"
}
] | 2023-09-26 | [
[
"Celino",
"Irene",
""
],
[
"Paulheim",
"Heiko",
""
]
] | What will Semantic Web research focus on in 20 years from now? We asked this question to the community and collected their visions in the "Next 20 years" track of ESWC 2023. We challenged the participants to submit "future" research papers, as if they were submitting to the 2043 edition of the conference. The submissio... |
2404.08888 | Yue Zhou | Yue Zhou, Barbara Di Eugenio, Brian Ziebart, Lisa Sharp, Bing Liu, Ben
Gerber, Nikolaos Agadakos and Shweta Yadav | Towards Enhancing Health Coaching Dialogue in Low-Resource Settings | Accepted to the main conference of COLING 2022 | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Health coaching helps patients identify and accomplish lifestyle-related
goals, effectively improving the control of chronic diseases and mitigating
mental health conditions. However, health coaching is cost-prohibitive due to
its highly personalized and labor-intensive nature. In this paper, we propose
to build a di... | [
{
"created": "Sat, 13 Apr 2024 03:23:15 GMT",
"version": "v1"
}
] | 2024-04-16 | [
[
"Zhou",
"Yue",
""
],
[
"Di Eugenio",
"Barbara",
""
],
[
"Ziebart",
"Brian",
""
],
[
"Sharp",
"Lisa",
""
],
[
"Liu",
"Bing",
""
],
[
"Gerber",
"Ben",
""
],
[
"Agadakos",
"Nikolaos",
""
],
[
"Yadav",
... | Health coaching helps patients identify and accomplish lifestyle-related goals, effectively improving the control of chronic diseases and mitigating mental health conditions. However, health coaching is cost-prohibitive due to its highly personalized and labor-intensive nature. In this paper, we propose to build a dial... |
2206.01010 | Weide Liu | Weide Liu, Zhonghua Wu, Yiming Wang, Henghui Ding, Fayao Liu, Jie Lin
and Guosheng Lin | Long-tailed Recognition by Learning from Latent Categories | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we address the challenging task of long-tailed image
recognition. Previous long-tailed recognition methods commonly focus on the
data augmentation or re-balancing strategy of the tail classes to give more
attention to tail classes during the model training. However, due to the
limited training images fo... | [
{
"created": "Thu, 2 Jun 2022 12:19:51 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Aug 2022 07:27:42 GMT",
"version": "v2"
},
{
"created": "Mon, 12 Sep 2022 07:05:51 GMT",
"version": "v3"
}
] | 2022-09-13 | [
[
"Liu",
"Weide",
""
],
[
"Wu",
"Zhonghua",
""
],
[
"Wang",
"Yiming",
""
],
[
"Ding",
"Henghui",
""
],
[
"Liu",
"Fayao",
""
],
[
"Lin",
"Jie",
""
],
[
"Lin",
"Guosheng",
""
]
] | In this work, we address the challenging task of long-tailed image recognition. Previous long-tailed recognition methods commonly focus on the data augmentation or re-balancing strategy of the tail classes to give more attention to tail classes during the model training. However, due to the limited training images for ... |
2209.10307 | Dong Zhang | Dong Zhang, Yi Lin, Hao Chen, Zhuotao Tian, Xin Yang, Jinhui Tang,
Kwang Ting Cheng | Understanding the Tricks of Deep Learning in Medical Image Segmentation:
Challenges and Future Directions | Under submission | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the past few years, the rapid development of deep learning technologies
for computer vision has significantly improved the performance of medical image
segmentation (MedISeg). However, the diverse implementation strategies of
various models have led to an extremely complex MedISeg system, resulting in a
potentia... | [
{
"created": "Wed, 21 Sep 2022 12:30:05 GMT",
"version": "v1"
},
{
"created": "Mon, 8 May 2023 10:23:24 GMT",
"version": "v2"
}
] | 2023-05-09 | [
[
"Zhang",
"Dong",
""
],
[
"Lin",
"Yi",
""
],
[
"Chen",
"Hao",
""
],
[
"Tian",
"Zhuotao",
""
],
[
"Yang",
"Xin",
""
],
[
"Tang",
"Jinhui",
""
],
[
"Cheng",
"Kwang Ting",
""
]
] | Over the past few years, the rapid development of deep learning technologies for computer vision has significantly improved the performance of medical image segmentation (MedISeg). However, the diverse implementation strategies of various models have led to an extremely complex MedISeg system, resulting in a potential ... |
1609.02305 | Klaus-Tycho Foerster | Klaus-Tycho Foerster, Stefan Schmid, Stefano Vissicchio | Survey of Consistent Software-Defined Network Updates | null | IEEE Communications Surveys & Tutorials 2019 | 10.1109/COMST.2018.2876749 | null | cs.NI cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computer networks have become a critical infrastructure. In fact, networks
should not only meet strict requirements in terms of correctness, availability,
and performance, but they should also be very flexible and support fast
updates, e.g., due to policy changes, increasing traffic, or failures. This
paper presents ... | [
{
"created": "Thu, 8 Sep 2016 07:34:39 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Feb 2018 15:42:18 GMT",
"version": "v2"
},
{
"created": "Tue, 26 Mar 2019 13:33:38 GMT",
"version": "v3"
}
] | 2019-03-27 | [
[
"Foerster",
"Klaus-Tycho",
""
],
[
"Schmid",
"Stefan",
""
],
[
"Vissicchio",
"Stefano",
""
]
] | Computer networks have become a critical infrastructure. In fact, networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be very flexible and support fast updates, e.g., due to policy changes, increasing traffic, or failures. This paper presents a ... |
1912.05291 | Michael Horowitz | Michael C. Horowitz, Paul Scharre, and Alexander Velez-Green | A Stable Nuclear Future? The Impact of Autonomous Systems and Artificial
Intelligence | null | null | null | null | cs.CY cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The potential for advances in information-age technologies to undermine
nuclear deterrence and influence the potential for nuclear escalation
represents a critical question for international politics. One challenge is
that uncertainty about the trajectory of technologies such as autonomous
systems and artificial inte... | [
{
"created": "Wed, 11 Dec 2019 13:35:36 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Dec 2019 18:37:36 GMT",
"version": "v2"
}
] | 2019-12-28 | [
[
"Horowitz",
"Michael C.",
""
],
[
"Scharre",
"Paul",
""
],
[
"Velez-Green",
"Alexander",
""
]
] | The potential for advances in information-age technologies to undermine nuclear deterrence and influence the potential for nuclear escalation represents a critical question for international politics. One challenge is that uncertainty about the trajectory of technologies such as autonomous systems and artificial intell... |
1904.00158 | Peipei Li | Peipei Li, Huaibo Huang, Yibo Hu, Xiang Wu, Ran He and Zhenan Sun | UVA: A Universal Variational Framework for Continuous Age Analysis | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Conventional methods for facial age analysis tend to utilize accurate age
labels in a supervised way. However, existing age datasets lies in a limited
range of ages, leading to a long-tailed distribution. To alleviate the problem,
this paper proposes a Universal Variational Aging (UVA) framework to formulate
facial a... | [
{
"created": "Sat, 30 Mar 2019 07:07:06 GMT",
"version": "v1"
}
] | 2019-04-02 | [
[
"Li",
"Peipei",
""
],
[
"Huang",
"Huaibo",
""
],
[
"Hu",
"Yibo",
""
],
[
"Wu",
"Xiang",
""
],
[
"He",
"Ran",
""
],
[
"Sun",
"Zhenan",
""
]
] | Conventional methods for facial age analysis tend to utilize accurate age labels in a supervised way. However, existing age datasets lies in a limited range of ages, leading to a long-tailed distribution. To alleviate the problem, this paper proposes a Universal Variational Aging (UVA) framework to formulate facial age... |
2309.08475 | Japneet Singh | Anuran Makur, Japneet Singh | Doeblin Coefficients and Related Measures | 26 pages, 1 figure | IEEE Transactions on Information Theory, vol. 70, no. 7, July 2024 | 10.1109/TIT.2024.3367856 | null | cs.IT math.IT math.PR math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Doeblin coefficients are a classical tool for analyzing the ergodicity and
exponential convergence rates of Markov chains. Propelled by recent works on
contraction coefficients of strong data processing inequalities, we investigate
whether Doeblin coefficients also exhibit some of the notable properties of
canonical ... | [
{
"created": "Fri, 15 Sep 2023 15:31:07 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Jul 2024 06:36:33 GMT",
"version": "v2"
}
] | 2024-07-03 | [
[
"Makur",
"Anuran",
""
],
[
"Singh",
"Japneet",
""
]
] | Doeblin coefficients are a classical tool for analyzing the ergodicity and exponential convergence rates of Markov chains. Propelled by recent works on contraction coefficients of strong data processing inequalities, we investigate whether Doeblin coefficients also exhibit some of the notable properties of canonical co... |
1307.8029 | EPTCS | Adel Bouhoula, Tetsuo Ida, Fairouz Kamareddine | Proceedings Fourth International Symposium on Symbolic Computation in
Software Science | null | EPTCS 122, 2013 | 10.4204/EPTCS.122 | null | cs.SC cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Symbolic computation is the science of computing with symbolic objects
(terms, formulae, programs, algebraic objects, geometrical objects, etc).
Powerful symbolic algorithms have been developed during the past decades and
have played an influential role in theorem proving, automated reasoning,
software verification, ... | [
{
"created": "Tue, 30 Jul 2013 16:01:33 GMT",
"version": "v1"
}
] | 2013-07-31 | [
[
"Bouhoula",
"Adel",
""
],
[
"Ida",
"Tetsuo",
""
],
[
"Kamareddine",
"Fairouz",
""
]
] | Symbolic computation is the science of computing with symbolic objects (terms, formulae, programs, algebraic objects, geometrical objects, etc). Powerful symbolic algorithms have been developed during the past decades and have played an influential role in theorem proving, automated reasoning, software verification, mo... |
1611.07610 | Marianna Rapoport | Marianna Rapoport and Ond\v{r}ej Lhot\'ak | Mutable WadlerFest DOT | null | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Dependent Object Types (DOT) calculus aims to model the essence of Scala,
with a focus on abstract type members, path-dependent types, and subtyping.
Other Scala features could be defined by translation to DOT. Mutation is a
fundamental feature of Scala currently missing in DOT. Mutation in DOT is
needed not only... | [
{
"created": "Wed, 23 Nov 2016 02:37:51 GMT",
"version": "v1"
}
] | 2016-11-24 | [
[
"Rapoport",
"Marianna",
""
],
[
"Lhoták",
"Ondřej",
""
]
] | The Dependent Object Types (DOT) calculus aims to model the essence of Scala, with a focus on abstract type members, path-dependent types, and subtyping. Other Scala features could be defined by translation to DOT. Mutation is a fundamental feature of Scala currently missing in DOT. Mutation in DOT is needed not only t... |
2108.07996 | Shubhangi Agarwal | Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya | VerSaChI: Finding Statistically Significant Subgraph Matches using
Chebyshev's Inequality | null | null | 10.1145/3459637.3482217 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Approximate subgraph matching, which is an important primitive for many
applications like question answering, community detection, and motif discovery,
often involves large labeled graphs such as knowledge graphs, social networks,
and protein sequences. Effective methods for extracting matching subgraphs, in
terms of... | [
{
"created": "Wed, 18 Aug 2021 06:53:39 GMT",
"version": "v1"
}
] | 2021-08-19 | [
[
"Agarwal",
"Shubhangi",
""
],
[
"Dutta",
"Sourav",
""
],
[
"Bhattacharya",
"Arnab",
""
]
] | Approximate subgraph matching, which is an important primitive for many applications like question answering, community detection, and motif discovery, often involves large labeled graphs such as knowledge graphs, social networks, and protein sequences. Effective methods for extracting matching subgraphs, in terms of l... |
1710.00208 | Mohammad Etemad | Mohammad Etemad and Alptekin K\"up\c{c}\"u and Charalampos Papamanthou
and David Evans | Efficient Dynamic Searchable Encryption with Forward Privacy | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Searchable symmetric encryption (SSE) enables a client to perform searches
over its outsourced encrypted files while preserving privacy of the files and
queries. Dynamic schemes, where files can be added or removed, leak more
information than static schemes. For dynamic schemes, forward privacy requires
that a newly ... | [
{
"created": "Sat, 30 Sep 2017 14:45:06 GMT",
"version": "v1"
}
] | 2017-10-03 | [
[
"Etemad",
"Mohammad",
""
],
[
"Küpçü",
"Alptekin",
""
],
[
"Papamanthou",
"Charalampos",
""
],
[
"Evans",
"David",
""
]
] | Searchable symmetric encryption (SSE) enables a client to perform searches over its outsourced encrypted files while preserving privacy of the files and queries. Dynamic schemes, where files can be added or removed, leak more information than static schemes. For dynamic schemes, forward privacy requires that a newly ad... |
1403.2009 | Olawale Hassan | Olawale Hassan (1), Iyad Kanj (1), Daniel Lokshtanov (2), and Ljubomir
Perkovi\'c (1) ((1) School of Computing, DePaul University, (2) Department of
Informatics, University of Bergen, Bergen, Norway) | On the Ordered List Subgraph Embedding Problems | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the (parameterized) Ordered List Subgraph Embedding problem (p-OLSE) we
are given two graphs $G$ and $H$, each with a linear order defined on its
vertices, a function $L$ that associates with every vertex in $G$ a list of
vertices in $H$, and a parameter $k$. The question is to decide if we can embed
(one-to-one) ... | [
{
"created": "Sat, 8 Mar 2014 22:10:25 GMT",
"version": "v1"
}
] | 2014-03-11 | [
[
"Hassan",
"Olawale",
""
],
[
"Kanj",
"Iyad",
""
],
[
"Lokshtanov",
"Daniel",
""
],
[
"Perković",
"Ljubomir",
""
]
] | In the (parameterized) Ordered List Subgraph Embedding problem (p-OLSE) we are given two graphs $G$ and $H$, each with a linear order defined on its vertices, a function $L$ that associates with every vertex in $G$ a list of vertices in $H$, and a parameter $k$. The question is to decide if we can embed (one-to-one) a ... |
2011.07631 | Debesh Jha | Debesh Jha, Sharib Ali, Nikhil Kumar Tomar, H{\aa}vard D. Johansen,
Dag D. Johansen, Jens Rittscher, Michael A. Riegler, and P{\aa}l Halvorsen | Real-Time Polyp Detection, Localization and Segmentation in Colonoscopy
Using Deep Learning | null | Published in: IEEE Access, Page(s): 40496 - 40510, Date of
Publication: 04 March 2021, Electronic ISSN: 2169-3536, PubMed ID: 33747684
Publisher: IEEE | 10.1109/ACCESS.2021.3063716 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Computer-aided detection, localisation, and segmentation methods can help
improve colonoscopy procedures. Even though many methods have been built to
tackle automatic detection and segmentation of polyps, benchmarking of
state-of-the-art methods still remains an open problem. This is due to the
increasing number of r... | [
{
"created": "Sun, 15 Nov 2020 21:14:50 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Mar 2021 20:21:06 GMT",
"version": "v2"
}
] | 2021-04-02 | [
[
"Jha",
"Debesh",
""
],
[
"Ali",
"Sharib",
""
],
[
"Tomar",
"Nikhil Kumar",
""
],
[
"Johansen",
"Håvard D.",
""
],
[
"Johansen",
"Dag D.",
""
],
[
"Rittscher",
"Jens",
""
],
[
"Riegler",
"Michael A.",
""
]... | Computer-aided detection, localisation, and segmentation methods can help improve colonoscopy procedures. Even though many methods have been built to tackle automatic detection and segmentation of polyps, benchmarking of state-of-the-art methods still remains an open problem. This is due to the increasing number of res... |
2408.00147 | Colin Shea-Blymyer | Colin Shea-Blymyer, Houssam Abbas | Formal Ethical Obligations in Reinforcement Learning Agents:
Verification and Policy Updates | null | null | null | null | cs.AI cs.LO | http://creativecommons.org/licenses/by-sa/4.0/ | When designing agents for operation in uncertain environments, designers need
tools to automatically reason about what agents ought to do, how that conflicts
with what is actually happening, and how a policy might be modified to remove
the conflict. These obligations include ethical and social obligations,
permission... | [
{
"created": "Wed, 31 Jul 2024 20:21:15 GMT",
"version": "v1"
}
] | 2024-08-02 | [
[
"Shea-Blymyer",
"Colin",
""
],
[
"Abbas",
"Houssam",
""
]
] | When designing agents for operation in uncertain environments, designers need tools to automatically reason about what agents ought to do, how that conflicts with what is actually happening, and how a policy might be modified to remove the conflict. These obligations include ethical and social obligations, permissions ... |
2008.06453 | Davide Ancona | Davide Ancona and Angelo Ferrando and Viviana Mascardi | Can determinism and compositionality coexist in RML? (extended version) | null | null | null | null | cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Runtime verification (RV) consists in dynamically verifying that the event
traces generated by single runs of a system under scrutiny (SUS) are compliant
with the formal specification of its expected properties. RML (Runtime
Monitoring Language) is a simple but expressive Domain Specific Language for
RV; its semantic... | [
{
"created": "Fri, 14 Aug 2020 16:33:36 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Aug 2020 15:24:13 GMT",
"version": "v2"
}
] | 2020-08-18 | [
[
"Ancona",
"Davide",
""
],
[
"Ferrando",
"Angelo",
""
],
[
"Mascardi",
"Viviana",
""
]
] | Runtime verification (RV) consists in dynamically verifying that the event traces generated by single runs of a system under scrutiny (SUS) are compliant with the formal specification of its expected properties. RML (Runtime Monitoring Language) is a simple but expressive Domain Specific Language for RV; its semantics ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.