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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2403.06027 | Adam Mahdi | Felix H. Krones, Ben Walker, Guy Parsons, Terry Lyons, Adam Mahdi | Multimodal deep learning approach to predicting neurological recovery
from coma after cardiac arrest | 5 figures, 2 tables | null | null | null | cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | This work showcases our team's (The BEEGees) contributions to the 2023 George
B. Moody PhysioNet Challenge. The aim was to predict neurological recovery from
coma following cardiac arrest using clinical data and time-series such as
multi-channel EEG and ECG signals. Our modelling approach is multimodal, based
on two-... | [
{
"created": "Sat, 9 Mar 2024 22:29:24 GMT",
"version": "v1"
}
] | 2024-03-12 | [
[
"Krones",
"Felix H.",
""
],
[
"Walker",
"Ben",
""
],
[
"Parsons",
"Guy",
""
],
[
"Lyons",
"Terry",
""
],
[
"Mahdi",
"Adam",
""
]
] | This work showcases our team's (The BEEGees) contributions to the 2023 George B. Moody PhysioNet Challenge. The aim was to predict neurological recovery from coma following cardiac arrest using clinical data and time-series such as multi-channel EEG and ECG signals. Our modelling approach is multimodal, based on two-di... |
2407.02870 | Noam Koren | Noam Koren, Abigail Goldsteen, Ariel Farkash, Guy Amit | Membership Inference Attacks Against Time-Series Models | 16 pages | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Analyzing time-series data that may contain personal information,
particularly in the medical field, presents serious privacy concerns. Sensitive
health data from patients is often used to train machine-learning models for
diagnostics and ongoing care. Assessing the privacy risk of such models is
crucial to making kn... | [
{
"created": "Wed, 3 Jul 2024 07:34:49 GMT",
"version": "v1"
}
] | 2024-07-04 | [
[
"Koren",
"Noam",
""
],
[
"Goldsteen",
"Abigail",
""
],
[
"Farkash",
"Ariel",
""
],
[
"Amit",
"Guy",
""
]
] | Analyzing time-series data that may contain personal information, particularly in the medical field, presents serious privacy concerns. Sensitive health data from patients is often used to train machine-learning models for diagnostics and ongoing care. Assessing the privacy risk of such models is crucial to making know... |
2311.12341 | Ziye Qin | Ziye Qin and Ang Ji and Zhanbo Sun and Guoyuan Wu and Peng Hao and
Xishun Liao | Game Theoretic Application to Intersection Management: A Literature
Review | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The emergence of vehicle-to-everything (V2X) technology offers new insights
into intersection management. This, however, has also presented new challenges,
such as the need to understand and model the interactions of traffic
participants, including their competition and cooperation behaviors. Game
theory has been wid... | [
{
"created": "Tue, 21 Nov 2023 04:25:08 GMT",
"version": "v1"
}
] | 2023-11-22 | [
[
"Qin",
"Ziye",
""
],
[
"Ji",
"Ang",
""
],
[
"Sun",
"Zhanbo",
""
],
[
"Wu",
"Guoyuan",
""
],
[
"Hao",
"Peng",
""
],
[
"Liao",
"Xishun",
""
]
] | The emergence of vehicle-to-everything (V2X) technology offers new insights into intersection management. This, however, has also presented new challenges, such as the need to understand and model the interactions of traffic participants, including their competition and cooperation behaviors. Game theory has been widel... |
1011.5677 | Sachin Adlakha | Sachin Adlakha and Ramesh Johari | Mean Field Equilibrium in Dynamic Games with Complementarities | 56 pages, 5 figures | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a class of stochastic dynamic games that exhibit strategic
complementarities between players; formally, in the games we consider, the
payoff of a player has increasing differences between her own state and the
empirical distribution of the states of other players. Such games can be used
to model a diverse se... | [
{
"created": "Thu, 25 Nov 2010 19:31:47 GMT",
"version": "v1"
}
] | 2010-12-13 | [
[
"Adlakha",
"Sachin",
""
],
[
"Johari",
"Ramesh",
""
]
] | We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical distribution of the states of other players. Such games can be used to model a diverse set ... |
2211.04927 | Hanwei Zhu | Hanwei Zhu, Baoliang Chen, Lingyu Zhu, Shiqi Wang, and Weisi Lin | DeepDC: Deep Distance Correlation as a Perceptual Image Quality
Evaluator | null | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | ImageNet pre-trained deep neural networks (DNNs) show notable transferability
for building effective image quality assessment (IQA) models. Such a remarkable
byproduct has often been identified as an emergent property in previous
studies. In this work, we attribute such capability to the intrinsic
texture-sensitive c... | [
{
"created": "Wed, 9 Nov 2022 14:57:27 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Nov 2023 12:59:12 GMT",
"version": "v2"
}
] | 2023-11-27 | [
[
"Zhu",
"Hanwei",
""
],
[
"Chen",
"Baoliang",
""
],
[
"Zhu",
"Lingyu",
""
],
[
"Wang",
"Shiqi",
""
],
[
"Lin",
"Weisi",
""
]
] | ImageNet pre-trained deep neural networks (DNNs) show notable transferability for building effective image quality assessment (IQA) models. Such a remarkable byproduct has often been identified as an emergent property in previous studies. In this work, we attribute such capability to the intrinsic texture-sensitive cha... |
2004.14257 | Aman Madaan | Aman Madaan, Amrith Setlur, Tanmay Parekh, Barnabas Poczos, Graham
Neubig, Yiming Yang, Ruslan Salakhutdinov, Alan W Black, Shrimai Prabhumoye | Politeness Transfer: A Tag and Generate Approach | To appear at ACL 2020 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | This paper introduces a new task of politeness transfer which involves
converting non-polite sentences to polite sentences while preserving the
meaning. We also provide a dataset of more than 1.39 instances automatically
labeled for politeness to encourage benchmark evaluations on this new task. We
design a tag and g... | [
{
"created": "Wed, 29 Apr 2020 15:08:53 GMT",
"version": "v1"
},
{
"created": "Fri, 1 May 2020 22:33:41 GMT",
"version": "v2"
}
] | 2020-05-05 | [
[
"Madaan",
"Aman",
""
],
[
"Setlur",
"Amrith",
""
],
[
"Parekh",
"Tanmay",
""
],
[
"Poczos",
"Barnabas",
""
],
[
"Neubig",
"Graham",
""
],
[
"Yang",
"Yiming",
""
],
[
"Salakhutdinov",
"Ruslan",
""
],
[
... | This paper introduces a new task of politeness transfer which involves converting non-polite sentences to polite sentences while preserving the meaning. We also provide a dataset of more than 1.39 instances automatically labeled for politeness to encourage benchmark evaluations on this new task. We design a tag and gen... |
1612.01492 | Jennifer Iglesias | Jennifer Iglesias and Rajmohan Rajaraman and R Ravi and Ravi Sundaram | Plane Gossip: Approximating rumor spread in planar graphs | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the design of schedules for multi-commodity multicast; we are given
an undirected graph $G$ and a collection of source destination pairs, and the
goal is to schedule a minimum-length sequence of matchings that connects every
source with its respective destination. Multi-commodity multicast models a
classic i... | [
{
"created": "Mon, 5 Dec 2016 19:41:00 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Jul 2017 20:07:45 GMT",
"version": "v2"
}
] | 2017-07-18 | [
[
"Iglesias",
"Jennifer",
""
],
[
"Rajaraman",
"Rajmohan",
""
],
[
"Ravi",
"R",
""
],
[
"Sundaram",
"Ravi",
""
]
] | We study the design of schedules for multi-commodity multicast; we are given an undirected graph $G$ and a collection of source destination pairs, and the goal is to schedule a minimum-length sequence of matchings that connects every source with its respective destination. Multi-commodity multicast models a classic inf... |
2303.14476 | Xiaoru Yuan | Can Liu, Yu Zhang, Cong Wu, Chen Li and Xiaoru Yuan | A Spatial-Constraint Model for Manipulating Static Visualizations | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | We propose a spatial-constraint approach for modeling spatial-based
interactions and enabling interactive visualizations, which involves the
manipulation of visualizations through selection, filtering, navigation,
arrangement, and aggregation. We proposes a system that activates static
visualizations by adding intell... | [
{
"created": "Sat, 25 Mar 2023 14:09:18 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Mar 2024 06:49:32 GMT",
"version": "v2"
}
] | 2024-03-21 | [
[
"Liu",
"Can",
""
],
[
"Zhang",
"Yu",
""
],
[
"Wu",
"Cong",
""
],
[
"Li",
"Chen",
""
],
[
"Yuan",
"Xiaoru",
""
]
] | We propose a spatial-constraint approach for modeling spatial-based interactions and enabling interactive visualizations, which involves the manipulation of visualizations through selection, filtering, navigation, arrangement, and aggregation. We proposes a system that activates static visualizations by adding intellig... |
2406.04356 | Yi Yao | Yi Yao and Jun Wang and Yabai Hu and Lifeng Wang and Yi Zhou and Jack
Chen and Xuming Gai and Zhenming Wang and Wenjun Liu | BugBlitz-AI: An Intelligent QA Assistant | null | null | null | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The evolution of software testing from manual to automated methods has
significantly influenced quality assurance (QA) practices. However, challenges
persist in post-execution phases, particularly in result analysis and
reporting. Traditional post-execution validation phases require manual
intervention for result ana... | [
{
"created": "Fri, 17 May 2024 11:09:10 GMT",
"version": "v1"
}
] | 2024-06-10 | [
[
"Yao",
"Yi",
""
],
[
"Wang",
"Jun",
""
],
[
"Hu",
"Yabai",
""
],
[
"Wang",
"Lifeng",
""
],
[
"Zhou",
"Yi",
""
],
[
"Chen",
"Jack",
""
],
[
"Gai",
"Xuming",
""
],
[
"Wang",
"Zhenming",
""
]... | The evolution of software testing from manual to automated methods has significantly influenced quality assurance (QA) practices. However, challenges persist in post-execution phases, particularly in result analysis and reporting. Traditional post-execution validation phases require manual intervention for result analy... |
1601.00286 | Christian Lorenz Staudt | Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt,
Dorothea Wagner | Structure-Preserving Sparsification Methods for Social Networks | null | null | null | null | cs.SI cs.DC physics.soc-ph | http://creativecommons.org/licenses/by/4.0/ | Sparsification reduces the size of networks while preserving structural and
statistical properties of interest. Various sparsifying algorithms have been
proposed in different contexts. We contribute the first systematic conceptual
and experimental comparison of \textit{edge sparsification} methods on a
diverse set of... | [
{
"created": "Sun, 3 Jan 2016 12:28:37 GMT",
"version": "v1"
}
] | 2016-01-05 | [
[
"Hamann",
"Michael",
""
],
[
"Lindner",
"Gerd",
""
],
[
"Meyerhenke",
"Henning",
""
],
[
"Staudt",
"Christian L.",
""
],
[
"Wagner",
"Dorothea",
""
]
] | Sparsification reduces the size of networks while preserving structural and statistical properties of interest. Various sparsifying algorithms have been proposed in different contexts. We contribute the first systematic conceptual and experimental comparison of \textit{edge sparsification} methods on a diverse set of n... |
2301.01413 | Yuren Cong | Yuren Cong, Martin Renqiang Min, Li Erran Li, Bodo Rosenhahn, Michael
Ying Yang | Attribute-Centric Compositional Text-to-Image Generation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the recent impressive breakthroughs in text-to-image generation,
generative models have difficulty in capturing the data distribution of
underrepresented attribute compositions while over-memorizing overrepresented
attribute compositions, which raises public concerns about their robustness and
fairness. To ta... | [
{
"created": "Wed, 4 Jan 2023 03:03:08 GMT",
"version": "v1"
}
] | 2023-01-05 | [
[
"Cong",
"Yuren",
""
],
[
"Min",
"Martin Renqiang",
""
],
[
"Li",
"Li Erran",
""
],
[
"Rosenhahn",
"Bodo",
""
],
[
"Yang",
"Michael Ying",
""
]
] | Despite the recent impressive breakthroughs in text-to-image generation, generative models have difficulty in capturing the data distribution of underrepresented attribute compositions while over-memorizing overrepresented attribute compositions, which raises public concerns about their robustness and fairness. To tack... |
1810.01489 | Paul Liu | Paul Liu, Jan Vondrak | Submodular Optimization in the MapReduce Model | 10 pages | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Submodular optimization has received significant attention in both practice
and theory, as a wide array of problems in machine learning, auction theory,
and combinatorial optimization have submodular structure. In practice, these
problems often involve large amounts of data, and must be solved in a
distributed way. O... | [
{
"created": "Tue, 2 Oct 2018 20:08:27 GMT",
"version": "v1"
}
] | 2018-10-04 | [
[
"Liu",
"Paul",
""
],
[
"Vondrak",
"Jan",
""
]
] | Submodular optimization has received significant attention in both practice and theory, as a wide array of problems in machine learning, auction theory, and combinatorial optimization have submodular structure. In practice, these problems often involve large amounts of data, and must be solved in a distributed way. One... |
1904.11799 | Mohit Sharma | Mohit Sharma, Jiayu Zhou, Junling Hu, George Karypis | Feature-based factorized Bilinear Similarity Model for Cold-Start Top-n
Item Recommendation | 9 pages, Proceedings of the 2015 SIAM International Conference on
Data Mining | null | 10.1137/1.9781611974010.22 | null | cs.IR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommending new items to existing users has remained a challenging problem
due to absence of user's past preferences for these items. The user
personalized non-collaborative methods based on item features can be used to
address this item cold-start problem. These methods rely on similarities
between the target item ... | [
{
"created": "Mon, 22 Apr 2019 05:10:48 GMT",
"version": "v1"
}
] | 2019-04-29 | [
[
"Sharma",
"Mohit",
""
],
[
"Zhou",
"Jiayu",
""
],
[
"Hu",
"Junling",
""
],
[
"Karypis",
"George",
""
]
] | Recommending new items to existing users has remained a challenging problem due to absence of user's past preferences for these items. The user personalized non-collaborative methods based on item features can be used to address this item cold-start problem. These methods rely on similarities between the target item an... |
1803.01221 | Bhavya Kailkhura | Bhavya Kailkhura, Priyadip Ray, Deepak Rajan, Anton Yen, Peter Barnes,
Ryan Goldhahn | Byzantine-Resilient Locally Optimum Detection Using Collaborative
Autonomous Networks | Proceedings of the 2017 IEEE International Workshop on Computational
Advances in Multi-Sensor Adaptive Processing (CAMSAP 2017), 10.-13. December
2017, Curacao, Dutch Antilles | null | null | null | cs.SY stat.OT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a locally optimum detection (LOD) scheme for
detecting a weak radioactive source buried in background clutter. We develop a
decentralized algorithm, based on alternating direction method of multipliers
(ADMM), for implementing the proposed scheme in autonomous sensor networks.
Results show t... | [
{
"created": "Sat, 3 Mar 2018 19:34:29 GMT",
"version": "v1"
}
] | 2018-03-06 | [
[
"Kailkhura",
"Bhavya",
""
],
[
"Ray",
"Priyadip",
""
],
[
"Rajan",
"Deepak",
""
],
[
"Yen",
"Anton",
""
],
[
"Barnes",
"Peter",
""
],
[
"Goldhahn",
"Ryan",
""
]
] | In this paper, we propose a locally optimum detection (LOD) scheme for detecting a weak radioactive source buried in background clutter. We develop a decentralized algorithm, based on alternating direction method of multipliers (ADMM), for implementing the proposed scheme in autonomous sensor networks. Results show tha... |
2303.14078 | Jisoo Jeong | Jisoo Jeong, Hong Cai, Risheek Garrepalli, Fatih Porikli | DistractFlow: Improving Optical Flow Estimation via Realistic
Distractions and Pseudo-Labeling | CVPR 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | We propose a novel data augmentation approach, DistractFlow, for training
optical flow estimation models by introducing realistic distractions to the
input frames. Based on a mixing ratio, we combine one of the frames in the pair
with a distractor image depicting a similar domain, which allows for inducing
visual per... | [
{
"created": "Fri, 24 Mar 2023 15:42:54 GMT",
"version": "v1"
}
] | 2023-03-27 | [
[
"Jeong",
"Jisoo",
""
],
[
"Cai",
"Hong",
""
],
[
"Garrepalli",
"Risheek",
""
],
[
"Porikli",
"Fatih",
""
]
] | We propose a novel data augmentation approach, DistractFlow, for training optical flow estimation models by introducing realistic distractions to the input frames. Based on a mixing ratio, we combine one of the frames in the pair with a distractor image depicting a similar domain, which allows for inducing visual pertu... |
cs/0607095 | Hyundong Shin | Hyundong Shin, Moe Z. Win | Gallager's Exponent for MIMO Channels: A Reliability-Rate Tradeoff | Submitted to the IEEE Transactions on Communications | null | null | null | cs.IT math.IT | null | In this paper, we derive Gallager's random coding error exponent for
multiple-input multiple-output (MIMO) channels, assuming no channel-state
information (CSI) at the transmitter and perfect CSI at the receiver. This
measure gives insight into a fundamental tradeoff between the communication
reliability and informat... | [
{
"created": "Thu, 20 Jul 2006 06:56:02 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Shin",
"Hyundong",
""
],
[
"Win",
"Moe Z.",
""
]
] | In this paper, we derive Gallager's random coding error exponent for multiple-input multiple-output (MIMO) channels, assuming no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. This measure gives insight into a fundamental tradeoff between the communication reliability and informatio... |
cs/0608098 | Arvind Parthasarathy | Arvind Parthasarathy | Improved Content Based Image Watermarking | 24 pages | null | null | null | cs.CR | null | This paper presents a robust and transparent scheme of watermarking that
exploits the human visual systems' sensitivity to frequency, along with local
image characteristics obtained from the spatial domain. The underlying idea is
generating a visual mask based on the visual systems' perception of image
content. This ... | [
{
"created": "Fri, 25 Aug 2006 12:55:42 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Parthasarathy",
"Arvind",
""
]
] | This paper presents a robust and transparent scheme of watermarking that exploits the human visual systems' sensitivity to frequency, along with local image characteristics obtained from the spatial domain. The underlying idea is generating a visual mask based on the visual systems' perception of image content. This ma... |
1905.02265 | Xusen Yin | Xusen Yin and Jonathan May | Comprehensible Context-driven Text Game Playing | IEEE Conference on Games 2019 Long Paper | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to train a computer agent to play a text-based computer game, we
must represent each hidden state of the game. A Long Short-Term Memory (LSTM)
model running over observed texts is a common choice for state construction.
However, a normal Deep Q-learning Network (DQN) for such an agent requires
millions of st... | [
{
"created": "Mon, 6 May 2019 21:14:41 GMT",
"version": "v1"
},
{
"created": "Sun, 2 Jun 2019 02:48:31 GMT",
"version": "v2"
},
{
"created": "Thu, 29 Aug 2019 11:50:00 GMT",
"version": "v3"
}
] | 2019-08-30 | [
[
"Yin",
"Xusen",
""
],
[
"May",
"Jonathan",
""
]
] | In order to train a computer agent to play a text-based computer game, we must represent each hidden state of the game. A Long Short-Term Memory (LSTM) model running over observed texts is a common choice for state construction. However, a normal Deep Q-learning Network (DQN) for such an agent requires millions of step... |
2008.12813 | Sanxing Chen | Sanxing Chen, Xiaodong Liu, Jianfeng Gao, Jian Jiao, Ruofei Zhang and
Yangfeng Ji | HittER: Hierarchical Transformers for Knowledge Graph Embeddings | EMNLP 2021 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper examines the challenging problem of learning representations of
entities and relations in a complex multi-relational knowledge graph. We
propose HittER, a Hierarchical Transformer model to jointly learn
Entity-relation composition and Relational contextualization based on a source
entity's neighborhood. Ou... | [
{
"created": "Fri, 28 Aug 2020 18:58:15 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Oct 2021 04:52:07 GMT",
"version": "v2"
}
] | 2021-10-07 | [
[
"Chen",
"Sanxing",
""
],
[
"Liu",
"Xiaodong",
""
],
[
"Gao",
"Jianfeng",
""
],
[
"Jiao",
"Jian",
""
],
[
"Zhang",
"Ruofei",
""
],
[
"Ji",
"Yangfeng",
""
]
] | This paper examines the challenging problem of learning representations of entities and relations in a complex multi-relational knowledge graph. We propose HittER, a Hierarchical Transformer model to jointly learn Entity-relation composition and Relational contextualization based on a source entity's neighborhood. Our ... |
2207.12872 | Ishaan Bhat | Ishaan Bhat, Josien P.W. Pluim, Hugo J. Kuijf | Generalized Probabilistic U-Net for medical image segementation | Accepted at Uncertainty for Safe Utilization of Machine Learning in
Medical Imaging (UNSURE) 2022 | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | We propose the Generalized Probabilistic U-Net, which extends the
Probabilistic U-Net by allowing more general forms of the Gaussian distribution
as the latent space distribution that can better approximate the uncertainty in
the reference segmentations. We study the effect the choice of latent space
distribution has... | [
{
"created": "Tue, 26 Jul 2022 13:03:37 GMT",
"version": "v1"
}
] | 2022-07-27 | [
[
"Bhat",
"Ishaan",
""
],
[
"Pluim",
"Josien P. W.",
""
],
[
"Kuijf",
"Hugo J.",
""
]
] | We propose the Generalized Probabilistic U-Net, which extends the Probabilistic U-Net by allowing more general forms of the Gaussian distribution as the latent space distribution that can better approximate the uncertainty in the reference segmentations. We study the effect the choice of latent space distribution has o... |
2302.13394 | Ahmed Abulila | Ahmed Abulila, Izzat El Hajj, Myoungsoo Jung, Nam Sung Kim | Asynchronous Persistence with ASAP | 2 pages, 2 figures, 14th Annual Non-Volatile Memories Workshop | null | null | null | cs.AR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Supporting atomic durability of updates for persistent memories is typically
achieved with Write-Ahead Logging (WAL). WAL flushes log entries to persistent
memory before making the actual data persistent to ensure that a consistent
state can be recovered if a crash occurs. Performing WAL in hardware is
attractive bec... | [
{
"created": "Sun, 26 Feb 2023 19:34:59 GMT",
"version": "v1"
}
] | 2023-02-28 | [
[
"Abulila",
"Ahmed",
""
],
[
"Hajj",
"Izzat El",
""
],
[
"Jung",
"Myoungsoo",
""
],
[
"Kim",
"Nam Sung",
""
]
] | Supporting atomic durability of updates for persistent memories is typically achieved with Write-Ahead Logging (WAL). WAL flushes log entries to persistent memory before making the actual data persistent to ensure that a consistent state can be recovered if a crash occurs. Performing WAL in hardware is attractive becau... |
2105.02432 | Taotao Jing | Taotao Jing, Hongfu Liu, Zhengming Ding | Towards Novel Target Discovery Through Open-Set Domain Adaptation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open-set domain adaptation (OSDA) considers that the target domain contains
samples from novel categories unobserved in external source domain.
Unfortunately, existing OSDA methods always ignore the demand for the
information of unseen categories and simply recognize them as "unknown" set
without further explanation.... | [
{
"created": "Thu, 6 May 2021 04:22:29 GMT",
"version": "v1"
},
{
"created": "Sun, 16 May 2021 22:32:43 GMT",
"version": "v2"
},
{
"created": "Mon, 9 Aug 2021 17:12:45 GMT",
"version": "v3"
},
{
"created": "Wed, 11 Aug 2021 18:32:16 GMT",
"version": "v4"
}
] | 2021-08-13 | [
[
"Jing",
"Taotao",
""
],
[
"Liu",
"Hongfu",
""
],
[
"Ding",
"Zhengming",
""
]
] | Open-set domain adaptation (OSDA) considers that the target domain contains samples from novel categories unobserved in external source domain. Unfortunately, existing OSDA methods always ignore the demand for the information of unseen categories and simply recognize them as "unknown" set without further explanation. T... |
2302.14533 | Rajiv Kumar V | Rajiv Kumar, G. Sivakumar | DEff-GAN: Diverse Attribute Transfer for Few-Shot Image Synthesis | null | null | 10.5220/0011799600003417 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Requirements of large amounts of data is a difficulty in training many GANs.
Data efficient GANs involve fitting a generators continuous target distribution
with a limited discrete set of data samples, which is a difficult task. Single
image methods have focused on modeling the internal distribution of a single
image... | [
{
"created": "Tue, 28 Feb 2023 12:43:52 GMT",
"version": "v1"
}
] | 2023-03-09 | [
[
"Kumar",
"Rajiv",
""
],
[
"Sivakumar",
"G.",
""
]
] | Requirements of large amounts of data is a difficulty in training many GANs. Data efficient GANs involve fitting a generators continuous target distribution with a limited discrete set of data samples, which is a difficult task. Single image methods have focused on modeling the internal distribution of a single image a... |
1806.02681 | Wanderson Ten\'orio | Carlos Munuera, Wanderson Ten\'orio, Fernando Torres | Locally Recoverable codes from algebraic curves with separated variables | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Locally Recoverable code is an error-correcting code such that any erasure
in a single coordinate of a codeword can be recovered from a small subset of
other coordinates. We study Locally Recoverable Algebraic Geometry codes
arising from certain curves defined by equations with separated variables. The
recovery of ... | [
{
"created": "Thu, 7 Jun 2018 13:48:35 GMT",
"version": "v1"
}
] | 2018-06-08 | [
[
"Munuera",
"Carlos",
""
],
[
"Tenório",
"Wanderson",
""
],
[
"Torres",
"Fernando",
""
]
] | A Locally Recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. We study Locally Recoverable Algebraic Geometry codes arising from certain curves defined by equations with separated variables. The recovery of er... |
2104.00675 | Hsin-Ying Lee | Yen-Chi Cheng, Chieh Hubert Lin, Hsin-Ying Lee, Jian Ren, Sergey
Tulyakov, Ming-Hsuan Yang | In&Out : Diverse Image Outpainting via GAN Inversion | Project Page: https://yccyenchicheng.github.io/InOut/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image outpainting seeks for a semantically consistent extension of the input
image beyond its available content. Compared to inpainting -- filling in
missing pixels in a way coherent with the neighboring pixels -- outpainting can
be achieved in more diverse ways since the problem is less constrained by the
surroundin... | [
{
"created": "Thu, 1 Apr 2021 17:59:10 GMT",
"version": "v1"
}
] | 2021-04-02 | [
[
"Cheng",
"Yen-Chi",
""
],
[
"Lin",
"Chieh Hubert",
""
],
[
"Lee",
"Hsin-Ying",
""
],
[
"Ren",
"Jian",
""
],
[
"Tulyakov",
"Sergey",
""
],
[
"Yang",
"Ming-Hsuan",
""
]
] | Image outpainting seeks for a semantically consistent extension of the input image beyond its available content. Compared to inpainting -- filling in missing pixels in a way coherent with the neighboring pixels -- outpainting can be achieved in more diverse ways since the problem is less constrained by the surrounding ... |
2112.09647 | Matteo Dunnhofer | Matteo Dunnhofer, Alberto Zurini, Maurizio Dunnhofer, Christian
Micheloni | Video-Based Reconstruction of the Trajectories Performed by Skiers | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Trajectories are fundamental in different skiing disciplines. Tools enabling
the analysis of such curves can enhance the training activity and enrich the
broadcasting contents. However, the solutions currently available are based on
geo-localized sensors and surface models. In this short paper, we propose a
video-bas... | [
{
"created": "Fri, 17 Dec 2021 17:40:06 GMT",
"version": "v1"
}
] | 2021-12-20 | [
[
"Dunnhofer",
"Matteo",
""
],
[
"Zurini",
"Alberto",
""
],
[
"Dunnhofer",
"Maurizio",
""
],
[
"Micheloni",
"Christian",
""
]
] | Trajectories are fundamental in different skiing disciplines. Tools enabling the analysis of such curves can enhance the training activity and enrich the broadcasting contents. However, the solutions currently available are based on geo-localized sensors and surface models. In this short paper, we propose a video-based... |
2109.00958 | Juan David Guerrero Balaguera | Juan-David Guerrero-Balaguera, Josie E. Rodriguez Condia, Matteo Sonza
Reorda | A Novel Compaction Approach for SBST Test Programs | Paper accepted to be presented in The 30th IEEE Asian Test Symposium
(ATS 2021) November 22 - 25, 2021, Japan. to be published in the IEEE xplorer
after the presentation in the event | null | null | null | cs.AR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In-field test of processor-based devices is a must when considering
safety-critical systems (e.g., in robotics, aerospace, and automotive
applications). During in-field testing, different solutions can be adopted,
depending on the specific constraints of each scenario. In the last years,
Self-Test Libraries (STLs) de... | [
{
"created": "Thu, 2 Sep 2021 13:58:02 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Sep 2021 12:07:03 GMT",
"version": "v2"
}
] | 2021-09-09 | [
[
"Guerrero-Balaguera",
"Juan-David",
""
],
[
"Condia",
"Josie E. Rodriguez",
""
],
[
"Reorda",
"Matteo Sonza",
""
]
] | In-field test of processor-based devices is a must when considering safety-critical systems (e.g., in robotics, aerospace, and automotive applications). During in-field testing, different solutions can be adopted, depending on the specific constraints of each scenario. In the last years, Self-Test Libraries (STLs) deve... |
2309.00504 | Manuel Sorge | Alexander Firbas and Alexander Dobler and Fabian Holzer and Jakob
Schafellner and Manuel Sorge and Ana\"is Villedieu and Monika Wi{\ss}mann | The Complexity of Cluster Vertex Splitting and Company | 30 pages, 9 figures. Appears in SOFSEM 2024 | null | null | null | cs.DS cs.CC cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering a graph when the clusters can overlap can be seen from three
different angles: We may look for cliques that cover the edges of the graph
with bounded overlap, we may look to add or delete few edges to uncover the
cluster structure, or we may split vertices to separate the clusters from each
other. Splittin... | [
{
"created": "Fri, 1 Sep 2023 14:51:28 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Sep 2023 12:24:07 GMT",
"version": "v2"
},
{
"created": "Wed, 3 Apr 2024 13:20:13 GMT",
"version": "v3"
}
] | 2024-04-04 | [
[
"Firbas",
"Alexander",
""
],
[
"Dobler",
"Alexander",
""
],
[
"Holzer",
"Fabian",
""
],
[
"Schafellner",
"Jakob",
""
],
[
"Sorge",
"Manuel",
""
],
[
"Villedieu",
"Anaïs",
""
],
[
"Wißmann",
"Monika",
""
]... | Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster structure, or we may split vertices to separate the clusters from each other. Splitting ... |
1605.01880 | Kittipong Kittichokechai | Kittipong Kittichokechai and Giuseppe Caire | Privacy-Constrained Remote Source Coding | 10 pages, 1 figure, to be presented at ISIT 2016 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of revealing/sharing data in an efficient and secure
way via a compact representation. The representation should ensure reliable
reconstruction of the desired features/attributes while still preserve privacy
of the secret parts of the data. The problem is formulated as a remote lossy
source co... | [
{
"created": "Fri, 6 May 2016 10:15:57 GMT",
"version": "v1"
}
] | 2016-05-09 | [
[
"Kittichokechai",
"Kittipong",
""
],
[
"Caire",
"Giuseppe",
""
]
] | We consider the problem of revealing/sharing data in an efficient and secure way via a compact representation. The representation should ensure reliable reconstruction of the desired features/attributes while still preserve privacy of the secret parts of the data. The problem is formulated as a remote lossy source codi... |
1804.00755 | Mahmoud Mohammadi | Mahmoud Mohammadi, Bill Chu, Heather Richter Lipford | Detecting Cross-Site Scripting Vulnerabilities through Automated Unit
Testing | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The best practice to prevent Cross Site Scripting (XSS) attacks is to apply
encoders to sanitize untrusted data. To balance security and functionality,
encoders should be applied to match the web page context, such as HTML body,
JavaScript, and style sheets. A common programming error is the use of a wrong
encoder to... | [
{
"created": "Mon, 2 Apr 2018 22:59:18 GMT",
"version": "v1"
}
] | 2018-04-04 | [
[
"Mohammadi",
"Mahmoud",
""
],
[
"Chu",
"Bill",
""
],
[
"Lipford",
"Heather Richter",
""
]
] | The best practice to prevent Cross Site Scripting (XSS) attacks is to apply encoders to sanitize untrusted data. To balance security and functionality, encoders should be applied to match the web page context, such as HTML body, JavaScript, and style sheets. A common programming error is the use of a wrong encoder to s... |
2008.13300 | Michael Luby | Michael Luby | SOPI design and analysis for LDN | This is a companion paper to the LDN paper that appears in ACM ICN
2020 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Liquid Data Networking (LDN) is an ICN architecture that is designed to
enable the benefits of erasure-code enabled object delivery. A primary
contribution of LDN is the introduction of SOPIs, which enables client s to
concurrently download encoded data for the same object from multiple edge
nodes, optimizes caching ... | [
{
"created": "Mon, 31 Aug 2020 00:16:20 GMT",
"version": "v1"
},
{
"created": "Sat, 5 Sep 2020 00:04:23 GMT",
"version": "v2"
}
] | 2020-09-08 | [
[
"Luby",
"Michael",
""
]
] | Liquid Data Networking (LDN) is an ICN architecture that is designed to enable the benefits of erasure-code enabled object delivery. A primary contribution of LDN is the introduction of SOPIs, which enables client s to concurrently download encoded data for the same object from multiple edge nodes, optimizes caching ef... |
2109.02941 | Chandni Saxena | Mudit Chaudhary, Chandni Saxena, Helen Meng | Countering Online Hate Speech: An NLP Perspective | 12 pages | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Online hate speech has caught everyone's attention from the news related to
the COVID-19 pandemic, US elections, and worldwide protests. Online toxicity -
an umbrella term for online hateful behavior, manifests itself in forms such as
online hate speech. Hate speech is a deliberate attack directed towards an
individu... | [
{
"created": "Tue, 7 Sep 2021 08:48:13 GMT",
"version": "v1"
}
] | 2021-09-08 | [
[
"Chaudhary",
"Mudit",
""
],
[
"Saxena",
"Chandni",
""
],
[
"Meng",
"Helen",
""
]
] | Online hate speech has caught everyone's attention from the news related to the COVID-19 pandemic, US elections, and worldwide protests. Online toxicity - an umbrella term for online hateful behavior, manifests itself in forms such as online hate speech. Hate speech is a deliberate attack directed towards an individual... |
2405.02580 | Ye Liu | Ye Liu, Yue Xue, Daoyuan Wu, Yuqiang Sun, Yi Li, Miaolei Shi, Yang Liu | PropertyGPT: LLM-driven Formal Verification of Smart Contracts through
Retrieval-Augmented Property Generation | null | null | null | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With recent advances in large language models (LLMs), this paper explores the
potential of leveraging state-of-the-art LLMs, such as GPT-4, to transfer
existing human-written properties (e.g., those from Certora auditing reports)
and automatically generate customized properties for unknown code. To this end,
we embed... | [
{
"created": "Sat, 4 May 2024 06:28:27 GMT",
"version": "v1"
}
] | 2024-05-07 | [
[
"Liu",
"Ye",
""
],
[
"Xue",
"Yue",
""
],
[
"Wu",
"Daoyuan",
""
],
[
"Sun",
"Yuqiang",
""
],
[
"Li",
"Yi",
""
],
[
"Shi",
"Miaolei",
""
],
[
"Liu",
"Yang",
""
]
] | With recent advances in large language models (LLMs), this paper explores the potential of leveraging state-of-the-art LLMs, such as GPT-4, to transfer existing human-written properties (e.g., those from Certora auditing reports) and automatically generate customized properties for unknown code. To this end, we embed e... |
1708.00980 | Yudong Guo | Yudong Guo, Juyong Zhang, Jianfei Cai, Boyi Jiang and Jianmin Zheng | CNN-based Real-time Dense Face Reconstruction with Inverse-rendered
Photo-realistic Face Images | Accepted by IEEE Transactions on Pattern Analysis and Machine
Intelligence, 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the powerfulness of convolution neural networks (CNN), CNN based face
reconstruction has recently shown promising performance in reconstructing
detailed face shape from 2D face images. The success of CNN-based methods
relies on a large number of labeled data. The state-of-the-art synthesizes such
data using a co... | [
{
"created": "Thu, 3 Aug 2017 03:18:34 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Sep 2017 11:32:01 GMT",
"version": "v2"
},
{
"created": "Tue, 15 May 2018 07:02:35 GMT",
"version": "v3"
}
] | 2018-05-16 | [
[
"Guo",
"Yudong",
""
],
[
"Zhang",
"Juyong",
""
],
[
"Cai",
"Jianfei",
""
],
[
"Jiang",
"Boyi",
""
],
[
"Zheng",
"Jianmin",
""
]
] | With the powerfulness of convolution neural networks (CNN), CNN based face reconstruction has recently shown promising performance in reconstructing detailed face shape from 2D face images. The success of CNN-based methods relies on a large number of labeled data. The state-of-the-art synthesizes such data using a coar... |
2309.04175 | Haochun Wang | Haochun Wang, Sendong Zhao, Zewen Qiang, Zijian Li, Nuwa Xi, Yanrui
Du, MuZhen Cai, Haoqiang Guo, Yuhan Chen, Haoming Xu, Bing Qin, Ting Liu | Knowledge-tuning Large Language Models with Structured Medical Knowledge
Bases for Reliable Response Generation in Chinese | 11 pages, 5 figures | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large Language Models (LLMs) have demonstrated remarkable success in diverse
natural language processing (NLP) tasks in general domains. However, LLMs
sometimes generate responses with the hallucination about medical facts due to
limited domain knowledge. Such shortcomings pose potential risks in the
utilization of L... | [
{
"created": "Fri, 8 Sep 2023 07:42:57 GMT",
"version": "v1"
}
] | 2023-09-11 | [
[
"Wang",
"Haochun",
""
],
[
"Zhao",
"Sendong",
""
],
[
"Qiang",
"Zewen",
""
],
[
"Li",
"Zijian",
""
],
[
"Xi",
"Nuwa",
""
],
[
"Du",
"Yanrui",
""
],
[
"Cai",
"MuZhen",
""
],
[
"Guo",
"Haoqiang",
... | Large Language Models (LLMs) have demonstrated remarkable success in diverse natural language processing (NLP) tasks in general domains. However, LLMs sometimes generate responses with the hallucination about medical facts due to limited domain knowledge. Such shortcomings pose potential risks in the utilization of LLM... |
2303.16611 | Sebastien Valette Dr | Kaifeng Zou, Sylvain Faisan, Boyang Yu, S\'ebastien Valette, Hyewon
Seo | 4D Facial Expression Diffusion Model | null | null | 10.1145/3653455 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Facial expression generation is one of the most challenging and long-sought
aspects of character animation, with many interesting applications. The
challenging task, traditionally having relied heavily on digital craftspersons,
remains yet to be explored. In this paper, we introduce a generative framework
for generat... | [
{
"created": "Wed, 29 Mar 2023 11:50:21 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Apr 2024 13:29:47 GMT",
"version": "v2"
}
] | 2024-04-16 | [
[
"Zou",
"Kaifeng",
""
],
[
"Faisan",
"Sylvain",
""
],
[
"Yu",
"Boyang",
""
],
[
"Valette",
"Sébastien",
""
],
[
"Seo",
"Hyewon",
""
]
] | Facial expression generation is one of the most challenging and long-sought aspects of character animation, with many interesting applications. The challenging task, traditionally having relied heavily on digital craftspersons, remains yet to be explored. In this paper, we introduce a generative framework for generatin... |
2405.03734 | Xiaoning Wang | Silan Hu, Xiaoning Wang | FOKE: A Personalized and Explainable Education Framework Integrating
Foundation Models, Knowledge Graphs, and Prompt Engineering | null | null | null | null | cs.HC cs.AI stat.AP | http://creativecommons.org/licenses/by/4.0/ | Integrating large language models (LLMs) and knowledge graphs (KGs) holds
great promise for revolutionizing intelligent education, but challenges remain
in achieving personalization, interactivity, and explainability. We propose
FOKE, a Forest Of Knowledge and Education framework that synergizes foundation
models, kn... | [
{
"created": "Mon, 6 May 2024 15:11:05 GMT",
"version": "v1"
}
] | 2024-05-08 | [
[
"Hu",
"Silan",
""
],
[
"Wang",
"Xiaoning",
""
]
] | Integrating large language models (LLMs) and knowledge graphs (KGs) holds great promise for revolutionizing intelligent education, but challenges remain in achieving personalization, interactivity, and explainability. We propose FOKE, a Forest Of Knowledge and Education framework that synergizes foundation models, know... |
1612.03052 | Joe Yue-Hei Ng | Joe Yue-Hei Ng, Jonghyun Choi, Jan Neumann, Larry S. Davis | ActionFlowNet: Learning Motion Representation for Action Recognition | WACV 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Even with the recent advances in convolutional neural networks (CNN) in
various visual recognition tasks, the state-of-the-art action recognition
system still relies on hand crafted motion feature such as optical flow to
achieve the best performance. We propose a multitask learning model
ActionFlowNet to train a sing... | [
{
"created": "Fri, 9 Dec 2016 15:20:23 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Apr 2017 01:45:42 GMT",
"version": "v2"
},
{
"created": "Fri, 16 Feb 2018 22:15:25 GMT",
"version": "v3"
}
] | 2018-02-20 | [
[
"Ng",
"Joe Yue-Hei",
""
],
[
"Choi",
"Jonghyun",
""
],
[
"Neumann",
"Jan",
""
],
[
"Davis",
"Larry S.",
""
]
] | Even with the recent advances in convolutional neural networks (CNN) in various visual recognition tasks, the state-of-the-art action recognition system still relies on hand crafted motion feature such as optical flow to achieve the best performance. We propose a multitask learning model ActionFlowNet to train a single... |
1904.10386 | Mario Gleirscher | Mario Gleirscher | Risk Structures: Towards Engineering Risk-aware Autonomous Systems | null | null | 10.1007/s00165-021-00545-4 | null | cs.SE cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | Inspired by widely-used techniques of causal modelling in risk, failure, and
accident analysis, this work discusses a compositional framework for risk
modelling. Risk models capture fragments of the space of risky events likely to
occur when operating a machine in a given environment. Moreover, one can build
such mod... | [
{
"created": "Tue, 23 Apr 2019 15:29:00 GMT",
"version": "v1"
}
] | 2021-12-22 | [
[
"Gleirscher",
"Mario",
""
]
] | Inspired by widely-used techniques of causal modelling in risk, failure, and accident analysis, this work discusses a compositional framework for risk modelling. Risk models capture fragments of the space of risky events likely to occur when operating a machine in a given environment. Moreover, one can build such model... |
2301.07634 | Panagiotis Meletis | Panagiotis Meletis, Gijs Dubbelman | Training Semantic Segmentation on Heterogeneous Datasets | Submitted 2021 (under review) | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We explore semantic segmentation beyond the conventional, single-dataset
homogeneous training and bring forward the problem of Heterogeneous Training of
Semantic Segmentation (HTSS). HTSS involves simultaneous training on multiple
heterogeneous datasets, i.e. datasets with conflicting label spaces and
different (weak... | [
{
"created": "Wed, 18 Jan 2023 16:22:40 GMT",
"version": "v1"
}
] | 2023-01-19 | [
[
"Meletis",
"Panagiotis",
""
],
[
"Dubbelman",
"Gijs",
""
]
] | We explore semantic segmentation beyond the conventional, single-dataset homogeneous training and bring forward the problem of Heterogeneous Training of Semantic Segmentation (HTSS). HTSS involves simultaneous training on multiple heterogeneous datasets, i.e. datasets with conflicting label spaces and different (weak) ... |
1906.10104 | Weilian Song | Weilian Song, Tawfiq Salem, Hunter Blanton, Nathan Jacobs | Remote Estimation of Free-Flow Speeds | 4 pages, 4 figures, IGARSS 2019 camera-ready submission | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an automated method to estimate a road segment's free-flow speed
from overhead imagery and road metadata. The free-flow speed of a road segment
is the average observed vehicle speed in ideal conditions, without congestion
or adverse weather. Standard practice for estimating free-flow speeds depends
on seve... | [
{
"created": "Mon, 24 Jun 2019 17:41:46 GMT",
"version": "v1"
}
] | 2019-06-25 | [
[
"Song",
"Weilian",
""
],
[
"Salem",
"Tawfiq",
""
],
[
"Blanton",
"Hunter",
""
],
[
"Jacobs",
"Nathan",
""
]
] | We propose an automated method to estimate a road segment's free-flow speed from overhead imagery and road metadata. The free-flow speed of a road segment is the average observed vehicle speed in ideal conditions, without congestion or adverse weather. Standard practice for estimating free-flow speeds depends on severa... |
1508.06710 | EPTCS | Pedro R. D'Argenio (FaMAF, Universidad Nacional de C\'ordoba -
CONICET), Matias David Lee (FaMAF, Universidad Nacional de C\'ordoba -
CONICET), Daniel Gebler (Department of Computer Science, VU University
Amsterdam) | SOS rule formats for convex and abstract probabilistic bisimulations | In Proceedings EXPRESS/SOS 2015, arXiv:1508.06347 | EPTCS 190, 2015, pp. 31-45 | 10.4204/EPTCS.190.3 | null | cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Probabilistic transition system specifications (PTSSs) in the $nt \mu f\theta
/ nt\mu x\theta$ format provide structural operational semantics for
Segala-type systems that exhibit both probabilistic and nondeterministic
behavior and guarantee that bisimilarity is a congruence for all operator
defined in such format. ... | [
{
"created": "Thu, 27 Aug 2015 03:21:26 GMT",
"version": "v1"
}
] | 2015-08-28 | [
[
"D'Argenio",
"Pedro R.",
"",
"FaMAF, Universidad Nacional de Córdoba -\n CONICET"
],
[
"Lee",
"Matias David",
"",
"FaMAF, Universidad Nacional de Córdoba -\n CONICET"
],
[
"Gebler",
"Daniel",
"",
"Department of Computer Science, VU University\n Amsterdam"... | Probabilistic transition system specifications (PTSSs) in the $nt \mu f\theta / nt\mu x\theta$ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a congruence for all operator defined in such format. St... |
2205.00772 | Jonas Falkner | Jonas K. Falkner, Daniela Thyssens, Lars Schmidt-Thieme | Large Neighborhood Search based on Neural Construction Heuristics | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | We propose a Large Neighborhood Search (LNS) approach utilizing a learned
construction heuristic based on neural networks as repair operator to solve the
vehicle routing problem with time windows (VRPTW). Our method uses graph neural
networks to encode the problem and auto-regressively decodes a solution and is
train... | [
{
"created": "Mon, 2 May 2022 09:38:19 GMT",
"version": "v1"
},
{
"created": "Tue, 10 May 2022 12:02:44 GMT",
"version": "v2"
}
] | 2022-05-11 | [
[
"Falkner",
"Jonas K.",
""
],
[
"Thyssens",
"Daniela",
""
],
[
"Schmidt-Thieme",
"Lars",
""
]
] | We propose a Large Neighborhood Search (LNS) approach utilizing a learned construction heuristic based on neural networks as repair operator to solve the vehicle routing problem with time windows (VRPTW). Our method uses graph neural networks to encode the problem and auto-regressively decodes a solution and is trained... |
2406.07393 | Peng Hu | Peng Hu, Changjiang Gao, Ruiqi Gao, Jiajun Chen, and Shujian Huang | Limited Out-of-Context Knowledge Reasoning in Large Language Models | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Large Language Models (LLMs) have demonstrated strong capabilities as
knowledge bases and significant in-context reasoning capabilities. However,
previous work challenges their out-of-context reasoning ability, i.e., the
ability to infer information from their training data, instead of from the
context or prompt. Thi... | [
{
"created": "Tue, 11 Jun 2024 15:58:59 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jun 2024 14:59:54 GMT",
"version": "v2"
}
] | 2024-06-25 | [
[
"Hu",
"Peng",
""
],
[
"Gao",
"Changjiang",
""
],
[
"Gao",
"Ruiqi",
""
],
[
"Chen",
"Jiajun",
""
],
[
"Huang",
"Shujian",
""
]
] | Large Language Models (LLMs) have demonstrated strong capabilities as knowledge bases and significant in-context reasoning capabilities. However, previous work challenges their out-of-context reasoning ability, i.e., the ability to infer information from their training data, instead of from the context or prompt. This ... |
2203.08737 | Giorgos Armeniakos | Giorgos Armeniakos, Georgios Zervakis, Dimitrios Soudris, J\"org
Henkel | Hardware Approximate Techniques for Deep Neural Network Accelerators: A
Survey | This paper has been accepted by ACM Computing Surveys (CSUR), 2022 | ACM Computing Surveys 2022 | 10.1145/3527156 | null | cs.AR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Neural Networks (DNNs) are very popular because of their high
performance in various cognitive tasks in Machine Learning (ML). Recent
advancements in DNNs have brought beyond human accuracy in many tasks, but at
the cost of high computational complexity. To enable efficient execution of DNN
inference, more and m... | [
{
"created": "Wed, 16 Mar 2022 16:33:13 GMT",
"version": "v1"
}
] | 2022-03-18 | [
[
"Armeniakos",
"Giorgos",
""
],
[
"Zervakis",
"Georgios",
""
],
[
"Soudris",
"Dimitrios",
""
],
[
"Henkel",
"Jörg",
""
]
] | Deep Neural Networks (DNNs) are very popular because of their high performance in various cognitive tasks in Machine Learning (ML). Recent advancements in DNNs have brought beyond human accuracy in many tasks, but at the cost of high computational complexity. To enable efficient execution of DNN inference, more and mor... |
2401.15966 | Kenta Izumi | Kenta Izumi, Hiroki Tanaka, Kazuhiro Shidara, Hiroyoshi Adachi,
Daisuke Kanayama, Takashi Kudo, and Satoshi Nakamura | Response Generation for Cognitive Behavioral Therapy with Large Language
Models: Comparative Study with Socratic Questioning | Accepted by IWSDS2024 | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Dialogue systems controlled by predefined or rule-based scenarios derived
from counseling techniques, such as cognitive behavioral therapy (CBT), play an
important role in mental health apps. Despite the need for responsible
responses, it is conceivable that using the newly emerging LLMs to generate
contextually rele... | [
{
"created": "Mon, 29 Jan 2024 08:53:41 GMT",
"version": "v1"
}
] | 2024-01-30 | [
[
"Izumi",
"Kenta",
""
],
[
"Tanaka",
"Hiroki",
""
],
[
"Shidara",
"Kazuhiro",
""
],
[
"Adachi",
"Hiroyoshi",
""
],
[
"Kanayama",
"Daisuke",
""
],
[
"Kudo",
"Takashi",
""
],
[
"Nakamura",
"Satoshi",
""
]
] | Dialogue systems controlled by predefined or rule-based scenarios derived from counseling techniques, such as cognitive behavioral therapy (CBT), play an important role in mental health apps. Despite the need for responsible responses, it is conceivable that using the newly emerging LLMs to generate contextually releva... |
0708.1150 | Marko Antonio Rodriguez | Marko A. Rodriguez, Johah Bollen, Herbert Van de Sompel | A Practical Ontology for the Large-Scale Modeling of Scholarly Artifacts
and their Usage | null | Proceedings of the IEEE/ACM Joint Conference on Digital Libraries
(JCDL'07), pp. 278-287, 2007 | 10.1145/1255175.1255229 | null | cs.DL cs.AI | null | The large-scale analysis of scholarly artifact usage is constrained primarily
by current practices in usage data archiving, privacy issues concerned with the
dissemination of usage data, and the lack of a practical ontology for modeling
the usage domain. As a remedy to the third constraint, this article presents a
sc... | [
{
"created": "Wed, 8 Aug 2007 17:06:55 GMT",
"version": "v1"
}
] | 2007-08-09 | [
[
"Rodriguez",
"Marko A.",
""
],
[
"Bollen",
"Johah",
""
],
[
"Van de Sompel",
"Herbert",
""
]
] | The large-scale analysis of scholarly artifact usage is constrained primarily by current practices in usage data archiving, privacy issues concerned with the dissemination of usage data, and the lack of a practical ontology for modeling the usage domain. As a remedy to the third constraint, this article presents a scho... |
1905.09514 | Min Qiu | Min Qiu, Yu-Chih Huang, Jinhong Yuan | Downlink Non-Orthogonal Multiple Access without SIC for Block Fading
Channels: An Algebraic Rotation Approach | 15 pages, 8 figures, accepted by IEEE Transactions on Wireless
Communications | null | 10.1109/TWC.2019.2919292 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the problem of downlink non-orthogonal multiple
access (NOMA) over block fading channels. For the single antenna case, we
propose a class of NOMA schemes where all the users' signals are mapped into
$n$-dimensional constellations corresponding to the same algebraic lattices
from a number... | [
{
"created": "Thu, 23 May 2019 07:45:07 GMT",
"version": "v1"
}
] | 2019-06-18 | [
[
"Qiu",
"Min",
""
],
[
"Huang",
"Yu-Chih",
""
],
[
"Yuan",
"Jinhong",
""
]
] | In this paper, we investigate the problem of downlink non-orthogonal multiple access (NOMA) over block fading channels. For the single antenna case, we propose a class of NOMA schemes where all the users' signals are mapped into $n$-dimensional constellations corresponding to the same algebraic lattices from a number f... |
2002.07418 | Peng Zhang | Peng Zhang, Jianye Hao, Weixun Wang, Hongyao Tang, Yi Ma, Yihai Duan,
Yan Zheng | KoGuN: Accelerating Deep Reinforcement Learning via Integrating Human
Suboptimal Knowledge | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning agents usually learn from scratch, which requires a
large number of interactions with the environment. This is quite different from
the learning process of human. When faced with a new task, human naturally have
the common sense and use the prior knowledge to derive an initial policy and
guide ... | [
{
"created": "Tue, 18 Feb 2020 07:58:27 GMT",
"version": "v1"
},
{
"created": "Thu, 21 May 2020 07:02:41 GMT",
"version": "v2"
}
] | 2020-05-22 | [
[
"Zhang",
"Peng",
""
],
[
"Hao",
"Jianye",
""
],
[
"Wang",
"Weixun",
""
],
[
"Tang",
"Hongyao",
""
],
[
"Ma",
"Yi",
""
],
[
"Duan",
"Yihai",
""
],
[
"Zheng",
"Yan",
""
]
] | Reinforcement learning agents usually learn from scratch, which requires a large number of interactions with the environment. This is quite different from the learning process of human. When faced with a new task, human naturally have the common sense and use the prior knowledge to derive an initial policy and guide th... |
2108.01154 | Ali Raheem Mandeel | Ali Raheem Mandeel, Mohammed Salah Al-Radhi, Tam\'as G\'abor Csap\'o | Speaker Adaptation with Continuous Vocoder-based DNN-TTS | 10 pages, 3 figures, 23RD INTERNATIONAL CONFERENCE ON SPEECH AND
COMPUTER SPECOM 2021 | null | null | null | cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Traditional vocoder-based statistical parametric speech synthesis can be
advantageous in applications that require low computational complexity. Recent
neural vocoders, which can produce high naturalness, still cannot fulfill the
requirement of being real-time during synthesis. In this paper, we experiment
with our e... | [
{
"created": "Mon, 2 Aug 2021 20:08:07 GMT",
"version": "v1"
}
] | 2021-08-04 | [
[
"Mandeel",
"Ali Raheem",
""
],
[
"Al-Radhi",
"Mohammed Salah",
""
],
[
"Csapó",
"Tamás Gábor",
""
]
] | Traditional vocoder-based statistical parametric speech synthesis can be advantageous in applications that require low computational complexity. Recent neural vocoders, which can produce high naturalness, still cannot fulfill the requirement of being real-time during synthesis. In this paper, we experiment with our ear... |
1609.08154 | Zhiyong Shan | Zhiyong Shan, Yu-fang Sun | Implementing RBAC model in An Operating System Kernel | in Chinese | null | null | null | cs.OS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the implementation of an operating system oriented RBAC model
is discussed. Firstly, on the basis of RBAC96 model, a new RBAC model named OSR
is presented. Secondly, the OSR model is enforced in RFSOS kernel by the way of
integrating GFAC method and Capability mechanism together. All parts of the OSR
i... | [
{
"created": "Mon, 26 Sep 2016 17:36:18 GMT",
"version": "v1"
}
] | 2016-09-28 | [
[
"Shan",
"Zhiyong",
""
],
[
"Sun",
"Yu-fang",
""
]
] | In this paper, the implementation of an operating system oriented RBAC model is discussed. Firstly, on the basis of RBAC96 model, a new RBAC model named OSR is presented. Secondly, the OSR model is enforced in RFSOS kernel by the way of integrating GFAC method and Capability mechanism together. All parts of the OSR imp... |
1903.00172 | Yoshihiko Suhara | Nikita Bhutani, Yoshihiko Suhara, Wang-Chiew Tan, Alon Halevy, H. V.
Jagadish | Open Information Extraction from Question-Answer Pairs | NAACL 2019 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open Information Extraction (OpenIE) extracts meaningful structured tuples
from free-form text. Most previous work on OpenIE considers extracting data
from one sentence at a time. We describe NeurON, a system for extracting tuples
from question-answer pairs. Since real questions and answers often contain
precisely th... | [
{
"created": "Fri, 1 Mar 2019 06:26:50 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Apr 2019 08:56:40 GMT",
"version": "v2"
}
] | 2019-04-09 | [
[
"Bhutani",
"Nikita",
""
],
[
"Suhara",
"Yoshihiko",
""
],
[
"Tan",
"Wang-Chiew",
""
],
[
"Halevy",
"Alon",
""
],
[
"Jagadish",
"H. V.",
""
]
] | Open Information Extraction (OpenIE) extracts meaningful structured tuples from free-form text. Most previous work on OpenIE considers extracting data from one sentence at a time. We describe NeurON, a system for extracting tuples from question-answer pairs. Since real questions and answers often contain precisely the ... |
1910.09579 | Steven W.T. Cheung | Steven W.T. Cheung, Dan R. Ghica, Koko Muroya | Transparent Synchronous Dataflow | null | The Art, Science, and Engineering of Programming, 2021, Vol. 5,
Issue 3, Article 12 | 10.22152/programming-journal.org/2021/5/12 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dataflow programming is a popular and convenient programming paradigm in
systems modelling, optimisation, and machine learning. It has a number of
advantages, for instance the lacks of control flow allows computation to be
carried out in parallel as well as in distributed machines. More recently the
idea of dataflow ... | [
{
"created": "Mon, 21 Oct 2019 18:12:46 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Mar 2021 21:12:23 GMT",
"version": "v2"
}
] | 2021-03-03 | [
[
"Cheung",
"Steven W. T.",
""
],
[
"Ghica",
"Dan R.",
""
],
[
"Muroya",
"Koko",
""
]
] | Dataflow programming is a popular and convenient programming paradigm in systems modelling, optimisation, and machine learning. It has a number of advantages, for instance the lacks of control flow allows computation to be carried out in parallel as well as in distributed machines. More recently the idea of dataflow gr... |
2004.03424 | Joon Sik Kim | Joon Sik Kim, Jiahao Chen, Ameet Talwalkar | FACT: A Diagnostic for Group Fairness Trade-offs | Accepted to International Conference on Machine Learning (ICML 2020) | null | null | null | cs.LG cs.CY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Group fairness, a class of fairness notions that measure how different groups
of individuals are treated differently according to their protected attributes,
has been shown to conflict with one another, often with a necessary cost in
loss of model's predictive performance. We propose a general diagnostic that
enables... | [
{
"created": "Tue, 7 Apr 2020 14:15:51 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Apr 2020 17:55:32 GMT",
"version": "v2"
},
{
"created": "Tue, 7 Jul 2020 17:34:11 GMT",
"version": "v3"
}
] | 2020-07-08 | [
[
"Kim",
"Joon Sik",
""
],
[
"Chen",
"Jiahao",
""
],
[
"Talwalkar",
"Ameet",
""
]
] | Group fairness, a class of fairness notions that measure how different groups of individuals are treated differently according to their protected attributes, has been shown to conflict with one another, often with a necessary cost in loss of model's predictive performance. We propose a general diagnostic that enables s... |
2307.08233 | Liu Liu | Liu Liu, Shuaifeng Zhi, Zhenhua Du, Li Liu, Xinyu Zhang, Kai Huo, and
Weidong Jiang | ROFusion: Efficient Object Detection using Hybrid Point-wise
Radar-Optical Fusion | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Radars, due to their robustness to adverse weather conditions and ability to
measure object motions, have served in autonomous driving and intelligent
agents for years. However, Radar-based perception suffers from its unintuitive
sensing data, which lack of semantic and structural information of scenes. To
tackle thi... | [
{
"created": "Mon, 17 Jul 2023 04:25:46 GMT",
"version": "v1"
}
] | 2023-07-18 | [
[
"Liu",
"Liu",
""
],
[
"Zhi",
"Shuaifeng",
""
],
[
"Du",
"Zhenhua",
""
],
[
"Liu",
"Li",
""
],
[
"Zhang",
"Xinyu",
""
],
[
"Huo",
"Kai",
""
],
[
"Jiang",
"Weidong",
""
]
] | Radars, due to their robustness to adverse weather conditions and ability to measure object motions, have served in autonomous driving and intelligent agents for years. However, Radar-based perception suffers from its unintuitive sensing data, which lack of semantic and structural information of scenes. To tackle this ... |
cs/0106006 | Aspassia Daskalopulu | Aspassia Daskalopulu, Marek Sergot | A Constraint-Driven System for Contract Assembly | null | Proc. 5th International Conference on Artificial Intelligence and
Law, ACM Press, pp. 62-69, 1995 | null | null | cs.AI | null | We present an approach for modelling the structure and coarse content of
legal documents with a view to providing automated support for the drafting of
contracts and contract database retrieval. The approach is designed to be
applicable where contract drafting is based on model-form contracts or on
existing examples ... | [
{
"created": "Thu, 7 Jun 2001 14:27:30 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Daskalopulu",
"Aspassia",
""
],
[
"Sergot",
"Marek",
""
]
] | We present an approach for modelling the structure and coarse content of legal documents with a view to providing automated support for the drafting of contracts and contract database retrieval. The approach is designed to be applicable where contract drafting is based on model-form contracts or on existing examples of... |
2210.03154 | Loukas Ilias | Konstantinos Psychogyios, Loukas Ilias, Dimitris Askounis | Comparison of Missing Data Imputation Methods using the Framingham Heart
study dataset | 2022 IEEE EMBS International Conference on Biomedical & Health
Informatics (BHI) | null | 10.1109/BHI56158.2022.9926882 | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Cardiovascular disease (CVD) is a class of diseases that involve the heart or
blood vessels and according to World Health Organization is the leading cause
of death worldwide. EHR data regarding this case, as well as medical cases in
general, contain missing values very frequently. The percentage of missingness
may v... | [
{
"created": "Thu, 6 Oct 2022 18:35:08 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Oct 2022 07:22:00 GMT",
"version": "v2"
}
] | 2022-11-08 | [
[
"Psychogyios",
"Konstantinos",
""
],
[
"Ilias",
"Loukas",
""
],
[
"Askounis",
"Dimitris",
""
]
] | Cardiovascular disease (CVD) is a class of diseases that involve the heart or blood vessels and according to World Health Organization is the leading cause of death worldwide. EHR data regarding this case, as well as medical cases in general, contain missing values very frequently. The percentage of missingness may var... |
2405.17914 | Xiumei Deng | Xiumei Deng, Jun Li, Long Shi, Kang Wei, Ming Ding, Yumeng Shao, Wen
Chen, Shi Jin | Trustworthy DNN Partition for Blockchain-enabled Digital Twin in
Wireless IIoT Networks | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Digital twin (DT) has emerged as a promising solution to enhance
manufacturing efficiency in industrial Internet of Things (IIoT) networks. To
promote the efficiency and trustworthiness of DT for wireless IIoT networks, we
propose a blockchain-enabled DT (B-DT) framework that employs deep neural
network (DNN) partiti... | [
{
"created": "Tue, 28 May 2024 07:34:12 GMT",
"version": "v1"
}
] | 2024-05-29 | [
[
"Deng",
"Xiumei",
""
],
[
"Li",
"Jun",
""
],
[
"Shi",
"Long",
""
],
[
"Wei",
"Kang",
""
],
[
"Ding",
"Ming",
""
],
[
"Shao",
"Yumeng",
""
],
[
"Chen",
"Wen",
""
],
[
"Jin",
"Shi",
""
]
] | Digital twin (DT) has emerged as a promising solution to enhance manufacturing efficiency in industrial Internet of Things (IIoT) networks. To promote the efficiency and trustworthiness of DT for wireless IIoT networks, we propose a blockchain-enabled DT (B-DT) framework that employs deep neural network (DNN) partition... |
1906.12140 | Swanand Kadhe | Swanand Kadhe, Jichan Chung, and Kannan Ramchandran | SeF: A Secure Fountain Architecture for Slashing Storage Costs in
Blockchains | null | null | null | null | cs.CR cs.DC cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Full nodes, which synchronize the entire blockchain history and independently
validate all the blocks, form the backbone of any blockchain network by playing
a vital role in ensuring security properties. On the other hand, a user running
a full node needs to pay a heavy price in terms of storage costs. E.g., the
Bitc... | [
{
"created": "Fri, 28 Jun 2019 11:32:33 GMT",
"version": "v1"
}
] | 2019-07-01 | [
[
"Kadhe",
"Swanand",
""
],
[
"Chung",
"Jichan",
""
],
[
"Ramchandran",
"Kannan",
""
]
] | Full nodes, which synchronize the entire blockchain history and independently validate all the blocks, form the backbone of any blockchain network by playing a vital role in ensuring security properties. On the other hand, a user running a full node needs to pay a heavy price in terms of storage costs. E.g., the Bitcoi... |
2407.12024 | Jordan Rey-Jouanchicot | Jordan Rey-Jouanchicot (IRIT-ELIPSE, LAAS), Andr\'e Bottaro, Eric
Campo (LAAS-S4M), Jean-L\'eon Bouraoui, Nadine Vigouroux (IRIT-ELIPSE),
Fr\'ed\'eric Vella (IRIT-ELIPSE) | Leveraging Large Language Models for enhanced personalised user
experience in Smart Homes | null | null | null | null | cs.HC cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Smart home automation systems aim to improve the comfort and convenience of
users in their living environment. However, adapting automation to user needs
remains a challenge. Indeed, many systems still rely on hand-crafted routines
for each smart object.This paper presents an original smart home architecture
leveragi... | [
{
"created": "Fri, 28 Jun 2024 07:08:20 GMT",
"version": "v1"
}
] | 2024-07-18 | [
[
"Rey-Jouanchicot",
"Jordan",
"",
"IRIT-ELIPSE, LAAS"
],
[
"Bottaro",
"André",
"",
"LAAS-S4M"
],
[
"Campo",
"Eric",
"",
"LAAS-S4M"
],
[
"Bouraoui",
"Jean-Léon",
"",
"IRIT-ELIPSE"
],
[
"Vigouroux",
"Nadine",
"",
"IRIT-EL... | Smart home automation systems aim to improve the comfort and convenience of users in their living environment. However, adapting automation to user needs remains a challenge. Indeed, many systems still rely on hand-crafted routines for each smart object.This paper presents an original smart home architecture leveraging... |
2401.11257 | Tianyi Hu | Tianyi Hu, Zhiqiang Pu, Xiaolin Ai, Tenghai Qiu, Jianqiang Yi | Measuring Policy Distance for Multi-Agent Reinforcement Learning | 9 pages, 6 figures | null | null | null | cs.MA cs.AI | http://creativecommons.org/licenses/by/4.0/ | Diversity plays a crucial role in improving the performance of multi-agent
reinforcement learning (MARL). Currently, many diversity-based methods have
been developed to overcome the drawbacks of excessive parameter sharing in
traditional MARL. However, there remains a lack of a general metric to quantify
policy diffe... | [
{
"created": "Sat, 20 Jan 2024 15:34:51 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Jan 2024 15:37:54 GMT",
"version": "v2"
}
] | 2024-01-30 | [
[
"Hu",
"Tianyi",
""
],
[
"Pu",
"Zhiqiang",
""
],
[
"Ai",
"Xiaolin",
""
],
[
"Qiu",
"Tenghai",
""
],
[
"Yi",
"Jianqiang",
""
]
] | Diversity plays a crucial role in improving the performance of multi-agent reinforcement learning (MARL). Currently, many diversity-based methods have been developed to overcome the drawbacks of excessive parameter sharing in traditional MARL. However, there remains a lack of a general metric to quantify policy differe... |
1210.6112 | EPTCS | James Smith | The Jasper Framework: Towards a Platform Independent, Formal Treatment
of Web Programming | In Proceedings WWV 2012, arXiv:1210.5783. Added doi references where
possible | EPTCS 98, 2012, pp. 31-45 | 10.4204/EPTCS.98.5 | null | cs.SE cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces Jasper, a web programming framework which allows web
applications to be developed in an essentially platform indepedent manner and
which is also suited to a formal treatment. It outlines Jasper conceptually and
shows how Jasper is implemented on several commonplace platforms. It also
introduces ... | [
{
"created": "Tue, 23 Oct 2012 02:54:58 GMT",
"version": "v1"
}
] | 2012-12-07 | [
[
"Smith",
"James",
""
]
] | This paper introduces Jasper, a web programming framework which allows web applications to be developed in an essentially platform indepedent manner and which is also suited to a formal treatment. It outlines Jasper conceptually and shows how Jasper is implemented on several commonplace platforms. It also introduces th... |
2105.04749 | Aron Laszka | Shanto Roy, Nazia Sharmin, Jaime C. Acosta, Christopher Kiekintveld,
Aron Laszka | Survey and Taxonomy of Adversarial Reconnaissance Techniques | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adversaries are often able to penetrate networks and compromise systems by
exploiting vulnerabilities in people and systems. The key to the success of
these attacks is information that adversaries collect throughout the phases of
the cyber kill chain. We summarize and analyze the methods, tactics, and tools
that adve... | [
{
"created": "Tue, 11 May 2021 02:09:12 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Apr 2022 00:11:54 GMT",
"version": "v2"
}
] | 2022-05-02 | [
[
"Roy",
"Shanto",
""
],
[
"Sharmin",
"Nazia",
""
],
[
"Acosta",
"Jaime C.",
""
],
[
"Kiekintveld",
"Christopher",
""
],
[
"Laszka",
"Aron",
""
]
] | Adversaries are often able to penetrate networks and compromise systems by exploiting vulnerabilities in people and systems. The key to the success of these attacks is information that adversaries collect throughout the phases of the cyber kill chain. We summarize and analyze the methods, tactics, and tools that advers... |
1501.06802 | Gamal Abd El-Nasser A. Said | Gamal Abd El-Nasser A. Said, El-Sayed M. El-Horbaty | A Simulation Modeling Approach for Optimization of Storage Space
Allocation in Container Terminal | International Journal of Computer, Information, Systems and Control
Engineering Vol:9 No:1, 2015 | Information, Systems and Control Engineering Vol. 9, No. 1, 2015,
pp. 168-173 | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Container handling problems at container terminals are NP-hard problems. This
paper presents an approach using discrete-event simulation modeling to optimize
solution for storage space allocation problem, taking into account all various
interrelated container terminal handling activities. The proposed approach is
app... | [
{
"created": "Tue, 27 Jan 2015 16:10:23 GMT",
"version": "v1"
}
] | 2015-04-14 | [
[
"Said",
"Gamal Abd El-Nasser A.",
""
],
[
"El-Horbaty",
"El-Sayed M.",
""
]
] | Container handling problems at container terminals are NP-hard problems. This paper presents an approach using discrete-event simulation modeling to optimize solution for storage space allocation problem, taking into account all various interrelated container terminal handling activities. The proposed approach is appli... |
1011.5065 | Woohyuk Chang | Woohyuk Chang, Sae-Young Chung, Yong H. Lee | Gaussian Relay Channel Capacity to Within a Fixed Number of Bits | 6 pages, 7 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we show that the capacity of the three-node Gaussian relay
channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward
and amplify-and-forward relaying, respectively.
| [
{
"created": "Tue, 23 Nov 2010 11:27:46 GMT",
"version": "v1"
}
] | 2010-11-24 | [
[
"Chang",
"Woohyuk",
""
],
[
"Chung",
"Sae-Young",
""
],
[
"Lee",
"Yong H.",
""
]
] | In this paper, we show that the capacity of the three-node Gaussian relay channel can be achieved to within 1 and 2 bit/sec/Hz using compress-and-forward and amplify-and-forward relaying, respectively. |
2104.13869 | Francisco Romero | Francisco Romero, Gohar Irfan Chaudhry, \'I\~nigo Goiri, Pragna Gopa,
Paul Batum, Neeraja J. Yadwadkar, Rodrigo Fonseca, Christos Kozyrakis,
Ricardo Bianchini | Faa$T: A Transparent Auto-Scaling Cache for Serverless Applications | 18 pages, 15 figures | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Function-as-a-Service (FaaS) has become an increasingly popular way for users
to deploy their applications without the burden of managing the underlying
infrastructure. However, existing FaaS platforms rely on remote storage to
maintain state, limiting the set of applications that can be run efficiently.
Recent cachi... | [
{
"created": "Wed, 28 Apr 2021 16:31:19 GMT",
"version": "v1"
}
] | 2021-04-29 | [
[
"Romero",
"Francisco",
""
],
[
"Chaudhry",
"Gohar Irfan",
""
],
[
"Goiri",
"Íñigo",
""
],
[
"Gopa",
"Pragna",
""
],
[
"Batum",
"Paul",
""
],
[
"Yadwadkar",
"Neeraja J.",
""
],
[
"Fonseca",
"Rodrigo",
""
]... | Function-as-a-Service (FaaS) has become an increasingly popular way for users to deploy their applications without the burden of managing the underlying infrastructure. However, existing FaaS platforms rely on remote storage to maintain state, limiting the set of applications that can be run efficiently. Recent caching... |
2001.03102 | Roy Miles | Roy Miles, Krystian Mikolajczyk | Compression of descriptor models for mobile applications | ICASSP 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks have demonstrated state-of-the-art performance for
feature-based image matching through the advent of new large and diverse
datasets. However, there has been little work on evaluating the computational
cost, model size, and matching accuracy tradeoffs for these models. This paper
explicitly addre... | [
{
"created": "Thu, 9 Jan 2020 17:00:21 GMT",
"version": "v1"
},
{
"created": "Sun, 29 Mar 2020 20:37:33 GMT",
"version": "v2"
},
{
"created": "Fri, 5 Feb 2021 10:41:09 GMT",
"version": "v3"
}
] | 2021-02-08 | [
[
"Miles",
"Roy",
""
],
[
"Mikolajczyk",
"Krystian",
""
]
] | Deep neural networks have demonstrated state-of-the-art performance for feature-based image matching through the advent of new large and diverse datasets. However, there has been little work on evaluating the computational cost, model size, and matching accuracy tradeoffs for these models. This paper explicitly address... |
2009.04336 | Gabriele Farina | Gabriele Farina and Tuomas Sandholm | Polynomial-Time Computation of Optimal Correlated Equilibria in
Two-Player Extensive-Form Games with Public Chance Moves and Beyond | null | null | null | null | cs.GT cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unlike normal-form games, where correlated equilibria have been studied for
more than 45 years, extensive-form correlation is still generally not well
understood. Part of the reason for this gap is that the sequential nature of
extensive-form games allows for a richness of behaviors and incentives that are
not possib... | [
{
"created": "Wed, 9 Sep 2020 14:51:58 GMT",
"version": "v1"
}
] | 2020-09-10 | [
[
"Farina",
"Gabriele",
""
],
[
"Sandholm",
"Tuomas",
""
]
] | Unlike normal-form games, where correlated equilibria have been studied for more than 45 years, extensive-form correlation is still generally not well understood. Part of the reason for this gap is that the sequential nature of extensive-form games allows for a richness of behaviors and incentives that are not possible... |
1308.6505 | Anna Huber | Anna Huber and Andrei Krokhin | Oracle Tractability of Skew Bisubmodular Functions | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider skew bisubmodular functions as introduced in [9].
We construct a convex extension of a skew bisubmodular function which we call
Lov\'asz extension in correspondence to the submodular case. We use this
extension to show that skew bisubmodular functions given by an oracle can be
minimised in p... | [
{
"created": "Thu, 29 Aug 2013 16:03:49 GMT",
"version": "v1"
}
] | 2013-08-30 | [
[
"Huber",
"Anna",
""
],
[
"Krokhin",
"Andrei",
""
]
] | In this paper we consider skew bisubmodular functions as introduced in [9]. We construct a convex extension of a skew bisubmodular function which we call Lov\'asz extension in correspondence to the submodular case. We use this extension to show that skew bisubmodular functions given by an oracle can be minimised in pol... |
2007.03204 | Pashootan Vaezipoor | Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu, Chris J. Maddison, Roger
Grosse, Sanjit A. Seshia, Fahiem Bacchus | Learning Branching Heuristics for Propositional Model Counting | null | 35(14), 2021, 12427-12435 | 10.1609/aaai.v35i14.17474 | null | cs.LG cs.AI cs.LO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Propositional model counting, or #SAT, is the problem of computing the number
of satisfying assignments of a Boolean formula. Many problems from different
application areas, including many discrete probabilistic inference problems,
can be translated into model counting problems to be solved by #SAT solvers.
Exact #SA... | [
{
"created": "Tue, 7 Jul 2020 05:20:29 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Sep 2022 21:47:20 GMT",
"version": "v2"
}
] | 2022-09-12 | [
[
"Vaezipoor",
"Pashootan",
""
],
[
"Lederman",
"Gil",
""
],
[
"Wu",
"Yuhuai",
""
],
[
"Maddison",
"Chris J.",
""
],
[
"Grosse",
"Roger",
""
],
[
"Seshia",
"Sanjit A.",
""
],
[
"Bacchus",
"Fahiem",
""
]
] | Propositional model counting, or #SAT, is the problem of computing the number of satisfying assignments of a Boolean formula. Many problems from different application areas, including many discrete probabilistic inference problems, can be translated into model counting problems to be solved by #SAT solvers. Exact #SAT ... |
cs/0601116 | Laurent Noe | Gregory Kucherov (LIFL), Laurent No\'e (LIFL), Mihkail Roytberg (LIFL) | A unifying framework for seed sensitivity and its application to subset
seeds | null | Journal of Bioinformatics and Computational Biology 4 (2006) 2, pp
553--569 | 10.1142/S0219720006001977 | null | cs.DS q-bio.QM | null | We propose a general approach to compute the seed sensitivity, that can be
applied to different definitions of seeds. It treats separately three
components of the seed sensitivity problem -- a set of target alignments, an
associated probability distribution, and a seed model -- that are specified by
distinct finite a... | [
{
"created": "Fri, 27 Jan 2006 18:53:01 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Sep 2006 07:05:58 GMT",
"version": "v2"
}
] | 2010-01-19 | [
[
"Kucherov",
"Gregory",
"",
"LIFL"
],
[
"Noé",
"Laurent",
"",
"LIFL"
],
[
"Roytberg",
"Mihkail",
"",
"LIFL"
]
] | We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem -- a set of target alignments, an associated probability distribution, and a seed model -- that are specified by distinct finite aut... |
1903.07377 | Johannes Michael | Johannes Michael, Roger Labahn, Tobias Gr\"uning, Jochen Z\"ollner | Evaluating Sequence-to-Sequence Models for Handwritten Text Recognition | 8 pages, 1 figure, 8 tables | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Encoder-decoder models have become an effective approach for sequence
learning tasks like machine translation, image captioning and speech
recognition, but have yet to show competitive results for handwritten text
recognition. To this end, we propose an attention-based sequence-to-sequence
model. It combines a convol... | [
{
"created": "Mon, 18 Mar 2019 11:51:33 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Jul 2019 11:40:53 GMT",
"version": "v2"
}
] | 2019-07-16 | [
[
"Michael",
"Johannes",
""
],
[
"Labahn",
"Roger",
""
],
[
"Grüning",
"Tobias",
""
],
[
"Zöllner",
"Jochen",
""
]
] | Encoder-decoder models have become an effective approach for sequence learning tasks like machine translation, image captioning and speech recognition, but have yet to show competitive results for handwritten text recognition. To this end, we propose an attention-based sequence-to-sequence model. It combines a convolut... |
2305.02484 | Shilun Li | Venkatesan Guruswami and Shilun Li | A Deterministic Construction of a Large Distance Code from the
Wozencraft Ensemble | null | null | null | null | cs.IT math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an explicit construction of a sequence of rate $1/2$ Wozencraft
ensemble codes (over any fixed finite field $\mathbb{F}_q$) that achieve
minimum distance $\Omega(\sqrt{k})$ where $k$ is the message length. The
coefficients of the Wozencraft ensemble codes are constructed using Sidon Sets
and the cyclic str... | [
{
"created": "Thu, 4 May 2023 01:29:34 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jul 2023 08:03:43 GMT",
"version": "v2"
}
] | 2023-07-12 | [
[
"Guruswami",
"Venkatesan",
""
],
[
"Li",
"Shilun",
""
]
] | We present an explicit construction of a sequence of rate $1/2$ Wozencraft ensemble codes (over any fixed finite field $\mathbb{F}_q$) that achieve minimum distance $\Omega(\sqrt{k})$ where $k$ is the message length. The coefficients of the Wozencraft ensemble codes are constructed using Sidon Sets and the cyclic struc... |
2307.13018 | Artur Tarassow | Artur Tarassow | The potential of LLMs for coding with low-resource and domain-specific
programming languages | null | null | null | null | cs.CL cs.SE | http://creativecommons.org/licenses/by/4.0/ | This paper presents a study on the feasibility of using large language models
(LLM) for coding with low-resource and domain-specific programming languages
that typically lack the amount of data required for effective LLM processing
techniques. This study focuses on the econometric scripting language named
hansl of th... | [
{
"created": "Mon, 24 Jul 2023 17:17:13 GMT",
"version": "v1"
}
] | 2023-07-26 | [
[
"Tarassow",
"Artur",
""
]
] | This paper presents a study on the feasibility of using large language models (LLM) for coding with low-resource and domain-specific programming languages that typically lack the amount of data required for effective LLM processing techniques. This study focuses on the econometric scripting language named hansl of the ... |
1803.05120 | Yufan He | Yufan He, Aaron Carass, Bruno M. Jedynak, Sharon D. Solomon, Shiv
Saidha, Peter A. Calabresi, Jerry L. Prince | Topology guaranteed segmentation of the human retina from OCT using
convolutional neural networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optical coherence tomography (OCT) is a noninvasive imaging modality which
can be used to obtain depth images of the retina. The changing layer
thicknesses can thus be quantified by analyzing these OCT images, moreover
these changes have been shown to correlate with disease progression in multiple
sclerosis. Recent a... | [
{
"created": "Wed, 14 Mar 2018 03:21:01 GMT",
"version": "v1"
}
] | 2018-03-15 | [
[
"He",
"Yufan",
""
],
[
"Carass",
"Aaron",
""
],
[
"Jedynak",
"Bruno M.",
""
],
[
"Solomon",
"Sharon D.",
""
],
[
"Saidha",
"Shiv",
""
],
[
"Calabresi",
"Peter A.",
""
],
[
"Prince",
"Jerry L.",
""
]
] | Optical coherence tomography (OCT) is a noninvasive imaging modality which can be used to obtain depth images of the retina. The changing layer thicknesses can thus be quantified by analyzing these OCT images, moreover these changes have been shown to correlate with disease progression in multiple sclerosis. Recent aut... |
2011.09577 | Sadra Naddaf | Sadra Naddaf-Sh, M-Mahdi Naddaf-Sh, Amir R. Kashani and Hassan
Zargarzadeh | An Efficient and Scalable Deep Learning Approach for Road Damage
Detection | removed redundant postscripts | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Pavement condition evaluation is essential to time the preventative or
rehabilitative actions and control distress propagation. Failing to conduct
timely evaluations can lead to severe structural and financial loss of the
infrastructure and complete reconstructions. Automated computer-aided surveying
measures can pro... | [
{
"created": "Wed, 18 Nov 2020 23:05:41 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Nov 2020 18:58:18 GMT",
"version": "v2"
},
{
"created": "Thu, 17 Dec 2020 17:58:08 GMT",
"version": "v3"
}
] | 2020-12-18 | [
[
"Naddaf-Sh",
"Sadra",
""
],
[
"Naddaf-Sh",
"M-Mahdi",
""
],
[
"Kashani",
"Amir R.",
""
],
[
"Zargarzadeh",
"Hassan",
""
]
] | Pavement condition evaluation is essential to time the preventative or rehabilitative actions and control distress propagation. Failing to conduct timely evaluations can lead to severe structural and financial loss of the infrastructure and complete reconstructions. Automated computer-aided surveying measures can provi... |
2010.03108 | Pan Ji | Pengfei Fang, Pan Ji, Jieming Zhou, Lars Petersson, Mehrtash Harandi | Channel Recurrent Attention Networks for Video Pedestrian Retrieval | To appear in ACCV 2020 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Full attention, which generates an attention value per element of the input
feature maps, has been successfully demonstrated to be beneficial in visual
tasks. In this work, we propose a fully attentional network, termed {\it
channel recurrent attention network}, for the task of video pedestrian
retrieval. The main at... | [
{
"created": "Wed, 7 Oct 2020 02:01:13 GMT",
"version": "v1"
}
] | 2020-10-08 | [
[
"Fang",
"Pengfei",
""
],
[
"Ji",
"Pan",
""
],
[
"Zhou",
"Jieming",
""
],
[
"Petersson",
"Lars",
""
],
[
"Harandi",
"Mehrtash",
""
]
] | Full attention, which generates an attention value per element of the input feature maps, has been successfully demonstrated to be beneficial in visual tasks. In this work, we propose a fully attentional network, termed {\it channel recurrent attention network}, for the task of video pedestrian retrieval. The main atte... |
1710.06785 | Ramviyas Parasuraman | Ramviyas Parasuraman, Sergio Caccamo, Fredrik B{\aa}berg, Petter
\"Ogren and Mark Neerincx | A New UGV Teleoperation Interface for Improved Awareness of Network
Connectivity and Physical Surroundings | Accepted for publication in the Journal of Human-Robot Interaction
(JHRI) | null | null | null | cs.RO cs.HC cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A reliable wireless connection between the operator and the teleoperated
Unmanned Ground Vehicle (UGV) is critical in many Urban Search and Rescue
(USAR) missions. Unfortunately, as was seen in e.g. the Fukushima disaster, the
networks available in areas where USAR missions take place are often severely
limited in ra... | [
{
"created": "Wed, 4 Oct 2017 21:39:53 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Oct 2017 17:50:45 GMT",
"version": "v2"
},
{
"created": "Sun, 5 Nov 2017 08:57:19 GMT",
"version": "v3"
},
{
"created": "Tue, 7 Nov 2017 19:34:45 GMT",
"version": "v4"
}
] | 2017-11-09 | [
[
"Parasuraman",
"Ramviyas",
""
],
[
"Caccamo",
"Sergio",
""
],
[
"Båberg",
"Fredrik",
""
],
[
"Ögren",
"Petter",
""
],
[
"Neerincx",
"Mark",
""
]
] | A reliable wireless connection between the operator and the teleoperated Unmanned Ground Vehicle (UGV) is critical in many Urban Search and Rescue (USAR) missions. Unfortunately, as was seen in e.g. the Fukushima disaster, the networks available in areas where USAR missions take place are often severely limited in rang... |
2305.19894 | Zhongwei Wan | Zhongwei Wan, Che Liu, Mi Zhang, Jie Fu, Benyou Wang, Sibo Cheng, Lei
Ma, C\'esar Quilodr\'an-Casas, Rossella Arcucci | Med-UniC: Unifying Cross-Lingual Medical Vision-Language Pre-Training by
Diminishing Bias | NeurIPS 2023 Main track | null | null | null | cs.CL cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The scarcity of data presents a critical obstacle to the efficacy of medical
visionlanguage pre-training (VLP). A potential solution lies in the combination
of datasets from various language communities. Nevertheless, the main challenge
stems from the complexity of integrating diverse syntax and semantics,
language-s... | [
{
"created": "Wed, 31 May 2023 14:28:19 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Sep 2023 18:58:36 GMT",
"version": "v2"
},
{
"created": "Sat, 17 Feb 2024 19:49:54 GMT",
"version": "v3"
}
] | 2024-02-20 | [
[
"Wan",
"Zhongwei",
""
],
[
"Liu",
"Che",
""
],
[
"Zhang",
"Mi",
""
],
[
"Fu",
"Jie",
""
],
[
"Wang",
"Benyou",
""
],
[
"Cheng",
"Sibo",
""
],
[
"Ma",
"Lei",
""
],
[
"Quilodrán-Casas",
"César",
... | The scarcity of data presents a critical obstacle to the efficacy of medical visionlanguage pre-training (VLP). A potential solution lies in the combination of datasets from various language communities. Nevertheless, the main challenge stems from the complexity of integrating diverse syntax and semantics, language-spe... |
1902.02139 | Anton Pirogov | Christof L\"oding, Anton Pirogov | Determinization of B\"uchi Automata: Unifying the Approaches of Safra
and Muller-Schupp | Full version of ICALP 2019 paper | null | 10.4230/LIPIcs.ICALP.2019.120 | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Determinization of B\"uchi automata is a long-known difficult problem and
after the seminal result of Safra, who developed the first asymptotically
optimal construction from B\"uchi into Rabin automata, much work went into
improving, simplifying or avoiding Safra's construction. A different, less
known determinizatio... | [
{
"created": "Wed, 6 Feb 2019 12:31:09 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Apr 2019 07:47:34 GMT",
"version": "v2"
}
] | 2020-04-30 | [
[
"Löding",
"Christof",
""
],
[
"Pirogov",
"Anton",
""
]
] | Determinization of B\"uchi automata is a long-known difficult problem and after the seminal result of Safra, who developed the first asymptotically optimal construction from B\"uchi into Rabin automata, much work went into improving, simplifying or avoiding Safra's construction. A different, less known determinization ... |
2006.01358 | Sandra Ramirez | Sandra L. Ram\'irez-Mora, Hanna Oktaba, Helena G\'omez-Adorno | Descriptions of issues and comments for predicting issue success in
software projects | 65 pages; 15 figures | Journal of Systems and Software, Vol. 168, 2020, 110663, ISSN
0164-1212 | 10.1016/j.jss.2020.110663 | null | cs.SE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Software development tasks must be performed successfully to achieve software
quality and customer satisfaction. Knowing whether software tasks are likely to
fail is essential to ensure the success of software projects. Issue Tracking
Systems store information of software tasks (issues) and comments, which can be
use... | [
{
"created": "Tue, 2 Jun 2020 02:49:22 GMT",
"version": "v1"
}
] | 2020-06-03 | [
[
"Ramírez-Mora",
"Sandra L.",
""
],
[
"Oktaba",
"Hanna",
""
],
[
"Gómez-Adorno",
"Helena",
""
]
] | Software development tasks must be performed successfully to achieve software quality and customer satisfaction. Knowing whether software tasks are likely to fail is essential to ensure the success of software projects. Issue Tracking Systems store information of software tasks (issues) and comments, which can be usefu... |
2406.16250 | Prerana Khatiwada | Prerana Khatiwada, Pranjal Dhakal | Evaluating Serverless Machine Learning Performance on Google Cloud Run | 5 pages, 12 figures | null | null | null | cs.DC cs.OS | http://creativecommons.org/licenses/by/4.0/ | End-users can get functions-as-a-service from serverless platforms, which
promise lower hosting costs, high availability, fault tolerance, and dynamic
flexibility for hosting individual functions known as microservices. Machine
learning tools are seen to be reliably useful, and the services created using
these tools ... | [
{
"created": "Mon, 24 Jun 2024 01:10:20 GMT",
"version": "v1"
}
] | 2024-06-25 | [
[
"Khatiwada",
"Prerana",
""
],
[
"Dhakal",
"Pranjal",
""
]
] | End-users can get functions-as-a-service from serverless platforms, which promise lower hosting costs, high availability, fault tolerance, and dynamic flexibility for hosting individual functions known as microservices. Machine learning tools are seen to be reliably useful, and the services created using these tools ar... |
2407.10725 | Xiaoyuan Yi | Jing Yao, Xiaoyuan Yi, Xing Xie | CLAVE: An Adaptive Framework for Evaluating Values of LLM Generated
Responses | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The rapid progress in Large Language Models (LLMs) poses potential risks such
as generating unethical content. Assessing LLMs' values can help expose their
misalignment, but relies on reference-free evaluators, e.g., fine-tuned LLMs or
close-source ones like GPT-4, to identify values reflected in generated
responses.... | [
{
"created": "Mon, 15 Jul 2024 13:51:37 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Yao",
"Jing",
""
],
[
"Yi",
"Xiaoyuan",
""
],
[
"Xie",
"Xing",
""
]
] | The rapid progress in Large Language Models (LLMs) poses potential risks such as generating unethical content. Assessing LLMs' values can help expose their misalignment, but relies on reference-free evaluators, e.g., fine-tuned LLMs or close-source ones like GPT-4, to identify values reflected in generated responses. N... |
1807.11618 | Kamal Al-Sabahi Ph.D. | Kamal Al-Sabahi, Zuping Zhang, Jun Long, Khaled Alwesabi | An Enhanced Latent Semantic Analysis Approach for Arabic Document
Summarization | This is a pre-print of an article published in Arabian Journal for
Science and Engineering. The final authenticated version is available online
at: https://doi.org/10.1007/s13369-018-3286-z | K. Al-Sabahi, Z. Zhang, J. Long, and K. Alwesabi, "An Enhanced
Latent Semantic Analysis Approach for Arabic Document Summarization," Arabian
Journal for Science and Engineering, journal article May 05 2018 | 10.1007/s13369-018-3286-z | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The fast-growing amount of information on the Internet makes the research in
automatic document summarization very urgent. It is an effective solution for
information overload. Many approaches have been proposed based on different
strategies, such as latent semantic analysis (LSA). However, LSA, when applied
to docum... | [
{
"created": "Tue, 31 Jul 2018 00:50:15 GMT",
"version": "v1"
}
] | 2018-08-01 | [
[
"Al-Sabahi",
"Kamal",
""
],
[
"Zhang",
"Zuping",
""
],
[
"Long",
"Jun",
""
],
[
"Alwesabi",
"Khaled",
""
]
] | The fast-growing amount of information on the Internet makes the research in automatic document summarization very urgent. It is an effective solution for information overload. Many approaches have been proposed based on different strategies, such as latent semantic analysis (LSA). However, LSA, when applied to documen... |
2204.08935 | Xinyue Shen | Xinyue Shen, Xinlei He, Michael Backes, Jeremy Blackburn, Savvas
Zannettou, Yang Zhang | On Xing Tian and the Perseverance of Anti-China Sentiment Online | To Appear in the 16th International Conference on Web and Social
Media (ICWSM), 2022 | null | null | null | cs.SI cs.CY | http://creativecommons.org/licenses/by/4.0/ | Sinophobia, anti-Chinese sentiment, has existed on the Web for a long time.
The outbreak of COVID-19 and the extended quarantine has further amplified it.
However, we lack a quantitative understanding of the cause of Sinophobia as
well as how it evolves over time. In this paper, we conduct a large-scale
longitudinal ... | [
{
"created": "Tue, 19 Apr 2022 15:17:28 GMT",
"version": "v1"
}
] | 2022-04-20 | [
[
"Shen",
"Xinyue",
""
],
[
"He",
"Xinlei",
""
],
[
"Backes",
"Michael",
""
],
[
"Blackburn",
"Jeremy",
""
],
[
"Zannettou",
"Savvas",
""
],
[
"Zhang",
"Yang",
""
]
] | Sinophobia, anti-Chinese sentiment, has existed on the Web for a long time. The outbreak of COVID-19 and the extended quarantine has further amplified it. However, we lack a quantitative understanding of the cause of Sinophobia as well as how it evolves over time. In this paper, we conduct a large-scale longitudinal me... |
1601.03295 | Gabriela Csurka | Gabriela Csurka | Document image classification, with a specific view on applications of
patent images | Paper submitted in 2014 as book chapter of Current Challenges in
Patent Information Retrieval, Second edition by M. Lupu et al (eds.). To
appear in 2016 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main focus of this paper is document image classification and retrieval,
where we analyze and compare different parameters for the RunLeght Histogram
(RL) and Fisher Vector (FV) based image representations. We do an exhaustive
experimental study using different document image datasets, including the MARG
benchmar... | [
{
"created": "Wed, 13 Jan 2016 16:02:13 GMT",
"version": "v1"
}
] | 2016-01-14 | [
[
"Csurka",
"Gabriela",
""
]
] | The main focus of this paper is document image classification and retrieval, where we analyze and compare different parameters for the RunLeght Histogram (RL) and Fisher Vector (FV) based image representations. We do an exhaustive experimental study using different document image datasets, including the MARG benchmarks... |
2105.11134 | Jiacheng Ye | Jiacheng Ye, Tao Gui, Yichao Luo, Yige Xu, Qi Zhang | One2Set: Generating Diverse Keyphrases as a Set | Accepted by ACL 2021 | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Recently, the sequence-to-sequence models have made remarkable progress on
the task of keyphrase generation (KG) by concatenating multiple keyphrases in a
predefined order as a target sequence during training. However, the keyphrases
are inherently an unordered set rather than an ordered sequence. Imposing a
predefin... | [
{
"created": "Mon, 24 May 2021 07:29:47 GMT",
"version": "v1"
}
] | 2021-05-25 | [
[
"Ye",
"Jiacheng",
""
],
[
"Gui",
"Tao",
""
],
[
"Luo",
"Yichao",
""
],
[
"Xu",
"Yige",
""
],
[
"Zhang",
"Qi",
""
]
] | Recently, the sequence-to-sequence models have made remarkable progress on the task of keyphrase generation (KG) by concatenating multiple keyphrases in a predefined order as a target sequence during training. However, the keyphrases are inherently an unordered set rather than an ordered sequence. Imposing a predefined... |
2201.09377 | Ali Emami Mr. | Darren Abramson and Ali Emami | An Application of Pseudo-Log-Likelihoods to Natural Language Scoring | null | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Language models built using semi-supervised machine learning on large corpora
of natural language have very quickly enveloped the fields of natural language
generation and understanding. In this paper we apply a zero-shot approach
independently developed by a number of researchers now gaining recognition as a
signifi... | [
{
"created": "Sun, 23 Jan 2022 22:00:54 GMT",
"version": "v1"
}
] | 2022-01-25 | [
[
"Abramson",
"Darren",
""
],
[
"Emami",
"Ali",
""
]
] | Language models built using semi-supervised machine learning on large corpora of natural language have very quickly enveloped the fields of natural language generation and understanding. In this paper we apply a zero-shot approach independently developed by a number of researchers now gaining recognition as a significa... |
2402.02211 | Guangmo Tong | Guangmo Tong, Peng Zhao, Mina Samizadeh | Query-decision Regression between Shortest Path and Minimum Steiner Tree | PAKDD 2024 | null | null | null | cs.LG cs.DS | http://creativecommons.org/licenses/by/4.0/ | Considering a graph with unknown weights, can we find the shortest path for a
pair of nodes if we know the minimal Steiner trees associated with some subset
of nodes? That is, with respect to a fixed latent decision-making system (e.g.,
a weighted graph), we seek to solve one optimization problem (e.g., the
shortest ... | [
{
"created": "Sat, 3 Feb 2024 17:05:01 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"Tong",
"Guangmo",
""
],
[
"Zhao",
"Peng",
""
],
[
"Samizadeh",
"Mina",
""
]
] | Considering a graph with unknown weights, can we find the shortest path for a pair of nodes if we know the minimal Steiner trees associated with some subset of nodes? That is, with respect to a fixed latent decision-making system (e.g., a weighted graph), we seek to solve one optimization problem (e.g., the shortest pa... |
2003.06773 | Jinnan Piao | Jinnan Piao, Kai Niu, Jincheng Dai, and Chao Dong | Sphere Constraint based Enumeration Methods to Analyze the Minimum
Weight Distribution of Polar Codes | 11 pages, 6 figures. Submitted to IEEE Transactions on Vehicular
Technology | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the minimum weight distributions (MWDs) of polar codes and
concatenated polar codes are exactly enumerated according to the distance
property of codewords. We first propose a sphere constraint based enumeration
method (SCEM) to analyze the MWD of polar codes with moderate complexity. The
SCEM exploits ... | [
{
"created": "Sun, 15 Mar 2020 07:34:29 GMT",
"version": "v1"
}
] | 2020-03-17 | [
[
"Piao",
"Jinnan",
""
],
[
"Niu",
"Kai",
""
],
[
"Dai",
"Jincheng",
""
],
[
"Dong",
"Chao",
""
]
] | In this paper, the minimum weight distributions (MWDs) of polar codes and concatenated polar codes are exactly enumerated according to the distance property of codewords. We first propose a sphere constraint based enumeration method (SCEM) to analyze the MWD of polar codes with moderate complexity. The SCEM exploits th... |
2006.09205 | Andrew Dowsey | William Andrew, Jing Gao, Siobhan Mullan, Neill Campbell, Andrew W
Dowsey, Tilo Burghardt | Visual Identification of Individual Holstein-Friesian Cattle via Deep
Metric Learning | 41 pages, 18 figures, 2 tables; Submitted to Computers and
Electronics in Agriculture ; Source code and network weights available at
https://github.com/CWOA/MetricLearningIdentification ; OpenCows2020 dataset
available at https://doi.org/10.5523/bris.10m32xl88x2b61zlkkgz3fml17 | Computers and Electronics in Agriculture 185, 106133 (2021) | 10.1016/j.compag.2021.106133 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Holstein-Friesian cattle exhibit individually-characteristic black and white
coat patterns visually akin to those arising from Turing's reaction-diffusion
systems. This work takes advantage of these natural markings in order to
automate visual detection and biometric identification of individual
Holstein-Friesians vi... | [
{
"created": "Tue, 16 Jun 2020 14:41:55 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Jul 2020 11:38:09 GMT",
"version": "v2"
},
{
"created": "Wed, 14 Oct 2020 10:58:30 GMT",
"version": "v3"
}
] | 2021-05-04 | [
[
"Andrew",
"William",
""
],
[
"Gao",
"Jing",
""
],
[
"Mullan",
"Siobhan",
""
],
[
"Campbell",
"Neill",
""
],
[
"Dowsey",
"Andrew W",
""
],
[
"Burghardt",
"Tilo",
""
]
] | Holstein-Friesian cattle exhibit individually-characteristic black and white coat patterns visually akin to those arising from Turing's reaction-diffusion systems. This work takes advantage of these natural markings in order to automate visual detection and biometric identification of individual Holstein-Friesians via ... |
2104.11057 | Lie Ju | Lie Ju, Xin Wang, Lin Wang, Tongliang Liu, Xin Zhao, Tom Drummond,
Dwarikanath Mahapatra, Zongyuan Ge | Relational Subsets Knowledge Distillation for Long-tailed Retinal
Diseases Recognition | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the real world, medical datasets often exhibit a long-tailed data
distribution (i.e., a few classes occupy most of the data, while most classes
have rarely few samples), which results in a challenging imbalance learning
scenario. For example, there are estimated more than 40 different kinds of
retinal diseases wit... | [
{
"created": "Thu, 22 Apr 2021 13:39:33 GMT",
"version": "v1"
}
] | 2021-04-23 | [
[
"Ju",
"Lie",
""
],
[
"Wang",
"Xin",
""
],
[
"Wang",
"Lin",
""
],
[
"Liu",
"Tongliang",
""
],
[
"Zhao",
"Xin",
""
],
[
"Drummond",
"Tom",
""
],
[
"Mahapatra",
"Dwarikanath",
""
],
[
"Ge",
"Zongyu... | In the real world, medical datasets often exhibit a long-tailed data distribution (i.e., a few classes occupy most of the data, while most classes have rarely few samples), which results in a challenging imbalance learning scenario. For example, there are estimated more than 40 different kinds of retinal diseases with ... |
1605.00313 | Konstantin Kobylkin S. | Konstantin Kobylkin | Stabbing line segments with disks: complexity and approximation
algorithms | 12 pages, 1 appendix, 15 bibliography items, 6th International
Conference on Analysis of Images, Social Networks and Texts (AIST-2017) | Kobylkin K.Stabbing Line Segments with Disks: Complexity and
Approximation Algorithms. // Lecture Notes in Computer Science, 2018. vol
10716. pp 356-367 Springer | 10.1007/978-3-319-73013-4_33 | Eng21 | cs.CG cs.CC cs.DM | http://creativecommons.org/licenses/by/4.0/ | Computational complexity and approximation algorithms are reported for a
problem of stabbing a set of straight line segments with the least cardinality
set of disks of fixed radii $r>0$ where the set of segments forms a straight
line drawing $G=(V,E)$ of a planar graph without edge crossings. Close
geometric problems... | [
{
"created": "Sun, 1 May 2016 21:54:15 GMT",
"version": "v1"
},
{
"created": "Wed, 4 May 2016 14:06:50 GMT",
"version": "v2"
},
{
"created": "Tue, 26 Jul 2016 09:32:56 GMT",
"version": "v3"
},
{
"created": "Thu, 20 Jul 2017 08:56:24 GMT",
"version": "v4"
}
] | 2018-03-23 | [
[
"Kobylkin",
"Konstantin",
""
]
] | Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line drawing $G=(V,E)$ of a planar graph without edge crossings. Close geometric problems a... |
2307.11412 | Weiyu Zhang | Weiyu Zhang | Hybrid deliberation: Citizen dialogues in a post-pandemic era | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This report first provides a brief review of various forms of dialogue-based
participation, e.g., Citizen Assembly, Citizen Lottery, Citizen Jury,
Deliberative Polling, and Participatory Budgeting. Challenges associated with
these long-lasting practices are identified and hybrid deliberation is proposed
as a concept ... | [
{
"created": "Fri, 21 Jul 2023 08:13:53 GMT",
"version": "v1"
}
] | 2023-07-24 | [
[
"Zhang",
"Weiyu",
""
]
] | This report first provides a brief review of various forms of dialogue-based participation, e.g., Citizen Assembly, Citizen Lottery, Citizen Jury, Deliberative Polling, and Participatory Budgeting. Challenges associated with these long-lasting practices are identified and hybrid deliberation is proposed as a concept to... |
1306.4037 | Travis Gagie | H. Ferrada, T. Gagie, T. Hirvola and S. J. Puglisi | Hybrid Indexes for Repetitive Datasets | null | null | 10.1098/rsta.2013.0137 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advances in DNA sequencing mean databases of thousands of human genomes will
soon be commonplace. In this paper we introduce a simple technique for reducing
the size of conventional indexes on such highly repetitive texts. Given upper
bounds on pattern lengths and edit distances, we preprocess the text with LZ77
to o... | [
{
"created": "Mon, 17 Jun 2013 22:48:15 GMT",
"version": "v1"
}
] | 2015-06-16 | [
[
"Ferrada",
"H.",
""
],
[
"Gagie",
"T.",
""
],
[
"Hirvola",
"T.",
""
],
[
"Puglisi",
"S. J.",
""
]
] | Advances in DNA sequencing mean databases of thousands of human genomes will soon be commonplace. In this paper we introduce a simple technique for reducing the size of conventional indexes on such highly repetitive texts. Given upper bounds on pattern lengths and edit distances, we preprocess the text with LZ77 to obt... |
2405.14106 | Emiliano De Cristofaro | Meenatchi Sundaram Muthu Selva Annamalai and Emiliano De Cristofaro | Nearly Tight Black-Box Auditing of Differentially Private Machine
Learning | null | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a nearly tight audit of the Differentially Private
Stochastic Gradient Descent (DP-SGD) algorithm in the black-box model. Our
auditing procedure empirically estimates the privacy leakage from DP-SGD using
membership inference attacks; unlike prior work, the estimates are appreciably
close to the t... | [
{
"created": "Thu, 23 May 2024 02:24:52 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Annamalai",
"Meenatchi Sundaram Muthu Selva",
""
],
[
"De Cristofaro",
"Emiliano",
""
]
] | This paper presents a nearly tight audit of the Differentially Private Stochastic Gradient Descent (DP-SGD) algorithm in the black-box model. Our auditing procedure empirically estimates the privacy leakage from DP-SGD using membership inference attacks; unlike prior work, the estimates are appreciably close to the the... |
1907.05560 | Vahid Noormofidi | Vahid Noormofidi | Simulating Nonlinear Neutrino Oscillations on Next-Generation Many-Core
Architectures | null | null | null | null | cs.DC cs.CE cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work an astrophysical simulation code, XFLAT, is developed to study
neutrino oscillations in supernovae. XFLAT is designed to utilize multiple
levels of parallelism through MPI, OpenMP, and SIMD instructions
(vectorization). It can run on both the CPU and the Xeon Phi co-processor, the
latter of which is base... | [
{
"created": "Fri, 12 Jul 2019 03:21:54 GMT",
"version": "v1"
}
] | 2019-07-15 | [
[
"Noormofidi",
"Vahid",
""
]
] | In this work an astrophysical simulation code, XFLAT, is developed to study neutrino oscillations in supernovae. XFLAT is designed to utilize multiple levels of parallelism through MPI, OpenMP, and SIMD instructions (vectorization). It can run on both the CPU and the Xeon Phi co-processor, the latter of which is based ... |
2404.14465 | Ilias Siniosoglou | Dimitris Asimopoulos, Ilias Siniosoglou, Vasileios Argyriou, Thomai
Karamitsou, Eleftherios Fountoukidis, Sotirios K. Goudos, Ioannis D.
Moscholios, Konstantinos E. Psannis, Panagiotis Sarigiannidis | Benchmarking Advanced Text Anonymisation Methods: A Comparative Study on
Novel and Traditional Approaches | null | null | null | null | cs.CL cs.AI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the realm of data privacy, the ability to effectively anonymise text is
paramount. With the proliferation of deep learning and, in particular,
transformer architectures, there is a burgeoning interest in leveraging these
advanced models for text anonymisation tasks. This paper presents a
comprehensive benchmarking... | [
{
"created": "Mon, 22 Apr 2024 12:06:54 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Asimopoulos",
"Dimitris",
""
],
[
"Siniosoglou",
"Ilias",
""
],
[
"Argyriou",
"Vasileios",
""
],
[
"Karamitsou",
"Thomai",
""
],
[
"Fountoukidis",
"Eleftherios",
""
],
[
"Goudos",
"Sotirios K.",
""
],
[
"Moscholio... | In the realm of data privacy, the ability to effectively anonymise text is paramount. With the proliferation of deep learning and, in particular, transformer architectures, there is a burgeoning interest in leveraging these advanced models for text anonymisation tasks. This paper presents a comprehensive benchmarking s... |
2010.12723 | Yuning Mao | Yuning Mao, Xiang Ren, Heng Ji, Jiawei Han | Constrained Abstractive Summarization: Preserving Factual Consistency
with Constrained Generation | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite significant progress, state-of-the-art abstractive summarization
methods are still prone to hallucinate content inconsistent with the source
document. In this paper, we propose Constrained Abstractive Summarization
(CAS), a general setup that preserves the factual consistency of abstractive
summarization by s... | [
{
"created": "Sat, 24 Oct 2020 00:27:44 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Dec 2021 05:20:15 GMT",
"version": "v2"
}
] | 2021-12-17 | [
[
"Mao",
"Yuning",
""
],
[
"Ren",
"Xiang",
""
],
[
"Ji",
"Heng",
""
],
[
"Han",
"Jiawei",
""
]
] | Despite significant progress, state-of-the-art abstractive summarization methods are still prone to hallucinate content inconsistent with the source document. In this paper, we propose Constrained Abstractive Summarization (CAS), a general setup that preserves the factual consistency of abstractive summarization by spe... |
1210.1630 | Herbert Tanner | Jie Fu, Herbert G. Tanner, Jeffrey Heinz, Jane Chandlee, Konstantinos
Karydis, and Cesar Koirala | Symbolic Planning and Control Using Game Theory and Grammatical
Inference | null | null | null | null | cs.RO cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an approach that brings together game theory with
grammatical inference and discrete abstractions in order to synthesize control
strategies for hybrid dynamical systems performing tasks in partially unknown
but rule-governed adversarial environments. The combined formulation guarantees
that a syst... | [
{
"created": "Fri, 5 Oct 2012 02:40:39 GMT",
"version": "v1"
}
] | 2012-10-08 | [
[
"Fu",
"Jie",
""
],
[
"Tanner",
"Herbert G.",
""
],
[
"Heinz",
"Jeffrey",
""
],
[
"Chandlee",
"Jane",
""
],
[
"Karydis",
"Konstantinos",
""
],
[
"Koirala",
"Cesar",
""
]
] | This paper presents an approach that brings together game theory with grammatical inference and discrete abstractions in order to synthesize control strategies for hybrid dynamical systems performing tasks in partially unknown but rule-governed adversarial environments. The combined formulation guarantees that a system... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.