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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1207.5742 | Andrei Romashchenko | Tarik Kaced and Andrei Romashchenko | Conditional Information Inequalities for Entropic and Almost Entropic
Points | Submitted to the IEEE Transactions on Information Theory | IEEE Transactions on Information Theory 59(11), 2013, pp.
7149-7167 | 10.1109/TIT.2013.2274614 | null | cs.IT cs.DM math.IT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study conditional linear information inequalities, i.e., linear
inequalities for Shannon entropy that hold for distributions whose entropies
meet some linear constraints. We prove that some conditional information
inequalities cannot be extended to any unconditional linear inequalities. Some
of these conditional i... | [
{
"created": "Tue, 24 Jul 2012 16:31:05 GMT",
"version": "v1"
},
{
"created": "Sun, 29 Jul 2012 19:20:14 GMT",
"version": "v2"
},
{
"created": "Mon, 22 Jul 2013 16:46:19 GMT",
"version": "v3"
},
{
"created": "Fri, 16 Aug 2013 09:17:51 GMT",
"version": "v4"
}
] | 2013-10-30 | [
[
"Kaced",
"Tarik",
""
],
[
"Romashchenko",
"Andrei",
""
]
] | We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be extended to any unconditional linear inequalities. Some of these conditional ine... |
2008.11714 | Jia-Bin Huang | Chen Gao, Jiarui Xu, Yuliang Zou, Jia-Bin Huang | DRG: Dual Relation Graph for Human-Object Interaction Detection | ECCV 2020. Project: http://chengao.vision/DRG/ Code:
https://github.com/vt-vl-lab/DRG | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We tackle the challenging problem of human-object interaction (HOI)
detection. Existing methods either recognize the interaction of each
human-object pair in isolation or perform joint inference based on complex
appearance-based features. In this paper, we leverage an abstract
spatial-semantic representation to descr... | [
{
"created": "Wed, 26 Aug 2020 17:59:40 GMT",
"version": "v1"
}
] | 2020-08-27 | [
[
"Gao",
"Chen",
""
],
[
"Xu",
"Jiarui",
""
],
[
"Zou",
"Yuliang",
""
],
[
"Huang",
"Jia-Bin",
""
]
] | We tackle the challenging problem of human-object interaction (HOI) detection. Existing methods either recognize the interaction of each human-object pair in isolation or perform joint inference based on complex appearance-based features. In this paper, we leverage an abstract spatial-semantic representation to describ... |
2407.09033 | Byeonghyun Pak | Byeonghyun Pak, Byeongju Woo, Sunghwan Kim, Dae-hwan Kim, Hoseong Kim | Textual Query-Driven Mask Transformer for Domain Generalized
Segmentation | ECCV 2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we introduce a method to tackle Domain Generalized Semantic
Segmentation (DGSS) by utilizing domain-invariant semantic knowledge from text
embeddings of vision-language models. We employ the text embeddings as object
queries within a transformer-based segmentation framework (textual object
queries). Th... | [
{
"created": "Fri, 12 Jul 2024 06:49:16 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Jul 2024 14:27:06 GMT",
"version": "v2"
}
] | 2024-08-01 | [
[
"Pak",
"Byeonghyun",
""
],
[
"Woo",
"Byeongju",
""
],
[
"Kim",
"Sunghwan",
""
],
[
"Kim",
"Dae-hwan",
""
],
[
"Kim",
"Hoseong",
""
]
] | In this paper, we introduce a method to tackle Domain Generalized Semantic Segmentation (DGSS) by utilizing domain-invariant semantic knowledge from text embeddings of vision-language models. We employ the text embeddings as object queries within a transformer-based segmentation framework (textual object queries). Thes... |
1812.10998 | Preeti Gopal Ms. | Preeti Gopal and Sharat Chandran and Imants Svalbe and Ajit Rajwade | Learning from past scans: Tomographic reconstruction to detect new
structures | 5 pages, 8 figures, 1 table | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The need for tomographic reconstruction from sparse measurements arises when
the measurement process is potentially harmful, needs to be rapid, or is
uneconomical. In such cases, prior information from previous longitudinal scans
of the same or similar objects helps to reconstruct the current object whilst
requiring ... | [
{
"created": "Sun, 23 Dec 2018 09:45:15 GMT",
"version": "v1"
}
] | 2018-12-31 | [
[
"Gopal",
"Preeti",
""
],
[
"Chandran",
"Sharat",
""
],
[
"Svalbe",
"Imants",
""
],
[
"Rajwade",
"Ajit",
""
]
] | The need for tomographic reconstruction from sparse measurements arises when the measurement process is potentially harmful, needs to be rapid, or is uneconomical. In such cases, prior information from previous longitudinal scans of the same or similar objects helps to reconstruct the current object whilst requiring si... |
2310.19848 | Lenart Treven | Lenart Treven, Jonas H\"ubotter, Bhavya Sukhija, Florian D\"orfler,
Andreas Krause | Efficient Exploration in Continuous-time Model-based Reinforcement
Learning | null | null | null | null | cs.LG cs.RO math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning algorithms typically consider discrete-time dynamics,
even though the underlying systems are often continuous in time. In this paper,
we introduce a model-based reinforcement learning algorithm that represents
continuous-time dynamics using nonlinear ordinary differential equations
(ODEs). We c... | [
{
"created": "Mon, 30 Oct 2023 15:04:40 GMT",
"version": "v1"
}
] | 2023-11-01 | [
[
"Treven",
"Lenart",
""
],
[
"Hübotter",
"Jonas",
""
],
[
"Sukhija",
"Bhavya",
""
],
[
"Dörfler",
"Florian",
""
],
[
"Krause",
"Andreas",
""
]
] | Reinforcement learning algorithms typically consider discrete-time dynamics, even though the underlying systems are often continuous in time. In this paper, we introduce a model-based reinforcement learning algorithm that represents continuous-time dynamics using nonlinear ordinary differential equations (ODEs). We cap... |
2306.09109 | Kevis-Kokitsi Maninis | Varun Jampani, Kevis-Kokitsi Maninis, Andreas Engelhardt, Arjun
Karpur, Karen Truong, Kyle Sargent, Stefan Popov, Andr\'e Araujo, Ricardo
Martin-Brualla, Kaushal Patel, Daniel Vlasic, Vittorio Ferrari, Ameesh
Makadia, Ce Liu, Yuanzhen Li, Howard Zhou | NAVI: Category-Agnostic Image Collections with High-Quality 3D Shape and
Pose Annotations | NeurIPS 2023 camera ready. Project page:
https://navidataset.github.io | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in neural reconstruction enable high-quality 3D object
reconstruction from casually captured image collections. Current techniques
mostly analyze their progress on relatively simple image collections where
Structure-from-Motion (SfM) techniques can provide ground-truth (GT) camera
poses. We note that ... | [
{
"created": "Thu, 15 Jun 2023 13:11:30 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Oct 2023 16:12:32 GMT",
"version": "v2"
}
] | 2023-10-16 | [
[
"Jampani",
"Varun",
""
],
[
"Maninis",
"Kevis-Kokitsi",
""
],
[
"Engelhardt",
"Andreas",
""
],
[
"Karpur",
"Arjun",
""
],
[
"Truong",
"Karen",
""
],
[
"Sargent",
"Kyle",
""
],
[
"Popov",
"Stefan",
""
],
... | Recent advances in neural reconstruction enable high-quality 3D object reconstruction from casually captured image collections. Current techniques mostly analyze their progress on relatively simple image collections where Structure-from-Motion (SfM) techniques can provide ground-truth (GT) camera poses. We note that Sf... |
1610.05726 | Amol Patwardhan | Amol Patwardhan | Structured Unit Testable Templated Code for Efficient Code Review
Process | 13 pages, 12 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern software development teams are distributed across onsite and off-shore
locations. Each team has developers with varying experience levels and English
communication skills. In such a diverse development environment it is important
to maintain the software quality, coding standards, timely delivery of features
a... | [
{
"created": "Tue, 9 Aug 2016 05:26:21 GMT",
"version": "v1"
}
] | 2016-10-19 | [
[
"Patwardhan",
"Amol",
""
]
] | Modern software development teams are distributed across onsite and off-shore locations. Each team has developers with varying experience levels and English communication skills. In such a diverse development environment it is important to maintain the software quality, coding standards, timely delivery of features and... |
2212.07720 | Benny Kimelfeld | Majd Khalil, Benny Kimelfeld | The Complexity of the Shapley Value for Regular Path Queries | null | null | null | null | cs.DB | http://creativecommons.org/licenses/by/4.0/ | A path query extracts vertex tuples from a labeled graph, based on the words
that are formed by the paths connecting the vertices. We study the
computational complexity of measuring the contribution of edges and vertices to
an answer to a path query, focusing on the class of conjunctive regular path
queries. To measu... | [
{
"created": "Thu, 15 Dec 2022 10:55:04 GMT",
"version": "v1"
}
] | 2022-12-16 | [
[
"Khalil",
"Majd",
""
],
[
"Kimelfeld",
"Benny",
""
]
] | A path query extracts vertex tuples from a labeled graph, based on the words that are formed by the paths connecting the vertices. We study the computational complexity of measuring the contribution of edges and vertices to an answer to a path query, focusing on the class of conjunctive regular path queries. To measure... |
1206.0430 | Richard Southwell | Richard Southwell, Jianwei Huang, Biying Shou | Congestion Games on Weighted Directed Graphs, with Applications to
Spectrum Sharing | null | null | null | null | cs.NI cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the advance of complex large-scale networks, it is becoming increasingly
important to understand how selfish and spatially distributed individuals will
share network resources without centralized coordinations. In this paper, we
introduce the graphical congestion game with weighted edges (GCGWE) as a
general the... | [
{
"created": "Sun, 3 Jun 2012 10:57:16 GMT",
"version": "v1"
}
] | 2012-06-05 | [
[
"Southwell",
"Richard",
""
],
[
"Huang",
"Jianwei",
""
],
[
"Shou",
"Biying",
""
]
] | With the advance of complex large-scale networks, it is becoming increasingly important to understand how selfish and spatially distributed individuals will share network resources without centralized coordinations. In this paper, we introduce the graphical congestion game with weighted edges (GCGWE) as a general theor... |
1906.07887 | Kedar Tatwawadi | Kedar Tatwawadi, Shubham Chandak | Tutorial on algebraic deletion correction codes | null | null | null | null | cs.DS cs.IT eess.SP math.IT | http://creativecommons.org/licenses/by/4.0/ | The deletion channel is known to be a notoriously diffcult channel to design
error-correction codes for. In spite of this difficulty, there are some
beautiful code constructions which give some intuition about the channel and
about what good deletion codes look like. In this tutorial we will take a look
at some of th... | [
{
"created": "Wed, 19 Jun 2019 02:56:11 GMT",
"version": "v1"
}
] | 2019-06-20 | [
[
"Tatwawadi",
"Kedar",
""
],
[
"Chandak",
"Shubham",
""
]
] | The deletion channel is known to be a notoriously diffcult channel to design error-correction codes for. In spite of this difficulty, there are some beautiful code constructions which give some intuition about the channel and about what good deletion codes look like. In this tutorial we will take a look at some of them... |
2403.10484 | Rosana Montes | Rosana Montes and Liliana Herrera and Emilio Crisol | Moodle Usability Assessment Methodology using the Universal Design for
Learning perspective | preprint second version | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The application of the Universal Design for Learning framework favors the
creation of virtual educational environments for all. It requires developing
accessible content, having a usable platform, and the use of flexible didactics
and evaluations that promote constant student motivation. The present study
aims to des... | [
{
"created": "Fri, 15 Mar 2024 17:19:04 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Apr 2024 15:25:51 GMT",
"version": "v2"
}
] | 2024-04-03 | [
[
"Montes",
"Rosana",
""
],
[
"Herrera",
"Liliana",
""
],
[
"Crisol",
"Emilio",
""
]
] | The application of the Universal Design for Learning framework favors the creation of virtual educational environments for all. It requires developing accessible content, having a usable platform, and the use of flexible didactics and evaluations that promote constant student motivation. The present study aims to desig... |
2112.13310 | Wenchi Ma | Wenchi Ma, Tianxiao Zhang, Guanghui Wang | Miti-DETR: Object Detection based on Transformers with Mitigatory
Self-Attention Convergence | null | AAAI 2022 workshop | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Object Detection with Transformers (DETR) and related works reach or even
surpass the highly-optimized Faster-RCNN baseline with self-attention network
architectures. Inspired by the evidence that pure self-attention possesses a
strong inductive bias that leads to the transformer losing the expressive power
with resp... | [
{
"created": "Sun, 26 Dec 2021 03:23:59 GMT",
"version": "v1"
}
] | 2021-12-28 | [
[
"Ma",
"Wenchi",
""
],
[
"Zhang",
"Tianxiao",
""
],
[
"Wang",
"Guanghui",
""
]
] | Object Detection with Transformers (DETR) and related works reach or even surpass the highly-optimized Faster-RCNN baseline with self-attention network architectures. Inspired by the evidence that pure self-attention possesses a strong inductive bias that leads to the transformer losing the expressive power with respec... |
1311.6264 | J\"urgen M\"unch | Frank Elberzhager, Alla Rosbach, J\"urgen M\"unch, Robert Eschbach | Inspection and Test Process Integration Based on Explicit Test
Prioritization Strategies | 12 pages. The final publication is available at
http://link.springer.com/chapter/10.1007%2F978-3-642-27213-4_12 | Proceedings of the Software Quality Days (SWQD), pages 181-192,
Vienna, Austria, January 17-19 2012 | 10.1007/978-3-642-27213-4_12 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Today's software quality assurance techniques are often applied in isolation.
Consequently, synergies resulting from systematically integrating different
quality assurance activities are often not exploited. Such combinations promise
benefits, such as a reduction in quality assurance effort or higher defect
detection... | [
{
"created": "Mon, 25 Nov 2013 11:14:07 GMT",
"version": "v1"
}
] | 2013-11-26 | [
[
"Elberzhager",
"Frank",
""
],
[
"Rosbach",
"Alla",
""
],
[
"Münch",
"Jürgen",
""
],
[
"Eschbach",
"Robert",
""
]
] | Today's software quality assurance techniques are often applied in isolation. Consequently, synergies resulting from systematically integrating different quality assurance activities are often not exploited. Such combinations promise benefits, such as a reduction in quality assurance effort or higher defect detection r... |
2306.10153 | Komal Teru | Komal K. Teru | Semi-supervised Relation Extraction via Data Augmentation and
Consistency-training | Previously published at INTERPOLATE @ NeurIPS 2022 workshop | Proceedings of the 17th Conference of the European Chapter of the
Association for Computational Linguistics, 2023, 1112--1124 | null | null | cs.CL cs.IR | http://creativecommons.org/licenses/by/4.0/ | Due to the semantic complexity of the Relation extraction (RE) task,
obtaining high-quality human labelled data is an expensive and noisy process.
To improve the sample efficiency of the models, semi-supervised learning (SSL)
methods aim to leverage unlabelled data in addition to learning from limited
labelled data p... | [
{
"created": "Fri, 16 Jun 2023 19:45:42 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Teru",
"Komal K.",
""
]
] | Due to the semantic complexity of the Relation extraction (RE) task, obtaining high-quality human labelled data is an expensive and noisy process. To improve the sample efficiency of the models, semi-supervised learning (SSL) methods aim to leverage unlabelled data in addition to learning from limited labelled data poi... |
2403.10988 | Li-Yuan Tsao | Li-Yuan Tsao, Yi-Chen Lo, Chia-Che Chang, Hao-Wei Chen, Roy Tseng,
Chien Feng, Chun-Yi Lee | Boosting Flow-based Generative Super-Resolution Models via Learned Prior | Accepted to CVPR2024 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Flow-based super-resolution (SR) models have demonstrated astonishing
capabilities in generating high-quality images. However, these methods
encounter several challenges during image generation, such as grid artifacts,
exploding inverses, and suboptimal results due to a fixed sampling temperature.
To overcome these i... | [
{
"created": "Sat, 16 Mar 2024 18:04:12 GMT",
"version": "v1"
},
{
"created": "Sat, 30 Mar 2024 04:56:05 GMT",
"version": "v2"
},
{
"created": "Wed, 29 May 2024 03:12:58 GMT",
"version": "v3"
}
] | 2024-05-30 | [
[
"Tsao",
"Li-Yuan",
""
],
[
"Lo",
"Yi-Chen",
""
],
[
"Chang",
"Chia-Che",
""
],
[
"Chen",
"Hao-Wei",
""
],
[
"Tseng",
"Roy",
""
],
[
"Feng",
"Chien",
""
],
[
"Lee",
"Chun-Yi",
""
]
] | Flow-based super-resolution (SR) models have demonstrated astonishing capabilities in generating high-quality images. However, these methods encounter several challenges during image generation, such as grid artifacts, exploding inverses, and suboptimal results due to a fixed sampling temperature. To overcome these iss... |
2008.09607 | Magnus Lie Hetland | Magnus Lie Hetland | Optimal Metric Search Is Equivalent to the Minimum Dominating Set
Problem | null | null | 10.1007/978-3-030-60936-8_9 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In metric search, worst-case analysis is of little value, as the search
invariably degenerates to a linear scan for ill-behaved data. Consequently,
much effort has been expended on more nuanced descriptions of what performance
might in fact be attainable, including heuristic baselines like the AESA
family, as well as... | [
{
"created": "Fri, 21 Aug 2020 17:59:41 GMT",
"version": "v1"
}
] | 2020-11-03 | [
[
"Hetland",
"Magnus Lie",
""
]
] | In metric search, worst-case analysis is of little value, as the search invariably degenerates to a linear scan for ill-behaved data. Consequently, much effort has been expended on more nuanced descriptions of what performance might in fact be attainable, including heuristic baselines like the AESA family, as well as s... |
2406.10602 | Daniil Gurgurov | Daniil Gurgurov, Tanja B\"aumel, Tatiana Anikina | Multilingual Large Language Models and Curse of Multilinguality | null | null | 10.48550/arXiv.2406.10602 | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Multilingual Large Language Models (LLMs) have gained large popularity among
Natural Language Processing (NLP) researchers and practitioners. These models,
trained on huge datasets, show proficiency across various languages and
demonstrate effectiveness in numerous downstream tasks. This paper navigates
the landscape... | [
{
"created": "Sat, 15 Jun 2024 11:31:39 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Gurgurov",
"Daniil",
""
],
[
"Bäumel",
"Tanja",
""
],
[
"Anikina",
"Tatiana",
""
]
] | Multilingual Large Language Models (LLMs) have gained large popularity among Natural Language Processing (NLP) researchers and practitioners. These models, trained on huge datasets, show proficiency across various languages and demonstrate effectiveness in numerous downstream tasks. This paper navigates the landscape o... |
2407.15570 | Zehra Yigit | Zehra Yigit, Ertugrul Basar | Hybrid STAR-RIS Enabled Integrated Sensing and Communication | 10 pages, 7 figures | null | null | null | cs.IT eess.SP math.IT | http://creativecommons.org/licenses/by/4.0/ | Integrated sensing and communication (ISAC) is recognized as one of the key
enabling technologies for sixth-generation (6G) wireless communication
networks, facilitating diverse emerging applications and services in an energy
and cost-efficient manner. This paper proposes a multi-user multi-target ISAC
system to enab... | [
{
"created": "Mon, 22 Jul 2024 11:55:39 GMT",
"version": "v1"
}
] | 2024-07-23 | [
[
"Yigit",
"Zehra",
""
],
[
"Basar",
"Ertugrul",
""
]
] | Integrated sensing and communication (ISAC) is recognized as one of the key enabling technologies for sixth-generation (6G) wireless communication networks, facilitating diverse emerging applications and services in an energy and cost-efficient manner. This paper proposes a multi-user multi-target ISAC system to enable... |
2007.15538 | Filippo Gabriele Prattic\`o | F. Gabriele Prattic\`o, Fabrizio Lamberti (Politecnico di Torino) | Mixed-Reality Robotic Games: Design Guidelines for Effective
Entertainment with Consumer Robots | This paper is accepted for inclusion in future issue of IEEE Consumer
Electronic Magazine. Copyright IEEE 2020 | IEEE Consumer Electronics Magazine, vol. 10, no. 1, pp. 6-16, Jan.
2021 | 10.1109/MCE.2020.2988578 | null | cs.HC cs.GR cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, there has been an increasing interest in the use of robotic
technology at home. A number of service robots appeared on the market,
supporting customers in the execution of everyday tasks. Roughly at the same
time, consumer level robots started to be used also as toys or gaming
companions. However, ga... | [
{
"created": "Thu, 30 Jul 2020 15:47:17 GMT",
"version": "v1"
}
] | 2020-12-08 | [
[
"Pratticò",
"F. Gabriele",
"",
"Politecnico di Torino"
],
[
"Lamberti",
"Fabrizio",
"",
"Politecnico di Torino"
]
] | In recent years, there has been an increasing interest in the use of robotic technology at home. A number of service robots appeared on the market, supporting customers in the execution of everyday tasks. Roughly at the same time, consumer level robots started to be used also as toys or gaming companions. However, gami... |
1603.00536 | EPTCS | C\'esar A. Mu\~noz (NASA Langley Research Center), Jorge A. P\'erez
(University of Groningen) | Proceedings of the Eleventh International Workshop on Developments in
Computational Models | null | EPTCS 204, 2016 | 10.4204/EPTCS.204 | null | cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This volume contains the proceedings of DCM 2015, the 11th International
Workshop on Developments in Computational Models held on October 28, 2015 in
Cali, Colombia. DCM 2015 was organized as a one-day satellite event of the 12th
International Colloquium on Theoretical Aspects of Computing (ICTAC 2015).
Several new... | [
{
"created": "Wed, 2 Mar 2016 00:49:28 GMT",
"version": "v1"
}
] | 2016-03-03 | [
[
"Muñoz",
"César A.",
"",
"NASA Langley Research Center"
],
[
"Pérez",
"Jorge A.",
"",
"University of Groningen"
]
] | This volume contains the proceedings of DCM 2015, the 11th International Workshop on Developments in Computational Models held on October 28, 2015 in Cali, Colombia. DCM 2015 was organized as a one-day satellite event of the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015). Several new mod... |
2405.00846 | Duy Nguyen | Duy P. Nguyen and Kai-Chieh Hsu and Wenhao Yu and Jie Tan and Jaime F.
Fisac | Gameplay Filters: Safe Robot Walking through Adversarial Imagination | null | null | null | null | cs.RO cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Ensuring the safe operation of legged robots in uncertain, novel environments
is crucial to their widespread adoption. Despite recent advances in safety
filters that can keep arbitrary task-driven policies from incurring safety
failures, existing solutions for legged robot locomotion still rely on
simplified dynamics... | [
{
"created": "Wed, 1 May 2024 20:21:44 GMT",
"version": "v1"
},
{
"created": "Fri, 31 May 2024 14:26:47 GMT",
"version": "v2"
}
] | 2024-06-03 | [
[
"Nguyen",
"Duy P.",
""
],
[
"Hsu",
"Kai-Chieh",
""
],
[
"Yu",
"Wenhao",
""
],
[
"Tan",
"Jie",
""
],
[
"Fisac",
"Jaime F.",
""
]
] | Ensuring the safe operation of legged robots in uncertain, novel environments is crucial to their widespread adoption. Despite recent advances in safety filters that can keep arbitrary task-driven policies from incurring safety failures, existing solutions for legged robot locomotion still rely on simplified dynamics a... |
2206.11728 | Gunnar Kudrjavets | Gunnar Kudrjavets (University of Groningen), Jeff Thomas (Meta
Platforms, Inc.), Aditya Kumar (Snap, Inc.), Nachiappan Nagappan (Meta
Platforms, Inc.), and Ayushi Rastogi (University of Groningen) | There Ain't No Such Thing as a Free Custom Memory Allocator | 4 pages. To be published in 38th IEEE International Conference on
Software Maintenance and Evolution (ICSME 2022), Oct 3-7, 2022, Limassol,
Cyprus | null | 10.1109/ICSME55016.2022.00079 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using custom memory allocators is an efficient performance optimization
technique. However, dependency on a custom allocator can introduce several
maintenance-related issues. We present lessons learned from the industry and
provide critical guidance for using custom memory allocators and enumerate
various challenges ... | [
{
"created": "Thu, 23 Jun 2022 14:26:50 GMT",
"version": "v1"
}
] | 2022-12-23 | [
[
"Kudrjavets",
"Gunnar",
"",
"University of Groningen"
],
[
"Thomas",
"Jeff",
"",
"Meta\n Platforms, Inc."
],
[
"Kumar",
"Aditya",
"",
"Snap, Inc."
],
[
"Nagappan",
"Nachiappan",
"",
"Meta\n Platforms, Inc."
],
[
"Rastogi",
"... | Using custom memory allocators is an efficient performance optimization technique. However, dependency on a custom allocator can introduce several maintenance-related issues. We present lessons learned from the industry and provide critical guidance for using custom memory allocators and enumerate various challenges as... |
2407.10943 | Hanqing Wang | Hanqing Wang, Jiahe Chen, Wensi Huang, Qingwei Ben, Tai Wang, Boyu Mi,
Tao Huang, Siheng Zhao, Yilun Chen, Sizhe Yang, Peizhou Cao, Wenye Yu, Zichao
Ye, Jialun Li, Junfeng Long, Zirui Wang, Huiling Wang, Ying Zhao, Zhongying
Tu, Yu Qiao, Dahua Lin, Jiangmiao Pang | GRUtopia: Dream General Robots in a City at Scale | null | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent works have been exploring the scaling laws in the field of Embodied
AI. Given the prohibitive costs of collecting real-world data, we believe the
Simulation-to-Real (Sim2Real) paradigm is a crucial step for scaling the
learning of embodied models. This paper introduces project GRUtopia, the first
simulated int... | [
{
"created": "Mon, 15 Jul 2024 17:40:46 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Wang",
"Hanqing",
""
],
[
"Chen",
"Jiahe",
""
],
[
"Huang",
"Wensi",
""
],
[
"Ben",
"Qingwei",
""
],
[
"Wang",
"Tai",
""
],
[
"Mi",
"Boyu",
""
],
[
"Huang",
"Tao",
""
],
[
"Zhao",
"Siheng",
... | Recent works have been exploring the scaling laws in the field of Embodied AI. Given the prohibitive costs of collecting real-world data, we believe the Simulation-to-Real (Sim2Real) paradigm is a crucial step for scaling the learning of embodied models. This paper introduces project GRUtopia, the first simulated inter... |
1903.04554 | Ali Rahmati | Ali Rahmati, Seyyedali Hosseinalipour, Huaiyu Dai | Optimal Time Allocation in VANETs Advertising: A Price-based Approach
using Stackelberg Game | 6 pages, 4 figures | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vehicular ad-hoc networks (VANETs) have recently attracted a lot of attention
due to their immense potentials and applications. Wide range of coverage and
accessibility to end users make VANETs a good target for commercial companies.
In this paper, we consider a scenario in which advertising companies aim to
dissemin... | [
{
"created": "Mon, 11 Mar 2019 19:21:54 GMT",
"version": "v1"
}
] | 2019-03-13 | [
[
"Rahmati",
"Ali",
""
],
[
"Hosseinalipour",
"Seyyedali",
""
],
[
"Dai",
"Huaiyu",
""
]
] | Vehicular ad-hoc networks (VANETs) have recently attracted a lot of attention due to their immense potentials and applications. Wide range of coverage and accessibility to end users make VANETs a good target for commercial companies. In this paper, we consider a scenario in which advertising companies aim to disseminat... |
1703.08440 | Kojo Sarfo Gyamfi | Kojo Sarfo Gyamfi, James Brusey and Andrew Hunt | K-Means Clustering using Tabu Search with Quantized Means | World Conference on Engineering and Computer Science | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Tabu Search (TS) metaheuristic has been proposed for K-Means clustering
as an alternative to Lloyd's algorithm, which for all its ease of
implementation and fast runtime, has the major drawback of being trapped at
local optima. While the TS approach can yield superior performance, it involves
a high computational... | [
{
"created": "Fri, 24 Mar 2017 14:59:06 GMT",
"version": "v1"
}
] | 2017-03-27 | [
[
"Gyamfi",
"Kojo Sarfo",
""
],
[
"Brusey",
"James",
""
],
[
"Hunt",
"Andrew",
""
]
] | The Tabu Search (TS) metaheuristic has been proposed for K-Means clustering as an alternative to Lloyd's algorithm, which for all its ease of implementation and fast runtime, has the major drawback of being trapped at local optima. While the TS approach can yield superior performance, it involves a high computational c... |
2205.05192 | Cynthia Liem | Han-Yin Huang and Cynthia C. S. Liem | Social Inclusion in Curated Contexts: Insights from Museum Practices | in Proceedings of the 2022 ACM Conference on Fairness,
Accountability, and Transparency (FAccT '22), June 21-24, 2022, Seoul,
Republic of Korea | null | 10.1145/3531146.3533095 | null | cs.LG cs.AI cs.CY | http://creativecommons.org/licenses/by/4.0/ | Artificial intelligence literature suggests that minority and fragile
communities in society can be negatively impacted by machine learning
algorithms due to inherent biases in the design process, which lead to socially
exclusive decisions and policies. Faced with similar challenges in dealing with
an increasingly di... | [
{
"created": "Tue, 10 May 2022 22:22:12 GMT",
"version": "v1"
}
] | 2022-05-12 | [
[
"Huang",
"Han-Yin",
""
],
[
"Liem",
"Cynthia C. S.",
""
]
] | Artificial intelligence literature suggests that minority and fragile communities in society can be negatively impacted by machine learning algorithms due to inherent biases in the design process, which lead to socially exclusive decisions and policies. Faced with similar challenges in dealing with an increasingly dive... |
2107.04020 | Xuejing Lei | Xuejing Lei, Ganning Zhao, Kaitai Zhang, C.-C. Jay Kuo | TGHop: An Explainable, Efficient and Lightweight Method for Texture
Generation | arXiv admin note: substantial text overlap with arXiv:2009.01376 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An explainable, efficient and lightweight method for texture generation,
called TGHop (an acronym of Texture Generation PixelHop), is proposed in this
work. Although synthesis of visually pleasant texture can be achieved by deep
neural networks, the associated models are large in size, difficult to explain
in theory,... | [
{
"created": "Thu, 8 Jul 2021 17:56:58 GMT",
"version": "v1"
}
] | 2021-07-09 | [
[
"Lei",
"Xuejing",
""
],
[
"Zhao",
"Ganning",
""
],
[
"Zhang",
"Kaitai",
""
],
[
"Kuo",
"C. -C. Jay",
""
]
] | An explainable, efficient and lightweight method for texture generation, called TGHop (an acronym of Texture Generation PixelHop), is proposed in this work. Although synthesis of visually pleasant texture can be achieved by deep neural networks, the associated models are large in size, difficult to explain in theory, a... |
2011.13056 | Huseyin Birkan Yilmaz | Mehmet Sukru Kuran and H. Birkan Yilmaz and Ilker Demirkol and Nariman
Farsad and Andrea Goldsmith | A Survey on Modulation Techniques in Molecular Communication via
Diffusion | Preprint of the accepted manuscript for publication in IEEE Surveys
and Tutorials | null | null | null | cs.ET cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This survey paper focuses on modulation aspects of molecular communication,
an emerging field focused on building biologically-inspired systems that embed
data within chemical signals. The primary challenges in designing these systems
are how to encode and modulate information onto chemical signals, and how to
design... | [
{
"created": "Wed, 25 Nov 2020 23:00:50 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Dec 2020 09:32:37 GMT",
"version": "v2"
}
] | 2020-12-29 | [
[
"Kuran",
"Mehmet Sukru",
""
],
[
"Yilmaz",
"H. Birkan",
""
],
[
"Demirkol",
"Ilker",
""
],
[
"Farsad",
"Nariman",
""
],
[
"Goldsmith",
"Andrea",
""
]
] | This survey paper focuses on modulation aspects of molecular communication, an emerging field focused on building biologically-inspired systems that embed data within chemical signals. The primary challenges in designing these systems are how to encode and modulate information onto chemical signals, and how to design a... |
1105.4540 | Matt Malloy | Matthew Malloy and Robert Nowak | On the Limits of Sequential Testing in High Dimensions | Asilomar 2011 | null | null | null | cs.IT math.IT math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents results pertaining to sequential methods for support
recovery of sparse signals in noise. Specifically, we show that any sequential
measurement procedure fails provided the average number of measurements per
dimension grows slower then log s / D(f0||f1) where s is the level of sparsity,
and D(f0||... | [
{
"created": "Mon, 23 May 2011 15:58:03 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Jul 2011 20:13:41 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Oct 2011 16:12:53 GMT",
"version": "v3"
}
] | 2011-10-19 | [
[
"Malloy",
"Matthew",
""
],
[
"Nowak",
"Robert",
""
]
] | This paper presents results pertaining to sequential methods for support recovery of sparse signals in noise. Specifically, we show that any sequential measurement procedure fails provided the average number of measurements per dimension grows slower then log s / D(f0||f1) where s is the level of sparsity, and D(f0||f1... |
1905.00919 | Mohamed Baza | Ahmed Shafee, Mohamed Baza, Douglas A. Talbert, Mostafa M. Fouda,
Mahmoud Nabil, Mohamed Mahmoud | Mimic Learning to Generate a Shareable Network Intrusion Detection Model | null | null | null | null | cs.CR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Purveyors of malicious network attacks continue to increase the complexity
and the sophistication of their techniques, and their ability to evade
detection continues to improve as well. Hence, intrusion detection systems must
also evolve to meet these increasingly challenging threats. Machine learning is
often used t... | [
{
"created": "Thu, 2 May 2019 18:14:24 GMT",
"version": "v1"
},
{
"created": "Sat, 5 Oct 2019 17:39:51 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Feb 2020 20:14:47 GMT",
"version": "v3"
}
] | 2020-02-20 | [
[
"Shafee",
"Ahmed",
""
],
[
"Baza",
"Mohamed",
""
],
[
"Talbert",
"Douglas A.",
""
],
[
"Fouda",
"Mostafa M.",
""
],
[
"Nabil",
"Mahmoud",
""
],
[
"Mahmoud",
"Mohamed",
""
]
] | Purveyors of malicious network attacks continue to increase the complexity and the sophistication of their techniques, and their ability to evade detection continues to improve as well. Hence, intrusion detection systems must also evolve to meet these increasingly challenging threats. Machine learning is often used to ... |
1610.06721 | Cosimo Anglano | Cosimo Anglano, Massimo Canonico, Marco Guazzone | Forensic Analysis of the ChatSecure Instant Messaging Application on
Android Smartphones | null | Digital Investigation, Volume 19, December 2016, Pages 44-59 | 10.1016/j.diin.2016.10.001 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the forensic analysis of the artifacts generated on Android
smartphones by ChatSecure, a secure Instant Messaging application that provides
strong encryption for transmitted and locally-stored data to ensure the privacy
of its users.
We show that ChatSecure stores local copies of both exchanged messages ... | [
{
"created": "Fri, 21 Oct 2016 09:34:33 GMT",
"version": "v1"
}
] | 2016-10-24 | [
[
"Anglano",
"Cosimo",
""
],
[
"Canonico",
"Massimo",
""
],
[
"Guazzone",
"Marco",
""
]
] | We present the forensic analysis of the artifacts generated on Android smartphones by ChatSecure, a secure Instant Messaging application that provides strong encryption for transmitted and locally-stored data to ensure the privacy of its users. We show that ChatSecure stores local copies of both exchanged messages and ... |
2401.11107 | Zhen Chen | Zhen Chen, Jingping Liu, Deqing Yang, Yanghua Xiao, Huimin Xu, Zongyu
Wang, Rui Xie and Yunsen Xian | Exploiting Duality in Open Information Extraction with Predicate Prompt | null | null | null | null | cs.CL cs.IR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Open information extraction (OpenIE) aims to extract the schema-free triplets
in the form of (\emph{subject}, \emph{predicate}, \emph{object}) from a given
sentence. Compared with general information extraction (IE), OpenIE poses more
challenges for the IE models, {especially when multiple complicated triplets
exist ... | [
{
"created": "Sat, 20 Jan 2024 03:55:17 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Chen",
"Zhen",
""
],
[
"Liu",
"Jingping",
""
],
[
"Yang",
"Deqing",
""
],
[
"Xiao",
"Yanghua",
""
],
[
"Xu",
"Huimin",
""
],
[
"Wang",
"Zongyu",
""
],
[
"Xie",
"Rui",
""
],
[
"Xian",
"Yunsen",
... | Open information extraction (OpenIE) aims to extract the schema-free triplets in the form of (\emph{subject}, \emph{predicate}, \emph{object}) from a given sentence. Compared with general information extraction (IE), OpenIE poses more challenges for the IE models, {especially when multiple complicated triplets exist in... |
2404.03555 | Botond Barta | Botond Barta, Dorina Lakatos, Attila Nagy, Mil\'an Konor Nyist, Judit
\'Acs | From News to Summaries: Building a Hungarian Corpus for Extractive and
Abstractive Summarization | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Training summarization models requires substantial amounts of training data.
However for less resourceful languages like Hungarian, openly available models
and datasets are notably scarce. To address this gap our paper introduces
HunSum-2 an open-source Hungarian corpus suitable for training abstractive and
extractiv... | [
{
"created": "Thu, 4 Apr 2024 16:07:06 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Apr 2024 08:05:13 GMT",
"version": "v2"
}
] | 2024-04-15 | [
[
"Barta",
"Botond",
""
],
[
"Lakatos",
"Dorina",
""
],
[
"Nagy",
"Attila",
""
],
[
"Nyist",
"Milán Konor",
""
],
[
"Ács",
"Judit",
""
]
] | Training summarization models requires substantial amounts of training data. However for less resourceful languages like Hungarian, openly available models and datasets are notably scarce. To address this gap our paper introduces HunSum-2 an open-source Hungarian corpus suitable for training abstractive and extractive ... |
2406.13012 | Chi-Hua Wang | Joshua Ward, Chi-Hua Wang, Guang Cheng | Data Plagiarism Index: Characterizing the Privacy Risk of Data-Copying
in Tabular Generative Models | null | null | null | null | cs.LG cs.CR stat.ML | http://creativecommons.org/licenses/by/4.0/ | The promise of tabular generative models is to produce realistic synthetic
data that can be shared and safely used without dangerous leakage of
information from the training set. In evaluating these models, a variety of
methods have been proposed to measure the tendency to copy data from the
training dataset when gen... | [
{
"created": "Tue, 18 Jun 2024 19:05:24 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Ward",
"Joshua",
""
],
[
"Wang",
"Chi-Hua",
""
],
[
"Cheng",
"Guang",
""
]
] | The promise of tabular generative models is to produce realistic synthetic data that can be shared and safely used without dangerous leakage of information from the training set. In evaluating these models, a variety of methods have been proposed to measure the tendency to copy data from the training dataset when gener... |
2102.01723 | Amir Yazdanbakhsh | Amir Yazdanbakhsh, Christof Angermueller, Berkin Akin, Yanqi Zhou,
Albin Jones, Milad Hashemi, Kevin Swersky, Satrajit Chatterjee, Ravi
Narayanaswami, James Laudon | Apollo: Transferable Architecture Exploration | 10 pages, 5 figures, Accepted to Workshop on ML for Systems at the
34th Conference on Neural Information Processing Systems (NeurIPS 2020) | null | null | null | cs.LG cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The looming end of Moore's Law and ascending use of deep learning drives the
design of custom accelerators that are optimized for specific neural
architectures. Architecture exploration for such accelerators forms a
challenging constrained optimization problem over a complex, high-dimensional,
and structured input sp... | [
{
"created": "Tue, 2 Feb 2021 19:36:02 GMT",
"version": "v1"
}
] | 2021-02-04 | [
[
"Yazdanbakhsh",
"Amir",
""
],
[
"Angermueller",
"Christof",
""
],
[
"Akin",
"Berkin",
""
],
[
"Zhou",
"Yanqi",
""
],
[
"Jones",
"Albin",
""
],
[
"Hashemi",
"Milad",
""
],
[
"Swersky",
"Kevin",
""
],
[
... | The looming end of Moore's Law and ascending use of deep learning drives the design of custom accelerators that are optimized for specific neural architectures. Architecture exploration for such accelerators forms a challenging constrained optimization problem over a complex, high-dimensional, and structured input spac... |
1406.1557 | EPTCS | Harsh Raju Chamarthi (Northeastern Univeristy), Peter C. Dillinger
(Northeastern Univeristy), Panagiotis Manolios (Northeastern Univeristy) | Data Definitions in the ACL2 Sedan | In Proceedings ACL2 2014, arXiv:1406.1238 | EPTCS 152, 2014, pp. 27-48 | 10.4204/EPTCS.152.3 | null | cs.PL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a data definition framework that enables the convenient
specification of data types in ACL2s, the ACL2 Sedan. Our primary motivation
for developing the data definition framework was pedagogical. We were teaching
undergraduate students how to reason about programs using ACL2s and wanted to
provide them with... | [
{
"created": "Fri, 6 Jun 2014 01:47:21 GMT",
"version": "v1"
}
] | 2014-06-09 | [
[
"Chamarthi",
"Harsh Raju",
"",
"Northeastern Univeristy"
],
[
"Dillinger",
"Peter C.",
"",
"Northeastern Univeristy"
],
[
"Manolios",
"Panagiotis",
"",
"Northeastern Univeristy"
]
] | We present a data definition framework that enables the convenient specification of data types in ACL2s, the ACL2 Sedan. Our primary motivation for developing the data definition framework was pedagogical. We were teaching undergraduate students how to reason about programs using ACL2s and wanted to provide them with a... |
2112.01402 | Rahul Rahaman | Dipika Singhania, Rahul Rahaman, Angela Yao | Iterative Contrast-Classify For Semi-supervised Temporal Action
Segmentation | AAAI-2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Temporal action segmentation classifies the action of each frame in (long)
video sequences. Due to the high cost of frame-wise labeling, we propose the
first semi-supervised method for temporal action segmentation. Our method
hinges on unsupervised representation learning, which, for temporal action
segmentation, pos... | [
{
"created": "Thu, 2 Dec 2021 16:47:24 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Dec 2021 14:56:40 GMT",
"version": "v2"
}
] | 2021-12-09 | [
[
"Singhania",
"Dipika",
""
],
[
"Rahaman",
"Rahul",
""
],
[
"Yao",
"Angela",
""
]
] | Temporal action segmentation classifies the action of each frame in (long) video sequences. Due to the high cost of frame-wise labeling, we propose the first semi-supervised method for temporal action segmentation. Our method hinges on unsupervised representation learning, which, for temporal action segmentation, poses... |
2211.02448 | Dongchao Yang | Dongchao Yang, Songxiang Liu, Jianwei Yu, Helin Wang, Chao Weng,
Yuexian Zou | NoreSpeech: Knowledge Distillation based Conditional Diffusion Model for
Noise-robust Expressive TTS | Submitted to ICASSP2023 | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Expressive text-to-speech (TTS) can synthesize a new speaking style by
imiating prosody and timbre from a reference audio, which faces the following
challenges: (1) The highly dynamic prosody information in the reference audio
is difficult to extract, especially, when the reference audio contains
background noise. (2... | [
{
"created": "Fri, 4 Nov 2022 13:32:58 GMT",
"version": "v1"
}
] | 2022-11-07 | [
[
"Yang",
"Dongchao",
""
],
[
"Liu",
"Songxiang",
""
],
[
"Yu",
"Jianwei",
""
],
[
"Wang",
"Helin",
""
],
[
"Weng",
"Chao",
""
],
[
"Zou",
"Yuexian",
""
]
] | Expressive text-to-speech (TTS) can synthesize a new speaking style by imiating prosody and timbre from a reference audio, which faces the following challenges: (1) The highly dynamic prosody information in the reference audio is difficult to extract, especially, when the reference audio contains background noise. (2) ... |
2403.02810 | Chu Wang | Chu Wang, Jinhong Wu, Yanzhi Wang, Zhijian Zha, Qi Zhou | Dynamic Gaussian Graph Operator: Learning parametric partial
differential equations in arbitrary discrete mechanics problems | The number of figures is 13. The number of tables is 7. The number of
words is 9854 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning methods have access to be employed for solving physical systems
governed by parametric partial differential equations (PDEs) due to massive
scientific data. It has been refined to operator learning that focuses on
learning non-linear mapping between infinite-dimensional function spaces,
offering interfa... | [
{
"created": "Tue, 5 Mar 2024 09:25:31 GMT",
"version": "v1"
}
] | 2024-03-06 | [
[
"Wang",
"Chu",
""
],
[
"Wu",
"Jinhong",
""
],
[
"Wang",
"Yanzhi",
""
],
[
"Zha",
"Zhijian",
""
],
[
"Zhou",
"Qi",
""
]
] | Deep learning methods have access to be employed for solving physical systems governed by parametric partial differential equations (PDEs) due to massive scientific data. It has been refined to operator learning that focuses on learning non-linear mapping between infinite-dimensional function spaces, offering interface... |
1908.07668 | Sara Billey | Molly Baird, Sara C. Billey, Erik D. Demaine, Martin L. Demaine, David
Eppstein, S\'andor Fekete, Graham Gordon, Sean Griffin, Joseph S. B.
Mitchell, Joshua P. Swanson | Existence and hardness of conveyor belts | null | Electronic J. Combinatorics 27 (4), Paper 4.25, 2020 | 10.37236/9782 | null | cs.CG math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An open problem of Manuel Abellanas asks whether every set of disjoint closed
unit disks in the plane can be connected by a conveyor belt, which means a
tight simple closed curve that touches the boundary of each disk, possibly
multiple times. We prove three main results. First, for unit disks whose
centers are both ... | [
{
"created": "Wed, 21 Aug 2019 01:38:33 GMT",
"version": "v1"
}
] | 2020-11-09 | [
[
"Baird",
"Molly",
""
],
[
"Billey",
"Sara C.",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Eppstein",
"David",
""
],
[
"Fekete",
"Sándor",
""
],
[
"Gordon",
"Graham",
""
],
[
... | An open problem of Manuel Abellanas asks whether every set of disjoint closed unit disks in the plane can be connected by a conveyor belt, which means a tight simple closed curve that touches the boundary of each disk, possibly multiple times. We prove three main results. First, for unit disks whose centers are both $x... |
1806.08274 | Pallavi Athe | Pallavi Athe, Yatindra Nath Singh | Impact Zone Analysis of p-Cycle | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pre-configured cycle (p-Cycle) method has been studied in literature
extensively for optical network protection. A large p-cycle has high capacity
efficiency and can protect a large number of nodes against the single link
failure scenarios. All the links protected by such a p-cycle lose protection
when the p-cycle is... | [
{
"created": "Thu, 21 Jun 2018 14:50:15 GMT",
"version": "v1"
}
] | 2018-06-22 | [
[
"Athe",
"Pallavi",
""
],
[
"Singh",
"Yatindra Nath",
""
]
] | Pre-configured cycle (p-Cycle) method has been studied in literature extensively for optical network protection. A large p-cycle has high capacity efficiency and can protect a large number of nodes against the single link failure scenarios. All the links protected by such a p-cycle lose protection when the p-cycle is c... |
2105.10310 | Arnaud Boutillon | Arnaud Boutillon, Pierre-Henri Conze, Christelle Pons, Val\'erie
Burdin, Bhushan Borotikar | Multi-Task, Multi-Domain Deep Segmentation with Shared Representations
and Contrastive Regularization for Sparse Pediatric Datasets | 11 pages, 4 figures, 2 tables, accepted at the 24th International
Conference on Medical Image Computing and Computer-Assisted Intervention
(MICCAI 2021) | null | 10.1007/978-3-030-87193-2_23 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic segmentation of magnetic resonance (MR) images is crucial for
morphological evaluation of the pediatric musculoskeletal system in clinical
practice. However, the accuracy and generalization performance of individual
segmentation models are limited due to the restricted amount of annotated
pediatric data. He... | [
{
"created": "Fri, 21 May 2021 12:26:05 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Feb 2022 09:11:30 GMT",
"version": "v2"
}
] | 2022-02-03 | [
[
"Boutillon",
"Arnaud",
""
],
[
"Conze",
"Pierre-Henri",
""
],
[
"Pons",
"Christelle",
""
],
[
"Burdin",
"Valérie",
""
],
[
"Borotikar",
"Bhushan",
""
]
] | Automatic segmentation of magnetic resonance (MR) images is crucial for morphological evaluation of the pediatric musculoskeletal system in clinical practice. However, the accuracy and generalization performance of individual segmentation models are limited due to the restricted amount of annotated pediatric data. Henc... |
2107.05278 | Erwin de Gelder | Erwin de Gelder, Eric Cator, Jan-Pieter Paardekooper, Olaf Op den
Camp, Bart De Schutter | Constrained Sampling from a Kernel Density Estimator to Generate
Scenarios for the Assessment of Automated Vehicles | 6 pages, 3 figures, to be published in the proceedings of the IEEE
Intelligent Vehicle Symposium Workshops (IV workshop) | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | The safety assessment of automated vehicles (AVs) is an important aspect of
the development cycle of AVs. A scenario-based assessment approach is accepted
by many players in the field as part of the complete safety assessment. A
scenario is a representation of a situation on the road to which the AV needs
to respond ... | [
{
"created": "Mon, 12 Jul 2021 09:28:25 GMT",
"version": "v1"
}
] | 2021-07-13 | [
[
"de Gelder",
"Erwin",
""
],
[
"Cator",
"Eric",
""
],
[
"Paardekooper",
"Jan-Pieter",
""
],
[
"Camp",
"Olaf Op den",
""
],
[
"De Schutter",
"Bart",
""
]
] | The safety assessment of automated vehicles (AVs) is an important aspect of the development cycle of AVs. A scenario-based assessment approach is accepted by many players in the field as part of the complete safety assessment. A scenario is a representation of a situation on the road to which the AV needs to respond ap... |
2307.16713 | Haozhen Zhang | Haozhen Zhang, Le Yu, Xi Xiao, Qing Li, Francesco Mercaldo, Xiapu Luo,
Qixu Liu | TFE-GNN: A Temporal Fusion Encoder Using Graph Neural Networks for
Fine-grained Encrypted Traffic Classification | Accepted by The Web Conference 2023 (WWW'23). The code will be
available with our incoming future work | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Encrypted traffic classification is receiving widespread attention from
researchers and industrial companies. However, the existing methods only
extract flow-level features, failing to handle short flows because of
unreliable statistical properties, or treat the header and payload equally,
failing to mine the potenti... | [
{
"created": "Mon, 31 Jul 2023 14:32:40 GMT",
"version": "v1"
}
] | 2023-08-01 | [
[
"Zhang",
"Haozhen",
""
],
[
"Yu",
"Le",
""
],
[
"Xiao",
"Xi",
""
],
[
"Li",
"Qing",
""
],
[
"Mercaldo",
"Francesco",
""
],
[
"Luo",
"Xiapu",
""
],
[
"Liu",
"Qixu",
""
]
] | Encrypted traffic classification is receiving widespread attention from researchers and industrial companies. However, the existing methods only extract flow-level features, failing to handle short flows because of unreliable statistical properties, or treat the header and payload equally, failing to mine the potential... |
2407.08135 | Yinfeng Zhu | Yinfeng Zhu | A quadratic upper bound on the reset thresholds of synchronizing
automata containing a transitive permutation group | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For any synchronizing $n$-state deterministic automaton, \v{C}ern\'{y}
conjectures the existence of a synchronizing word of length at most $(n-1)^2$.
We prove that there exists a synchronizing word of length at most $2n^2 - 7n +
7$ for every synchronizing $n$-state deterministic automaton that satisfies the
following... | [
{
"created": "Thu, 11 Jul 2024 02:17:49 GMT",
"version": "v1"
}
] | 2024-07-12 | [
[
"Zhu",
"Yinfeng",
""
]
] | For any synchronizing $n$-state deterministic automaton, \v{C}ern\'{y} conjectures the existence of a synchronizing word of length at most $(n-1)^2$. We prove that there exists a synchronizing word of length at most $2n^2 - 7n + 7$ for every synchronizing $n$-state deterministic automaton that satisfies the following t... |
2103.05424 | Mauricio Aniche | Chris Langhout and Maur\'icio Aniche | Atoms of Confusion in Java | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although writing code seems trivial at times, problems arise when humans
misinterpret what the code actually does. One of the potential causes are
"atoms of confusion", the smallest possible patterns of misinterpretable source
code. Previous research has investigated the impact of atoms of confusion in C
code. Result... | [
{
"created": "Mon, 8 Mar 2021 09:04:05 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Mar 2021 07:31:27 GMT",
"version": "v2"
}
] | 2021-03-11 | [
[
"Langhout",
"Chris",
""
],
[
"Aniche",
"Maurício",
""
]
] | Although writing code seems trivial at times, problems arise when humans misinterpret what the code actually does. One of the potential causes are "atoms of confusion", the smallest possible patterns of misinterpretable source code. Previous research has investigated the impact of atoms of confusion in C code. Results ... |
1003.4627 | Dejan Spasov | Dejan Spasov | Unique and Minimum Distance Decoding of Linear Codes with Reduced
Complexity | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that for (systematic) linear codes the time complexity of unique
decoding is O(n^{2}q^{nRH(delta/2/R)}) and the time complexity of minimum
distance decoding is O(n^{2}q^{nRH(delta/R)}). The proposed algorithm inspects
all error patterns in the information set of the received message of weight
less than d/2 or... | [
{
"created": "Wed, 24 Mar 2010 12:45:27 GMT",
"version": "v1"
}
] | 2010-03-25 | [
[
"Spasov",
"Dejan",
""
]
] | We show that for (systematic) linear codes the time complexity of unique decoding is O(n^{2}q^{nRH(delta/2/R)}) and the time complexity of minimum distance decoding is O(n^{2}q^{nRH(delta/R)}). The proposed algorithm inspects all error patterns in the information set of the received message of weight less than d/2 or d... |
2112.04036 | Mohammad Wardat | Mohammad Wardat, Breno Dantas Cruz, Wei Le, Hridesh Rajan | DeepDiagnosis: Automatically Diagnosing Faults and Recommending
Actionable Fixes in Deep Learning Programs | Accepted at ICSE 2022 | null | null | null | cs.SE cs.LG | http://creativecommons.org/licenses/by/4.0/ | Deep Neural Networks (DNNs) are used in a wide variety of applications.
However, as in any software application, DNN-based apps are afflicted with
bugs. Previous work observed that DNN bug fix patterns are different from
traditional bug fix patterns. Furthermore, those buggy models are non-trivial
to diagnose and fix... | [
{
"created": "Tue, 7 Dec 2021 23:15:23 GMT",
"version": "v1"
}
] | 2021-12-09 | [
[
"Wardat",
"Mohammad",
""
],
[
"Cruz",
"Breno Dantas",
""
],
[
"Le",
"Wei",
""
],
[
"Rajan",
"Hridesh",
""
]
] | Deep Neural Networks (DNNs) are used in a wide variety of applications. However, as in any software application, DNN-based apps are afflicted with bugs. Previous work observed that DNN bug fix patterns are different from traditional bug fix patterns. Furthermore, those buggy models are non-trivial to diagnose and fix d... |
2407.11852 | Marcel Parciak | Marcel Parciak, Brecht Vandevoort, Frank Neven, Liesbet M. Peeters,
Stijn Vansummeren | Schema Matching with Large Language Models: an Experimental Study | Accepted at the 2nd International Workshop on Tabular Data Analysis
(TaDA24), collocated with the 50th International Conference on Very Large
Data Bases (VLDB 2024) Guangzhou, China - August 29, 2024 | null | null | null | cs.DB cs.AI | http://creativecommons.org/licenses/by/4.0/ | Large Language Models (LLMs) have shown useful applications in a variety of
tasks, including data wrangling. In this paper, we investigate the use of an
off-the-shelf LLM for schema matching. Our objective is to identify semantic
correspondences between elements of two relational schemas using only names and
descript... | [
{
"created": "Tue, 16 Jul 2024 15:33:00 GMT",
"version": "v1"
}
] | 2024-07-17 | [
[
"Parciak",
"Marcel",
""
],
[
"Vandevoort",
"Brecht",
""
],
[
"Neven",
"Frank",
""
],
[
"Peeters",
"Liesbet M.",
""
],
[
"Vansummeren",
"Stijn",
""
]
] | Large Language Models (LLMs) have shown useful applications in a variety of tasks, including data wrangling. In this paper, we investigate the use of an off-the-shelf LLM for schema matching. Our objective is to identify semantic correspondences between elements of two relational schemas using only names and descriptio... |
2301.03364 | Rodrigo Hernang\'omez | Rodrigo Hernang\'omez, Alexandros Palaios, Cara Watermann, Daniel
Sch\"aufele, Philipp Geuer, Rafail Ismayilov, Mohammad Parvini, Anton Krause,
Martin Kasparick, Thomas Neugebauer, Oscar D. Ramos-Cantor, Hugues
Tchouankem, Jose Leon Calvo, Bo Chen, Gerhard Fettweis, S{\l}awomir
Sta\'nczak | Toward an AI-enabled Connected Industry: AGV Communication and Sensor
Measurement Datasets | 7 pages, 3 figures. Published at IEEE Communications Magazine. IEEE
Copyright protected. Datasets available at
https://ieee-dataport.org/open-access/ai4mobile-industrial-wireless-datasets-iv2v-and-iv2i | in IEEE Communications Magazine, vol. 62, no. 4, pp. 90-95, April
2024 | 10.1109/MCOM.001.2300494 | null | cs.NI cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents two wireless measurement campaigns in industrial
testbeds: industrial Vehicle-to-vehicle (iV2V) and industrial
Vehicle-to-infrastructure plus Sensor (iV2I+), together with detailed
information about the two captured datasets. iV2V covers sidelink communication
scenarios between Automated Guided Ve... | [
{
"created": "Tue, 20 Dec 2022 15:04:20 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Jan 2023 11:29:39 GMT",
"version": "v2"
},
{
"created": "Mon, 20 Mar 2023 13:41:37 GMT",
"version": "v3"
},
{
"created": "Tue, 29 Aug 2023 11:18:43 GMT",
"version": "v4"
},
{
"c... | 2024-04-16 | [
[
"Hernangómez",
"Rodrigo",
""
],
[
"Palaios",
"Alexandros",
""
],
[
"Watermann",
"Cara",
""
],
[
"Schäufele",
"Daniel",
""
],
[
"Geuer",
"Philipp",
""
],
[
"Ismayilov",
"Rafail",
""
],
[
"Parvini",
"Mohammad",
... | This paper presents two wireless measurement campaigns in industrial testbeds: industrial Vehicle-to-vehicle (iV2V) and industrial Vehicle-to-infrastructure plus Sensor (iV2I+), together with detailed information about the two captured datasets. iV2V covers sidelink communication scenarios between Automated Guided Vehi... |
2109.10254 | Youngseog Chung | Youngseog Chung, Ian Char, Han Guo, Jeff Schneider, Willie Neiswanger | Uncertainty Toolbox: an Open-Source Library for Assessing, Visualizing,
and Improving Uncertainty Quantification | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With increasing deployment of machine learning systems in various real-world
tasks, there is a greater need for accurate quantification of predictive
uncertainty. While the common goal in uncertainty quantification (UQ) in
machine learning is to approximate the true distribution of the target data,
many works in UQ t... | [
{
"created": "Tue, 21 Sep 2021 15:32:06 GMT",
"version": "v1"
}
] | 2021-09-22 | [
[
"Chung",
"Youngseog",
""
],
[
"Char",
"Ian",
""
],
[
"Guo",
"Han",
""
],
[
"Schneider",
"Jeff",
""
],
[
"Neiswanger",
"Willie",
""
]
] | With increasing deployment of machine learning systems in various real-world tasks, there is a greater need for accurate quantification of predictive uncertainty. While the common goal in uncertainty quantification (UQ) in machine learning is to approximate the true distribution of the target data, many works in UQ ten... |
2311.14007 | Liangrun Da | Liangrun Da, Martin Kleppmann | Extending JSON CRDTs with Move Operations | 7 pages, 4 figures | null | 10.1145/3642976.3653030 | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Conflict-Free Replicated Data Types (CRDTs) for JSON allow users to
concurrently update a JSON document and automatically merge the updates into a
consistent state. Moving a subtree in a map or reordering elements in a list
within a JSON CRDT is challenging: naive merge algorithms may introduce
unexpected results suc... | [
{
"created": "Thu, 23 Nov 2023 13:48:52 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Mar 2024 21:05:16 GMT",
"version": "v2"
}
] | 2024-03-21 | [
[
"Da",
"Liangrun",
""
],
[
"Kleppmann",
"Martin",
""
]
] | Conflict-Free Replicated Data Types (CRDTs) for JSON allow users to concurrently update a JSON document and automatically merge the updates into a consistent state. Moving a subtree in a map or reordering elements in a list within a JSON CRDT is challenging: naive merge algorithms may introduce unexpected results such ... |
1601.04689 | Santhosh Kumar | Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister,
Eren \c{S}a\c{s}o\u{g}lu, R\"udiger Urbanke | Reed-Muller Codes Achieve Capacity on Erasure Channels | This article combines our previous articles arXiv:1505.05123 and
arXiv:1505.05831 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new approach to proving that a sequence of deterministic
linear codes achieves capacity on an erasure channel under maximum a posteriori
decoding. Rather than relying on the precise structure of the codes our method
exploits code symmetry. In particular, the technique applies to any sequence of
linear ... | [
{
"created": "Mon, 18 Jan 2016 20:50:08 GMT",
"version": "v1"
}
] | 2016-01-19 | [
[
"Kudekar",
"Shrinivas",
""
],
[
"Kumar",
"Santhosh",
""
],
[
"Mondelli",
"Marco",
""
],
[
"Pfister",
"Henry D.",
""
],
[
"Şaşoğlu",
"Eren",
""
],
[
"Urbanke",
"Rüdiger",
""
]
] | We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits code symmetry. In particular, the technique applies to any sequence of linear co... |
2306.01940 | Elijah Pelofske | Kyle Henke, Elijah Pelofske, Georg Hahn, Garrett T. Kenyon | Sampling binary sparse coding QUBO models using a spiking neuromorphic
processor | null | null | 10.1145/3589737.3606003 | null | cs.NE cs.CV cs.ET cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of computing a sparse binary representation of an
image. To be precise, given an image and an overcomplete, non-orthonormal
basis, we aim to find a sparse binary vector indicating the minimal set of
basis vectors that when added together best reconstruct the given input. We
formulate this prob... | [
{
"created": "Fri, 2 Jun 2023 22:47:18 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Aug 2023 16:55:29 GMT",
"version": "v2"
}
] | 2023-11-28 | [
[
"Henke",
"Kyle",
""
],
[
"Pelofske",
"Elijah",
""
],
[
"Hahn",
"Georg",
""
],
[
"Kenyon",
"Garrett T.",
""
]
] | We consider the problem of computing a sparse binary representation of an image. To be precise, given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this proble... |
2001.01491 | Waqas Ahmed | Saira Khan, Khalid Iqbal, Safi Faizullah, Muhammad Fahad, Jawad Ali,
Waqas Ahmed | Clustering based Privacy Preserving of Big Data using Fuzzification and
Anonymization Operation | 08 Page, 07 figures | International Journal of Advanced Computer Science and
Applications, Volume 10 Issue 12, 2019 | 10.14569/IJACSA.2019.0101239 | null | cs.DB cs.CR | http://creativecommons.org/licenses/by/4.0/ | Big Data is used by data miner for analysis purpose which may contain
sensitive information. During the procedures it raises certain privacy
challenges for researchers. The existing privacy preserving methods use
different algorithms that results into limitation of data reconstruction while
securing the sensitive dat... | [
{
"created": "Mon, 6 Jan 2020 11:31:12 GMT",
"version": "v1"
}
] | 2020-01-07 | [
[
"Khan",
"Saira",
""
],
[
"Iqbal",
"Khalid",
""
],
[
"Faizullah",
"Safi",
""
],
[
"Fahad",
"Muhammad",
""
],
[
"Ali",
"Jawad",
""
],
[
"Ahmed",
"Waqas",
""
]
] | Big Data is used by data miner for analysis purpose which may contain sensitive information. During the procedures it raises certain privacy challenges for researchers. The existing privacy preserving methods use different algorithms that results into limitation of data reconstruction while securing the sensitive data.... |
2211.09783 | Yulong Chen | Yulong Chen, Yang Liu, Ruochen Xu, Ziyi Yang, Chenguang Zhu, Michael
Zeng, Yue Zhang | UniSumm and SummZoo: Unified Model and Diverse Benchmark for Few-Shot
Summarization | ACL2023 main conference | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The high annotation costs and diverse demands of various summarization tasks
motivate the development of few-shot summarization. However, despite the
emergence of many summarization tasks and datasets, the current training
paradigm for few-shot summarization systems ignores potentially shareable
knowledge in heteroge... | [
{
"created": "Thu, 17 Nov 2022 18:54:47 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Nov 2022 15:16:40 GMT",
"version": "v2"
},
{
"created": "Tue, 6 Dec 2022 08:54:22 GMT",
"version": "v3"
},
{
"created": "Tue, 13 Dec 2022 14:57:14 GMT",
"version": "v4"
},
{
"cr... | 2023-05-30 | [
[
"Chen",
"Yulong",
""
],
[
"Liu",
"Yang",
""
],
[
"Xu",
"Ruochen",
""
],
[
"Yang",
"Ziyi",
""
],
[
"Zhu",
"Chenguang",
""
],
[
"Zeng",
"Michael",
""
],
[
"Zhang",
"Yue",
""
]
] | The high annotation costs and diverse demands of various summarization tasks motivate the development of few-shot summarization. However, despite the emergence of many summarization tasks and datasets, the current training paradigm for few-shot summarization systems ignores potentially shareable knowledge in heterogene... |
2406.14756 | Huitong Pan | Huitong Pan and Qi Zhang and Cornelia Caragea and Eduard Dragut and
Longin Jan Latecki | SciDMT: A Large-Scale Corpus for Detecting Scientific Mentions | LREC/COLING 2024 | LREC-COLING. (2024) 14407-14417 | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | We present SciDMT, an enhanced and expanded corpus for scientific mention
detection, offering a significant advancement over existing related resources.
SciDMT contains annotated scientific documents for datasets (D), methods (M),
and tasks (T). The corpus consists of two components: 1) the SciDMT main
corpus, which ... | [
{
"created": "Thu, 20 Jun 2024 22:03:21 GMT",
"version": "v1"
}
] | 2024-06-24 | [
[
"Pan",
"Huitong",
""
],
[
"Zhang",
"Qi",
""
],
[
"Caragea",
"Cornelia",
""
],
[
"Dragut",
"Eduard",
""
],
[
"Latecki",
"Longin Jan",
""
]
] | We present SciDMT, an enhanced and expanded corpus for scientific mention detection, offering a significant advancement over existing related resources. SciDMT contains annotated scientific documents for datasets (D), methods (M), and tasks (T). The corpus consists of two components: 1) the SciDMT main corpus, which in... |
2406.17952 | Andrew Dennehy | Andrew Dennehy, Xiaoyu Zou, Shabnam J. Semnani, Yuri Fialko, Alexander
Cloninger | LINSCAN -- A Linearity Based Clustering Algorithm | null | null | null | null | cs.LG cs.CG | http://creativecommons.org/licenses/by/4.0/ | DBSCAN and OPTICS are powerful algorithms for identifying clusters of points
in domains where few assumptions can be made about the structure of the data.
In this paper, we leverage these strengths and introduce a new algorithm,
LINSCAN, designed to seek lineated clusters that are difficult to find and
isolate with e... | [
{
"created": "Tue, 25 Jun 2024 21:58:37 GMT",
"version": "v1"
}
] | 2024-06-27 | [
[
"Dennehy",
"Andrew",
""
],
[
"Zou",
"Xiaoyu",
""
],
[
"Semnani",
"Shabnam J.",
""
],
[
"Fialko",
"Yuri",
""
],
[
"Cloninger",
"Alexander",
""
]
] | DBSCAN and OPTICS are powerful algorithms for identifying clusters of points in domains where few assumptions can be made about the structure of the data. In this paper, we leverage these strengths and introduce a new algorithm, LINSCAN, designed to seek lineated clusters that are difficult to find and isolate with exi... |
1610.02526 | Arash Shaghaghi | Arash Shaghaghi and Mohamed Ali (Dali) Kaafar and Sandra Scott-Hayward
and Salil S. Kanhere and Sanjay Jha | Towards Policy Enforcement Point as a Service (PEPS) | This is a copy of the paper accepted at IEEE NFV-SDN'16. An extended
work based on this paper will be submitted to a journal | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we coin the term Policy Enforcement as a Service (PEPS), which
enables the provision of innovative inter-layer and inter-domain Access
Control. We leverage the architecture of Software-Defined-Network (SDN) to
introduce a common network-level enforcement point, which is made available to
a range of acc... | [
{
"created": "Sat, 8 Oct 2016 13:09:47 GMT",
"version": "v1"
}
] | 2016-10-11 | [
[
"Shaghaghi",
"Arash",
"",
"Dali"
],
[
"Ali",
"Mohamed",
"",
"Dali"
],
[
"Kaafar",
"",
""
],
[
"Scott-Hayward",
"Sandra",
""
],
[
"Kanhere",
"Salil S.",
""
],
[
"Jha",
"Sanjay",
""
]
] | In this paper, we coin the term Policy Enforcement as a Service (PEPS), which enables the provision of innovative inter-layer and inter-domain Access Control. We leverage the architecture of Software-Defined-Network (SDN) to introduce a common network-level enforcement point, which is made available to a range of acces... |
2406.17424 | Shinwoo An | Shinwoo An, Eunjin Oh and Jie Xue | Sparse Outerstring Graphs Have Logarithmic Treewidth | 17pages, In ESA'24 | null | null | null | cs.CG cs.DS | http://creativecommons.org/licenses/by/4.0/ | An outerstring graph is the intersection graph of curves lying inside a disk
with one endpoint on the boundary of the disk. We show that an outerstring
graph with $n$ vertices has treewidth $O(\alpha\log n)$, where $\alpha$ denotes
the arboricity of the graph, with an almost matching lower bound of
$\Omega(\alpha \lo... | [
{
"created": "Tue, 25 Jun 2024 09:59:24 GMT",
"version": "v1"
}
] | 2024-06-26 | [
[
"An",
"Shinwoo",
""
],
[
"Oh",
"Eunjin",
""
],
[
"Xue",
"Jie",
""
]
] | An outerstring graph is the intersection graph of curves lying inside a disk with one endpoint on the boundary of the disk. We show that an outerstring graph with $n$ vertices has treewidth $O(\alpha\log n)$, where $\alpha$ denotes the arboricity of the graph, with an almost matching lower bound of $\Omega(\alpha \log ... |
1512.09032 | Shankara Narayanan Krishna | Khushraj Madnani, Shankara Narayanan Krishna and Paritosh Pandya | Metric Temporal Logic with Counting | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ability to count number of occurrences of events within a specified time
interval is very useful in specification of resource bounded real time
computation. In this paper, we study an extension of Metric Temporal Logic
($\mathsf{MTL}$) with two different counting modalities called $\mathsf{C}$ and
$\mathsf{UT}$ (unti... | [
{
"created": "Wed, 30 Dec 2015 17:42:14 GMT",
"version": "v1"
}
] | 2015-12-31 | [
[
"Madnani",
"Khushraj",
""
],
[
"Krishna",
"Shankara Narayanan",
""
],
[
"Pandya",
"Paritosh",
""
]
] | Ability to count number of occurrences of events within a specified time interval is very useful in specification of resource bounded real time computation. In this paper, we study an extension of Metric Temporal Logic ($\mathsf{MTL}$) with two different counting modalities called $\mathsf{C}$ and $\mathsf{UT}$ (until ... |
2403.11728 | Kevin R\"osch | Johannes Fischer, Kevin R\"osch, Martin Lauer, Christoph Stiller | PITA: Physics-Informed Trajectory Autoencoder | null | null | null | null | cs.LG cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Validating robotic systems in safety-critical appli-cations requires testing
in many scenarios including rare edgecases that are unlikely to occur,
requiring to complement real-world testing with testing in simulation.
Generative models canbe used to augment real-world datasets with generated data
toproduce edge case... | [
{
"created": "Mon, 18 Mar 2024 12:37:41 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Fischer",
"Johannes",
""
],
[
"Rösch",
"Kevin",
""
],
[
"Lauer",
"Martin",
""
],
[
"Stiller",
"Christoph",
""
]
] | Validating robotic systems in safety-critical appli-cations requires testing in many scenarios including rare edgecases that are unlikely to occur, requiring to complement real-world testing with testing in simulation. Generative models canbe used to augment real-world datasets with generated data toproduce edge case s... |
2405.02022 | Michael Baddeley Dr | Burhanuddin Rangwala, Ava Powelson, Michael Baddeley and Israat Haque | STX-Vote: Improving Reliability with Bit Voting in Synchronous
Transmission-based IoT Networks | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | Industrial Internet of Things (IIoT) networks must meet strict reliability,
latency, and low energy consumption requirements. However, traditional
low-power wireless protocols are ineffective in finding a sweet spot for
balancing these performance metrics. Recently, network flooding protocols based
on Synchronous Tra... | [
{
"created": "Fri, 3 May 2024 11:54:16 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Aug 2024 06:12:22 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Aug 2024 07:39:24 GMT",
"version": "v3"
}
] | 2024-08-14 | [
[
"Rangwala",
"Burhanuddin",
""
],
[
"Powelson",
"Ava",
""
],
[
"Baddeley",
"Michael",
""
],
[
"Haque",
"Israat",
""
]
] | Industrial Internet of Things (IIoT) networks must meet strict reliability, latency, and low energy consumption requirements. However, traditional low-power wireless protocols are ineffective in finding a sweet spot for balancing these performance metrics. Recently, network flooding protocols based on Synchronous Trans... |
1203.5689 | Philipp Schaer | Philipp Schaer, Thomas L\"uke, Wilko van Hoek | Building Custom Term Suggestion Web Services with OAI-Harvested Open
Data | 8 pages, 5 figures, presented at 2. DGI-Konferenz / 64. Jahrestagung
der DGI, D\"usseldorf, Germany on 2012-03-23 | Social Media und Web Science: Das Web als Lebensraum. 2.
DGI-Konferenz / 64. Jahrestagung der DGI, D\"usseldorf, 22. bis 23. M\"arz
2012, Proceedings (2012), p. 389-396 | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem that the same information need can be expressed in a variety of
ways is especially true for scientific literature. Each scientific discipline
has its own domain-specific language and vocabulary. This language is coded
into documentary tools like thesauri or classifications that are used to
document and de... | [
{
"created": "Mon, 26 Mar 2012 14:45:45 GMT",
"version": "v1"
}
] | 2012-03-27 | [
[
"Schaer",
"Philipp",
""
],
[
"Lüke",
"Thomas",
""
],
[
"van Hoek",
"Wilko",
""
]
] | The problem that the same information need can be expressed in a variety of ways is especially true for scientific literature. Each scientific discipline has its own domain-specific language and vocabulary. This language is coded into documentary tools like thesauri or classifications that are used to document and desc... |
2010.11786 | Benjamin Ricaud | Benjamin Ricaud, Nicolas Aspert and Volodymyr Miz | Spikyball sampling: Exploring large networks via an inhomogeneous
filtered diffusion | null | null | null | null | cs.SI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Studying real-world networks such as social networks or web networks is a
challenge. These networks often combine a complex, highly connected structure
together with a large size. We propose a new approach for large scale networks
that is able to automatically sample user-defined relevant parts of a network.
Starting... | [
{
"created": "Thu, 22 Oct 2020 15:01:13 GMT",
"version": "v1"
}
] | 2020-10-23 | [
[
"Ricaud",
"Benjamin",
""
],
[
"Aspert",
"Nicolas",
""
],
[
"Miz",
"Volodymyr",
""
]
] | Studying real-world networks such as social networks or web networks is a challenge. These networks often combine a complex, highly connected structure together with a large size. We propose a new approach for large scale networks that is able to automatically sample user-defined relevant parts of a network. Starting f... |
1809.03609 | Mohamed Ibrahim | Mohamed R. Ibrahim, James Haworth, Tao Cheng | URBAN-i: From urban scenes to mapping slums, transport modes, and
pedestrians in cities using deep learning and computer vision | 12 pages, 9 figures | null | 10.1177/2399808319846517 | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Within the burgeoning expansion of deep learning and computer vision across
the different fields of science, when it comes to urban development, deep
learning and computer vision applications are still limited towards the notions
of smart cities and autonomous vehicles. Indeed, a wide gap of knowledge
appears when it... | [
{
"created": "Mon, 10 Sep 2018 21:49:38 GMT",
"version": "v1"
}
] | 2019-10-23 | [
[
"Ibrahim",
"Mohamed R.",
""
],
[
"Haworth",
"James",
""
],
[
"Cheng",
"Tao",
""
]
] | Within the burgeoning expansion of deep learning and computer vision across the different fields of science, when it comes to urban development, deep learning and computer vision applications are still limited towards the notions of smart cities and autonomous vehicles. Indeed, a wide gap of knowledge appears when it c... |
2306.11593 | Luigi Celona | Simone Bianco and Luigi Celona and Marco Donzella and Paolo Napoletano | Improving Image Captioning Descriptiveness by Ranking and LLM-based
Fusion | null | null | null | null | cs.CV cs.AI cs.CL cs.DB cs.LG | http://creativecommons.org/licenses/by/4.0/ | State-of-The-Art (SoTA) image captioning models often rely on the Microsoft
COCO (MS-COCO) dataset for training. This dataset contains annotations provided
by human annotators, who typically produce captions averaging around ten
tokens. However, this constraint presents a challenge in effectively capturing
complex sc... | [
{
"created": "Tue, 20 Jun 2023 15:13:02 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Bianco",
"Simone",
""
],
[
"Celona",
"Luigi",
""
],
[
"Donzella",
"Marco",
""
],
[
"Napoletano",
"Paolo",
""
]
] | State-of-The-Art (SoTA) image captioning models often rely on the Microsoft COCO (MS-COCO) dataset for training. This dataset contains annotations provided by human annotators, who typically produce captions averaging around ten tokens. However, this constraint presents a challenge in effectively capturing complex scen... |
2111.14994 | Niki Hrovatin | Niki Hrovatin, Aleksandar To\v{s}i\'c, Michael Mrissa and Jernej
Vi\v{c}i\v{c} | A General Purpose Data and Query Privacy Preserving Protocol for
Wireless Sensor Networks | Submitted to IEEE IoT Journal, 18 pages, 16 figures | null | null | null | cs.CR cs.NI | http://creativecommons.org/licenses/by/4.0/ | Wireless Sensor Networks (WSNs) are composed of a large number of spatially
distributed devices equipped with sensing technology and interlinked via radio
signaling. A WSN deployed for monitoring purposes can provide a ubiquitous view
over the monitored environment. However, the management of collected data is
very r... | [
{
"created": "Mon, 29 Nov 2021 22:18:19 GMT",
"version": "v1"
}
] | 2021-12-01 | [
[
"Hrovatin",
"Niki",
""
],
[
"Tošić",
"Aleksandar",
""
],
[
"Mrissa",
"Michael",
""
],
[
"Vičič",
"Jernej",
""
]
] | Wireless Sensor Networks (WSNs) are composed of a large number of spatially distributed devices equipped with sensing technology and interlinked via radio signaling. A WSN deployed for monitoring purposes can provide a ubiquitous view over the monitored environment. However, the management of collected data is very res... |
2103.06819 | Jieren Deng | Jieren Deng, Yijue Wang, Ji Li, Chao Shang, Hang Liu, Sanguthevar
Rajasekaran and Caiwen Ding | TAG: Gradient Attack on Transformer-based Language Models | Accepted to Findings of EMNLP 2021 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although federated learning has increasingly gained attention in terms of
effectively utilizing local devices for data privacy enhancement, recent
studies show that publicly shared gradients in the training process can reveal
the private training images (gradient leakage) to a third-party in computer
vision. We have,... | [
{
"created": "Thu, 11 Mar 2021 17:41:32 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Mar 2021 03:08:57 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Mar 2021 20:51:19 GMT",
"version": "v3"
},
{
"created": "Wed, 21 Apr 2021 04:04:18 GMT",
"version": "v4"
},
{
"c... | 2021-09-22 | [
[
"Deng",
"Jieren",
""
],
[
"Wang",
"Yijue",
""
],
[
"Li",
"Ji",
""
],
[
"Shang",
"Chao",
""
],
[
"Liu",
"Hang",
""
],
[
"Rajasekaran",
"Sanguthevar",
""
],
[
"Ding",
"Caiwen",
""
]
] | Although federated learning has increasingly gained attention in terms of effectively utilizing local devices for data privacy enhancement, recent studies show that publicly shared gradients in the training process can reveal the private training images (gradient leakage) to a third-party in computer vision. We have, h... |
2307.05694 | Dr. Mohammed Javed | Anurag Dhote and Mohammed Javed and David S Doermann | A Survey on Figure Classification Techniques in Scientific Documents | Some contents of this paper appears in the accepted paper - "A Survey
and Approach to Chart Classification" at 15th IAPR GREC 2023 at 17th ICDAR
2023, August 21-26, San Jose, USA. arXiv admin note: text overlap with
arXiv:2307.04147 | null | null | null | cs.IR cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Figures visually represent an essential piece of information and provide an
effective means to communicate scientific facts. Recently there have been many
efforts toward extracting data directly from figures, specifically from tables,
diagrams, and plots, using different Artificial Intelligence and Machine
Learning t... | [
{
"created": "Sun, 9 Jul 2023 10:55:11 GMT",
"version": "v1"
}
] | 2023-07-13 | [
[
"Dhote",
"Anurag",
""
],
[
"Javed",
"Mohammed",
""
],
[
"Doermann",
"David S",
""
]
] | Figures visually represent an essential piece of information and provide an effective means to communicate scientific facts. Recently there have been many efforts toward extracting data directly from figures, specifically from tables, diagrams, and plots, using different Artificial Intelligence and Machine Learning tec... |
2306.00148 | Wei Xiao | Wei Xiao and Tsun-Hsuan Wang and Chuang Gan and Daniela Rus | SafeDiffuser: Safe Planning with Diffusion Probabilistic Models | 19 pages, website: https://safediffuser.github.io/safediffuser/ | null | null | null | cs.LG cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diffusion model-based approaches have shown promise in data-driven planning,
but there are no safety guarantees, thus making it hard to be applied for
safety-critical applications. To address these challenges, we propose a new
method, called SafeDiffuser, to ensure diffusion probabilistic models satisfy
specification... | [
{
"created": "Wed, 31 May 2023 19:38:12 GMT",
"version": "v1"
}
] | 2023-06-02 | [
[
"Xiao",
"Wei",
""
],
[
"Wang",
"Tsun-Hsuan",
""
],
[
"Gan",
"Chuang",
""
],
[
"Rus",
"Daniela",
""
]
] | Diffusion model-based approaches have shown promise in data-driven planning, but there are no safety guarantees, thus making it hard to be applied for safety-critical applications. To address these challenges, we propose a new method, called SafeDiffuser, to ensure diffusion probabilistic models satisfy specifications ... |
2206.00229 | Wisdom Agboh | Wisdom C. Agboh, Jeffrey Ichnowski, Ken Goldberg, Mehmet R. Dogar | Multi-Object Grasping in the Plane | Accepted to the International Symposium on Robotics Research (ISRR),
2022 | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | We consider a novel problem where multiple rigid convex polygonal objects
rest in randomly placed positions and orientations on a planar surface visible
from an overhead camera. The objective is to efficiently grasp and transport
all objects into a bin using multi-object push-grasps, where multiple objects
are pushed... | [
{
"created": "Wed, 1 Jun 2022 04:40:45 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Sep 2022 16:51:42 GMT",
"version": "v2"
}
] | 2022-09-22 | [
[
"Agboh",
"Wisdom C.",
""
],
[
"Ichnowski",
"Jeffrey",
""
],
[
"Goldberg",
"Ken",
""
],
[
"Dogar",
"Mehmet R.",
""
]
] | We consider a novel problem where multiple rigid convex polygonal objects rest in randomly placed positions and orientations on a planar surface visible from an overhead camera. The objective is to efficiently grasp and transport all objects into a bin using multi-object push-grasps, where multiple objects are pushed t... |
2106.03373 | Yiding Liu Dr. | Yiding Liu, Guan Huang, Jiaxiang Liu, Weixue Lu, Suqi Cheng, Yukun Li,
Daiting Shi, Shuaiqiang Wang, Zhicong Cheng, Dawei Yin | Pre-trained Language Model for Web-scale Retrieval in Baidu Search | Accepted by KDD 2021 | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Retrieval is a crucial stage in web search that identifies a small set of
query-relevant candidates from a billion-scale corpus. Discovering more
semantically-related candidates in the retrieval stage is very promising to
expose more high-quality results to the end users. However, it still remains
non-trivial challen... | [
{
"created": "Mon, 7 Jun 2021 06:55:45 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Jun 2021 13:32:13 GMT",
"version": "v2"
},
{
"created": "Wed, 30 Jun 2021 05:38:58 GMT",
"version": "v3"
},
{
"created": "Sat, 16 Oct 2021 15:12:57 GMT",
"version": "v4"
}
] | 2021-10-19 | [
[
"Liu",
"Yiding",
""
],
[
"Huang",
"Guan",
""
],
[
"Liu",
"Jiaxiang",
""
],
[
"Lu",
"Weixue",
""
],
[
"Cheng",
"Suqi",
""
],
[
"Li",
"Yukun",
""
],
[
"Shi",
"Daiting",
""
],
[
"Wang",
"Shuaiqiang... | Retrieval is a crucial stage in web search that identifies a small set of query-relevant candidates from a billion-scale corpus. Discovering more semantically-related candidates in the retrieval stage is very promising to expose more high-quality results to the end users. However, it still remains non-trivial challenge... |
2310.17569 | Xinghui Li Mr. | Xinghui Li, Jingyi Lu, Kai Han, Victor Prisacariu | SD4Match: Learning to Prompt Stable Diffusion Model for Semantic
Matching | Accepted to CVPR 2024. Project website:
https://sd4match.active.vision/ | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this paper, we address the challenge of matching semantically similar
keypoints across image pairs. Existing research indicates that the intermediate
output of the UNet within the Stable Diffusion (SD) can serve as robust image
feature maps for such a matching task. We demonstrate that by employing a basic
prompt ... | [
{
"created": "Thu, 26 Oct 2023 16:58:01 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Mar 2024 11:52:23 GMT",
"version": "v2"
}
] | 2024-03-27 | [
[
"Li",
"Xinghui",
""
],
[
"Lu",
"Jingyi",
""
],
[
"Han",
"Kai",
""
],
[
"Prisacariu",
"Victor",
""
]
] | In this paper, we address the challenge of matching semantically similar keypoints across image pairs. Existing research indicates that the intermediate output of the UNet within the Stable Diffusion (SD) can serve as robust image feature maps for such a matching task. We demonstrate that by employing a basic prompt tu... |
2103.12328 | Kazuma Kobayashi | Kazuma Kobayashi, Ryuichiro Hataya, Yusuke Kurose, Mototaka Miyake,
Masamichi Takahashi, Akiko Nakagawa, Tatsuya Harada, Ryuji Hamamoto | Decomposing Normal and Abnormal Features of Medical Images into Discrete
Latent Codes for Content-Based Image Retrieval | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In medical imaging, the characteristics purely derived from a disease should
reflect the extent to which abnormal findings deviate from the normal features.
Indeed, physicians often need corresponding images without abnormal findings of
interest or, conversely, images that contain similar abnormal findings
regardless... | [
{
"created": "Tue, 23 Mar 2021 05:53:53 GMT",
"version": "v1"
}
] | 2021-03-24 | [
[
"Kobayashi",
"Kazuma",
""
],
[
"Hataya",
"Ryuichiro",
""
],
[
"Kurose",
"Yusuke",
""
],
[
"Miyake",
"Mototaka",
""
],
[
"Takahashi",
"Masamichi",
""
],
[
"Nakagawa",
"Akiko",
""
],
[
"Harada",
"Tatsuya",
""... | In medical imaging, the characteristics purely derived from a disease should reflect the extent to which abnormal findings deviate from the normal features. Indeed, physicians often need corresponding images without abnormal findings of interest or, conversely, images that contain similar abnormal findings regardless o... |
2102.09202 | Emir Demirel | Emir Demirel, Sven Ahlb\"ack, Simon Dixon | Low Resource Audio-to-Lyrics Alignment From Polyphonic Music Recordings | null | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Lyrics alignment in long music recordings can be memory exhaustive when
performed in a single pass. In this study, we present a novel method that
performs audio-to-lyrics alignment with a low memory consumption footprint
regardless of the duration of the music recording. The proposed system first
spots the anchoring ... | [
{
"created": "Thu, 18 Feb 2021 07:54:56 GMT",
"version": "v1"
}
] | 2021-02-19 | [
[
"Demirel",
"Emir",
""
],
[
"Ahlbäck",
"Sven",
""
],
[
"Dixon",
"Simon",
""
]
] | Lyrics alignment in long music recordings can be memory exhaustive when performed in a single pass. In this study, we present a novel method that performs audio-to-lyrics alignment with a low memory consumption footprint regardless of the duration of the music recording. The proposed system first spots the anchoring wo... |
1401.2483 | Andino Maseleno | Andino Maseleno and Md. Mahmud Hasan | Dempster-Shafer Theory for Move Prediction in Start Kicking of The
Bicycle Kick of Sepak Takraw Game | Middle-East Journal of Scientific Research, Vol. 16, No. 7, 2013.
ISSN 1990-9233, pp. 896 - 903 | null | null | null | cs.AI | http://creativecommons.org/licenses/by/3.0/ | This paper presents Dempster-Shafer theory for move prediction in start
kicking of the bicycle kick of sepak takraw game. Sepak takraw is a highly
complex net-barrier kicking sport that involves dazzling displays of quick
reflexes, acrobatic twists, turns and swerves of the agile human body movement.
A Bicycle kick o... | [
{
"created": "Fri, 10 Jan 2014 23:48:40 GMT",
"version": "v1"
}
] | 2014-01-14 | [
[
"Maseleno",
"Andino",
""
],
[
"Hasan",
"Md. Mahmud",
""
]
] | This paper presents Dempster-Shafer theory for move prediction in start kicking of the bicycle kick of sepak takraw game. Sepak takraw is a highly complex net-barrier kicking sport that involves dazzling displays of quick reflexes, acrobatic twists, turns and swerves of the agile human body movement. A Bicycle kick or ... |
1906.08462 | Chongyi Li | Chongyi Li, Runmin Cong, Junhui Hou, Sanyi Zhang, Yue Qian, Sam Kwong | Nested Network with Two-Stream Pyramid for Salient Object Detection in
Optical Remote Sensing Images | 11 pages, 8 figures, has been accepted by TGRS | null | 10.1109/TGRS.2019.2925070 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Arising from the various object types and scales, diverse imaging
orientations, and cluttered backgrounds in optical remote sensing image (RSI),
it is difficult to directly extend the success of salient object detection for
nature scene image to the optical RSI. In this paper, we propose an end-to-end
deep network ca... | [
{
"created": "Thu, 20 Jun 2019 06:57:13 GMT",
"version": "v1"
}
] | 2020-01-08 | [
[
"Li",
"Chongyi",
""
],
[
"Cong",
"Runmin",
""
],
[
"Hou",
"Junhui",
""
],
[
"Zhang",
"Sanyi",
""
],
[
"Qian",
"Yue",
""
],
[
"Kwong",
"Sam",
""
]
] | Arising from the various object types and scales, diverse imaging orientations, and cluttered backgrounds in optical remote sensing image (RSI), it is difficult to directly extend the success of salient object detection for nature scene image to the optical RSI. In this paper, we propose an end-to-end deep network call... |
1902.08646 | Fabio Kepler | F\'abio Kepler, Jonay Tr\'enous, Marcos Treviso, Miguel Vera, Andr\'e
F. T. Martins | OpenKiwi: An Open Source Framework for Quality Estimation | Published at the Annual Meeting of the Association for Computational
Linguistics (ACL) 2019: System Demonstrations
(https://aclweb.org/anthology/papers/P/P19/P19-3020/) | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce OpenKiwi, a PyTorch-based open source framework for translation
quality estimation. OpenKiwi supports training and testing of word-level and
sentence-level quality estimation systems, implementing the winning systems of
the WMT 2015-18 quality estimation campaigns. We benchmark OpenKiwi on two
datasets f... | [
{
"created": "Fri, 22 Feb 2019 19:27:45 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Aug 2019 15:07:52 GMT",
"version": "v2"
}
] | 2019-08-27 | [
[
"Kepler",
"Fábio",
""
],
[
"Trénous",
"Jonay",
""
],
[
"Treviso",
"Marcos",
""
],
[
"Vera",
"Miguel",
""
],
[
"Martins",
"André F. T.",
""
]
] | We introduce OpenKiwi, a PyTorch-based open source framework for translation quality estimation. OpenKiwi supports training and testing of word-level and sentence-level quality estimation systems, implementing the winning systems of the WMT 2015-18 quality estimation campaigns. We benchmark OpenKiwi on two datasets fro... |
2104.08542 | Huifeng Guo | Huifeng Guo, Wei Guo, Yong Gao, Ruiming Tang, Xiuqiang He, Wenzhi Liu | ScaleFreeCTR: MixCache-based Distributed Training System for CTR Models
with Huge Embedding Table | 10 pages | null | null | null | cs.IR cs.AI cs.DC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Because of the superior feature representation ability of deep learning,
various deep Click-Through Rate (CTR) models are deployed in the commercial
systems by industrial companies. To achieve better performance, it is necessary
to train the deep CTR models on huge volume of training data efficiently, which
makes spe... | [
{
"created": "Sat, 17 Apr 2021 13:36:19 GMT",
"version": "v1"
},
{
"created": "Tue, 11 May 2021 14:11:46 GMT",
"version": "v2"
}
] | 2021-05-12 | [
[
"Guo",
"Huifeng",
""
],
[
"Guo",
"Wei",
""
],
[
"Gao",
"Yong",
""
],
[
"Tang",
"Ruiming",
""
],
[
"He",
"Xiuqiang",
""
],
[
"Liu",
"Wenzhi",
""
]
] | Because of the superior feature representation ability of deep learning, various deep Click-Through Rate (CTR) models are deployed in the commercial systems by industrial companies. To achieve better performance, it is necessary to train the deep CTR models on huge volume of training data efficiently, which makes speed... |
2401.15595 | Manas Mhasakar | Manas Mhasakar, Shikhar Sharma, Apurv Mehra, Utkarsh Venaik, Ujjwal
Singhal, Dhruv Kumar, Kashish Mittal | Comuniqa : Exploring Large Language Models for improving speaking skills | Accepted at 7th ACM SIGCAS/SIGCHI Conference of Computing and
Sustainable Societies : ACM COMPASS 2024 | null | null | null | cs.HC cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the potential of Large Language Models (LLMs)
to improve English speaking skills. This is particularly relevant in countries
like India, where English is crucial for academic, professional, and personal
communication but remains a non-native language for many. Traditional methods
for enh... | [
{
"created": "Sun, 28 Jan 2024 07:37:33 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Apr 2024 14:33:10 GMT",
"version": "v2"
},
{
"created": "Tue, 14 May 2024 04:34:20 GMT",
"version": "v3"
}
] | 2024-05-15 | [
[
"Mhasakar",
"Manas",
""
],
[
"Sharma",
"Shikhar",
""
],
[
"Mehra",
"Apurv",
""
],
[
"Venaik",
"Utkarsh",
""
],
[
"Singhal",
"Ujjwal",
""
],
[
"Kumar",
"Dhruv",
""
],
[
"Mittal",
"Kashish",
""
]
] | In this paper, we investigate the potential of Large Language Models (LLMs) to improve English speaking skills. This is particularly relevant in countries like India, where English is crucial for academic, professional, and personal communication but remains a non-native language for many. Traditional methods for enhan... |
2110.02514 | Woojoo Kim | Woojoo Kim, Shuping Xiong | ViewfinderVR: Configurable Viewfinder for Selection of Distant Objects
in VR | null | null | 10.1007/s10055-022-00649-z | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Selection is one of the fundamental user interactions in virtual reality (VR)
and 3D user interaction, and raycasting has been one of the most popular object
selection techniques in VR. However, the selection of small or distant objects
through raycasting has been known to be difficult. To overcome this limitation,
t... | [
{
"created": "Wed, 6 Oct 2021 05:35:04 GMT",
"version": "v1"
}
] | 2022-06-07 | [
[
"Kim",
"Woojoo",
""
],
[
"Xiong",
"Shuping",
""
]
] | Selection is one of the fundamental user interactions in virtual reality (VR) and 3D user interaction, and raycasting has been one of the most popular object selection techniques in VR. However, the selection of small or distant objects through raycasting has been known to be difficult. To overcome this limitation, thi... |
2107.06511 | Dingcheng Yang | Dingcheng Yang, Wenjian Yu, Yuanbo Guo, Wenjie Liang | CNN-Cap: Effective Convolutional Neural Network Based Capacitance Models
for Full-Chip Parasitic Extraction | 9 pages, 13 figures. Accepted at 2021 International Conference On
Computer Aided Design (ICCAD) | null | null | null | cs.LG cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accurate capacitance extraction is becoming more important for designing
integrated circuits under advanced process technology. The pattern matching
based full-chip extraction methodology delivers fast computational speed, but
suffers from large error, and tedious efforts on building capacitance models of
the increas... | [
{
"created": "Wed, 14 Jul 2021 07:14:35 GMT",
"version": "v1"
}
] | 2021-07-15 | [
[
"Yang",
"Dingcheng",
""
],
[
"Yu",
"Wenjian",
""
],
[
"Guo",
"Yuanbo",
""
],
[
"Liang",
"Wenjie",
""
]
] | Accurate capacitance extraction is becoming more important for designing integrated circuits under advanced process technology. The pattern matching based full-chip extraction methodology delivers fast computational speed, but suffers from large error, and tedious efforts on building capacitance models of the increasin... |
2311.00434 | Shintaro Shiba | Shintaro Shiba, Friedhelm Hamann, Yoshimitsu Aoki, Guillermo Gallego | Event-based Background-Oriented Schlieren | Accepted at IEEE T-PAMI | IEEE Transactions on Pattern Analysis and Machine Intelligence,
Oct. 2023 | 10.1109/TPAMI.2023.3328188 | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Schlieren imaging is an optical technique to observe the flow of transparent
media, such as air or water, without any particle seeding. However,
conventional frame-based techniques require both high spatial and temporal
resolution cameras, which impose bright illumination and expensive computation
limitations. Event ... | [
{
"created": "Wed, 1 Nov 2023 10:57:20 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Shiba",
"Shintaro",
""
],
[
"Hamann",
"Friedhelm",
""
],
[
"Aoki",
"Yoshimitsu",
""
],
[
"Gallego",
"Guillermo",
""
]
] | Schlieren imaging is an optical technique to observe the flow of transparent media, such as air or water, without any particle seeding. However, conventional frame-based techniques require both high spatial and temporal resolution cameras, which impose bright illumination and expensive computation limitations. Event ca... |
1906.01622 | Mozhi Zhang | Mozhi Zhang, Keyulu Xu, Ken-ichi Kawarabayashi, Stefanie Jegelka,
Jordan Boyd-Graber | Are Girls Neko or Sh\=ojo? Cross-Lingual Alignment of Non-Isomorphic
Embeddings with Iterative Normalization | ACL 2019 | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-lingual word embeddings (CLWE) underlie many multilingual natural
language processing systems, often through orthogonal transformations of
pre-trained monolingual embeddings. However, orthogonal mapping only works on
language pairs whose embeddings are naturally isomorphic. For non-isomorphic
pairs, our method ... | [
{
"created": "Tue, 4 Jun 2019 17:56:22 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Jun 2019 01:34:19 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Nov 2019 07:36:47 GMT",
"version": "v3"
}
] | 2019-11-12 | [
[
"Zhang",
"Mozhi",
""
],
[
"Xu",
"Keyulu",
""
],
[
"Kawarabayashi",
"Ken-ichi",
""
],
[
"Jegelka",
"Stefanie",
""
],
[
"Boyd-Graber",
"Jordan",
""
]
] | Cross-lingual word embeddings (CLWE) underlie many multilingual natural language processing systems, often through orthogonal transformations of pre-trained monolingual embeddings. However, orthogonal mapping only works on language pairs whose embeddings are naturally isomorphic. For non-isomorphic pairs, our method (I... |
2305.04539 | Masato Uchida | Kota Kawamoto and Masato Uchida | Q&A Label Learning | 46 pages, 5 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Assigning labels to instances is crucial for supervised machine learning. In
this paper, we proposed a novel annotation method called Q&A labeling, which
involves a question generator that asks questions about the labels of the
instances to be assigned, and an annotator who answers the questions and
assigns the corre... | [
{
"created": "Mon, 8 May 2023 08:22:18 GMT",
"version": "v1"
}
] | 2023-05-09 | [
[
"Kawamoto",
"Kota",
""
],
[
"Uchida",
"Masato",
""
]
] | Assigning labels to instances is crucial for supervised machine learning. In this paper, we proposed a novel annotation method called Q&A labeling, which involves a question generator that asks questions about the labels of the instances to be assigned, and an annotator who answers the questions and assigns the corresp... |
1904.09823 | Yingchao Feng | Yingchao Feng, Wenhui Diao, Zhonghan Chang, Menglong Yan, Xian Sun,
Xin Gao | Ship Instance Segmentation From Remote Sensing Images Using Sequence
Local Context Module | 4 pages, 5 figures, IEEE Geoscience and Remote Sensing Society 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The performance of object instance segmentation in remote sensing images has
been greatly improved through the introduction of many landmark frameworks
based on convolutional neural network. However, the object densely issue still
affects the accuracy of such segmentation frameworks. Objects of the same class
are eas... | [
{
"created": "Mon, 22 Apr 2019 12:33:06 GMT",
"version": "v1"
}
] | 2019-04-23 | [
[
"Feng",
"Yingchao",
""
],
[
"Diao",
"Wenhui",
""
],
[
"Chang",
"Zhonghan",
""
],
[
"Yan",
"Menglong",
""
],
[
"Sun",
"Xian",
""
],
[
"Gao",
"Xin",
""
]
] | The performance of object instance segmentation in remote sensing images has been greatly improved through the introduction of many landmark frameworks based on convolutional neural network. However, the object densely issue still affects the accuracy of such segmentation frameworks. Objects of the same class are easil... |
2105.02905 | Roberto Metere | Roberto Metere, Myriam Neaimeh, Charles Morisset, Carsten Maple,
Xavier Bellekens, Ricardo M. Czekster | Securing the Electric Vehicle Charging Infrastructure | 42 pages, white paper | null | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Electric Vehicles (EVs) can help alleviate our reliance on fossil fuels for
transport and electricity systems. However, charging millions of EV batteries
requires management to prevent overloading the electricity grid and minimise
costly upgrades that are ultimately paid for by consumers.
Managed chargers, such as ... | [
{
"created": "Thu, 6 May 2021 18:10:42 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Apr 2022 16:03:07 GMT",
"version": "v2"
},
{
"created": "Wed, 6 Jul 2022 09:54:31 GMT",
"version": "v3"
}
] | 2022-07-07 | [
[
"Metere",
"Roberto",
""
],
[
"Neaimeh",
"Myriam",
""
],
[
"Morisset",
"Charles",
""
],
[
"Maple",
"Carsten",
""
],
[
"Bellekens",
"Xavier",
""
],
[
"Czekster",
"Ricardo M.",
""
]
] | Electric Vehicles (EVs) can help alleviate our reliance on fossil fuels for transport and electricity systems. However, charging millions of EV batteries requires management to prevent overloading the electricity grid and minimise costly upgrades that are ultimately paid for by consumers. Managed chargers, such as Vehi... |
2209.13514 | Hang Zhou | Zhiliang Xu, Hang Zhou, Zhibin Hong, Ziwei Liu, Jiaming Liu, Zhizhi
Guo, Junyu Han, Jingtuo Liu, Errui Ding, Jingdong Wang | StyleSwap: Style-Based Generator Empowers Robust Face Swapping | Accepted to ECCV 2022. Demo videos and code can be found at
https://hangz-nju-cuhk.github.io/projects/StyleSwap | null | null | null | cs.CV cs.GR | http://creativecommons.org/licenses/by/4.0/ | Numerous attempts have been made to the task of person-agnostic face swapping
given its wide applications. While existing methods mostly rely on tedious
network and loss designs, they still struggle in the information balancing
between the source and target faces, and tend to produce visible artifacts. In
this work, ... | [
{
"created": "Tue, 27 Sep 2022 16:35:16 GMT",
"version": "v1"
}
] | 2022-09-28 | [
[
"Xu",
"Zhiliang",
""
],
[
"Zhou",
"Hang",
""
],
[
"Hong",
"Zhibin",
""
],
[
"Liu",
"Ziwei",
""
],
[
"Liu",
"Jiaming",
""
],
[
"Guo",
"Zhizhi",
""
],
[
"Han",
"Junyu",
""
],
[
"Liu",
"Jingtuo",
... | Numerous attempts have been made to the task of person-agnostic face swapping given its wide applications. While existing methods mostly rely on tedious network and loss designs, they still struggle in the information balancing between the source and target faces, and tend to produce visible artifacts. In this work, we... |
2311.12312 | Evgenia (Eugenia) Ternovska | Eugenia Ternovska | Promise Algebra: An Algebraic Model of Non-Deterministic Computations | 34 pages, 6 figures | null | null | null | cs.LO cs.DB | http://creativecommons.org/licenses/by/4.0/ | Our goal is to define an algebraic language for reasoning about
non-deterministic computations. Towards this goal, we introduce an algebra of
string-to-string transductions. Specifically, it is an algebra of partial
functions on words over the alphabet of relational $\tau$-structures over the
same domain. The algebra... | [
{
"created": "Tue, 21 Nov 2023 03:10:43 GMT",
"version": "v1"
}
] | 2023-11-22 | [
[
"Ternovska",
"Eugenia",
""
]
] | Our goal is to define an algebraic language for reasoning about non-deterministic computations. Towards this goal, we introduce an algebra of string-to-string transductions. Specifically, it is an algebra of partial functions on words over the alphabet of relational $\tau$-structures over the same domain. The algebra h... |
2103.12452 | Rianne De Heide | Rianne de Heide and James Cheshire and Pierre M\'enard and Alexandra
Carpentier | Bandits with many optimal arms | Substantial rewrite and added experiments. Accepted for NeurIPS 2021 | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | We consider a stochastic bandit problem with a possibly infinite number of
arms. We write $p^*$ for the proportion of optimal arms and $\Delta$ for the
minimal mean-gap between optimal and sub-optimal arms. We characterize the
optimal learning rates both in the cumulative regret setting, and in the
best-arm identific... | [
{
"created": "Tue, 23 Mar 2021 11:02:31 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Nov 2021 08:25:11 GMT",
"version": "v2"
}
] | 2021-11-08 | [
[
"de Heide",
"Rianne",
""
],
[
"Cheshire",
"James",
""
],
[
"Ménard",
"Pierre",
""
],
[
"Carpentier",
"Alexandra",
""
]
] | We consider a stochastic bandit problem with a possibly infinite number of arms. We write $p^*$ for the proportion of optimal arms and $\Delta$ for the minimal mean-gap between optimal and sub-optimal arms. We characterize the optimal learning rates both in the cumulative regret setting, and in the best-arm identificat... |
1810.03993 | Margaret Mitchell | Margaret Mitchell and Simone Wu and Andrew Zaldivar and Parker Barnes
and Lucy Vasserman and Ben Hutchinson and Elena Spitzer and Inioluwa Deborah
Raji and Timnit Gebru | Model Cards for Model Reporting | null | FAT* '19: Conference on Fairness, Accountability, and
Transparency, January 29--31, 2019, Atlanta, GA, USA | 10.1145/3287560.3287596 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Trained machine learning models are increasingly used to perform high-impact
tasks in areas such as law enforcement, medicine, education, and employment. In
order to clarify the intended use cases of machine learning models and minimize
their usage in contexts for which they are not well suited, we recommend that
rel... | [
{
"created": "Fri, 5 Oct 2018 22:33:43 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Jan 2019 20:25:27 GMT",
"version": "v2"
}
] | 2019-01-16 | [
[
"Mitchell",
"Margaret",
""
],
[
"Wu",
"Simone",
""
],
[
"Zaldivar",
"Andrew",
""
],
[
"Barnes",
"Parker",
""
],
[
"Vasserman",
"Lucy",
""
],
[
"Hutchinson",
"Ben",
""
],
[
"Spitzer",
"Elena",
""
],
[
... | Trained machine learning models are increasingly used to perform high-impact tasks in areas such as law enforcement, medicine, education, and employment. In order to clarify the intended use cases of machine learning models and minimize their usage in contexts for which they are not well suited, we recommend that relea... |
1702.06943 | Fengan Li | Fengan Li, Lingjiao Chen, Yijing Zeng, Arun Kumar, Jeffrey F.
Naughton, Jignesh M. Patel, Xi Wu | Tuple-oriented Compression for Large-scale Mini-batch Stochastic
Gradient Descent | Accepted to Sigmod 2019 | null | 10.1145/3299869.3300070 | null | cs.LG cs.DB stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data compression is a popular technique for improving the efficiency of data
processing workloads such as SQL queries and more recently, machine learning
(ML) with classical batch gradient methods. But the efficacy of such ideas for
mini-batch stochastic gradient descent (MGD), arguably the workhorse algorithm
of mod... | [
{
"created": "Wed, 22 Feb 2017 18:58:25 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Mar 2017 05:43:41 GMT",
"version": "v2"
},
{
"created": "Sun, 20 Jan 2019 05:13:18 GMT",
"version": "v3"
}
] | 2019-01-23 | [
[
"Li",
"Fengan",
""
],
[
"Chen",
"Lingjiao",
""
],
[
"Zeng",
"Yijing",
""
],
[
"Kumar",
"Arun",
""
],
[
"Naughton",
"Jeffrey F.",
""
],
[
"Patel",
"Jignesh M.",
""
],
[
"Wu",
"Xi",
""
]
] | Data compression is a popular technique for improving the efficiency of data processing workloads such as SQL queries and more recently, machine learning (ML) with classical batch gradient methods. But the efficacy of such ideas for mini-batch stochastic gradient descent (MGD), arguably the workhorse algorithm of moder... |
1009.3527 | Darren Strash | Michael T. Goodrich and Darren Strash | Priority Range Trees | 12 pages, 3 figures. To appear at 21st International Symposium on
Algorithms and Computation (ISAAC 2010) | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a data structure, called a priority range tree, which
accommodates fast orthogonal range reporting queries on prioritized points. Let
$S$ be a set of $n$ points in the plane, where each point $p$ in $S$ is
assigned a weight $w(p)$ that is polynomial in $n$, and define the rank of $p$
to be $r(p)=\lfloor \... | [
{
"created": "Sat, 18 Sep 2010 01:00:33 GMT",
"version": "v1"
}
] | 2010-09-21 | [
[
"Goodrich",
"Michael T.",
""
],
[
"Strash",
"Darren",
""
]
] | We describe a data structure, called a priority range tree, which accommodates fast orthogonal range reporting queries on prioritized points. Let $S$ be a set of $n$ points in the plane, where each point $p$ in $S$ is assigned a weight $w(p)$ that is polynomial in $n$, and define the rank of $p$ to be $r(p)=\lfloor \lo... |
1911.12507 | Thuong Nguyen Canh | Thuong, Nguyen Canh, Chien, Trinh Van | Error Resilient Deep Compressive Sensing | 4 pages, 2 figures | null | null | null | cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressive sensing (CS) is an emerging sampling technology that enables
reconstructing signals from a subset of measurements and even corrupted
measurements. Deep learning-based compressive sensing (DCS) has improved CS
performance while maintaining a fast reconstruction but requires a training
network for each meas... | [
{
"created": "Thu, 28 Nov 2019 03:16:39 GMT",
"version": "v1"
}
] | 2019-12-02 | [
[
"Thuong",
"",
""
],
[
"Canh",
"Nguyen",
""
],
[
"Chien",
"",
""
],
[
"Van",
"Trinh",
""
]
] | Compressive sensing (CS) is an emerging sampling technology that enables reconstructing signals from a subset of measurements and even corrupted measurements. Deep learning-based compressive sensing (DCS) has improved CS performance while maintaining a fast reconstruction but requires a training network for each measur... |
2204.09617 | Zheng Chen | Zheng Chen, Durgakant Pushp, Lantao Liu | CALI: Coarse-to-Fine ALIgnments Based Unsupervised Domain Adaptation of
Traversability Prediction for Deployable Autonomous Navigation | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Traversability prediction is a fundamental perception capability for
autonomous navigation. The diversity of data in different domains imposes
significant gaps to the prediction performance of the perception model. In this
work, we make efforts to reduce the gaps by proposing a novel coarse-to-fine
unsupervised domai... | [
{
"created": "Wed, 20 Apr 2022 16:52:43 GMT",
"version": "v1"
}
] | 2022-04-21 | [
[
"Chen",
"Zheng",
""
],
[
"Pushp",
"Durgakant",
""
],
[
"Liu",
"Lantao",
""
]
] | Traversability prediction is a fundamental perception capability for autonomous navigation. The diversity of data in different domains imposes significant gaps to the prediction performance of the perception model. In this work, we make efforts to reduce the gaps by proposing a novel coarse-to-fine unsupervised domain ... |
1211.5221 | Reza Malekian Ph.D. | Reza Malekian and Abdul Hanan Abdullah | Traffic Engineering Based on Effective Envelope Algorithm on Novel
Resource Reservation Method over Mobile Internet Protocol Version 6 | International Journal of Innovative Computing, Information and
Control, 2012 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The first decade of the 21st century has seen tremendous improvements in
mobile internet and its technologies. The high traffic volume of services such
as video conference and other real-time traffic applications are imposing a
great challenge on networks. In the meantime, demand for the use of mobile
devices in comp... | [
{
"created": "Thu, 22 Nov 2012 07:38:59 GMT",
"version": "v1"
}
] | 2012-11-26 | [
[
"Malekian",
"Reza",
""
],
[
"Abdullah",
"Abdul Hanan",
""
]
] | The first decade of the 21st century has seen tremendous improvements in mobile internet and its technologies. The high traffic volume of services such as video conference and other real-time traffic applications are imposing a great challenge on networks. In the meantime, demand for the use of mobile devices in comput... |
1311.1712 | Shaoshi Yang Dr. | Shaoshi Yang, Li Wang, Tiejun Lv and Lajos Hanzo | Approximate Bayesian Probabilistic-Data-Association-Aided Iterative
Detection for MIMO Systems Using Arbitrary M-ary Modulation | 13 pages, 14 figures, 1 table, published in IEEE Transactions on
Vehicular Technology, vol. 62, no. 3, pp. 1228-1240, March, 2013 | IEEE Transactions on Vehicular Technology, vol. 62, no. 3, pp.
1228-1240, March, 2013 | 10.1109/TVT.2012.2227863 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the issue of designing an iterative-detection-and-decoding
(IDD)-aided receiver, relying on the low-complexity probabilistic data
association (PDA) method, is addressed for turbo-coded
multiple-input-multiple-output (MIMO) systems using general M-ary modulations.
We demonstrate that the classic candida... | [
{
"created": "Thu, 7 Nov 2013 15:26:34 GMT",
"version": "v1"
}
] | 2013-11-08 | [
[
"Yang",
"Shaoshi",
""
],
[
"Wang",
"Li",
""
],
[
"Lv",
"Tiejun",
""
],
[
"Hanzo",
"Lajos",
""
]
] | In this paper, the issue of designing an iterative-detection-and-decoding (IDD)-aided receiver, relying on the low-complexity probabilistic data association (PDA) method, is addressed for turbo-coded multiple-input-multiple-output (MIMO) systems using general M-ary modulations. We demonstrate that the classic candidate... |
2006.00954 | Gianni Franchi | Gianni Franchi, Andrei Bursuc, Emanuel Aldea, Severine Dubuisson,
Isabelle Bloch | One Versus all for deep Neural Network Incertitude (OVNNI)
quantification | null | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks (DNNs) are powerful learning models yet their results
are not always reliable. This is due to the fact that modern DNNs are usually
uncalibrated and we cannot characterize their epistemic uncertainty. In this
work, we propose a new technique to quantify the epistemic uncertainty of data
easily. T... | [
{
"created": "Mon, 1 Jun 2020 14:06:12 GMT",
"version": "v1"
}
] | 2020-06-03 | [
[
"Franchi",
"Gianni",
""
],
[
"Bursuc",
"Andrei",
""
],
[
"Aldea",
"Emanuel",
""
],
[
"Dubuisson",
"Severine",
""
],
[
"Bloch",
"Isabelle",
""
]
] | Deep neural networks (DNNs) are powerful learning models yet their results are not always reliable. This is due to the fact that modern DNNs are usually uncalibrated and we cannot characterize their epistemic uncertainty. In this work, we propose a new technique to quantify the epistemic uncertainty of data easily. Thi... |
1205.7044 | Negin Golrezaei | Negin Golrezaei, Alexandros G. Dimakis, Andreas F. Molisch | Wireless Device-to-Device Communications with Distributed Caching | to appear in ISIT 2012 | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a novel wireless device-to-device (D2D) collaboration
architecture that exploits distributed storage of popular content to enable
frequency reuse. We identify a fundamental conflict between collaboration
distance and interference and show how to optimize the transmission power to
maximize frequency reuse... | [
{
"created": "Thu, 31 May 2012 17:02:31 GMT",
"version": "v1"
}
] | 2012-06-01 | [
[
"Golrezaei",
"Negin",
""
],
[
"Dimakis",
"Alexandros G.",
""
],
[
"Molisch",
"Andreas F.",
""
]
] | We introduce a novel wireless device-to-device (D2D) collaboration architecture that exploits distributed storage of popular content to enable frequency reuse. We identify a fundamental conflict between collaboration distance and interference and show how to optimize the transmission power to maximize frequency reuse. ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.