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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2003.05266 | Adrian Brandemuehl | Leiv Andresen, Adrian Brandemuehl, Alex H\"onger, Benson Kuan, Niclas
V\"odisch, Hermann Blum, Victor Reijgwart, Lukas Bernreiter, Lukas Schaupp,
Jen Jen Chung, Mathias B\"urki, Martin R. Oswald, Roland Siegwart and Abel
Gawel | Accurate Mapping and Planning for Autonomous Racing | null | 2020 IEEE/RSJ International Conference on Intelligent Robots and
Systems (IROS), 2020, pp. 4743-4749 | 10.1109/IROS45743.2020.9341702 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents the perception, mapping, and planning pipeline
implemented on an autonomous race car. It was developed by the 2019 AMZ
driverless team for the Formula Student Germany (FSG) 2019 driverless
competition, where it won 1st place overall. The presented solution combines
early fusion of camera and LiDAR... | [
{
"created": "Wed, 11 Mar 2020 13:08:21 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Mar 2020 13:32:45 GMT",
"version": "v2"
},
{
"created": "Sat, 1 Aug 2020 15:34:29 GMT",
"version": "v3"
},
{
"created": "Thu, 17 Sep 2020 20:05:34 GMT",
"version": "v4"
}
] | 2021-03-02 | [
[
"Andresen",
"Leiv",
""
],
[
"Brandemuehl",
"Adrian",
""
],
[
"Hönger",
"Alex",
""
],
[
"Kuan",
"Benson",
""
],
[
"Vödisch",
"Niclas",
""
],
[
"Blum",
"Hermann",
""
],
[
"Reijgwart",
"Victor",
""
],
[
... | This paper presents the perception, mapping, and planning pipeline implemented on an autonomous race car. It was developed by the 2019 AMZ driverless team for the Formula Student Germany (FSG) 2019 driverless competition, where it won 1st place overall. The presented solution combines early fusion of camera and LiDAR d... |
2301.01913 | Tom Marty | Tom Marty, Tristan Fran\c{c}ois, Pierre Tessier, Louis Gauthier,
Louis-Martin Rousseau, Quentin Cappart | Learning a Generic Value-Selection Heuristic Inside a Constraint
Programming Solver | 15 pages | Constraint Programming 29 (2023) 25:1--25:19 | 10.4230/LIPIcs.CP.2023.25 | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Constraint programming is known for being an efficient approach for solving
combinatorial problems. Important design choices in a solver are the branching
heuristics, which are designed to lead the search to the best solutions in a
minimum amount of time. However, developing these heuristics is a
time-consuming proce... | [
{
"created": "Thu, 5 Jan 2023 05:13:48 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jul 2023 22:15:08 GMT",
"version": "v2"
},
{
"created": "Mon, 2 Oct 2023 16:59:40 GMT",
"version": "v3"
}
] | 2024-04-17 | [
[
"Marty",
"Tom",
""
],
[
"François",
"Tristan",
""
],
[
"Tessier",
"Pierre",
""
],
[
"Gauthier",
"Louis",
""
],
[
"Rousseau",
"Louis-Martin",
""
],
[
"Cappart",
"Quentin",
""
]
] | Constraint programming is known for being an efficient approach for solving combinatorial problems. Important design choices in a solver are the branching heuristics, which are designed to lead the search to the best solutions in a minimum amount of time. However, developing these heuristics is a time-consuming process... |
2212.04972 | Jialiang Lin | Jialiang Lin, Jiaxin Song, Zhangping Zhou, Yidong Chen, Xiaodong Shi | MOPRD: A multidisciplinary open peer review dataset | Please cite the version of Neural Computing and Applications | Neural Computing and Applications, Vol. 35, Issue 34, pp.
24191-24206 (2023) | 10.1007/s00521-023-08891-5 | null | cs.DL cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open peer review is a growing trend in academic publications. Public access
to peer review data can benefit both the academic and publishing communities.
It also serves as a great support to studies on review comment generation and
further to the realization of automated scholarly paper review. However, most
of the e... | [
{
"created": "Fri, 9 Dec 2022 16:35:14 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Nov 2023 18:06:48 GMT",
"version": "v2"
}
] | 2023-11-15 | [
[
"Lin",
"Jialiang",
""
],
[
"Song",
"Jiaxin",
""
],
[
"Zhou",
"Zhangping",
""
],
[
"Chen",
"Yidong",
""
],
[
"Shi",
"Xiaodong",
""
]
] | Open peer review is a growing trend in academic publications. Public access to peer review data can benefit both the academic and publishing communities. It also serves as a great support to studies on review comment generation and further to the realization of automated scholarly paper review. However, most of the exi... |
2306.13381 | Rahul Nair | Rahul Nair | Co-creating a globally interpretable model with human input | Paper at Artificial Intelligence & Human-Computer Interaction
Workshop at ICML 2023 | null | null | null | cs.HC cs.LG | http://creativecommons.org/licenses/by/4.0/ | We consider an aggregated human-AI collaboration aimed at generating a joint
interpretable model. The model takes the form of Boolean decision rules, where
human input is provided in the form of logical conditions or as partial
templates. This focus on the combined construction of a model offers a
different perspecti... | [
{
"created": "Fri, 23 Jun 2023 09:03:16 GMT",
"version": "v1"
}
] | 2023-06-26 | [
[
"Nair",
"Rahul",
""
]
] | We consider an aggregated human-AI collaboration aimed at generating a joint interpretable model. The model takes the form of Boolean decision rules, where human input is provided in the form of logical conditions or as partial templates. This focus on the combined construction of a model offers a different perspective... |
1204.4467 | I-Hong Hou | I-Hong Hou and Rahul Singh | Real-Time Stochastic Processing Networks with Concurrent Resource
Requirements | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Stochastic Processing Networks (SPNs) can be used to model communication
networks, manufacturing systems, service systems, etc. We consider a real-time
SPN where tasks generate jobs with strict deadlines according to their traffic
patterns. Each job requires the concurrent usage of some resources to be
processed. The... | [
{
"created": "Thu, 19 Apr 2012 20:34:57 GMT",
"version": "v1"
}
] | 2012-04-23 | [
[
"Hou",
"I-Hong",
""
],
[
"Singh",
"Rahul",
""
]
] | Stochastic Processing Networks (SPNs) can be used to model communication networks, manufacturing systems, service systems, etc. We consider a real-time SPN where tasks generate jobs with strict deadlines according to their traffic patterns. Each job requires the concurrent usage of some resources to be processed. The p... |
1908.04133 | Matthias Niedermaier | Matthias Niedermaier and Dominik Merli and Georg Sigl | A Secure Dual-MCU Architecture for Robust Communication of IIoT Devices | null | 2019 8th Mediterranean Conference on Embedded Computing (MECO) | 10.1109/MECO.2019.8760188 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Industrial Internet of Things (IIoT) has already become a part of our
everyday life be it water supply, smart grid, or production, IIoT is
everywhere. For example, factory operators want to know the current state of
the production line. These new demands for data acquisition in modern plants
require industrial co... | [
{
"created": "Mon, 12 Aug 2019 12:58:53 GMT",
"version": "v1"
}
] | 2019-08-13 | [
[
"Niedermaier",
"Matthias",
""
],
[
"Merli",
"Dominik",
""
],
[
"Sigl",
"Georg",
""
]
] | The Industrial Internet of Things (IIoT) has already become a part of our everyday life be it water supply, smart grid, or production, IIoT is everywhere. For example, factory operators want to know the current state of the production line. These new demands for data acquisition in modern plants require industrial comp... |
2002.12324 | Eric Brachmann | Eric Brachmann and Carsten Rother | Visual Camera Re-Localization from RGB and RGB-D Images Using DSAC | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a learning-based system that estimates the camera position and
orientation from a single input image relative to a known environment. The
system is flexible w.r.t. the amount of information available at test and at
training time, catering to different applications. Input images can be RGB-D or
RGB, and a ... | [
{
"created": "Thu, 27 Feb 2020 18:45:21 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Aug 2020 12:07:47 GMT",
"version": "v2"
},
{
"created": "Mon, 31 Aug 2020 12:29:26 GMT",
"version": "v3"
},
{
"created": "Fri, 9 Oct 2020 15:03:02 GMT",
"version": "v4"
}
] | 2020-10-12 | [
[
"Brachmann",
"Eric",
""
],
[
"Rother",
"Carsten",
""
]
] | We describe a learning-based system that estimates the camera position and orientation from a single input image relative to a known environment. The system is flexible w.r.t. the amount of information available at test and at training time, catering to different applications. Input images can be RGB-D or RGB, and a 3D... |
2310.17417 | John Liu | Hing Lie, Kachina Studer, Zhen Zhao, Ben Thomson, Dishita G Turakhia,
John Liu | Training for Open-Ended Drilling through a Virtual Reality Simulation | 10 pages, 4 figures, 9 tables | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Virtual Reality (VR) can support effective and scalable training of
psychomotor skills in manufacturing. However, many industry training modules
offer experiences that are close-ended and do not allow for human error. We aim
to address this gap in VR training tools for psychomotor skills training by
exploring an open... | [
{
"created": "Thu, 26 Oct 2023 14:22:30 GMT",
"version": "v1"
}
] | 2023-10-27 | [
[
"Lie",
"Hing",
""
],
[
"Studer",
"Kachina",
""
],
[
"Zhao",
"Zhen",
""
],
[
"Thomson",
"Ben",
""
],
[
"Turakhia",
"Dishita G",
""
],
[
"Liu",
"John",
""
]
] | Virtual Reality (VR) can support effective and scalable training of psychomotor skills in manufacturing. However, many industry training modules offer experiences that are close-ended and do not allow for human error. We aim to address this gap in VR training tools for psychomotor skills training by exploring an open-e... |
2406.00588 | Xiao-Shan Gao | Lijia Yu and Shuang Liu and Yibo Miao and Xiao-Shan Gao and Lijun
Zhang | Generalization Bound and New Algorithm for Clean-Label Backdoor Attack | null | null | null | null | cs.LG cs.CR math.ST stat.TH | http://creativecommons.org/licenses/by/4.0/ | The generalization bound is a crucial theoretical tool for assessing the
generalizability of learning methods and there exist vast literatures on
generalizability of normal learning, adversarial learning, and data poisoning.
Unlike other data poison attacks, the backdoor attack has the special property
that the poiso... | [
{
"created": "Sun, 2 Jun 2024 01:46:58 GMT",
"version": "v1"
}
] | 2024-06-05 | [
[
"Yu",
"Lijia",
""
],
[
"Liu",
"Shuang",
""
],
[
"Miao",
"Yibo",
""
],
[
"Gao",
"Xiao-Shan",
""
],
[
"Zhang",
"Lijun",
""
]
] | The generalization bound is a crucial theoretical tool for assessing the generalizability of learning methods and there exist vast literatures on generalizability of normal learning, adversarial learning, and data poisoning. Unlike other data poison attacks, the backdoor attack has the special property that the poisone... |
1511.02919 | Deepti Ghadiyaram | Deepti Ghadiyaram and Alan C. Bovik | Massive Online Crowdsourced Study of Subjective and Objective Picture
Quality | 16 pages | null | 10.1109/TIP.2015.2500021 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most publicly available image quality databases have been created under
highly controlled conditions by introducing graded simulated distortions onto
high-quality photographs. However, images captured using typical real-world
mobile camera devices are usually afflicted by complex mixtures of multiple
distortions, whi... | [
{
"created": "Mon, 9 Nov 2015 22:39:58 GMT",
"version": "v1"
}
] | 2016-01-20 | [
[
"Ghadiyaram",
"Deepti",
""
],
[
"Bovik",
"Alan C.",
""
]
] | Most publicly available image quality databases have been created under highly controlled conditions by introducing graded simulated distortions onto high-quality photographs. However, images captured using typical real-world mobile camera devices are usually afflicted by complex mixtures of multiple distortions, which... |
2206.01970 | Haosen Wang | Enqiang Zhu, Haosen Wang, Yu Zhang, Kai Zhang, Chanjuan Liu | PHEE: A phased hybrid evaluation-enhanced approach for identifying
influential users in social networks | null | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For the purpose of maximizing the spread of influence caused by a certain
small number k of nodes in a social network, we are asked to find a k-subset of
nodes (i.e., a seed set) with the best capacity to influence the nodes not in
it. This problem of influence maximization (IM) has wide application, belongs
to subse... | [
{
"created": "Sat, 4 Jun 2022 12:00:08 GMT",
"version": "v1"
}
] | 2022-06-07 | [
[
"Zhu",
"Enqiang",
""
],
[
"Wang",
"Haosen",
""
],
[
"Zhang",
"Yu",
""
],
[
"Zhang",
"Kai",
""
],
[
"Liu",
"Chanjuan",
""
]
] | For the purpose of maximizing the spread of influence caused by a certain small number k of nodes in a social network, we are asked to find a k-subset of nodes (i.e., a seed set) with the best capacity to influence the nodes not in it. This problem of influence maximization (IM) has wide application, belongs to subset ... |
2203.10581 | Ariel Gera | Eyal Shnarch, Ariel Gera, Alon Halfon, Lena Dankin, Leshem Choshen,
Ranit Aharonov, Noam Slonim | Cluster & Tune: Boost Cold Start Performance in Text Classification | 9 pages, 6 figures; To be published in ACL 2022 | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In real-world scenarios, a text classification task often begins with a cold
start, when labeled data is scarce. In such cases, the common practice of
fine-tuning pre-trained models, such as BERT, for a target classification task,
is prone to produce poor performance. We suggest a method to boost the
performance of s... | [
{
"created": "Sun, 20 Mar 2022 15:29:34 GMT",
"version": "v1"
}
] | 2022-03-22 | [
[
"Shnarch",
"Eyal",
""
],
[
"Gera",
"Ariel",
""
],
[
"Halfon",
"Alon",
""
],
[
"Dankin",
"Lena",
""
],
[
"Choshen",
"Leshem",
""
],
[
"Aharonov",
"Ranit",
""
],
[
"Slonim",
"Noam",
""
]
] | In real-world scenarios, a text classification task often begins with a cold start, when labeled data is scarce. In such cases, the common practice of fine-tuning pre-trained models, such as BERT, for a target classification task, is prone to produce poor performance. We suggest a method to boost the performance of suc... |
2012.01644 | Joy Hsu | Joy Hsu, Jeffrey Gu, Gong-Her Wu, Wah Chiu, Serena Yeung | Capturing implicit hierarchical structure in 3D biomedical images with
self-supervised hyperbolic representations | To appear at NeurIPS 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the task of representation learning for unsupervised segmentation
of 3D voxel-grid biomedical images. We show that models that capture implicit
hierarchical relationships between subvolumes are better suited for this task.
To that end, we consider encoder-decoder architectures with a hyperbolic latent
spa... | [
{
"created": "Thu, 3 Dec 2020 02:15:31 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Dec 2020 23:28:46 GMT",
"version": "v2"
},
{
"created": "Mon, 25 Oct 2021 22:36:34 GMT",
"version": "v3"
}
] | 2021-10-27 | [
[
"Hsu",
"Joy",
""
],
[
"Gu",
"Jeffrey",
""
],
[
"Wu",
"Gong-Her",
""
],
[
"Chiu",
"Wah",
""
],
[
"Yeung",
"Serena",
""
]
] | We consider the task of representation learning for unsupervised segmentation of 3D voxel-grid biomedical images. We show that models that capture implicit hierarchical relationships between subvolumes are better suited for this task. To that end, we consider encoder-decoder architectures with a hyperbolic latent space... |
1807.02816 | The-Hien Dang-Ha | The-Hien Dang-Ha | Improving Deep Learning through Automatic Programming | Master's thesis (2014) | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning and deep architectures are emerging as the best machine
learning methods so far in many practical applications such as reducing the
dimensionality of data, image classification, speech recognition or object
segmentation. In fact, many leading technology companies such as Google,
Microsoft or IBM are res... | [
{
"created": "Sun, 8 Jul 2018 13:38:21 GMT",
"version": "v1"
}
] | 2018-07-10 | [
[
"Dang-Ha",
"The-Hien",
""
]
] | Deep learning and deep architectures are emerging as the best machine learning methods so far in many practical applications such as reducing the dimensionality of data, image classification, speech recognition or object segmentation. In fact, many leading technology companies such as Google, Microsoft or IBM are resea... |
0911.3306 | Pascal Urso | Nacer Boudjlida (INRIA Lorraine - LORIA), Jean-Pierre Jacquot (LORIA),
Pascal Urso (INRIA Lorraine - LORIA) | Software Engineering Education by Example | null | 5th China - Europe International Symposium on Software Industry
Oriented Education (CEISIE 2009), Bordeaux : France (2009) | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Based on the old but famous distinction between "in the small" and "in the
large" software development, at Nancy Universit\'e, UHP Nancy 1, we experience
for a while software engineering education thanks to actual project
engineering. This education method has the merit to enable students to discover
and to overcome ... | [
{
"created": "Tue, 17 Nov 2009 13:36:59 GMT",
"version": "v1"
}
] | 2009-11-18 | [
[
"Boudjlida",
"Nacer",
"",
"INRIA Lorraine - LORIA"
],
[
"Jacquot",
"Jean-Pierre",
"",
"LORIA"
],
[
"Urso",
"Pascal",
"",
"INRIA Lorraine - LORIA"
]
] | Based on the old but famous distinction between "in the small" and "in the large" software development, at Nancy Universit\'e, UHP Nancy 1, we experience for a while software engineering education thanks to actual project engineering. This education method has the merit to enable students to discover and to overcome ac... |
2012.01172 | Burak Yildiz | Burak Yildiz, Hayley Hung, Jesse H. Krijthe, Cynthia C. S. Liem, Marco
Loog, Gosia Migut, Frans Oliehoek, Annibale Panichella, Przemyslaw Pawelczak,
Stjepan Picek, Mathijs de Weerdt, and Jan van Gemert | ReproducedPapers.org: Openly teaching and structuring machine learning
reproducibility | Accepted to RRPR 2020: Third Workshop on Reproducible Research in
Pattern Recognition | null | 10.1007/978-3-030-76423-4_1 | null | cs.CY cs.CV | http://creativecommons.org/licenses/by/4.0/ | We present ReproducedPapers.org: an open online repository for teaching and
structuring machine learning reproducibility. We evaluate doing a reproduction
project among students and the added value of an online reproduction repository
among AI researchers. We use anonymous self-assessment surveys and obtained 144
res... | [
{
"created": "Tue, 1 Dec 2020 11:19:45 GMT",
"version": "v1"
}
] | 2021-06-11 | [
[
"Yildiz",
"Burak",
""
],
[
"Hung",
"Hayley",
""
],
[
"Krijthe",
"Jesse H.",
""
],
[
"Liem",
"Cynthia C. S.",
""
],
[
"Loog",
"Marco",
""
],
[
"Migut",
"Gosia",
""
],
[
"Oliehoek",
"Frans",
""
],
[
"... | We present ReproducedPapers.org: an open online repository for teaching and structuring machine learning reproducibility. We evaluate doing a reproduction project among students and the added value of an online reproduction repository among AI researchers. We use anonymous self-assessment surveys and obtained 144 respo... |
1203.4627 | Vasilis Gkatzelis | Richard Cole, Vasilis Gkatzelis, Gagan Goel | Truthfulness, Proportional Fairness, and Efficiency | null | null | null | null | cs.GT cs.DS cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How does one allocate a collection of resources to a set of strategic agents
in a fair and efficient manner without using money? For in many scenarios it is
not feasible to use money to compensate agents for otherwise unsatisfactory
outcomes. This paper studies this question, looking at both fairness and
efficiency m... | [
{
"created": "Tue, 20 Mar 2012 23:55:49 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Jul 2012 22:16:17 GMT",
"version": "v2"
}
] | 2012-07-10 | [
[
"Cole",
"Richard",
""
],
[
"Gkatzelis",
"Vasilis",
""
],
[
"Goel",
"Gagan",
""
]
] | How does one allocate a collection of resources to a set of strategic agents in a fair and efficient manner without using money? For in many scenarios it is not feasible to use money to compensate agents for otherwise unsatisfactory outcomes. This paper studies this question, looking at both fairness and efficiency mea... |
2404.00987 | Ruowen Zhao | Ruowen Zhao, Zhengyi Wang, Yikai Wang, Zihan Zhou and Jun Zhu | FlexiDreamer: Single Image-to-3D Generation with FlexiCubes | Project page: https://flexidreamer.github.io | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 3D content generation has wide applications in various fields. One of its
dominant paradigms is by sparse-view reconstruction using multi-view images
generated by diffusion models. However, since directly reconstructing triangle
meshes from multi-view images is challenging, most methodologies opt to an
implicit repre... | [
{
"created": "Mon, 1 Apr 2024 08:20:18 GMT",
"version": "v1"
},
{
"created": "Mon, 27 May 2024 09:51:37 GMT",
"version": "v2"
}
] | 2024-05-28 | [
[
"Zhao",
"Ruowen",
""
],
[
"Wang",
"Zhengyi",
""
],
[
"Wang",
"Yikai",
""
],
[
"Zhou",
"Zihan",
""
],
[
"Zhu",
"Jun",
""
]
] | 3D content generation has wide applications in various fields. One of its dominant paradigms is by sparse-view reconstruction using multi-view images generated by diffusion models. However, since directly reconstructing triangle meshes from multi-view images is challenging, most methodologies opt to an implicit represe... |
1712.09509 | Zhiqing Sun | Zhiqing Sun, Gehui Shen, Zhihong Deng | A Gap-Based Framework for Chinese Word Segmentation via Very Deep
Convolutional Networks | Under review as a conference paper at ACL 2018; 10 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most previous approaches to Chinese word segmentation can be roughly
classified into character-based and word-based methods. The former regards this
task as a sequence-labeling problem, while the latter directly segments
character sequence into words. However, if we consider segmenting a given
sentence, the most intu... | [
{
"created": "Wed, 27 Dec 2017 06:44:02 GMT",
"version": "v1"
}
] | 2017-12-29 | [
[
"Sun",
"Zhiqing",
""
],
[
"Shen",
"Gehui",
""
],
[
"Deng",
"Zhihong",
""
]
] | Most previous approaches to Chinese word segmentation can be roughly classified into character-based and word-based methods. The former regards this task as a sequence-labeling problem, while the latter directly segments character sequence into words. However, if we consider segmenting a given sentence, the most intuit... |
1710.08986 | Dimitri Scheftelowitsch | Dimitri Scheftelowitsch, Peter Buchholz, Vahid Hashemi, Holger
Hermanns | Multi-Objective Approaches to Markov Decision Processes with Uncertain
Transition Parameters | 9 pages, 5 figures, preprint for VALUETOOLS 2017 | null | null | null | cs.AI cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Markov decision processes (MDPs) are a popular model for performance analysis
and optimization of stochastic systems. The parameters of stochastic behavior
of MDPs are estimates from empirical observations of a system; their values are
not known precisely. Different types of MDPs with uncertain, imprecise or
bounded ... | [
{
"created": "Fri, 20 Oct 2017 07:47:41 GMT",
"version": "v1"
}
] | 2017-10-26 | [
[
"Scheftelowitsch",
"Dimitri",
""
],
[
"Buchholz",
"Peter",
""
],
[
"Hashemi",
"Vahid",
""
],
[
"Hermanns",
"Holger",
""
]
] | Markov decision processes (MDPs) are a popular model for performance analysis and optimization of stochastic systems. The parameters of stochastic behavior of MDPs are estimates from empirical observations of a system; their values are not known precisely. Different types of MDPs with uncertain, imprecise or bounded tr... |
1612.05878 | Suzhi Bi | Suzhi Bi and Ying Jun Zhang | Graph-based Cyber Security Analysis of State Estimation in Smart Power
Grid | This article has been accepted for publication by IEEE Communications
Magazine (Dec 2016) | null | null | null | cs.SY cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Smart power grid enables intelligent automation at all levels of power system
operation, from electricity generation at power plants to power usage at
households. The key enabling factor of an efficient smart grid is its built-in
information and communication technology (ICT) that monitors the real-time
system operat... | [
{
"created": "Sun, 18 Dec 2016 09:27:40 GMT",
"version": "v1"
}
] | 2016-12-20 | [
[
"Bi",
"Suzhi",
""
],
[
"Zhang",
"Ying Jun",
""
]
] | Smart power grid enables intelligent automation at all levels of power system operation, from electricity generation at power plants to power usage at households. The key enabling factor of an efficient smart grid is its built-in information and communication technology (ICT) that monitors the real-time system operatin... |
2203.16875 | Xiangjun Gao | Xiangjun Gao, Jiaolong Yang, Jongyoo Kim, Sida Peng, Zicheng Liu, Xin
Tong | MPS-NeRF: Generalizable 3D Human Rendering from Multiview Images | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been rapid progress recently on 3D human rendering, including novel
view synthesis and pose animation, based on the advances of neural radiance
fields (NeRF). However, most existing methods focus on person-specific training
and their training typically requires multi-view videos. This paper deals with
a new... | [
{
"created": "Thu, 31 Mar 2022 08:09:03 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Jul 2022 06:10:50 GMT",
"version": "v2"
}
] | 2022-07-28 | [
[
"Gao",
"Xiangjun",
""
],
[
"Yang",
"Jiaolong",
""
],
[
"Kim",
"Jongyoo",
""
],
[
"Peng",
"Sida",
""
],
[
"Liu",
"Zicheng",
""
],
[
"Tong",
"Xin",
""
]
] | There has been rapid progress recently on 3D human rendering, including novel view synthesis and pose animation, based on the advances of neural radiance fields (NeRF). However, most existing methods focus on person-specific training and their training typically requires multi-view videos. This paper deals with a new c... |
2311.10388 | Junjie Zhao | Junjie Zhao and Xiang Chen and Guang Yang and Yiheng Shen | Automatic Smart Contract Comment Generation via Large Language Models
and In-Context Learning | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The previous smart contract code comment (SCC) generation approaches can be
divided into two categories: fine-tuning paradigm-based approaches and
information retrieval-based approaches. However, for the fine-tuning
paradigm-based approaches, the performance may be limited by the quality of the
gathered dataset for t... | [
{
"created": "Fri, 17 Nov 2023 08:31:09 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jan 2024 07:58:25 GMT",
"version": "v2"
}
] | 2024-01-17 | [
[
"Zhao",
"Junjie",
""
],
[
"Chen",
"Xiang",
""
],
[
"Yang",
"Guang",
""
],
[
"Shen",
"Yiheng",
""
]
] | The previous smart contract code comment (SCC) generation approaches can be divided into two categories: fine-tuning paradigm-based approaches and information retrieval-based approaches. However, for the fine-tuning paradigm-based approaches, the performance may be limited by the quality of the gathered dataset for the... |
2108.10061 | Larkin Liu | Larkin Liu, Jun Tao Luo | An Extensible and Modular Design and Implementation of Monte Carlo Tree
Search for the JVM | 18 pages, 7 figures, Manuscript | null | null | null | cs.LG stat.CO | http://creativecommons.org/licenses/by/4.0/ | Flexible implementations of Monte Carlo Tree Search (MCTS), combined with
domain specific knowledge and hybridization with other search algorithms, can
be powerful for finding the solutions to problems in complex planning. We
introduce mctreesearch4j, an MCTS implementation written as a standard JVM
library following... | [
{
"created": "Fri, 30 Jul 2021 08:17:04 GMT",
"version": "v1"
}
] | 2021-08-24 | [
[
"Liu",
"Larkin",
""
],
[
"Luo",
"Jun Tao",
""
]
] | Flexible implementations of Monte Carlo Tree Search (MCTS), combined with domain specific knowledge and hybridization with other search algorithms, can be powerful for finding the solutions to problems in complex planning. We introduce mctreesearch4j, an MCTS implementation written as a standard JVM library following k... |
1606.03212 | Furong Huang | Furong Huang | Discovery of Latent Factors in High-dimensional Data Using Tensor
Methods | Ph.D. Thesis | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unsupervised learning aims at the discovery of hidden structure that drives
the observations in the real world. It is essential for success in modern
machine learning. Latent variable models are versatile in unsupervised learning
and have applications in almost every domain. Training latent variable models
is challen... | [
{
"created": "Fri, 10 Jun 2016 07:17:00 GMT",
"version": "v1"
}
] | 2016-06-13 | [
[
"Huang",
"Furong",
""
]
] | Unsupervised learning aims at the discovery of hidden structure that drives the observations in the real world. It is essential for success in modern machine learning. Latent variable models are versatile in unsupervised learning and have applications in almost every domain. Training latent variable models is challengi... |
2308.08991 | Yuqiang Sun | Yuqiang Sun, Zhengzi Xu, Chengwei Liu, Yiran Zhang, Yang Liu | Who is the Real Hero? Measuring Developer Contribution via
Multi-dimensional Data Integration | null | null | 10.1109/ASE56229.2023.00102 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Proper incentives are important for motivating developers in open-source
communities, which is crucial for maintaining the development of open-source
software healthy. To provide such incentives, an accurate and objective
developer contribution measurement method is needed. However, existing methods
rely heavily on m... | [
{
"created": "Thu, 17 Aug 2023 13:57:44 GMT",
"version": "v1"
},
{
"created": "Thu, 31 Aug 2023 07:42:39 GMT",
"version": "v2"
}
] | 2023-11-21 | [
[
"Sun",
"Yuqiang",
""
],
[
"Xu",
"Zhengzi",
""
],
[
"Liu",
"Chengwei",
""
],
[
"Zhang",
"Yiran",
""
],
[
"Liu",
"Yang",
""
]
] | Proper incentives are important for motivating developers in open-source communities, which is crucial for maintaining the development of open-source software healthy. To provide such incentives, an accurate and objective developer contribution measurement method is needed. However, existing methods rely heavily on man... |
1611.06385 | Jop Bri\"et | Jop Bri\"et | On Embeddings of $\ell_1^k$ from Locally Decodable Codes | Appeared earlier on ECCC (http://eccc.hpi-web.de/report/2015/086/).
This version has a slightly shorter abstract and slightly edited
introduction. Removed left-over notes | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that any $q$-query locally decodable code (LDC) gives a copy of
$\ell_1^k$ with small distortion in the Banach space of $q$-linear forms on
$\ell_{p_1}^N\times\cdots\times\ell_{p_q}^N$, provided $1/p_1 + \cdots + 1/p_q
\leq 1$ and where $k$, $N$, and the distortion are simple functions of the code
parameters.... | [
{
"created": "Sat, 19 Nov 2016 15:39:20 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Nov 2016 12:04:37 GMT",
"version": "v2"
}
] | 2016-11-23 | [
[
"Briët",
"Jop",
""
]
] | We show that any $q$-query locally decodable code (LDC) gives a copy of $\ell_1^k$ with small distortion in the Banach space of $q$-linear forms on $\ell_{p_1}^N\times\cdots\times\ell_{p_q}^N$, provided $1/p_1 + \cdots + 1/p_q \leq 1$ and where $k$, $N$, and the distortion are simple functions of the code parameters. W... |
1811.03966 | Lars Jaffke | Lars Jaffke and Paloma T. Lima | A Complexity Dichotomy for Critical Values of the b-Chromatic Number of
Graphs | 20 pages, 1 figure | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A $b$-coloring of a graph $G$ is a proper coloring of its vertices such that
each color class contains a vertex that has at least one neighbor in all the
other color classes. The b-Coloring problem asks whether a graph $G$ has a
$b$-coloring with $k$ colors. The $b$-chromatic number of a graph $G$, denoted
by $\chi_b... | [
{
"created": "Fri, 9 Nov 2018 15:22:35 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Feb 2019 15:04:17 GMT",
"version": "v2"
}
] | 2019-02-12 | [
[
"Jaffke",
"Lars",
""
],
[
"Lima",
"Paloma T.",
""
]
] | A $b$-coloring of a graph $G$ is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph $G$ has a $b$-coloring with $k$ colors. The $b$-chromatic number of a graph $G$, denoted by $\chi_b(G... |
1504.02089 | Tomer Koren | Elad Hazan, Tomer Koren | The Computational Power of Optimization in Online Learning | null | null | null | null | cs.LG cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the fundamental problem of prediction with expert advice where
the experts are "optimizable": there is a black-box optimization oracle that
can be used to compute, in constant time, the leading expert in retrospect at
any point in time. In this setting, we give a novel online algorithm that
attains vanish... | [
{
"created": "Wed, 8 Apr 2015 19:54:27 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Apr 2015 12:15:37 GMT",
"version": "v2"
},
{
"created": "Mon, 2 Nov 2015 20:30:50 GMT",
"version": "v3"
},
{
"created": "Wed, 27 Jan 2016 09:07:59 GMT",
"version": "v4"
}
] | 2016-01-28 | [
[
"Hazan",
"Elad",
""
],
[
"Koren",
"Tomer",
""
]
] | We consider the fundamental problem of prediction with expert advice where the experts are "optimizable": there is a black-box optimization oracle that can be used to compute, in constant time, the leading expert in retrospect at any point in time. In this setting, we give a novel online algorithm that attains vanishin... |
1701.01170 | Yangzihao Wang | Yangzihao Wang, Yuechao Pan, Andrew Davidson, Yuduo Wu, Carl Yang,
Leyuan Wang, Muhammad Osama, Chenshan Yuan, Weitang Liu, Andy T. Riffel and
John D. Owens | Gunrock: GPU Graph Analytics | 52 pages, invited paper to ACM Transactions on Parallel Computing
(TOPC), an extended version of PPoPP'16 paper "Gunrock: A High-Performance
Graph Processing Library on the GPU" | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | For large-scale graph analytics on the GPU, the irregularity of data access
and control flow, and the complexity of programming GPUs, have presented two
significant challenges to developing a programmable high-performance graph
library. "Gunrock", our graph-processing system designed specifically for the
GPU, uses a ... | [
{
"created": "Wed, 4 Jan 2017 22:16:07 GMT",
"version": "v1"
}
] | 2017-01-06 | [
[
"Wang",
"Yangzihao",
""
],
[
"Pan",
"Yuechao",
""
],
[
"Davidson",
"Andrew",
""
],
[
"Wu",
"Yuduo",
""
],
[
"Yang",
"Carl",
""
],
[
"Wang",
"Leyuan",
""
],
[
"Osama",
"Muhammad",
""
],
[
"Yuan",
... | For large-scale graph analytics on the GPU, the irregularity of data access and control flow, and the complexity of programming GPUs, have presented two significant challenges to developing a programmable high-performance graph library. "Gunrock", our graph-processing system designed specifically for the GPU, uses a hi... |
2208.04022 | Wen-Ji Zhou | Qianying Lin, Wen-Ji Zhou, Yanshi Wang, Qing Da, Qing-Guo Chen, Bing
Wang | Sparse Attentive Memory Network for Click-through Rate Prediction with
Long Sequences | Published as a conference paper at the 31st ACM International
Conference on Information and Knowledge Management, CIKM 2022 | null | 10.1145/3511808.3557095 | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sequential recommendation predicts users' next behaviors with their
historical interactions. Recommending with longer sequences improves
recommendation accuracy and increases the degree of personalization. As
sequences get longer, existing works have not yet addressed the following two
main challenges. Firstly, model... | [
{
"created": "Mon, 8 Aug 2022 10:11:46 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Sep 2022 06:17:49 GMT",
"version": "v2"
}
] | 2022-09-05 | [
[
"Lin",
"Qianying",
""
],
[
"Zhou",
"Wen-Ji",
""
],
[
"Wang",
"Yanshi",
""
],
[
"Da",
"Qing",
""
],
[
"Chen",
"Qing-Guo",
""
],
[
"Wang",
"Bing",
""
]
] | Sequential recommendation predicts users' next behaviors with their historical interactions. Recommending with longer sequences improves recommendation accuracy and increases the degree of personalization. As sequences get longer, existing works have not yet addressed the following two main challenges. Firstly, modelin... |
2208.14571 | Zhen Zhang | Zhen Zhang, Ignavier Ng, Dong Gong, Yuhang Liu, Ehsan M Abbasnejad,
Mingming Gong, Kun Zhang, Javen Qinfeng Shi | Truncated Matrix Power Iteration for Differentiable DAG Learning | Published in NeurIPS 2022 | null | null | null | cs.LG cs.AI stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recovering underlying Directed Acyclic Graph (DAG) structures from
observational data is highly challenging due to the combinatorial nature of the
DAG-constrained optimization problem. Recently, DAG learning has been cast as a
continuous optimization problem by characterizing the DAG constraint as a
smooth equality o... | [
{
"created": "Tue, 30 Aug 2022 23:56:12 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Dec 2022 03:21:04 GMT",
"version": "v2"
}
] | 2022-12-23 | [
[
"Zhang",
"Zhen",
""
],
[
"Ng",
"Ignavier",
""
],
[
"Gong",
"Dong",
""
],
[
"Liu",
"Yuhang",
""
],
[
"Abbasnejad",
"Ehsan M",
""
],
[
"Gong",
"Mingming",
""
],
[
"Zhang",
"Kun",
""
],
[
"Shi",
"J... | Recovering underlying Directed Acyclic Graph (DAG) structures from observational data is highly challenging due to the combinatorial nature of the DAG-constrained optimization problem. Recently, DAG learning has been cast as a continuous optimization problem by characterizing the DAG constraint as a smooth equality one... |
2011.06691 | Fabien Racape | Franck Galpin, Fabien Racap\'e, Sunil Jaiswal, Philippe Bordes,
Fabrice Le L\'eannec, Edouard Fran\c{c}ois | CNN-based driving of block partitioning for intra slices encoding | 10 pages | 2019 Data Compression Conference (DCC) | 10.1109/DCC.2019.00024 | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper provides a technical overview of a deep-learning-based encoder
method aiming at optimizing next generation hybrid video encoders for driving
the block partitioning in intra slices. An encoding approach based on
Convolutional Neural Networks is explored to partly substitute classical
heuristics-based encode... | [
{
"created": "Thu, 12 Nov 2020 23:55:12 GMT",
"version": "v1"
}
] | 2020-11-16 | [
[
"Galpin",
"Franck",
""
],
[
"Racapé",
"Fabien",
""
],
[
"Jaiswal",
"Sunil",
""
],
[
"Bordes",
"Philippe",
""
],
[
"Léannec",
"Fabrice Le",
""
],
[
"François",
"Edouard",
""
]
] | This paper provides a technical overview of a deep-learning-based encoder method aiming at optimizing next generation hybrid video encoders for driving the block partitioning in intra slices. An encoding approach based on Convolutional Neural Networks is explored to partly substitute classical heuristics-based encoder ... |
1605.04478 | Hamid Tizhoosh | Mina Nouredanesh, Hamid R. Tizhoosh, Ershad Banijamali | Gabor Barcodes for Medical Image Retrieval | To appear in proceedings of The 2016 IEEE International Conference on
Image Processing (ICIP 2016), Sep 25-28, 2016, Phoenix, Arizona, USA | null | 10.1109/ICIP.2016.7532807 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, advances in medical imaging have led to the emergence of
massive databases, containing images from a diverse range of modalities. This
has significantly heightened the need for automated annotation of the images on
one side, and fast and memory-efficient content-based image retrieval systems
on the o... | [
{
"created": "Sat, 14 May 2016 22:39:29 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Nouredanesh",
"Mina",
""
],
[
"Tizhoosh",
"Hamid R.",
""
],
[
"Banijamali",
"Ershad",
""
]
] | In recent years, advances in medical imaging have led to the emergence of massive databases, containing images from a diverse range of modalities. This has significantly heightened the need for automated annotation of the images on one side, and fast and memory-efficient content-based image retrieval systems on the oth... |
2108.08768 | Abdullatif Albaseer Mr | Abdullatif Albaseer, Mohamed Abdallah, Ala Al-Fuqaha, and Aiman Erbad | Client Selection Approach in Support of Clustered Federated Learning
over Wireless Edge Networks | 4 figures, 7 pages | null | null | null | cs.DC cs.LG | http://creativecommons.org/licenses/by/4.0/ | Clustered Federated Multitask Learning (CFL) was introduced as an efficient
scheme to obtain reliable specialized models when data is imbalanced and
distributed in a non-i.i.d. (non-independent and identically distributed)
fashion amongst clients. While a similarity measure metric, like the cosine
similarity, can be ... | [
{
"created": "Mon, 16 Aug 2021 21:38:22 GMT",
"version": "v1"
}
] | 2021-08-20 | [
[
"Albaseer",
"Abdullatif",
""
],
[
"Abdallah",
"Mohamed",
""
],
[
"Al-Fuqaha",
"Ala",
""
],
[
"Erbad",
"Aiman",
""
]
] | Clustered Federated Multitask Learning (CFL) was introduced as an efficient scheme to obtain reliable specialized models when data is imbalanced and distributed in a non-i.i.d. (non-independent and identically distributed) fashion amongst clients. While a similarity measure metric, like the cosine similarity, can be us... |
2101.09409 | Shin-Cheng Mu | Shin-Cheng Mu | Calculating a backtracking algorithm: an exercise in monadic program
derivation | null | null | null | TR-IIS-19-003, Institute of Information Science, Academia Sinica | cs.PL | http://creativecommons.org/licenses/by-sa/4.0/ | Equational reasoning is among the most important tools that functional
programming provides us. Curiously, relatively less attention has been paid to
reasoning about monadic programs.
In this report we derive a backtracking algorithm for problem specifications
that use a monadic unfold to generate possible solution... | [
{
"created": "Sat, 23 Jan 2021 03:27:20 GMT",
"version": "v1"
}
] | 2021-01-26 | [
[
"Mu",
"Shin-Cheng",
""
]
] | Equational reasoning is among the most important tools that functional programming provides us. Curiously, relatively less attention has been paid to reasoning about monadic programs. In this report we derive a backtracking algorithm for problem specifications that use a monadic unfold to generate possible solutions, w... |
2004.09141 | Jimmy Wu | Jimmy Wu, Xingyuan Sun, Andy Zeng, Shuran Song, Johnny Lee, Szymon
Rusinkiewicz, Thomas Funkhouser | Spatial Action Maps for Mobile Manipulation | To appear at Robotics: Science and Systems (RSS), 2020. Project page:
https://spatial-action-maps.cs.princeton.edu | null | 10.15607/RSS.2020.XVI.035 | null | cs.RO cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Typical end-to-end formulations for learning robotic navigation involve
predicting a small set of steering command actions (e.g., step forward, turn
left, turn right, etc.) from images of the current state (e.g., a bird's-eye
view of a SLAM reconstruction). Instead, we show that it can be advantageous to
learn with d... | [
{
"created": "Mon, 20 Apr 2020 09:06:10 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Jun 2020 10:56:49 GMT",
"version": "v2"
}
] | 2020-10-13 | [
[
"Wu",
"Jimmy",
""
],
[
"Sun",
"Xingyuan",
""
],
[
"Zeng",
"Andy",
""
],
[
"Song",
"Shuran",
""
],
[
"Lee",
"Johnny",
""
],
[
"Rusinkiewicz",
"Szymon",
""
],
[
"Funkhouser",
"Thomas",
""
]
] | Typical end-to-end formulations for learning robotic navigation involve predicting a small set of steering command actions (e.g., step forward, turn left, turn right, etc.) from images of the current state (e.g., a bird's-eye view of a SLAM reconstruction). Instead, we show that it can be advantageous to learn with den... |
2101.06398 | JianYu Wang | Jianyu Wang, Shanzheng Guan, Shupei Liu, Xiao-Lei Zhang | Minimum-volume Multichannel Nonnegative matrix factorization for blind
source separation | null | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multichannel blind audio source separation aims to recover the latent sources
from their multichannel mixtures without supervised information. One
state-of-the-art blind audio source separation method, named independent
low-rank matrix analysis (ILRMA), unifies independent vector analysis (IVA) and
nonnegative matrix... | [
{
"created": "Sat, 16 Jan 2021 08:12:23 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Mar 2021 03:11:58 GMT",
"version": "v2"
}
] | 2021-03-31 | [
[
"Wang",
"Jianyu",
""
],
[
"Guan",
"Shanzheng",
""
],
[
"Liu",
"Shupei",
""
],
[
"Zhang",
"Xiao-Lei",
""
]
] | Multichannel blind audio source separation aims to recover the latent sources from their multichannel mixtures without supervised information. One state-of-the-art blind audio source separation method, named independent low-rank matrix analysis (ILRMA), unifies independent vector analysis (IVA) and nonnegative matrix f... |
2104.09176 | Stefan Zernetsch | Stefan Zernetsch, Hannes Reichert, Viktor Kress, Konrad Doll, Bernhard
Sick | Cyclist Intention Detection: A Probabilistic Approach | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | This article presents a holistic approach for probabilistic cyclist intention
detection. A basic movement detection based on motion history images (MHI) and
a residual convolutional neural network (ResNet) are used to estimate
probabilities for the current cyclist motion state. These probabilities are
used as weights... | [
{
"created": "Mon, 19 Apr 2021 09:59:04 GMT",
"version": "v1"
}
] | 2021-04-20 | [
[
"Zernetsch",
"Stefan",
""
],
[
"Reichert",
"Hannes",
""
],
[
"Kress",
"Viktor",
""
],
[
"Doll",
"Konrad",
""
],
[
"Sick",
"Bernhard",
""
]
] | This article presents a holistic approach for probabilistic cyclist intention detection. A basic movement detection based on motion history images (MHI) and a residual convolutional neural network (ResNet) are used to estimate probabilities for the current cyclist motion state. These probabilities are used as weights i... |
2105.04112 | Jun Yang | Jun Yang, Yizhou Gao, Dong Li, Steven L. Waslander | ROBI: A Multi-View Dataset for Reflective Objects in Robotic Bin-Picking | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In robotic bin-picking applications, the perception of texture-less, highly
reflective parts is a valuable but challenging task. The high glossiness can
introduce fake edges in RGB images and inaccurate depth measurements especially
in heavily cluttered bin scenario. In this paper, we present the ROBI
(Reflective Obj... | [
{
"created": "Mon, 10 May 2021 04:55:29 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Oct 2021 01:12:20 GMT",
"version": "v2"
}
] | 2021-10-08 | [
[
"Yang",
"Jun",
""
],
[
"Gao",
"Yizhou",
""
],
[
"Li",
"Dong",
""
],
[
"Waslander",
"Steven L.",
""
]
] | In robotic bin-picking applications, the perception of texture-less, highly reflective parts is a valuable but challenging task. The high glossiness can introduce fake edges in RGB images and inaccurate depth measurements especially in heavily cluttered bin scenario. In this paper, we present the ROBI (Reflective Objec... |
2311.06728 | Xiyue Gao | Xiyue Gao, Zhuang Liu, Jiangtao Cui, Hui Li, Hui Zhang, Kewei Wei,
Kankan Zhao | A Comprehensive Survey on Database Management System Fuzzing:
Techniques, Taxonomy and Experimental Comparison | 34 pages, 22 figures | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Database Management System (DBMS) fuzzing is an automated testing technique
aimed at detecting errors and vulnerabilities in DBMSs by generating, mutating,
and executing test cases. It not only reduces the time and cost of manual
testing but also enhances detection coverage, providing valuable assistance in
developin... | [
{
"created": "Sun, 12 Nov 2023 04:18:03 GMT",
"version": "v1"
}
] | 2023-11-14 | [
[
"Gao",
"Xiyue",
""
],
[
"Liu",
"Zhuang",
""
],
[
"Cui",
"Jiangtao",
""
],
[
"Li",
"Hui",
""
],
[
"Zhang",
"Hui",
""
],
[
"Wei",
"Kewei",
""
],
[
"Zhao",
"Kankan",
""
]
] | Database Management System (DBMS) fuzzing is an automated testing technique aimed at detecting errors and vulnerabilities in DBMSs by generating, mutating, and executing test cases. It not only reduces the time and cost of manual testing but also enhances detection coverage, providing valuable assistance in developing ... |
2401.09410 | Bhaskar Mitra | Karina Corti\~nas-Lorenzo, Si\^an Lindley, Ida Larsen-Ledet and
Bhaskar Mitra | Through the Looking-Glass: Transparency Implications and Challenges in
Enterprise AI Knowledge Systems | null | null | null | null | cs.CY cs.AI cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge can't be disentangled from people. As AI knowledge systems mine
vast volumes of work-related data, the knowledge that's being extracted and
surfaced is intrinsically linked to the people who create and use it. When
these systems get embedded in organizational settings, the information that is
brought to the... | [
{
"created": "Wed, 17 Jan 2024 18:47:30 GMT",
"version": "v1"
}
] | 2024-01-18 | [
[
"Cortiñas-Lorenzo",
"Karina",
""
],
[
"Lindley",
"Siân",
""
],
[
"Larsen-Ledet",
"Ida",
""
],
[
"Mitra",
"Bhaskar",
""
]
] | Knowledge can't be disentangled from people. As AI knowledge systems mine vast volumes of work-related data, the knowledge that's being extracted and surfaced is intrinsically linked to the people who create and use it. When these systems get embedded in organizational settings, the information that is brought to the f... |
1902.06950 | Dominic Orchard | Li-yao Xia, Dominic Orchard, Meng Wang | Composing bidirectional programs monadically (with appendices) | Provides the appendices of the paper, which appears in the
proceedings of European Symposium on Programming (ESOP) 2019 | null | null | null | cs.PL | http://creativecommons.org/licenses/by/4.0/ | Software frequently converts data from one representation to another and vice
versa. Naively specifying both conversion directions separately is error prone
and introduces conceptual duplication. Instead, bidirectional programming
techniques allow programs to be written which can be interpreted in both
directions. Ho... | [
{
"created": "Tue, 19 Feb 2019 08:47:23 GMT",
"version": "v1"
}
] | 2019-02-20 | [
[
"Xia",
"Li-yao",
""
],
[
"Orchard",
"Dominic",
""
],
[
"Wang",
"Meng",
""
]
] | Software frequently converts data from one representation to another and vice versa. Naively specifying both conversion directions separately is error prone and introduces conceptual duplication. Instead, bidirectional programming techniques allow programs to be written which can be interpreted in both directions. Howe... |
1309.0752 | Dr. Nadeem Javaid | N. Javaid, O. Rehman, N. Alrajeh, Z. A. Khan, B. Manzoor, S. Ahmed | AID: An Energy Efficient Decoding Scheme for LDPC Codes in Wireless Body
Area Sensor Networks | 2013 International Workshop on Communications and Sensor Networks
(ComSense-2013), Niagara Falls, Ontario, Canada on October 21-24, 2013 in
conjunction with 4th International Conference on Emerging Ubiquitous Systems
and Pervasive Networks (EUSPN-2013) | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the major challenges in Wireless Body Area Networks (WBANs) is to
prolong the lifetime of network. Traditional research work focuses on
minimizing transmit power, however, in the case of short range communication
the consumption power in decoding is significantly larger than transmit power.
This paper investig... | [
{
"created": "Tue, 3 Sep 2013 17:30:48 GMT",
"version": "v1"
}
] | 2013-09-04 | [
[
"Javaid",
"N.",
""
],
[
"Rehman",
"O.",
""
],
[
"Alrajeh",
"N.",
""
],
[
"Khan",
"Z. A.",
""
],
[
"Manzoor",
"B.",
""
],
[
"Ahmed",
"S.",
""
]
] | One of the major challenges in Wireless Body Area Networks (WBANs) is to prolong the lifetime of network. Traditional research work focuses on minimizing transmit power, however, in the case of short range communication the consumption power in decoding is significantly larger than transmit power. This paper investigat... |
2310.00535 | Yuandong Tian | Yuandong Tian, Yiping Wang, Zhenyu Zhang, Beidi Chen, Simon Du | JoMA: Demystifying Multilayer Transformers via JOint Dynamics of MLP and
Attention | ICLR'24 camera ready. Improve theorem 3 and theorem 4. Polish writing
and add code link | null | null | null | cs.LG cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | We propose Joint MLP/Attention (JoMA) dynamics, a novel mathematical
framework to understand the training procedure of multilayer Transformer
architectures. This is achieved by integrating out the self-attention layer in
Transformers, producing a modified dynamics of MLP layers only. JoMA removes
unrealistic assumpti... | [
{
"created": "Sun, 1 Oct 2023 01:21:35 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Oct 2023 04:23:26 GMT",
"version": "v2"
},
{
"created": "Fri, 15 Mar 2024 02:03:21 GMT",
"version": "v3"
}
] | 2024-03-18 | [
[
"Tian",
"Yuandong",
""
],
[
"Wang",
"Yiping",
""
],
[
"Zhang",
"Zhenyu",
""
],
[
"Chen",
"Beidi",
""
],
[
"Du",
"Simon",
""
]
] | We propose Joint MLP/Attention (JoMA) dynamics, a novel mathematical framework to understand the training procedure of multilayer Transformer architectures. This is achieved by integrating out the self-attention layer in Transformers, producing a modified dynamics of MLP layers only. JoMA removes unrealistic assumption... |
2407.19402 | Xihua Sheng | Xihua Sheng, Chuanbo Tang, Li Li, Dong Liu, Feng Wu | NVC-1B: A Large Neural Video Coding Model | null | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The emerging large models have achieved notable progress in the fields of
natural language processing and computer vision. However, large models for
neural video coding are still unexplored. In this paper, we try to explore how
to build a large neural video coding model. Based on a small baseline model, we
gradually ... | [
{
"created": "Sun, 28 Jul 2024 05:12:22 GMT",
"version": "v1"
}
] | 2024-07-30 | [
[
"Sheng",
"Xihua",
""
],
[
"Tang",
"Chuanbo",
""
],
[
"Li",
"Li",
""
],
[
"Liu",
"Dong",
""
],
[
"Wu",
"Feng",
""
]
] | The emerging large models have achieved notable progress in the fields of natural language processing and computer vision. However, large models for neural video coding are still unexplored. In this paper, we try to explore how to build a large neural video coding model. Based on a small baseline model, we gradually sc... |
2208.02504 | Usman Akhtar Dr | Usman Akhtar, Rafal Kucharski | Exploring Computational Complexity Of Ride-Pooling Problems | 13 pages, 7 figures, Submitted to The Transportation Research Board
(TRB), Annual Meeting (102nd) | null | null | null | cs.DS cs.PF | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Ride-pooling is computationally challenging. The number of feasible rides
grows with the number of travelers and the degree (capacity of the vehicle to
perform a pooled ride) and quickly explodes to the sizes making the problem not
solvable analytically. In practice, heuristics are applied to limit the number
of sear... | [
{
"created": "Thu, 4 Aug 2022 07:30:30 GMT",
"version": "v1"
}
] | 2022-08-05 | [
[
"Akhtar",
"Usman",
""
],
[
"Kucharski",
"Rafal",
""
]
] | Ride-pooling is computationally challenging. The number of feasible rides grows with the number of travelers and the degree (capacity of the vehicle to perform a pooled ride) and quickly explodes to the sizes making the problem not solvable analytically. In practice, heuristics are applied to limit the number of search... |
2008.12735 | Donald Honeycutt | Donald R. Honeycutt, Mahsan Nourani, Eric D. Ragan | Soliciting Human-in-the-Loop User Feedback for Interactive Machine
Learning Reduces User Trust and Impressions of Model Accuracy | Accepted and to appear in the Proceedings of the AAAI Conference on
Human Computation and Crowdsourcing (HCOMP) 2020 | null | null | null | cs.HC cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mixed-initiative systems allow users to interactively provide feedback to
potentially improve system performance. Human feedback can correct model errors
and update model parameters to dynamically adapt to changing data.
Additionally, many users desire the ability to have a greater level of control
and fix perceived ... | [
{
"created": "Fri, 28 Aug 2020 16:46:41 GMT",
"version": "v1"
}
] | 2020-08-31 | [
[
"Honeycutt",
"Donald R.",
""
],
[
"Nourani",
"Mahsan",
""
],
[
"Ragan",
"Eric D.",
""
]
] | Mixed-initiative systems allow users to interactively provide feedback to potentially improve system performance. Human feedback can correct model errors and update model parameters to dynamically adapt to changing data. Additionally, many users desire the ability to have a greater level of control and fix perceived fl... |
1802.00304 | Malika Bendechache | Malika Bendechache and M-Tahar Kechadi | Distributed Clustering Algorithm for Spatial Data Mining | 6 pages. arXiv admin note: text overlap with arXiv:1704.03421 | Spatial Data Mining and Geographical Knowledge Services (ICSDM),
2015 2nd IEEE International Conference on, pages 60--65, 2015 | 10.1109/ICSDM.2015.7298026 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed data mining techniques and mainly distributed clustering are
widely used in the last decade because they deal with very large and
heterogeneous datasets which cannot be gathered centrally. Current distributed
clustering approaches are normally generating global models by aggregating
local results that are... | [
{
"created": "Thu, 1 Feb 2018 14:41:33 GMT",
"version": "v1"
}
] | 2018-02-02 | [
[
"Bendechache",
"Malika",
""
],
[
"Kechadi",
"M-Tahar",
""
]
] | Distributed data mining techniques and mainly distributed clustering are widely used in the last decade because they deal with very large and heterogeneous datasets which cannot be gathered centrally. Current distributed clustering approaches are normally generating global models by aggregating local results that are o... |
2109.02682 | Abdulaziz Alaboudi | Abdulaziz Alaboudi, Thomas D. LaToza | Edit-Run Behavior in Programming and Debugging | VL/HCC 2021 | null | null | null | cs.SE cs.HC | http://creativecommons.org/licenses/by/4.0/ | As developers program and debug, they continuously edit and run their code, a
behavior known as edit-run cycles. While techniques such as live programming
are intended to support this behavior, little is known about the
characteristics of edit-run cycles themselves. To bridge this gap, we analyzed
28 hours of program... | [
{
"created": "Mon, 6 Sep 2021 18:06:01 GMT",
"version": "v1"
}
] | 2021-09-08 | [
[
"Alaboudi",
"Abdulaziz",
""
],
[
"LaToza",
"Thomas D.",
""
]
] | As developers program and debug, they continuously edit and run their code, a behavior known as edit-run cycles. While techniques such as live programming are intended to support this behavior, little is known about the characteristics of edit-run cycles themselves. To bridge this gap, we analyzed 28 hours of programmi... |
1902.10030 | Hussam Qassim Mr. | Hussein A. Al-Barazanchi, Hussam Qassim, David Feinzimer, and Abhishek
Verma | Residual-CNDS for Grand Challenge Scene Dataset | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Increasing depth of convolutional neural networks (CNNs) is a highly
promising method of increasing the accuracy of the (CNNs). Increased CNN depth
will also result in increased layer count (parameters), leading to a slow
backpropagation convergence prone to overfitting. We trained our model
(Residual-CNDS) to classi... | [
{
"created": "Sun, 13 Jan 2019 23:00:11 GMT",
"version": "v1"
}
] | 2019-02-27 | [
[
"Al-Barazanchi",
"Hussein A.",
""
],
[
"Qassim",
"Hussam",
""
],
[
"Feinzimer",
"David",
""
],
[
"Verma",
"Abhishek",
""
]
] | Increasing depth of convolutional neural networks (CNNs) is a highly promising method of increasing the accuracy of the (CNNs). Increased CNN depth will also result in increased layer count (parameters), leading to a slow backpropagation convergence prone to overfitting. We trained our model (Residual-CNDS) to classify... |
2302.08624 | Kevin Scaria | Kevin Scaria and Himanshu Gupta and Siddharth Goyal and Saurabh Arjun
Sawant and Swaroop Mishra and Chitta Baral | InstructABSA: Instruction Learning for Aspect Based Sentiment Analysis | 4 pages, 3 figures, 9 tables, 9 appendix pages | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce InstructABSA, an instruction learning paradigm for Aspect-Based
Sentiment Analysis (ABSA) subtasks. Our method introduces positive, negative,
and neutral examples to each training sample, and instruction tune the model
(Tk-Instruct) for ABSA subtasks, yielding significant performance improvements.
Experi... | [
{
"created": "Thu, 16 Feb 2023 23:29:22 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Feb 2023 06:53:41 GMT",
"version": "v2"
},
{
"created": "Wed, 5 Apr 2023 04:44:43 GMT",
"version": "v3"
},
{
"created": "Thu, 20 Apr 2023 05:57:12 GMT",
"version": "v4"
},
{
"cr... | 2023-11-14 | [
[
"Scaria",
"Kevin",
""
],
[
"Gupta",
"Himanshu",
""
],
[
"Goyal",
"Siddharth",
""
],
[
"Sawant",
"Saurabh Arjun",
""
],
[
"Mishra",
"Swaroop",
""
],
[
"Baral",
"Chitta",
""
]
] | We introduce InstructABSA, an instruction learning paradigm for Aspect-Based Sentiment Analysis (ABSA) subtasks. Our method introduces positive, negative, and neutral examples to each training sample, and instruction tune the model (Tk-Instruct) for ABSA subtasks, yielding significant performance improvements. Experime... |
2105.11927 | Chong Peng | Yang Liu, Qian Zhang, Yongyong Chen, Qiang Cheng and Chong Peng | Hyperspectral Image Denoising with Log-Based Robust PCA | null | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | It is a challenging task to remove heavy and mixed types of noise from
Hyperspectral images (HSIs). In this paper, we propose a novel nonconvex
approach to RPCA for HSI denoising, which adopts the log-determinant rank
approximation and a novel $\ell_{2,\log}$ norm, to restrict the low-rank or
column-wise sparse prope... | [
{
"created": "Tue, 25 May 2021 13:32:01 GMT",
"version": "v1"
}
] | 2021-05-26 | [
[
"Liu",
"Yang",
""
],
[
"Zhang",
"Qian",
""
],
[
"Chen",
"Yongyong",
""
],
[
"Cheng",
"Qiang",
""
],
[
"Peng",
"Chong",
""
]
] | It is a challenging task to remove heavy and mixed types of noise from Hyperspectral images (HSIs). In this paper, we propose a novel nonconvex approach to RPCA for HSI denoising, which adopts the log-determinant rank approximation and a novel $\ell_{2,\log}$ norm, to restrict the low-rank or column-wise sparse propert... |
2205.08383 | Matheus Schmitz | Matheus Schmitz, Rehan Ahmed, Jimi Cao | Bias and Fairness on Multimodal Emotion Detection Algorithms | null | null | 10.13140/RG.2.2.14341.01769 | null | cs.LG cs.AI cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Numerous studies have shown that machine learning algorithms can latch onto
protected attributes such as race and gender and generate predictions that
systematically discriminate against one or more groups. To date the majority of
bias and fairness research has been on unimodal models. In this work, we
explore the bi... | [
{
"created": "Wed, 11 May 2022 20:03:25 GMT",
"version": "v1"
}
] | 2022-05-18 | [
[
"Schmitz",
"Matheus",
""
],
[
"Ahmed",
"Rehan",
""
],
[
"Cao",
"Jimi",
""
]
] | Numerous studies have shown that machine learning algorithms can latch onto protected attributes such as race and gender and generate predictions that systematically discriminate against one or more groups. To date the majority of bias and fairness research has been on unimodal models. In this work, we explore the bias... |
2406.19106 | Francesco Cambria | Francesco Cambria, Francesco Invernici, Anna Bernasconi and Stefano
Ceri | MINE GRAPH RULE: A New Cypher-like Operator for Mining Association Rules
on Property Graphs | null | null | null | null | cs.DB | http://creativecommons.org/licenses/by-sa/4.0/ | Mining information from graph databases is becoming overly important. To
approach this problem, current methods focus on identifying subgraphs with
specific topologies; as of today, no work has been focused on expressing
jointly the syntax and semantics of mining operations over rich property
graphs. We define MINE G... | [
{
"created": "Thu, 27 Jun 2024 11:33:16 GMT",
"version": "v1"
}
] | 2024-06-28 | [
[
"Cambria",
"Francesco",
""
],
[
"Invernici",
"Francesco",
""
],
[
"Bernasconi",
"Anna",
""
],
[
"Ceri",
"Stefano",
""
]
] | Mining information from graph databases is becoming overly important. To approach this problem, current methods focus on identifying subgraphs with specific topologies; as of today, no work has been focused on expressing jointly the syntax and semantics of mining operations over rich property graphs. We define MINE GRA... |
1505.02898 | Bikramjit Singh | Bikramjit Singh, Konstantinos Koufos, Olav Tirkkonen | Coordination protocol for inter-operator spectrum sharing based on
spectrum usage favors | Published in proceedings of 23rd edition of European Conference on
Networks and Communications (EuCNC), Bologna, Jun. 2014 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Currently, mobile network operators are allocated spectrum bands on an
exclusive basis. While this approach facilitates interference control, it may
also result in low spectrum utilization efficiency. Inter-operator spectrum
sharing is a potential method to enhance spectrum utilization. In order to
realize it, a prot... | [
{
"created": "Tue, 12 May 2015 08:10:44 GMT",
"version": "v1"
}
] | 2015-05-13 | [
[
"Singh",
"Bikramjit",
""
],
[
"Koufos",
"Konstantinos",
""
],
[
"Tirkkonen",
"Olav",
""
]
] | Currently, mobile network operators are allocated spectrum bands on an exclusive basis. While this approach facilitates interference control, it may also result in low spectrum utilization efficiency. Inter-operator spectrum sharing is a potential method to enhance spectrum utilization. In order to realize it, a protoc... |
1908.07820 | XiaoKang Liu | Jianquan Li, Xiaokang Liu, Wenpeng Yin, Min Yang, Liqun Ma, Yaohong
Jin | Empirical Evaluation of Multi-task Learning in Deep Neural Networks for
Natural Language Processing | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-Task Learning (MTL) aims at boosting the overall performance of each
individual task by leveraging useful information contained in multiple related
tasks. It has shown great success in natural language processing (NLP).
Currently, a number of MLT architectures and learning mechanisms have been
proposed for vari... | [
{
"created": "Fri, 16 Aug 2019 03:16:40 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Aug 2020 08:06:18 GMT",
"version": "v2"
}
] | 2020-08-10 | [
[
"Li",
"Jianquan",
""
],
[
"Liu",
"Xiaokang",
""
],
[
"Yin",
"Wenpeng",
""
],
[
"Yang",
"Min",
""
],
[
"Ma",
"Liqun",
""
],
[
"Jin",
"Yaohong",
""
]
] | Multi-Task Learning (MTL) aims at boosting the overall performance of each individual task by leveraging useful information contained in multiple related tasks. It has shown great success in natural language processing (NLP). Currently, a number of MLT architectures and learning mechanisms have been proposed for variou... |
1704.01893 | Lukas Holzbaur | Lukas Holzbaur, Hannes Bartz, Antonia Wachter-Zeh | Improved Decoding and Error Floor Analysis of Staircase Codes | null | null | 10.1007/s10623-018-0587-x | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Staircase codes play an important role as error-correcting codes in optical
communications. In this paper, a low-complexity method for resolving stall
patterns when decoding staircase codes is described. Stall patterns are the
dominating contributor to the error floor in the original decoding method. Our
improvement ... | [
{
"created": "Thu, 6 Apr 2017 15:39:52 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Jan 2018 08:36:43 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Jul 2018 13:49:30 GMT",
"version": "v3"
},
{
"created": "Mon, 3 Dec 2018 09:26:43 GMT",
"version": "v4"
}
] | 2018-12-04 | [
[
"Holzbaur",
"Lukas",
""
],
[
"Bartz",
"Hannes",
""
],
[
"Wachter-Zeh",
"Antonia",
""
]
] | Staircase codes play an important role as error-correcting codes in optical communications. In this paper, a low-complexity method for resolving stall patterns when decoding staircase codes is described. Stall patterns are the dominating contributor to the error floor in the original decoding method. Our improvement is... |
1506.03340 | Karl Moritz Hermann | Karl Moritz Hermann, Tom\'a\v{s} Ko\v{c}isk\'y, Edward Grefenstette,
Lasse Espeholt, Will Kay, Mustafa Suleyman and Phil Blunsom | Teaching Machines to Read and Comprehend | Appears in: Advances in Neural Information Processing Systems 28
(NIPS 2015). 14 pages, 13 figures | null | null | null | cs.CL cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Teaching machines to read natural language documents remains an elusive
challenge. Machine reading systems can be tested on their ability to answer
questions posed on the contents of documents that they have seen, but until now
large scale training and test datasets have been missing for this type of
evaluation. In t... | [
{
"created": "Wed, 10 Jun 2015 14:54:39 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Oct 2015 15:04:49 GMT",
"version": "v2"
},
{
"created": "Thu, 19 Nov 2015 15:43:23 GMT",
"version": "v3"
}
] | 2015-11-20 | [
[
"Hermann",
"Karl Moritz",
""
],
[
"Kočiský",
"Tomáš",
""
],
[
"Grefenstette",
"Edward",
""
],
[
"Espeholt",
"Lasse",
""
],
[
"Kay",
"Will",
""
],
[
"Suleyman",
"Mustafa",
""
],
[
"Blunsom",
"Phil",
""
]
] | Teaching machines to read natural language documents remains an elusive challenge. Machine reading systems can be tested on their ability to answer questions posed on the contents of documents that they have seen, but until now large scale training and test datasets have been missing for this type of evaluation. In thi... |
1911.12396 | Marcelo Firer | Marcelo Firer | Alternative Metrics | This is a chapter for "Concise Encyclopedia of Coding Theory" to be
published by CRC Press | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main scope of this chapter is metrics defined for coding and decoding
purposes, mainly for block codes.
| [
{
"created": "Wed, 27 Nov 2019 19:46:55 GMT",
"version": "v1"
}
] | 2019-12-02 | [
[
"Firer",
"Marcelo",
""
]
] | The main scope of this chapter is metrics defined for coding and decoding purposes, mainly for block codes. |
1701.05924 | Maria Cabrera | Maria Cabrera, Richard Voyles, Juan Wachs | Coherency in One-Shot Gesture Recognition | This paper was submitted to a IEEE conference | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | User's intentions may be expressed through spontaneous gesturing, which have
been seen only a few times or never before. Recognizing such gestures involves
one shot gesture learning. While most research has focused on the recognition
of the gestures itself, recently new approaches were proposed to deal with
gesture p... | [
{
"created": "Fri, 20 Jan 2017 20:54:10 GMT",
"version": "v1"
}
] | 2017-01-24 | [
[
"Cabrera",
"Maria",
""
],
[
"Voyles",
"Richard",
""
],
[
"Wachs",
"Juan",
""
]
] | User's intentions may be expressed through spontaneous gesturing, which have been seen only a few times or never before. Recognizing such gestures involves one shot gesture learning. While most research has focused on the recognition of the gestures itself, recently new approaches were proposed to deal with gesture per... |
2206.04928 | Mohit Vaishnav | Mohit Vaishnav, Thomas Serre | GAMR: A Guided Attention Model for (visual) Reasoning | null | Eleventh International Conference on Learning Representations
(ICLR) 2023 | null | null | cs.AI cs.LG cs.NE cs.SC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Humans continue to outperform modern AI systems in their ability to flexibly
parse and understand complex visual scenes. Here, we present a novel module for
visual reasoning, the Guided Attention Model for (visual) Reasoning (GAMR),
which instantiates an active vision theory -- positing that the brain solves
complex ... | [
{
"created": "Fri, 10 Jun 2022 07:52:06 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Jun 2022 17:52:57 GMT",
"version": "v2"
},
{
"created": "Wed, 21 Sep 2022 10:17:20 GMT",
"version": "v3"
},
{
"created": "Thu, 22 Sep 2022 11:57:12 GMT",
"version": "v4"
},
{
"c... | 2023-03-22 | [
[
"Vaishnav",
"Mohit",
""
],
[
"Serre",
"Thomas",
""
]
] | Humans continue to outperform modern AI systems in their ability to flexibly parse and understand complex visual scenes. Here, we present a novel module for visual reasoning, the Guided Attention Model for (visual) Reasoning (GAMR), which instantiates an active vision theory -- positing that the brain solves complex vi... |
2303.05862 | Margherita Bert\`e | Margherita Bert\`e, Kyriaki Kalimeri, Daniela Paolotti | Monitoring Gender Gaps via LinkedIn Advertising Estimates: the case
study of Italy | 10 pages | In Proceedings of the ACM Web Science Conference 2023 (WebSci
'23), April 30-May 1, 2023, Evanston, TX, USA. ACM, New York, NY, USA, 10
pages | 10.1145/3578503.3583629 | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Women remain underrepresented in the labour market. Although significant
advancements are being made to increase female participation in the workforce,
the gender gap is still far from being bridged. We contribute to the growing
literature on gender inequalities in the labour market, evaluating the
potential of the L... | [
{
"created": "Fri, 10 Mar 2023 11:32:45 GMT",
"version": "v1"
}
] | 2023-03-13 | [
[
"Bertè",
"Margherita",
""
],
[
"Kalimeri",
"Kyriaki",
""
],
[
"Paolotti",
"Daniela",
""
]
] | Women remain underrepresented in the labour market. Although significant advancements are being made to increase female participation in the workforce, the gender gap is still far from being bridged. We contribute to the growing literature on gender inequalities in the labour market, evaluating the potential of the Lin... |
2104.00236 | Jack Li | Jianhua Li, Ximeng Liu, Jiong Jin, Shui Yu | Too Expensive to Attack: A Joint Defense Framework to Mitigate
Distributed Attacks for the Internet of Things Grid | 10 pages, 10 figures, 5 tables | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The distributed denial of service (DDoS) attack is detrimental to businesses
and individuals as we are heavily relying on the Internet. Due to remarkable
profits, crackers favor DDoS as cybersecurity weapons in attacking servers,
computers, IoT devices, and even the entire Internet. Many current detection
and mitigat... | [
{
"created": "Thu, 1 Apr 2021 03:40:29 GMT",
"version": "v1"
}
] | 2021-04-02 | [
[
"Li",
"Jianhua",
""
],
[
"Liu",
"Ximeng",
""
],
[
"Jin",
"Jiong",
""
],
[
"Yu",
"Shui",
""
]
] | The distributed denial of service (DDoS) attack is detrimental to businesses and individuals as we are heavily relying on the Internet. Due to remarkable profits, crackers favor DDoS as cybersecurity weapons in attacking servers, computers, IoT devices, and even the entire Internet. Many current detection and mitigatio... |
1701.00146 | Erik Demaine | Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg,
Pasin Manurangsi, Anak Yodpinyanee | Even $1 \times n$ Edge-Matching and Jigsaw Puzzles are Really Hard | 22 pages, 9 figures | null | null | null | cs.CC cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove the computational intractability of rotating and placing $n$ square
tiles into a $1 \times n$ array such that adjacent tiles are compatible--either
equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes,
as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-hard
even t... | [
{
"created": "Sat, 31 Dec 2016 17:05:53 GMT",
"version": "v1"
}
] | 2017-01-03 | [
[
"Bosboom",
"Jeffrey",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Hesterberg",
"Adam",
""
],
[
"Manurangsi",
"Pasin",
""
],
[
"Yodpinyanee",
"Anak",
""
]
] | We prove the computational intractability of rotating and placing $n$ square tiles into a $1 \times n$ array such that adjacent tiles are compatible--either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-hard even to ... |
1002.1691 | Rdv Ijcsis | Sumon Kumar Debnath, Foez Ahmed, Nayeema Islam | Performance Evaluation of Unicast and Broadcast Mobile Ad hoc Network
Routing Protocols | 7 Pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS January 2010, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/ | International Journal of Computer Science and Information
Security, IJCSIS, Vol. 7, No. 1, pp. 40-46, January 2010, USA | null | Computer Science Volume 7 ISSN 19475500 | cs.NI cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Efficient routing mechanism is a challenging issue for group oriented
computing in Mobile Ad Hoc Networks (MANETs). The ability of MANETs to support
adequate Quality of Service (QoS) for group communication is limited by the
ability of the underlying ad-hoc routing protocols to provide consistent
behavior despite the... | [
{
"created": "Mon, 8 Feb 2010 19:12:53 GMT",
"version": "v1"
}
] | 2010-02-09 | [
[
"Debnath",
"Sumon Kumar",
""
],
[
"Ahmed",
"Foez",
""
],
[
"Islam",
"Nayeema",
""
]
] | Efficient routing mechanism is a challenging issue for group oriented computing in Mobile Ad Hoc Networks (MANETs). The ability of MANETs to support adequate Quality of Service (QoS) for group communication is limited by the ability of the underlying ad-hoc routing protocols to provide consistent behavior despite the d... |
1903.01298 | Elvin Isufi | Elvin Isufi, Fernando Gama, Alejandro Ribeiro | Generalizing Graph Convolutional Neural Networks with Edge-Variant
Recursions on Graphs | submitted to EUSIPCO 2019 | null | null | null | cs.LG eess.SP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper reviews graph convolutional neural networks (GCNNs) through the
lens of edge-variant graph filters. The edge-variant graph filter is a finite
order, linear, and local recursion that allows each node, in each iteration, to
weigh differently the information of its neighbors. By exploiting this
recursion, we ... | [
{
"created": "Mon, 4 Mar 2019 15:05:36 GMT",
"version": "v1"
}
] | 2019-03-05 | [
[
"Isufi",
"Elvin",
""
],
[
"Gama",
"Fernando",
""
],
[
"Ribeiro",
"Alejandro",
""
]
] | This paper reviews graph convolutional neural networks (GCNNs) through the lens of edge-variant graph filters. The edge-variant graph filter is a finite order, linear, and local recursion that allows each node, in each iteration, to weigh differently the information of its neighbors. By exploiting this recursion, we fo... |
1809.00952 | Irvin Aloise | Irvin Aloise and Giorgio Grisetti | Matrix Difference in Pose-Graph Optimization | 10 pages, 7 figures, source:
https://srrg.gitlab.io/g2o_chordal_plugin.html | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pose-Graph optimization is a crucial component of many modern SLAM systems.
Most prominent state of the art systems address this problem by iterative
non-linear least squares. Both number of iterations and convergence basin of
these approaches depend on the error functions used to describe the problem.
The smoother a... | [
{
"created": "Tue, 4 Sep 2018 13:41:01 GMT",
"version": "v1"
}
] | 2018-09-05 | [
[
"Aloise",
"Irvin",
""
],
[
"Grisetti",
"Giorgio",
""
]
] | Pose-Graph optimization is a crucial component of many modern SLAM systems. Most prominent state of the art systems address this problem by iterative non-linear least squares. Both number of iterations and convergence basin of these approaches depend on the error functions used to describe the problem. The smoother and... |
2302.05959 | Yanheng Li | Yanheng Li, Lin Luoying, Xinyan Li, Yaxuan Mao, Ray Lc | "Nice to meet you!": Expressing Emotions with Movement Gestures and
Textual Content in Automatic Handwriting Robots | HRI 2023 LBR | null | 10.1145/3568294.3580045 | null | cs.HC cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text-writing robots have been used in assistive writing and drawing
applications. However, robots do not convey emotional tones in the writing
process due to the lack of behaviors humans typically adopt. To examine how
people interpret designed robotic expressions of emotion through both movements
and textual output,... | [
{
"created": "Sun, 12 Feb 2023 17:13:25 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"Li",
"Yanheng",
""
],
[
"Luoying",
"Lin",
""
],
[
"Li",
"Xinyan",
""
],
[
"Mao",
"Yaxuan",
""
],
[
"Lc",
"Ray",
""
]
] | Text-writing robots have been used in assistive writing and drawing applications. However, robots do not convey emotional tones in the writing process due to the lack of behaviors humans typically adopt. To examine how people interpret designed robotic expressions of emotion through both movements and textual output, w... |
2107.07116 | Feng Shi | Feng Shi, Chonghan Lee, Mohammad Khairul Bashar, Nikhil Shukla,
Song-Chun Zhu and Vijaykrishnan Narayanan | Transformer-based Machine Learning for Fast SAT Solvers and Logic
Synthesis | null | null | null | null | cs.NE cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | CNF-based SAT and MaxSAT solvers are central to logic synthesis and
verification systems. The increasing popularity of these constraint problems in
electronic design automation encourages studies on different SAT problems and
their properties for further computational efficiency. There has been both
theoretical and p... | [
{
"created": "Thu, 15 Jul 2021 04:47:35 GMT",
"version": "v1"
}
] | 2021-07-16 | [
[
"Shi",
"Feng",
""
],
[
"Lee",
"Chonghan",
""
],
[
"Bashar",
"Mohammad Khairul",
""
],
[
"Shukla",
"Nikhil",
""
],
[
"Zhu",
"Song-Chun",
""
],
[
"Narayanan",
"Vijaykrishnan",
""
]
] | CNF-based SAT and MaxSAT solvers are central to logic synthesis and verification systems. The increasing popularity of these constraint problems in electronic design automation encourages studies on different SAT problems and their properties for further computational efficiency. There has been both theoretical and pra... |
2106.13679 | Giovanni Trappolini | Giovanni Trappolini, Luca Cosmo, Luca Moschella, Riccardo Marin,
Simone Melzi, Emanuele Rodol\`a | Shape registration in the time of transformers | null | null | null | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a transformer-based procedure for the efficient
registration of non-rigid 3D point clouds. The proposed approach is data-driven
and adopts for the first time the transformer architecture in the registration
task. Our method is general and applies to different settings. Given a fixed
template... | [
{
"created": "Fri, 25 Jun 2021 15:02:30 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Jun 2021 07:56:20 GMT",
"version": "v2"
}
] | 2021-06-29 | [
[
"Trappolini",
"Giovanni",
""
],
[
"Cosmo",
"Luca",
""
],
[
"Moschella",
"Luca",
""
],
[
"Marin",
"Riccardo",
""
],
[
"Melzi",
"Simone",
""
],
[
"Rodolà",
"Emanuele",
""
]
] | In this paper, we propose a transformer-based procedure for the efficient registration of non-rigid 3D point clouds. The proposed approach is data-driven and adopts for the first time the transformer architecture in the registration task. Our method is general and applies to different settings. Given a fixed template w... |
1801.07743 | Pedro Saleiro | Pedro Saleiro | Entity Retrieval and Text Mining for Online Reputation Monitoring | PhD Thesis | null | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online Reputation Monitoring (ORM) is concerned with the use of computational
tools to measure the reputation of entities online, such as politicians or
companies. In practice, current ORM methods are constrained to the generation
of data analytics reports, which aggregate statistics of popularity and
sentiment on so... | [
{
"created": "Tue, 23 Jan 2018 19:36:29 GMT",
"version": "v1"
}
] | 2018-01-25 | [
[
"Saleiro",
"Pedro",
""
]
] | Online Reputation Monitoring (ORM) is concerned with the use of computational tools to measure the reputation of entities online, such as politicians or companies. In practice, current ORM methods are constrained to the generation of data analytics reports, which aggregate statistics of popularity and sentiment on soci... |
1811.08203 | Noveen Sachdeva | Noveen Sachdeva, Kartik Gupta, Vikram Pudi | Attentive Neural Architecture Incorporating Song Features For Music
Recommendation | Accepted as a paper at the 12th ACM Conference on Recommender Systems
(RecSys 18) | 12th ACM Conference on Recommender Systems (RecSys '18). ACM
(2018) 417-421 | 10.1145/3240323.3240397 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommender Systems are an integral part of music sharing platforms. Often
the aim of these systems is to increase the time, the user spends on the
platform and hence having a high commercial value. The systems which aim at
increasing the average time a user spends on the platform often need to
recommend songs which ... | [
{
"created": "Tue, 20 Nov 2018 12:10:06 GMT",
"version": "v1"
}
] | 2018-11-21 | [
[
"Sachdeva",
"Noveen",
""
],
[
"Gupta",
"Kartik",
""
],
[
"Pudi",
"Vikram",
""
]
] | Recommender Systems are an integral part of music sharing platforms. Often the aim of these systems is to increase the time, the user spends on the platform and hence having a high commercial value. The systems which aim at increasing the average time a user spends on the platform often need to recommend songs which th... |
0710.2139 | Ashkan Aazami | Ashkan Aazami, Michael D. Stilp | Approximation algorithms and hardness for domination with propagation | null | null | null | null | cs.CC cs.DM | null | The power dominating set (PDS) problem is the following extension of the
well-known dominating set problem: find a smallest-size set of nodes $S$ that
power dominates all the nodes, where a node $v$ is power dominated if (1) $v$
is in $S$ or $v$ has a neighbor in $S$, or (2) $v$ has a neighbor $w$ such that
$w$ and a... | [
{
"created": "Wed, 10 Oct 2007 23:30:49 GMT",
"version": "v1"
}
] | 2007-10-12 | [
[
"Aazami",
"Ashkan",
""
],
[
"Stilp",
"Michael D.",
""
]
] | The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$ or $v$ has a neighbor in $S$, or (2) $v$ has a neighbor $w$ such that $w$ and all... |
2110.06750 | Darius Sas | Darius Sas, Ilaria Pigazzini, Paris Avgeriou, Francesca Arcelli
Fontana | The perception of Architectural Smells in industrial practice | Submitted and accepted to IEEE Software special issue on Technical
Debt. This is a preprint | null | 10.1109/MS.2021.3103664 | null | cs.SE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Architectural Technical Debt (ATD) is considered as the most significant type
of TD in industrial practice. In this study, we interview 21 software engineers
and architects to investigate a specific type of ATD, namely architectural
smells (AS). Our goal is to understand the phenomenon of AS better and support
practi... | [
{
"created": "Wed, 13 Oct 2021 14:29:31 GMT",
"version": "v1"
}
] | 2022-03-17 | [
[
"Sas",
"Darius",
""
],
[
"Pigazzini",
"Ilaria",
""
],
[
"Avgeriou",
"Paris",
""
],
[
"Fontana",
"Francesca Arcelli",
""
]
] | Architectural Technical Debt (ATD) is considered as the most significant type of TD in industrial practice. In this study, we interview 21 software engineers and architects to investigate a specific type of ATD, namely architectural smells (AS). Our goal is to understand the phenomenon of AS better and support practiti... |
2008.09645 | Sheng Liu | Sheng Liu, Zuo-Jun Max Shen, Xiang Ji | Urban Bike Lane Planning with Bike Trajectories: Models, Algorithms, and
a Real-World Case Study | null | null | null | null | cs.AI cs.CE math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study an urban bike lane planning problem based on the fine-grained bike
trajectory data, which is made available by smart city infrastructure such as
bike-sharing systems. The key decision is where to build bike lanes in the
existing road network. As bike-sharing systems become widespread in the
metropolitan area... | [
{
"created": "Fri, 21 Aug 2020 18:46:51 GMT",
"version": "v1"
}
] | 2020-08-25 | [
[
"Liu",
"Sheng",
""
],
[
"Shen",
"Zuo-Jun Max",
""
],
[
"Ji",
"Xiang",
""
]
] | We study an urban bike lane planning problem based on the fine-grained bike trajectory data, which is made available by smart city infrastructure such as bike-sharing systems. The key decision is where to build bike lanes in the existing road network. As bike-sharing systems become widespread in the metropolitan areas ... |
1212.3879 | EPTCS | Jurriaan Rot (LIACS - Leiden University, The Netherlands), Irina
M\u{a}riuca As\u{a}voae (Alexandru Ioan Cuza University, Romania), Frank de
Boer (Centrum Wiskunde en Informatica (CWI), The Netherlands), Marcello M.
Bonsangue (LIACS - Leiden University, The Netherlands), Dorel Lucanu
(Alexandru Ioan Cuza Univer... | Interacting via the Heap in the Presence of Recursion | In Proceedings ICE 2012, arXiv:1212.3458 | EPTCS 104, 2012, pp. 99-113 | 10.4204/EPTCS.104.9 | null | cs.PL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Almost all modern imperative programming languages include operations for
dynamically manipulating the heap, for example by allocating and deallocating
objects, and by updating reference fields. In the presence of recursive
procedures and local variables the interactions of a program with the heap can
become rather c... | [
{
"created": "Mon, 17 Dec 2012 03:42:47 GMT",
"version": "v1"
}
] | 2012-12-18 | [
[
"Rot",
"Jurriaan",
"",
"LIACS - Leiden University, The Netherlands"
],
[
"Asăvoae",
"Irina Măriuca",
"",
"Alexandru Ioan Cuza University, Romania"
],
[
"de Boer",
"Frank",
"",
"Centrum Wiskunde en Informatica"
],
[
"Bonsangue",
"Marcello M.",
... | Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables the interactions of a program with the heap can become rather com... |
1903.00565 | Behnam Askarian | Fatemeh Sadat Tabei and Behnam Askarian | Effect of Proxy Nodes on the Performance of TCP-Based Transport Layer
Protocols in Wireless Sensor Networks | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wireless Sensor Networks have recently attracted many researchers attentions
due to their wide range of applications. Even though a plethora of studies have
been carried out on characteristics, special conditions, and various aspects of
WSNs, transport protocol which is compatible with conditions of Wireless Sensor
N... | [
{
"created": "Fri, 1 Mar 2019 22:31:03 GMT",
"version": "v1"
}
] | 2019-03-05 | [
[
"Tabei",
"Fatemeh Sadat",
""
],
[
"Askarian",
"Behnam",
""
]
] | Wireless Sensor Networks have recently attracted many researchers attentions due to their wide range of applications. Even though a plethora of studies have been carried out on characteristics, special conditions, and various aspects of WSNs, transport protocol which is compatible with conditions of Wireless Sensor Net... |
2112.13808 | Jamin Shin | Jamin Shin, Juneyoung Park | Pedagogical Word Recommendation: A novel task and dataset on
personalized vocabulary acquisition for L2 learners | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When learning a second language (L2), one of the most important but tedious
components that often demoralizes students with its ineffectiveness and
inefficiency is vocabulary acquisition, or more simply put, memorizing words.
In light of such, a personalized and educational vocabulary recommendation
system that trace... | [
{
"created": "Mon, 27 Dec 2021 17:52:48 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Dec 2021 04:52:26 GMT",
"version": "v2"
}
] | 2021-12-30 | [
[
"Shin",
"Jamin",
""
],
[
"Park",
"Juneyoung",
""
]
] | When learning a second language (L2), one of the most important but tedious components that often demoralizes students with its ineffectiveness and inefficiency is vocabulary acquisition, or more simply put, memorizing words. In light of such, a personalized and educational vocabulary recommendation system that traces ... |
2403.01649 | Steven Bellovin | Susan Landau, James X. Dempsey, Ece Kamar, Steven M. Bellovin | Recommendations for Government Development and Use of Advanced Automated
Systems to Make Decisions about Individuals | null | null | null | null | cs.CY cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Contestability -- the ability to effectively challenge a decision -- is
critical to the implementation of fairness. In the context of governmental
decision making about individuals, contestability is often constitutionally
required as an element of due process; specific procedures may be required by
state or federal ... | [
{
"created": "Mon, 4 Mar 2024 00:03:00 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Landau",
"Susan",
""
],
[
"Dempsey",
"James X.",
""
],
[
"Kamar",
"Ece",
""
],
[
"Bellovin",
"Steven M.",
""
]
] | Contestability -- the ability to effectively challenge a decision -- is critical to the implementation of fairness. In the context of governmental decision making about individuals, contestability is often constitutionally required as an element of due process; specific procedures may be required by state or federal la... |
2108.09956 | Deborah Amos Phiri | Deborah Amos Phiri and Chipo Kanjo | Policy-Practice Contradiction: Case of Cloud Computing Adoption in the
Malawi Health Sector | In proceedings of the 1st Virtual Conference on Implications of
Information and Digital Technologies for Development, 2021 | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper examines the dynamics of policy implementation and how policy
contradicts reality on the ground when it comes to practice. The paper finds
that despite having well-laid out policy; the actual practice is contrary.
Taking data storage policy within the Ministry of Health in Malawi as a case
study, the paper... | [
{
"created": "Mon, 23 Aug 2021 05:59:46 GMT",
"version": "v1"
}
] | 2021-08-24 | [
[
"Phiri",
"Deborah Amos",
""
],
[
"Kanjo",
"Chipo",
""
]
] | This paper examines the dynamics of policy implementation and how policy contradicts reality on the ground when it comes to practice. The paper finds that despite having well-laid out policy; the actual practice is contrary. Taking data storage policy within the Ministry of Health in Malawi as a case study, the paper h... |
1403.5468 | Jian-Jun Shu | Jian-Jun Shu and Qi-Wen Wang | Beyond Parrondo's paradox | null | Scientific Reports, Vol. 4, No. 4244, pp. 1-9, 2014 | 10.1038/srep04244 | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Parrondo's paradox is a counterintuitive phenomenon where
individually-losing strategies can be combined in producing a winning
expectation. In this paper, the issues surrounding the Parrondo's paradox are
investigated. The focus is lying on testifying whether the same paradoxical
effect can be reproduced by usin... | [
{
"created": "Fri, 21 Mar 2014 14:10:46 GMT",
"version": "v1"
}
] | 2014-03-24 | [
[
"Shu",
"Jian-Jun",
""
],
[
"Wang",
"Qi-Wen",
""
]
] | The Parrondo's paradox is a counterintuitive phenomenon where individually-losing strategies can be combined in producing a winning expectation. In this paper, the issues surrounding the Parrondo's paradox are investigated. The focus is lying on testifying whether the same paradoxical effect can be reproduced by using ... |
1810.03120 | Andrzej Pelc | Andrzej Pelc, Ram Narayan Yadav | Using Time to Break Symmetry: Universal Deterministic Anonymous
Rendezvous | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Two anonymous mobile agents navigate synchronously in an anonymous graph and
have to meet at a node, using a deterministic algorithm. This is a symmetry
breaking task called rendezvous, equivalent to the fundamental task of leader
election between the agents. When is this feasible in a completely anonymous
environmen... | [
{
"created": "Sun, 7 Oct 2018 11:16:59 GMT",
"version": "v1"
}
] | 2018-10-09 | [
[
"Pelc",
"Andrzej",
""
],
[
"Yadav",
"Ram Narayan",
""
]
] | Two anonymous mobile agents navigate synchronously in an anonymous graph and have to meet at a node, using a deterministic algorithm. This is a symmetry breaking task called rendezvous, equivalent to the fundamental task of leader election between the agents. When is this feasible in a completely anonymous environment?... |
2405.03724 | Junxiang Wang | Junxiang Wang and Liang Zhao | GraphSL: An Open-Source Library for Graph Source Localization Approaches
and Benchmark Datasets | null | null | null | null | cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce GraphSL, a new library for studying the graph source
localization problem. graph diffusion and graph source localization are inverse
problems in nature: graph diffusion predicts information diffusions from
information sources, while graph source localization predicts information
sources from information ... | [
{
"created": "Mon, 6 May 2024 04:00:00 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Jul 2024 17:34:22 GMT",
"version": "v2"
}
] | 2024-07-30 | [
[
"Wang",
"Junxiang",
""
],
[
"Zhao",
"Liang",
""
]
] | We introduce GraphSL, a new library for studying the graph source localization problem. graph diffusion and graph source localization are inverse problems in nature: graph diffusion predicts information diffusions from information sources, while graph source localization predicts information sources from information di... |
1612.03849 | Gabriele Oliva | Gabriele Oliva, Andrea Gasparri, Adriano Fagiolini, and Christoforos
N. Hadjicostis | Distributed and Proximity-Constrained C-Means for Discrete Coverage
Control | To appear in the 56th IEEE Conference on Decision and Control, to be
held in Melbourne, Australia, December 12-15, 2017 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a novel distributed coverage control framework for a
network of mobile agents, in charge of covering a finite set of points of
interest (PoI), such as people in danger, geographically dispersed equipment or
environmental landmarks. The proposed algorithm is inspired by C-Means, an
unsupervise... | [
{
"created": "Mon, 12 Dec 2016 18:54:07 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Mar 2017 14:35:51 GMT",
"version": "v2"
},
{
"created": "Fri, 8 Sep 2017 09:30:10 GMT",
"version": "v3"
},
{
"created": "Sat, 16 Sep 2017 18:38:16 GMT",
"version": "v4"
}
] | 2017-09-19 | [
[
"Oliva",
"Gabriele",
""
],
[
"Gasparri",
"Andrea",
""
],
[
"Fagiolini",
"Adriano",
""
],
[
"Hadjicostis",
"Christoforos N.",
""
]
] | In this paper we present a novel distributed coverage control framework for a network of mobile agents, in charge of covering a finite set of points of interest (PoI), such as people in danger, geographically dispersed equipment or environmental landmarks. The proposed algorithm is inspired by C-Means, an unsupervised ... |
1502.04662 | Tim Althoff | Tim Althoff, Xin Luna Dong, Kevin Murphy, Safa Alai, Van Dang, Wei
Zhang | TimeMachine: Timeline Generation for Knowledge-Base Entities | To appear at ACM SIGKDD KDD'15. 12pp, 7 fig. With appendix. Demo and
other info available at http://cs.stanford.edu/~althoff/timemachine/ | null | 10.1145/2783258.2783325 | null | cs.DB cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a method called TIMEMACHINE to generate a timeline of events and
relations for entities in a knowledge base. For example for an actor, such a
timeline should show the most important professional and personal milestones
and relationships such as works, awards, collaborations, and family
relationships. We de... | [
{
"created": "Mon, 16 Feb 2015 18:53:01 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Feb 2015 07:02:11 GMT",
"version": "v2"
},
{
"created": "Mon, 8 Jun 2015 20:39:26 GMT",
"version": "v3"
}
] | 2015-06-10 | [
[
"Althoff",
"Tim",
""
],
[
"Dong",
"Xin Luna",
""
],
[
"Murphy",
"Kevin",
""
],
[
"Alai",
"Safa",
""
],
[
"Dang",
"Van",
""
],
[
"Zhang",
"Wei",
""
]
] | We present a method called TIMEMACHINE to generate a timeline of events and relations for entities in a knowledge base. For example for an actor, such a timeline should show the most important professional and personal milestones and relationships such as works, awards, collaborations, and family relationships. We deve... |
2107.03140 | Bahram Sadeghi Bigham | Bahram Sadeghi Bigham | Minimum Constraint Removal Problem for Line Segments is NP-hard | null | Bigham, Bahram Sadeghi. "Minimum constraint removal problem for
line segments is NP-hard." Discrete Mathematics, Algorithms and Applications
(2022): 2250055 | null | null | cs.CG cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In the minimum constraint removal ($MCR$), there is no feasible path to move
from the starting point towards the goal and, the minimum constraints should be
removed in order to find a collision-free path. It has been proved that $MCR$
problem is $NP-hard$ when constraints have arbitrary shapes or even they are in
sha... | [
{
"created": "Wed, 7 Jul 2021 10:57:22 GMT",
"version": "v1"
}
] | 2023-02-21 | [
[
"Bigham",
"Bahram Sadeghi",
""
]
] | In the minimum constraint removal ($MCR$), there is no feasible path to move from the starting point towards the goal and, the minimum constraints should be removed in order to find a collision-free path. It has been proved that $MCR$ problem is $NP-hard$ when constraints have arbitrary shapes or even they are in shape... |
1904.05272 | Tang Liu | Tang Liu and Daniela Tuninetti | Decentralized Pliable Index Coding | 5 pages. To be presented at ISIT 2019 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces the ${\it decentralized}$ Pliable Index CODing (PICOD)
problem: a variant of the Index Coding (IC) problem, where a central
transmitter serves ${\it pliable}$ users with message side information; here,
pliable refers to the fact that a user is satisfied by decoding ${\it any}$ $t$
messages that ... | [
{
"created": "Wed, 10 Apr 2019 16:18:57 GMT",
"version": "v1"
}
] | 2019-04-11 | [
[
"Liu",
"Tang",
""
],
[
"Tuninetti",
"Daniela",
""
]
] | This paper introduces the ${\it decentralized}$ Pliable Index CODing (PICOD) problem: a variant of the Index Coding (IC) problem, where a central transmitter serves ${\it pliable}$ users with message side information; here, pliable refers to the fact that a user is satisfied by decoding ${\it any}$ $t$ messages that ar... |
2309.01398 | Danqing Hu | Danqing Hu, Bing Liu, Xiaofeng Zhu, Xudong Lu, Nan Wu | Zero-shot information extraction from radiological reports using ChatGPT | null | null | 10.1016/j.ijmedinf.2023.105321 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Electronic health records contain an enormous amount of valuable information,
but many are recorded in free text. Information extraction is the strategy to
transform the sequence of characters into structured data, which can be
employed for secondary analysis. However, the traditional information
extraction component... | [
{
"created": "Mon, 4 Sep 2023 07:00:26 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Sep 2023 01:36:08 GMT",
"version": "v2"
}
] | 2024-01-03 | [
[
"Hu",
"Danqing",
""
],
[
"Liu",
"Bing",
""
],
[
"Zhu",
"Xiaofeng",
""
],
[
"Lu",
"Xudong",
""
],
[
"Wu",
"Nan",
""
]
] | Electronic health records contain an enormous amount of valuable information, but many are recorded in free text. Information extraction is the strategy to transform the sequence of characters into structured data, which can be employed for secondary analysis. However, the traditional information extraction components,... |
2402.03413 | Huiyu Duan | Xiongkuo Min, Huiyu Duan, Wei Sun, Yucheng Zhu, Guangtao Zhai | Perceptual Video Quality Assessment: A Survey | null | null | null | null | cs.MM cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Perceptual video quality assessment plays a vital role in the field of video
processing due to the existence of quality degradations introduced in various
stages of video signal acquisition, compression, transmission and display. With
the advancement of internet communication and cloud service technology, video
conte... | [
{
"created": "Mon, 5 Feb 2024 16:13:52 GMT",
"version": "v1"
}
] | 2024-02-07 | [
[
"Min",
"Xiongkuo",
""
],
[
"Duan",
"Huiyu",
""
],
[
"Sun",
"Wei",
""
],
[
"Zhu",
"Yucheng",
""
],
[
"Zhai",
"Guangtao",
""
]
] | Perceptual video quality assessment plays a vital role in the field of video processing due to the existence of quality degradations introduced in various stages of video signal acquisition, compression, transmission and display. With the advancement of internet communication and cloud service technology, video content... |
1605.06417 | Yuan Jiang | Wei Shen, Yuan Jiang, Wenjing Gao, Dan Zeng, Xinggang Wang | Shape Recognition by Bag of Skeleton-associated Contour Parts | 10 pages. Has been Accepted by Pattern Recognition Letters 2016 | null | 10.1007/978-3-662-45646-0_40 | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Contour and skeleton are two complementary representations for shape
recognition. However combining them in a principal way is nontrivial, as they
are generally abstracted by different structures (closed string vs graph),
respectively. This paper aims at addressing the shape recognition problem by
combining contour a... | [
{
"created": "Fri, 20 May 2016 16:07:41 GMT",
"version": "v1"
}
] | 2016-05-23 | [
[
"Shen",
"Wei",
""
],
[
"Jiang",
"Yuan",
""
],
[
"Gao",
"Wenjing",
""
],
[
"Zeng",
"Dan",
""
],
[
"Wang",
"Xinggang",
""
]
] | Contour and skeleton are two complementary representations for shape recognition. However combining them in a principal way is nontrivial, as they are generally abstracted by different structures (closed string vs graph), respectively. This paper aims at addressing the shape recognition problem by combining contour and... |
2306.00809 | Emanuele Francazi | Emanuele Francazi, Aurelien Lucchi, Marco Baity-Jesi | Initial Guessing Bias: How Untrained Networks Favor Some Classes | We have added experiments on pre-trained models and various new
results, including analysis in the limit of an infinite number of classes and
an extension of the analysis to non-identically distributed classes.
Additionally, we have slightly restructured the main paper to include more
discussion on the practica... | null | null | null | cs.LG cond-mat.dis-nn stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding and controlling biasing effects in neural networks is crucial
for ensuring accurate and fair model performance. In the context of
classification problems, we provide a theoretical analysis demonstrating that
the structure of a deep neural network (DNN) can condition the model to assign
all predictions t... | [
{
"created": "Thu, 1 Jun 2023 15:37:32 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Nov 2023 16:17:43 GMT",
"version": "v2"
},
{
"created": "Mon, 12 Feb 2024 12:48:53 GMT",
"version": "v3"
},
{
"created": "Thu, 13 Jun 2024 22:30:36 GMT",
"version": "v4"
}
] | 2024-06-17 | [
[
"Francazi",
"Emanuele",
""
],
[
"Lucchi",
"Aurelien",
""
],
[
"Baity-Jesi",
"Marco",
""
]
] | Understanding and controlling biasing effects in neural networks is crucial for ensuring accurate and fair model performance. In the context of classification problems, we provide a theoretical analysis demonstrating that the structure of a deep neural network (DNN) can condition the model to assign all predictions to ... |
1509.05636 | Seetha Ramaiah M | M. Seetha Ramaiah, Amitabha Mukerjee, Arindam Chakraborty, Sadbodh
Sharma | Visual Generalized Coordinates | null | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An open problem in robotics is that of using vision to identify a robot's own
body and the world around it. Many models attempt to recover the traditional
C-space parameters. Instead, we propose an alternative C-space by deriving
generalized coordinates from $n$ images of the robot. We show that the space of
such ima... | [
{
"created": "Fri, 18 Sep 2015 14:17:57 GMT",
"version": "v1"
}
] | 2015-09-21 | [
[
"Ramaiah",
"M. Seetha",
""
],
[
"Mukerjee",
"Amitabha",
""
],
[
"Chakraborty",
"Arindam",
""
],
[
"Sharma",
"Sadbodh",
""
]
] | An open problem in robotics is that of using vision to identify a robot's own body and the world around it. Many models attempt to recover the traditional C-space parameters. Instead, we propose an alternative C-space by deriving generalized coordinates from $n$ images of the robot. We show that the space of such image... |
1102.0454 | Arnau Ramisa | Arnau Ramisa, David Aldavert, Shrihari Vasudevan, Ricardo Toledo,
Ramon Lopez de Mantaras | Evaluation of Three Vision Based Object Perception Methods for a Mobile
Robot | 37 pages, 11 figures | null | null | IIIA research report 2011-01 | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses object perception applied to mobile robotics. Being able
to perceive semantically meaningful objects in unstructured environments is a
key capability in order to make robots suitable to perform high-level tasks in
home environments. However, finding a solution for this task is daunting: it
requir... | [
{
"created": "Wed, 2 Feb 2011 15:00:09 GMT",
"version": "v1"
}
] | 2015-03-18 | [
[
"Ramisa",
"Arnau",
""
],
[
"Aldavert",
"David",
""
],
[
"Vasudevan",
"Shrihari",
""
],
[
"Toledo",
"Ricardo",
""
],
[
"de Mantaras",
"Ramon Lopez",
""
]
] | This paper addresses object perception applied to mobile robotics. Being able to perceive semantically meaningful objects in unstructured environments is a key capability in order to make robots suitable to perform high-level tasks in home environments. However, finding a solution for this task is daunting: it requires... |
1607.06042 | Vaneet Aggarwal | Mehdi Ashraphijuo and Vaneet Aggarwal and Xiaodong Wang | The DoF of Two-way Butterfly Networks | null | IEEE Communications Letters, Volume: 21, Issue: 10, Oct. 2017 | 10.1109/LCOMM.2017.2723364 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the two-way butterfly network, a class of two-way
four-unicast networks. We first show that bidirectional links do not increase
the degrees of freedom for this network thus giving the first example for
networks, to the best of our knowledge, where bidirectional links do not
increase the degrees of ... | [
{
"created": "Wed, 20 Jul 2016 17:44:49 GMT",
"version": "v1"
}
] | 2017-11-03 | [
[
"Ashraphijuo",
"Mehdi",
""
],
[
"Aggarwal",
"Vaneet",
""
],
[
"Wang",
"Xiaodong",
""
]
] | This paper studies the two-way butterfly network, a class of two-way four-unicast networks. We first show that bidirectional links do not increase the degrees of freedom for this network thus giving the first example for networks, to the best of our knowledge, where bidirectional links do not increase the degrees of fr... |
1605.03518 | Yang Huang | Yang Huang and Bruno Clerckx | Relaying Strategies for Wireless-Powered MIMO Relay Networks | Submitted for possible journal publication | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates relaying schemes in an amplify-and-forward
multiple-input multiple-output relay network, where an energy-constrained relay
harvests wireless power from the source information flow and can be further
aided by an energy flow (EF) in the form of a wireless power transfer at the
destination. Howev... | [
{
"created": "Wed, 11 May 2016 17:19:45 GMT",
"version": "v1"
}
] | 2016-05-12 | [
[
"Huang",
"Yang",
""
],
[
"Clerckx",
"Bruno",
""
]
] | This paper investigates relaying schemes in an amplify-and-forward multiple-input multiple-output relay network, where an energy-constrained relay harvests wireless power from the source information flow and can be further aided by an energy flow (EF) in the form of a wireless power transfer at the destination. However... |
2402.15769 | Zeming Dong | Zeming Dong, Qiang Hu, Xiaofei Xie, Maxime Cordy, Mike Papadakis,
Jianjun Zhao | Importance Guided Data Augmentation for Neural-Based Code Understanding | null | null | null | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pre-trained code models lead the era of code intelligence. Many models have
been designed with impressive performance recently. However, one important
problem, data augmentation for code data that automatically helps developers
prepare training data lacks study in the field of code learning. In this paper,
we introdu... | [
{
"created": "Sat, 24 Feb 2024 08:57:12 GMT",
"version": "v1"
}
] | 2024-02-27 | [
[
"Dong",
"Zeming",
""
],
[
"Hu",
"Qiang",
""
],
[
"Xie",
"Xiaofei",
""
],
[
"Cordy",
"Maxime",
""
],
[
"Papadakis",
"Mike",
""
],
[
"Zhao",
"Jianjun",
""
]
] | Pre-trained code models lead the era of code intelligence. Many models have been designed with impressive performance recently. However, one important problem, data augmentation for code data that automatically helps developers prepare training data lacks study in the field of code learning. In this paper, we introduce... |
1807.00602 | Evgeniy Gryaznov | Evgeniy Gryaznov | Semantic Query Language for Temporal Genealogical Trees | null | null | null | null | cs.DB | http://creativecommons.org/licenses/by-sa/4.0/ | Computers play a crucial role in modern ancestry management, they are used to
collect, store, analyze, sort and display genealogical data. However, current
applications do not take into account the kinship structure of a natural
language.
In this paper we propose a new domain-specific language KISP which is based
o... | [
{
"created": "Mon, 2 Jul 2018 11:27:51 GMT",
"version": "v1"
}
] | 2018-07-03 | [
[
"Gryaznov",
"Evgeniy",
""
]
] | Computers play a crucial role in modern ancestry management, they are used to collect, store, analyze, sort and display genealogical data. However, current applications do not take into account the kinship structure of a natural language. In this paper we propose a new domain-specific language KISP which is based on a ... |
2202.08870 | Pat Morin | Prosenjit Bose, Pat Morin, and Saeed Odak | An Optimal Algorithm for Product Structure in Planar Graphs | 14 pages, 5 figures | null | null | null | cs.DS math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The \emph{Product Structure Theorem} for planar graphs (Dujmovi\'c et al.\
\emph{JACM}, \textbf{67}(4):22) states that any planar graph is contained in
the strong product of a planar $3$-tree, a path, and a $3$-cycle. We give a
simple linear-time algorithm for finding this decomposition as well as several
related dec... | [
{
"created": "Thu, 17 Feb 2022 19:13:44 GMT",
"version": "v1"
}
] | 2022-02-21 | [
[
"Bose",
"Prosenjit",
""
],
[
"Morin",
"Pat",
""
],
[
"Odak",
"Saeed",
""
]
] | The \emph{Product Structure Theorem} for planar graphs (Dujmovi\'c et al.\ \emph{JACM}, \textbf{67}(4):22) states that any planar graph is contained in the strong product of a planar $3$-tree, a path, and a $3$-cycle. We give a simple linear-time algorithm for finding this decomposition as well as several related decom... |
2105.01913 | Samin Aref | Samin Aref and Zachary P. Neal | Identifying hidden coalitions in the US House of Representatives by
optimally partitioning signed networks based on generalized balance | Post-peer-review version, 23 pages, 7 figures, 2 tables, combined
article and supplementary information | null | 10.1038/s41598-021-98139-w | null | cs.SI cs.CY math.OC physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In network science, identifying optimal partitions of a signed network into
internally cohesive and mutually divisive clusters based on generalized balance
theory is computationally challenging. We reformulate and generalize two binary
linear programming models that tackle this challenge, demonstrating their
practica... | [
{
"created": "Wed, 5 May 2021 07:57:41 GMT",
"version": "v1"
},
{
"created": "Thu, 6 May 2021 05:17:10 GMT",
"version": "v2"
},
{
"created": "Mon, 6 Sep 2021 22:17:22 GMT",
"version": "v3"
},
{
"created": "Wed, 27 Jul 2022 00:54:13 GMT",
"version": "v4"
}
] | 2022-07-28 | [
[
"Aref",
"Samin",
""
],
[
"Neal",
"Zachary P.",
""
]
] | In network science, identifying optimal partitions of a signed network into internally cohesive and mutually divisive clusters based on generalized balance theory is computationally challenging. We reformulate and generalize two binary linear programming models that tackle this challenge, demonstrating their practicali... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.