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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2008.11290 | Athar Sefid | Athar Sefid, Clyde Lee Giles, Prasenjit Mitra | Extractive Summarizer for Scholarly Articles | null | null | null | null | cs.CL cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce an extractive method that will summarize long scientific papers.
Our model uses presentation slides provided by the authors of the papers as the
gold summary standard to label the sentences. The sentences are ranked based on
their novelty and their importance as estimated by deep neural networks. Our
win... | [
{
"created": "Tue, 25 Aug 2020 22:08:34 GMT",
"version": "v1"
}
] | 2020-08-27 | [
[
"Sefid",
"Athar",
""
],
[
"Giles",
"Clyde Lee",
""
],
[
"Mitra",
"Prasenjit",
""
]
] | We introduce an extractive method that will summarize long scientific papers. Our model uses presentation slides provided by the authors of the papers as the gold summary standard to label the sentences. The sentences are ranked based on their novelty and their importance as estimated by deep neural networks. Our windo... |
1212.3928 | Harry Boyer | A. J. P. Lauret (PIMENT), T. A. Mara (PIMENT), H. Boyer (PIMENT), L.
Adelard (PIMENT), F. Garde (PIMENT) | A validation methodology aid for improving a thermal building model:
Case of diffuse radiation accounting in a tropical climate | null | Energy and Buildings 33, 7 (2001) 711-718 | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As part of our efforts to complete the software CODYRUN validation, we chose
as test building a block of flats constructed in Reunion Island, which has a
humid tropical climate. The sensitivity analysis allowed us to study the
effects of both diffuse and direct solar radiation on our model of this
building. With rega... | [
{
"created": "Mon, 17 Dec 2012 08:22:49 GMT",
"version": "v1"
}
] | 2012-12-26 | [
[
"Lauret",
"A. J. P.",
"",
"PIMENT"
],
[
"Mara",
"T. A.",
"",
"PIMENT"
],
[
"Boyer",
"H.",
"",
"PIMENT"
],
[
"Adelard",
"L.",
"",
"PIMENT"
],
[
"Garde",
"F.",
"",
"PIMENT"
]
] | As part of our efforts to complete the software CODYRUN validation, we chose as test building a block of flats constructed in Reunion Island, which has a humid tropical climate. The sensitivity analysis allowed us to study the effects of both diffuse and direct solar radiation on our model of this building. With regard... |
1307.7828 | Aaron Darling | Sudheer Vakati and David Fern\'andez-Baca | Characterizing Compatibility and Agreement of Unrooted Trees via Cuts in
Graphs | Peer-reviewed and presented as part of the 13th Workshop on
Algorithms in Bioinformatics (WABI2013) | null | null | null | cs.DM cs.CE q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deciding whether there is a single tree -a supertree- that summarizes the
evolutionary information in a collection of unrooted trees is a fundamental
problem in phylogenetics. We consider two versions of this question: agreement
and compatibility. In the first, the supertree is required to reflect precisely
the relat... | [
{
"created": "Tue, 30 Jul 2013 05:42:36 GMT",
"version": "v1"
}
] | 2013-08-02 | [
[
"Vakati",
"Sudheer",
""
],
[
"Fernández-Baca",
"David",
""
]
] | Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and compatibility. In the first, the supertree is required to reflect precisely the relatio... |
1311.1602 | Jianwen Li | Jianwen Li, Geguang Pu, Lijun Zhang, Yinbo Yao, Moshe Y. Vardi, Jifeng
he | Polsat: A Portfolio LTL Satisfiability Solver | 11 pages, 1 table, 2 figures | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a portfolio LTL-satisfiability solver, called
Polsat. To achieve fast satisfiability checking for LTL formulas, the tool
integrates four representative LTL solvers: pltl, TRP++, NuSMV, and Aalta. The
idea of Polsat is to run the component solvers in parallel to get best overall
performance; o... | [
{
"created": "Thu, 7 Nov 2013 08:31:05 GMT",
"version": "v1"
}
] | 2013-11-08 | [
[
"Li",
"Jianwen",
""
],
[
"Pu",
"Geguang",
""
],
[
"Zhang",
"Lijun",
""
],
[
"Yao",
"Yinbo",
""
],
[
"Vardi",
"Moshe Y.",
""
],
[
"he",
"Jifeng",
""
]
] | In this paper we present a portfolio LTL-satisfiability solver, called Polsat. To achieve fast satisfiability checking for LTL formulas, the tool integrates four representative LTL solvers: pltl, TRP++, NuSMV, and Aalta. The idea of Polsat is to run the component solvers in parallel to get best overall performance; onc... |
1207.4680 | Fabian Schuh | Fabian Schuh, Andreas Schenk, and Johannes B. Huber | Reduced Complexity Super-Trellis Decoding for Convolutionally Encoded
Transmission Over ISI-Channels | 6 pages, 8 figures, accepted for ICNC'13. (see also: arXiv:1205.7031) | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In this paper we propose a matched encoding (ME) scheme for convolutionally
encoded transmission over intersymbol interference (usually called ISI)
channels. A novel trellis description enables to perform equalization and
decoding jointly, i.e., enables efficient super-trellis decoding. By means of
this matched non-l... | [
{
"created": "Thu, 19 Jul 2012 14:19:02 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Aug 2012 10:01:05 GMT",
"version": "v2"
},
{
"created": "Thu, 4 Oct 2012 06:22:48 GMT",
"version": "v3"
}
] | 2012-10-05 | [
[
"Schuh",
"Fabian",
""
],
[
"Schenk",
"Andreas",
""
],
[
"Huber",
"Johannes B.",
""
]
] | In this paper we propose a matched encoding (ME) scheme for convolutionally encoded transmission over intersymbol interference (usually called ISI) channels. A novel trellis description enables to perform equalization and decoding jointly, i.e., enables efficient super-trellis decoding. By means of this matched non-lin... |
2406.11599 | Wonho Song | Wonho Song, Minho Oh, Jaeyoung Lee, and Hyun Myung | Galibr: Targetless LiDAR-Camera Extrinsic Calibration Method via Ground
Plane Initialization | Accepted by IV 2024 Workshop | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the rapid development of autonomous driving and SLAM technology, the
performance of autonomous systems using multimodal sensors highly relies on
accurate extrinsic calibration. Addressing the need for a convenient,
maintenance-friendly calibration process in any natural environment, this paper
introduces Galibr,... | [
{
"created": "Fri, 14 Jun 2024 08:25:10 GMT",
"version": "v1"
}
] | 2024-06-18 | [
[
"Song",
"Wonho",
""
],
[
"Oh",
"Minho",
""
],
[
"Lee",
"Jaeyoung",
""
],
[
"Myung",
"Hyun",
""
]
] | With the rapid development of autonomous driving and SLAM technology, the performance of autonomous systems using multimodal sensors highly relies on accurate extrinsic calibration. Addressing the need for a convenient, maintenance-friendly calibration process in any natural environment, this paper introduces Galibr, a... |
2010.10012 | Adish Singla | Farnam Mansouri, Yuxin Chen, Ara Vartanian, Xiaojin Zhu, Adish Singla | Preference-Based Batch and Sequential Teaching | arXiv admin note: substantial text overlap with arXiv:1910.10944 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Algorithmic machine teaching studies the interaction between a teacher and a
learner where the teacher selects labeled examples aiming at teaching a target
hypothesis. In a quest to lower teaching complexity, several teaching models
and complexity measures have been proposed for both the batch settings (e.g.,
worst-c... | [
{
"created": "Sat, 17 Oct 2020 14:39:47 GMT",
"version": "v1"
}
] | 2020-10-21 | [
[
"Mansouri",
"Farnam",
""
],
[
"Chen",
"Yuxin",
""
],
[
"Vartanian",
"Ara",
""
],
[
"Zhu",
"Xiaojin",
""
],
[
"Singla",
"Adish",
""
]
] | Algorithmic machine teaching studies the interaction between a teacher and a learner where the teacher selects labeled examples aiming at teaching a target hypothesis. In a quest to lower teaching complexity, several teaching models and complexity measures have been proposed for both the batch settings (e.g., worst-cas... |
2007.13159 | Yash Goyal | Aayush Surana, Yash Goyal, Manish Shrivastava, Suvi Saarikallio, Vinoo
Alluri | Tag2Risk: Harnessing Social Music Tags for Characterizing Depression
Risk | Appearing in the proceedings of ISMIR 2020. Aayush Surana and Yash
Goyal contributed equally | null | null | null | cs.IR cs.MM cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Musical preferences have been considered a mirror of the self. In this age of
Big Data, online music streaming services allow us to capture ecologically
valid music listening behavior and provide a rich source of information to
identify several user-specific aspects. Studies have shown musical engagement
to be an ind... | [
{
"created": "Sun, 26 Jul 2020 16:02:10 GMT",
"version": "v1"
}
] | 2020-07-28 | [
[
"Surana",
"Aayush",
""
],
[
"Goyal",
"Yash",
""
],
[
"Shrivastava",
"Manish",
""
],
[
"Saarikallio",
"Suvi",
""
],
[
"Alluri",
"Vinoo",
""
]
] | Musical preferences have been considered a mirror of the self. In this age of Big Data, online music streaming services allow us to capture ecologically valid music listening behavior and provide a rich source of information to identify several user-specific aspects. Studies have shown musical engagement to be an indir... |
1701.04128 | Wenjie Luo | Wenjie Luo and Yujia Li and Raquel Urtasun and Richard Zemel | Understanding the Effective Receptive Field in Deep Convolutional Neural
Networks | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study characteristics of receptive fields of units in deep convolutional
networks. The receptive field size is a crucial issue in many visual tasks, as
the output must respond to large enough areas in the image to capture
information about large objects. We introduce the notion of an effective
receptive field, and... | [
{
"created": "Sun, 15 Jan 2017 23:52:49 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Jan 2017 06:32:29 GMT",
"version": "v2"
}
] | 2017-01-26 | [
[
"Luo",
"Wenjie",
""
],
[
"Li",
"Yujia",
""
],
[
"Urtasun",
"Raquel",
""
],
[
"Zemel",
"Richard",
""
]
] | We study characteristics of receptive fields of units in deep convolutional networks. The receptive field size is a crucial issue in many visual tasks, as the output must respond to large enough areas in the image to capture information about large objects. We introduce the notion of an effective receptive field, and s... |
2201.08461 | Ioannis Agadakos | Ioannis Agadakos, Manuel Egele, and William Robertson | Polytope: Practical Memory Access Control for C++ Applications | null | null | null | null | cs.CR cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Designing and implementing secure software is inarguably more important than
ever. However, despite years of research into privilege separating programs, it
remains difficult to actually do so and such efforts can take years of
labor-intensive engineering to reach fruition. At the same time, new
intra-process isolati... | [
{
"created": "Thu, 20 Jan 2022 21:40:56 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jan 2022 16:49:51 GMT",
"version": "v2"
}
] | 2022-01-25 | [
[
"Agadakos",
"Ioannis",
""
],
[
"Egele",
"Manuel",
""
],
[
"Robertson",
"William",
""
]
] | Designing and implementing secure software is inarguably more important than ever. However, despite years of research into privilege separating programs, it remains difficult to actually do so and such efforts can take years of labor-intensive engineering to reach fruition. At the same time, new intra-process isolation... |
1804.06215 | Zeming Li | Zeming Li, Chao Peng, Gang Yu, Xiangyu Zhang, Yangdong Deng, Jian Sun | DetNet: A Backbone network for Object Detection | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent CNN based object detectors, no matter one-stage methods like YOLO,
SSD, and RetinaNe or two-stage detectors like Faster R-CNN, R-FCN and FPN are
usually trying to directly finetune from ImageNet pre-trained models designed
for image classification. There has been little work discussing on the backbone
feature ... | [
{
"created": "Tue, 17 Apr 2018 13:09:13 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Apr 2018 06:36:36 GMT",
"version": "v2"
}
] | 2018-04-20 | [
[
"Li",
"Zeming",
""
],
[
"Peng",
"Chao",
""
],
[
"Yu",
"Gang",
""
],
[
"Zhang",
"Xiangyu",
""
],
[
"Deng",
"Yangdong",
""
],
[
"Sun",
"Jian",
""
]
] | Recent CNN based object detectors, no matter one-stage methods like YOLO, SSD, and RetinaNe or two-stage detectors like Faster R-CNN, R-FCN and FPN are usually trying to directly finetune from ImageNet pre-trained models designed for image classification. There has been little work discussing on the backbone feature ex... |
2201.01227 | Farshad Noravesh | Farshad Noravesh | Sparse Non-Convex Optimization For Higher Moment Portfolio Management | null | null | null | null | cs.CE q-fin.PM | http://creativecommons.org/licenses/by/4.0/ | One of the reasons that higher order moment portfolio optimization methods
are not fully used by practitioners in investment decisions is the complexity
that these higher moments create by making the optimization problem nonconvex.
Many few methods and theoretical results exists in the literature, but the
present pap... | [
{
"created": "Tue, 4 Jan 2022 16:14:23 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Jan 2022 13:29:47 GMT",
"version": "v2"
}
] | 2022-01-07 | [
[
"Noravesh",
"Farshad",
""
]
] | One of the reasons that higher order moment portfolio optimization methods are not fully used by practitioners in investment decisions is the complexity that these higher moments create by making the optimization problem nonconvex. Many few methods and theoretical results exists in the literature, but the present paper... |
2211.10086 | Kaspar Beelen | Kaspar Beelen and Daniel van Strien | Metadata Might Make Language Models Better | null | null | null | null | cs.CL cs.DL | http://creativecommons.org/licenses/by/4.0/ | This paper discusses the benefits of including metadata when training
language models on historical collections. Using 19th-century newspapers as a
case study, we extend the time-masking approach proposed by Rosin et al., 2022
and compare different strategies for inserting temporal, political and
geographical informa... | [
{
"created": "Fri, 18 Nov 2022 08:29:00 GMT",
"version": "v1"
}
] | 2022-11-21 | [
[
"Beelen",
"Kaspar",
""
],
[
"van Strien",
"Daniel",
""
]
] | This paper discusses the benefits of including metadata when training language models on historical collections. Using 19th-century newspapers as a case study, we extend the time-masking approach proposed by Rosin et al., 2022 and compare different strategies for inserting temporal, political and geographical informati... |
1901.09641 | Dario Lodi Rizzini | Luca Consolini, Mattia Laurini, Marco Locatelli, Dario Lodi Rizzini | A Second-Order Lower Bound for Globally Optimal 2D Registration | 40 pages, 13 figures, 2 tables | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of planar registration consists in finding the transformation
that better aligns two point sets. In our setting, the search domain is the set
of planar rigid transformations and the objective function is the sum of the
distances between each point of the transformed source set and the destination
set. We ... | [
{
"created": "Mon, 28 Jan 2019 13:43:24 GMT",
"version": "v1"
},
{
"created": "Thu, 21 May 2020 14:31:04 GMT",
"version": "v2"
}
] | 2020-05-22 | [
[
"Consolini",
"Luca",
""
],
[
"Laurini",
"Mattia",
""
],
[
"Locatelli",
"Marco",
""
],
[
"Rizzini",
"Dario Lodi",
""
]
] | The problem of planar registration consists in finding the transformation that better aligns two point sets. In our setting, the search domain is the set of planar rigid transformations and the objective function is the sum of the distances between each point of the transformed source set and the destination set. We co... |
1709.04991 | Adrian Sampson | Alex Renda, Harrison Goldstein, Sarah Bird, Chris Quirk and Adrian
Sampson | Abstractions for AI-Based User Interfaces and Systems | null | null | null | null | cs.PL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Novel user interfaces based on artificial intelligence, such as
natural-language agents, present new categories of engineering challenges.
These systems need to cope with uncertainty and ambiguity, interface with
machine learning algorithms, and compose information from multiple users to
make decisions. We propose to... | [
{
"created": "Thu, 14 Sep 2017 21:53:01 GMT",
"version": "v1"
}
] | 2017-09-18 | [
[
"Renda",
"Alex",
""
],
[
"Goldstein",
"Harrison",
""
],
[
"Bird",
"Sarah",
""
],
[
"Quirk",
"Chris",
""
],
[
"Sampson",
"Adrian",
""
]
] | Novel user interfaces based on artificial intelligence, such as natural-language agents, present new categories of engineering challenges. These systems need to cope with uncertainty and ambiguity, interface with machine learning algorithms, and compose information from multiple users to make decisions. We propose to t... |
1905.04107 | Estefania Talavera | Estefania Talavera, Petia Radeva, Nicolai Petkov | Towards Emotion Retrieval in Egocentric PhotoStream | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The availability and use of egocentric data are rapidly increasing due to the
growing use of wearable cameras. Our aim is to study the effect (positive,
neutral or negative) of egocentric images or events on an observer. Given
egocentric photostreams capturing the wearer's days, we propose a method that
aims to assig... | [
{
"created": "Fri, 10 May 2019 12:24:00 GMT",
"version": "v1"
}
] | 2019-05-13 | [
[
"Talavera",
"Estefania",
""
],
[
"Radeva",
"Petia",
""
],
[
"Petkov",
"Nicolai",
""
]
] | The availability and use of egocentric data are rapidly increasing due to the growing use of wearable cameras. Our aim is to study the effect (positive, neutral or negative) of egocentric images or events on an observer. Given egocentric photostreams capturing the wearer's days, we propose a method that aims to assign ... |
1607.06123 | Gaurav Singh | Sandra Mitrovi\'c and Gaurav Singh | Predicting Branch Visits and Credit Card Up-selling using Temporal
Banking Data | 4 pages | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is an abundance of temporal and non-temporal data in banking (and other
industries), but such temporal activity data can not be used directly with
classical machine learning models. In this work, we perform extensive feature
extraction from the temporal user activity data in an attempt to predict user
visits to... | [
{
"created": "Wed, 20 Jul 2016 20:55:14 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Sep 2016 21:15:06 GMT",
"version": "v2"
}
] | 2016-09-09 | [
[
"Mitrović",
"Sandra",
""
],
[
"Singh",
"Gaurav",
""
]
] | There is an abundance of temporal and non-temporal data in banking (and other industries), but such temporal activity data can not be used directly with classical machine learning models. In this work, we perform extensive feature extraction from the temporal user activity data in an attempt to predict user visits to d... |
2004.00750 | Matt Gibson-Lopez | Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, Sean Soderman, and Qing
Wang | Terrain Visibility Graphs: Persistence is Not Enough | To appear in SoCG 2020 | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the Visibility Graph Recognition and
Reconstruction problems in the context of terrains. Here, we are given a graph
$G$ with labeled vertices $v_0, v_1, \ldots, v_{n-1}$ such that the labeling
corresponds with a Hamiltonian path $H$. $G$ also may contain other edges. We
are interested in de... | [
{
"created": "Thu, 2 Apr 2020 00:16:13 GMT",
"version": "v1"
}
] | 2020-04-03 | [
[
"Ameer",
"Safwa",
""
],
[
"Gibson-Lopez",
"Matt",
""
],
[
"Krohn",
"Erik",
""
],
[
"Soderman",
"Sean",
""
],
[
"Wang",
"Qing",
""
]
] | In this paper, we consider the Visibility Graph Recognition and Reconstruction problems in the context of terrains. Here, we are given a graph $G$ with labeled vertices $v_0, v_1, \ldots, v_{n-1}$ such that the labeling corresponds with a Hamiltonian path $H$. $G$ also may contain other edges. We are interested in dete... |
2007.05924 | Vivek Kumar Singh Ph.D. | Mousumi Karmakar, Sumit Kumar Banshal, Vivek Kumar Singh | Does presence of social media plugins in a journal website result in
higher social media attention of its research publications | in press | Scientometrics, 2020 | 10.1007/s11192-020-03574-7 | null | cs.DL cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social media platforms have now emerged as an important medium for wider
dissemination of research articles; with authors, readers and publishers
creating different kinds of social media activity about the article. Some
research studies have even shown that articles that get more social media
attention may get higher... | [
{
"created": "Sun, 12 Jul 2020 06:35:26 GMT",
"version": "v1"
}
] | 2020-07-14 | [
[
"Karmakar",
"Mousumi",
""
],
[
"Banshal",
"Sumit Kumar",
""
],
[
"Singh",
"Vivek Kumar",
""
]
] | Social media platforms have now emerged as an important medium for wider dissemination of research articles; with authors, readers and publishers creating different kinds of social media activity about the article. Some research studies have even shown that articles that get more social media attention may get higher v... |
1701.06049 | James MacGlashan | James MacGlashan, Mark K Ho, Robert Loftin, Bei Peng, Guan Wang, David
Roberts, Matthew E. Taylor, Michael L. Littman | Interactive Learning from Policy-Dependent Human Feedback | 8 pages + references, 5 figures | International Conference on Machine Learning. PMLR, 2017 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates the problem of interactively learning behaviors
communicated by a human teacher using positive and negative feedback. Much
previous work on this problem has made the assumption that people provide
feedback for decisions that is dependent on the behavior they are teaching and
is independent fro... | [
{
"created": "Sat, 21 Jan 2017 16:37:41 GMT",
"version": "v1"
},
{
"created": "Sat, 28 Jan 2023 17:02:34 GMT",
"version": "v2"
}
] | 2023-01-31 | [
[
"MacGlashan",
"James",
""
],
[
"Ho",
"Mark K",
""
],
[
"Loftin",
"Robert",
""
],
[
"Peng",
"Bei",
""
],
[
"Wang",
"Guan",
""
],
[
"Roberts",
"David",
""
],
[
"Taylor",
"Matthew E.",
""
],
[
"Littman... | This paper investigates the problem of interactively learning behaviors communicated by a human teacher using positive and negative feedback. Much previous work on this problem has made the assumption that people provide feedback for decisions that is dependent on the behavior they are teaching and is independent from ... |
2002.10751 | Manh-Dung Nguyen | Manh-Dung Nguyen, S\'ebastien Bardin, Richard Bonichon, Roland Groz,
Matthieu Lemerre | Binary-level Directed Fuzzing for Use-After-Free Vulnerabilities | The long version of paper appeared in the 23rd International
Symposium on Research in Attacks, Intrusions and Defenses (RAID 2020) | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Directed fuzzing focuses on automatically testing specific parts of the code
by taking advantage of additional information such as (partial) bug stack
trace, patches or risky operations. Key applications include bug reproduction,
patch testing and static analysis report verification. Although directed
fuzzing has rec... | [
{
"created": "Tue, 25 Feb 2020 09:09:54 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Aug 2020 08:33:50 GMT",
"version": "v2"
}
] | 2020-08-18 | [
[
"Nguyen",
"Manh-Dung",
""
],
[
"Bardin",
"Sébastien",
""
],
[
"Bonichon",
"Richard",
""
],
[
"Groz",
"Roland",
""
],
[
"Lemerre",
"Matthieu",
""
]
] | Directed fuzzing focuses on automatically testing specific parts of the code by taking advantage of additional information such as (partial) bug stack trace, patches or risky operations. Key applications include bug reproduction, patch testing and static analysis report verification. Although directed fuzzing has recei... |
2403.07312 | Wenhui Tan | Wenhui Tan, Bei Liu, Junbo Zhang, Ruihua Song, Jianlong Fu | Multi-task Manipulation Policy Modeling with Visuomotor Latent Diffusion | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modeling a generalized visuomotor policy has been a longstanding challenge
for both computer vision and robotics communities. Existing approaches often
fail to efficiently leverage cross-dataset resources or rely on heavy
Vision-Language models, which require substantial computational resources,
thereby limiting thei... | [
{
"created": "Tue, 12 Mar 2024 04:49:59 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Apr 2024 07:03:52 GMT",
"version": "v2"
}
] | 2024-04-02 | [
[
"Tan",
"Wenhui",
""
],
[
"Liu",
"Bei",
""
],
[
"Zhang",
"Junbo",
""
],
[
"Song",
"Ruihua",
""
],
[
"Fu",
"Jianlong",
""
]
] | Modeling a generalized visuomotor policy has been a longstanding challenge for both computer vision and robotics communities. Existing approaches often fail to efficiently leverage cross-dataset resources or rely on heavy Vision-Language models, which require substantial computational resources, thereby limiting their ... |
1208.0515 | Simone Martini | Ugo Dal Lago (Universit\`a di Bologna - Dipartimento di Scienze
dell'Informazione), Simone Martini (Universit\`a di Bologna - Dipartimento di
Scienze dell'Informazione) | On Constructor Rewrite Systems and the Lambda Calculus | 27 pages. arXiv admin note: substantial text overlap with
arXiv:0904.4120 | Logical Methods in Computer Science, Volume 8, Issue 3 (August 14,
2012) lmcs:1213 | 10.2168/LMCS-8(3:12)2012 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove that orthogonal constructor term rewrite systems and lambda-calculus
with weak (i.e., no reduction is allowed under the scope of a
lambda-abstraction) call-by-value reduction can simulate each other with a
linear overhead. In particular, weak call-by- value beta-reduction can be
simulated by an orthogonal co... | [
{
"created": "Thu, 2 Aug 2012 15:21:44 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Aug 2012 19:01:18 GMT",
"version": "v2"
}
] | 2019-03-14 | [
[
"Lago",
"Ugo Dal",
"",
"Università di Bologna - Dipartimento di Scienze\n dell'Informazione"
],
[
"Martini",
"Simone",
"",
"Università di Bologna - Dipartimento di\n Scienze dell'Informazione"
]
] | We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In particular, weak call-by- value beta-reduction can be simulated by an orthogonal cons... |
2404.12907 | Anna Zych-Pawlewicz | Anna Zych-Pawlewicz, Marek \.Zochowski | Dynamic Parameterized Feedback Problems in Tournaments | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present the first dynamic algorithms for the problem of
Feedback Arc Set in Tournaments (FAST) and the problem of Feedback Vertex Set
in Tournaments (FVST). Our algorithms maintain a dynamic tournament on n
vertices altered by redirecting the arcs, and answer if the tournament admits a
feedback arc s... | [
{
"created": "Fri, 19 Apr 2024 14:28:00 GMT",
"version": "v1"
}
] | 2024-04-22 | [
[
"Zych-Pawlewicz",
"Anna",
""
],
[
"Żochowski",
"Marek",
""
]
] | In this paper we present the first dynamic algorithms for the problem of Feedback Arc Set in Tournaments (FAST) and the problem of Feedback Vertex Set in Tournaments (FVST). Our algorithms maintain a dynamic tournament on n vertices altered by redirecting the arcs, and answer if the tournament admits a feedback arc set... |
2305.14839 | Yunshui Li | Yunshui Li, Binyuan Hui, ZhiChao Yin, Min Yang, Fei Huang and Yongbin
Li | PaCE: Unified Multi-modal Dialogue Pre-training with Progressive and
Compositional Experts | ACL 2023 | null | null | null | cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Perceiving multi-modal information and fulfilling dialogues with humans is a
long-term goal of artificial intelligence. Pre-training is commonly regarded as
an effective approach for multi-modal dialogue. However, due to the limited
availability of multi-modal dialogue data, there is still scarce research on
multi-mo... | [
{
"created": "Wed, 24 May 2023 07:43:29 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Jun 2023 06:31:46 GMT",
"version": "v2"
}
] | 2023-06-14 | [
[
"Li",
"Yunshui",
""
],
[
"Hui",
"Binyuan",
""
],
[
"Yin",
"ZhiChao",
""
],
[
"Yang",
"Min",
""
],
[
"Huang",
"Fei",
""
],
[
"Li",
"Yongbin",
""
]
] | Perceiving multi-modal information and fulfilling dialogues with humans is a long-term goal of artificial intelligence. Pre-training is commonly regarded as an effective approach for multi-modal dialogue. However, due to the limited availability of multi-modal dialogue data, there is still scarce research on multi-moda... |
2310.16808 | Ramachandra Raghavendra Prof. | Raghavendra Ramachandra and Sushma Venkatesh | Fingervein Verification using Convolutional Multi-Head Attention Network | Accepted in IEEE/CVF Winter Conference on Applications of Computer
Vision (WACV), 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Biometric verification systems are deployed in various security-based
access-control applications that require user-friendly and reliable person
verification. Among the different biometric characteristics, fingervein
biometrics have been extensively studied owing to their reliable verification
performance. Furthermor... | [
{
"created": "Wed, 25 Oct 2023 17:38:16 GMT",
"version": "v1"
}
] | 2023-10-26 | [
[
"Ramachandra",
"Raghavendra",
""
],
[
"Venkatesh",
"Sushma",
""
]
] | Biometric verification systems are deployed in various security-based access-control applications that require user-friendly and reliable person verification. Among the different biometric characteristics, fingervein biometrics have been extensively studied owing to their reliable verification performance. Furthermore,... |
2104.04934 | Damien Rohmer | Damien Rohmer, Marco Tarini, Niranjan Kalyanasundaram, Faezeh
Moshfeghifar, Marie-Paule Cani, Victor Zordan | Velocity Skinning for Real-time Stylized Skeletal Animation | null | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Secondary animation effects are essential for liveliness. We propose a
simple, real-time solution for adding them on top of standard skinning,
enabling artist-driven stylization of skeletal motion. Our method takes a
standard skeleton animation as input, along with a skin mesh and rig weights.
It then derives per-ver... | [
{
"created": "Sun, 11 Apr 2021 06:49:29 GMT",
"version": "v1"
}
] | 2021-04-13 | [
[
"Rohmer",
"Damien",
""
],
[
"Tarini",
"Marco",
""
],
[
"Kalyanasundaram",
"Niranjan",
""
],
[
"Moshfeghifar",
"Faezeh",
""
],
[
"Cani",
"Marie-Paule",
""
],
[
"Zordan",
"Victor",
""
]
] | Secondary animation effects are essential for liveliness. We propose a simple, real-time solution for adding them on top of standard skinning, enabling artist-driven stylization of skeletal motion. Our method takes a standard skeleton animation as input, along with a skin mesh and rig weights. It then derives per-verte... |
1808.06143 | Azza Eltraify | AEA Eltraify, M. Musa, A. Al-Quzweeni, J. Elmirghani | Experimental Evaluation of Passive Optical Network Based Data Centre
Architecture | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Passive optical networks (PON) technology is increasingly becoming an
attractive solution in modern data centres as it provides energy efficient,
high capacity, low cost, scalable and flexible connectivity. In this paper we
report the implementation of a PON based data centre architecture that provides
high resilienc... | [
{
"created": "Sat, 18 Aug 2018 23:04:38 GMT",
"version": "v1"
}
] | 2018-08-21 | [
[
"Eltraify",
"AEA",
""
],
[
"Musa",
"M.",
""
],
[
"Al-Quzweeni",
"A.",
""
],
[
"Elmirghani",
"J.",
""
]
] | Passive optical networks (PON) technology is increasingly becoming an attractive solution in modern data centres as it provides energy efficient, high capacity, low cost, scalable and flexible connectivity. In this paper we report the implementation of a PON based data centre architecture that provides high resilience ... |
1809.03776 | Ryota Suzuki | Ryota Suzuki, Shingo Takahashi, Murtuza Petladwala, and Shigeru
Kohmoto | Solving Non-identifiable Latent Feature Models | Submitted to NIPS 2018 (https://nips.cc/). 15 pages , 4 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Latent feature models (LFM)s are widely employed for extracting latent
structures of data. While offering high, parameter estimation is difficult with
LFMs because of the combinational nature of latent features, and
non-identifiability is a particularly difficult problem when parameter
estimation is not unique and th... | [
{
"created": "Tue, 11 Sep 2018 10:11:48 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Sep 2018 05:46:55 GMT",
"version": "v2"
}
] | 2018-09-27 | [
[
"Suzuki",
"Ryota",
""
],
[
"Takahashi",
"Shingo",
""
],
[
"Petladwala",
"Murtuza",
""
],
[
"Kohmoto",
"Shigeru",
""
]
] | Latent feature models (LFM)s are widely employed for extracting latent structures of data. While offering high, parameter estimation is difficult with LFMs because of the combinational nature of latent features, and non-identifiability is a particularly difficult problem when parameter estimation is not unique and ther... |
2107.10516 | David Wajc | Kristen Kessel, Amin Saberi, Ali Shameli, David Wajc | The Stationary Prophet Inequality Problem | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | We study a continuous and infinite time horizon counterpart to the classic
prophet inequality, which we term the stationary prophet inequality problem.
Here, copies of a good arrive and perish according to Poisson point processes.
Buyers arrive similarly and make take-it-or-leave-it offers for unsold items.
The objec... | [
{
"created": "Thu, 22 Jul 2021 08:19:46 GMT",
"version": "v1"
}
] | 2021-07-23 | [
[
"Kessel",
"Kristen",
""
],
[
"Saberi",
"Amin",
""
],
[
"Shameli",
"Ali",
""
],
[
"Wajc",
"David",
""
]
] | We study a continuous and infinite time horizon counterpart to the classic prophet inequality, which we term the stationary prophet inequality problem. Here, copies of a good arrive and perish according to Poisson point processes. Buyers arrive similarly and make take-it-or-leave-it offers for unsold items. The objecti... |
2011.12538 | Tengteng Wen | Tengteng Wen, Zhuofeng Mo, Jingshan Li, Qi Liu, Liming Wu and Dehan
Luo | An Odor Labeling Convolutional Encoder-Decoder for Odor Sensing in
Machine Olfaction | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning methods have been widely applied to visual and acoustic
technology. In this paper, we proposed an odor labeling convolutional
encoder-decoder (OLCE) for odor identification in machine olfaction. OLCE
composes a convolutional neural network encoder and decoder where the encoder
output is constrained to o... | [
{
"created": "Wed, 25 Nov 2020 06:22:02 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Jan 2021 06:58:33 GMT",
"version": "v2"
}
] | 2021-01-07 | [
[
"Wen",
"Tengteng",
""
],
[
"Mo",
"Zhuofeng",
""
],
[
"Li",
"Jingshan",
""
],
[
"Liu",
"Qi",
""
],
[
"Wu",
"Liming",
""
],
[
"Luo",
"Dehan",
""
]
] | Deep learning methods have been widely applied to visual and acoustic technology. In this paper, we proposed an odor labeling convolutional encoder-decoder (OLCE) for odor identification in machine olfaction. OLCE composes a convolutional neural network encoder and decoder where the encoder output is constrained to odo... |
1906.08829 | Ashesh Chattopadhyay | Ashesh Chattopadhyay, Pedram Hassanzadeh, Devika Subramanian | Data-driven prediction of a multi-scale Lorenz 96 chaotic system using
deep learning methods: Reservoir computing, ANN, and RNN-LSTM | Some changes, in Figures, addition of an appendix etc has been done | Nonlin. Processes Geophys. 2020 | 10.5194/npg-27-373-2020 | null | cs.LG math.DS nlin.CD stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the performance of three deep learning methods for predicting
short-term evolution and for reproducing the long-term statistics of a
multi-scale spatio-temporal Lorenz 96 system is examined. The methods are: echo
state network (a type of reservoir computing, RC-ESN), deep feed-forward
artificial neural... | [
{
"created": "Thu, 20 Jun 2019 20:16:53 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Jul 2019 00:51:09 GMT",
"version": "v2"
},
{
"created": "Fri, 6 Dec 2019 03:48:47 GMT",
"version": "v3"
}
] | 2020-07-07 | [
[
"Chattopadhyay",
"Ashesh",
""
],
[
"Hassanzadeh",
"Pedram",
""
],
[
"Subramanian",
"Devika",
""
]
] | In this paper, the performance of three deep learning methods for predicting short-term evolution and for reproducing the long-term statistics of a multi-scale spatio-temporal Lorenz 96 system is examined. The methods are: echo state network (a type of reservoir computing, RC-ESN), deep feed-forward artificial neural n... |
2405.18261 | Pengxiang Zhang | Pengxiang Zhang, Wilfried Haensch, Charudatta M. Phatak, Supratik Guha | Error-Free and Current-Driven Synthetic Antiferromagnetic Domain Wall
Memory Enabled by Channel Meandering | 24 pages | null | null | null | cs.ET cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new type of multi-bit and energy-efficient magnetic memory based
on current-driven, field-free, and highly controlled domain wall motion. A
meandering domain wall channel with precisely interspersed pinning regions
provides the multi-bit capability of a magnetic tunnel junction. The magnetic
free layer o... | [
{
"created": "Tue, 28 May 2024 15:16:21 GMT",
"version": "v1"
}
] | 2024-05-29 | [
[
"Zhang",
"Pengxiang",
""
],
[
"Haensch",
"Wilfried",
""
],
[
"Phatak",
"Charudatta M.",
""
],
[
"Guha",
"Supratik",
""
]
] | We propose a new type of multi-bit and energy-efficient magnetic memory based on current-driven, field-free, and highly controlled domain wall motion. A meandering domain wall channel with precisely interspersed pinning regions provides the multi-bit capability of a magnetic tunnel junction. The magnetic free layer of ... |
2408.04154 | Judy Hanwen Shen | Judy Hanwen Shen, Inioluwa Deborah Raji, Irene Y. Chen | The Data Addition Dilemma | Machine Learning For Health Care 2024 (MLHC) | null | null | null | cs.LG cs.AI stat.ML | http://creativecommons.org/licenses/by/4.0/ | In many machine learning for healthcare tasks, standard datasets are
constructed by amassing data across many, often fundamentally dissimilar,
sources. But when does adding more data help, and when does it hinder progress
on desired model outcomes in real-world settings? We identify this situation as
the \textit{Data... | [
{
"created": "Thu, 8 Aug 2024 01:42:31 GMT",
"version": "v1"
}
] | 2024-08-09 | [
[
"Shen",
"Judy Hanwen",
""
],
[
"Raji",
"Inioluwa Deborah",
""
],
[
"Chen",
"Irene Y.",
""
]
] | In many machine learning for healthcare tasks, standard datasets are constructed by amassing data across many, often fundamentally dissimilar, sources. But when does adding more data help, and when does it hinder progress on desired model outcomes in real-world settings? We identify this situation as the \textit{Data A... |
2110.13704 | Gabriel Hondet | Gabriel Hondet (DEDUCTEAM), Fr\'ed\'eric Blanqui (DEDUCTEAM) | Encoding of Predicate Subtyping with Proof Irrelevance in the
$\lambda$$\Pi$-Calculus Modulo Theory | TYPES 2020 wasn't held in Turin as planned because of the COVID-19
outbreak. TYPES 2020 - 26th International Conference on Types for Proofs and
Programs, Mar 2020, Turino, Italy | null | 10.4230/LIPIcs.TYPES.2020.6 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The $\lambda$$\Pi$-calculus modulo theory is a logical framework in which
various logics and type systems can be encoded, thus helping the
cross-verification and interoperability of proof systems based on those logics
and type systems. In this paper, we show how to encode predicate subtyping and
proof irrelevance, tw... | [
{
"created": "Tue, 26 Oct 2021 13:45:53 GMT",
"version": "v1"
}
] | 2021-10-27 | [
[
"Hondet",
"Gabriel",
"",
"DEDUCTEAM"
],
[
"Blanqui",
"Frédéric",
"",
"DEDUCTEAM"
]
] | The $\lambda$$\Pi$-calculus modulo theory is a logical framework in which various logics and type systems can be encoded, thus helping the cross-verification and interoperability of proof systems based on those logics and type systems. In this paper, we show how to encode predicate subtyping and proof irrelevance, two ... |
2305.14066 | Lan Jiang | Lan Jiang, Haoyang Huang, Dongdong Zhang, Rui Jiang, Furu Wei | One-stop Training of Multiple Capacity Models | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Training models with varying capacities can be advantageous for deploying
them in different scenarios. While high-capacity models offer better
performance, low-capacity models require fewer computing resources for training
and inference. In this work, we propose a novel one-stop training framework to
jointly train hi... | [
{
"created": "Tue, 23 May 2023 13:44:09 GMT",
"version": "v1"
},
{
"created": "Wed, 24 May 2023 09:37:47 GMT",
"version": "v2"
}
] | 2023-05-25 | [
[
"Jiang",
"Lan",
""
],
[
"Huang",
"Haoyang",
""
],
[
"Zhang",
"Dongdong",
""
],
[
"Jiang",
"Rui",
""
],
[
"Wei",
"Furu",
""
]
] | Training models with varying capacities can be advantageous for deploying them in different scenarios. While high-capacity models offer better performance, low-capacity models require fewer computing resources for training and inference. In this work, we propose a novel one-stop training framework to jointly train high... |
2301.10056 | Yan Long | Yan Long, Pirouz Naghavi, Blas Kojusner, Kevin Butler, Sara Rampazzi,
Kevin Fu | Side Eye: Characterizing the Limits of POV Acoustic Eavesdropping from
Smartphone Cameras with Rolling Shutters and Movable Lenses | null | 2023 IEEE Symposium on Security and Privacy | 10.1109/SP46215.2023.00059 | null | cs.CR cs.CV cs.MM cs.SD eess.AS | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Our research discovers how the rolling shutter and movable lens structures
widely found in smartphone cameras modulate structure-borne sounds onto camera
images, creating a point-of-view (POV) optical-acoustic side channel for
acoustic eavesdropping. The movement of smartphone camera hardware leaks
acoustic informati... | [
{
"created": "Tue, 24 Jan 2023 15:00:47 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Jan 2023 20:11:27 GMT",
"version": "v2"
}
] | 2023-09-13 | [
[
"Long",
"Yan",
""
],
[
"Naghavi",
"Pirouz",
""
],
[
"Kojusner",
"Blas",
""
],
[
"Butler",
"Kevin",
""
],
[
"Rampazzi",
"Sara",
""
],
[
"Fu",
"Kevin",
""
]
] | Our research discovers how the rolling shutter and movable lens structures widely found in smartphone cameras modulate structure-borne sounds onto camera images, creating a point-of-view (POV) optical-acoustic side channel for acoustic eavesdropping. The movement of smartphone camera hardware leaks acoustic information... |
2211.05178 | Binghui Peng | Binghui Peng and Aviad Rubinstein | Fully-dynamic-to-incremental reductions with known deletion order (e.g.
sliding window) | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Dynamic algorithms come in three main flavors: $\mathit{incremental}$
(insertions-only), $\mathit{decremental}$ (deletions-only), or $\mathit{fully}$
$\mathit{dynamic}$ (both insertions and deletions). Fully dynamic is the holy
grail of dynamic algorithm design; it is obviously more general than the other
two, but is... | [
{
"created": "Wed, 9 Nov 2022 20:12:37 GMT",
"version": "v1"
},
{
"created": "Wed, 16 Nov 2022 19:01:30 GMT",
"version": "v2"
}
] | 2022-11-18 | [
[
"Peng",
"Binghui",
""
],
[
"Rubinstein",
"Aviad",
""
]
] | Dynamic algorithms come in three main flavors: $\mathit{incremental}$ (insertions-only), $\mathit{decremental}$ (deletions-only), or $\mathit{fully}$ $\mathit{dynamic}$ (both insertions and deletions). Fully dynamic is the holy grail of dynamic algorithm design; it is obviously more general than the other two, but is i... |
2110.08355 | Derek Chen | Derek Chen, Zhou Yu, and Samuel R. Bowman | Clean or Annotate: How to Spend a Limited Data Collection Budget | 17 pages, 3 figures, 6 tables. Accepted to NAACL 2022 workshop | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Crowdsourcing platforms are often used to collect datasets for training
machine learning models, despite higher levels of inaccurate labeling compared
to expert labeling. There are two common strategies to manage the impact of
such noise. The first involves aggregating redundant annotations, but comes at
the expense ... | [
{
"created": "Fri, 15 Oct 2021 20:37:29 GMT",
"version": "v1"
},
{
"created": "Sun, 12 Jun 2022 16:57:41 GMT",
"version": "v2"
}
] | 2022-06-14 | [
[
"Chen",
"Derek",
""
],
[
"Yu",
"Zhou",
""
],
[
"Bowman",
"Samuel R.",
""
]
] | Crowdsourcing platforms are often used to collect datasets for training machine learning models, despite higher levels of inaccurate labeling compared to expert labeling. There are two common strategies to manage the impact of such noise. The first involves aggregating redundant annotations, but comes at the expense of... |
1112.4264 | Davide Bil\'o | Davide Bil\`o, Luciano Gual\`a, and Guido Proietti | Bounded-Distance Network Creation Games | 17 pages, 2 figures | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A network creation game simulates a decentralized and non-cooperative
building of a communication network. Informally, there are $n$ players sitting
on the network nodes, which attempt to establish a reciprocal communication by
activating, incurring a certain cost, any of their incident links. The goal of
each player... | [
{
"created": "Mon, 19 Dec 2011 08:30:51 GMT",
"version": "v1"
}
] | 2011-12-20 | [
[
"Bilò",
"Davide",
""
],
[
"Gualà",
"Luciano",
""
],
[
"Proietti",
"Guido",
""
]
] | A network creation game simulates a decentralized and non-cooperative building of a communication network. Informally, there are $n$ players sitting on the network nodes, which attempt to establish a reciprocal communication by activating, incurring a certain cost, any of their incident links. The goal of each player i... |
2311.08191 | Andrey Bout | Konstantin Yakovlev, Alexander Podolskiy, Andrey Bout, Sergey
Nikolenko, Irina Piontkovskaya | GEC-DePenD: Non-Autoregressive Grammatical Error Correction with
Decoupled Permutation and Decoding | ACL 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Grammatical error correction (GEC) is an important NLP task that is currently
usually solved with autoregressive sequence-to-sequence models. However,
approaches of this class are inherently slow due to one-by-one token
generation, so non-autoregressive alternatives are needed. In this work, we
propose a novel non-au... | [
{
"created": "Tue, 14 Nov 2023 14:24:36 GMT",
"version": "v1"
}
] | 2023-11-15 | [
[
"Yakovlev",
"Konstantin",
""
],
[
"Podolskiy",
"Alexander",
""
],
[
"Bout",
"Andrey",
""
],
[
"Nikolenko",
"Sergey",
""
],
[
"Piontkovskaya",
"Irina",
""
]
] | Grammatical error correction (GEC) is an important NLP task that is currently usually solved with autoregressive sequence-to-sequence models. However, approaches of this class are inherently slow due to one-by-one token generation, so non-autoregressive alternatives are needed. In this work, we propose a novel non-auto... |
2302.06912 | Roman Belaire | Roman Belaire, Pradeep Varakantham, Thanh Nguyen, David Lo | Regret-Based Defense in Adversarial Reinforcement Learning | Accepted at AAMAS 2024 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Deep Reinforcement Learning (DRL) policies have been shown to be vulnerable
to small adversarial noise in observations. Such adversarial noise can have
disastrous consequences in safety-critical environments. For instance, a
self-driving car receiving adversarially perturbed sensory observations about
nearby signs (e... | [
{
"created": "Tue, 14 Feb 2023 08:56:50 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Feb 2023 02:21:17 GMT",
"version": "v2"
},
{
"created": "Wed, 23 Aug 2023 07:27:20 GMT",
"version": "v3"
},
{
"created": "Wed, 27 Mar 2024 06:57:30 GMT",
"version": "v4"
}
] | 2024-03-28 | [
[
"Belaire",
"Roman",
""
],
[
"Varakantham",
"Pradeep",
""
],
[
"Nguyen",
"Thanh",
""
],
[
"Lo",
"David",
""
]
] | Deep Reinforcement Learning (DRL) policies have been shown to be vulnerable to small adversarial noise in observations. Such adversarial noise can have disastrous consequences in safety-critical environments. For instance, a self-driving car receiving adversarially perturbed sensory observations about nearby signs (e.g... |
2210.03953 | Chenze Shao | Chenze Shao and Yang Feng | Non-Monotonic Latent Alignments for CTC-Based Non-Autoregressive Machine
Translation | NeurIPS 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-autoregressive translation (NAT) models are typically trained with the
cross-entropy loss, which forces the model outputs to be aligned verbatim with
the target sentence and will highly penalize small shifts in word positions.
Latent alignment models relax the explicit alignment by marginalizing out all
monotonic... | [
{
"created": "Sat, 8 Oct 2022 07:44:28 GMT",
"version": "v1"
}
] | 2022-10-11 | [
[
"Shao",
"Chenze",
""
],
[
"Feng",
"Yang",
""
]
] | Non-autoregressive translation (NAT) models are typically trained with the cross-entropy loss, which forces the model outputs to be aligned verbatim with the target sentence and will highly penalize small shifts in word positions. Latent alignment models relax the explicit alignment by marginalizing out all monotonic l... |
1608.07115 | David Weir | David Weir, Julie Weeds, Jeremy Reffin and Thomas Kober | Aligning Packed Dependency Trees: a theory of composition for
distributional semantics | To appear in Special issue of Computational Linguistics - Formal
Distributional Semantics | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new framework for compositional distributional semantics in
which the distributional contexts of lexemes are expressed in terms of anchored
packed dependency trees. We show that these structures have the potential to
capture the full sentential contexts of a lexeme and provide a uniform basis
for the com... | [
{
"created": "Thu, 25 Aug 2016 12:44:05 GMT",
"version": "v1"
}
] | 2016-08-26 | [
[
"Weir",
"David",
""
],
[
"Weeds",
"Julie",
""
],
[
"Reffin",
"Jeremy",
""
],
[
"Kober",
"Thomas",
""
]
] | We present a new framework for compositional distributional semantics in which the distributional contexts of lexemes are expressed in terms of anchored packed dependency trees. We show that these structures have the potential to capture the full sentential contexts of a lexeme and provide a uniform basis for the compo... |
2304.14607 | Dhinakaran D | Dhinakaran D, Joe Prathap P.M | A Brief Study of Privacy-Preserving Practices (PPP) in Data Mining | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Data mining is the way toward mining fascinating patterns or information from
an enormous level of the database. Data mining additionally opens another risk
to privacy and data security.One of the maximum significant themes in the
research fieldis privacy-preserving DM (PPDM). Along these lines, the
investigation of ... | [
{
"created": "Fri, 28 Apr 2023 03:24:17 GMT",
"version": "v1"
}
] | 2023-05-01 | [
[
"D",
"Dhinakaran",
""
],
[
"M",
"Joe Prathap P.",
""
]
] | Data mining is the way toward mining fascinating patterns or information from an enormous level of the database. Data mining additionally opens another risk to privacy and data security.One of the maximum significant themes in the research fieldis privacy-preserving DM (PPDM). Along these lines, the investigation of en... |
1805.08399 | Rudresh Dwivedi | Rudresh Dwivedi, Somnath Dey, Mukul Anand Sharma, Apurv Goel | A fingerprint based crypto-biometric system for secure communication | 29 single column pages, 8 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To ensure the secure transmission of data, cryptography is treated as the
most effective solution. Cryptographic key is an important entity in this
procedure. In general, randomly generated cryptographic key (of 256 bits) is
difficult to remember. However, such a key needs to be stored in a protected
place or transpo... | [
{
"created": "Tue, 22 May 2018 05:22:24 GMT",
"version": "v1"
}
] | 2018-05-23 | [
[
"Dwivedi",
"Rudresh",
""
],
[
"Dey",
"Somnath",
""
],
[
"Sharma",
"Mukul Anand",
""
],
[
"Goel",
"Apurv",
""
]
] | To ensure the secure transmission of data, cryptography is treated as the most effective solution. Cryptographic key is an important entity in this procedure. In general, randomly generated cryptographic key (of 256 bits) is difficult to remember. However, such a key needs to be stored in a protected place or transport... |
2306.01931 | Wenqian Cui Mr. | Wenqian Cui and Xiangling Fu and Shaohui Liu and Mingjun Gu and Xien
Liu and Ji Wu and Irwin King | Simple Data Augmentation Techniques for Chinese Disease Normalization | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Disease name normalization is an important task in the medical domain. It
classifies disease names written in various formats into standardized names,
serving as a fundamental component in smart healthcare systems for various
disease-related functions. Nevertheless, the most significant obstacle to
existing disease n... | [
{
"created": "Fri, 2 Jun 2023 22:12:05 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Mar 2024 03:33:32 GMT",
"version": "v2"
},
{
"created": "Thu, 13 Jun 2024 07:06:52 GMT",
"version": "v3"
}
] | 2024-06-14 | [
[
"Cui",
"Wenqian",
""
],
[
"Fu",
"Xiangling",
""
],
[
"Liu",
"Shaohui",
""
],
[
"Gu",
"Mingjun",
""
],
[
"Liu",
"Xien",
""
],
[
"Wu",
"Ji",
""
],
[
"King",
"Irwin",
""
]
] | Disease name normalization is an important task in the medical domain. It classifies disease names written in various formats into standardized names, serving as a fundamental component in smart healthcare systems for various disease-related functions. Nevertheless, the most significant obstacle to existing disease nam... |
2310.07648 | Eleonora Lopez | Eleonora Lopez, Eleonora Chiarantano, Eleonora Grassucci, and Danilo
Comminiello | Hypercomplex Multimodal Emotion Recognition from EEG and Peripheral
Physiological Signals | Published at IEEE ICASSP workshops 2023 | null | null | null | cs.HC cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | Multimodal emotion recognition from physiological signals is receiving an
increasing amount of attention due to the impossibility to control them at will
unlike behavioral reactions, thus providing more reliable information. Existing
deep learning-based methods still rely on extracted handcrafted features, not
taking... | [
{
"created": "Wed, 11 Oct 2023 16:45:44 GMT",
"version": "v1"
}
] | 2023-10-12 | [
[
"Lopez",
"Eleonora",
""
],
[
"Chiarantano",
"Eleonora",
""
],
[
"Grassucci",
"Eleonora",
""
],
[
"Comminiello",
"Danilo",
""
]
] | Multimodal emotion recognition from physiological signals is receiving an increasing amount of attention due to the impossibility to control them at will unlike behavioral reactions, thus providing more reliable information. Existing deep learning-based methods still rely on extracted handcrafted features, not taking f... |
1703.02019 | Gourav Ganesh Shenoy | Gourav G. Shenoy, Erika H. Dsouza, Sandra K\"ubler | Performing Stance Detection on Twitter Data using Computational
Linguistics Techniques | 8 pages, 9 figures, 5 tables | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As humans, we can often detect from a persons utterances if he or she is in
favor of or against a given target entity (topic, product, another person,
etc). But from the perspective of a computer, we need means to automatically
deduce the stance of the tweeter, given just the tweet text. In this paper, we
present our... | [
{
"created": "Mon, 6 Mar 2017 18:44:49 GMT",
"version": "v1"
}
] | 2017-03-07 | [
[
"Shenoy",
"Gourav G.",
""
],
[
"Dsouza",
"Erika H.",
""
],
[
"Kübler",
"Sandra",
""
]
] | As humans, we can often detect from a persons utterances if he or she is in favor of or against a given target entity (topic, product, another person, etc). But from the perspective of a computer, we need means to automatically deduce the stance of the tweeter, given just the tweet text. In this paper, we present our r... |
1807.07247 | Dwarikanath Mahapatra | Zongyuan Ge, Dwarikanath Mahapatra, Suman Sedai, Rahil Garnavi, Rajib
Chakravorty | Chest X-rays Classification: A Multi-Label and Fine-Grained Problem | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The widely used ChestX-ray14 dataset addresses an important medical image
classification problem and has the following caveats: 1) many lung pathologies
are visually similar, 2) a variant of diseases including lung cancer,
tuberculosis, and pneumonia are present in a single scan, i.e. multiple labels
and 3) The incid... | [
{
"created": "Thu, 19 Jul 2018 06:02:54 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Jul 2018 12:47:43 GMT",
"version": "v2"
},
{
"created": "Tue, 24 Jul 2018 22:15:49 GMT",
"version": "v3"
}
] | 2018-07-26 | [
[
"Ge",
"Zongyuan",
""
],
[
"Mahapatra",
"Dwarikanath",
""
],
[
"Sedai",
"Suman",
""
],
[
"Garnavi",
"Rahil",
""
],
[
"Chakravorty",
"Rajib",
""
]
] | The widely used ChestX-ray14 dataset addresses an important medical image classification problem and has the following caveats: 1) many lung pathologies are visually similar, 2) a variant of diseases including lung cancer, tuberculosis, and pneumonia are present in a single scan, i.e. multiple labels and 3) The inciden... |
1906.09458 | Fabio Vitale | Fabio Vitale, Anand Rajagopalan, Claudio Gentile | Flattening a Hierarchical Clustering through Active Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate active learning by pairwise similarity over the leaves of
trees originating from hierarchical clustering procedures. In the realizable
setting, we provide a full characterization of the number of queries needed to
achieve perfect reconstruction of the tree cut. In the non-realizable setting,
we rely on... | [
{
"created": "Sat, 22 Jun 2019 15:03:11 GMT",
"version": "v1"
},
{
"created": "Sat, 12 Oct 2019 15:41:39 GMT",
"version": "v2"
}
] | 2019-10-15 | [
[
"Vitale",
"Fabio",
""
],
[
"Rajagopalan",
"Anand",
""
],
[
"Gentile",
"Claudio",
""
]
] | We investigate active learning by pairwise similarity over the leaves of trees originating from hierarchical clustering procedures. In the realizable setting, we provide a full characterization of the number of queries needed to achieve perfect reconstruction of the tree cut. In the non-realizable setting, we rely on k... |
1812.07208 | Siddharth Dawar | Siddharth Dawar, Debajyoti Bera, Vikram Goyal | High-utility itemset mining for subadditive monotone utility functions | Pre-print of our paper | null | null | null | cs.DB | http://creativecommons.org/licenses/by/4.0/ | High-utility Itemset Mining (HUIM) finds itemsets from a transaction database
with utility no less than a user-defined threshold where the utility of an
itemset is defined as the sum of the item-wise utilities. In this paper, we
generalize this notion to utility functions that need not be a simple sum of
individual u... | [
{
"created": "Tue, 18 Dec 2018 07:26:15 GMT",
"version": "v1"
},
{
"created": "Sun, 10 May 2020 06:05:54 GMT",
"version": "v2"
}
] | 2020-05-12 | [
[
"Dawar",
"Siddharth",
""
],
[
"Bera",
"Debajyoti",
""
],
[
"Goyal",
"Vikram",
""
]
] | High-utility Itemset Mining (HUIM) finds itemsets from a transaction database with utility no less than a user-defined threshold where the utility of an itemset is defined as the sum of the item-wise utilities. In this paper, we generalize this notion to utility functions that need not be a simple sum of individual uti... |
1603.09490 | Andrea Araldo | Andrea Araldo, Gyorgy Dan, Dario Rossi | Stochastic Dynamic Cache Partitioning for Encrypted Content Delivery | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In-network caching is an appealing solution to cope with the increasing
bandwidth demand of video, audio and data transfer over the Internet.
Nonetheless, an increasing share of content delivery services adopt encryption
through HTTPS, which is not compatible with traditional ISP-managed approaches
like transparent a... | [
{
"created": "Thu, 31 Mar 2016 08:47:46 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Jun 2016 12:41:04 GMT",
"version": "v2"
}
] | 2016-06-28 | [
[
"Araldo",
"Andrea",
""
],
[
"Dan",
"Gyorgy",
""
],
[
"Rossi",
"Dario",
""
]
] | In-network caching is an appealing solution to cope with the increasing bandwidth demand of video, audio and data transfer over the Internet. Nonetheless, an increasing share of content delivery services adopt encryption through HTTPS, which is not compatible with traditional ISP-managed approaches like transparent and... |
1907.03950 | Drew A. Hudson | Drew A. Hudson and Christopher D. Manning | Learning by Abstraction: The Neural State Machine | Published as a conference paper at NeurIPS 2019 (spotlight) | null | null | null | cs.AI cs.CL cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the Neural State Machine, seeking to bridge the gap between the
neural and symbolic views of AI and integrate their complementary strengths for
the task of visual reasoning. Given an image, we first predict a probabilistic
graph that represents its underlying semantics and serves as a structured world
mo... | [
{
"created": "Tue, 9 Jul 2019 03:08:41 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Jul 2019 17:14:03 GMT",
"version": "v2"
},
{
"created": "Mon, 15 Jul 2019 09:33:51 GMT",
"version": "v3"
},
{
"created": "Mon, 25 Nov 2019 10:02:05 GMT",
"version": "v4"
}
] | 2019-11-26 | [
[
"Hudson",
"Drew A.",
""
],
[
"Manning",
"Christopher D.",
""
]
] | We introduce the Neural State Machine, seeking to bridge the gap between the neural and symbolic views of AI and integrate their complementary strengths for the task of visual reasoning. Given an image, we first predict a probabilistic graph that represents its underlying semantics and serves as a structured world mode... |
1707.08704 | Rodrigo de Salvo Braz | Gabriel Azevedo Ferreira, Quentin Bertrand, Charles Maussion, Rodrigo
de Salvo Braz | Anytime Exact Belief Propagation | Submission to StaRAI-17 workshop at UAI-17 conference | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Statistical Relational Models and, more recently, Probabilistic Programming,
have been making strides towards an integration of logic and probabilistic
reasoning. A natural expectation for this project is that a probabilistic logic
reasoning algorithm reduces to a logic reasoning algorithm when provided a
model that ... | [
{
"created": "Thu, 27 Jul 2017 04:31:34 GMT",
"version": "v1"
}
] | 2017-07-28 | [
[
"Ferreira",
"Gabriel Azevedo",
""
],
[
"Bertrand",
"Quentin",
""
],
[
"Maussion",
"Charles",
""
],
[
"Braz",
"Rodrigo de Salvo",
""
]
] | Statistical Relational Models and, more recently, Probabilistic Programming, have been making strides towards an integration of logic and probabilistic reasoning. A natural expectation for this project is that a probabilistic logic reasoning algorithm reduces to a logic reasoning algorithm when provided a model that on... |
2007.05307 | Yushan Liu | Yushan Liu, Markus M. Geipel, Christoph Tietz, Florian Buettner | TIMELY: Improving Labeling Consistency in Medical Imaging for Cell Type
Classification | Accepted at ECAI 2020 (24th European Conference on Artificial
Intelligence) | null | null | null | cs.LG cs.CV eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diagnosing diseases such as leukemia or anemia requires reliable counts of
blood cells. Hematologists usually label and count microscopy images of blood
cells manually. In many cases, however, cells in different maturity states are
difficult to distinguish, and in combination with image noise and subjectivity,
humans... | [
{
"created": "Fri, 10 Jul 2020 11:13:13 GMT",
"version": "v1"
}
] | 2020-07-13 | [
[
"Liu",
"Yushan",
""
],
[
"Geipel",
"Markus M.",
""
],
[
"Tietz",
"Christoph",
""
],
[
"Buettner",
"Florian",
""
]
] | Diagnosing diseases such as leukemia or anemia requires reliable counts of blood cells. Hematologists usually label and count microscopy images of blood cells manually. In many cases, however, cells in different maturity states are difficult to distinguish, and in combination with image noise and subjectivity, humans a... |
2107.12093 | Constantinos Loukas | C. Loukas, A. Gazis, D. Schizas | A Multiple-Instance Learning Approach for the Assessment of Gallbladder
Vascularity from Laparoscopic Images | 6 pages, 5 tables, 2 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | An important task at the onset of a laparoscopic cholecystectomy (LC)
operation is the inspection of gallbladder (GB) to evaluate the thickness of
its wall, presence of inflammation and extent of fat. Difficulty in
visualization of the GB wall vessels may be due to the previous factors,
potentially as a result of chr... | [
{
"created": "Mon, 26 Jul 2021 10:22:16 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Jul 2021 07:23:29 GMT",
"version": "v2"
}
] | 2021-07-29 | [
[
"Loukas",
"C.",
""
],
[
"Gazis",
"A.",
""
],
[
"Schizas",
"D.",
""
]
] | An important task at the onset of a laparoscopic cholecystectomy (LC) operation is the inspection of gallbladder (GB) to evaluate the thickness of its wall, presence of inflammation and extent of fat. Difficulty in visualization of the GB wall vessels may be due to the previous factors, potentially as a result of chron... |
1911.05483 | Mohamed Elhag Mohamed Abo | Mohamed Elhag M. Abo, Ram Gopal Raj, Atika Qazi, Abubakar Zakari | Sentiment Analysis for Arabic in Social Media Network: A Systematic
Mapping Study | 34 pages, 10 figures, Articles, 11 tables | null | null | null | cs.SI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the expansion in tenders on the Internet and social media, Arabic
Sentiment Analysis (ASA) has assumed a significant position in the field of
text mining study and has since remained used to explore the sentiments of
users about services, various products or topics conversed over the Internet.
This mapping paper... | [
{
"created": "Sat, 26 Oct 2019 08:38:19 GMT",
"version": "v1"
}
] | 2019-11-14 | [
[
"Abo",
"Mohamed Elhag M.",
""
],
[
"Raj",
"Ram Gopal",
""
],
[
"Qazi",
"Atika",
""
],
[
"Zakari",
"Abubakar",
""
]
] | With the expansion in tenders on the Internet and social media, Arabic Sentiment Analysis (ASA) has assumed a significant position in the field of text mining study and has since remained used to explore the sentiments of users about services, various products or topics conversed over the Internet. This mapping paper d... |
1407.7405 | Qi Chen | Qi Chen and Raymond W. Yeung | Partition-Symmetrical Entropy Functions | This paper is published in IEEE Transactions on Information Theory | Issue Date: OCTOBER.2016 Volume: 62 Issue: 10 On page(s): 1-18
Print ISSN: 0018-9448 Online ISSN: 1557-9654 | 10.1109/TIT.2016.2600580 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $\cal{N}=\{1,\cdots,n\}$. The entropy function $\bf h$ of a set of $n$
discrete random variables $\{X_i:i\in\cal N\}$ is a $2^n$-dimensional vector
whose entries are ${\bf{h}}({\cal{A}})\triangleq
H(X_{\cal{A}}),\cal{A}\subset{\cal N} $, the (joint) entropies of the subsets
of the set of $n$ random variables with... | [
{
"created": "Mon, 28 Jul 2014 13:16:08 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Sep 2016 06:06:47 GMT",
"version": "v2"
}
] | 2016-09-29 | [
[
"Chen",
"Qi",
""
],
[
"Yeung",
"Raymond W.",
""
]
] | Let $\cal{N}=\{1,\cdots,n\}$. The entropy function $\bf h$ of a set of $n$ discrete random variables $\{X_i:i\in\cal N\}$ is a $2^n$-dimensional vector whose entries are ${\bf{h}}({\cal{A}})\triangleq H(X_{\cal{A}}),\cal{A}\subset{\cal N} $, the (joint) entropies of the subsets of the set of $n$ random variables with $... |
0908.2141 | Yucel Altug | Yucel Altug and Aaron B. Wagner | Source and Channel Simulation Using Arbitrary Randomness | 26 pages, 2 figures, submitted to IEEE Trans. on Information Theory.
A shorter version will be presented at 2009 Allerton Conference on
Communication, Control, and Computing | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Necessary and sufficient conditions for approximation of a general channel by
a general source are proved. For the special case in which the channel input is
deterministic, which corresponds to source simulation, we prove a stronger
necessary condition. As the approximation criteria, vanishing variational
distance be... | [
{
"created": "Fri, 14 Aug 2009 21:14:10 GMT",
"version": "v1"
}
] | 2009-08-18 | [
[
"Altug",
"Yucel",
""
],
[
"Wagner",
"Aaron B.",
""
]
] | Necessary and sufficient conditions for approximation of a general channel by a general source are proved. For the special case in which the channel input is deterministic, which corresponds to source simulation, we prove a stronger necessary condition. As the approximation criteria, vanishing variational distance betw... |
2312.03495 | Celine Swennenhuis | Jesper Nederlof and C\'eline M. F. Swennenhuis and Karol W\k{e}grzycki | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs
with Precedence Constraints | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a classical scheduling problem, we are given a set of $n$ jobs of unit
length along with precedence constraints, and the goal is to find a schedule of
these jobs on $m$ identical machines that minimizes the makespan. Using the
standard 3-field notation, it is known as $Pm|\text{prec}, p_j=1|C_{\max}$.
Settling the... | [
{
"created": "Wed, 6 Dec 2023 13:37:59 GMT",
"version": "v1"
}
] | 2023-12-07 | [
[
"Nederlof",
"Jesper",
""
],
[
"Swennenhuis",
"Céline M. F.",
""
],
[
"Węgrzycki",
"Karol",
""
]
] | In a classical scheduling problem, we are given a set of $n$ jobs of unit length along with precedence constraints, and the goal is to find a schedule of these jobs on $m$ identical machines that minimizes the makespan. Using the standard 3-field notation, it is known as $Pm|\text{prec}, p_j=1|C_{\max}$. Settling the c... |
1307.7138 | Eirina Bourtsoulatze | Eirina Bourtsoulatze, Nikolaos Thomos and Pascal Frossard | Reconstruction of Network Coded Sources From Incomplete Datasets | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the problem of recovering source information
from an incomplete set of network coded data. We first study the theoretical
performance of such systems under maximum a posteriori (MAP) decoding and
derive the upper bound on the probability of decoding error as a function of
the system para... | [
{
"created": "Fri, 26 Jul 2013 19:53:44 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Apr 2014 12:11:33 GMT",
"version": "v2"
},
{
"created": "Fri, 13 Mar 2015 17:03:17 GMT",
"version": "v3"
}
] | 2015-03-16 | [
[
"Bourtsoulatze",
"Eirina",
""
],
[
"Thomos",
"Nikolaos",
""
],
[
"Frossard",
"Pascal",
""
]
] | In this paper, we investigate the problem of recovering source information from an incomplete set of network coded data. We first study the theoretical performance of such systems under maximum a posteriori (MAP) decoding and derive the upper bound on the probability of decoding error as a function of the system parame... |
1710.06192 | Zihuan Wang | Zihuan Wang, Ming Li, Qian Liu, A. Lee Swindlehurst | Hybrid Precoder and Combiner Design with Low Resolution Phase Shifters
in mmWave MIMO Systems | null | null | 10.1109/JSTSP.2018.2819129 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Millimeter wave (mmWave) communications have been considered as a key
technology for next generation cellular systems and Wi-Fi networks because of
its advances in providing orders-of-magnitude wider bandwidth than current
wireless networks. Economical and energy efficient analog/digial hybrid
precoding and combining... | [
{
"created": "Tue, 17 Oct 2017 10:13:42 GMT",
"version": "v1"
}
] | 2018-07-04 | [
[
"Wang",
"Zihuan",
""
],
[
"Li",
"Ming",
""
],
[
"Liu",
"Qian",
""
],
[
"Swindlehurst",
"A. Lee",
""
]
] | Millimeter wave (mmWave) communications have been considered as a key technology for next generation cellular systems and Wi-Fi networks because of its advances in providing orders-of-magnitude wider bandwidth than current wireless networks. Economical and energy efficient analog/digial hybrid precoding and combining t... |
cs/0610072 | Frederic Blanqui | Fr\'ed\'eric Blanqui (INRIA Lorraine - LORIA, LIX) | Definitions by rewriting in the Calculus of Constructions | Journal version of LICS'01 | Mathematical Structures in Computer Science 15, 1 (2005) 37-92 | 10.1017/S0960129504004426 | Journal version of LICS'01 | cs.LO | null | This paper presents general syntactic conditions ensuring the strong
normalization and the logical consistency of the Calculus of Algebraic
Constructions, an extension of the Calculus of Constructions with functions and
predicates defined by higher-order rewrite rules. On the one hand, the Calculus
of Constructions i... | [
{
"created": "Thu, 12 Oct 2006 11:47:54 GMT",
"version": "v1"
}
] | 2016-08-16 | [
[
"Blanqui",
"Frédéric",
"",
"INRIA Lorraine - LORIA, LIX"
]
] | This paper presents general syntactic conditions ensuring the strong normalization and the logical consistency of the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. On the one hand, the Calculus of Constructions is ... |
1812.04346 | Raad Bin Tareaf | Raad Bin Tareaf, Philipp Berger, Patrick Hennig and Christoph Meinel | Towards Automatic Personality Prediction Using Facebook Like Categories | 14 pages, 6 figures, conference | null | null | null | cs.SI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We demonstrate that effortlessly accessible digital records of behavior such
as Facebook Likes can be obtained and utilized to automatically distinguish a
wide range of highly delicate personal traits including: life satisfaction,
cultural ethnicity, political views, age, gender and personality traits. The
analysis p... | [
{
"created": "Tue, 11 Dec 2018 12:10:58 GMT",
"version": "v1"
}
] | 2018-12-12 | [
[
"Tareaf",
"Raad Bin",
""
],
[
"Berger",
"Philipp",
""
],
[
"Hennig",
"Patrick",
""
],
[
"Meinel",
"Christoph",
""
]
] | We demonstrate that effortlessly accessible digital records of behavior such as Facebook Likes can be obtained and utilized to automatically distinguish a wide range of highly delicate personal traits including: life satisfaction, cultural ethnicity, political views, age, gender and personality traits. The analysis pre... |
2201.00542 | EPTCS | Richard Schmoetten (Artificial Intelligence and its Applications
Institute. School of Informatics, University of Edinburgh, United Kingdom),
Jake Palmer (Artificial Intelligence and its Applications Institute. School
of Informatics, University of Edinburgh, United Kingdom), Jacques Fleuriot
(Artificial Intellig... | Formalising Geometric Axioms for Minkowski Spacetime and
Without-Loss-of-Generality Theorems | In Proceedings ADG 2021, arXiv:2112.14770 | EPTCS 352, 2021, pp. 116-128 | 10.4204/EPTCS.352.13 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This contribution reports on the continued formalisation of an axiomatic
system for Minkowski spacetime (as used in the study of Special Relativity)
which is closer in spirit to Hilbert's axiomatic approach to Euclidean geometry
than to the vector space approach employed by Minkowski. We present a brief
overview of t... | [
{
"created": "Mon, 3 Jan 2022 09:27:06 GMT",
"version": "v1"
}
] | 2022-01-04 | [
[
"Schmoetten",
"Richard",
"",
"Artificial Intelligence and its Applications\n Institute. School of Informatics, University of Edinburgh, United Kingdom"
],
[
"Palmer",
"Jake",
"",
"Artificial Intelligence and its Applications Institute. School\n of Informatics, University of E... | This contribution reports on the continued formalisation of an axiomatic system for Minkowski spacetime (as used in the study of Special Relativity) which is closer in spirit to Hilbert's axiomatic approach to Euclidean geometry than to the vector space approach employed by Minkowski. We present a brief overview of the... |
1303.2564 | Vadim E. Levit | Vadim E. Levit and Eugen Mandrescu | On f-Symmetries of the Independence Polynomial | 10 pages | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An independent set in a graph is a set of pairwise non-adjacent vertices, and
a(G) is the size of a maximum independent set in the graph G. If s_{k} is the
number of independent sets of cardinality k in G, then
I(G;x)=s_0+s_1*x+s_2*x^2+...+s_a*x^a,a=a(G), is called the independence
polynomial of G (I. Gutman and F. H... | [
{
"created": "Mon, 11 Mar 2013 16:15:07 GMT",
"version": "v1"
}
] | 2013-03-12 | [
[
"Levit",
"Vadim E.",
""
],
[
"Mandrescu",
"Eugen",
""
]
] | An independent set in a graph is a set of pairwise non-adjacent vertices, and a(G) is the size of a maximum independent set in the graph G. If s_{k} is the number of independent sets of cardinality k in G, then I(G;x)=s_0+s_1*x+s_2*x^2+...+s_a*x^a,a=a(G), is called the independence polynomial of G (I. Gutman and F. Har... |
1804.03820 | Ivan De Oliveira Nunes | Ivan O. Nunes and Gene Tsudik | KRB-CCN: Lightweight Authentication & Access Control for Private
Content-Centric Networks | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Content-Centric Networking (CCN) is an internetworking paradigm that offers
an alternative to today's IP-based Internet Architecture. Instead of focusing
on hosts and their locations, CCN emphasizes addressable named content. By
decoupling content from its location, CCN allows opportunistic in-network
content caching... | [
{
"created": "Wed, 11 Apr 2018 05:49:58 GMT",
"version": "v1"
}
] | 2018-04-12 | [
[
"Nunes",
"Ivan O.",
""
],
[
"Tsudik",
"Gene",
""
]
] | Content-Centric Networking (CCN) is an internetworking paradigm that offers an alternative to today's IP-based Internet Architecture. Instead of focusing on hosts and their locations, CCN emphasizes addressable named content. By decoupling content from its location, CCN allows opportunistic in-network content caching, ... |
1910.08216 | Emma Frejinger | Emma Frejinger, Eric Larsen | A language processing algorithm for predicting tactical solutions to an
operational planning problem under uncertainty | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is devoted to the prediction of solutions to a stochastic discrete
optimization problem. Through an application, we illustrate how we can use a
state-of-the-art neural machine translation (NMT) algorithm to predict the
solutions by defining appropriate vocabularies, syntaxes and constraints. We
attend to a... | [
{
"created": "Fri, 18 Oct 2019 01:16:30 GMT",
"version": "v1"
}
] | 2019-10-21 | [
[
"Frejinger",
"Emma",
""
],
[
"Larsen",
"Eric",
""
]
] | This paper is devoted to the prediction of solutions to a stochastic discrete optimization problem. Through an application, we illustrate how we can use a state-of-the-art neural machine translation (NMT) algorithm to predict the solutions by defining appropriate vocabularies, syntaxes and constraints. We attend to app... |
1805.02861 | Anton\'in Ku\v{c}era | Tom\'a\v{s} Br\'azdil, Anton\'in Ku\v{c}era, Vojt\v{e}ch \v{R}eh\'ak | Synthesizing Efficient Solutions for Patrolling Problems in the Internet
Environment | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | We propose an algorithm for constructing efficient patrolling strategies in
the Internet environment, where the protected targets are nodes connected to
the network and the patrollers are software agents capable of
detecting/preventing undesirable activities on the nodes. The algorithm is
based on a novel composition... | [
{
"created": "Tue, 8 May 2018 07:15:53 GMT",
"version": "v1"
},
{
"created": "Thu, 10 May 2018 10:22:58 GMT",
"version": "v2"
}
] | 2018-05-11 | [
[
"Brázdil",
"Tomáš",
""
],
[
"Kučera",
"Antonín",
""
],
[
"Řehák",
"Vojtěch",
""
]
] | We propose an algorithm for constructing efficient patrolling strategies in the Internet environment, where the protected targets are nodes connected to the network and the patrollers are software agents capable of detecting/preventing undesirable activities on the nodes. The algorithm is based on a novel compositional... |
2306.06892 | Aravind Krishnan | Aravind Krishnan, Jesujoba Alabi, Dietrich Klakow | On the N-gram Approximation of Pre-trained Language Models | Accepted at Interspeech 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Large pre-trained language models (PLMs) have shown remarkable performance
across various natural language understanding (NLU) tasks, particularly in
low-resource settings. Nevertheless, their potential in Automatic Speech
Recognition (ASR) remains largely unexplored. This study investigates the
potential usage of PL... | [
{
"created": "Mon, 12 Jun 2023 06:42:08 GMT",
"version": "v1"
}
] | 2023-06-13 | [
[
"Krishnan",
"Aravind",
""
],
[
"Alabi",
"Jesujoba",
""
],
[
"Klakow",
"Dietrich",
""
]
] | Large pre-trained language models (PLMs) have shown remarkable performance across various natural language understanding (NLU) tasks, particularly in low-resource settings. Nevertheless, their potential in Automatic Speech Recognition (ASR) remains largely unexplored. This study investigates the potential usage of PLMs... |
2102.08154 | Ryo Masumura | Ryo Masumura, Mana Ihori, Akihiko Takashima, Tomohiro Tanaka, Takanori
Ashihara | End-to-End Automatic Speech Recognition with Deep Mutual Learning | Accepted at Asia-Pacific Signal and Information Processing
Association Annual Summit and Conference (APSIPA ASC), 2020, pp.632-637 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is the first study to apply deep mutual learning (DML) to
end-to-end ASR models. In DML, multiple models are trained simultaneously and
collaboratively by mimicking each other throughout the training process, which
helps to attain the global optimum and prevent models from making
over-confident predictions... | [
{
"created": "Tue, 16 Feb 2021 13:52:06 GMT",
"version": "v1"
}
] | 2021-02-17 | [
[
"Masumura",
"Ryo",
""
],
[
"Ihori",
"Mana",
""
],
[
"Takashima",
"Akihiko",
""
],
[
"Tanaka",
"Tomohiro",
""
],
[
"Ashihara",
"Takanori",
""
]
] | This paper is the first study to apply deep mutual learning (DML) to end-to-end ASR models. In DML, multiple models are trained simultaneously and collaboratively by mimicking each other throughout the training process, which helps to attain the global optimum and prevent models from making over-confident predictions. ... |
2311.14656 | Jonathan Roberts | Jonathan Roberts, Timo L\"uddecke, Rehan Sheikh, Kai Han, Samuel
Albanie | Charting New Territories: Exploring the Geographic and Geospatial
Capabilities of Multimodal LLMs | V3: Fixed typo in Fig.1; V2: Minor formatting changes and added
missing subfigure captions | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multimodal large language models (MLLMs) have shown remarkable capabilities
across a broad range of tasks but their knowledge and abilities in the
geographic and geospatial domains are yet to be explored, despite potential
wide-ranging benefits to navigation, environmental research, urban development,
and disaster re... | [
{
"created": "Fri, 24 Nov 2023 18:46:02 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Nov 2023 18:56:42 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Jan 2024 18:20:08 GMT",
"version": "v3"
}
] | 2024-01-17 | [
[
"Roberts",
"Jonathan",
""
],
[
"Lüddecke",
"Timo",
""
],
[
"Sheikh",
"Rehan",
""
],
[
"Han",
"Kai",
""
],
[
"Albanie",
"Samuel",
""
]
] | Multimodal large language models (MLLMs) have shown remarkable capabilities across a broad range of tasks but their knowledge and abilities in the geographic and geospatial domains are yet to be explored, despite potential wide-ranging benefits to navigation, environmental research, urban development, and disaster resp... |
0912.0965 | Adam Smith | Venkatesan Guruswami and Adam Smith | Explicit Capacity-achieving Codes for Worst-Case Additive Errors | This preprint has been withdrawn since it is superseded by
arXiv:1004.4017 [cs.IT] (same authors), which contains significantly more
general results. This preprint will no longer be updated by the authors. | null | null | null | cs.IT cs.CC math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For every p in (0,1/2), we give an explicit construction of binary codes of
rate approaching "capacity" 1-H(p) that enable reliable communication in the
presence of worst-case additive errors}, caused by a channel oblivious to the
codeword (but not necessarily the message). Formally, we give an efficient
"stochastic"... | [
{
"created": "Sat, 5 Dec 2009 00:31:48 GMT",
"version": "v1"
},
{
"created": "Sat, 1 May 2010 03:04:23 GMT",
"version": "v2"
}
] | 2010-05-04 | [
[
"Guruswami",
"Venkatesan",
""
],
[
"Smith",
"Adam",
""
]
] | For every p in (0,1/2), we give an explicit construction of binary codes of rate approaching "capacity" 1-H(p) that enable reliable communication in the presence of worst-case additive errors}, caused by a channel oblivious to the codeword (but not necessarily the message). Formally, we give an efficient "stochastic" e... |
2005.10090 | Pablo Blanco-Medina | Rubel Biswas, Roberto A. Vasco-Carofilis, Eduardo Fidalgo Fernandez,
Francisco J\'a\~nez Martino and Pablo Blanco Medina | Perceptual Hashing applied to Tor domains recognition | To be published on the JNIC 2020 Conference. Already published
research summary | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Tor darknet hosts different types of illegal content, which are monitored
by cybersecurity agencies. However, manually classifying Tor content can be
slow and error-prone. To support this task, we introduce Frequency-Dominant
Neighborhood Structure (F-DNS), a new perceptual hashing method for
automatically classi... | [
{
"created": "Wed, 20 May 2020 14:53:36 GMT",
"version": "v1"
},
{
"created": "Thu, 21 May 2020 15:35:25 GMT",
"version": "v2"
}
] | 2020-05-22 | [
[
"Biswas",
"Rubel",
""
],
[
"Vasco-Carofilis",
"Roberto A.",
""
],
[
"Fernandez",
"Eduardo Fidalgo",
""
],
[
"Martino",
"Francisco Jáñez",
""
],
[
"Medina",
"Pablo Blanco",
""
]
] | The Tor darknet hosts different types of illegal content, which are monitored by cybersecurity agencies. However, manually classifying Tor content can be slow and error-prone. To support this task, we introduce Frequency-Dominant Neighborhood Structure (F-DNS), a new perceptual hashing method for automatically classify... |
1501.00539 | Amos Lapidoth | Christoph Bunte and Amos Lapidoth | Maximum R\'enyi Entropy Rate | Submitted to the IEEE Transactions on Information Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Two maximization problems of R\'enyi entropy rate are investigated: the
maximization over all stochastic processes whose marginals satisfy a linear
constraint, and the Burg-like maximization over all stochastic processes whose
autocovariance function begins with some given values. The solutions are
related to the sol... | [
{
"created": "Sat, 3 Jan 2015 07:38:17 GMT",
"version": "v1"
}
] | 2015-01-06 | [
[
"Bunte",
"Christoph",
""
],
[
"Lapidoth",
"Amos",
""
]
] | Two maximization problems of R\'enyi entropy rate are investigated: the maximization over all stochastic processes whose marginals satisfy a linear constraint, and the Burg-like maximization over all stochastic processes whose autocovariance function begins with some given values. The solutions are related to the solut... |
2012.02721 | Amith Ananthram | Amith Ananthram, Emily Allaway, Kathleen McKeown | Event Guided Denoising for Multilingual Relation Learning | COLING2020, short paper | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | General purpose relation extraction has recently seen considerable gains in
part due to a massively data-intensive distant supervision technique from
Soares et al. (2019) that produces state-of-the-art results across many
benchmarks. In this work, we present a methodology for collecting high quality
training data for... | [
{
"created": "Fri, 4 Dec 2020 17:11:04 GMT",
"version": "v1"
}
] | 2020-12-07 | [
[
"Ananthram",
"Amith",
""
],
[
"Allaway",
"Emily",
""
],
[
"McKeown",
"Kathleen",
""
]
] | General purpose relation extraction has recently seen considerable gains in part due to a massively data-intensive distant supervision technique from Soares et al. (2019) that produces state-of-the-art results across many benchmarks. In this work, we present a methodology for collecting high quality training data for r... |
2303.07547 | Tae Eun Choe | Tae Eun Choe, Jane Wu, Xiaolin Lin, Karen Kwon, Minwoo Park | HazardNet: Road Debris Detection by Augmentation of Synthetic Models | 11 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an algorithm to detect unseen road debris using a small set of
synthetic models. Early detection of road debris is critical for safe
autonomous or assisted driving, yet the development of a robust road debris
detection model has not been widely discussed. There are two main challenges to
building a road de... | [
{
"created": "Tue, 14 Mar 2023 00:30:24 GMT",
"version": "v1"
}
] | 2023-03-15 | [
[
"Choe",
"Tae Eun",
""
],
[
"Wu",
"Jane",
""
],
[
"Lin",
"Xiaolin",
""
],
[
"Kwon",
"Karen",
""
],
[
"Park",
"Minwoo",
""
]
] | We present an algorithm to detect unseen road debris using a small set of synthetic models. Early detection of road debris is critical for safe autonomous or assisted driving, yet the development of a robust road debris detection model has not been widely discussed. There are two main challenges to building a road debr... |
1603.07737 | Michael Hoffmann | Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters,
Csaba D. T\'oth | The Planar Tree Packing Theorem | Full version of our SoCG 2016 paper | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Packing graphs is a combinatorial problem where several given graphs are
being mapped into a common host graph such that every edge is used at most
once. In the planar tree packing problem we are given two trees T1 and T2 on n
vertices and have to find a planar graph on n vertices that is the
edge-disjoint union of T... | [
{
"created": "Thu, 24 Mar 2016 20:08:38 GMT",
"version": "v1"
}
] | 2016-03-28 | [
[
"Geyer",
"Markus",
""
],
[
"Hoffmann",
"Michael",
""
],
[
"Kaufmann",
"Michael",
""
],
[
"Kusters",
"Vincent",
""
],
[
"Tóth",
"Csaba D.",
""
]
] | Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and have to find a planar graph on n vertices that is the edge-disjoint union of T1 ... |
1710.00387 | Tomohiko Mizutani | Tomohiko Mizutani and Mirai Tanaka | Efficient Preconditioning for Noisy Separable NMFs by Successive
Projection Based Low-Rank Approximations | 32 pages, 4 figures | Machine Learning, 107(4), pages 643-673, 2018 | null | null | cs.NA stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The successive projection algorithm (SPA) can quickly solve a nonnegative
matrix factorization problem under a separability assumption. Even if noise is
added to the problem, SPA is robust as long as the perturbations caused by the
noise are small. In particular, robustness against noise should be high when
handling ... | [
{
"created": "Sun, 1 Oct 2017 18:20:57 GMT",
"version": "v1"
}
] | 2018-05-11 | [
[
"Mizutani",
"Tomohiko",
""
],
[
"Tanaka",
"Mirai",
""
]
] | The successive projection algorithm (SPA) can quickly solve a nonnegative matrix factorization problem under a separability assumption. Even if noise is added to the problem, SPA is robust as long as the perturbations caused by the noise are small. In particular, robustness against noise should be high when handling th... |
1901.11459 | Fabrizio Sebastiani | Andrea Esuli, Alejandro Moreo, Fabrizio Sebastiani | Funnelling: A New Ensemble Method for Heterogeneous Transfer Learning
and its Application to Cross-Lingual Text Classification | 28 pages, 4 figures | Final version published in ACM Transactions on Information Systems
37(3), 37:1-37:30, 2019 | null | null | cs.LG cs.AI cs.IR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-lingual Text Classification (CLC) consists of automatically
classifying, according to a common set C of classes, documents each written in
one of a set of languages L, and doing so more accurately than when naively
classifying each document via its corresponding language-specific classifier.
In order to obtain ... | [
{
"created": "Thu, 31 Jan 2019 16:32:08 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Apr 2019 16:06:09 GMT",
"version": "v2"
}
] | 2021-09-22 | [
[
"Esuli",
"Andrea",
""
],
[
"Moreo",
"Alejandro",
""
],
[
"Sebastiani",
"Fabrizio",
""
]
] | Cross-lingual Text Classification (CLC) consists of automatically classifying, according to a common set C of classes, documents each written in one of a set of languages L, and doing so more accurately than when naively classifying each document via its corresponding language-specific classifier. In order to obtain an... |
1410.2217 | Anurag Acharya | Anurag Acharya, Alex Verstak, Helder Suzuki, Sean Henderson, Mikhail
Iakhiaev, Cliff Chiung Yu Lin, Namit Shetty | Rise of the Rest: The Growing Impact of Non-Elite Journals | null | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we examine the evolution of the impact of non-elite journals.
We attempt to answer two questions. First, what fraction of the top-cited
articles are published in non-elite journals and how has this changed over
time. Second, what fraction of the total citations are to non-elite journals
and how has thi... | [
{
"created": "Wed, 8 Oct 2014 18:57:23 GMT",
"version": "v1"
}
] | 2014-10-09 | [
[
"Acharya",
"Anurag",
""
],
[
"Verstak",
"Alex",
""
],
[
"Suzuki",
"Helder",
""
],
[
"Henderson",
"Sean",
""
],
[
"Iakhiaev",
"Mikhail",
""
],
[
"Lin",
"Cliff Chiung Yu",
""
],
[
"Shetty",
"Namit",
""
]
] | In this paper, we examine the evolution of the impact of non-elite journals. We attempt to answer two questions. First, what fraction of the top-cited articles are published in non-elite journals and how has this changed over time. Second, what fraction of the total citations are to non-elite journals and how has this ... |
2206.10897 | Atahan \"Ozer | Atahan Ozer, Kadir Burak Buldu, Abdullah Akg\"ul, Gozde Unal | How to Combine Variational Bayesian Networks in Federated Learning | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Federated Learning enables multiple data centers to train a central model
collaboratively without exposing any confidential data. Even though
deterministic models are capable of performing high prediction accuracy, their
lack of calibration and capability to quantify uncertainty is problematic for
safety-critical app... | [
{
"created": "Wed, 22 Jun 2022 07:53:12 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Nov 2022 09:41:33 GMT",
"version": "v2"
}
] | 2022-11-24 | [
[
"Ozer",
"Atahan",
""
],
[
"Buldu",
"Kadir Burak",
""
],
[
"Akgül",
"Abdullah",
""
],
[
"Unal",
"Gozde",
""
]
] | Federated Learning enables multiple data centers to train a central model collaboratively without exposing any confidential data. Even though deterministic models are capable of performing high prediction accuracy, their lack of calibration and capability to quantify uncertainty is problematic for safety-critical appli... |
2205.12853 | Ge-Peng Ji | Ge-Peng Ji, Deng-Ping Fan, Yu-Cheng Chou, Dengxin Dai, Alexander
Liniger and Luc Van Gool | Deep Gradient Learning for Efficient Camouflaged Object Detection | Accepted by Machine Intelligence Research | Machine Intelligence Research. 20, 92-108 (2023) | 10.1007/s11633-022-1365-9 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper introduces DGNet, a novel deep framework that exploits object
gradient supervision for camouflaged object detection (COD). It decouples the
task into two connected branches, i.e., a context and a texture encoder. The
essential connection is the gradient-induced transition, representing a soft
grouping betw... | [
{
"created": "Wed, 25 May 2022 15:25:18 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Aug 2022 09:39:44 GMT",
"version": "v2"
}
] | 2023-06-06 | [
[
"Ji",
"Ge-Peng",
""
],
[
"Fan",
"Deng-Ping",
""
],
[
"Chou",
"Yu-Cheng",
""
],
[
"Dai",
"Dengxin",
""
],
[
"Liniger",
"Alexander",
""
],
[
"Van Gool",
"Luc",
""
]
] | This paper introduces DGNet, a novel deep framework that exploits object gradient supervision for camouflaged object detection (COD). It decouples the task into two connected branches, i.e., a context and a texture encoder. The essential connection is the gradient-induced transition, representing a soft grouping betwee... |
2103.07974 | Cheng Luo | Cheng Luo, Lei Qu, Youshan Miao, Peng Cheng, Yongqiang Xiong | CrossoverScheduler: Overlapping Multiple Distributed Training
Applications in a Crossover Manner | null | null | null | null | cs.DC cs.AI | http://creativecommons.org/licenses/by/4.0/ | Distributed deep learning workloads include throughput-intensive training
tasks on the GPU clusters, where the Distributed Stochastic Gradient Descent
(SGD) incurs significant communication delays after backward propagation,
forces workers to wait for the gradient synchronization via a centralized
parameter server or... | [
{
"created": "Sun, 14 Mar 2021 17:01:15 GMT",
"version": "v1"
}
] | 2021-03-16 | [
[
"Luo",
"Cheng",
""
],
[
"Qu",
"Lei",
""
],
[
"Miao",
"Youshan",
""
],
[
"Cheng",
"Peng",
""
],
[
"Xiong",
"Yongqiang",
""
]
] | Distributed deep learning workloads include throughput-intensive training tasks on the GPU clusters, where the Distributed Stochastic Gradient Descent (SGD) incurs significant communication delays after backward propagation, forces workers to wait for the gradient synchronization via a centralized parameter server or d... |
2005.03487 | Bo Huang | Bo Huang | Algorithmic Averaging for Studying Periodic Orbits of Planar
Differential Systems | arXiv admin note: text overlap with arXiv:1905.03315 | null | null | null | cs.SC math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the main open problems in the qualitative theory of real planar
differential systems is the study of limit cycles. In this article, we present
an algorithmic approach for detecting how many limit cycles can bifurcate from
the periodic orbits of a given polynomial differential center when it is
perturbed inside... | [
{
"created": "Wed, 6 May 2020 07:12:36 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Apr 2023 16:23:01 GMT",
"version": "v2"
}
] | 2023-05-02 | [
[
"Huang",
"Bo",
""
]
] | One of the main open problems in the qualitative theory of real planar differential systems is the study of limit cycles. In this article, we present an algorithmic approach for detecting how many limit cycles can bifurcate from the periodic orbits of a given polynomial differential center when it is perturbed inside a... |
2407.02631 | John Ortega | John E. Ortega and Ibrahim Said Ahmad and William Chen | Nollywood: Let's Go to the Movies! | 8 pages, 4 figures, 2 tables | null | null | null | cs.CL cs.AI cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Nollywood, based on the idea of Bollywood from India, is a series of
outstanding movies that originate from Nigeria. Unfortunately, while the movies
are in English, they are hard to understand for many native speakers due to the
dialect of English that is spoken. In this article, we accomplish two goals:
(1) create a... | [
{
"created": "Tue, 2 Jul 2024 19:50:55 GMT",
"version": "v1"
}
] | 2024-07-04 | [
[
"Ortega",
"John E.",
""
],
[
"Ahmad",
"Ibrahim Said",
""
],
[
"Chen",
"William",
""
]
] | Nollywood, based on the idea of Bollywood from India, is a series of outstanding movies that originate from Nigeria. Unfortunately, while the movies are in English, they are hard to understand for many native speakers due to the dialect of English that is spoken. In this article, we accomplish two goals: (1) create a p... |
2303.14446 | Ralf Wimmer | Ralf Wimmer and Ming-Yi Hu | Using Unit Propagation with Universal Reduction in DQBF Preprocessing | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Several effective preprocessing techniques for Boolean formulas with and
without quantifiers use unit propagation to simplify the formula. Among these
techniques are vivification, unit propagation look-ahead (UPLA), and the
identification of redundant clauses as so-called quantified resolution
asymmetric tautologies ... | [
{
"created": "Sat, 25 Mar 2023 11:41:10 GMT",
"version": "v1"
}
] | 2023-03-28 | [
[
"Wimmer",
"Ralf",
""
],
[
"Hu",
"Ming-Yi",
""
]
] | Several effective preprocessing techniques for Boolean formulas with and without quantifiers use unit propagation to simplify the formula. Among these techniques are vivification, unit propagation look-ahead (UPLA), and the identification of redundant clauses as so-called quantified resolution asymmetric tautologies (Q... |
1508.04725 | Du\v{s}an Knop | Du\v{s}an Knop | Partitioning graphs into induced subgraphs | 14 pages, 4 figures | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the Induced $H$ Partition problem from the parameterized complexity
point of view. In the Induced $H$ Partition problem the task is to partition
vertices of a graph $G$ into sets $V_1,V_2,\dots,V_n$ such that the graph $H$
is isomorphic to the subgraph of $G$ induced by each set $V_i$ for $i =
1,2,\dots,n.$ ... | [
{
"created": "Wed, 19 Aug 2015 18:06:12 GMT",
"version": "v1"
},
{
"created": "Thu, 10 Mar 2016 17:20:36 GMT",
"version": "v2"
}
] | 2016-03-11 | [
[
"Knop",
"Dušan",
""
]
] | We study the Induced $H$ Partition problem from the parameterized complexity point of view. In the Induced $H$ Partition problem the task is to partition vertices of a graph $G$ into sets $V_1,V_2,\dots,V_n$ such that the graph $H$ is isomorphic to the subgraph of $G$ induced by each set $V_i$ for $i = 1,2,\dots,n.$ Th... |
1908.08298 | Nagendra Kumar | Nagendra Kumar, Yash Chandarana, K. Anand, and Manish Singh | Using Social Media for Word-of-Mouth Marketing | null | null | null | null | cs.SI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays online social networks are used extensively for personal and
commercial purposes. This widespread popularity makes them an ideal platform
for advertisements. Social media can be used for both direct and word-of-mouth
(WoM) marketing. Although WoM marketing is considered more effective and it
requires less ad... | [
{
"created": "Thu, 22 Aug 2019 10:37:46 GMT",
"version": "v1"
}
] | 2019-08-23 | [
[
"Kumar",
"Nagendra",
""
],
[
"Chandarana",
"Yash",
""
],
[
"Anand",
"K.",
""
],
[
"Singh",
"Manish",
""
]
] | Nowadays online social networks are used extensively for personal and commercial purposes. This widespread popularity makes them an ideal platform for advertisements. Social media can be used for both direct and word-of-mouth (WoM) marketing. Although WoM marketing is considered more effective and it requires less adve... |
1802.09207 | Stig Bosmans | Stig Bosmans, Siegfried Mercelis Peter Hellinckx and Joachim Denil | Towards evaluating emergent behavior of the Internet of Things using
large scale simulation techniques | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increase in Internet of Things devices and more decentralized
architectures we see a new type of application gain importance, a type where
local interactions between individual entities lead to a global emergent
behavior, Emergent-based IoT (EBI) Systems. In this position paper we explore
techniques to evalu... | [
{
"created": "Mon, 26 Feb 2018 09:05:08 GMT",
"version": "v1"
}
] | 2018-02-27 | [
[
"Bosmans",
"Stig",
""
],
[
"Hellinckx",
"Siegfried Mercelis Peter",
""
],
[
"Denil",
"Joachim",
""
]
] | With the increase in Internet of Things devices and more decentralized architectures we see a new type of application gain importance, a type where local interactions between individual entities lead to a global emergent behavior, Emergent-based IoT (EBI) Systems. In this position paper we explore techniques to evaluat... |
2305.06963 | Firas Khader | Firas Khader, Jakob Nikolas Kather, Tianyu Han, Sven Nebelung,
Christiane Kuhl, Johannes Stegmaier, Daniel Truhn | Cascaded Cross-Attention Networks for Data-Efficient Whole-Slide Image
Classification Using Transformers | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Whole-Slide Imaging allows for the capturing and digitization of
high-resolution images of histological specimen. An automated analysis of such
images using deep learning models is therefore of high demand. The transformer
architecture has been proposed as a possible candidate for effectively
leveraging the high-reso... | [
{
"created": "Thu, 11 May 2023 16:42:24 GMT",
"version": "v1"
}
] | 2023-05-12 | [
[
"Khader",
"Firas",
""
],
[
"Kather",
"Jakob Nikolas",
""
],
[
"Han",
"Tianyu",
""
],
[
"Nebelung",
"Sven",
""
],
[
"Kuhl",
"Christiane",
""
],
[
"Stegmaier",
"Johannes",
""
],
[
"Truhn",
"Daniel",
""
]
] | Whole-Slide Imaging allows for the capturing and digitization of high-resolution images of histological specimen. An automated analysis of such images using deep learning models is therefore of high demand. The transformer architecture has been proposed as a possible candidate for effectively leveraging the high-resolu... |
2401.11188 | Randall Balestriero | Randall Balestriero, Yann LeCun | Fast and Exact Enumeration of Deep Networks Partitions Regions | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | One fruitful formulation of Deep Networks (DNs) enabling their theoretical
study and providing practical guidelines to practitioners relies on Piecewise
Affine Splines. In that realm, a DN's input-mapping is expressed as per-region
affine mapping where those regions are implicitly determined by the model's
architectu... | [
{
"created": "Sat, 20 Jan 2024 09:51:52 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Balestriero",
"Randall",
""
],
[
"LeCun",
"Yann",
""
]
] | One fruitful formulation of Deep Networks (DNs) enabling their theoretical study and providing practical guidelines to practitioners relies on Piecewise Affine Splines. In that realm, a DN's input-mapping is expressed as per-region affine mapping where those regions are implicitly determined by the model's architecture... |
2306.09331 | Dominick Reilly | Dominick Reilly and Aman Chadha and Srijan Das | Seeing the Pose in the Pixels: Learning Pose-Aware Representations in
Vision Transformers | Pre-print. 18 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human perception of surroundings is often guided by the various poses present
within the environment. Many computer vision tasks, such as human action
recognition and robot imitation learning, rely on pose-based entities like
human skeletons or robotic arms. However, conventional Vision Transformer (ViT)
models unifo... | [
{
"created": "Thu, 15 Jun 2023 17:58:39 GMT",
"version": "v1"
}
] | 2023-06-16 | [
[
"Reilly",
"Dominick",
""
],
[
"Chadha",
"Aman",
""
],
[
"Das",
"Srijan",
""
]
] | Human perception of surroundings is often guided by the various poses present within the environment. Many computer vision tasks, such as human action recognition and robot imitation learning, rely on pose-based entities like human skeletons or robotic arms. However, conventional Vision Transformer (ViT) models uniform... |
1701.07388 | Konstantinos Xirogiannopoulos | Konstantinos Xirogiannopoulos, Amol Deshpande | Extracting and Analyzing Hidden Graphs from Relational Databases | A shorter version of the paper is to appear in SIGMOD 2017 | null | 10.1145/3035918.3035949 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Analyzing interconnection structures among underlying entities or objects in
a dataset through the use of graph analytics has been shown to provide
tremendous value in many application domains. However, graphs are not the
primary representation choice for storing most data today, and in order to have
access to these ... | [
{
"created": "Wed, 25 Jan 2017 17:25:56 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Feb 2017 04:25:01 GMT",
"version": "v2"
}
] | 2017-02-14 | [
[
"Xirogiannopoulos",
"Konstantinos",
""
],
[
"Deshpande",
"Amol",
""
]
] | Analyzing interconnection structures among underlying entities or objects in a dataset through the use of graph analytics has been shown to provide tremendous value in many application domains. However, graphs are not the primary representation choice for storing most data today, and in order to have access to these an... |
2304.06532 | Karima Chatouh | Mouna. Malki and Karima. Chatouh | Linear Codes over $\mathfrak{R}^{s,m}=\sum\limits_{\varsigma=1}^{m}
v_{m}^{\varsigma-1}\mathcal{A}_{m-1}$, with $v_{m}^{m}=v_{m}$ | null | null | null | null | cs.IT math.AC math.IT | http://creativecommons.org/licenses/by-sa/4.0/ | The main objective of this paper is to extend the previously defined code
family over the ring $\mathfrak{R}=\sum\limits_{s=0}^{4} v_{5}^{s}
\mathcal{A}_{4}$ to $\mathfrak{R}^{s,m}=\sum\limits_{\varsigma=1}^{m}
v_{m}^{\varsigma-1}\mathcal{A}_{m-1}$, and propose an expanded framework for
its implementation in coding t... | [
{
"created": "Thu, 13 Apr 2023 13:39:52 GMT",
"version": "v1"
}
] | 2023-04-14 | [
[
"Malki",
"Mouna.",
""
],
[
"Chatouh",
"Karima.",
""
]
] | The main objective of this paper is to extend the previously defined code family over the ring $\mathfrak{R}=\sum\limits_{s=0}^{4} v_{5}^{s} \mathcal{A}_{4}$ to $\mathfrak{R}^{s,m}=\sum\limits_{\varsigma=1}^{m} v_{m}^{\varsigma-1}\mathcal{A}_{m-1}$, and propose an expanded framework for its implementation in coding the... |
2302.00330 | Zhou Yang | Zhou Yang, Jieke Shi, Muhammad Hilmi Asyrofi, Bowen Xu, Xin Zhou,
DongGyun Han, and David Lo | Prioritizing Speech Test Cases | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the wide adoption of automated speech recognition (ASR) systems, it is
increasingly important to test and improve ASR systems. However, collecting and
executing speech test cases is usually expensive and time-consuming, motivating
us to strategically prioritize speech test cases. A key question is: how to
determ... | [
{
"created": "Wed, 1 Feb 2023 09:20:08 GMT",
"version": "v1"
}
] | 2023-02-02 | [
[
"Yang",
"Zhou",
""
],
[
"Shi",
"Jieke",
""
],
[
"Asyrofi",
"Muhammad Hilmi",
""
],
[
"Xu",
"Bowen",
""
],
[
"Zhou",
"Xin",
""
],
[
"Han",
"DongGyun",
""
],
[
"Lo",
"David",
""
]
] | With the wide adoption of automated speech recognition (ASR) systems, it is increasingly important to test and improve ASR systems. However, collecting and executing speech test cases is usually expensive and time-consuming, motivating us to strategically prioritize speech test cases. A key question is: how to determin... |
2202.08805 | Hussam Habib | Hussam Habib, Padmini Srinivasan and Rishab Nithyanand | Making a Radical Misogynist: How online social engagement with the
Manosphere influences traits of radicalization | null | null | 10.1145/3555551 | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | The algorithms and the interactions facilitated by online platforms have been
used by radical groups to recruit vulnerable individuals to their cause. This
has resulted in the sharp growth of violent events and deteriorating online
discourse. The Manosphere, a collection of radical anti-feminist communities,
is one s... | [
{
"created": "Thu, 17 Feb 2022 18:17:16 GMT",
"version": "v1"
}
] | 2024-01-18 | [
[
"Habib",
"Hussam",
""
],
[
"Srinivasan",
"Padmini",
""
],
[
"Nithyanand",
"Rishab",
""
]
] | The algorithms and the interactions facilitated by online platforms have been used by radical groups to recruit vulnerable individuals to their cause. This has resulted in the sharp growth of violent events and deteriorating online discourse. The Manosphere, a collection of radical anti-feminist communities, is one suc... |
2407.04657 | Nathan Cassee | Alexander Serebrenik, Nathan Cassee | Teaching Empirical Methods at Eindhoven University of Technology | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this chapter, we share an experience report of teaching a master course on
empirical research methods at Eindhoven University of Technology in the
Netherlands. The course is taught for ten weeks to a mix of students from
different study programs and combines both practical assignments with a
closed-book exam. We d... | [
{
"created": "Fri, 5 Jul 2024 17:14:08 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Serebrenik",
"Alexander",
""
],
[
"Cassee",
"Nathan",
""
]
] | In this chapter, we share an experience report of teaching a master course on empirical research methods at Eindhoven University of Technology in the Netherlands. The course is taught for ten weeks to a mix of students from different study programs and combines both practical assignments with a closed-book exam. We dis... |
1911.00772 | Shadrokh Samavi | Maedeh Jamali, Mahnoosh Bagheri, Nader Karimi, Shadrokh Samavi | Robustness and Imperceptibility Enhancement in Watermarked Images by
Color Transformation | 5 pages 3 figures | null | null | null | cs.MM cs.CR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the effective methods for the preservation of copyright ownership of
digital media is watermarking. Different watermarking techniques try to set a
tradeoff between robustness and transparency of the process. In this research
work, we have used color space conversion and frequency transform to achieve
high robu... | [
{
"created": "Sat, 2 Nov 2019 19:19:24 GMT",
"version": "v1"
}
] | 2019-11-05 | [
[
"Jamali",
"Maedeh",
""
],
[
"Bagheri",
"Mahnoosh",
""
],
[
"Karimi",
"Nader",
""
],
[
"Samavi",
"Shadrokh",
""
]
] | One of the effective methods for the preservation of copyright ownership of digital media is watermarking. Different watermarking techniques try to set a tradeoff between robustness and transparency of the process. In this research work, we have used color space conversion and frequency transform to achieve high robust... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.