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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0903.4302 | Florentina Pintea | Daniela Ilea, Dan L. Lacrama | ShopList: Programming PDA applications for Windows Mobile using C# | 8 pages, exposed on 4th International Conferences "Actualities and
Perspectives on Hardware and Software" - APHS2007, Timisoara, Romania | Ann. Univ. Tibiscus Comp. Sci. Series V (2007), 91-98 | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is focused on a C# and Sql Server Mobile 2005 application to keep
evidence of a shop list. The purpose of the application is to offer to the user
an easier way to manage his shopping options.
| [
{
"created": "Wed, 25 Mar 2009 11:26:50 GMT",
"version": "v1"
}
] | 2009-03-26 | [
[
"Ilea",
"Daniela",
""
],
[
"Lacrama",
"Dan L.",
""
]
] | This paper is focused on a C# and Sql Server Mobile 2005 application to keep evidence of a shop list. The purpose of the application is to offer to the user an easier way to manage his shopping options. |
2004.13139 | Yang Sun | Yang Sun, Fajie Yuan, Min Yang, Guoao Wei, Zhou Zhao, and Duo Liu | A Generic Network Compression Framework for Sequential Recommender
Systems | Accepted by SIGIR2020 | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sequential recommender systems (SRS) have become the key technology in
capturing user's dynamic interests and generating high-quality recommendations.
Current state-of-the-art sequential recommender models are typically based on a
sandwich-structured deep neural network, where one or more middle (hidden)
layers are p... | [
{
"created": "Tue, 21 Apr 2020 08:40:55 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Apr 2020 08:10:16 GMT",
"version": "v2"
},
{
"created": "Thu, 30 Apr 2020 03:16:13 GMT",
"version": "v3"
},
{
"created": "Mon, 25 May 2020 14:49:16 GMT",
"version": "v4"
},
{
"c... | 2020-05-27 | [
[
"Sun",
"Yang",
""
],
[
"Yuan",
"Fajie",
""
],
[
"Yang",
"Min",
""
],
[
"Wei",
"Guoao",
""
],
[
"Zhao",
"Zhou",
""
],
[
"Liu",
"Duo",
""
]
] | Sequential recommender systems (SRS) have become the key technology in capturing user's dynamic interests and generating high-quality recommendations. Current state-of-the-art sequential recommender models are typically based on a sandwich-structured deep neural network, where one or more middle (hidden) layers are pla... |
2006.14331 | Alexander Meulemans | Alexander Meulemans, Francesco S. Carzaniga, Johan A.K. Suykens,
Jo\~ao Sacramento, Benjamin F. Grewe | A Theoretical Framework for Target Propagation | 13 pages and 4 figures in main manuscript; 41 pages and 8 figures in
supplementary material | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of deep learning, a brain-inspired form of AI, has sparked
interest in understanding how the brain could similarly learn across multiple
layers of neurons. However, the majority of biologically-plausible learning
algorithms have not yet reached the performance of backpropagation (BP), nor
are they built o... | [
{
"created": "Thu, 25 Jun 2020 12:07:06 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Jul 2020 06:40:12 GMT",
"version": "v2"
},
{
"created": "Fri, 30 Oct 2020 10:06:16 GMT",
"version": "v3"
},
{
"created": "Wed, 16 Dec 2020 16:21:36 GMT",
"version": "v4"
}
] | 2020-12-17 | [
[
"Meulemans",
"Alexander",
""
],
[
"Carzaniga",
"Francesco S.",
""
],
[
"Suykens",
"Johan A. K.",
""
],
[
"Sacramento",
"João",
""
],
[
"Grewe",
"Benjamin F.",
""
]
] | The success of deep learning, a brain-inspired form of AI, has sparked interest in understanding how the brain could similarly learn across multiple layers of neurons. However, the majority of biologically-plausible learning algorithms have not yet reached the performance of backpropagation (BP), nor are they built on ... |
1209.4867 | Apu Kapadia | Ruj Akavipat, Mahdi N. Al-Ameen, Apu Kapadia, Zahid Rahman, Roman
Schlegel, Matthew Wright | ReDS: A Framework for Reputation-Enhanced DHTs | null | IEEE TPDS Special Issue on Trust, Security, and Privacy, Feb.
2014, Vol. 5, Issue 2 | 10.1109/TPDS.2013.231 | null | cs.NI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed Hash Tables (DHTs) such as Chord and Kademlia offer an efficient
solution for locating resources in peer-to-peer networks. Unfortunately,
malicious nodes along a lookup path can easily subvert such queries. Several
systems, including Halo (based on Chord) and Kad (based on Kademlia), mitigate
such attacks... | [
{
"created": "Fri, 21 Sep 2012 17:31:25 GMT",
"version": "v1"
}
] | 2014-01-29 | [
[
"Akavipat",
"Ruj",
""
],
[
"Al-Ameen",
"Mahdi N.",
""
],
[
"Kapadia",
"Apu",
""
],
[
"Rahman",
"Zahid",
""
],
[
"Schlegel",
"Roman",
""
],
[
"Wright",
"Matthew",
""
]
] | Distributed Hash Tables (DHTs) such as Chord and Kademlia offer an efficient solution for locating resources in peer-to-peer networks. Unfortunately, malicious nodes along a lookup path can easily subvert such queries. Several systems, including Halo (based on Chord) and Kad (based on Kademlia), mitigate such attacks b... |
2210.12484 | Yue Zhang | Yue Zhang and Bo Zhang and Zhenghua Li and Zuyi Bao and Chen Li and
Min Zhang | SynGEC: Syntax-Enhanced Grammatical Error Correction with a Tailored
GEC-Oriented Parser | Accepted by EMNLP2022 (main conference) | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This work proposes a syntax-enhanced grammatical error correction (GEC)
approach named SynGEC that effectively incorporates dependency syntactic
information into the encoder part of GEC models. The key challenge for this
idea is that off-the-shelf parsers are unreliable when processing ungrammatical
sentences. To con... | [
{
"created": "Sat, 22 Oct 2022 15:54:29 GMT",
"version": "v1"
}
] | 2022-10-25 | [
[
"Zhang",
"Yue",
""
],
[
"Zhang",
"Bo",
""
],
[
"Li",
"Zhenghua",
""
],
[
"Bao",
"Zuyi",
""
],
[
"Li",
"Chen",
""
],
[
"Zhang",
"Min",
""
]
] | This work proposes a syntax-enhanced grammatical error correction (GEC) approach named SynGEC that effectively incorporates dependency syntactic information into the encoder part of GEC models. The key challenge for this idea is that off-the-shelf parsers are unreliable when processing ungrammatical sentences. To confr... |
2212.09285 | J\'an Pich | Jan Pich | Localizability of the approximation method | null | null | null | null | cs.CC cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We use the approximation method of Razborov to analyze the locality barrier
which arose from the investigation of the hardness magnification approach to
complexity lower bounds. Adapting a limitation of the approximation method
obtained by Razborov, we show that in many cases it is not possible to combine
the approxi... | [
{
"created": "Mon, 19 Dec 2022 07:42:05 GMT",
"version": "v1"
}
] | 2022-12-20 | [
[
"Pich",
"Jan",
""
]
] | We use the approximation method of Razborov to analyze the locality barrier which arose from the investigation of the hardness magnification approach to complexity lower bounds. Adapting a limitation of the approximation method obtained by Razborov, we show that in many cases it is not possible to combine the approxima... |
2209.01207 | Kevin Sebastian Luck | Chang Rajani, Karol Arndt, David Blanco-Mulero, Kevin Sebastian Luck,
Ville Kyrki | Co-Imitation: Learning Design and Behaviour by Imitation | 14 pages, 11 figures, accepted for AAAI-23 | null | null | null | cs.LG cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The co-adaptation of robots has been a long-standing research endeavour with
the goal of adapting both body and behaviour of a system for a given task,
inspired by the natural evolution of animals. Co-adaptation has the potential
to eliminate costly manual hardware engineering as well as improve the
performance of sy... | [
{
"created": "Fri, 2 Sep 2022 17:57:32 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Feb 2023 03:58:21 GMT",
"version": "v2"
}
] | 2023-02-08 | [
[
"Rajani",
"Chang",
""
],
[
"Arndt",
"Karol",
""
],
[
"Blanco-Mulero",
"David",
""
],
[
"Luck",
"Kevin Sebastian",
""
],
[
"Kyrki",
"Ville",
""
]
] | The co-adaptation of robots has been a long-standing research endeavour with the goal of adapting both body and behaviour of a system for a given task, inspired by the natural evolution of animals. Co-adaptation has the potential to eliminate costly manual hardware engineering as well as improve the performance of syst... |
2209.01688 | Hai Huang | Hai Huang, Zhikun Zhang, Yun Shen, Michael Backes, Qi Li, Yang Zhang | On the Privacy Risks of Cell-Based NAS Architectures | Accepted by CCS 2022 | null | 10.1145/3548606.3560619 | null | cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Existing studies on neural architecture search (NAS) mainly focus on
efficiently and effectively searching for network architectures with better
performance. Little progress has been made to systematically understand if the
NAS-searched architectures are robust to privacy attacks while abundant work
has already shown... | [
{
"created": "Sun, 4 Sep 2022 20:24:04 GMT",
"version": "v1"
}
] | 2022-09-07 | [
[
"Huang",
"Hai",
""
],
[
"Zhang",
"Zhikun",
""
],
[
"Shen",
"Yun",
""
],
[
"Backes",
"Michael",
""
],
[
"Li",
"Qi",
""
],
[
"Zhang",
"Yang",
""
]
] | Existing studies on neural architecture search (NAS) mainly focus on efficiently and effectively searching for network architectures with better performance. Little progress has been made to systematically understand if the NAS-searched architectures are robust to privacy attacks while abundant work has already shown t... |
2210.04050 | Yuxiang Guo | Yuxiang Guo, Cheng Peng, Chun Pong Lau, Rama Chellappa | Multi-Modal Human Authentication Using Silhouettes, Gait and RGB | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Whole-body-based human authentication is a promising approach for remote
biometrics scenarios. Current literature focuses on either body recognition
based on RGB images or gait recognition based on body shapes and walking
patterns; both have their advantages and drawbacks. In this work, we propose
Dual-Modal Ensemble... | [
{
"created": "Sat, 8 Oct 2022 15:17:32 GMT",
"version": "v1"
}
] | 2022-10-11 | [
[
"Guo",
"Yuxiang",
""
],
[
"Peng",
"Cheng",
""
],
[
"Lau",
"Chun Pong",
""
],
[
"Chellappa",
"Rama",
""
]
] | Whole-body-based human authentication is a promising approach for remote biometrics scenarios. Current literature focuses on either body recognition based on RGB images or gait recognition based on body shapes and walking patterns; both have their advantages and drawbacks. In this work, we propose Dual-Modal Ensemble (... |
2212.08021 | Francesco Pierri | Francesco Pierri | Political advertisement on Facebook and Instagram in the run up to 2022
Italian general election | 10 pages, 12 figures. To be published in the proceedings of the ACM
Web Science Conference (2023) | null | 10.1145/3578503.3583598 | null | cs.CY cs.SI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Targeted advertising on online social platforms has become increasingly
relevant in the political marketing toolkit. Monitoring political advertising
is crucial to ensure accountability and transparency of democratic processes.
Leveraging Meta public library of sponsored content, we study the extent to
which politica... | [
{
"created": "Mon, 12 Dec 2022 13:37:18 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Feb 2023 12:06:31 GMT",
"version": "v2"
}
] | 2023-02-09 | [
[
"Pierri",
"Francesco",
""
]
] | Targeted advertising on online social platforms has become increasingly relevant in the political marketing toolkit. Monitoring political advertising is crucial to ensure accountability and transparency of democratic processes. Leveraging Meta public library of sponsored content, we study the extent to which political ... |
1905.03037 | Sanaz Bahargam | Sanaz Bahargam and Theodoros Lappas and Evimaria Terzi | The Guided Team-Partitioning Problem: Definition, Complexity, and
Algorithm | null | null | null | null | cs.SI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A long line of literature has focused on the problem of selecting a team of
individuals from a large pool of candidates, such that certain constraints are
respected, and a given objective function is maximized. Even though extant
research has successfully considered diverse families of objective functions
and constra... | [
{
"created": "Tue, 30 Apr 2019 05:12:32 GMT",
"version": "v1"
}
] | 2019-05-09 | [
[
"Bahargam",
"Sanaz",
""
],
[
"Lappas",
"Theodoros",
""
],
[
"Terzi",
"Evimaria",
""
]
] | A long line of literature has focused on the problem of selecting a team of individuals from a large pool of candidates, such that certain constraints are respected, and a given objective function is maximized. Even though extant research has successfully considered diverse families of objective functions and constrain... |
0805.0941 | EDA Publishing Association | Andras Vass-Varnai, M. Rencz | Package Hermeticity Testing with Thermal Transient Measurements | Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838) | Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008) | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid incursion of new technologies such as MEMS and smart sensor device
manufacturing requires new tailor-made packaging designs. In many applications
these devices are exposed to humid environments. Since the penetration of
moisture into the package may result in internal corrosion or shift of the
operating par... | [
{
"created": "Wed, 7 May 2008 09:52:00 GMT",
"version": "v1"
}
] | 2008-12-18 | [
[
"Vass-Varnai",
"Andras",
""
],
[
"Rencz",
"M.",
""
]
] | The rapid incursion of new technologies such as MEMS and smart sensor device manufacturing requires new tailor-made packaging designs. In many applications these devices are exposed to humid environments. Since the penetration of moisture into the package may result in internal corrosion or shift of the operating param... |
1904.12540 | Said Ghoul | Enas Nafar and Said Ghoul | A Genetic Framework Model For Self-Adaptive Software | 12 pages | Journal of Software Engineering, 11(2), 2017 | 10.3923/jse.2017 | null | cs.SE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Lots of bio-inspired research works have been conducted in self-adaptive
software. They have focused on the external behavior of biological entities
without their genetic material that causes this behavior and constitutes the
challenge this work dealt with. This paper propose a framework integrating both
the external... | [
{
"created": "Mon, 29 Apr 2019 09:46:42 GMT",
"version": "v1"
}
] | 2019-04-30 | [
[
"Nafar",
"Enas",
""
],
[
"Ghoul",
"Said",
""
]
] | Lots of bio-inspired research works have been conducted in self-adaptive software. They have focused on the external behavior of biological entities without their genetic material that causes this behavior and constitutes the challenge this work dealt with. This paper propose a framework integrating both the external b... |
2401.01520 | Yixuan Wang | Yixuan Wang and Shuangyin Li | S$^{2}$-DMs:Skip-Step Diffusion Models | 12 pages | null | null | null | cs.CV cs.LG eess.IV | http://creativecommons.org/licenses/by/4.0/ | Diffusion models have emerged as powerful generative tools, rivaling GANs in
sample quality and mirroring the likelihood scores of autoregressive models. A
subset of these models, exemplified by DDIMs, exhibit an inherent asymmetry:
they are trained over $T$ steps but only sample from a subset of $T$ during
generatio... | [
{
"created": "Wed, 3 Jan 2024 03:08:32 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Jan 2024 02:59:04 GMT",
"version": "v2"
}
] | 2024-01-24 | [
[
"Wang",
"Yixuan",
""
],
[
"Li",
"Shuangyin",
""
]
] | Diffusion models have emerged as powerful generative tools, rivaling GANs in sample quality and mirroring the likelihood scores of autoregressive models. A subset of these models, exemplified by DDIMs, exhibit an inherent asymmetry: they are trained over $T$ steps but only sample from a subset of $T$ during generation.... |
1905.11739 | Deepayan Das | Deepayan Das, Jerin Philip, Minesh Mathew and C. V. Jawahar | A Cost Efficient Approach to Correct OCR Errors in Large Document
Collections | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Word error rate of an ocr is often higher than its character error rate. This
is especially true when ocrs are designed by recognizing characters. High word
accuracies are critical to tasks like the creation of content in digital
libraries and text-to-speech applications. In order to detect and correct the
misrecogni... | [
{
"created": "Tue, 28 May 2019 11:11:57 GMT",
"version": "v1"
}
] | 2019-05-29 | [
[
"Das",
"Deepayan",
""
],
[
"Philip",
"Jerin",
""
],
[
"Mathew",
"Minesh",
""
],
[
"Jawahar",
"C. V.",
""
]
] | Word error rate of an ocr is often higher than its character error rate. This is especially true when ocrs are designed by recognizing characters. High word accuracies are critical to tasks like the creation of content in digital libraries and text-to-speech applications. In order to detect and correct the misrecognise... |
2309.13692 | Julian Asilis | Julian Asilis, Siddartha Devic, Shaddin Dughmi, Vatsal Sharan,
Shang-Hua Teng | Regularization and Optimal Multiclass Learning | COLT 2024; 43 pages | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The quintessential learning algorithm of empirical risk minimization (ERM) is
known to fail in various settings for which uniform convergence does not
characterize learning. It is therefore unsurprising that the practice of
machine learning is rife with considerably richer algorithmic techniques for
successfully cont... | [
{
"created": "Sun, 24 Sep 2023 16:49:55 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Jun 2024 17:42:18 GMT",
"version": "v2"
}
] | 2024-06-26 | [
[
"Asilis",
"Julian",
""
],
[
"Devic",
"Siddartha",
""
],
[
"Dughmi",
"Shaddin",
""
],
[
"Sharan",
"Vatsal",
""
],
[
"Teng",
"Shang-Hua",
""
]
] | The quintessential learning algorithm of empirical risk minimization (ERM) is known to fail in various settings for which uniform convergence does not characterize learning. It is therefore unsurprising that the practice of machine learning is rife with considerably richer algorithmic techniques for successfully contro... |
2404.04956 | Zijin Yang | Zijin Yang, Kai Zeng, Kejiang Chen, Han Fang, Weiming Zhang, Nenghai
Yu | Gaussian Shading: Provable Performance-Lossless Image Watermarking for
Diffusion Models | 17 pages, 11 figures, accepted by CVPR 2024 | null | null | null | cs.CV cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ethical concerns surrounding copyright protection and inappropriate content
generation pose challenges for the practical implementation of diffusion
models. One effective solution involves watermarking the generated images.
However, existing methods often compromise the model performance or require
additional trainin... | [
{
"created": "Sun, 7 Apr 2024 13:30:10 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Apr 2024 08:05:29 GMT",
"version": "v2"
},
{
"created": "Mon, 6 May 2024 10:43:48 GMT",
"version": "v3"
}
] | 2024-05-07 | [
[
"Yang",
"Zijin",
""
],
[
"Zeng",
"Kai",
""
],
[
"Chen",
"Kejiang",
""
],
[
"Fang",
"Han",
""
],
[
"Zhang",
"Weiming",
""
],
[
"Yu",
"Nenghai",
""
]
] | Ethical concerns surrounding copyright protection and inappropriate content generation pose challenges for the practical implementation of diffusion models. One effective solution involves watermarking the generated images. However, existing methods often compromise the model performance or require additional training,... |
2107.08271 | Andrea Celli | Georgios Birmpas, Andrea Celli, Riccardo Colini-Baldeschi, Stefano
Leonardi | Fair Equilibria in Sponsored Search Auctions: The Advertisers'
Perspective | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we introduce a new class of mechanisms composed of a traditional
Generalized Second Price (GSP) auction and a fair division scheme, in order to
achieve some desired level of fairness between groups of Bayesian strategic
advertisers. We propose two mechanisms, $\beta$-Fair GSP and GSP-EFX, that
compose GS... | [
{
"created": "Sat, 17 Jul 2021 16:18:31 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Sep 2022 13:51:19 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Oct 2022 14:06:44 GMT",
"version": "v3"
}
] | 2022-10-19 | [
[
"Birmpas",
"Georgios",
""
],
[
"Celli",
"Andrea",
""
],
[
"Colini-Baldeschi",
"Riccardo",
""
],
[
"Leonardi",
"Stefano",
""
]
] | In this work we introduce a new class of mechanisms composed of a traditional Generalized Second Price (GSP) auction and a fair division scheme, in order to achieve some desired level of fairness between groups of Bayesian strategic advertisers. We propose two mechanisms, $\beta$-Fair GSP and GSP-EFX, that compose GSP ... |
cs/0404049 | Stergos Afantenos | Stergos D. Afantenos, Irene Doura, Eleni Kapellou, and Vangelis
Karkaletsis | Exploiting Cross-Document Relations for Multi-document Evolving
Summarization | 10 pages | Methods and Applications of Artificial Intelligence, Volume 3025
of Lecture Notes in Computer Science. Springer-Verlag Heidelberg 2004. pp
410-419. | null | null | cs.CL cs.AI | null | This paper presents a methodology for summarization from multiple documents
which are about a specific topic. It is based on the specification and
identification of the cross-document relations that occur among textual
elements within those documents. Our methodology involves the specification of
the topic-specific e... | [
{
"created": "Fri, 23 Apr 2004 10:44:24 GMT",
"version": "v1"
}
] | 2016-08-31 | [
[
"Afantenos",
"Stergos D.",
""
],
[
"Doura",
"Irene",
""
],
[
"Kapellou",
"Eleni",
""
],
[
"Karkaletsis",
"Vangelis",
""
]
] | This paper presents a methodology for summarization from multiple documents which are about a specific topic. It is based on the specification and identification of the cross-document relations that occur among textual elements within those documents. Our methodology involves the specification of the topic-specific ent... |
1107.0064 | EPTCS | Jeroen van den Bos (CWI), Mark Hills (CWI), Paul Klint (CWI), Tijs van
der Storm (CWI), Jurgen J. Vinju (CWI) | Rascal: From Algebraic Specification to Meta-Programming | In Proceedings AMMSE 2011, arXiv:1106.5962 | EPTCS 56, 2011, pp. 15-32 | 10.4204/EPTCS.56.2 | null | cs.PL cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Algebraic specification has a long tradition in bridging the gap between
specification and programming by making specifications executable. Building on
extensive experience in designing, implementing and using specification
formalisms that are based on algebraic specification and term rewriting (namely
Asf and Asf+Sd... | [
{
"created": "Thu, 30 Jun 2011 21:44:38 GMT",
"version": "v1"
}
] | 2011-07-04 | [
[
"Bos",
"Jeroen van den",
"",
"CWI"
],
[
"Hills",
"Mark",
"",
"CWI"
],
[
"Klint",
"Paul",
"",
"CWI"
],
[
"van der Storm",
"Tijs",
"",
"CWI"
],
[
"Vinju",
"Jurgen J.",
"",
"CWI"
]
] | Algebraic specification has a long tradition in bridging the gap between specification and programming by making specifications executable. Building on extensive experience in designing, implementing and using specification formalisms that are based on algebraic specification and term rewriting (namely Asf and Asf+Sdf)... |
2309.05883 | Shaoyuan Xu Ph.D. | Moyan Li, Jinmiao Fu, Shaoyuan Xu, Huidong Liu, Jia Liu, Bryan Wang | Hierarchical Conditional Semi-Paired Image-to-Image Translation For
Multi-Task Image Defect Correction On Shopping Websites | 6 pages, 6 figures, 3 tables. To be published in ICIP 2023 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | On shopping websites, product images of low quality negatively affect
customer experience. Although there are plenty of work in detecting images with
different defects, few efforts have been dedicated to correct those defects at
scale. A major challenge is that there are thousands of product types and each
has specif... | [
{
"created": "Tue, 12 Sep 2023 00:07:08 GMT",
"version": "v1"
}
] | 2023-09-13 | [
[
"Li",
"Moyan",
""
],
[
"Fu",
"Jinmiao",
""
],
[
"Xu",
"Shaoyuan",
""
],
[
"Liu",
"Huidong",
""
],
[
"Liu",
"Jia",
""
],
[
"Wang",
"Bryan",
""
]
] | On shopping websites, product images of low quality negatively affect customer experience. Although there are plenty of work in detecting images with different defects, few efforts have been dedicated to correct those defects at scale. A major challenge is that there are thousands of product types and each has specific... |
2011.00956 | Binbin Jin | Binbin Jin, Defu Lian, Zheng Liu, Qi Liu, Jianhui Ma, Xing Xie, Enhong
Chen | Sampling-Decomposable Generative Adversarial Recommender | Thirty-fourth Conference on Neural Information Processing Systems
(NeurIPS2020) | null | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommendation techniques are important approaches for alleviating
information overload. Being often trained on implicit user feedback, many
recommenders suffer from the sparsity challenge due to the lack of explicitly
negative samples. The GAN-style recommenders (i.e., IRGAN) addresses the
challenge by learning a ge... | [
{
"created": "Mon, 2 Nov 2020 13:19:10 GMT",
"version": "v1"
}
] | 2020-11-03 | [
[
"Jin",
"Binbin",
""
],
[
"Lian",
"Defu",
""
],
[
"Liu",
"Zheng",
""
],
[
"Liu",
"Qi",
""
],
[
"Ma",
"Jianhui",
""
],
[
"Xie",
"Xing",
""
],
[
"Chen",
"Enhong",
""
]
] | Recommendation techniques are important approaches for alleviating information overload. Being often trained on implicit user feedback, many recommenders suffer from the sparsity challenge due to the lack of explicitly negative samples. The GAN-style recommenders (i.e., IRGAN) addresses the challenge by learning a gene... |
2404.09138 | Artur Kiulian | Artur Kiulian, Anton Polishko, Mykola Khandoga, Oryna Chubych, Jack
Connor, Raghav Ravishankar, Adarsh Shirawalmath | From Bytes to Borsch: Fine-Tuning Gemma and Mistral for the Ukrainian
Language Representation | null | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | In the rapidly advancing field of AI and NLP, generative large language
models (LLMs) stand at the forefront of innovation, showcasing unparalleled
abilities in text understanding and generation. However, the limited
representation of low-resource languages like Ukrainian poses a notable
challenge, restricting the re... | [
{
"created": "Sun, 14 Apr 2024 04:25:41 GMT",
"version": "v1"
}
] | 2024-04-16 | [
[
"Kiulian",
"Artur",
""
],
[
"Polishko",
"Anton",
""
],
[
"Khandoga",
"Mykola",
""
],
[
"Chubych",
"Oryna",
""
],
[
"Connor",
"Jack",
""
],
[
"Ravishankar",
"Raghav",
""
],
[
"Shirawalmath",
"Adarsh",
""
]... | In the rapidly advancing field of AI and NLP, generative large language models (LLMs) stand at the forefront of innovation, showcasing unparalleled abilities in text understanding and generation. However, the limited representation of low-resource languages like Ukrainian poses a notable challenge, restricting the reac... |
2001.03035 | Carsten Janda | Carsten Rudolf Janda, Moritz Wiese, Eduard A. Jorswieck and Holger
Boche | Arbitrarily Varying Wiretap Channels with Non-Causal Side Information at
the Jammer | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Secure communication in a potentially malicious environment becomes more and
more important. The arbitrarily varying wiretap channel (AVWC) provides
information theoretical bounds on how much information can be exchanged even in
the presence of an active attacker. If the active attacker has non-causal side
informatio... | [
{
"created": "Thu, 9 Jan 2020 15:01:50 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Jan 2020 15:55:11 GMT",
"version": "v2"
},
{
"created": "Thu, 9 Apr 2020 09:09:28 GMT",
"version": "v3"
},
{
"created": "Thu, 14 Apr 2022 13:17:00 GMT",
"version": "v4"
}
] | 2022-04-15 | [
[
"Janda",
"Carsten Rudolf",
""
],
[
"Wiese",
"Moritz",
""
],
[
"Jorswieck",
"Eduard A.",
""
],
[
"Boche",
"Holger",
""
]
] | Secure communication in a potentially malicious environment becomes more and more important. The arbitrarily varying wiretap channel (AVWC) provides information theoretical bounds on how much information can be exchanged even in the presence of an active attacker. If the active attacker has non-causal side information,... |
2108.12296 | Sajad Darabi | Sajad Darabi, Shayan Fazeli, Ali Pazoki, Sriram Sankararaman, Majid
Sarrafzadeh | Contrastive Mixup: Self- and Semi-Supervised learning for Tabular Domain | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recent literature in self-supervised has demonstrated significant progress in
closing the gap between supervised and unsupervised methods in the image and
text domains. These methods rely on domain-specific augmentations that are not
directly amenable to the tabular domain. Instead, we introduce Contrastive
Mixup, a ... | [
{
"created": "Fri, 27 Aug 2021 14:09:13 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Sep 2021 02:04:54 GMT",
"version": "v2"
}
] | 2021-09-02 | [
[
"Darabi",
"Sajad",
""
],
[
"Fazeli",
"Shayan",
""
],
[
"Pazoki",
"Ali",
""
],
[
"Sankararaman",
"Sriram",
""
],
[
"Sarrafzadeh",
"Majid",
""
]
] | Recent literature in self-supervised has demonstrated significant progress in closing the gap between supervised and unsupervised methods in the image and text domains. These methods rely on domain-specific augmentations that are not directly amenable to the tabular domain. Instead, we introduce Contrastive Mixup, a se... |
1201.6218 | Wojciech Mazurczyk | Artur Janicki, Wojciech Mazurczyk and Krzysztof Szczypiorski | Influence of Speech Codecs Selection on Transcoding Steganography | 17 pages, 5 figures, 4 tables | null | null | null | cs.CR cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The typical approach to steganography is to compress the covert data in order
to limit its size, which is reasonable in the context of a limited
steganographic bandwidth. TranSteg (Trancoding Steganography) is a new IP
telephony steganographic method that was recently proposed that offers high
steganographic bandwidt... | [
{
"created": "Mon, 30 Jan 2012 14:16:35 GMT",
"version": "v1"
}
] | 2012-01-31 | [
[
"Janicki",
"Artur",
""
],
[
"Mazurczyk",
"Wojciech",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] | The typical approach to steganography is to compress the covert data in order to limit its size, which is reasonable in the context of a limited steganographic bandwidth. TranSteg (Trancoding Steganography) is a new IP telephony steganographic method that was recently proposed that offers high steganographic bandwidth ... |
1911.02921 | Enrique Fita Sanmartin | Enrique Fita Sanmartin, Sebastian Damrich, Fred A. Hamprecht (HCI/IWR
at Heidelberg University) | Probabilistic Watershed: Sampling all spanning forests for seeded
segmentation and semi-supervised learning | To be published in NeurIPS2019 | null | null | null | cs.DS cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The seeded Watershed algorithm / minimax semi-supervised learning on a graph
computes a minimum spanning forest which connects every pixel / unlabeled node
to a seed / labeled node. We propose instead to consider all possible spanning
forests and calculate, for every node, the probability of sampling a forest
connect... | [
{
"created": "Wed, 6 Nov 2019 13:26:32 GMT",
"version": "v1"
}
] | 2019-11-11 | [
[
"Sanmartin",
"Enrique Fita",
"",
"HCI/IWR\n at Heidelberg University"
],
[
"Damrich",
"Sebastian",
"",
"HCI/IWR\n at Heidelberg University"
],
[
"Hamprecht",
"Fred A.",
"",
"HCI/IWR\n at Heidelberg University"
]
] | The seeded Watershed algorithm / minimax semi-supervised learning on a graph computes a minimum spanning forest which connects every pixel / unlabeled node to a seed / labeled node. We propose instead to consider all possible spanning forests and calculate, for every node, the probability of sampling a forest connectin... |
1401.3874 | Fei Wu | Fei Wu, Jayant Madhavan, Alon Halevy | Identifying Aspects for Web-Search Queries | null | Journal Of Artificial Intelligence Research, Volume 40, pages
677-700, 2011 | 10.1613/jair.3182 | null | cs.IR cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many web-search queries serve as the beginning of an exploration of an
unknown space of information, rather than looking for a specific web page. To
answer such queries effec- tively, the search engine should attempt to organize
the space of relevant information in a way that facilitates exploration. We
describe the ... | [
{
"created": "Thu, 16 Jan 2014 05:09:56 GMT",
"version": "v1"
}
] | 2014-01-17 | [
[
"Wu",
"Fei",
""
],
[
"Madhavan",
"Jayant",
""
],
[
"Halevy",
"Alon",
""
]
] | Many web-search queries serve as the beginning of an exploration of an unknown space of information, rather than looking for a specific web page. To answer such queries effec- tively, the search engine should attempt to organize the space of relevant information in a way that facilitates exploration. We describe the As... |
2310.00254 | Youquan Xian | Youquan Xian, Lianghaojie Zhou, Jianyong Jiang, Boyi Wang, Hao Huo,
Peng Liu | A Distributed Efficient Blockchain Oracle Scheme for Internet of Things | 10 pages, 9 figures | null | null | null | cs.NI cs.DC cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, blockchain has been widely applied in the Internet of Things
(IoT). Blockchain oracle, as a bridge for data communication between blockchain
and off-chain, has also received significant attention. However, the numerous
and heterogeneous devices in the IoT pose great challenges to the efficiency
and s... | [
{
"created": "Sat, 30 Sep 2023 04:54:50 GMT",
"version": "v1"
}
] | 2023-10-03 | [
[
"Xian",
"Youquan",
""
],
[
"Zhou",
"Lianghaojie",
""
],
[
"Jiang",
"Jianyong",
""
],
[
"Wang",
"Boyi",
""
],
[
"Huo",
"Hao",
""
],
[
"Liu",
"Peng",
""
]
] | In recent years, blockchain has been widely applied in the Internet of Things (IoT). Blockchain oracle, as a bridge for data communication between blockchain and off-chain, has also received significant attention. However, the numerous and heterogeneous devices in the IoT pose great challenges to the efficiency and sec... |
1611.02120 | Brett Meyer | Sean C. Smithson and Guang Yang and Warren J. Gross and Brett H. Meyer | Neural Networks Designing Neural Networks: Multi-Objective
Hyper-Parameter Optimization | To appear in ICCAD'16. The authoritative version will appear in the
ACM Digital Library | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Artificial neural networks have gone through a recent rise in popularity,
achieving state-of-the-art results in various fields, including image
classification, speech recognition, and automated control. Both the performance
and computational complexity of such models are heavily dependant on the design
of characteris... | [
{
"created": "Mon, 7 Nov 2016 15:38:39 GMT",
"version": "v1"
}
] | 2016-11-08 | [
[
"Smithson",
"Sean C.",
""
],
[
"Yang",
"Guang",
""
],
[
"Gross",
"Warren J.",
""
],
[
"Meyer",
"Brett H.",
""
]
] | Artificial neural networks have gone through a recent rise in popularity, achieving state-of-the-art results in various fields, including image classification, speech recognition, and automated control. Both the performance and computational complexity of such models are heavily dependant on the design of characteristi... |
2105.03827 | Wenhao Wu | Yuxiang Zhao, Wenhao Wu, Yue He, Yingying Li, Xiao Tan, Shifeng Chen | Good Practices and A Strong Baseline for Traffic Anomaly Detection | We rank $1^{st}$ in the CVPR 2021 NVIDIA AI CITY Challenge for
Traffic Anomaly detection | null | null | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | The detection of traffic anomalies is a critical component of the intelligent
city transportation management system. Previous works have proposed a variety
of notable insights and taken a step forward in this field, however, dealing
with the complex traffic environment remains a challenge. Moreover, the lack of
high-... | [
{
"created": "Sun, 9 May 2021 03:51:37 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Jun 2021 12:47:27 GMT",
"version": "v2"
}
] | 2021-06-07 | [
[
"Zhao",
"Yuxiang",
""
],
[
"Wu",
"Wenhao",
""
],
[
"He",
"Yue",
""
],
[
"Li",
"Yingying",
""
],
[
"Tan",
"Xiao",
""
],
[
"Chen",
"Shifeng",
""
]
] | The detection of traffic anomalies is a critical component of the intelligent city transportation management system. Previous works have proposed a variety of notable insights and taken a step forward in this field, however, dealing with the complex traffic environment remains a challenge. Moreover, the lack of high-qu... |
2105.10897 | Saptarshi Sarkar | Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil | Asynchronous wreath product and cascade decompositions for concurrent
behaviours | null | Logical Methods in Computer Science, Volume 18, Issue 2 (June 28,
2022) lmcs:7504 | 10.46298/lmcs-18(2:22)2022 | null | cs.FL | http://creativecommons.org/licenses/by/4.0/ | We develop new algebraic tools to reason about concurrent behaviours modelled
as languages of Mazurkiewicz traces and asynchronous automata. These tools
reflect the distributed nature of traces and the underlying causality and
concurrency between events, and can be said to support true concurrency. They
generalize th... | [
{
"created": "Sun, 23 May 2021 09:47:26 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Feb 2022 06:39:59 GMT",
"version": "v2"
},
{
"created": "Mon, 21 Feb 2022 09:09:39 GMT",
"version": "v3"
},
{
"created": "Wed, 27 Apr 2022 00:31:51 GMT",
"version": "v4"
},
{
"cr... | 2023-06-22 | [
[
"Adsul",
"Bharat",
""
],
[
"Gastin",
"Paul",
""
],
[
"Sarkar",
"Saptarshi",
""
],
[
"Weil",
"Pascal",
""
]
] | We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between events, and can be said to support true concurrency. They generalize the ... |
1405.6434 | Yanwei Fu | Yanwei Fu, Lingbo Wang, Yanwen Guo | Multi-view Metric Learning for Multi-view Video Summarization | null | null | null | null | cs.CV cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditional methods on video summarization are designed to generate summaries
for single-view video records; and thus they cannot fully exploit the
redundancy in multi-view video records. In this paper, we present a multi-view
metric learning framework for multi-view video summarization that combines the
advantages o... | [
{
"created": "Sun, 25 May 2014 22:35:19 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Nov 2015 22:56:21 GMT",
"version": "v2"
}
] | 2015-11-30 | [
[
"Fu",
"Yanwei",
""
],
[
"Wang",
"Lingbo",
""
],
[
"Guo",
"Yanwen",
""
]
] | Traditional methods on video summarization are designed to generate summaries for single-view video records; and thus they cannot fully exploit the redundancy in multi-view video records. In this paper, we present a multi-view metric learning framework for multi-view video summarization that combines the advantages of ... |
1403.3465 | Hugh Brendan McMahan | H. Brendan McMahan | A Survey of Algorithms and Analysis for Adaptive Online Learning | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present tools for the analysis of Follow-The-Regularized-Leader (FTRL),
Dual Averaging, and Mirror Descent algorithms when the regularizer
(equivalently, prox-function or learning rate schedule) is chosen adaptively
based on the data. Adaptivity can be used to prove regret bounds that hold on
every round, and also... | [
{
"created": "Fri, 14 Mar 2014 00:25:03 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Oct 2014 18:31:01 GMT",
"version": "v2"
},
{
"created": "Mon, 9 Nov 2015 17:32:51 GMT",
"version": "v3"
}
] | 2015-11-10 | [
[
"McMahan",
"H. Brendan",
""
]
] | We present tools for the analysis of Follow-The-Regularized-Leader (FTRL), Dual Averaging, and Mirror Descent algorithms when the regularizer (equivalently, prox-function or learning rate schedule) is chosen adaptively based on the data. Adaptivity can be used to prove regret bounds that hold on every round, and also a... |
2211.04314 | Corentin Salaun | Corentin Sala\"un and Iliyan Georgiev and Hans-Peter Seidel and
Gurprit Singh | Scalable multi-class sampling via filtered sliced optimal transport | 15 pages, 17 figures, ACM Trans. Graph., Vol. 41, No. 6, Article 261.
Publication date: December 2022 | null | 10.1145/3550454.3555484 10.1145/3550454.3555484 10.1145/3550454.3555484
10.1145/3550454.3555484 10.1145/3550454.3555484 10.1145/3550454.3555484 | null | cs.GR | http://creativecommons.org/licenses/by/4.0/ | We propose a multi-class point optimization formulation based on continuous
Wasserstein barycenters. Our formulation is designed to handle hundreds to
thousands of optimization objectives and comes with a practical optimization
scheme. We demonstrate the effectiveness of our framework on various sampling
applications... | [
{
"created": "Tue, 8 Nov 2022 15:33:04 GMT",
"version": "v1"
}
] | 2022-11-09 | [
[
"Salaün",
"Corentin",
""
],
[
"Georgiev",
"Iliyan",
""
],
[
"Seidel",
"Hans-Peter",
""
],
[
"Singh",
"Gurprit",
""
]
] | We propose a multi-class point optimization formulation based on continuous Wasserstein barycenters. Our formulation is designed to handle hundreds to thousands of optimization objectives and comes with a practical optimization scheme. We demonstrate the effectiveness of our framework on various sampling applications l... |
2012.15291 | Lorenzo Clemente | Lorenzo Clemente and S{\l}awomir Lasota | Reachability relations of timed pushdown automata | Author's version of JCSS article | Journal of Computer and System Sciences, Volume 117, May 2021,
Pages 202-241 | 10.1016/j.jcss.2020.11.003 | null | cs.FL cs.LO | http://creativecommons.org/licenses/by/4.0/ | Timed pushdown automata (TPDA) are an expressive formalism combining
recursion with a rich logic of timing constraints. We prove that reachability
relations of TPDA are expressible in linear arithmetic, a rich logic
generalising Presburger arithmetic and rational arithmetic. The main technical
ingredients are a novel... | [
{
"created": "Wed, 30 Dec 2020 19:09:54 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Clemente",
"Lorenzo",
""
],
[
"Lasota",
"Sławomir",
""
]
] | Timed pushdown automata (TPDA) are an expressive formalism combining recursion with a rich logic of timing constraints. We prove that reachability relations of TPDA are expressible in linear arithmetic, a rich logic generalising Presburger arithmetic and rational arithmetic. The main technical ingredients are a novel q... |
2008.06655 | Yi Xu | Xiang Li and Yuan Tian and Fuyao Zhang and Shuxue Quan and Yi Xu | Object Detection in the Context of Mobile Augmented Reality | accepted to IEEE International Symposium on Mixed and Augmented
Reality (ISMAR) 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the past few years, numerous Deep Neural Network (DNN) models and
frameworks have been developed to tackle the problem of real-time object
detection from RGB images. Ordinary object detection approaches process
information from the images only, and they are oblivious to the camera pose
with regard to the environme... | [
{
"created": "Sat, 15 Aug 2020 05:15:00 GMT",
"version": "v1"
}
] | 2020-08-18 | [
[
"Li",
"Xiang",
""
],
[
"Tian",
"Yuan",
""
],
[
"Zhang",
"Fuyao",
""
],
[
"Quan",
"Shuxue",
""
],
[
"Xu",
"Yi",
""
]
] | In the past few years, numerous Deep Neural Network (DNN) models and frameworks have been developed to tackle the problem of real-time object detection from RGB images. Ordinary object detection approaches process information from the images only, and they are oblivious to the camera pose with regard to the environment... |
2110.15114 | Jieming Zhu | Kelong Mao, Jieming Zhu, Xi Xiao, Biao Lu, Zhaowei Wang, Xiuqiang He | UltraGCN: Ultra Simplification of Graph Convolutional Networks for
Recommendation | Accepted by CIKM 2021. Code available at:
https://reczoo.github.io/UltraGCN | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the recent success of graph convolutional networks (GCNs), they have
been widely applied for recommendation, and achieved impressive performance
gains. The core of GCNs lies in its message passing mechanism to aggregate
neighborhood information. However, we observed that message passing largely
slows down the co... | [
{
"created": "Thu, 28 Oct 2021 13:53:56 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Nov 2023 02:52:40 GMT",
"version": "v2"
}
] | 2023-12-01 | [
[
"Mao",
"Kelong",
""
],
[
"Zhu",
"Jieming",
""
],
[
"Xiao",
"Xi",
""
],
[
"Lu",
"Biao",
""
],
[
"Wang",
"Zhaowei",
""
],
[
"He",
"Xiuqiang",
""
]
] | With the recent success of graph convolutional networks (GCNs), they have been widely applied for recommendation, and achieved impressive performance gains. The core of GCNs lies in its message passing mechanism to aggregate neighborhood information. However, we observed that message passing largely slows down the conv... |
2406.12178 | Weiwei Zhou | Jiada Lu, WeiWei Zhou, Xiang Qian, Dongze Lian, Yanyu Xu, Weifeng
Wang, Lina Cao, Shenghua Gao | FCA-RAC: First Cycle Annotated Repetitive Action Counting | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Repetitive action counting quantifies the frequency of specific actions
performed by individuals. However, existing action-counting datasets have
limited action diversity, potentially hampering model performance on unseen
actions. To address this issue, we propose a framework called First Cycle
Annotated Repetitive A... | [
{
"created": "Tue, 18 Jun 2024 01:12:43 GMT",
"version": "v1"
}
] | 2024-06-19 | [
[
"Lu",
"Jiada",
""
],
[
"Zhou",
"WeiWei",
""
],
[
"Qian",
"Xiang",
""
],
[
"Lian",
"Dongze",
""
],
[
"Xu",
"Yanyu",
""
],
[
"Wang",
"Weifeng",
""
],
[
"Cao",
"Lina",
""
],
[
"Gao",
"Shenghua",
... | Repetitive action counting quantifies the frequency of specific actions performed by individuals. However, existing action-counting datasets have limited action diversity, potentially hampering model performance on unseen actions. To address this issue, we propose a framework called First Cycle Annotated Repetitive Act... |
1607.03025 | Ahmed Douik | Ahmed Douik and Sameh Sorour | Data Dissemination using Instantly Decodable Binary Codes in Fog-Radio
Access Networks | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consider a device-to-device (D2D) fog-radio access network wherein a set of
devices are required to store a set of files. Each device is connected to a
subset of the cloud data centers and thus possesses a subset of the data. This
paper investigates the problem of disseminating all files among the devices
while reduc... | [
{
"created": "Mon, 11 Jul 2016 16:46:54 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Jan 2017 17:44:19 GMT",
"version": "v2"
},
{
"created": "Sun, 5 Feb 2017 04:42:12 GMT",
"version": "v3"
}
] | 2017-02-07 | [
[
"Douik",
"Ahmed",
""
],
[
"Sorour",
"Sameh",
""
]
] | Consider a device-to-device (D2D) fog-radio access network wherein a set of devices are required to store a set of files. Each device is connected to a subset of the cloud data centers and thus possesses a subset of the data. This paper investigates the problem of disseminating all files among the devices while reducin... |
2402.04161 | Ashok Vardhan Makkuva | Ashok Vardhan Makkuva, Marco Bondaschi, Adway Girish, Alliot Nagle,
Martin Jaggi, Hyeji Kim, Michael Gastpar | Attention with Markov: A Framework for Principled Analysis of
Transformers via Markov Chains | null | null | null | null | cs.LG cs.CL cs.IT math.IT stat.ML | http://creativecommons.org/licenses/by/4.0/ | In recent years, attention-based transformers have achieved tremendous
success across a variety of disciplines including natural languages. A key
ingredient behind their success is the generative pretraining procedure, during
which these models are trained on a large text corpus in an auto-regressive
manner. To shed ... | [
{
"created": "Tue, 6 Feb 2024 17:18:59 GMT",
"version": "v1"
}
] | 2024-02-07 | [
[
"Makkuva",
"Ashok Vardhan",
""
],
[
"Bondaschi",
"Marco",
""
],
[
"Girish",
"Adway",
""
],
[
"Nagle",
"Alliot",
""
],
[
"Jaggi",
"Martin",
""
],
[
"Kim",
"Hyeji",
""
],
[
"Gastpar",
"Michael",
""
]
] | In recent years, attention-based transformers have achieved tremendous success across a variety of disciplines including natural languages. A key ingredient behind their success is the generative pretraining procedure, during which these models are trained on a large text corpus in an auto-regressive manner. To shed li... |
2404.12739 | Yang Yang | Longfei Huang, Shupeng Zhong, Xiangyu Wu, Ruoxuan Li | The Solution for the CVPR2024 NICE Image Captioning Challenge | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This report introduces a solution to the Topic 1 Zero-shot Image Captioning
of 2024 NICE : New frontiers for zero-shot Image Captioning Evaluation. In
contrast to NICE 2023 datasets, this challenge involves new annotations by
humans with significant differences in caption style and content. Therefore, we
enhance imag... | [
{
"created": "Fri, 19 Apr 2024 09:32:16 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Apr 2024 12:36:39 GMT",
"version": "v2"
}
] | 2024-04-30 | [
[
"Huang",
"Longfei",
""
],
[
"Zhong",
"Shupeng",
""
],
[
"Wu",
"Xiangyu",
""
],
[
"Li",
"Ruoxuan",
""
]
] | This report introduces a solution to the Topic 1 Zero-shot Image Captioning of 2024 NICE : New frontiers for zero-shot Image Captioning Evaluation. In contrast to NICE 2023 datasets, this challenge involves new annotations by humans with significant differences in caption style and content. Therefore, we enhance image ... |
2406.08105 | Niall McGuire | Niall McGuire and Dr Yashar Moshfeghi | Prediction of the Realisation of an Information Need: An EEG Study | null | null | null | null | cs.IR cs.AI cs.HC | http://creativecommons.org/licenses/by/4.0/ | One of the foundational goals of Information Retrieval (IR) is to satisfy
searchers' Information Needs (IN). Understanding how INs physically manifest
has long been a complex and elusive process. However, recent studies utilising
Electroencephalography (EEG) data have provided real-time insights into the
neural proce... | [
{
"created": "Wed, 12 Jun 2024 11:34:19 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Jun 2024 08:53:56 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Jun 2024 09:13:04 GMT",
"version": "v3"
}
] | 2024-06-19 | [
[
"McGuire",
"Niall",
""
],
[
"Moshfeghi",
"Dr Yashar",
""
]
] | One of the foundational goals of Information Retrieval (IR) is to satisfy searchers' Information Needs (IN). Understanding how INs physically manifest has long been a complex and elusive process. However, recent studies utilising Electroencephalography (EEG) data have provided real-time insights into the neural process... |
2202.04509 | St\'ephane d'Ascoli | St\'ephane d'Ascoli, Maria Refinetti, Giulio Biroli | Optimal learning rate schedules in high-dimensional non-convex
optimization problems | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning rate schedules are ubiquitously used to speed up and improve
optimisation. Many different policies have been introduced on an empirical
basis, and theoretical analyses have been developed for convex settings.
However, in many realistic problems the loss-landscape is high-dimensional and
non convex -- a case ... | [
{
"created": "Wed, 9 Feb 2022 15:15:39 GMT",
"version": "v1"
}
] | 2022-02-10 | [
[
"d'Ascoli",
"Stéphane",
""
],
[
"Refinetti",
"Maria",
""
],
[
"Biroli",
"Giulio",
""
]
] | Learning rate schedules are ubiquitously used to speed up and improve optimisation. Many different policies have been introduced on an empirical basis, and theoretical analyses have been developed for convex settings. However, in many realistic problems the loss-landscape is high-dimensional and non convex -- a case fo... |
1901.10116 | EPTCS | Robert Furber (Aalborg University) | Categorical Equivalences from State-Effect Adjunctions | In Proceedings QPL 2018, arXiv:1901.09476 | EPTCS 287, 2019, pp. 107-126 | 10.4204/EPTCS.287.6 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | From every pair of adjoint functors it is possible to produce a (possibly
trivial) equivalence of categories by restricting to the subcategories where
the unit and counit are isomorphisms. If we do this for the adjunction between
effect algebras and abstract convex sets, we get the surprising result that the
equivale... | [
{
"created": "Tue, 29 Jan 2019 05:36:32 GMT",
"version": "v1"
}
] | 2019-01-30 | [
[
"Furber",
"Robert",
"",
"Aalborg University"
]
] | From every pair of adjoint functors it is possible to produce a (possibly trivial) equivalence of categories by restricting to the subcategories where the unit and counit are isomorphisms. If we do this for the adjunction between effect algebras and abstract convex sets, we get the surprising result that the equivalent... |
1212.3872 | EPTCS | Kim G. Larsen (Department of Computer Science, Aalborg University),
Radu Mardare (Department of Computer Science, Aalborg University), Claus
Thrane (Department of Computer Science, Aalborg University) | Parameterized Metatheory for Continuous Markovian Logic | In Proceedings QFM 2012, arXiv:1212.3454 | EPTCS 103, 2012, pp. 33-47 | 10.4204/EPTCS.103.4 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper shows that a classic metalogical framework, including all Boolean
operators, can be used to support the development of a metric behavioural
theory for Markov processes. Previously, only intuitionistic frameworks or
frameworks without negation and logical implication have been developed to
fulfill this task... | [
{
"created": "Mon, 17 Dec 2012 03:40:40 GMT",
"version": "v1"
}
] | 2012-12-18 | [
[
"Larsen",
"Kim G.",
"",
"Department of Computer Science, Aalborg University"
],
[
"Mardare",
"Radu",
"",
"Department of Computer Science, Aalborg University"
],
[
"Thrane",
"Claus",
"",
"Department of Computer Science, Aalborg University"
]
] | This paper shows that a classic metalogical framework, including all Boolean operators, can be used to support the development of a metric behavioural theory for Markov processes. Previously, only intuitionistic frameworks or frameworks without negation and logical implication have been developed to fulfill this task. ... |
cs/0105037 | Andreas Stolcke | G. Tur, D. Hakkani-Tur, A. Stolcke, E. Shriberg | Integrating Prosodic and Lexical Cues for Automatic Topic Segmentation | 27 pages, 8 figures | Computation Linguistics 27(1), 31-57, March 2001 | 10.1162/089120101300346796 | null | cs.CL | null | We present a probabilistic model that uses both prosodic and lexical cues for
the automatic segmentation of speech into topically coherent units. We propose
two methods for combining lexical and prosodic information using hidden Markov
models and decision trees. Lexical information is obtained from a speech
recognize... | [
{
"created": "Thu, 31 May 2001 18:08:57 GMT",
"version": "v1"
}
] | 2022-02-28 | [
[
"Tur",
"G.",
""
],
[
"Hakkani-Tur",
"D.",
""
],
[
"Stolcke",
"A.",
""
],
[
"Shriberg",
"E.",
""
]
] | We present a probabilistic model that uses both prosodic and lexical cues for the automatic segmentation of speech into topically coherent units. We propose two methods for combining lexical and prosodic information using hidden Markov models and decision trees. Lexical information is obtained from a speech recognizer,... |
2312.10127 | Artjom Joosen | Artjom Joosen, Ahmed Hassan, Martin Asenov, Rajkarn Singh, Luke
Darlow, Jianfeng Wang, Adam Barker | How Does It Function? Characterizing Long-term Trends in Production
Serverless Workloads | null | SoCC '23: Proceedings of the 2023 ACM Symposium on Cloud
Computing, October 2023, Pages 443-458 | 10.1145/3620678.3624783 | null | cs.PF cs.DC cs.LG | http://creativecommons.org/licenses/by/4.0/ | This paper releases and analyzes two new Huawei cloud serverless traces. The
traces span a period of over 7 months with over 1.4 trillion function
invocations combined. The first trace is derived from Huawei's internal
workloads and contains detailed per-second statistics for 200 functions running
across multiple Hua... | [
{
"created": "Fri, 15 Dec 2023 14:43:14 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Joosen",
"Artjom",
""
],
[
"Hassan",
"Ahmed",
""
],
[
"Asenov",
"Martin",
""
],
[
"Singh",
"Rajkarn",
""
],
[
"Darlow",
"Luke",
""
],
[
"Wang",
"Jianfeng",
""
],
[
"Barker",
"Adam",
""
]
] | This paper releases and analyzes two new Huawei cloud serverless traces. The traces span a period of over 7 months with over 1.4 trillion function invocations combined. The first trace is derived from Huawei's internal workloads and contains detailed per-second statistics for 200 functions running across multiple Huawe... |
2401.00924 | Shounak Chatterjee | Shounak Chatterjee | Free-form Shape Modeling in XR: A Systematic Review | null | null | null | null | cs.GR | http://creativecommons.org/licenses/by/4.0/ | Shape modeling research in Computer Graphics has been an active area for
decades. The ability to create and edit complex 3D shapes has been of key
importance in Computer-Aided Design, Animation, Architecture, and
Entertainment. With the growing popularity of Virtual and Augmented Reality,
new applications and tools h... | [
{
"created": "Mon, 1 Jan 2024 13:17:50 GMT",
"version": "v1"
}
] | 2024-01-03 | [
[
"Chatterjee",
"Shounak",
""
]
] | Shape modeling research in Computer Graphics has been an active area for decades. The ability to create and edit complex 3D shapes has been of key importance in Computer-Aided Design, Animation, Architecture, and Entertainment. With the growing popularity of Virtual and Augmented Reality, new applications and tools hav... |
2002.03751 | Yilan Li | Yilan Li, Senem Velipasalar | Weighted Average Precision: Adversarial Example Detection in the Visual
Perception of Autonomous Vehicles | null | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent works have shown that neural networks are vulnerable to carefully
crafted adversarial examples (AE). By adding small perturbations to input
images, AEs are able to make the victim model predicts incorrect outputs.
Several research work in adversarial machine learning started to focus on the
detection of AEs in... | [
{
"created": "Sat, 25 Jan 2020 23:59:34 GMT",
"version": "v1"
},
{
"created": "Mon, 4 May 2020 00:50:00 GMT",
"version": "v2"
}
] | 2020-05-05 | [
[
"Li",
"Yilan",
""
],
[
"Velipasalar",
"Senem",
""
]
] | Recent works have shown that neural networks are vulnerable to carefully crafted adversarial examples (AE). By adding small perturbations to input images, AEs are able to make the victim model predicts incorrect outputs. Several research work in adversarial machine learning started to focus on the detection of AEs in a... |
1204.0357 | Stefan Bauer | Stefan Bauer (1), Lutz-P. Nolte (1), Mauricio Reyes (1) ((1) Institute
for Surgical Technology and Biomechanics, University of Bern, Switzerland) | Skull-stripping for Tumor-bearing Brain Images | Swiss Society of Biomedical Engineering, Annual Meeting 2011, Bern,
Switzerland | null | null | null | cs.CV cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Skull-stripping separates the skull region of the head from the soft brain
tissues. In many cases of brain image analysis, this is an essential
preprocessing step in order to improve the final result. This is true for both
registration and segmentation tasks. In fact, skull-stripping of magnetic
resonance images (MRI... | [
{
"created": "Mon, 2 Apr 2012 09:48:12 GMT",
"version": "v1"
}
] | 2012-04-03 | [
[
"Bauer",
"Stefan",
""
],
[
"Nolte",
"Lutz-P.",
""
],
[
"Reyes",
"Mauricio",
""
]
] | Skull-stripping separates the skull region of the head from the soft brain tissues. In many cases of brain image analysis, this is an essential preprocessing step in order to improve the final result. This is true for both registration and segmentation tasks. In fact, skull-stripping of magnetic resonance images (MRI) ... |
2202.03497 | Wenzhong Yan | Wenzhong Yan and Ankur Mehta | A crawling robot driven by a folded self-sustained oscillator | 6 pages, 8 figures, has been accepted by RoboSoft 2022 | 2022 IEEE 5th International Conference on Soft Robotics (RoboSoft) | 10.1109/RoboSoft54090.2022.9762079 | null | cs.RO physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Locomotive robots that do not rely on electronics and/or electromagnetic
components will open up new perspectives and applications for robotics.
However, these robots usually involve complicated and tedious fabrication
processes, limiting their applications. Here, we develop an easy-to-fabricate
crawling robot by emb... | [
{
"created": "Mon, 7 Feb 2022 20:22:34 GMT",
"version": "v1"
},
{
"created": "Tue, 3 May 2022 01:04:47 GMT",
"version": "v2"
}
] | 2022-05-04 | [
[
"Yan",
"Wenzhong",
""
],
[
"Mehta",
"Ankur",
""
]
] | Locomotive robots that do not rely on electronics and/or electromagnetic components will open up new perspectives and applications for robotics. However, these robots usually involve complicated and tedious fabrication processes, limiting their applications. Here, we develop an easy-to-fabricate crawling robot by embed... |
1305.0534 | Robert Kleinberg | Robert Kleinberg and Yang Yuan | On the Ratio of Revenue to Welfare in Single-Parameter Mechanism Design | 15 pages | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | What fraction of the potential social surplus in an environment can be
extracted by a revenue-maximizing monopolist? We investigate this problem in
Bayesian single-parameter environments with independent private values. The
precise answer to the question obviously depends on the particulars of the
environment: the fe... | [
{
"created": "Thu, 2 May 2013 18:54:15 GMT",
"version": "v1"
}
] | 2013-05-03 | [
[
"Kleinberg",
"Robert",
""
],
[
"Yuan",
"Yang",
""
]
] | What fraction of the potential social surplus in an environment can be extracted by a revenue-maximizing monopolist? We investigate this problem in Bayesian single-parameter environments with independent private values. The precise answer to the question obviously depends on the particulars of the environment: the feas... |
2402.04522 | Ismet Dagli | Ismet Dagli, Amid Morshedlou, Jamal Rostami, Mehmet E. Belviranli | H-EYE: Holistic Resource Modeling and Management for Diversely Scaled
Edge-Cloud Systems | Major revision | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computing systems have been evolving to be more pervasive, heterogeneous, and
dynamic. An increasing number of emerging domains now rely on diverse edge to
cloud continuum where the execution of applications often spans various tiers
of systems with significantly heterogeneous computational capabilities.
Resources in... | [
{
"created": "Wed, 7 Feb 2024 02:04:30 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Jun 2024 18:30:47 GMT",
"version": "v2"
}
] | 2024-06-27 | [
[
"Dagli",
"Ismet",
""
],
[
"Morshedlou",
"Amid",
""
],
[
"Rostami",
"Jamal",
""
],
[
"Belviranli",
"Mehmet E.",
""
]
] | Computing systems have been evolving to be more pervasive, heterogeneous, and dynamic. An increasing number of emerging domains now rely on diverse edge to cloud continuum where the execution of applications often spans various tiers of systems with significantly heterogeneous computational capabilities. Resources in e... |
2010.04744 | Christopher Chu | Christopher Chu, Scot Fang and Kevin Knight | Learning to Pronounce Chinese Without a Pronunciation Dictionary | 7 pages. To appear in EMNLP 2020 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We demonstrate a program that learns to pronounce Chinese text in Mandarin,
without a pronunciation dictionary. From non-parallel streams of Chinese
characters and Chinese pinyin syllables, it establishes a many-to-many mapping
between characters and pronunciations. Using unsupervised methods, the program
effectively... | [
{
"created": "Fri, 9 Oct 2020 18:03:49 GMT",
"version": "v1"
}
] | 2020-10-13 | [
[
"Chu",
"Christopher",
""
],
[
"Fang",
"Scot",
""
],
[
"Knight",
"Kevin",
""
]
] | We demonstrate a program that learns to pronounce Chinese text in Mandarin, without a pronunciation dictionary. From non-parallel streams of Chinese characters and Chinese pinyin syllables, it establishes a many-to-many mapping between characters and pronunciations. Using unsupervised methods, the program effectively d... |
2303.13495 | Ziqi Huang | Ziqi Huang, Tianxing Wu, Yuming Jiang, Kelvin C.K. Chan, Ziwei Liu | ReVersion: Diffusion-Based Relation Inversion from Images | First two authors contributed equally. Project page:
https://ziqihuangg.github.io/projects/reversion.html Code:
https://github.com/ziqihuangg/ReVersion | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diffusion models gain increasing popularity for their generative
capabilities. Recently, there have been surging needs to generate customized
images by inverting diffusion models from exemplar images. However, existing
inversion methods mainly focus on capturing object appearances. How to invert
object relations, ano... | [
{
"created": "Thu, 23 Mar 2023 17:56:10 GMT",
"version": "v1"
}
] | 2023-03-24 | [
[
"Huang",
"Ziqi",
""
],
[
"Wu",
"Tianxing",
""
],
[
"Jiang",
"Yuming",
""
],
[
"Chan",
"Kelvin C. K.",
""
],
[
"Liu",
"Ziwei",
""
]
] | Diffusion models gain increasing popularity for their generative capabilities. Recently, there have been surging needs to generate customized images by inverting diffusion models from exemplar images. However, existing inversion methods mainly focus on capturing object appearances. How to invert object relations, anoth... |
1006.1497 | Frank Raiser | Frank Raiser and Thom Fr\"uhwirth | Analyzing Graph Transformation Systems through Constraint Handling Rules | 45 pages, 11 figures, to appear in Theory and Practice of Logic
Programming (TPLP) | null | null | null | cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph transformation systems (GTS) and constraint handling rules (CHR) are
non-deterministic rule-based state transition systems. CHR is well-known for
its powerful confluence and program equivalence analyses, for which we provide
the basis in this work to apply them to GTS. We give a sound and complete
embedding of ... | [
{
"created": "Tue, 8 Jun 2010 09:25:33 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Jun 2010 07:25:59 GMT",
"version": "v2"
}
] | 2010-06-16 | [
[
"Raiser",
"Frank",
""
],
[
"Frühwirth",
"Thom",
""
]
] | Graph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-based state transition systems. CHR is well-known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GT... |
2004.12193 | Chi Zhang | Wenhe Zhang, Chi Zhang, Yixin Zhu, Song-Chun Zhu | Machine Number Sense: A Dataset of Visual Arithmetic Problems for
Abstract and Relational Reasoning | AAAI 2020 Oral. Project page:
https://sites.google.com/view/number-sense/home Code:
https://github.com/zwh1999anne/Machine-Number-Sense-Dataset Dataset:
https://drive.google.com/file/d/17KuL8KOIDAeRL-lD418oiDEm8bE6TEFb/view | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a comprehensive indicator of mathematical thinking and intelligence, the
number sense (Dehaene 2011) bridges the induction of symbolic concepts and the
competence of problem-solving. To endow such a crucial cognitive ability to
machine intelligence, we propose a dataset, Machine Number Sense (MNS),
consisting of v... | [
{
"created": "Sat, 25 Apr 2020 17:14:58 GMT",
"version": "v1"
}
] | 2020-04-28 | [
[
"Zhang",
"Wenhe",
""
],
[
"Zhang",
"Chi",
""
],
[
"Zhu",
"Yixin",
""
],
[
"Zhu",
"Song-Chun",
""
]
] | As a comprehensive indicator of mathematical thinking and intelligence, the number sense (Dehaene 2011) bridges the induction of symbolic concepts and the competence of problem-solving. To endow such a crucial cognitive ability to machine intelligence, we propose a dataset, Machine Number Sense (MNS), consisting of vis... |
2306.02502 | Sangeetha Abdu Jyothi | Sangeetha Abdu Jyothi | Characterizing the Role of Power Grids in Internet Resilience | null | null | null | null | cs.NI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Among critical infrastructures, power grids and communication infrastructure
are identified as uniquely critical since they enable the operation of all
other sectors. Due to their vital role, the research community has undertaken
extensive efforts to understand the complex dynamics and resilience
characteristics of t... | [
{
"created": "Sun, 4 Jun 2023 23:00:38 GMT",
"version": "v1"
},
{
"created": "Wed, 16 Aug 2023 17:36:30 GMT",
"version": "v2"
}
] | 2023-08-17 | [
[
"Jyothi",
"Sangeetha Abdu",
""
]
] | Among critical infrastructures, power grids and communication infrastructure are identified as uniquely critical since they enable the operation of all other sectors. Due to their vital role, the research community has undertaken extensive efforts to understand the complex dynamics and resilience characteristics of the... |
2205.05357 | Xuenan Xu | Xuenan Xu, Zeyu Xie, Mengyue Wu, Kai Yu | Beyond the Status Quo: A Contemporary Survey of Advances and Challenges
in Audio Captioning | null | null | null | null | cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Automated audio captioning (AAC), a task that mimics human perception as well
as innovatively links audio processing and natural language processing, has
overseen much progress over the last few years. AAC requires recognizing
contents such as the environment, sound events and the temporal relationships
between sound... | [
{
"created": "Wed, 11 May 2022 09:09:15 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Nov 2023 00:04:01 GMT",
"version": "v2"
}
] | 2023-11-17 | [
[
"Xu",
"Xuenan",
""
],
[
"Xie",
"Zeyu",
""
],
[
"Wu",
"Mengyue",
""
],
[
"Yu",
"Kai",
""
]
] | Automated audio captioning (AAC), a task that mimics human perception as well as innovatively links audio processing and natural language processing, has overseen much progress over the last few years. AAC requires recognizing contents such as the environment, sound events and the temporal relationships between sound e... |
2211.05552 | Reinhard Heckel | Ilan Shomorony and Reinhard Heckel | Information-Theoretic Foundations of DNA Data Storage | Preprint of a monograph published in Foundations and Trends in
Communications and Information Theory | Foundations and Trends in Communications and Information Theory,
Vol. 19, No. 1, pp 1-106, 2022 | 10.1561/0100000117 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to its longevity and enormous information density, DNA is an attractive
medium for archival data storage. Thanks to rapid technological advances, DNA
storage is becoming practically feasible, as demonstrated by a number of
experimental storage systems, making it a promising solution for our society's
increasing n... | [
{
"created": "Thu, 10 Nov 2022 13:19:52 GMT",
"version": "v1"
}
] | 2022-11-11 | [
[
"Shomorony",
"Ilan",
""
],
[
"Heckel",
"Reinhard",
""
]
] | Due to its longevity and enormous information density, DNA is an attractive medium for archival data storage. Thanks to rapid technological advances, DNA storage is becoming practically feasible, as demonstrated by a number of experimental storage systems, making it a promising solution for our society's increasing nee... |
1305.1141 | Urmila Shrawankar Ms | Urmila Shrawankar, V M Thakare | Acoustic Echo Cancellation Postfilter Design Issues For Speech
Recognition System | Pages: 6 | International Journal of Science and Advanced Technology (IJSAT),
ISSN 2221-8386, Vol 1 No 5, July 2011, pp 38-43 | null | null | cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper a generalized postfilter algorithm design issues are presented.
This postfilter is used to jointly suppress late reverberation, residual echo,
and background noise. When residual echo and noise are suppressed, the best
result obtains by suppressing both interferences together after the Acoustic
echo can... | [
{
"created": "Mon, 6 May 2013 10:33:06 GMT",
"version": "v1"
}
] | 2013-05-07 | [
[
"Shrawankar",
"Urmila",
""
],
[
"Thakare",
"V M",
""
]
] | In this paper a generalized postfilter algorithm design issues are presented. This postfilter is used to jointly suppress late reverberation, residual echo, and background noise. When residual echo and noise are suppressed, the best result obtains by suppressing both interferences together after the Acoustic echo cance... |
1508.04234 | Amitabh Trehan | Armando Castaneda, Danny Dolev and Amitabh Trehan | Compact Routing Messages in Self-Healing Trees | Under Submission | null | null | null | cs.DC cs.DS cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and
Chechik [PODC 2013], often have no means to tolerate failures, once the system
has been setup and started. This paper presents, to our knowledge, the first
self-healing compact routing scheme. Besides, our schemes are developed for low
memory no... | [
{
"created": "Tue, 18 Aug 2015 07:47:55 GMT",
"version": "v1"
}
] | 2015-08-19 | [
[
"Castaneda",
"Armando",
""
],
[
"Dolev",
"Danny",
""
],
[
"Trehan",
"Amitabh",
""
]
] | Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact routing scheme. Besides, our schemes are developed for low memory node... |
1204.2903 | Thomas Bl\"asius | Thomas Bl\"asius and Ignaz Rutter | Disconnectivity and Relative Positions in Simultaneous Embeddings | 34 pages, 8 figures | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem Simultaneous Embedding with Fixed Edges (SEFE) asks for two
planar graph $G^1 = (V^1, E^1)$ and $G^2 = (V^2, E^2)$ sharing a common
subgraph $G = G^1 \cap G^2$ whether they admit planar drawings such that the
common graph is drawn the same in both. Previous results on this problem
require $G$, $G^1$ and $... | [
{
"created": "Fri, 13 Apr 2012 07:29:15 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jun 2015 08:35:18 GMT",
"version": "v2"
}
] | 2015-06-22 | [
[
"Bläsius",
"Thomas",
""
],
[
"Rutter",
"Ignaz",
""
]
] | The problem Simultaneous Embedding with Fixed Edges (SEFE) asks for two planar graph $G^1 = (V^1, E^1)$ and $G^2 = (V^2, E^2)$ sharing a common subgraph $G = G^1 \cap G^2$ whether they admit planar drawings such that the common graph is drawn the same in both. Previous results on this problem require $G$, $G^1$ and $G^... |
2305.13778 | Jianing Li | Jianing Li and Bowen Chen and Zhiyong Wang and Honghai Liu | Full Resolution Repetition Counting | 12 pages and 4 figures and 17 conferences | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Given an untrimmed video, repetitive actions counting aims to estimate the
number of repetitions of class-agnostic actions. To handle the various length
of videos and repetitive actions, also optimization challenges in end-to-end
video model training, down-sampling is commonly utilized in recent
state-of-the-art meth... | [
{
"created": "Tue, 23 May 2023 07:45:56 GMT",
"version": "v1"
},
{
"created": "Wed, 24 May 2023 10:52:44 GMT",
"version": "v2"
}
] | 2023-05-25 | [
[
"Li",
"Jianing",
""
],
[
"Chen",
"Bowen",
""
],
[
"Wang",
"Zhiyong",
""
],
[
"Liu",
"Honghai",
""
]
] | Given an untrimmed video, repetitive actions counting aims to estimate the number of repetitions of class-agnostic actions. To handle the various length of videos and repetitive actions, also optimization challenges in end-to-end video model training, down-sampling is commonly utilized in recent state-of-the-art method... |
1903.07424 | Yang Chen Mr | Yang Chen, Xiaoyan Sun, Yaochu Jin | Communication-Efficient Federated Deep Learning with Asynchronous Model
Update and Temporally Weighted Aggregation | null | IEEE Transactions on Neural Networks and Learning Systems, 2019 | 10.1109/TNNLS.2019.2953131 | null | cs.LG cs.AI cs.DC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning obtains a central model on the server by aggregating
models trained locally on clients. As a result, federated learning does not
require clients to upload their data to the server, thereby preserving the data
privacy of the clients. One challenge in federated learning is to reduce the
client-server... | [
{
"created": "Mon, 18 Mar 2019 13:27:42 GMT",
"version": "v1"
}
] | 2020-08-31 | [
[
"Chen",
"Yang",
""
],
[
"Sun",
"Xiaoyan",
""
],
[
"Jin",
"Yaochu",
""
]
] | Federated learning obtains a central model on the server by aggregating models trained locally on clients. As a result, federated learning does not require clients to upload their data to the server, thereby preserving the data privacy of the clients. One challenge in federated learning is to reduce the client-server c... |
2401.06331 | Banafshe Felfeliyan | Banafshe Felfeliyan and Yuyue Zhou and Shrimanti Ghosh and Jessica
Kupper and Shaobo Liu and Abhilash Hareendranathan and Jacob L. Jaremko | Application Of Vision-Language Models For Assessing Osteoarthritis
Disease Severity | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Osteoarthritis (OA) poses a global health challenge, demanding precise
diagnostic methods. Current radiographic assessments are time consuming and
prone to variability, prompting the need for automated solutions. The existing
deep learning models for OA assessment are unimodal single task systems and
they don't incor... | [
{
"created": "Fri, 12 Jan 2024 02:43:58 GMT",
"version": "v1"
}
] | 2024-01-15 | [
[
"Felfeliyan",
"Banafshe",
""
],
[
"Zhou",
"Yuyue",
""
],
[
"Ghosh",
"Shrimanti",
""
],
[
"Kupper",
"Jessica",
""
],
[
"Liu",
"Shaobo",
""
],
[
"Hareendranathan",
"Abhilash",
""
],
[
"Jaremko",
"Jacob L.",
"... | Osteoarthritis (OA) poses a global health challenge, demanding precise diagnostic methods. Current radiographic assessments are time consuming and prone to variability, prompting the need for automated solutions. The existing deep learning models for OA assessment are unimodal single task systems and they don't incorpo... |
1905.13678 | Aidan N. Gomez | Aidan N. Gomez, Ivan Zhang, Siddhartha Rao Kamalakara, Divyam Madaan,
Kevin Swersky, Yarin Gal, Geoffrey E. Hinton | Learning Sparse Networks Using Targeted Dropout | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural networks are easier to optimise when they have many more weights than
are required for modelling the mapping from inputs to outputs. This suggests a
two-stage learning procedure that first learns a large net and then prunes away
connections or hidden units. But standard training does not necessarily
encourage ... | [
{
"created": "Fri, 31 May 2019 15:40:36 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jun 2019 16:19:12 GMT",
"version": "v2"
},
{
"created": "Wed, 5 Jun 2019 09:19:52 GMT",
"version": "v3"
},
{
"created": "Tue, 3 Sep 2019 18:34:54 GMT",
"version": "v4"
},
{
"crea... | 2019-09-10 | [
[
"Gomez",
"Aidan N.",
""
],
[
"Zhang",
"Ivan",
""
],
[
"Kamalakara",
"Siddhartha Rao",
""
],
[
"Madaan",
"Divyam",
""
],
[
"Swersky",
"Kevin",
""
],
[
"Gal",
"Yarin",
""
],
[
"Hinton",
"Geoffrey E.",
""
]
... | Neural networks are easier to optimise when they have many more weights than are required for modelling the mapping from inputs to outputs. This suggests a two-stage learning procedure that first learns a large net and then prunes away connections or hidden units. But standard training does not necessarily encourage ne... |
1502.02991 | Gal Amram | Gal Amram, Lior Mizrahi and Gera Weiss | Simple Executions of Snapshot Implementations | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The well known snapshot primitive in concurrent programming allows for
n-asynchronous processes to write values to an array of single-writer registers
and, for each process, to take a snapshot of these registers. In this paper we
provide a formulation of the well known linearizability condition for snapshot
algorithm... | [
{
"created": "Tue, 10 Feb 2015 17:03:54 GMT",
"version": "v1"
}
] | 2015-02-11 | [
[
"Amram",
"Gal",
""
],
[
"Mizrahi",
"Lior",
""
],
[
"Weiss",
"Gera",
""
]
] | The well known snapshot primitive in concurrent programming allows for n-asynchronous processes to write values to an array of single-writer registers and, for each process, to take a snapshot of these registers. In this paper we provide a formulation of the well known linearizability condition for snapshot algorithms ... |
1812.04914 | Zhanwei Xu | Zhanwei Xu, Ziyi Wu, Jianjiang Feng | CFUN: Combining Faster R-CNN and U-net Network for Efficient Whole Heart
Segmentation | 12 pages, 6 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel heart segmentation pipeline Combining
Faster R-CNN and U-net Network (CFUN). Due to Faster R-CNN's precise
localization ability and U-net's powerful segmentation ability, CFUN needs only
one-step detection and segmentation inference to get the whole heart
segmentation result, obtaini... | [
{
"created": "Wed, 12 Dec 2018 12:22:22 GMT",
"version": "v1"
}
] | 2018-12-13 | [
[
"Xu",
"Zhanwei",
""
],
[
"Wu",
"Ziyi",
""
],
[
"Feng",
"Jianjiang",
""
]
] | In this paper, we propose a novel heart segmentation pipeline Combining Faster R-CNN and U-net Network (CFUN). Due to Faster R-CNN's precise localization ability and U-net's powerful segmentation ability, CFUN needs only one-step detection and segmentation inference to get the whole heart segmentation result, obtaining... |
2112.07163 | Hideaki Iiduka | Hideaki Iiduka | Minimization of Stochastic First-order Oracle Complexity of Adaptive
Methods for Nonconvex Optimization | null | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | Numerical evaluations have definitively shown that, for deep learning
optimizers such as stochastic gradient descent, momentum, and adaptive methods,
the number of steps needed to train a deep neural network halves for each
doubling of the batch size and that there is a region of diminishing returns
beyond the critic... | [
{
"created": "Tue, 14 Dec 2021 04:55:04 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Dec 2021 06:24:21 GMT",
"version": "v2"
}
] | 2021-12-17 | [
[
"Iiduka",
"Hideaki",
""
]
] | Numerical evaluations have definitively shown that, for deep learning optimizers such as stochastic gradient descent, momentum, and adaptive methods, the number of steps needed to train a deep neural network halves for each doubling of the batch size and that there is a region of diminishing returns beyond the critical... |
1505.00335 | Chengqing Li | Chengqing Li | Cracking a hierarchical chaotic image encryption algorithm based on
permutation | 8 pages | Signal Processing, 2016, 118: 203-210 | 10.1016/j.sigpro.2015.07.008 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In year 2000, an efficient hierarchical chaotic image encryption (HCIE)
algorithm was proposed, which divides a plain-image of size $M\times N$ with
$T$ possible value levels into $K$ blocks of the same size and then operates
position permutation on two levels: intra-block and inter-block. As a typical
position permu... | [
{
"created": "Sat, 2 May 2015 12:01:26 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Sep 2016 05:19:43 GMT",
"version": "v2"
}
] | 2016-09-27 | [
[
"Li",
"Chengqing",
""
]
] | In year 2000, an efficient hierarchical chaotic image encryption (HCIE) algorithm was proposed, which divides a plain-image of size $M\times N$ with $T$ possible value levels into $K$ blocks of the same size and then operates position permutation on two levels: intra-block and inter-block. As a typical position permuta... |
1908.08016 | Mantas Mazeika | Max Kaufmann, Daniel Kang, Yi Sun, Steven Basart, Xuwang Yin, Mantas
Mazeika, Akul Arora, Adam Dziedzic, Franziska Boenisch, Tom Brown, Jacob
Steinhardt, Dan Hendrycks | Testing Robustness Against Unforeseen Adversaries | Datasets available at
https://github.com/centerforaisafety/adversarial-corruptions | null | null | null | cs.LG cs.CR cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adversarial robustness research primarily focuses on L_p perturbations, and
most defenses are developed with identical training-time and test-time
adversaries. However, in real-world applications developers are unlikely to
have access to the full range of attacks or corruptions their system will face.
Furthermore, wo... | [
{
"created": "Wed, 21 Aug 2019 17:36:48 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Jun 2020 05:17:48 GMT",
"version": "v2"
},
{
"created": "Sun, 9 Jul 2023 19:07:51 GMT",
"version": "v3"
},
{
"created": "Mon, 30 Oct 2023 14:42:29 GMT",
"version": "v4"
}
] | 2023-10-31 | [
[
"Kaufmann",
"Max",
""
],
[
"Kang",
"Daniel",
""
],
[
"Sun",
"Yi",
""
],
[
"Basart",
"Steven",
""
],
[
"Yin",
"Xuwang",
""
],
[
"Mazeika",
"Mantas",
""
],
[
"Arora",
"Akul",
""
],
[
"Dziedzic",
"... | Adversarial robustness research primarily focuses on L_p perturbations, and most defenses are developed with identical training-time and test-time adversaries. However, in real-world applications developers are unlikely to have access to the full range of attacks or corruptions their system will face. Furthermore, wors... |
cs/0111047 | Rajkumar Buyya | Rajkumar Buyya, Kim Branson, Jon Giddy, and David Abramson | Virtual Laboratory: Enabling On-Demand Drug Design with the World Wide
Grid | null | null | null | null | cs.DC | null | Computational Grids are emerging as a popular paradigm for solving
large-scale compute and data intensive problems in science, engineering, and
commerce. However, application composition, resource management and scheduling
in these environments is a complex undertaking. In this paper, we illustrate
the creation of a ... | [
{
"created": "Sat, 17 Nov 2001 07:20:58 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Buyya",
"Rajkumar",
""
],
[
"Branson",
"Kim",
""
],
[
"Giddy",
"Jon",
""
],
[
"Abramson",
"David",
""
]
] | Computational Grids are emerging as a popular paradigm for solving large-scale compute and data intensive problems in science, engineering, and commerce. However, application composition, resource management and scheduling in these environments is a complex undertaking. In this paper, we illustrate the creation of a vi... |
2002.05814 | Zhuohan Li | Siyuan Zhuang, Zhuohan Li, Danyang Zhuo, Stephanie Wang, Eric Liang,
Robert Nishihara, Philipp Moritz, Ion Stoica | Hoplite: Efficient and Fault-Tolerant Collective Communication for
Task-Based Distributed Systems | SIGCOMM 2021 | null | null | null | cs.DC cs.LG cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Task-based distributed frameworks (e.g., Ray, Dask, Hydro) have become
increasingly popular for distributed applications that contain asynchronous and
dynamic workloads, including asynchronous gradient descent, reinforcement
learning, and model serving. As more data-intensive applications move to run on
top of task-b... | [
{
"created": "Thu, 13 Feb 2020 23:48:54 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Sep 2021 04:49:58 GMT",
"version": "v2"
}
] | 2021-09-29 | [
[
"Zhuang",
"Siyuan",
""
],
[
"Li",
"Zhuohan",
""
],
[
"Zhuo",
"Danyang",
""
],
[
"Wang",
"Stephanie",
""
],
[
"Liang",
"Eric",
""
],
[
"Nishihara",
"Robert",
""
],
[
"Moritz",
"Philipp",
""
],
[
"Sto... | Task-based distributed frameworks (e.g., Ray, Dask, Hydro) have become increasingly popular for distributed applications that contain asynchronous and dynamic workloads, including asynchronous gradient descent, reinforcement learning, and model serving. As more data-intensive applications move to run on top of task-bas... |
2402.09715 | Yu Liu | Yu Liu, Zibo Wang, Yifei Zhu, Chen Chen | DPBalance: Efficient and Fair Privacy Budget Scheduling for Federated
Learning as a Service | Accepted by IEEE International Conference on Computer Communications
(INFOCOM '24) | null | null | null | cs.DC cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning (FL) has emerged as a prevalent distributed machine
learning scheme that enables collaborative model training without aggregating
raw data. Cloud service providers further embrace Federated Learning as a
Service (FLaaS), allowing data analysts to execute their FL training pipelines
over differentia... | [
{
"created": "Thu, 15 Feb 2024 05:19:53 GMT",
"version": "v1"
}
] | 2024-02-16 | [
[
"Liu",
"Yu",
""
],
[
"Wang",
"Zibo",
""
],
[
"Zhu",
"Yifei",
""
],
[
"Chen",
"Chen",
""
]
] | Federated learning (FL) has emerged as a prevalent distributed machine learning scheme that enables collaborative model training without aggregating raw data. Cloud service providers further embrace Federated Learning as a Service (FLaaS), allowing data analysts to execute their FL training pipelines over differentiall... |
1806.06114 | Mark Bickford | Mark Bickford | Formalizing Category Theory and Presheaf Models of Type Theory in Nuprl | 20 pages | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article is the first in a series of articles that explain the
formalization of a constructive model of cubical type theory in Nuprl. In this
document we discuss only the parts of the formalization that do not depend on
the choice of base category. So, it spells out how we make the first steps of
our formalizatio... | [
{
"created": "Fri, 15 Jun 2018 20:16:46 GMT",
"version": "v1"
}
] | 2018-06-19 | [
[
"Bickford",
"Mark",
""
]
] | This article is the first in a series of articles that explain the formalization of a constructive model of cubical type theory in Nuprl. In this document we discuss only the parts of the formalization that do not depend on the choice of base category. So, it spells out how we make the first steps of our formalization ... |
2003.02014 | Zichao Zhang | Juichung Kuo, Manasi Muglikar, Zichao Zhang, Davide Scaramuzza | Redesigning SLAM for Arbitrary Multi-Camera Systems | null | IEEE Conference on Robotics and Automation (ICRA), Paris, 2020 | 10.1109/ICRA40945.2020.9197553 | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adding more cameras to SLAM systems improves robustness and accuracy but
complicates the design of the visual front-end significantly. Thus, most
systems in the literature are tailored for specific camera configurations. In
this work, we aim at an adaptive SLAM system that works for arbitrary
multi-camera setups. To ... | [
{
"created": "Wed, 4 Mar 2020 11:44:42 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Kuo",
"Juichung",
""
],
[
"Muglikar",
"Manasi",
""
],
[
"Zhang",
"Zichao",
""
],
[
"Scaramuzza",
"Davide",
""
]
] | Adding more cameras to SLAM systems improves robustness and accuracy but complicates the design of the visual front-end significantly. Thus, most systems in the literature are tailored for specific camera configurations. In this work, we aim at an adaptive SLAM system that works for arbitrary multi-camera setups. To th... |
2107.03021 | Fangneng Zhan | Fangneng Zhan, Yingchen Yu, Rongliang Wu, Jiahui Zhang, Kaiwen Cui,
Aoran Xiao, Shijian Lu, Chunyan Miao | Bi-level Feature Alignment for Versatile Image Translation and
Manipulation | Accepted to ECCV 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Generative adversarial networks (GANs) have achieved great success in image
translation and manipulation. However, high-fidelity image generation with
faithful style control remains a grand challenge in computer vision. This paper
presents a versatile image translation and manipulation framework that achieves
accurat... | [
{
"created": "Wed, 7 Jul 2021 05:26:29 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Jul 2022 22:29:00 GMT",
"version": "v2"
}
] | 2022-07-25 | [
[
"Zhan",
"Fangneng",
""
],
[
"Yu",
"Yingchen",
""
],
[
"Wu",
"Rongliang",
""
],
[
"Zhang",
"Jiahui",
""
],
[
"Cui",
"Kaiwen",
""
],
[
"Xiao",
"Aoran",
""
],
[
"Lu",
"Shijian",
""
],
[
"Miao",
"Ch... | Generative adversarial networks (GANs) have achieved great success in image translation and manipulation. However, high-fidelity image generation with faithful style control remains a grand challenge in computer vision. This paper presents a versatile image translation and manipulation framework that achieves accurate ... |
2405.06056 | Johannes Bl\"uhdorn | Johannes Bl\"uhdorn, Pedro Gomes, Max Aehle, Nicolas R. Gauger | Hybrid parallel discrete adjoints in SU2 | 28 pages, 9 figures, 2 listings; new layout, revised section
structure, polishing and small updates | null | null | null | cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The open-source multiphysics suite SU2 features discrete adjoints by means of
operator overloading automatic differentiation (AD). While both primal and
discrete adjoint solvers support MPI parallelism, hybrid parallelism using both
MPI and OpenMP has only been introduced for the primal solvers so far. In this
work, ... | [
{
"created": "Thu, 9 May 2024 19:00:48 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Aug 2024 22:21:57 GMT",
"version": "v2"
}
] | 2024-08-09 | [
[
"Blühdorn",
"Johannes",
""
],
[
"Gomes",
"Pedro",
""
],
[
"Aehle",
"Max",
""
],
[
"Gauger",
"Nicolas R.",
""
]
] | The open-source multiphysics suite SU2 features discrete adjoints by means of operator overloading automatic differentiation (AD). While both primal and discrete adjoint solvers support MPI parallelism, hybrid parallelism using both MPI and OpenMP has only been introduced for the primal solvers so far. In this work, we... |
2209.12742 | Aintzane Mosteiro-Sanchez | Aintzane Mosteiro-Sanchez, Marc Barcelo, Jasone Astorga, Aitor Urbieta | Too Many Options: A Survey of ABE Libraries for Developers | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Attribute-based encryption (ABE) comprises a set of one-to-many encryption
schemes that allow the encryption and decryption of data by associating it with
access policies and attributes. Therefore, it is an asymmetric encryption
scheme, and its computational requirements limit its deployment in IoT devices.
There are... | [
{
"created": "Mon, 26 Sep 2022 14:46:38 GMT",
"version": "v1"
}
] | 2022-09-27 | [
[
"Mosteiro-Sanchez",
"Aintzane",
""
],
[
"Barcelo",
"Marc",
""
],
[
"Astorga",
"Jasone",
""
],
[
"Urbieta",
"Aitor",
""
]
] | Attribute-based encryption (ABE) comprises a set of one-to-many encryption schemes that allow the encryption and decryption of data by associating it with access policies and attributes. Therefore, it is an asymmetric encryption scheme, and its computational requirements limit its deployment in IoT devices. There are d... |
2405.19802 | Shuyuan Liu | Shuyuan Liu, Jiawei Chen, Shouwei Ruan, Hang Su, Zhaoxia Yin | Exploring the Robustness of Decision-Level Through Adversarial Attacks
on LLM-Based Embodied Models | null | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Embodied intelligence empowers agents with a profound sense of perception,
enabling them to respond in a manner closely aligned with real-world
situations. Large Language Models (LLMs) delve into language instructions with
depth, serving a crucial role in generating plans for intricate tasks. Thus,
LLM-based embodied... | [
{
"created": "Thu, 30 May 2024 08:12:08 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jun 2024 12:55:12 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Jul 2024 14:43:51 GMT",
"version": "v3"
}
] | 2024-07-17 | [
[
"Liu",
"Shuyuan",
""
],
[
"Chen",
"Jiawei",
""
],
[
"Ruan",
"Shouwei",
""
],
[
"Su",
"Hang",
""
],
[
"Yin",
"Zhaoxia",
""
]
] | Embodied intelligence empowers agents with a profound sense of perception, enabling them to respond in a manner closely aligned with real-world situations. Large Language Models (LLMs) delve into language instructions with depth, serving a crucial role in generating plans for intricate tasks. Thus, LLM-based embodied m... |
2211.08180 | Ferdinando Zullo | Olga Polverino, Paolo Santonastaso, John Sheekey and Ferdinando Zullo | Divisible linear rank metric codes | null | null | null | null | cs.IT math.CO math.IT | http://creativecommons.org/licenses/by/4.0/ | A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally
embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the
property that the rank of any of its matrix is a multiple of $e$. It is quite
natural to ask whether or not all subspaces of matrices with such a property
arise from ... | [
{
"created": "Tue, 15 Nov 2022 14:42:09 GMT",
"version": "v1"
},
{
"created": "Wed, 16 Nov 2022 21:01:34 GMT",
"version": "v2"
}
] | 2022-11-18 | [
[
"Polverino",
"Olga",
""
],
[
"Santonastaso",
"Paolo",
""
],
[
"Sheekey",
"John",
""
],
[
"Zullo",
"Ferdinando",
""
]
] | A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the property that the rank of any of its matrix is a multiple of $e$. It is quite natural to ask whether or not all subspaces of matrices with such a property arise from a ... |
2003.03273 | Daniel Buschek | Florian Lehmann, Daniel Buschek | Heartbeats in the Wild: A Field Study Exploring ECG Biometrics in
Everyday Life | 14 pages, 10 figures, CHI'20 | null | 10.1145/3313831.3376536 | null | cs.HC eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper reports on an in-depth study of electrocardiogram (ECG) biometrics
in everyday life. We collected ECG data from 20 people over a week, using a
non-medical chest tracker. We evaluated user identification accuracy in several
scenarios and observed equal error rates of 9.15% to 21.91%, heavily depending
on 1)... | [
{
"created": "Fri, 6 Mar 2020 15:18:52 GMT",
"version": "v1"
}
] | 2020-03-09 | [
[
"Lehmann",
"Florian",
""
],
[
"Buschek",
"Daniel",
""
]
] | This paper reports on an in-depth study of electrocardiogram (ECG) biometrics in everyday life. We collected ECG data from 20 people over a week, using a non-medical chest tracker. We evaluated user identification accuracy in several scenarios and observed equal error rates of 9.15% to 21.91%, heavily depending on 1) t... |
2106.12645 | Zachary Eberhart | Zachary Eberhart, Aakash Bansal, Collin McMillan | A Wizard of Oz Study Simulating API Usage Dialogues with a Virtual
Assistant | null | null | 10.1109/TSE.2020.3040935 | null | cs.SE cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Virtual Assistant technology is rapidly proliferating to improve productivity
in a variety of tasks. While several virtual assistants for everyday tasks are
well-known (e.g., Siri, Cortana, Alexa), assistants for specialty tasks such as
software engineering are rarer. One key reason software engineering assistants
ar... | [
{
"created": "Wed, 23 Jun 2021 20:04:38 GMT",
"version": "v1"
}
] | 2021-06-25 | [
[
"Eberhart",
"Zachary",
""
],
[
"Bansal",
"Aakash",
""
],
[
"McMillan",
"Collin",
""
]
] | Virtual Assistant technology is rapidly proliferating to improve productivity in a variety of tasks. While several virtual assistants for everyday tasks are well-known (e.g., Siri, Cortana, Alexa), assistants for specialty tasks such as software engineering are rarer. One key reason software engineering assistants are ... |
2306.17492 | Feifan Song | Feifan Song, Bowen Yu, Minghao Li, Haiyang Yu, Fei Huang, Yongbin Li
and Houfeng Wang | Preference Ranking Optimization for Human Alignment | Accepted by AAAI 2024 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) often contain misleading content, emphasizing
the need to align them with human values to ensure secure AI systems.
Reinforcement learning from human feedback (RLHF) has been employed to achieve
this alignment. However, it encompasses two main drawbacks: (1) RLHF exhibits
complexity, inst... | [
{
"created": "Fri, 30 Jun 2023 09:07:37 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Feb 2024 18:42:42 GMT",
"version": "v2"
}
] | 2024-02-28 | [
[
"Song",
"Feifan",
""
],
[
"Yu",
"Bowen",
""
],
[
"Li",
"Minghao",
""
],
[
"Yu",
"Haiyang",
""
],
[
"Huang",
"Fei",
""
],
[
"Li",
"Yongbin",
""
],
[
"Wang",
"Houfeng",
""
]
] | Large language models (LLMs) often contain misleading content, emphasizing the need to align them with human values to ensure secure AI systems. Reinforcement learning from human feedback (RLHF) has been employed to achieve this alignment. However, it encompasses two main drawbacks: (1) RLHF exhibits complexity, instab... |
2302.08266 | Xiao Chen | Xiao Chen, Wenqi Fan, Jingfan Chen, Haochen Liu, Zitao Liu, Zhaoxiang
Zhang, Qing Li | Fairly Adaptive Negative Sampling for Recommendations | Accepted by TheWebConf2023 | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pairwise learning strategies are prevalent for optimizing recommendation
models on implicit feedback data, which usually learns user preference by
discriminating between positive (i.e., clicked by a user) and negative items
(i.e., obtained by negative sampling). However, the size of different item
groups (specified b... | [
{
"created": "Thu, 16 Feb 2023 12:44:47 GMT",
"version": "v1"
}
] | 2023-02-17 | [
[
"Chen",
"Xiao",
""
],
[
"Fan",
"Wenqi",
""
],
[
"Chen",
"Jingfan",
""
],
[
"Liu",
"Haochen",
""
],
[
"Liu",
"Zitao",
""
],
[
"Zhang",
"Zhaoxiang",
""
],
[
"Li",
"Qing",
""
]
] | Pairwise learning strategies are prevalent for optimizing recommendation models on implicit feedback data, which usually learns user preference by discriminating between positive (i.e., clicked by a user) and negative items (i.e., obtained by negative sampling). However, the size of different item groups (specified by ... |
1807.11034 | Wei Dong | Wei Dong, Qiuyuan Wang, Xin Wang, Hongbin Zha | PSDF Fusion: Probabilistic Signed Distance Function for On-the-fly 3D
Data Fusion and Scene Reconstruction | Accepted to ECCV 2018 | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel 3D spatial representation for data fusion and scene
reconstruction. Probabilistic Signed Distance Function (Probabilistic SDF,
PSDF) is proposed to depict uncertainties in the 3D space. It is modeled by a
joint distribution describing SDF value and its inlier probability, reflecting
input data qual... | [
{
"created": "Sun, 29 Jul 2018 10:10:12 GMT",
"version": "v1"
}
] | 2018-07-31 | [
[
"Dong",
"Wei",
""
],
[
"Wang",
"Qiuyuan",
""
],
[
"Wang",
"Xin",
""
],
[
"Zha",
"Hongbin",
""
]
] | We propose a novel 3D spatial representation for data fusion and scene reconstruction. Probabilistic Signed Distance Function (Probabilistic SDF, PSDF) is proposed to depict uncertainties in the 3D space. It is modeled by a joint distribution describing SDF value and its inlier probability, reflecting input data qualit... |
2404.06970 | Peipei Liu | Peipei Liu, Gaosheng Wang, Ying Tong, Jian Liang, Zhenquan Ding,
Hongsong Zhu | Hybrid Multi-stage Decoding for Few-shot NER with Entity-aware
Contrastive Learning | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Few-shot named entity recognition can identify new types of named entities
based on a few labeled examples. Previous methods employing token-level or
span-level metric learning suffer from the computational burden and a large
number of negative sample spans. In this paper, we propose the Hybrid
Multi-stage Decoding f... | [
{
"created": "Wed, 10 Apr 2024 12:31:09 GMT",
"version": "v1"
}
] | 2024-04-11 | [
[
"Liu",
"Peipei",
""
],
[
"Wang",
"Gaosheng",
""
],
[
"Tong",
"Ying",
""
],
[
"Liang",
"Jian",
""
],
[
"Ding",
"Zhenquan",
""
],
[
"Zhu",
"Hongsong",
""
]
] | Few-shot named entity recognition can identify new types of named entities based on a few labeled examples. Previous methods employing token-level or span-level metric learning suffer from the computational burden and a large number of negative sample spans. In this paper, we propose the Hybrid Multi-stage Decoding for... |
2303.04837 | Rebecca Dorn | Rebecca Dorn, Negar Mokhberian, Julie Jiang, Jeremy Abramson, Fred
Morstatter, Kristina Lerman | Non-Binary Gender Expression in Online Interactions | null | null | null | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | Many openly non-binary gender individuals participate in social networks.
However, the relationship between gender and online interactions is not well
understood, which may result in disparate treatment by large language models.
We investigate individual identity on Twitter, focusing on gender expression as
represent... | [
{
"created": "Wed, 8 Mar 2023 19:16:57 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Sep 2023 00:19:29 GMT",
"version": "v2"
}
] | 2023-09-14 | [
[
"Dorn",
"Rebecca",
""
],
[
"Mokhberian",
"Negar",
""
],
[
"Jiang",
"Julie",
""
],
[
"Abramson",
"Jeremy",
""
],
[
"Morstatter",
"Fred",
""
],
[
"Lerman",
"Kristina",
""
]
] | Many openly non-binary gender individuals participate in social networks. However, the relationship between gender and online interactions is not well understood, which may result in disparate treatment by large language models. We investigate individual identity on Twitter, focusing on gender expression as represented... |
1601.04980 | Lu\'is Cruz-Filipe | Lu\'is Cruz-Filipe, Isabel Nunes and Peter Schneider-Kamp | Integrity Constraints for General-Purpose Knowledge Bases | FoIKS 2016 | null | 10.1007/978-3-319-30024-5_13 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integrity constraints in databases have been studied extensively since the
1980s, and they are considered essential to guarantee database integrity. In
recent years, several authors have studied how the same notion can be adapted
to reasoning frameworks, in such a way that they achieve the purpose of
guaranteeing a s... | [
{
"created": "Tue, 19 Jan 2016 16:24:43 GMT",
"version": "v1"
}
] | 2017-08-09 | [
[
"Cruz-Filipe",
"Luís",
""
],
[
"Nunes",
"Isabel",
""
],
[
"Schneider-Kamp",
"Peter",
""
]
] | Integrity constraints in databases have been studied extensively since the 1980s, and they are considered essential to guarantee database integrity. In recent years, several authors have studied how the same notion can be adapted to reasoning frameworks, in such a way that they achieve the purpose of guaranteeing a sys... |
1802.01144 | Cewu Lu | Bo Pang, Kaiwen Zha, Cewu Lu | Human Action Adverb Recognition: ADHA Dataset and A Three-Stream Hybrid
Model | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the first benchmark for a new problem --- recognizing human
action adverbs (HAA): "Adverbs Describing Human Actions" (ADHA). This is the
first step for computer vision to change over from pattern recognition to real
AI. We demonstrate some key features of ADHA: a semantically complete set of
adverbs desc... | [
{
"created": "Sun, 4 Feb 2018 15:25:52 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Feb 2018 06:49:38 GMT",
"version": "v2"
}
] | 2018-02-13 | [
[
"Pang",
"Bo",
""
],
[
"Zha",
"Kaiwen",
""
],
[
"Lu",
"Cewu",
""
]
] | We introduce the first benchmark for a new problem --- recognizing human action adverbs (HAA): "Adverbs Describing Human Actions" (ADHA). This is the first step for computer vision to change over from pattern recognition to real AI. We demonstrate some key features of ADHA: a semantically complete set of adverbs descri... |
1703.00659 | Marco Carbone | Mario Bravetti and Marco Carbone and Gianluigi Zavattaro | On the Boundary between Decidability and Undecidability of Asynchronous
Session Subtyping | null | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Session types are behavioural types for guaranteeing that concurrent programs
are free from basic communication errors. Recent work has shown that
asynchronous session subtyping is undecidable. However, since session types
have become popular in mainstream programming languages in which asynchronous
communication is ... | [
{
"created": "Thu, 2 Mar 2017 08:14:33 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Feb 2018 09:41:17 GMT",
"version": "v2"
},
{
"created": "Mon, 12 Feb 2018 09:28:35 GMT",
"version": "v3"
}
] | 2018-02-13 | [
[
"Bravetti",
"Mario",
""
],
[
"Carbone",
"Marco",
""
],
[
"Zavattaro",
"Gianluigi",
""
]
] | Session types are behavioural types for guaranteeing that concurrent programs are free from basic communication errors. Recent work has shown that asynchronous session subtyping is undecidable. However, since session types have become popular in mainstream programming languages in which asynchronous communication is th... |
2302.05382 | Elizabeth Baker | Elizabeth Baker and Thomas Besnier and Stefan Sommer | A function space perspective on stochastic shape evolution | null | null | null | null | cs.CV math.PR | http://creativecommons.org/licenses/by/4.0/ | Modelling randomness in shape data, for example, the evolution of shapes of
organisms in biology, requires stochastic models of shapes. This paper presents
a new stochastic shape model based on a description of shapes as functions in a
Sobolev space. Using an explicit orthonormal basis as a reference frame for the
no... | [
{
"created": "Fri, 10 Feb 2023 17:10:32 GMT",
"version": "v1"
}
] | 2023-02-13 | [
[
"Baker",
"Elizabeth",
""
],
[
"Besnier",
"Thomas",
""
],
[
"Sommer",
"Stefan",
""
]
] | Modelling randomness in shape data, for example, the evolution of shapes of organisms in biology, requires stochastic models of shapes. This paper presents a new stochastic shape model based on a description of shapes as functions in a Sobolev space. Using an explicit orthonormal basis as a reference frame for the nois... |
2111.11894 | Benjamin Sznajder | Guy Feigenblat, Chulaka Gunasekara, Benjamin Sznajder, Sachindra
Joshi, David Konopnicki and Ranit Aharonov | TWEETSUMM -- A Dialog Summarization Dataset for Customer Service | null | Findings of the Association for Computational Linguistics: EMNLP
(2021) 245--260 | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In a typical customer service chat scenario, customers contact a support
center to ask for help or raise complaints, and human agents try to solve the
issues. In most cases, at the end of the conversation, agents are asked to
write a short summary emphasizing the problem and the proposed solution,
usually for the ben... | [
{
"created": "Tue, 23 Nov 2021 14:13:51 GMT",
"version": "v1"
}
] | 2021-11-24 | [
[
"Feigenblat",
"Guy",
""
],
[
"Gunasekara",
"Chulaka",
""
],
[
"Sznajder",
"Benjamin",
""
],
[
"Joshi",
"Sachindra",
""
],
[
"Konopnicki",
"David",
""
],
[
"Aharonov",
"Ranit",
""
]
] | In a typical customer service chat scenario, customers contact a support center to ask for help or raise complaints, and human agents try to solve the issues. In most cases, at the end of the conversation, agents are asked to write a short summary emphasizing the problem and the proposed solution, usually for the benef... |
1808.05908 | Siddhartha Brahma | Siddhartha Brahma | Improved Language Modeling by Decoding the Past | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Highly regularized LSTMs achieve impressive results on several benchmark
datasets in language modeling. We propose a new regularization method based on
decoding the last token in the context using the predicted distribution of the
next token. This biases the model towards retaining more contextual
information, in tur... | [
{
"created": "Tue, 14 Aug 2018 18:44:58 GMT",
"version": "v1"
},
{
"created": "Sat, 29 Sep 2018 16:29:06 GMT",
"version": "v2"
},
{
"created": "Thu, 3 Jan 2019 19:23:46 GMT",
"version": "v3"
},
{
"created": "Wed, 23 Jan 2019 19:52:46 GMT",
"version": "v4"
}
] | 2019-01-25 | [
[
"Brahma",
"Siddhartha",
""
]
] | Highly regularized LSTMs achieve impressive results on several benchmark datasets in language modeling. We propose a new regularization method based on decoding the last token in the context using the predicted distribution of the next token. This biases the model towards retaining more contextual information, in turn ... |
1907.00429 | He Fang | He Fang, Xianbin Wang, and Stefano Tomasin | Machine Learning for Intelligent Authentication in 5G-and-Beyond
Wireless Networks | null | null | null | null | cs.CR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The fifth generation (5G) and beyond wireless networks are critical to
support diverse vertical applications by connecting heterogeneous devices and
machines, which directly increase vulnerability for various spoofing attacks.
Conventional cryptographic and physical layer authentication techniques are
facing some cha... | [
{
"created": "Sun, 30 Jun 2019 18:36:26 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Jul 2019 00:25:21 GMT",
"version": "v2"
}
] | 2019-07-30 | [
[
"Fang",
"He",
""
],
[
"Wang",
"Xianbin",
""
],
[
"Tomasin",
"Stefano",
""
]
] | The fifth generation (5G) and beyond wireless networks are critical to support diverse vertical applications by connecting heterogeneous devices and machines, which directly increase vulnerability for various spoofing attacks. Conventional cryptographic and physical layer authentication techniques are facing some chall... |
2302.05565 | Jialing He | Jialing He, Jiamou Liu, Zijian Zhang, Yang Chen, Yiwei Liu, Bakh
Khoussainov, and Liehuang Zhu | MSDC: Exploiting Multi-State Power Consumption in Non-intrusive Load
Monitoring based on A Dual-CNN Model | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Non-intrusive load monitoring (NILM) aims to decompose aggregated electrical
usage signal into appliance-specific power consumption and it amounts to a
classical example of blind source separation tasks. Leveraging recent progress
on deep learning techniques, we design a new neural NILM model Multi-State Dual
CNN (MS... | [
{
"created": "Sat, 11 Feb 2023 01:56:54 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"He",
"Jialing",
""
],
[
"Liu",
"Jiamou",
""
],
[
"Zhang",
"Zijian",
""
],
[
"Chen",
"Yang",
""
],
[
"Liu",
"Yiwei",
""
],
[
"Khoussainov",
"Bakh",
""
],
[
"Zhu",
"Liehuang",
""
]
] | Non-intrusive load monitoring (NILM) aims to decompose aggregated electrical usage signal into appliance-specific power consumption and it amounts to a classical example of blind source separation tasks. Leveraging recent progress on deep learning techniques, we design a new neural NILM model Multi-State Dual CNN (MSDC... |
1210.6385 | Bino John | Guodong Liu, Zhihua Li, Yuefeng Lin, and Bino John | Automated family-based naming of small RNAs for next generation
sequencing data using a modified MD5-digest algorithm | 12 pages, 1 main table, 3 supplementary information tables | null | null | null | cs.CR q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We developed NameMyGene, a web tool and a stand alone program to easily
generate putative family-based names for small RNA sequences so that
laboratories can easily organize, analyze, and observe patterns from, the
massive amount of data generated by next-generation sequencers. NameMyGene,
also applicable to other em... | [
{
"created": "Tue, 23 Oct 2012 21:22:16 GMT",
"version": "v1"
}
] | 2012-10-25 | [
[
"Liu",
"Guodong",
""
],
[
"Li",
"Zhihua",
""
],
[
"Lin",
"Yuefeng",
""
],
[
"John",
"Bino",
""
]
] | We developed NameMyGene, a web tool and a stand alone program to easily generate putative family-based names for small RNA sequences so that laboratories can easily organize, analyze, and observe patterns from, the massive amount of data generated by next-generation sequencers. NameMyGene, also applicable to other emer... |
1710.10663 | Boris Bukh | Noga Alon, Boris Bukh, Yury Polyanskiy | List-decodable zero-rate codes | 20 pages, improved exposition | null | null | null | cs.IT math.CO math.IT | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We consider list-decoding in the zero-rate regime for two cases: the binary
alphabet and the spherical codes in Euclidean space. Specifically, we study the
maximal $\tau \in [0,1]$ for which there exists an arrangement of $M$ balls of
relative Hamming radius $\tau$ in the binary hypercube (of arbitrary dimension)
wit... | [
{
"created": "Sun, 29 Oct 2017 18:29:47 GMT",
"version": "v1"
},
{
"created": "Mon, 14 May 2018 16:18:43 GMT",
"version": "v2"
}
] | 2018-05-15 | [
[
"Alon",
"Noga",
""
],
[
"Bukh",
"Boris",
""
],
[
"Polyanskiy",
"Yury",
""
]
] | We consider list-decoding in the zero-rate regime for two cases: the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal $\tau \in [0,1]$ for which there exists an arrangement of $M$ balls of relative Hamming radius $\tau$ in the binary hypercube (of arbitrary dimension) with ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.