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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2002.09869 | Alon Cohen | Alon Cohen, Haim Kaplan, Yishay Mansour and Aviv Rosenberg | Near-optimal Regret Bounds for Stochastic Shortest Path | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Stochastic shortest path (SSP) is a well-known problem in planning and
control, in which an agent has to reach a goal state in minimum total expected
cost. In the learning formulation of the problem, the agent is unaware of the
environment dynamics (i.e., the transition function) and has to repeatedly play
for a give... | [
{
"created": "Sun, 23 Feb 2020 09:10:14 GMT",
"version": "v1"
}
] | 2020-02-25 | [
[
"Cohen",
"Alon",
""
],
[
"Kaplan",
"Haim",
""
],
[
"Mansour",
"Yishay",
""
],
[
"Rosenberg",
"Aviv",
""
]
] | Stochastic shortest path (SSP) is a well-known problem in planning and control, in which an agent has to reach a goal state in minimum total expected cost. In the learning formulation of the problem, the agent is unaware of the environment dynamics (i.e., the transition function) and has to repeatedly play for a given ... |
1809.02847 | Eric Wallace | Eric Wallace, Shi Feng, Jordan Boyd-Graber | Interpreting Neural Networks With Nearest Neighbors | EMNLP 2018 BlackboxNLP | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Local model interpretation methods explain individual predictions by
assigning an importance value to each input feature. This value is often
determined by measuring the change in confidence when a feature is removed.
However, the confidence of neural networks is not a robust measure of model
uncertainty. This issue ... | [
{
"created": "Sat, 8 Sep 2018 18:03:56 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Nov 2018 13:05:39 GMT",
"version": "v2"
}
] | 2018-11-08 | [
[
"Wallace",
"Eric",
""
],
[
"Feng",
"Shi",
""
],
[
"Boyd-Graber",
"Jordan",
""
]
] | Local model interpretation methods explain individual predictions by assigning an importance value to each input feature. This value is often determined by measuring the change in confidence when a feature is removed. However, the confidence of neural networks is not a robust measure of model uncertainty. This issue ma... |
2012.02990 | Shubham Vatsal | Dhruval Jain, Arun D Prabhu, Shubham Vatsal, Gopi Ramena, Naresh Purre | Codeswitched Sentence Creation using Dependency Parsing | null | null | 10.1109/ICSC50631.2021.00030 | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Codeswitching has become one of the most common occurrences across
multilingual speakers of the world, especially in countries like India which
encompasses around 23 official languages with the number of bilingual speakers
being around 300 million. The scarcity of Codeswitched data becomes a
bottleneck in the explora... | [
{
"created": "Sat, 5 Dec 2020 10:00:06 GMT",
"version": "v1"
}
] | 2022-01-03 | [
[
"Jain",
"Dhruval",
""
],
[
"Prabhu",
"Arun D",
""
],
[
"Vatsal",
"Shubham",
""
],
[
"Ramena",
"Gopi",
""
],
[
"Purre",
"Naresh",
""
]
] | Codeswitching has become one of the most common occurrences across multilingual speakers of the world, especially in countries like India which encompasses around 23 official languages with the number of bilingual speakers being around 300 million. The scarcity of Codeswitched data becomes a bottleneck in the explorati... |
1908.09822 | Zhiding Yu | Yang Zou, Zhiding Yu, Xiaofeng Liu, B. V. K. Vijaya Kumar, Jinsong
Wang | Confidence Regularized Self-Training | Accepted to ICCV 2019 (Oral) | null | null | null | cs.CV cs.LG cs.MM cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recent advances in domain adaptation show that deep self-training presents a
powerful means for unsupervised domain adaptation. These methods often involve
an iterative process of predicting on target domain and then taking the
confident predictions as pseudo-labels for retraining. However, since
pseudo-labels can be... | [
{
"created": "Mon, 26 Aug 2019 17:56:13 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Aug 2019 05:26:12 GMT",
"version": "v2"
},
{
"created": "Wed, 15 Jul 2020 10:57:38 GMT",
"version": "v3"
}
] | 2020-07-16 | [
[
"Zou",
"Yang",
""
],
[
"Yu",
"Zhiding",
""
],
[
"Liu",
"Xiaofeng",
""
],
[
"Kumar",
"B. V. K. Vijaya",
""
],
[
"Wang",
"Jinsong",
""
]
] | Recent advances in domain adaptation show that deep self-training presents a powerful means for unsupervised domain adaptation. These methods often involve an iterative process of predicting on target domain and then taking the confident predictions as pseudo-labels for retraining. However, since pseudo-labels can be n... |
2308.12964 | Yunji Kim | Yunji Kim, Jiyoung Lee, Jin-Hwa Kim, Jung-Woo Ha, Jun-Yan Zhu | Dense Text-to-Image Generation with Attention Modulation | Accepted by ICCV2023. Code and data are available at
https://github.com/naver-ai/DenseDiffusion | null | null | null | cs.CV cs.GR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Existing text-to-image diffusion models struggle to synthesize realistic
images given dense captions, where each text prompt provides a detailed
description for a specific image region. To address this, we propose
DenseDiffusion, a training-free method that adapts a pre-trained text-to-image
model to handle such dens... | [
{
"created": "Thu, 24 Aug 2023 17:59:01 GMT",
"version": "v1"
}
] | 2023-08-25 | [
[
"Kim",
"Yunji",
""
],
[
"Lee",
"Jiyoung",
""
],
[
"Kim",
"Jin-Hwa",
""
],
[
"Ha",
"Jung-Woo",
""
],
[
"Zhu",
"Jun-Yan",
""
]
] | Existing text-to-image diffusion models struggle to synthesize realistic images given dense captions, where each text prompt provides a detailed description for a specific image region. To address this, we propose DenseDiffusion, a training-free method that adapts a pre-trained text-to-image model to handle such dense ... |
1406.2285 | Navya Chodisetti | Navya Chodisetti | A Piggybank Protocol for Quantum Cryptography | 6 pages, 2 figures, 1 table | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a quantum mechanical version of the piggy-bank
cryptography protocol. The basic piggybank cryptography idea is to use two
communications: one with the encrypted message, and the other regarding the
encryption transformation which the receiver must decipher first. In the
quantum mechanical version ... | [
{
"created": "Mon, 9 Jun 2014 19:07:01 GMT",
"version": "v1"
}
] | 2014-06-10 | [
[
"Chodisetti",
"Navya",
""
]
] | This paper presents a quantum mechanical version of the piggy-bank cryptography protocol. The basic piggybank cryptography idea is to use two communications: one with the encrypted message, and the other regarding the encryption transformation which the receiver must decipher first. In the quantum mechanical version of... |
2308.10496 | Oliver Niggemann | Jan-Philipp Roche and Oliver Niggemann and Jens Friebe | Using Autoencoders and AutoDiff to Reconstruct Missing Variables in a
Set of Time Series | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing black box modeling approaches in machine learning suffer from a
fixed input and output feature combination. In this paper, a new approach to
reconstruct missing variables in a set of time series is presented. An
autoencoder is trained as usual with every feature on both sides and the neural
network parameter... | [
{
"created": "Mon, 21 Aug 2023 06:35:08 GMT",
"version": "v1"
}
] | 2023-08-22 | [
[
"Roche",
"Jan-Philipp",
""
],
[
"Niggemann",
"Oliver",
""
],
[
"Friebe",
"Jens",
""
]
] | Existing black box modeling approaches in machine learning suffer from a fixed input and output feature combination. In this paper, a new approach to reconstruct missing variables in a set of time series is presented. An autoencoder is trained as usual with every feature on both sides and the neural network parameters ... |
1408.0023 | Michael Winterrose | Michael L. Winterrose and Kevin M. Carter | Strategic Evolution of Adversaries Against Temporal Platform Diversity
Active Cyber Defenses | null | Proceedings of the Agent-Directed Simulation Symposium at the
Spring Simulation Multiconference (2014): 68-76 | null | null | cs.CR cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adversarial dynamics are a critical facet within the cyber security domain,
in which there exists a co-evolution between attackers and defenders in any
given threat scenario. While defenders leverage capabilities to minimize the
potential impact of an attack, the adversary is simultaneously developing
countermeasures... | [
{
"created": "Thu, 31 Jul 2014 20:32:09 GMT",
"version": "v1"
}
] | 2014-08-19 | [
[
"Winterrose",
"Michael L.",
""
],
[
"Carter",
"Kevin M.",
""
]
] | Adversarial dynamics are a critical facet within the cyber security domain, in which there exists a co-evolution between attackers and defenders in any given threat scenario. While defenders leverage capabilities to minimize the potential impact of an attack, the adversary is simultaneously developing countermeasures t... |
1605.05404 | Matthias Petri | Simon Gog and Alistair Moffat and Matthias Petri | CSA++: Fast Pattern Search for Large Alphabets | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Indexed pattern search in text has been studied for many decades. For small
alphabets, the FM-Index provides unmatched performance, in terms of both space
required and search speed. For large alphabets -- for example, when the tokens
are words -- the situation is more complex, and FM-Index representations are
compact... | [
{
"created": "Wed, 18 May 2016 00:20:00 GMT",
"version": "v1"
}
] | 2016-05-19 | [
[
"Gog",
"Simon",
""
],
[
"Moffat",
"Alistair",
""
],
[
"Petri",
"Matthias",
""
]
] | Indexed pattern search in text has been studied for many decades. For small alphabets, the FM-Index provides unmatched performance, in terms of both space required and search speed. For large alphabets -- for example, when the tokens are words -- the situation is more complex, and FM-Index representations are compact, ... |
2201.03486 | Shahrzad Kiani Dehkordi | Shahrzad Kiani and Stark C. Draper | Successive Approximation Coding for Distributed Matrix Multiplication | null | null | null | null | cs.DC cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Coded distributed computing was recently introduced to mitigate the effect of
stragglers on distributed computing. This paper combines ideas of approximate
computing with coded computing to further accelerate computation. We propose
successive approximation coding (SAC) techniques that realize a tradeoff
between accu... | [
{
"created": "Mon, 10 Jan 2022 17:32:16 GMT",
"version": "v1"
}
] | 2022-01-11 | [
[
"Kiani",
"Shahrzad",
""
],
[
"Draper",
"Stark C.",
""
]
] | Coded distributed computing was recently introduced to mitigate the effect of stragglers on distributed computing. This paper combines ideas of approximate computing with coded computing to further accelerate computation. We propose successive approximation coding (SAC) techniques that realize a tradeoff between accura... |
2405.13781 | Martin Engilberge | Yingxue Yu, Vidit Vidit, Andrey Davydov, Martin Engilberge, Pascal Fua | Addressing the Elephant in the Room: Robust Animal Re-Identification
with Unsupervised Part-Based Feature Alignment | Accepted to CVPR workshop CV4Animals 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Animal Re-ID is crucial for wildlife conservation, yet it faces unique
challenges compared to person Re-ID. First, the scarcity and lack of diversity
in datasets lead to background-biased models. Second, animal Re-ID depends on
subtle, species-specific cues, further complicated by variations in pose,
background, and ... | [
{
"created": "Wed, 22 May 2024 16:08:06 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Yu",
"Yingxue",
""
],
[
"Vidit",
"Vidit",
""
],
[
"Davydov",
"Andrey",
""
],
[
"Engilberge",
"Martin",
""
],
[
"Fua",
"Pascal",
""
]
] | Animal Re-ID is crucial for wildlife conservation, yet it faces unique challenges compared to person Re-ID. First, the scarcity and lack of diversity in datasets lead to background-biased models. Second, animal Re-ID depends on subtle, species-specific cues, further complicated by variations in pose, background, and li... |
2003.08680 | Rui Xiang | Rui Xiang, Rongjie Lai, Hongkai Zhao | Efficient and Robust Shape Correspondence via Sparsity-Enforced
Quadratic Assignment | 8 pages, 6 figures. Compared to the version to be published in the
2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR),
Figure 1 has been changed to a more illustrative example and run time table 1
has been updated by our recently optimized code | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we introduce a novel local pairwise descriptor and then develop
a simple, effective iterative method to solve the resulting quadratic
assignment through sparsity control for shape correspondence between two
approximate isometric surfaces. Our pairwise descriptor is based on the
stiffness and mass matrix... | [
{
"created": "Thu, 19 Mar 2020 10:56:16 GMT",
"version": "v1"
},
{
"created": "Fri, 20 Mar 2020 21:23:38 GMT",
"version": "v2"
}
] | 2020-03-24 | [
[
"Xiang",
"Rui",
""
],
[
"Lai",
"Rongjie",
""
],
[
"Zhao",
"Hongkai",
""
]
] | In this work, we introduce a novel local pairwise descriptor and then develop a simple, effective iterative method to solve the resulting quadratic assignment through sparsity control for shape correspondence between two approximate isometric surfaces. Our pairwise descriptor is based on the stiffness and mass matrix o... |
2307.14439 | Ryan Kortvelesy | Ryan Kortvelesy | Fixed Integral Neural Networks | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is often useful to perform integration over learned functions represented
by neural networks. However, this integration is usually performed numerically,
as analytical integration over learned functions (especially neural networks)
is generally viewed as intractable. In this work, we present a method for
represent... | [
{
"created": "Wed, 26 Jul 2023 18:16:43 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Sep 2023 14:03:34 GMT",
"version": "v2"
},
{
"created": "Tue, 10 Oct 2023 13:41:57 GMT",
"version": "v3"
},
{
"created": "Sun, 24 Dec 2023 02:49:37 GMT",
"version": "v4"
}
] | 2023-12-27 | [
[
"Kortvelesy",
"Ryan",
""
]
] | It is often useful to perform integration over learned functions represented by neural networks. However, this integration is usually performed numerically, as analytical integration over learned functions (especially neural networks) is generally viewed as intractable. In this work, we present a method for representin... |
1001.2331 | Sriram Vishwanath | Sriram Vishwanath | Information Theoretic Bounds for Low-Rank Matrix Completion | null | null | null | null | cs.IT cs.CC math.IT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the low-rank matrix completion problem from an information
theoretic perspective. The completion problem is rephrased as a communication
problem of an (uncoded) low-rank matrix source over an erasure channel. The
paper then uses achievability and converse arguments to present order-wise
optimal bou... | [
{
"created": "Thu, 14 Jan 2010 20:54:22 GMT",
"version": "v1"
}
] | 2016-09-08 | [
[
"Vishwanath",
"Sriram",
""
]
] | This paper studies the low-rank matrix completion problem from an information theoretic perspective. The completion problem is rephrased as a communication problem of an (uncoded) low-rank matrix source over an erasure channel. The paper then uses achievability and converse arguments to present order-wise optimal bound... |
2211.06034 | Ke Liao | Ke Liao, Wei Wang, Armagan Elibol, Lingzhong Meng, Xu Zhao, and Nak
Young Chong | Does Deep Learning REALLY Outperform Non-deep Machine Learning for
Clinical Prediction on Physiological Time Series? | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning has been widely used in healthcare applications to
approximate complex models, for clinical diagnosis, prognosis, and treatment.
As deep learning has the outstanding ability to extract information from time
series, its true capabilities on sparse, irregularly sampled, multivariate, and
imbalanced phy... | [
{
"created": "Fri, 11 Nov 2022 07:09:49 GMT",
"version": "v1"
}
] | 2022-11-14 | [
[
"Liao",
"Ke",
""
],
[
"Wang",
"Wei",
""
],
[
"Elibol",
"Armagan",
""
],
[
"Meng",
"Lingzhong",
""
],
[
"Zhao",
"Xu",
""
],
[
"Chong",
"Nak Young",
""
]
] | Machine learning has been widely used in healthcare applications to approximate complex models, for clinical diagnosis, prognosis, and treatment. As deep learning has the outstanding ability to extract information from time series, its true capabilities on sparse, irregularly sampled, multivariate, and imbalanced physi... |
1711.10388 | Rushil Anirudh | Rushil Anirudh, Hyojin Kim, Jayaraman J. Thiagarajan, K. Aditya Mohan,
Kyle Champley, Timo Bremer | Lose The Views: Limited Angle CT Reconstruction via Implicit Sinogram
Completion | Spotlight presentation at CVPR 2018 | null | null | null | cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computed Tomography (CT) reconstruction is a fundamental component to a wide
variety of applications ranging from security, to healthcare. The classical
techniques require measuring projections, called sinograms, from a full
180$^\circ$ view of the object. This is impractical in a limited angle
scenario, when the vie... | [
{
"created": "Tue, 28 Nov 2017 16:37:14 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Mar 2018 16:23:30 GMT",
"version": "v2"
},
{
"created": "Wed, 11 Jul 2018 17:20:08 GMT",
"version": "v3"
}
] | 2018-07-12 | [
[
"Anirudh",
"Rushil",
""
],
[
"Kim",
"Hyojin",
""
],
[
"Thiagarajan",
"Jayaraman J.",
""
],
[
"Mohan",
"K. Aditya",
""
],
[
"Champley",
"Kyle",
""
],
[
"Bremer",
"Timo",
""
]
] | Computed Tomography (CT) reconstruction is a fundamental component to a wide variety of applications ranging from security, to healthcare. The classical techniques require measuring projections, called sinograms, from a full 180$^\circ$ view of the object. This is impractical in a limited angle scenario, when the viewi... |
0710.4802 | EDA Publishing Association | M. Scholive, V. Beroulle, C. Robach, M. L. Flottes (LIRMM), B.
Rouzeyre (LIRMM) | Mutation Sampling Technique for the Generation of Structural Test Data | Submitted on behalf of EDAA (http://www.edaa.com/) | Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005) | null | null | cs.OH | null | Our goal is to produce validation data that can be used as an efficient (pre)
test set for structural stuck-at faults. In this paper, we detail an original
test-oriented mutation sampling technique used for generating such data and we
present a first evaluation on these validation data with regard to a structural
tes... | [
{
"created": "Thu, 25 Oct 2007 11:56:47 GMT",
"version": "v1"
}
] | 2011-11-09 | [
[
"Scholive",
"M.",
"",
"LIRMM"
],
[
"Beroulle",
"V.",
"",
"LIRMM"
],
[
"Robach",
"C.",
"",
"LIRMM"
],
[
"Flottes",
"M. L.",
"",
"LIRMM"
],
[
"Rouzeyre",
"B.",
"",
"LIRMM"
]
] | Our goal is to produce validation data that can be used as an efficient (pre) test set for structural stuck-at faults. In this paper, we detail an original test-oriented mutation sampling technique used for generating such data and we present a first evaluation on these validation data with regard to a structural test. |
2112.05705 | Patrick Xia | Patrick Xia, Richard Shin | Pruning Pretrained Encoders with a Multitask Objective | ENLSP NeurIPS 2021 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The sizes of pretrained language models make them challenging and expensive
to use when there are multiple desired downstream tasks. In this work, we adopt
recent strategies for model pruning during finetuning to explore the question
of whether it is possible to prune a single encoder so that it can be used for
multi... | [
{
"created": "Fri, 10 Dec 2021 17:57:33 GMT",
"version": "v1"
}
] | 2021-12-13 | [
[
"Xia",
"Patrick",
""
],
[
"Shin",
"Richard",
""
]
] | The sizes of pretrained language models make them challenging and expensive to use when there are multiple desired downstream tasks. In this work, we adopt recent strategies for model pruning during finetuning to explore the question of whether it is possible to prune a single encoder so that it can be used for multipl... |
2401.13371 | Patrick Kolpaczki | Patrick Kolpaczki, Maximilian Muschalik, Fabian Fumagalli, Barbara
Hammer, Eyke H\"ullermeier | SVARM-IQ: Efficient Approximation of Any-order Shapley Interactions
through Stratification | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Addressing the limitations of individual attribution scores via the Shapley
value (SV), the field of explainable AI (XAI) has recently explored intricate
interactions of features or data points. In particular, extensions of the SV,
such as the Shapley Interaction Index (SII), have been proposed as a measure to
still ... | [
{
"created": "Wed, 24 Jan 2024 11:01:15 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Jan 2024 08:36:35 GMT",
"version": "v2"
},
{
"created": "Fri, 1 Mar 2024 14:44:23 GMT",
"version": "v3"
}
] | 2024-03-04 | [
[
"Kolpaczki",
"Patrick",
""
],
[
"Muschalik",
"Maximilian",
""
],
[
"Fumagalli",
"Fabian",
""
],
[
"Hammer",
"Barbara",
""
],
[
"Hüllermeier",
"Eyke",
""
]
] | Addressing the limitations of individual attribution scores via the Shapley value (SV), the field of explainable AI (XAI) has recently explored intricate interactions of features or data points. In particular, extensions of the SV, such as the Shapley Interaction Index (SII), have been proposed as a measure to still be... |
1704.01937 | Joshua Brakensiek | Joshua Brakensiek and Venkatesan Guruswami | Promise Constraint Satisfaction: Algebraic Structure and a Symmetric
Boolean Dichotomy | 39 pages; various revisions including removal of appendices and
updates/corrections to some proofs | null | null | null | cs.CC cs.DM cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A classic result due to Schaefer (1978) classifies all constraint
satisfaction problems (CSPs) over the Boolean domain as being either in
$\mathsf{P}$ or $\mathsf{NP}$-hard. This paper considers a promise-problem
variant of CSPs called PCSPs. A PCSP over a finite set of pairs of constraints
$\Gamma$ consists of a pai... | [
{
"created": "Thu, 6 Apr 2017 17:07:10 GMT",
"version": "v1"
},
{
"created": "Thu, 6 May 2021 15:34:08 GMT",
"version": "v2"
}
] | 2021-05-07 | [
[
"Brakensiek",
"Joshua",
""
],
[
"Guruswami",
"Venkatesan",
""
]
] | A classic result due to Schaefer (1978) classifies all constraint satisfaction problems (CSPs) over the Boolean domain as being either in $\mathsf{P}$ or $\mathsf{NP}$-hard. This paper considers a promise-problem variant of CSPs called PCSPs. A PCSP over a finite set of pairs of constraints $\Gamma$ consists of a pair ... |
2405.03613 | Jinwei Han | Jinwei Han, Yingguo Gao, Zhiwen Lin, Ke Yan, Shouhong Ding, Yuan Gao,
Gui-Song Xia | Dual Relation Mining Network for Zero-Shot Learning | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Zero-shot learning (ZSL) aims to recognize novel classes through transferring
shared semantic knowledge (e.g., attributes) from seen classes to unseen
classes. Recently, attention-based methods have exhibited significant progress
which align visual features and attributes via a spatial attention mechanism.
However, t... | [
{
"created": "Mon, 6 May 2024 16:31:19 GMT",
"version": "v1"
}
] | 2024-05-07 | [
[
"Han",
"Jinwei",
""
],
[
"Gao",
"Yingguo",
""
],
[
"Lin",
"Zhiwen",
""
],
[
"Yan",
"Ke",
""
],
[
"Ding",
"Shouhong",
""
],
[
"Gao",
"Yuan",
""
],
[
"Xia",
"Gui-Song",
""
]
] | Zero-shot learning (ZSL) aims to recognize novel classes through transferring shared semantic knowledge (e.g., attributes) from seen classes to unseen classes. Recently, attention-based methods have exhibited significant progress which align visual features and attributes via a spatial attention mechanism. However, the... |
1802.09189 | Xingyu Fu | XingYu Fu, ZiYi Yang, XiuWen Duan | Language Distribution Prediction based on Batch Markov Monte Carlo
Simulation with Migration | 25 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Language spreading is a complex mechanism that involves issues like culture,
economics, migration, population etc. In this paper, we propose a set of
methods to model the dynamics of the spreading system. To model the randomness
of language spreading, we propose the Batch Markov Monte Carlo Simulation with
Migration(... | [
{
"created": "Mon, 26 Feb 2018 07:52:30 GMT",
"version": "v1"
}
] | 2018-02-27 | [
[
"Fu",
"XingYu",
""
],
[
"Yang",
"ZiYi",
""
],
[
"Duan",
"XiuWen",
""
]
] | Language spreading is a complex mechanism that involves issues like culture, economics, migration, population etc. In this paper, we propose a set of methods to model the dynamics of the spreading system. To model the randomness of language spreading, we propose the Batch Markov Monte Carlo Simulation with Migration(BM... |
2401.14983 | Dmitry O. Litvintsev | Dmitry Litvintsev (1), Chitrapu Krishnaveni (2), Svenja Meyer (3),
Paul Millar (3), Tigran Mkrtchyan (1), Lea Morschel (3), Albert Rossi (1),
and Marina Sahakyan (3) ((1) Fermi National Accelerator Laboratory, (2)
Linkoping University, (3) Deutsches Elektronen-Synchrotron DESY) | Quota management in dCache or making a perfectly normal file system
normal | 26th Intl Conf Computing High Energy & Nuclear Phys (CHEP 2023) | null | null | FERMILAB-CONF-23-530-CSAID | cs.DB hep-ex | http://creativecommons.org/licenses/by/4.0/ | dCache (https://dcache.org) is a highly scalable storage system providing
location-independent access to data. The data are stored across multiple data
servers as complete files presented to the end-user via a single-rooted
namespace. From its inception, dCache has been designed as a caching disk
buffer to a tertiary... | [
{
"created": "Fri, 26 Jan 2024 16:16:51 GMT",
"version": "v1"
}
] | 2024-01-29 | [
[
"Litvintsev",
"Dmitry",
""
],
[
"Krishnaveni",
"Chitrapu",
""
],
[
"Meyer",
"Svenja",
""
],
[
"Millar",
"Paul",
""
],
[
"Mkrtchyan",
"Tigran",
""
],
[
"Morschel",
"Lea",
""
],
[
"Rossi",
"Albert",
""
],
... | dCache (https://dcache.org) is a highly scalable storage system providing location-independent access to data. The data are stored across multiple data servers as complete files presented to the end-user via a single-rooted namespace. From its inception, dCache has been designed as a caching disk buffer to a tertiary t... |
1907.12014 | Takahiro Hirofuchi | Takahiro Hirofuchi and Ryousei Takano | The Preliminary Evaluation of a Hypervisor-based Virtualization
Mechanism for Intel Optane DC Persistent Memory Module | null | null | null | null | cs.OS cs.AR cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-volatile memory (NVM) technologies, being accessible in the same manner
as DRAM, are considered indispensable for expanding main memory capacities.
Intel Optane DCPMM is a long-awaited product that drastically increases main
memory capacities. However, a substantial performance gap exists between DRAM
and DCPMM. ... | [
{
"created": "Sun, 28 Jul 2019 05:06:24 GMT",
"version": "v1"
}
] | 2019-07-30 | [
[
"Hirofuchi",
"Takahiro",
""
],
[
"Takano",
"Ryousei",
""
]
] | Non-volatile memory (NVM) technologies, being accessible in the same manner as DRAM, are considered indispensable for expanding main memory capacities. Intel Optane DCPMM is a long-awaited product that drastically increases main memory capacities. However, a substantial performance gap exists between DRAM and DCPMM. In... |
cs/0608044 | Jay Kumar Sundararajan | Jay Kumar Sundararajan, Muriel Medard, MinJi Kim, Atilla Eryilmaz,
Devavrat Shah, Ralf Koetter | Network Coding in a Multicast Switch | 9 pages, submitted to IEEE INFOCOM 2007 | null | 10.1109/INFCOM.2007.137 | null | cs.NI cs.IT math.IT | null | We consider the problem of serving multicast flows in a crossbar switch. We
show that linear network coding across packets of a flow can sustain traffic
patterns that cannot be served if network coding were not allowed. Thus,
network coding leads to a larger rate region in a multicast crossbar switch. We
demonstrate ... | [
{
"created": "Tue, 8 Aug 2006 19:59:33 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Sundararajan",
"Jay Kumar",
""
],
[
"Medard",
"Muriel",
""
],
[
"Kim",
"MinJi",
""
],
[
"Eryilmaz",
"Atilla",
""
],
[
"Shah",
"Devavrat",
""
],
[
"Koetter",
"Ralf",
""
]
] | We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot be served if network coding were not allowed. Thus, network coding leads to a larger rate region in a multicast crossbar switch. We demonstrate a ... |
2311.04578 | Tuan Thanh Nguyen | Tuan Thanh Nguyen, Kui Cai, and Paul H. Siegel | A New Version of q-ary Varshamov-Tenengolts Codes with More Efficient
Encoders: The Differential VT Codes and The Differential Shifted VT Codes | arXiv admin note: substantial text overlap with arXiv:2212.10721 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of correcting deletions and insertions has recently received
significantly increased attention due to the DNA-based data storage technology,
which suffers from deletions and insertions with extremely high probability. In
this work, we study the problem of constructing non-binary
burst-deletion/insertion c... | [
{
"created": "Wed, 8 Nov 2023 10:19:10 GMT",
"version": "v1"
}
] | 2023-11-09 | [
[
"Nguyen",
"Tuan Thanh",
""
],
[
"Cai",
"Kui",
""
],
[
"Siegel",
"Paul H.",
""
]
] | The problem of correcting deletions and insertions has recently received significantly increased attention due to the DNA-based data storage technology, which suffers from deletions and insertions with extremely high probability. In this work, we study the problem of constructing non-binary burst-deletion/insertion cor... |
2003.04339 | Zhishuai Guo | Zhishuai Guo, Yan Yan and Tianbao Yang | Revisiting SGD with Increasingly Weighted Averaging: Optimization and
Generalization Perspectives | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Stochastic gradient descent (SGD) has been widely studied in the literature
from different angles, and is commonly employed for solving many big data
machine learning problems. However, the averaging technique, which combines all
iterative solutions into a single solution, is still under-explored. While some
increasi... | [
{
"created": "Mon, 9 Mar 2020 18:14:00 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Apr 2020 03:07:15 GMT",
"version": "v2"
},
{
"created": "Wed, 27 May 2020 01:21:16 GMT",
"version": "v3"
}
] | 2020-05-28 | [
[
"Guo",
"Zhishuai",
""
],
[
"Yan",
"Yan",
""
],
[
"Yang",
"Tianbao",
""
]
] | Stochastic gradient descent (SGD) has been widely studied in the literature from different angles, and is commonly employed for solving many big data machine learning problems. However, the averaging technique, which combines all iterative solutions into a single solution, is still under-explored. While some increasing... |
2312.11062 | Frank Mtumbuka | Frank Mtumbuka and Steven Schockaert | Entity or Relation Embeddings? An Analysis of Encoding Strategies for
Relation Extraction | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Relation extraction is essentially a text classification problem, which can
be tackled by fine-tuning a pre-trained language model (LM). However, a key
challenge arises from the fact that relation extraction cannot
straightforwardly be reduced to sequence or token classification. Existing
approaches therefore solve t... | [
{
"created": "Mon, 18 Dec 2023 09:58:19 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Mtumbuka",
"Frank",
""
],
[
"Schockaert",
"Steven",
""
]
] | Relation extraction is essentially a text classification problem, which can be tackled by fine-tuning a pre-trained language model (LM). However, a key challenge arises from the fact that relation extraction cannot straightforwardly be reduced to sequence or token classification. Existing approaches therefore solve the... |
2203.15480 | Yuwen Deng | Yuwen Deng, Donghai Guan, Yanyu Chen, Weiwei Yuan, Jiemin Ji,
Mingqiang Wei | SAR-ShipNet: SAR-Ship Detection Neural Network via Bidirectional
Coordinate Attention and Multi-resolution Feature Fusion | This paper was accepted by the International Conference on Acoustics,
Speech, and Signal Processing(ICASSP) 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies a practically meaningful ship detection problem from
synthetic aperture radar (SAR) images by the neural network. We broadly extract
different types of SAR image features and raise the intriguing question that
whether these extracted features are beneficial to (1) suppress data variations
(e.g., co... | [
{
"created": "Tue, 29 Mar 2022 12:27:04 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Deng",
"Yuwen",
""
],
[
"Guan",
"Donghai",
""
],
[
"Chen",
"Yanyu",
""
],
[
"Yuan",
"Weiwei",
""
],
[
"Ji",
"Jiemin",
""
],
[
"Wei",
"Mingqiang",
""
]
] | This paper studies a practically meaningful ship detection problem from synthetic aperture radar (SAR) images by the neural network. We broadly extract different types of SAR image features and raise the intriguing question that whether these extracted features are beneficial to (1) suppress data variations (e.g., comp... |
2011.05354 | Maxime Mulamba Ke Tchomba | Maxime Mulamba, Jayanta Mandi, Michelangelo Diligenti, Michele
Lombardi, Victor Bucarey, Tias Guns | Contrastive Losses and Solution Caching for Predict-and-Optimize | Accepted at IJCAI2021 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many decision-making processes involve solving a combinatorial optimization
problem with uncertain input that can be estimated from historic data.
Recently, problems in this class have been successfully addressed via
end-to-end learning approaches, which rely on solving one optimization problem
for each training inst... | [
{
"created": "Tue, 10 Nov 2020 19:09:12 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Jul 2021 10:39:33 GMT",
"version": "v2"
}
] | 2021-07-07 | [
[
"Mulamba",
"Maxime",
""
],
[
"Mandi",
"Jayanta",
""
],
[
"Diligenti",
"Michelangelo",
""
],
[
"Lombardi",
"Michele",
""
],
[
"Bucarey",
"Victor",
""
],
[
"Guns",
"Tias",
""
]
] | Many decision-making processes involve solving a combinatorial optimization problem with uncertain input that can be estimated from historic data. Recently, problems in this class have been successfully addressed via end-to-end learning approaches, which rely on solving one optimization problem for each training instan... |
1709.04421 | Gerg\"o Barany | Gerg\"o Barany | Liveness-Driven Random Program Generation | Pre-proceedings paper presented at the 27th International Symposium
on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur,
Belgium, 10-12 October 2017 (arXiv:1708.07854) | null | null | LOPSTR/2017/6 | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Randomly generated programs are popular for testing compilers and program
analysis tools, with hundreds of bugs in real-world C compilers found by random
testing. However, existing random program generators may generate large amounts
of dead code (computations whose result is never used). This leaves relatively
littl... | [
{
"created": "Wed, 13 Sep 2017 17:06:10 GMT",
"version": "v1"
}
] | 2017-09-14 | [
[
"Barany",
"Gergö",
""
]
] | Randomly generated programs are popular for testing compilers and program analysis tools, with hundreds of bugs in real-world C compilers found by random testing. However, existing random program generators may generate large amounts of dead code (computations whose result is never used). This leaves relatively little ... |
1804.02245 | Christian Torrero | Christian Torrero, Carlo Caprini and Daniele Miorandi | A Wikipedia-based approach to profiling activities on social media | 8 pages, 5 figures - Work presented at the WikiWorkshop2018 during
the Web Conference 2018 hosted in Lyon (France) from April 23 till April 27 | null | null | null | cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online user profiling is a very active research field, catalyzing great
interest by both scientists and practitioners. In this paper, in particular, we
look at approaches able to mine social media activities of users to create a
rich user profile. We look at the case in which the profiling is meant to
characterize th... | [
{
"created": "Fri, 6 Apr 2018 13:06:13 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Apr 2018 08:59:23 GMT",
"version": "v2"
},
{
"created": "Wed, 26 Sep 2018 16:34:40 GMT",
"version": "v3"
}
] | 2018-09-27 | [
[
"Torrero",
"Christian",
""
],
[
"Caprini",
"Carlo",
""
],
[
"Miorandi",
"Daniele",
""
]
] | Online user profiling is a very active research field, catalyzing great interest by both scientists and practitioners. In this paper, in particular, we look at approaches able to mine social media activities of users to create a rich user profile. We look at the case in which the profiling is meant to characterize the ... |
2105.01400 | Iftach Haitner | Itay Berman and Iftach Haitner and Aris Tentes | Coin Flipping of \emph{Any} Constant Bias Implies One-Way Functions | This is the final draft of this paper. The full version was published
in the Journal of the ACM 2018. An extended abstract of this work appeared in
the proceedings of STOC 2014 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the existence of a coin-flipping protocol safe against
\emph{any} non-trivial constant bias (\eg $.499$) implies the existence of
one-way functions. This improves upon a recent result of Haitner and Omri [FOCS
'11], who proved this implication for protocols with bias $\frac{\sqrt2 -1}2 -
o(1) \approx .20... | [
{
"created": "Tue, 4 May 2021 10:26:22 GMT",
"version": "v1"
}
] | 2021-05-05 | [
[
"Berman",
"Itay",
""
],
[
"Haitner",
"Iftach",
""
],
[
"Tentes",
"Aris",
""
]
] | We show that the existence of a coin-flipping protocol safe against \emph{any} non-trivial constant bias (\eg $.499$) implies the existence of one-way functions. This improves upon a recent result of Haitner and Omri [FOCS '11], who proved this implication for protocols with bias $\frac{\sqrt2 -1}2 - o(1) \approx .207$... |
2302.13279 | Xingchao Yang | Xingchao Yang, Takafumi Taketomi, Yoshihiro Kanamori | Makeup Extraction of 3D Representation via Illumination-Aware Image
Decomposition | Eurographics 2023 | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Facial makeup enriches the beauty of not only real humans but also virtual
characters; therefore, makeup for 3D facial models is highly in demand in
productions. However, painting directly on 3D faces and capturing real-world
makeup are costly, and extracting makeup from 2D images often struggles with
shading effects... | [
{
"created": "Sun, 26 Feb 2023 09:48:57 GMT",
"version": "v1"
}
] | 2023-02-28 | [
[
"Yang",
"Xingchao",
""
],
[
"Taketomi",
"Takafumi",
""
],
[
"Kanamori",
"Yoshihiro",
""
]
] | Facial makeup enriches the beauty of not only real humans but also virtual characters; therefore, makeup for 3D facial models is highly in demand in productions. However, painting directly on 3D faces and capturing real-world makeup are costly, and extracting makeup from 2D images often struggles with shading effects a... |
2211.06569 | Xiaoqing Tan | Xiaoqing Tan, Zhengling Qi, Christopher W. Seymour, Lu Tang | RISE: Robust Individualized Decision Learning with Sensitive Variables | Accepted at NeurIPS 2022 | null | null | null | cs.LG stat.AP stat.ME stat.ML | http://creativecommons.org/licenses/by/4.0/ | This paper introduces RISE, a robust individualized decision learning
framework with sensitive variables, where sensitive variables are collectible
data and important to the intervention decision, but their inclusion in
decision making is prohibited due to reasons such as delayed availability or
fairness concerns. A ... | [
{
"created": "Sat, 12 Nov 2022 04:31:38 GMT",
"version": "v1"
}
] | 2022-11-15 | [
[
"Tan",
"Xiaoqing",
""
],
[
"Qi",
"Zhengling",
""
],
[
"Seymour",
"Christopher W.",
""
],
[
"Tang",
"Lu",
""
]
] | This paper introduces RISE, a robust individualized decision learning framework with sensitive variables, where sensitive variables are collectible data and important to the intervention decision, but their inclusion in decision making is prohibited due to reasons such as delayed availability or fairness concerns. A na... |
1811.07999 | Steven Kommrusch | Steve Kommrusch and Louis-No\"el Pouchet | Synthetic Lung Nodule 3D Image Generation Using Autoencoders | 19 pages, 12 figures, full paper for work initially presented at
IJCAI 2018 | null | null | CS-18-101 | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the challenges of using machine learning techniques with medical data
is the frequent dearth of source image data on which to train. A representative
example is automated lung cancer diagnosis, where nodule images need to be
classified as suspicious or benign. In this work we propose an automatic
synthetic lun... | [
{
"created": "Mon, 19 Nov 2018 21:51:38 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Dec 2018 05:58:20 GMT",
"version": "v2"
},
{
"created": "Mon, 9 Sep 2019 05:58:21 GMT",
"version": "v3"
}
] | 2019-09-10 | [
[
"Kommrusch",
"Steve",
""
],
[
"Pouchet",
"Louis-Noël",
""
]
] | One of the challenges of using machine learning techniques with medical data is the frequent dearth of source image data on which to train. A representative example is automated lung cancer diagnosis, where nodule images need to be classified as suspicious or benign. In this work we propose an automatic synthetic lung ... |
2010.14432 | Edon Kelmendi | Shaull Almagor, Toghrul Karimov, Edon Kelmendi, J\"oel Ouaknine, James
Worrell | Deciding $\omega$-Regular Properties on Linear Recurrence Sequences | null | null | null | null | cs.LO cs.FL cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of deciding $\omega$-regular properties on infinite
traces produced by linear loops. Here we think of a given loop as producing a
single infinite trace that encodes information about the signs of program
variables at each time step. Formally, our main result is a procedure that
inputs a prefix... | [
{
"created": "Tue, 27 Oct 2020 16:49:14 GMT",
"version": "v1"
}
] | 2020-10-28 | [
[
"Almagor",
"Shaull",
""
],
[
"Karimov",
"Toghrul",
""
],
[
"Kelmendi",
"Edon",
""
],
[
"Ouaknine",
"Jöel",
""
],
[
"Worrell",
"James",
""
]
] | We consider the problem of deciding $\omega$-regular properties on infinite traces produced by linear loops. Here we think of a given loop as producing a single infinite trace that encodes information about the signs of program variables at each time step. Formally, our main result is a procedure that inputs a prefix-i... |
2101.00828 | Le Fang | Le Fang, Tao Zeng, Chaochun Liu, Liefeng Bo, Wen Dong, Changyou Chen | Transformer-based Conditional Variational Autoencoder for Controllable
Story Generation | null | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate large-scale latent variable models (LVMs) for neural story
generation -- an under-explored application for open-domain long text -- with
objectives in two threads: generation effectiveness and controllability. LVMs,
especially the variational autoencoder (VAE), have achieved both effective and
controll... | [
{
"created": "Mon, 4 Jan 2021 08:31:11 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Jul 2021 17:18:13 GMT",
"version": "v2"
}
] | 2021-07-09 | [
[
"Fang",
"Le",
""
],
[
"Zeng",
"Tao",
""
],
[
"Liu",
"Chaochun",
""
],
[
"Bo",
"Liefeng",
""
],
[
"Dong",
"Wen",
""
],
[
"Chen",
"Changyou",
""
]
] | We investigate large-scale latent variable models (LVMs) for neural story generation -- an under-explored application for open-domain long text -- with objectives in two threads: generation effectiveness and controllability. LVMs, especially the variational autoencoder (VAE), have achieved both effective and controllab... |
2308.16599 | Felix Wagner | Felix Wagner and Florian Nachtigall and Lukas Franken and Nikola
Milojevic-Dupont and Rafael H.M. Pereira and Nicolas Koch and Jakob Runge and
Marta Gonzalez and Felix Creutzig | Using machine learning to understand causal relationships between urban
form and travel CO2 emissions across continents | 32 pages, 24 figures, 6 tables | null | null | null | cs.LG physics.soc-ph | http://creativecommons.org/licenses/by-sa/4.0/ | Climate change mitigation in urban mobility requires policies reconfiguring
urban form to increase accessibility and facilitate low-carbon modes of
transport. However, current policy research has insufficiently assessed urban
form effects on car travel at three levels: (1) Causality -- Can causality be
established be... | [
{
"created": "Thu, 31 Aug 2023 09:57:52 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Dec 2023 13:37:42 GMT",
"version": "v2"
}
] | 2023-12-18 | [
[
"Wagner",
"Felix",
""
],
[
"Nachtigall",
"Florian",
""
],
[
"Franken",
"Lukas",
""
],
[
"Milojevic-Dupont",
"Nikola",
""
],
[
"Pereira",
"Rafael H. M.",
""
],
[
"Koch",
"Nicolas",
""
],
[
"Runge",
"Jakob",
... | Climate change mitigation in urban mobility requires policies reconfiguring urban form to increase accessibility and facilitate low-carbon modes of transport. However, current policy research has insufficiently assessed urban form effects on car travel at three levels: (1) Causality -- Can causality be established beyo... |
1312.0686 | Yong Wang | Yong Wang | A Process Algebra for Games | 24 pages, 16 figures | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using formal tools in computer science to describe games is an interesting
problem. We give games, exactly two person games, an axiomatic foundation based
on the process algebra ACP (Algebra of Communicating Process). A fresh operator
called opponent's alternative composition operator (OA) is introduced into ACP
to d... | [
{
"created": "Tue, 3 Dec 2013 02:59:47 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Apr 2014 03:35:00 GMT",
"version": "v2"
},
{
"created": "Sun, 4 May 2014 04:21:19 GMT",
"version": "v3"
},
{
"created": "Mon, 13 Jul 2015 07:57:27 GMT",
"version": "v4"
},
{
"crea... | 2019-05-09 | [
[
"Wang",
"Yong",
""
]
] | Using formal tools in computer science to describe games is an interesting problem. We give games, exactly two person games, an axiomatic foundation based on the process algebra ACP (Algebra of Communicating Process). A fresh operator called opponent's alternative composition operator (OA) is introduced into ACP to des... |
1509.06947 | Gilles Puy | Gilles Puy and Mike Davies and R\'emi Gribonval | Recipes for stable linear embeddings from Hilbert spaces to R^m | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of constructing a linear map from a Hilbert space
$\mathcal{H}$ (possibly infinite dimensional) to $\mathbb{R}^m$ that satisfies
a restricted isometry property (RIP) on an arbitrary signal model $\mathcal{S}
\subset \mathcal{H}$. We present a generic framework that handles a large class
of low... | [
{
"created": "Wed, 23 Sep 2015 12:49:16 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Jan 2017 12:41:29 GMT",
"version": "v2"
}
] | 2017-01-18 | [
[
"Puy",
"Gilles",
""
],
[
"Davies",
"Mike",
""
],
[
"Gribonval",
"Rémi",
""
]
] | We consider the problem of constructing a linear map from a Hilbert space $\mathcal{H}$ (possibly infinite dimensional) to $\mathbb{R}^m$ that satisfies a restricted isometry property (RIP) on an arbitrary signal model $\mathcal{S} \subset \mathcal{H}$. We present a generic framework that handles a large class of low-d... |
2210.07415 | Negar Mokhberian | Negar Mokhberian, Frederic R. Hopp, Bahareh Harandizadeh, Fred
Morstatter, Kristina Lerman | Noise Audits Improve Moral Foundation Classification | null | null | null | null | cs.CL cs.CY | http://creativecommons.org/licenses/by/4.0/ | Morality plays an important role in culture, identity, and emotion. Recent
advances in natural language processing have shown that it is possible to
classify moral values expressed in text at scale. Morality classification
relies on human annotators to label the moral expressions in text, which
provides training data... | [
{
"created": "Thu, 13 Oct 2022 23:37:47 GMT",
"version": "v1"
}
] | 2022-10-17 | [
[
"Mokhberian",
"Negar",
""
],
[
"Hopp",
"Frederic R.",
""
],
[
"Harandizadeh",
"Bahareh",
""
],
[
"Morstatter",
"Fred",
""
],
[
"Lerman",
"Kristina",
""
]
] | Morality plays an important role in culture, identity, and emotion. Recent advances in natural language processing have shown that it is possible to classify moral values expressed in text at scale. Morality classification relies on human annotators to label the moral expressions in text, which provides training data t... |
1706.00498 | Karan Maheshwari | Karan Maheshwari, Nalini N | Facial Recognition Enabled Smart Door Using Microsoft Face API | 4 pages, 5 figures, published with International Journal of
Engineering Trends and Applications | IJETA V4(3): Page(1-4) May - Jun 2017. ISSN: 2393-9516
http://www.ijetajournal.org. Published by Eighth Sense Research Group | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Privacy and Security are two universal rights and, to ensure that in our
daily life we are secure, a lot of research is going on in the field of home
security, and IoT is the turning point for the industry, where we connect
everyday objects to share data for our betterment. Facial recognition is a
well-established pr... | [
{
"created": "Mon, 29 May 2017 16:29:09 GMT",
"version": "v1"
}
] | 2017-06-05 | [
[
"Maheshwari",
"Karan",
""
],
[
"N",
"Nalini",
""
]
] | Privacy and Security are two universal rights and, to ensure that in our daily life we are secure, a lot of research is going on in the field of home security, and IoT is the turning point for the industry, where we connect everyday objects to share data for our betterment. Facial recognition is a well-established proc... |
2310.00108 | Myeongseob Ko | Myeongseob Ko, Ming Jin, Chenguang Wang, and Ruoxi Jia | Practical Membership Inference Attacks Against Large-Scale Multi-Modal
Models: A Pilot Study | International Conference on Computer Vision (ICCV) 2023 | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Membership inference attacks (MIAs) aim to infer whether a data point has
been used to train a machine learning model. These attacks can be employed to
identify potential privacy vulnerabilities and detect unauthorized use of
personal data. While MIAs have been traditionally studied for simple
classification models, ... | [
{
"created": "Fri, 29 Sep 2023 19:38:40 GMT",
"version": "v1"
}
] | 2023-10-03 | [
[
"Ko",
"Myeongseob",
""
],
[
"Jin",
"Ming",
""
],
[
"Wang",
"Chenguang",
""
],
[
"Jia",
"Ruoxi",
""
]
] | Membership inference attacks (MIAs) aim to infer whether a data point has been used to train a machine learning model. These attacks can be employed to identify potential privacy vulnerabilities and detect unauthorized use of personal data. While MIAs have been traditionally studied for simple classification models, re... |
1710.11248 | Justin Fu | Justin Fu, Katie Luo, Sergey Levine | Learning Robust Rewards with Adversarial Inverse Reinforcement Learning | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning provides a powerful and general framework for decision
making and control, but its application in practice is often hindered by the
need for extensive feature and reward engineering. Deep reinforcement learning
methods can remove the need for explicit engineering of policy or value
features, bu... | [
{
"created": "Mon, 30 Oct 2017 21:22:28 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Aug 2018 18:33:24 GMT",
"version": "v2"
}
] | 2018-08-15 | [
[
"Fu",
"Justin",
""
],
[
"Luo",
"Katie",
""
],
[
"Levine",
"Sergey",
""
]
] | Reinforcement learning provides a powerful and general framework for decision making and control, but its application in practice is often hindered by the need for extensive feature and reward engineering. Deep reinforcement learning methods can remove the need for explicit engineering of policy or value features, but ... |
2206.03483 | Martin Gauch | Martin Gauch, Maximilian Beck, Thomas Adler, Dmytro Kotsur, Stefan
Fiel, Hamid Eghbal-zadeh, Johannes Brandstetter, Johannes Kofler, Markus
Holzleitner, Werner Zellinger, Daniel Klotz, Sepp Hochreiter, Sebastian
Lehner | Few-Shot Learning by Dimensionality Reduction in Gradient Space | Accepted at Conference on Lifelong Learning Agents (CoLLAs) 2022.
Code: https://github.com/ml-jku/subgd Blog post:
https://ml-jku.github.io/subgd | Proceedings of The 1st Conference on Lifelong Learning Agents,
PMLR 199:1043-1064 (2022) | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce SubGD, a novel few-shot learning method which is based on the
recent finding that stochastic gradient descent updates tend to live in a
low-dimensional parameter subspace. In experimental and theoretical analyses,
we show that models confined to a suitable predefined subspace generalize well
for few-shot... | [
{
"created": "Tue, 7 Jun 2022 17:58:35 GMT",
"version": "v1"
}
] | 2023-01-30 | [
[
"Gauch",
"Martin",
""
],
[
"Beck",
"Maximilian",
""
],
[
"Adler",
"Thomas",
""
],
[
"Kotsur",
"Dmytro",
""
],
[
"Fiel",
"Stefan",
""
],
[
"Eghbal-zadeh",
"Hamid",
""
],
[
"Brandstetter",
"Johannes",
""
],... | We introduce SubGD, a novel few-shot learning method which is based on the recent finding that stochastic gradient descent updates tend to live in a low-dimensional parameter subspace. In experimental and theoretical analyses, we show that models confined to a suitable predefined subspace generalize well for few-shot l... |
2104.10865 | Shin Yoo Dr | Jinhan Kim, Juyoung Jeon, Shin Hong, Shin Yoo | Predictive Mutation Analysis via Natural Language Channel in Source Code | null | null | 10.1145/3510417 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mutation analysis can provide valuable insights into both System Under Test
(SUT) and its test suite. However, it is not scalable due to the cost of
building and testing a large number of mutants. Predictive Mutation Testing
(PMT) has been proposed to reduce the cost of mutation testing, but it can only
provide stati... | [
{
"created": "Thu, 22 Apr 2021 05:09:43 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Jan 2022 02:33:16 GMT",
"version": "v2"
}
] | 2022-09-15 | [
[
"Kim",
"Jinhan",
""
],
[
"Jeon",
"Juyoung",
""
],
[
"Hong",
"Shin",
""
],
[
"Yoo",
"Shin",
""
]
] | Mutation analysis can provide valuable insights into both System Under Test (SUT) and its test suite. However, it is not scalable due to the cost of building and testing a large number of mutants. Predictive Mutation Testing (PMT) has been proposed to reduce the cost of mutation testing, but it can only provide statist... |
2308.01218 | Manuel Valle Torre | Manuel Valle Torre, Catharine Oertel, Marcus Specht | The Sequence Matters in Learning -- A Systematic Literature Review | This version is for personal use and not for redistribution. The
final version was published as part of the proceedings of the 14th Learning
Analytics and Knowledge Conference (LAK '24). March 18--22, 2024, Kyoto,
Japan | null | 10.1145/3636555.3636880 | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Describing and analysing learner behaviour using sequential data and analysis
is becoming more and more popular in Learning Analytics. Nevertheless, we found
a variety of definitions of learning sequences, as well as choices regarding
data aggregation and the methods implemented for analysis. Furthermore,
sequences a... | [
{
"created": "Wed, 2 Aug 2023 15:22:01 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Dec 2023 18:04:35 GMT",
"version": "v2"
}
] | 2023-12-13 | [
[
"Torre",
"Manuel Valle",
""
],
[
"Oertel",
"Catharine",
""
],
[
"Specht",
"Marcus",
""
]
] | Describing and analysing learner behaviour using sequential data and analysis is becoming more and more popular in Learning Analytics. Nevertheless, we found a variety of definitions of learning sequences, as well as choices regarding data aggregation and the methods implemented for analysis. Furthermore, sequences are... |
2211.16199 | Haitz S\'aez de Oc\'ariz Borde | Haitz S\'aez de Oc\'ariz Borde, Anees Kazi, Federico Barbero, Pietro
Li\`o | Latent Graph Inference using Product Manifolds | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Graph Neural Networks usually rely on the assumption that the graph topology
is available to the network as well as optimal for the downstream task. Latent
graph inference allows models to dynamically learn the intrinsic graph
structure of problems where the connectivity patterns of data may not be
directly accessibl... | [
{
"created": "Sat, 26 Nov 2022 22:13:06 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Apr 2023 21:50:38 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Jun 2023 17:17:50 GMT",
"version": "v3"
}
] | 2023-06-28 | [
[
"Borde",
"Haitz Sáez de Ocáriz",
""
],
[
"Kazi",
"Anees",
""
],
[
"Barbero",
"Federico",
""
],
[
"Liò",
"Pietro",
""
]
] | Graph Neural Networks usually rely on the assumption that the graph topology is available to the network as well as optimal for the downstream task. Latent graph inference allows models to dynamically learn the intrinsic graph structure of problems where the connectivity patterns of data may not be directly accessible.... |
2403.02372 | Babak Salimi | Alireza Pirhadi, Mohammad Hossein Moslemi, Alexander Cloninger,
Mostafa Milani, Babak Salimi | OTClean: Data Cleaning for Conditional Independence Violations using
Optimal Transport | null | null | null | null | cs.LG cs.AI cs.DB | http://creativecommons.org/licenses/by/4.0/ | Ensuring Conditional Independence (CI) constraints is pivotal for the
development of fair and trustworthy machine learning models. In this paper, we
introduce \sys, a framework that harnesses optimal transport theory for data
repair under CI constraints. Optimal transport theory provides a rigorous
framework for meas... | [
{
"created": "Mon, 4 Mar 2024 18:23:55 GMT",
"version": "v1"
}
] | 2024-03-06 | [
[
"Pirhadi",
"Alireza",
""
],
[
"Moslemi",
"Mohammad Hossein",
""
],
[
"Cloninger",
"Alexander",
""
],
[
"Milani",
"Mostafa",
""
],
[
"Salimi",
"Babak",
""
]
] | Ensuring Conditional Independence (CI) constraints is pivotal for the development of fair and trustworthy machine learning models. In this paper, we introduce \sys, a framework that harnesses optimal transport theory for data repair under CI constraints. Optimal transport theory provides a rigorous framework for measur... |
2209.15147 | Zhibin Zou | Zhibin Zou | Optimizing towards the best insertion-based error-tolerating joints | null | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an optimization-based design process that can generate the best
insertion-based joints with respect to different errors, including manipulation
error, manufacturing error, and sensing error. We separate the analysis into
two stages, the insertion and the after-insertion stability. Each sub-process
is discr... | [
{
"created": "Fri, 30 Sep 2022 00:21:33 GMT",
"version": "v1"
},
{
"created": "Fri, 11 Nov 2022 14:44:12 GMT",
"version": "v2"
}
] | 2022-11-14 | [
[
"Zou",
"Zhibin",
""
]
] | We present an optimization-based design process that can generate the best insertion-based joints with respect to different errors, including manipulation error, manufacturing error, and sensing error. We separate the analysis into two stages, the insertion and the after-insertion stability. Each sub-process is discret... |
1204.6364 | Rushdi Shams Mr | Rushdi Shams, Adel Elsayed, Quazi Mah-Zereen Akter | A Corpus-based Evaluation of a Domain-specific Text to Knowledge Mapping
Prototype | Journal of Computers, Academy Publishers 2010 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/3.0/ | The aim of this paper is to evaluate a Text to Knowledge Mapping (TKM)
Prototype. The prototype is domain-specific, the purpose of which is to map
instructional text onto a knowledge domain. The context of the knowledge domain
is DC electrical circuit. During development, the prototype has been tested
with a limited ... | [
{
"created": "Sat, 28 Apr 2012 03:52:21 GMT",
"version": "v1"
}
] | 2012-05-01 | [
[
"Shams",
"Rushdi",
""
],
[
"Elsayed",
"Adel",
""
],
[
"Akter",
"Quazi Mah-Zereen",
""
]
] | The aim of this paper is to evaluate a Text to Knowledge Mapping (TKM) Prototype. The prototype is domain-specific, the purpose of which is to map instructional text onto a knowledge domain. The context of the knowledge domain is DC electrical circuit. During development, the prototype has been tested with a limited da... |
2401.12866 | Jeremias D\"otterl | Ralf Bruns, Jeremias D\"otterl, J\"urgen Dunkel, Sascha Ossowski | Evaluating Collaborative and Autonomous Agents in Data-Stream-Supported
Coordination of Mobile Crowdsourcing | null | Sensors 2023, 23(2), 614 | 10.3390/s23020614 | null | cs.AI cs.LG cs.MA | http://creativecommons.org/licenses/by/4.0/ | Mobile crowdsourcing refers to systems where the completion of tasks
necessarily requires physical movement of crowdworkers in an on-demand
workforce. Evidence suggests that in such systems, tasks often get assigned to
crowdworkers who struggle to complete those tasks successfully, resulting in
high failure rates and... | [
{
"created": "Tue, 23 Jan 2024 16:00:45 GMT",
"version": "v1"
}
] | 2024-01-24 | [
[
"Bruns",
"Ralf",
""
],
[
"Dötterl",
"Jeremias",
""
],
[
"Dunkel",
"Jürgen",
""
],
[
"Ossowski",
"Sascha",
""
]
] | Mobile crowdsourcing refers to systems where the completion of tasks necessarily requires physical movement of crowdworkers in an on-demand workforce. Evidence suggests that in such systems, tasks often get assigned to crowdworkers who struggle to complete those tasks successfully, resulting in high failure rates and l... |
1209.4405 | You Qingshan | Qingshan You and Qun Wan and Yipeng Liu | Strongly Convex Programming for Principal Component Pursuit | 10 pages | null | null | null | cs.IT math.IT math.NA | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In this paper, we address strongly convex programming for princi- pal
component pursuit with reduced linear measurements, which decomposes a
superposition of a low-rank matrix and a sparse matrix from a small set of
linear measurements. We first provide sufficient conditions under which the
strongly convex models lea... | [
{
"created": "Thu, 20 Sep 2012 01:37:26 GMT",
"version": "v1"
}
] | 2012-09-21 | [
[
"You",
"Qingshan",
""
],
[
"Wan",
"Qun",
""
],
[
"Liu",
"Yipeng",
""
]
] | In this paper, we address strongly convex programming for princi- pal component pursuit with reduced linear measurements, which decomposes a superposition of a low-rank matrix and a sparse matrix from a small set of linear measurements. We first provide sufficient conditions under which the strongly convex models lead ... |
1608.06787 | Natasha Alechina | Natasha Alechina, Mehdi Dastani, and Brian Logan | Expressibility of norms in temporal logic | 3 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this short note we address the issue of expressing norms (such as
obligations and prohibitions) in temporal logic. In particular, we address the
argument from [Governatori 2015] that norms cannot be expressed in Linear Time
Temporal Logic (LTL).
| [
{
"created": "Wed, 24 Aug 2016 12:01:36 GMT",
"version": "v1"
}
] | 2016-08-25 | [
[
"Alechina",
"Natasha",
""
],
[
"Dastani",
"Mehdi",
""
],
[
"Logan",
"Brian",
""
]
] | In this short note we address the issue of expressing norms (such as obligations and prohibitions) in temporal logic. In particular, we address the argument from [Governatori 2015] that norms cannot be expressed in Linear Time Temporal Logic (LTL). |
2009.06389 | Sahib Singh | Tom Farrand, Fatemehsadat Mireshghallah, Sahib Singh, Andrew Trask | Neither Private Nor Fair: Impact of Data Imbalance on Utility and
Fairness in Differential Privacy | 5 pages, 5 figures | null | null | null | cs.LG cs.AI cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deployment of deep learning in different fields and industries is growing day
by day due to its performance, which relies on the availability of data and
compute. Data is often crowd-sourced and contains sensitive information about
its contributors, which leaks into models that are trained on it. To achieve
rigorous ... | [
{
"created": "Thu, 10 Sep 2020 18:35:49 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Sep 2020 16:00:29 GMT",
"version": "v2"
},
{
"created": "Sat, 3 Oct 2020 11:55:05 GMT",
"version": "v3"
}
] | 2020-10-06 | [
[
"Farrand",
"Tom",
""
],
[
"Mireshghallah",
"Fatemehsadat",
""
],
[
"Singh",
"Sahib",
""
],
[
"Trask",
"Andrew",
""
]
] | Deployment of deep learning in different fields and industries is growing day by day due to its performance, which relies on the availability of data and compute. Data is often crowd-sourced and contains sensitive information about its contributors, which leaks into models that are trained on it. To achieve rigorous pr... |
2107.02153 | Jungsoo Park | Jungsoo Park, Sewon Min, Jaewoo Kang, Luke Zettlemoyer, Hannaneh
Hajishirzi | FaVIQ: FAct Verification from Information-seeking Questions | ACL 2022(long). Data & Code available at https://faviq.github.io | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Despite significant interest in developing general purpose fact checking
models, it is challenging to construct a large-scale fact verification dataset
with realistic real-world claims. Existing claims are either authored by
crowdworkers, thereby introducing subtle biases that are difficult to control
for, or manuall... | [
{
"created": "Mon, 5 Jul 2021 17:31:44 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Mar 2022 07:38:56 GMT",
"version": "v2"
}
] | 2022-03-16 | [
[
"Park",
"Jungsoo",
""
],
[
"Min",
"Sewon",
""
],
[
"Kang",
"Jaewoo",
""
],
[
"Zettlemoyer",
"Luke",
""
],
[
"Hajishirzi",
"Hannaneh",
""
]
] | Despite significant interest in developing general purpose fact checking models, it is challenging to construct a large-scale fact verification dataset with realistic real-world claims. Existing claims are either authored by crowdworkers, thereby introducing subtle biases that are difficult to control for, or manually ... |
2203.11938 | Vladislav Golyanik | Navami Kairanda and Edith Tretschk and Mohamed Elgharib and Christian
Theobalt and Vladislav Golyanik | {\phi}-SfT: Shape-from-Template with a Physics-Based Deformation Model | 11 pages, 8 figures and one table; Computer Vision and Pattern
Recognition (CVPR) 2022 | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Shape-from-Template (SfT) methods estimate 3D surface deformations from a
single monocular RGB camera while assuming a 3D state known in advance (a
template). This is an important yet challenging problem due to the
under-constrained nature of the monocular setting. Existing SfT techniques
predominantly use geometric ... | [
{
"created": "Tue, 22 Mar 2022 17:59:57 GMT",
"version": "v1"
}
] | 2022-03-23 | [
[
"Kairanda",
"Navami",
""
],
[
"Tretschk",
"Edith",
""
],
[
"Elgharib",
"Mohamed",
""
],
[
"Theobalt",
"Christian",
""
],
[
"Golyanik",
"Vladislav",
""
]
] | Shape-from-Template (SfT) methods estimate 3D surface deformations from a single monocular RGB camera while assuming a 3D state known in advance (a template). This is an important yet challenging problem due to the under-constrained nature of the monocular setting. Existing SfT techniques predominantly use geometric an... |
2104.05999 | Pieter Boom | Pieter D. Boom, Ashley Seepujak, Odysseas Kosmas, Lee Margetts and
Andrey Jivkov | Parallelized Discrete Exterior Calculus for Three-Dimensional Elliptic
Problems | null | null | 10.1016/j.cpc.2022.108456 | null | cs.MS physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A formulation of elliptic boundary value problems is used to develop the
first discrete exterior calculus (DEC) library for massively parallel
computations with 3D domains. This can be used for steady-state analysis of any
physical process driven by the gradient of a scalar quantity, e.g. temperature,
concentration, ... | [
{
"created": "Tue, 13 Apr 2021 08:06:48 GMT",
"version": "v1"
}
] | 2022-07-20 | [
[
"Boom",
"Pieter D.",
""
],
[
"Seepujak",
"Ashley",
""
],
[
"Kosmas",
"Odysseas",
""
],
[
"Margetts",
"Lee",
""
],
[
"Jivkov",
"Andrey",
""
]
] | A formulation of elliptic boundary value problems is used to develop the first discrete exterior calculus (DEC) library for massively parallel computations with 3D domains. This can be used for steady-state analysis of any physical process driven by the gradient of a scalar quantity, e.g. temperature, concentration, pr... |
1108.4478 | Mehdi Karimi | Mehdi Karimi and Amir H. Banihashemi | An Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an efficient algorithm for finding the dominant trapping
sets of a low-density parity-check (LDPC) code. The algorithm can be used to
estimate the error floor of LDPC codes or to be part of the apparatus to design
LDPC codes with low error floors. For regular codes, the algorithm is initiated
with... | [
{
"created": "Tue, 23 Aug 2011 02:17:45 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Apr 2012 18:58:38 GMT",
"version": "v2"
}
] | 2012-04-16 | [
[
"Karimi",
"Mehdi",
""
],
[
"Banihashemi",
"Amir H.",
""
]
] | This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. The algorithm can be used to estimate the error floor of LDPC codes or to be part of the apparatus to design LDPC codes with low error floors. For regular codes, the algorithm is initiated with a... |
2304.11087 | Ebenezer Isaac | Ebenezer R. H. P. Isaac and Jim Reno | AI Product Security: A Primer for Developers | 10 pages, 1 figure | null | null | null | cs.CR cs.AI | http://creativecommons.org/licenses/by/4.0/ | Not too long ago, AI security used to mean the research and practice of how
AI can empower cybersecurity, that is, AI for security. Ever since Ian
Goodfellow and his team popularized adversarial attacks on machine learning,
security for AI became an important concern and also part of AI security. It is
imperative to ... | [
{
"created": "Tue, 18 Apr 2023 05:22:34 GMT",
"version": "v1"
}
] | 2023-04-24 | [
[
"Isaac",
"Ebenezer R. H. P.",
""
],
[
"Reno",
"Jim",
""
]
] | Not too long ago, AI security used to mean the research and practice of how AI can empower cybersecurity, that is, AI for security. Ever since Ian Goodfellow and his team popularized adversarial attacks on machine learning, security for AI became an important concern and also part of AI security. It is imperative to un... |
2212.04242 | Olesya Mryglod | Olesya Mryglod | One for all and all for one: on the role of a conference in a
scientist's life | 9 pages, 5 figures, 2 tables | Condensed Matter Physics, 2023, vol. 26, No. 1, 13801 | 10.5488/CMP.26.13801 | null | cs.DL physics.soc-ph | http://creativecommons.org/licenses/by/4.0/ | The quantitative description of the scientific conference MECO (Middle
European Cooperation in Statistical Physics) based on bibliographic records is
presented in the paper. Statistics of contributions and participants,
co-authorship patterns at the levels of authors and countries, typical
proportions of newcomers an... | [
{
"created": "Thu, 8 Dec 2022 12:54:28 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Mar 2023 11:05:44 GMT",
"version": "v2"
}
] | 2023-03-07 | [
[
"Mryglod",
"Olesya",
""
]
] | The quantitative description of the scientific conference MECO (Middle European Cooperation in Statistical Physics) based on bibliographic records is presented in the paper. Statistics of contributions and participants, co-authorship patterns at the levels of authors and countries, typical proportions of newcomers and ... |
2308.04026 | Jiaju Lin | Jiaju Lin, Haoran Zhao, Aochi Zhang, Yiting Wu, Huqiuyue Ping, Qin
Chen | AgentSims: An Open-Source Sandbox for Large Language Model Evaluation | submit to EMNLP2023 demo track | null | null | null | cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | With ChatGPT-like large language models (LLM) prevailing in the community,
how to evaluate the ability of LLMs is an open question. Existing evaluation
methods suffer from following shortcomings: (1) constrained evaluation
abilities, (2) vulnerable benchmarks, (3) unobjective metrics. We suggest that
task-based evalu... | [
{
"created": "Tue, 8 Aug 2023 03:59:28 GMT",
"version": "v1"
}
] | 2023-08-09 | [
[
"Lin",
"Jiaju",
""
],
[
"Zhao",
"Haoran",
""
],
[
"Zhang",
"Aochi",
""
],
[
"Wu",
"Yiting",
""
],
[
"Ping",
"Huqiuyue",
""
],
[
"Chen",
"Qin",
""
]
] | With ChatGPT-like large language models (LLM) prevailing in the community, how to evaluate the ability of LLMs is an open question. Existing evaluation methods suffer from following shortcomings: (1) constrained evaluation abilities, (2) vulnerable benchmarks, (3) unobjective metrics. We suggest that task-based evaluat... |
1907.06775 | Lukas Iffl\"ander | Lukas Iffl\"ander, Alexandra Dmitrienko, Christoph Hagen, Michael
Jobst, Samuel Kounev | Hands Off my Database: Ransomware Detection in Databases through Dynamic
Analysis of Query Sequences | null | null | null | null | cs.CR cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ransomware is an emerging threat which imposed a \$ 5 billion loss in 2017
and is predicted to hit \$ 11.5 billion in 2019. While initially targeting PC
(client) platforms, ransomware recently made the leap to server-side databases
- starting in January 2017 with the MongoDB Apocalypse attack, followed by
other attac... | [
{
"created": "Mon, 15 Jul 2019 22:22:38 GMT",
"version": "v1"
}
] | 2019-07-17 | [
[
"Iffländer",
"Lukas",
""
],
[
"Dmitrienko",
"Alexandra",
""
],
[
"Hagen",
"Christoph",
""
],
[
"Jobst",
"Michael",
""
],
[
"Kounev",
"Samuel",
""
]
] | Ransomware is an emerging threat which imposed a \$ 5 billion loss in 2017 and is predicted to hit \$ 11.5 billion in 2019. While initially targeting PC (client) platforms, ransomware recently made the leap to server-side databases - starting in January 2017 with the MongoDB Apocalypse attack, followed by other attack ... |
1911.07107 | He Wang | He Wang, Feixiang He, Zhexi Peng, Yongliang Yang, Tianjia Shao, Kun
Zhou, David Hogg | SMART: Skeletal Motion Action Recognition aTtack | null | null | null | null | cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adversarial attack has inspired great interest in computer vision, by showing
that classification-based solutions are prone to imperceptible attack in many
tasks. In this paper, we propose a method, SMART, to attack action recognizers
which rely on 3D skeletal motions. Our method involves an innovative perceptual
los... | [
{
"created": "Sat, 16 Nov 2019 22:25:29 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Nov 2019 13:15:49 GMT",
"version": "v2"
},
{
"created": "Tue, 10 Mar 2020 13:12:04 GMT",
"version": "v3"
}
] | 2020-03-11 | [
[
"Wang",
"He",
""
],
[
"He",
"Feixiang",
""
],
[
"Peng",
"Zhexi",
""
],
[
"Yang",
"Yongliang",
""
],
[
"Shao",
"Tianjia",
""
],
[
"Zhou",
"Kun",
""
],
[
"Hogg",
"David",
""
]
] | Adversarial attack has inspired great interest in computer vision, by showing that classification-based solutions are prone to imperceptible attack in many tasks. In this paper, we propose a method, SMART, to attack action recognizers which rely on 3D skeletal motions. Our method involves an innovative perceptual loss ... |
2108.03654 | Mohamed Tarek | Mohamed Tarek and Tapabrata Ray | Approximation schemes for stochastic compliance-based topology
optimization with many loading scenarios | arXiv admin note: substantial text overlap with arXiv:2103.04594 | null | 10.1007/s00158-022-03221-0 | null | cs.CE | http://creativecommons.org/licenses/by/4.0/ | In this paper, approximation schemes are proposed for handling load
uncertainty in compliance-based topology optimization problems, where the
uncertainty is described in the form of a set of finitely many loading
scenarios. Efficient approximate methods are proposed to approximately evaluate
and differentiate either ... | [
{
"created": "Sun, 8 Aug 2021 14:39:24 GMT",
"version": "v1"
}
] | 2022-05-03 | [
[
"Tarek",
"Mohamed",
""
],
[
"Ray",
"Tapabrata",
""
]
] | In this paper, approximation schemes are proposed for handling load uncertainty in compliance-based topology optimization problems, where the uncertainty is described in the form of a set of finitely many loading scenarios. Efficient approximate methods are proposed to approximately evaluate and differentiate either 1)... |
2202.09773 | Lige Ding | Lige Ding, Dong Zhao, Zhaofeng Wang, Guang Wang, Chang Tan, Lei Fan
and Huadong Ma | Learning to Help Emergency Vehicles Arrive Faster: A Cooperative
Vehicle-Road Scheduling Approach | 13 pages, 10 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ever-increasing heavy traffic congestion potentially impedes the
accessibility of emergency vehicles (EVs), resulting in detrimental impacts on
critical services and even safety of people's lives. Hence, it is significant
to propose an efficient scheduling approach to help EVs arrive faster. Existing
vehicle-cent... | [
{
"created": "Sun, 20 Feb 2022 10:25:15 GMT",
"version": "v1"
}
] | 2022-02-22 | [
[
"Ding",
"Lige",
""
],
[
"Zhao",
"Dong",
""
],
[
"Wang",
"Zhaofeng",
""
],
[
"Wang",
"Guang",
""
],
[
"Tan",
"Chang",
""
],
[
"Fan",
"Lei",
""
],
[
"Ma",
"Huadong",
""
]
] | The ever-increasing heavy traffic congestion potentially impedes the accessibility of emergency vehicles (EVs), resulting in detrimental impacts on critical services and even safety of people's lives. Hence, it is significant to propose an efficient scheduling approach to help EVs arrive faster. Existing vehicle-centri... |
1401.1882 | YuLi Sun | Yuli Sun and Jinxu Tao | Image reconstruction from few views by L0-norm optimization | 11 pages,5 figures, 1 table | null | 10.1088/1674-1056/23/7/078703 | null | cs.IT cs.CV math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The L1-norm of the gradient-magnitude images (GMI), which is the well-known
total variation (TV) model, is widely used as regularization in the few views
CT reconstruction. As the L1-norm TV regularization is tending to uniformly
penalize the image gradient and the low-contrast structures are sometimes over
smoothed,... | [
{
"created": "Thu, 9 Jan 2014 02:08:06 GMT",
"version": "v1"
}
] | 2019-05-01 | [
[
"Sun",
"Yuli",
""
],
[
"Tao",
"Jinxu",
""
]
] | The L1-norm of the gradient-magnitude images (GMI), which is the well-known total variation (TV) model, is widely used as regularization in the few views CT reconstruction. As the L1-norm TV regularization is tending to uniformly penalize the image gradient and the low-contrast structures are sometimes over smoothed, w... |
1508.03931 | Michael Goodrich | Michael T. Goodrich and Timothy Johnson and Manuel Torres | Knuthian Drawings of Series-Parallel Flowcharts | Full version | null | null | null | cs.CG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inspired by a classic paper by Knuth, we revisit the problem of drawing
flowcharts of loop-free algorithms, that is, degree-three series-parallel
digraphs. Our drawing algorithms show that it is possible to produce Knuthian
drawings of degree-three series-parallel digraphs with good aspect ratios and
small numbers of... | [
{
"created": "Mon, 17 Aug 2015 05:59:27 GMT",
"version": "v1"
}
] | 2015-08-18 | [
[
"Goodrich",
"Michael T.",
""
],
[
"Johnson",
"Timothy",
""
],
[
"Torres",
"Manuel",
""
]
] | Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of e... |
cs/0110037 | Nancy Mazur | Nancy Mazur (1), Peter Ross (2), Gerda Janssens (1) and Maurice
Bruynooghe (1) ((1) Dept. of Computer Science K.U.Leuven, (2) Mission
Critical) | Practical Aspects for a Working Compile Time Garbage Collection System
for Mercury | 15 pages. A version of this paper will appear in Proceeding of the
Seventeenth International Conference on Logic Programming (ICLP2001) | null | null | null | cs.PL | null | Compile-time garbage collection (CTGC) is still a very uncommon feature
within compilers. In previous work we have developed a compile-time structure
reuse system for Mercury, a logic programming language. This system indicates
which datastructures can safely be reused at run-time. As preliminary
experiments were pro... | [
{
"created": "Wed, 17 Oct 2001 16:20:33 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Mazur",
"Nancy",
""
],
[
"Ross",
"Peter",
""
],
[
"Janssens",
"Gerda",
""
],
[
"Bruynooghe",
"Maurice",
""
]
] | Compile-time garbage collection (CTGC) is still a very uncommon feature within compilers. In previous work we have developed a compile-time structure reuse system for Mercury, a logic programming language. This system indicates which datastructures can safely be reused at run-time. As preliminary experiments were promi... |
2311.12647 | Jean-Luc Reding | Hendrik Meyer zum Felde, Jean-Luc Reding, Michael Lux | D-GATE: Decentralized Geolocation and Time Enforcement for Usage Control | null | 2023 IEEE European Symposium on Security and Privacy Workshops
(EuroS&PW), Delft, Netherlands, 2023, pp. 386-395 | 10.1109/EuroSPW59978.2023.00049 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the context of cloud environments, data providers entrust their data to
data consumers in order to allow further computing on their own IT
infrastructure. Usage control measures allow the data provider to restrict the
usage of its data even on the data consumer's system. Two of these restrictions
can be the geogra... | [
{
"created": "Tue, 21 Nov 2023 14:48:12 GMT",
"version": "v1"
}
] | 2023-11-22 | [
[
"Felde",
"Hendrik Meyer zum",
""
],
[
"Reding",
"Jean-Luc",
""
],
[
"Lux",
"Michael",
""
]
] | In the context of cloud environments, data providers entrust their data to data consumers in order to allow further computing on their own IT infrastructure. Usage control measures allow the data provider to restrict the usage of its data even on the data consumer's system. Two of these restrictions can be the geograph... |
1901.00100 | Zhiri Tang | Zhiri Tang, Ruohua Zhu, Peng Lin, Jin He, Hao Wang, Qijun Huang, Sheng
Chang, Qiming Ma | A Hardware Friendly Unsupervised Memristive Neural Network with Weight
Sharing Mechanism | 10 pages, 11 figures | Neurocomputing 2019 | 10.1016/j.neucom.2018.12.049 | null | cs.ET cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Memristive neural networks (MNNs), which use memristors as neurons or
synapses, have become a hot research topic recently. However, most memristors
are not compatible with mainstream integrated circuit technology and their
stabilities in large-scale are not very well so far. In this paper, a hardware
friendly MNN cir... | [
{
"created": "Tue, 1 Jan 2019 05:56:34 GMT",
"version": "v1"
}
] | 2019-01-03 | [
[
"Tang",
"Zhiri",
""
],
[
"Zhu",
"Ruohua",
""
],
[
"Lin",
"Peng",
""
],
[
"He",
"Jin",
""
],
[
"Wang",
"Hao",
""
],
[
"Huang",
"Qijun",
""
],
[
"Chang",
"Sheng",
""
],
[
"Ma",
"Qiming",
""
... | Memristive neural networks (MNNs), which use memristors as neurons or synapses, have become a hot research topic recently. However, most memristors are not compatible with mainstream integrated circuit technology and their stabilities in large-scale are not very well so far. In this paper, a hardware friendly MNN circu... |
1807.04979 | Guojun Yin | Guojun Yin, Lu Sheng, Bin Liu, Nenghai Yu, Xiaogang Wang, Jing Shao,
Chen Change Loy | Zoom-Net: Mining Deep Feature Interactions for Visual Relationship
Recognition | 22 pages, 9 figures, accepted by ECCV 2018, the source code will be
released on https://github.com/gjyin91/ZoomNet | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recognizing visual relationships <subject-predicate-object> among any pair of
localized objects is pivotal for image understanding. Previous studies have
shown remarkable progress in exploiting linguistic priors or external textual
information to improve the performance. In this work, we investigate an
orthogonal per... | [
{
"created": "Fri, 13 Jul 2018 09:20:39 GMT",
"version": "v1"
}
] | 2018-07-16 | [
[
"Yin",
"Guojun",
""
],
[
"Sheng",
"Lu",
""
],
[
"Liu",
"Bin",
""
],
[
"Yu",
"Nenghai",
""
],
[
"Wang",
"Xiaogang",
""
],
[
"Shao",
"Jing",
""
],
[
"Loy",
"Chen Change",
""
]
] | Recognizing visual relationships <subject-predicate-object> among any pair of localized objects is pivotal for image understanding. Previous studies have shown remarkable progress in exploiting linguistic priors or external textual information to improve the performance. In this work, we investigate an orthogonal persp... |
2109.12105 | Xing Niu | Xing Niu, Georgiana Dinu, Prashant Mathur, Anna Currey | Faithful Target Attribute Prediction in Neural Machine Translation | Withdrawn from Findings of ACL 2021 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The training data used in NMT is rarely controlled with respect to specific
attributes, such as word casing or gender, which can cause errors in
translations. We argue that predicting the target word and attributes
simultaneously is an effective way to ensure that translations are more
faithful to the training data d... | [
{
"created": "Fri, 24 Sep 2021 17:55:07 GMT",
"version": "v1"
}
] | 2021-09-27 | [
[
"Niu",
"Xing",
""
],
[
"Dinu",
"Georgiana",
""
],
[
"Mathur",
"Prashant",
""
],
[
"Currey",
"Anna",
""
]
] | The training data used in NMT is rarely controlled with respect to specific attributes, such as word casing or gender, which can cause errors in translations. We argue that predicting the target word and attributes simultaneously is an effective way to ensure that translations are more faithful to the training data dis... |
2010.00587 | Quanquan Gu | Jiafan He and Dongruo Zhou and Quanquan Gu | Nearly Minimax Optimal Reinforcement Learning for Discounted MDPs | 33 pages, 1 figure, 1 table. In NeurIPS 2021 | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the reinforcement learning problem for discounted Markov Decision
Processes (MDPs) under the tabular setting. We propose a model-based algorithm
named UCBVI-$\gamma$, which is based on the \emph{optimism in the face of
uncertainty principle} and the Bernstein-type bonus. We show that
UCBVI-$\gamma$ achieves ... | [
{
"created": "Thu, 1 Oct 2020 17:57:47 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Feb 2021 16:34:04 GMT",
"version": "v2"
},
{
"created": "Mon, 3 Jan 2022 02:23:25 GMT",
"version": "v3"
}
] | 2022-01-04 | [
[
"He",
"Jiafan",
""
],
[
"Zhou",
"Dongruo",
""
],
[
"Gu",
"Quanquan",
""
]
] | We study the reinforcement learning problem for discounted Markov Decision Processes (MDPs) under the tabular setting. We propose a model-based algorithm named UCBVI-$\gamma$, which is based on the \emph{optimism in the face of uncertainty principle} and the Bernstein-type bonus. We show that UCBVI-$\gamma$ achieves an... |
2311.15395 | Jann Goschenhofer | Jann Goschenhofer, Bernd Bischl, Zsolt Kira | ConstraintMatch for Semi-constrained Clustering | null | 2023 International Joint Conference on Neural Networks (IJCNN) | null | null | cs.LG cs.CV stat.ML | http://creativecommons.org/licenses/by/4.0/ | Constrained clustering allows the training of classification models using
pairwise constraints only, which are weak and relatively easy to mine, while
still yielding full-supervision-level model performance. While they perform
well even in the absence of the true underlying class labels, constrained
clustering models... | [
{
"created": "Sun, 26 Nov 2023 19:31:52 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Goschenhofer",
"Jann",
""
],
[
"Bischl",
"Bernd",
""
],
[
"Kira",
"Zsolt",
""
]
] | Constrained clustering allows the training of classification models using pairwise constraints only, which are weak and relatively easy to mine, while still yielding full-supervision-level model performance. While they perform well even in the absence of the true underlying class labels, constrained clustering models s... |
1606.03802 | Pedro Ribeiro Mendes J\'unior | Pedro Ribeiro Mendes J\'unior, Terrance E. Boult, Jacques Wainer, and
Anderson Rocha | Open-Set Support Vector Machines | Version accepted for publication in IEEE Transactions on Systems,
Man, and Cybernetics: Systems | null | 10.1109/TSMC.2021.3074496 | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Often, when dealing with real-world recognition problems, we do not need, and
often cannot have, knowledge of the entire set of possible classes that might
appear during operational testing. In such cases, we need to think of robust
classification methods able to deal with the "unknown" and properly reject
samples be... | [
{
"created": "Mon, 13 Jun 2016 03:46:17 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Apr 2020 22:45:04 GMT",
"version": "v10"
},
{
"created": "Mon, 21 Feb 2022 20:21:30 GMT",
"version": "v11"
},
{
"created": "Tue, 1 Nov 2016 22:54:27 GMT",
"version": "v2"
},
{
"... | 2022-02-23 | [
[
"Júnior",
"Pedro Ribeiro Mendes",
""
],
[
"Boult",
"Terrance E.",
""
],
[
"Wainer",
"Jacques",
""
],
[
"Rocha",
"Anderson",
""
]
] | Often, when dealing with real-world recognition problems, we do not need, and often cannot have, knowledge of the entire set of possible classes that might appear during operational testing. In such cases, we need to think of robust classification methods able to deal with the "unknown" and properly reject samples belo... |
2010.00378 | Angelica I. Aviles-Rivero | Angelica I Aviles-Rivero, Philip Sellars, Carola-Bibiane Sch\"onlieb,
Nicolas Papadakis | GraphXCOVID: Explainable Deep Graph Diffusion Pseudo-Labelling for
Identifying COVID-19 on Chest X-rays | null | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Can one learn to diagnose COVID-19 under extreme minimal supervision? Since
the outbreak of the novel COVID-19 there has been a rush for developing
Artificial Intelligence techniques for expert-level disease identification on
Chest X-ray data. In particular, the use of deep supervised learning has become
the go-to pa... | [
{
"created": "Wed, 30 Sep 2020 15:38:24 GMT",
"version": "v1"
},
{
"created": "Sun, 4 Jul 2021 18:30:43 GMT",
"version": "v2"
}
] | 2021-07-06 | [
[
"Aviles-Rivero",
"Angelica I",
""
],
[
"Sellars",
"Philip",
""
],
[
"Schönlieb",
"Carola-Bibiane",
""
],
[
"Papadakis",
"Nicolas",
""
]
] | Can one learn to diagnose COVID-19 under extreme minimal supervision? Since the outbreak of the novel COVID-19 there has been a rush for developing Artificial Intelligence techniques for expert-level disease identification on Chest X-ray data. In particular, the use of deep supervised learning has become the go-to para... |
1508.06967 | Bechir Hamdaoui | Bechir Hamdaoui | A Simple Algorithm for Coloring m-Clique Holes | null | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An m-clique hole is a sequence $\phi=(\Phi_1,\Phi_2,\dots,\Phi_m)$ of $m$
distinct cliques such that $|\Phi_i| \leq m$ for all $i=1,2,\ldots,m$, and
whose clique graph is a hole on $m$ vertices. That is, $\phi$ is an m-clique
hole if for all $i\neq j$, $i,j=1,2,\ldots,m$, $\Phi_i \cap \Phi_{j} \neq
\emptyset$ if and ... | [
{
"created": "Thu, 27 Aug 2015 18:50:53 GMT",
"version": "v1"
}
] | 2015-08-28 | [
[
"Hamdaoui",
"Bechir",
""
]
] | An m-clique hole is a sequence $\phi=(\Phi_1,\Phi_2,\dots,\Phi_m)$ of $m$ distinct cliques such that $|\Phi_i| \leq m$ for all $i=1,2,\ldots,m$, and whose clique graph is a hole on $m$ vertices. That is, $\phi$ is an m-clique hole if for all $i\neq j$, $i,j=1,2,\ldots,m$, $\Phi_i \cap \Phi_{j} \neq \emptyset$ if and on... |
2401.11231 | Yuhang Pi | Yuhang Pi and Zhifang Zhang | Two-Insertion/Deletion/Substitution Correcting Codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, the emergence of DNA storage systems has led to a widespread
focus on the research of codes correcting insertions, deletions, and classic
substitutions. During the initial investigation, Levenshtein discovered the VT
codes are precisely capable of correcting single insertion/deletion and then
extende... | [
{
"created": "Sat, 20 Jan 2024 13:46:16 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Pi",
"Yuhang",
""
],
[
"Zhang",
"Zhifang",
""
]
] | In recent years, the emergence of DNA storage systems has led to a widespread focus on the research of codes correcting insertions, deletions, and classic substitutions. During the initial investigation, Levenshtein discovered the VT codes are precisely capable of correcting single insertion/deletion and then extended ... |
1807.00284 | Yong Xia | Benteng Ma, Yong Xia | Autonomous Deep Learning: A Genetic DCNN Designer for Image
Classification | null | null | null | null | cs.CV cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have witnessed the breakthrough success of deep convolutional
neural networks (DCNNs) in image classification and other vision applications.
Although freeing users from the troublesome handcrafted feature extraction by
providing a uniform feature extraction-classification framework, DCNNs still
require a... | [
{
"created": "Sun, 1 Jul 2018 07:11:54 GMT",
"version": "v1"
}
] | 2018-07-03 | [
[
"Ma",
"Benteng",
""
],
[
"Xia",
"Yong",
""
]
] | Recent years have witnessed the breakthrough success of deep convolutional neural networks (DCNNs) in image classification and other vision applications. Although freeing users from the troublesome handcrafted feature extraction by providing a uniform feature extraction-classification framework, DCNNs still require a h... |
2109.02529 | Andrea Piazzoni | Andrea Piazzoni, Jim Cherian, Mohamed Azhar, Jing Yew Yap, James Lee
Wei Shung, Roshan Vijay | ViSTA: a Framework for Virtual Scenario-based Testing of Autonomous
Vehicles | Accepted at 2021 IEEE Autonomous Driving AI Test Challenge - AITest
2021 8 pages, 4 figures | null | 10.1109/AITEST52744.2021.00035 | null | cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present ViSTA, a framework for Virtual Scenario-based
Testing of Autonomous Vehicles (AV), developed as part of the 2021 IEEE
Autonomous Test Driving AI Test Challenge. Scenario-based virtual testing aims
to construct specific challenges posed for the AV to overcome, albeit in
virtual test environme... | [
{
"created": "Mon, 6 Sep 2021 15:12:17 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Sep 2021 04:46:01 GMT",
"version": "v2"
}
] | 2021-11-22 | [
[
"Piazzoni",
"Andrea",
""
],
[
"Cherian",
"Jim",
""
],
[
"Azhar",
"Mohamed",
""
],
[
"Yap",
"Jing Yew",
""
],
[
"Shung",
"James Lee Wei",
""
],
[
"Vijay",
"Roshan",
""
]
] | In this paper, we present ViSTA, a framework for Virtual Scenario-based Testing of Autonomous Vehicles (AV), developed as part of the 2021 IEEE Autonomous Test Driving AI Test Challenge. Scenario-based virtual testing aims to construct specific challenges posed for the AV to overcome, albeit in virtual test environment... |
2003.12154 | Fatemehsadat Mireshghallah | Fatemehsadat Mireshghallah, Mohammadkazem Taram, Ali Jalali, Ahmed
Taha Elthakeb, Dean Tullsen, Hadi Esmaeilzadeh | Not All Features Are Equal: Discovering Essential Features for
Preserving Prediction Privacy | This paper is presented at the 2021 Web conference (WWW 2021) | null | null | null | cs.LG cs.CR cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When receiving machine learning services from the cloud, the provider does
not need to receive all features; in fact, only a subset of the features are
necessary for the target prediction task. Discerning this subset is the key
problem of this work. We formulate this problem as a gradient-based
perturbation maximizat... | [
{
"created": "Thu, 26 Mar 2020 20:45:09 GMT",
"version": "v1"
},
{
"created": "Sat, 20 Feb 2021 05:02:25 GMT",
"version": "v2"
}
] | 2021-02-23 | [
[
"Mireshghallah",
"Fatemehsadat",
""
],
[
"Taram",
"Mohammadkazem",
""
],
[
"Jalali",
"Ali",
""
],
[
"Elthakeb",
"Ahmed Taha",
""
],
[
"Tullsen",
"Dean",
""
],
[
"Esmaeilzadeh",
"Hadi",
""
]
] | When receiving machine learning services from the cloud, the provider does not need to receive all features; in fact, only a subset of the features are necessary for the target prediction task. Discerning this subset is the key problem of this work. We formulate this problem as a gradient-based perturbation maximizatio... |
1909.13096 | Kanglin Yin | Kanglin Yin, Qingfeng Du | On Representing Resilience Requirements of Microservice Architecture
Systems | This manuscript is draft only, not intended for publication | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Together with the spread of DevOps practices and container technologies,
Microserivce Architecture has become a mainstream architecture style in recent
years. Resilience is a key characteristic in Microservice Architecture
Systems(MSA Systems), and it shows the ability to cope with various kinds of
system disturbance... | [
{
"created": "Sat, 28 Sep 2019 13:42:14 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Jun 2020 18:01:02 GMT",
"version": "v2"
},
{
"created": "Fri, 9 Oct 2020 16:37:49 GMT",
"version": "v3"
}
] | 2020-10-12 | [
[
"Yin",
"Kanglin",
""
],
[
"Du",
"Qingfeng",
""
]
] | Together with the spread of DevOps practices and container technologies, Microserivce Architecture has become a mainstream architecture style in recent years. Resilience is a key characteristic in Microservice Architecture Systems(MSA Systems), and it shows the ability to cope with various kinds of system disturbances ... |
2309.03216 | Bikram Koirala | Bikram Koirala, Behnood Rasti, Zakaria Bnoulkacem, Andrea de Lima
Ribeiro, Yuleika Madriz, Erik Herrmann, Arthur Gestels, Thomas De Kerf,
Sandra Lorenz, Margret Fuchs, Koen Janssens, Gunther Steenackers, Richard
Gloaguen, and Paul Scheunders | A Multisensor Hyperspectral Benchmark Dataset For Unmixing of Intimate
Mixtures | Currently, this paper is under review in IEEE | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optical hyperspectral cameras capture the spectral reflectance of materials.
Since many materials behave as heterogeneous intimate mixtures with which each
photon interacts differently, the relationship between spectral reflectance and
material composition is very complex. Quantitative validation of spectral
unmixing... | [
{
"created": "Wed, 30 Aug 2023 11:48:36 GMT",
"version": "v1"
}
] | 2023-09-08 | [
[
"Koirala",
"Bikram",
""
],
[
"Rasti",
"Behnood",
""
],
[
"Bnoulkacem",
"Zakaria",
""
],
[
"Ribeiro",
"Andrea de Lima",
""
],
[
"Madriz",
"Yuleika",
""
],
[
"Herrmann",
"Erik",
""
],
[
"Gestels",
"Arthur",
"... | Optical hyperspectral cameras capture the spectral reflectance of materials. Since many materials behave as heterogeneous intimate mixtures with which each photon interacts differently, the relationship between spectral reflectance and material composition is very complex. Quantitative validation of spectral unmixing a... |
2403.17089 | Ben Wang | Ben Wang | GOLF: Goal-Oriented Long-term liFe tasks supported by human-AI
collaboration | null | Proceedings of the 47th International ACM SIGIR Conference on
Research and Development in Information Retrieval (SIGIR 2024) | 10.1145/3626772.3657655 | null | cs.HC cs.AI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The advent of ChatGPT and similar large language models (LLMs) has
revolutionized the human-AI interaction and information-seeking process.
Leveraging LLMs as an alternative to search engines, users can now access
summarized information tailored to their queries, significantly reducing the
cognitive load associated w... | [
{
"created": "Mon, 25 Mar 2024 18:25:10 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Apr 2024 15:00:58 GMT",
"version": "v2"
}
] | 2024-04-18 | [
[
"Wang",
"Ben",
""
]
] | The advent of ChatGPT and similar large language models (LLMs) has revolutionized the human-AI interaction and information-seeking process. Leveraging LLMs as an alternative to search engines, users can now access summarized information tailored to their queries, significantly reducing the cognitive load associated wit... |
2205.03809 | Kanishka Wijewardena | Kanishka P. Wijewardena, Steven A. Grosz, Kai Cao, Anil K. Jain | Fingerprint Template Invertibility: Minutiae vs. Deep Templates | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Much of the success of fingerprint recognition is attributed to
minutiae-based fingerprint representation. It was believed that minutiae
templates could not be inverted to obtain a high fidelity fingerprint image,
but this assumption has been shown to be false. The success of deep learning
has resulted in alternative... | [
{
"created": "Sun, 8 May 2022 07:50:41 GMT",
"version": "v1"
}
] | 2022-05-10 | [
[
"Wijewardena",
"Kanishka P.",
""
],
[
"Grosz",
"Steven A.",
""
],
[
"Cao",
"Kai",
""
],
[
"Jain",
"Anil K.",
""
]
] | Much of the success of fingerprint recognition is attributed to minutiae-based fingerprint representation. It was believed that minutiae templates could not be inverted to obtain a high fidelity fingerprint image, but this assumption has been shown to be false. The success of deep learning has resulted in alternative f... |
1603.04322 | Fariba Karimi Dr. | Fariba Karimi, Claudia Wagner, Florian Lemmerich, Mohsen Jadidi,
Markus Strohmaier | Inferring Gender from Names on the Web: A Comparative Evaluation of
Gender Detection Methods | 2 pages, WWW conference | null | 10.1145/2872518.2889385 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computational social scientists often harness the Web as a "societal
observatory" where data about human social behavior is collected. This data
enables novel investigations of psychological, anthropological and sociological
research questions. However, in the absence of demographic information, such as
gender, many ... | [
{
"created": "Mon, 14 Mar 2016 16:14:46 GMT",
"version": "v1"
}
] | 2016-03-15 | [
[
"Karimi",
"Fariba",
""
],
[
"Wagner",
"Claudia",
""
],
[
"Lemmerich",
"Florian",
""
],
[
"Jadidi",
"Mohsen",
""
],
[
"Strohmaier",
"Markus",
""
]
] | Computational social scientists often harness the Web as a "societal observatory" where data about human social behavior is collected. This data enables novel investigations of psychological, anthropological and sociological research questions. However, in the absence of demographic information, such as gender, many re... |
2306.13840 | Brando Miranda | Alycia Lee, Brando Miranda, Sudharsan Sundar, Sanmi Koyejo | Beyond Scale: the Diversity Coefficient as a Data Quality Metric
Demonstrates LLMs are Pre-trained on Formally Diverse Data | null | Proceedings of the 40th International Conference on Machine
Learning DMLR 2023 | null | null | cs.CL cs.AI cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current trends to pre-train capable Large Language Models (LLMs) mostly focus
on scaling of model and dataset size. However, the quality of pre-training data
is an important factor for training powerful LLMs, yet it is a nebulous concept
that has not been fully characterized. Therefore, we use the recently proposed
T... | [
{
"created": "Sat, 24 Jun 2023 02:25:56 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Sep 2023 23:29:05 GMT",
"version": "v2"
}
] | 2023-09-28 | [
[
"Lee",
"Alycia",
""
],
[
"Miranda",
"Brando",
""
],
[
"Sundar",
"Sudharsan",
""
],
[
"Koyejo",
"Sanmi",
""
]
] | Current trends to pre-train capable Large Language Models (LLMs) mostly focus on scaling of model and dataset size. However, the quality of pre-training data is an important factor for training powerful LLMs, yet it is a nebulous concept that has not been fully characterized. Therefore, we use the recently proposed Tas... |
2104.09792 | Gilad Kutiel | Iftah Gamzu, Hila Gonen, Gilad Kutiel, Ran Levy, Eugene Agichtein | Identifying Helpful Sentences in Product Reviews | null | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | In recent years online shopping has gained momentum and became an important
venue for customers wishing to save time and simplify their shopping process. A
key advantage of shopping online is the ability to read what other customers
are saying about products of interest. In this work, we aim to maintain this
advantag... | [
{
"created": "Tue, 20 Apr 2021 07:09:22 GMT",
"version": "v1"
},
{
"created": "Wed, 5 May 2021 06:36:15 GMT",
"version": "v2"
},
{
"created": "Sun, 11 Jul 2021 08:37:56 GMT",
"version": "v3"
}
] | 2021-07-13 | [
[
"Gamzu",
"Iftah",
""
],
[
"Gonen",
"Hila",
""
],
[
"Kutiel",
"Gilad",
""
],
[
"Levy",
"Ran",
""
],
[
"Agichtein",
"Eugene",
""
]
] | In recent years online shopping has gained momentum and became an important venue for customers wishing to save time and simplify their shopping process. A key advantage of shopping online is the ability to read what other customers are saying about products of interest. In this work, we aim to maintain this advantage ... |
1802.06512 | Ekaterina Bayguzina | Ekaterina Bayguzina and Bruno Clerckx | Asymmetric Modulation Design for Wireless Information and Power Transfer
with Nonlinear Energy Harvesting | Submitted for publication. This version incorporates the conference
version "Modulation Design for Wireless Information and Power Transfer with
Nonlinear Energy Harvester Modeling" (available as v1) | null | 10.1109/TWC.2019.2937024 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Far-field wireless power transfer (WPT) and simultaneous wireless information
and power transfer (SWIPT) have become increasingly important in radio
frequency (RF) and communication communities recently. The problem of
modulation design for SWIPT has however been scarcely addressed. In this paper,
a modulation scheme... | [
{
"created": "Mon, 19 Feb 2018 03:40:02 GMT",
"version": "v1"
},
{
"created": "Sun, 15 Sep 2019 19:39:02 GMT",
"version": "v2"
}
] | 2019-10-25 | [
[
"Bayguzina",
"Ekaterina",
""
],
[
"Clerckx",
"Bruno",
""
]
] | Far-field wireless power transfer (WPT) and simultaneous wireless information and power transfer (SWIPT) have become increasingly important in radio frequency (RF) and communication communities recently. The problem of modulation design for SWIPT has however been scarcely addressed. In this paper, a modulation scheme b... |
2108.01289 | Jisoo Mok | Jisoo Mok, Byunggook Na, Hyeokjun Choe, Sungroh Yoon | AdvRush: Searching for Adversarially Robust Neural Architectures | ICCV 2021 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Deep neural networks continue to awe the world with their remarkable
performance. Their predictions, however, are prone to be corrupted by
adversarial examples that are imperceptible to humans. Current efforts to
improve the robustness of neural networks against adversarial examples are
focused on developing robust t... | [
{
"created": "Tue, 3 Aug 2021 04:27:33 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Aug 2021 06:34:49 GMT",
"version": "v2"
}
] | 2021-08-11 | [
[
"Mok",
"Jisoo",
""
],
[
"Na",
"Byunggook",
""
],
[
"Choe",
"Hyeokjun",
""
],
[
"Yoon",
"Sungroh",
""
]
] | Deep neural networks continue to awe the world with their remarkable performance. Their predictions, however, are prone to be corrupted by adversarial examples that are imperceptible to humans. Current efforts to improve the robustness of neural networks against adversarial examples are focused on developing robust tra... |
2211.13554 | Fernando Alonso-Fernandez | Fernando Alonso-Fernandez, Julian Fierrez, Daniel Ramos, Joaquin
Gonzalez-Rodriguez | Quality-Based Conditional Processing in Multi-Biometrics: Application to
Sensor Interoperability | Published at IEEE Transactions on Systems, Man, and Cybernetics -
Part A: Systems and Humans | null | 10.1109/TSMCA.2010.2047498 | null | cs.CR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As biometric technology is increasingly deployed, it will be common to
replace parts of operational systems with newer designs. The cost and
inconvenience of reacquiring enrolled users when a new vendor solution is
incorporated makes this approach difficult and many applications will require
to deal with information ... | [
{
"created": "Thu, 24 Nov 2022 12:11:22 GMT",
"version": "v1"
}
] | 2022-11-28 | [
[
"Alonso-Fernandez",
"Fernando",
""
],
[
"Fierrez",
"Julian",
""
],
[
"Ramos",
"Daniel",
""
],
[
"Gonzalez-Rodriguez",
"Joaquin",
""
]
] | As biometric technology is increasingly deployed, it will be common to replace parts of operational systems with newer designs. The cost and inconvenience of reacquiring enrolled users when a new vendor solution is incorporated makes this approach difficult and many applications will require to deal with information fr... |
2105.06284 | Min Lin | Kong Huaicong, Lin Min, Wang Zining, Ouyang Jian, Cheng Julian | Ergodic Capacity of High Throughput Satellite Systems With Mixed FSO-RF
Transmission | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a high throughput satellite system, where the feeder link uses
free-space optical (FSO) and the user link uses radio frequency (RF)
communication. In particular, we first propose a transmit diversity using
Alamouti space time block coding to mitigate the atmospheric turbulence in the
feeder link. Then, based... | [
{
"created": "Thu, 13 May 2021 13:29:24 GMT",
"version": "v1"
}
] | 2021-05-14 | [
[
"Huaicong",
"Kong",
""
],
[
"Min",
"Lin",
""
],
[
"Zining",
"Wang",
""
],
[
"Jian",
"Ouyang",
""
],
[
"Julian",
"Cheng",
""
]
] | We study a high throughput satellite system, where the feeder link uses free-space optical (FSO) and the user link uses radio frequency (RF) communication. In particular, we first propose a transmit diversity using Alamouti space time block coding to mitigate the atmospheric turbulence in the feeder link. Then, based o... |
2404.01136 | Dongxu Chang | Dongxu Chang, Qingqing Peng, Zhiming Ma, Guanghui Wang, Dawei Yin | Density Evolution Analysis of Generalized Low-density Parity-check Codes
under a Posteriori Probability Decoder | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, the performance of generalized low-density parity-check
(GLDPC) codes under the a posteriori probability (APP) decoder is analyzed. We
explore the concentration, symmetry, and monotonicity properties of GLDPC codes
under the APP decoder, extending the applicability of density evolution to
GLDPC codes. ... | [
{
"created": "Mon, 1 Apr 2024 14:30:04 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Aug 2024 13:40:19 GMT",
"version": "v2"
}
] | 2024-08-07 | [
[
"Chang",
"Dongxu",
""
],
[
"Peng",
"Qingqing",
""
],
[
"Ma",
"Zhiming",
""
],
[
"Wang",
"Guanghui",
""
],
[
"Yin",
"Dawei",
""
]
] | In this study, the performance of generalized low-density parity-check (GLDPC) codes under the a posteriori probability (APP) decoder is analyzed. We explore the concentration, symmetry, and monotonicity properties of GLDPC codes under the APP decoder, extending the applicability of density evolution to GLDPC codes. On... |
0710.4693 | EDA Publishing Association | Ananta K. Majhi, Mohamed Azimane, Guido Gronthoud, Maurice Lousberg,
Stefan Eichenberger, Fred Bowen | Memory Testing Under Different Stress Conditions: An Industrial
Evaluation | Submitted on behalf of EDAA (http://www.edaa.com/) | Dans Design, Automation and Test in Europe - DATE'05, Munich :
Allemagne (2005) | null | null | cs.AR | null | This paper presents the effectiveness of various stress conditions (mainly
voltage and frequency) on detecting the resistive shorts and open defects in
deep sub-micron embedded memories in an industrial environment. Simulation
studies on very-low voltage, high voltage and at-speed testing show the need of
the stress ... | [
{
"created": "Thu, 25 Oct 2007 09:14:05 GMT",
"version": "v1"
}
] | 2011-11-09 | [
[
"Majhi",
"Ananta K.",
""
],
[
"Azimane",
"Mohamed",
""
],
[
"Gronthoud",
"Guido",
""
],
[
"Lousberg",
"Maurice",
""
],
[
"Eichenberger",
"Stefan",
""
],
[
"Bowen",
"Fred",
""
]
] | This paper presents the effectiveness of various stress conditions (mainly voltage and frequency) on detecting the resistive shorts and open defects in deep sub-micron embedded memories in an industrial environment. Simulation studies on very-low voltage, high voltage and at-speed testing show the need of the stress co... |
1802.01194 | Joshua Garland | Joshua Garland, Andrew M. Berdahl, Jie Sun and Erik Bollt | Anatomy of Leadership in Collective Behaviour | 13 pages, 3 figures | null | 10.1063/1.5024395 | null | cs.MA physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the mechanics behind the coordinated movement of mobile animal
groups (collective motion) provides key insights into their biology and
ecology, while also yielding algorithms for bio-inspired technologies and
autonomous systems. It is becoming increasingly clear that many mobile animal
groups are compos... | [
{
"created": "Sun, 4 Feb 2018 21:21:48 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Apr 2018 20:02:04 GMT",
"version": "v2"
}
] | 2018-08-15 | [
[
"Garland",
"Joshua",
""
],
[
"Berdahl",
"Andrew M.",
""
],
[
"Sun",
"Jie",
""
],
[
"Bollt",
"Erik",
""
]
] | Understanding the mechanics behind the coordinated movement of mobile animal groups (collective motion) provides key insights into their biology and ecology, while also yielding algorithms for bio-inspired technologies and autonomous systems. It is becoming increasingly clear that many mobile animal groups are composed... |
2206.04465 | Arunkumar A | Arunkumar A and Umesh S | Joint Encoder-Decoder Self-Supervised Pre-training for ASR | Submitted to Interspeech 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Self-supervised learning (SSL) has shown tremendous success in various
speech-related downstream tasks, including Automatic Speech Recognition (ASR).
The output embeddings of the SSL model are treated as powerful short-time
representations of the speech signal. However, in the ASR task, the main
objective is to get t... | [
{
"created": "Thu, 9 Jun 2022 12:45:29 GMT",
"version": "v1"
}
] | 2022-06-10 | [
[
"A",
"Arunkumar",
""
],
[
"S",
"Umesh",
""
]
] | Self-supervised learning (SSL) has shown tremendous success in various speech-related downstream tasks, including Automatic Speech Recognition (ASR). The output embeddings of the SSL model are treated as powerful short-time representations of the speech signal. However, in the ASR task, the main objective is to get the... |
2212.05023 | Julian Suk | Julian Suk, Pim de Haan, Phillip Lippe, Christoph Brune, Jelmer M.
Wolterink | Mesh Neural Networks for SE(3)-Equivariant Hemodynamics Estimation on
the Artery Wall | Published in "Computers in Biology and Medicine" | null | 10.1016/j.compbiomed.2024.108328 | null | cs.LG cs.CV math.GR physics.flu-dyn | http://creativecommons.org/licenses/by/4.0/ | Computational fluid dynamics (CFD) is a valuable asset for patient-specific
cardiovascular-disease diagnosis and prognosis, but its high computational
demands hamper its adoption in practice. Machine-learning methods that estimate
blood flow in individual patients could accelerate or replace CFD simulation to
overcom... | [
{
"created": "Fri, 9 Dec 2022 18:16:06 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Jun 2024 18:34:21 GMT",
"version": "v2"
}
] | 2024-06-18 | [
[
"Suk",
"Julian",
""
],
[
"de Haan",
"Pim",
""
],
[
"Lippe",
"Phillip",
""
],
[
"Brune",
"Christoph",
""
],
[
"Wolterink",
"Jelmer M.",
""
]
] | Computational fluid dynamics (CFD) is a valuable asset for patient-specific cardiovascular-disease diagnosis and prognosis, but its high computational demands hamper its adoption in practice. Machine-learning methods that estimate blood flow in individual patients could accelerate or replace CFD simulation to overcome ... |
2111.00452 | Amirmohammad Radmehr | Amirmohammad Radmehr, Milad Asgari, Mehdi Tale Masouleh | Experimental Study on the Imitation of the Human Head-and-Eye Pose Using
the 3-DOF Agile Eye Parallel Robot with ROS and Mediapipe Framework | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a method to mimic a human face and eyes is proposed which can
be regarded as a combination of computer vision techniques and neural network
concepts. From a mechanical standpoint, a 3-DOF spherical parallel robot is
used which imitates the human head movement. In what concerns eye movement, a
2-DOF mec... | [
{
"created": "Sun, 31 Oct 2021 10:11:45 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Nov 2021 11:51:26 GMT",
"version": "v2"
}
] | 2021-11-05 | [
[
"Radmehr",
"Amirmohammad",
""
],
[
"Asgari",
"Milad",
""
],
[
"Masouleh",
"Mehdi Tale",
""
]
] | In this paper, a method to mimic a human face and eyes is proposed which can be regarded as a combination of computer vision techniques and neural network concepts. From a mechanical standpoint, a 3-DOF spherical parallel robot is used which imitates the human head movement. In what concerns eye movement, a 2-DOF mecha... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.