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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1312.7444 | Narayan Chakraborty | Mohammad Jabed Morshed Chowdhury and Narayan Ranjan Chakraborty | CAPTCHA Based on Human Cognitive Factor | International Journal of Advanced Computer Science and Applications,
2013 | null | null | null | cs.HC cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A CAPTCHA (Completely Automated Public Turing test to tell Computers and
Humans Apart) is an automatic security mechanism used to determine whether the
user is a human or a malicious computer program. It is a program that generates
and grades tests that are human solvable, but intends to be beyond the
capabilities of... | [
{
"created": "Sat, 28 Dec 2013 15:28:23 GMT",
"version": "v1"
}
] | 2013-12-31 | [
[
"Chowdhury",
"Mohammad Jabed Morshed",
""
],
[
"Chakraborty",
"Narayan Ranjan",
""
]
] | A CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart) is an automatic security mechanism used to determine whether the user is a human or a malicious computer program. It is a program that generates and grades tests that are human solvable, but intends to be beyond the capabilities of c... |
2308.01262 | Michael Gableman | Michael Gableman and Avinash Kak | Incorporating Season and Solar Specificity into Renderings made by a
NeRF Architecture using Satellite Images | 18 pages, 17 figures, 10 tables | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a result of Shadow NeRF and Sat-NeRF, it is possible to take the solar
angle into account in a NeRF-based framework for rendering a scene from a novel
viewpoint using satellite images for training. Our work extends those
contributions and shows how one can make the renderings season-specific. Our
main challenge wa... | [
{
"created": "Wed, 2 Aug 2023 16:30:18 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Dec 2023 16:33:17 GMT",
"version": "v2"
}
] | 2023-12-18 | [
[
"Gableman",
"Michael",
""
],
[
"Kak",
"Avinash",
""
]
] | As a result of Shadow NeRF and Sat-NeRF, it is possible to take the solar angle into account in a NeRF-based framework for rendering a scene from a novel viewpoint using satellite images for training. Our work extends those contributions and shows how one can make the renderings season-specific. Our main challenge was ... |
2104.08817 | Javier Iranzo-S\'anchez | Javier Iranzo-S\'anchez and Jorge Civera and Alfons Juan | Stream-level Latency Evaluation for Simultaneous Machine Translation | EMNLP 2021 Camera Ready | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Simultaneous machine translation has recently gained traction thanks to
significant quality improvements and the advent of streaming applications.
Simultaneous translation systems need to find a trade-off between translation
quality and response time, and with this purpose multiple latency measures have
been proposed... | [
{
"created": "Sun, 18 Apr 2021 11:16:17 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Sep 2021 11:16:15 GMT",
"version": "v2"
}
] | 2021-09-09 | [
[
"Iranzo-Sánchez",
"Javier",
""
],
[
"Civera",
"Jorge",
""
],
[
"Juan",
"Alfons",
""
]
] | Simultaneous machine translation has recently gained traction thanks to significant quality improvements and the advent of streaming applications. Simultaneous translation systems need to find a trade-off between translation quality and response time, and with this purpose multiple latency measures have been proposed. ... |
2101.01298 | Pattaraporn Sangaroonsilp | Pattaraporn Sangaroonsilp, Hoa Khanh Dam, Morakot Choetkiertikul,
Chaiyong Ragkhitwetsagul, Aditya Ghose | A Taxonomy for Mining and Classifying Privacy Requirements in Issue
Reports | Accepted at Journal of Information and Software Technology | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Context: Digital and physical trails of user activities are collected over
the use of software applications and systems. As software becomes ubiquitous,
protecting user privacy has become challenging. With the increase of user
privacy awareness and advent of privacy regulations and policies, there is an
emerging need... | [
{
"created": "Tue, 5 Jan 2021 00:31:19 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Feb 2023 01:19:10 GMT",
"version": "v2"
}
] | 2023-02-07 | [
[
"Sangaroonsilp",
"Pattaraporn",
""
],
[
"Dam",
"Hoa Khanh",
""
],
[
"Choetkiertikul",
"Morakot",
""
],
[
"Ragkhitwetsagul",
"Chaiyong",
""
],
[
"Ghose",
"Aditya",
""
]
] | Context: Digital and physical trails of user activities are collected over the use of software applications and systems. As software becomes ubiquitous, protecting user privacy has become challenging. With the increase of user privacy awareness and advent of privacy regulations and policies, there is an emerging need t... |
1902.08726 | Zheng Yang | Zheng Yang, Hang Lei, Weizhong Qian | A Hybrid Formal Verification System in Coq for Ensuring the Reliability
and Security of Ethereum-based Service Smart Contracts | 29 pages, 28 figures, 5 tables | IEEE ACCESS (2020) | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper reports on the development of a formal symbolic process virtual
machine (FSPVM) denoted as FSPVM-E for verifying the reliability and security
of Ethereum-based services at the source code level of smart contracts, and a
Coq proof assistant is employed for both programming the system and for proving
its cor... | [
{
"created": "Sat, 23 Feb 2019 03:32:06 GMT",
"version": "v1"
},
{
"created": "Sat, 9 Mar 2019 04:49:24 GMT",
"version": "v2"
},
{
"created": "Thu, 23 Jan 2020 04:35:03 GMT",
"version": "v3"
}
] | 2020-01-24 | [
[
"Yang",
"Zheng",
""
],
[
"Lei",
"Hang",
""
],
[
"Qian",
"Weizhong",
""
]
] | This paper reports on the development of a formal symbolic process virtual machine (FSPVM) denoted as FSPVM-E for verifying the reliability and security of Ethereum-based services at the source code level of smart contracts, and a Coq proof assistant is employed for both programming the system and for proving its corre... |
1505.02445 | Tomaso Aste | Guido Previde Massara, T. Di Matteo, Tomaso Aste | Network Filtering for Big Data: Triangulated Maximally Filtered Graph | 16 pages, 7 Figures, 2 Tables | null | null | null | cs.DS cond-mat.stat-mech cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a network-filtering method, the Triangulated Maximally Filtered
Graph (TMFG), that provides an approximate solution to the Weighted Maximal
Planar Graph problem. The underlying idea of TMFG consists in building a
triangulation that maximizes a score function associated with the amount of
information retain... | [
{
"created": "Sun, 10 May 2015 21:47:38 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Aug 2015 16:02:37 GMT",
"version": "v2"
}
] | 2015-08-26 | [
[
"Massara",
"Guido Previde",
""
],
[
"Di Matteo",
"T.",
""
],
[
"Aste",
"Tomaso",
""
]
] | We propose a network-filtering method, the Triangulated Maximally Filtered Graph (TMFG), that provides an approximate solution to the Weighted Maximal Planar Graph problem. The underlying idea of TMFG consists in building a triangulation that maximizes a score function associated with the amount of information retained... |
2002.06851 | Diego Antognini | Diego Antognini, Boi Faltings | GameWikiSum: a Novel Large Multi-Document Summarization Dataset | 6 pages, 1 figure, 4 tables. Accepted at LREC 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Today's research progress in the field of multi-document summarization is
obstructed by the small number of available datasets. Since the acquisition of
reference summaries is costly, existing datasets contain only hundreds of
samples at most, resulting in heavy reliance on hand-crafted features or
necessitating addi... | [
{
"created": "Mon, 17 Feb 2020 09:25:19 GMT",
"version": "v1"
}
] | 2020-02-18 | [
[
"Antognini",
"Diego",
""
],
[
"Faltings",
"Boi",
""
]
] | Today's research progress in the field of multi-document summarization is obstructed by the small number of available datasets. Since the acquisition of reference summaries is costly, existing datasets contain only hundreds of samples at most, resulting in heavy reliance on hand-crafted features or necessitating additi... |
2006.07914 | Akbar Siami Namin | Moitrayee Chatterjee and Prerit Datta and Faranak Abri and Akbar Siami
Namin and Keith S. Jones | Cloud as an Attack Platform | null | null | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an exploratory study of responses from $75$ security professionals
and ethical hackers in order to understand how they abuse cloud platforms for
attack purposes. The participants were recruited at the Black Hat and DEF CON
conferences. We presented the participants' with various attack scenarios and
asked ... | [
{
"created": "Sun, 14 Jun 2020 14:32:45 GMT",
"version": "v1"
}
] | 2020-06-16 | [
[
"Chatterjee",
"Moitrayee",
""
],
[
"Datta",
"Prerit",
""
],
[
"Abri",
"Faranak",
""
],
[
"Namin",
"Akbar Siami",
""
],
[
"Jones",
"Keith S.",
""
]
] | We present an exploratory study of responses from $75$ security professionals and ethical hackers in order to understand how they abuse cloud platforms for attack purposes. The participants were recruited at the Black Hat and DEF CON conferences. We presented the participants' with various attack scenarios and asked th... |
2402.10781 | Wonjae Shin | Rohit Singh, Aryan Kaushik, Wonjae Shin, Marco Di Renzo, Vincenzo
Sciancalepore, Doohwan Lee, Hirofumi Sasaki, Arman Shojaeifard, and Octavia
A. Dobre | Towards 6G Evolution: Three Enhancements, Three Innovations, and Three
Major Challenges | 8 pages, 4 figures, 1 table | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Over the past few decades, wireless communication has witnessed remarkable
growth, experiencing several transformative changes. This article aims to
provide a comprehensive overview of wireless communication technologies, from
the foundations to the recent wireless advances. Specifically, we take a
neutral look at th... | [
{
"created": "Fri, 16 Feb 2024 16:04:32 GMT",
"version": "v1"
}
] | 2024-02-19 | [
[
"Singh",
"Rohit",
""
],
[
"Kaushik",
"Aryan",
""
],
[
"Shin",
"Wonjae",
""
],
[
"Di Renzo",
"Marco",
""
],
[
"Sciancalepore",
"Vincenzo",
""
],
[
"Lee",
"Doohwan",
""
],
[
"Sasaki",
"Hirofumi",
""
],
[
... | Over the past few decades, wireless communication has witnessed remarkable growth, experiencing several transformative changes. This article aims to provide a comprehensive overview of wireless communication technologies, from the foundations to the recent wireless advances. Specifically, we take a neutral look at the ... |
2209.01835 | Huiyuan Lai | Huiyuan Lai and Malvina Nissim | Multi-Figurative Language Generation | Accepted to COLING 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Figurative language generation is the task of reformulating a given text in
the desired figure of speech while still being faithful to the original
context. We take the first step towards multi-figurative language modelling by
providing a benchmark for the automatic generation of five common figurative
forms in Engli... | [
{
"created": "Mon, 5 Sep 2022 08:48:09 GMT",
"version": "v1"
}
] | 2022-09-07 | [
[
"Lai",
"Huiyuan",
""
],
[
"Nissim",
"Malvina",
""
]
] | Figurative language generation is the task of reformulating a given text in the desired figure of speech while still being faithful to the original context. We take the first step towards multi-figurative language modelling by providing a benchmark for the automatic generation of five common figurative forms in English... |
2408.04299 | Wei Li | Wan Li, Xinyun Zhong, Wei Li, Song Zhang, Moheng Rong, Yan Xi, Peng
Yuan, Zechen Wang, Xiaolei Jiang, Rongxi Yi, Hui Tang, Yang Chen, Chaohui
Tong, Zhan Wu, Feng Wang | Respiratory Subtraction for Pulmonary Microwave Ablation Evaluation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Currently, lung cancer is a leading cause of global cancer mortality, often
necessitating minimally invasive interventions. Microwave ablation (MWA) is
extensively utilized for both primary and secondary lung tumors. Although
numerous clinical guidelines and standards for MWA have been established, the
clinical evalu... | [
{
"created": "Thu, 8 Aug 2024 08:25:38 GMT",
"version": "v1"
}
] | 2024-08-09 | [
[
"Li",
"Wan",
""
],
[
"Zhong",
"Xinyun",
""
],
[
"Li",
"Wei",
""
],
[
"Zhang",
"Song",
""
],
[
"Rong",
"Moheng",
""
],
[
"Xi",
"Yan",
""
],
[
"Yuan",
"Peng",
""
],
[
"Wang",
"Zechen",
""
],... | Currently, lung cancer is a leading cause of global cancer mortality, often necessitating minimally invasive interventions. Microwave ablation (MWA) is extensively utilized for both primary and secondary lung tumors. Although numerous clinical guidelines and standards for MWA have been established, the clinical evaluat... |
2012.09692 | Marc Franco-Salvador | Sanja \v{S}tajner, Seren Yenikent and Marc Franco-Salvador | Five Psycholinguistic Characteristics for Better Interaction with Users | 26 pages, 4 figures | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When two people pay attention to each other and are interested in what the
other has to say or write, they almost instantly adapt their writing/speaking
style to match the other. For a successful interaction with a user, chatbots
and dialogue systems should be able to do the same. We propose a framework
consisting of... | [
{
"created": "Thu, 17 Dec 2020 16:00:08 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Dec 2020 10:43:04 GMT",
"version": "v2"
},
{
"created": "Fri, 8 Jan 2021 10:01:49 GMT",
"version": "v3"
},
{
"created": "Wed, 13 Jan 2021 10:06:15 GMT",
"version": "v4"
},
{
"cr... | 2022-03-22 | [
[
"Štajner",
"Sanja",
""
],
[
"Yenikent",
"Seren",
""
],
[
"Franco-Salvador",
"Marc",
""
]
] | When two people pay attention to each other and are interested in what the other has to say or write, they almost instantly adapt their writing/speaking style to match the other. For a successful interaction with a user, chatbots and dialogue systems should be able to do the same. We propose a framework consisting of f... |
2306.02361 | Ruichun Ma | Ruichun Ma, R. Ivan Zelaya, Wenjun Hu | Softly, Deftly, Scrolls Unfurl Their Splendor: Rolling Flexible Surfaces
for Wideband Wireless | null | null | 10.1145/3570361.3592520 | null | cs.NI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | With new frequency bands opening up, emerging wireless IoT devices are
capitalizing on an increasingly divergent range of frequencies. However,
existing coverage provisioning practice is often tied to specific standards and
frequencies. There is little shareable wireless infrastructure for concurrent
links on differe... | [
{
"created": "Sun, 4 Jun 2023 13:58:07 GMT",
"version": "v1"
}
] | 2023-06-06 | [
[
"Ma",
"Ruichun",
""
],
[
"Zelaya",
"R. Ivan",
""
],
[
"Hu",
"Wenjun",
""
]
] | With new frequency bands opening up, emerging wireless IoT devices are capitalizing on an increasingly divergent range of frequencies. However, existing coverage provisioning practice is often tied to specific standards and frequencies. There is little shareable wireless infrastructure for concurrent links on different... |
2205.15952 | Ankush Agarwal | Ankush Agarwal, Raj Gite, Shreya Laddha, Pushpak Bhattacharyya,
Satyanarayan Kar, Asif Ekbal, Prabhjit Thind, Rajesh Zele, Ravi Shankar | Knowledge Graph - Deep Learning: A Case Study in Question Answering in
Aviation Safety Domain | LREC 2022 Main Conference Accepted Paper | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the commercial aviation domain, there are a large number of documents,
like, accident reports (NTSB, ASRS) and regulatory directives (ADs). There is a
need for a system to access these diverse repositories efficiently in order to
service needs in the aviation industry, like maintenance, compliance, and
safety. In ... | [
{
"created": "Tue, 31 May 2022 16:49:55 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Jun 2022 18:50:18 GMT",
"version": "v2"
}
] | 2022-06-13 | [
[
"Agarwal",
"Ankush",
""
],
[
"Gite",
"Raj",
""
],
[
"Laddha",
"Shreya",
""
],
[
"Bhattacharyya",
"Pushpak",
""
],
[
"Kar",
"Satyanarayan",
""
],
[
"Ekbal",
"Asif",
""
],
[
"Thind",
"Prabhjit",
""
],
[
... | In the commercial aviation domain, there are a large number of documents, like, accident reports (NTSB, ASRS) and regulatory directives (ADs). There is a need for a system to access these diverse repositories efficiently in order to service needs in the aviation industry, like maintenance, compliance, and safety. In th... |
1202.6352 | Matthias Baaz | Matthias Baaz (Department of Discrete Mathematics and Geometry, TU
Vienna), Agata Ciabattoni (Department of Computer Languages, TU Vienna),
Christian G Ferm\"uller (Department of Computer Languages, TU Vienna) | Theorem proving for prenex G\"odel logic with Delta: checking validity
and unsatisfiability | 23 pages, accepted for LMCS (Logical Methods in Computer Science) | Logical Methods in Computer Science, Volume 8, Issue 1 (March 6,
2012) lmcs:833 | 10.2168/LMCS-8(1:20)2012 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | G\"odel logic with the projection operator Delta (G_Delta) is an important
many-valued as well as intermediate logic. In contrast to classical logic, the
validity and the satisfiability problems of G_Delta are not directly dual to
each other. We nevertheless provide a uniform, computational treatment of both
problems... | [
{
"created": "Tue, 28 Feb 2012 20:38:20 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Mar 2012 15:58:01 GMT",
"version": "v2"
}
] | 2015-07-01 | [
[
"Baaz",
"Matthias",
"",
"Department of Discrete Mathematics and Geometry, TU\n Vienna"
],
[
"Ciabattoni",
"Agata",
"",
"Department of Computer Languages, TU Vienna"
],
[
"Fermüller",
"Christian G",
"",
"Department of Computer Languages, TU Vienna"
]
] | G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each other. We nevertheless provide a uniform, computational treatment of both problems f... |
2310.14189 | Yang Song | Yang Song and Prafulla Dhariwal | Improved Techniques for Training Consistency Models | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consistency models are a nascent family of generative models that can sample
high quality data in one step without the need for adversarial training.
Current consistency models achieve optimal sample quality by distilling from
pre-trained diffusion models and employing learned metrics such as LPIPS.
However, distilla... | [
{
"created": "Sun, 22 Oct 2023 05:33:38 GMT",
"version": "v1"
}
] | 2023-10-24 | [
[
"Song",
"Yang",
""
],
[
"Dhariwal",
"Prafulla",
""
]
] | Consistency models are a nascent family of generative models that can sample high quality data in one step without the need for adversarial training. Current consistency models achieve optimal sample quality by distilling from pre-trained diffusion models and employing learned metrics such as LPIPS. However, distillati... |
2002.09554 | Ziyuan Liu | Ziyuan Liu, Dongheui Lee, Wolfgang Sepp | Particle Filter Based Monocular Human Tracking with a 3D Cardbox Model
and a Novel Deterministic Resampling Strategy | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The challenge of markerless human motion tracking is the high dimensionality
of the search space. Thus, efficient exploration in the search space is of
great significance. In this paper, a motion capturing algorithm is proposed for
upper body motion tracking. The proposed system tracks human motion based on
monocular... | [
{
"created": "Fri, 21 Feb 2020 21:21:58 GMT",
"version": "v1"
}
] | 2020-02-25 | [
[
"Liu",
"Ziyuan",
""
],
[
"Lee",
"Dongheui",
""
],
[
"Sepp",
"Wolfgang",
""
]
] | The challenge of markerless human motion tracking is the high dimensionality of the search space. Thus, efficient exploration in the search space is of great significance. In this paper, a motion capturing algorithm is proposed for upper body motion tracking. The proposed system tracks human motion based on monocular s... |
2207.06574 | William Mansky | William Mansky | Bringing Iris into the Verified Software Toolchain | 21 pages, 4 figures | null | null | null | cs.PL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The Verified Software Toolchain (VST) is a system for proving correctness of
C programs using separation logic. By connecting to the verified compiler
CompCert, it produces the strongest possible guarantees of correctness for real
C code that we can compile and run. VST included concurrency from its
inception, in the... | [
{
"created": "Thu, 14 Jul 2022 00:34:52 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Jul 2022 15:48:22 GMT",
"version": "v2"
}
] | 2022-07-18 | [
[
"Mansky",
"William",
""
]
] | The Verified Software Toolchain (VST) is a system for proving correctness of C programs using separation logic. By connecting to the verified compiler CompCert, it produces the strongest possible guarantees of correctness for real C code that we can compile and run. VST included concurrency from its inception, in the f... |
1205.1331 | Thomas Kesselheim | Thomas Kesselheim | Approximation Algorithms for Wireless Link Scheduling with Flexible Data
Rates | null | null | null | null | cs.NI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider scheduling problems in wireless networks with respect to flexible
data rates. That is, more or less data can be transmitted per time depending on
the signal quality, which is determined by the
signal-to-interference-plus-noise ratio (SINR). Each wireless link has a
utility function mapping SINR values to ... | [
{
"created": "Mon, 7 May 2012 10:18:24 GMT",
"version": "v1"
}
] | 2012-05-08 | [
[
"Kesselheim",
"Thomas",
""
]
] | We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise ratio (SINR). Each wireless link has a utility function mapping SINR values to th... |
2407.21264 | Alimohammad Beigi | Alimohammad Beigi, Zhen Tan, Nivedh Mudiam, Canyu Chen, Kai Shu and
Huan Liu | Model Attribution in LLM-Generated Disinformation: A Domain
Generalization Approach with Supervised Contrastive Learning | 10 pages, 2 figures, accepted at DSAA 2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model attribution for LLM-generated disinformation poses a significant
challenge in understanding its origins and mitigating its spread. This task is
especially challenging because modern large language models (LLMs) produce
disinformation with human-like quality. Additionally, the diversity in
prompting methods used... | [
{
"created": "Wed, 31 Jul 2024 00:56:09 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Aug 2024 08:10:43 GMT",
"version": "v2"
}
] | 2024-08-15 | [
[
"Beigi",
"Alimohammad",
""
],
[
"Tan",
"Zhen",
""
],
[
"Mudiam",
"Nivedh",
""
],
[
"Chen",
"Canyu",
""
],
[
"Shu",
"Kai",
""
],
[
"Liu",
"Huan",
""
]
] | Model attribution for LLM-generated disinformation poses a significant challenge in understanding its origins and mitigating its spread. This task is especially challenging because modern large language models (LLMs) produce disinformation with human-like quality. Additionally, the diversity in prompting methods used t... |
2012.13227 | Rahul Bhadani | Rahul Bhadani | Path Planning of Unmanned System using Carrot-chasing Algorithm | null | null | null | null | cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | When an unmanned system is launched for a mission-critical task, it is
required to follow a predetermined path. It means the unmanned system requires
a path following algorithm for the completion of the mission. Since the
predetermined path is typically given by a set of data-points, not only the
curvature and deriva... | [
{
"created": "Thu, 24 Dec 2020 12:47:37 GMT",
"version": "v1"
}
] | 2020-12-25 | [
[
"Bhadani",
"Rahul",
""
]
] | When an unmanned system is launched for a mission-critical task, it is required to follow a predetermined path. It means the unmanned system requires a path following algorithm for the completion of the mission. Since the predetermined path is typically given by a set of data-points, not only the curvature and derivati... |
2310.01415 | Jiageng Mao | Jiageng Mao, Yuxi Qian, Junjie Ye, Hang Zhao, Yue Wang | GPT-Driver: Learning to Drive with GPT | NeurIPS 2023 Foundation Models for Decision Making Workshop | null | null | null | cs.CV cs.AI cs.CL cs.RO | http://creativecommons.org/licenses/by/4.0/ | We present a simple yet effective approach that can transform the OpenAI
GPT-3.5 model into a reliable motion planner for autonomous vehicles. Motion
planning is a core challenge in autonomous driving, aiming to plan a driving
trajectory that is safe and comfortable. Existing motion planners predominantly
leverage he... | [
{
"created": "Mon, 2 Oct 2023 17:59:57 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Oct 2023 18:33:10 GMT",
"version": "v2"
},
{
"created": "Tue, 5 Dec 2023 05:26:29 GMT",
"version": "v3"
}
] | 2023-12-06 | [
[
"Mao",
"Jiageng",
""
],
[
"Qian",
"Yuxi",
""
],
[
"Ye",
"Junjie",
""
],
[
"Zhao",
"Hang",
""
],
[
"Wang",
"Yue",
""
]
] | We present a simple yet effective approach that can transform the OpenAI GPT-3.5 model into a reliable motion planner for autonomous vehicles. Motion planning is a core challenge in autonomous driving, aiming to plan a driving trajectory that is safe and comfortable. Existing motion planners predominantly leverage heur... |
1708.03324 | Mohammad Dehghani Soltani | Mohammad Dehghani Soltani, Xiping Wu, Majid Safari, and Harald Haas | Bidirectional User Throughput Maximization Based on Feedback Reduction
in LiFi Networks | 30 pages, 9 figures, submitted to IEEE Transactions on Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Channel adaptive signalling, which is based on feedback, can result in almost
any performance metric enhancement. Unlike the radio frequency (RF) channel,
the optical wireless communications (OWCs) channel is fairly static. This
feature enables a potential improvement of the bidirectional user throughput by
reducing ... | [
{
"created": "Thu, 10 Aug 2017 11:06:10 GMT",
"version": "v1"
}
] | 2017-08-14 | [
[
"Soltani",
"Mohammad Dehghani",
""
],
[
"Wu",
"Xiping",
""
],
[
"Safari",
"Majid",
""
],
[
"Haas",
"Harald",
""
]
] | Channel adaptive signalling, which is based on feedback, can result in almost any performance metric enhancement. Unlike the radio frequency (RF) channel, the optical wireless communications (OWCs) channel is fairly static. This feature enables a potential improvement of the bidirectional user throughput by reducing th... |
1911.07418 | Dian Ang Yap | Dian Ang Yap, Nicholas Roberts, Vinay Uday Prabhu | Grassmannian Packings in Neural Networks: Learning with Maximal Subspace
Packings for Diversity and Anti-Sparsity | Presented at Bayesian Deep Learning and Workshop on Information
Theory and Machine Learning, 33rd Conference on Neural Information
ProcessingSystems (NeurIPS 2019), Vancouver, Canada | null | null | null | cs.LG cs.IT math.IT stat.ML | http://creativecommons.org/publicdomain/zero/1.0/ | Kernel sparsity ("dying ReLUs") and lack of diversity are commonly observed
in CNN kernels, which decreases model capacity. Drawing inspiration from
information theory and wireless communications, we demonstrate the intersection
of coding theory and deep learning through the Grassmannian subspace packing
problem in C... | [
{
"created": "Mon, 18 Nov 2019 04:17:06 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Yap",
"Dian Ang",
""
],
[
"Roberts",
"Nicholas",
""
],
[
"Prabhu",
"Vinay Uday",
""
]
] | Kernel sparsity ("dying ReLUs") and lack of diversity are commonly observed in CNN kernels, which decreases model capacity. Drawing inspiration from information theory and wireless communications, we demonstrate the intersection of coding theory and deep learning through the Grassmannian subspace packing problem in CNN... |
2103.03700 | Alexander Sutherland | A. Sutherland, S. Magg, C. Weber, S. Wermter | Analyzing the Influence of Dataset Composition for Emotion Recognition | 2 pages, 2 figures, presented at IROS 2018 Workshop on Language and
Robotics | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Recognizing emotions from text in multimodal architectures has yielded
promising results, surpassing video and audio modalities under certain
circumstances. However, the method by which multimodal data is collected can be
significant for recognizing emotional features in language. In this paper, we
address the influe... | [
{
"created": "Fri, 5 Mar 2021 14:20:59 GMT",
"version": "v1"
}
] | 2021-03-08 | [
[
"Sutherland",
"A.",
""
],
[
"Magg",
"S.",
""
],
[
"Weber",
"C.",
""
],
[
"Wermter",
"S.",
""
]
] | Recognizing emotions from text in multimodal architectures has yielded promising results, surpassing video and audio modalities under certain circumstances. However, the method by which multimodal data is collected can be significant for recognizing emotional features in language. In this paper, we address the influenc... |
2309.11177 | Qian Zhao | Qian Zhao and Zhengwei Wu and Zhiqiang Zhang and Jun Zhou | Long-tail Augmented Graph Contrastive Learning for Recommendation | 17 pages, 6 figures, accepted by ECML/PKDD 2023 (European Conference
on Machine Learning and Principles and Practice of Knowledge Discovery in
Databases) | null | null | null | cs.IR cs.AI cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Convolutional Networks (GCNs) has demonstrated promising results for
recommender systems, as they can effectively leverage high-order relationship.
However, these methods usually encounter data sparsity issue in real-world
scenarios. To address this issue, GCN-based recommendation methods employ
contrastive lea... | [
{
"created": "Wed, 20 Sep 2023 09:57:20 GMT",
"version": "v1"
}
] | 2023-09-21 | [
[
"Zhao",
"Qian",
""
],
[
"Wu",
"Zhengwei",
""
],
[
"Zhang",
"Zhiqiang",
""
],
[
"Zhou",
"Jun",
""
]
] | Graph Convolutional Networks (GCNs) has demonstrated promising results for recommender systems, as they can effectively leverage high-order relationship. However, these methods usually encounter data sparsity issue in real-world scenarios. To address this issue, GCN-based recommendation methods employ contrastive learn... |
2210.16508 | Yuhe Guo | Yuhe Guo and Zhewei Wei | Clenshaw Graph Neural Networks | 10 pages, 2 figures | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Graph Convolutional Networks (GCNs), which use a message-passing paradigm
with stacked convolution layers, are foundational methods for learning graph
representations. Recent GCN models use various residual connection techniques
to alleviate the model degradation problem such as over-smoothing and gradient
vanishing.... | [
{
"created": "Sat, 29 Oct 2022 06:32:39 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Nov 2022 14:30:56 GMT",
"version": "v2"
}
] | 2022-11-04 | [
[
"Guo",
"Yuhe",
""
],
[
"Wei",
"Zhewei",
""
]
] | Graph Convolutional Networks (GCNs), which use a message-passing paradigm with stacked convolution layers, are foundational methods for learning graph representations. Recent GCN models use various residual connection techniques to alleviate the model degradation problem such as over-smoothing and gradient vanishing. E... |
1506.00677 | Katarzyna Paluch | Pratik Ghosal and Adam Kunysz and Katarzyna Paluch | Characterisation of Strongly Stable Matchings | null | null | null | null | cs.DS cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An instance of a strongly stable matching problem (SSMP) is an undirected
bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being
a linearly ordered list of ties, which are subsets of vertices equally good for
a given vertex. Ties are disjoint and may contain one vertex. A matching $M$ is
a set... | [
{
"created": "Mon, 1 Jun 2015 21:25:24 GMT",
"version": "v1"
}
] | 2015-06-03 | [
[
"Ghosal",
"Pratik",
""
],
[
"Kunysz",
"Adam",
""
],
[
"Paluch",
"Katarzyna",
""
]
] | An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given vertex. Ties are disjoint and may contain one vertex. A matching $M$ is a set o... |
2305.09477 | Uwe Peters | Uwe Peters, Mary Carman | Unjustified Sample Sizes and Generalizations in Explainable AI Research:
Principles for More Inclusive User Studies | 3 tables, 1 figure | null | null | null | cs.AI cs.HC | http://creativecommons.org/licenses/by/4.0/ | Many ethical frameworks require artificial intelligence (AI) systems to be
explainable. Explainable AI (XAI) models are frequently tested for their
adequacy in user studies. Since different people may have different explanatory
needs, it is important that participant samples in user studies are large
enough to repres... | [
{
"created": "Mon, 8 May 2023 15:02:21 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Oct 2023 19:20:20 GMT",
"version": "v2"
}
] | 2023-10-17 | [
[
"Peters",
"Uwe",
""
],
[
"Carman",
"Mary",
""
]
] | Many ethical frameworks require artificial intelligence (AI) systems to be explainable. Explainable AI (XAI) models are frequently tested for their adequacy in user studies. Since different people may have different explanatory needs, it is important that participant samples in user studies are large enough to represen... |
2301.08412 | Zhuo Zhao | Zhuo Zhao | Fair Credit Scorer through Bayesian Approach | null | null | null | null | cs.LG cs.CY | http://creativecommons.org/licenses/by/4.0/ | Machine learning currently plays an increasingly important role in people's
lives in areas such as credit scoring, auto-driving, disease diagnosing, and
insurance quoting. However, in many of these areas, machine learning models
have performed unfair behaviors against some sub-populations, such as some
particular gro... | [
{
"created": "Fri, 20 Jan 2023 03:35:03 GMT",
"version": "v1"
}
] | 2023-01-23 | [
[
"Zhao",
"Zhuo",
""
]
] | Machine learning currently plays an increasingly important role in people's lives in areas such as credit scoring, auto-driving, disease diagnosing, and insurance quoting. However, in many of these areas, machine learning models have performed unfair behaviors against some sub-populations, such as some particular group... |
2311.03312 | Qitao Zhao | Qitao Zhao, Ce Zheng, Mengyuan Liu, Chen Chen | A Single 2D Pose with Context is Worth Hundreds for 3D Human Pose
Estimation | Accepted to NeurIPS 2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dominant paradigm in 3D human pose estimation that lifts a 2D pose
sequence to 3D heavily relies on long-term temporal clues (i.e., using a
daunting number of video frames) for improved accuracy, which incurs
performance saturation, intractable computation and the non-causal problem.
This can be attributed to the... | [
{
"created": "Mon, 6 Nov 2023 18:04:13 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Nov 2023 04:51:34 GMT",
"version": "v2"
}
] | 2023-11-10 | [
[
"Zhao",
"Qitao",
""
],
[
"Zheng",
"Ce",
""
],
[
"Liu",
"Mengyuan",
""
],
[
"Chen",
"Chen",
""
]
] | The dominant paradigm in 3D human pose estimation that lifts a 2D pose sequence to 3D heavily relies on long-term temporal clues (i.e., using a daunting number of video frames) for improved accuracy, which incurs performance saturation, intractable computation and the non-causal problem. This can be attributed to their... |
1909.05233 | Ankur Mali | Ankur Mali, Alexander Ororbia, C. Lee Giles | The Neural State Pushdown Automata | 10 pages, 7 Table, 1 figure | null | null | null | cs.NE cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | In order to learn complex grammars, recurrent neural networks (RNNs) require
sufficient computational resources to ensure correct grammar recognition. A
widely-used approach to expand model capacity would be to couple an RNN to an
external memory stack. Here, we introduce a "neural state" pushdown automaton
(NSPDA), ... | [
{
"created": "Sat, 7 Sep 2019 00:32:11 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Sep 2019 20:12:33 GMT",
"version": "v2"
}
] | 2019-09-23 | [
[
"Mali",
"Ankur",
""
],
[
"Ororbia",
"Alexander",
""
],
[
"Giles",
"C. Lee",
""
]
] | In order to learn complex grammars, recurrent neural networks (RNNs) require sufficient computational resources to ensure correct grammar recognition. A widely-used approach to expand model capacity would be to couple an RNN to an external memory stack. Here, we introduce a "neural state" pushdown automaton (NSPDA), wh... |
2004.04139 | Xi Liang | Xi Liang, Zechao Shang, Aaron J. Elmore, Sanjay Krishnan, Michael J.
Franklin | Fast and Reliable Missing Data Contingency Analysis with
Predicate-Constraints | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Today, data analysts largely rely on intuition to determine whether missing
or withheld rows of a dataset significantly affect their analyses. We propose a
framework that can produce automatic contingency analysis, i.e., the range of
values an aggregate SQL query could take, under formal constraints describing
the va... | [
{
"created": "Wed, 8 Apr 2020 17:50:18 GMT",
"version": "v1"
}
] | 2020-04-09 | [
[
"Liang",
"Xi",
""
],
[
"Shang",
"Zechao",
""
],
[
"Elmore",
"Aaron J.",
""
],
[
"Krishnan",
"Sanjay",
""
],
[
"Franklin",
"Michael J.",
""
]
] | Today, data analysts largely rely on intuition to determine whether missing or withheld rows of a dataset significantly affect their analyses. We propose a framework that can produce automatic contingency analysis, i.e., the range of values an aggregate SQL query could take, under formal constraints describing the vari... |
1810.08988 | Nora Connor | Nora Connor and Aaron Clauset | Predicting the outcomes of policy diffusion from U.S. states to federal
law | null | null | null | null | cs.CY physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the United States, national policies often begin as state laws, which then
spread from state to state until they gain momentum to become enacted as a
national policy. However, not every state policy reaches the national level.
Previous work has suggested that state-level policies are more likely to become
national... | [
{
"created": "Sun, 21 Oct 2018 16:51:00 GMT",
"version": "v1"
}
] | 2018-10-23 | [
[
"Connor",
"Nora",
""
],
[
"Clauset",
"Aaron",
""
]
] | In the United States, national policies often begin as state laws, which then spread from state to state until they gain momentum to become enacted as a national policy. However, not every state policy reaches the national level. Previous work has suggested that state-level policies are more likely to become national p... |
cs/0608079 | Anna Gilbert | A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin | Algorithmic linear dimension reduction in the l_1 norm for sparse
vectors | null | null | null | null | cs.DS | null | This paper develops a new method for recovering m-sparse signals that is
simultaneously uniform and quick. We present a reconstruction algorithm whose
run time, O(m log^2(m) log^2(d)), is sublinear in the length d of the signal.
The reconstruction error is within a logarithmic factor (in m) of the optimal
m-term appr... | [
{
"created": "Sat, 19 Aug 2006 01:55:14 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Gilbert",
"A. C.",
""
],
[
"Strauss",
"M. J.",
""
],
[
"Tropp",
"J. A.",
""
],
[
"Vershynin",
"R.",
""
]
] | This paper develops a new method for recovering m-sparse signals that is simultaneously uniform and quick. We present a reconstruction algorithm whose run time, O(m log^2(m) log^2(d)), is sublinear in the length d of the signal. The reconstruction error is within a logarithmic factor (in m) of the optimal m-term approx... |
1707.08238 | Jieming Mao | Xi Chen, Yuanzhi Li, Jieming Mao | A Nearly Instance Optimal Algorithm for Top-k Ranking under the
Multinomial Logit Model | null | null | null | null | cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the active learning problem of top-$k$ ranking from multi-wise
comparisons under the popular multinomial logit model. Our goal is to identify
the top-$k$ items with high probability by adaptively querying sets for
comparisons and observing the noisy output of the most preferred item from each
comparison. To ... | [
{
"created": "Tue, 25 Jul 2017 22:03:21 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Jul 2017 14:44:22 GMT",
"version": "v2"
}
] | 2017-08-01 | [
[
"Chen",
"Xi",
""
],
[
"Li",
"Yuanzhi",
""
],
[
"Mao",
"Jieming",
""
]
] | We study the active learning problem of top-$k$ ranking from multi-wise comparisons under the popular multinomial logit model. Our goal is to identify the top-$k$ items with high probability by adaptively querying sets for comparisons and observing the noisy output of the most preferred item from each comparison. To ac... |
1501.02825 | Sven Bambach | Sven Bambach | A Survey on Recent Advances of Computer Vision Algorithms for Egocentric
Video | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent technological advances have made lightweight, head mounted cameras
both practical and affordable and products like Google Glass show first
approaches to introduce the idea of egocentric (first-person) video to the
mainstream. Interestingly, the computer vision community has only recently
started to explore thi... | [
{
"created": "Mon, 12 Jan 2015 21:14:56 GMT",
"version": "v1"
}
] | 2015-01-14 | [
[
"Bambach",
"Sven",
""
]
] | Recent technological advances have made lightweight, head mounted cameras both practical and affordable and products like Google Glass show first approaches to introduce the idea of egocentric (first-person) video to the mainstream. Interestingly, the computer vision community has only recently started to explore this ... |
2404.09263 | Jin Yang | Jin Yang, Ping Wei, Huan Li, Ziyang Ren | Task-Driven Exploration: Decoupling and Inter-Task Feedback for Joint
Moment Retrieval and Highlight Detection | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Video moment retrieval and highlight detection are two highly valuable tasks
in video understanding, but until recently they have been jointly studied.
Although existing studies have made impressive advancement recently, they
predominantly follow the data-driven bottom-up paradigm. Such paradigm
overlooks task-specif... | [
{
"created": "Sun, 14 Apr 2024 14:06:42 GMT",
"version": "v1"
}
] | 2024-05-09 | [
[
"Yang",
"Jin",
""
],
[
"Wei",
"Ping",
""
],
[
"Li",
"Huan",
""
],
[
"Ren",
"Ziyang",
""
]
] | Video moment retrieval and highlight detection are two highly valuable tasks in video understanding, but until recently they have been jointly studied. Although existing studies have made impressive advancement recently, they predominantly follow the data-driven bottom-up paradigm. Such paradigm overlooks task-specific... |
1402.1296 | Tiago Guerreiro | Ricardo Jo\~ao Silveira Santos Gamboa | Mnemonical Body Shortcuts: Gestural Interface for Mobile Devices | 124 pages, MSc Thesis, Technical University of Lisbon | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile devices' user interfaces are still quite similar to traditional
interfaces offered by desktop computers, but those can be highly problematic
when used in a mobile context. Human gesture recognition in mobile interaction
appears as an important area to provide suitable on-the-move usability. We
present a body s... | [
{
"created": "Thu, 6 Feb 2014 09:54:25 GMT",
"version": "v1"
}
] | 2014-02-07 | [
[
"Gamboa",
"Ricardo João Silveira Santos",
""
]
] | Mobile devices' user interfaces are still quite similar to traditional interfaces offered by desktop computers, but those can be highly problematic when used in a mobile context. Human gesture recognition in mobile interaction appears as an important area to provide suitable on-the-move usability. We present a body spa... |
1807.06397 | Ronald de Haan | Ronald de Haan | Expressing Linear Orders Requires Exponential-Size DNNFs | null | null | null | null | cs.CC cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that any DNNF circuit that expresses the set of linear orders over a
set of $n$ candidates must be of size $2^{\Omega(n)}$. Moreover, we show that
there exist DNNF circuits of size $2^{O(n)}$ expressing linear orders over $n$
candidates.
| [
{
"created": "Tue, 17 Jul 2018 13:02:55 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Jul 2018 15:45:40 GMT",
"version": "v2"
},
{
"created": "Thu, 30 May 2019 12:15:48 GMT",
"version": "v3"
}
] | 2019-05-31 | [
[
"de Haan",
"Ronald",
""
]
] | We show that any DNNF circuit that expresses the set of linear orders over a set of $n$ candidates must be of size $2^{\Omega(n)}$. Moreover, we show that there exist DNNF circuits of size $2^{O(n)}$ expressing linear orders over $n$ candidates. |
2102.07437 | Chengyu Dong | Chengyu Dong, Liyuan Liu, Jingbo Shang | Data Quality Matters For Adversarial Training: An Empirical Study | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multiple intriguing problems are hovering in adversarial training, including
robust overfitting, robustness overestimation, and robustness-accuracy
trade-off. These problems pose great challenges to both reliable evaluation and
practical deployment. Here, we empirically show that these problems share one
common cause... | [
{
"created": "Mon, 15 Feb 2021 10:17:24 GMT",
"version": "v1"
},
{
"created": "Thu, 10 Jun 2021 22:33:20 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Oct 2021 01:00:51 GMT",
"version": "v3"
}
] | 2021-10-08 | [
[
"Dong",
"Chengyu",
""
],
[
"Liu",
"Liyuan",
""
],
[
"Shang",
"Jingbo",
""
]
] | Multiple intriguing problems are hovering in adversarial training, including robust overfitting, robustness overestimation, and robustness-accuracy trade-off. These problems pose great challenges to both reliable evaluation and practical deployment. Here, we empirically show that these problems share one common cause -... |
1303.1119 | Zungeru Adamu Murtala | A.M. Zungeru, L.-M. Ang, K.P. Seng | Termite-hill: From natural to artificial termites in sensor networks | 26 pages, 4 figures | A.M. Zungeru, L.-M. Ang, K.P. Seng. Termite-hill: From Natural to
Artificial Termites in Sensor Networks, International Journal of Swarm
Intelligence Research (IGI-Publishers), vol. 3(4), pp. 1-23, 2012 | 10.4018/jsir.2012100101 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Termites present a very good natural metaphor to evolutionary computation.
While each individuals computational power is small compared to more evolved
species, it is the power of their colonies that inspires communication
engineers. This paper presents a study of artificial termites in sensor
networks for the purpos... | [
{
"created": "Tue, 5 Mar 2013 17:58:29 GMT",
"version": "v1"
}
] | 2013-03-06 | [
[
"Zungeru",
"A. M.",
""
],
[
"Ang",
"L. -M.",
""
],
[
"Seng",
"K. P.",
""
]
] | Termites present a very good natural metaphor to evolutionary computation. While each individuals computational power is small compared to more evolved species, it is the power of their colonies that inspires communication engineers. This paper presents a study of artificial termites in sensor networks for the purpose ... |
1007.3611 | Jaroslaw Byrka | Jaroslaw Byrka and MohammadReza Ghodsi and Aravind Srinivasan | LP-rounding algorithms for facility-location problems | Added funding information | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study LP-rounding approximation algorithms for metric uncapacitated
facility-location problems. We first give a new analysis for the algorithm of
Chudak and Shmoys, which differs from the analysis of Byrka and Aardal in that
now we do not need any bound based on the solution to the dual LP program.
Besides obtaini... | [
{
"created": "Wed, 21 Jul 2010 10:48:52 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Mar 2012 13:50:59 GMT",
"version": "v2"
}
] | 2012-03-09 | [
[
"Byrka",
"Jaroslaw",
""
],
[
"Ghodsi",
"MohammadReza",
""
],
[
"Srinivasan",
"Aravind",
""
]
] | We study LP-rounding approximation algorithms for metric uncapacitated facility-location problems. We first give a new analysis for the algorithm of Chudak and Shmoys, which differs from the analysis of Byrka and Aardal in that now we do not need any bound based on the solution to the dual LP program. Besides obtaining... |
2110.10966 | Matthew Howe Mr | Matthew Howe, Ian Reid, Jamie Mackenzie | Weakly Supervised Training of Monocular 3D Object Detectors Using Wide
Baseline Multi-view Traffic Camera Data | Paper accepted at The 32nd British Machine Vision Conference, BMVC
2021 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Accurate 7DoF prediction of vehicles at an intersection is an important task
for assessing potential conflicts between road users. In principle, this could
be achieved by a single camera system that is capable of detecting the pose of
each vehicle but this would require a large, accurately labelled dataset from
which... | [
{
"created": "Thu, 21 Oct 2021 08:26:48 GMT",
"version": "v1"
}
] | 2022-11-30 | [
[
"Howe",
"Matthew",
""
],
[
"Reid",
"Ian",
""
],
[
"Mackenzie",
"Jamie",
""
]
] | Accurate 7DoF prediction of vehicles at an intersection is an important task for assessing potential conflicts between road users. In principle, this could be achieved by a single camera system that is capable of detecting the pose of each vehicle but this would require a large, accurately labelled dataset from which t... |
2001.03924 | Ivan Petrenko | Ivan Petrenko | An improvement of the upper bound for GKS communication game | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The GKS game was formulated by Justin Gilmer, Michal Koucky, and Michael Saks
in their research of the sensitivity conjecture. Mario Szegedy invented a
protocol for the game with the cost of $O(n^{0.4732})$. Then a protocol with
the cost of $O(n^{0.4696})$ was obtained by DeVon Ingram who used a bipartite
matching. W... | [
{
"created": "Sun, 12 Jan 2020 12:50:23 GMT",
"version": "v1"
}
] | 2020-01-14 | [
[
"Petrenko",
"Ivan",
""
]
] | The GKS game was formulated by Justin Gilmer, Michal Koucky, and Michael Saks in their research of the sensitivity conjecture. Mario Szegedy invented a protocol for the game with the cost of $O(n^{0.4732})$. Then a protocol with the cost of $O(n^{0.4696})$ was obtained by DeVon Ingram who used a bipartite matching. We ... |
1705.11077 | Yong Man Ro | Seong Tae Kim, Yong Man Ro | EvaluationNet: Can Human Skill be Evaluated by Deep Networks? | 8 pages, 6 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the recent substantial growth of media such as YouTube, a considerable
number of instructional videos covering a wide variety of tasks are available
online. Therefore, online instructional videos have become a rich resource for
humans to learn everyday skills. In order to improve the effectiveness of the
learnin... | [
{
"created": "Wed, 31 May 2017 13:28:01 GMT",
"version": "v1"
}
] | 2017-06-01 | [
[
"Kim",
"Seong Tae",
""
],
[
"Ro",
"Yong Man",
""
]
] | With the recent substantial growth of media such as YouTube, a considerable number of instructional videos covering a wide variety of tasks are available online. Therefore, online instructional videos have become a rich resource for humans to learn everyday skills. In order to improve the effectiveness of the learning ... |
1604.04829 | Raka Jovanovic | Raka Jovanovic, Tatsushi Nishi, Stefan Voss | A heuristic approach for dividing graphs into bi-connected components
with a size constraint | null | null | null | null | cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a new problem of finding the maximal bi-connected
partitioning of a graph with a size constraint (MBCPG-SC). With the goal of
finding approximate solutions for the MBCPG-SC, a heuristic method is developed
based on the open ear decomposition of graphs. Its essential part is an
adaptation of t... | [
{
"created": "Sun, 17 Apr 2016 05:19:05 GMT",
"version": "v1"
}
] | 2016-04-19 | [
[
"Jovanovic",
"Raka",
""
],
[
"Nishi",
"Tatsushi",
""
],
[
"Voss",
"Stefan",
""
]
] | In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions for the MBCPG-SC, a heuristic method is developed based on the open ear decomposition of graphs. Its essential part is an adaptation of the... |
2402.17918 | Amin Sarihi | Amin Sarihi, Ahmad Patooghy, Abdel-Hameed A. Badawy, Peter Jamieson | The Seeker's Dilemma: Realistic Formulation and Benchmarking for
Hardware Trojan Detection | null | null | null | null | cs.CR cs.AR cs.LG | http://creativecommons.org/licenses/by/4.0/ | This work focuses on advancing security research in the hardware design space
by formally defining the realistic problem of Hardware Trojan (HT) detection.
The goal is to model HT detection more closely to the real world, i.e.,
describing the problem as "The Seeker's Dilemma" (an extension of Hide&Seek on
a graph), w... | [
{
"created": "Tue, 27 Feb 2024 22:14:01 GMT",
"version": "v1"
}
] | 2024-02-29 | [
[
"Sarihi",
"Amin",
""
],
[
"Patooghy",
"Ahmad",
""
],
[
"Badawy",
"Abdel-Hameed A.",
""
],
[
"Jamieson",
"Peter",
""
]
] | This work focuses on advancing security research in the hardware design space by formally defining the realistic problem of Hardware Trojan (HT) detection. The goal is to model HT detection more closely to the real world, i.e., describing the problem as "The Seeker's Dilemma" (an extension of Hide&Seek on a graph), whe... |
2211.06929 | Carlos Purves | Carlos Purves, Pietro Li\`o and C\u{a}t\u{a}lina Cangea | Goal-Conditioned Reinforcement Learning in the Presence of an Adversary | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning has seen increasing applications in real-world
contexts over the past few years. However, physical environments are often
imperfect and policies that perform well in simulation might not achieve the
same performance when applied elsewhere. A common approach to combat this is to
train agents in ... | [
{
"created": "Sun, 13 Nov 2022 15:40:01 GMT",
"version": "v1"
}
] | 2022-11-15 | [
[
"Purves",
"Carlos",
""
],
[
"Liò",
"Pietro",
""
],
[
"Cangea",
"Cătălina",
""
]
] | Reinforcement learning has seen increasing applications in real-world contexts over the past few years. However, physical environments are often imperfect and policies that perform well in simulation might not achieve the same performance when applied elsewhere. A common approach to combat this is to train agents in th... |
1209.5803 | Boyu Li | Boyu Li and Ender Ayanoglu | Full-Diversity Precoding Design of Bit-Interleaved Coded Multiple
Beamforming with Orthogonal Frequency Division Multiplexing | accepted to journal. arXiv admin note: text overlap with
arXiv:1109.3510 | IEEE TCOM, Vol. 61, No. 6, Pages 2432-2445, Jun. 2013 | 10.1109/TCOMM.2013.041113.120688 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-Input Multi-Output (MIMO) techniques have been incorporated with
Orthogonal Frequency Division Multiplexing (OFDM) for broadband wireless
communication systems. Bit-Interleaved Coded Multiple Beamforming (BICMB) can
achieve both spatial diversity and spatial multiplexing for flat fading MIMO
channels. For frequ... | [
{
"created": "Wed, 26 Sep 2012 01:03:58 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Jun 2013 21:37:04 GMT",
"version": "v2"
}
] | 2013-07-02 | [
[
"Li",
"Boyu",
""
],
[
"Ayanoglu",
"Ender",
""
]
] | Multi-Input Multi-Output (MIMO) techniques have been incorporated with Orthogonal Frequency Division Multiplexing (OFDM) for broadband wireless communication systems. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve both spatial diversity and spatial multiplexing for flat fading MIMO channels. For frequen... |
1407.0699 | Nasr Mohamed | Nasr Mohamed | Enumeration of Spanning Trees Using Edge Exchange with Minimal
Partitioning | Master Thesis | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this thesis, Minimal Partitioning (MP) algorithm, an innovative algorithm
for enumerating all the spanning trees in an undirected graph is presented.
While MP algorithm uses a computational tree graph to traverse all possible
spanning trees by the edge exchange technique, it has two unique properties
compared to... | [
{
"created": "Wed, 2 Jul 2014 17:15:28 GMT",
"version": "v1"
}
] | 2014-07-04 | [
[
"Mohamed",
"Nasr",
""
]
] | In this thesis, Minimal Partitioning (MP) algorithm, an innovative algorithm for enumerating all the spanning trees in an undirected graph is presented. While MP algorithm uses a computational tree graph to traverse all possible spanning trees by the edge exchange technique, it has two unique properties compared to pre... |
2208.07591 | Subhankar Roy | Subhankar Roy, Martin Trapp, Andrea Pilzer, Juho Kannala, Nicu Sebe,
Elisa Ricci, Arno Solin | Uncertainty-guided Source-free Domain Adaptation | ECCV 2022 | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Source-free domain adaptation (SFDA) aims to adapt a classifier to an
unlabelled target data set by only using a pre-trained source model. However,
the absence of the source data and the domain shift makes the predictions on
the target data unreliable. We propose quantifying the uncertainty in the
source model predic... | [
{
"created": "Tue, 16 Aug 2022 08:03:30 GMT",
"version": "v1"
}
] | 2022-08-17 | [
[
"Roy",
"Subhankar",
""
],
[
"Trapp",
"Martin",
""
],
[
"Pilzer",
"Andrea",
""
],
[
"Kannala",
"Juho",
""
],
[
"Sebe",
"Nicu",
""
],
[
"Ricci",
"Elisa",
""
],
[
"Solin",
"Arno",
""
]
] | Source-free domain adaptation (SFDA) aims to adapt a classifier to an unlabelled target data set by only using a pre-trained source model. However, the absence of the source data and the domain shift makes the predictions on the target data unreliable. We propose quantifying the uncertainty in the source model predicti... |
1301.1704 | Qi Hu | Qi Hu, Nail A. Gumerov, Ramani Duraiswami | Parallel Algorithms for Constructing Data Structures for Fast Multipole
Methods | null | null | null | null | cs.MS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present efficient algorithms to build data structures and the lists needed
for fast multipole methods. The algorithms are capable of being efficiently
implemented on both serial, data parallel GPU and on distributed architectures.
With these algorithms it is possible to map the FMM efficiently on to the GPU
or dis... | [
{
"created": "Tue, 8 Jan 2013 21:57:20 GMT",
"version": "v1"
}
] | 2013-01-10 | [
[
"Hu",
"Qi",
""
],
[
"Gumerov",
"Nail A.",
""
],
[
"Duraiswami",
"Ramani",
""
]
] | We present efficient algorithms to build data structures and the lists needed for fast multipole methods. The algorithms are capable of being efficiently implemented on both serial, data parallel GPU and on distributed architectures. With these algorithms it is possible to map the FMM efficiently on to the GPU or distr... |
2307.05973 | Wenlong Huang | Wenlong Huang, Chen Wang, Ruohan Zhang, Yunzhu Li, Jiajun Wu, Li
Fei-Fei | VoxPoser: Composable 3D Value Maps for Robotic Manipulation with
Language Models | null | null | null | null | cs.RO cs.AI cs.CL cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) are shown to possess a wealth of actionable
knowledge that can be extracted for robot manipulation in the form of reasoning
and planning. Despite the progress, most still rely on pre-defined motion
primitives to carry out the physical interactions with the environment, which
remains a maj... | [
{
"created": "Wed, 12 Jul 2023 07:40:48 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Nov 2023 06:53:37 GMT",
"version": "v2"
}
] | 2023-11-03 | [
[
"Huang",
"Wenlong",
""
],
[
"Wang",
"Chen",
""
],
[
"Zhang",
"Ruohan",
""
],
[
"Li",
"Yunzhu",
""
],
[
"Wu",
"Jiajun",
""
],
[
"Fei-Fei",
"Li",
""
]
] | Large language models (LLMs) are shown to possess a wealth of actionable knowledge that can be extracted for robot manipulation in the form of reasoning and planning. Despite the progress, most still rely on pre-defined motion primitives to carry out the physical interactions with the environment, which remains a major... |
2105.09050 | Jia-Chen Gu | Jia-Chen Gu, Hui Liu, Zhen-Hua Ling, Quan Liu, Zhigang Chen, Xiaodan
Zhu | Partner Matters! An Empirical Study on Fusing Personas for Personalized
Response Selection in Retrieval-Based Chatbots | Accepted by SIGIR 2021 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Persona can function as the prior knowledge for maintaining the consistency
of dialogue systems. Most of previous studies adopted the self persona in
dialogue whose response was about to be selected from a set of candidates or
directly generated, but few have noticed the role of partner in dialogue. This
paper makes ... | [
{
"created": "Wed, 19 May 2021 10:32:30 GMT",
"version": "v1"
},
{
"created": "Fri, 21 May 2021 02:43:50 GMT",
"version": "v2"
}
] | 2021-05-24 | [
[
"Gu",
"Jia-Chen",
""
],
[
"Liu",
"Hui",
""
],
[
"Ling",
"Zhen-Hua",
""
],
[
"Liu",
"Quan",
""
],
[
"Chen",
"Zhigang",
""
],
[
"Zhu",
"Xiaodan",
""
]
] | Persona can function as the prior knowledge for maintaining the consistency of dialogue systems. Most of previous studies adopted the self persona in dialogue whose response was about to be selected from a set of candidates or directly generated, but few have noticed the role of partner in dialogue. This paper makes an... |
2204.13243 | Sharon Levy | Kai Nakamura, Sharon Levy, Yi-Lin Tuan, Wenhu Chen, William Yang Wang | HybriDialogue: An Information-Seeking Dialogue Dataset Grounded on
Tabular and Textual Data | Findings of ACL 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A pressing challenge in current dialogue systems is to successfully converse
with users on topics with information distributed across different modalities.
Previous work in multiturn dialogue systems has primarily focused on either
text or table information. In more realistic scenarios, having a joint
understanding o... | [
{
"created": "Thu, 28 Apr 2022 00:52:16 GMT",
"version": "v1"
}
] | 2022-04-29 | [
[
"Nakamura",
"Kai",
""
],
[
"Levy",
"Sharon",
""
],
[
"Tuan",
"Yi-Lin",
""
],
[
"Chen",
"Wenhu",
""
],
[
"Wang",
"William Yang",
""
]
] | A pressing challenge in current dialogue systems is to successfully converse with users on topics with information distributed across different modalities. Previous work in multiturn dialogue systems has primarily focused on either text or table information. In more realistic scenarios, having a joint understanding of ... |
2203.00833 | Tsingsong Zhao | Qingsong Zhao, Yi Wang, Shuguang Dou, Chen Gong, Yin Wang, Cairong
Zhao | Adaptive Discriminative Regularization for Visual Classification | We submit it to a Journal this time | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | How to improve discriminative feature learning is central in classification.
Existing works address this problem by explicitly increasing inter-class
separability and intra-class similarity, whether by constructing positive and
negative pairs for contrastive learning or posing tighter class separating
margins. These ... | [
{
"created": "Wed, 2 Mar 2022 02:52:23 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Jan 2023 09:53:02 GMT",
"version": "v2"
},
{
"created": "Wed, 11 Jan 2023 14:06:36 GMT",
"version": "v3"
}
] | 2023-01-12 | [
[
"Zhao",
"Qingsong",
""
],
[
"Wang",
"Yi",
""
],
[
"Dou",
"Shuguang",
""
],
[
"Gong",
"Chen",
""
],
[
"Wang",
"Yin",
""
],
[
"Zhao",
"Cairong",
""
]
] | How to improve discriminative feature learning is central in classification. Existing works address this problem by explicitly increasing inter-class separability and intra-class similarity, whether by constructing positive and negative pairs for contrastive learning or posing tighter class separating margins. These me... |
2407.09966 | Mei Qiu | Mei Qiu, Lauren Ann Christopher, Lingxi Li, Stanley Chien, Yaobin Chen | Optimizing ROI Benefits Vehicle ReID in ITS | null | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by-sa/4.0/ | Vehicle re-identification (ReID) is a computer vision task that matches the
same vehicle across different cameras or viewpoints in a surveillance system.
This is crucial for Intelligent Transportation Systems (ITS), where the
effectiveness is influenced by the regions from which vehicle images are
cropped. This study... | [
{
"created": "Sat, 13 Jul 2024 18:15:06 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Qiu",
"Mei",
""
],
[
"Christopher",
"Lauren Ann",
""
],
[
"Li",
"Lingxi",
""
],
[
"Chien",
"Stanley",
""
],
[
"Chen",
"Yaobin",
""
]
] | Vehicle re-identification (ReID) is a computer vision task that matches the same vehicle across different cameras or viewpoints in a surveillance system. This is crucial for Intelligent Transportation Systems (ITS), where the effectiveness is influenced by the regions from which vehicle images are cropped. This study e... |
cs/0607038 | Benoit Donnet | Benoit Donnet, Bruno Baynat, Timur Friedman | Retouched Bloom Filters: Allowing Networked Applications to Flexibly
Trade Off False Positives Against False Negatives | This is a new version of the technical reports with improved
algorithms and theorical analysis of algorithms | null | null | null | cs.NI | null | Where distributed agents must share voluminous set membership information,
Bloom filters provide a compact, though lossy, way for them to do so. Numerous
recent networking papers have examined the trade-offs between the bandwidth
consumed by the transmission of Bloom filters, and the error rate, which takes
the form ... | [
{
"created": "Sun, 9 Jul 2006 10:40:26 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Dec 2006 13:52:04 GMT",
"version": "v2"
}
] | 2007-05-23 | [
[
"Donnet",
"Benoit",
""
],
[
"Baynat",
"Bruno",
""
],
[
"Friedman",
"Timur",
""
]
] | Where distributed agents must share voluminous set membership information, Bloom filters provide a compact, though lossy, way for them to do so. Numerous recent networking papers have examined the trade-offs between the bandwidth consumed by the transmission of Bloom filters, and the error rate, which takes the form of... |
2003.09120 | Piotr Kulicki | Xin Sun, Piotr Kulicki, Mirek Sopek | Multi-party Quantum Byzantine Agreement Without Entanglement | 6 pages, 1 figure | null | 10.3390/e22101152 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a protocol of quantum communication to achieve
Byzantine agreement among multiple parties. The striking feature of our
proposal in comparison to the existing protocols is that we do not use
entanglement to achieve the agreement. There are two stages in our protocol. In
the first stage, a list... | [
{
"created": "Fri, 20 Mar 2020 06:26:44 GMT",
"version": "v1"
}
] | 2020-12-02 | [
[
"Sun",
"Xin",
""
],
[
"Kulicki",
"Piotr",
""
],
[
"Sopek",
"Mirek",
""
]
] | In this paper we propose a protocol of quantum communication to achieve Byzantine agreement among multiple parties. The striking feature of our proposal in comparison to the existing protocols is that we do not use entanglement to achieve the agreement. There are two stages in our protocol. In the first stage, a list o... |
2108.05595 | Thorben Werner | Thorben Werner | Reinforcement Learning Approach to Active Learning for Image
Classification | Master Thesis | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Machine Learning requires large amounts of labeled data to fit a model. Many
datasets are already publicly available, nevertheless forcing application
possibilities of machine learning to the domains of those public datasets. The
ever-growing penetration of machine learning algorithms in new application
areas require... | [
{
"created": "Thu, 12 Aug 2021 08:34:02 GMT",
"version": "v1"
}
] | 2021-08-13 | [
[
"Werner",
"Thorben",
""
]
] | Machine Learning requires large amounts of labeled data to fit a model. Many datasets are already publicly available, nevertheless forcing application possibilities of machine learning to the domains of those public datasets. The ever-growing penetration of machine learning algorithms in new application areas requires ... |
1903.09463 | Thorsten Wissmann | Robert Furber and Radu Mardare and Matteo Mio | Probabilistic logics based on Riesz spaces | null | Logical Methods in Computer Science, Volume 16, Issue 1 (January
27, 2020) lmcs:5306 | 10.23638/LMCS-16(1:6)2020 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | We introduce a novel real-valued endogenous logic for expressing properties
of probabilistic transition systems called Riesz modal logic. The design of the
syntax and semantics of this logic is directly inspired by the theory of Riesz
spaces, a mature field of mathematics at the intersection of universal algebra
and ... | [
{
"created": "Fri, 22 Mar 2019 12:02:21 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Dec 2019 12:13:19 GMT",
"version": "v2"
},
{
"created": "Fri, 24 Jan 2020 12:31:27 GMT",
"version": "v3"
}
] | 2023-06-22 | [
[
"Furber",
"Robert",
""
],
[
"Mardare",
"Radu",
""
],
[
"Mio",
"Matteo",
""
]
] | We introduce a novel real-valued endogenous logic for expressing properties of probabilistic transition systems called Riesz modal logic. The design of the syntax and semantics of this logic is directly inspired by the theory of Riesz spaces, a mature field of mathematics at the intersection of universal algebra and fu... |
1704.08388 | Ted Pedersen | Ted Pedersen | Duluth at Semeval-2017 Task 7 : Puns upon a midnight dreary, Lexical
Semantics for the weak and weary | 5 pages, to Appear in the Proceedings of the 11th International
Workshop on Semantic Evaluation (SemEval 2017), August 2017, Vancouver, BC | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes the Duluth systems that participated in SemEval-2017
Task 7 : Detection and Interpretation of English Puns. The Duluth systems
participated in all three subtasks, and relied on methods that included word
sense disambiguation and measures of semantic relatedness.
| [
{
"created": "Thu, 27 Apr 2017 00:29:17 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Apr 2017 01:16:07 GMT",
"version": "v2"
}
] | 2017-05-01 | [
[
"Pedersen",
"Ted",
""
]
] | This paper describes the Duluth systems that participated in SemEval-2017 Task 7 : Detection and Interpretation of English Puns. The Duluth systems participated in all three subtasks, and relied on methods that included word sense disambiguation and measures of semantic relatedness. |
2310.04703 | Chung-Soo Ahn | Chung-Soo Ahn, Jagath C. Rajapakse and Rajib Rana | Integrating Contrastive Learning into a Multitask Transformer Model for
Effective Domain Adaptation | null | null | null | null | cs.CL cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While speech emotion recognition (SER) research has made significant
progress, achieving generalization across various corpora continues to pose a
problem. We propose a novel domain adaptation technique that embodies a
multitask framework with SER as the primary task, and contrastive learning and
information maximisa... | [
{
"created": "Sat, 7 Oct 2023 06:41:29 GMT",
"version": "v1"
}
] | 2023-10-10 | [
[
"Ahn",
"Chung-Soo",
""
],
[
"Rajapakse",
"Jagath C.",
""
],
[
"Rana",
"Rajib",
""
]
] | While speech emotion recognition (SER) research has made significant progress, achieving generalization across various corpora continues to pose a problem. We propose a novel domain adaptation technique that embodies a multitask framework with SER as the primary task, and contrastive learning and information maximisati... |
2011.13594 | Andreas Buchberger | Andreas Buchberger, Christian H\"ager, Henry D. Pfister, Laurent
Schmalen, Alexandre Graell i Amat | Pruning and Quantizing Neural Belief Propagation Decoders | Accepted for publication in IEEE Journal on Selected Areas in
Communications (J-SAC) | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider near maximum-likelihood (ML) decoding of short linear block
codes. In particular, we propose a novel decoding approach based on neural
belief propagation (NBP) decoding recently introduced by Nachmani et al. in
which we allow a different parity-check matrix in each iteration of the
algorithm. The key idea... | [
{
"created": "Fri, 27 Nov 2020 07:50:31 GMT",
"version": "v1"
}
] | 2020-11-30 | [
[
"Buchberger",
"Andreas",
""
],
[
"Häger",
"Christian",
""
],
[
"Pfister",
"Henry D.",
""
],
[
"Schmalen",
"Laurent",
""
],
[
"Amat",
"Alexandre Graell i",
""
]
] | We consider near maximum-likelihood (ML) decoding of short linear block codes. In particular, we propose a novel decoding approach based on neural belief propagation (NBP) decoding recently introduced by Nachmani et al. in which we allow a different parity-check matrix in each iteration of the algorithm. The key idea i... |
1702.03257 | Sandip Chakraborty | Raja Karmakar and Sandip Chakraborty and Samiran Chattopadhyay | Impact of IEEE 802.11n/ac PHY/MAC High Throughput Enhancements over
Transport/Application Layer Protocols - A Survey | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since the inception of Wireless Local Area Networks (WLANs) in the year 1997,
it has tremendously grown in the last few years. IEEE 802.11 is popularly known
as WLAN. To provide the last mile wireless broadband connectivity to users,
IEEE 802.11 is enriched with IEEE 802.11a, IEEE 802.11b and IEEE 802.11g. More
recen... | [
{
"created": "Fri, 10 Feb 2017 17:25:48 GMT",
"version": "v1"
}
] | 2017-02-13 | [
[
"Karmakar",
"Raja",
""
],
[
"Chakraborty",
"Sandip",
""
],
[
"Chattopadhyay",
"Samiran",
""
]
] | Since the inception of Wireless Local Area Networks (WLANs) in the year 1997, it has tremendously grown in the last few years. IEEE 802.11 is popularly known as WLAN. To provide the last mile wireless broadband connectivity to users, IEEE 802.11 is enriched with IEEE 802.11a, IEEE 802.11b and IEEE 802.11g. More recentl... |
2103.03170 | Ruixu Liu | Ruixu Liu, Ju Shen, He Wang, Chen Chen, Sen-ching Cheung, Vijayan K.
Asari | Enhanced 3D Human Pose Estimation from Videos by using Attention-Based
Neural Network with Dilated Convolutions | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The attention mechanism provides a sequential prediction framework for
learning spatial models with enhanced implicit temporal consistency. In this
work, we show a systematic design (from 2D to 3D) for how conventional networks
and other forms of constraints can be incorporated into the attention framework
for learni... | [
{
"created": "Thu, 4 Mar 2021 17:26:51 GMT",
"version": "v1"
}
] | 2021-03-05 | [
[
"Liu",
"Ruixu",
""
],
[
"Shen",
"Ju",
""
],
[
"Wang",
"He",
""
],
[
"Chen",
"Chen",
""
],
[
"Cheung",
"Sen-ching",
""
],
[
"Asari",
"Vijayan K.",
""
]
] | The attention mechanism provides a sequential prediction framework for learning spatial models with enhanced implicit temporal consistency. In this work, we show a systematic design (from 2D to 3D) for how conventional networks and other forms of constraints can be incorporated into the attention framework for learning... |
2401.05334 | Zhaoxi Chen | Zhaoxi Chen, Gyeongsik Moon, Kaiwen Guo, Chen Cao, Stanislav
Pidhorskyi, Tomas Simon, Rohan Joshi, Yuan Dong, Yichen Xu, Bernardo Pires,
He Wen, Lucas Evans, Bo Peng, Julia Buffalini, Autumn Trimble, Kevyn McPhail,
Melissa Schoeller, Shoou-I Yu, Javier Romero, Michael Zollh\"ofer, Yaser
Sheikh, Ziwei Liu, Shuns... | URHand: Universal Relightable Hands | Project Page https://frozenburning.github.io/projects/urhand/ | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing photorealistic relightable hand models require extensive
identity-specific observations in different views, poses, and illuminations,
and face challenges in generalizing to natural illuminations and novel
identities. To bridge this gap, we present URHand, the first universal
relightable hand model that gener... | [
{
"created": "Wed, 10 Jan 2024 18:59:51 GMT",
"version": "v1"
}
] | 2024-01-11 | [
[
"Chen",
"Zhaoxi",
""
],
[
"Moon",
"Gyeongsik",
""
],
[
"Guo",
"Kaiwen",
""
],
[
"Cao",
"Chen",
""
],
[
"Pidhorskyi",
"Stanislav",
""
],
[
"Simon",
"Tomas",
""
],
[
"Joshi",
"Rohan",
""
],
[
"Dong",
... | Existing photorealistic relightable hand models require extensive identity-specific observations in different views, poses, and illuminations, and face challenges in generalizing to natural illuminations and novel identities. To bridge this gap, we present URHand, the first universal relightable hand model that general... |
2209.12755 | Zhengchun Zhou | Zhifan Ye, Zhengchun Zhou, Zilong Liu, Xiaohu Tang, Pingzhi Fan | New Spectrally Constrained Sequence Sets with Optimal {Periodic}
Cross-Correlation | to appear in IEEE Transactions on Information Theory | null | null | null | cs.IT math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spectrally constrained sequences (SCSs) play an important role in modern
communication and radar systems operating over non-contiguous spectrum. Despite
numerous research attempts over the past years, very few works are known on the
constructions of optimal SCSs with low cross-correlations. In this paper, we
address ... | [
{
"created": "Mon, 26 Sep 2022 15:03:32 GMT",
"version": "v1"
}
] | 2022-09-27 | [
[
"Ye",
"Zhifan",
""
],
[
"Zhou",
"Zhengchun",
""
],
[
"Liu",
"Zilong",
""
],
[
"Tang",
"Xiaohu",
""
],
[
"Fan",
"Pingzhi",
""
]
] | Spectrally constrained sequences (SCSs) play an important role in modern communication and radar systems operating over non-contiguous spectrum. Despite numerous research attempts over the past years, very few works are known on the constructions of optimal SCSs with low cross-correlations. In this paper, we address su... |
2103.10699 | Aleksandr Petiushko | Maksim Dzabraev, Maksim Kalashnikov, Stepan Komkov, Aleksandr
Petiushko | MDMMT: Multidomain Multimodal Transformer for Video Retrieval | null | CVPR Workshops 2021: 3354-3363 | 10.1109/CVPRW53098.2021.00374 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new state-of-the-art on the text to video retrieval task on
MSRVTT and LSMDC benchmarks where our model outperforms all previous solutions
by a large margin. Moreover, state-of-the-art results are achieved with a
single model on two datasets without finetuning. This multidomain
generalisation is achieved... | [
{
"created": "Fri, 19 Mar 2021 09:16:39 GMT",
"version": "v1"
}
] | 2021-11-09 | [
[
"Dzabraev",
"Maksim",
""
],
[
"Kalashnikov",
"Maksim",
""
],
[
"Komkov",
"Stepan",
""
],
[
"Petiushko",
"Aleksandr",
""
]
] | We present a new state-of-the-art on the text to video retrieval task on MSRVTT and LSMDC benchmarks where our model outperforms all previous solutions by a large margin. Moreover, state-of-the-art results are achieved with a single model on two datasets without finetuning. This multidomain generalisation is achieved b... |
2101.02305 | Maryam Motamedi | Maryam Motamedi, Jessica Dawson, Na Li, Douglas G. Down, and Nancy M.
Heddle | Demand Forecasting for Platelet Usage: from Univariate Time Series to
Multivariate Models | null | null | null | pone.0297391 | cs.LG stat.AP stat.ML | http://creativecommons.org/licenses/by/4.0/ | Platelet products are both expensive and have very short shelf lives. As
usage rates for platelets are highly variable, the effective management of
platelet demand and supply is very important yet challenging. The primary goal
of this paper is to present an efficient forecasting model for platelet demand
at Canadian ... | [
{
"created": "Wed, 6 Jan 2021 23:54:10 GMT",
"version": "v1"
},
{
"created": "Fri, 23 Dec 2022 22:18:47 GMT",
"version": "v2"
}
] | 2024-04-30 | [
[
"Motamedi",
"Maryam",
""
],
[
"Dawson",
"Jessica",
""
],
[
"Li",
"Na",
""
],
[
"Down",
"Douglas G.",
""
],
[
"Heddle",
"Nancy M.",
""
]
] | Platelet products are both expensive and have very short shelf lives. As usage rates for platelets are highly variable, the effective management of platelet demand and supply is very important yet challenging. The primary goal of this paper is to present an efficient forecasting model for platelet demand at Canadian Bl... |
2104.01782 | Ishani Mondal | Ishani Mondal | BBAEG: Towards BERT-based Biomedical Adversarial Example Generation for
Text Classification | To appear in NAACL 2021 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Healthcare predictive analytics aids medical decision-making, diagnosis
prediction and drug review analysis. Therefore, prediction accuracy is an
important criteria which also necessitates robust predictive language models.
However, the models using deep learning have been proven vulnerable towards
insignificantly pe... | [
{
"created": "Mon, 5 Apr 2021 05:32:56 GMT",
"version": "v1"
}
] | 2021-04-06 | [
[
"Mondal",
"Ishani",
""
]
] | Healthcare predictive analytics aids medical decision-making, diagnosis prediction and drug review analysis. Therefore, prediction accuracy is an important criteria which also necessitates robust predictive language models. However, the models using deep learning have been proven vulnerable towards insignificantly pert... |
2303.07564 | Hanyu Zhou | Hanyu Zhou, Yi Chang, Wending Yan, Luxin Yan | Unsupervised Cumulative Domain Adaptation for Foggy Scene Optical Flow | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optical flow has achieved great success under clean scenes, but suffers from
restricted performance under foggy scenes. To bridge the clean-to-foggy domain
gap, the existing methods typically adopt the domain adaptation to transfer the
motion knowledge from clean to synthetic foggy domain. However, these methods
unex... | [
{
"created": "Tue, 14 Mar 2023 01:10:59 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Mar 2023 13:28:36 GMT",
"version": "v2"
}
] | 2023-03-21 | [
[
"Zhou",
"Hanyu",
""
],
[
"Chang",
"Yi",
""
],
[
"Yan",
"Wending",
""
],
[
"Yan",
"Luxin",
""
]
] | Optical flow has achieved great success under clean scenes, but suffers from restricted performance under foggy scenes. To bridge the clean-to-foggy domain gap, the existing methods typically adopt the domain adaptation to transfer the motion knowledge from clean to synthetic foggy domain. However, these methods unexpe... |
1809.06972 | David Yoon | David J. Yoon, Tim Y. Tang and Timothy D. Barfoot | Mapless Online Detection of Dynamic Objects in 3D Lidar | 7 pages, 8 figures | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a model-free, setting-independent method for online
detection of dynamic objects in 3D lidar data. We explicitly compensate for the
moving-while-scanning operation (motion distortion) of present-day 3D spinning
lidar sensors. Our detection method uses a motion-compensated freespace
querying algori... | [
{
"created": "Wed, 19 Sep 2018 00:49:25 GMT",
"version": "v1"
}
] | 2018-09-20 | [
[
"Yoon",
"David J.",
""
],
[
"Tang",
"Tim Y.",
""
],
[
"Barfoot",
"Timothy D.",
""
]
] | This paper presents a model-free, setting-independent method for online detection of dynamic objects in 3D lidar data. We explicitly compensate for the moving-while-scanning operation (motion distortion) of present-day 3D spinning lidar sensors. Our detection method uses a motion-compensated freespace querying algorith... |
2408.05649 | Blessing Agyei Kyem | Blessing Agyei Kyem, Eugene Kofi Okrah Denteh, Joshua Kofi Asamoah,
Kenneth Adomako Tutu, Armstrong Aboah | Advancing Pavement Distress Detection in Developing Countries: A Novel
Deep Learning Approach with Locally-Collected Datasets | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Road infrastructure maintenance in developing countries faces unique
challenges due to resource constraints and diverse environmental factors. This
study addresses the critical need for efficient, accurate, and locally-relevant
pavement distress detection methods in these regions. We present a novel deep
learning app... | [
{
"created": "Sat, 10 Aug 2024 23:20:36 GMT",
"version": "v1"
}
] | 2024-08-13 | [
[
"Kyem",
"Blessing Agyei",
""
],
[
"Denteh",
"Eugene Kofi Okrah",
""
],
[
"Asamoah",
"Joshua Kofi",
""
],
[
"Tutu",
"Kenneth Adomako",
""
],
[
"Aboah",
"Armstrong",
""
]
] | Road infrastructure maintenance in developing countries faces unique challenges due to resource constraints and diverse environmental factors. This study addresses the critical need for efficient, accurate, and locally-relevant pavement distress detection methods in these regions. We present a novel deep learning appro... |
1805.01890 | Kamran Kowsari | Kamran Kowsari, Mojtaba Heidarysafa, Donald E. Brown, Kiana Jafari
Meimandi, Laura E. Barnes | RMDL: Random Multimodel Deep Learning for Classification | Best Paper award ACM ICISDM | null | 10.1145/3206098.3206111 | null | cs.LG cs.AI cs.CV cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The continually increasing number of complex datasets each year necessitates
ever improving machine learning methods for robust and accurate categorization
of these data. This paper introduces Random Multimodel Deep Learning (RMDL): a
new ensemble, deep learning approach for classification. Deep learning models
have ... | [
{
"created": "Thu, 3 May 2018 19:36:43 GMT",
"version": "v1"
},
{
"created": "Thu, 31 May 2018 16:08:33 GMT",
"version": "v2"
}
] | 2018-06-01 | [
[
"Kowsari",
"Kamran",
""
],
[
"Heidarysafa",
"Mojtaba",
""
],
[
"Brown",
"Donald E.",
""
],
[
"Meimandi",
"Kiana Jafari",
""
],
[
"Barnes",
"Laura E.",
""
]
] | The continually increasing number of complex datasets each year necessitates ever improving machine learning methods for robust and accurate categorization of these data. This paper introduces Random Multimodel Deep Learning (RMDL): a new ensemble, deep learning approach for classification. Deep learning models have ac... |
2108.02585 | Linda Kleist | Mikkel Abrahamsen, Linda Kleist, Tillmann Miltzow | Geometric Embeddability of Complexes is $\exists \mathbb R$-complete | 26 pages, 18 figures | null | null | null | cs.CC cs.CG cs.DM math.CO math.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the decision problem of determining whether a given (abstract
simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete
for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$.
This implies that the problem is polynomial time equivalent to determining
whether a ... | [
{
"created": "Thu, 5 Aug 2021 12:48:06 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Nov 2021 11:12:44 GMT",
"version": "v2"
}
] | 2021-11-08 | [
[
"Abrahamsen",
"Mikkel",
""
],
[
"Kleist",
"Linda",
""
],
[
"Miltzow",
"Tillmann",
""
]
] | We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This implies that the problem is polynomial time equivalent to determining whether a po... |
2402.09232 | Cristian Urbina | Gonzalo Navarro and Cristian Urbina | Iterated Straight-Line Programs | This version of the article includes the proofs omitted from LATIN24 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore an extension to straight-line programs (SLPs) that outperforms,
for some text families, the measure $\delta$ based on substring complexity, a
lower bound for most measures and compressors exploiting repetitiveness (which
are crucial in areas like Bioinformatics). The extension, called iterated SLPs
(ISLPs)... | [
{
"created": "Wed, 14 Feb 2024 15:21:37 GMT",
"version": "v1"
},
{
"created": "Thu, 15 Feb 2024 09:21:39 GMT",
"version": "v2"
}
] | 2024-02-16 | [
[
"Navarro",
"Gonzalo",
""
],
[
"Urbina",
"Cristian",
""
]
] | We explore an extension to straight-line programs (SLPs) that outperforms, for some text families, the measure $\delta$ based on substring complexity, a lower bound for most measures and compressors exploiting repetitiveness (which are crucial in areas like Bioinformatics). The extension, called iterated SLPs (ISLPs), ... |
2403.01693 | Supreeth Narasimhaswamy | Supreeth Narasimhaswamy, Uttaran Bhattacharya, Xiang Chen, Ishita
Dasgupta, Saayan Mitra, Minh Hoai | HanDiffuser: Text-to-Image Generation With Realistic Hand Appearances | Revisions: 1. Added a link to project page in the abstract, 2.
Updated references and related work, 3. Fixed some grammatical errors | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Text-to-image generative models can generate high-quality humans, but realism
is lost when generating hands. Common artifacts include irregular hand poses,
shapes, incorrect numbers of fingers, and physically implausible finger
orientations. To generate images with realistic hands, we propose a novel
diffusion-based ... | [
{
"created": "Mon, 4 Mar 2024 03:00:22 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Apr 2024 03:53:51 GMT",
"version": "v2"
}
] | 2024-04-23 | [
[
"Narasimhaswamy",
"Supreeth",
""
],
[
"Bhattacharya",
"Uttaran",
""
],
[
"Chen",
"Xiang",
""
],
[
"Dasgupta",
"Ishita",
""
],
[
"Mitra",
"Saayan",
""
],
[
"Hoai",
"Minh",
""
]
] | Text-to-image generative models can generate high-quality humans, but realism is lost when generating hands. Common artifacts include irregular hand poses, shapes, incorrect numbers of fingers, and physically implausible finger orientations. To generate images with realistic hands, we propose a novel diffusion-based ar... |
2407.17425 | Solomia Fedushko | Ivan Khoma, Solomia Fedushko, and Zoryana Kunch | Media Manipulations in the Coverage of Events of the Ukrainian
Revolution of Dignity: Historical, Linguistic, and Psychological Approaches | 14 pages | null | null | null | cs.CY cs.CL | http://creativecommons.org/licenses/by/4.0/ | This article examines the use of manipulation in the coverage of events of
the Ukrainian Revolution of Dignity in the mass media, namely in the content of
the online newspaper Ukrainian Truth (Ukrainska pravda), online newspaper High
Castle (Vysokyi Zamok), and online newspaper ZIK during the public protest,
namely d... | [
{
"created": "Tue, 9 Jul 2024 09:46:27 GMT",
"version": "v1"
}
] | 2024-07-25 | [
[
"Khoma",
"Ivan",
""
],
[
"Fedushko",
"Solomia",
""
],
[
"Kunch",
"Zoryana",
""
]
] | This article examines the use of manipulation in the coverage of events of the Ukrainian Revolution of Dignity in the mass media, namely in the content of the online newspaper Ukrainian Truth (Ukrainska pravda), online newspaper High Castle (Vysokyi Zamok), and online newspaper ZIK during the public protest, namely dur... |
2211.12318 | Michael Mislove | Jason Z. S. Hu, Brigitte Pientka | A Categorical Normalization Proof for the Modal Lambda-Calculus | null | Electronic Notes in Theoretical Informatics and Computer Science,
Volume 1 - Proceedings of MFPS XXXVIII (February 22, 2023) entics:10360 | 10.46298/entics.10360 | null | cs.PL cs.LO | http://creativecommons.org/licenses/by/4.0/ | We investigate a simply typed modal $\lambda$-calculus,
$\lambda^{\to\square}$, due to Pfenning, Wong and Davies, where we define a
well-typed term with respect to a context stack that captures the possible
world semantics in a syntactic way. It provides logical foundation for
multi-staged meta-programming. Our main ... | [
{
"created": "Tue, 22 Nov 2022 15:12:17 GMT",
"version": "v1"
},
{
"created": "Sun, 5 Feb 2023 23:30:32 GMT",
"version": "v2"
},
{
"created": "Wed, 15 Feb 2023 21:35:16 GMT",
"version": "v3"
},
{
"created": "Mon, 20 Feb 2023 16:10:06 GMT",
"version": "v4"
}
] | 2023-06-22 | [
[
"Hu",
"Jason Z. S.",
""
],
[
"Pientka",
"Brigitte",
""
]
] | We investigate a simply typed modal $\lambda$-calculus, $\lambda^{\to\square}$, due to Pfenning, Wong and Davies, where we define a well-typed term with respect to a context stack that captures the possible world semantics in a syntactic way. It provides logical foundation for multi-staged meta-programming. Our main co... |
1702.02012 | Tanushri Chakravorty | Tanushri Chakravorty, Guillaume-Alexandre Bilodeau, Eric Granger | Tracking using Numerous Anchor points | Revised text version. Accepted for publication in Journal of Machine
Vision and Applications, December, 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, an online adaptive model-free tracker is proposed to track
single objects in video sequences to deal with real-world tracking challenges
like low-resolution, object deformation, occlusion and motion blur. The novelty
lies in the construction of a strong appearance model that captures features
from the ... | [
{
"created": "Tue, 7 Feb 2017 13:51:06 GMT",
"version": "v1"
},
{
"created": "Sun, 10 Dec 2017 21:31:28 GMT",
"version": "v2"
}
] | 2017-12-12 | [
[
"Chakravorty",
"Tanushri",
""
],
[
"Bilodeau",
"Guillaume-Alexandre",
""
],
[
"Granger",
"Eric",
""
]
] | In this paper, an online adaptive model-free tracker is proposed to track single objects in video sequences to deal with real-world tracking challenges like low-resolution, object deformation, occlusion and motion blur. The novelty lies in the construction of a strong appearance model that captures features from the in... |
1909.02496 | Ping Li | Hang Zhang, Martin Slawski, Ping Li | The Benefits of Diversity: Permutation Recovery in Unlabeled Sensing
from Multiple Measurement Vectors | null | null | null | null | cs.IT cs.LG math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In "Unlabeled Sensing", one observes a set of linear measurements of an
underlying signal with incomplete or missing information about their ordering,
which can be modeled in terms of an unknown permutation. Previous work on the
case of a single noisy measurement vector has exposed two main challenges: 1) a
high requ... | [
{
"created": "Thu, 5 Sep 2019 15:55:59 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Jul 2020 05:49:06 GMT",
"version": "v2"
}
] | 2020-07-14 | [
[
"Zhang",
"Hang",
""
],
[
"Slawski",
"Martin",
""
],
[
"Li",
"Ping",
""
]
] | In "Unlabeled Sensing", one observes a set of linear measurements of an underlying signal with incomplete or missing information about their ordering, which can be modeled in terms of an unknown permutation. Previous work on the case of a single noisy measurement vector has exposed two main challenges: 1) a high requir... |
2402.01444 | Esther Rolf | Esther Rolf, Konstantin Klemmer, Caleb Robinson, Hannah Kerner | Mission Critical -- Satellite Data is a Distinct Modality in Machine
Learning | 15 pages, 5 figures | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Satellite data has the potential to inspire a seismic shift for machine
learning -- one in which we rethink existing practices designed for traditional
data modalities. As machine learning for satellite data (SatML) gains traction
for its real-world impact, our field is at a crossroads. We can either continue
applyin... | [
{
"created": "Fri, 2 Feb 2024 14:36:50 GMT",
"version": "v1"
}
] | 2024-02-05 | [
[
"Rolf",
"Esther",
""
],
[
"Klemmer",
"Konstantin",
""
],
[
"Robinson",
"Caleb",
""
],
[
"Kerner",
"Hannah",
""
]
] | Satellite data has the potential to inspire a seismic shift for machine learning -- one in which we rethink existing practices designed for traditional data modalities. As machine learning for satellite data (SatML) gains traction for its real-world impact, our field is at a crossroads. We can either continue applying ... |
2212.07407 | Karl Pertsch | Karl Pertsch, Ruta Desai, Vikash Kumar, Franziska Meier, Joseph J.
Lim, Dhruv Batra, Akshara Rai | Cross-Domain Transfer via Semantic Skill Imitation | Project website: https://kpertsch.github.io/star | CoRL 2022 | null | null | cs.LG cs.RO | http://creativecommons.org/licenses/by/4.0/ | We propose an approach for semantic imitation, which uses demonstrations from
a source domain, e.g. human videos, to accelerate reinforcement learning (RL)
in a different target domain, e.g. a robotic manipulator in a simulated
kitchen. Instead of imitating low-level actions like joint velocities, our
approach imitat... | [
{
"created": "Wed, 14 Dec 2022 18:46:14 GMT",
"version": "v1"
}
] | 2022-12-15 | [
[
"Pertsch",
"Karl",
""
],
[
"Desai",
"Ruta",
""
],
[
"Kumar",
"Vikash",
""
],
[
"Meier",
"Franziska",
""
],
[
"Lim",
"Joseph J.",
""
],
[
"Batra",
"Dhruv",
""
],
[
"Rai",
"Akshara",
""
]
] | We propose an approach for semantic imitation, which uses demonstrations from a source domain, e.g. human videos, to accelerate reinforcement learning (RL) in a different target domain, e.g. a robotic manipulator in a simulated kitchen. Instead of imitating low-level actions like joint velocities, our approach imitates... |
1509.08560 | EPTCS | Luca Bortolussi (Saarland University, University of Trieste,
ISTI-CNR), Rocco De Nicola (IMT Lucca), Vashti Galpin (University of
Edinburgh), Stephen Gilmore (University of Edinburgh), Jane Hillston
(University of Edinburgh), Diego Latella (ISTI-CNR), Michele Loreti
(Universit\`a di Firenze, IMT Lucca), Mieke M... | CARMA: Collective Adaptive Resource-sharing Markovian Agents | In Proceedings QAPL 2015, arXiv:1509.08169 | EPTCS 194, 2015, pp. 16-31 | 10.4204/EPTCS.194.2 | null | cs.PL cs.DC cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present CARMA, a language recently defined to support
specification and analysis of collective adaptive systems. CARMA is a
stochastic process algebra equipped with linguistic constructs specifically
developed for modelling and programming systems that can operate in open-ended
and unpredictable envi... | [
{
"created": "Tue, 29 Sep 2015 02:10:19 GMT",
"version": "v1"
}
] | 2015-09-30 | [
[
"Bortolussi",
"Luca",
"",
"Saarland University, University of Trieste,\n ISTI-CNR"
],
[
"De Nicola",
"Rocco",
"",
"IMT Lucca"
],
[
"Galpin",
"Vashti",
"",
"University of\n Edinburgh"
],
[
"Gilmore",
"Stephen",
"",
"University of Edinbur... | In this paper we present CARMA, a language recently defined to support specification and analysis of collective adaptive systems. CARMA is a stochastic process algebra equipped with linguistic constructs specifically developed for modelling and programming systems that can operate in open-ended and unpredictable enviro... |
1207.1411 | Finnegan Southey | Finnegan Southey, Michael P. Bowling, Bryce Larson, Carmelo Piccione,
Neil Burch, Darse Billings, Chris Rayner | Bayes' Bluff: Opponent Modelling in Poker | Appears in Proceedings of the Twenty-First Conference on Uncertainty
in Artificial Intelligence (UAI2005) | null | null | UAI-P-2005-PG-550-558 | cs.GT cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Poker is a challenging problem for artificial intelligence, with
non-deterministic dynamics, partial observability, and the added difficulty of
unknown adversaries. Modelling all of the uncertainties in this domain is not
an easy task. In this paper we present a Bayesian probabilistic model for a
broad class of poker... | [
{
"created": "Wed, 4 Jul 2012 16:22:47 GMT",
"version": "v1"
}
] | 2012-07-09 | [
[
"Southey",
"Finnegan",
""
],
[
"Bowling",
"Michael P.",
""
],
[
"Larson",
"Bryce",
""
],
[
"Piccione",
"Carmelo",
""
],
[
"Burch",
"Neil",
""
],
[
"Billings",
"Darse",
""
],
[
"Rayner",
"Chris",
""
]
] | Poker is a challenging problem for artificial intelligence, with non-deterministic dynamics, partial observability, and the added difficulty of unknown adversaries. Modelling all of the uncertainties in this domain is not an easy task. In this paper we present a Bayesian probabilistic model for a broad class of poker g... |
2212.11414 | Armin Zirak | Armin Zirak and Hadi Hemmati | Improving Automated Program Repair with Domain Adaptation | 43 pages | null | null | null | cs.SE cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Automated Program Repair (APR) is defined as the process of fixing a
bug/defect in the source code, by an automated tool. APR tools have recently
experienced promising results by leveraging state-of-the-art Neural Language
Processing (NLP) techniques. APR tools such as TFix and CodeXGLUE combine
text-to-text transfor... | [
{
"created": "Wed, 21 Dec 2022 23:52:09 GMT",
"version": "v1"
}
] | 2023-01-13 | [
[
"Zirak",
"Armin",
""
],
[
"Hemmati",
"Hadi",
""
]
] | Automated Program Repair (APR) is defined as the process of fixing a bug/defect in the source code, by an automated tool. APR tools have recently experienced promising results by leveraging state-of-the-art Neural Language Processing (NLP) techniques. APR tools such as TFix and CodeXGLUE combine text-to-text transforme... |
1001.5100 | Xiwang Cao | Xiwang Cao and Lei Hu | On Exponential Sums, Nowton identities and Dickson Polynomials over
Finite Fields | 18 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of
$\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$
with $\gcd(n,q)=1$. We present a recursive formula for evaluating the
exponential sum $\sum_{c\in \mathbb{F}_{q^s}}\chi^{(s)}(f(x))$. Let $a$ and $b$
be two element... | [
{
"created": "Thu, 28 Jan 2010 04:50:32 GMT",
"version": "v1"
}
] | 2010-01-29 | [
[
"Cao",
"Xiwang",
""
],
[
"Hu",
"Lei",
""
]
] | Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum $\sum_{c\in \mathbb{F}_{q^s}}\chi^{(s)}(f(x))$. Let $a$ and $b$ be two elements ... |
1805.09302 | Safa Cicek | Safa Cicek and Stefano Soatto | Input and Weight Space Smoothing for Semi-supervised Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose regularizing the empirical loss for semi-supervised learning by
acting on both the input (data) space, and the weight (parameter) space. We
show that the two are not equivalent, and in fact are complementary, one
affecting the minimality of the resulting representation, the other
insensitivity to nuisance ... | [
{
"created": "Wed, 23 May 2018 17:39:38 GMT",
"version": "v1"
}
] | 2018-05-24 | [
[
"Cicek",
"Safa",
""
],
[
"Soatto",
"Stefano",
""
]
] | We propose regularizing the empirical loss for semi-supervised learning by acting on both the input (data) space, and the weight (parameter) space. We show that the two are not equivalent, and in fact are complementary, one affecting the minimality of the resulting representation, the other insensitivity to nuisance va... |
cs/0312056 | Christian Duncan | Christian A. Duncan (University of Miami), David Eppstein (University
of California, Irvine), Stephen G. Kobourov (University of Arizona) | The Geometric Thickness of Low Degree Graphs | 10 pages, 7 figures, submitted to SoCG 2004 | null | null | null | cs.CG cs.DM | null | We prove that the geometric thickness of graphs whose maximum degree is no
more than four is two. All of our algorithms run in O(n) time, where n is the
number of vertices in the graph. In our proofs, we present an embedding
algorithm for graphs with maximum degree three that uses an n x n grid and a
more complex alg... | [
{
"created": "Wed, 24 Dec 2003 06:59:09 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Duncan",
"Christian A.",
"",
"University of Miami"
],
[
"Eppstein",
"David",
"",
"University\n of California, Irvine"
],
[
"Kobourov",
"Stephen G.",
"",
"University of Arizona"
]
] | We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the graph. In our proofs, we present an embedding algorithm for graphs with maximum degree three that uses an n x n grid and a more complex algor... |
2302.09173 | Lajanugen Logeswaran | Lajanugen Logeswaran, Sungryull Sohn, Yunseok Jang, Moontae Lee,
Honglak Lee | Unsupervised Task Graph Generation from Instructional Video Transcripts | Findings of ACL 2023 | null | null | null | cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work explores the problem of generating task graphs of real-world
activities. Different from prior formulations, we consider a setting where text
transcripts of instructional videos performing a real-world activity (e.g.,
making coffee) are provided and the goal is to identify the key steps relevant
to the task ... | [
{
"created": "Fri, 17 Feb 2023 22:50:08 GMT",
"version": "v1"
},
{
"created": "Tue, 2 May 2023 19:46:14 GMT",
"version": "v2"
}
] | 2023-05-04 | [
[
"Logeswaran",
"Lajanugen",
""
],
[
"Sohn",
"Sungryull",
""
],
[
"Jang",
"Yunseok",
""
],
[
"Lee",
"Moontae",
""
],
[
"Lee",
"Honglak",
""
]
] | This work explores the problem of generating task graphs of real-world activities. Different from prior formulations, we consider a setting where text transcripts of instructional videos performing a real-world activity (e.g., making coffee) are provided and the goal is to identify the key steps relevant to the task as... |
2310.16191 | Zhuolin Yang | Zhuolin Yang, Zain Sarwar, Iris Hwang, Ronik Bhaskar, Ben Y. Zhao,
Haitao Zheng | Can Virtual Reality Protect Users from Keystroke Inference Attacks? | Accepted by USENIX 2024 | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Virtual Reality (VR) has gained popularity by providing immersive and
interactive experiences without geographical limitations. It also provides a
sense of personal privacy through physical separation. In this paper, we show
that despite assumptions of enhanced privacy, VR is unable to shield its users
from side-chan... | [
{
"created": "Tue, 24 Oct 2023 21:19:38 GMT",
"version": "v1"
}
] | 2023-10-26 | [
[
"Yang",
"Zhuolin",
""
],
[
"Sarwar",
"Zain",
""
],
[
"Hwang",
"Iris",
""
],
[
"Bhaskar",
"Ronik",
""
],
[
"Zhao",
"Ben Y.",
""
],
[
"Zheng",
"Haitao",
""
]
] | Virtual Reality (VR) has gained popularity by providing immersive and interactive experiences without geographical limitations. It also provides a sense of personal privacy through physical separation. In this paper, we show that despite assumptions of enhanced privacy, VR is unable to shield its users from side-channe... |
1712.06763 | Fl\'avio Miyazawa | Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi | A tight lower bound for an online hypercube packing problem and bounds
for prices of anarchy of a related game | null | Discrete Mathematics and Theoretical Computer Science, 23(3), 2021 | 10.46298/dmtcs.8325 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove a tight lower bound on the asymptotic performance ratio $\rho$ of
the bounded space online $d$-hypercube bin packing problem, solving an open
question raised in 2005. In the classic $d$-hypercube bin packing problem, we
are given a sequence of $d$-dimensional hypercubes and we have an unlimited
number of bin... | [
{
"created": "Tue, 19 Dec 2017 03:15:14 GMT",
"version": "v1"
}
] | 2023-04-11 | [
[
"Kohayakawa",
"Y.",
""
],
[
"Miyazawa",
"F. K.",
""
],
[
"Wakabayashi",
"Y.",
""
]
] | We prove a tight lower bound on the asymptotic performance ratio $\rho$ of the bounded space online $d$-hypercube bin packing problem, solving an open question raised in 2005. In the classic $d$-hypercube bin packing problem, we are given a sequence of $d$-dimensional hypercubes and we have an unlimited number of bins,... |
0912.2479 | VishalGoyal | Vishal Goyal | Pervasive Emotions in Pervasive Computing Environments | This submission has been withdrawn by arXiv admin. It is a verbatim
copy of arXiv:0912.1810 with only the author name and title changed | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This submission has been withdrawn by arXiv admin. It is a verbatim copy of
arXiv:0912.1810 with only the author name and title changed.
| [
{
"created": "Sun, 13 Dec 2009 06:10:42 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Jan 2010 15:20:14 GMT",
"version": "v2"
}
] | 2010-01-12 | [
[
"Goyal",
"Vishal",
""
]
] | This submission has been withdrawn by arXiv admin. It is a verbatim copy of arXiv:0912.1810 with only the author name and title changed. |
1409.0706 | Shiyan Zhong | Shiyan Zhong | Efficient Scheme for Active Particle Selection in N-body Simulations | 8 pages, 4 figures | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an efficient method for active particle selection, working with
Hermite Individual Time Steps (HITS) scheme in direct N-body simulation code
$\varphi$GRAPE. For a simulation with $N$ particles, this method can reduce the
computation complexity of active particle selection, from $O(N\cdot N_{step})$
to $O(\... | [
{
"created": "Tue, 2 Sep 2014 13:46:06 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Sep 2014 07:02:14 GMT",
"version": "v2"
}
] | 2014-09-16 | [
[
"Zhong",
"Shiyan",
""
]
] | We propose an efficient method for active particle selection, working with Hermite Individual Time Steps (HITS) scheme in direct N-body simulation code $\varphi$GRAPE. For a simulation with $N$ particles, this method can reduce the computation complexity of active particle selection, from $O(N\cdot N_{step})$ to $O(\ov... |
1809.00069 | Mingbo Ma | Liang Huang and Kai Zhao and Mingbo Ma | When to Finish? Optimal Beam Search for Neural Text Generation (modulo
beam size) | accepted by EMNLP 2017 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In neural text generation such as neural machine translation, summarization,
and image captioning, beam search is widely used to improve the output text
quality. However, in the neural generation setting, hypotheses can finish in
different steps, which makes it difficult to decide when to end beam search to
ensure op... | [
{
"created": "Fri, 31 Aug 2018 22:01:48 GMT",
"version": "v1"
}
] | 2018-09-05 | [
[
"Huang",
"Liang",
""
],
[
"Zhao",
"Kai",
""
],
[
"Ma",
"Mingbo",
""
]
] | In neural text generation such as neural machine translation, summarization, and image captioning, beam search is widely used to improve the output text quality. However, in the neural generation setting, hypotheses can finish in different steps, which makes it difficult to decide when to end beam search to ensure opti... |
2004.02501 | Jinshan Pan | Jinshan Pan, Haoran Bai, Jinhui Tang | Cascaded Deep Video Deblurring Using Temporal Sharpness Prior | CVPR 2020. The code is available at https://github.com/csbhr/CDVD-TSP | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a simple and effective deep convolutional neural network (CNN)
model for video deblurring. The proposed algorithm mainly consists of optical
flow estimation from intermediate latent frames and latent frame restoration
steps. It first develops a deep CNN model to estimate optical flow from
intermediate late... | [
{
"created": "Mon, 6 Apr 2020 09:13:49 GMT",
"version": "v1"
}
] | 2020-04-07 | [
[
"Pan",
"Jinshan",
""
],
[
"Bai",
"Haoran",
""
],
[
"Tang",
"Jinhui",
""
]
] | We present a simple and effective deep convolutional neural network (CNN) model for video deblurring. The proposed algorithm mainly consists of optical flow estimation from intermediate latent frames and latent frame restoration steps. It first develops a deep CNN model to estimate optical flow from intermediate latent... |
2204.00858 | Kunal Mittal | Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan | Polynomial Bounds On Parallel Repetition For All 3-Player Games With
Binary Inputs | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove that for every 3-player (3-prover) game $\mathcal G$ with value less
than one, whose query distribution has the support $\mathcal S = \{(1,0,0),
(0,1,0), (0,0,1)\}$ of hamming weight one vectors, the value of the $n$-fold
parallel repetition $\mathcal G^{\otimes n}$ decays polynomially fast to zero;
that is,... | [
{
"created": "Sat, 2 Apr 2022 13:37:49 GMT",
"version": "v1"
}
] | 2022-04-05 | [
[
"Girish",
"Uma",
""
],
[
"Mittal",
"Kunal",
""
],
[
"Raz",
"Ran",
""
],
[
"Zhan",
"Wei",
""
]
] | We prove that for every 3-player (3-prover) game $\mathcal G$ with value less than one, whose query distribution has the support $\mathcal S = \{(1,0,0), (0,1,0), (0,0,1)\}$ of hamming weight one vectors, the value of the $n$-fold parallel repetition $\mathcal G^{\otimes n}$ decays polynomially fast to zero; that is, t... |
2011.09257 | Pablo Pino | Pablo Pino, Denis Parra, Pablo Messina, Cecilia Besa, Sergio Uribe | Inspecting state of the art performance and NLP metrics in image-based
medical report generation | 3 pages, 1 figure, 1 table. Accepted in LatinX in AI workshop at
NeurIPS 2020. (v3 updated ack) | null | null | null | cs.CL cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Several deep learning architectures have been proposed over the last years to
deal with the problem of generating a written report given an imaging exam as
input. Most works evaluate the generated reports using standard Natural
Language Processing (NLP) metrics (e.g. BLEU, ROUGE), reporting significant
progress. In t... | [
{
"created": "Wed, 18 Nov 2020 13:09:12 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Nov 2020 17:58:40 GMT",
"version": "v2"
},
{
"created": "Sat, 15 Jan 2022 06:05:51 GMT",
"version": "v3"
}
] | 2022-01-19 | [
[
"Pino",
"Pablo",
""
],
[
"Parra",
"Denis",
""
],
[
"Messina",
"Pablo",
""
],
[
"Besa",
"Cecilia",
""
],
[
"Uribe",
"Sergio",
""
]
] | Several deep learning architectures have been proposed over the last years to deal with the problem of generating a written report given an imaging exam as input. Most works evaluate the generated reports using standard Natural Language Processing (NLP) metrics (e.g. BLEU, ROUGE), reporting significant progress. In thi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.