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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2112.01433 | Wei Zhang | Wei Zhang, Mingrui Liu, Yu Feng, Xiaodong Cui, Brian Kingsbury, Yuhai
Tu | Loss Landscape Dependent Self-Adjusting Learning Rates in Decentralized
Stochastic Gradient Descent | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Distributed Deep Learning (DDL) is essential for large-scale Deep Learning
(DL) training. Synchronous Stochastic Gradient Descent (SSGD) 1 is the de facto
DDL optimization method. Using a sufficiently large batch size is critical to
achieving DDL runtime speedup. In a large batch setting, the learning rate must
be in... | [
{
"created": "Thu, 2 Dec 2021 17:23:25 GMT",
"version": "v1"
}
] | 2021-12-03 | [
[
"Zhang",
"Wei",
""
],
[
"Liu",
"Mingrui",
""
],
[
"Feng",
"Yu",
""
],
[
"Cui",
"Xiaodong",
""
],
[
"Kingsbury",
"Brian",
""
],
[
"Tu",
"Yuhai",
""
]
] | Distributed Deep Learning (DDL) is essential for large-scale Deep Learning (DL) training. Synchronous Stochastic Gradient Descent (SSGD) 1 is the de facto DDL optimization method. Using a sufficiently large batch size is critical to achieving DDL runtime speedup. In a large batch setting, the learning rate must be incr... |
1710.11169 | Xiang Ren | Zeqiu Wu, Xiang Ren, Frank F. Xu, Ji Li, Jiawei Han | Indirect Supervision for Relation Extraction using Question-Answer Pairs | 9 pages + 1 page reference. Accepted to WSDM 2018 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic relation extraction (RE) for types of interest is of great
importance for interpreting massive text corpora in an efficient manner.
Traditional RE models have heavily relied on human-annotated corpus for
training, which can be costly in generating labeled data and become obstacles
when dealing with more rel... | [
{
"created": "Mon, 30 Oct 2017 18:27:19 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Nov 2017 07:43:31 GMT",
"version": "v2"
}
] | 2017-11-27 | [
[
"Wu",
"Zeqiu",
""
],
[
"Ren",
"Xiang",
""
],
[
"Xu",
"Frank F.",
""
],
[
"Li",
"Ji",
""
],
[
"Han",
"Jiawei",
""
]
] | Automatic relation extraction (RE) for types of interest is of great importance for interpreting massive text corpora in an efficient manner. Traditional RE models have heavily relied on human-annotated corpus for training, which can be costly in generating labeled data and become obstacles when dealing with more relat... |
2108.13002 | Yucheng Zhao | Yucheng Zhao, Guangting Wang, Chuanxin Tang, Chong Luo, Wenjun Zeng,
Zheng-Jun Zha | A Battle of Network Structures: An Empirical Study of CNN, Transformer,
and MLP | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Convolutional neural networks (CNN) are the dominant deep neural network
(DNN) architecture for computer vision. Recently, Transformer and multi-layer
perceptron (MLP)-based models, such as Vision Transformer and MLP-Mixer,
started to lead new trends as they showed promising results in the ImageNet
classification tas... | [
{
"created": "Mon, 30 Aug 2021 06:09:02 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Nov 2021 08:37:31 GMT",
"version": "v2"
}
] | 2021-11-29 | [
[
"Zhao",
"Yucheng",
""
],
[
"Wang",
"Guangting",
""
],
[
"Tang",
"Chuanxin",
""
],
[
"Luo",
"Chong",
""
],
[
"Zeng",
"Wenjun",
""
],
[
"Zha",
"Zheng-Jun",
""
]
] | Convolutional neural networks (CNN) are the dominant deep neural network (DNN) architecture for computer vision. Recently, Transformer and multi-layer perceptron (MLP)-based models, such as Vision Transformer and MLP-Mixer, started to lead new trends as they showed promising results in the ImageNet classification task.... |
2212.02851 | Praveen Venkateswaran | Praveen Venkateswaran, Evelyn Duesterwald, Vatche Isahagian | DiSTRICT: Dialogue State Tracking with Retriever Driven In-Context
Tuning | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Dialogue State Tracking (DST), a key component of task-oriented conversation
systems, represents user intentions by determining the values of pre-defined
slots in an ongoing dialogue. Existing approaches use hand-crafted templates
and additional slot information to fine-tune and prompt large pre-trained
language mode... | [
{
"created": "Tue, 6 Dec 2022 09:40:15 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Oct 2023 14:30:15 GMT",
"version": "v2"
}
] | 2023-10-24 | [
[
"Venkateswaran",
"Praveen",
""
],
[
"Duesterwald",
"Evelyn",
""
],
[
"Isahagian",
"Vatche",
""
]
] | Dialogue State Tracking (DST), a key component of task-oriented conversation systems, represents user intentions by determining the values of pre-defined slots in an ongoing dialogue. Existing approaches use hand-crafted templates and additional slot information to fine-tune and prompt large pre-trained language models... |
0901.2207 | Ryuhei Mori | Ryuhei Mori and Toshiyuki Tanaka | Performance and Construction of Polar Codes on Symmetric Binary-Input
Memoryless Channels | 5 pages, 3 figures, submitted to ISIT2009; revised | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Channel polarization is a method of constructing capacity achieving codes for
symmetric binary-input discrete memoryless channels (B-DMCs) [1]. In the
original paper, the construction complexity is exponential in the blocklength.
In this paper, a new construction method for arbitrary symmetric binary
memoryless chann... | [
{
"created": "Thu, 15 Jan 2009 17:08:36 GMT",
"version": "v1"
},
{
"created": "Sat, 23 May 2009 09:21:04 GMT",
"version": "v2"
}
] | 2009-05-23 | [
[
"Mori",
"Ryuhei",
""
],
[
"Tanaka",
"Toshiyuki",
""
]
] | Channel polarization is a method of constructing capacity achieving codes for symmetric binary-input discrete memoryless channels (B-DMCs) [1]. In the original paper, the construction complexity is exponential in the blocklength. In this paper, a new construction method for arbitrary symmetric binary memoryless channel... |
2006.04097 | Zhiguo Wang | Zhiguo Wang, Liusha Yang, Feng Yin, Ke Lin, Qingjiang Shi, Zhi-Quan
Luo | Optimally Combining Classifiers for Semi-Supervised Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers semi-supervised learning for tabular data. It is widely
known that Xgboost based on tree model works well on the heterogeneous features
while transductive support vector machine can exploit the low density
separation assumption. However, little work has been done to combine them
together for the ... | [
{
"created": "Sun, 7 Jun 2020 09:28:34 GMT",
"version": "v1"
}
] | 2020-06-09 | [
[
"Wang",
"Zhiguo",
""
],
[
"Yang",
"Liusha",
""
],
[
"Yin",
"Feng",
""
],
[
"Lin",
"Ke",
""
],
[
"Shi",
"Qingjiang",
""
],
[
"Luo",
"Zhi-Quan",
""
]
] | This paper considers semi-supervised learning for tabular data. It is widely known that Xgboost based on tree model works well on the heterogeneous features while transductive support vector machine can exploit the low density separation assumption. However, little work has been done to combine them together for the en... |
1802.09317 | Eric Sanchis | Eric Sanchis | A Model of Free Will for Artificial Entities | 10th International Conference on Advanced Cognitive Technologies and
Applications, (COGNITIVE 2018), February 18-22, Barcelona, Spain | null | null | null | cs.MA cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The impression of free will is the feeling according to which our choices are
neither imposed from our inside nor from outside. It is the sense we are the
ultimate cause of our acts. In direct opposition with the universal
determinism, the existence of free will continues to be discussed. In this
paper, free will is ... | [
{
"created": "Mon, 26 Feb 2018 14:29:03 GMT",
"version": "v1"
}
] | 2018-02-27 | [
[
"Sanchis",
"Eric",
""
]
] | The impression of free will is the feeling according to which our choices are neither imposed from our inside nor from outside. It is the sense we are the ultimate cause of our acts. In direct opposition with the universal determinism, the existence of free will continues to be discussed. In this paper, free will is li... |
2005.10884 | Chong Xiang | Chong Xiang, Arjun Nitin Bhagoji, Vikash Sehwag, Prateek Mittal | PatchGuard: A Provably Robust Defense against Adversarial Patches via
Small Receptive Fields and Masking | USENIX Security Symposium 2021; extended technical report | null | null | null | cs.CV cs.CR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Localized adversarial patches aim to induce misclassification in machine
learning models by arbitrarily modifying pixels within a restricted region of
an image. Such attacks can be realized in the physical world by attaching the
adversarial patch to the object to be misclassified, and defending against such
attacks i... | [
{
"created": "Sun, 17 May 2020 03:38:34 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Jun 2020 14:51:03 GMT",
"version": "v2"
},
{
"created": "Sun, 2 Aug 2020 15:39:00 GMT",
"version": "v3"
},
{
"created": "Sun, 18 Oct 2020 18:12:03 GMT",
"version": "v4"
},
{
"cre... | 2021-04-01 | [
[
"Xiang",
"Chong",
""
],
[
"Bhagoji",
"Arjun Nitin",
""
],
[
"Sehwag",
"Vikash",
""
],
[
"Mittal",
"Prateek",
""
]
] | Localized adversarial patches aim to induce misclassification in machine learning models by arbitrarily modifying pixels within a restricted region of an image. Such attacks can be realized in the physical world by attaching the adversarial patch to the object to be misclassified, and defending against such attacks is ... |
1010.1697 | Roberto Amadio | Roberto M. Amadio (PPS), Nicolas Ayache (PPS, INRIA Paris -
Rocquencourt), Yann R\'egis-Gianas (PPS, INRIA Paris - Rocquencourt), Ronan
Saillard (PPS, INRIA Paris - Rocquencourt) | Certifying cost annotations in compilers | null | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We discuss the problem of building a compiler which can lift in a provably
correct way pieces of information on the execution cost of the object code to
cost annotations on the source code. To this end, we need a clear and flexible
picture of: (i) the meaning of cost annotations, (ii) the method to prove them
sound a... | [
{
"created": "Fri, 8 Oct 2010 14:13:09 GMT",
"version": "v1"
}
] | 2010-10-11 | [
[
"Amadio",
"Roberto M.",
"",
"PPS"
],
[
"Ayache",
"Nicolas",
"",
"PPS, INRIA Paris -\n Rocquencourt"
],
[
"Régis-Gianas",
"Yann",
"",
"PPS, INRIA Paris - Rocquencourt"
],
[
"Saillard",
"Ronan",
"",
"PPS, INRIA Paris - Rocquencourt"
]
] | We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the source code. To this end, we need a clear and flexible picture of: (i) the meaning of cost annotations, (ii) the method to prove them sound and... |
2407.18925 | Xiangxiong Kong | Xiangxiong Kong | Monitoring Time-Varying Changes of Historic Structures Through
Photogrammetry-Driven Digital Twinning | null | null | 10.5194/isprs-archives-XLVIII-2-2024-181-2024 | null | cs.CV cs.CY | http://creativecommons.org/licenses/by/4.0/ | Historic structures are important for our society but could be prone to
structural deterioration due to long service durations and natural impacts.
Monitoring the deterioration of historic structures becomes essential for
stakeholders to take appropriate interventions. Existing work in the literature
primarily focuse... | [
{
"created": "Tue, 9 Jul 2024 22:26:29 GMT",
"version": "v1"
}
] | 2024-07-30 | [
[
"Kong",
"Xiangxiong",
""
]
] | Historic structures are important for our society but could be prone to structural deterioration due to long service durations and natural impacts. Monitoring the deterioration of historic structures becomes essential for stakeholders to take appropriate interventions. Existing work in the literature primarily focuses ... |
2404.15488 | Jean-Philippe Corbeil | Jean-Philippe Corbeil | IryoNLP at MEDIQA-CORR 2024: Tackling the Medical Error Detection &
Correction Task On the Shoulders of Medical Agents | null | null | null | null | cs.CL cs.AI cs.MA | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In natural language processing applied to the clinical domain, utilizing
large language models has emerged as a promising avenue for error detection and
correction on clinical notes, a knowledge-intensive task for which annotated
data is scarce. This paper presents MedReAct'N'MedReFlex, which leverages a
suite of fou... | [
{
"created": "Tue, 23 Apr 2024 20:00:37 GMT",
"version": "v1"
}
] | 2024-04-25 | [
[
"Corbeil",
"Jean-Philippe",
""
]
] | In natural language processing applied to the clinical domain, utilizing large language models has emerged as a promising avenue for error detection and correction on clinical notes, a knowledge-intensive task for which annotated data is scarce. This paper presents MedReAct'N'MedReFlex, which leverages a suite of four ... |
2406.16843 | Arne Hole | Arne Hole | Constructibility, computational complexity and P versus NP | null | null | null | null | cs.CC cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A class of decision problems related to inconsistency proofs for formal
theories is used to show that under a constructive interpretation of
computational complexity classes, an assumption referred to as the MW thesis
implies that one may explicitly construct decision problems in NP which are not
algorithmically solv... | [
{
"created": "Mon, 24 Jun 2024 17:48:29 GMT",
"version": "v1"
}
] | 2024-06-25 | [
[
"Hole",
"Arne",
""
]
] | A class of decision problems related to inconsistency proofs for formal theories is used to show that under a constructive interpretation of computational complexity classes, an assumption referred to as the MW thesis implies that one may explicitly construct decision problems in NP which are not algorithmically solvab... |
1609.03947 | Li Yang Ku | Li Yang Ku, Erik Learned-Miller, Rod Grupen | Associating Grasp Configurations with Hierarchical Features in
Convolutional Neural Networks | 8 pages, 9 figures, IROS 2017 | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we provide a solution for posturing the anthropomorphic
Robonaut-2 hand and arm for grasping based on visual information. A mapping
from visual features extracted from a convolutional neural network (CNN) to
grasp points is learned. We demonstrate that a CNN pre-trained for image
classification can be a... | [
{
"created": "Tue, 13 Sep 2016 17:37:38 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Sep 2016 21:00:20 GMT",
"version": "v2"
},
{
"created": "Fri, 21 Oct 2016 18:57:25 GMT",
"version": "v3"
},
{
"created": "Tue, 21 Mar 2017 17:40:17 GMT",
"version": "v4"
},
{
"c... | 2017-07-27 | [
[
"Ku",
"Li Yang",
""
],
[
"Learned-Miller",
"Erik",
""
],
[
"Grupen",
"Rod",
""
]
] | In this work, we provide a solution for posturing the anthropomorphic Robonaut-2 hand and arm for grasping based on visual information. A mapping from visual features extracted from a convolutional neural network (CNN) to grasp points is learned. We demonstrate that a CNN pre-trained for image classification can be app... |
1710.07814 | Stefano Buzzi | Stefano Buzzi and Alessio Zappone | Downlink Power Control in User-Centric and Cell-Free Massive MIMO
Wireless Networks | presented at the 28th Annual IEEE International Symposium on
Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2017), Montreal
(CA), October 2017 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, the so-called cell-free Massive MIMO architecture has been
introduced, wherein a very large number of distributed access points (APs)
simultaneously and jointly serve a much smaller number of mobile stations
(MSs). A variant of the cell-free technique is the user-centric approach,
wherein each AP just decod... | [
{
"created": "Sat, 21 Oct 2017 15:30:49 GMT",
"version": "v1"
}
] | 2017-10-24 | [
[
"Buzzi",
"Stefano",
""
],
[
"Zappone",
"Alessio",
""
]
] | Recently, the so-called cell-free Massive MIMO architecture has been introduced, wherein a very large number of distributed access points (APs) simultaneously and jointly serve a much smaller number of mobile stations (MSs). A variant of the cell-free technique is the user-centric approach, wherein each AP just decodes... |
2001.11367 | Shan Huang | Shan Huang (1), Xiao Zhou (2), Sang Chin (2) ((1) Boston University
Department of Physics, (2) Boston University Department of Computer Science) | Application of Seq2Seq Models on Code Correction | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We apply various seq2seq models on programming language correction tasks on
Juliet Test Suite for C/C++ and Java of Software Assurance Reference
Datasets(SARD), and achieve 75\%(for C/C++) and 56\%(for Java) repair rates on
these tasks. We introduce Pyramid Encoder in these seq2seq models, which
largely increases the... | [
{
"created": "Tue, 28 Jan 2020 21:57:43 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Aug 2020 20:51:43 GMT",
"version": "v2"
}
] | 2020-08-06 | [
[
"Huang",
"Shan",
""
],
[
"Zhou",
"Xiao",
""
],
[
"Chin",
"Sang",
""
]
] | We apply various seq2seq models on programming language correction tasks on Juliet Test Suite for C/C++ and Java of Software Assurance Reference Datasets(SARD), and achieve 75\%(for C/C++) and 56\%(for Java) repair rates on these tasks. We introduce Pyramid Encoder in these seq2seq models, which largely increases the c... |
2406.15679 | Sherri WeitlHarms | Sherri WeitlHarms | Iterative Service-Learning: A Computing-Based Case-study Applied to
Small Rural Organizations | 9 pages, 0 figures | Proceedings of the 2024 IEEE Frontiers in Education Conference | null | null | cs.SI cs.HC cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes the iterative use of service learning to develop,
review, and improve computing-based artifacts. It is well-known that computing
students benefit from service-learning experiences as do the community
partners. It is also well-known that computing artifacts rarely function well
long-term without v... | [
{
"created": "Fri, 21 Jun 2024 23:05:13 GMT",
"version": "v1"
}
] | 2024-08-06 | [
[
"WeitlHarms",
"Sherri",
""
]
] | This paper describes the iterative use of service learning to develop, review, and improve computing-based artifacts. It is well-known that computing students benefit from service-learning experiences as do the community partners. It is also well-known that computing artifacts rarely function well long-term without ver... |
1501.02212 | Holger Petersen | Holger Petersen | Efficient Computation by Three Counter Machines | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that multiplication can be done in polynomial time on a three counter
machine that receives its input as the contents of two counters. The technique
is generalized to functions of two variables computable by deterministic Turing
machines in linear space.
| [
{
"created": "Fri, 9 Jan 2015 18:02:01 GMT",
"version": "v1"
}
] | 2015-01-12 | [
[
"Petersen",
"Holger",
""
]
] | We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing machines in linear space. |
1912.05134 | Baosong Yang | Yu Wan and Baosong Yang and Derek F. Wong and Lidia S. Chao and Haihua
Du and Ben C.H. Ao | Unsupervised Neural Dialect Translation with Commonality and Diversity
Modeling | AAAI 2020 | null | 10.1609/aaai.v34i05.6448 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a special machine translation task, dialect translation has two main
characteristics: 1) lack of parallel training corpus; and 2) possessing similar
grammar between two sides of the translation. In this paper, we investigate how
to exploit the commonality and diversity between dialects thus to build
unsupervised t... | [
{
"created": "Wed, 11 Dec 2019 06:21:16 GMT",
"version": "v1"
}
] | 2022-10-20 | [
[
"Wan",
"Yu",
""
],
[
"Yang",
"Baosong",
""
],
[
"Wong",
"Derek F.",
""
],
[
"Chao",
"Lidia S.",
""
],
[
"Du",
"Haihua",
""
],
[
"Ao",
"Ben C. H.",
""
]
] | As a special machine translation task, dialect translation has two main characteristics: 1) lack of parallel training corpus; and 2) possessing similar grammar between two sides of the translation. In this paper, we investigate how to exploit the commonality and diversity between dialects thus to build unsupervised tra... |
2311.03815 | Ning Chen | Ning Chen, Zhipeng Cheng, Xuwei Fan, Bangzhen Huang, Yifeng Zhao,
Lianfen Huang, Xiaojiang Du, Mohsen Guizani | Integrated Sensing, Communication, and Computing for Cost-effective
Multimodal Federated Perception | null | null | null | null | cs.NI eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning (FL) is a classic paradigm of 6G edge intelligence (EI),
which alleviates privacy leaks and high communication pressure caused by
traditional centralized data processing in the artificial intelligence of
things (AIoT). The implementation of multimodal federated perception (MFP)
services involves th... | [
{
"created": "Tue, 7 Nov 2023 08:55:56 GMT",
"version": "v1"
}
] | 2023-11-08 | [
[
"Chen",
"Ning",
""
],
[
"Cheng",
"Zhipeng",
""
],
[
"Fan",
"Xuwei",
""
],
[
"Huang",
"Bangzhen",
""
],
[
"Zhao",
"Yifeng",
""
],
[
"Huang",
"Lianfen",
""
],
[
"Du",
"Xiaojiang",
""
],
[
"Guizani",
... | Federated learning (FL) is a classic paradigm of 6G edge intelligence (EI), which alleviates privacy leaks and high communication pressure caused by traditional centralized data processing in the artificial intelligence of things (AIoT). The implementation of multimodal federated perception (MFP) services involves thre... |
2304.04812 | Ziyang Li | Ziyang Li, Jiani Huang, Mayur Naik | Scallop: A Language for Neurosymbolic Programming | null | null | null | null | cs.PL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We present Scallop, a language which combines the benefits of deep learning
and logical reasoning. Scallop enables users to write a wide range of
neurosymbolic applications and train them in a data- and compute-efficient
manner. It achieves these goals through three key features: 1) a flexible
symbolic representation... | [
{
"created": "Mon, 10 Apr 2023 18:46:53 GMT",
"version": "v1"
}
] | 2023-04-12 | [
[
"Li",
"Ziyang",
""
],
[
"Huang",
"Jiani",
""
],
[
"Naik",
"Mayur",
""
]
] | We present Scallop, a language which combines the benefits of deep learning and logical reasoning. Scallop enables users to write a wide range of neurosymbolic applications and train them in a data- and compute-efficient manner. It achieves these goals through three key features: 1) a flexible symbolic representation t... |
2311.13509 | Qiyang Zhang | Yijie Chen, Qiyang Zhang, Yiran Zhang, Xiao Ma, Ao Zhou | Energy and Time-Aware Inference Offloading for DNN-based Applications in
LEO Satellites | Accepted by ICNP 2023 Workshop | null | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In recent years, Low Earth Orbit (LEO) satellites have witnessed rapid
development, with inference based on Deep Neural Network (DNN) models emerging
as the prevailing technology for remote sensing satellite image recognition.
However, the substantial computation capability and energy demands of DNN
models, coupled w... | [
{
"created": "Wed, 22 Nov 2023 16:34:17 GMT",
"version": "v1"
}
] | 2023-11-23 | [
[
"Chen",
"Yijie",
""
],
[
"Zhang",
"Qiyang",
""
],
[
"Zhang",
"Yiran",
""
],
[
"Ma",
"Xiao",
""
],
[
"Zhou",
"Ao",
""
]
] | In recent years, Low Earth Orbit (LEO) satellites have witnessed rapid development, with inference based on Deep Neural Network (DNN) models emerging as the prevailing technology for remote sensing satellite image recognition. However, the substantial computation capability and energy demands of DNN models, coupled wit... |
2108.03567 | Peihan Liu | Nuh Aydin, Peihan Liu, Bryan Yoshino | A Database of Quantum Codes | arXiv admin note: text overlap with arXiv:2106.12065 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantum error correcting codes (QECC) is becoming an increasingly important
branch of coding theory. For classical block codes, a \href{codetables.de}
{comprehensive database of best known codes} exists which is available online
at \cite{codetables}. The same database contains data on best known quantum
codes as well... | [
{
"created": "Sun, 8 Aug 2021 04:31:10 GMT",
"version": "v1"
}
] | 2021-08-21 | [
[
"Aydin",
"Nuh",
""
],
[
"Liu",
"Peihan",
""
],
[
"Yoshino",
"Bryan",
""
]
] | Quantum error correcting codes (QECC) is becoming an increasingly important branch of coding theory. For classical block codes, a \href{codetables.de} {comprehensive database of best known codes} exists which is available online at \cite{codetables}. The same database contains data on best known quantum codes as well, ... |
2404.16816 | Harman Singh | Harman Singh, Nitish Gupta, Shikhar Bharadwaj, Dinesh Tewari, Partha
Talukdar | IndicGenBench: A Multilingual Benchmark to Evaluate Generation
Capabilities of LLMs on Indic Languages | ACL 2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As large language models (LLMs) see increasing adoption across the globe, it
is imperative for LLMs to be representative of the linguistic diversity of the
world. India is a linguistically diverse country of 1.4 Billion people. To
facilitate research on multilingual LLM evaluation, we release IndicGenBench -
the larg... | [
{
"created": "Thu, 25 Apr 2024 17:57:36 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Aug 2024 19:47:21 GMT",
"version": "v2"
}
] | 2024-08-09 | [
[
"Singh",
"Harman",
""
],
[
"Gupta",
"Nitish",
""
],
[
"Bharadwaj",
"Shikhar",
""
],
[
"Tewari",
"Dinesh",
""
],
[
"Talukdar",
"Partha",
""
]
] | As large language models (LLMs) see increasing adoption across the globe, it is imperative for LLMs to be representative of the linguistic diversity of the world. India is a linguistically diverse country of 1.4 Billion people. To facilitate research on multilingual LLM evaluation, we release IndicGenBench - the larges... |
2406.16793 | Yushun Zhang | Yushun Zhang, Congliang Chen, Ziniu Li, Tian Ding, Chenwei Wu, Yinyu
Ye, Zhi-Quan Luo, Ruoyu Sun | Adam-mini: Use Fewer Learning Rates To Gain More | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | We propose Adam-mini, an optimizer that achieves on-par or better performance
than AdamW with 45% to 50% less memory footprint. Adam-mini reduces memory by
cutting down the learning rate resources in Adam (i.e., $1/\sqrt{v}$). We find
that $\geq$ 90% of these learning rates in $v$ could be harmlessly removed if
we (1... | [
{
"created": "Mon, 24 Jun 2024 16:56:41 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Jun 2024 17:45:06 GMT",
"version": "v2"
},
{
"created": "Wed, 26 Jun 2024 13:03:16 GMT",
"version": "v3"
},
{
"created": "Mon, 1 Jul 2024 17:46:19 GMT",
"version": "v4"
},
{
"cr... | 2024-07-04 | [
[
"Zhang",
"Yushun",
""
],
[
"Chen",
"Congliang",
""
],
[
"Li",
"Ziniu",
""
],
[
"Ding",
"Tian",
""
],
[
"Wu",
"Chenwei",
""
],
[
"Ye",
"Yinyu",
""
],
[
"Luo",
"Zhi-Quan",
""
],
[
"Sun",
"Ruoyu",
... | We propose Adam-mini, an optimizer that achieves on-par or better performance than AdamW with 45% to 50% less memory footprint. Adam-mini reduces memory by cutting down the learning rate resources in Adam (i.e., $1/\sqrt{v}$). We find that $\geq$ 90% of these learning rates in $v$ could be harmlessly removed if we (1) ... |
2205.00510 | Jussi Karlgren | Jussi Karlgren | Textual Stylistic Variation: Choices, Genres and Individuals | null | null | 10.1007/978-3-642-12337-5_6 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | This chapter argues for more informed target metrics for the statistical
processing of stylistic variation in text collections. Much as operationalised
relevance proved a useful goal to strive for in information retrieval, research
in textual stylistics, whether application oriented or philologically inclined,
needs ... | [
{
"created": "Sun, 1 May 2022 16:39:49 GMT",
"version": "v1"
}
] | 2022-05-11 | [
[
"Karlgren",
"Jussi",
""
]
] | This chapter argues for more informed target metrics for the statistical processing of stylistic variation in text collections. Much as operationalised relevance proved a useful goal to strive for in information retrieval, research in textual stylistics, whether application oriented or philologically inclined, needs go... |
1905.04612 | Bruce MacLennan | Chengrui Li and Bruce J. MacLennan | Continuous-Time Systems for Solving 0-1 Integer Linear Programming
Feasibility Problems | null | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The 0-1 integer linear programming feasibility problem is an important
NP-complete problem. This paper proposes a continuous-time dynamical system for
solving that problem without getting trapped in non-solution local minima.
First, the problem is transformed to an easier form in linear time. Then, we
propose an "imp... | [
{
"created": "Sun, 12 May 2019 00:01:07 GMT",
"version": "v1"
}
] | 2019-05-14 | [
[
"Li",
"Chengrui",
""
],
[
"MacLennan",
"Bruce J.",
""
]
] | The 0-1 integer linear programming feasibility problem is an important NP-complete problem. This paper proposes a continuous-time dynamical system for solving that problem without getting trapped in non-solution local minima. First, the problem is transformed to an easier form in linear time. Then, we propose an "impul... |
1901.05919 | Francesco Kriegel | Francesco Kriegel | The Distributive, Graded Lattice of EL Concept Descriptions and its
Neighborhood Relation (Extended Version) | null | null | null | LTCS-Report 18-10 | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For the description logic EL, we consider the neighborhood relation which is
induced by the subsumption order, and we show that the corresponding lattice of
EL concept descriptions is distributive, modular, graded, and metric. In
particular, this implies the existence of a rank function as well as the
existence of a ... | [
{
"created": "Thu, 17 Jan 2019 17:35:46 GMT",
"version": "v1"
}
] | 2019-01-18 | [
[
"Kriegel",
"Francesco",
""
]
] | For the description logic EL, we consider the neighborhood relation which is induced by the subsumption order, and we show that the corresponding lattice of EL concept descriptions is distributive, modular, graded, and metric. In particular, this implies the existence of a rank function as well as the existence of a di... |
2311.06992 | Arnav Kumar | Arnav Kumar, Andr\'es Monroy-Hern\'andez | Ball-AR: Fostering Playful Co-Located Interaction Through
Environment-centric Physical Activity with AR | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | We present Ball-AR, an augmented reality (AR) game where two players in the
same physical space attempt to hit each other with virtual dodgeballs overlaid
on the physical world. Researchers have studied AR's potential for fostering
co-located interaction and physical activity; however, they have not
investigated the ... | [
{
"created": "Mon, 13 Nov 2023 00:12:14 GMT",
"version": "v1"
}
] | 2023-11-14 | [
[
"Kumar",
"Arnav",
""
],
[
"Monroy-Hernández",
"Andrés",
""
]
] | We present Ball-AR, an augmented reality (AR) game where two players in the same physical space attempt to hit each other with virtual dodgeballs overlaid on the physical world. Researchers have studied AR's potential for fostering co-located interaction and physical activity; however, they have not investigated the im... |
2007.09072 | Xu Chen | Xin Tang and Xu Chen and Liekang Zeng and Shuai Yu and Lin Chen | Joint Multi-User DNN Partitioning and Computational Resource Allocation
for Collaborative Edge Intelligence | null | null | null | null | cs.DC cs.LG cs.NI eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile Edge Computing (MEC) has emerged as a promising supporting
architecture providing a variety of resources to the network edge, thus acting
as an enabler for edge intelligence services empowering massive mobile and
Internet of Things (IoT) devices with AI capability. With the assistance of
edge servers, user equ... | [
{
"created": "Wed, 15 Jul 2020 09:40:13 GMT",
"version": "v1"
}
] | 2020-07-20 | [
[
"Tang",
"Xin",
""
],
[
"Chen",
"Xu",
""
],
[
"Zeng",
"Liekang",
""
],
[
"Yu",
"Shuai",
""
],
[
"Chen",
"Lin",
""
]
] | Mobile Edge Computing (MEC) has emerged as a promising supporting architecture providing a variety of resources to the network edge, thus acting as an enabler for edge intelligence services empowering massive mobile and Internet of Things (IoT) devices with AI capability. With the assistance of edge servers, user equip... |
2407.01546 | Hongjie Xu | Hongjie Xu, Yunzhuang Shen, Yuan Sun and Xiaodong Li | Machine Learning-Enhanced Ant Colony Optimization for Column Generation | 9 pages including reference | null | null | null | cs.NE cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Column generation (CG) is a powerful technique for solving optimization
problems that involve a large number of variables or columns. This technique
begins by solving a smaller problem with a subset of columns and gradually
generates additional columns as needed. However, the generation of columns
often requires solv... | [
{
"created": "Tue, 23 Apr 2024 01:00:09 GMT",
"version": "v1"
}
] | 2024-07-03 | [
[
"Xu",
"Hongjie",
""
],
[
"Shen",
"Yunzhuang",
""
],
[
"Sun",
"Yuan",
""
],
[
"Li",
"Xiaodong",
""
]
] | Column generation (CG) is a powerful technique for solving optimization problems that involve a large number of variables or columns. This technique begins by solving a smaller problem with a subset of columns and gradually generates additional columns as needed. However, the generation of columns often requires solvin... |
2108.05170 | Sven Mantowsky | Sven Mantowsky, Falk Heuer, Syed Saqib Bukhari, Michael Keckeisen,
Georg Schneider | ProAI: An Efficient Embedded AI Hardware for Automotive Applications --
a Benchmark Study | Accepted by IEEE International Conference on Computer Vision (ICCV)
2021 | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Development in the field of Single Board Computers (SBC) have been increasing
for several years. They provide a good balance between computing performance
and power consumption which is usually required for mobile platforms, like
application in vehicles for Advanced Driver Assistance Systems (ADAS) and
Autonomous Dri... | [
{
"created": "Wed, 11 Aug 2021 11:54:05 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Sep 2021 13:23:34 GMT",
"version": "v2"
}
] | 2021-09-10 | [
[
"Mantowsky",
"Sven",
""
],
[
"Heuer",
"Falk",
""
],
[
"Bukhari",
"Syed Saqib",
""
],
[
"Keckeisen",
"Michael",
""
],
[
"Schneider",
"Georg",
""
]
] | Development in the field of Single Board Computers (SBC) have been increasing for several years. They provide a good balance between computing performance and power consumption which is usually required for mobile platforms, like application in vehicles for Advanced Driver Assistance Systems (ADAS) and Autonomous Drivi... |
2112.03009 | Ximing Li | Bing Wang, Yue Wang, Ximing Li, Jihong Ouyang | Weakly Supervised Prototype Topic Model with Discriminative Seed Words:
Modifying the Category Prior by Self-exploring Supervised Signals | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | Dataless text classification, i.e., a new paradigm of weakly supervised
learning, refers to the task of learning with unlabeled documents and a few
predefined representative words of categories, known as seed words. The recent
generative dataless methods construct document-specific category priors by
using seed word ... | [
{
"created": "Sat, 20 Nov 2021 00:00:56 GMT",
"version": "v1"
}
] | 2021-12-07 | [
[
"Wang",
"Bing",
""
],
[
"Wang",
"Yue",
""
],
[
"Li",
"Ximing",
""
],
[
"Ouyang",
"Jihong",
""
]
] | Dataless text classification, i.e., a new paradigm of weakly supervised learning, refers to the task of learning with unlabeled documents and a few predefined representative words of categories, known as seed words. The recent generative dataless methods construct document-specific category priors by using seed word oc... |
2310.12334 | Weiyi Wu | Weiyi Wu, Chongyang Gao, Joseph DiPalma, Soroush Vosoughi, Saeed
Hassanpour | Improving Representation Learning for Histopathologic Images with
Cluster Constraints | Accepted by ICCV2023 | Proceedings of the IEEE/CVF International Conference on Computer
Vision (ICCV), 2023, pp. 21404-21414 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in whole-slide image (WSI) scanners and computational
capabilities have significantly propelled the application of artificial
intelligence in histopathology slide analysis. While these strides are
promising, current supervised learning approaches for WSI analysis come with
the challenge of exhaustivel... | [
{
"created": "Wed, 18 Oct 2023 21:20:44 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Nov 2023 12:04:24 GMT",
"version": "v2"
}
] | 2023-11-15 | [
[
"Wu",
"Weiyi",
""
],
[
"Gao",
"Chongyang",
""
],
[
"DiPalma",
"Joseph",
""
],
[
"Vosoughi",
"Soroush",
""
],
[
"Hassanpour",
"Saeed",
""
]
] | Recent advances in whole-slide image (WSI) scanners and computational capabilities have significantly propelled the application of artificial intelligence in histopathology slide analysis. While these strides are promising, current supervised learning approaches for WSI analysis come with the challenge of exhaustively ... |
2202.03055 | Anastasiia Grishina | Anastasiia Grishina | Enabling Automatic Repair of Source Code Vulnerabilities Using
Data-Driven Methods | Accepted for the ICSE '22 Doctoral Symposium | null | 10.1145/3510454.3517063 | null | cs.SE cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Users around the world rely on software-intensive systems in their day-to-day
activities. These systems regularly contain bugs and security vulnerabilities.
To facilitate bug fixing, data-driven models of automatic program repair use
pairs of buggy and fixed code to learn transformations that fix errors in code.
Howe... | [
{
"created": "Mon, 7 Feb 2022 10:47:37 GMT",
"version": "v1"
}
] | 2022-02-08 | [
[
"Grishina",
"Anastasiia",
""
]
] | Users around the world rely on software-intensive systems in their day-to-day activities. These systems regularly contain bugs and security vulnerabilities. To facilitate bug fixing, data-driven models of automatic program repair use pairs of buggy and fixed code to learn transformations that fix errors in code. Howeve... |
cs/9809065 | Chunlei Liu | Sonia Fahmy, Raj Jain, Rohit Goyal, Bobby Vandalore, Shivkumar
Kalyanaraman, Sastri Kota, and Pradeep Samudra | Feedback Consolidation Algorithms for ABR Point-to-Multipoint
Connections in ATM Networks | Proceedings of IEEE INFOCOM 1998, March 1998, volume 3, pp. 1004-1013 | null | 10.1109/INFCOM.1998.662910 | null | cs.NI | null | ABR traffic management for point-to-multipoint connections controls the
source rate to the minimum rate supported by all the branches of the multicast
tree. A number of algorithms have been developed for extending ABR congestion
avoidance algorithms to perform feedback consolidation at the branch points.
This paper d... | [
{
"created": "Wed, 23 Sep 1998 16:22:42 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Fahmy",
"Sonia",
""
],
[
"Jain",
"Raj",
""
],
[
"Goyal",
"Rohit",
""
],
[
"Vandalore",
"Bobby",
""
],
[
"Kalyanaraman",
"Shivkumar",
""
],
[
"Kota",
"Sastri",
""
],
[
"Samudra",
"Pradeep",
""
]
] | ABR traffic management for point-to-multipoint connections controls the source rate to the minimum rate supported by all the branches of the multicast tree. A number of algorithms have been developed for extending ABR congestion avoidance algorithms to perform feedback consolidation at the branch points. This paper dis... |
2401.13410 | Shuyi Wang | Shuyi Wang, Bing Liu, Guido Zuccon | How to Forget Clients in Federated Online Learning to Rank? | Accepted in ECIR 2024 | null | null | null | cs.CR cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data protection legislation like the European Union's General Data Protection
Regulation (GDPR) establishes the \textit{right to be forgotten}: a user
(client) can request contributions made using their data to be removed from
learned models. In this paper, we study how to remove the contributions made by
a client pa... | [
{
"created": "Wed, 24 Jan 2024 12:11:41 GMT",
"version": "v1"
}
] | 2024-01-25 | [
[
"Wang",
"Shuyi",
""
],
[
"Liu",
"Bing",
""
],
[
"Zuccon",
"Guido",
""
]
] | Data protection legislation like the European Union's General Data Protection Regulation (GDPR) establishes the \textit{right to be forgotten}: a user (client) can request contributions made using their data to be removed from learned models. In this paper, we study how to remove the contributions made by a client part... |
2202.05451 | Jia Huei Tan | Jia Huei Tan, Ying Hua Tan, Chee Seng Chan, Joon Huang Chuah | ACORT: A Compact Object Relation Transformer for Parameter Efficient
Image Captioning | Neurocomputing; In Press | null | null | null | cs.CV cs.CL cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Recent research that applies Transformer-based architectures to image
captioning has resulted in state-of-the-art image captioning performance,
capitalising on the success of Transformers on natural language tasks.
Unfortunately, though these models work well, one major flaw is their large
model sizes. To this end, w... | [
{
"created": "Fri, 11 Feb 2022 05:10:28 GMT",
"version": "v1"
}
] | 2022-02-14 | [
[
"Tan",
"Jia Huei",
""
],
[
"Tan",
"Ying Hua",
""
],
[
"Chan",
"Chee Seng",
""
],
[
"Chuah",
"Joon Huang",
""
]
] | Recent research that applies Transformer-based architectures to image captioning has resulted in state-of-the-art image captioning performance, capitalising on the success of Transformers on natural language tasks. Unfortunately, though these models work well, one major flaw is their large model sizes. To this end, we ... |
1208.2900 | Lu Yang | Lu Yang and Wei Zhang | On Achievable Degrees of Freedom for MIMO X Channels | 18 pages 6 figures, minor revisions in Abstract and Introduction of
version 1 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the achievable DoF of MIMO X channels for constant channel
coefficients with $M_t$ antennas at transmitter $t$ and $N_r$ antennas at
receiver $r$ ($t,r=1,2$) is studied. A spatial interference alignment and
cancelation scheme is proposed to achieve the maximum DoF of the MIMO X
channels. The scenario o... | [
{
"created": "Tue, 14 Aug 2012 15:34:33 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Aug 2012 02:28:53 GMT",
"version": "v2"
}
] | 2012-08-27 | [
[
"Yang",
"Lu",
""
],
[
"Zhang",
"Wei",
""
]
] | In this paper, the achievable DoF of MIMO X channels for constant channel coefficients with $M_t$ antennas at transmitter $t$ and $N_r$ antennas at receiver $r$ ($t,r=1,2$) is studied. A spatial interference alignment and cancelation scheme is proposed to achieve the maximum DoF of the MIMO X channels. The scenario of ... |
1302.6312 | Shams Zawoad | Shams Zawoad, Ragib Hasan | Cloud Forensics: A Meta-Study of Challenges, Approaches, and Open
Problems | null | null | null | null | cs.DC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, cloud computing has become popular as a cost-effective and
efficient computing paradigm. Unfortunately, today's cloud computing
architectures are not designed for security and forensics. To date, very little
research has been done to develop the theory and practice of cloud forensics.
Many factors co... | [
{
"created": "Tue, 26 Feb 2013 04:55:53 GMT",
"version": "v1"
}
] | 2013-02-27 | [
[
"Zawoad",
"Shams",
""
],
[
"Hasan",
"Ragib",
""
]
] | In recent years, cloud computing has become popular as a cost-effective and efficient computing paradigm. Unfortunately, today's cloud computing architectures are not designed for security and forensics. To date, very little research has been done to develop the theory and practice of cloud forensics. Many factors comp... |
2407.08388 | Geoff Keeling | Geoff Keeling, Winnie Street | On the attribution of confidence to large language models | 22 pages, 0 figures | null | null | null | cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | Credences are mental states corresponding to degrees of confidence in
propositions. Attribution of credences to Large Language Models (LLMs) is
commonplace in the empirical literature on LLM evaluation. Yet the theoretical
basis for LLM credence attribution is unclear. We defend three claims. First,
our semantic clai... | [
{
"created": "Thu, 11 Jul 2024 10:51:06 GMT",
"version": "v1"
}
] | 2024-07-12 | [
[
"Keeling",
"Geoff",
""
],
[
"Street",
"Winnie",
""
]
] | Credences are mental states corresponding to degrees of confidence in propositions. Attribution of credences to Large Language Models (LLMs) is commonplace in the empirical literature on LLM evaluation. Yet the theoretical basis for LLM credence attribution is unclear. We defend three claims. First, our semantic claim ... |
2301.12830 | Timo Koch | Timo Koch and Dennis Gl\"aser and Anett Seeland and Sarbani Roy and
Katharina Schulze and Kilian Weishaupt and David Boehringer and Sibylle
Hermann and Bernd Flemisch | A sustainable infrastructure concept for improved accessibility,
reusability, and archival of research software | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Research software is an integral part of most research today and it is widely
accepted that research software artifacts should be accessible and
reproducible. However, the sustainable archival of research software artifacts
is an ongoing effort. We identify research software artifacts as snapshots of
the current stat... | [
{
"created": "Fri, 27 Jan 2023 00:16:23 GMT",
"version": "v1"
}
] | 2023-01-31 | [
[
"Koch",
"Timo",
""
],
[
"Gläser",
"Dennis",
""
],
[
"Seeland",
"Anett",
""
],
[
"Roy",
"Sarbani",
""
],
[
"Schulze",
"Katharina",
""
],
[
"Weishaupt",
"Kilian",
""
],
[
"Boehringer",
"David",
""
],
[
... | Research software is an integral part of most research today and it is widely accepted that research software artifacts should be accessible and reproducible. However, the sustainable archival of research software artifacts is an ongoing effort. We identify research software artifacts as snapshots of the current state ... |
1905.01749 | Max Noormohammadpour | Mohammad Noormohammadpour, Srikanth Kandula, Cauligi S. Raghavendra,
Sriram Rao | Efficient Inter-Datacenter Bulk Transfers with Mixed Completion Time
Objectives | Accepted to Elsevier Computer Networks | null | null | null | cs.DC cs.NI cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bulk transfers from one to multiple datacenters can have many different
completion time objectives ranging from quickly replicating some $k$ copies to
minimizing the time by which the last destination receives a full replica. We
design an SDN-style wide-area traffic scheduler that optimizes different
completion time ... | [
{
"created": "Sun, 5 May 2019 21:22:44 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Aug 2019 06:02:51 GMT",
"version": "v2"
},
{
"created": "Sun, 15 Sep 2019 16:14:54 GMT",
"version": "v3"
}
] | 2019-09-17 | [
[
"Noormohammadpour",
"Mohammad",
""
],
[
"Kandula",
"Srikanth",
""
],
[
"Raghavendra",
"Cauligi S.",
""
],
[
"Rao",
"Sriram",
""
]
] | Bulk transfers from one to multiple datacenters can have many different completion time objectives ranging from quickly replicating some $k$ copies to minimizing the time by which the last destination receives a full replica. We design an SDN-style wide-area traffic scheduler that optimizes different completion time ob... |
1808.06032 | Yufei Wang | Yufei Wang, Zhe Lin, Xiaohui Shen, Jianming Zhang, Scott Cohen | Concept Mask: Large-Scale Segmentation from Semantic Concepts | Accepted to ECCV18 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing works on semantic segmentation typically consider a small number of
labels, ranging from tens to a few hundreds. With a large number of labels,
training and evaluation of such task become extremely challenging due to
correlation between labels and lack of datasets with complete annotations. We
formulate sema... | [
{
"created": "Sat, 18 Aug 2018 02:26:03 GMT",
"version": "v1"
}
] | 2018-08-21 | [
[
"Wang",
"Yufei",
""
],
[
"Lin",
"Zhe",
""
],
[
"Shen",
"Xiaohui",
""
],
[
"Zhang",
"Jianming",
""
],
[
"Cohen",
"Scott",
""
]
] | Existing works on semantic segmentation typically consider a small number of labels, ranging from tens to a few hundreds. With a large number of labels, training and evaluation of such task become extremely challenging due to correlation between labels and lack of datasets with complete annotations. We formulate semant... |
2010.01080 | Moritz Wolf | Moritz Wolf, Dana Ruiter, Ashwin Geet D'Sa, Liane Reiners, Jan
Alexandersson, Dietrich Klakow | HUMAN: Hierarchical Universal Modular ANnotator | 7 pages, 4 figures, EMNLP - Demonstrations 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A lot of real-world phenomena are complex and cannot be captured by single
task annotations. This causes a need for subsequent annotations, with
interdependent questions and answers describing the nature of the subject at
hand. Even in the case a phenomenon is easily captured by a single task, the
high specialisation... | [
{
"created": "Fri, 2 Oct 2020 16:20:30 GMT",
"version": "v1"
}
] | 2020-10-05 | [
[
"Wolf",
"Moritz",
""
],
[
"Ruiter",
"Dana",
""
],
[
"D'Sa",
"Ashwin Geet",
""
],
[
"Reiners",
"Liane",
""
],
[
"Alexandersson",
"Jan",
""
],
[
"Klakow",
"Dietrich",
""
]
] | A lot of real-world phenomena are complex and cannot be captured by single task annotations. This causes a need for subsequent annotations, with interdependent questions and answers describing the nature of the subject at hand. Even in the case a phenomenon is easily captured by a single task, the high specialisation o... |
1407.6915 | Brad Rees | Rostislav Tsiomenko and Bradley S. Rees | Accelerating Fast Fourier Transforms Using Hadoop and CUDA | 6 pages Was submitted to ICDCS 2013 but not accepted | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been considerable research into improving Fast Fourier Transform
(FFT) performance through parallelization and optimization for specialized
hardware. However, even with those advancements, processing of very large
files, over 1TB in size, still remains prohibitively slow. Analysts performing
signal processi... | [
{
"created": "Fri, 25 Jul 2014 14:25:35 GMT",
"version": "v1"
}
] | 2014-07-28 | [
[
"Tsiomenko",
"Rostislav",
""
],
[
"Rees",
"Bradley S.",
""
]
] | There has been considerable research into improving Fast Fourier Transform (FFT) performance through parallelization and optimization for specialized hardware. However, even with those advancements, processing of very large files, over 1TB in size, still remains prohibitively slow. Analysts performing signal processing... |
2301.10127 | Erik Wallin | Erik Wallin, Lennart Svensson, Fredrik Kahl, Lars Hammarstrand | Improving Open-Set Semi-Supervised Learning with Self-Supervision | WACV2024 | null | null | null | cs.LG cs.CV stat.ML | http://creativecommons.org/licenses/by/4.0/ | Open-set semi-supervised learning (OSSL) embodies a practical scenario within
semi-supervised learning, wherein the unlabeled training set encompasses
classes absent from the labeled set. Many existing OSSL methods assume that
these out-of-distribution data are harmful and put effort into excluding data
belonging to ... | [
{
"created": "Tue, 24 Jan 2023 16:46:37 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Mar 2023 20:02:28 GMT",
"version": "v2"
},
{
"created": "Wed, 29 Nov 2023 23:02:49 GMT",
"version": "v3"
}
] | 2023-12-04 | [
[
"Wallin",
"Erik",
""
],
[
"Svensson",
"Lennart",
""
],
[
"Kahl",
"Fredrik",
""
],
[
"Hammarstrand",
"Lars",
""
]
] | Open-set semi-supervised learning (OSSL) embodies a practical scenario within semi-supervised learning, wherein the unlabeled training set encompasses classes absent from the labeled set. Many existing OSSL methods assume that these out-of-distribution data are harmful and put effort into excluding data belonging to un... |
2111.09908 | Corban Rivera | Corban G. Rivera, David A Handelman | Visual Goal-Directed Meta-Learning with Contextual Planning Networks | null | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | The goal of meta-learning is to generalize to new tasks and goals as quickly
as possible. Ideally, we would like approaches that generalize to new goals and
tasks on the first attempt. Toward that end, we introduce contextual planning
networks (CPN). Tasks are represented as goal images and used to condition the
appr... | [
{
"created": "Thu, 18 Nov 2021 19:11:01 GMT",
"version": "v1"
}
] | 2021-11-22 | [
[
"Rivera",
"Corban G.",
""
],
[
"Handelman",
"David A",
""
]
] | The goal of meta-learning is to generalize to new tasks and goals as quickly as possible. Ideally, we would like approaches that generalize to new goals and tasks on the first attempt. Toward that end, we introduce contextual planning networks (CPN). Tasks are represented as goal images and used to condition the approa... |
1405.4733 | Ocan Sankur | Jean-Fran\c{c}ois Raskin, Ocan Sankur | Multiple-Environment Markov Decision Processes | null | null | null | null | cs.LO cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce Multi-Environment Markov Decision Processes (MEMDPs) which are
MDPs with a set of probabilistic transition functions. The goal in a MEMDP is
to synthesize a single controller with guaranteed performances against all
environments even though the environment is unknown a priori. While MEMDPs can
be seen as... | [
{
"created": "Mon, 19 May 2014 14:21:15 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Dec 2014 10:42:46 GMT",
"version": "v2"
}
] | 2014-12-04 | [
[
"Raskin",
"Jean-François",
""
],
[
"Sankur",
"Ocan",
""
]
] | We introduce Multi-Environment Markov Decision Processes (MEMDPs) which are MDPs with a set of probabilistic transition functions. The goal in a MEMDP is to synthesize a single controller with guaranteed performances against all environments even though the environment is unknown a priori. While MEMDPs can be seen as a... |
1410.7582 | Kas{\i}m Sinan Y{\i}ld{\i}r{\i}m | Kas{\i}m Sinan Y{\i}ld{\i}r{\i}m and \"Onder G\"urcan | Adaptive Synchronization of Robotic Sensor Networks | First International Workshop on Robotic Sensor Networks part of
Cyber-Physical Systems Week, Berlin, Germany, 14 April 2014 | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main focus of recent time synchronization research is developing
power-efficient synchronization methods that meet pre-defined accuracy
requirements. However, an aspect that has been often overlooked is the high
dynamics of the network topology due to the mobility of the nodes. Employing
existing flooding-based a... | [
{
"created": "Tue, 28 Oct 2014 11:02:23 GMT",
"version": "v1"
}
] | 2014-10-29 | [
[
"Yıldırım",
"Kasım Sinan",
""
],
[
"Gürcan",
"Önder",
""
]
] | The main focus of recent time synchronization research is developing power-efficient synchronization methods that meet pre-defined accuracy requirements. However, an aspect that has been often overlooked is the high dynamics of the network topology due to the mobility of the nodes. Employing existing flooding-based and... |
1812.11950 | Menglei Zhang | Menglei Zhang, Zhou Liu, Lei Yu | Image Super-Resolution via RL-CSC: When Residual Learning Meets
Convolutional Sparse Coding | 10 pages, 8 figures, 4 tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a simple yet effective model for Single Image Super-Resolution
(SISR), by combining the merits of Residual Learning and Convolutional Sparse
Coding (RL-CSC). Our model is inspired by the Learned Iterative
Shrinkage-Threshold Algorithm (LISTA). We extend LISTA to its convolutional
version and build the main... | [
{
"created": "Mon, 31 Dec 2018 18:44:26 GMT",
"version": "v1"
}
] | 2019-01-01 | [
[
"Zhang",
"Menglei",
""
],
[
"Liu",
"Zhou",
""
],
[
"Yu",
"Lei",
""
]
] | We propose a simple yet effective model for Single Image Super-Resolution (SISR), by combining the merits of Residual Learning and Convolutional Sparse Coding (RL-CSC). Our model is inspired by the Learned Iterative Shrinkage-Threshold Algorithm (LISTA). We extend LISTA to its convolutional version and build the main p... |
1901.11358 | Ansari Saleh Ahmar | Harryanto, Muchriana Muchran, Ansari Saleh Ahmar | Application of TAM model to the use of information technology | null | International Journal of Engineering & Technology (UAE), 7 (2.9)
(2018) 37-40 | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The purpose of this research is to see the application of modified TAM model
by entering the experiential variable as a moderation variable to see one's
intention in the use of technology especially internet banking. Data obtained
through the distribution of questionnaires to customers. The study population
is bank c... | [
{
"created": "Sun, 13 Jan 2019 22:54:30 GMT",
"version": "v1"
}
] | 2019-02-01 | [
[
"Harryanto",
"",
""
],
[
"Muchran",
"Muchriana",
""
],
[
"Ahmar",
"Ansari Saleh",
""
]
] | The purpose of this research is to see the application of modified TAM model by entering the experiential variable as a moderation variable to see one's intention in the use of technology especially internet banking. Data obtained through the distribution of questionnaires to customers. The study population is bank cus... |
2403.01700 | Haoxu Wang | Haoxu Wang, Ming Cheng, Qiang Fu, Ming Li | Robust Wake Word Spotting With Frame-Level Cross-Modal Attention Based
Audio-Visual Conformer | Accepted by ICASSP 2024 | null | null | null | cs.SD cs.MM eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, neural network-based Wake Word Spotting achieves good
performance on clean audio samples but struggles in noisy environments.
Audio-Visual Wake Word Spotting (AVWWS) receives lots of attention because
visual lip movement information is not affected by complex acoustic scenes.
Previous works usually u... | [
{
"created": "Mon, 4 Mar 2024 03:25:42 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Wang",
"Haoxu",
""
],
[
"Cheng",
"Ming",
""
],
[
"Fu",
"Qiang",
""
],
[
"Li",
"Ming",
""
]
] | In recent years, neural network-based Wake Word Spotting achieves good performance on clean audio samples but struggles in noisy environments. Audio-Visual Wake Word Spotting (AVWWS) receives lots of attention because visual lip movement information is not affected by complex acoustic scenes. Previous works usually use... |
2305.07865 | Nian Guo | Nian Guo, Shansuo Liang, Wei Han | Power Allocation for the Base Matrix of Spatially Coupled Sparse
Regression Codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate power allocation for the base matrix of a spatially coupled
sparse regression code (SC-SPARC) for reliable communications over an additive
white Gaussian noise channel. A conventional SC-SPARC allocates power uniformly
to the non-zero entries of its base matrix. Yet, to achieve the channel
capacity wit... | [
{
"created": "Sat, 13 May 2023 08:38:25 GMT",
"version": "v1"
}
] | 2023-05-16 | [
[
"Guo",
"Nian",
""
],
[
"Liang",
"Shansuo",
""
],
[
"Han",
"Wei",
""
]
] | We investigate power allocation for the base matrix of a spatially coupled sparse regression code (SC-SPARC) for reliable communications over an additive white Gaussian noise channel. A conventional SC-SPARC allocates power uniformly to the non-zero entries of its base matrix. Yet, to achieve the channel capacity with ... |
2012.11188 | Tom Tseng | Tom Tseng, Laxman Dhulipala, Julian Shun | Parallel Index-Based Structural Graph Clustering and Its Approximation | null | null | 10.1145/3448016.3457278 | null | cs.DB cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | SCAN (Structural Clustering Algorithm for Networks) is a well-studied, widely
used graph clustering algorithm. For large graphs, however, sequential SCAN
variants are prohibitively slow, and parallel SCAN variants do not effectively
share work among queries with different SCAN parameter settings. Since users of
SCAN ... | [
{
"created": "Mon, 21 Dec 2020 09:07:44 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Mar 2021 21:51:50 GMT",
"version": "v2"
}
] | 2021-04-01 | [
[
"Tseng",
"Tom",
""
],
[
"Dhulipala",
"Laxman",
""
],
[
"Shun",
"Julian",
""
]
] | SCAN (Structural Clustering Algorithm for Networks) is a well-studied, widely used graph clustering algorithm. For large graphs, however, sequential SCAN variants are prohibitively slow, and parallel SCAN variants do not effectively share work among queries with different SCAN parameter settings. Since users of SCAN of... |
2104.02461 | Sanjeev Saxena | Waseem Akram and Sanjeev Saxena | Sorted Range Reporting and Range Minima Queries | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given an array A[1: n] of n elements drawn from an ordered set, the sorted
range selection problem is to build a data structure that can be used to answer
the following type of queries efficiently: Given a pair of indices i, j $ (1\le
i\le j \le n)$, and a positive integer k, report the k smallest elements from
the s... | [
{
"created": "Tue, 6 Apr 2021 12:39:28 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Dec 2022 07:17:24 GMT",
"version": "v2"
},
{
"created": "Wed, 23 Aug 2023 08:27:22 GMT",
"version": "v3"
},
{
"created": "Tue, 19 Sep 2023 09:55:20 GMT",
"version": "v4"
}
] | 2023-09-20 | [
[
"Akram",
"Waseem",
""
],
[
"Saxena",
"Sanjeev",
""
]
] | Given an array A[1: n] of n elements drawn from an ordered set, the sorted range selection problem is to build a data structure that can be used to answer the following type of queries efficiently: Given a pair of indices i, j $ (1\le i\le j \le n)$, and a positive integer k, report the k smallest elements from the sub... |
1307.0849 | James Yang | James Yifei Yang and Bruce Hajek | Single Video Performance Analysis for Video-on-Demand Systems | null | null | null | null | cs.NI cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the content placement problem for cache delivery video-on-demand
systems under static random network topologies with fixed heavy-tailed video
demand. The performance measure is the amount of server load; we wish to
minimize the total download rate for all users from the server and maximize the
rate from cach... | [
{
"created": "Tue, 2 Jul 2013 20:56:37 GMT",
"version": "v1"
}
] | 2013-07-04 | [
[
"Yang",
"James Yifei",
""
],
[
"Hajek",
"Bruce",
""
]
] | We study the content placement problem for cache delivery video-on-demand systems under static random network topologies with fixed heavy-tailed video demand. The performance measure is the amount of server load; we wish to minimize the total download rate for all users from the server and maximize the rate from caches... |
1103.5580 | Saheeb Kayani Engr. | Saheeb Ahmed Kayani | Designing a Miniature Wheel Arrangement for Mobile Robot Platforms | Final published version, hardcopy available from technical library of
NUST College of E&ME, Rawalpindi, Pakistan on request | null | null | DME-RR-02 | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this research report details of design of a miniature wheel arrangement
are presented. This miniature wheel arrangement is essentially a direction
control mechanism intended for use on a mobile robot platform or base. The
design is a specific one employing a stepper motor as actuator and as described
can only be u... | [
{
"created": "Tue, 29 Mar 2011 09:35:49 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Mar 2011 09:32:01 GMT",
"version": "v2"
},
{
"created": "Sat, 2 Apr 2011 10:20:28 GMT",
"version": "v3"
}
] | 2011-04-05 | [
[
"Kayani",
"Saheeb Ahmed",
""
]
] | In this research report details of design of a miniature wheel arrangement are presented. This miniature wheel arrangement is essentially a direction control mechanism intended for use on a mobile robot platform or base. The design is a specific one employing a stepper motor as actuator and as described can only be use... |
2011.00310 | Artem Kramov | S. D. Pogorilyy and A. A. Kramov | Method of the coherence evaluation of Ukrainian text | 16 pages, in Ukrainian, 5 figures | Data Recording, Storage & Processing. 2018. Vol. 20, Issue 4. P.
64-75 | 10.35681/1560-9189.2018 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the growing role of the SEO technologies, it is necessary to perform
an automated analysis of the article's quality. Such approach helps both to
return the most intelligible pages for the user's query and to raise the web
sites positions to the top of query results. An automated assessment of a
coherence is a ... | [
{
"created": "Sat, 31 Oct 2020 16:48:55 GMT",
"version": "v1"
}
] | 2020-11-03 | [
[
"Pogorilyy",
"S. D.",
""
],
[
"Kramov",
"A. A.",
""
]
] | Due to the growing role of the SEO technologies, it is necessary to perform an automated analysis of the article's quality. Such approach helps both to return the most intelligible pages for the user's query and to raise the web sites positions to the top of query results. An automated assessment of a coherence is a pa... |
1709.01190 | Yiqiu Wang | Yiqiu Wang, Anshumali Shrivastava, Jonathan Wang, Junghee Ryu | FLASH: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High
Dimensional Similarity Search | null | null | null | null | cs.DS cs.DB cs.DC cs.IR cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present FLASH (\textbf{F}ast \textbf{L}SH \textbf{A}lgorithm for
\textbf{S}imilarity search accelerated with \textbf{H}PC), a similarity search
system for ultra-high dimensional datasets on a single machine, that does not
require similarity computations and is tailored for high-performance computing
platforms. By ... | [
{
"created": "Mon, 4 Sep 2017 23:09:19 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Jul 2018 07:09:23 GMT",
"version": "v2"
}
] | 2018-07-04 | [
[
"Wang",
"Yiqiu",
""
],
[
"Shrivastava",
"Anshumali",
""
],
[
"Wang",
"Jonathan",
""
],
[
"Ryu",
"Junghee",
""
]
] | We present FLASH (\textbf{F}ast \textbf{L}SH \textbf{A}lgorithm for \textbf{S}imilarity search accelerated with \textbf{H}PC), a similarity search system for ultra-high dimensional datasets on a single machine, that does not require similarity computations and is tailored for high-performance computing platforms. By le... |
0804.2535 | Aleksander Wojdyga | Aleksander Wojdyga | Short proofs of strong normalization | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents simple, syntactic strong normalization proofs for the
simply-typed lambda-calculus and the polymorphic lambda-calculus (system F)
with the full set of logical connectives, and all the permutative reductions.
The normalization proofs use translations of terms and types to systems, for
which strong ... | [
{
"created": "Wed, 16 Apr 2008 07:09:59 GMT",
"version": "v1"
}
] | 2008-04-17 | [
[
"Wojdyga",
"Aleksander",
""
]
] | This paper presents simple, syntactic strong normalization proofs for the simply-typed lambda-calculus and the polymorphic lambda-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The normalization proofs use translations of terms and types to systems, for which strong no... |
1810.12611 | Asifullah Khan | Aqsa Saeed Qureshi, Asifullah Khan | Adaptive Transfer Learning in Deep Neural Networks: Wind Power
Prediction using Knowledge Transfer from Region to Region and Between
Different Task Domains | 28 pages, 21 figures, and 11 tables | null | 10.1111/coin.12236 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transfer Learning (TL) in Deep Neural Networks is gaining importance because
in most of the applications, the labeling of data is costly and time-consuming.
Additionally, TL also provides an effective weight initialization strategy for
Deep Neural Networks . This paper introduces the idea of Adaptive Transfer
Learnin... | [
{
"created": "Tue, 30 Oct 2018 09:47:32 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Dec 2018 11:27:20 GMT",
"version": "v2"
}
] | 2019-08-20 | [
[
"Qureshi",
"Aqsa Saeed",
""
],
[
"Khan",
"Asifullah",
""
]
] | Transfer Learning (TL) in Deep Neural Networks is gaining importance because in most of the applications, the labeling of data is costly and time-consuming. Additionally, TL also provides an effective weight initialization strategy for Deep Neural Networks . This paper introduces the idea of Adaptive Transfer Learning ... |
2007.14896 | Anirudh Paranjothi | Anirudh Paranjothi, Mohammad S. Khan, Sherali Zeadally | Survey on Congestion Detection and Control in Connected Vehicles | null | null | 10.1016/j.adhoc.2020.102277 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dynamic nature of vehicular ad hoc network (VANET) induced by frequent
topology changes and node mobility, imposes critical challenges for vehicular
communications. Aggravated by the high volume of information dissemination
among vehicles over limited bandwidth, the topological dynamics of VANET causes
congestion... | [
{
"created": "Wed, 29 Jul 2020 15:13:31 GMT",
"version": "v1"
}
] | 2020-07-30 | [
[
"Paranjothi",
"Anirudh",
""
],
[
"Khan",
"Mohammad S.",
""
],
[
"Zeadally",
"Sherali",
""
]
] | The dynamic nature of vehicular ad hoc network (VANET) induced by frequent topology changes and node mobility, imposes critical challenges for vehicular communications. Aggravated by the high volume of information dissemination among vehicles over limited bandwidth, the topological dynamics of VANET causes congestion i... |
2004.09811 | Yuanxin Ye | Bai Zhu, Yuanxin Ye, Chao Yang, Liang Zhou, Huiyu Liu, Yungang Cao | Fast and Robust Registration of Aerial Images and LiDAR data Based on
Structrual Features and 3D Phase Correlation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Co-Registration of aerial imagery and Light Detection and Ranging (LiDAR)
data is quilt challenging because the different imaging mechanism causes
significant geometric and radiometric distortions between such data. To tackle
the problem, this paper proposes an automatic registration method based on
structural featur... | [
{
"created": "Tue, 21 Apr 2020 08:19:56 GMT",
"version": "v1"
}
] | 2020-04-22 | [
[
"Zhu",
"Bai",
""
],
[
"Ye",
"Yuanxin",
""
],
[
"Yang",
"Chao",
""
],
[
"Zhou",
"Liang",
""
],
[
"Liu",
"Huiyu",
""
],
[
"Cao",
"Yungang",
""
]
] | Co-Registration of aerial imagery and Light Detection and Ranging (LiDAR) data is quilt challenging because the different imaging mechanism causes significant geometric and radiometric distortions between such data. To tackle the problem, this paper proposes an automatic registration method based on structural features... |
2012.06279 | Oliver Struckmeier | Oliver Struckmeier, Kshitij Tiwari, Ville Kyrki | Autoencoding Slow Representations for Semi-supervised Data Efficient
Regression | 11 pages, 6 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The slowness principle is a concept inspired by the visual cortex of the
brain. It postulates that the underlying generative factors of a quickly
varying sensory signal change on a slower time scale. Unsupervised learning of
intermediate representations utilizing abundant unlabeled sensory data can be
leveraged to pe... | [
{
"created": "Fri, 11 Dec 2020 12:19:45 GMT",
"version": "v1"
},
{
"created": "Sun, 4 Jul 2021 18:43:55 GMT",
"version": "v2"
}
] | 2021-07-06 | [
[
"Struckmeier",
"Oliver",
""
],
[
"Tiwari",
"Kshitij",
""
],
[
"Kyrki",
"Ville",
""
]
] | The slowness principle is a concept inspired by the visual cortex of the brain. It postulates that the underlying generative factors of a quickly varying sensory signal change on a slower time scale. Unsupervised learning of intermediate representations utilizing abundant unlabeled sensory data can be leveraged to perf... |
2405.01306 | Zhenhan Huang | Zhenhan Huang, Tejaswini Pedapati, Pin-Yu Chen, Chunhen Jiang, Jianxi
Gao | Graph is all you need? Lightweight data-agnostic neural architecture
search without training | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Neural architecture search (NAS) enables the automatic design of neural
network models. However, training the candidates generated by the search
algorithm for performance evaluation incurs considerable computational
overhead. Our method, dubbed nasgraph, remarkably reduces the computational
costs by converting neural... | [
{
"created": "Thu, 2 May 2024 14:12:58 GMT",
"version": "v1"
}
] | 2024-05-03 | [
[
"Huang",
"Zhenhan",
""
],
[
"Pedapati",
"Tejaswini",
""
],
[
"Chen",
"Pin-Yu",
""
],
[
"Jiang",
"Chunhen",
""
],
[
"Gao",
"Jianxi",
""
]
] | Neural architecture search (NAS) enables the automatic design of neural network models. However, training the candidates generated by the search algorithm for performance evaluation incurs considerable computational overhead. Our method, dubbed nasgraph, remarkably reduces the computational costs by converting neural a... |
1910.06960 | Ahmed Alkhateeb | Yu Zhang, Muhammad Alrabeiah, and Ahmed Alkhateeb | Deep Learning for Massive MIMO with 1-Bit ADCs: When More Antennas Need
Fewer Pilots | Accepted in IEEE Wireless Communications Letters; 5 pages; 3 figures | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers uplink massive MIMO systems with 1-bit analog-to-digital
converters (ADCs) and develops a deep-learning based channel estimation
framework. In this framework, the prior channel estimation observations and
deep neural network models are leveraged to learn the non-trivial mapping from
quantized rec... | [
{
"created": "Tue, 15 Oct 2019 17:55:19 GMT",
"version": "v1"
},
{
"created": "Thu, 7 May 2020 23:21:32 GMT",
"version": "v2"
}
] | 2020-05-11 | [
[
"Zhang",
"Yu",
""
],
[
"Alrabeiah",
"Muhammad",
""
],
[
"Alkhateeb",
"Ahmed",
""
]
] | This paper considers uplink massive MIMO systems with 1-bit analog-to-digital converters (ADCs) and develops a deep-learning based channel estimation framework. In this framework, the prior channel estimation observations and deep neural network models are leveraged to learn the non-trivial mapping from quantized recei... |
2102.11127 | Xueli Yu | Xueli Yu, Weizhi Xu, Zeyu Cui, Shu Wu, Liang Wang | Graph-based Hierarchical Relevance Matching Signals for Ad-hoc Retrieval | To appear at WWW 2021 | null | 10.1145/3442381.3450115 | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | The ad-hoc retrieval task is to rank related documents given a query and a
document collection. A series of deep learning based approaches have been
proposed to solve such problem and gained lots of attention. However, we argue
that they are inherently based on local word sequences, ignoring the subtle
long-distance ... | [
{
"created": "Mon, 22 Feb 2021 15:57:08 GMT",
"version": "v1"
}
] | 2021-02-23 | [
[
"Yu",
"Xueli",
""
],
[
"Xu",
"Weizhi",
""
],
[
"Cui",
"Zeyu",
""
],
[
"Wu",
"Shu",
""
],
[
"Wang",
"Liang",
""
]
] | The ad-hoc retrieval task is to rank related documents given a query and a document collection. A series of deep learning based approaches have been proposed to solve such problem and gained lots of attention. However, we argue that they are inherently based on local word sequences, ignoring the subtle long-distance do... |
2404.01735 | Yunshan Ma | Yunshan Ma, Yingzhi He, Wenjun Zhong, Xiang Wang, Roger Zimmermann,
Tat-Seng Chua | CIRP: Cross-Item Relational Pre-training for Multimodal Product Bundling | arXiv preprint, 10 pages, 4 figures, 6 tables | null | null | null | cs.IR cs.MM | http://creativecommons.org/licenses/by/4.0/ | Product bundling has been a prevailing marketing strategy that is beneficial
in the online shopping scenario. Effective product bundling methods depend on
high-quality item representations, which need to capture both the individual
items' semantics and cross-item relations. However, previous item
representation learn... | [
{
"created": "Tue, 2 Apr 2024 08:50:55 GMT",
"version": "v1"
}
] | 2024-04-03 | [
[
"Ma",
"Yunshan",
""
],
[
"He",
"Yingzhi",
""
],
[
"Zhong",
"Wenjun",
""
],
[
"Wang",
"Xiang",
""
],
[
"Zimmermann",
"Roger",
""
],
[
"Chua",
"Tat-Seng",
""
]
] | Product bundling has been a prevailing marketing strategy that is beneficial in the online shopping scenario. Effective product bundling methods depend on high-quality item representations, which need to capture both the individual items' semantics and cross-item relations. However, previous item representation learnin... |
2406.08009 | Yinan Deng | Yinan Deng, Jiahui Wang, Jingyu Zhao, Jianyu Dou, Yi Yang, and Yufeng
Yue | OpenObj: Open-Vocabulary Object-Level Neural Radiance Fields with
Fine-Grained Understanding | 8 pages, 7figures. Project Url: https://openobj.github.io/ | null | null | null | cs.CV cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, there has been a surge of interest in open-vocabulary 3D
scene reconstruction facilitated by visual language models (VLMs), which
showcase remarkable capabilities in open-set retrieval. However, existing
methods face some limitations: they either focus on learning point-wise
features, resulting in bl... | [
{
"created": "Wed, 12 Jun 2024 08:59:33 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Deng",
"Yinan",
""
],
[
"Wang",
"Jiahui",
""
],
[
"Zhao",
"Jingyu",
""
],
[
"Dou",
"Jianyu",
""
],
[
"Yang",
"Yi",
""
],
[
"Yue",
"Yufeng",
""
]
] | In recent years, there has been a surge of interest in open-vocabulary 3D scene reconstruction facilitated by visual language models (VLMs), which showcase remarkable capabilities in open-set retrieval. However, existing methods face some limitations: they either focus on learning point-wise features, resulting in blur... |
2403.02227 | Yongzhao Wang | Ariyan Bighashdel, Yongzhao Wang, Stephen McAleer, Rahul Savani, Frans
A. Oliehoek | Policy Space Response Oracles: A Survey | Ariyan Bighashdel and Yongzhao Wang contributed equally | The 33rd International Joint Conference on Artificial
Intelligence, 2024 | null | null | cs.GT cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Game theory provides a mathematical way to study the interaction between
multiple decision makers. However, classical game-theoretic analysis is limited
in scalability due to the large number of strategies, precluding direct
application to more complex scenarios. This survey provides a comprehensive
overview of a fra... | [
{
"created": "Mon, 4 Mar 2024 17:15:09 GMT",
"version": "v1"
},
{
"created": "Mon, 27 May 2024 16:49:18 GMT",
"version": "v2"
}
] | 2024-05-28 | [
[
"Bighashdel",
"Ariyan",
""
],
[
"Wang",
"Yongzhao",
""
],
[
"McAleer",
"Stephen",
""
],
[
"Savani",
"Rahul",
""
],
[
"Oliehoek",
"Frans A.",
""
]
] | Game theory provides a mathematical way to study the interaction between multiple decision makers. However, classical game-theoretic analysis is limited in scalability due to the large number of strategies, precluding direct application to more complex scenarios. This survey provides a comprehensive overview of a frame... |
2110.04353 | Sheena Panthaplackel | Sheena Panthaplackel, Junyi Jessy Li, Milos Gligoric, Raymond J.
Mooney | Learning to Describe Solutions for Bug Reports Based on Developer
Discussions | Accepted in Findings of ACL 2022 | null | null | null | cs.CL cs.SE | http://creativecommons.org/licenses/by/4.0/ | When a software bug is reported, developers engage in a discussion to
collaboratively resolve it. While the solution is likely formulated within the
discussion, it is often buried in a large amount of text, making it difficult
to comprehend and delaying its implementation. To expedite bug resolution, we
propose gener... | [
{
"created": "Fri, 8 Oct 2021 19:39:55 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Mar 2022 17:56:43 GMT",
"version": "v2"
}
] | 2022-03-31 | [
[
"Panthaplackel",
"Sheena",
""
],
[
"Li",
"Junyi Jessy",
""
],
[
"Gligoric",
"Milos",
""
],
[
"Mooney",
"Raymond J.",
""
]
] | When a software bug is reported, developers engage in a discussion to collaboratively resolve it. While the solution is likely formulated within the discussion, it is often buried in a large amount of text, making it difficult to comprehend and delaying its implementation. To expedite bug resolution, we propose generat... |
cs/9905006 | Stephen F. Bush | Stephen F. Bush | The Design and Analysis of Virtual Network Configuration for a Wireless
Mobile ATM Network | PhD Thesis | null | null | null | cs.NI | null | This research concentrates on the design and analysis of an algorithm
referred to as Virtual Network Configuration (VNC) which uses predicted future
states of a system for faster network configuration and management. VNC is
applied to the configuration of a wireless mobile ATM network. VNC is built on
techniques from... | [
{
"created": "Tue, 11 May 1999 20:05:36 GMT",
"version": "v1"
}
] | 2009-09-25 | [
[
"Bush",
"Stephen F.",
""
]
] | This research concentrates on the design and analysis of an algorithm referred to as Virtual Network Configuration (VNC) which uses predicted future states of a system for faster network configuration and management. VNC is applied to the configuration of a wireless mobile ATM network. VNC is built on techniques from p... |
1912.05723 | Karthikeyan K | Karthikeyan K, Shubham Kumar Bharti, Piyush Rai | On the relationship between multitask neural networks and multitask
Gaussian Processes | 19 pages, 4 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the effectiveness of multitask deep neural network (MTDNN), there is
a limited theoretical understanding on how the information is shared across
different tasks in MTDNN. In this work, we establish a formal connection
between MTDNN with infinitely-wide hidden layers and multitask Gaussian Process
(GP). We der... | [
{
"created": "Thu, 12 Dec 2019 01:51:35 GMT",
"version": "v1"
}
] | 2019-12-13 | [
[
"K",
"Karthikeyan",
""
],
[
"Bharti",
"Shubham Kumar",
""
],
[
"Rai",
"Piyush",
""
]
] | Despite the effectiveness of multitask deep neural network (MTDNN), there is a limited theoretical understanding on how the information is shared across different tasks in MTDNN. In this work, we establish a formal connection between MTDNN with infinitely-wide hidden layers and multitask Gaussian Process (GP). We deriv... |
2403.01596 | Morteza Sadeghi | Morteza Sadeghi, Abdolreza Torabi | Optimizing Near Field Computation in the MLFMA Algorithm with Data
Redundancy and Performance Modeling on a Single GPU | null | null | null | null | cs.DC cs.PF physics.comp-ph | http://creativecommons.org/licenses/by/4.0/ | The Multilevel Fast Multipole Algorithm (MLFMA) has known applications in
scientific modeling in the fields of telecommunications, physics, mechanics,
and chemistry. Accelerating calculation of far-field using GPUs and GPU
clusters for large-scale problems has been studied for more than a decade. The
acceleration of ... | [
{
"created": "Sun, 3 Mar 2024 19:33:44 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Sadeghi",
"Morteza",
""
],
[
"Torabi",
"Abdolreza",
""
]
] | The Multilevel Fast Multipole Algorithm (MLFMA) has known applications in scientific modeling in the fields of telecommunications, physics, mechanics, and chemistry. Accelerating calculation of far-field using GPUs and GPU clusters for large-scale problems has been studied for more than a decade. The acceleration of th... |
2002.08992 | Lu\'is Felipe Ign\'acio Cunha Cunha | Alexandre Abreu, Lu\'is Cunha, Celina de Figueiredo, Franklin
Marquezino, Daniel Posner, Renato Portugal | Total tessellation cover and quantum walk | null | null | null | null | cs.DM cs.CC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose the total staggered quantum walk model and the total tessellation
cover of a graph. This model uses the concept of total tessellation cover to
describe the motion of the walker who is allowed to hop both to vertices and
edges of the graph, in contrast with previous models in which the walker hops
either to... | [
{
"created": "Thu, 20 Feb 2020 19:53:35 GMT",
"version": "v1"
}
] | 2020-02-24 | [
[
"Abreu",
"Alexandre",
""
],
[
"Cunha",
"Luís",
""
],
[
"de Figueiredo",
"Celina",
""
],
[
"Marquezino",
"Franklin",
""
],
[
"Posner",
"Daniel",
""
],
[
"Portugal",
"Renato",
""
]
] | We propose the total staggered quantum walk model and the total tessellation cover of a graph. This model uses the concept of total tessellation cover to describe the motion of the walker who is allowed to hop both to vertices and edges of the graph, in contrast with previous models in which the walker hops either to v... |
1511.06385 | Chunchuan Lv Mr. | Chunchuan Lyu, Kaizhu Huang, Hai-Ning Liang | A Unified Gradient Regularization Family for Adversarial Examples | The paper has been presented at ICDM 2015 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adversarial examples are augmented data points generated by imperceptible
perturbation of input samples. They have recently drawn much attention with the
machine learning and data mining community. Being difficult to distinguish from
real examples, such adversarial examples could change the prediction of many of
the ... | [
{
"created": "Thu, 19 Nov 2015 21:14:43 GMT",
"version": "v1"
}
] | 2016-03-03 | [
[
"Lyu",
"Chunchuan",
""
],
[
"Huang",
"Kaizhu",
""
],
[
"Liang",
"Hai-Ning",
""
]
] | Adversarial examples are augmented data points generated by imperceptible perturbation of input samples. They have recently drawn much attention with the machine learning and data mining community. Being difficult to distinguish from real examples, such adversarial examples could change the prediction of many of the be... |
1705.02828 | Thijs Laarhoven | Thijs Laarhoven | Faster tuple lattice sieving using spherical locality-sensitive filters | 12 pages + references, 2 figures. Subsumed/merged into Cryptology
ePrint Archive 2017/228, available at https://ia.cr/2017/1228 | null | null | null | cs.DS cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To overcome the large memory requirement of classical lattice sieving
algorithms for solving hard lattice problems, Bai-Laarhoven-Stehl\'{e} [ANTS
2016] studied tuple lattice sieving, where tuples instead of pairs of lattice
vectors are combined to form shorter vectors. Herold-Kirshanova [PKC 2017]
recently improved ... | [
{
"created": "Mon, 8 May 2017 11:24:10 GMT",
"version": "v1"
},
{
"created": "Fri, 23 Feb 2018 14:13:35 GMT",
"version": "v2"
}
] | 2018-02-26 | [
[
"Laarhoven",
"Thijs",
""
]
] | To overcome the large memory requirement of classical lattice sieving algorithms for solving hard lattice problems, Bai-Laarhoven-Stehl\'{e} [ANTS 2016] studied tuple lattice sieving, where tuples instead of pairs of lattice vectors are combined to form shorter vectors. Herold-Kirshanova [PKC 2017] recently improved up... |
2303.15768 | Jaeseong Lee | Jaeseong Lee, Taewoo Kim, Sunghyun Park, Younggun Lee, Jaegul Choo | RobustSwap: A Simple yet Robust Face Swapping Model against Attribute
Leakage | 21 pages | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Face swapping aims at injecting a source image's identity (i.e., facial
features) into a target image, while strictly preserving the target's
attributes, which are irrelevant to identity. However, we observed that
previous approaches still suffer from source attribute leakage, where the
source image's attributes inte... | [
{
"created": "Tue, 28 Mar 2023 07:03:31 GMT",
"version": "v1"
}
] | 2023-03-29 | [
[
"Lee",
"Jaeseong",
""
],
[
"Kim",
"Taewoo",
""
],
[
"Park",
"Sunghyun",
""
],
[
"Lee",
"Younggun",
""
],
[
"Choo",
"Jaegul",
""
]
] | Face swapping aims at injecting a source image's identity (i.e., facial features) into a target image, while strictly preserving the target's attributes, which are irrelevant to identity. However, we observed that previous approaches still suffer from source attribute leakage, where the source image's attributes interf... |
2211.06319 | Marek Kwiek | Marek Kwiek and Wojciech Roszka | The Young and the Old, the Fast and the Slow: A Large-Scale Study of
Productivity Classes and Rank Advancement | 16 pages, 2 tables, 4 figures. There is an Online Supplementary
Material here:
https://www.tandfonline.com/doi/full/10.1080/03075079.2023.2288172 | Studies in Higher Education | 10.1080/03075079.2023.2288172 | null | cs.CY cs.DL | http://creativecommons.org/licenses/by/4.0/ | We examined a large population of Polish science, technology, engineering,
mathematics and medicine (STEMM) scientists (N = 16,083) to study rank
advancement and productivity. We used two previously neglected time dimensions
- promotion age and promotion speed - to construct individual biographical
profiles and publi... | [
{
"created": "Thu, 3 Nov 2022 11:40:18 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Nov 2023 10:06:35 GMT",
"version": "v2"
},
{
"created": "Sat, 9 Dec 2023 11:46:49 GMT",
"version": "v3"
}
] | 2023-12-19 | [
[
"Kwiek",
"Marek",
""
],
[
"Roszka",
"Wojciech",
""
]
] | We examined a large population of Polish science, technology, engineering, mathematics and medicine (STEMM) scientists (N = 16,083) to study rank advancement and productivity. We used two previously neglected time dimensions - promotion age and promotion speed - to construct individual biographical profiles and publica... |
2210.09693 | Chaoli Zhang | Chaoli Zhang and Tian Zhou and Qingsong Wen and Liang Sun | TFAD: A Decomposition Time Series Anomaly Detection Architecture with
Time-Frequency Analysis | Accepted by the ACM International Conference on Information and
Knowledge Management (CIKM 2022) | CIKM 2022 | 10.1145/3511808.3557470 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time series anomaly detection is a challenging problem due to the complex
temporal dependencies and the limited label data. Although some algorithms
including both traditional and deep models have been proposed, most of them
mainly focus on time-domain modeling, and do not fully utilize the information
in the frequen... | [
{
"created": "Tue, 18 Oct 2022 09:08:57 GMT",
"version": "v1"
},
{
"created": "Sat, 25 Mar 2023 06:26:36 GMT",
"version": "v2"
}
] | 2023-03-28 | [
[
"Zhang",
"Chaoli",
""
],
[
"Zhou",
"Tian",
""
],
[
"Wen",
"Qingsong",
""
],
[
"Sun",
"Liang",
""
]
] | Time series anomaly detection is a challenging problem due to the complex temporal dependencies and the limited label data. Although some algorithms including both traditional and deep models have been proposed, most of them mainly focus on time-domain modeling, and do not fully utilize the information in the frequency... |
1907.03956 | Changjoo Nam | Changjoo Nam, Jinhwi Lee, Younggil Cho, Jeongho Lee, Dong Hwan Kim,
ChangHwan Kim | Planning for target retrieval using a robotic manipulator in cluttered
and occluded environments | 8 pages, 14 figures | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents planning algorithms for a robotic manipulator with a
fixed base in order to grasp a target object in cluttered environments. We
consider a configuration of objects in a confined space with a high density so
no collision-free path to the target exists. The robot must relocate some
objects to retrie... | [
{
"created": "Tue, 9 Jul 2019 03:18:51 GMT",
"version": "v1"
}
] | 2022-02-09 | [
[
"Nam",
"Changjoo",
""
],
[
"Lee",
"Jinhwi",
""
],
[
"Cho",
"Younggil",
""
],
[
"Lee",
"Jeongho",
""
],
[
"Kim",
"Dong Hwan",
""
],
[
"Kim",
"ChangHwan",
""
]
] | This paper presents planning algorithms for a robotic manipulator with a fixed base in order to grasp a target object in cluttered environments. We consider a configuration of objects in a confined space with a high density so no collision-free path to the target exists. The robot must relocate some objects to retrieve... |
2002.05651 | Peter Henderson | Peter Henderson, Jieru Hu, Joshua Romoff, Emma Brunskill, Dan
Jurafsky, Joelle Pineau | Towards the Systematic Reporting of the Energy and Carbon Footprints of
Machine Learning | Published in JMLR: https://jmlr.org/papers/v21/20-312.html | null | null | null | cs.CY cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Accurate reporting of energy and carbon usage is essential for understanding
the potential climate impacts of machine learning research. We introduce a
framework that makes this easier by providing a simple interface for tracking
realtime energy consumption and carbon emissions, as well as generating
standardized onl... | [
{
"created": "Fri, 31 Jan 2020 05:12:59 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Nov 2022 08:53:47 GMT",
"version": "v2"
}
] | 2022-11-30 | [
[
"Henderson",
"Peter",
""
],
[
"Hu",
"Jieru",
""
],
[
"Romoff",
"Joshua",
""
],
[
"Brunskill",
"Emma",
""
],
[
"Jurafsky",
"Dan",
""
],
[
"Pineau",
"Joelle",
""
]
] | Accurate reporting of energy and carbon usage is essential for understanding the potential climate impacts of machine learning research. We introduce a framework that makes this easier by providing a simple interface for tracking realtime energy consumption and carbon emissions, as well as generating standardized onlin... |
2307.08974 | Giovanni Cacciamani | Giovanni E. Cacciamani, Michael B. Eppler, Conner Ganjavi, Asli Pekan,
Brett Biedermann, Gary S. Collins, Inderbir S. Gill | Development of the ChatGPT, Generative Artificial Intelligence and
Natural Large Language Models for Accountable Reporting and Use (CANGARU)
Guidelines | 20 pages, 1 figure, protocol | null | null | up-23-00306 | cs.AI cs.CY | http://creativecommons.org/licenses/by/4.0/ | The swift progress and ubiquitous adoption of Generative AI (GAI), Generative
Pre-trained Transformers (GPTs), and large language models (LLMs) like ChatGPT,
have spurred queries about their ethical application, use, and disclosure in
scholarly research and scientific productions. A few publishers and journals
have r... | [
{
"created": "Tue, 18 Jul 2023 05:12:52 GMT",
"version": "v1"
}
] | 2023-07-19 | [
[
"Cacciamani",
"Giovanni E.",
""
],
[
"Eppler",
"Michael B.",
""
],
[
"Ganjavi",
"Conner",
""
],
[
"Pekan",
"Asli",
""
],
[
"Biedermann",
"Brett",
""
],
[
"Collins",
"Gary S.",
""
],
[
"Gill",
"Inderbir S.",
... | The swift progress and ubiquitous adoption of Generative AI (GAI), Generative Pre-trained Transformers (GPTs), and large language models (LLMs) like ChatGPT, have spurred queries about their ethical application, use, and disclosure in scholarly research and scientific productions. A few publishers and journals have rec... |
2111.09872 | Dimitrios Miltiadou | Dimitrios Miltiadou (1), Stamatis Pitsios (1), Dimitrios Spyropoulos
(1), Dimitrios Alexandrou (1), Fenareti Lampathaki (2), Domenico Messina (3),
Konstantinos Perakis (1) ((1) UBITECH, (2) Suite5, (3) ENGINEERING Ingegneria
Informatica S.p.A.) | A big data intelligence marketplace and secure analytics experimentation
platform for the aviation industry | null | LNICST (2021), volume 371, pp 48-62 | 10.1007/978-3-030-72802-1_4 | null | cs.CR cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The unprecedented volume, diversity and richness of aviation data that can be
acquired, generated, stored, and managed provides unique capabilities for the
aviation-related industries and pertains value that remains to be unlocked with
the adoption of the innovative Big Data Analytics technologies. Despite the
large ... | [
{
"created": "Thu, 18 Nov 2021 18:51:40 GMT",
"version": "v1"
}
] | 2021-11-19 | [
[
"Miltiadou",
"Dimitrios",
""
],
[
"Pitsios",
"Stamatis",
""
],
[
"Spyropoulos",
"Dimitrios",
""
],
[
"Alexandrou",
"Dimitrios",
""
],
[
"Lampathaki",
"Fenareti",
""
],
[
"Messina",
"Domenico",
""
],
[
"Perakis",
... | The unprecedented volume, diversity and richness of aviation data that can be acquired, generated, stored, and managed provides unique capabilities for the aviation-related industries and pertains value that remains to be unlocked with the adoption of the innovative Big Data Analytics technologies. Despite the large ef... |
2312.14980 | Changhoon Lee | Jun Park and Changhoon Lee | TPTNet: A Data-Driven Temperature Prediction Model Based on Turbulent
Potential Temperature | null | null | null | null | cs.LG physics.ao-ph physics.flu-dyn | http://creativecommons.org/licenses/by/4.0/ | A data-driven model for predicting the surface temperature using neural
networks was proposed to alleviate the computational burden of numerical
weather prediction (NWP). Our model, named TPTNet uses only 2m temperature
measured at the weather stations of the South Korean Peninsula as input to
predict the local tempe... | [
{
"created": "Fri, 22 Dec 2023 01:02:27 GMT",
"version": "v1"
}
] | 2023-12-27 | [
[
"Park",
"Jun",
""
],
[
"Lee",
"Changhoon",
""
]
] | A data-driven model for predicting the surface temperature using neural networks was proposed to alleviate the computational burden of numerical weather prediction (NWP). Our model, named TPTNet uses only 2m temperature measured at the weather stations of the South Korean Peninsula as input to predict the local tempera... |
2103.16553 | Antoine Miech | Antoine Miech, Jean-Baptiste Alayrac, Ivan Laptev, Josef Sivic, Andrew
Zisserman | Thinking Fast and Slow: Efficient Text-to-Visual Retrieval with
Transformers | Accepted to CVPR 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Our objective is language-based search of large-scale image and video
datasets. For this task, the approach that consists of independently mapping
text and vision to a joint embedding space, a.k.a. dual encoders, is attractive
as retrieval scales and is efficient for billions of images using approximate
nearest neigh... | [
{
"created": "Tue, 30 Mar 2021 17:57:08 GMT",
"version": "v1"
}
] | 2021-03-31 | [
[
"Miech",
"Antoine",
""
],
[
"Alayrac",
"Jean-Baptiste",
""
],
[
"Laptev",
"Ivan",
""
],
[
"Sivic",
"Josef",
""
],
[
"Zisserman",
"Andrew",
""
]
] | Our objective is language-based search of large-scale image and video datasets. For this task, the approach that consists of independently mapping text and vision to a joint embedding space, a.k.a. dual encoders, is attractive as retrieval scales and is efficient for billions of images using approximate nearest neighbo... |
2204.05490 | Le Yu | Le Yu, Zihang Liu, Leilei Sun, Bowen Du, Chuanren Liu, Weifeng Lv | Continuous-Time User Preference Modelling for Temporal Sets Prediction | Accepted by the TKDE journal | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a sequence of sets, where each set has a timestamp and contains an
arbitrary number of elements, temporal sets prediction aims to predict the
elements in the subsequent set. Previous studies for temporal sets prediction
mainly focus on the modelling of elements and implicitly represent each user's
preference ba... | [
{
"created": "Tue, 12 Apr 2022 02:49:27 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Apr 2022 03:06:27 GMT",
"version": "v2"
},
{
"created": "Thu, 14 Apr 2022 09:53:13 GMT",
"version": "v3"
},
{
"created": "Fri, 17 Jun 2022 13:03:46 GMT",
"version": "v4"
},
{
"c... | 2023-08-29 | [
[
"Yu",
"Le",
""
],
[
"Liu",
"Zihang",
""
],
[
"Sun",
"Leilei",
""
],
[
"Du",
"Bowen",
""
],
[
"Liu",
"Chuanren",
""
],
[
"Lv",
"Weifeng",
""
]
] | Given a sequence of sets, where each set has a timestamp and contains an arbitrary number of elements, temporal sets prediction aims to predict the elements in the subsequent set. Previous studies for temporal sets prediction mainly focus on the modelling of elements and implicitly represent each user's preference base... |
2310.08876 | Maximilian Strobel | Maximilian Strobel, Stephan Schoenfeldt, Jonas Daugalas | Gesture Recognition for FMCW Radar on the Edge | 4 pages, 5 figures, accepted in 2024 IEEE Topical Conference on
Wireless Sensors and Sensor Networks (WiSNeT) | 2024 IEEE Topical Conference on Wireless Sensors and Sensor
Networks (WiSNeT), San Antonio, TX, USA, 2024, pp. 45-48 | 10.1109/WiSNeT59910.2024.10438579 | null | cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a lightweight gesture recognition system based on 60
GHz frequency modulated continuous wave (FMCW) radar. We show that gestures can
be characterized efficiently by a set of five features, and propose a slim
radar processing algorithm to extract these features. In contrast to previous
approaches... | [
{
"created": "Fri, 13 Oct 2023 06:03:07 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Jan 2024 04:17:09 GMT",
"version": "v2"
}
] | 2024-02-29 | [
[
"Strobel",
"Maximilian",
""
],
[
"Schoenfeldt",
"Stephan",
""
],
[
"Daugalas",
"Jonas",
""
]
] | This paper introduces a lightweight gesture recognition system based on 60 GHz frequency modulated continuous wave (FMCW) radar. We show that gestures can be characterized efficiently by a set of five features, and propose a slim radar processing algorithm to extract these features. In contrast to previous approaches, ... |
1702.02130 | Delia Fano Yela | Delia Fano Yela, Sebastian Ewert, Derry FitzGerald, Mark Sandler | On the Importance of Temporal Context in Proximity Kernels: A Vocal
Separation Case Study | 2017 AES International Conference on Semantic Audio | Proceedings of the AES International Conference on Semantic Audio,
Erlangen, Germany, pp. 13-20, 2017 | null | null | cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Musical source separation methods exploit source-specific spectral
characteristics to facilitate the decomposition process. Kernel Additive
Modelling (KAM) models a source applying robust statistics to time-frequency
bins as specified by a source-specific kernel, a function defining similarity
between bins. Kernels i... | [
{
"created": "Tue, 7 Feb 2017 18:41:31 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Apr 2017 12:23:37 GMT",
"version": "v2"
}
] | 2017-11-01 | [
[
"Yela",
"Delia Fano",
""
],
[
"Ewert",
"Sebastian",
""
],
[
"FitzGerald",
"Derry",
""
],
[
"Sandler",
"Mark",
""
]
] | Musical source separation methods exploit source-specific spectral characteristics to facilitate the decomposition process. Kernel Additive Modelling (KAM) models a source applying robust statistics to time-frequency bins as specified by a source-specific kernel, a function defining similarity between bins. Kernels in ... |
1111.6084 | Gianvito Summa | Angela Bonifati, Gianvito Summa, Esther Pacitti, Fady Draidi | Semantic Query Reformulation in Social PDMS | 29 pages, 8 figures, query rewriting in PDMS | null | null | null | cs.DB cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider social peer-to-peer data management systems (PDMS), where each
peer maintains both semantic mappings between its schema and some
acquaintances, and social links with peer friends. In this context,
reformulating a query from a peer's schema into other peer's schemas is a hard
problem, as it may generate as... | [
{
"created": "Fri, 25 Nov 2011 19:02:10 GMT",
"version": "v1"
}
] | 2011-11-28 | [
[
"Bonifati",
"Angela",
""
],
[
"Summa",
"Gianvito",
""
],
[
"Pacitti",
"Esther",
""
],
[
"Draidi",
"Fady",
""
]
] | We consider social peer-to-peer data management systems (PDMS), where each peer maintains both semantic mappings between its schema and some acquaintances, and social links with peer friends. In this context, reformulating a query from a peer's schema into other peer's schemas is a hard problem, as it may generate as m... |
2006.13022 | Feng Liu | Li Zhong, Zhen Fang, Feng Liu, Bo Yuan, Guangquan Zhang, Jie Lu | Bridging the Theoretical Bound and Deep Algorithms for Open Set Domain
Adaptation | null | null | null | null | cs.LG cs.CV stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In the unsupervised open set domain adaptation (UOSDA), the target domain
contains unknown classes that are not observed in the source domain.
Researchers in this area aim to train a classifier to accurately: 1) recognize
unknown target data (data with unknown classes) and, 2) classify other target
data. To achieve t... | [
{
"created": "Tue, 23 Jun 2020 14:01:06 GMT",
"version": "v1"
}
] | 2020-06-24 | [
[
"Zhong",
"Li",
""
],
[
"Fang",
"Zhen",
""
],
[
"Liu",
"Feng",
""
],
[
"Yuan",
"Bo",
""
],
[
"Zhang",
"Guangquan",
""
],
[
"Lu",
"Jie",
""
]
] | In the unsupervised open set domain adaptation (UOSDA), the target domain contains unknown classes that are not observed in the source domain. Researchers in this area aim to train a classifier to accurately: 1) recognize unknown target data (data with unknown classes) and, 2) classify other target data. To achieve thi... |
2108.13465 | Bo Li | Bo Li, Xinyang Jiang, Donglin Bai, Yuge Zhang, Ningxin Zheng, Xuanyi
Dong, Lu Liu, Yuqing Yang, Dongsheng Li | Full-Cycle Energy Consumption Benchmark for Low-Carbon Computer Vision | ArXiv Preprint | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | The energy consumption of deep learning models is increasing at a
breathtaking rate, which raises concerns due to potential negative effects on
carbon neutrality in the context of global warming and climate change. With the
progress of efficient deep learning techniques, e.g., model compression,
researchers can obtai... | [
{
"created": "Mon, 30 Aug 2021 18:22:36 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Oct 2021 02:23:42 GMT",
"version": "v2"
}
] | 2021-10-13 | [
[
"Li",
"Bo",
""
],
[
"Jiang",
"Xinyang",
""
],
[
"Bai",
"Donglin",
""
],
[
"Zhang",
"Yuge",
""
],
[
"Zheng",
"Ningxin",
""
],
[
"Dong",
"Xuanyi",
""
],
[
"Liu",
"Lu",
""
],
[
"Yang",
"Yuqing",
... | The energy consumption of deep learning models is increasing at a breathtaking rate, which raises concerns due to potential negative effects on carbon neutrality in the context of global warming and climate change. With the progress of efficient deep learning techniques, e.g., model compression, researchers can obtain ... |
2301.03944 | Yunbo Lyu | Yunbo Lyu, Thanh Le-Cong, Hong Jin Kang, Ratnadira Widyasari, Zhipeng
Zhao, Xuan-Bach D. Le, Ming Li, David Lo | CHRONOS: Time-Aware Zero-Shot Identification of Libraries from
Vulnerability Reports | Accepted to the Technical Track of ICSE 2023 | null | null | null | cs.SE cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tools that alert developers about library vulnerabilities depend on accurate,
up-to-date vulnerability databases which are maintained by security
researchers. These databases record the libraries related to each
vulnerability. However, the vulnerability reports may not explicitly list every
library and human analysis... | [
{
"created": "Tue, 10 Jan 2023 12:57:10 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Feb 2023 12:48:51 GMT",
"version": "v2"
},
{
"created": "Tue, 14 Mar 2023 07:29:49 GMT",
"version": "v3"
},
{
"created": "Sat, 29 Jul 2023 04:33:44 GMT",
"version": "v4"
}
] | 2023-08-01 | [
[
"Lyu",
"Yunbo",
""
],
[
"Le-Cong",
"Thanh",
""
],
[
"Kang",
"Hong Jin",
""
],
[
"Widyasari",
"Ratnadira",
""
],
[
"Zhao",
"Zhipeng",
""
],
[
"Le",
"Xuan-Bach D.",
""
],
[
"Li",
"Ming",
""
],
[
"Lo",... | Tools that alert developers about library vulnerabilities depend on accurate, up-to-date vulnerability databases which are maintained by security researchers. These databases record the libraries related to each vulnerability. However, the vulnerability reports may not explicitly list every library and human analysis i... |
2302.10512 | Pengxiang Jin | Shenglin Zhang, Pengxiang Jin, Zihan Lin, Yongqian Sun, Bicheng Zhang,
Sibo Xia, Zhengdan Li, Zhenyu Zhong, Minghua Ma, Wa Jin, Dai Zhang, Zhenyu
Zhu, Dan Pei | Robust Failure Diagnosis of Microservice System through Multimodal Data | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Automatic failure diagnosis is crucial for large microservice systems.
Currently, most failure diagnosis methods rely solely on single-modal data
(i.e., using either metrics, logs, or traces). In this study, we conduct an
empirical study using real-world failure cases to show that combining these
sources of data (mul... | [
{
"created": "Tue, 21 Feb 2023 08:28:28 GMT",
"version": "v1"
},
{
"created": "Wed, 31 May 2023 14:53:17 GMT",
"version": "v2"
}
] | 2023-06-01 | [
[
"Zhang",
"Shenglin",
""
],
[
"Jin",
"Pengxiang",
""
],
[
"Lin",
"Zihan",
""
],
[
"Sun",
"Yongqian",
""
],
[
"Zhang",
"Bicheng",
""
],
[
"Xia",
"Sibo",
""
],
[
"Li",
"Zhengdan",
""
],
[
"Zhong",
... | Automatic failure diagnosis is crucial for large microservice systems. Currently, most failure diagnosis methods rely solely on single-modal data (i.e., using either metrics, logs, or traces). In this study, we conduct an empirical study using real-world failure cases to show that combining these sources of data (multi... |
1407.3969 | Anna Maria Massone | Giorgio Ricca, Mauro C. Beltrametti, Anna Maria Massone | An iterative approach to Hough transform without re-voting | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many bone shapes in the human skeleton are characterized by profiles that can
be associated to equations of algebraic curves. Fixing the parameters in the
curve equation, by means of a classical pattern recognition procedure like the
Hough transform technique, it is then possible to associate an equation to a
specifi... | [
{
"created": "Tue, 15 Jul 2014 12:56:35 GMT",
"version": "v1"
}
] | 2014-07-16 | [
[
"Ricca",
"Giorgio",
""
],
[
"Beltrametti",
"Mauro C.",
""
],
[
"Massone",
"Anna Maria",
""
]
] | Many bone shapes in the human skeleton are characterized by profiles that can be associated to equations of algebraic curves. Fixing the parameters in the curve equation, by means of a classical pattern recognition procedure like the Hough transform technique, it is then possible to associate an equation to a specific ... |
2112.10727 | Li Duan | Li Duan, Lewis Boyd, Gerardo Aragon-Camarasa | Learning Physics Properties of Fabrics and Garments with a Physics
Similarity Neural Network | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose to predict the physics parameters of real fabrics
and garments by learning their physics similarities between simulated fabrics
via a Physics Similarity Network (PhySNet). For this, we estimate wind speeds
generated by an electric fan and the area weight to predict bending stiffness
of simul... | [
{
"created": "Mon, 20 Dec 2021 18:19:12 GMT",
"version": "v1"
}
] | 2021-12-21 | [
[
"Duan",
"Li",
""
],
[
"Boyd",
"Lewis",
""
],
[
"Aragon-Camarasa",
"Gerardo",
""
]
] | In this paper, we propose to predict the physics parameters of real fabrics and garments by learning their physics similarities between simulated fabrics via a Physics Similarity Network (PhySNet). For this, we estimate wind speeds generated by an electric fan and the area weight to predict bending stiffness of simulat... |
2108.04751 | Jean-Claude Belfiore | Jean-Claude Belfiore, Daniel Bennequin and Xavier Giraud | Logical Information Cells I | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | In this study we explore the spontaneous apparition of visible intelligible
reasoning in simple artificial networks, and we connect this experimental
observation with a notion of semantic information. We start with the
reproduction of a DNN model of natural neurons in monkeys, studied by
Neromyliotis and Moschovakis ... | [
{
"created": "Tue, 10 Aug 2021 15:31:26 GMT",
"version": "v1"
}
] | 2021-08-11 | [
[
"Belfiore",
"Jean-Claude",
""
],
[
"Bennequin",
"Daniel",
""
],
[
"Giraud",
"Xavier",
""
]
] | In this study we explore the spontaneous apparition of visible intelligible reasoning in simple artificial networks, and we connect this experimental observation with a notion of semantic information. We start with the reproduction of a DNN model of natural neurons in monkeys, studied by Neromyliotis and Moschovakis in... |
1811.04752 | Brandon Malone | Brandon Malone, Alberto Garcia-Duran, and Mathias Niepert | Learning Representations of Missing Data for Predicting Patient Outcomes | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extracting actionable insight from Electronic Health Records (EHRs) poses
several challenges for traditional machine learning approaches. Patients are
often missing data relative to each other; the data comes in a variety of
modalities, such as multivariate time series, free text, and categorical
demographic informat... | [
{
"created": "Mon, 12 Nov 2018 14:51:41 GMT",
"version": "v1"
}
] | 2018-11-13 | [
[
"Malone",
"Brandon",
""
],
[
"Garcia-Duran",
"Alberto",
""
],
[
"Niepert",
"Mathias",
""
]
] | Extracting actionable insight from Electronic Health Records (EHRs) poses several challenges for traditional machine learning approaches. Patients are often missing data relative to each other; the data comes in a variety of modalities, such as multivariate time series, free text, and categorical demographic informatio... |
2105.03109 | Marius Hobbhahn | Marius Hobbhahn, Philipp Hennig | Laplace Matching for fast Approximate Inference in Latent Gaussian
Models | Added experiments and clarifications; Currently under review at JMLR | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Bayesian inference on non-Gaussian data is often non-analytic and requires
computationally expensive approximations such as sampling or variational
inference. We propose an approximate inference framework primarily designed to
be computationally cheap while still achieving high approximation quality. The
concept, whi... | [
{
"created": "Fri, 7 May 2021 08:25:17 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Oct 2022 10:20:07 GMT",
"version": "v2"
}
] | 2022-10-12 | [
[
"Hobbhahn",
"Marius",
""
],
[
"Hennig",
"Philipp",
""
]
] | Bayesian inference on non-Gaussian data is often non-analytic and requires computationally expensive approximations such as sampling or variational inference. We propose an approximate inference framework primarily designed to be computationally cheap while still achieving high approximation quality. The concept, which... |
2205.11472 | Benjamin Schiller | Benjamin Schiller, Johannes Daxenberger, Iryna Gurevych | Diversity Over Size: On the Effect of Sample and Topic Sizes for
Argument Mining Datasets | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The task of Argument Mining, that is extracting argumentative sentences for a
specific topic from large document sources, is an inherently difficult task for
machine learning models and humans alike, as large Argument Mining datasets are
rare and recognition of argumentative sentences requires expert knowledge. The
t... | [
{
"created": "Mon, 23 May 2022 17:14:32 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Jul 2023 14:39:15 GMT",
"version": "v2"
}
] | 2023-07-18 | [
[
"Schiller",
"Benjamin",
""
],
[
"Daxenberger",
"Johannes",
""
],
[
"Gurevych",
"Iryna",
""
]
] | The task of Argument Mining, that is extracting argumentative sentences for a specific topic from large document sources, is an inherently difficult task for machine learning models and humans alike, as large Argument Mining datasets are rare and recognition of argumentative sentences requires expert knowledge. The tas... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.