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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2304.01237 | Audrey Poinsot | Audrey Poinsot, Alessandro Leite | A Guide for Practical Use of ADMG Causal Data Augmentation | null | Workshop on the pitfalls of limited data and computation for
Trustworthy ML, ICLR 2023, Kigali, Rwanda | null | null | cs.LG stat.ME | http://creativecommons.org/licenses/by/4.0/ | Data augmentation is essential when applying Machine Learning in small-data
regimes. It generates new samples following the observed data distribution
while increasing their diversity and variability to help researchers and
practitioners improve their models' robustness and, thus, deploy them in the
real world. Never... | [
{
"created": "Mon, 3 Apr 2023 09:31:13 GMT",
"version": "v1"
}
] | 2023-04-10 | [
[
"Poinsot",
"Audrey",
""
],
[
"Leite",
"Alessandro",
""
]
] | Data augmentation is essential when applying Machine Learning in small-data regimes. It generates new samples following the observed data distribution while increasing their diversity and variability to help researchers and practitioners improve their models' robustness and, thus, deploy them in the real world. Neverth... |
1304.4383 | Alireza Karbalay-Ghareh | Alireza Karbalay-Ghareh, Masoumeh Nasiri-Kenari, and Mohsen Hejazi | Convolutional Network-Coded Cooperation in Multi-Source Networks with a
Multi-Antenna Relay | 23 pages, 9 figures, 1 table, submitted to IEEE Transactions on
Wireless Communications | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel cooperative transmission scheme called "Convolutional
Network-Coded Cooperation" (CNCC) for a network including N sources, one
M-antenna relay, and one common destination. The source-relay (S-R) channels
are assumed to be Nakagami-m fading, while the source-destination (S-D) and the
relay-destinati... | [
{
"created": "Tue, 16 Apr 2013 09:54:03 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Sep 2013 09:31:33 GMT",
"version": "v2"
}
] | 2013-09-03 | [
[
"Karbalay-Ghareh",
"Alireza",
""
],
[
"Nasiri-Kenari",
"Masoumeh",
""
],
[
"Hejazi",
"Mohsen",
""
]
] | We propose a novel cooperative transmission scheme called "Convolutional Network-Coded Cooperation" (CNCC) for a network including N sources, one M-antenna relay, and one common destination. The source-relay (S-R) channels are assumed to be Nakagami-m fading, while the source-destination (S-D) and the relay-destination... |
1508.04030 | Mohammad Vahid Jamali | Mohammad Vahid Jamali, Farhad Akhoundi, Jawad A. Salehi | Performance Characterization of Relay-Assisted Wireless Optical CDMA
Networks in Turbulent Underwater Channel | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we characterize the performance of relay-assisted underwater
wireless optical code division multiple access (OCDMA) networks over turbulent
channels. In addition to scattering and absorption effects of underwater
channels, we also consider optical turbulence as a log-normal fading
coefficient in our an... | [
{
"created": "Mon, 17 Aug 2015 13:58:58 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Oct 2015 14:52:25 GMT",
"version": "v2"
},
{
"created": "Mon, 22 Feb 2016 19:57:53 GMT",
"version": "v3"
}
] | 2016-02-23 | [
[
"Jamali",
"Mohammad Vahid",
""
],
[
"Akhoundi",
"Farhad",
""
],
[
"Salehi",
"Jawad A.",
""
]
] | In this paper, we characterize the performance of relay-assisted underwater wireless optical code division multiple access (OCDMA) networks over turbulent channels. In addition to scattering and absorption effects of underwater channels, we also consider optical turbulence as a log-normal fading coefficient in our anal... |
1505.01231 | Yongpeng Wu | Yongpeng Wu, Robert Schober, Derrick Wing Kwan Ng, Chengshan Xiao, and
Giuseppe Caire | Secure Massive MIMO Transmission in the Presence of an Active
Eavesdropper | To appear in ICC 15 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate secure and reliable transmission strategies for
multi-cell multi-user massive multiple-input multiple-output (MIMO) systems in
the presence of an active eavesdropper. We consider a time-division duplex
system where uplink training is required and an active eavesdropper can attack
the tra... | [
{
"created": "Wed, 6 May 2015 00:55:27 GMT",
"version": "v1"
}
] | 2015-05-07 | [
[
"Wu",
"Yongpeng",
""
],
[
"Schober",
"Robert",
""
],
[
"Ng",
"Derrick Wing Kwan",
""
],
[
"Xiao",
"Chengshan",
""
],
[
"Caire",
"Giuseppe",
""
]
] | In this paper, we investigate secure and reliable transmission strategies for multi-cell multi-user massive multiple-input multiple-output (MIMO) systems in the presence of an active eavesdropper. We consider a time-division duplex system where uplink training is required and an active eavesdropper can attack the train... |
1602.03139 | Jeremie Guiochet | J\'er\'emie Guiochet (LAAS-TSF) | Hazard analysis of human--robot interactions with HAZOP--UML | null | Safety Science, Elsevier, 2016, 84 | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | New safety critical systems are about to appear in our everyday life:
advanced robots able to interact with humans and perform tasks at home, in
hospitals , or at work. A hazardous behavior of those systems, induced by
failures or extreme environment conditions, may lead to catastrophic
consequences. Well-known risk ... | [
{
"created": "Tue, 9 Feb 2016 19:51:42 GMT",
"version": "v1"
}
] | 2016-02-10 | [
[
"Guiochet",
"Jérémie",
"",
"LAAS-TSF"
]
] | New safety critical systems are about to appear in our everyday life: advanced robots able to interact with humans and perform tasks at home, in hospitals , or at work. A hazardous behavior of those systems, induced by failures or extreme environment conditions, may lead to catastrophic consequences. Well-known risk an... |
2005.02392 | Matteo Tiezzi | Matteo Tiezzi, Giuseppe Marra, Stefano Melacci and Marco Maggini | Deep Constraint-based Propagation in Graph Neural Networks | Published in: IEEE Transactions on Pattern Analysis and Machine
Intelligence. arXiv admin note: text overlap with arXiv:2002.07684 | null | 10.1109/TPAMI.2021.3073504 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The popularity of deep learning techniques renewed the interest in neural
architectures able to process complex structures that can be represented using
graphs, inspired by Graph Neural Networks (GNNs). We focus our attention on the
originally proposed GNN model of Scarselli et al. 2009, which encodes the state
of th... | [
{
"created": "Tue, 5 May 2020 16:50:59 GMT",
"version": "v1"
},
{
"created": "Wed, 27 May 2020 08:35:58 GMT",
"version": "v2"
},
{
"created": "Mon, 8 Jun 2020 11:18:14 GMT",
"version": "v3"
},
{
"created": "Mon, 19 Apr 2021 19:21:06 GMT",
"version": "v4"
},
{
"cre... | 2021-09-02 | [
[
"Tiezzi",
"Matteo",
""
],
[
"Marra",
"Giuseppe",
""
],
[
"Melacci",
"Stefano",
""
],
[
"Maggini",
"Marco",
""
]
] | The popularity of deep learning techniques renewed the interest in neural architectures able to process complex structures that can be represented using graphs, inspired by Graph Neural Networks (GNNs). We focus our attention on the originally proposed GNN model of Scarselli et al. 2009, which encodes the state of the ... |
2403.15272 | Jialu Wang | Jialu Wang, Kaichen Zhou, Andrew Markham and Niki Trigoni | WSCLoc: Weakly-Supervised Sparse-View Camera Relocalization | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Despite the advancements in deep learning for camera relocalization tasks,
obtaining ground truth pose labels required for the training process remains a
costly endeavor. While current weakly supervised methods excel in lightweight
label generation, their performance notably declines in scenarios with sparse
views. I... | [
{
"created": "Fri, 22 Mar 2024 15:15:44 GMT",
"version": "v1"
}
] | 2024-03-25 | [
[
"Wang",
"Jialu",
""
],
[
"Zhou",
"Kaichen",
""
],
[
"Markham",
"Andrew",
""
],
[
"Trigoni",
"Niki",
""
]
] | Despite the advancements in deep learning for camera relocalization tasks, obtaining ground truth pose labels required for the training process remains a costly endeavor. While current weakly supervised methods excel in lightweight label generation, their performance notably declines in scenarios with sparse views. In ... |
2104.01111 | Xiaojun Chang | Xiaojun Chang, Pengzhen Ren, Pengfei Xu, Zhihui Li, Xiaojiang Chen,
and Alex Hauptmann | A Comprehensive Survey of Scene Graphs: Generation and Application | 25 pages | IEEE Transactions on Pattern Analysis and Machine Intelligence,
2021 | 10.1109/TPAMI.2021.3137605 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Scene graph is a structured representation of a scene that can clearly
express the objects, attributes, and relationships between objects in the
scene. As computer vision technology continues to develop, people are no longer
satisfied with simply detecting and recognizing objects in images; instead,
people look forwa... | [
{
"created": "Wed, 17 Mar 2021 04:24:20 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Sep 2021 04:07:08 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Oct 2021 23:27:54 GMT",
"version": "v3"
},
{
"created": "Tue, 21 Dec 2021 02:24:22 GMT",
"version": "v4"
},
{
"cr... | 2022-01-10 | [
[
"Chang",
"Xiaojun",
""
],
[
"Ren",
"Pengzhen",
""
],
[
"Xu",
"Pengfei",
""
],
[
"Li",
"Zhihui",
""
],
[
"Chen",
"Xiaojiang",
""
],
[
"Hauptmann",
"Alex",
""
]
] | Scene graph is a structured representation of a scene that can clearly express the objects, attributes, and relationships between objects in the scene. As computer vision technology continues to develop, people are no longer satisfied with simply detecting and recognizing objects in images; instead, people look forward... |
2404.14625 | Alican Mertan | Alican Mertan and Nick Cheney | Towards Multi-Morphology Controllers with Diversity and Knowledge
Distillation | Accepted at the Genetic and Evolutionary Computation Conference 2024
Evolutionary Machine Learning track as a full paper | null | 10.1145/3638529.3654013 | null | cs.RO cs.LG cs.NE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Finding controllers that perform well across multiple morphologies is an
important milestone for large-scale robotics, in line with recent advances via
foundation models in other areas of machine learning. However, the challenges
of learning a single controller to control multiple morphologies make the `one
robot one... | [
{
"created": "Mon, 22 Apr 2024 23:40:03 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Mertan",
"Alican",
""
],
[
"Cheney",
"Nick",
""
]
] | Finding controllers that perform well across multiple morphologies is an important milestone for large-scale robotics, in line with recent advances via foundation models in other areas of machine learning. However, the challenges of learning a single controller to control multiple morphologies make the `one robot one t... |
1208.5740 | J K M Sadique Uz Zaman | J K M Sadique Uz Zaman and Ranjan Ghosh | A Review Study of NIST Statistical Test Suite: Development of an
indigenous Computer Package | 24 pages, 5 figures, 1 table | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A review study of NIST Statistical Test Suite is undertaken with a motivation
to understand all its test algorithms and to write their C codes independently
without looking at various sites mentioned in the NIST document. All the codes
are tested with the test data given in the NIST document and excellent
agreements ... | [
{
"created": "Tue, 28 Aug 2012 18:28:09 GMT",
"version": "v1"
}
] | 2012-08-29 | [
[
"Zaman",
"J K M Sadique Uz",
""
],
[
"Ghosh",
"Ranjan",
""
]
] | A review study of NIST Statistical Test Suite is undertaken with a motivation to understand all its test algorithms and to write their C codes independently without looking at various sites mentioned in the NIST document. All the codes are tested with the test data given in the NIST document and excellent agreements ha... |
0706.1780 | Marie-France Ango-Obiang | Marie-France Ango-Obiang (SITE, Loria) | Le travail collaboratif dans le cadre d'un projet architectural | null | Dans Innovation et tradition de l'association internationale
Management Strat\'egique (2007) | null | null | cs.HC | null | The analysis of the practices and the tendencies of the users at the time of
the search for information on Internet makes it possible to highlight several
points. The search for information becomes powerful after knowledge of the
typology of the various systems of research. This typology supports the
adoption of a me... | [
{
"created": "Tue, 12 Jun 2007 20:06:38 GMT",
"version": "v1"
}
] | 2007-06-14 | [
[
"Ango-Obiang",
"Marie-France",
"",
"SITE, Loria"
]
] | The analysis of the practices and the tendencies of the users at the time of the search for information on Internet makes it possible to highlight several points. The search for information becomes powerful after knowledge of the typology of the various systems of research. This typology supports the adoption of a meth... |
2404.13257 | Zhiqi Shao | Zhiqi Shao, Michael G.H. Bell, Ze Wang, D. Glenn Geers, Haoning Xi and
Junbin Gao | ST-Mamba: Spatial-Temporal Selective State Space Model for Traffic Flow
Prediction | 25 pages, 6 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Traffic flow prediction, a critical aspect of intelligent transportation
systems, has been increasingly popular in the field of artificial intelligence,
driven by the availability of extensive traffic data. The current challenges of
traffic flow prediction lie in integrating diverse factors while balancing the
trade-... | [
{
"created": "Sat, 20 Apr 2024 03:57:57 GMT",
"version": "v1"
},
{
"created": "Sat, 18 May 2024 05:10:36 GMT",
"version": "v2"
}
] | 2024-05-21 | [
[
"Shao",
"Zhiqi",
""
],
[
"Bell",
"Michael G. H.",
""
],
[
"Wang",
"Ze",
""
],
[
"Geers",
"D. Glenn",
""
],
[
"Xi",
"Haoning",
""
],
[
"Gao",
"Junbin",
""
]
] | Traffic flow prediction, a critical aspect of intelligent transportation systems, has been increasingly popular in the field of artificial intelligence, driven by the availability of extensive traffic data. The current challenges of traffic flow prediction lie in integrating diverse factors while balancing the trade-of... |
2406.03756 | Zizhou Huang | Federico Sichetti, Zizhou Huang, Marco Attene, Denis Zorin, Enrico
Puppo, Daniele Panozzo | High-Order Continuous Geometrical Validity | null | null | null | null | cs.CG cs.GR | http://creativecommons.org/licenses/by/4.0/ | We propose a conservative algorithm to test the geometrical validity of
simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra),
and mixed (prisms) elements of arbitrary polynomial order as they deform over a
piecewise-linear trajectory.
Our algorithm uses a combination of adaptive B\'ezier r... | [
{
"created": "Thu, 6 Jun 2024 05:41:30 GMT",
"version": "v1"
}
] | 2024-06-07 | [
[
"Sichetti",
"Federico",
""
],
[
"Huang",
"Zizhou",
""
],
[
"Attene",
"Marco",
""
],
[
"Zorin",
"Denis",
""
],
[
"Puppo",
"Enrico",
""
],
[
"Panozzo",
"Daniele",
""
]
] | We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform over a piecewise-linear trajectory. Our algorithm uses a combination of adaptive B\'ezier refin... |
1608.08242 | Colin Lea | Colin Lea, Rene Vidal, Austin Reiter, Gregory D. Hager | Temporal Convolutional Networks: A Unified Approach to Action
Segmentation | Submitted to the ECCV workshop on "Brave new ideas for motion
representations in videos" (http://bravenewmotion.github.io/) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dominant paradigm for video-based action segmentation is composed of two
steps: first, for each frame, compute low-level features using Dense
Trajectories or a Convolutional Neural Network that encode spatiotemporal
information locally, and second, input these features into a classifier that
captures high-level t... | [
{
"created": "Mon, 29 Aug 2016 20:48:15 GMT",
"version": "v1"
}
] | 2016-08-31 | [
[
"Lea",
"Colin",
""
],
[
"Vidal",
"Rene",
""
],
[
"Reiter",
"Austin",
""
],
[
"Hager",
"Gregory D.",
""
]
] | The dominant paradigm for video-based action segmentation is composed of two steps: first, for each frame, compute low-level features using Dense Trajectories or a Convolutional Neural Network that encode spatiotemporal information locally, and second, input these features into a classifier that captures high-level tem... |
2104.14744 | Sam Ganzfried | Sam Ganzfried | Human strategic decision making in parametrized games | fixed typo in proof | null | null | null | cs.GT cs.AI cs.LG econ.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many real-world games contain parameters which can affect payoffs, action
spaces, and information states. For fixed values of the parameters, the game
can be solved using standard algorithms. However, in many settings agents must
act without knowing the values of the parameters that will be encountered in
advance. Of... | [
{
"created": "Fri, 30 Apr 2021 03:40:27 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Aug 2021 01:10:10 GMT",
"version": "v2"
},
{
"created": "Sun, 7 Nov 2021 07:59:22 GMT",
"version": "v3"
}
] | 2021-11-09 | [
[
"Ganzfried",
"Sam",
""
]
] | Many real-world games contain parameters which can affect payoffs, action spaces, and information states. For fixed values of the parameters, the game can be solved using standard algorithms. However, in many settings agents must act without knowing the values of the parameters that will be encountered in advance. Ofte... |
2001.02431 | Marco Mamprin Mr. | Marco Mamprin, Jo M. Zelis, Pim A.L. Tonino, Svitlana Zinger, Peter
H.N. de With | Gradient Boosting on Decision Trees for Mortality Prediction in
Transcatheter Aortic Valve Implantation | null | null | null | null | cs.LG cs.CY stat.ML | http://creativecommons.org/licenses/by/4.0/ | Current prognostic risk scores in cardiac surgery are based on statistics and
do not yet benefit from machine learning. Statistical predictors are not robust
enough to correctly identify patients who would benefit from Transcatheter
Aortic Valve Implantation (TAVI). This research aims to create a machine
learning mod... | [
{
"created": "Wed, 8 Jan 2020 10:04:42 GMT",
"version": "v1"
}
] | 2020-01-09 | [
[
"Mamprin",
"Marco",
""
],
[
"Zelis",
"Jo M.",
""
],
[
"Tonino",
"Pim A. L.",
""
],
[
"Zinger",
"Svitlana",
""
],
[
"de With",
"Peter H. N.",
""
]
] | Current prognostic risk scores in cardiac surgery are based on statistics and do not yet benefit from machine learning. Statistical predictors are not robust enough to correctly identify patients who would benefit from Transcatheter Aortic Valve Implantation (TAVI). This research aims to create a machine learning model... |
2001.08546 | Preslav Nakov | Alberto Barron-Cedeno, Tamer Elsayed, Preslav Nakov, Giovanni Da San
Martino, Maram Hasanain, Reem Suwaileh, and Fatima Haouari | CheckThat! at CLEF 2020: Enabling the Automatic Identification and
Verification of Claims in Social Media | Computational journalism, Check-worthiness, Fact-checking, Veracity,
CLEF-2020 CheckThat! Lab | CLEF-2018 ECIR-2020 | null | null | cs.CL cs.AI cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe the third edition of the CheckThat! Lab, which is part of the
2020 Cross-Language Evaluation Forum (CLEF). CheckThat! proposes four
complementary tasks and a related task from previous lab editions, offered in
English, Arabic, and Spanish. Task 1 asks to predict which tweets in a Twitter
stream are worth ... | [
{
"created": "Tue, 21 Jan 2020 06:47:11 GMT",
"version": "v1"
}
] | 2020-01-24 | [
[
"Barron-Cedeno",
"Alberto",
""
],
[
"Elsayed",
"Tamer",
""
],
[
"Nakov",
"Preslav",
""
],
[
"Martino",
"Giovanni Da San",
""
],
[
"Hasanain",
"Maram",
""
],
[
"Suwaileh",
"Reem",
""
],
[
"Haouari",
"Fatima",
... | We describe the third edition of the CheckThat! Lab, which is part of the 2020 Cross-Language Evaluation Forum (CLEF). CheckThat! proposes four complementary tasks and a related task from previous lab editions, offered in English, Arabic, and Spanish. Task 1 asks to predict which tweets in a Twitter stream are worth fa... |
2402.09811 | Badri Vishal Kasuba | Dhruv Kudale, Badri Vishal Kasuba, Venkatapathy Subramanian, Parag
Chaudhuri, Ganesh Ramakrishnan | TEXTRON: Weakly Supervised Multilingual Text Detection through Data
Programming | Accepted at the WACV 2024 Conference | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Several recent deep learning (DL) based techniques perform considerably well
on image-based multilingual text detection. However, their performance relies
heavily on the availability and quality of training data. There are numerous
types of page-level document images consisting of information in several
modalities, l... | [
{
"created": "Thu, 15 Feb 2024 09:18:18 GMT",
"version": "v1"
}
] | 2024-02-16 | [
[
"Kudale",
"Dhruv",
""
],
[
"Kasuba",
"Badri Vishal",
""
],
[
"Subramanian",
"Venkatapathy",
""
],
[
"Chaudhuri",
"Parag",
""
],
[
"Ramakrishnan",
"Ganesh",
""
]
] | Several recent deep learning (DL) based techniques perform considerably well on image-based multilingual text detection. However, their performance relies heavily on the availability and quality of training data. There are numerous types of page-level document images consisting of information in several modalities, lan... |
2005.01562 | Jiakuo Zuo | Jiakuo Zuo, Yuanwei Liu, Ertugrul Basar, and Octavia A. Dobre | Intelligent Reflecting Surface Enhanced Millimeter-Wave NOMA Systems | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a downlink intelligent reflecting surface (IRS) enhanced
millimeter-wave (mmWave) non-orthogonal multiple access (NOMA) system is
considered. A joint optimization problem over active beamforming, passive
beamforming and power allocation is formulated. Due to the highly coupled
variables, the formulated... | [
{
"created": "Mon, 4 May 2020 15:25:21 GMT",
"version": "v1"
}
] | 2020-05-05 | [
[
"Zuo",
"Jiakuo",
""
],
[
"Liu",
"Yuanwei",
""
],
[
"Basar",
"Ertugrul",
""
],
[
"Dobre",
"Octavia A.",
""
]
] | In this paper, a downlink intelligent reflecting surface (IRS) enhanced millimeter-wave (mmWave) non-orthogonal multiple access (NOMA) system is considered. A joint optimization problem over active beamforming, passive beamforming and power allocation is formulated. Due to the highly coupled variables, the formulated o... |
2206.03727 | Jun Yan | Jun Yan, Huilin Yin, Xiaoyang Deng, Ziming Zhao, Wancheng Ge, Hao
Zhang, Gerhard Rigoll | Wavelet Regularization Benefits Adversarial Training | Preprint version | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Adversarial training methods are state-of-the-art (SOTA) empirical defense
methods against adversarial examples. Many regularization methods have been
proven to be effective with the combination of adversarial training.
Nevertheless, such regularization methods are implemented in the time domain.
Since adversarial vu... | [
{
"created": "Wed, 8 Jun 2022 08:00:30 GMT",
"version": "v1"
}
] | 2022-06-09 | [
[
"Yan",
"Jun",
""
],
[
"Yin",
"Huilin",
""
],
[
"Deng",
"Xiaoyang",
""
],
[
"Zhao",
"Ziming",
""
],
[
"Ge",
"Wancheng",
""
],
[
"Zhang",
"Hao",
""
],
[
"Rigoll",
"Gerhard",
""
]
] | Adversarial training methods are state-of-the-art (SOTA) empirical defense methods against adversarial examples. Many regularization methods have been proven to be effective with the combination of adversarial training. Nevertheless, such regularization methods are implemented in the time domain. Since adversarial vuln... |
1702.06154 | Sibo Cheng Sibo Cheng | Sibo Cheng, Adissa Laurent, Paul Van Dooren | Role model detection using low rank similarity matrix | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computing meaningful clusters of nodes is crucial to analyse large networks.
In this paper, we apply new clustering methods to improve the computational
time. We use the properties of the adjacency matrix to obtain better role
extraction. We also define a new non-recursive similarity measure and compare
its results w... | [
{
"created": "Sat, 28 Jan 2017 15:53:23 GMT",
"version": "v1"
}
] | 2017-02-22 | [
[
"Cheng",
"Sibo",
""
],
[
"Laurent",
"Adissa",
""
],
[
"Van Dooren",
"Paul",
""
]
] | Computing meaningful clusters of nodes is crucial to analyse large networks. In this paper, we apply new clustering methods to improve the computational time. We use the properties of the adjacency matrix to obtain better role extraction. We also define a new non-recursive similarity measure and compare its results wit... |
2009.00541 | Mikhail Jacob | Mikhail Jacob, Sam Devlin, Katja Hofmann | "It's Unwieldy and It Takes a Lot of Time." Challenges and Opportunities
for Creating Agents in Commercial Games | 7 pages, 3 figures, to be published in the 16th AAAI Conference on
Artificial Intelligence and Interactive Digital Entertainment (AIIDE-20) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Game agents such as opponents, non-player characters, and teammates are
central to player experiences in many modern games. As the landscape of AI
techniques used in the games industry evolves to adopt machine learning (ML)
more widely, it is vital that the research community learn from the best
practices cultivated ... | [
{
"created": "Tue, 1 Sep 2020 16:21:19 GMT",
"version": "v1"
}
] | 2020-09-02 | [
[
"Jacob",
"Mikhail",
""
],
[
"Devlin",
"Sam",
""
],
[
"Hofmann",
"Katja",
""
]
] | Game agents such as opponents, non-player characters, and teammates are central to player experiences in many modern games. As the landscape of AI techniques used in the games industry evolves to adopt machine learning (ML) more widely, it is vital that the research community learn from the best practices cultivated wi... |
2312.10336 | Jiaqi Liu | Jiaqi Liu, Jian Lou, Zhan Qin and Kui Ren | Certified Minimax Unlearning with Generalization Rates and Deletion
Capacity | NeurIPS 2023 | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We study the problem of $(\epsilon,\delta)$-certified machine unlearning for
minimax models. Most of the existing works focus on unlearning from standard
statistical learning models that have a single variable and their unlearning
steps hinge on the direct Hessian-based conventional Newton update. We develop
a new $(... | [
{
"created": "Sat, 16 Dec 2023 06:03:23 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Liu",
"Jiaqi",
""
],
[
"Lou",
"Jian",
""
],
[
"Qin",
"Zhan",
""
],
[
"Ren",
"Kui",
""
]
] | We study the problem of $(\epsilon,\delta)$-certified machine unlearning for minimax models. Most of the existing works focus on unlearning from standard statistical learning models that have a single variable and their unlearning steps hinge on the direct Hessian-based conventional Newton update. We develop a new $(\e... |
2002.04109 | Beril Sirmacek | Nicol\`o Botteghi, Beril Sirmacek, Khaled A. A. Mustafa, Mannes Poel
and Stefano Stramigioli | On Reward Shaping for Mobile Robot Navigation: A Reinforcement Learning
and SLAM Based Approach | null | null | null | null | cs.RO cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a map-less path planning algorithm based on Deep Reinforcement
Learning (DRL) for mobile robots navigating in unknown environment that only
relies on 40-dimensional raw laser data and odometry information. The planner
is trained using a reward function shaped based on the online knowledge of the
map of the... | [
{
"created": "Mon, 10 Feb 2020 22:00:16 GMT",
"version": "v1"
}
] | 2020-02-12 | [
[
"Botteghi",
"Nicolò",
""
],
[
"Sirmacek",
"Beril",
""
],
[
"Mustafa",
"Khaled A. A.",
""
],
[
"Poel",
"Mannes",
""
],
[
"Stramigioli",
"Stefano",
""
]
] | We present a map-less path planning algorithm based on Deep Reinforcement Learning (DRL) for mobile robots navigating in unknown environment that only relies on 40-dimensional raw laser data and odometry information. The planner is trained using a reward function shaped based on the online knowledge of the map of the t... |
2007.15829 | Yadan Luo | Yadan Luo, Zi Huang, Zijian Wang, Zheng Zhang, Mahsa Baktashmotlagh | Adversarial Bipartite Graph Learning for Video Domain Adaptation | Proceedings of the 28th ACM International Conference on Multimedia
(MM '20) | null | 10.1145/3394171.3413897 | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Domain adaptation techniques, which focus on adapting models between
distributionally different domains, are rarely explored in the video
recognition area due to the significant spatial and temporal shifts across the
source (i.e. training) and target (i.e. test) domains. As such, recent works on
visual domain adaptat... | [
{
"created": "Fri, 31 Jul 2020 03:48:41 GMT",
"version": "v1"
}
] | 2020-08-03 | [
[
"Luo",
"Yadan",
""
],
[
"Huang",
"Zi",
""
],
[
"Wang",
"Zijian",
""
],
[
"Zhang",
"Zheng",
""
],
[
"Baktashmotlagh",
"Mahsa",
""
]
] | Domain adaptation techniques, which focus on adapting models between distributionally different domains, are rarely explored in the video recognition area due to the significant spatial and temporal shifts across the source (i.e. training) and target (i.e. test) domains. As such, recent works on visual domain adaptatio... |
1603.05823 | Ligong Wang | Ligong Wang | Optimal Throughput for Covert Communication Over a Classical-Quantum
Channel | Corrected version of a paper presented at ITW 2016. In the ITW paper,
the denominator in the main formula (10) was incorrect. The current version
corrects this mistake and adds an appendix for its derivation | null | null | null | cs.IT math.IT quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the problem of communication over a memoryless
classical-quantum wiretap channel subject to the constraint that the
eavesdropper on the channel should not be able to learn whether the legitimate
parties are using the channel to communicate or not. Specifically, the relative
entropy between the ou... | [
{
"created": "Fri, 18 Mar 2016 10:36:09 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Jun 2016 12:32:45 GMT",
"version": "v2"
},
{
"created": "Tue, 7 Mar 2017 15:46:09 GMT",
"version": "v3"
}
] | 2017-03-08 | [
[
"Wang",
"Ligong",
""
]
] | This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn whether the legitimate parties are using the channel to communicate or not. Specifically, the relative entropy between the outp... |
1906.08393 | Renjie Zheng | Renjie Zheng, Hairong Liu, Mingbo Ma, Baigong Zheng, Liang Huang | Robust Machine Translation with Domain Sensitive Pseudo-Sources:
Baidu-OSU WMT19 MT Robustness Shared Task System Report | accepted by WMT 2019 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes the machine translation system developed jointly by
Baidu Research and Oregon State University for WMT 2019 Machine Translation
Robustness Shared Task. Translation of social media is a very challenging
problem, since its style is very different from normal parallel corpora (e.g.
News) and also in... | [
{
"created": "Wed, 19 Jun 2019 23:20:57 GMT",
"version": "v1"
},
{
"created": "Sat, 22 Jun 2019 16:07:24 GMT",
"version": "v2"
}
] | 2019-06-25 | [
[
"Zheng",
"Renjie",
""
],
[
"Liu",
"Hairong",
""
],
[
"Ma",
"Mingbo",
""
],
[
"Zheng",
"Baigong",
""
],
[
"Huang",
"Liang",
""
]
] | This paper describes the machine translation system developed jointly by Baidu Research and Oregon State University for WMT 2019 Machine Translation Robustness Shared Task. Translation of social media is a very challenging problem, since its style is very different from normal parallel corpora (e.g. News) and also incl... |
2304.07531 | Daniel Feitosa | Daniel Feitosa, Matei-Tudor Penca, Massimiliano Berardi, Rares-Dorian
Boza and Vasilios Andrikopoulos | Mining for Cost Awareness in the Infrastructure as Code Artifacts of
Cloud-based Applications: an Exploratory Study | 16 pages, 11 figures, 1 table | null | 10.1016/j.jss.2024.112112 | null | cs.SE | http://creativecommons.org/licenses/by-sa/4.0/ | Context: The popularity of cloud computing as the primary platform for
developing, deploying, and delivering software is largely driven by the promise
of cost savings. Therefore, it is surprising that no empirical evidence has
been collected to determine whether cost awareness permeates the development
process and ho... | [
{
"created": "Sat, 15 Apr 2023 10:49:35 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Dec 2023 12:01:06 GMT",
"version": "v2"
},
{
"created": "Thu, 11 Apr 2024 15:03:56 GMT",
"version": "v3"
}
] | 2024-05-28 | [
[
"Feitosa",
"Daniel",
""
],
[
"Penca",
"Matei-Tudor",
""
],
[
"Berardi",
"Massimiliano",
""
],
[
"Boza",
"Rares-Dorian",
""
],
[
"Andrikopoulos",
"Vasilios",
""
]
] | Context: The popularity of cloud computing as the primary platform for developing, deploying, and delivering software is largely driven by the promise of cost savings. Therefore, it is surprising that no empirical evidence has been collected to determine whether cost awareness permeates the development process and how ... |
1811.00989 | David A. Monge | David A. Monge (1), Elina Pacini (1, 2), Cristian Mateos (3), Enrique
Alba (4), Carlos Garc\'ia Garino (1) ((1) ITIC, Universidad Nacional de Cuyo.
Mendoza, Argentina, (2) Consejo Nacional de Investigaciones Cient\'ificas y
T\'ecnicas (CONICET). Argentina., (3) ISISTAN-UNICEN-CONICET. Tandil, Buenos
Aires, Arge... | CMI: An Online Multi-objective Genetic Autoscaler for Scientific and
Engineering Workflows in Cloud Infrastructures with Unreliable Virtual
Machines | 19 pages, 3 figures | null | null | null | cs.NE cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cloud Computing is becoming the leading paradigm for executing scientific and
engineering workflows. The large-scale nature of the experiments they model and
their variable workloads make clouds the ideal execution environment due to
prompt and elastic access to huge amounts of computing resources. Autoscalers
are mi... | [
{
"created": "Fri, 2 Nov 2018 17:11:57 GMT",
"version": "v1"
}
] | 2018-11-05 | [
[
"Monge",
"David A.",
""
],
[
"Pacini",
"Elina",
""
],
[
"Mateos",
"Cristian",
""
],
[
"Alba",
"Enrique",
""
],
[
"Garino",
"Carlos García",
""
]
] | Cloud Computing is becoming the leading paradigm for executing scientific and engineering workflows. The large-scale nature of the experiments they model and their variable workloads make clouds the ideal execution environment due to prompt and elastic access to huge amounts of computing resources. Autoscalers are midd... |
2102.06491 | Thanasis Zoumpekas | Thanasis Zoumpekas, Anna Puig, Maria Salam\'o, David
Garc\'ia-Sell\'es, Laura Blanco Nu\~nez, Marta Guinau | End-to-End Intelligent Framework for Rockfall Detection | null | null | 10.1002/int.22557 | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Rockfall detection is a crucial procedure in the field of geology, which
helps to reduce the associated risks. Currently, geologists identify rockfall
events almost manually utilizing point cloud and imagery data obtained from
different caption devices such as Terrestrial Laser Scanner or digital cameras.
Multi-tempo... | [
{
"created": "Fri, 12 Feb 2021 12:48:17 GMT",
"version": "v1"
}
] | 2022-09-29 | [
[
"Zoumpekas",
"Thanasis",
""
],
[
"Puig",
"Anna",
""
],
[
"Salamó",
"Maria",
""
],
[
"García-Sellés",
"David",
""
],
[
"Nuñez",
"Laura Blanco",
""
],
[
"Guinau",
"Marta",
""
]
] | Rockfall detection is a crucial procedure in the field of geology, which helps to reduce the associated risks. Currently, geologists identify rockfall events almost manually utilizing point cloud and imagery data obtained from different caption devices such as Terrestrial Laser Scanner or digital cameras. Multi-tempora... |
2407.01193 | Francesco Barbato | Francesco Barbato, Umberto Michieli, Jijoong Moon, Pietro Zanuttigh,
Mete Ozay | Cross-Architecture Auxiliary Feature Space Translation for Efficient
Few-Shot Personalized Object Detection | Accepted at IROS 2024, 8 pages, 4 figures, 6 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have seen object detection robotic systems deployed in several
personal devices (e.g., home robots and appliances). This has highlighted a
challenge in their design, i.e., they cannot efficiently update their knowledge
to distinguish between general classes and user-specific instances (e.g., a dog
vs. us... | [
{
"created": "Mon, 1 Jul 2024 11:33:53 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Barbato",
"Francesco",
""
],
[
"Michieli",
"Umberto",
""
],
[
"Moon",
"Jijoong",
""
],
[
"Zanuttigh",
"Pietro",
""
],
[
"Ozay",
"Mete",
""
]
] | Recent years have seen object detection robotic systems deployed in several personal devices (e.g., home robots and appliances). This has highlighted a challenge in their design, i.e., they cannot efficiently update their knowledge to distinguish between general classes and user-specific instances (e.g., a dog vs. user... |
2302.05096 | Yen-Ting Lin | Yen-Ting Lin, Alexandros Papangelis, Seokhwan Kim, Sungjin Lee,
Devamanyu Hazarika, Mahdi Namazifar, Di Jin, Yang Liu, Dilek Hakkani-Tur | Selective In-Context Data Augmentation for Intent Detection using
Pointwise V-Information | Accepted at EACL 2023 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work focuses on in-context data augmentation for intent detection.
Having found that augmentation via in-context prompting of large pre-trained
language models (PLMs) alone does not improve performance, we introduce a novel
approach based on PLMs and pointwise V-information (PVI), a metric that can
measure the u... | [
{
"created": "Fri, 10 Feb 2023 07:37:49 GMT",
"version": "v1"
}
] | 2023-02-13 | [
[
"Lin",
"Yen-Ting",
""
],
[
"Papangelis",
"Alexandros",
""
],
[
"Kim",
"Seokhwan",
""
],
[
"Lee",
"Sungjin",
""
],
[
"Hazarika",
"Devamanyu",
""
],
[
"Namazifar",
"Mahdi",
""
],
[
"Jin",
"Di",
""
],
[
... | This work focuses on in-context data augmentation for intent detection. Having found that augmentation via in-context prompting of large pre-trained language models (PLMs) alone does not improve performance, we introduce a novel approach based on PLMs and pointwise V-information (PVI), a metric that can measure the use... |
2304.02284 | Linzhi Huang | Linzhi Huang, Mei Wang, Jiahao Liang, Weihong Deng, Hongzhi Shi,
Dongchao Wen, Yingjie Zhang, Jian Zhao | Gradient Attention Balance Network: Mitigating Face Recognition Racial
Bias via Gradient Attention | Accepted by CVPR 2023 workshop | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although face recognition has made impressive progress in recent years, we
ignore the racial bias of the recognition system when we pursue a high level of
accuracy. Previous work found that for different races, face recognition
networks focus on different facial regions, and the sensitive regions of
darker-skinned pe... | [
{
"created": "Wed, 5 Apr 2023 08:13:31 GMT",
"version": "v1"
}
] | 2023-04-06 | [
[
"Huang",
"Linzhi",
""
],
[
"Wang",
"Mei",
""
],
[
"Liang",
"Jiahao",
""
],
[
"Deng",
"Weihong",
""
],
[
"Shi",
"Hongzhi",
""
],
[
"Wen",
"Dongchao",
""
],
[
"Zhang",
"Yingjie",
""
],
[
"Zhao",
"... | Although face recognition has made impressive progress in recent years, we ignore the racial bias of the recognition system when we pursue a high level of accuracy. Previous work found that for different races, face recognition networks focus on different facial regions, and the sensitive regions of darker-skinned peop... |
2006.06969 | Wolfgang Fuhl | Wolfgang Fuhl and Enkelejda Kasneci | Multi Layer Neural Networks as Replacement for Pooling Operations | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pooling operations, which can be calculated at low cost and serve as a linear
or nonlinear transfer function for data reduction, are found in almost every
modern neural network. Countless modern approaches have already tackled
replacing the common maximum value selection and mean value operations, not to
mention prov... | [
{
"created": "Fri, 12 Jun 2020 07:08:38 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Oct 2020 07:03:37 GMT",
"version": "v2"
},
{
"created": "Fri, 30 Oct 2020 14:23:00 GMT",
"version": "v3"
},
{
"created": "Sun, 17 Jan 2021 12:02:52 GMT",
"version": "v4"
}
] | 2021-01-19 | [
[
"Fuhl",
"Wolfgang",
""
],
[
"Kasneci",
"Enkelejda",
""
]
] | Pooling operations, which can be calculated at low cost and serve as a linear or nonlinear transfer function for data reduction, are found in almost every modern neural network. Countless modern approaches have already tackled replacing the common maximum value selection and mean value operations, not to mention provid... |
1810.10927 | Ekaterina Lobacheva Ms | Nadezhda Chirkova, Ekaterina Lobacheva, Dmitry Vetrov | Bayesian Compression for Natural Language Processing | Published in EMNLP 2018 | null | null | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In natural language processing, a lot of the tasks are successfully solved
with recurrent neural networks, but such models have a huge number of
parameters. The majority of these parameters are often concentrated in the
embedding layer, which size grows proportionally to the vocabulary length. We
propose a Bayesian s... | [
{
"created": "Thu, 25 Oct 2018 15:27:23 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Dec 2018 17:18:13 GMT",
"version": "v2"
}
] | 2018-12-13 | [
[
"Chirkova",
"Nadezhda",
""
],
[
"Lobacheva",
"Ekaterina",
""
],
[
"Vetrov",
"Dmitry",
""
]
] | In natural language processing, a lot of the tasks are successfully solved with recurrent neural networks, but such models have a huge number of parameters. The majority of these parameters are often concentrated in the embedding layer, which size grows proportionally to the vocabulary length. We propose a Bayesian spa... |
2105.04183 | Zhiyong Cheng | Xinxiao Zhao, Zhiyong Cheng, Lei Zhu, Jiecai Zheng, Xueqing Li | UGRec: Modeling Directed and Undirected Relations for Recommendation | Accepted as a long paper in SIGIR 2021 | null | null | null | cs.IR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recommender systems, which merely leverage user-item interactions for user
preference prediction (such as the collaborative filtering-based ones), often
face dramatic performance degradation when the interactions of users or items
are insufficient. In recent years, various types of side information have been
explored... | [
{
"created": "Mon, 10 May 2021 08:20:29 GMT",
"version": "v1"
}
] | 2021-05-11 | [
[
"Zhao",
"Xinxiao",
""
],
[
"Cheng",
"Zhiyong",
""
],
[
"Zhu",
"Lei",
""
],
[
"Zheng",
"Jiecai",
""
],
[
"Li",
"Xueqing",
""
]
] | Recommender systems, which merely leverage user-item interactions for user preference prediction (such as the collaborative filtering-based ones), often face dramatic performance degradation when the interactions of users or items are insufficient. In recent years, various types of side information have been explored t... |
2209.07833 | Jaron Skovsted Gundersen | Qiongxiu Li and Jaron Skovsted Gundersen and Katrine Tjell and Rafal
Wisniewski and Mads Gr{\ae}sb{\o}ll Christensen | Privacy-Preserving Distributed Expectation Maximization for Gaussian
Mixture Model using Subspace Perturbation | null | ICASSP 2022 - 2022 IEEE International Conference on Acoustics,
Speech and Signal Processing (ICASSP), 2022, pp. 4263-4267 | 10.1109/ICASSP43922.2022.9746144 | null | cs.LG cs.CR | http://creativecommons.org/licenses/by/4.0/ | Privacy has become a major concern in machine learning. In fact, the
federated learning is motivated by the privacy concern as it does not allow to
transmit the private data but only intermediate updates. However, federated
learning does not always guarantee privacy-preservation as the intermediate
updates may also r... | [
{
"created": "Fri, 16 Sep 2022 09:58:03 GMT",
"version": "v1"
}
] | 2022-09-19 | [
[
"Li",
"Qiongxiu",
""
],
[
"Gundersen",
"Jaron Skovsted",
""
],
[
"Tjell",
"Katrine",
""
],
[
"Wisniewski",
"Rafal",
""
],
[
"Christensen",
"Mads Græsbøll",
""
]
] | Privacy has become a major concern in machine learning. In fact, the federated learning is motivated by the privacy concern as it does not allow to transmit the private data but only intermediate updates. However, federated learning does not always guarantee privacy-preservation as the intermediate updates may also rev... |
1903.12079 | Charith Perera | Nader Sohrabi Safa, Carsten Maple, Steve Furnell, Muhammad Ajmal Azad,
Charith Perera, Mohammad Dabbagh, Mehdi Sookhak | Deterrence and Prevention-based Model to Mitigate Information Security
Insider Threats in Organisations | null | Future Generation Computer Systems (FGCS) 2019 | null | null | cs.CY cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Previous studies show that information security breaches and privacy
violations are important issues for organisations and people. It is
acknowledged that decreasing the risk in this domain requires consideration of
the technological aspects of information security alongside human aspects.
Employees intentionally or ... | [
{
"created": "Fri, 15 Mar 2019 13:32:05 GMT",
"version": "v1"
}
] | 2019-03-29 | [
[
"Safa",
"Nader Sohrabi",
""
],
[
"Maple",
"Carsten",
""
],
[
"Furnell",
"Steve",
""
],
[
"Azad",
"Muhammad Ajmal",
""
],
[
"Perera",
"Charith",
""
],
[
"Dabbagh",
"Mohammad",
""
],
[
"Sookhak",
"Mehdi",
""
... | Previous studies show that information security breaches and privacy violations are important issues for organisations and people. It is acknowledged that decreasing the risk in this domain requires consideration of the technological aspects of information security alongside human aspects. Employees intentionally or un... |
1810.05325 | Hangguan Shan | Hangguan Shan, Taojie Qin, Guanding Yu, Lin X. Cai, Yu Cheng, Tony Q.
S. Quek | Throughput Analysis and Energy Efficiency Optimization for Standalone
LTE-U Networks with Randomly Delayed CSI | submitted to IEEE Transactions on Green Communications and Networking | null | null | null | cs.NI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | To coexist with Wi-Fi friendly, a standalone long-term evolution network over
unlicensed spectrum (LTE-U) under listen-before-talk (LBT) mechanism can only
access channel in a random and intermittent way, which results in random and
time-variant delay in both data and signaling transmissions. In this work, we
explore... | [
{
"created": "Fri, 12 Oct 2018 02:53:02 GMT",
"version": "v1"
}
] | 2018-10-15 | [
[
"Shan",
"Hangguan",
""
],
[
"Qin",
"Taojie",
""
],
[
"Yu",
"Guanding",
""
],
[
"Cai",
"Lin X.",
""
],
[
"Cheng",
"Yu",
""
],
[
"Quek",
"Tony Q. S.",
""
]
] | To coexist with Wi-Fi friendly, a standalone long-term evolution network over unlicensed spectrum (LTE-U) under listen-before-talk (LBT) mechanism can only access channel in a random and intermittent way, which results in random and time-variant delay in both data and signaling transmissions. In this work, we explore t... |
1711.01454 | Zahra Ghodsi | Zahra Ghodsi, Siddharth Garg, Ramesh Karri | Optimal Checkpointing for Secure Intermittently-Powered IoT Devices | ICCAD 2017 | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Energy harvesting is a promising solution to power Internet of Things (IoT)
devices. Due to the intermittent nature of these energy sources, one cannot
guarantee forward progress of program execution. Prior work has advocated for
checkpointing the intermediate state to off-chip non-volatile memory (NVM).
Encrypting c... | [
{
"created": "Sat, 4 Nov 2017 15:51:32 GMT",
"version": "v1"
}
] | 2017-11-07 | [
[
"Ghodsi",
"Zahra",
""
],
[
"Garg",
"Siddharth",
""
],
[
"Karri",
"Ramesh",
""
]
] | Energy harvesting is a promising solution to power Internet of Things (IoT) devices. Due to the intermittent nature of these energy sources, one cannot guarantee forward progress of program execution. Prior work has advocated for checkpointing the intermediate state to off-chip non-volatile memory (NVM). Encrypting che... |
2002.00168 | Ying Cui | Yuhang Jia, Chencheng Ye, and Ying Cui | Analysis and Optimization of an Intelligent Reflecting Surface-assisted
System with Interference | 14 pages, 9 figures, to appear in IEEE Trans. Wireless Commun | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study an intelligent reflecting surface (IRS)-assisted
system where a multi-antenna base station (BS) serves a single-antenna user
with the help of a multi-element IRS in the presence of interference generated
by a multi-antenna BS serving its own single-antenna user. The signal and
interference lin... | [
{
"created": "Sat, 1 Feb 2020 08:28:50 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Aug 2020 14:00:21 GMT",
"version": "v2"
},
{
"created": "Thu, 24 Sep 2020 10:53:35 GMT",
"version": "v3"
}
] | 2020-09-25 | [
[
"Jia",
"Yuhang",
""
],
[
"Ye",
"Chencheng",
""
],
[
"Cui",
"Ying",
""
]
] | In this paper, we study an intelligent reflecting surface (IRS)-assisted system where a multi-antenna base station (BS) serves a single-antenna user with the help of a multi-element IRS in the presence of interference generated by a multi-antenna BS serving its own single-antenna user. The signal and interference links... |
1001.3242 | Gopal Pandurangan | Jen-Yeu Chen and Gopal Pandurangan | Optimal Gossip-Based Aggregate Computation | null | null | null | null | cs.DS cs.CC cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the first provably almost-optimal gossip-based algorithms for
aggregate computation that are both time optimal and message-optimal. Given a
$n$-node network, our algorithms guarantee that all the nodes can compute the
common aggregates (such as Min, Max, Count, Sum, Average, Rank etc.) of their
values in o... | [
{
"created": "Tue, 19 Jan 2010 09:51:48 GMT",
"version": "v1"
}
] | 2010-01-20 | [
[
"Chen",
"Jen-Yeu",
""
],
[
"Pandurangan",
"Gopal",
""
]
] | We present the first provably almost-optimal gossip-based algorithms for aggregate computation that are both time optimal and message-optimal. Given a $n$-node network, our algorithms guarantee that all the nodes can compute the common aggregates (such as Min, Max, Count, Sum, Average, Rank etc.) of their values in opt... |
2301.07757 | Lucas Silva | Lucas de Oliveira Silva | Freeze-Tag is NP-Hard in 3D with $L_1$ distance | null | null | null | null | cs.CG cs.CC | http://creativecommons.org/licenses/by/4.0/ | Arkin et al. in 2002 introduced a scheduling-like problem called Freeze-Tag
Problem (FTP) motivated by robot swarm activation. The input consists of the
locations of n mobile punctual robots in some metric space or graph. Only one
begins "active", while the others are initially "frozen". All active robots can
move at... | [
{
"created": "Wed, 18 Jan 2023 19:45:31 GMT",
"version": "v1"
}
] | 2023-01-20 | [
[
"Silva",
"Lucas de Oliveira",
""
]
] | Arkin et al. in 2002 introduced a scheduling-like problem called Freeze-Tag Problem (FTP) motivated by robot swarm activation. The input consists of the locations of n mobile punctual robots in some metric space or graph. Only one begins "active", while the others are initially "frozen". All active robots can move at u... |
2206.12412 | Henning M\"uller | Henning M\"uller, Ali Touil, Alexander Schl\"uter, Ralf M\"uller | Dynamic Propagation of Mode III Cracks in a Lattice Boltzmann Method for
Solids | accepted for publication in Archive of Applied Mechanics | null | 10.1007/s00419-022-02306-y | null | cs.CE physics.comp-ph | http://creativecommons.org/licenses/by/4.0/ | This work presents concepts and algorithms for the simulation of dynamic
fractures with a Lattice Boltzmann method (LBM) for linear elastic solids. This
LBM has been presented previously and solves the wave equation, which is
interpreted as the governing equation for antiplane shear deformation. Besides
the steady gr... | [
{
"created": "Thu, 23 Jun 2022 10:11:08 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Oct 2022 08:33:46 GMT",
"version": "v2"
}
] | 2023-01-11 | [
[
"Müller",
"Henning",
""
],
[
"Touil",
"Ali",
""
],
[
"Schlüter",
"Alexander",
""
],
[
"Müller",
"Ralf",
""
]
] | This work presents concepts and algorithms for the simulation of dynamic fractures with a Lattice Boltzmann method (LBM) for linear elastic solids. This LBM has been presented previously and solves the wave equation, which is interpreted as the governing equation for antiplane shear deformation. Besides the steady grow... |
2101.11287 | Lucas Weber | Lucas Weber, Jaap Jumelet, Elia Bruni and Dieuwke Hupkes | Language Modelling as a Multi-Task Problem | Accepted for publication at EACL 2021 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose to study language modelling as a multi-task
problem, bringing together three strands of research: multi-task learning,
linguistics, and interpretability. Based on hypotheses derived from linguistic
theory, we investigate whether language models adhere to learning principles of
multi-task lea... | [
{
"created": "Wed, 27 Jan 2021 09:47:42 GMT",
"version": "v1"
}
] | 2021-01-28 | [
[
"Weber",
"Lucas",
""
],
[
"Jumelet",
"Jaap",
""
],
[
"Bruni",
"Elia",
""
],
[
"Hupkes",
"Dieuwke",
""
]
] | In this paper, we propose to study language modelling as a multi-task problem, bringing together three strands of research: multi-task learning, linguistics, and interpretability. Based on hypotheses derived from linguistic theory, we investigate whether language models adhere to learning principles of multi-task learn... |
2401.10601 | Dildar Ali | Dildar Ali, Tejash Gupta, Suman Banerjee, Yamuna Prasad | Influential Slot and Tag Selection in Billboard Advertisement | 15 pages | null | null | null | cs.DS cs.DB | http://creativecommons.org/licenses/by/4.0/ | The selection of influential billboard slots remains an important problem in
billboard advertisements. Existing studies on this problem have not considered
the case of context-specific influence probability. To bridge this gap, in this
paper, we introduce the Context Dependent Influential Billboard Slot Selection
Pro... | [
{
"created": "Fri, 19 Jan 2024 10:19:34 GMT",
"version": "v1"
}
] | 2024-01-22 | [
[
"Ali",
"Dildar",
""
],
[
"Gupta",
"Tejash",
""
],
[
"Banerjee",
"Suman",
""
],
[
"Prasad",
"Yamuna",
""
]
] | The selection of influential billboard slots remains an important problem in billboard advertisements. Existing studies on this problem have not considered the case of context-specific influence probability. To bridge this gap, in this paper, we introduce the Context Dependent Influential Billboard Slot Selection Probl... |
0803.2639 | Camilla Hollanti | Camilla Hollanti, Jyrki Lahtonen, Hsiao-feng Francis Lu | Maximal Orders in the Design of Dense Space-Time Lattice Codes | 24 pages, 17 figures, revised version submitted to IEEE Trans. on
Inform. Theory Dec. 2007, first version submitted Sep. 2006 | IEEE Trans. Inf. Theory, vol. 54(10), Oct. 2008, pp. 4493-4510 | 10.1109/TIT.2008.928998 | null | cs.IT cs.DM math.IT math.RA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We construct explicit rate-one, full-diversity, geometrically dense matrix
lattices with large, non-vanishing determinants (NVD) for four transmit antenna
multiple-input single-output (MISO) space-time (ST) applications. The
constructions are based on the theory of rings of algebraic integers and
related subrings of ... | [
{
"created": "Tue, 18 Mar 2008 14:20:44 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Hollanti",
"Camilla",
""
],
[
"Lahtonen",
"Jyrki",
""
],
[
"Lu",
"Hsiao-feng Francis",
""
]
] | We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions are based on the theory of rings of algebraic integers and related subrings of th... |
2002.04425 | Lu Bai | Lu Bai, Lixin Cui, Edwin R. Hancock | A Hierarchical Transitive-Aligned Graph Kernel for Un-attributed Graphs | null | null | null | null | cs.SI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we develop a new graph kernel, namely the Hierarchical
Transitive-Aligned kernel, by transitively aligning the vertices between graphs
through a family of hierarchical prototype graphs. Comparing to most existing
state-of-the-art graph kernels, the proposed kernel has three theoretical
advantages. Firs... | [
{
"created": "Sat, 8 Feb 2020 11:46:25 GMT",
"version": "v1"
}
] | 2020-02-12 | [
[
"Bai",
"Lu",
""
],
[
"Cui",
"Lixin",
""
],
[
"Hancock",
"Edwin R.",
""
]
] | In this paper, we develop a new graph kernel, namely the Hierarchical Transitive-Aligned kernel, by transitively aligning the vertices between graphs through a family of hierarchical prototype graphs. Comparing to most existing state-of-the-art graph kernels, the proposed kernel has three theoretical advantages. First,... |
2310.00785 | Yapei Chang | Yapei Chang, Kyle Lo, Tanya Goyal, Mohit Iyyer | BooookScore: A systematic exploration of book-length summarization in
the era of LLMs | ICLR 2024 camera-ready (updated figure1 and table2; corrected minor
details in the explanation of hierarchical merging) | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Summarizing book-length documents (>100K tokens) that exceed the context
window size of large language models (LLMs) requires first breaking the input
document into smaller chunks and then prompting an LLM to merge, update, and
compress chunk-level summaries. Despite the complexity and importance of this
task, it has... | [
{
"created": "Sun, 1 Oct 2023 20:46:44 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Oct 2023 19:34:26 GMT",
"version": "v2"
},
{
"created": "Tue, 19 Mar 2024 20:13:59 GMT",
"version": "v3"
},
{
"created": "Sat, 13 Apr 2024 22:02:23 GMT",
"version": "v4"
}
] | 2024-04-16 | [
[
"Chang",
"Yapei",
""
],
[
"Lo",
"Kyle",
""
],
[
"Goyal",
"Tanya",
""
],
[
"Iyyer",
"Mohit",
""
]
] | Summarizing book-length documents (>100K tokens) that exceed the context window size of large language models (LLMs) requires first breaking the input document into smaller chunks and then prompting an LLM to merge, update, and compress chunk-level summaries. Despite the complexity and importance of this task, it has y... |
2106.14935 | Wolfgang Mulzer | Alexander Baumann, Haim Kaplan, Katharina Klost, Kristin Knorr,
Wolfgang Mulzer, Liam Roditty and Paul Seiferth | Dynamic Connectivity in Disk Graphs | 58 pages, 27 figures; a preliminary version appeared at SoCG 2022 | Discrete and Computational Geometry (DCG), 71(1), Jan 2024, pp.
214.277 | 10.1007/s00454-023-00621-x | null | cs.CG cs.DS | http://creativecommons.org/licenses/by/4.0/ | Let $S$ be a set of $n$ sites in the plane, so that every site $s \in S$ has
an associated radius $r_s > 0$. Let $\mathcal{D}(S)$ be the disk intersection
graph defined by $S$, i.e., the graph with vertex set $S$ and an edge between
two distinct sites $s, t \in S$ if and only if the disks with centers $s$, $t$
and ra... | [
{
"created": "Mon, 28 Jun 2021 18:32:33 GMT",
"version": "v1"
},
{
"created": "Wed, 1 May 2024 09:30:52 GMT",
"version": "v2"
}
] | 2024-05-02 | [
[
"Baumann",
"Alexander",
""
],
[
"Kaplan",
"Haim",
""
],
[
"Klost",
"Katharina",
""
],
[
"Knorr",
"Kristin",
""
],
[
"Mulzer",
"Wolfgang",
""
],
[
"Roditty",
"Liam",
""
],
[
"Seiferth",
"Paul",
""
]
] | Let $S$ be a set of $n$ sites in the plane, so that every site $s \in S$ has an associated radius $r_s > 0$. Let $\mathcal{D}(S)$ be the disk intersection graph defined by $S$, i.e., the graph with vertex set $S$ and an edge between two distinct sites $s, t \in S$ if and only if the disks with centers $s$, $t$ and radi... |
2204.04579 | Danni Ma | Danni Ma, Neville Ryant, Mark Liberman | Inferring Pitch from Coarse Spectral Features | null | null | 10.1121/10.0015792 | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fundamental frequency (F0) has long been treated as the physical definition
of "pitch" in phonetic analysis. But there have been many demonstrations that
F0 is at best an approximation to pitch, both in production and in perception:
pitch is not F0, and F0 is not pitch. Changes in the pitch involve many
articulatory ... | [
{
"created": "Sun, 10 Apr 2022 02:13:03 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Aug 2022 18:42:00 GMT",
"version": "v2"
}
] | 2022-12-14 | [
[
"Ma",
"Danni",
""
],
[
"Ryant",
"Neville",
""
],
[
"Liberman",
"Mark",
""
]
] | Fundamental frequency (F0) has long been treated as the physical definition of "pitch" in phonetic analysis. But there have been many demonstrations that F0 is at best an approximation to pitch, both in production and in perception: pitch is not F0, and F0 is not pitch. Changes in the pitch involve many articulatory an... |
1704.06756 | Shima Alizadeh | Shima Alizadeh and Azar Fazel | Convolutional Neural Networks for Facial Expression Recognition | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We have developed convolutional neural networks (CNN) for a facial expression
recognition task. The goal is to classify each facial image into one of the
seven facial emotion categories considered in this study. We trained CNN models
with different depth using gray-scale images. We developed our models in Torch
and e... | [
{
"created": "Sat, 22 Apr 2017 06:27:56 GMT",
"version": "v1"
}
] | 2017-04-25 | [
[
"Alizadeh",
"Shima",
""
],
[
"Fazel",
"Azar",
""
]
] | We have developed convolutional neural networks (CNN) for a facial expression recognition task. The goal is to classify each facial image into one of the seven facial emotion categories considered in this study. We trained CNN models with different depth using gray-scale images. We developed our models in Torch and exp... |
2205.00102 | Junlin Wu | Junlin Wu, Andrew Estornell, Lecheng Kong, Yevgeniy Vorobeychik | Manipulating Elections by Changing Voter Perceptions | IJCAI 2022 | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The integrity of elections is central to democratic systems. However, a
myriad of malicious actors aspire to influence election outcomes for financial
or political benefit. A common means to such ends is by manipulating
perceptions of the voting public about select candidates, for example, through
misinformation. We ... | [
{
"created": "Fri, 29 Apr 2022 23:23:37 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jun 2022 19:55:57 GMT",
"version": "v2"
}
] | 2022-06-22 | [
[
"Wu",
"Junlin",
""
],
[
"Estornell",
"Andrew",
""
],
[
"Kong",
"Lecheng",
""
],
[
"Vorobeychik",
"Yevgeniy",
""
]
] | The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the voting public about select candidates, for example, through misinformation. We pr... |
2302.10771 | Chu Wang | Chu Wang, Manfeng Dou, Zhongliang Li, Rachid Outbib, Dongdong Zhao,
Jian Zuo, Yuanlin Wang, Bin Liang, Peng Wang | Data-driven prognostics based on time-frequency analysis and symbolic
recurrent neural network for fuel cells under dynamic load | null | null | 10.1016/j.ress.2023.109123 | null | cs.LG cs.SY eess.SY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Data-centric prognostics is beneficial to improve the reliability and safety
of proton exchange membrane fuel cell (PEMFC). For the prognostics of PEMFC
operating under dynamic load, the challenges come from extracting degradation
features, improving prediction accuracy, expanding the prognostics horizon, and
reducin... | [
{
"created": "Fri, 3 Feb 2023 12:52:49 GMT",
"version": "v1"
}
] | 2023-02-22 | [
[
"Wang",
"Chu",
""
],
[
"Dou",
"Manfeng",
""
],
[
"Li",
"Zhongliang",
""
],
[
"Outbib",
"Rachid",
""
],
[
"Zhao",
"Dongdong",
""
],
[
"Zuo",
"Jian",
""
],
[
"Wang",
"Yuanlin",
""
],
[
"Liang",
"B... | Data-centric prognostics is beneficial to improve the reliability and safety of proton exchange membrane fuel cell (PEMFC). For the prognostics of PEMFC operating under dynamic load, the challenges come from extracting degradation features, improving prediction accuracy, expanding the prognostics horizon, and reducing ... |
1812.07010 | Mark Kozdoba | Mark Kozdoba, Edward Moroshko, Lior Shani, Takuya Takagi, Takashi
Katoh, Shie Mannor, Koby Crammer | Multi Instance Learning For Unbalanced Data | null | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the context of Multi Instance Learning, we analyze the Single Instance
(SI) learning objective. We show that when the data is unbalanced and the
family of classifiers is sufficiently rich, the SI method is a useful learning
algorithm. In particular, we show that larger data imbalance, a quality that is
typically p... | [
{
"created": "Mon, 17 Dec 2018 19:28:30 GMT",
"version": "v1"
}
] | 2018-12-19 | [
[
"Kozdoba",
"Mark",
""
],
[
"Moroshko",
"Edward",
""
],
[
"Shani",
"Lior",
""
],
[
"Takagi",
"Takuya",
""
],
[
"Katoh",
"Takashi",
""
],
[
"Mannor",
"Shie",
""
],
[
"Crammer",
"Koby",
""
]
] | In the context of Multi Instance Learning, we analyze the Single Instance (SI) learning objective. We show that when the data is unbalanced and the family of classifiers is sufficiently rich, the SI method is a useful learning algorithm. In particular, we show that larger data imbalance, a quality that is typically per... |
1901.06109 | Gustavo Goretkin | Gustavo Goretkin and Leslie Pack Kaelbling and Tom\'as Lozano-P\'erez | Look before you sweep: Visibility-aware motion planning | WAFR 2018 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the problem of planning for a robot with a directional
obstacle-detection sensor that must move through a cluttered environment. The
planning objective is to remain safe by finding a path for the complete robot,
including sensor, that guarantees that the robot will not move into any part of
the w... | [
{
"created": "Fri, 18 Jan 2019 07:19:40 GMT",
"version": "v1"
}
] | 2019-01-21 | [
[
"Goretkin",
"Gustavo",
""
],
[
"Kaelbling",
"Leslie Pack",
""
],
[
"Lozano-Pérez",
"Tomás",
""
]
] | This paper addresses the problem of planning for a robot with a directional obstacle-detection sensor that must move through a cluttered environment. The planning objective is to remain safe by finding a path for the complete robot, including sensor, that guarantees that the robot will not move into any part of the wor... |
2305.13499 | Kuan-Hao Huang | Kuan-Hao Huang, Liang Tan, Rui Hou, Sinong Wang, Amjad Almahairi, Ruty
Rinott | Learning Easily Updated General Purpose Text Representations with
Adaptable Task-Specific Prefixes | Paper accepted by EMNLP 2023 Findings | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many real-world applications require making multiple predictions from the
same text. Fine-tuning a large pre-trained language model for each downstream
task causes computational burdens in the inference time due to several times of
forward passes. To amortize the computational cost, freezing the language model
and bu... | [
{
"created": "Mon, 22 May 2023 21:31:03 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Oct 2023 15:35:07 GMT",
"version": "v2"
}
] | 2023-10-17 | [
[
"Huang",
"Kuan-Hao",
""
],
[
"Tan",
"Liang",
""
],
[
"Hou",
"Rui",
""
],
[
"Wang",
"Sinong",
""
],
[
"Almahairi",
"Amjad",
""
],
[
"Rinott",
"Ruty",
""
]
] | Many real-world applications require making multiple predictions from the same text. Fine-tuning a large pre-trained language model for each downstream task causes computational burdens in the inference time due to several times of forward passes. To amortize the computational cost, freezing the language model and buil... |
2208.03523 | Francesco Landolfi | Davide Bacciu, Alessio Conte, Francesco Landolfi | Generalizing Downsampling from Regular Data to Graphs | Accepted at AAAI 2023; Extended version with proofs; 15 pages, 3
figures, 5 tables | null | 10.1609/aaai.v37i6.25824 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Downsampling produces coarsened, multi-resolution representations of data and
it is used, for example, to produce lossy compression and visualization of
large images, reduce computational costs, and boost deep neural representation
learning. Unfortunately, due to their lack of a regular structure, there is
still no c... | [
{
"created": "Sat, 6 Aug 2022 14:12:47 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Nov 2022 13:41:21 GMT",
"version": "v2"
},
{
"created": "Thu, 1 Dec 2022 07:32:14 GMT",
"version": "v3"
}
] | 2023-07-04 | [
[
"Bacciu",
"Davide",
""
],
[
"Conte",
"Alessio",
""
],
[
"Landolfi",
"Francesco",
""
]
] | Downsampling produces coarsened, multi-resolution representations of data and it is used, for example, to produce lossy compression and visualization of large images, reduce computational costs, and boost deep neural representation learning. Unfortunately, due to their lack of a regular structure, there is still no con... |
2111.03112 | Ivan Kapelyukh | Ivan Kapelyukh and Edward Johns | My House, My Rules: Learning Tidying Preferences with Graph Neural
Networks | Published at CoRL 2021. Webpage and video:
https://www.robot-learning.uk/my-house-my-rules | null | null | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robots that arrange household objects should do so according to the user's
preferences, which are inherently subjective and difficult to model. We present
NeatNet: a novel Variational Autoencoder architecture using Graph Neural
Network layers, which can extract a low-dimensional latent preference vector
from a user b... | [
{
"created": "Thu, 4 Nov 2021 19:17:19 GMT",
"version": "v1"
}
] | 2021-11-08 | [
[
"Kapelyukh",
"Ivan",
""
],
[
"Johns",
"Edward",
""
]
] | Robots that arrange household objects should do so according to the user's preferences, which are inherently subjective and difficult to model. We present NeatNet: a novel Variational Autoencoder architecture using Graph Neural Network layers, which can extract a low-dimensional latent preference vector from a user by ... |
2105.09678 | Hossam Farag | Hossam Farag and Cedomir Stefanovic | Congestion-Aware Routing in Dynamic IoT Networks: A Reinforcement
Learning Approach | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | The innovative services empowered by the Internet of Things (IoT) require a
seamless and reliable wireless infrastructure that enables communications
within heterogeneous and dynamic low-power and lossy networks (LLNs). The
Routing Protocol for LLNs (RPL) was designed to meet the communication
requirements of a wide ... | [
{
"created": "Thu, 20 May 2021 11:32:32 GMT",
"version": "v1"
}
] | 2021-05-21 | [
[
"Farag",
"Hossam",
""
],
[
"Stefanovic",
"Cedomir",
""
]
] | The innovative services empowered by the Internet of Things (IoT) require a seamless and reliable wireless infrastructure that enables communications within heterogeneous and dynamic low-power and lossy networks (LLNs). The Routing Protocol for LLNs (RPL) was designed to meet the communication requirements of a wide ra... |
1407.3200 | Przemyslaw Uznanski | J\'er\'emie Chalopin (LIF), Shantanu Das (LIF), Pawel Gawrychowski
(MPII), Adrian Kosowski (INRIA Paris-Rocquencourt, LIAFA), Arnaud Labourel
(LIF), Przemyslaw Uzna\'nski | Lock-in Problem for Parallel Rotor-router Walks | null | null | null | null | cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rotor-router model, also called the Propp machine, was introduced as a
deterministic alternative to the random walk. In this model, a group of
identical tokens are initially placed at nodes of the graph. Each node
maintains a cyclic ordering of the outgoing arcs, and during consecutive turns
the tokens are propag... | [
{
"created": "Thu, 10 Jul 2014 06:12:51 GMT",
"version": "v1"
},
{
"created": "Sun, 22 Feb 2015 08:03:07 GMT",
"version": "v2"
},
{
"created": "Thu, 28 May 2015 06:15:01 GMT",
"version": "v3"
}
] | 2015-05-29 | [
[
"Chalopin",
"Jérémie",
"",
"LIF"
],
[
"Das",
"Shantanu",
"",
"LIF"
],
[
"Gawrychowski",
"Pawel",
"",
"MPII"
],
[
"Kosowski",
"Adrian",
"",
"INRIA Paris-Rocquencourt, LIAFA"
],
[
"Labourel",
"Arnaud",
"",
"LIF"
],
[... | The rotor-router model, also called the Propp machine, was introduced as a deterministic alternative to the random walk. In this model, a group of identical tokens are initially placed at nodes of the graph. Each node maintains a cyclic ordering of the outgoing arcs, and during consecutive turns the tokens are propagat... |
1907.10594 | Nitish Nag | Nitish Nag, Vaibhav Pandey, Likhita Navali, Prateek Mohan, Ramesh Jain | Synchronizing Geospatial Information for Personalized Health Monitoring | null | null | null | null | cs.HC physics.med-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The health effects of air pollution have been subject to intense study in
recent decades. Exposure to pollutants such as airborne particulate matter and
ozone has been associated with increases in morbidity and mortality, especially
with regards to respiratory and cardiovascular diseases. Unfortunately,
individuals d... | [
{
"created": "Wed, 3 Jul 2019 19:16:03 GMT",
"version": "v1"
}
] | 2019-07-25 | [
[
"Nag",
"Nitish",
""
],
[
"Pandey",
"Vaibhav",
""
],
[
"Navali",
"Likhita",
""
],
[
"Mohan",
"Prateek",
""
],
[
"Jain",
"Ramesh",
""
]
] | The health effects of air pollution have been subject to intense study in recent decades. Exposure to pollutants such as airborne particulate matter and ozone has been associated with increases in morbidity and mortality, especially with regards to respiratory and cardiovascular diseases. Unfortunately, individuals do ... |
2208.13893 | Emily Wenger | Emily Wenger and Xiuyu Li and Ben Y. Zhao and Vitaly Shmatikov | Data Isotopes for Data Provenance in DNNs | 17 pages | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Today, creators of data-hungry deep neural networks (DNNs) scour the Internet
for training fodder, leaving users with little control over or knowledge of
when their data is appropriated for model training. To empower users to
counteract unwanted data use, we design, implement and evaluate a practical
system that enab... | [
{
"created": "Mon, 29 Aug 2022 21:28:35 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Feb 2023 18:39:20 GMT",
"version": "v2"
}
] | 2023-02-28 | [
[
"Wenger",
"Emily",
""
],
[
"Li",
"Xiuyu",
""
],
[
"Zhao",
"Ben Y.",
""
],
[
"Shmatikov",
"Vitaly",
""
]
] | Today, creators of data-hungry deep neural networks (DNNs) scour the Internet for training fodder, leaving users with little control over or knowledge of when their data is appropriated for model training. To empower users to counteract unwanted data use, we design, implement and evaluate a practical system that enable... |
1002.0382 | Dakshina Ranjan Kisku | Dakshina Ranjan Kisku, Massimo Tistarelli, Jamuna Kanta Sing, Phalguni
Gupta | Face Recognition by Fusion of Local and Global Matching Scores using DS
Theory: An Evaluation with Uni-classifier and Multi-classifier Paradigm | 7 pages, 6 figures, IEEE Computer Vision and Pattern Recognition
Workshop on Biometrics | null | 10.1109/CVPRW.2009.5204298 | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Faces are highly deformable objects which may easily change their appearance
over time. Not all face areas are subject to the same variability. Therefore
decoupling the information from independent areas of the face is of paramount
importance to improve the robustness of any face recognition technique. This
paper pre... | [
{
"created": "Tue, 2 Feb 2010 02:22:58 GMT",
"version": "v1"
}
] | 2016-11-18 | [
[
"Kisku",
"Dakshina Ranjan",
""
],
[
"Tistarelli",
"Massimo",
""
],
[
"Sing",
"Jamuna Kanta",
""
],
[
"Gupta",
"Phalguni",
""
]
] | Faces are highly deformable objects which may easily change their appearance over time. Not all face areas are subject to the same variability. Therefore decoupling the information from independent areas of the face is of paramount importance to improve the robustness of any face recognition technique. This paper prese... |
0806.1446 | Guoshen Yu | Guoshen Yu and Jean-Jacques Slotine | Fast Wavelet-Based Visual Classification | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate a biologically motivated approach to fast visual
classification, directly inspired by the recent work of Serre et al.
Specifically, trading-off biological accuracy for computational efficiency, we
explore using wavelet and grouplet-like transforms to parallel the tuning of
visual cortex V1 and V2 cells... | [
{
"created": "Sun, 8 Jun 2008 10:15:04 GMT",
"version": "v1"
}
] | 2008-06-10 | [
[
"Yu",
"Guoshen",
""
],
[
"Slotine",
"Jean-Jacques",
""
]
] | We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work of Serre et al. Specifically, trading-off biological accuracy for computational efficiency, we explore using wavelet and grouplet-like transforms to parallel the tuning of visual cortex V1 and V2 cells, ... |
2405.15734 | BoYang Zheng | Boyang Zheng, Jinjin Gu, Shijun Li, Chao Dong | LM4LV: A Frozen Large Language Model for Low-level Vision Tasks | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The success of large language models (LLMs) has fostered a new research trend
of multi-modality large language models (MLLMs), which changes the paradigm of
various fields in computer vision. Though MLLMs have shown promising results in
numerous high-level vision and vision-language tasks such as VQA and
text-to-imag... | [
{
"created": "Fri, 24 May 2024 17:25:00 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jun 2024 15:42:29 GMT",
"version": "v2"
}
] | 2024-06-12 | [
[
"Zheng",
"Boyang",
""
],
[
"Gu",
"Jinjin",
""
],
[
"Li",
"Shijun",
""
],
[
"Dong",
"Chao",
""
]
] | The success of large language models (LLMs) has fostered a new research trend of multi-modality large language models (MLLMs), which changes the paradigm of various fields in computer vision. Though MLLMs have shown promising results in numerous high-level vision and vision-language tasks such as VQA and text-to-image,... |
2106.12849 | Francesco Gavazzo | Ugo Dal Lago and Francesco Gavazzo | Resource Transition Systems and Full Abstraction for Linear Higher-Order
Effectful Systems | null | null | null | null | cs.PL cs.LO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We investigate program equivalence for linear higher-order(sequential)
languages endowed with primitives for computational effects. More specifically,
we study operationally-based notions of program equivalence for a linear
$\lambda$-calculus with explicit copying and algebraic effects \emph{\`a la}
Plotkin and Power... | [
{
"created": "Thu, 24 Jun 2021 09:21:13 GMT",
"version": "v1"
}
] | 2021-06-25 | [
[
"Lago",
"Ugo Dal",
""
],
[
"Gavazzo",
"Francesco",
""
]
] | We investigate program equivalence for linear higher-order(sequential) languages endowed with primitives for computational effects. More specifically, we study operationally-based notions of program equivalence for a linear $\lambda$-calculus with explicit copying and algebraic effects \emph{\`a la} Plotkin and Power. ... |
2207.05080 | Fei Ye | Fei Ye and Adrian G. Bors | Learning an evolved mixture model for task-free continual learning | Accepted by the 29th IEEE International Conference on Image
Processing (ICIP 2022) | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recently, continual learning (CL) has gained significant interest because it
enables deep learning models to acquire new knowledge without forgetting
previously learnt information. However, most existing works require knowing the
task identities and boundaries, which is not realistic in a real context. In
this paper,... | [
{
"created": "Mon, 11 Jul 2022 16:01:27 GMT",
"version": "v1"
}
] | 2022-07-13 | [
[
"Ye",
"Fei",
""
],
[
"Bors",
"Adrian G.",
""
]
] | Recently, continual learning (CL) has gained significant interest because it enables deep learning models to acquire new knowledge without forgetting previously learnt information. However, most existing works require knowing the task identities and boundaries, which is not realistic in a real context. In this paper, w... |
2005.04871 | Lu Wang | Lu Wang, Huan Zhang, Jinfeng Yi, Cho-Jui Hsieh, Yuan Jiang | Spanning Attack: Reinforce Black-box Attacks with Unlabeled Data | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adversarial black-box attacks aim to craft adversarial perturbations by
querying input-output pairs of machine learning models. They are widely used to
evaluate the robustness of pre-trained models. However, black-box attacks often
suffer from the issue of query inefficiency due to the high dimensionality of
the inpu... | [
{
"created": "Mon, 11 May 2020 05:57:15 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Nov 2020 03:54:26 GMT",
"version": "v2"
}
] | 2020-11-11 | [
[
"Wang",
"Lu",
""
],
[
"Zhang",
"Huan",
""
],
[
"Yi",
"Jinfeng",
""
],
[
"Hsieh",
"Cho-Jui",
""
],
[
"Jiang",
"Yuan",
""
]
] | Adversarial black-box attacks aim to craft adversarial perturbations by querying input-output pairs of machine learning models. They are widely used to evaluate the robustness of pre-trained models. However, black-box attacks often suffer from the issue of query inefficiency due to the high dimensionality of the input ... |
2407.07289 | Mao Ye | Dengyan Luo, Yanping Xiang, Hu Wang, Luping Ji, Shuai Li and Mao Ye | Deformable Feature Alignment and Refinement for Moving Infrared
Dim-small Target Detection | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The detection of moving infrared dim-small targets has been a challenging and
prevalent research topic. The current state-of-the-art methods are mainly based
on ConvLSTM to aggregate information from adjacent frames to facilitate the
detection of the current frame. However, these methods implicitly utilize
motion inf... | [
{
"created": "Wed, 10 Jul 2024 00:42:25 GMT",
"version": "v1"
}
] | 2024-07-11 | [
[
"Luo",
"Dengyan",
""
],
[
"Xiang",
"Yanping",
""
],
[
"Wang",
"Hu",
""
],
[
"Ji",
"Luping",
""
],
[
"Li",
"Shuai",
""
],
[
"Ye",
"Mao",
""
]
] | The detection of moving infrared dim-small targets has been a challenging and prevalent research topic. The current state-of-the-art methods are mainly based on ConvLSTM to aggregate information from adjacent frames to facilitate the detection of the current frame. However, these methods implicitly utilize motion infor... |
1511.02937 | Vutha Va | Vutha Va, Junil Choi, Robert W. Heath Jr | The Impact of Beamwidth on Temporal Channel Variation in Vehicular
Channels and its Implications | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Millimeter wave (mmWave) has great potential in realizing high data rate
thanks to the large spectral channels. It is considered as a key technology for
the fifth generation wireless networks and is already used in wireless LAN
(e.g., IEEE 802.11ad). Using mmWave for vehicular communications, however, is
often viewed... | [
{
"created": "Mon, 9 Nov 2015 23:57:19 GMT",
"version": "v1"
}
] | 2015-11-11 | [
[
"Va",
"Vutha",
""
],
[
"Choi",
"Junil",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] | Millimeter wave (mmWave) has great potential in realizing high data rate thanks to the large spectral channels. It is considered as a key technology for the fifth generation wireless networks and is already used in wireless LAN (e.g., IEEE 802.11ad). Using mmWave for vehicular communications, however, is often viewed w... |
2010.12110 | Matej Ulicny | Matej Ulicny, Vladimir A. Krylov and Rozenn Dahyot | Tensor Reordering for CNN Compression | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show how parameter redundancy in Convolutional Neural Network (CNN)
filters can be effectively reduced by pruning in spectral domain. Specifically,
the representation extracted via Discrete Cosine Transform (DCT) is more
conducive for pruning than the original space. By relying on a combination of
weight tensor re... | [
{
"created": "Thu, 22 Oct 2020 23:45:34 GMT",
"version": "v1"
}
] | 2020-10-26 | [
[
"Ulicny",
"Matej",
""
],
[
"Krylov",
"Vladimir A.",
""
],
[
"Dahyot",
"Rozenn",
""
]
] | We show how parameter redundancy in Convolutional Neural Network (CNN) filters can be effectively reduced by pruning in spectral domain. Specifically, the representation extracted via Discrete Cosine Transform (DCT) is more conducive for pruning than the original space. By relying on a combination of weight tensor resh... |
2012.03762 | Xu Yan | Xu Yan, Jiantao Gao, Jie Li, Ruimao Zhang, Zhen Li, Rui Huang,
Shuguang Cui | Sparse Single Sweep LiDAR Point Cloud Segmentation via Learning
Contextual Shape Priors from Scene Completion | To appear in AAAI 2021. Codes are available at
https://github.com/yanx27/JS3C-Net | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | LiDAR point cloud analysis is a core task for 3D computer vision, especially
for autonomous driving. However, due to the severe sparsity and noise
interference in the single sweep LiDAR point cloud, the accurate semantic
segmentation is non-trivial to achieve. In this paper, we propose a novel
sparse LiDAR point clou... | [
{
"created": "Mon, 7 Dec 2020 14:58:25 GMT",
"version": "v1"
}
] | 2020-12-08 | [
[
"Yan",
"Xu",
""
],
[
"Gao",
"Jiantao",
""
],
[
"Li",
"Jie",
""
],
[
"Zhang",
"Ruimao",
""
],
[
"Li",
"Zhen",
""
],
[
"Huang",
"Rui",
""
],
[
"Cui",
"Shuguang",
""
]
] | LiDAR point cloud analysis is a core task for 3D computer vision, especially for autonomous driving. However, due to the severe sparsity and noise interference in the single sweep LiDAR point cloud, the accurate semantic segmentation is non-trivial to achieve. In this paper, we propose a novel sparse LiDAR point cloud ... |
2306.16623 | Lucas Prado Osco | Lucas Prado Osco, Qiusheng Wu, Eduardo Lopes de Lemos, Wesley Nunes
Gon\c{c}alves, Ana Paula Marques Ramos, Jonathan Li, Jos\'e Marcato Junior | The Segment Anything Model (SAM) for Remote Sensing Applications: From
Zero to One Shot | 20 pages, 9 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Segmentation is an essential step for remote sensing image processing. This
study aims to advance the application of the Segment Anything Model (SAM), an
innovative image segmentation model by Meta AI, in the field of remote sensing
image analysis. SAM is known for its exceptional generalization capabilities
and zero... | [
{
"created": "Thu, 29 Jun 2023 01:49:33 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Oct 2023 21:22:51 GMT",
"version": "v2"
}
] | 2023-11-02 | [
[
"Osco",
"Lucas Prado",
""
],
[
"Wu",
"Qiusheng",
""
],
[
"de Lemos",
"Eduardo Lopes",
""
],
[
"Gonçalves",
"Wesley Nunes",
""
],
[
"Ramos",
"Ana Paula Marques",
""
],
[
"Li",
"Jonathan",
""
],
[
"Junior",
"José... | Segmentation is an essential step for remote sensing image processing. This study aims to advance the application of the Segment Anything Model (SAM), an innovative image segmentation model by Meta AI, in the field of remote sensing image analysis. SAM is known for its exceptional generalization capabilities and zero-s... |
2103.11926 | Shucheng Chi | David Y. C. Chan, Shucheng Chi, Vassos Hadzilacos, Sam Toueg | Differentiated nonblocking: a new progress condition and a matching
queue algorithm | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we first propose a new liveness requirement for shared objects
and data structures, we then give a shared queue algorithm that satisfies this
requirement and we prove its correctness. We also implement this algorithm and
compare it to a well-known shared queue algorithm that is used in practice. In
add... | [
{
"created": "Mon, 22 Mar 2021 15:10:39 GMT",
"version": "v1"
}
] | 2021-03-23 | [
[
"Chan",
"David Y. C.",
""
],
[
"Chi",
"Shucheng",
""
],
[
"Hadzilacos",
"Vassos",
""
],
[
"Toueg",
"Sam",
""
]
] | In this paper, we first propose a new liveness requirement for shared objects and data structures, we then give a shared queue algorithm that satisfies this requirement and we prove its correctness. We also implement this algorithm and compare it to a well-known shared queue algorithm that is used in practice. In addit... |
2108.08864 | R W R Darling Ph. D. | Jacob D. Baron, R.W.R. Darling, J. Laylon Davis, R. Pettit | Partitioned K-nearest neighbor local depth for scalable comparison-based
learning | 27 pages, 2 figures | null | null | null | cs.DS math.CO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A triplet comparison oracle on a set $S$ takes an object $x \in S$ and for
any pair $\{y, z\} \subset S \setminus \{x\}$ declares which of $y$ and $z$ is
more similar to $x$. Partitioned Local Depth (PaLD) supplies a principled
non-parametric partitioning of $S$ under such triplet comparisons but needs
$O(n^2 \log{n}... | [
{
"created": "Thu, 19 Aug 2021 18:10:10 GMT",
"version": "v1"
},
{
"created": "Sun, 7 Nov 2021 16:58:34 GMT",
"version": "v2"
},
{
"created": "Thu, 2 Dec 2021 19:37:09 GMT",
"version": "v3"
}
] | 2021-12-06 | [
[
"Baron",
"Jacob D.",
""
],
[
"Darling",
"R. W. R.",
""
],
[
"Davis",
"J. Laylon",
""
],
[
"Pettit",
"R.",
""
]
] | A triplet comparison oracle on a set $S$ takes an object $x \in S$ and for any pair $\{y, z\} \subset S \setminus \{x\}$ declares which of $y$ and $z$ is more similar to $x$. Partitioned Local Depth (PaLD) supplies a principled non-parametric partitioning of $S$ under such triplet comparisons but needs $O(n^2 \log{n})$... |
2004.13865 | Monica Babes-Vroman PhD | Monica Babes-Vroman, Andrew Tjang, Thu D. Nguyen | Ethnic Diversity in Computer Science at a Large Public R1 Research
University | We did not have IRB approval for this study | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Even with recent increases in enrollments, computer science departments in
the United States are not producing the number of graduates that the computing
workforce needs, an issue that impacts the scientific and economic growth of
our country. Because the computer science field is predicted to grow, it is
important t... | [
{
"created": "Tue, 28 Apr 2020 21:50:30 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Aug 2021 15:58:19 GMT",
"version": "v2"
}
] | 2021-08-31 | [
[
"Babes-Vroman",
"Monica",
""
],
[
"Tjang",
"Andrew",
""
],
[
"Nguyen",
"Thu D.",
""
]
] | Even with recent increases in enrollments, computer science departments in the United States are not producing the number of graduates that the computing workforce needs, an issue that impacts the scientific and economic growth of our country. Because the computer science field is predicted to grow, it is important to ... |
2208.06327 | Cosmin Badea | William J Bolton, Cosmin Badea, Pantelis Georgiou, Alison Holmes,
Timothy M Rawson | Developing moral AI to support antimicrobial decision making | null | null | 10.1038/s42256-022-00558-5 | null | cs.CY cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Artificial intelligence (AI) assisting with antimicrobial prescribing raises
significant moral questions. Utilising ethical frameworks alongside AI-driven
systems, while considering infection specific complexities, can support moral
decision making to tackle antimicrobial resistance.
| [
{
"created": "Fri, 12 Aug 2022 15:33:42 GMT",
"version": "v1"
}
] | 2022-12-06 | [
[
"Bolton",
"William J",
""
],
[
"Badea",
"Cosmin",
""
],
[
"Georgiou",
"Pantelis",
""
],
[
"Holmes",
"Alison",
""
],
[
"Rawson",
"Timothy M",
""
]
] | Artificial intelligence (AI) assisting with antimicrobial prescribing raises significant moral questions. Utilising ethical frameworks alongside AI-driven systems, while considering infection specific complexities, can support moral decision making to tackle antimicrobial resistance. |
2306.04114 | Minshan Xie | Minshan Xie, Chengze Li, and Tien-Tsin Wong | Manga Rescreening with Interpretable Screentone Representation | 10 pages, 11 figures | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The process of adapting or repurposing manga pages is a time-consuming task
that requires manga artists to manually work on every single screentone region
and apply new patterns to create novel screentones across multiple panels. To
address this issue, we propose an automatic manga rescreening pipeline that
aims to m... | [
{
"created": "Wed, 7 Jun 2023 02:55:09 GMT",
"version": "v1"
}
] | 2023-06-08 | [
[
"Xie",
"Minshan",
""
],
[
"Li",
"Chengze",
""
],
[
"Wong",
"Tien-Tsin",
""
]
] | The process of adapting or repurposing manga pages is a time-consuming task that requires manga artists to manually work on every single screentone region and apply new patterns to create novel screentones across multiple panels. To address this issue, we propose an automatic manga rescreening pipeline that aims to min... |
2209.07024 | Fernando Granha Jeronimo | Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy and Avi Wigderson | Almost Ramanujan Expanders from Arbitrary Expanders via Operator
Amplification | 48 pages | null | null | null | cs.DS cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give an efficient algorithm that transforms any bounded degree expander
graph into another that achieves almost optimal (namely, near-quadratic, $d
\leq 1/\lambda^{2+o(1)}$) trade-off between (any desired) spectral expansion
$\lambda$ and degree $d$. Furthermore, the algorithm is local: every vertex can
compute it... | [
{
"created": "Thu, 15 Sep 2022 03:28:09 GMT",
"version": "v1"
}
] | 2022-09-16 | [
[
"Jeronimo",
"Fernando Granha",
""
],
[
"Mittal",
"Tushant",
""
],
[
"Roy",
"Sourya",
""
],
[
"Wigderson",
"Avi",
""
]
] | We give an efficient algorithm that transforms any bounded degree expander graph into another that achieves almost optimal (namely, near-quadratic, $d \leq 1/\lambda^{2+o(1)}$) trade-off between (any desired) spectral expansion $\lambda$ and degree $d$. Furthermore, the algorithm is local: every vertex can compute its ... |
1408.6109 | Angelos Antonopoulos | Angelos Antonopoulos, Aris S. Lalos, Marco Di Renzo, Christos
Verikoukis | Cross-layer Theoretical Analysis of NC-aided Cooperative ARQ Protocols
in Correlated Shadowed Environments (Extended Version) | 39 pages (including Appendices), 11 Figures | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a cross-layer analytical model for the study of
Network Coding (NC)-based Automatic Repeat reQuest (ARQ) Medium Access Control
(MAC) protocols in correlated slow faded (shadowed) environments, where two end
nodes are assisted by a cluster of relays to exchange data packets. The goal of
our w... | [
{
"created": "Tue, 26 Aug 2014 13:29:10 GMT",
"version": "v1"
}
] | 2014-08-27 | [
[
"Antonopoulos",
"Angelos",
""
],
[
"Lalos",
"Aris S.",
""
],
[
"Di Renzo",
"Marco",
""
],
[
"Verikoukis",
"Christos",
""
]
] | In this paper, we propose a cross-layer analytical model for the study of Network Coding (NC)-based Automatic Repeat reQuest (ARQ) Medium Access Control (MAC) protocols in correlated slow faded (shadowed) environments, where two end nodes are assisted by a cluster of relays to exchange data packets. The goal of our wor... |
1207.6830 | Nader Ale Ebrahim | Ale Ebrahim, Nader Ahmed, Shamsuddin Abdul Rashid, Salwa Hanim, Zahari
Taha | Technology Use in the Virtual R&D Teams | null | American Journal of Engineering and Applied Sciences, 2012, 5(1),
Pages 9-14 | 10.3844/ajeassp.2012.9.14 | null | cs.CY | http://creativecommons.org/licenses/by/3.0/ | Problem statement: Although, literature proves the importance of the
technology role in the effectiveness of virtual Research and Development (R&D)
teams for new product development. However, the factors that make technology
construct in a virtual R&D team are still ambiguous. The manager of virtual R&D
teams for new... | [
{
"created": "Mon, 30 Jul 2012 03:25:45 GMT",
"version": "v1"
}
] | 2012-07-31 | [
[
"Ebrahim",
"Ale",
""
],
[
"Ahmed",
"Nader",
""
],
[
"Rashid",
"Shamsuddin Abdul",
""
],
[
"Hanim",
"Salwa",
""
],
[
"Taha",
"Zahari",
""
]
] | Problem statement: Although, literature proves the importance of the technology role in the effectiveness of virtual Research and Development (R&D) teams for new product development. However, the factors that make technology construct in a virtual R&D team are still ambiguous. The manager of virtual R&D teams for new p... |
2407.14342 | Aidan Hughes | Aidan J. Hughes, Giulia Delo, Jack Poole, Nikolaos Dervilis, Keith
Worden | Quantifying the value of positive transfer: An experimental case study | In Proceedings of the 11th European Workshop on Structural Health
Monitoring (EWSHM 2024), Potsdam, Germany. July 2024. arXiv admin note: text
overlap with arXiv:2311.03083 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | In traditional approaches to structural health monitoring, challenges often
arise associated with the availability of labelled data. Population-based
structural health monitoring seeks to overcomes these challenges by leveraging
data/information from similar structures via technologies such as transfer
learning. The ... | [
{
"created": "Fri, 19 Jul 2024 14:23:20 GMT",
"version": "v1"
}
] | 2024-07-22 | [
[
"Hughes",
"Aidan J.",
""
],
[
"Delo",
"Giulia",
""
],
[
"Poole",
"Jack",
""
],
[
"Dervilis",
"Nikolaos",
""
],
[
"Worden",
"Keith",
""
]
] | In traditional approaches to structural health monitoring, challenges often arise associated with the availability of labelled data. Population-based structural health monitoring seeks to overcomes these challenges by leveraging data/information from similar structures via technologies such as transfer learning. The cu... |
2110.05896 | Yingwen Fu | Nankai Lin and Yingwen Fu and Chuwei Chen and Ziyu Yang and Shengyi
Jiang | LaoPLM: Pre-trained Language Models for Lao | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Trained on the large corpus, pre-trained language models (PLMs) can capture
different levels of concepts in context and hence generate universal language
representations. They can benefit multiple downstream natural language
processing (NLP) tasks. Although PTMs have been widely used in most NLP
applications, especia... | [
{
"created": "Tue, 12 Oct 2021 11:13:07 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Oct 2021 10:37:29 GMT",
"version": "v2"
},
{
"created": "Thu, 14 Oct 2021 09:01:34 GMT",
"version": "v3"
}
] | 2021-10-15 | [
[
"Lin",
"Nankai",
""
],
[
"Fu",
"Yingwen",
""
],
[
"Chen",
"Chuwei",
""
],
[
"Yang",
"Ziyu",
""
],
[
"Jiang",
"Shengyi",
""
]
] | Trained on the large corpus, pre-trained language models (PLMs) can capture different levels of concepts in context and hence generate universal language representations. They can benefit multiple downstream natural language processing (NLP) tasks. Although PTMs have been widely used in most NLP applications, especiall... |
2401.14633 | Zijian Liang | Zijian Liang, Kai Niu, Jin Xu, Ping Zhang | Semantic Arithmetic Coding using Synonymous Mappings | 6 pages, 4 figures. This paper is submitted to the 2024 IEEE
International Symposium on Information Theory (ISIT 2024) | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent semantic communication methods explore effective ways to expand the
communication paradigm and improve the system performance of the communication
systems. Nonetheless, the common problem of these methods is that the essence
of semantics is not explicitly pointed out and directly utilized. A new
epistemology s... | [
{
"created": "Fri, 26 Jan 2024 03:54:30 GMT",
"version": "v1"
}
] | 2024-01-29 | [
[
"Liang",
"Zijian",
""
],
[
"Niu",
"Kai",
""
],
[
"Xu",
"Jin",
""
],
[
"Zhang",
"Ping",
""
]
] | Recent semantic communication methods explore effective ways to expand the communication paradigm and improve the system performance of the communication systems. Nonetheless, the common problem of these methods is that the essence of semantics is not explicitly pointed out and directly utilized. A new epistemology sug... |
2104.04449 | Hanaa Abumarshoud | Hanaa Abumarshoud, Lina Mohjazi, Sami Muhaidat | Amplitude, Phase, and Quadrant (APQ) Modulation for Indoor Visible Light
Communications | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main challenge in visible light communications (VLC) is the low
modulation bandwidth of light-emitting diodes (LEDs). This forms a barrier
towards achieving high data rates. Moreover, the implementation of high order
modulation schemes is restricted by the requirements of intensity modulation
(IM) and direct dete... | [
{
"created": "Fri, 9 Apr 2021 15:58:29 GMT",
"version": "v1"
}
] | 2021-04-12 | [
[
"Abumarshoud",
"Hanaa",
""
],
[
"Mohjazi",
"Lina",
""
],
[
"Muhaidat",
"Sami",
""
]
] | The main challenge in visible light communications (VLC) is the low modulation bandwidth of light-emitting diodes (LEDs). This forms a barrier towards achieving high data rates. Moreover, the implementation of high order modulation schemes is restricted by the requirements of intensity modulation (IM) and direct detect... |
1910.13942 | Felix Leeb | Felix Leeb, Arunkumar Byravan, Dieter Fox | Motion-Nets: 6D Tracking of Unknown Objects in Unseen Environments using
RGB | Accepted to IROS 2019 workshop on The Importance of Uncertainty in
Deep Learning for Robotics | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we bridge the gap between recent pose estimation and tracking
work to develop a powerful method for robots to track objects in their
surroundings. Motion-Nets use a segmentation model to segment the scene, and
separate translation and rotation models to identify the relative 6D motion of
an object betwe... | [
{
"created": "Wed, 30 Oct 2019 15:51:23 GMT",
"version": "v1"
}
] | 2019-10-31 | [
[
"Leeb",
"Felix",
""
],
[
"Byravan",
"Arunkumar",
""
],
[
"Fox",
"Dieter",
""
]
] | In this work, we bridge the gap between recent pose estimation and tracking work to develop a powerful method for robots to track objects in their surroundings. Motion-Nets use a segmentation model to segment the scene, and separate translation and rotation models to identify the relative 6D motion of an object between... |
2009.12975 | Liang Gou | Liang Gou, Lincan Zou, Nanxiang Li, Michael Hofmann, Arvind Kumar
Shekar, Axel Wendt and Liu Ren | VATLD: A Visual Analytics System to Assess, Understand and Improve
Traffic Light Detection | null | null | null | null | cs.HC cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traffic light detection is crucial for environment perception and
decision-making in autonomous driving. State-of-the-art detectors are built
upon deep Convolutional Neural Networks (CNNs) and have exhibited promising
performance. However, one looming concern with CNN based detectors is how to
thoroughly evaluate the... | [
{
"created": "Sun, 27 Sep 2020 22:39:00 GMT",
"version": "v1"
}
] | 2020-09-29 | [
[
"Gou",
"Liang",
""
],
[
"Zou",
"Lincan",
""
],
[
"Li",
"Nanxiang",
""
],
[
"Hofmann",
"Michael",
""
],
[
"Shekar",
"Arvind Kumar",
""
],
[
"Wendt",
"Axel",
""
],
[
"Ren",
"Liu",
""
]
] | Traffic light detection is crucial for environment perception and decision-making in autonomous driving. State-of-the-art detectors are built upon deep Convolutional Neural Networks (CNNs) and have exhibited promising performance. However, one looming concern with CNN based detectors is how to thoroughly evaluate the p... |
1512.07505 | Alexandre Rok | Alexandre Rok, Shakhar Smorodinsky | A short proof of the first selection lemma and weak $\frac{1}{r}$-nets
for moving points | null | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | (i) We provide a short and simple proof of the first selection lemma. (ii) We
also prove a selection lemma of a new type in $\Re^d$. For example, when $d=2$
assuming $n$ is large enough we prove that for any set $P$ of $n$ points in
general position there are $\Omega(n^4)$ pairs of segments spanned by $P$ all
of whic... | [
{
"created": "Wed, 23 Dec 2015 15:04:57 GMT",
"version": "v1"
}
] | 2015-12-24 | [
[
"Rok",
"Alexandre",
""
],
[
"Smorodinsky",
"Shakhar",
""
]
] | (i) We provide a short and simple proof of the first selection lemma. (ii) We also prove a selection lemma of a new type in $\Re^d$. For example, when $d=2$ assuming $n$ is large enough we prove that for any set $P$ of $n$ points in general position there are $\Omega(n^4)$ pairs of segments spanned by $P$ all of which ... |
2101.04948 | Foozhan Ataiefard | Foozhan Ataiefard, Mohammad Jafar Mashhadi, Hadi Hemmati and Niel
Walkinshaw | Deep State Inference: Toward Behavioral Model Inference of Black-box
Software Systems | 17 pages,9 figures. arXiv admin note: text overlap with
arXiv:2008.11856 | null | null | null | cs.LG cs.SE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Many software engineering tasks, such as testing, and anomaly detection can
benefit from the ability to infer a behavioral model of the software.Most
existing inference approaches assume access to code to collect execution
sequences. In this paper, we investigate a black-box scenario, where the system
under analysis ... | [
{
"created": "Wed, 13 Jan 2021 09:23:37 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Oct 2021 08:14:09 GMT",
"version": "v2"
}
] | 2021-10-13 | [
[
"Ataiefard",
"Foozhan",
""
],
[
"Mashhadi",
"Mohammad Jafar",
""
],
[
"Hemmati",
"Hadi",
""
],
[
"Walkinshaw",
"Niel",
""
]
] | Many software engineering tasks, such as testing, and anomaly detection can benefit from the ability to infer a behavioral model of the software.Most existing inference approaches assume access to code to collect execution sequences. In this paper, we investigate a black-box scenario, where the system under analysis ca... |
2012.01876 | Robert Paluch | Robert Paluch, {\L}ukasz G. Gajewski, Janusz A. Ho{\l}yst, Boleslaw K.
Szymanski | Optimizing sensors placement in complex networks for localization of
hidden signal source: A review | 28 pages, 18 figures, 11 tables | Future Generation Computer Systems, Volume 112, November 2020,
Pages 1070-1092 | 10.1016/j.future.2020.06.023 | null | cs.SI cs.CY physics.data-an | http://creativecommons.org/licenses/by-nc-nd/4.0/ | As the world becomes more and more interconnected, our everyday objects
become part of the Internet of Things, and our lives get more and more mirrored
in virtual reality, where every piece of~information, including misinformation,
fake news and malware, can spread very fast practically anonymously. To
suppress such ... | [
{
"created": "Thu, 3 Dec 2020 12:45:29 GMT",
"version": "v1"
}
] | 2020-12-04 | [
[
"Paluch",
"Robert",
""
],
[
"Gajewski",
"Łukasz G.",
""
],
[
"Hołyst",
"Janusz A.",
""
],
[
"Szymanski",
"Boleslaw K.",
""
]
] | As the world becomes more and more interconnected, our everyday objects become part of the Internet of Things, and our lives get more and more mirrored in virtual reality, where every piece of~information, including misinformation, fake news and malware, can spread very fast practically anonymously. To suppress such un... |
2204.00975 | Ruonan Wang | Yuxi Qian, Yuncong Hu, Ruonan Wang, Fangxiang Feng and Xiaojie Wang | Question-Driven Graph Fusion Network For Visual Question Answering | Accepted by ICME 2022 | null | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing Visual Question Answering (VQA) models have explored various visual
relationships between objects in the image to answer complex questions, which
inevitably introduces irrelevant information brought by inaccurate object
detection and text grounding. To address the problem, we propose a
Question-Driven Graph ... | [
{
"created": "Sun, 3 Apr 2022 03:02:03 GMT",
"version": "v1"
}
] | 2022-04-05 | [
[
"Qian",
"Yuxi",
""
],
[
"Hu",
"Yuncong",
""
],
[
"Wang",
"Ruonan",
""
],
[
"Feng",
"Fangxiang",
""
],
[
"Wang",
"Xiaojie",
""
]
] | Existing Visual Question Answering (VQA) models have explored various visual relationships between objects in the image to answer complex questions, which inevitably introduces irrelevant information brought by inaccurate object detection and text grounding. To address the problem, we propose a Question-Driven Graph Fu... |
1809.05853 | Dra\v{z}en Lu\v{c}anin PhD | Dra\v{z}en Lu\v{c}anin | Energy Efficient Cloud Control and Pricing in Geographically Distributed
Data Centers | Dissertation, Vienna Univ Technology (Apr 2016) | null | null | urn:nbn:at:at-ubtuw:1-106532 | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is estimated that data centers constitute 1.5% of global electricity
usage. At the same time, to serve increasing user requirements, modern cloud
providers are operating multiple geographically distributed data centers.
Distributed data center infrastructure changes the rules of cloud control, as
energy costs depe... | [
{
"created": "Sun, 16 Sep 2018 10:52:43 GMT",
"version": "v1"
}
] | 2018-09-18 | [
[
"Lučanin",
"Dražen",
""
]
] | It is estimated that data centers constitute 1.5% of global electricity usage. At the same time, to serve increasing user requirements, modern cloud providers are operating multiple geographically distributed data centers. Distributed data center infrastructure changes the rules of cloud control, as energy costs depend... |
2406.19390 | John Lambert | John Lambert, Yuguang Li, Ivaylo Boyadzhiev, Lambert Wixson, Manjunath
Narayana, Will Hutchcroft, James Hays, Frank Dellaert, Sing Bing Kang | SALVe: Semantic Alignment Verification for Floorplan Reconstruction from
Sparse Panoramas | Accepted at ECCV 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new system for automatic 2D floorplan reconstruction that is
enabled by SALVe, our novel pairwise learned alignment verifier. The inputs to
our system are sparsely located 360$^\circ$ panoramas, whose semantic features
(windows, doors, and openings) are inferred and used to hypothesize pairwise
room adja... | [
{
"created": "Thu, 27 Jun 2024 17:59:06 GMT",
"version": "v1"
}
] | 2024-06-28 | [
[
"Lambert",
"John",
""
],
[
"Li",
"Yuguang",
""
],
[
"Boyadzhiev",
"Ivaylo",
""
],
[
"Wixson",
"Lambert",
""
],
[
"Narayana",
"Manjunath",
""
],
[
"Hutchcroft",
"Will",
""
],
[
"Hays",
"James",
""
],
[
... | We propose a new system for automatic 2D floorplan reconstruction that is enabled by SALVe, our novel pairwise learned alignment verifier. The inputs to our system are sparsely located 360$^\circ$ panoramas, whose semantic features (windows, doors, and openings) are inferred and used to hypothesize pairwise room adjace... |
2205.02771 | Peter Macgregor | Peter Macgregor, He Sun | Finding Bipartite Components in Hypergraphs | null | null | null | null | cs.DS cs.LG | http://creativecommons.org/licenses/by/4.0/ | Hypergraphs are important objects to model ternary or higher-order relations
of objects, and have a number of applications in analysing many complex
datasets occurring in practice. In this work we study a new heat diffusion
process in hypergraphs, and employ this process to design a polynomial-time
algorithm that app... | [
{
"created": "Thu, 5 May 2022 16:46:31 GMT",
"version": "v1"
}
] | 2022-05-06 | [
[
"Macgregor",
"Peter",
""
],
[
"Sun",
"He",
""
]
] | Hypergraphs are important objects to model ternary or higher-order relations of objects, and have a number of applications in analysing many complex datasets occurring in practice. In this work we study a new heat diffusion process in hypergraphs, and employ this process to design a polynomial-time algorithm that appro... |
2107.14126 | George Skretas | George B. Mertzios and Othon Michail and George Skretas and Paul G.
Spirakis and Michail Theofilatos | The Complexity of Growing a Graph | 30 pages | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a new algorithmic process of graph growth which starts from a single
initial vertex and operates in discrete time-steps, called \emph{slots}. In
every slot, the graph grows via two operations (i) vertex generation and (ii)
edge activation. The process completes at the last slot where a (possibly
empty) subse... | [
{
"created": "Thu, 29 Jul 2021 15:59:53 GMT",
"version": "v1"
},
{
"created": "Fri, 11 Feb 2022 20:22:09 GMT",
"version": "v2"
},
{
"created": "Mon, 2 May 2022 03:17:27 GMT",
"version": "v3"
},
{
"created": "Thu, 2 Jun 2022 12:01:16 GMT",
"version": "v4"
},
{
"cre... | 2022-12-20 | [
[
"Mertzios",
"George B.",
""
],
[
"Michail",
"Othon",
""
],
[
"Skretas",
"George",
""
],
[
"Spirakis",
"Paul G.",
""
],
[
"Theofilatos",
"Michail",
""
]
] | We study a new algorithmic process of graph growth which starts from a single initial vertex and operates in discrete time-steps, called \emph{slots}. In every slot, the graph grows via two operations (i) vertex generation and (ii) edge activation. The process completes at the last slot where a (possibly empty) subset ... |
1002.2722 | Marco Aldinucci | Marco Aldinucci, Emilio Tuosto | Toward a Formal Semantics for Autonomic Components | 11 pages + cover page | In From Grids To Service and Pervasive Computing (Proc. of the
CoreGRID Symposium 2008), CoreGRID, pages 31-45, Las Palmas, Spain, Aug.
2008. Springer | 10.1007/978-0-387-09455-7_3 | TR-08-08 | cs.DC cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomic management can improve the QoS provided by parallel/ distributed
applications. Within the CoreGRID Component Model, the autonomic management is
tailored to the automatic - monitoring-driven - alteration of the component
assembly and, therefore, is defined as the effect of (distributed) management
code. This... | [
{
"created": "Sat, 13 Feb 2010 18:55:54 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Jul 2010 17:46:06 GMT",
"version": "v2"
}
] | 2010-07-05 | [
[
"Aldinucci",
"Marco",
""
],
[
"Tuosto",
"Emilio",
""
]
] | Autonomic management can improve the QoS provided by parallel/ distributed applications. Within the CoreGRID Component Model, the autonomic management is tailored to the automatic - monitoring-driven - alteration of the component assembly and, therefore, is defined as the effect of (distributed) management code. This w... |
2007.05852 | Arman Adibi | Arman Adibi, Aryan Mokhtari, Hamed Hassani | Submodular Meta-Learning | null | null | null | null | cs.LG cs.DS math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we introduce a discrete variant of the meta-learning
framework. Meta-learning aims at exploiting prior experience and data to
improve performance on future tasks. By now, there exist numerous formulations
for meta-learning in the continuous domain. Notably, the Model-Agnostic
Meta-Learning (MAML) formu... | [
{
"created": "Sat, 11 Jul 2020 21:02:48 GMT",
"version": "v1"
},
{
"created": "Sun, 10 Jan 2021 00:39:23 GMT",
"version": "v2"
}
] | 2021-01-12 | [
[
"Adibi",
"Arman",
""
],
[
"Mokhtari",
"Aryan",
""
],
[
"Hassani",
"Hamed",
""
]
] | In this paper, we introduce a discrete variant of the meta-learning framework. Meta-learning aims at exploiting prior experience and data to improve performance on future tasks. By now, there exist numerous formulations for meta-learning in the continuous domain. Notably, the Model-Agnostic Meta-Learning (MAML) formula... |
2404.13193 | Przemys{\l}aw Gordinowicz | Dariusz Dereniowski, Przemys{\l}aw Gordinowicz and Karolina Wr\'obel | On multidimensional generalization of binary search | null | null | null | null | cs.DS cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work generalizes the binary search problem to a $d$-dimensional domain
$S_1\times\cdots\times S_d$, where $S_i=\{0, 1, \ldots,n_i-1\}$ and $d\geq 1$,
in the following way. Given $(t_1,\ldots,t_d)$, the target element to be found,
the result of a comparison of a selected element $(x_1,\ldots,x_d)$ is the
sequence... | [
{
"created": "Fri, 19 Apr 2024 21:48:16 GMT",
"version": "v1"
}
] | 2024-04-23 | [
[
"Dereniowski",
"Dariusz",
""
],
[
"Gordinowicz",
"Przemysław",
""
],
[
"Wróbel",
"Karolina",
""
]
] | This work generalizes the binary search problem to a $d$-dimensional domain $S_1\times\cdots\times S_d$, where $S_i=\{0, 1, \ldots,n_i-1\}$ and $d\geq 1$, in the following way. Given $(t_1,\ldots,t_d)$, the target element to be found, the result of a comparison of a selected element $(x_1,\ldots,x_d)$ is the sequence o... |
2406.19508 | Darren Holden | Darren Holden, Nafiseh Kahani | Code Linting using Language Models | 44 pages, 3 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Code linters play a crucial role in developing high-quality software systems
by detecting potential problems (e.g., memory leaks) in the source code of
systems. Despite their benefits, code linters are often language-specific,
focused on certain types of issues, and prone to false positives in the
interest of speed. ... | [
{
"created": "Thu, 27 Jun 2024 19:59:49 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Jul 2024 19:01:10 GMT",
"version": "v2"
}
] | 2024-07-24 | [
[
"Holden",
"Darren",
""
],
[
"Kahani",
"Nafiseh",
""
]
] | Code linters play a crucial role in developing high-quality software systems by detecting potential problems (e.g., memory leaks) in the source code of systems. Despite their benefits, code linters are often language-specific, focused on certain types of issues, and prone to false positives in the interest of speed. Th... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.