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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1802.05844 | Kui Yu | Kui Yu, Lin Liu, and Jiuyong Li | A Unified View of Causal and Non-causal Feature Selection | null | null | null | null | cs.AI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we aim to develop a unified view of causal and non-causal
feature selection methods. The unified view will fill in the gap in the
research of the relation between the two types of methods. Based on the
Bayesian network framework and information theory, we first show that causal
and non-causal feature s... | [
{
"created": "Fri, 16 Feb 2018 06:18:06 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Feb 2018 23:49:40 GMT",
"version": "v2"
},
{
"created": "Wed, 23 May 2018 06:38:53 GMT",
"version": "v3"
},
{
"created": "Sun, 16 Dec 2018 03:45:56 GMT",
"version": "v4"
}
] | 2018-12-18 | [
[
"Yu",
"Kui",
""
],
[
"Liu",
"Lin",
""
],
[
"Li",
"Jiuyong",
""
]
] | In this paper, we aim to develop a unified view of causal and non-causal feature selection methods. The unified view will fill in the gap in the research of the relation between the two types of methods. Based on the Bayesian network framework and information theory, we first show that causal and non-causal feature sel... |
2203.13993 | Xiaomeng Li | Xiaoxiao Liang, Yiqun Lin, Huazhu Fu, Lei Zhu, Xiaomeng Li | RSCFed: Random Sampling Consensus Federated Semi-supervised Learning | CVPR 2022, code: https://github.com/XMed-Lab/RSCFed | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated semi-supervised learning (FSSL) aims to derive a global model by
training fully-labeled and fully-unlabeled clients or training partially
labeled clients. The existing approaches work well when local clients have
independent and identically distributed (IID) data but fail to generalize to a
more practical F... | [
{
"created": "Sat, 26 Mar 2022 05:10:44 GMT",
"version": "v1"
}
] | 2022-03-29 | [
[
"Liang",
"Xiaoxiao",
""
],
[
"Lin",
"Yiqun",
""
],
[
"Fu",
"Huazhu",
""
],
[
"Zhu",
"Lei",
""
],
[
"Li",
"Xiaomeng",
""
]
] | Federated semi-supervised learning (FSSL) aims to derive a global model by training fully-labeled and fully-unlabeled clients or training partially labeled clients. The existing approaches work well when local clients have independent and identically distributed (IID) data but fail to generalize to a more practical FSS... |
2205.14550 | Swapnil Sayan Saha | Swapnil Sayan Saha, Sandeep Singh Sandha, Mani Srivastava | Machine Learning for Microcontroller-Class Hardware: A Review | Published in IEEE Sensors Journal. Cite this as: S. S. Saha, S. S.
Sandha and M. Srivastava, "Machine Learning for Microcontroller-Class
Hardware: A Review," in IEEE Sensors Journal, vol. 22, no. 22, pp.
21362-21390, 15 Nov., 2022 | IEEE Sensors Journal, vol. 22, no. 22, pp. 21362-21390, 15 Nov.,
2022 | 10.1109/JSEN.2022.3210773 | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | The advancements in machine learning opened a new opportunity to bring
intelligence to the low-end Internet-of-Things nodes such as microcontrollers.
Conventional machine learning deployment has high memory and compute footprint
hindering their direct deployment on ultra resource-constrained
microcontrollers. This pa... | [
{
"created": "Sun, 29 May 2022 00:59:38 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Jun 2022 15:50:30 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Jul 2022 04:52:56 GMT",
"version": "v3"
},
{
"created": "Wed, 16 Nov 2022 19:03:29 GMT",
"version": "v4"
},
{
"cr... | 2022-12-22 | [
[
"Saha",
"Swapnil Sayan",
""
],
[
"Sandha",
"Sandeep Singh",
""
],
[
"Srivastava",
"Mani",
""
]
] | The advancements in machine learning opened a new opportunity to bring intelligence to the low-end Internet-of-Things nodes such as microcontrollers. Conventional machine learning deployment has high memory and compute footprint hindering their direct deployment on ultra resource-constrained microcontrollers. This pape... |
1604.08080 | Germ\'an Andr\'es Delbianco | Germ\'an Andr\'es Delbianco, Ilya Sergey, Aleksandar Nanevski and
Anindya Banerjee | Concurrent Data Structures Linked in Time | null | null | null | null | cs.LO cs.DC cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Arguments about correctness of a concurrent data structure are typically
carried out by using the notion of linearizability and specifying the
linearization points of the data structure's procedures. Such arguments are
often cumbersome as the linearization points' position in time can be dynamic
(depend on the interf... | [
{
"created": "Wed, 27 Apr 2016 14:13:46 GMT",
"version": "v1"
},
{
"created": "Tue, 3 May 2016 00:08:37 GMT",
"version": "v2"
},
{
"created": "Mon, 24 Oct 2016 17:22:22 GMT",
"version": "v3"
},
{
"created": "Wed, 18 Jan 2017 13:23:29 GMT",
"version": "v4"
}
] | 2017-01-19 | [
[
"Delbianco",
"Germán Andrés",
""
],
[
"Sergey",
"Ilya",
""
],
[
"Nanevski",
"Aleksandar",
""
],
[
"Banerjee",
"Anindya",
""
]
] | Arguments about correctness of a concurrent data structure are typically carried out by using the notion of linearizability and specifying the linearization points of the data structure's procedures. Such arguments are often cumbersome as the linearization points' position in time can be dynamic (depend on the interfer... |
1904.10176 | Songlin Xu | Songlin Xu and Jiacheng Zhu | Estimating Risk Levels of Driving Scenarios through Analysis of Driving
Styles for Autonomous Vehicles | null | null | null | null | cs.RO cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to operate safely on the road, autonomous vehicles need not only to
be able to identify objects in front of them, but also to be able to estimate
the risk level of the object in front of the vehicle automatically. It is
obvious that different objects have different levels of danger to autonomous
vehicles. An... | [
{
"created": "Tue, 23 Apr 2019 06:55:48 GMT",
"version": "v1"
}
] | 2019-04-24 | [
[
"Xu",
"Songlin",
""
],
[
"Zhu",
"Jiacheng",
""
]
] | In order to operate safely on the road, autonomous vehicles need not only to be able to identify objects in front of them, but also to be able to estimate the risk level of the object in front of the vehicle automatically. It is obvious that different objects have different levels of danger to autonomous vehicles. An e... |
1304.5966 | Mile Sikic | Matija Korpar and Mile Sikic | SW# - GPU enabled exact alignments on genome scale | 3 pages, 1 figure, 1 table | null | null | null | cs.DC cs.CE q-bio.GN | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Sequence alignment is one of the oldest and the most famous problems in
bioinformatics. Even after 45 years, for one reason or another, this problem is
still actual; current solutions are trade-offs between execution time, memory
consumption and accuracy. We purpose SW#, a new CUDA GPU enabled and memory
efficient im... | [
{
"created": "Mon, 22 Apr 2013 14:40:15 GMT",
"version": "v1"
}
] | 2013-04-23 | [
[
"Korpar",
"Matija",
""
],
[
"Sikic",
"Mile",
""
]
] | Sequence alignment is one of the oldest and the most famous problems in bioinformatics. Even after 45 years, for one reason or another, this problem is still actual; current solutions are trade-offs between execution time, memory consumption and accuracy. We purpose SW#, a new CUDA GPU enabled and memory efficient impl... |
2001.02773 | Yuqiao Chen | Yuqiao Chen, Yibo Yang, Sriraam Natarajan, Nicholas Ruozzi | Lifted Hybrid Variational Inference | AAAI 2020 Workshop on Statistical Relational AI (StarAI 2020) | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A variety of lifted inference algorithms, which exploit model symmetry to
reduce computational cost, have been proposed to render inference tractable in
probabilistic relational models. Most existing lifted inference algorithms
operate only over discrete domains or continuous domains with restricted
potential functio... | [
{
"created": "Wed, 8 Jan 2020 22:29:07 GMT",
"version": "v1"
},
{
"created": "Sat, 8 Feb 2020 03:13:02 GMT",
"version": "v2"
}
] | 2020-02-11 | [
[
"Chen",
"Yuqiao",
""
],
[
"Yang",
"Yibo",
""
],
[
"Natarajan",
"Sriraam",
""
],
[
"Ruozzi",
"Nicholas",
""
]
] | A variety of lifted inference algorithms, which exploit model symmetry to reduce computational cost, have been proposed to render inference tractable in probabilistic relational models. Most existing lifted inference algorithms operate only over discrete domains or continuous domains with restricted potential functions... |
1905.09275 | Nicholas Watters | Nicholas Watters, Loic Matthey, Matko Bosnjak, Christopher P. Burgess,
Alexander Lerchner | COBRA: Data-Efficient Model-Based RL through Unsupervised Object
Discovery and Curiosity-Driven Exploration | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data efficiency and robustness to task-irrelevant perturbations are
long-standing challenges for deep reinforcement learning algorithms. Here we
introduce a modular approach to addressing these challenges in a continuous
control environment, without using hand-crafted or supervised information. Our
Curious Object-Bas... | [
{
"created": "Wed, 22 May 2019 17:59:32 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Aug 2019 10:36:39 GMT",
"version": "v2"
}
] | 2019-08-15 | [
[
"Watters",
"Nicholas",
""
],
[
"Matthey",
"Loic",
""
],
[
"Bosnjak",
"Matko",
""
],
[
"Burgess",
"Christopher P.",
""
],
[
"Lerchner",
"Alexander",
""
]
] | Data efficiency and robustness to task-irrelevant perturbations are long-standing challenges for deep reinforcement learning algorithms. Here we introduce a modular approach to addressing these challenges in a continuous control environment, without using hand-crafted or supervised information. Our Curious Object-Based... |
1301.6236 | Alexander Zeh | Johan Sebastian Rosenkilde Nielsen (Technical University of Denmark),
Alexander Zeh (INT - University of Ulm., INRIA Saclay - Ile de France) | Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon
Codes | WCC 2013 International Workshop on Coding and Cryptography (2013) | International Workshop on Coding and Cryptography (WCC) (2013) | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An iterated refinement procedure for the Guruswami--Sudan list decoding
algorithm for Generalised Reed--Solomon codes based on Alekhnovich's module
minimisation is proposed. The method is parametrisable and allows variants of
the usual list decoding approach. In particular, finding the list of
\emph{closest} codeword... | [
{
"created": "Sat, 26 Jan 2013 11:16:40 GMT",
"version": "v1"
},
{
"created": "Thu, 31 Jan 2013 07:47:15 GMT",
"version": "v2"
}
] | 2013-05-31 | [
[
"Nielsen",
"Johan Sebastian Rosenkilde",
"",
"Technical University of Denmark"
],
[
"Zeh",
"Alexander",
"",
"INT - University of Ulm., INRIA Saclay - Ile de France"
]
] | An iterated refinement procedure for the Guruswami--Sudan list decoding algorithm for Generalised Reed--Solomon codes based on Alekhnovich's module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list of \emph{closest} codewords ... |
2210.13635 | Hannes Westermann | Hannes Westermann, Jaromir Savelka, Vern R. Walker, Kevin D. Ashley,
Karim Benyekhlef | Toward an Intelligent Tutoring System for Argument Mining in Legal Texts | Accepted for presentation at the 35th International Conference on
Legal Knowledge and Information Systems (JURIX 2022) and publication in the
Frontiers of Artificial Intelligence and Applications series of IOS Press | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an adaptive environment (CABINET) to support caselaw analysis
(identifying key argument elements) based on a novel cognitive computing
framework that carefully matches various machine learning (ML) capabilities to
the proficiency of a user. CABINET supports law students in their learning as
well as profess... | [
{
"created": "Mon, 24 Oct 2022 22:31:02 GMT",
"version": "v1"
}
] | 2022-10-26 | [
[
"Westermann",
"Hannes",
""
],
[
"Savelka",
"Jaromir",
""
],
[
"Walker",
"Vern R.",
""
],
[
"Ashley",
"Kevin D.",
""
],
[
"Benyekhlef",
"Karim",
""
]
] | We propose an adaptive environment (CABINET) to support caselaw analysis (identifying key argument elements) based on a novel cognitive computing framework that carefully matches various machine learning (ML) capabilities to the proficiency of a user. CABINET supports law students in their learning as well as professio... |
2407.11975 | Kevin Baron | Kevin William Baron | Comparing Visual Metaphors with Textual Code For Learning Basic Computer
Science Concepts in Virtual Reality | 41 pages, 9 figures | null | null | null | cs.HC cs.MM | http://creativecommons.org/licenses/by/4.0/ | This paper represents a pilot study examining learners who are new to
computer science (CS). Subjects are taught to program in one of two virtual
reality (VR) applications developed by the researcher that use interactable
objects representing programming concepts. The different versions are the basis
for two experime... | [
{
"created": "Sat, 25 May 2024 07:46:43 GMT",
"version": "v1"
}
] | 2024-07-18 | [
[
"Baron",
"Kevin William",
""
]
] | This paper represents a pilot study examining learners who are new to computer science (CS). Subjects are taught to program in one of two virtual reality (VR) applications developed by the researcher that use interactable objects representing programming concepts. The different versions are the basis for two experiment... |
2310.06794 | Siddhant Agarwal | Siddhant Agarwal, Ishan Durugkar, Peter Stone, Amy Zhang | $f$-Policy Gradients: A General Framework for Goal Conditioned RL using
$f$-Divergences | Accepted at NeurIPS 2023 | null | null | null | cs.LG cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | Goal-Conditioned Reinforcement Learning (RL) problems often have access to
sparse rewards where the agent receives a reward signal only when it has
achieved the goal, making policy optimization a difficult problem. Several
works augment this sparse reward with a learned dense reward function, but this
can lead to sub... | [
{
"created": "Tue, 10 Oct 2023 17:07:05 GMT",
"version": "v1"
}
] | 2023-10-11 | [
[
"Agarwal",
"Siddhant",
""
],
[
"Durugkar",
"Ishan",
""
],
[
"Stone",
"Peter",
""
],
[
"Zhang",
"Amy",
""
]
] | Goal-Conditioned Reinforcement Learning (RL) problems often have access to sparse rewards where the agent receives a reward signal only when it has achieved the goal, making policy optimization a difficult problem. Several works augment this sparse reward with a learned dense reward function, but this can lead to sub-o... |
1802.10567 | Jost Tobias Springenberg | Martin Riedmiller, Roland Hafner, Thomas Lampe, Michael Neunert, Jonas
Degrave, Tom Van de Wiele, Volodymyr Mnih, Nicolas Heess, Jost Tobias
Springenberg | Learning by Playing - Solving Sparse Reward Tasks from Scratch | A video of the rich set of learned behaviours can be found at
https://youtu.be/mPKyvocNe_M | null | null | null | cs.LG cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose Scheduled Auxiliary Control (SAC-X), a new learning paradigm in
the context of Reinforcement Learning (RL). SAC-X enables learning of complex
behaviors - from scratch - in the presence of multiple sparse reward signals.
To this end, the agent is equipped with a set of general auxiliary tasks, that
it attem... | [
{
"created": "Wed, 28 Feb 2018 18:15:49 GMT",
"version": "v1"
}
] | 2018-03-01 | [
[
"Riedmiller",
"Martin",
""
],
[
"Hafner",
"Roland",
""
],
[
"Lampe",
"Thomas",
""
],
[
"Neunert",
"Michael",
""
],
[
"Degrave",
"Jonas",
""
],
[
"Van de Wiele",
"Tom",
""
],
[
"Mnih",
"Volodymyr",
""
],
... | We propose Scheduled Auxiliary Control (SAC-X), a new learning paradigm in the context of Reinforcement Learning (RL). SAC-X enables learning of complex behaviors - from scratch - in the presence of multiple sparse reward signals. To this end, the agent is equipped with a set of general auxiliary tasks, that it attempt... |
2009.10272 | Shivam Handa | Shivam Handa, Martin Rinard | Inductive Program Synthesis Over Noisy Data | null | null | 10.1145/3368089.3409732 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new framework and associated synthesis algorithms for program
synthesis over noisy data, i.e., data that may contain incorrect/corrupted
input-output examples. This framework is based on an extension of finite tree
automata called {\em weighted finite tree automata}. We show how to apply this
framework t... | [
{
"created": "Tue, 22 Sep 2020 01:57:48 GMT",
"version": "v1"
},
{
"created": "Sun, 18 Oct 2020 20:23:13 GMT",
"version": "v2"
}
] | 2021-03-15 | [
[
"Handa",
"Shivam",
""
],
[
"Rinard",
"Martin",
""
]
] | We present a new framework and associated synthesis algorithms for program synthesis over noisy data, i.e., data that may contain incorrect/corrupted input-output examples. This framework is based on an extension of finite tree automata called {\em weighted finite tree automata}. We show how to apply this framework to ... |
2402.03173 | Zichen Zhu | Zichen Zhu, Yang Xu, Lu Chen, Jingkai Yang, Yichuan Ma, Yiming Sun,
Hailin Wen, Jiaqi Liu, Jinyu Cai, Yingzi Ma, Situo Zhang, Zihan Zhao,
Liangtai Sun, Kai Yu | MULTI: Multimodal Understanding Leaderboard with Text and Images | 16 pages, 9 figures, 10 tables. Details and access are available at:
https://OpenDFM.github.io/MULTI-Benchmark/ | null | null | null | cs.CL cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Rapid progress in multimodal large language models (MLLMs) highlights the
need to introduce challenging yet realistic benchmarks to the academic
community, while existing benchmarks primarily focus on understanding simple
natural images and short context. In this paper, we present MULTI as a
cutting-edge benchmark fo... | [
{
"created": "Mon, 5 Feb 2024 16:41:02 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Feb 2024 07:55:52 GMT",
"version": "v2"
}
] | 2024-02-21 | [
[
"Zhu",
"Zichen",
""
],
[
"Xu",
"Yang",
""
],
[
"Chen",
"Lu",
""
],
[
"Yang",
"Jingkai",
""
],
[
"Ma",
"Yichuan",
""
],
[
"Sun",
"Yiming",
""
],
[
"Wen",
"Hailin",
""
],
[
"Liu",
"Jiaqi",
""
... | Rapid progress in multimodal large language models (MLLMs) highlights the need to introduce challenging yet realistic benchmarks to the academic community, while existing benchmarks primarily focus on understanding simple natural images and short context. In this paper, we present MULTI as a cutting-edge benchmark for ... |
2403.17090 | Vida Dujmovic | Vida Dujmovic and Pat Morin | Free Sets in Planar Graphs: History and Applications | 31 pages | null | null | null | cs.CG cs.DM math.CO | http://creativecommons.org/licenses/by/4.0/ | A subset $S$ of vertices in a planar graph $G$ is a free set if, for every
set $P$ of $|S|$ points in the plane, there exists a straight-line
crossing-free drawing of $G$ in which vertices of $S$ are mapped to distinct
points in $P$. In this survey, we review
- several equivalent definitions of free sets, - results... | [
{
"created": "Mon, 25 Mar 2024 18:25:15 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Dujmovic",
"Vida",
""
],
[
"Morin",
"Pat",
""
]
] | A subset $S$ of vertices in a planar graph $G$ is a free set if, for every set $P$ of $|S|$ points in the plane, there exists a straight-line crossing-free drawing of $G$ in which vertices of $S$ are mapped to distinct points in $P$. In this survey, we review - several equivalent definitions of free sets, - results on ... |
2205.05793 | Hjalmar Wijk | Hjalmar Wijk, Benjie Wang, Marta Kwiatkowska | Robustness Guarantees for Credal Bayesian Networks via Constraint
Relaxation over Probabilistic Circuits | 11 pages (8+3 Appendix). To be published in IJCAI 2022 | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | In many domains, worst-case guarantees on the performance (e.g., prediction
accuracy) of a decision function subject to distributional shifts and
uncertainty about the environment are crucial. In this work we develop a method
to quantify the robustness of decision functions with respect to credal
Bayesian networks, f... | [
{
"created": "Wed, 11 May 2022 22:37:07 GMT",
"version": "v1"
}
] | 2022-05-13 | [
[
"Wijk",
"Hjalmar",
""
],
[
"Wang",
"Benjie",
""
],
[
"Kwiatkowska",
"Marta",
""
]
] | In many domains, worst-case guarantees on the performance (e.g., prediction accuracy) of a decision function subject to distributional shifts and uncertainty about the environment are crucial. In this work we develop a method to quantify the robustness of decision functions with respect to credal Bayesian networks, for... |
2311.03742 | Xinhao Xiang | Xinhao Xiang, Simon Dr\"ager, Jiawei Zhang | 3DifFusionDet: Diffusion Model for 3D Object Detection with Robust
LiDAR-Camera Fusion | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Good 3D object detection performance from LiDAR-Camera sensors demands
seamless feature alignment and fusion strategies. We propose the 3DifFusionDet
framework in this paper, which structures 3D object detection as a denoising
diffusion process from noisy 3D boxes to target boxes. In this framework,
ground truth boxe... | [
{
"created": "Tue, 7 Nov 2023 05:53:09 GMT",
"version": "v1"
}
] | 2023-11-08 | [
[
"Xiang",
"Xinhao",
""
],
[
"Dräger",
"Simon",
""
],
[
"Zhang",
"Jiawei",
""
]
] | Good 3D object detection performance from LiDAR-Camera sensors demands seamless feature alignment and fusion strategies. We propose the 3DifFusionDet framework in this paper, which structures 3D object detection as a denoising diffusion process from noisy 3D boxes to target boxes. In this framework, ground truth boxes ... |
1008.3443 | Jose Ignacio Alvarez-Hamelin | Jos\'e Ignacio Alvarez-Hamelin (FIUBA, INTECIN), Beir\'o Mariano
Gast\'on (FIUBA), Jorge Rodolfo Busch (FIUBA) | On weakly optimal partitions in modular networks | null | null | null | null | cs.SI cond-mat.stat-mech physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modularity was introduced as a measure of goodness for the community
structure induced by a partition of the set of vertices in a graph. Then, it
also became an objective function used to find good partitions, with high
success. Nevertheless, some works have shown a scaling limit and certain
instabilities when findin... | [
{
"created": "Fri, 20 Aug 2010 06:49:04 GMT",
"version": "v1"
}
] | 2010-08-25 | [
[
"Alvarez-Hamelin",
"José Ignacio",
"",
"FIUBA, INTECIN"
],
[
"Gastón",
"Beiró Mariano",
"",
"FIUBA"
],
[
"Busch",
"Jorge Rodolfo",
"",
"FIUBA"
]
] | Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective function used to find good partitions, with high success. Nevertheless, some works have shown a scaling limit and certain instabilities when finding ... |
2208.11235 | Colin Gordon | Sergey Matskevich, Colin S. Gordon | Preprocessing Source Code Comments for Linguistic Models | Correcting author name | null | null | null | cs.SE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Comments are an important part of the source code and are a primary source of
documentation. This has driven interest in using large bodies of comments to
train or evaluate tools that consume or produce them -- such as generating
oracles or even code from comments, or automatically generating code summaries.
Most of ... | [
{
"created": "Tue, 23 Aug 2022 23:44:09 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Aug 2022 23:46:49 GMT",
"version": "v2"
}
] | 2022-08-30 | [
[
"Matskevich",
"Sergey",
""
],
[
"Gordon",
"Colin S.",
""
]
] | Comments are an important part of the source code and are a primary source of documentation. This has driven interest in using large bodies of comments to train or evaluate tools that consume or produce them -- such as generating oracles or even code from comments, or automatically generating code summaries. Most of th... |
2404.16051 | Jan Martijn van der Werf | Max Lonysa Muller, Erik Saaman, Jan Martijn E. M. van der Werf,
Charles Jeurgens and Hajo A. Reijers | TimeFlows: Visualizing Process Chronologies from Vast Collections of
Heterogeneous Information Objects | 16 pages, accepted at RCIS 2024 | null | null | null | cs.HC cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In many fact-finding investigations, notably parliamentary inquiries, process
chronologies are created to reconstruct how a controversial policy or decision
came into existence. Current approaches, like timelines, lack the
expressiveness to represent the variety of relations in which historic events
may link to the o... | [
{
"created": "Wed, 10 Apr 2024 11:08:26 GMT",
"version": "v1"
},
{
"created": "Thu, 2 May 2024 19:11:49 GMT",
"version": "v2"
}
] | 2024-05-06 | [
[
"Muller",
"Max Lonysa",
""
],
[
"Saaman",
"Erik",
""
],
[
"van der Werf",
"Jan Martijn E. M.",
""
],
[
"Jeurgens",
"Charles",
""
],
[
"Reijers",
"Hajo A.",
""
]
] | In many fact-finding investigations, notably parliamentary inquiries, process chronologies are created to reconstruct how a controversial policy or decision came into existence. Current approaches, like timelines, lack the expressiveness to represent the variety of relations in which historic events may link to the ove... |
1711.05354 | William Leeb | William Leeb and Vladimir Rokhlin | On the Numerical Solution of Fourth-Order Linear Two-Point Boundary
Value Problems | null | null | null | null | cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a fast and numerically stable algorithm for the
solution of fourth-order linear boundary value problems on an interval. This
type of equation arises in a variety of settings in physics and signal
processing. Our method reformulates the equation as a collection of second-kind
integral equations d... | [
{
"created": "Tue, 14 Nov 2017 23:15:28 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Feb 2018 02:03:29 GMT",
"version": "v2"
},
{
"created": "Thu, 9 Jan 2020 20:12:46 GMT",
"version": "v3"
}
] | 2020-01-13 | [
[
"Leeb",
"William",
""
],
[
"Rokhlin",
"Vladimir",
""
]
] | This paper introduces a fast and numerically stable algorithm for the solution of fourth-order linear boundary value problems on an interval. This type of equation arises in a variety of settings in physics and signal processing. Our method reformulates the equation as a collection of second-kind integral equations def... |
1902.10460 | Jiasong Wu | Jinpeng Xia, Jiasong Wu, Youyong Kong, Pinzheng Zhang, Lotfi Senhadji,
Huazhong Shu | Modulated binary cliquenet | 5 pages, 3 figures, 2 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although Convolutional Neural Networks (CNNs) achieve effectiveness in
various computer vision tasks, the significant requirement of storage of such
networks hinders the deployment on computationally limited devices. In this
paper, we propose a new compact and portable deep learning network named
Modulated Binary Cli... | [
{
"created": "Wed, 27 Feb 2019 11:14:01 GMT",
"version": "v1"
}
] | 2019-02-28 | [
[
"Xia",
"Jinpeng",
""
],
[
"Wu",
"Jiasong",
""
],
[
"Kong",
"Youyong",
""
],
[
"Zhang",
"Pinzheng",
""
],
[
"Senhadji",
"Lotfi",
""
],
[
"Shu",
"Huazhong",
""
]
] | Although Convolutional Neural Networks (CNNs) achieve effectiveness in various computer vision tasks, the significant requirement of storage of such networks hinders the deployment on computationally limited devices. In this paper, we propose a new compact and portable deep learning network named Modulated Binary Cliqu... |
2312.16652 | Omar Al-Bataineh | Omar I. Al-Bataineh | Invariant-based Program Repair | Accepted for publication in the 27th International Conference on
Fundamental Approaches to Software Engineering (FASE 2024) | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | This paper describes a formal general-purpose automated program repair (APR)
framework based on the concept of program invariants. In the presented repair
framework, the execution traces of a defected program are dynamically analyzed
to infer specifications $\varphi_{correct}$ and $\varphi_{violated}$, where
$\varphi... | [
{
"created": "Wed, 27 Dec 2023 17:46:19 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Jan 2024 20:20:20 GMT",
"version": "v2"
}
] | 2024-01-30 | [
[
"Al-Bataineh",
"Omar I.",
""
]
] | This paper describes a formal general-purpose automated program repair (APR) framework based on the concept of program invariants. In the presented repair framework, the execution traces of a defected program are dynamically analyzed to infer specifications $\varphi_{correct}$ and $\varphi_{violated}$, where $\varphi_{... |
1106.5988 | Lazaros Gkatzikis | Lazaros Gkatzikis, Georgios S. Paschos and Iordanis Koutsopoulos | The impact of energy constraints on the medium access | 8 pages, 3 figures | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contemporary mobile devices are battery powered and due to their shrinking
size and increasing complexity operate on a tight energy budget. Thus, energy
consumption is becoming one of the major concerns regarding the current and
upcoming wireless communication systems. On the other hand, the available
bandwidth resou... | [
{
"created": "Sun, 5 Jun 2011 21:52:15 GMT",
"version": "v1"
}
] | 2015-03-19 | [
[
"Gkatzikis",
"Lazaros",
""
],
[
"Paschos",
"Georgios S.",
""
],
[
"Koutsopoulos",
"Iordanis",
""
]
] | Contemporary mobile devices are battery powered and due to their shrinking size and increasing complexity operate on a tight energy budget. Thus, energy consumption is becoming one of the major concerns regarding the current and upcoming wireless communication systems. On the other hand, the available bandwidth resourc... |
2012.14873 | Sebastian Johann Wetzel | Sebastian J. Wetzel, Kevin Ryczko, Roger G. Melko, Isaac Tamblyn | Twin Neural Network Regression | null | null | 10.1002/ail2.78 | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We introduce twin neural network (TNN) regression. This method predicts
differences between the target values of two different data points rather than
the targets themselves. The solution of a traditional regression problem is
then obtained by averaging over an ensemble of all predicted differences
between the target... | [
{
"created": "Tue, 29 Dec 2020 17:52:31 GMT",
"version": "v1"
}
] | 2022-12-14 | [
[
"Wetzel",
"Sebastian J.",
""
],
[
"Ryczko",
"Kevin",
""
],
[
"Melko",
"Roger G.",
""
],
[
"Tamblyn",
"Isaac",
""
]
] | We introduce twin neural network (TNN) regression. This method predicts differences between the target values of two different data points rather than the targets themselves. The solution of a traditional regression problem is then obtained by averaging over an ensemble of all predicted differences between the targets ... |
2006.09319 | Mamikon Gulian | Laura Swiler, Mamikon Gulian, Ari Frankel, Cosmin Safta, John Jakeman | A Survey of Constrained Gaussian Process Regression: Approaches and
Implementation Challenges | 42 pages, 3 figures. Version 3: DOI & Reference added; appeared in
Journal of Machine Learning for Modeling and Computing. Version 2 includes
minor additions, clarifications and improvements to notation | Journal of Machine Learning for Modeling and Computing,
1(2):119-156 (2020) | 10.1615/JMachLearnModelComput.2020035155 | null | cs.LG math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gaussian process regression is a popular Bayesian framework for surrogate
modeling of expensive data sources. As part of a broader effort in scientific
machine learning, many recent works have incorporated physical constraints or
other a priori information within Gaussian process regression to supplement
limited data... | [
{
"created": "Tue, 16 Jun 2020 17:03:36 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Dec 2020 18:55:38 GMT",
"version": "v2"
},
{
"created": "Wed, 6 Jan 2021 17:45:06 GMT",
"version": "v3"
}
] | 2021-01-07 | [
[
"Swiler",
"Laura",
""
],
[
"Gulian",
"Mamikon",
""
],
[
"Frankel",
"Ari",
""
],
[
"Safta",
"Cosmin",
""
],
[
"Jakeman",
"John",
""
]
] | Gaussian process regression is a popular Bayesian framework for surrogate modeling of expensive data sources. As part of a broader effort in scientific machine learning, many recent works have incorporated physical constraints or other a priori information within Gaussian process regression to supplement limited data a... |
2312.05459 | Venkata Raghava Kurada | Venkata Raghava Kurada, Pallava Kumar Baruah | FLoW3 -- Web3 Empowered Federated Learning | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Federated Learning is susceptible to various kinds of attacks like Data
Poisoning, Model Poisoning and Man in the Middle attack. We perceive Federated
Learning as a hierarchical structure, a federation of nodes with validators as
the head. The process of validation is done through consensus by employing
Novelty Detec... | [
{
"created": "Sat, 9 Dec 2023 04:05:07 GMT",
"version": "v1"
}
] | 2023-12-12 | [
[
"Kurada",
"Venkata Raghava",
""
],
[
"Baruah",
"Pallava Kumar",
""
]
] | Federated Learning is susceptible to various kinds of attacks like Data Poisoning, Model Poisoning and Man in the Middle attack. We perceive Federated Learning as a hierarchical structure, a federation of nodes with validators as the head. The process of validation is done through consensus by employing Novelty Detecti... |
1911.05204 | Hsiao-Yu Chen | Hsiao-yu Chen, Paul Kry, Etienne Vouga | Locking-free Simulation of Isometric Thin Plates | null | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To efficiently simulate very thin, inextensible materials like cloth or
paper, it is tempting to replace force-based thin-plate dynamics with hard
isometry constraints. Unfortunately, naive formulations of the constraints
induce membrane locking---artificial stiffening of bending modes due to the
inability of discret... | [
{
"created": "Tue, 12 Nov 2019 23:35:59 GMT",
"version": "v1"
}
] | 2019-11-14 | [
[
"Chen",
"Hsiao-yu",
""
],
[
"Kry",
"Paul",
""
],
[
"Vouga",
"Etienne",
""
]
] | To efficiently simulate very thin, inextensible materials like cloth or paper, it is tempting to replace force-based thin-plate dynamics with hard isometry constraints. Unfortunately, naive formulations of the constraints induce membrane locking---artificial stiffening of bending modes due to the inability of discrete ... |
2404.06762 | Zhengyuan Liu | Zhengyuan Liu, Stella Xin Yin, Geyu Lin, Nancy F. Chen | Personality-aware Student Simulation for Conversational Intelligent
Tutoring Systems | null | null | null | null | cs.CL cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intelligent Tutoring Systems (ITSs) can provide personalized and self-paced
learning experience. The emergence of large language models (LLMs) further
enables better human-machine interaction, and facilitates the development of
conversational ITSs in various disciplines such as math and language learning.
In dialogic... | [
{
"created": "Wed, 10 Apr 2024 06:03:13 GMT",
"version": "v1"
}
] | 2024-04-11 | [
[
"Liu",
"Zhengyuan",
""
],
[
"Yin",
"Stella Xin",
""
],
[
"Lin",
"Geyu",
""
],
[
"Chen",
"Nancy F.",
""
]
] | Intelligent Tutoring Systems (ITSs) can provide personalized and self-paced learning experience. The emergence of large language models (LLMs) further enables better human-machine interaction, and facilitates the development of conversational ITSs in various disciplines such as math and language learning. In dialogic t... |
2202.03918 | Michael Langberg | Michael Langberg and Michelle Effros | Network Coding Multicast Key-Capacity | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a multi-source multi-terminal noiseless network, the key-dissemination
problem involves the task of multicasting a secret key K from the network
sources to its terminals. As in secure multicast network-coding, in the
key-dissemination problem the source nodes have access to independent
randomness and, as the netw... | [
{
"created": "Tue, 8 Feb 2022 15:11:01 GMT",
"version": "v1"
},
{
"created": "Thu, 19 May 2022 15:39:40 GMT",
"version": "v2"
}
] | 2022-05-20 | [
[
"Langberg",
"Michael",
""
],
[
"Effros",
"Michelle",
""
]
] | For a multi-source multi-terminal noiseless network, the key-dissemination problem involves the task of multicasting a secret key K from the network sources to its terminals. As in secure multicast network-coding, in the key-dissemination problem the source nodes have access to independent randomness and, as the networ... |
1904.03522 | Roee Levy Leshem | Roee Levy Leshem, Raja Giryes | Taco-VC: A Single Speaker Tacotron based Voice Conversion with Limited
Data | Accepted to EUSIPCO 2020 | null | null | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces Taco-VC, a novel architecture for voice conversion
based on Tacotron synthesizer, which is a sequence-to-sequence with attention
model. The training of multi-speaker voice conversion systems requires a large
number of resources, both in training and corpus size. Taco-VC is implemented
using a si... | [
{
"created": "Sat, 6 Apr 2019 20:19:07 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Apr 2019 09:39:02 GMT",
"version": "v2"
},
{
"created": "Sat, 26 Oct 2019 08:53:29 GMT",
"version": "v3"
},
{
"created": "Fri, 19 Jun 2020 07:18:11 GMT",
"version": "v4"
}
] | 2020-06-22 | [
[
"Leshem",
"Roee Levy",
""
],
[
"Giryes",
"Raja",
""
]
] | This paper introduces Taco-VC, a novel architecture for voice conversion based on Tacotron synthesizer, which is a sequence-to-sequence with attention model. The training of multi-speaker voice conversion systems requires a large number of resources, both in training and corpus size. Taco-VC is implemented using a sing... |
2103.15209 | Da Xu | Da Xu, Yuting Ye, Chuanwei Ruan | Understanding the role of importance weighting for deep learning | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recent paper by Byrd & Lipton (2019), based on empirical observations,
raises a major concern on the impact of importance weighting for the
over-parameterized deep learning models. They observe that as long as the model
can separate the training data, the impact of importance weighting diminishes
as the training ... | [
{
"created": "Sun, 28 Mar 2021 19:44:47 GMT",
"version": "v1"
}
] | 2021-03-30 | [
[
"Xu",
"Da",
""
],
[
"Ye",
"Yuting",
""
],
[
"Ruan",
"Chuanwei",
""
]
] | The recent paper by Byrd & Lipton (2019), based on empirical observations, raises a major concern on the impact of importance weighting for the over-parameterized deep learning models. They observe that as long as the model can separate the training data, the impact of importance weighting diminishes as the training pr... |
2109.07321 | Roee Shraga PhD | Roee Shraga, Avigdor Gal | PoWareMatch: a Quality-aware Deep Learning Approach to Improve Human
Schema Matching | Technical report of the paper {\sf PoWareMatch}: a Quality-aware Deep
Learning Approach to Improve Human Schema Matching, accepted to ACM Journal
of Data and Information Quality (JDIQ), Special Issue on Deep Learning for
Data Quality | null | null | null | cs.DB cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Schema matching is a core task of any data integration process. Being
investigated in the fields of databases, AI, Semantic Web and data mining for
many years, the main challenge remains the ability to generate quality matches
among data concepts (e.g., database attributes). In this work, we examine a
novel angle on ... | [
{
"created": "Wed, 15 Sep 2021 14:24:56 GMT",
"version": "v1"
}
] | 2021-09-16 | [
[
"Shraga",
"Roee",
""
],
[
"Gal",
"Avigdor",
""
]
] | Schema matching is a core task of any data integration process. Being investigated in the fields of databases, AI, Semantic Web and data mining for many years, the main challenge remains the ability to generate quality matches among data concepts (e.g., database attributes). In this work, we examine a novel angle on th... |
1510.04585 | Kezhi Li | Kezhi Li | A Brief Survey of Image Processing Algorithms in Electrical Capacitance
Tomography | Internal Report, MRRC, University of Cambridge | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To study the fundamental physics of complex multiphase flow systems using
advanced measurement techniques, especially the electrical capacitance
tomography (ECT) approach, this article carries out an initial literature
review of the ECT method from a point of view of signal processing and
algorithm design. After intr... | [
{
"created": "Thu, 15 Oct 2015 15:36:03 GMT",
"version": "v1"
}
] | 2015-10-16 | [
[
"Li",
"Kezhi",
""
]
] | To study the fundamental physics of complex multiphase flow systems using advanced measurement techniques, especially the electrical capacitance tomography (ECT) approach, this article carries out an initial literature review of the ECT method from a point of view of signal processing and algorithm design. After introd... |
2204.13792 | Recep Yusuf Bekci | Recep Yusuf Bekci, Yacine Mahdid, Jinling Xing, Nikita Letov, Ying
Zhang, Zahid Pasha | Probabilistic Models for Manufacturing Lead Times | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | In this study, we utilize Gaussian processes, probabilistic neural network,
natural gradient boosting, and quantile regression augmented gradient boosting
to model lead times of laser manufacturing processes. We introduce
probabilistic modelling in the domain and compare the models in terms of
different abilities. Wh... | [
{
"created": "Thu, 28 Apr 2022 21:51:52 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Jun 2022 18:41:28 GMT",
"version": "v2"
}
] | 2022-06-30 | [
[
"Bekci",
"Recep Yusuf",
""
],
[
"Mahdid",
"Yacine",
""
],
[
"Xing",
"Jinling",
""
],
[
"Letov",
"Nikita",
""
],
[
"Zhang",
"Ying",
""
],
[
"Pasha",
"Zahid",
""
]
] | In this study, we utilize Gaussian processes, probabilistic neural network, natural gradient boosting, and quantile regression augmented gradient boosting to model lead times of laser manufacturing processes. We introduce probabilistic modelling in the domain and compare the models in terms of different abilities. Whil... |
2402.04722 | Kit Gallagher | Kit Gallagher, Richard Creswell, Ben Lambert, Martin Robinson, Chon
Lok Lei, Gary R. Mirams, David J. Gavaghan | Ten simple rules for teaching sustainable software engineering | Prepared for submission to PLOS Computational Biology's 10 Simple
Rules collection | null | null | null | cs.CY cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computational methods and associated software implementations are central to
every field of scientific investigation. Modern biological research,
particularly within systems biology, has relied heavily on the development of
software tools to process and organize increasingly large datasets, simulate
complex mechanist... | [
{
"created": "Wed, 7 Feb 2024 10:16:20 GMT",
"version": "v1"
}
] | 2024-02-08 | [
[
"Gallagher",
"Kit",
""
],
[
"Creswell",
"Richard",
""
],
[
"Lambert",
"Ben",
""
],
[
"Robinson",
"Martin",
""
],
[
"Lei",
"Chon Lok",
""
],
[
"Mirams",
"Gary R.",
""
],
[
"Gavaghan",
"David J.",
""
]
] | Computational methods and associated software implementations are central to every field of scientific investigation. Modern biological research, particularly within systems biology, has relied heavily on the development of software tools to process and organize increasingly large datasets, simulate complex mechanistic... |
1808.10292 | Alexandros Gerbessiotis | Alexandros V. Gerbessiotis | A study of integer sorting on multicores | arXiv admin note: substantial text overlap with arXiv:1708.09495,
arXiv:1608.08648 | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integer sorting on multicores and GPUs can be realized by a variety of
approaches that include variants of distribution-based methods such as
radix-sort, comparison-oriented algorithms such as deterministic regular
sampling and random sampling parallel sorting, and network-based algorithms
such as Batcher's bitonic s... | [
{
"created": "Wed, 29 Aug 2018 14:28:35 GMT",
"version": "v1"
}
] | 2018-08-31 | [
[
"Gerbessiotis",
"Alexandros V.",
""
]
] | Integer sorting on multicores and GPUs can be realized by a variety of approaches that include variants of distribution-based methods such as radix-sort, comparison-oriented algorithms such as deterministic regular sampling and random sampling parallel sorting, and network-based algorithms such as Batcher's bitonic sor... |
2308.03151 | Zheng Ma | Zheng Ma, Mianzhi Pan, Wenhan Wu, Kanzhi Cheng, Jianbing Zhang,
Shujian Huang and Jiajun Chen | Food-500 Cap: A Fine-Grained Food Caption Benchmark for Evaluating
Vision-Language Models | Accepted at ACM Multimedia (ACMMM) 2023 | null | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vision-language models (VLMs) have shown impressive performance in
substantial downstream multi-modal tasks. However, only comparing the
fine-tuned performance on downstream tasks leads to the poor interpretability
of VLMs, which is adverse to their future improvement. Several prior works have
identified this issue a... | [
{
"created": "Sun, 6 Aug 2023 15:56:31 GMT",
"version": "v1"
}
] | 2023-08-08 | [
[
"Ma",
"Zheng",
""
],
[
"Pan",
"Mianzhi",
""
],
[
"Wu",
"Wenhan",
""
],
[
"Cheng",
"Kanzhi",
""
],
[
"Zhang",
"Jianbing",
""
],
[
"Huang",
"Shujian",
""
],
[
"Chen",
"Jiajun",
""
]
] | Vision-language models (VLMs) have shown impressive performance in substantial downstream multi-modal tasks. However, only comparing the fine-tuned performance on downstream tasks leads to the poor interpretability of VLMs, which is adverse to their future improvement. Several prior works have identified this issue and... |
2402.08986 | Wenwei Zhao | Wenwei Zhao, Xiaowen Li, Shangqing Zhao, Jie Xu, Yao Liu, Zhuo Lu | Detecting Adversarial Spectrum Attacks via Distance to Decision Boundary
Statistics | 10 pages, 11 figures | null | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning has been adopted for efficient cooperative spectrum sensing.
However, it incurs an additional security risk due to attacks leveraging
adversarial machine learning to create malicious spectrum sensing values to
deceive the fusion center, called adversarial spectrum attacks. In this paper,
we propose a... | [
{
"created": "Wed, 14 Feb 2024 06:57:21 GMT",
"version": "v1"
}
] | 2024-02-15 | [
[
"Zhao",
"Wenwei",
""
],
[
"Li",
"Xiaowen",
""
],
[
"Zhao",
"Shangqing",
""
],
[
"Xu",
"Jie",
""
],
[
"Liu",
"Yao",
""
],
[
"Lu",
"Zhuo",
""
]
] | Machine learning has been adopted for efficient cooperative spectrum sensing. However, it incurs an additional security risk due to attacks leveraging adversarial machine learning to create malicious spectrum sensing values to deceive the fusion center, called adversarial spectrum attacks. In this paper, we propose an ... |
1807.01053 | Sergey Goncharov | Sergey Goncharov, Julian Jakob, Renato Neves | A Semantics for Hybrid Iteration | Corrected version of a CONCUR'18 paper; more proof details | null | 10.4230/LIPIcs.CONCUR.2018.22 | null | cs.PL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recently introduced notions of guarded traced (monoidal) category and
guarded (pre-)iterative monad aim at unifying different instances of partial
iteration whilst keeping in touch with the established theory of total
iteration and preserving its merits. In this paper we use these notions and the
corresponding st... | [
{
"created": "Tue, 3 Jul 2018 09:47:52 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Feb 2019 15:59:02 GMT",
"version": "v2"
}
] | 2019-02-07 | [
[
"Goncharov",
"Sergey",
""
],
[
"Jakob",
"Julian",
""
],
[
"Neves",
"Renato",
""
]
] | The recently introduced notions of guarded traced (monoidal) category and guarded (pre-)iterative monad aim at unifying different instances of partial iteration whilst keeping in touch with the established theory of total iteration and preserving its merits. In this paper we use these notions and the corresponding stoc... |
1807.03099 | Ayse Ipek Akin Atalay | Ayse Ipek Akin, Nafiseh Janatian, Ivan Stupia, and Luc Vandendorpe | SWIPT-based Real-Time Mobile Computing Systems: A Stochastic Geometry
Perspective | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Driven by the Internet of Things vision, recent years have seen the rise of
new horizons for the wireless ecosystem in which a very large number of mobile
low power devices interact to run sophisticated applications. The main
hindrance to the massive deployment of low power nodes is most probably the
prohibitive main... | [
{
"created": "Mon, 9 Jul 2018 13:17:33 GMT",
"version": "v1"
}
] | 2018-07-10 | [
[
"Akin",
"Ayse Ipek",
""
],
[
"Janatian",
"Nafiseh",
""
],
[
"Stupia",
"Ivan",
""
],
[
"Vandendorpe",
"Luc",
""
]
] | Driven by the Internet of Things vision, recent years have seen the rise of new horizons for the wireless ecosystem in which a very large number of mobile low power devices interact to run sophisticated applications. The main hindrance to the massive deployment of low power nodes is most probably the prohibitive mainte... |
2003.04865 | Yutaro Shigeto | Yutaro Shigeto, Yuya Yoshikawa, Jiaqing Lin, Akikazu Takeuchi | Video Caption Dataset for Describing Human Actions in Japanese | Accepted for LREC 2020. Dataset available at
https://actions.stair.center/captions.html | null | null | null | cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, automatic video caption generation has attracted
considerable attention. This paper focuses on the generation of Japanese
captions for describing human actions. While most currently available video
caption datasets have been constructed for English, there is no equivalent
Japanese dataset. To address... | [
{
"created": "Tue, 10 Mar 2020 17:15:48 GMT",
"version": "v1"
}
] | 2020-03-11 | [
[
"Shigeto",
"Yutaro",
""
],
[
"Yoshikawa",
"Yuya",
""
],
[
"Lin",
"Jiaqing",
""
],
[
"Takeuchi",
"Akikazu",
""
]
] | In recent years, automatic video caption generation has attracted considerable attention. This paper focuses on the generation of Japanese captions for describing human actions. While most currently available video caption datasets have been constructed for English, there is no equivalent Japanese dataset. To address t... |
2112.03154 | Haoran Xu | Haoran Xu, Sixing Lu, Zhongkai Sun, Chengyuan Ma, Chenlei Guo | VAE based Text Style Transfer with Pivot Words Enhancement Learning | Accepted at The eighteenth International Conference on Natural
Language Processing | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text Style Transfer (TST) aims to alter the underlying style of the source
text to another specific style while keeping the same content. Due to the
scarcity of high-quality parallel training data, unsupervised learning has
become a trending direction for TST tasks. In this paper, we propose a novel
VAE based Text St... | [
{
"created": "Mon, 6 Dec 2021 16:41:26 GMT",
"version": "v1"
}
] | 2021-12-07 | [
[
"Xu",
"Haoran",
""
],
[
"Lu",
"Sixing",
""
],
[
"Sun",
"Zhongkai",
""
],
[
"Ma",
"Chengyuan",
""
],
[
"Guo",
"Chenlei",
""
]
] | Text Style Transfer (TST) aims to alter the underlying style of the source text to another specific style while keeping the same content. Due to the scarcity of high-quality parallel training data, unsupervised learning has become a trending direction for TST tasks. In this paper, we propose a novel VAE based Text Styl... |
2308.09592 | Wenhao Chai | Wenhao Chai, Xun Guo, Gaoang Wang, Yan Lu | StableVideo: Text-driven Consistency-aware Diffusion Video Editing | ICCV 2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diffusion-based methods can generate realistic images and videos, but they
struggle to edit existing objects in a video while preserving their appearance
over time. This prevents diffusion models from being applied to natural video
editing in practical scenarios. In this paper, we tackle this problem by
introducing t... | [
{
"created": "Fri, 18 Aug 2023 14:39:16 GMT",
"version": "v1"
}
] | 2023-08-21 | [
[
"Chai",
"Wenhao",
""
],
[
"Guo",
"Xun",
""
],
[
"Wang",
"Gaoang",
""
],
[
"Lu",
"Yan",
""
]
] | Diffusion-based methods can generate realistic images and videos, but they struggle to edit existing objects in a video while preserving their appearance over time. This prevents diffusion models from being applied to natural video editing in practical scenarios. In this paper, we tackle this problem by introducing tem... |
1401.0870 | Laurence Aroquiaraj | I. Laurence Aroquiaraj and K. Thangavel | Pectoral Muscles Suppression in Digital Mammograms using Hybridization
of Soft Computing Methods | 8 pages, 6 figures | null | null | null | cs.CV cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Breast region segmentation is an essential prerequisite in computerized
analysis of mammograms. It aims at separating the breast tissue from the
background of the mammogram and it includes two independent segmentations. The
first segments the background region which usually contains annotations, labels
and frames fro... | [
{
"created": "Sun, 5 Jan 2014 08:14:43 GMT",
"version": "v1"
}
] | 2014-01-07 | [
[
"Aroquiaraj",
"I. Laurence",
""
],
[
"Thangavel",
"K.",
""
]
] | Breast region segmentation is an essential prerequisite in computerized analysis of mammograms. It aims at separating the breast tissue from the background of the mammogram and it includes two independent segmentations. The first segments the background region which usually contains annotations, labels and frames from ... |
2010.03412 | Weijia Xu | Weijia Xu, Xing Niu, Marine Carpuat | Dual Reconstruction: a Unifying Objective for Semi-Supervised Neural
Machine Translation | Accepted at Findings of EMNLP 2020 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While Iterative Back-Translation and Dual Learning effectively incorporate
monolingual training data in neural machine translation, they use different
objectives and heuristic gradient approximation strategies, and have not been
extensively compared. We introduce a novel dual reconstruction objective that
provides a ... | [
{
"created": "Wed, 7 Oct 2020 13:40:32 GMT",
"version": "v1"
}
] | 2020-10-08 | [
[
"Xu",
"Weijia",
""
],
[
"Niu",
"Xing",
""
],
[
"Carpuat",
"Marine",
""
]
] | While Iterative Back-Translation and Dual Learning effectively incorporate monolingual training data in neural machine translation, they use different objectives and heuristic gradient approximation strategies, and have not been extensively compared. We introduce a novel dual reconstruction objective that provides a un... |
2112.02053 | Valdemar \v{S}v\'abensk\'y | Valdemar \v{S}v\'abensk\'y, Richard Weiss, Jack Cook, Jan Vykopal,
Pavel \v{C}eleda, Jens Mache, Radoslav Chudovsk\'y, Ankur Chattopadhyay | Evaluating Two Approaches to Assessing Student Progress in Cybersecurity
Exercises | ACM SIGCSE 2022 conference, 7 pages, 3 figures | null | 10.1145/3478431.3499414 | null | cs.CY cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cybersecurity students need to develop practical skills such as using
command-line tools. Hands-on exercises are the most direct way to assess these
skills, but assessing students' mastery is a challenging task for instructors.
We aim to alleviate this issue by modeling and visualizing student progress
automatically ... | [
{
"created": "Fri, 3 Dec 2021 18:08:27 GMT",
"version": "v1"
}
] | 2021-12-06 | [
[
"Švábenský",
"Valdemar",
""
],
[
"Weiss",
"Richard",
""
],
[
"Cook",
"Jack",
""
],
[
"Vykopal",
"Jan",
""
],
[
"Čeleda",
"Pavel",
""
],
[
"Mache",
"Jens",
""
],
[
"Chudovský",
"Radoslav",
""
],
[
"C... | Cybersecurity students need to develop practical skills such as using command-line tools. Hands-on exercises are the most direct way to assess these skills, but assessing students' mastery is a challenging task for instructors. We aim to alleviate this issue by modeling and visualizing student progress automatically th... |
2206.05968 | Elahe Ghasemi | Mohammad Rashid, Elahe Ghasemi and Javad B.Ebrahimi | Entropic Weighted Rank Function | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is known that the entropy function over a set of jointly distributed
random variables is a submodular set function. However, not any submodular
function is of this form. In this paper, we consider a family of submodular set
functions, called weighted rank functions of matroids, and study the necessary
or sufficien... | [
{
"created": "Mon, 13 Jun 2022 08:32:12 GMT",
"version": "v1"
}
] | 2022-06-14 | [
[
"Rashid",
"Mohammad",
""
],
[
"Ghasemi",
"Elahe",
""
],
[
"Ebrahimi",
"Javad B.",
""
]
] | It is known that the entropy function over a set of jointly distributed random variables is a submodular set function. However, not any submodular function is of this form. In this paper, we consider a family of submodular set functions, called weighted rank functions of matroids, and study the necessary or sufficient ... |
2003.00003 | Klaus-Tycho Foerster | Utz Nisslmueller, Klaus-Tycho Foerster, Stefan Schmid, Christian
Decker | Toward Active and Passive Confidentiality Attacks On Cryptocurrency
Off-Chain Networks | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cryptocurrency off-chain networks such as Lightning (e.g., Bitcoin) or Raiden
(e.g., Ethereum) aim to increase the scalability of traditional on-chain
transactions. To support nodes in learning about possible paths to route their
transactions, these networks need to provide gossip and probing mechanisms.
This paper e... | [
{
"created": "Fri, 28 Feb 2020 08:56:08 GMT",
"version": "v1"
}
] | 2020-03-03 | [
[
"Nisslmueller",
"Utz",
""
],
[
"Foerster",
"Klaus-Tycho",
""
],
[
"Schmid",
"Stefan",
""
],
[
"Decker",
"Christian",
""
]
] | Cryptocurrency off-chain networks such as Lightning (e.g., Bitcoin) or Raiden (e.g., Ethereum) aim to increase the scalability of traditional on-chain transactions. To support nodes in learning about possible paths to route their transactions, these networks need to provide gossip and probing mechanisms. This paper exp... |
0805.0184 | Youngchul Sung | Youngchul Sung, H. Vincent Poor and Heejung Yu | Information, Energy and Density for Ad Hoc Sensor Networks over
Correlated Random Fields: Large Deviations Analysis | Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6 - 11, 2008 | null | 10.1109/ISIT.2008.4595256 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using large deviations results that characterize the amount of information
per node on a two-dimensional (2-D) lattice, asymptotic behavior of a sensor
network deployed over a correlated random field for statistical inference is
investigated. Under a 2-D hidden Gauss-Markov random field model with symmetric
first ord... | [
{
"created": "Fri, 2 May 2008 07:36:28 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Sung",
"Youngchul",
""
],
[
"Poor",
"H. Vincent",
""
],
[
"Yu",
"Heejung",
""
]
] | Using large deviations results that characterize the amount of information per node on a two-dimensional (2-D) lattice, asymptotic behavior of a sensor network deployed over a correlated random field for statistical inference is investigated. Under a 2-D hidden Gauss-Markov random field model with symmetric first order... |
1902.10898 | Ahmed Hareedy | Ahmed Hareedy, Robert Calderbank | LOCO Codes: Lexicographically-Ordered Constrained Codes | 17 pages (double column), 2 figures, accepted at the IEEE
Transactions on Information Theory (TIT), the short version was accepted at
the IEEE Information Theory Workshop (ITW), this version reflects comments
from reviewers at TIT and ITW | IEEE Transactions on Information Theory, vol. 66, no. 6, pp.
3572-3589, Jun. 2020 | 10.1109/TIT.2019.2943244 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Line codes make it possible to mitigate interference, to prevent short
pulses, and to generate streams of bipolar signals with no direct-current (DC)
power content through balancing. They find application in magnetic recording
(MR) devices, in Flash devices, in optical recording devices, and in some
computer standard... | [
{
"created": "Thu, 28 Feb 2019 05:22:33 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Mar 2019 19:44:15 GMT",
"version": "v2"
},
{
"created": "Wed, 26 Jun 2019 21:54:49 GMT",
"version": "v3"
},
{
"created": "Fri, 20 Sep 2019 05:26:09 GMT",
"version": "v4"
},
{
"c... | 2020-05-26 | [
[
"Hareedy",
"Ahmed",
""
],
[
"Calderbank",
"Robert",
""
]
] | Line codes make it possible to mitigate interference, to prevent short pulses, and to generate streams of bipolar signals with no direct-current (DC) power content through balancing. They find application in magnetic recording (MR) devices, in Flash devices, in optical recording devices, and in some computer standards.... |
2012.05766 | Antonio Rago | Emanuele Albini, Piyawat Lertvittayakumjorn, Antonio Rago and
Francesca Toni | Deep Argumentative Explanations | 16 pages, 10 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the recent, widespread focus on eXplainable AI (XAI), explanations
computed by XAI methods tend to provide little insight into the functioning of
Neural Networks (NNs). We propose a novel framework for obtaining (local)
explanations from NNs while providing transparency about their inner workings,
and show ho... | [
{
"created": "Thu, 10 Dec 2020 15:55:09 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Mar 2021 16:46:05 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Mar 2021 17:12:30 GMT",
"version": "v3"
},
{
"created": "Mon, 14 Jun 2021 12:29:14 GMT",
"version": "v4"
}
] | 2021-06-15 | [
[
"Albini",
"Emanuele",
""
],
[
"Lertvittayakumjorn",
"Piyawat",
""
],
[
"Rago",
"Antonio",
""
],
[
"Toni",
"Francesca",
""
]
] | Despite the recent, widespread focus on eXplainable AI (XAI), explanations computed by XAI methods tend to provide little insight into the functioning of Neural Networks (NNs). We propose a novel framework for obtaining (local) explanations from NNs while providing transparency about their inner workings, and show how ... |
2005.12175 | Guy Avni | Parand Alizadeh Alamdari, Guy Avni, Thomas A. Henzinger, Anna Lukina | Formal Methods with a Touch of Magic | Published in FMCAD 2020 | null | null | null | cs.LO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning and formal methods have complimentary benefits and
drawbacks. In this work, we address the controller-design problem with a
combination of techniques from both fields. The use of black-box neural
networks in deep reinforcement learning (deep RL) poses a challenge for such a
combination. Instead of re... | [
{
"created": "Mon, 25 May 2020 15:45:03 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Aug 2020 21:12:51 GMT",
"version": "v2"
}
] | 2020-08-26 | [
[
"Alamdari",
"Parand Alizadeh",
""
],
[
"Avni",
"Guy",
""
],
[
"Henzinger",
"Thomas A.",
""
],
[
"Lukina",
"Anna",
""
]
] | Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reas... |
1609.07672 | Roy Fox | Roy Fox | Information-Theoretic Methods for Planning and Learning in Partially
Observable Markov Decision Processes | PhD thesis, Hebrew University of Jerusalem, 9/2016 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bounded agents are limited by intrinsic constraints on their ability to
process information that is available in their sensors and memory and choose
actions and memory updates. In this dissertation, we model these constraints as
information-rate constraints on communication channels connecting these various
internal ... | [
{
"created": "Sat, 24 Sep 2016 20:45:37 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Mar 2017 04:57:49 GMT",
"version": "v2"
}
] | 2017-03-31 | [
[
"Fox",
"Roy",
""
]
] | Bounded agents are limited by intrinsic constraints on their ability to process information that is available in their sensors and memory and choose actions and memory updates. In this dissertation, we model these constraints as information-rate constraints on communication channels connecting these various internal co... |
2108.10755 | Jin Cheevaprawatdomrong | Jin Cheevaprawatdomrong, Alexandra Schofield, Attapol T. Rutherford | More Than Words: Collocation Tokenization for Latent Dirichlet
Allocation Models | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Traditionally, Latent Dirichlet Allocation (LDA) ingests words in a
collection of documents to discover their latent topics using word-document
co-occurrences. However, it is unclear how to achieve the best results for
languages without marked word boundaries such as Chinese and Thai. Here, we
explore the use of Pear... | [
{
"created": "Tue, 24 Aug 2021 14:08:19 GMT",
"version": "v1"
}
] | 2021-08-25 | [
[
"Cheevaprawatdomrong",
"Jin",
""
],
[
"Schofield",
"Alexandra",
""
],
[
"Rutherford",
"Attapol T.",
""
]
] | Traditionally, Latent Dirichlet Allocation (LDA) ingests words in a collection of documents to discover their latent topics using word-document co-occurrences. However, it is unclear how to achieve the best results for languages without marked word boundaries such as Chinese and Thai. Here, we explore the use of Pearso... |
1811.00907 | Ilia Kulikov | Ilia Kulikov, Alexander H. Miller, Kyunghyun Cho, Jason Weston | Importance of Search and Evaluation Strategies in Neural Dialogue
Modeling | iNLG 2019 camera ready version | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the impact of search strategies in neural dialogue modeling.
We first compare two standard search algorithms, greedy and beam search, as
well as our newly proposed iterative beam search which produces a more diverse
set of candidate responses. We evaluate these strategies in realistic full
conversation... | [
{
"created": "Fri, 2 Nov 2018 14:54:50 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Dec 2018 10:11:54 GMT",
"version": "v2"
},
{
"created": "Sun, 3 Nov 2019 11:21:56 GMT",
"version": "v3"
}
] | 2019-11-05 | [
[
"Kulikov",
"Ilia",
""
],
[
"Miller",
"Alexander H.",
""
],
[
"Cho",
"Kyunghyun",
""
],
[
"Weston",
"Jason",
""
]
] | We investigate the impact of search strategies in neural dialogue modeling. We first compare two standard search algorithms, greedy and beam search, as well as our newly proposed iterative beam search which produces a more diverse set of candidate responses. We evaluate these strategies in realistic full conversations ... |
2005.04093 | Aleks Ontman | Joshua Porter, Aleks Ontman | Importing Relationships into a Running Graph Database Using Parallel
Processing | 5 pages, code provided on GitHub
https://github.com/Lnofeisone/graph-iterateRelationship | null | null | null | cs.DC cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Importing relationships into a running graph database using multiple threads
running concurrently is a difficult task, as multiple threads cannot write
information to the same node at the same time. Here we present an algorithm in
which relationships are sorted into bins, then imported such that no two
threads ever a... | [
{
"created": "Tue, 5 May 2020 14:31:29 GMT",
"version": "v1"
}
] | 2020-05-11 | [
[
"Porter",
"Joshua",
""
],
[
"Ontman",
"Aleks",
""
]
] | Importing relationships into a running graph database using multiple threads running concurrently is a difficult task, as multiple threads cannot write information to the same node at the same time. Here we present an algorithm in which relationships are sorted into bins, then imported such that no two threads ever acc... |
2305.13021 | Ambre Davat | Ambre Davat (GIPSA-PCMD,LIG), V\'eronique Auberg\'e (LIG), Gang Feng
(GIPSA-lab) | Can we hear physical and social space together through prosody? | null | Speech Prosody 2020, May 2020, Tokyo, Japan. pp.715-719 | 10.21437/SpeechProsody.2020-146 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When human listeners try to guess the spatial position of a speech source,
they are influenced by the speaker's production level, regardless of the
intensity level reaching their ears. Because the perception of distance is a
very difficult task, they rely on their own experience, which tells them that a
whispering ta... | [
{
"created": "Mon, 22 May 2023 13:25:01 GMT",
"version": "v1"
}
] | 2023-05-23 | [
[
"Davat",
"Ambre",
"",
"GIPSA-PCMD,LIG"
],
[
"Aubergé",
"Véronique",
"",
"LIG"
],
[
"Feng",
"Gang",
"",
"GIPSA-lab"
]
] | When human listeners try to guess the spatial position of a speech source, they are influenced by the speaker's production level, regardless of the intensity level reaching their ears. Because the perception of distance is a very difficult task, they rely on their own experience, which tells them that a whispering talk... |
2004.13839 | Louis Falissard | Louis Falissard, Claire Morgand, Sylvie Roussel, Claire Imbaud, Walid
Ghosn, Karim Bounebache, Gr\'egoire Rey | Neural translation and automated recognition of ICD10 medical entities
from natural language | null | null | null | null | cs.CL cs.CY cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recognition of medical entities from natural language is an ubiquitous
problem in the medical field, with applications ranging from medical act coding
to the analysis of electronic health data for public health. It is however a
complex task usually requiring human expert intervention, thus making it
expansive and... | [
{
"created": "Fri, 27 Mar 2020 18:17:53 GMT",
"version": "v1"
},
{
"created": "Wed, 6 May 2020 10:30:24 GMT",
"version": "v2"
}
] | 2020-05-07 | [
[
"Falissard",
"Louis",
""
],
[
"Morgand",
"Claire",
""
],
[
"Roussel",
"Sylvie",
""
],
[
"Imbaud",
"Claire",
""
],
[
"Ghosn",
"Walid",
""
],
[
"Bounebache",
"Karim",
""
],
[
"Rey",
"Grégoire",
""
]
] | The recognition of medical entities from natural language is an ubiquitous problem in the medical field, with applications ranging from medical act coding to the analysis of electronic health data for public health. It is however a complex task usually requiring human expert intervention, thus making it expansive and t... |
2203.09446 | Fabian Bongratz | Fabian Bongratz, Anne-Marie Rickmann, Sebastian P\"olsterl, Christian
Wachinger | Vox2Cortex: Fast Explicit Reconstruction of Cortical Surfaces from 3D
MRI Scans with Geometric Deep Neural Networks | Accepted at CVPR 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The reconstruction of cortical surfaces from brain magnetic resonance imaging
(MRI) scans is essential for quantitative analyses of cortical thickness and
sulcal morphology. Although traditional and deep learning-based algorithmic
pipelines exist for this purpose, they have two major drawbacks: lengthy
runtimes of mu... | [
{
"created": "Thu, 17 Mar 2022 17:06:00 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Mar 2022 11:10:19 GMT",
"version": "v2"
}
] | 2022-03-21 | [
[
"Bongratz",
"Fabian",
""
],
[
"Rickmann",
"Anne-Marie",
""
],
[
"Pölsterl",
"Sebastian",
""
],
[
"Wachinger",
"Christian",
""
]
] | The reconstruction of cortical surfaces from brain magnetic resonance imaging (MRI) scans is essential for quantitative analyses of cortical thickness and sulcal morphology. Although traditional and deep learning-based algorithmic pipelines exist for this purpose, they have two major drawbacks: lengthy runtimes of mult... |
1812.03219 | Aaron Springer | Aaron Springer, Victoria Hollis, Steve Whittaker | Dice in the Black Box: User Experiences with an Inscrutable Algorithm | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We demonstrate that users may be prone to place an inordinate amount of trust
in black box algorithms that are framed as intelligent. We deploy an algorithm
that purportedly assesses the positivity and negativity of a users' writing
emotional writing. In actuality, the algorithm responds in a random fashion. We
quali... | [
{
"created": "Fri, 7 Dec 2018 21:37:49 GMT",
"version": "v1"
}
] | 2018-12-11 | [
[
"Springer",
"Aaron",
""
],
[
"Hollis",
"Victoria",
""
],
[
"Whittaker",
"Steve",
""
]
] | We demonstrate that users may be prone to place an inordinate amount of trust in black box algorithms that are framed as intelligent. We deploy an algorithm that purportedly assesses the positivity and negativity of a users' writing emotional writing. In actuality, the algorithm responds in a random fashion. We qualita... |
2008.00188 | Shihao Xu | Haocong Rao, Shihao Xu, Xiping Hu, Jun Cheng, Bin Hu | Augmented Skeleton Based Contrastive Action Learning with Momentum LSTM
for Unsupervised Action Recognition | Accepted by Information Sciences. Our codes are available at
https://github.com/Mikexu007/AS-CAL | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Action recognition via 3D skeleton data is an emerging important topic in
these years. Most existing methods either extract hand-crafted descriptors or
learn action representations by supervised learning paradigms that require
massive labeled data. In this paper, we for the first time propose a
contrastive action lea... | [
{
"created": "Sat, 1 Aug 2020 06:37:57 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Aug 2020 01:32:35 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Aug 2020 13:14:59 GMT",
"version": "v3"
},
{
"created": "Fri, 2 Apr 2021 08:14:45 GMT",
"version": "v4"
}
] | 2021-04-05 | [
[
"Rao",
"Haocong",
""
],
[
"Xu",
"Shihao",
""
],
[
"Hu",
"Xiping",
""
],
[
"Cheng",
"Jun",
""
],
[
"Hu",
"Bin",
""
]
] | Action recognition via 3D skeleton data is an emerging important topic in these years. Most existing methods either extract hand-crafted descriptors or learn action representations by supervised learning paradigms that require massive labeled data. In this paper, we for the first time propose a contrastive action learn... |
2211.10030 | Qinggang Zhang | Qinggang Zhang, Junnan Dong, Keyu Duan, Xiao Huang, Yezi Liu, Linchuan
Xu | Contrastive Knowledge Graph Error Detection | null | CIKM 2022: Proceedings of the 31st ACM International Conference on
Information & Knowledge Management | 10.1145/3511808.3557264 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge Graph (KG) errors introduce non-negligible noise, severely
affecting KG-related downstream tasks. Detecting errors in KGs is challenging
since the patterns of errors are unknown and diverse, while ground-truth labels
are rare or even unavailable. A traditional solution is to construct logical
rules to verif... | [
{
"created": "Fri, 18 Nov 2022 05:01:19 GMT",
"version": "v1"
}
] | 2022-11-21 | [
[
"Zhang",
"Qinggang",
""
],
[
"Dong",
"Junnan",
""
],
[
"Duan",
"Keyu",
""
],
[
"Huang",
"Xiao",
""
],
[
"Liu",
"Yezi",
""
],
[
"Xu",
"Linchuan",
""
]
] | Knowledge Graph (KG) errors introduce non-negligible noise, severely affecting KG-related downstream tasks. Detecting errors in KGs is challenging since the patterns of errors are unknown and diverse, while ground-truth labels are rare or even unavailable. A traditional solution is to construct logical rules to verify ... |
1905.06668 | Achim Blumensath | Achim Blumensath and Felix Wolf | Bisimulation Invariant Monadic-Second Order Logic in the Finite | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider bisimulation-invariant monadic second-order logic over various
classes of finite transition systems. We present several combinatorial
characterisations of when the expressive power of this fragment coincides with
that of the modal mu-calculus. Using these characterisations we prove for some
simple classes... | [
{
"created": "Thu, 16 May 2019 11:37:41 GMT",
"version": "v1"
}
] | 2019-05-17 | [
[
"Blumensath",
"Achim",
""
],
[
"Wolf",
"Felix",
""
]
] | We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the modal mu-calculus. Using these characterisations we prove for some simple classes o... |
2311.05050 | Wanda Hou | Wanda Hou, Miao Li, Yi-Zhuang You | Quantum Generative Modeling of Sequential Data with Trainable Token
Embedding | 5 pages, 4 figures | null | null | null | cs.LG quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative models are a class of machine learning models that aim to learn
the underlying probability distribution of data. Unlike discriminative models,
generative models focus on capturing the data's inherent structure, allowing
them to generate new samples that resemble the original data. To fully exploit
the pote... | [
{
"created": "Wed, 8 Nov 2023 22:56:37 GMT",
"version": "v1"
}
] | 2023-11-14 | [
[
"Hou",
"Wanda",
""
],
[
"Li",
"Miao",
""
],
[
"You",
"Yi-Zhuang",
""
]
] | Generative models are a class of machine learning models that aim to learn the underlying probability distribution of data. Unlike discriminative models, generative models focus on capturing the data's inherent structure, allowing them to generate new samples that resemble the original data. To fully exploit the potent... |
2407.19451 | Chengan He | Chengan He, Xin Sun, Zhixin Shu, Fujun Luan, S\"oren Pirk, Jorge
Alejandro Amador Herrera, Dominik L. Michels, Tuanfeng Y. Wang, Meng Zhang,
Holly Rushmeier, Yi Zhou | Perm: A Parametric Representation for Multi-Style 3D Hair Modeling | Project page: https://cs.yale.edu/homes/che/projects/perm/ | null | null | null | cs.CV cs.GR | http://creativecommons.org/licenses/by/4.0/ | We present Perm, a learned parametric model of human 3D hair designed to
facilitate various hair-related applications. Unlike previous work that jointly
models the global hair shape and local strand details, we propose to
disentangle them using a PCA-based strand representation in the frequency
domain, thereby allowi... | [
{
"created": "Sun, 28 Jul 2024 10:05:11 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Jul 2024 04:10:53 GMT",
"version": "v2"
},
{
"created": "Thu, 8 Aug 2024 04:01:03 GMT",
"version": "v3"
}
] | 2024-08-09 | [
[
"He",
"Chengan",
""
],
[
"Sun",
"Xin",
""
],
[
"Shu",
"Zhixin",
""
],
[
"Luan",
"Fujun",
""
],
[
"Pirk",
"Sören",
""
],
[
"Herrera",
"Jorge Alejandro Amador",
""
],
[
"Michels",
"Dominik L.",
""
],
[
... | We present Perm, a learned parametric model of human 3D hair designed to facilitate various hair-related applications. Unlike previous work that jointly models the global hair shape and local strand details, we propose to disentangle them using a PCA-based strand representation in the frequency domain, thereby allowing... |
1410.3688 | Khammassi Iyed Mr | Iyed Khammassi, Rachid Elazouzi, Majed Haddad and Issam Mabrouki | A Game Theoretic Model for Network Virus Protection | Technical report, 8 pages, 10 figures | null | null | null | cs.GT cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The network virus propagation is influenced by various factors, and some of
them are neglected in most of the existed models in the literature. In this
paper, we study the network virus propagation based on the the epidemiological
viewpoint. We assume that nodes can be equipped with protection against virus
and the s... | [
{
"created": "Tue, 14 Oct 2014 13:37:45 GMT",
"version": "v1"
}
] | 2014-10-15 | [
[
"Khammassi",
"Iyed",
""
],
[
"Elazouzi",
"Rachid",
""
],
[
"Haddad",
"Majed",
""
],
[
"Mabrouki",
"Issam",
""
]
] | The network virus propagation is influenced by various factors, and some of them are neglected in most of the existed models in the literature. In this paper, we study the network virus propagation based on the the epidemiological viewpoint. We assume that nodes can be equipped with protection against virus and the sec... |
2107.08909 | Takayuki Miura | Takayuki Miura, Satoshi Hasegawa, Toshiki Shibahara | MEGEX: Data-Free Model Extraction Attack against Gradient-Based
Explainable AI | 10 pages, 5 figures | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | The advance of explainable artificial intelligence, which provides reasons
for its predictions, is expected to accelerate the use of deep neural networks
in the real world like Machine Learning as a Service (MLaaS) that returns
predictions on queried data with the trained model. Deep neural networks
deployed in MLaaS... | [
{
"created": "Mon, 19 Jul 2021 14:25:06 GMT",
"version": "v1"
}
] | 2021-07-20 | [
[
"Miura",
"Takayuki",
""
],
[
"Hasegawa",
"Satoshi",
""
],
[
"Shibahara",
"Toshiki",
""
]
] | The advance of explainable artificial intelligence, which provides reasons for its predictions, is expected to accelerate the use of deep neural networks in the real world like Machine Learning as a Service (MLaaS) that returns predictions on queried data with the trained model. Deep neural networks deployed in MLaaS f... |
2005.03358 | Feitong Tan | Feitong Tan, Hao Zhu, Zhaopeng Cui, Siyu Zhu, Marc Pollefeys, Ping Tan | Self-Supervised Human Depth Estimation from Monocular Videos | Accepted by IEEE Conference on Computer Vision and Patten Recognition
(CVPR), 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Previous methods on estimating detailed human depth often require supervised
training with `ground truth' depth data. This paper presents a self-supervised
method that can be trained on YouTube videos without known depth, which makes
training data collection simple and improves the generalization of the learned
netwo... | [
{
"created": "Thu, 7 May 2020 09:45:11 GMT",
"version": "v1"
}
] | 2020-05-08 | [
[
"Tan",
"Feitong",
""
],
[
"Zhu",
"Hao",
""
],
[
"Cui",
"Zhaopeng",
""
],
[
"Zhu",
"Siyu",
""
],
[
"Pollefeys",
"Marc",
""
],
[
"Tan",
"Ping",
""
]
] | Previous methods on estimating detailed human depth often require supervised training with `ground truth' depth data. This paper presents a self-supervised method that can be trained on YouTube videos without known depth, which makes training data collection simple and improves the generalization of the learned network... |
2107.05582 | Ilias Diakonikolas | Ilias Diakonikolas and Daniel M. Kane and Christos Tzamos | Forster Decomposition and Learning Halfspaces with Noise | null | null | null | null | cs.LG cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Forster transform is an operation that turns a distribution into one with
good anti-concentration properties. While a Forster transform does not always
exist, we show that any distribution can be efficiently decomposed as a
disjoint mixture of few distributions for which a Forster transform exists and
can be comput... | [
{
"created": "Mon, 12 Jul 2021 17:00:59 GMT",
"version": "v1"
}
] | 2021-07-13 | [
[
"Diakonikolas",
"Ilias",
""
],
[
"Kane",
"Daniel M.",
""
],
[
"Tzamos",
"Christos",
""
]
] | A Forster transform is an operation that turns a distribution into one with good anti-concentration properties. While a Forster transform does not always exist, we show that any distribution can be efficiently decomposed as a disjoint mixture of few distributions for which a Forster transform exists and can be computed... |
2212.08665 | Yue Liu | Yue Liu, Xihong Yang, Sihang Zhou, Xinwang Liu, Zhen Wang, Ke Liang,
Wenxuan Tu, Liang Li, Jingcan Duan, Cancan Chen | Hard Sample Aware Network for Contrastive Deep Graph Clustering | add appendix | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contrastive deep graph clustering, which aims to divide nodes into disjoint
groups via contrastive mechanisms, is a challenging research spot. Among the
recent works, hard sample mining-based algorithms have achieved great attention
for their promising performance. However, we find that the existing hard sample
minin... | [
{
"created": "Fri, 16 Dec 2022 16:57:37 GMT",
"version": "v1"
},
{
"created": "Sun, 25 Dec 2022 05:33:18 GMT",
"version": "v2"
},
{
"created": "Sat, 28 Jan 2023 09:25:10 GMT",
"version": "v3"
}
] | 2023-01-31 | [
[
"Liu",
"Yue",
""
],
[
"Yang",
"Xihong",
""
],
[
"Zhou",
"Sihang",
""
],
[
"Liu",
"Xinwang",
""
],
[
"Wang",
"Zhen",
""
],
[
"Liang",
"Ke",
""
],
[
"Tu",
"Wenxuan",
""
],
[
"Li",
"Liang",
""
... | Contrastive deep graph clustering, which aims to divide nodes into disjoint groups via contrastive mechanisms, is a challenging research spot. Among the recent works, hard sample mining-based algorithms have achieved great attention for their promising performance. However, we find that the existing hard sample mining ... |
2110.09974 | Meirui Jiang | Meirui Jiang, Xiaoxiao Li, Xiaofei Zhang, Michael Kamp, Qi Dou | UniFed: A Unified Framework for Federated Learning on Non-IID Image
Features | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How to tackle non-iid data is a crucial topic in federated learning. This
challenging problem not only affects training process, but also harms
performance of clients not participating in training. Existing literature
mainly focuses on either side, yet still lacks a unified solution to handle
these two types (interna... | [
{
"created": "Tue, 19 Oct 2021 13:46:37 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Dec 2021 13:32:55 GMT",
"version": "v2"
},
{
"created": "Wed, 15 Feb 2023 08:00:50 GMT",
"version": "v3"
}
] | 2023-02-17 | [
[
"Jiang",
"Meirui",
""
],
[
"Li",
"Xiaoxiao",
""
],
[
"Zhang",
"Xiaofei",
""
],
[
"Kamp",
"Michael",
""
],
[
"Dou",
"Qi",
""
]
] | How to tackle non-iid data is a crucial topic in federated learning. This challenging problem not only affects training process, but also harms performance of clients not participating in training. Existing literature mainly focuses on either side, yet still lacks a unified solution to handle these two types (internal ... |
2002.00118 | Xingzhe He | Xingzhe He, Helen Lu Cao, Bo Zhu | AdvectiveNet: An Eulerian-Lagrangian Fluidic reservoir for Point Cloud
Processing | ICLR 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel physics-inspired deep learning approach for point
cloud processing motivated by the natural flow phenomena in fluid mechanics.
Our learning architecture jointly defines data in an Eulerian world space,
using a static background grid, and a Lagrangian material space, using moving
particles.... | [
{
"created": "Sat, 1 Feb 2020 01:21:05 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Feb 2020 01:33:56 GMT",
"version": "v2"
},
{
"created": "Wed, 24 Jun 2020 19:44:09 GMT",
"version": "v3"
}
] | 2020-06-26 | [
[
"He",
"Xingzhe",
""
],
[
"Cao",
"Helen Lu",
""
],
[
"Zhu",
"Bo",
""
]
] | This paper presents a novel physics-inspired deep learning approach for point cloud processing motivated by the natural flow phenomena in fluid mechanics. Our learning architecture jointly defines data in an Eulerian world space, using a static background grid, and a Lagrangian material space, using moving particles. B... |
2408.03603 | Jiahao Zhang | Jiahao Zhang, Zilong Wang, Ruofan Wang, Xingjun Ma and Yu-Gang Jiang | EnJa: Ensemble Jailbreak on Large Language Models | null | null | null | null | cs.CR cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As Large Language Models (LLMs) are increasingly being deployed in
safety-critical applications, their vulnerability to potential jailbreaks --
malicious prompts that can disable the safety mechanism of LLMs -- has
attracted growing research attention. While alignment methods have been
proposed to protect LLMs from j... | [
{
"created": "Wed, 7 Aug 2024 07:46:08 GMT",
"version": "v1"
}
] | 2024-08-08 | [
[
"Zhang",
"Jiahao",
""
],
[
"Wang",
"Zilong",
""
],
[
"Wang",
"Ruofan",
""
],
[
"Ma",
"Xingjun",
""
],
[
"Jiang",
"Yu-Gang",
""
]
] | As Large Language Models (LLMs) are increasingly being deployed in safety-critical applications, their vulnerability to potential jailbreaks -- malicious prompts that can disable the safety mechanism of LLMs -- has attracted growing research attention. While alignment methods have been proposed to protect LLMs from jai... |
2002.03830 | David W. Romero | David W. Romero, Erik J. Bekkers, Jakub M. Tomczak, Mark Hoogendoorn | Attentive Group Equivariant Convolutional Networks | Proceedings of the 37th International Conference on Machine Learning
(ICML), 2020 | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although group convolutional networks are able to learn powerful
representations based on symmetry patterns, they lack explicit means to learn
meaningful relationships among them (e.g., relative positions and poses). In
this paper, we present attentive group equivariant convolutions, a
generalization of the group con... | [
{
"created": "Fri, 7 Feb 2020 14:06:24 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Feb 2020 12:34:17 GMT",
"version": "v2"
},
{
"created": "Tue, 30 Jun 2020 07:41:35 GMT",
"version": "v3"
}
] | 2020-07-01 | [
[
"Romero",
"David W.",
""
],
[
"Bekkers",
"Erik J.",
""
],
[
"Tomczak",
"Jakub M.",
""
],
[
"Hoogendoorn",
"Mark",
""
]
] | Although group convolutional networks are able to learn powerful representations based on symmetry patterns, they lack explicit means to learn meaningful relationships among them (e.g., relative positions and poses). In this paper, we present attentive group equivariant convolutions, a generalization of the group convo... |
2302.09688 | Daniel Karl I. Weidele | Daniel Karl I. Weidele, Shazia Afzal, Abel N. Valente, Cole Makuch,
Owen Cornec, Long Vu, Dharmashankar Subramanian, Werner Geyer, Rahul Nair,
Inge Vejsbjerg, Radu Marinescu, Paulito Palmes, Elizabeth M. Daly, Loraine
Franke, Daniel Haehn | AutoDOViz: Human-Centered Automation for Decision Optimization | null | null | 10.1145/3581641.3584094 | null | cs.HC cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We present AutoDOViz, an interactive user interface for automated decision
optimization (AutoDO) using reinforcement learning (RL). Decision optimization
(DO) has classically being practiced by dedicated DO researchers where experts
need to spend long periods of time fine tuning a solution through
trial-and-error. Au... | [
{
"created": "Sun, 19 Feb 2023 23:06:19 GMT",
"version": "v1"
}
] | 2023-02-21 | [
[
"Weidele",
"Daniel Karl I.",
""
],
[
"Afzal",
"Shazia",
""
],
[
"Valente",
"Abel N.",
""
],
[
"Makuch",
"Cole",
""
],
[
"Cornec",
"Owen",
""
],
[
"Vu",
"Long",
""
],
[
"Subramanian",
"Dharmashankar",
""
]... | We present AutoDOViz, an interactive user interface for automated decision optimization (AutoDO) using reinforcement learning (RL). Decision optimization (DO) has classically being practiced by dedicated DO researchers where experts need to spend long periods of time fine tuning a solution through trial-and-error. Auto... |
2206.12055 | Peng-Shuai Wang | Xin-Yang Zheng and Yang Liu and Peng-Shuai Wang and Xin Tong | SDF-StyleGAN: Implicit SDF-Based StyleGAN for 3D Shape Generation | Accepted to Computer Graphics Forum (SGP), 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a StyleGAN2-based deep learning approach for 3D shape generation,
called SDF-StyleGAN, with the aim of reducing visual and geometric
dissimilarity between generated shapes and a shape collection. We extend
StyleGAN2 to 3D generation and utilize the implicit signed distance function
(SDF) as the 3D shape re... | [
{
"created": "Fri, 24 Jun 2022 03:11:28 GMT",
"version": "v1"
}
] | 2022-06-27 | [
[
"Zheng",
"Xin-Yang",
""
],
[
"Liu",
"Yang",
""
],
[
"Wang",
"Peng-Shuai",
""
],
[
"Tong",
"Xin",
""
]
] | We present a StyleGAN2-based deep learning approach for 3D shape generation, called SDF-StyleGAN, with the aim of reducing visual and geometric dissimilarity between generated shapes and a shape collection. We extend StyleGAN2 to 3D generation and utilize the implicit signed distance function (SDF) as the 3D shape repr... |
2308.07162 | David Guillermo Fajardo Ortiz Dr. | David Fajardo-Ortiz, Bart Thijs, Wolfgang Glanzel, Karin R. Sipido | Evolution of priorities in strategic funding for collaborative health
research. A comparison of the European Union Framework Programmes to the
program funding by the United States National Institutes of Health | null | null | null | null | cs.DL | http://creativecommons.org/licenses/by/4.0/ | The historical research-funding model, based on the curiosity and academic
interests of researchers, is giving way to new strategic funding models that
seek to meet societal needs. We investigated the impact of this trend on health
research funded by the two leading funding bodies worldwide, i.e. the National
Institu... | [
{
"created": "Mon, 14 Aug 2023 14:17:34 GMT",
"version": "v1"
}
] | 2023-08-15 | [
[
"Fajardo-Ortiz",
"David",
""
],
[
"Thijs",
"Bart",
""
],
[
"Glanzel",
"Wolfgang",
""
],
[
"Sipido",
"Karin R.",
""
]
] | The historical research-funding model, based on the curiosity and academic interests of researchers, is giving way to new strategic funding models that seek to meet societal needs. We investigated the impact of this trend on health research funded by the two leading funding bodies worldwide, i.e. the National Institute... |
2404.01869 | Philipp Mondorf | Philipp Mondorf and Barbara Plank | Beyond Accuracy: Evaluating the Reasoning Behavior of Large Language
Models -- A Survey | COLM 2024, 27 pages, 2 figures | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | Large language models (LLMs) have recently shown impressive performance on
tasks involving reasoning, leading to a lively debate on whether these models
possess reasoning capabilities similar to humans. However, despite these
successes, the depth of LLMs' reasoning abilities remains uncertain. This
uncertainty partly... | [
{
"created": "Tue, 2 Apr 2024 11:46:31 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Aug 2024 11:58:53 GMT",
"version": "v2"
}
] | 2024-08-07 | [
[
"Mondorf",
"Philipp",
""
],
[
"Plank",
"Barbara",
""
]
] | Large language models (LLMs) have recently shown impressive performance on tasks involving reasoning, leading to a lively debate on whether these models possess reasoning capabilities similar to humans. However, despite these successes, the depth of LLMs' reasoning abilities remains uncertain. This uncertainty partly s... |
2403.09634 | Lingyi Hong | Lingyi Hong, Shilin Yan, Renrui Zhang, Wanyun Li, Xinyu Zhou, Pinxue
Guo, Kaixun Jiang, Yiting Chen, Jinglun Li, Zhaoyu Chen, Wenqiang Zhang | OneTracker: Unifying Visual Object Tracking with Foundation Models and
Efficient Tuning | Accepted to CVPR 2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual object tracking aims to localize the target object of each frame based
on its initial appearance in the first frame. Depending on the input modility,
tracking tasks can be divided into RGB tracking and RGB+X (e.g. RGB+N, and
RGB+D) tracking. Despite the different input modalities, the core aspect of
tracking i... | [
{
"created": "Thu, 14 Mar 2024 17:59:13 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Hong",
"Lingyi",
""
],
[
"Yan",
"Shilin",
""
],
[
"Zhang",
"Renrui",
""
],
[
"Li",
"Wanyun",
""
],
[
"Zhou",
"Xinyu",
""
],
[
"Guo",
"Pinxue",
""
],
[
"Jiang",
"Kaixun",
""
],
[
"Chen",
"Yiting... | Visual object tracking aims to localize the target object of each frame based on its initial appearance in the first frame. Depending on the input modility, tracking tasks can be divided into RGB tracking and RGB+X (e.g. RGB+N, and RGB+D) tracking. Despite the different input modalities, the core aspect of tracking is ... |
1306.0195 | Prateek Dewan | Prateek Dewan, Niharika Sachdeva, Mayank Gupta, Ponnurangam Kumaraguru | ChaMAILeon: Exploring the Usability of a Privacy Preserving Email
Sharing System | 12 pages without references and appendices | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While passwords, by definition, are meant to be secret, recent trends have
witnessed an increasing number of people sharing their email passwords with
friends, colleagues, and significant others. However, leading websites like
Google advise their users not to share their passwords with anyone, to avoid
security and p... | [
{
"created": "Sun, 2 Jun 2013 11:23:27 GMT",
"version": "v1"
}
] | 2013-06-04 | [
[
"Dewan",
"Prateek",
""
],
[
"Sachdeva",
"Niharika",
""
],
[
"Gupta",
"Mayank",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] | While passwords, by definition, are meant to be secret, recent trends have witnessed an increasing number of people sharing their email passwords with friends, colleagues, and significant others. However, leading websites like Google advise their users not to share their passwords with anyone, to avoid security and pri... |
1502.04868 | Rafael Boloix-Tortosa | Rafael Boloix-Tortosa, F. Javier Pay\'an-Somet, Eva Arias-de-Reyna and
Juan Jos\'e Murillo-Fuentes | Proper Complex Gaussian Processes for Regression | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Complex-valued signals are used in the modeling of many systems in
engineering and science, hence being of fundamental interest. Often, random
complex-valued signals are considered to be proper. A proper complex random
variable or process is uncorrelated with its complex conjugate. This assumption
is a good model of ... | [
{
"created": "Tue, 17 Feb 2015 11:59:44 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Feb 2015 09:33:34 GMT",
"version": "v2"
}
] | 2015-02-19 | [
[
"Boloix-Tortosa",
"Rafael",
""
],
[
"Payán-Somet",
"F. Javier",
""
],
[
"Arias-de-Reyna",
"Eva",
""
],
[
"Murillo-Fuentes",
"Juan José",
""
]
] | Complex-valued signals are used in the modeling of many systems in engineering and science, hence being of fundamental interest. Often, random complex-valued signals are considered to be proper. A proper complex random variable or process is uncorrelated with its complex conjugate. This assumption is a good model of th... |
cs/0404047 | Gianluca Argentini | Gianluca Argentini | Using matrices in post-processing phase of CFD simulations | Paper based on presentation-talk at SCICOMP9, Bologna (Italy), March
23-26, 2004; workshop organized by IBM, CINECA (Italy) (dr. Sigismondo
Boschi, dr. Giovanni Erbacci), NERSC-DOE (USA) (dr. David Skinner), web site:
www.spscicomp.org ; main topics: Computational Fluid Dynamics | Progress in Industrial Mathematics at ECMI 2004 - Eindhoven
(Netherlands), Springer, 2005 | null | null | cs.NA cs.DC physics.comp-ph | null | In this work I present a technique of construction and fast evaluation of a
family of cubic polynomials for analytic smoothing and graphical rendering of
particles trajectories for flows in a generic geometry. The principal result of
the work was implementation and test of a method for interpolating 3D points by
regu... | [
{
"created": "Thu, 22 Apr 2004 15:33:52 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Argentini",
"Gianluca",
""
]
] | In this work I present a technique of construction and fast evaluation of a family of cubic polynomials for analytic smoothing and graphical rendering of particles trajectories for flows in a generic geometry. The principal result of the work was implementation and test of a method for interpolating 3D points by regula... |
2010.12532 | Nicole Peinelt | Nicole Peinelt, Marek Rei and Maria Liakata | GiBERT: Introducing Linguistic Knowledge into BERT through a Lightweight
Gated Injection Method | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large pre-trained language models such as BERT have been the driving force
behind recent improvements across many NLP tasks. However, BERT is only trained
to predict missing words - either behind masks or in the next sentence - and
has no knowledge of lexical, syntactic or semantic information beyond what it
picks up... | [
{
"created": "Fri, 23 Oct 2020 17:00:26 GMT",
"version": "v1"
}
] | 2020-10-26 | [
[
"Peinelt",
"Nicole",
""
],
[
"Rei",
"Marek",
""
],
[
"Liakata",
"Maria",
""
]
] | Large pre-trained language models such as BERT have been the driving force behind recent improvements across many NLP tasks. However, BERT is only trained to predict missing words - either behind masks or in the next sentence - and has no knowledge of lexical, syntactic or semantic information beyond what it picks up t... |
2404.16748 | Junting Dong | Junting Dong, Qi Fang, Zehuan Huang, Xudong Xu, Jingbo Wang, Sida
Peng, Bo Dai | TELA: Text to Layer-wise 3D Clothed Human Generation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the task of 3D clothed human generation from textural
descriptions. Previous works usually encode the human body and clothes as a
holistic model and generate the whole model in a single-stage optimization,
which makes them struggle for clothing editing and meanwhile lose fine-grained
control over... | [
{
"created": "Thu, 25 Apr 2024 17:05:38 GMT",
"version": "v1"
}
] | 2024-04-26 | [
[
"Dong",
"Junting",
""
],
[
"Fang",
"Qi",
""
],
[
"Huang",
"Zehuan",
""
],
[
"Xu",
"Xudong",
""
],
[
"Wang",
"Jingbo",
""
],
[
"Peng",
"Sida",
""
],
[
"Dai",
"Bo",
""
]
] | This paper addresses the task of 3D clothed human generation from textural descriptions. Previous works usually encode the human body and clothes as a holistic model and generate the whole model in a single-stage optimization, which makes them struggle for clothing editing and meanwhile lose fine-grained control over t... |
1401.3582 | Xiaomin Bao | Xiaomin Bao | The equivalent identities of the MacWilliams identity for linear codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We use derivatives to prove the equivalences between MacWilliams identity and
its four equivalent forms, and present new interpretations for the four
equivalent forms. Our results explicitly give out the relationships between
MacWilliams identity and its four equivalent forms.
| [
{
"created": "Mon, 23 Dec 2013 13:19:42 GMT",
"version": "v1"
},
{
"created": "Sat, 8 Feb 2014 07:47:47 GMT",
"version": "v2"
}
] | 2014-02-11 | [
[
"Bao",
"Xiaomin",
""
]
] | We use derivatives to prove the equivalences between MacWilliams identity and its four equivalent forms, and present new interpretations for the four equivalent forms. Our results explicitly give out the relationships between MacWilliams identity and its four equivalent forms. |
1603.08878 | Alexander Barg | Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, and Robert
Calderbank | Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of
cyclic codes | 12pp., submitted for publication. An extended abstract of this
submission was posted earlier as arXiv:1502.01414 and was published in
Proceedings of the 2015 IEEE International Symposium on Information Theory,
Hong Kong, China, June 14-19, 2015, pp. 1262--1266 | International Journal of Information and Coding Theory, vol. 3,
no. 4, pp.345-364 (2016) | 10.1504/IJICOT.2016.079496 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider linear cyclic codes with the locality property, or locally
recoverable codes (LRC codes). A family of LRC codes that generalize the
classical construction of Reed-Solomon codes was constructed in a recent paper
by I. Tamo and A. Barg (IEEE Trans. Inform. Theory, no. 8, 2014). In this paper
we focus on opt... | [
{
"created": "Tue, 29 Mar 2016 18:41:24 GMT",
"version": "v1"
}
] | 2017-02-10 | [
[
"Tamo",
"Itzhak",
""
],
[
"Barg",
"Alexander",
""
],
[
"Goparaju",
"Sreechakra",
""
],
[
"Calderbank",
"Robert",
""
]
] | We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg (IEEE Trans. Inform. Theory, no. 8, 2014). In this paper we focus on optim... |
2309.14971 | Matteo Pagin | Manishika Rawat, Matteo Pagin, Marco Giordani, Louis-Adrien Dufrene,
Quentin Lampin, Michele Zorzi | Minimizing Energy Consumption for 5G NR Beam Management for RedCap
Devices | null | null | null | null | cs.NI eess.SP | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In 5G New Radio (NR), beam management entails periodic and continuous
transmission and reception of control signals in the form of synchronization
signal blocks (SSBs), used to perform initial access and/or channel estimation.
However, this procedure demands continuous energy consumption, which is
particularly challe... | [
{
"created": "Tue, 26 Sep 2023 14:44:08 GMT",
"version": "v1"
}
] | 2023-09-27 | [
[
"Rawat",
"Manishika",
""
],
[
"Pagin",
"Matteo",
""
],
[
"Giordani",
"Marco",
""
],
[
"Dufrene",
"Louis-Adrien",
""
],
[
"Lampin",
"Quentin",
""
],
[
"Zorzi",
"Michele",
""
]
] | In 5G New Radio (NR), beam management entails periodic and continuous transmission and reception of control signals in the form of synchronization signal blocks (SSBs), used to perform initial access and/or channel estimation. However, this procedure demands continuous energy consumption, which is particularly challeng... |
1903.06965 | Ahmet Serkan Karata\c{s} | Ahmet Serkan Karata\c{s} | Feather: A Feature Model Transformation Language | 29 pages, supplementary material published at
https://github.com/askaratas/Feather | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Feature modeling has been a very popular approach for variability management
in software product lines. Building a feature model requires substantial domain
expertise, however, even experts cannot foresee all future possibilities.
Changing requirements can force a feature model to evolve in order to adapt to
the new ... | [
{
"created": "Sat, 16 Mar 2019 18:08:37 GMT",
"version": "v1"
}
] | 2019-03-19 | [
[
"Karataş",
"Ahmet Serkan",
""
]
] | Feature modeling has been a very popular approach for variability management in software product lines. Building a feature model requires substantial domain expertise, however, even experts cannot foresee all future possibilities. Changing requirements can force a feature model to evolve in order to adapt to the new co... |
1309.6818 | Jakramate Bootkrajang | Jakramate Bootkrajang, Ata Kaban | Boosting in the presence of label noise | Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty
in Artificial Intelligence (UAI2013) | null | null | UAI-P-2013-PG-82-91 | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Boosting is known to be sensitive to label noise. We studied two approaches
to improve AdaBoost's robustness against labelling errors. One is to employ a
label-noise robust classifier as a base learner, while the other is to modify
the AdaBoost algorithm to be more robust. Empirical evaluation shows that a
committee ... | [
{
"created": "Thu, 26 Sep 2013 12:35:03 GMT",
"version": "v1"
}
] | 2013-09-27 | [
[
"Bootkrajang",
"Jakramate",
""
],
[
"Kaban",
"Ata",
""
]
] | Boosting is known to be sensitive to label noise. We studied two approaches to improve AdaBoost's robustness against labelling errors. One is to employ a label-noise robust classifier as a base learner, while the other is to modify the AdaBoost algorithm to be more robust. Empirical evaluation shows that a committee of... |
1711.06851 | Alberto Perez Veiga | Alberto Perez Veiga | Project Success in Agile Development Projects | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper explains and clarifies the differences between Waterfall and Agile
development methodologies, establishes what criteria could be taken into
account to properly define project success within the scope of software
development projects, and finally tries to clarify if project success is the
reason why many org... | [
{
"created": "Sat, 18 Nov 2017 12:14:35 GMT",
"version": "v1"
}
] | 2017-11-21 | [
[
"Veiga",
"Alberto Perez",
""
]
] | The paper explains and clarifies the differences between Waterfall and Agile development methodologies, establishes what criteria could be taken into account to properly define project success within the scope of software development projects, and finally tries to clarify if project success is the reason why many organ... |
2404.08370 | Svyatoslav Gryaznov | Svyatoslav Gryaznov, Sergei Ovcharov, Artur Riazanov | Resolution Over Linear Equations: Combinatorial Games for Tree-like Size
and Space | null | null | 10.1145/3675415 | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the proof system Res($\oplus$) introduced by Itsykson and Sokolov
(Ann. Pure Appl. Log.'20), which is an extension of the resolution proof system
and operates with disjunctions of linear equations over $\mathbb{F}_2$.
We study characterizations of tree-like size and space of Res($\oplus$)
refutations us... | [
{
"created": "Fri, 12 Apr 2024 10:13:18 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Jul 2024 10:45:35 GMT",
"version": "v2"
}
] | 2024-07-11 | [
[
"Gryaznov",
"Svyatoslav",
""
],
[
"Ovcharov",
"Sergei",
""
],
[
"Riazanov",
"Artur",
""
]
] | We consider the proof system Res($\oplus$) introduced by Itsykson and Sokolov (Ann. Pure Appl. Log.'20), which is an extension of the resolution proof system and operates with disjunctions of linear equations over $\mathbb{F}_2$. We study characterizations of tree-like size and space of Res($\oplus$) refutations using ... |
2010.07565 | Junfu Wang | Junfu Wang, Yunhong Wang, Zhen Yang, Liang Yang, Yuanfang Guo | Bi-GCN: Binary Graph Convolutional Network | Accepted by CVPR 2021 as oral presentation | null | 10.1109/CVPR46437.2021.00161 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Neural Networks (GNNs) have achieved tremendous success in graph
representation learning. Unfortunately, current GNNs usually rely on loading
the entire attributed graph into network for processing. This implicit
assumption may not be satisfied with limited memory resources, especially when
the attributed graph... | [
{
"created": "Thu, 15 Oct 2020 07:26:23 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Apr 2021 12:51:30 GMT",
"version": "v2"
}
] | 2022-02-15 | [
[
"Wang",
"Junfu",
""
],
[
"Wang",
"Yunhong",
""
],
[
"Yang",
"Zhen",
""
],
[
"Yang",
"Liang",
""
],
[
"Guo",
"Yuanfang",
""
]
] | Graph Neural Networks (GNNs) have achieved tremendous success in graph representation learning. Unfortunately, current GNNs usually rely on loading the entire attributed graph into network for processing. This implicit assumption may not be satisfied with limited memory resources, especially when the attributed graph i... |
1806.04391 | Kai Hu | Xiaoteng Zhang, Yixin Bao, Feiyun Zhang, Kai Hu, Yicheng Wang, Liang
Zhu, Qinzhu He, Yining Lin, Jie Shao and Yao Peng | Qiniu Submission to ActivityNet Challenge 2018 | 4 pages, 3 figures, CVPR workshop | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we introduce our submissions for the tasks of trimmed activity
recognition (Kinetics) and trimmed event recognition (Moments in Time) for
Activitynet Challenge 2018. In the two tasks, non-local neural networks and
temporal segment networks are implemented as our base models. Multi-modal cues
such as RG... | [
{
"created": "Tue, 12 Jun 2018 08:42:55 GMT",
"version": "v1"
}
] | 2018-06-13 | [
[
"Zhang",
"Xiaoteng",
""
],
[
"Bao",
"Yixin",
""
],
[
"Zhang",
"Feiyun",
""
],
[
"Hu",
"Kai",
""
],
[
"Wang",
"Yicheng",
""
],
[
"Zhu",
"Liang",
""
],
[
"He",
"Qinzhu",
""
],
[
"Lin",
"Yining",
... | In this paper, we introduce our submissions for the tasks of trimmed activity recognition (Kinetics) and trimmed event recognition (Moments in Time) for Activitynet Challenge 2018. In the two tasks, non-local neural networks and temporal segment networks are implemented as our base models. Multi-modal cues such as RGB ... |
2205.11507 | Quanquan Gu | Dongruo Zhou and Quanquan Gu | Computationally Efficient Horizon-Free Reinforcement Learning for Linear
Mixture MDPs | 33 pages, 1 table | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies have shown that episodic reinforcement learning (RL) is not
more difficult than contextual bandits, even with a long planning horizon and
unknown state transitions. However, these results are limited to either tabular
Markov decision processes (MDPs) or computationally inefficient algorithms for
linear... | [
{
"created": "Mon, 23 May 2022 17:59:18 GMT",
"version": "v1"
}
] | 2022-05-24 | [
[
"Zhou",
"Dongruo",
""
],
[
"Gu",
"Quanquan",
""
]
] | Recent studies have shown that episodic reinforcement learning (RL) is not more difficult than contextual bandits, even with a long planning horizon and unknown state transitions. However, these results are limited to either tabular Markov decision processes (MDPs) or computationally inefficient algorithms for linear m... |
1001.2860 | Djamal Belazzougui | Djamal Belazzougui | Succinct Dictionary Matching With No Slowdown | Corrected typos and other minor errors | null | 10.1007/978-3-642-13509-5_9 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of dictionary matching is a classical problem in string matching:
given a set S of d strings of total length n characters over an (not
necessarily constant) alphabet of size sigma, build a data structure so that we
can match in a any text T all occurrences of strings belonging to S. The
classical solution... | [
{
"created": "Sat, 16 Jan 2010 22:10:57 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Feb 2010 21:06:23 GMT",
"version": "v2"
}
] | 2015-05-18 | [
[
"Belazzougui",
"Djamal",
""
]
] | The problem of dictionary matching is a classical problem in string matching: given a set S of d strings of total length n characters over an (not necessarily constant) alphabet of size sigma, build a data structure so that we can match in a any text T all occurrences of strings belonging to S. The classical solution f... |
1206.6356 | Ameya Agaskar | Ameya Agaskar and Yue M. Lu | A Spectral Graph Uncertainty Principle | 40 pages, 8 figures | IEEE Trans. Info. Theory 59 (2013) 4338-4356 | 10.1109/TIT.2013.2252233 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The spectral theory of graphs provides a bridge between classical signal
processing and the nascent field of graph signal processing. In this paper, a
spectral graph analogy to Heisenberg's celebrated uncertainty principle is
developed. Just as the classical result provides a tradeoff between signal
localization in t... | [
{
"created": "Wed, 27 Jun 2012 18:10:56 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Apr 2013 16:06:51 GMT",
"version": "v2"
},
{
"created": "Thu, 1 Aug 2013 18:18:44 GMT",
"version": "v3"
}
] | 2013-08-02 | [
[
"Agaskar",
"Ameya",
""
],
[
"Lu",
"Yue M.",
""
]
] | The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed. Just as the classical result provides a tradeoff between signal localization in tim... |
2203.16859 | Se-Hang Cheong | Se-Hang Cheong, Yain-Whar Si | Boundary Node Detection and Unfolding of Complex Non-Convex Ad Hoc
Networks | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Complex non-convex ad hoc networks (CNCAH) contain intersecting polygons and
edges. In many instances, the layouts of these networks are not entirely convex
in shape. In this article, we propose a Kamada-Kawai-based algorithm called
W-KK-MS for boundary node detection problems, which is capable of aligning node
posit... | [
{
"created": "Thu, 31 Mar 2022 07:41:57 GMT",
"version": "v1"
}
] | 2022-04-01 | [
[
"Cheong",
"Se-Hang",
""
],
[
"Si",
"Yain-Whar",
""
]
] | Complex non-convex ad hoc networks (CNCAH) contain intersecting polygons and edges. In many instances, the layouts of these networks are not entirely convex in shape. In this article, we propose a Kamada-Kawai-based algorithm called W-KK-MS for boundary node detection problems, which is capable of aligning node positio... |
1704.06358 | Paul Tupper | Benjamin Goodman, Paul Tupper | Stability and Fluctuations in a Simple Model of Phonetic Category Change | 19 pages | null | null | null | cs.CL math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In spoken languages, speakers divide up the space of phonetic possibilities
into different regions, corresponding to different phonemes. We consider a
simple exemplar model of how this division of phonetic space varies over time
among a population of language users. In the particular model we consider, we
show that, ... | [
{
"created": "Thu, 20 Apr 2017 22:28:14 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Dec 2017 04:46:08 GMT",
"version": "v2"
},
{
"created": "Fri, 29 Jun 2018 00:23:20 GMT",
"version": "v3"
}
] | 2018-07-02 | [
[
"Goodman",
"Benjamin",
""
],
[
"Tupper",
"Paul",
""
]
] | In spoken languages, speakers divide up the space of phonetic possibilities into different regions, corresponding to different phonemes. We consider a simple exemplar model of how this division of phonetic space varies over time among a population of language users. In the particular model we consider, we show that, on... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.