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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2208.12960 | Wansen Wang | Wansen Wang, Wenchao Huang, Zhaoyi Meng, Yan Xiong, Fuyou Miao,
Xianjin Fang, Caichang Tu, Renjie Ji | An Automated Analyzer for Financial Security of Ethereum Smart Contracts | null | In 32nd USENIX Security Symposium (USENIX Security 2023) (pp.
3367-3383) | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | At present, millions of Ethereum smart contracts are created per year and
attract financially motivated attackers. However, existing analyzers do not
meet the need to precisely analyze the financial security of large numbers of
contracts. In this paper, we propose and implement FASVERIF, an automated
analyzer for fin... | [
{
"created": "Sat, 27 Aug 2022 08:46:52 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Sep 2022 02:26:54 GMT",
"version": "v2"
},
{
"created": "Fri, 24 Mar 2023 02:12:57 GMT",
"version": "v3"
}
] | 2024-03-06 | [
[
"Wang",
"Wansen",
""
],
[
"Huang",
"Wenchao",
""
],
[
"Meng",
"Zhaoyi",
""
],
[
"Xiong",
"Yan",
""
],
[
"Miao",
"Fuyou",
""
],
[
"Fang",
"Xianjin",
""
],
[
"Tu",
"Caichang",
""
],
[
"Ji",
"Renji... | At present, millions of Ethereum smart contracts are created per year and attract financially motivated attackers. However, existing analyzers do not meet the need to precisely analyze the financial security of large numbers of contracts. In this paper, we propose and implement FASVERIF, an automated analyzer for fine-... |
2004.00668 | Ian Covert | Ian Covert, Scott Lundberg, Su-In Lee | Understanding Global Feature Contributions With Additive Importance
Measures | NeurIPS 2020 Camera Ready | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the inner workings of complex machine learning models is a
long-standing problem and most recent research has focused on local
interpretability. To assess the role of individual input features in a global
sense, we explore the perspective of defining feature importance through the
predictive power assoc... | [
{
"created": "Wed, 1 Apr 2020 19:17:58 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Oct 2020 06:46:04 GMT",
"version": "v2"
}
] | 2020-10-28 | [
[
"Covert",
"Ian",
""
],
[
"Lundberg",
"Scott",
""
],
[
"Lee",
"Su-In",
""
]
] | Understanding the inner workings of complex machine learning models is a long-standing problem and most recent research has focused on local interpretability. To assess the role of individual input features in a global sense, we explore the perspective of defining feature importance through the predictive power associa... |
2107.04281 | Felix Juefei-Xu | Qing Guo and Xiaoguang Li and Felix Juefei-Xu and Hongkai Yu and Yang
Liu and Song wang | JPGNet: Joint Predictive Filtering and Generative Network for Image
Inpainting | This work has been accepted to ACM-MM 2021 | null | 10.1145/3474085.3475170 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image inpainting aims to restore the missing regions of corrupted images and
make the recovery result identical to the originally complete image, which is
different from the common generative task emphasizing the naturalness or
realism of generated images. Nevertheless, existing works usually regard it as
a pure gene... | [
{
"created": "Fri, 9 Jul 2021 07:49:52 GMT",
"version": "v1"
},
{
"created": "Sat, 24 Jul 2021 04:12:35 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Oct 2021 07:27:03 GMT",
"version": "v3"
}
] | 2021-10-19 | [
[
"Guo",
"Qing",
""
],
[
"Li",
"Xiaoguang",
""
],
[
"Juefei-Xu",
"Felix",
""
],
[
"Yu",
"Hongkai",
""
],
[
"Liu",
"Yang",
""
],
[
"wang",
"Song",
""
]
] | Image inpainting aims to restore the missing regions of corrupted images and make the recovery result identical to the originally complete image, which is different from the common generative task emphasizing the naturalness or realism of generated images. Nevertheless, existing works usually regard it as a pure genera... |
1904.01054 | Juan M. Dur\'an | Juan M. Dur\'an | Varying the explanatory span: scientific explanation for computer
simulations | null | null | 10.1080/02698595.2017.1370929 | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article aims to develop a new account of scientific explanation for
computer simulations. To this end, two questions are answered: what is the
explanatory relation for computer simulations? and what kind of epistemic gain
should be expected? For several reasons tailored to the benefits and needs of
computer simu... | [
{
"created": "Sat, 9 Mar 2019 09:23:10 GMT",
"version": "v1"
}
] | 2019-04-03 | [
[
"Durán",
"Juan M.",
""
]
] | This article aims to develop a new account of scientific explanation for computer simulations. To this end, two questions are answered: what is the explanatory relation for computer simulations? and what kind of epistemic gain should be expected? For several reasons tailored to the benefits and needs of computer simula... |
2403.17220 | Lydia Nishimwe | Lydia Nishimwe, Beno\^it Sagot, Rachel Bawden | Making Sentence Embeddings Robust to User-Generated Content | Accepted at LREC-COLING 2024 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | NLP models have been known to perform poorly on user-generated content (UGC),
mainly because it presents a lot of lexical variations and deviates from the
standard texts on which most of these models were trained. In this work, we
focus on the robustness of LASER, a sentence embedding model, to UGC data. We
evaluate ... | [
{
"created": "Mon, 25 Mar 2024 21:48:36 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Nishimwe",
"Lydia",
""
],
[
"Sagot",
"Benoît",
""
],
[
"Bawden",
"Rachel",
""
]
] | NLP models have been known to perform poorly on user-generated content (UGC), mainly because it presents a lot of lexical variations and deviates from the standard texts on which most of these models were trained. In this work, we focus on the robustness of LASER, a sentence embedding model, to UGC data. We evaluate th... |
2211.06121 | Keita Yokoyama | Yijia Chen and Moritz M\"uller and Keita Yokoyama | A parameterized halting problem, $\Delta_0$ truth and the MRDP theorem | 25 pages | null | null | null | cs.CC math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the parameterized complexity of the problem to decide whether a
given natural number $n$ satisfies a given $\Delta_0$-formula $\varphi(x)$; the
parameter is the size of $\varphi$. This parameterization focusses attention on
instances where $n$ is large compared to the size of $\varphi$. We show
unconditional... | [
{
"created": "Fri, 11 Nov 2022 11:06:58 GMT",
"version": "v1"
}
] | 2022-11-14 | [
[
"Chen",
"Yijia",
""
],
[
"Müller",
"Moritz",
""
],
[
"Yokoyama",
"Keita",
""
]
] | We study the parameterized complexity of the problem to decide whether a given natural number $n$ satisfies a given $\Delta_0$-formula $\varphi(x)$; the parameter is the size of $\varphi$. This parameterization focusses attention on instances where $n$ is large compared to the size of $\varphi$. We show unconditionally... |
2106.15287 | Arthur Douillard | Arthur Douillard, Yifu Chen, Arnaud Dapogny, Matthieu Cord | Tackling Catastrophic Forgetting and Background Shift in Continual
Semantic Segmentation | Under review at IEEE TPAMI, journal extension of arXiv:2011.11390 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Deep learning approaches are nowadays ubiquitously used to tackle computer
vision tasks such as semantic segmentation, requiring large datasets and
substantial computational power. Continual learning for semantic segmentation
(CSS) is an emerging trend that consists in updating an old model by
sequentially adding new... | [
{
"created": "Tue, 29 Jun 2021 11:57:21 GMT",
"version": "v1"
}
] | 2021-06-30 | [
[
"Douillard",
"Arthur",
""
],
[
"Chen",
"Yifu",
""
],
[
"Dapogny",
"Arnaud",
""
],
[
"Cord",
"Matthieu",
""
]
] | Deep learning approaches are nowadays ubiquitously used to tackle computer vision tasks such as semantic segmentation, requiring large datasets and substantial computational power. Continual learning for semantic segmentation (CSS) is an emerging trend that consists in updating an old model by sequentially adding new c... |
1809.08208 | Syed Yusha Kareem | Syed Yusha Kareem, Luca Buoncompagni, Fulvio Mastrogiovanni | Arianna+: Scalable Human Activity Recognition by Reasoning with a
Network of Ontologies | 13 pages, 5 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aging population ratios are rising significantly. Meanwhile, smart home based
health monitoring services are evolving rapidly to become a viable alternative
to traditional healthcare solutions. Such services can augment qualitative
analyses done by gerontologists with quantitative data. Hence, the recognition
of Acti... | [
{
"created": "Fri, 21 Sep 2018 17:00:56 GMT",
"version": "v1"
}
] | 2018-09-24 | [
[
"Kareem",
"Syed Yusha",
""
],
[
"Buoncompagni",
"Luca",
""
],
[
"Mastrogiovanni",
"Fulvio",
""
]
] | Aging population ratios are rising significantly. Meanwhile, smart home based health monitoring services are evolving rapidly to become a viable alternative to traditional healthcare solutions. Such services can augment qualitative analyses done by gerontologists with quantitative data. Hence, the recognition of Activi... |
2309.08173 | Linan Yue | Linan Yue, Qi Liu, Yichao Du, Weibo Gao, Ye Liu, Fangzhou Yao | FedJudge: Federated Legal Large Language Model | Accepted to DASFAA 2024 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Large Language Models (LLMs) have gained prominence in the field of Legal
Intelligence, offering potential applications in assisting legal professionals
and laymen. However, the centralized training of these Legal LLMs raises data
privacy concerns, as legal data is distributed among various institutions
containing se... | [
{
"created": "Fri, 15 Sep 2023 05:45:44 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Dec 2023 08:47:33 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Apr 2024 13:24:55 GMT",
"version": "v3"
}
] | 2024-04-11 | [
[
"Yue",
"Linan",
""
],
[
"Liu",
"Qi",
""
],
[
"Du",
"Yichao",
""
],
[
"Gao",
"Weibo",
""
],
[
"Liu",
"Ye",
""
],
[
"Yao",
"Fangzhou",
""
]
] | Large Language Models (LLMs) have gained prominence in the field of Legal Intelligence, offering potential applications in assisting legal professionals and laymen. However, the centralized training of these Legal LLMs raises data privacy concerns, as legal data is distributed among various institutions containing sens... |
2210.05765 | Alex Lecavalier | Alex Lecavalier, Jeff Denis, Jean-S\'ebastien Plante, Alexandre Girard | A Bimodal Hydrostatic Actuator for Robotic Legs with Compliant Fast
Motion and High Lifting Force | 7 pages, 15 figures | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robotic legs have bimodal operations: swing phases when the leg needs to move
quickly in the air (high-speed, low-force) and stance phases when the leg bears
the weight of the system (low-speed, high-force). Sizing a traditional
single-ratio actuation system for such extremum operations leads to oversized
heavy elect... | [
{
"created": "Tue, 11 Oct 2022 20:17:26 GMT",
"version": "v1"
}
] | 2022-10-13 | [
[
"Lecavalier",
"Alex",
""
],
[
"Denis",
"Jeff",
""
],
[
"Plante",
"Jean-Sébastien",
""
],
[
"Girard",
"Alexandre",
""
]
] | Robotic legs have bimodal operations: swing phases when the leg needs to move quickly in the air (high-speed, low-force) and stance phases when the leg bears the weight of the system (low-speed, high-force). Sizing a traditional single-ratio actuation system for such extremum operations leads to oversized heavy electri... |
2201.10777 | Kenneth Stewart | Kenneth Stewart, Emre Neftci | Meta-learning Spiking Neural Networks with Surrogate Gradient Descent | Submitted to IOP Neuromorphic Computing and Engineering for peer
review | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adaptive "life-long" learning at the edge and during online task performance
is an aspirational goal of AI research. Neuromorphic hardware implementing
Spiking Neural Networks (SNNs) are particularly attractive in this regard, as
their real-time, event-based, local computing paradigm makes them suitable for
edge impl... | [
{
"created": "Wed, 26 Jan 2022 06:53:46 GMT",
"version": "v1"
}
] | 2022-01-27 | [
[
"Stewart",
"Kenneth",
""
],
[
"Neftci",
"Emre",
""
]
] | Adaptive "life-long" learning at the edge and during online task performance is an aspirational goal of AI research. Neuromorphic hardware implementing Spiking Neural Networks (SNNs) are particularly attractive in this regard, as their real-time, event-based, local computing paradigm makes them suitable for edge implem... |
1404.2514 | Arnob Ghosh | Arnob Ghosh and Saswati Sarkar | Quality Sensitive Price Competition in Spectrum Oligopoly:Part 1 | Accepted for publication in IEEE/ACM Transactions on Networking. 41
pages single column format.Conference version is available at arXiv:1305.3351 | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate a spectrum oligopoly market where primaries lease their
channels to secondaries in lieu of financial remuneration. Transmission quality
of a channel evolves randomly. Each primary has to select the price it would
quote without knowing the transmission qualities of its competitors' channels.
Each second... | [
{
"created": "Sun, 6 Apr 2014 04:14:03 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Nov 2014 04:41:16 GMT",
"version": "v2"
},
{
"created": "Sat, 18 Apr 2015 07:59:17 GMT",
"version": "v3"
},
{
"created": "Thu, 21 May 2015 07:39:43 GMT",
"version": "v4"
}
] | 2015-05-22 | [
[
"Ghosh",
"Arnob",
""
],
[
"Sarkar",
"Saswati",
""
]
] | We investigate a spectrum oligopoly market where primaries lease their channels to secondaries in lieu of financial remuneration. Transmission quality of a channel evolves randomly. Each primary has to select the price it would quote without knowing the transmission qualities of its competitors' channels. Each secondar... |
2401.13850 | Nayoung Kim | Nayoung Kim, Myke C. Cohen, Yang Ba, Anna Pan, Shawaiz Bhatti, Pouria
Salehi, James Sung, Erik Blasch, Michelle V. Mancenido, Erin K. Chiou | PADTHAI-MM: A Principled Approach for Designing Trustable,
Human-centered AI systems using the MAST Methodology | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Designing for AI trustworthiness is challenging, with a lack of practical
guidance despite extensive literature on trust. The Multisource AI Scorecard
Table (MAST), a checklist rating system, addresses this gap in designing and
evaluating AI-enabled decision support systems. We propose the Principled
Approach for Des... | [
{
"created": "Wed, 24 Jan 2024 23:15:44 GMT",
"version": "v1"
}
] | 2024-01-26 | [
[
"Kim",
"Nayoung",
""
],
[
"Cohen",
"Myke C.",
""
],
[
"Ba",
"Yang",
""
],
[
"Pan",
"Anna",
""
],
[
"Bhatti",
"Shawaiz",
""
],
[
"Salehi",
"Pouria",
""
],
[
"Sung",
"James",
""
],
[
"Blasch",
"Er... | Designing for AI trustworthiness is challenging, with a lack of practical guidance despite extensive literature on trust. The Multisource AI Scorecard Table (MAST), a checklist rating system, addresses this gap in designing and evaluating AI-enabled decision support systems. We propose the Principled Approach for Desig... |
2111.07274 | Auriol Degbelo | Viktor Gorte, Auriol Degbelo | Choriented Maps: Visualizing SDG Data on Mobile Devices | Accepted for publication in the Cartographic Journal | null | 10.1080/00087041.2021.1986616 | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Choropleth maps and graduated symbol maps are often used to visualize
quantitative geographic data. However, as the number of classes grows,
distinguishing between adjacent classes increasingly becomes challenging. To
mitigate this issue, this work introduces two new visualization types:
choriented maps (maps that us... | [
{
"created": "Sun, 14 Nov 2021 08:19:20 GMT",
"version": "v1"
},
{
"created": "Wed, 4 May 2022 15:37:07 GMT",
"version": "v2"
}
] | 2022-05-05 | [
[
"Gorte",
"Viktor",
""
],
[
"Degbelo",
"Auriol",
""
]
] | Choropleth maps and graduated symbol maps are often used to visualize quantitative geographic data. However, as the number of classes grows, distinguishing between adjacent classes increasingly becomes challenging. To mitigate this issue, this work introduces two new visualization types: choriented maps (maps that use ... |
2207.12646 | Ashima Garg | Ashima Garg, Depanshu Sani, Saket Anand | Learning Hierarchy Aware Features for Reducing Mistake Severity | 21 pages, 7 figures, Accepted in ECCV 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Label hierarchies are often available apriori as part of biological taxonomy
or language datasets WordNet. Several works exploit these to learn hierarchy
aware features in order to improve the classifier to make semantically
meaningful mistakes while maintaining or reducing the overall error. In this
paper, we propos... | [
{
"created": "Tue, 26 Jul 2022 04:24:47 GMT",
"version": "v1"
}
] | 2022-07-27 | [
[
"Garg",
"Ashima",
""
],
[
"Sani",
"Depanshu",
""
],
[
"Anand",
"Saket",
""
]
] | Label hierarchies are often available apriori as part of biological taxonomy or language datasets WordNet. Several works exploit these to learn hierarchy aware features in order to improve the classifier to make semantically meaningful mistakes while maintaining or reducing the overall error. In this paper, we propose ... |
1312.4826 | Elena Zattoni | Elena Zattoni | Geometric Methods for Invariant-Zero Cancellation in Linear
Multivariable Systems: Illustrative Examples | With respect to version 1, cross references to [1] have been revised | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This note presents some numerical examples worked out in order to show the
reader how to implement, within a widely accessible computational setting, the
methodology for achieving zero cancellation in linear multivariable systems
discussed in [1]. The results are evaluated in the light of applicability and
performanc... | [
{
"created": "Tue, 17 Dec 2013 15:39:00 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Dec 2013 10:50:33 GMT",
"version": "v2"
}
] | 2013-12-30 | [
[
"Zattoni",
"Elena",
""
]
] | This note presents some numerical examples worked out in order to show the reader how to implement, within a widely accessible computational setting, the methodology for achieving zero cancellation in linear multivariable systems discussed in [1]. The results are evaluated in the light of applicability and performance ... |
1910.02521 | Thorsten Wissmann | G. Michele Pinna | Representing Dependencies in Event Structures | null | Logical Methods in Computer Science, Volume 16, Issue 2 (May 13,
2020) lmcs:5816 | 10.23638/LMCS-16(2:3)2020 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | Event structures where the causality may explicitly change during a
computation have recently gained the stage. In this kind of event structures
the changes in the set of the causes of an event are triggered by modifiers
that may add or remove dependencies, thus making the happening of an event
contextual. Still the ... | [
{
"created": "Sun, 6 Oct 2019 20:39:58 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Feb 2020 14:49:33 GMT",
"version": "v2"
},
{
"created": "Mon, 11 May 2020 14:40:12 GMT",
"version": "v3"
},
{
"created": "Tue, 12 May 2020 06:49:58 GMT",
"version": "v4"
}
] | 2023-06-22 | [
[
"Pinna",
"G. Michele",
""
]
] | Event structures where the causality may explicitly change during a computation have recently gained the stage. In this kind of event structures the changes in the set of the causes of an event are triggered by modifiers that may add or remove dependencies, thus making the happening of an event contextual. Still the fo... |
1703.00900 | Manuela Fischer | Manuela Fischer | Improved Deterministic Distributed Matching via Rounding | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present improved deterministic distributed algorithms for a number of
well-studied matching problems, which are simpler, faster, more accurate,
and/or more general than their known counterparts. The common denominator of
these results is a deterministic distributed rounding method for certain linear
programs, whic... | [
{
"created": "Thu, 2 Mar 2017 18:55:52 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Aug 2017 17:37:55 GMT",
"version": "v2"
}
] | 2017-08-08 | [
[
"Fischer",
"Manuela",
""
]
] | We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which ... |
1408.3458 | Bo Zhou | Bo Zhou, Ying Cui, Meixia Tao | Stochastic Throughput Optimization for Two-hop Systems with Finite Relay
Buffers | 15 pages, double-column, 9 figures, 3 tables. Accepted by IEEE
Transaction on Signal Processing | null | 10.1109/TSP.2015.2452225 | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optimal queueing control of multi-hop networks remains a challenging problem
even in the simplest scenarios. In this paper, we consider a two-hop
half-duplex relaying system with random channel connectivity. The relay is
equipped with a finite buffer. We focus on stochastic link selection and
transmission rate contro... | [
{
"created": "Fri, 15 Aug 2014 02:38:37 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Mar 2015 05:50:01 GMT",
"version": "v2"
},
{
"created": "Sat, 29 Aug 2015 11:53:02 GMT",
"version": "v3"
}
] | 2015-10-28 | [
[
"Zhou",
"Bo",
""
],
[
"Cui",
"Ying",
""
],
[
"Tao",
"Meixia",
""
]
] | Optimal queueing control of multi-hop networks remains a challenging problem even in the simplest scenarios. In this paper, we consider a two-hop half-duplex relaying system with random channel connectivity. The relay is equipped with a finite buffer. We focus on stochastic link selection and transmission rate control ... |
1901.10757 | Nicolas Gillis | Nicolas Gillis, Le Thi Khanh Hien, Valentin Leplat, Vincent Y. F. Tan | Distributionally Robust and Multi-Objective Nonnegative Matrix
Factorization | Accepted in IEEE Trans. on Pattern Analysis and Machine Intelligence | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nonnegative matrix factorization (NMF) is a linear dimensionality reduction
technique for analyzing nonnegative data. A key aspect of NMF is the choice of
the objective function that depends on the noise model (or statistics of the
noise) assumed on the data. In many applications, the noise model is unknown
and diffi... | [
{
"created": "Wed, 30 Jan 2019 10:41:21 GMT",
"version": "v1"
},
{
"created": "Thu, 31 Jan 2019 08:21:00 GMT",
"version": "v2"
},
{
"created": "Tue, 9 Feb 2021 07:51:30 GMT",
"version": "v3"
}
] | 2021-02-10 | [
[
"Gillis",
"Nicolas",
""
],
[
"Hien",
"Le Thi Khanh",
""
],
[
"Leplat",
"Valentin",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] | Nonnegative matrix factorization (NMF) is a linear dimensionality reduction technique for analyzing nonnegative data. A key aspect of NMF is the choice of the objective function that depends on the noise model (or statistics of the noise) assumed on the data. In many applications, the noise model is unknown and difficu... |
2102.13156 | Naoya Takeishi | Naoya Takeishi and Alexandros Kalousis | Physics-Integrated Variational Autoencoders for Robust and Interpretable
Generative Modeling | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Integrating physics models within machine learning models holds considerable
promise toward learning robust models with improved interpretability and
abilities to extrapolate. In this work, we focus on the integration of
incomplete physics models into deep generative models. In particular, we
introduce an architectur... | [
{
"created": "Thu, 25 Feb 2021 20:28:52 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Jun 2021 08:03:42 GMT",
"version": "v2"
},
{
"created": "Tue, 26 Oct 2021 19:14:57 GMT",
"version": "v3"
}
] | 2021-10-28 | [
[
"Takeishi",
"Naoya",
""
],
[
"Kalousis",
"Alexandros",
""
]
] | Integrating physics models within machine learning models holds considerable promise toward learning robust models with improved interpretability and abilities to extrapolate. In this work, we focus on the integration of incomplete physics models into deep generative models. In particular, we introduce an architecture ... |
2007.08284 | Saeideh Nabipour | Saeideh Nabipour, Gholamreza Zare Fatin, Javad Javidan | Area- Efficient VLSI Implementation of Serial-In Parallel-Out Multiplier
Using Polynomial Representation in Finite Field GF(2m) | The simulation results needs to be to verified | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Finite field multiplier is mainly used in error-correcting codes and signal
processing. Finite field multiplier is regarded as the bottleneck arithmetic
unit for such applications and it is the most complicated operation over finite
field GF(2m) which requires a huge amount of logic resources. In this paper, a
new mo... | [
{
"created": "Thu, 16 Jul 2020 12:20:30 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Sep 2022 17:48:17 GMT",
"version": "v2"
},
{
"created": "Thu, 17 Nov 2022 14:35:13 GMT",
"version": "v3"
},
{
"created": "Tue, 12 Sep 2023 15:38:31 GMT",
"version": "v4"
},
{
"c... | 2023-09-15 | [
[
"Nabipour",
"Saeideh",
""
],
[
"Fatin",
"Gholamreza Zare",
""
],
[
"Javidan",
"Javad",
""
]
] | Finite field multiplier is mainly used in error-correcting codes and signal processing. Finite field multiplier is regarded as the bottleneck arithmetic unit for such applications and it is the most complicated operation over finite field GF(2m) which requires a huge amount of logic resources. In this paper, a new modi... |
2301.01894 | Anthony Vanky | Anthony Vanky and Ri Le | Urban-Semantic Computer Vision: A Framework for Contextual Understanding
of People in Urban Spaces | 21 pages, 3 figures | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Increasing computational power and improving deep learning methods have made
computer vision technologies pervasively common in urban environments. Their
applications in policing, traffic management, and documenting public spaces are
increasingly common. Despite the often-discussed biases in the algorithms'
training ... | [
{
"created": "Thu, 5 Jan 2023 03:44:03 GMT",
"version": "v1"
}
] | 2023-01-06 | [
[
"Vanky",
"Anthony",
""
],
[
"Le",
"Ri",
""
]
] | Increasing computational power and improving deep learning methods have made computer vision technologies pervasively common in urban environments. Their applications in policing, traffic management, and documenting public spaces are increasingly common. Despite the often-discussed biases in the algorithms' training an... |
2208.10483 | Shivakanth Sujit | Shivakanth Sujit, Somjit Nath, Pedro H. M. Braga, Samira Ebrahimi
Kahou | Prioritizing Samples in Reinforcement Learning with Reducible Loss | NeurIPS 2023 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Most reinforcement learning algorithms take advantage of an experience replay
buffer to repeatedly train on samples the agent has observed in the past. Not
all samples carry the same amount of significance and simply assigning equal
importance to each of the samples is a na\"ive strategy. In this paper, we
propose a ... | [
{
"created": "Mon, 22 Aug 2022 17:55:43 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Jan 2023 17:58:55 GMT",
"version": "v2"
},
{
"created": "Wed, 1 Nov 2023 15:06:08 GMT",
"version": "v3"
}
] | 2023-11-02 | [
[
"Sujit",
"Shivakanth",
""
],
[
"Nath",
"Somjit",
""
],
[
"Braga",
"Pedro H. M.",
""
],
[
"Kahou",
"Samira Ebrahimi",
""
]
] | Most reinforcement learning algorithms take advantage of an experience replay buffer to repeatedly train on samples the agent has observed in the past. Not all samples carry the same amount of significance and simply assigning equal importance to each of the samples is a na\"ive strategy. In this paper, we propose a me... |
2105.12810 | Md Hasib Zunair | Hasib Zunair, Aimon Rahman, and Nabeel Mohammed | ViPTT-Net: Video pretraining of spatio-temporal model for tuberculosis
type classification from chest CT scans | Under review at CLEF 2021. 10 pages | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Pretraining has sparked groundswell of interest in deep learning workflows to
learn from limited data and improve generalization. While this is common for 2D
image classification tasks, its application to 3D medical imaging tasks like
chest CT interpretation is limited. We explore the idea of whether pretraining
a mo... | [
{
"created": "Wed, 26 May 2021 20:00:31 GMT",
"version": "v1"
}
] | 2021-05-28 | [
[
"Zunair",
"Hasib",
""
],
[
"Rahman",
"Aimon",
""
],
[
"Mohammed",
"Nabeel",
""
]
] | Pretraining has sparked groundswell of interest in deep learning workflows to learn from limited data and improve generalization. While this is common for 2D image classification tasks, its application to 3D medical imaging tasks like chest CT interpretation is limited. We explore the idea of whether pretraining a mode... |
2301.13082 | Yingfang Yuan | Zuhao Yang, Huajun Bai, Zhang Luo, Yang Xu, Wei Pang, Yue Wang,
Yisheng Yuan, Yingfang Yuan | PaCaNet: A Study on CycleGAN with Transfer Learning for Diversifying
Fused Chinese Painting and Calligraphy | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | AI-Generated Content (AIGC) has recently gained a surge in popularity,
powered by its high efficiency and consistency in production, and its
capability of being customized and diversified. The cross-modality nature of
the representation learning mechanism in most AIGC technology allows for more
freedom and flexibilit... | [
{
"created": "Mon, 30 Jan 2023 17:22:10 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Jan 2023 03:50:44 GMT",
"version": "v2"
},
{
"created": "Wed, 1 Feb 2023 12:19:42 GMT",
"version": "v3"
},
{
"created": "Thu, 4 May 2023 14:33:51 GMT",
"version": "v4"
},
{
"cre... | 2023-05-23 | [
[
"Yang",
"Zuhao",
""
],
[
"Bai",
"Huajun",
""
],
[
"Luo",
"Zhang",
""
],
[
"Xu",
"Yang",
""
],
[
"Pang",
"Wei",
""
],
[
"Wang",
"Yue",
""
],
[
"Yuan",
"Yisheng",
""
],
[
"Yuan",
"Yingfang",
"... | AI-Generated Content (AIGC) has recently gained a surge in popularity, powered by its high efficiency and consistency in production, and its capability of being customized and diversified. The cross-modality nature of the representation learning mechanism in most AIGC technology allows for more freedom and flexibility ... |
2009.11806 | Adrian Jackson | Adrian Jackson, Mich\`ele Weiland, Nick Brown, Andrew Turner, Mark
Parsons | Investigating Applications on the A64FX | null | null | null | null | cs.PF | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The A64FX processor from Fujitsu, being designed for computational simulation
and machine learning applications, has the potential for unprecedented
performance in HPC systems. In this paper, we evaluate the A64FX by
benchmarking against a range of production HPC platforms that cover a number of
processor technologie... | [
{
"created": "Thu, 24 Sep 2020 16:49:24 GMT",
"version": "v1"
}
] | 2020-09-25 | [
[
"Jackson",
"Adrian",
""
],
[
"Weiland",
"Michèle",
""
],
[
"Brown",
"Nick",
""
],
[
"Turner",
"Andrew",
""
],
[
"Parsons",
"Mark",
""
]
] | The A64FX processor from Fujitsu, being designed for computational simulation and machine learning applications, has the potential for unprecedented performance in HPC systems. In this paper, we evaluate the A64FX by benchmarking against a range of production HPC platforms that cover a number of processor technologies.... |
2310.16919 | Fei Jianwei Dr | Jianwei Fei, Zhihua Xia, Benedetta Tondi, Mauro Barni | Wide Flat Minimum Watermarking for Robust Ownership Verification of GANs | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel multi-bit box-free watermarking method for the protection
of Intellectual Property Rights (IPR) of GANs with improved robustness against
white-box attacks like fine-tuning, pruning, quantization, and surrogate model
attacks. The watermark is embedded by adding an extra watermarking loss term
during... | [
{
"created": "Wed, 25 Oct 2023 18:38:10 GMT",
"version": "v1"
}
] | 2023-10-27 | [
[
"Fei",
"Jianwei",
""
],
[
"Xia",
"Zhihua",
""
],
[
"Tondi",
"Benedetta",
""
],
[
"Barni",
"Mauro",
""
]
] | We propose a novel multi-bit box-free watermarking method for the protection of Intellectual Property Rights (IPR) of GANs with improved robustness against white-box attacks like fine-tuning, pruning, quantization, and surrogate model attacks. The watermark is embedded by adding an extra watermarking loss term during G... |
1901.02283 | Thach V. Bui | Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen | Improved encoding and decoding for non-adaptive threshold group testing | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of threshold group testing is to identify up to $d$ defective items
among a population of $n$ items, where $d$ is usually much smaller than $n$. A
test is positive if it has at least $u$ defective items and negative otherwise.
Our objective is to identify defective items in sublinear time the number of
items... | [
{
"created": "Tue, 8 Jan 2019 12:34:31 GMT",
"version": "v1"
}
] | 2019-01-09 | [
[
"Bui",
"Thach V.",
""
],
[
"Kuribayashi",
"Minoru",
""
],
[
"Cheraghchi",
"Mahdi",
""
],
[
"Echizen",
"Isao",
""
]
] | The goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. A test is positive if it has at least $u$ defective items and negative otherwise. Our objective is to identify defective items in sublinear time the number of items, ... |
2103.09174 | Meher Shashwat Nigam | Meher Shashwat Nigam, Avinash Prabhu, Anurag Sahu, Puru Gupta, Tanvi
Karandikar, N. Sai Shankar, Ravi Kiran Sarvadevabhatla, K. Madhava Krishna | Monocular Multi-Layer Layout Estimation for Warehouse Racks | Visit our project repository at
https://github.com/Avinash2468/RackLay | null | 10.1145/3490035.3490263 | null | cs.CV cs.RO | http://creativecommons.org/licenses/by/4.0/ | Given a monocular colour image of a warehouse rack, we aim to predict the
bird's-eye view layout for each shelf in the rack, which we term as multi-layer
layout prediction. To this end, we present RackLay, a deep neural network for
real-time shelf layout estimation from a single image. Unlike previous layout
estimati... | [
{
"created": "Tue, 16 Mar 2021 16:22:31 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Mar 2021 10:58:36 GMT",
"version": "v2"
},
{
"created": "Thu, 28 Oct 2021 17:00:21 GMT",
"version": "v3"
}
] | 2021-10-29 | [
[
"Nigam",
"Meher Shashwat",
""
],
[
"Prabhu",
"Avinash",
""
],
[
"Sahu",
"Anurag",
""
],
[
"Gupta",
"Puru",
""
],
[
"Karandikar",
"Tanvi",
""
],
[
"Shankar",
"N. Sai",
""
],
[
"Sarvadevabhatla",
"Ravi Kiran",
... | Given a monocular colour image of a warehouse rack, we aim to predict the bird's-eye view layout for each shelf in the rack, which we term as multi-layer layout prediction. To this end, we present RackLay, a deep neural network for real-time shelf layout estimation from a single image. Unlike previous layout estimation... |
2402.04598 | Sarah Sch\"ombs | Sarah Sch\"ombs, Jorge Goncalves, Wafa Johal | Exploring Data Agency and Autonomous Agents as Embodied Data
Visualizations | 2 pages, 1 figure, Presented as poster at 2023 IEEE Visualization
Conference (VIS) | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the light of recent advances in embodied data visualizations, we aim to
shed light on agency in the context of data visualization. To do so, we
introduce Data Agency and Data-Agent Interplay as potential terms and research
focus. Furthermore, we exemplify the former in the context of human-robot
interaction, and i... | [
{
"created": "Wed, 7 Feb 2024 05:45:34 GMT",
"version": "v1"
}
] | 2024-02-08 | [
[
"Schömbs",
"Sarah",
""
],
[
"Goncalves",
"Jorge",
""
],
[
"Johal",
"Wafa",
""
]
] | In the light of recent advances in embodied data visualizations, we aim to shed light on agency in the context of data visualization. To do so, we introduce Data Agency and Data-Agent Interplay as potential terms and research focus. Furthermore, we exemplify the former in the context of human-robot interaction, and ide... |
2103.11429 | Md Abdullah Al Alamin | Md Abdullah Al Alamin, Sanjay Malakar, Gias Uddin, Sadia Afroz, Tameem
Bin Haider, Anindya Iqbal | An Empirical Study of Developer Discussions on Low-Code Software
Development Challenges | null | 2021 IEEE/ACM 18th International Conference on Mining Software
Repositories (MSR) | 10.1109/MSR52588.2021.00018 | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Low-code software development (LCSD) is an emerging paradigm that combines
minimal source code with interactive graphical interfaces to promote rapid
application development. LCSD aims to democratize application development to
software practitioners with diverse backgrounds. Given that LCSD is relatively
a new paradi... | [
{
"created": "Sun, 21 Mar 2021 16:24:43 GMT",
"version": "v1"
}
] | 2022-01-05 | [
[
"Alamin",
"Md Abdullah Al",
""
],
[
"Malakar",
"Sanjay",
""
],
[
"Uddin",
"Gias",
""
],
[
"Afroz",
"Sadia",
""
],
[
"Haider",
"Tameem Bin",
""
],
[
"Iqbal",
"Anindya",
""
]
] | Low-code software development (LCSD) is an emerging paradigm that combines minimal source code with interactive graphical interfaces to promote rapid application development. LCSD aims to democratize application development to software practitioners with diverse backgrounds. Given that LCSD is relatively a new paradigm... |
2305.00195 | Zachary Izzo | Zachary Izzo, Ruishan Liu, James Zou | Data-Driven Subgroup Identification for Linear Regression | Accepted at ICML 2023 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Medical studies frequently require to extract the relationship between each
covariate and the outcome with statistical confidence measures. To do this,
simple parametric models are frequently used (e.g. coefficients of linear
regression) but usually fitted on the whole dataset. However, it is common that
the covariat... | [
{
"created": "Sat, 29 Apr 2023 08:32:09 GMT",
"version": "v1"
}
] | 2023-05-02 | [
[
"Izzo",
"Zachary",
""
],
[
"Liu",
"Ruishan",
""
],
[
"Zou",
"James",
""
]
] | Medical studies frequently require to extract the relationship between each covariate and the outcome with statistical confidence measures. To do this, simple parametric models are frequently used (e.g. coefficients of linear regression) but usually fitted on the whole dataset. However, it is common that the covariates... |
2010.03232 | Mohamed-Lamine Messai | Mohamed-Lamine Messai and Hamida Seba | Short Paper: Privacy Comparison of Contact Tracing Mobile Applications
for COVID-19 | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | With the COVID-19 pandemic, quarantines took place across the globe. In the
aim of stopping or slowing the progression of the COVID-19 contamination, many
countries have deployed a contact tracing system to notify persons that be in
contact with a COVID-positive person. The contact tracing system is implemented
in a ... | [
{
"created": "Wed, 7 Oct 2020 07:27:39 GMT",
"version": "v1"
}
] | 2020-10-09 | [
[
"Messai",
"Mohamed-Lamine",
""
],
[
"Seba",
"Hamida",
""
]
] | With the COVID-19 pandemic, quarantines took place across the globe. In the aim of stopping or slowing the progression of the COVID-19 contamination, many countries have deployed a contact tracing system to notify persons that be in contact with a COVID-positive person. The contact tracing system is implemented in a mo... |
2310.10765 | Yu Gu | Yu Gu, Jianwei Yang, Naoto Usuyama, Chunyuan Li, Sheng Zhang, Matthew
P. Lungren, Jianfeng Gao, Hoifung Poon | BiomedJourney: Counterfactual Biomedical Image Generation by
Instruction-Learning from Multimodal Patient Journeys | Project page & demo: https://aka.ms/biomedjourney | null | null | null | cs.CV cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rapid progress has been made in instruction-learning for image editing with
natural-language instruction, as exemplified by InstructPix2Pix. In
biomedicine, such methods can be applied to counterfactual image generation,
which helps differentiate causal structure from spurious correlation and
facilitate robust image ... | [
{
"created": "Mon, 16 Oct 2023 18:59:31 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Oct 2023 23:26:21 GMT",
"version": "v2"
},
{
"created": "Sat, 21 Oct 2023 02:59:47 GMT",
"version": "v3"
}
] | 2023-10-24 | [
[
"Gu",
"Yu",
""
],
[
"Yang",
"Jianwei",
""
],
[
"Usuyama",
"Naoto",
""
],
[
"Li",
"Chunyuan",
""
],
[
"Zhang",
"Sheng",
""
],
[
"Lungren",
"Matthew P.",
""
],
[
"Gao",
"Jianfeng",
""
],
[
"Poon",
... | Rapid progress has been made in instruction-learning for image editing with natural-language instruction, as exemplified by InstructPix2Pix. In biomedicine, such methods can be applied to counterfactual image generation, which helps differentiate causal structure from spurious correlation and facilitate robust image in... |
2407.16129 | Yusi Zhang | Weiying Xie and Yusi Zhang and Tianlin Hui and Jiaqing Zhang and Jie
Lei and Yunsong Li | FoRA: Low-Rank Adaptation Model beyond Multimodal Siamese Network | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multimodal object detection offers a promising prospect to facilitate robust
detection in various visual conditions. However, existing two-stream backbone
networks are challenged by complex fusion and substantial parameter increments.
This is primarily due to large data distribution biases of multimodal
homogeneous i... | [
{
"created": "Tue, 23 Jul 2024 02:27:52 GMT",
"version": "v1"
}
] | 2024-07-24 | [
[
"Xie",
"Weiying",
""
],
[
"Zhang",
"Yusi",
""
],
[
"Hui",
"Tianlin",
""
],
[
"Zhang",
"Jiaqing",
""
],
[
"Lei",
"Jie",
""
],
[
"Li",
"Yunsong",
""
]
] | Multimodal object detection offers a promising prospect to facilitate robust detection in various visual conditions. However, existing two-stream backbone networks are challenged by complex fusion and substantial parameter increments. This is primarily due to large data distribution biases of multimodal homogeneous inf... |
1910.07604 | Jacob Pfau | Jacob Pfau, Albert T. Young, Maria L. Wei, Michael J. Keiser | Global Saliency: Aggregating Saliency Maps to Assess Dataset Artefact
Bias | Machine Learning for Health (ML4H) at NeurIPS 2019 - Extended
Abstract | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In high-stakes applications of machine learning models, interpretability
methods provide guarantees that models are right for the right reasons. In
medical imaging, saliency maps have become the standard tool for determining
whether a neural model has learned relevant robust features, rather than
artefactual noise. H... | [
{
"created": "Wed, 16 Oct 2019 20:45:19 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Dec 2019 00:14:28 GMT",
"version": "v2"
}
] | 2019-12-05 | [
[
"Pfau",
"Jacob",
""
],
[
"Young",
"Albert T.",
""
],
[
"Wei",
"Maria L.",
""
],
[
"Keiser",
"Michael J.",
""
]
] | In high-stakes applications of machine learning models, interpretability methods provide guarantees that models are right for the right reasons. In medical imaging, saliency maps have become the standard tool for determining whether a neural model has learned relevant robust features, rather than artefactual noise. How... |
2405.00718 | Jianyi Zhang | Xu Ji, Jianyi Zhang, Ziyin Zhou, Zhangchi Zhao, Qianqian Qiao, Kaiying
Han, Md Imran Hossen and Xiali Hei | Can't say cant? Measuring and Reasoning of Dark Jargons in Large
Language Models | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ensuring the resilience of Large Language Models (LLMs) against malicious
exploitation is paramount, with recent focus on mitigating offensive responses.
Yet, the understanding of cant or dark jargon remains unexplored. This paper
introduces a domain-specific Cant dataset and CantCounter evaluation framework,
employi... | [
{
"created": "Thu, 25 Apr 2024 17:25:53 GMT",
"version": "v1"
}
] | 2024-05-03 | [
[
"Ji",
"Xu",
""
],
[
"Zhang",
"Jianyi",
""
],
[
"Zhou",
"Ziyin",
""
],
[
"Zhao",
"Zhangchi",
""
],
[
"Qiao",
"Qianqian",
""
],
[
"Han",
"Kaiying",
""
],
[
"Hossen",
"Md Imran",
""
],
[
"Hei",
"Xi... | Ensuring the resilience of Large Language Models (LLMs) against malicious exploitation is paramount, with recent focus on mitigating offensive responses. Yet, the understanding of cant or dark jargon remains unexplored. This paper introduces a domain-specific Cant dataset and CantCounter evaluation framework, employing... |
2301.10123 | Henry Moss | Henry B. Moss, Sebastian W. Ober and Victor Picheny | Inducing Point Allocation for Sparse Gaussian Processes in
High-Throughput Bayesian Optimisation | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Sparse Gaussian Processes are a key component of high-throughput Bayesian
Optimisation (BO) loops; however, we show that existing methods for allocating
their inducing points severely hamper optimisation performance. By exploiting
the quality-diversity decomposition of Determinantal Point Processes, we
propose the fi... | [
{
"created": "Tue, 24 Jan 2023 16:43:29 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Feb 2023 16:07:36 GMT",
"version": "v2"
}
] | 2023-02-24 | [
[
"Moss",
"Henry B.",
""
],
[
"Ober",
"Sebastian W.",
""
],
[
"Picheny",
"Victor",
""
]
] | Sparse Gaussian Processes are a key component of high-throughput Bayesian Optimisation (BO) loops; however, we show that existing methods for allocating their inducing points severely hamper optimisation performance. By exploiting the quality-diversity decomposition of Determinantal Point Processes, we propose the firs... |
2106.10686 | Liulei Li | Tianfei Zhou, Liulei Li, Gustav Bredell, Jianwu Li, Ender Konukoglu | Quality-Aware Memory Network for Interactive Volumetric Image
Segmentation | MICCAI 2021. Code: https://github.com/0liliulei/Mem3D | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Despite recent progress of automatic medical image segmentation techniques,
fully automatic results usually fail to meet the clinical use and typically
require further refinement. In this work, we propose a quality-aware memory
network for interactive segmentation of 3D medical images. Provided by user
guidance on an... | [
{
"created": "Sun, 20 Jun 2021 12:34:19 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Jul 2021 07:52:19 GMT",
"version": "v2"
}
] | 2021-07-06 | [
[
"Zhou",
"Tianfei",
""
],
[
"Li",
"Liulei",
""
],
[
"Bredell",
"Gustav",
""
],
[
"Li",
"Jianwu",
""
],
[
"Konukoglu",
"Ender",
""
]
] | Despite recent progress of automatic medical image segmentation techniques, fully automatic results usually fail to meet the clinical use and typically require further refinement. In this work, we propose a quality-aware memory network for interactive segmentation of 3D medical images. Provided by user guidance on an a... |
2112.08723 | Zekun Wang | Zekun Wang, Wenhui Wang, Haichao Zhu, Ming Liu, Bing Qin, Furu Wei | Distilled Dual-Encoder Model for Vision-Language Understanding | EMNLP 2022 | null | null | null | cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a cross-modal attention distillation framework to train a
dual-encoder model for vision-language understanding tasks, such as visual
reasoning and visual question answering. Dual-encoder models have a faster
inference speed than fusion-encoder models and enable the pre-computation of
images and text during... | [
{
"created": "Thu, 16 Dec 2021 09:21:18 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Oct 2022 16:27:09 GMT",
"version": "v2"
}
] | 2022-10-18 | [
[
"Wang",
"Zekun",
""
],
[
"Wang",
"Wenhui",
""
],
[
"Zhu",
"Haichao",
""
],
[
"Liu",
"Ming",
""
],
[
"Qin",
"Bing",
""
],
[
"Wei",
"Furu",
""
]
] | We propose a cross-modal attention distillation framework to train a dual-encoder model for vision-language understanding tasks, such as visual reasoning and visual question answering. Dual-encoder models have a faster inference speed than fusion-encoder models and enable the pre-computation of images and text during i... |
2203.15381 | Shi Pu | Shi Pu and Kaili Zhao and Mao Zheng | Alignment-Uniformity aware Representation Learning for Zero-shot Video
Classification | CVPR 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Most methods tackle zero-shot video classification by aligning
visual-semantic representations within seen classes, which limits
generalization to unseen classes. To enhance model generalizability, this paper
presents an end-to-end framework that preserves alignment and uniformity
properties for representations on bo... | [
{
"created": "Tue, 29 Mar 2022 09:21:22 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Pu",
"Shi",
""
],
[
"Zhao",
"Kaili",
""
],
[
"Zheng",
"Mao",
""
]
] | Most methods tackle zero-shot video classification by aligning visual-semantic representations within seen classes, which limits generalization to unseen classes. To enhance model generalizability, this paper presents an end-to-end framework that preserves alignment and uniformity properties for representations on both... |
0907.3016 | Arash Rafiey | Arash Rafiey and Pavol Hell | Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms | null | null | null | null | cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Min-Max orderings correspond to conservative lattice polymorphisms. Digraphs
with Min-Max orderings have polynomial time solvable minimum cost homomorphism
problems. They can also be viewed as digraph analogues of proper interval
graphs and bigraphs.
We give a forbidden structure characterization of digraphs with a... | [
{
"created": "Fri, 17 Jul 2009 08:14:15 GMT",
"version": "v1"
}
] | 2009-07-20 | [
[
"Rafiey",
"Arash",
""
],
[
"Hell",
"Pavol",
""
]
] | Min-Max orderings correspond to conservative lattice polymorphisms. Digraphs with Min-Max orderings have polynomial time solvable minimum cost homomorphism problems. They can also be viewed as digraph analogues of proper interval graphs and bigraphs. We give a forbidden structure characterization of digraphs with a Min... |
1805.02994 | Christine Markarian Dr | Christine Markarian | Online Connected Dominating Set Leasing | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the \emph{Online Connected Dominating Set Leasing} problem
(OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set
$\mathcal{L}$ of lease types each characterized by a duration and cost, and a
sequence of subsets of $V$ arriving over time. A node can be leased using lease
type $l$... | [
{
"created": "Mon, 7 May 2018 10:48:30 GMT",
"version": "v1"
}
] | 2018-05-09 | [
[
"Markarian",
"Christine",
""
]
] | We introduce the \emph{Online Connected Dominating Set Leasing} problem (OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set $\mathcal{L}$ of lease types each characterized by a duration and cost, and a sequence of subsets of $V$ arriving over time. A node can be leased using lease type $l$ f... |
2309.13498 | Saraju Mohanty | Ahmad J. Alkhodair and Saraju P. Mohanty and Elias Kougianos | Consensus Algorithms of Distributed Ledger Technology -- A Comprehensive
Analysis | 50 pages, 20 figures | null | null | null | cs.DC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The most essential component of every Distributed Ledger Technology (DLT) is
the Consensus Algorithm (CA), which enables users to reach a consensus in a
decentralized and distributed manner. Numerous CA exist, but their viability
for particular applications varies, making their trade-offs a crucial factor to
consider... | [
{
"created": "Sat, 23 Sep 2023 23:32:11 GMT",
"version": "v1"
}
] | 2023-09-26 | [
[
"Alkhodair",
"Ahmad J.",
""
],
[
"Mohanty",
"Saraju P.",
""
],
[
"Kougianos",
"Elias",
""
]
] | The most essential component of every Distributed Ledger Technology (DLT) is the Consensus Algorithm (CA), which enables users to reach a consensus in a decentralized and distributed manner. Numerous CA exist, but their viability for particular applications varies, making their trade-offs a crucial factor to consider w... |
1905.04409 | Bao Trung Chu | Bao Trung Chu, Kenji Hashimoto, and Hiroyuki Seki | On the Compositionality of Dynamic Leakage and Its Application to the
Quantification Problem | preprint | null | null | null | cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantitative information flow (QIF) is traditionally defined as the expected
value of information leakage over all feasible program runs and it fails to
identify vulnerable programs where only limited number of runs leak large
amount of information. As discussed in Bielova (2016), a good notion for
dynamic leakage an... | [
{
"created": "Sat, 11 May 2019 00:06:43 GMT",
"version": "v1"
}
] | 2019-05-14 | [
[
"Chu",
"Bao Trung",
""
],
[
"Hashimoto",
"Kenji",
""
],
[
"Seki",
"Hiroyuki",
""
]
] | Quantitative information flow (QIF) is traditionally defined as the expected value of information leakage over all feasible program runs and it fails to identify vulnerable programs where only limited number of runs leak large amount of information. As discussed in Bielova (2016), a good notion for dynamic leakage and ... |
2211.05700 | Thiago Felicissimo | Thiago Felicissimo, Fr\'ed\'eric Blanqui and Ashish Kumar Barnawal | Translating proofs from an impredicative type system to a predicative
one | This is the long version of a paper accepted for publication at CSL
2023 | null | null | null | cs.LO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | As the development of formal proofs is a time-consuming task, it is important
to devise ways of sharing the already written proofs to prevent wasting time
redoing them. One of the challenges in this domain is to translate proofs
written in proof assistants based on impredicative logics, such as Coq, Matita
and the HO... | [
{
"created": "Thu, 10 Nov 2022 17:09:14 GMT",
"version": "v1"
}
] | 2022-11-11 | [
[
"Felicissimo",
"Thiago",
""
],
[
"Blanqui",
"Frédéric",
""
],
[
"Barnawal",
"Ashish Kumar",
""
]
] | As the development of formal proofs is a time-consuming task, it is important to devise ways of sharing the already written proofs to prevent wasting time redoing them. One of the challenges in this domain is to translate proofs written in proof assistants based on impredicative logics, such as Coq, Matita and the HOL ... |
1505.04891 | Fei Tian | Fei Tian, Bin Gao, Enhong Chen, Tie-Yan Liu | Learning Better Word Embedding by Asymmetric Low-Rank Projection of
Knowledge Graph | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Word embedding, which refers to low-dimensional dense vector representations
of natural words, has demonstrated its power in many natural language
processing tasks. However, it may suffer from the inaccurate and incomplete
information contained in the free text corpus as training data. To tackle this
challenge, there... | [
{
"created": "Tue, 19 May 2015 07:08:10 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Jun 2015 08:21:24 GMT",
"version": "v2"
}
] | 2015-06-16 | [
[
"Tian",
"Fei",
""
],
[
"Gao",
"Bin",
""
],
[
"Chen",
"Enhong",
""
],
[
"Liu",
"Tie-Yan",
""
]
] | Word embedding, which refers to low-dimensional dense vector representations of natural words, has demonstrated its power in many natural language processing tasks. However, it may suffer from the inaccurate and incomplete information contained in the free text corpus as training data. To tackle this challenge, there h... |
1011.6590 | Axel Boldt | Axel Boldt | Extending ArXiv.org to Achieve Open Peer Review and Publishing | 6 pages. To be published in the Journal of Scholarly Publishing | null | null | null | cs.OH | http://creativecommons.org/licenses/by/3.0/ | Today's peer review process for scientific articles is unnecessarily opaque
and offers few incentives to referees. Likewise, the publishing process is
unnecessarily inefficient and its results are only rarely made freely available
to the public. Here we outline a comparatively simple extension of arXiv.org,
an online... | [
{
"created": "Tue, 23 Nov 2010 14:23:07 GMT",
"version": "v1"
}
] | 2010-12-01 | [
[
"Boldt",
"Axel",
""
]
] | Today's peer review process for scientific articles is unnecessarily opaque and offers few incentives to referees. Likewise, the publishing process is unnecessarily inefficient and its results are only rarely made freely available to the public. Here we outline a comparatively simple extension of arXiv.org, an online p... |
2102.01687 | Ignacio Laguna | Hal Finkel, Ignacio Laguna | Report of the Workshop on Program Synthesis for Scientific Computing | 29 pages, workshop website:
https://prog-synth-science.github.io/2020/ | null | null | null | cs.LG cs.AI cs.PL cs.SE | http://creativecommons.org/licenses/by/4.0/ | Program synthesis is an active research field in academia, national labs, and
industry. Yet, work directly applicable to scientific computing, while having
some impressive successes, has been limited. This report reviews the relevant
areas of program synthesis work for scientific computing, discusses successes
to dat... | [
{
"created": "Tue, 2 Feb 2021 18:55:23 GMT",
"version": "v1"
}
] | 2021-02-03 | [
[
"Finkel",
"Hal",
""
],
[
"Laguna",
"Ignacio",
""
]
] | Program synthesis is an active research field in academia, national labs, and industry. Yet, work directly applicable to scientific computing, while having some impressive successes, has been limited. This report reviews the relevant areas of program synthesis work for scientific computing, discusses successes to date,... |
2406.05332 | Junghwan Lee | Junghwan Lee, Chen Xu, and Yao Xie | Transformer Conformal Prediction for Time Series | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We present a conformal prediction method for time series using the
Transformer architecture to capture long-memory and long-range dependencies.
Specifically, we use the Transformer decoder as a conditional quantile
estimator to predict the quantiles of prediction residuals, which are used to
estimate the prediction i... | [
{
"created": "Sat, 8 Jun 2024 03:17:48 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"Lee",
"Junghwan",
""
],
[
"Xu",
"Chen",
""
],
[
"Xie",
"Yao",
""
]
] | We present a conformal prediction method for time series using the Transformer architecture to capture long-memory and long-range dependencies. Specifically, we use the Transformer decoder as a conditional quantile estimator to predict the quantiles of prediction residuals, which are used to estimate the prediction int... |
2405.14815 | Tahiya Chowdhury | Raymond Wang, Nicholas R. Record, D. Whitney King, Tahiya Chowdhury | Designing A Sustainable Marine Debris Clean-up Framework without Human
Labels | 9 pages, 6 figures, 2 tables, In Proceedings of the 7th ACM
SIGCAS/SIGCHI Conference on Computing and Sustainable Societies | null | 10.1145/3674829.3675076 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Marine debris poses a significant ecological threat to birds, fish, and other
animal life. Traditional methods for assessing debris accumulation involve
labor-intensive and costly manual surveys. This study introduces a framework
that utilizes aerial imagery captured by drones to conduct remote trash
surveys. Leverag... | [
{
"created": "Thu, 23 May 2024 17:28:23 GMT",
"version": "v1"
},
{
"created": "Sat, 20 Jul 2024 19:06:27 GMT",
"version": "v2"
}
] | 2024-07-23 | [
[
"Wang",
"Raymond",
""
],
[
"Record",
"Nicholas R.",
""
],
[
"King",
"D. Whitney",
""
],
[
"Chowdhury",
"Tahiya",
""
]
] | Marine debris poses a significant ecological threat to birds, fish, and other animal life. Traditional methods for assessing debris accumulation involve labor-intensive and costly manual surveys. This study introduces a framework that utilizes aerial imagery captured by drones to conduct remote trash surveys. Leveragin... |
1609.04439 | Corwin Sinnamon | Janusz Brzozowski and Corwin Sinnamon | Unrestricted State Complexity of Binary Operations on Regular and Ideal
Languages | 30 pages, 15 figures. This paper is a revised and expanded version of
the DCFS 2016 conference paper, also posted previously as arXiv:1602.01387v3.
The expanded version has appeared in J. Autom. Lang. Comb. 22 (1-3), 29-59,
2017, the issue of selected papers from DCFS 2016. This version corrects the
proof of di... | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the state complexity of binary operations on regular languages over
different alphabets. It is known that if $L'_m$ and $L_n$ are languages of
state complexities $m$ and $n$, respectively, and restricted to the same
alphabet, the state complexity of any binary boolean operation on $L'_m$ and
$L_n$ is $mn$, a... | [
{
"created": "Wed, 14 Sep 2016 20:39:47 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Oct 2016 19:57:28 GMT",
"version": "v2"
},
{
"created": "Thu, 21 Dec 2017 02:48:23 GMT",
"version": "v3"
}
] | 2017-12-22 | [
[
"Brzozowski",
"Janusz",
""
],
[
"Sinnamon",
"Corwin",
""
]
] | We study the state complexity of binary operations on regular languages over different alphabets. It is known that if $L'_m$ and $L_n$ are languages of state complexities $m$ and $n$, respectively, and restricted to the same alphabet, the state complexity of any binary boolean operation on $L'_m$ and $L_n$ is $mn$, and... |
2204.06359 | EPTCS | Andrzej Indrzejczak, Micha{\l} Zawidzki | Proceedings of the 10th International Conference on Non-Classical
Logics. Theory and Applications | null | EPTCS 358, 2022 | 10.4204/EPTCS.358 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | Non-Classical Logics. Theory and Applications (NCL) is an international
conference aimed at presenting novel results and survey works in widely
understood non-classical logics and their applications. This year's edition was
also an opportunity to celebrate the 50th anniversary of the logic journal
Bulletin of the Sec... | [
{
"created": "Wed, 13 Apr 2022 13:15:04 GMT",
"version": "v1"
}
] | 2022-04-14 | [
[
"Indrzejczak",
"Andrzej",
""
],
[
"Zawidzki",
"Michał",
""
]
] | Non-Classical Logics. Theory and Applications (NCL) is an international conference aimed at presenting novel results and survey works in widely understood non-classical logics and their applications. This year's edition was also an opportunity to celebrate the 50th anniversary of the logic journal Bulletin of the Secti... |
2203.03668 | Felix Friedrich | Felix Friedrich, Wolfgang Stammer, Patrick Schramowski, Kristian
Kersting | A Typology for Exploring the Mitigation of Shortcut Behavior | null | null | null | null | cs.LG cs.AI cs.HC | http://creativecommons.org/licenses/by/4.0/ | As machine learning models become increasingly larger, trained weakly
supervised on large, possibly uncurated data sets, it becomes increasingly
important to establish mechanisms for inspecting, interacting, and revising
models to mitigate learning shortcuts and guarantee their learned knowledge is
aligned with human... | [
{
"created": "Fri, 4 Mar 2022 14:16:50 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Nov 2022 14:41:43 GMT",
"version": "v2"
},
{
"created": "Fri, 17 Feb 2023 12:04:12 GMT",
"version": "v3"
},
{
"created": "Fri, 24 Feb 2023 11:46:01 GMT",
"version": "v4"
},
{
"cre... | 2024-03-15 | [
[
"Friedrich",
"Felix",
""
],
[
"Stammer",
"Wolfgang",
""
],
[
"Schramowski",
"Patrick",
""
],
[
"Kersting",
"Kristian",
""
]
] | As machine learning models become increasingly larger, trained weakly supervised on large, possibly uncurated data sets, it becomes increasingly important to establish mechanisms for inspecting, interacting, and revising models to mitigate learning shortcuts and guarantee their learned knowledge is aligned with human k... |
2102.10566 | Milliam Maxime Zekeng Ndadji | Milliam Maxime Zekeng Ndadji, Maurice Tchoup\'e Tchendji, Cl\'ementin
Tayou Djamegni, Didier Parigot | A Projection-Stable Grammatical Model for the Distributed Execution of
Administrative Processes with Emphasis on Actors' Views | null | null | null | null | cs.SE cs.DC cs.FL | http://creativecommons.org/licenses/by/4.0/ | During the last two decades, the decentralized execution of business
processes has been one of the main research topics in Business Process
Management. Several models (languages) for processes' specification in order to
facilitate their distributed execution, have been proposed. LSAWfP is among the
most recent in thi... | [
{
"created": "Sun, 21 Feb 2021 09:33:31 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Mar 2021 20:40:53 GMT",
"version": "v2"
}
] | 2021-03-30 | [
[
"Ndadji",
"Milliam Maxime Zekeng",
""
],
[
"Tchendji",
"Maurice Tchoupé",
""
],
[
"Djamegni",
"Clémentin Tayou",
""
],
[
"Parigot",
"Didier",
""
]
] | During the last two decades, the decentralized execution of business processes has been one of the main research topics in Business Process Management. Several models (languages) for processes' specification in order to facilitate their distributed execution, have been proposed. LSAWfP is among the most recent in this ... |
1312.0938 | Siddhartha Banerjee | Siddhartha Banerjee, Avhishek Chatterjee, Sanjay Shakkottai | Epidemic Thresholds with External Agents | 12 pages, 2 figures (to appear in INFOCOM 2014) | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the effect of external infection sources on phase transitions in
epidemic processes. In particular, we consider an epidemic spreading on a
network via the SIS/SIR dynamics, which in addition is aided by external agents
- sources unconstrained by the graph, but possessing a limited infection rate
or virulence... | [
{
"created": "Tue, 3 Dec 2013 04:01:51 GMT",
"version": "v1"
}
] | 2013-12-05 | [
[
"Banerjee",
"Siddhartha",
""
],
[
"Chatterjee",
"Avhishek",
""
],
[
"Shakkottai",
"Sanjay",
""
]
] | We study the effect of external infection sources on phase transitions in epidemic processes. In particular, we consider an epidemic spreading on a network via the SIS/SIR dynamics, which in addition is aided by external agents - sources unconstrained by the graph, but possessing a limited infection rate or virulence. ... |
2405.10167 | Sayantan Sen | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Sayantan Sen | Near Uniform Triangle Sampling Over Adjacency List Graph Streams | 26 pages | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Triangle counting and sampling are two fundamental problems for streaming
algorithms. Arguably, designing sampling algorithms is more challenging than
their counting variants. It may be noted that triangle counting has received
far greater attention in the literature than the sampling variant. In this
work, we consid... | [
{
"created": "Thu, 16 May 2024 15:03:40 GMT",
"version": "v1"
}
] | 2024-05-17 | [
[
"Bishnu",
"Arijit",
""
],
[
"Ghosh",
"Arijit",
""
],
[
"Mishra",
"Gopinath",
""
],
[
"Sen",
"Sayantan",
""
]
] | Triangle counting and sampling are two fundamental problems for streaming algorithms. Arguably, designing sampling algorithms is more challenging than their counting variants. It may be noted that triangle counting has received far greater attention in the literature than the sampling variant. In this work, we consider... |
1307.7838 | Sang Yeob Jung | Sang Yeob Jung, Seung Min Yu, and Seong-Lyun Kim | Asymmetric-valued Spectrum Auction and Competition in Wireless Broadband
Services | null | null | null | null | cs.NI cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study bidding and pricing competition between two spiteful mobile network
operators (MNOs) with considering their existing spectrum holdings. Given
asymmetric-valued spectrum blocks are auctioned off to them via a first-price
sealed-bid auction, we investigate the interactions between two spiteful MNOs
and users a... | [
{
"created": "Tue, 30 Jul 2013 06:51:02 GMT",
"version": "v1"
},
{
"created": "Sat, 25 Jan 2014 13:10:14 GMT",
"version": "v2"
}
] | 2014-01-28 | [
[
"Jung",
"Sang Yeob",
""
],
[
"Yu",
"Seung Min",
""
],
[
"Kim",
"Seong-Lyun",
""
]
] | We study bidding and pricing competition between two spiteful mobile network operators (MNOs) with considering their existing spectrum holdings. Given asymmetric-valued spectrum blocks are auctioned off to them via a first-price sealed-bid auction, we investigate the interactions between two spiteful MNOs and users as ... |
2204.04727 | Tao Qi | Tao Qi, Fangzhao Wu, Chuhan Wu, Yongfeng Huang | FUM: Fine-grained and Fast User Modeling for News Recommendation | SIGIR 2022 | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | User modeling is important for news recommendation. Existing methods usually
first encode user's clicked news into news embeddings independently and then
aggregate them into user embedding. However, the word-level interactions across
different clicked news from the same user, which contain rich detailed clues to
infe... | [
{
"created": "Sun, 10 Apr 2022 17:05:56 GMT",
"version": "v1"
}
] | 2022-04-12 | [
[
"Qi",
"Tao",
""
],
[
"Wu",
"Fangzhao",
""
],
[
"Wu",
"Chuhan",
""
],
[
"Huang",
"Yongfeng",
""
]
] | User modeling is important for news recommendation. Existing methods usually first encode user's clicked news into news embeddings independently and then aggregate them into user embedding. However, the word-level interactions across different clicked news from the same user, which contain rich detailed clues to infer ... |
2405.14341 | Heer Patel | Melissa Lin, Heer Patel, Medina Lamkin, Tukey Tu, Hannah Bako, Soham
Raut, Leilani Battle | How do Observable Users Decompose D3 Code? An Exploratory Study | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Users often struggle to program visualizations using complex toolkits like
D3. Before we can design effective code assistants to support them, we must
first understand how D3 users reason about their code. In this work, we explore
users' understanding of D3 using an important gauge of code comprehension in CS
educati... | [
{
"created": "Thu, 23 May 2024 09:11:47 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Lin",
"Melissa",
""
],
[
"Patel",
"Heer",
""
],
[
"Lamkin",
"Medina",
""
],
[
"Tu",
"Tukey",
""
],
[
"Bako",
"Hannah",
""
],
[
"Raut",
"Soham",
""
],
[
"Battle",
"Leilani",
""
]
] | Users often struggle to program visualizations using complex toolkits like D3. Before we can design effective code assistants to support them, we must first understand how D3 users reason about their code. In this work, we explore users' understanding of D3 using an important gauge of code comprehension in CS education... |
2010.08691 | Elizabeth Munch | Kayla Makela and Tim Ophelders and Michelle Quigley and Elizabeth
Munch and Daniel Chitwood and Asia Dowtin | Automatic Tree Ring Detection using Jacobi Sets | null | null | null | null | cs.CV cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tree ring widths are an important source of climatic and historical data, but
measuring these widths typically requires extensive manual work. Computer
vision techniques provide promising directions towards the automation of tree
ring detection, but most automated methods still require a substantial amount
of user in... | [
{
"created": "Sat, 17 Oct 2020 01:28:16 GMT",
"version": "v1"
}
] | 2020-10-20 | [
[
"Makela",
"Kayla",
""
],
[
"Ophelders",
"Tim",
""
],
[
"Quigley",
"Michelle",
""
],
[
"Munch",
"Elizabeth",
""
],
[
"Chitwood",
"Daniel",
""
],
[
"Dowtin",
"Asia",
""
]
] | Tree ring widths are an important source of climatic and historical data, but measuring these widths typically requires extensive manual work. Computer vision techniques provide promising directions towards the automation of tree ring detection, but most automated methods still require a substantial amount of user inte... |
2004.05834 | Yabo Xiao | Yabo Xiao, Dongdong Yu, Xiaojuan Wang, Tianqi Lv, Yiqi Fan, Lingrui Wu | SPCNet:Spatial Preserve and Content-aware Network for Human Pose
Estimation | 8 pages,6 figures, accepted for presentation at the 24th European
Conference on Artificial Intelligence (ECAI 2020) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human pose estimation is a fundamental yet challenging task in computer
vision. Although deep learning techniques have made great progress in this
area, difficult scenarios (e.g., invisible keypoints, occlusions, complex
multi-person scenarios, and abnormal poses) are still not well-handled. To
alleviate these issues... | [
{
"created": "Mon, 13 Apr 2020 09:14:00 GMT",
"version": "v1"
}
] | 2020-04-14 | [
[
"Xiao",
"Yabo",
""
],
[
"Yu",
"Dongdong",
""
],
[
"Wang",
"Xiaojuan",
""
],
[
"Lv",
"Tianqi",
""
],
[
"Fan",
"Yiqi",
""
],
[
"Wu",
"Lingrui",
""
]
] | Human pose estimation is a fundamental yet challenging task in computer vision. Although deep learning techniques have made great progress in this area, difficult scenarios (e.g., invisible keypoints, occlusions, complex multi-person scenarios, and abnormal poses) are still not well-handled. To alleviate these issues, ... |
2403.01560 | Kun-Yu Lin | Kun-Yu Lin, Henghui Ding, Jiaming Zhou, Yu-Ming Tang, Yi-Xing Peng,
Zhilin Zhao, Chen Change Loy, Wei-Shi Zheng | Rethinking CLIP-based Video Learners in Cross-Domain Open-Vocabulary
Action Recognition | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Building upon the impressive success of CLIP (Contrastive Language-Image
Pretraining), recent pioneer works have proposed to adapt the powerful CLIP to
video data, leading to efficient and effective video learners for
open-vocabulary action recognition. Inspired by that humans perform actions in
diverse environments,... | [
{
"created": "Sun, 3 Mar 2024 16:48:16 GMT",
"version": "v1"
},
{
"created": "Fri, 24 May 2024 14:47:03 GMT",
"version": "v2"
}
] | 2024-05-27 | [
[
"Lin",
"Kun-Yu",
""
],
[
"Ding",
"Henghui",
""
],
[
"Zhou",
"Jiaming",
""
],
[
"Tang",
"Yu-Ming",
""
],
[
"Peng",
"Yi-Xing",
""
],
[
"Zhao",
"Zhilin",
""
],
[
"Loy",
"Chen Change",
""
],
[
"Zheng",
... | Building upon the impressive success of CLIP (Contrastive Language-Image Pretraining), recent pioneer works have proposed to adapt the powerful CLIP to video data, leading to efficient and effective video learners for open-vocabulary action recognition. Inspired by that humans perform actions in diverse environments, o... |
2304.03754 | Hung-Ting Su | Hung-Ting Su, Yulei Niu, Xudong Lin, Winston H. Hsu, Shih-Fu Chang | Language Models are Causal Knowledge Extractors for Zero-shot Video
Question Answering | CVPR 2023 Workshop L3D-IVU | null | null | null | cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Causal Video Question Answering (CVidQA) queries not only association or
temporal relations but also causal relations in a video. Existing question
synthesis methods pre-trained question generation (QG) systems on reading
comprehension datasets with text descriptions as inputs. However, QG models
only learn to ask as... | [
{
"created": "Fri, 7 Apr 2023 17:45:49 GMT",
"version": "v1"
}
] | 2023-04-10 | [
[
"Su",
"Hung-Ting",
""
],
[
"Niu",
"Yulei",
""
],
[
"Lin",
"Xudong",
""
],
[
"Hsu",
"Winston H.",
""
],
[
"Chang",
"Shih-Fu",
""
]
] | Causal Video Question Answering (CVidQA) queries not only association or temporal relations but also causal relations in a video. Existing question synthesis methods pre-trained question generation (QG) systems on reading comprehension datasets with text descriptions as inputs. However, QG models only learn to ask asso... |
2403.20234 | Francesco Linsalata | Antonio Coviello, Francesco Linsalata, Umberto Spagnolini, Maurizio
Magarini | Artificial Neural Networks-based Real-time Classification of ENG Signals
for Implanted Nerve Interfaces | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Neuropathies are gaining higher relevance in clinical settings, as they risk
permanently jeopardizing a person's life. To support the recovery of patients,
the use of fully implanted devices is emerging as one of the most promising
solutions. However, these devices, even if becoming an integral part of a fully
comple... | [
{
"created": "Fri, 29 Mar 2024 15:23:30 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Apr 2024 09:26:43 GMT",
"version": "v2"
}
] | 2024-04-03 | [
[
"Coviello",
"Antonio",
""
],
[
"Linsalata",
"Francesco",
""
],
[
"Spagnolini",
"Umberto",
""
],
[
"Magarini",
"Maurizio",
""
]
] | Neuropathies are gaining higher relevance in clinical settings, as they risk permanently jeopardizing a person's life. To support the recovery of patients, the use of fully implanted devices is emerging as one of the most promising solutions. However, these devices, even if becoming an integral part of a fully complex ... |
1508.00914 | Jerry Pinheiro | Roberto Assis Machado, Jerry Anderson Pinheiro and Marcelo Firer | Characterization of metrics induced by hierarchical posets | Submitted to IEEE Transactions on Information Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider metrics determined by hierarchical posets and give
explicit formulae for the main parameters of a linear code: the minimum
distance and the packing, covering and Chebyshev radii of a code. We also
present ten characterizations of hierarchical poset metrics, including new
characterizations an... | [
{
"created": "Tue, 4 Aug 2015 20:28:04 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Mar 2016 16:59:45 GMT",
"version": "v2"
},
{
"created": "Fri, 24 Mar 2017 03:01:36 GMT",
"version": "v3"
}
] | 2017-03-27 | [
[
"Machado",
"Roberto Assis",
""
],
[
"Pinheiro",
"Jerry Anderson",
""
],
[
"Firer",
"Marcelo",
""
]
] | In this paper we consider metrics determined by hierarchical posets and give explicit formulae for the main parameters of a linear code: the minimum distance and the packing, covering and Chebyshev radii of a code. We also present ten characterizations of hierarchical poset metrics, including new characterizations and ... |
2208.06676 | Anna Gilbert | Yulan Zhang, Anna C. Gilbert, Stefan Steinerberger | May the force be with you | 23 pages, 17 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern methods in dimensionality reduction are dominated by nonlinear
attraction-repulsion force-based methods (this includes t-SNE, UMAP,
ForceAtlas2, LargeVis, and many more). The purpose of this paper is to
demonstrate that all such methods, by design, come with an additional feature
that is being automatically co... | [
{
"created": "Sat, 13 Aug 2022 15:52:58 GMT",
"version": "v1"
}
] | 2022-08-16 | [
[
"Zhang",
"Yulan",
""
],
[
"Gilbert",
"Anna C.",
""
],
[
"Steinerberger",
"Stefan",
""
]
] | Modern methods in dimensionality reduction are dominated by nonlinear attraction-repulsion force-based methods (this includes t-SNE, UMAP, ForceAtlas2, LargeVis, and many more). The purpose of this paper is to demonstrate that all such methods, by design, come with an additional feature that is being automatically comp... |
1910.11133 | Prem Seetharaman | Prem Seetharaman, Gordon Wichern, Jonathan Le Roux, Bryan Pardo | Bootstrapping deep music separation from primitive auditory grouping
principles | null | null | null | null | cs.SD cs.LG eess.AS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Separating an audio scene such as a cocktail party into constituent,
meaningful components is a core task in computer audition. Deep networks are
the state-of-the-art approach. They are trained on synthetic mixtures of audio
made from isolated sound source recordings so that ground truth for the
separation is known. ... | [
{
"created": "Wed, 23 Oct 2019 17:44:13 GMT",
"version": "v1"
}
] | 2019-10-25 | [
[
"Seetharaman",
"Prem",
""
],
[
"Wichern",
"Gordon",
""
],
[
"Roux",
"Jonathan Le",
""
],
[
"Pardo",
"Bryan",
""
]
] | Separating an audio scene such as a cocktail party into constituent, meaningful components is a core task in computer audition. Deep networks are the state-of-the-art approach. They are trained on synthetic mixtures of audio made from isolated sound source recordings so that ground truth for the separation is known. Ho... |
2302.08680 | Truong Son Hy | Nhat Khang Ngo, Truong Son Hy, Risi Kondor | Modeling Polypharmacy and Predicting Drug-Drug Interactions using Deep
Generative Models on Multimodal Graphs | arXiv admin note: substantial text overlap with arXiv:2209.09941 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Latent representations of drugs and their targets produced by contemporary
graph autoencoder models have proved useful in predicting many types of
node-pair interactions on large networks, including drug-drug, drug-target, and
target-target interactions. However, most existing approaches model either the
node's laten... | [
{
"created": "Fri, 17 Feb 2023 04:06:46 GMT",
"version": "v1"
}
] | 2023-02-20 | [
[
"Ngo",
"Nhat Khang",
""
],
[
"Hy",
"Truong Son",
""
],
[
"Kondor",
"Risi",
""
]
] | Latent representations of drugs and their targets produced by contemporary graph autoencoder models have proved useful in predicting many types of node-pair interactions on large networks, including drug-drug, drug-target, and target-target interactions. However, most existing approaches model either the node's latent ... |
0802.2476 | Georg B\"ocherer | Georg B\"ocherer and Daniel Bielefeld | Theoretical Analysis of the Energy Capture in Strictly Bandlimited
Ultra-Wideband Channels | 5 pages. Changes from 2nd version: minor corrections. Essentially the
paper to be presented at ISWCS 2008 in Reykjavik | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The frequency selectivity of wireless communication channels can be
characterized by the delay spread Ds of the channel impulse response. If the
delay spread is small compared to the bandwidth W of the input signal, that is,
Ds*W approximately equal to 1, the channel appears to be flat fading. For Ds*W
>> 1, the chan... | [
{
"created": "Mon, 18 Feb 2008 13:34:44 GMT",
"version": "v1"
},
{
"created": "Wed, 28 May 2008 09:59:39 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Aug 2008 14:03:44 GMT",
"version": "v3"
}
] | 2008-08-07 | [
[
"Böcherer",
"Georg",
""
],
[
"Bielefeld",
"Daniel",
""
]
] | The frequency selectivity of wireless communication channels can be characterized by the delay spread Ds of the channel impulse response. If the delay spread is small compared to the bandwidth W of the input signal, that is, Ds*W approximately equal to 1, the channel appears to be flat fading. For Ds*W >> 1, the channe... |
2003.00365 | Semih Cayci | Semih Cayci, Atilla Eryilmaz, R. Srikant | Budget-Constrained Bandits over General Cost and Reward Distributions | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a budget-constrained bandit problem where each arm pull incurs a
random cost, and yields a random reward in return. The objective is to maximize
the total expected reward under a budget constraint on the total cost. The
model is general in the sense that it allows correlated and potentially
heavy-tailed c... | [
{
"created": "Sat, 29 Feb 2020 23:50:08 GMT",
"version": "v1"
}
] | 2020-03-03 | [
[
"Cayci",
"Semih",
""
],
[
"Eryilmaz",
"Atilla",
""
],
[
"Srikant",
"R.",
""
]
] | We consider a budget-constrained bandit problem where each arm pull incurs a random cost, and yields a random reward in return. The objective is to maximize the total expected reward under a budget constraint on the total cost. The model is general in the sense that it allows correlated and potentially heavy-tailed cos... |
2312.01238 | Sandra E. Safo | Sarthak Jain and Sandra E. Safo | A deep learning pipeline for cross-sectional and longitudinal multiview
data integration | null | null | null | null | cs.LG stat.AP stat.CO stat.ME stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biomedical research now commonly integrates diverse data types or views from
the same individuals to better understand the pathobiology of complex diseases,
but the challenge lies in meaningfully integrating these diverse views.
Existing methods often require the same type of data from all views
(cross-sectional data... | [
{
"created": "Sat, 2 Dec 2023 22:24:35 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Jain",
"Sarthak",
""
],
[
"Safo",
"Sandra E.",
""
]
] | Biomedical research now commonly integrates diverse data types or views from the same individuals to better understand the pathobiology of complex diseases, but the challenge lies in meaningfully integrating these diverse views. Existing methods often require the same type of data from all views (cross-sectional data o... |
1511.02326 | Zhenyu Xiao | Zhenyu Xiao | Suboptimal Spatial Diversity Scheme for 60 GHz Millimeter-Wave WLAN | 4 pages | IEEE Communications Letters, vol. 17, no. 9, pp. 1790-1793, Sep.
2013 | 10.1109/LCOMM.2013.071813.131181 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This letter revisits the equal-gain (EG) spatial diversity technique, which
was proposed to combat the human-induced shadowing for 60 GHz wireless local
area network, under a more practical frequency-selective multi-input
multi-output channel. Subsequently, a suboptimal spatial diversity scheme
called maximal selecti... | [
{
"created": "Sat, 7 Nov 2015 09:03:51 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Xiao",
"Zhenyu",
""
]
] | This letter revisits the equal-gain (EG) spatial diversity technique, which was proposed to combat the human-induced shadowing for 60 GHz wireless local area network, under a more practical frequency-selective multi-input multi-output channel. Subsequently, a suboptimal spatial diversity scheme called maximal selection... |
2301.06060 | Tomer Raviv | Tomer Raviv, Alon Goldman, Ofek Vayner, Yair Be'ery, Nir Shlezinger | CRC-Aided Learned Ensembles of Belief-Propagation Polar Decoders | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Polar codes have promising error-correction capabilities. Yet, decoding polar
codes is often challenging, particularly with large blocks, with recently
proposed decoders based on list-decoding or neural-decoding. The former applies
multiple decoders or the same decoder multiple times with some redundancy,
while the l... | [
{
"created": "Sun, 15 Jan 2023 10:00:43 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Feb 2023 18:57:55 GMT",
"version": "v2"
}
] | 2023-02-14 | [
[
"Raviv",
"Tomer",
""
],
[
"Goldman",
"Alon",
""
],
[
"Vayner",
"Ofek",
""
],
[
"Be'ery",
"Yair",
""
],
[
"Shlezinger",
"Nir",
""
]
] | Polar codes have promising error-correction capabilities. Yet, decoding polar codes is often challenging, particularly with large blocks, with recently proposed decoders based on list-decoding or neural-decoding. The former applies multiple decoders or the same decoder multiple times with some redundancy, while the lat... |
1507.01719 | Boris Bukh | Boris Bukh, Venkatesan Guruswami, Johan H{\aa}stad | An improved bound on the fraction of correctable deletions | 19 pages, this version presents a code with better rate, improves
exposition, and adds a new author | null | null | null | cs.IT cs.DM math.CO math.IT | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We consider codes over fixed alphabets against worst-case symbol deletions.
For any fixed $k \ge 2$, we construct a family of codes over alphabet of size
$k$ with positive rate, which allow efficient recovery from a worst-case
deletion fraction approaching $1-\frac{2}{k+\sqrt k}$. In particular, for
binary codes, we ... | [
{
"created": "Tue, 7 Jul 2015 09:20:06 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Mar 2016 18:45:23 GMT",
"version": "v2"
}
] | 2016-03-02 | [
[
"Bukh",
"Boris",
""
],
[
"Guruswami",
"Venkatesan",
""
],
[
"Håstad",
"Johan",
""
]
] | We consider codes over fixed alphabets against worst-case symbol deletions. For any fixed $k \ge 2$, we construct a family of codes over alphabet of size $k$ with positive rate, which allow efficient recovery from a worst-case deletion fraction approaching $1-\frac{2}{k+\sqrt k}$. In particular, for binary codes, we ar... |
2310.13747 | Amr Keleg | Amr Keleg, Sharon Goldwater, Walid Magdy | ALDi: Quantifying the Arabic Level of Dialectness of Text | Accepted to EMNLP 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transcribed speech and user-generated text in Arabic typically contain a
mixture of Modern Standard Arabic (MSA), the standardized language taught in
schools, and Dialectal Arabic (DA), used in daily communications. To handle
this variation, previous work in Arabic NLP has focused on Dialect
Identification (DI) on th... | [
{
"created": "Fri, 20 Oct 2023 18:07:39 GMT",
"version": "v1"
}
] | 2023-10-24 | [
[
"Keleg",
"Amr",
""
],
[
"Goldwater",
"Sharon",
""
],
[
"Magdy",
"Walid",
""
]
] | Transcribed speech and user-generated text in Arabic typically contain a mixture of Modern Standard Arabic (MSA), the standardized language taught in schools, and Dialectal Arabic (DA), used in daily communications. To handle this variation, previous work in Arabic NLP has focused on Dialect Identification (DI) on the ... |
2308.10193 | Shamik Sarkar | Shamik Sarkar, Dongning Guo, Danijela Cabric | ProSpire: Proactive Spatial Prediction of Radio Environment Using Deep
Learning | 9 pages | null | null | null | cs.NI cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | Spatial prediction of the radio propagation environment of a transmitter can
assist and improve various aspects of wireless networks. The majority of
research in this domain can be categorized as 'reactive' spatial prediction,
where the predictions are made based on a small set of measurements from an
active transmit... | [
{
"created": "Sun, 20 Aug 2023 07:48:34 GMT",
"version": "v1"
}
] | 2023-08-22 | [
[
"Sarkar",
"Shamik",
""
],
[
"Guo",
"Dongning",
""
],
[
"Cabric",
"Danijela",
""
]
] | Spatial prediction of the radio propagation environment of a transmitter can assist and improve various aspects of wireless networks. The majority of research in this domain can be categorized as 'reactive' spatial prediction, where the predictions are made based on a small set of measurements from an active transmitte... |
2210.12758 | Banghuai Li | Zixuan Xu, Banghuai Li, Ye Yuan, Anhong Dang | Beta R-CNN: Looking into Pedestrian Detection from Another Perspective | NeurIPS 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently significant progress has been made in pedestrian detection, but it
remains challenging to achieve high performance in occluded and crowded scenes.
It could be attributed mostly to the widely used representation of pedestrians,
i.e., 2D axis-aligned bounding box, which just describes the approximate
location ... | [
{
"created": "Sun, 23 Oct 2022 15:56:54 GMT",
"version": "v1"
}
] | 2022-10-25 | [
[
"Xu",
"Zixuan",
""
],
[
"Li",
"Banghuai",
""
],
[
"Yuan",
"Ye",
""
],
[
"Dang",
"Anhong",
""
]
] | Recently significant progress has been made in pedestrian detection, but it remains challenging to achieve high performance in occluded and crowded scenes. It could be attributed mostly to the widely used representation of pedestrians, i.e., 2D axis-aligned bounding box, which just describes the approximate location an... |
1208.0615 | Dimitris Fotakis | Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman | Enumerating Subgraph Instances Using Map-Reduce | 37 pages | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The theme of this paper is how to find all instances of a given "sample"
graph in a larger "data graph," using a single round of map-reduce. For the
simplest sample graph, the triangle, we improve upon the best known such
algorithm. We then examine the general case, considering both the communication
cost between map... | [
{
"created": "Thu, 2 Aug 2012 20:56:39 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Nov 2012 20:03:05 GMT",
"version": "v2"
}
] | 2012-11-22 | [
[
"Afrati",
"Foto N.",
""
],
[
"Fotakis",
"Dimitris",
""
],
[
"Ullman",
"Jeffrey D.",
""
]
] | The theme of this paper is how to find all instances of a given "sample" graph in a larger "data graph," using a single round of map-reduce. For the simplest sample graph, the triangle, we improve upon the best known such algorithm. We then examine the general case, considering both the communication cost between mappe... |
1403.6487 | Christopher Brown | Christopher W. Brown | Model-based construction of Open Non-uniform Cylindrical Algebraic
Decompositions | null | null | null | null | cs.SC | http://creativecommons.org/licenses/publicdomain/ | In this paper we introduce the notion of an Open Non-uniform Cylindrical
Algebraic Decomposition (NuCAD), and present an efficient model-based algorithm
for constructing an Open NuCAD from an input formula. A NuCAD is a
generalization of Cylindrical Algebraic Decomposition (CAD) as defined by
Collins in his seminal w... | [
{
"created": "Mon, 24 Mar 2014 02:10:31 GMT",
"version": "v1"
}
] | 2014-03-27 | [
[
"Brown",
"Christopher W.",
""
]
] | In this paper we introduce the notion of an Open Non-uniform Cylindrical Algebraic Decomposition (NuCAD), and present an efficient model-based algorithm for constructing an Open NuCAD from an input formula. A NuCAD is a generalization of Cylindrical Algebraic Decomposition (CAD) as defined by Collins in his seminal wor... |
2403.01489 | Meiling Li | Meiling Li, Zhenxing Qian, Xinpeng Zhang | Regeneration Based Training-free Attribution of Fake Images Generated by
Text-to-Image Generative Models | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text-to-image generative models have recently garnered significant attention
due to their ability to generate images based on prompt descriptions. While
these models have shown promising performance, concerns have been raised
regarding the potential misuse of the generated fake images. In response to
this, we have pr... | [
{
"created": "Sun, 3 Mar 2024 11:55:49 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Li",
"Meiling",
""
],
[
"Qian",
"Zhenxing",
""
],
[
"Zhang",
"Xinpeng",
""
]
] | Text-to-image generative models have recently garnered significant attention due to their ability to generate images based on prompt descriptions. While these models have shown promising performance, concerns have been raised regarding the potential misuse of the generated fake images. In response to this, we have pres... |
2003.08437 | Siyao Peng | Siyao Peng, Yang Liu, Yilun Zhu, Austin Blodgett, Yushi Zhao, Nathan
Schneider | A Corpus of Adpositional Supersenses for Mandarin Chinese | LREC 2020 camera-ready | null | null | null | cs.DL cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adpositions are frequent markers of semantic relations, but they are highly
ambiguous and vary significantly from language to language. Moreover, there is
a dearth of annotated corpora for investigating the cross-linguistic variation
of adposition semantics, or for building multilingual disambiguation systems.
This p... | [
{
"created": "Wed, 18 Mar 2020 18:59:55 GMT",
"version": "v1"
}
] | 2020-03-20 | [
[
"Peng",
"Siyao",
""
],
[
"Liu",
"Yang",
""
],
[
"Zhu",
"Yilun",
""
],
[
"Blodgett",
"Austin",
""
],
[
"Zhao",
"Yushi",
""
],
[
"Schneider",
"Nathan",
""
]
] | Adpositions are frequent markers of semantic relations, but they are highly ambiguous and vary significantly from language to language. Moreover, there is a dearth of annotated corpora for investigating the cross-linguistic variation of adposition semantics, or for building multilingual disambiguation systems. This pap... |
1810.05937 | Ellis Solaiman | Awatif Alqahtani and Yinhao Li and Pankesh Patel and Ellis Solaiman
and Rajiv Ranjan | End-to-End Service Level Agreement Specification for IoT Applications | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Internet of Things (IoT) promises to help solve a wide range of issues
that relate to our wellbeing within application domains that include smart
cities, healthcare monitoring, and environmental monitoring. IoT is bringing
new wireless sensor use cases by taking advantage of the computing power and
flexibility pr... | [
{
"created": "Sat, 13 Oct 2018 22:49:40 GMT",
"version": "v1"
}
] | 2018-10-16 | [
[
"Alqahtani",
"Awatif",
""
],
[
"Li",
"Yinhao",
""
],
[
"Patel",
"Pankesh",
""
],
[
"Solaiman",
"Ellis",
""
],
[
"Ranjan",
"Rajiv",
""
]
] | The Internet of Things (IoT) promises to help solve a wide range of issues that relate to our wellbeing within application domains that include smart cities, healthcare monitoring, and environmental monitoring. IoT is bringing new wireless sensor use cases by taking advantage of the computing power and flexibility prov... |
2301.04582 | Demin Yu | Demin Yu, Min Liu and Zhongjie Wang | A Personalized Utterance Style (PUS) based Dialogue Strategy for
Efficient Service Requirement Elicitation | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | With the flourish of services on the Internet, a prerequisite for service
providers to precisely deliver services to their customers is to capture user
requirements comprehensively, accurately, and efficiently. This is called the
``Service Requirement Elicitation (SRE)'' task. Considering the amount of
customers is h... | [
{
"created": "Sat, 7 Jan 2023 04:10:33 GMT",
"version": "v1"
}
] | 2023-01-12 | [
[
"Yu",
"Demin",
""
],
[
"Liu",
"Min",
""
],
[
"Wang",
"Zhongjie",
""
]
] | With the flourish of services on the Internet, a prerequisite for service providers to precisely deliver services to their customers is to capture user requirements comprehensively, accurately, and efficiently. This is called the ``Service Requirement Elicitation (SRE)'' task. Considering the amount of customers is hug... |
1701.07579 | Vitaly Skachek | Eldho K. Thomas and Vitaly Skachek | Explicit Constructions and Bounds for Batch Codes with Restricted Size
of Reconstruction Sets | To appear in 5ICMCTA | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Linear batch codes and codes for private information retrieval (PIR) with a
query size $t$ and a restricted size $r$ of the reconstruction sets are
studied. New bounds on the parameters of such codes are derived for small
values of $t$ or of $r$ by providing corresponding constructions. By building
on the ideas of Ca... | [
{
"created": "Thu, 26 Jan 2017 05:16:28 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Jul 2017 14:07:13 GMT",
"version": "v2"
}
] | 2017-07-05 | [
[
"Thomas",
"Eldho K.",
""
],
[
"Skachek",
"Vitaly",
""
]
] | Linear batch codes and codes for private information retrieval (PIR) with a query size $t$ and a restricted size $r$ of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of $t$ or of $r$ by providing corresponding constructions. By building on the ideas of Cada... |
0902.0920 | Yassine Ariba | Yassine Ariba (LAAS), Yann Labit (LAAS), Fr\'ed\'eric Gouaisbaut
(LAAS) | Design and performance evaluation of a state-space based AQM | null | International Conference on Communication Theory, Reliability, and
Quality of Service, Bucharest : Roumanie (2008) | 10.1109/CTRQ.2008.15 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent research has shown the link between congestion control in
communication networks and feedback control system. In this paper, the design
of an active queue management (AQM) which can be viewed as a controller, is
considered. Based on a state space representation of a linearized fluid flow
model of TCP, the AQM ... | [
{
"created": "Thu, 5 Feb 2009 15:24:36 GMT",
"version": "v1"
}
] | 2009-02-06 | [
[
"Ariba",
"Yassine",
"",
"LAAS"
],
[
"Labit",
"Yann",
"",
"LAAS"
],
[
"Gouaisbaut",
"Frédéric",
"",
"LAAS"
]
] | Recent research has shown the link between congestion control in communication networks and feedback control system. In this paper, the design of an active queue management (AQM) which can be viewed as a controller, is considered. Based on a state space representation of a linearized fluid flow model of TCP, the AQM de... |
1608.00218 | Ilija Ilievski | Ilija Ilievski and Jiashi Feng | Hyperparameter Transfer Learning through Surrogate Alignment for
Efficient Deep Neural Network Training | null | null | null | null | cs.LG cs.CV cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, several optimization methods have been successfully applied to the
hyperparameter optimization of deep neural networks (DNNs). The methods work by
modeling the joint distribution of hyperparameter values and corresponding
error. Those methods become less practical when applied to modern DNNs whose
training ... | [
{
"created": "Sun, 31 Jul 2016 14:09:17 GMT",
"version": "v1"
}
] | 2016-08-02 | [
[
"Ilievski",
"Ilija",
""
],
[
"Feng",
"Jiashi",
""
]
] | Recently, several optimization methods have been successfully applied to the hyperparameter optimization of deep neural networks (DNNs). The methods work by modeling the joint distribution of hyperparameter values and corresponding error. Those methods become less practical when applied to modern DNNs whose training ma... |
1912.01227 | Tomohiro Tachi | Seri Nishimoto, Takashi Horiyama and Tomohiro Tachi | Geodesic Folding of Tetrahedron | null | Journal of the International Society for the Interdisciplinary
Study of Symmetry, Symmetry: Art and Science, 2019, Special Issue: 11th
Congress and Exhibition of SIS, Kanazawa, Japan, November 25-30, 2019 | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we show the geometric properties of a family of polyhedra
obtained by folding a regular tetrahedron along regular triangular grids. Each
polyhedron is identified by a pair of nonnegative integers. The polyhedron can
be cut along a geodesic strip of triangles to be decomposed and unfolded into
one or mul... | [
{
"created": "Tue, 3 Dec 2019 07:39:11 GMT",
"version": "v1"
}
] | 2019-12-04 | [
[
"Nishimoto",
"Seri",
""
],
[
"Horiyama",
"Takashi",
""
],
[
"Tachi",
"Tomohiro",
""
]
] | In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut along a geodesic strip of triangles to be decomposed and unfolded into one or multi... |
2212.08349 | Junzhuo Li | Junzhuo Li, Xinwei Wu, Weilong Dong, Shuangzhi Wu, Chao Bian and Deyi
Xiong | Swing Distillation: A Privacy-Preserving Knowledge Distillation
Framework | null | null | null | null | cs.LG cs.AI cs.CL cs.CR | http://creativecommons.org/licenses/by/4.0/ | Knowledge distillation (KD) has been widely used for model compression and
knowledge transfer. Typically, a big teacher model trained on sufficient data
transfers knowledge to a small student model. However, despite the success of
KD, little effort has been made to study whether KD leaks the training data of
the teac... | [
{
"created": "Fri, 16 Dec 2022 08:57:18 GMT",
"version": "v1"
}
] | 2022-12-20 | [
[
"Li",
"Junzhuo",
""
],
[
"Wu",
"Xinwei",
""
],
[
"Dong",
"Weilong",
""
],
[
"Wu",
"Shuangzhi",
""
],
[
"Bian",
"Chao",
""
],
[
"Xiong",
"Deyi",
""
]
] | Knowledge distillation (KD) has been widely used for model compression and knowledge transfer. Typically, a big teacher model trained on sufficient data transfers knowledge to a small student model. However, despite the success of KD, little effort has been made to study whether KD leaks the training data of the teache... |
2210.08303 | Jinpeng Hu | Jinpeng Hu, Zhihong Chen, Yang Liu, Xiang Wan, Tsung-Hui Chang | Improving Radiology Summarization with Radiograph and Anatomy Prompts | 11 pages, ACL2023 Findings | null | null | null | cs.CV cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The impression is crucial for the referring physicians to grasp key
information since it is concluded from the findings and reasoning of
radiologists. To alleviate the workload of radiologists and reduce repetitive
human labor in impression writing, many researchers have focused on automatic
impression generation. Ho... | [
{
"created": "Sat, 15 Oct 2022 14:05:03 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Dec 2023 05:52:24 GMT",
"version": "v2"
}
] | 2023-12-29 | [
[
"Hu",
"Jinpeng",
""
],
[
"Chen",
"Zhihong",
""
],
[
"Liu",
"Yang",
""
],
[
"Wan",
"Xiang",
""
],
[
"Chang",
"Tsung-Hui",
""
]
] | The impression is crucial for the referring physicians to grasp key information since it is concluded from the findings and reasoning of radiologists. To alleviate the workload of radiologists and reduce repetitive human labor in impression writing, many researchers have focused on automatic impression generation. Howe... |
2403.07465 | Marco Chilese | Marco Chilese, Richard Mitev, Meni Orenbach, Robert Thorburn, Ahmad
Atamli, Ahmad-Reza Sadeghi | One for All and All for One: GNN-based Control-Flow Attestation for
Embedded Devices | null | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Control-Flow Attestation (CFA) is a security service that allows an entity
(verifier) to verify the integrity of code execution on a remote computer
system (prover). Existing CFA schemes suffer from impractical assumptions, such
as requiring access to the prover's internal state (e.g., memory or code), the
complete C... | [
{
"created": "Tue, 12 Mar 2024 10:00:06 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Chilese",
"Marco",
""
],
[
"Mitev",
"Richard",
""
],
[
"Orenbach",
"Meni",
""
],
[
"Thorburn",
"Robert",
""
],
[
"Atamli",
"Ahmad",
""
],
[
"Sadeghi",
"Ahmad-Reza",
""
]
] | Control-Flow Attestation (CFA) is a security service that allows an entity (verifier) to verify the integrity of code execution on a remote computer system (prover). Existing CFA schemes suffer from impractical assumptions, such as requiring access to the prover's internal state (e.g., memory or code), the complete Con... |
1509.07659 | Laura Rebollo-Neira | Laura Rebollo-Neira and Gagan Aggarwal | A dedicated greedy pursuit algorithm for sparse spectral representation
of music sound | Routines for implementing the approach are available on
http://www.nonlinear-approx.info/examples/node02.html | Journal of the Acoustical Society of America, Vol.140, No.4,
2933-2943 (2016) | 10.1121/1.4964342 | null | cs.SD cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A dedicated algorithm for sparse spectral representation of music sound is
presented. The goal is to enable the representation of a piece of music signal,
as a linear superposition of as few spectral components as possible. A
representation of this nature is said to be sparse. In the present context
sparsity is accom... | [
{
"created": "Fri, 25 Sep 2015 10:03:17 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Nov 2016 13:48:34 GMT",
"version": "v2"
}
] | 2016-11-08 | [
[
"Rebollo-Neira",
"Laura",
""
],
[
"Aggarwal",
"Gagan",
""
]
] | A dedicated algorithm for sparse spectral representation of music sound is presented. The goal is to enable the representation of a piece of music signal, as a linear superposition of as few spectral components as possible. A representation of this nature is said to be sparse. In the present context sparsity is accompl... |
1411.7798 | Ran He | Ran He and Man Zhang and Liang Wang and Ye Ji and Qiyue Yin | Cross-Modal Learning via Pairwise Constraints | 12 pages, 5 figures, 70 references | null | 10.1109/TIP.2015.2466106 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In multimedia applications, the text and image components in a web document
form a pairwise constraint that potentially indicates the same semantic
concept. This paper studies cross-modal learning via the pairwise constraint,
and aims to find the common structure hidden in different modalities. We first
propose a com... | [
{
"created": "Fri, 28 Nov 2014 10:11:03 GMT",
"version": "v1"
}
] | 2023-07-19 | [
[
"He",
"Ran",
""
],
[
"Zhang",
"Man",
""
],
[
"Wang",
"Liang",
""
],
[
"Ji",
"Ye",
""
],
[
"Yin",
"Qiyue",
""
]
] | In multimedia applications, the text and image components in a web document form a pairwise constraint that potentially indicates the same semantic concept. This paper studies cross-modal learning via the pairwise constraint, and aims to find the common structure hidden in different modalities. We first propose a compo... |
1412.2341 | Virendra Sule | Madhav Desai and Virendra Sule | Generalized cofactors and decomposition of Boolean satisfiability
problems | 13 pages | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an approach for decomposing Boolean satisfiability problems while
extending recent results of \cite{sul2} on solving Boolean systems of
equations. Developments in \cite{sul2} were aimed at the expansion of functions
$f$ in orthonormal (ON) sets of base functions as a generalization of the
Boole-Shannon exp... | [
{
"created": "Sun, 7 Dec 2014 10:53:38 GMT",
"version": "v1"
}
] | 2014-12-09 | [
[
"Desai",
"Madhav",
""
],
[
"Sule",
"Virendra",
""
]
] | We propose an approach for decomposing Boolean satisfiability problems while extending recent results of \cite{sul2} on solving Boolean systems of equations. Developments in \cite{sul2} were aimed at the expansion of functions $f$ in orthonormal (ON) sets of base functions as a generalization of the Boole-Shannon expan... |
1102.2479 | Andreas Baldi | Rachit Mohan Garg, Yamini Sood, Balaji Kottana, Pallavi Totlani | A Framework Based Approach for the Development of Web Based Applications | 4 pages | World of Computer Science and Information Technology Journal
(WCSIT),ISSN: 2221-0741,Vol. 1, No. 1, 1-4, Feb. 2011 | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The sole goal of E-Governance is to allow interaction of government with
their citizens in a comfortable & transparent manner. Uniqueness of J2EE makes
it a perfect technology for development of any online portal. These involve
constancy, easy to replant, construct speedily etc. In this paper we present a
procedural ... | [
{
"created": "Sat, 12 Feb 2011 04:22:58 GMT",
"version": "v1"
}
] | 2011-02-15 | [
[
"Garg",
"Rachit Mohan",
""
],
[
"Sood",
"Yamini",
""
],
[
"Kottana",
"Balaji",
""
],
[
"Totlani",
"Pallavi",
""
]
] | The sole goal of E-Governance is to allow interaction of government with their citizens in a comfortable & transparent manner. Uniqueness of J2EE makes it a perfect technology for development of any online portal. These involve constancy, easy to replant, construct speedily etc. In this paper we present a procedural ap... |
0705.4654 | Donald Sofge | Peter F. Lichtenwalner and Donald A. Sofge | Local Area Damage Detection in Composite Structures Using Piezoelectric
Transducers | 7 pages | P.F. Lichtenwalner and D. Sofge, "Local Area Damage Detection in
Composite Structures Using Piezoelectric Transducers," In Proc. SPIE Sym. on
Smart Structures and Materials, Vol. 3326, SPIE, pp. 509-515, 1998 | 10.1117/12.310667 | null | cs.SD cs.CV | null | An integrated and automated smart structures approach for structural health
monitoring is presented, utilizing an array of piezoelectric transducers
attached to or embedded within the structure for both actuation and sensing.
The system actively interrogates the structure via broadband excitation of
multiple actuator... | [
{
"created": "Thu, 31 May 2007 17:19:17 GMT",
"version": "v1"
}
] | 2015-05-13 | [
[
"Lichtenwalner",
"Peter F.",
""
],
[
"Sofge",
"Donald A.",
""
]
] | An integrated and automated smart structures approach for structural health monitoring is presented, utilizing an array of piezoelectric transducers attached to or embedded within the structure for both actuation and sensing. The system actively interrogates the structure via broadband excitation of multiple actuators ... |
1902.00812 | Bj{\o}rn Kjos-Hanssen | Achilles A. Beros and Bj{\o}rn Kjos-Hanssen and Daylan Kaui Yogi | Planar digraphs for automatic complexity | Theory and Applications of Models of Computation (TAMC 2019), Lecture
Notes in Computer Science 11436 (2019) | null | null | null | cs.FL math.CO math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the digraph of a nondeterministic finite automaton witnessing
the automatic complexity of a word can always be taken to be planar. In the
case of total transition functions studied by Shallit and Wang, planarity can
fail.
Let $s_q(n)$ be the number of binary words $x$ of length $n$ having
nondeterminis... | [
{
"created": "Sat, 2 Feb 2019 23:25:32 GMT",
"version": "v1"
}
] | 2019-02-05 | [
[
"Beros",
"Achilles A.",
""
],
[
"Kjos-Hanssen",
"Bjørn",
""
],
[
"Yogi",
"Daylan Kaui",
""
]
] | We show that the digraph of a nondeterministic finite automaton witnessing the automatic complexity of a word can always be taken to be planar. In the case of total transition functions studied by Shallit and Wang, planarity can fail. Let $s_q(n)$ be the number of binary words $x$ of length $n$ having nondeterministic ... |
2304.09649 | Sondre Wold | Lucas Georges Gabriel Charpentier, Sondre Wold, David Samuel and Egil
R{\o}nningstad | BRENT: Bidirectional Retrieval Enhanced Norwegian Transformer | Accepted for NoDaLiDa 2023, main conference | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Retrieval-based language models are increasingly employed in
question-answering tasks. These models search in a corpus of documents for
relevant information instead of having all factual knowledge stored in its
parameters, thereby enhancing efficiency, transparency, and adaptability. We
develop the first Norwegian re... | [
{
"created": "Wed, 19 Apr 2023 13:40:47 GMT",
"version": "v1"
}
] | 2023-04-20 | [
[
"Charpentier",
"Lucas Georges Gabriel",
""
],
[
"Wold",
"Sondre",
""
],
[
"Samuel",
"David",
""
],
[
"Rønningstad",
"Egil",
""
]
] | Retrieval-based language models are increasingly employed in question-answering tasks. These models search in a corpus of documents for relevant information instead of having all factual knowledge stored in its parameters, thereby enhancing efficiency, transparency, and adaptability. We develop the first Norwegian retr... |
1408.2997 | M. C Hanumantharaju Raju | Sreenivasa Setty, N. K Srinath, and M. C Hanumantharaju | An Improved Approach for Contrast Enhancement of Spinal Cord Images
based on Multiscale Retinex Algorithm | 13 pages, 6 figures, International Journal of Imaging and Robotics.
arXiv admin note: text overlap with arXiv:1406.5710 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new approach for contrast enhancement of spinal cord
medical images based on multirate scheme incorporated into multiscale retinex
algorithm. The proposed work here uses HSV color space, since HSV color space
separates color details from intensity. The enhancement of medical image is
achieved by... | [
{
"created": "Wed, 13 Aug 2014 12:50:54 GMT",
"version": "v1"
}
] | 2014-08-14 | [
[
"Setty",
"Sreenivasa",
""
],
[
"Srinath",
"N. K",
""
],
[
"Hanumantharaju",
"M. C",
""
]
] | This paper presents a new approach for contrast enhancement of spinal cord medical images based on multirate scheme incorporated into multiscale retinex algorithm. The proposed work here uses HSV color space, since HSV color space separates color details from intensity. The enhancement of medical image is achieved by d... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.