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
1412.8339
Charith Perera
Charith Perera, Rajiv Ranjan, Lizhe Wang, Samee U. Khan, and Albert Y. Zomaya
Big Data Privacy in the Internet of Things Era
Accepted to be published in IEEE IT Professional Magazine: Special Issue Internet of Anything 2015
null
10.1109/MITP.2015.34
null
cs.CY cs.DB cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Over the last few years, we have seen a plethora of Internet of Things (IoT) solutions, products and services, making their way into the industry's market-place. All such solution will capture a large amount of data pertaining to the environment, as well as their users. The objective of the IoT is to learn more and t...
[ { "created": "Mon, 29 Dec 2014 13:45:13 GMT", "version": "v1" }, { "created": "Mon, 8 Jun 2015 09:18:53 GMT", "version": "v2" } ]
2016-11-17
[ [ "Perera", "Charith", "" ], [ "Ranjan", "Rajiv", "" ], [ "Wang", "Lizhe", "" ], [ "Khan", "Samee U.", "" ], [ "Zomaya", "Albert Y.", "" ] ]
Over the last few years, we have seen a plethora of Internet of Things (IoT) solutions, products and services, making their way into the industry's market-place. All such solution will capture a large amount of data pertaining to the environment, as well as their users. The objective of the IoT is to learn more and to ...
2301.00252
Keke Chen
Sagar Sharma and Yuechun Gu and Keke Chen
A Comparative Study of Image Disguising Methods for Confidential Outsourced Learning
null
null
null
null
cs.CR cs.LG
http://creativecommons.org/licenses/by-nc-nd/4.0/
Large training data and expensive model tweaking are standard features of deep learning for images. As a result, data owners often utilize cloud resources to develop large-scale complex models, which raises privacy concerns. Existing solutions are either too expensive to be practical or do not sufficiently protect th...
[ { "created": "Sat, 31 Dec 2022 16:59:54 GMT", "version": "v1" } ]
2023-01-03
[ [ "Sharma", "Sagar", "" ], [ "Gu", "Yuechun", "" ], [ "Chen", "Keke", "" ] ]
Large training data and expensive model tweaking are standard features of deep learning for images. As a result, data owners often utilize cloud resources to develop large-scale complex models, which raises privacy concerns. Existing solutions are either too expensive to be practical or do not sufficiently protect the ...
1803.06015
Sara Cohen
Sara Cohen and Aviv Zohar
Database Perspectives on Blockchains
null
null
null
null
cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Modern blockchain systems are a fresh look at the paradigm of distributed computing, applied under assumptions of large-scale public networks. They can be used to store and share information without a trusted central party. There has been much effort to develop blockchain systems for a myriad of uses, ranging from cr...
[ { "created": "Thu, 15 Mar 2018 21:58:39 GMT", "version": "v1" } ]
2018-03-19
[ [ "Cohen", "Sara", "" ], [ "Zohar", "Aviv", "" ] ]
Modern blockchain systems are a fresh look at the paradigm of distributed computing, applied under assumptions of large-scale public networks. They can be used to store and share information without a trusted central party. There has been much effort to develop blockchain systems for a myriad of uses, ranging from cryp...
2403.10778
Zheng Shuchen
Shibiao Xu, ShuChen Zheng, Wenhao Xu, Rongtao Xu, Changwei Wang, Jiguang Zhang, Xiaoqiang Teng, Ao Li, Li Guo
HCF-Net: Hierarchical Context Fusion Network for Infrared Small Object Detection
null
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Infrared small object detection is an important computer vision task involving the recognition and localization of tiny objects in infrared images, which usually contain only a few pixels. However, it encounters difficulties due to the diminutive size of the objects and the generally complex backgrounds in infrared i...
[ { "created": "Sat, 16 Mar 2024 02:45:42 GMT", "version": "v1" } ]
2024-03-19
[ [ "Xu", "Shibiao", "" ], [ "Zheng", "ShuChen", "" ], [ "Xu", "Wenhao", "" ], [ "Xu", "Rongtao", "" ], [ "Wang", "Changwei", "" ], [ "Zhang", "Jiguang", "" ], [ "Teng", "Xiaoqiang", "" ], [ "Li", "...
Infrared small object detection is an important computer vision task involving the recognition and localization of tiny objects in infrared images, which usually contain only a few pixels. However, it encounters difficulties due to the diminutive size of the objects and the generally complex backgrounds in infrared ima...
2001.03844
Jinlan Fu
Jinlan Fu, Pengfei Liu, Qi Zhang, Xuanjing Huang
Rethinking Generalization of Neural Models: A Named Entity Recognition Case Study
Accepted by AAAI 2020
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
While neural network-based models have achieved impressive performance on a large body of NLP tasks, the generalization behavior of different models remains poorly understood: Does this excellent performance imply a perfect generalization model, or are there still some limitations? In this paper, we take the NER task...
[ { "created": "Sun, 12 Jan 2020 04:33:53 GMT", "version": "v1" } ]
2020-01-14
[ [ "Fu", "Jinlan", "" ], [ "Liu", "Pengfei", "" ], [ "Zhang", "Qi", "" ], [ "Huang", "Xuanjing", "" ] ]
While neural network-based models have achieved impressive performance on a large body of NLP tasks, the generalization behavior of different models remains poorly understood: Does this excellent performance imply a perfect generalization model, or are there still some limitations? In this paper, we take the NER task a...
1711.07657
Peng Yin
Peng Yin, Yuqing He, Na Liu and Jianda Han
Condition directed Multi-domain Adversarial Learning for Loop Closure Detection
7 pages, 11 figures, 3 tables, submitted to ICRA 2018
null
null
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Loop closure detection (LCD) is the key module in appearance based simultaneously localization and mapping (SLAM). However, in the real life, the appearance of visual inputs are usually affected by the illumination changes and texture changes under different weather conditions. Traditional methods in LCD usually rely...
[ { "created": "Tue, 21 Nov 2017 07:28:36 GMT", "version": "v1" } ]
2017-11-22
[ [ "Yin", "Peng", "" ], [ "He", "Yuqing", "" ], [ "Liu", "Na", "" ], [ "Han", "Jianda", "" ] ]
Loop closure detection (LCD) is the key module in appearance based simultaneously localization and mapping (SLAM). However, in the real life, the appearance of visual inputs are usually affected by the illumination changes and texture changes under different weather conditions. Traditional methods in LCD usually rely o...
2301.01420
Yingqiang Qiu
Yingqiang Qiu, Wanli Peng, Xiaodan Lin, Huanqiang Zeng, Zhenxing Qian
Improved CNN Prediction Based Reversible Data Hiding
null
null
null
null
cs.MM eess.IV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This letter proposes an improved CNN predictor (ICNNP) for reversible data hiding (RDH) in images, which consists of a feature extraction module, a pixel prediction module, and a complexity prediction module. Due to predicting the complexity of each pixel with the ICNNP during the embedding process, the proposed meth...
[ { "created": "Wed, 4 Jan 2023 03:15:21 GMT", "version": "v1" } ]
2023-01-05
[ [ "Qiu", "Yingqiang", "" ], [ "Peng", "Wanli", "" ], [ "Lin", "Xiaodan", "" ], [ "Zeng", "Huanqiang", "" ], [ "Qian", "Zhenxing", "" ] ]
This letter proposes an improved CNN predictor (ICNNP) for reversible data hiding (RDH) in images, which consists of a feature extraction module, a pixel prediction module, and a complexity prediction module. Due to predicting the complexity of each pixel with the ICNNP during the embedding process, the proposed method...
1211.6496
Naushad UzZaman Naushad UzZaman
Naushad UzZaman, Roi Blanco, Michael Matthews
TwitterPaul: Extracting and Aggregating Twitter Predictions
Check out the blog post with a summary and Prediction Retrieval information here: http://bitly.com/TwitterPaul
null
null
null
cs.SI cs.AI physics.soc-ph
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper introduces TwitterPaul, a system designed to make use of Social Media data to help to predict game outcomes for the 2010 FIFA World Cup tournament. To this end, we extracted over 538K mentions to football games from a large sample of tweets that occurred during the World Cup, and we classified into differe...
[ { "created": "Wed, 28 Nov 2012 01:33:21 GMT", "version": "v1" }, { "created": "Fri, 30 Nov 2012 16:55:53 GMT", "version": "v2" } ]
2015-03-13
[ [ "UzZaman", "Naushad", "" ], [ "Blanco", "Roi", "" ], [ "Matthews", "Michael", "" ] ]
This paper introduces TwitterPaul, a system designed to make use of Social Media data to help to predict game outcomes for the 2010 FIFA World Cup tournament. To this end, we extracted over 538K mentions to football games from a large sample of tweets that occurred during the World Cup, and we classified into different...
1805.06741
Xin Wei
Xin Wei, Hui Wang, Bryan Scotney and Huan Wan
Minimum Margin Loss for Deep Face Recognition
null
null
10.1016/j.patcog.2019.107012
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Face recognition has achieved great progress owing to the fast development of the deep neural network in the past a few years. As an important part of deep neural networks, a number of the loss functions have been proposed which significantly improve the state-of-the-art methods. In this paper, we proposed a new loss...
[ { "created": "Thu, 17 May 2018 13:02:23 GMT", "version": "v1" }, { "created": "Wed, 23 May 2018 09:46:43 GMT", "version": "v2" }, { "created": "Mon, 2 Jul 2018 09:28:28 GMT", "version": "v3" }, { "created": "Mon, 20 Aug 2018 15:27:51 GMT", "version": "v4" } ]
2020-02-05
[ [ "Wei", "Xin", "" ], [ "Wang", "Hui", "" ], [ "Scotney", "Bryan", "" ], [ "Wan", "Huan", "" ] ]
Face recognition has achieved great progress owing to the fast development of the deep neural network in the past a few years. As an important part of deep neural networks, a number of the loss functions have been proposed which significantly improve the state-of-the-art methods. In this paper, we proposed a new loss f...
1706.06813
Jindan Xu
Jindan Xu, Wei Xu, Fengkui Gong
On Performance of Quantized Transceiver in Multiuser Massive MIMO Downlinks
4 pages, 4 figures, submitted to IEEE Wireless Communications Letters
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Low-resolution digital-to-analog converters (DACs) and analog-to-digital converters (ADCs) are considered to reduce cost and power consumption in multiuser massive multiple-input multiple-output (MIMO). Using the Bussgang theorem, we derive the asymptotic downlink achievable rate w.r.t the resolutions of both DACs an...
[ { "created": "Wed, 21 Jun 2017 10:04:35 GMT", "version": "v1" } ]
2017-06-22
[ [ "Xu", "Jindan", "" ], [ "Xu", "Wei", "" ], [ "Gong", "Fengkui", "" ] ]
Low-resolution digital-to-analog converters (DACs) and analog-to-digital converters (ADCs) are considered to reduce cost and power consumption in multiuser massive multiple-input multiple-output (MIMO). Using the Bussgang theorem, we derive the asymptotic downlink achievable rate w.r.t the resolutions of both DACs and ...
1305.5827
Monica Shekhar
Monica Shekhar and Saravanaguru RA. K
Semantic Web Search based on Ontology Modeling using Protege Reasoner
null
null
null
null
cs.IR cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The Semantic Web works on the existing Web which presents the meaning of information as well-defined vocabularies understood by the people. Semantic Search, at the same time, works on improving the accuracy if a search by understanding the intent of the search and providing contextually relevant results. This paper d...
[ { "created": "Fri, 24 May 2013 19:02:59 GMT", "version": "v1" } ]
2013-05-27
[ [ "Shekhar", "Monica", "" ], [ "K", "Saravanaguru RA.", "" ] ]
The Semantic Web works on the existing Web which presents the meaning of information as well-defined vocabularies understood by the people. Semantic Search, at the same time, works on improving the accuracy if a search by understanding the intent of the search and providing contextually relevant results. This paper des...
2402.15089
Yifei Li
Yifei Li, Xiang Yue, Zeyi Liao, Huan Sun
AttributionBench: How Hard is Automatic Attribution Evaluation?
null
null
null
null
cs.CL cs.AI cs.LG
http://creativecommons.org/licenses/by/4.0/
Modern generative search engines enhance the reliability of large language model (LLM) responses by providing cited evidence. However, evaluating the answer's attribution, i.e., whether every claim within the generated responses is fully supported by its cited evidence, remains an open problem. This verification, tra...
[ { "created": "Fri, 23 Feb 2024 04:23:33 GMT", "version": "v1" } ]
2024-02-26
[ [ "Li", "Yifei", "" ], [ "Yue", "Xiang", "" ], [ "Liao", "Zeyi", "" ], [ "Sun", "Huan", "" ] ]
Modern generative search engines enhance the reliability of large language model (LLM) responses by providing cited evidence. However, evaluating the answer's attribution, i.e., whether every claim within the generated responses is fully supported by its cited evidence, remains an open problem. This verification, tradi...
2106.02775
Justin Yang
Justin Yang and Judith E. Fan
Visual communication of object concepts at different levels of abstraction
To appear in Proceedings of the 43rd Annual Meeting of the Cognitive Science Society. 7 pages, 5 figures
null
null
null
cs.CV
http://creativecommons.org/licenses/by-nc-nd/4.0/
People can produce drawings of specific entities (e.g., Garfield), as well as general categories (e.g., "cat"). What explains this ability to produce such varied drawings of even highly familiar object concepts? We hypothesized that drawing objects at different levels of abstraction depends on both sensory informatio...
[ { "created": "Sat, 5 Jun 2021 02:13:31 GMT", "version": "v1" } ]
2021-06-08
[ [ "Yang", "Justin", "" ], [ "Fan", "Judith E.", "" ] ]
People can produce drawings of specific entities (e.g., Garfield), as well as general categories (e.g., "cat"). What explains this ability to produce such varied drawings of even highly familiar object concepts? We hypothesized that drawing objects at different levels of abstraction depends on both sensory information ...
1207.2243
Marina Yashina
Alexei Yu. Uteshev and Marina V. Yashina
Metric Problems for Quadrics in Multidimensional Space
21 pages, 1 figure
null
null
null
cs.SC math.AG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Given the equations of the first and the second order surfaces in multidimensional space, our goal is to construct a univariate polynomial one of the zeros of which coincides with the square of the distance between these surfaces. To achieve this goal we employ Elimination Theory methods. The proposed approach is als...
[ { "created": "Tue, 10 Jul 2012 07:03:36 GMT", "version": "v1" } ]
2012-07-11
[ [ "Uteshev", "Alexei Yu.", "" ], [ "Yashina", "Marina V.", "" ] ]
Given the equations of the first and the second order surfaces in multidimensional space, our goal is to construct a univariate polynomial one of the zeros of which coincides with the square of the distance between these surfaces. To achieve this goal we employ Elimination Theory methods. The proposed approach is also ...
2405.15005
Julia Di
Tony G. Chen, Julia Di, Stephanie Newdick, Mathieu Lapotre, Marco Pavone, Mark R. Cutkosky
ReachBot Field Tests in a Mojave Desert Lava Tube as a Martian Analog
Accepted to the IEEE ICRA Workshop on Field Robotics 2024; 4 pages
null
null
null
cs.RO
http://creativecommons.org/licenses/by/4.0/
ReachBot is a robot concept for the planetary exploration of caves and lava tubes, which are often inaccessible with traditional robot locomotion methods. It uses extendable booms as appendages, with grippers mounted at the end, to grasp irregular rock surfaces and traverse these difficult terrains. We have built a p...
[ { "created": "Thu, 23 May 2024 19:22:59 GMT", "version": "v1" } ]
2024-05-27
[ [ "Chen", "Tony G.", "" ], [ "Di", "Julia", "" ], [ "Newdick", "Stephanie", "" ], [ "Lapotre", "Mathieu", "" ], [ "Pavone", "Marco", "" ], [ "Cutkosky", "Mark R.", "" ] ]
ReachBot is a robot concept for the planetary exploration of caves and lava tubes, which are often inaccessible with traditional robot locomotion methods. It uses extendable booms as appendages, with grippers mounted at the end, to grasp irregular rock surfaces and traverse these difficult terrains. We have built a par...
2309.14735
Shubham Kumar Nigam
Shubham Kumar Nigam, Shubham Kumar Mishra, Ayush Kumar Mishra, Noel Shallum and Arnab Bhattacharya
Legal Question-Answering in the Indian Context: Efficacy, Challenges, and Potential of Modern AI Models
null
null
null
null
cs.CL cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Legal QA platforms bear the promise to metamorphose the manner in which legal experts engage with jurisprudential documents. In this exposition, we embark on a comparative exploration of contemporary AI frameworks, gauging their adeptness in catering to the unique demands of the Indian legal milieu, with a keen empha...
[ { "created": "Tue, 26 Sep 2023 07:56:55 GMT", "version": "v1" }, { "created": "Mon, 16 Oct 2023 04:40:18 GMT", "version": "v2" } ]
2023-10-17
[ [ "Nigam", "Shubham Kumar", "" ], [ "Mishra", "Shubham Kumar", "" ], [ "Mishra", "Ayush Kumar", "" ], [ "Shallum", "Noel", "" ], [ "Bhattacharya", "Arnab", "" ] ]
Legal QA platforms bear the promise to metamorphose the manner in which legal experts engage with jurisprudential documents. In this exposition, we embark on a comparative exploration of contemporary AI frameworks, gauging their adeptness in catering to the unique demands of the Indian legal milieu, with a keen emphasi...
2211.13515
Yueqing Sun
Yueqing Sun, Yu Zhang, Le Qi, Qi Shi
TSGP: Two-Stage Generative Prompting for Unsupervised Commonsense Question Answering
Findings of EMNLP2022
null
null
null
cs.CL cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Unsupervised commonsense question answering requires mining effective commonsense knowledge without the rely on the labeled task data. Previous methods typically retrieved from traditional knowledge bases or used pre-trained language models (PrLMs) to generate fixed types of knowledge, which have poor generalization ...
[ { "created": "Thu, 24 Nov 2022 10:19:24 GMT", "version": "v1" } ]
2022-11-28
[ [ "Sun", "Yueqing", "" ], [ "Zhang", "Yu", "" ], [ "Qi", "Le", "" ], [ "Shi", "Qi", "" ] ]
Unsupervised commonsense question answering requires mining effective commonsense knowledge without the rely on the labeled task data. Previous methods typically retrieved from traditional knowledge bases or used pre-trained language models (PrLMs) to generate fixed types of knowledge, which have poor generalization ab...
2204.04914
Han Wu
Han Wu, Haochen Tan, Kun Xu, Shuqi Liu, Lianwei Wu and Linqi Song
Zero-shot Cross-lingual Conversational Semantic Role Labeling
NAACL 2022 findings
null
null
null
cs.CL cs.AI
http://creativecommons.org/licenses/by-nc-sa/4.0/
While conversational semantic role labeling (CSRL) has shown its usefulness on Chinese conversational tasks, it is still under-explored in non-Chinese languages due to the lack of multilingual CSRL annotations for the parser training. To avoid expensive data collection and error-propagation of translation-based metho...
[ { "created": "Mon, 11 Apr 2022 07:29:39 GMT", "version": "v1" } ]
2022-04-12
[ [ "Wu", "Han", "" ], [ "Tan", "Haochen", "" ], [ "Xu", "Kun", "" ], [ "Liu", "Shuqi", "" ], [ "Wu", "Lianwei", "" ], [ "Song", "Linqi", "" ] ]
While conversational semantic role labeling (CSRL) has shown its usefulness on Chinese conversational tasks, it is still under-explored in non-Chinese languages due to the lack of multilingual CSRL annotations for the parser training. To avoid expensive data collection and error-propagation of translation-based methods...
2402.00881
Nour Kouzayha
Adilya Bakambekova, Nour Kouzayha and Tareq Al-Naffouri
On the Interplay of Artificial Intelligence and Space-Air-Ground Integrated Networks: A Survey
null
null
null
null
cs.NI cs.AI
http://creativecommons.org/licenses/by/4.0/
Space-Air-Ground Integrated Networks (SAGINs), which incorporate space and aerial networks with terrestrial wireless systems, are vital enablers of the emerging sixth-generation (6G) wireless networks. Besides bringing significant benefits to various applications and services, SAGINs are envisioned to extend high-spe...
[ { "created": "Sat, 20 Jan 2024 16:10:31 GMT", "version": "v1" } ]
2024-02-05
[ [ "Bakambekova", "Adilya", "" ], [ "Kouzayha", "Nour", "" ], [ "Al-Naffouri", "Tareq", "" ] ]
Space-Air-Ground Integrated Networks (SAGINs), which incorporate space and aerial networks with terrestrial wireless systems, are vital enablers of the emerging sixth-generation (6G) wireless networks. Besides bringing significant benefits to various applications and services, SAGINs are envisioned to extend high-speed...
2312.01531
Benran Hu
Yichen Liu, Benran Hu, Chi-Keung Tang, Yu-Wing Tai
SANeRF-HQ: Segment Anything for NeRF in High Quality
Accepted to CVPR 2024
null
null
null
cs.CV
http://creativecommons.org/licenses/by/4.0/
Recently, the Segment Anything Model (SAM) has showcased remarkable capabilities of zero-shot segmentation, while NeRF (Neural Radiance Fields) has gained popularity as a method for various 3D problems beyond novel view synthesis. Though there exist initial attempts to incorporate these two methods into 3D segmentati...
[ { "created": "Sun, 3 Dec 2023 23:09:38 GMT", "version": "v1" }, { "created": "Sat, 6 Apr 2024 07:04:29 GMT", "version": "v2" } ]
2024-04-09
[ [ "Liu", "Yichen", "" ], [ "Hu", "Benran", "" ], [ "Tang", "Chi-Keung", "" ], [ "Tai", "Yu-Wing", "" ] ]
Recently, the Segment Anything Model (SAM) has showcased remarkable capabilities of zero-shot segmentation, while NeRF (Neural Radiance Fields) has gained popularity as a method for various 3D problems beyond novel view synthesis. Though there exist initial attempts to incorporate these two methods into 3D segmentation...
2103.03912
Albert Dulian
Albert Dulian, John C. Murray
Multi-modal anticipation of stochastic trajectories in a dynamic environment with Conditional Variational Autoencoders
null
null
null
null
cs.AI cs.LG
http://creativecommons.org/licenses/by/4.0/
Forecasting short-term motion of nearby vehicles presents an inherently challenging issue as the space of their possible future movements is not strictly limited to a set of single trajectories. Recently proposed techniques that demonstrate plausible results concentrate primarily on forecasting a fixed number of dete...
[ { "created": "Fri, 5 Mar 2021 19:38:26 GMT", "version": "v1" } ]
2021-03-09
[ [ "Dulian", "Albert", "" ], [ "Murray", "John C.", "" ] ]
Forecasting short-term motion of nearby vehicles presents an inherently challenging issue as the space of their possible future movements is not strictly limited to a set of single trajectories. Recently proposed techniques that demonstrate plausible results concentrate primarily on forecasting a fixed number of determ...
2211.07716
David Biesner
David Biesner, Maren Pielka, Rajkumar Ramamurthy, Tim Dilmaghani, Bernd Kliem, R\"udiger Loitz, Rafet Sifa
Zero-Shot Text Matching for Automated Auditing using Sentence Transformers
To be published in proceedings of IEEE International Conference on Machine Learning Applications IEEE ICMLA 2022
null
null
null
cs.CL cs.LG
http://creativecommons.org/licenses/by/4.0/
Natural language processing methods have several applications in automated auditing, including document or passage classification, information retrieval, and question answering. However, training such models requires a large amount of annotated data which is scarce in industrial settings. At the same time, techniques...
[ { "created": "Fri, 28 Oct 2022 11:52:16 GMT", "version": "v1" } ]
2022-11-16
[ [ "Biesner", "David", "" ], [ "Pielka", "Maren", "" ], [ "Ramamurthy", "Rajkumar", "" ], [ "Dilmaghani", "Tim", "" ], [ "Kliem", "Bernd", "" ], [ "Loitz", "Rüdiger", "" ], [ "Sifa", "Rafet", "" ] ]
Natural language processing methods have several applications in automated auditing, including document or passage classification, information retrieval, and question answering. However, training such models requires a large amount of annotated data which is scarce in industrial settings. At the same time, techniques l...
2208.02541
Chenjie Cao
Chenjie Cao, Xinlin Ren, Yanwei Fu
MVSFormer: Multi-View Stereo by Learning Robust Image Features and Temperature-based Depth
null
null
null
null
cs.CV
http://creativecommons.org/licenses/by/4.0/
Feature representation learning is the key recipe for learning-based Multi-View Stereo (MVS). As the common feature extractor of learning-based MVS, vanilla Feature Pyramid Networks (FPNs) suffer from discouraged feature representations for reflection and texture-less areas, which limits the generalization of MVS. Ev...
[ { "created": "Thu, 4 Aug 2022 09:17:30 GMT", "version": "v1" }, { "created": "Mon, 8 Aug 2022 16:49:16 GMT", "version": "v2" }, { "created": "Fri, 16 Dec 2022 13:42:24 GMT", "version": "v3" } ]
2022-12-19
[ [ "Cao", "Chenjie", "" ], [ "Ren", "Xinlin", "" ], [ "Fu", "Yanwei", "" ] ]
Feature representation learning is the key recipe for learning-based Multi-View Stereo (MVS). As the common feature extractor of learning-based MVS, vanilla Feature Pyramid Networks (FPNs) suffer from discouraged feature representations for reflection and texture-less areas, which limits the generalization of MVS. Even...
1707.08101
Andreas Eitel
Andreas Eitel, Nico Hauff and Wolfram Burgard
Learning to Singulate Objects using a Push Proposal Network
International Symposium on Robotics Research (ISRR) 2017, videos: http://robotpush.cs.uni-freiburg.de
null
null
null
cs.RO cs.LG cs.NE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Learning to act in unstructured environments, such as cluttered piles of objects, poses a substantial challenge for manipulation robots. We present a novel neural network-based approach that separates unknown objects in clutter by selecting favourable push actions. Our network is trained from data collected through a...
[ { "created": "Tue, 25 Jul 2017 17:36:36 GMT", "version": "v1" }, { "created": "Mon, 5 Feb 2018 18:42:35 GMT", "version": "v2" } ]
2018-02-06
[ [ "Eitel", "Andreas", "" ], [ "Hauff", "Nico", "" ], [ "Burgard", "Wolfram", "" ] ]
Learning to act in unstructured environments, such as cluttered piles of objects, poses a substantial challenge for manipulation robots. We present a novel neural network-based approach that separates unknown objects in clutter by selecting favourable push actions. Our network is trained from data collected through aut...
1203.4900
Michael Kapralov
Ashish Goel and Michael Kapralov and Ian Post
Single pass sparsification in the streaming model with edge deletions
null
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we give a construction of cut sparsifiers of Benczur and Karger in the {\em dynamic} streaming setting in a single pass over the data stream. Previous constructions either required multiple passes or were unable to handle edge deletions. We use $\tilde{O}(1/\e^2)$ time for each stream update and $\tilde...
[ { "created": "Thu, 22 Mar 2012 07:45:13 GMT", "version": "v1" } ]
2012-03-23
[ [ "Goel", "Ashish", "" ], [ "Kapralov", "Michael", "" ], [ "Post", "Ian", "" ] ]
In this paper we give a construction of cut sparsifiers of Benczur and Karger in the {\em dynamic} streaming setting in a single pass over the data stream. Previous constructions either required multiple passes or were unable to handle edge deletions. We use $\tilde{O}(1/\e^2)$ time for each stream update and $\tilde{O...
1608.06014
Yun Wang
Yun Wang and Peter J. Ramadge
The Symmetry of a Simple Optimization Problem in Lasso Screening
null
null
null
null
cs.LG cs.AI cs.CV stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recently dictionary screening has been proposed as an effective way to improve the computational efficiency of solving the lasso problem, which is one of the most commonly used method for learning sparse representations. To address today's ever increasing large dataset, effective screening relies on a tight region bo...
[ { "created": "Sun, 21 Aug 2016 23:48:43 GMT", "version": "v1" }, { "created": "Thu, 25 Aug 2016 22:05:24 GMT", "version": "v2" } ]
2016-08-29
[ [ "Wang", "Yun", "" ], [ "Ramadge", "Peter J.", "" ] ]
Recently dictionary screening has been proposed as an effective way to improve the computational efficiency of solving the lasso problem, which is one of the most commonly used method for learning sparse representations. To address today's ever increasing large dataset, effective screening relies on a tight region boun...
2402.01111
Dan Qiao
Dan Qiao, Yu-Xiang Wang
Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints
null
null
null
null
cs.LG cs.AI cs.MA stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study the problem of multi-agent reinforcement learning (MARL) with adaptivity constraints -- a new problem motivated by real-world applications where deployments of new policies are costly and the number of policy updates must be minimized. For two-player zero-sum Markov Games, we design a (policy) elimination ba...
[ { "created": "Fri, 2 Feb 2024 03:00:40 GMT", "version": "v1" } ]
2024-02-05
[ [ "Qiao", "Dan", "" ], [ "Wang", "Yu-Xiang", "" ] ]
We study the problem of multi-agent reinforcement learning (MARL) with adaptivity constraints -- a new problem motivated by real-world applications where deployments of new policies are costly and the number of policy updates must be minimized. For two-player zero-sum Markov Games, we design a (policy) elimination base...
2012.11260
Mengshi Qi
Mengshi Qi, Edoardo Remelli, Mathieu Salzmann, Pascal Fua
Unsupervised Domain Adaptation with Temporal-Consistent Self-Training for 3D Hand-Object Joint Reconstruction
In submission
null
null
null
cs.CV
http://creativecommons.org/licenses/by-nc-sa/4.0/
Deep learning-solutions for hand-object 3D pose and shape estimation are now very effective when an annotated dataset is available to train them to handle the scenarios and lighting conditions they will encounter at test time. Unfortunately, this is not always the case, and one often has to resort to training them on...
[ { "created": "Mon, 21 Dec 2020 11:27:56 GMT", "version": "v1" } ]
2020-12-22
[ [ "Qi", "Mengshi", "" ], [ "Remelli", "Edoardo", "" ], [ "Salzmann", "Mathieu", "" ], [ "Fua", "Pascal", "" ] ]
Deep learning-solutions for hand-object 3D pose and shape estimation are now very effective when an annotated dataset is available to train them to handle the scenarios and lighting conditions they will encounter at test time. Unfortunately, this is not always the case, and one often has to resort to training them on s...
2105.13810
Benjamin Maschler
Benjamin Lindemann, Benjamin Maschler, Nada Sahlab, and Michael Weyrich
A Survey on Anomaly Detection for Technical Systems using LSTM Networks
14 pages, 6 figures, 4 tables. Accepted for publication by Computers in Industry
null
10.1016/j.compind.2021.103498
null
cs.LG cs.AI stat.ML
http://creativecommons.org/licenses/by-nc-nd/4.0/
Anomalies represent deviations from the intended system operation and can lead to decreased efficiency as well as partial or complete system failure. As the causes of anomalies are often unknown due to complex system dynamics, efficient anomaly detection is necessary. Conventional detection approaches rely on statist...
[ { "created": "Fri, 28 May 2021 13:24:40 GMT", "version": "v1" } ]
2021-08-31
[ [ "Lindemann", "Benjamin", "" ], [ "Maschler", "Benjamin", "" ], [ "Sahlab", "Nada", "" ], [ "Weyrich", "Michael", "" ] ]
Anomalies represent deviations from the intended system operation and can lead to decreased efficiency as well as partial or complete system failure. As the causes of anomalies are often unknown due to complex system dynamics, efficient anomaly detection is necessary. Conventional detection approaches rely on statistic...
2112.09169
Weihao Tan
Weihao Tan, David Koleczek, Siddhant Pradhan, Nicholas Perello, Vivek Chettiar, Vishal Rohra, Aaslesha Rajaram, Soundararajan Srinivasan, H M Sajjad Hossain, Yash Chandak
On Optimizing Interventions in Shared Autonomy
Accepted by AAAI2022
null
null
null
cs.AI cs.LG
http://creativecommons.org/licenses/by/4.0/
Shared autonomy refers to approaches for enabling an autonomous agent to collaborate with a human with the aim of improving human performance. However, besides improving performance, it may often also be beneficial that the agent concurrently accounts for preserving the user's experience or satisfaction of collaborat...
[ { "created": "Thu, 16 Dec 2021 19:37:28 GMT", "version": "v1" }, { "created": "Sat, 1 Jan 2022 00:51:46 GMT", "version": "v2" } ]
2022-01-04
[ [ "Tan", "Weihao", "" ], [ "Koleczek", "David", "" ], [ "Pradhan", "Siddhant", "" ], [ "Perello", "Nicholas", "" ], [ "Chettiar", "Vivek", "" ], [ "Rohra", "Vishal", "" ], [ "Rajaram", "Aaslesha", "" ], [...
Shared autonomy refers to approaches for enabling an autonomous agent to collaborate with a human with the aim of improving human performance. However, besides improving performance, it may often also be beneficial that the agent concurrently accounts for preserving the user's experience or satisfaction of collaboratio...
1103.2690
Valentin Savin
Lam Pham Sy, Valentin Savin, David Declercq, Nghia Pham
Scheduled-PEG construction of LDPC codes for Upper-Layer FEC
WCC 2011
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The Progressive Edge Growth (PEG) algorithm is one of the most widely-used method for constructing finite length LDPC codes. In this paper we consider the PEG algorithm together with a scheduling distribution, which specifies the order in which edges are established in the graph. The goal is to find a scheduling dist...
[ { "created": "Mon, 14 Mar 2011 15:29:02 GMT", "version": "v1" } ]
2011-03-15
[ [ "Sy", "Lam Pham", "" ], [ "Savin", "Valentin", "" ], [ "Declercq", "David", "" ], [ "Pham", "Nghia", "" ] ]
The Progressive Edge Growth (PEG) algorithm is one of the most widely-used method for constructing finite length LDPC codes. In this paper we consider the PEG algorithm together with a scheduling distribution, which specifies the order in which edges are established in the graph. The goal is to find a scheduling distri...
2305.11882
Andrew Katz
Andrew Katz, Siqing Wei, Gaurav Nanda, Christopher Brinton, Matthew Ohland
Exploring the Efficacy of ChatGPT in Analyzing Student Teamwork Feedback with an Existing Taxonomy
22 pages, 7 tables, 1 figure
null
null
null
cs.HC cs.AI
http://creativecommons.org/licenses/by-nc-sa/4.0/
Teamwork is a critical component of many academic and professional settings. In those contexts, feedback between team members is an important element to facilitate successful and sustainable teamwork. However, in the classroom, as the number of teams and team members and frequency of evaluation increase, the volume o...
[ { "created": "Tue, 9 May 2023 19:55:50 GMT", "version": "v1" } ]
2023-05-23
[ [ "Katz", "Andrew", "" ], [ "Wei", "Siqing", "" ], [ "Nanda", "Gaurav", "" ], [ "Brinton", "Christopher", "" ], [ "Ohland", "Matthew", "" ] ]
Teamwork is a critical component of many academic and professional settings. In those contexts, feedback between team members is an important element to facilitate successful and sustainable teamwork. However, in the classroom, as the number of teams and team members and frequency of evaluation increase, the volume of ...
2305.14588
Daniel Simig
Sebastian Cadavid-Sanchez, Khalil Kacem, Rafael Aparecido Martins Frade, Johannes Boehm, Thomas Chaney, Danial Lashkari, Daniel Simig
Evaluating end-to-end entity linking on domain-specific knowledge bases: Learning about ancient technologies from museum collections
null
null
null
null
cs.CL cs.LG
http://creativecommons.org/licenses/by/4.0/
To study social, economic, and historical questions, researchers in the social sciences and humanities have started to use increasingly large unstructured textual datasets. While recent advances in NLP provide many tools to efficiently process such data, most existing approaches rely on generic solutions whose perfor...
[ { "created": "Tue, 23 May 2023 23:53:58 GMT", "version": "v1" } ]
2023-05-25
[ [ "Cadavid-Sanchez", "Sebastian", "" ], [ "Kacem", "Khalil", "" ], [ "Frade", "Rafael Aparecido Martins", "" ], [ "Boehm", "Johannes", "" ], [ "Chaney", "Thomas", "" ], [ "Lashkari", "Danial", "" ], [ "Simig", "D...
To study social, economic, and historical questions, researchers in the social sciences and humanities have started to use increasingly large unstructured textual datasets. While recent advances in NLP provide many tools to efficiently process such data, most existing approaches rely on generic solutions whose performa...
2212.02323
Alexander Razborov
Alexander Razborov
Improved Convergence Guarantees for Shallow Neural Networks
55 pages, 5 figures
null
null
null
cs.LG
http://creativecommons.org/licenses/by/4.0/
We continue a long line of research aimed at proving convergence of depth 2 neural networks, trained via gradient descent, to a global minimum. Like in many previous works, our model has the following features: regression with quadratic loss function, fully connected feedforward architecture, RelU activations, Gaussi...
[ { "created": "Mon, 5 Dec 2022 14:47:52 GMT", "version": "v1" } ]
2022-12-06
[ [ "Razborov", "Alexander", "" ] ]
We continue a long line of research aimed at proving convergence of depth 2 neural networks, trained via gradient descent, to a global minimum. Like in many previous works, our model has the following features: regression with quadratic loss function, fully connected feedforward architecture, RelU activations, Gaussian...
2107.06400
Sergio Rojas-Galeano
Sergio Rojas-Galeano
Using BERT Encoding to Tackle the Mad-lib Attack in SMS Spam Detection
null
null
null
null
cs.CL cs.IR cs.LG
http://creativecommons.org/licenses/by-nc-nd/4.0/
One of the stratagems used to deceive spam filters is to substitute vocables with synonyms or similar words that turn the message unrecognisable by the detection algorithms. In this paper we investigate whether the recent development of language models sensitive to the semantics and context of words, such as Google's...
[ { "created": "Tue, 13 Jul 2021 21:17:57 GMT", "version": "v1" } ]
2021-07-16
[ [ "Rojas-Galeano", "Sergio", "" ] ]
One of the stratagems used to deceive spam filters is to substitute vocables with synonyms or similar words that turn the message unrecognisable by the detection algorithms. In this paper we investigate whether the recent development of language models sensitive to the semantics and context of words, such as Google's B...
2012.04780
Sarthak Dash
Sarthak Dash, Gaetano Rossiello, Nandana Mihindukulasooriya, Sugato Bagchi, Alfio Gliozzo
Open Knowledge Graphs Canonicalization using Variational Autoencoders
Accepted to EMNLP 2021
null
null
null
cs.CL cs.AI cs.IR cs.LG
http://creativecommons.org/licenses/by/4.0/
Noun phrases and Relation phrases in open knowledge graphs are not canonicalized, leading to an explosion of redundant and ambiguous subject-relation-object triples. Existing approaches to solve this problem take a two-step approach. First, they generate embedding representations for both noun and relation phrases, t...
[ { "created": "Tue, 8 Dec 2020 22:58:30 GMT", "version": "v1" }, { "created": "Mon, 27 Sep 2021 20:36:00 GMT", "version": "v2" } ]
2021-09-29
[ [ "Dash", "Sarthak", "" ], [ "Rossiello", "Gaetano", "" ], [ "Mihindukulasooriya", "Nandana", "" ], [ "Bagchi", "Sugato", "" ], [ "Gliozzo", "Alfio", "" ] ]
Noun phrases and Relation phrases in open knowledge graphs are not canonicalized, leading to an explosion of redundant and ambiguous subject-relation-object triples. Existing approaches to solve this problem take a two-step approach. First, they generate embedding representations for both noun and relation phrases, the...
1609.04135
Junmo Sung
Junmo Sung and Brian L. Evans
Real-time testbed for diversity in powerline and wireless smart grid communications
6 pages, 5 figures, submitted to ICC 2018
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Two-way communication is a key feature in a smart grid. It is enabled by either powerline communication or wireless communication technologies. Utilizing both technologies can potentially enhance communication reliability, and many diversity combining schemes have been proposed. In this paper, we propose a flexible r...
[ { "created": "Wed, 14 Sep 2016 04:39:50 GMT", "version": "v1" }, { "created": "Thu, 30 Mar 2017 22:29:51 GMT", "version": "v2" }, { "created": "Sun, 29 Oct 2017 18:38:02 GMT", "version": "v3" } ]
2017-10-31
[ [ "Sung", "Junmo", "" ], [ "Evans", "Brian L.", "" ] ]
Two-way communication is a key feature in a smart grid. It is enabled by either powerline communication or wireless communication technologies. Utilizing both technologies can potentially enhance communication reliability, and many diversity combining schemes have been proposed. In this paper, we propose a flexible rea...
2105.06131
Mingyu Xiao
Junqiang Peng and Mingyu Xiao
Further Improvements for SAT in Terms of Formula Length
An initial version of this paper with a weaker result was presented at SAT 2021
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we prove that the general CNF satisfiability problem can be solved in $O^*(1.0638^L)$ time, where $L$ is the length of the input CNF-formula (i.e., the total number of literals in the formula), which improves the previous result of $O^*(1.0652^L)$ obtained in 2009. Our algorithm was analyzed by using t...
[ { "created": "Thu, 13 May 2021 08:15:56 GMT", "version": "v1" }, { "created": "Wed, 17 Aug 2022 15:02:02 GMT", "version": "v2" } ]
2022-08-18
[ [ "Peng", "Junqiang", "" ], [ "Xiao", "Mingyu", "" ] ]
In this paper, we prove that the general CNF satisfiability problem can be solved in $O^*(1.0638^L)$ time, where $L$ is the length of the input CNF-formula (i.e., the total number of literals in the formula), which improves the previous result of $O^*(1.0652^L)$ obtained in 2009. Our algorithm was analyzed by using the...
cs/0611165
Valmir Barbosa
Ricardo C. Correa, Valmir C. Barbosa
Partially ordered distributed computations on asynchronous point-to-point networks
null
Parallel Computing 35 (2009), 12-28
10.1016/j.parco.2008.09.011
null
cs.DC
null
Asynchronous executions of a distributed algorithm differ from each other due to the nondeterminism in the order in which the messages exchanged are handled. In many situations of interest, the asynchronous executions induced by restricting nondeterminism are more efficient, in an application-specific sense, than the...
[ { "created": "Thu, 30 Nov 2006 13:01:36 GMT", "version": "v1" } ]
2016-11-11
[ [ "Correa", "Ricardo C.", "" ], [ "Barbosa", "Valmir C.", "" ] ]
Asynchronous executions of a distributed algorithm differ from each other due to the nondeterminism in the order in which the messages exchanged are handled. In many situations of interest, the asynchronous executions induced by restricting nondeterminism are more efficient, in an application-specific sense, than the o...
1802.06852
Zeeshan Bhatti
Zeeshan Bhatti, Ahsan Abro, Abdul Rehman Gillal, Mostafa Karbasi
Be-Educated: Multimedia Learning through 3D Animation
10 pages, 32 figures
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND EMERGING TECHNOLOGIES,(IJCET)- VOL1(1) DECEMBER 2017- 13-22
null
null
cs.GR cs.MM
http://creativecommons.org/licenses/by-nc-sa/4.0/
Multimedia learning tools and techniques are placing its importance with large scale in education sector. With the help of multimedia learning, various complex phenomenon and theories can be explained and taught easily and conveniently. This project aims to teach and spread the importance of education and respecting ...
[ { "created": "Mon, 19 Feb 2018 21:08:50 GMT", "version": "v1" } ]
2018-02-21
[ [ "Bhatti", "Zeeshan", "" ], [ "Abro", "Ahsan", "" ], [ "Gillal", "Abdul Rehman", "" ], [ "Karbasi", "Mostafa", "" ] ]
Multimedia learning tools and techniques are placing its importance with large scale in education sector. With the help of multimedia learning, various complex phenomenon and theories can be explained and taught easily and conveniently. This project aims to teach and spread the importance of education and respecting th...
2005.01317
Jicong Fan
Jicong Fan, Chengrun Yang, Madeleine Udell
Robust Non-Linear Matrix Factorization for Dictionary Learning, Denoising, and Clustering
null
IEEE Transactions on Signal Processing 69, 1755-1770 (2021)
10.1109/TSP.2021.3062988
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Low dimensional nonlinear structure abounds in datasets across computer vision and machine learning. Kernelized matrix factorization techniques have recently been proposed to learn these nonlinear structures for denoising, classification, dictionary learning, and missing data imputation, by observing that the image o...
[ { "created": "Mon, 4 May 2020 08:32:21 GMT", "version": "v1" }, { "created": "Wed, 2 Dec 2020 08:51:54 GMT", "version": "v2" } ]
2021-06-01
[ [ "Fan", "Jicong", "" ], [ "Yang", "Chengrun", "" ], [ "Udell", "Madeleine", "" ] ]
Low dimensional nonlinear structure abounds in datasets across computer vision and machine learning. Kernelized matrix factorization techniques have recently been proposed to learn these nonlinear structures for denoising, classification, dictionary learning, and missing data imputation, by observing that the image of ...
1105.5459
T. Hogg
T. Hogg
Solving Highly Constrained Search Problems with Quantum Computers
null
Journal Of Artificial Intelligence Research, Volume 10, pages 39-66, 1999
10.1613/jair.574
null
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satisfiability problems for which the generalized algorithm can find a solution in a constant number of s...
[ { "created": "Fri, 27 May 2011 01:52:46 GMT", "version": "v1" } ]
2011-05-30
[ [ "Hogg", "T.", "" ] ]
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satisfiability problems for which the generalized algorithm can find a solution in a constant number of ste...
2401.09628
Leello Dadi
Leello Dadi, Ioannis Panageas, Stratis Skoulakis, Luca Viano, and Volkan Cevher
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
null
null
null
null
cs.GT
http://creativecommons.org/licenses/by/4.0/
We introduce an online learning algorithm in the bandit feedback model that, once adopted by all agents of a congestion game, results in game-dynamics that converge to an $\epsilon$-approximate Nash Equilibrium in a polynomial number of rounds with respect to $1/\epsilon$, the number of players and the number of avai...
[ { "created": "Wed, 17 Jan 2024 22:37:31 GMT", "version": "v1" } ]
2024-01-19
[ [ "Dadi", "Leello", "" ], [ "Panageas", "Ioannis", "" ], [ "Skoulakis", "Stratis", "" ], [ "Viano", "Luca", "" ], [ "Cevher", "Volkan", "" ] ]
We introduce an online learning algorithm in the bandit feedback model that, once adopted by all agents of a congestion game, results in game-dynamics that converge to an $\epsilon$-approximate Nash Equilibrium in a polynomial number of rounds with respect to $1/\epsilon$, the number of players and the number of availa...
1609.01614
Mao Zheng
Mao Zheng, Qian Xu and Hao Fan
Modeling The Adaption Rule in Context-aware Systems
11 pages, 4 tables, 7 figures
International Journal of Ad hoc, Sensor & Ubiquitous Computing, Vol.7, No.3/4, August 2016, ISSN : 0976 - 1764 (Online); 0976 - 2205 (Print),
10.5121/ijasuc.2016.7401
null
cs.HC cs.ET
http://creativecommons.org/licenses/by-nc-sa/4.0/
Context awareness is increasingly gaining applicability in interactive ubiquitous mobile computing systems. Each context-aware application has its own set of behaviors to react to context modifications. This paper is concerned with the context modeling and the development methodology for context-aware systems. We pro...
[ { "created": "Tue, 6 Sep 2016 15:42:56 GMT", "version": "v1" } ]
2016-09-07
[ [ "Zheng", "Mao", "" ], [ "Xu", "Qian", "" ], [ "Fan", "Hao", "" ] ]
Context awareness is increasingly gaining applicability in interactive ubiquitous mobile computing systems. Each context-aware application has its own set of behaviors to react to context modifications. This paper is concerned with the context modeling and the development methodology for context-aware systems. We propo...
2002.06086
Birgitta Dresp-Langley
Birgitta Dresp-Langley
Artificial Intelligence, connected products, virtual reality: potential impacts on consumer safety in terms of their physical and psychological ability or well-being
null
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
With the progressive digitalisation of a majority of services to communities and individuals, humankind is facing new challenges. While energy sources are rapidly dwindling and rigorous choices have to be made to ensure the sustainability of our environment, there is increasing concern in science and society about th...
[ { "created": "Fri, 14 Feb 2020 15:43:20 GMT", "version": "v1" } ]
2020-02-17
[ [ "Dresp-Langley", "Birgitta", "" ] ]
With the progressive digitalisation of a majority of services to communities and individuals, humankind is facing new challenges. While energy sources are rapidly dwindling and rigorous choices have to be made to ensure the sustainability of our environment, there is increasing concern in science and society about the ...
1912.08494
Sameen Maruf
Sameen Maruf, Fahimeh Saleh and Gholamreza Haffari
A Survey on Document-level Neural Machine Translation: Methods and Evaluation
Accepted for publication by ACM Computing Surveys
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Machine translation (MT) is an important task in natural language processing (NLP) as it automates the translation process and reduces the reliance on human translators. With the resurgence of neural networks, the translation quality surpasses that of the translations obtained using statistical techniques for most la...
[ { "created": "Wed, 18 Dec 2019 10:07:20 GMT", "version": "v1" }, { "created": "Sun, 11 Oct 2020 23:10:22 GMT", "version": "v2" }, { "created": "Wed, 13 Jan 2021 00:31:53 GMT", "version": "v3" } ]
2021-01-14
[ [ "Maruf", "Sameen", "" ], [ "Saleh", "Fahimeh", "" ], [ "Haffari", "Gholamreza", "" ] ]
Machine translation (MT) is an important task in natural language processing (NLP) as it automates the translation process and reduces the reliance on human translators. With the resurgence of neural networks, the translation quality surpasses that of the translations obtained using statistical techniques for most lang...
2010.00104
Pritam Sarkar
Pritam Sarkar, Ali Etemad
CardioGAN: Attentive Generative Adversarial Network with Dual Discriminators for Synthesis of ECG from PPG
Accepted in AAAI 2021
null
null
null
cs.LG eess.SP
http://creativecommons.org/licenses/by-nc-sa/4.0/
Electrocardiogram (ECG) is the electrical measurement of cardiac activity, whereas Photoplethysmogram (PPG) is the optical measurement of volumetric changes in blood circulation. While both signals are used for heart rate monitoring, from a medical perspective, ECG is more useful as it carries additional cardiac info...
[ { "created": "Wed, 30 Sep 2020 20:49:30 GMT", "version": "v1" }, { "created": "Tue, 15 Dec 2020 05:51:03 GMT", "version": "v2" } ]
2020-12-16
[ [ "Sarkar", "Pritam", "" ], [ "Etemad", "Ali", "" ] ]
Electrocardiogram (ECG) is the electrical measurement of cardiac activity, whereas Photoplethysmogram (PPG) is the optical measurement of volumetric changes in blood circulation. While both signals are used for heart rate monitoring, from a medical perspective, ECG is more useful as it carries additional cardiac inform...
1307.4468
EPTCS
Mark Reynolds (The University of Western Australia)
A Faster Tableau for CTL*
In Proceedings GandALF 2013, arXiv:1307.4162
EPTCS 119, 2013, pp. 50-63
10.4204/EPTCS.119.7
null
cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*. In this paper we present a streamlined and more traditional tableau approach built upon the author's earlier theoretical work. Soundness and completene...
[ { "created": "Wed, 17 Jul 2013 01:41:36 GMT", "version": "v1" } ]
2013-07-18
[ [ "Reynolds", "Mark", "", "The University of Western Australia" ] ]
There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*. In this paper we present a streamlined and more traditional tableau approach built upon the author's earlier theoretical work. Soundness and completeness r...
1210.2123
Flavio Calmon
Flavio du Pin Calmon, Nadia Fawaz
Privacy Against Statistical Inference
Allerton 2012, 8 pages
null
null
null
cs.IT cs.CR math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We propose a general statistical inference framework to capture the privacy threat incurred by a user that releases data to a passive but curious adversary, given utility constraints. We show that applying this general framework to the setting where the adversary uses the self-information cost function naturally lead...
[ { "created": "Mon, 8 Oct 2012 01:07:48 GMT", "version": "v1" } ]
2012-10-09
[ [ "Calmon", "Flavio du Pin", "" ], [ "Fawaz", "Nadia", "" ] ]
We propose a general statistical inference framework to capture the privacy threat incurred by a user that releases data to a passive but curious adversary, given utility constraints. We show that applying this general framework to the setting where the adversary uses the self-information cost function naturally leads ...
2011.13485
Zhiyang He
Zhiyang He, Jason Li, Magnus Wahlstr\"om
Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
null
null
null
null
cs.DS math.CO
http://creativecommons.org/licenses/by/4.0/
Let $G$ be a graph and $S, T \subseteq V(G)$ be (possibly overlapping) sets of terminals, $|S|=|T|=k$. We are interested in computing a vertex sparsifier for terminal cuts in $G$, i.e., a graph $H$ on a smallest possible number of vertices, where $S \cup T \subseteq V(H)$ and such that for every $A \subseteq S$ and $...
[ { "created": "Thu, 26 Nov 2020 22:39:34 GMT", "version": "v1" }, { "created": "Sat, 3 Jul 2021 05:19:57 GMT", "version": "v2" } ]
2021-07-06
[ [ "He", "Zhiyang", "" ], [ "Li", "Jason", "" ], [ "Wahlström", "Magnus", "" ] ]
Let $G$ be a graph and $S, T \subseteq V(G)$ be (possibly overlapping) sets of terminals, $|S|=|T|=k$. We are interested in computing a vertex sparsifier for terminal cuts in $G$, i.e., a graph $H$ on a smallest possible number of vertices, where $S \cup T \subseteq V(H)$ and such that for every $A \subseteq S$ and $B ...
1009.5398
Ali Reza Manashty
Ali Reza Manashty, Amir Rajabzadeh and Zahra Forootan Jahromi
A Scenario-Based Mobile Application for Robot-Assisted Smart Digital Homes
8 pages, 8 figures, IEEE Publication format, Keywords- smart homes; mobile applications; remote home controls; automated digital homes; robot assisted at home; general packet radio service (GPRS); short message system (SMS); robot assisted at home; scenario based smart home
International Journal of Computer Science and Information Security (IJCSIS), Vol. 8, No. 5, August 2010, ISSN 1947-5500, Pages 89-96
null
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Smart homes are becoming more popular, as every day a new home appliance can be digitally controlled. Smart Digital Homes are using a server to make interaction with all the possible devices in one place, on a computer or webpage. In this paper we designed and implemented a mobile application using Windows Mobile pla...
[ { "created": "Mon, 27 Sep 2010 20:58:05 GMT", "version": "v1" } ]
2010-09-29
[ [ "Manashty", "Ali Reza", "" ], [ "Rajabzadeh", "Amir", "" ], [ "Jahromi", "Zahra Forootan", "" ] ]
Smart homes are becoming more popular, as every day a new home appliance can be digitally controlled. Smart Digital Homes are using a server to make interaction with all the possible devices in one place, on a computer or webpage. In this paper we designed and implemented a mobile application using Windows Mobile platf...
2012.06961
Jiashuo Jiang
Jiashuo Jiang, Xiaocheng Li, Jiawei Zhang
Online Stochastic Optimization with Wasserstein Based Non-stationarity
null
null
null
null
cs.LG math.OC
http://creativecommons.org/licenses/by/4.0/
We consider a general online stochastic optimization problem with multiple budget constraints over a horizon of finite time periods. In each time period, a reward function and multiple cost functions are revealed, and the decision maker needs to specify an action from a convex and compact action set to collect the re...
[ { "created": "Sun, 13 Dec 2020 04:47:37 GMT", "version": "v1" }, { "created": "Wed, 23 Dec 2020 06:24:13 GMT", "version": "v2" }, { "created": "Mon, 25 Jul 2022 00:17:45 GMT", "version": "v3" } ]
2022-07-26
[ [ "Jiang", "Jiashuo", "" ], [ "Li", "Xiaocheng", "" ], [ "Zhang", "Jiawei", "" ] ]
We consider a general online stochastic optimization problem with multiple budget constraints over a horizon of finite time periods. In each time period, a reward function and multiple cost functions are revealed, and the decision maker needs to specify an action from a convex and compact action set to collect the rewa...
2403.17532
Yilin Wang
Yilin Wang, Minghao Hu, Zhen Huang, Dongsheng Li, Dong Yang, Xicheng Lu
KC-GenRe: A Knowledge-constrained Generative Re-ranking Method Based on Large Language Models for Knowledge Graph Completion
This paper has been accepted for publication in the proceedings of LREC-COLING 2024
null
null
null
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The goal of knowledge graph completion (KGC) is to predict missing facts among entities. Previous methods for KGC re-ranking are mostly built on non-generative language models to obtain the probability of each candidate. Recently, generative large language models (LLMs) have shown outstanding performance on several t...
[ { "created": "Tue, 26 Mar 2024 09:36:59 GMT", "version": "v1" } ]
2024-03-27
[ [ "Wang", "Yilin", "" ], [ "Hu", "Minghao", "" ], [ "Huang", "Zhen", "" ], [ "Li", "Dongsheng", "" ], [ "Yang", "Dong", "" ], [ "Lu", "Xicheng", "" ] ]
The goal of knowledge graph completion (KGC) is to predict missing facts among entities. Previous methods for KGC re-ranking are mostly built on non-generative language models to obtain the probability of each candidate. Recently, generative large language models (LLMs) have shown outstanding performance on several tas...
2101.11711
Nikolaos Dervilis Dr
Kartik Chandrasekhar, Nevena Stevanovic, Elizabeth J. Cross, Nikolaos Dervilis, Keith Worden
Damage detection in operational wind turbine blades using a new approach based on machine learning
null
This is an author produced version of a paper subsequently published in Renewable Energy, Elsevier, 2021. Uploaded in accordance with the publisher's self-archiving policy
10.1016/j.renene.2020.12.119
null
cs.LG physics.data-an
http://creativecommons.org/licenses/by/4.0/
The application of reliable structural health monitoring (SHM) technologies to operational wind turbine blades is a challenging task, due to the uncertain nature of the environments they operate in. In this paper, a novel SHM methodology, which uses Gaussian Processes (GPs) is proposed. The methodology takes advantag...
[ { "created": "Mon, 25 Jan 2021 21:56:33 GMT", "version": "v1" } ]
2021-01-29
[ [ "Chandrasekhar", "Kartik", "" ], [ "Stevanovic", "Nevena", "" ], [ "Cross", "Elizabeth J.", "" ], [ "Dervilis", "Nikolaos", "" ], [ "Worden", "Keith", "" ] ]
The application of reliable structural health monitoring (SHM) technologies to operational wind turbine blades is a challenging task, due to the uncertain nature of the environments they operate in. In this paper, a novel SHM methodology, which uses Gaussian Processes (GPs) is proposed. The methodology takes advantage ...
2309.09095
Rustam Zayanov
Rustam Zayanov, Francisco S. Melo, Manuel Lopes
Interactively Teaching an Inverse Reinforcement Learner with Limited Feedback
7 pages, 3 figures
null
null
null
cs.LG cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study the problem of teaching via demonstrations in sequential decision-making tasks. In particular, we focus on the situation when the teacher has no access to the learner's model and policy, and the feedback from the learner is limited to trajectories that start from states selected by the teacher. The necessity...
[ { "created": "Sat, 16 Sep 2023 21:12:04 GMT", "version": "v1" } ]
2023-09-19
[ [ "Zayanov", "Rustam", "" ], [ "Melo", "Francisco S.", "" ], [ "Lopes", "Manuel", "" ] ]
We study the problem of teaching via demonstrations in sequential decision-making tasks. In particular, we focus on the situation when the teacher has no access to the learner's model and policy, and the feedback from the learner is limited to trajectories that start from states selected by the teacher. The necessity t...
2205.01789
Nishanth Dikkala
Pranjal Awasthi, Nishanth Dikkala, Pritish Kamath
Do More Negative Samples Necessarily Hurt in Contrastive Learning?
16 pages
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recent investigations in noise contrastive estimation suggest, both empirically as well as theoretically, that while having more "negative samples" in the contrastive loss improves downstream classification performance initially, beyond a threshold, it hurts downstream performance due to a "collision-coverage" trade-...
[ { "created": "Tue, 3 May 2022 21:29:59 GMT", "version": "v1" }, { "created": "Wed, 22 Jun 2022 20:47:11 GMT", "version": "v2" } ]
2022-06-24
[ [ "Awasthi", "Pranjal", "" ], [ "Dikkala", "Nishanth", "" ], [ "Kamath", "Pritish", "" ] ]
Recent investigations in noise contrastive estimation suggest, both empirically as well as theoretically, that while having more "negative samples" in the contrastive loss improves downstream classification performance initially, beyond a threshold, it hurts downstream performance due to a "collision-coverage" trade-of...
1405.7903
Carsten Gottschlich
Carsten Gottschlich and Dominic Schuhmacher
The Shortlist Method for Fast Computation of the Earth Mover's Distance and Finding Optimal Solutions to Transportation Problems
null
PLOS ONE 9(10): e110214, Oct. 2014
10.1371/journal.pone.0110214
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Finding solutions to the classical transportation problem is of great importance, since this optimization problem arises in many engineering and computer science applications. Especially the Earth Mover's Distance is used in a plethora of applications ranging from content-based image retrieval, shape matching, finger...
[ { "created": "Fri, 30 May 2014 16:07:55 GMT", "version": "v1" } ]
2014-10-15
[ [ "Gottschlich", "Carsten", "" ], [ "Schuhmacher", "Dominic", "" ] ]
Finding solutions to the classical transportation problem is of great importance, since this optimization problem arises in many engineering and computer science applications. Especially the Earth Mover's Distance is used in a plethora of applications ranging from content-based image retrieval, shape matching, fingerpr...
1811.12554
Saeed Seddighin
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein
Fast Algorithms for Knapsack via Convolution and Prediction
null
null
null
null
cs.GT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The \Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is one of the most well-known NP-hard problems. The goal is to pack a knapsack of size $t$ with the maximum value from a collection of $n$ ite...
[ { "created": "Fri, 30 Nov 2018 00:33:51 GMT", "version": "v1" } ]
2018-12-03
[ [ "Bateni", "MohammadHossein", "" ], [ "Hajiaghayi", "MohammadTaghi", "" ], [ "Seddighin", "Saeed", "" ], [ "Stein", "Cliff", "" ] ]
The \Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is one of the most well-known NP-hard problems. The goal is to pack a knapsack of size $t$ with the maximum value from a collection of $n$ items...
1810.09803
Bertrand Corn\'elusse
Bertrand Corn\'elusse, Iacopo Savelli, Simone Paoletti, Antonio Giannitrapani and Antonio Vicino
A Community Microgrid Architecture with an Internal Local Market
16 pages, 15 figures
null
10.1016/j.apenergy.2019.03.109
null
cs.SY econ.GN q-fin.EC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This work fits in the context of community microgrids, where members of a community can exchange energy and services among themselves, without going through the usual channels of the public electricity grid. We introduce and analyze a framework to operate a community microgrid, and to share the resulting revenues and...
[ { "created": "Tue, 23 Oct 2018 12:05:51 GMT", "version": "v1" }, { "created": "Thu, 10 Jan 2019 09:39:31 GMT", "version": "v2" }, { "created": "Wed, 20 Feb 2019 17:43:05 GMT", "version": "v3" } ]
2019-04-23
[ [ "Cornélusse", "Bertrand", "" ], [ "Savelli", "Iacopo", "" ], [ "Paoletti", "Simone", "" ], [ "Giannitrapani", "Antonio", "" ], [ "Vicino", "Antonio", "" ] ]
This work fits in the context of community microgrids, where members of a community can exchange energy and services among themselves, without going through the usual channels of the public electricity grid. We introduce and analyze a framework to operate a community microgrid, and to share the resulting revenues and c...
1012.5751
Amir Shachar
Amir Shachar
Introduction to Semi-discrete Calculus
null
null
null
null
cs.DM math.CA
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The Infinitesimal Calculus explores mainly two measurements: the instantaneous rates of change and the accumulation of quantities. This work shows that scientists, engineers, mathematicians, and teachers increasingly apply another change measurements tool: functions' local trends. While it seems to be a special case ...
[ { "created": "Tue, 28 Dec 2010 12:55:07 GMT", "version": "v1" }, { "created": "Wed, 9 Mar 2011 16:58:06 GMT", "version": "v2" }, { "created": "Mon, 25 Jul 2011 22:33:55 GMT", "version": "v3" }, { "created": "Thu, 10 Apr 2014 18:37:23 GMT", "version": "v4" }, { "cr...
2022-06-02
[ [ "Shachar", "Amir", "" ] ]
The Infinitesimal Calculus explores mainly two measurements: the instantaneous rates of change and the accumulation of quantities. This work shows that scientists, engineers, mathematicians, and teachers increasingly apply another change measurements tool: functions' local trends. While it seems to be a special case of...
2011.09970
Xingang Wang Professor
Yali Guo, Han Zhang, Liang Wang, Huawei Fan, and Xingang Wang
Transfer learning of chaotic systems
20 pages, 8 figures
Chaos 31, 011104 (2021)
10.1063/5.0033870
null
cs.NE nlin.CD
http://creativecommons.org/licenses/by-nc-nd/4.0/
Can a neural network trained by the time series of system A be used to predict the evolution of system B? This problem, knowing as transfer learning in a broad sense, is of great importance in machine learning and data mining, yet has not been addressed for chaotic systems. Here we investigate transfer learning of ch...
[ { "created": "Sun, 15 Nov 2020 04:09:35 GMT", "version": "v1" } ]
2021-02-23
[ [ "Guo", "Yali", "" ], [ "Zhang", "Han", "" ], [ "Wang", "Liang", "" ], [ "Fan", "Huawei", "" ], [ "Wang", "Xingang", "" ] ]
Can a neural network trained by the time series of system A be used to predict the evolution of system B? This problem, knowing as transfer learning in a broad sense, is of great importance in machine learning and data mining, yet has not been addressed for chaotic systems. Here we investigate transfer learning of chao...
1806.04761
Ciprian-Octavian Truica
Ciprian-Octavian Truic\u{a} and Florin R\u{a}dulescu and Alexandru Boicea and Ion Bucur
Performance evaluation for CRUD operations in asynchronously replicated document oriented database
null
null
10.1109/CSCS.2015.32
null
cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
NoSQL databases are becoming increasingly popular as more developers seek new ways for storing information. The popularity of these databases has risen due to their flexibility and scalability needed in domains like Big Data and Cloud Computing. This paper examines asynchronous replication, one of the key features fo...
[ { "created": "Tue, 12 Jun 2018 20:38:56 GMT", "version": "v1" } ]
2018-06-14
[ [ "Truică", "Ciprian-Octavian", "" ], [ "Rădulescu", "Florin", "" ], [ "Boicea", "Alexandru", "" ], [ "Bucur", "Ion", "" ] ]
NoSQL databases are becoming increasingly popular as more developers seek new ways for storing information. The popularity of these databases has risen due to their flexibility and scalability needed in domains like Big Data and Cloud Computing. This paper examines asynchronous replication, one of the key features for ...
2403.13423
Xun Gong
Xun Gong, Yu Wu, Jinyu Li, Shujie Liu, Rui Zhao, Xie Chen, Yanmin Qian
Advanced Long-Content Speech Recognition With Factorized Neural Transducer
Accepted by TASLP 2024
IEEE/ACM Transactions on Audio, Speech, and Language Processing, vol. 32, pp. 1803-1815, 2024
10.1109/TASLP.2024.3350893
null
cs.SD eess.AS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we propose two novel approaches, which integrate long-content information into the factorized neural transducer (FNT) based architecture in both non-streaming (referred to as LongFNT ) and streaming (referred to as SLongFNT ) scenarios. We first investigate whether long-content transcriptions can impro...
[ { "created": "Wed, 20 Mar 2024 09:09:49 GMT", "version": "v1" } ]
2024-03-21
[ [ "Gong", "Xun", "" ], [ "Wu", "Yu", "" ], [ "Li", "Jinyu", "" ], [ "Liu", "Shujie", "" ], [ "Zhao", "Rui", "" ], [ "Chen", "Xie", "" ], [ "Qian", "Yanmin", "" ] ]
In this paper, we propose two novel approaches, which integrate long-content information into the factorized neural transducer (FNT) based architecture in both non-streaming (referred to as LongFNT ) and streaming (referred to as SLongFNT ) scenarios. We first investigate whether long-content transcriptions can improve...
1408.2037
Issei Sato
Issei Sato, Kenichi Kurihara, Shu Tanaka, Hiroshi Nakagawa, Seiji Miyashita
Quantum Annealing for Variational Bayes Inference
Appears in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI2009)
null
null
UAI-P-2009-PG-479-486
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simulated annealing for variational Bayes (SAVB) inference. QAVB is as easy as SAVB to implement. Experiments revealed QAVB finds a better loca...
[ { "created": "Sat, 9 Aug 2014 05:33:21 GMT", "version": "v1" } ]
2014-08-12
[ [ "Sato", "Issei", "" ], [ "Kurihara", "Kenichi", "" ], [ "Tanaka", "Shu", "" ], [ "Nakagawa", "Hiroshi", "" ], [ "Miyashita", "Seiji", "" ] ]
This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simulated annealing for variational Bayes (SAVB) inference. QAVB is as easy as SAVB to implement. Experiments revealed QAVB finds a better local ...
2305.04971
Peng Lu
Peng Lu, Ahmad Rashid, Ivan Kobyzev, Mehdi Rezagholizadeh, Philippe Langlais
LABO: Towards Learning Optimal Label Regularization via Bi-level Optimization
Accepted at ACL2023 (Findings)
null
null
null
cs.LG cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Regularization techniques are crucial to improving the generalization performance and training efficiency of deep neural networks. Many deep learning algorithms rely on weight decay, dropout, batch/layer normalization to converge faster and generalize. Label Smoothing (LS) is another simple, versatile and efficient r...
[ { "created": "Mon, 8 May 2023 18:04:18 GMT", "version": "v1" } ]
2023-05-10
[ [ "Lu", "Peng", "" ], [ "Rashid", "Ahmad", "" ], [ "Kobyzev", "Ivan", "" ], [ "Rezagholizadeh", "Mehdi", "" ], [ "Langlais", "Philippe", "" ] ]
Regularization techniques are crucial to improving the generalization performance and training efficiency of deep neural networks. Many deep learning algorithms rely on weight decay, dropout, batch/layer normalization to converge faster and generalize. Label Smoothing (LS) is another simple, versatile and efficient reg...
2006.08737
Raj Kumar Maity
Avishek Ghosh, Raj Kumar Maity and Arya Mazumdar
Distributed Newton Can Communicate Less and Resist Byzantine Workers
null
null
null
null
cs.LG cs.DC math.OC stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We develop a distributed second order optimization algorithm that is communication-efficient as well as robust against Byzantine failures of the worker machines. We propose COMRADE (COMunication-efficient and Robust Approximate Distributed nEwton), an iterative second order algorithm, where the worker machines commun...
[ { "created": "Mon, 15 Jun 2020 20:16:15 GMT", "version": "v1" } ]
2021-03-19
[ [ "Ghosh", "Avishek", "" ], [ "Maity", "Raj Kumar", "" ], [ "Mazumdar", "Arya", "" ] ]
We develop a distributed second order optimization algorithm that is communication-efficient as well as robust against Byzantine failures of the worker machines. We propose COMRADE (COMunication-efficient and Robust Approximate Distributed nEwton), an iterative second order algorithm, where the worker machines communic...
2108.10417
Yiyang Li
GuoLiang Li and Yiyang Li
Recurrent multiple shared layers in Depth for Neural Machine Translation
8 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:2107.14590
null
null
null
cs.CL cs.LG
http://creativecommons.org/licenses/by-sa/4.0/
Learning deeper models is usually a simple and effective approach to improve model performance, but deeper models have larger model parameters and are more difficult to train. To get a deeper model, simply stacking more layers of the model seems to work well, but previous works have claimed that it cannot benefit the...
[ { "created": "Mon, 23 Aug 2021 21:21:45 GMT", "version": "v1" }, { "created": "Thu, 26 Aug 2021 13:32:50 GMT", "version": "v2" } ]
2021-08-27
[ [ "Li", "GuoLiang", "" ], [ "Li", "Yiyang", "" ] ]
Learning deeper models is usually a simple and effective approach to improve model performance, but deeper models have larger model parameters and are more difficult to train. To get a deeper model, simply stacking more layers of the model seems to work well, but previous works have claimed that it cannot benefit the m...
2407.06366
Minghan Wei
Cheng Peng, Minghan Wei, Volkan Isler
Stochastic Traveling Salesperson Problem with Neighborhoods for Object Detection
2023 IEEE International Conference on Robotics and Automation
null
null
null
cs.DS
http://creativecommons.org/licenses/by/4.0/
We introduce a new route-finding problem which considers perception and travel costs simultaneously. Specifically, we consider the problem of finding the shortest tour such that all objects of interest can be detected successfully. To represent a viable detection region for each object, we propose to use an entropy-b...
[ { "created": "Mon, 8 Jul 2024 20:12:45 GMT", "version": "v1" } ]
2024-07-10
[ [ "Peng", "Cheng", "" ], [ "Wei", "Minghan", "" ], [ "Isler", "Volkan", "" ] ]
We introduce a new route-finding problem which considers perception and travel costs simultaneously. Specifically, we consider the problem of finding the shortest tour such that all objects of interest can be detected successfully. To represent a viable detection region for each object, we propose to use an entropy-bas...
1710.00954
Anirban Ghosh
Adrian Dumitrescu, Anirban Ghosh, Csaba D. T\'oth
Online Unit Covering in Euclidean Space
14 pages, 5 figures, A preliminary version in: Proceedings of the 27th Annual Fall Workshop on Computational Geometry, Stony Brook University, USA, 2017. arXiv admin note: text overlap with arXiv:1708.02662
null
null
null
cs.CG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We revisit the online Unit Covering problem in higher dimensions: Given a set of $n$ points in $\mathbb{R}^d$, that arrive one by one, cover the points by balls of unit radius, so as to minimize the number of balls used. In this paper, we work in $\mathbb{R}^d$ using Euclidean distance. The current best competitive r...
[ { "created": "Tue, 3 Oct 2017 01:40:43 GMT", "version": "v1" }, { "created": "Sun, 11 Feb 2018 16:51:24 GMT", "version": "v2" }, { "created": "Fri, 24 Aug 2018 23:55:41 GMT", "version": "v3" } ]
2018-08-29
[ [ "Dumitrescu", "Adrian", "" ], [ "Ghosh", "Anirban", "" ], [ "Tóth", "Csaba D.", "" ] ]
We revisit the online Unit Covering problem in higher dimensions: Given a set of $n$ points in $\mathbb{R}^d$, that arrive one by one, cover the points by balls of unit radius, so as to minimize the number of balls used. In this paper, we work in $\mathbb{R}^d$ using Euclidean distance. The current best competitive rat...
2201.12428
Tyler Cody
Tyler Cody, Erin Lanus, Daniel D. Doyle, Laura Freeman
Systematic Training and Testing for Machine Learning Using Combinatorial Interaction Testing
null
null
null
null
cs.LG cs.SE stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper demonstrates the systematic use of combinatorial coverage for selecting and characterizing test and training sets for machine learning models. The presented work adapts combinatorial interaction testing, which has been successfully leveraged in identifying faults in software testing, to characterize data u...
[ { "created": "Fri, 28 Jan 2022 21:33:31 GMT", "version": "v1" } ]
2022-02-01
[ [ "Cody", "Tyler", "" ], [ "Lanus", "Erin", "" ], [ "Doyle", "Daniel D.", "" ], [ "Freeman", "Laura", "" ] ]
This paper demonstrates the systematic use of combinatorial coverage for selecting and characterizing test and training sets for machine learning models. The presented work adapts combinatorial interaction testing, which has been successfully leveraged in identifying faults in software testing, to characterize data use...
1509.07244
Shawn Andrews
Shawn Andrews and Ghassan Hamarneh
Multi-Region Probabilistic Dice Similarity Coefficient using the Aitchison Distance and Bipartite Graph Matching
8 pages. 5 figures
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Validation of image segmentation methods is of critical importance. Probabilistic image segmentation is increasingly popular as it captures uncertainty in the results. Image segmentation methods that support multi-region (as opposed to binary) delineation are more favourable as they capture interactions between the d...
[ { "created": "Thu, 24 Sep 2015 05:56:38 GMT", "version": "v1" }, { "created": "Fri, 2 Oct 2015 06:25:17 GMT", "version": "v2" }, { "created": "Tue, 13 Oct 2015 04:11:25 GMT", "version": "v3" } ]
2015-10-14
[ [ "Andrews", "Shawn", "" ], [ "Hamarneh", "Ghassan", "" ] ]
Validation of image segmentation methods is of critical importance. Probabilistic image segmentation is increasingly popular as it captures uncertainty in the results. Image segmentation methods that support multi-region (as opposed to binary) delineation are more favourable as they capture interactions between the dif...
2103.10873
Daniele Palossi
Daniele Palossi, Nicky Zimmerman, Alessio Burrello, Francesco Conti, Hanna M\"uller, Luca Maria Gambardella, Luca Benini, Alessandro Giusti, J\'er\^ome Guzzi
Fully Onboard AI-powered Human-Drone Pose Estimation on Ultra-low Power Autonomous Flying Nano-UAVs
15 pages, 15 figures, 4 tables. This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible
null
null
null
cs.RO cs.SY eess.SY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Artificial intelligence-powered pocket-sized air robots have the potential to revolutionize the Internet-of-Things ecosystem, acting as autonomous, unobtrusive, and ubiquitous smart sensors. With a few cm$^{2}$ form-factor, nano-sized unmanned aerial vehicles (UAVs) are the natural befit for indoor human-drone intera...
[ { "created": "Fri, 19 Mar 2021 15:56:58 GMT", "version": "v1" } ]
2021-03-22
[ [ "Palossi", "Daniele", "" ], [ "Zimmerman", "Nicky", "" ], [ "Burrello", "Alessio", "" ], [ "Conti", "Francesco", "" ], [ "Müller", "Hanna", "" ], [ "Gambardella", "Luca Maria", "" ], [ "Benini", "Luca", "" ...
Artificial intelligence-powered pocket-sized air robots have the potential to revolutionize the Internet-of-Things ecosystem, acting as autonomous, unobtrusive, and ubiquitous smart sensors. With a few cm$^{2}$ form-factor, nano-sized unmanned aerial vehicles (UAVs) are the natural befit for indoor human-drone interact...
1706.02785
Ophir Lojkine
Ophir Lojkine
Optimal parameters for bloom-filtered joins in Spark
The article is in Russian, but an analysis of the data used in it is available in english at the following address: https://github.com/lovasoa/spark-bloomfiltered-join-analysis/blob/master/analysis.ipynb
null
null
null
cs.DC cs.DB
http://creativecommons.org/licenses/by/4.0/
In this paper, we present an algorithm that joins relational database tables efficiently in a distributed environment using Bloom filters of an optimal size. We propose not to use fixed-size bloom filters as in previous research, but to find an optimal size for the bloom filters, by creating a mathematical model of t...
[ { "created": "Thu, 8 Jun 2017 22:29:41 GMT", "version": "v1" }, { "created": "Mon, 12 Jun 2017 12:49:15 GMT", "version": "v2" } ]
2017-06-13
[ [ "Lojkine", "Ophir", "" ] ]
In this paper, we present an algorithm that joins relational database tables efficiently in a distributed environment using Bloom filters of an optimal size. We propose not to use fixed-size bloom filters as in previous research, but to find an optimal size for the bloom filters, by creating a mathematical model of the...
2011.04461
Nicholas Adrian
Nicholas Adrian and Quang-Cuong Pham
MoboTSP: Solving the Task Sequencing Problem for Mobile Manipulators
Revised version of arXiv:2011.04461. The edit includes reorganizing and rewriting for better clarity without any changes to the methodology
null
null
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce a new approach to tackle the mobile manipulator task sequencing problem. We leverage computational geometry, graph theory and combinatorial optimization to yield a principled method to segment the task-space targets into clusters, analytically determine reachable base pose for each cluster, and find task...
[ { "created": "Mon, 9 Nov 2020 14:37:30 GMT", "version": "v1" }, { "created": "Wed, 20 Oct 2021 02:37:06 GMT", "version": "v2" } ]
2021-10-22
[ [ "Adrian", "Nicholas", "" ], [ "Pham", "Quang-Cuong", "" ] ]
We introduce a new approach to tackle the mobile manipulator task sequencing problem. We leverage computational geometry, graph theory and combinatorial optimization to yield a principled method to segment the task-space targets into clusters, analytically determine reachable base pose for each cluster, and find task s...
2207.13283
Zhuqing Liu
Zhuqing Liu, Xin Zhang, Prashant Khanduri, Songtao Lu, and Jia Liu
INTERACT: Achieving Low Sample and Communication Complexities in Decentralized Bilevel Learning over Networks
null
null
null
null
cs.LG math.OC stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In recent years, decentralized bilevel optimization problems have received increasing attention in the networking and machine learning communities thanks to their versatility in modeling decentralized learning problems over peer-to-peer networks (e.g., multi-agent meta-learning, multi-agent reinforcement learning, pe...
[ { "created": "Wed, 27 Jul 2022 04:19:28 GMT", "version": "v1" }, { "created": "Thu, 28 Jul 2022 14:34:30 GMT", "version": "v2" }, { "created": "Wed, 5 Oct 2022 19:38:14 GMT", "version": "v3" } ]
2022-10-07
[ [ "Liu", "Zhuqing", "" ], [ "Zhang", "Xin", "" ], [ "Khanduri", "Prashant", "" ], [ "Lu", "Songtao", "" ], [ "Liu", "Jia", "" ] ]
In recent years, decentralized bilevel optimization problems have received increasing attention in the networking and machine learning communities thanks to their versatility in modeling decentralized learning problems over peer-to-peer networks (e.g., multi-agent meta-learning, multi-agent reinforcement learning, pers...
2408.04910
Muntasir Adnan
Muntasir Adnan, Buddhi Gamage, Zhiwei Xu, Damith Herath, Carlos C. N. Kuhn
Unleashing Artificial Cognition: Integrating Multiple AI Systems
null
null
null
null
cs.AI
http://creativecommons.org/licenses/by/4.0/
In this study, we present an innovative fusion of language models and query analysis techniques to unlock cognition in artificial intelligence. Our system seamlessly integrates a Chess engine with a language model, enabling it to predict moves and provide strategic explanations. Leveraging a vector database to achiev...
[ { "created": "Fri, 9 Aug 2024 07:36:30 GMT", "version": "v1" }, { "created": "Mon, 12 Aug 2024 04:25:39 GMT", "version": "v2" }, { "created": "Wed, 14 Aug 2024 02:28:19 GMT", "version": "v3" } ]
2024-08-15
[ [ "Adnan", "Muntasir", "" ], [ "Gamage", "Buddhi", "" ], [ "Xu", "Zhiwei", "" ], [ "Herath", "Damith", "" ], [ "Kuhn", "Carlos C. N.", "" ] ]
In this study, we present an innovative fusion of language models and query analysis techniques to unlock cognition in artificial intelligence. Our system seamlessly integrates a Chess engine with a language model, enabling it to predict moves and provide strategic explanations. Leveraging a vector database to achieve ...
2401.09691
Koki Yamane
Koki Yamane, Sho Sakaino, Toshiaki Tsuji
Imitation Learning Inputting Image Feature to Each Layer of Neural Network
6 pages, 4 figures, Accepted at AMC2024
null
null
null
cs.RO cs.AI cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Imitation learning enables robots to learn and replicate human behavior from training data. Recent advances in machine learning enable end-to-end learning approaches that directly process high-dimensional observation data, such as images. However, these approaches face a critical challenge when processing data from m...
[ { "created": "Thu, 18 Jan 2024 02:44:18 GMT", "version": "v1" }, { "created": "Fri, 19 Jan 2024 12:43:36 GMT", "version": "v2" } ]
2024-01-22
[ [ "Yamane", "Koki", "" ], [ "Sakaino", "Sho", "" ], [ "Tsuji", "Toshiaki", "" ] ]
Imitation learning enables robots to learn and replicate human behavior from training data. Recent advances in machine learning enable end-to-end learning approaches that directly process high-dimensional observation data, such as images. However, these approaches face a critical challenge when processing data from mul...
2104.12274
Yusha Liu
Yusha Liu, Osvaldo Simeone
HyperRNN: Deep Learning-Aided Downlink CSI Acquisition via Partial Channel Reciprocity for FDD Massive MIMO
To be presented at SPAWC 2021
null
null
null
cs.IT eess.SP math.IT
http://creativecommons.org/licenses/by/4.0/
In order to unlock the full advantages of massive multiple input multiple output (MIMO) in the downlink, channel state information (CSI) is required at the base station (BS) to optimize the beamforming matrices. In frequency division duplex (FDD) systems, full channel reciprocity does not hold, and CSI acquisition ge...
[ { "created": "Sun, 25 Apr 2021 22:03:59 GMT", "version": "v1" }, { "created": "Sun, 2 May 2021 04:28:00 GMT", "version": "v2" }, { "created": "Thu, 8 Jul 2021 10:18:54 GMT", "version": "v3" } ]
2021-07-09
[ [ "Liu", "Yusha", "" ], [ "Simeone", "Osvaldo", "" ] ]
In order to unlock the full advantages of massive multiple input multiple output (MIMO) in the downlink, channel state information (CSI) is required at the base station (BS) to optimize the beamforming matrices. In frequency division duplex (FDD) systems, full channel reciprocity does not hold, and CSI acquisition gene...
1808.01976
Jonas Rauber
Wieland Brendel, Jonas Rauber, Alexey Kurakin, Nicolas Papernot, Behar Veliqi, Marcel Salath\'e, Sharada P. Mohanty, Matthias Bethge
Adversarial Vision Challenge
https://www.crowdai.org/challenges/adversarial-vision-challenge
null
null
null
cs.LG cs.CV stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The NIPS 2018 Adversarial Vision Challenge is a competition to facilitate measurable progress towards robust machine vision models and more generally applicable adversarial attacks. This document is an updated version of our competition proposal that was accepted in the competition track of 32nd Conference on Neural ...
[ { "created": "Mon, 6 Aug 2018 16:13:43 GMT", "version": "v1" }, { "created": "Thu, 6 Dec 2018 18:21:49 GMT", "version": "v2" } ]
2018-12-07
[ [ "Brendel", "Wieland", "" ], [ "Rauber", "Jonas", "" ], [ "Kurakin", "Alexey", "" ], [ "Papernot", "Nicolas", "" ], [ "Veliqi", "Behar", "" ], [ "Salathé", "Marcel", "" ], [ "Mohanty", "Sharada P.", "" ], ...
The NIPS 2018 Adversarial Vision Challenge is a competition to facilitate measurable progress towards robust machine vision models and more generally applicable adversarial attacks. This document is an updated version of our competition proposal that was accepted in the competition track of 32nd Conference on Neural In...
1901.00431
Dimitrios Rafailidis Dr
Dimitrios Rafailidis and Yannis Manolopoulos
The Technological Gap Between Virtual Assistants and Recommendation Systems
6 pages, Report
null
null
null
cs.IR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Virtual assistants, also known as intelligent conversational systems such as Google's Virtual Assistant and Apple's Siri, interact with human-like responses to users' queries and finish specific tasks. Meanwhile, existing recommendation technologies model users' evolving, diverse and multi-aspect preferences to gener...
[ { "created": "Fri, 21 Dec 2018 00:50:03 GMT", "version": "v1" }, { "created": "Sun, 6 Jan 2019 13:46:09 GMT", "version": "v2" } ]
2019-01-08
[ [ "Rafailidis", "Dimitrios", "" ], [ "Manolopoulos", "Yannis", "" ] ]
Virtual assistants, also known as intelligent conversational systems such as Google's Virtual Assistant and Apple's Siri, interact with human-like responses to users' queries and finish specific tasks. Meanwhile, existing recommendation technologies model users' evolving, diverse and multi-aspect preferences to generat...
1611.09701
Sanat Biswas
Sanat Biswas, Li Qiao, Andrew Dempster
Computationally Efficient Unscented Kalman Filtering Techniques for Launch Vehicle Navigation using a Space-borne GPS Receiver
null
Proc. ION GNSS+ 2016, Institute of Navigation, Portland, Oregon, USA, September 14, 2016
null
null
cs.SY
http://creativecommons.org/licenses/by-nc-sa/4.0/
The Extended Kalman Filter (EKF) is a well established technique for position and velocity estimation. However, the performance of the EKF degrades considerably in highly non-linear system applications as it requires local linearisation in its prediction stage. The Unscented Kalman Filter (UKF) was developed to addre...
[ { "created": "Fri, 25 Nov 2016 01:41:08 GMT", "version": "v1" } ]
2016-11-30
[ [ "Biswas", "Sanat", "" ], [ "Qiao", "Li", "" ], [ "Dempster", "Andrew", "" ] ]
The Extended Kalman Filter (EKF) is a well established technique for position and velocity estimation. However, the performance of the EKF degrades considerably in highly non-linear system applications as it requires local linearisation in its prediction stage. The Unscented Kalman Filter (UKF) was developed to address...
2305.17268
Yucheng Li
Yucheng Li, Shun Wang, Chenghua Lin, Guerin Frank
Metaphor Detection via Explicit Basic Meanings Modelling
ACL 2023
null
null
null
cs.CL
http://creativecommons.org/licenses/by/4.0/
One noticeable trend in metaphor detection is the embrace of linguistic theories such as the metaphor identification procedure (MIP) for model architecture design. While MIP clearly defines that the metaphoricity of a lexical unit is determined based on the contrast between its \textit{contextual meaning} and its \te...
[ { "created": "Fri, 26 May 2023 21:25:05 GMT", "version": "v1" } ]
2023-05-30
[ [ "Li", "Yucheng", "" ], [ "Wang", "Shun", "" ], [ "Lin", "Chenghua", "" ], [ "Frank", "Guerin", "" ] ]
One noticeable trend in metaphor detection is the embrace of linguistic theories such as the metaphor identification procedure (MIP) for model architecture design. While MIP clearly defines that the metaphoricity of a lexical unit is determined based on the contrast between its \textit{contextual meaning} and its \text...
1610.05419
Ali Khalajmehrabadi
Ali Khalajmehrabadi, Nikolaos Gatsis, Daniel Pack and David Akopian
A Joint Indoor WLAN Localization and Outlier Detection Scheme Using LASSO and Elastic-Net Optimization Techniques
null
null
10.1109/TMC.2016.2616465
null
cs.NI cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we introduce two indoor Wireless Local Area Network (WLAN) positioning methods using augmented sparse recovery algorithms. These schemes render a sparse user's position vector, and in parallel, minimize the distance between the online measurement and radio map. The overall localization scheme for both ...
[ { "created": "Tue, 18 Oct 2016 03:37:11 GMT", "version": "v1" } ]
2016-10-20
[ [ "Khalajmehrabadi", "Ali", "" ], [ "Gatsis", "Nikolaos", "" ], [ "Pack", "Daniel", "" ], [ "Akopian", "David", "" ] ]
In this paper, we introduce two indoor Wireless Local Area Network (WLAN) positioning methods using augmented sparse recovery algorithms. These schemes render a sparse user's position vector, and in parallel, minimize the distance between the online measurement and radio map. The overall localization scheme for both me...
2103.04443
Oliver Hohlfeld
Daniel Kopp and Christoph Dietzel and Oliver Hohlfeld
DDoS Never Dies? An IXP Perspective on DDoS Amplification Attacks
To appear at PAM 2021
null
null
null
cs.CR cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
DDoS attacks remain a major security threat to the continuous operation of Internet edge infrastructures, web services, and cloud platforms. While a large body of research focuses on DDoS detection and protection, to date we ultimately failed to eradicate DDoS altogether. Yet, the landscape of DDoS attack mechanisms ...
[ { "created": "Sun, 7 Mar 2021 20:22:03 GMT", "version": "v1" } ]
2021-03-09
[ [ "Kopp", "Daniel", "" ], [ "Dietzel", "Christoph", "" ], [ "Hohlfeld", "Oliver", "" ] ]
DDoS attacks remain a major security threat to the continuous operation of Internet edge infrastructures, web services, and cloud platforms. While a large body of research focuses on DDoS detection and protection, to date we ultimately failed to eradicate DDoS altogether. Yet, the landscape of DDoS attack mechanisms is...
2001.03643
Sajjad Arshad
Sajjad Arshad
Understanding and Mitigating the Security Risks of Content Inclusion in Web Browsers
Doctor of Philosophy (PhD) Thesis Khoury College of Computer Sciences, Northeastern University Boston, MA, USA, April 2019
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Thanks to the wide range of features offered by web browsers, modern websites include various types of content such as JavaScript and CSS in order to create interactive user interfaces. Browser vendors also provided extensions to enhance web browsers with additional useful capabilities that are not necessarily mainta...
[ { "created": "Fri, 10 Jan 2020 19:38:58 GMT", "version": "v1" } ]
2020-01-14
[ [ "Arshad", "Sajjad", "" ] ]
Thanks to the wide range of features offered by web browsers, modern websites include various types of content such as JavaScript and CSS in order to create interactive user interfaces. Browser vendors also provided extensions to enhance web browsers with additional useful capabilities that are not necessarily maintain...
1511.08447
Brijesh Dongol
Brijesh Dongol, Robert M. Hierons
Decidability and Complexity for Quiescent Consistency and its Variations
null
null
null
null
cs.LO cs.DC cs.DS cs.FL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the object's behaviours in quiescent states, i.e., states in which none of the object's operations are being executed. Correctness of an implementation object is defined in terms of a corresponding abstract specification. T...
[ { "created": "Thu, 26 Nov 2015 16:46:30 GMT", "version": "v1" } ]
2015-11-30
[ [ "Dongol", "Brijesh", "" ], [ "Hierons", "Robert M.", "" ] ]
Quiescent consistency is a notion of correctness for a concurrent object that gives meaning to the object's behaviours in quiescent states, i.e., states in which none of the object's operations are being executed. Correctness of an implementation object is defined in terms of a corresponding abstract specification. Thi...
2202.01013
Chukwuemeka Ibe
Ibe Chukwuemeka Emmanuel and Ekaterina Mitrofanova
Fairness of Machine Learning Algorithms in Demography
This is an empirical replication study but with other demographic data. The theory and method description is heavily based on the arXiv:2006.10531
null
null
null
cs.LG cs.AI cs.CY
http://creativecommons.org/licenses/by/4.0/
The paper is devoted to the study of the model fairness and process fairness of the Russian demographic dataset by making predictions of divorce of the 1st marriage, religiosity, 1st employment and completion of education. Our goal was to make classifiers more equitable by reducing their reliance on sensitive feature...
[ { "created": "Wed, 2 Feb 2022 13:12:35 GMT", "version": "v1" } ]
2022-02-03
[ [ "Emmanuel", "Ibe Chukwuemeka", "" ], [ "Mitrofanova", "Ekaterina", "" ] ]
The paper is devoted to the study of the model fairness and process fairness of the Russian demographic dataset by making predictions of divorce of the 1st marriage, religiosity, 1st employment and completion of education. Our goal was to make classifiers more equitable by reducing their reliance on sensitive features ...
2405.09880
Yuchen Guo
Yuchen Guo, Hanqun Cao, Lok Ming Lui
Deep Learning-Based Quasi-Conformal Surface Registration for Partial 3D Faces Applied to Facial Recognition
null
null
null
null
cs.CV
http://creativecommons.org/licenses/by/4.0/
3D face registration is an important process in which a 3D face model is aligned and mapped to a template face. However, the task of 3D face registration becomes particularly challenging when dealing with partial face data, where only limited facial information is available. To address this challenge, this paper pres...
[ { "created": "Thu, 16 May 2024 08:03:41 GMT", "version": "v1" } ]
2024-05-17
[ [ "Guo", "Yuchen", "" ], [ "Cao", "Hanqun", "" ], [ "Lui", "Lok Ming", "" ] ]
3D face registration is an important process in which a 3D face model is aligned and mapped to a template face. However, the task of 3D face registration becomes particularly challenging when dealing with partial face data, where only limited facial information is available. To address this challenge, this paper presen...
1810.11934
Shantanu Shahane
Shantanu Shahane, Narayana R. Aluru, Surya Pratap Vanka
Uncertainty Quantification in Three Dimensional Natural Convection using Polynomial Chaos Expansion and Deep Neural Networks
null
null
10.1016/j.ijheatmasstransfer.2019.05.014
null
cs.NA physics.comp-ph
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper analyzes the effects of input uncertainties on the outputs of a three dimensional natural convection problem in a differentially heated cubical enclosure. Two different cases are considered for parameter uncertainty propagation and global sensitivity analysis. In case A, stochastic variation is introduced ...
[ { "created": "Mon, 29 Oct 2018 03:24:11 GMT", "version": "v1" }, { "created": "Tue, 8 Jan 2019 15:41:30 GMT", "version": "v2" } ]
2020-10-06
[ [ "Shahane", "Shantanu", "" ], [ "Aluru", "Narayana R.", "" ], [ "Vanka", "Surya Pratap", "" ] ]
This paper analyzes the effects of input uncertainties on the outputs of a three dimensional natural convection problem in a differentially heated cubical enclosure. Two different cases are considered for parameter uncertainty propagation and global sensitivity analysis. In case A, stochastic variation is introduced in...
1209.6476
Reena Philips Mrs
K. S. Rashmi, V. Suma, M. Vaidehi
Factors Influencing Job Rejections in Cloud Environment
6 Pages, 5 Figures, 8 Tables
null
null
null
cs.DC cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The IT organizations invests heavy capital by consuming large scale infrastructure and advanced operating platforms. The advances in technology has resulted in emergence of cloud computing, which is promising technology to achieve the aforementioned objective. At the peak hours, the jobs arriving to the cloud system ...
[ { "created": "Fri, 28 Sep 2012 10:39:04 GMT", "version": "v1" } ]
2012-10-01
[ [ "Rashmi", "K. S.", "" ], [ "Suma", "V.", "" ], [ "Vaidehi", "M.", "" ] ]
The IT organizations invests heavy capital by consuming large scale infrastructure and advanced operating platforms. The advances in technology has resulted in emergence of cloud computing, which is promising technology to achieve the aforementioned objective. At the peak hours, the jobs arriving to the cloud system ar...
1911.10499
Milan Lopuha\"a-Zwakenberg
Milan Lopuha\"a-Zwakenberg, Zitao Li, Boris \v{S}kori\'c and Ninghui Li
Improving Frequency Estimation under Local Differential Privacy
null
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Local Differential Privacy protocols are stochastic protocols used in data aggregation when individual users do not trust the data aggregator with their private data. In such protocols there is a fundamental tradeoff between user privacy and aggregator utility. In the setting of frequency estimation, established boun...
[ { "created": "Sun, 24 Nov 2019 10:51:43 GMT", "version": "v1" }, { "created": "Tue, 1 Sep 2020 08:02:53 GMT", "version": "v2" } ]
2020-09-04
[ [ "Lopuhaä-Zwakenberg", "Milan", "" ], [ "Li", "Zitao", "" ], [ "Škorić", "Boris", "" ], [ "Li", "Ninghui", "" ] ]
Local Differential Privacy protocols are stochastic protocols used in data aggregation when individual users do not trust the data aggregator with their private data. In such protocols there is a fundamental tradeoff between user privacy and aggregator utility. In the setting of frequency estimation, established bounds...
2011.07661
Luca Parisi
Luca Parisi, Renfei Ma, Narrendar RaviChandran and Matteo Lanzillotta
hyper-sinh: An Accurate and Reliable Function from Shallow to Deep Learning in TensorFlow and Keras
19 pages, 6 listings/Python code snippets, 4 figures, 5 tables
null
10.1016/j.mlwa.2021.100112
null
cs.CV cs.AI cs.CL cs.LG cs.NE
http://creativecommons.org/licenses/by/4.0/
This paper presents the 'hyper-sinh', a variation of the m-arcsinh activation function suitable for Deep Learning (DL)-based algorithms for supervised learning, such as Convolutional Neural Networks (CNN). hyper-sinh, developed in the open source Python libraries TensorFlow and Keras, is thus described and validated ...
[ { "created": "Sun, 15 Nov 2020 23:38:59 GMT", "version": "v1" } ]
2021-08-19
[ [ "Parisi", "Luca", "" ], [ "Ma", "Renfei", "" ], [ "RaviChandran", "Narrendar", "" ], [ "Lanzillotta", "Matteo", "" ] ]
This paper presents the 'hyper-sinh', a variation of the m-arcsinh activation function suitable for Deep Learning (DL)-based algorithms for supervised learning, such as Convolutional Neural Networks (CNN). hyper-sinh, developed in the open source Python libraries TensorFlow and Keras, is thus described and validated as...
1911.01318
Michael Segundo Ortiz
Michael Segundo Ortz
Sequential/Spatial, a Survey of Interactive Information Retrieval Methods for Controlled Experimentation and Evaluation
null
null
null
null
cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This survey presents studies that investigated non-spatial (sequential) and spatial information retrieval systems in parallel during a battery of information-seeking tasks with respect to user navigational behaviors, incidental learning, retrieval performance, cognitive abilities & load, direct manipulation of 2D & 3...
[ { "created": "Mon, 4 Nov 2019 16:30:39 GMT", "version": "v1" } ]
2019-11-05
[ [ "Ortz", "Michael Segundo", "" ] ]
This survey presents studies that investigated non-spatial (sequential) and spatial information retrieval systems in parallel during a battery of information-seeking tasks with respect to user navigational behaviors, incidental learning, retrieval performance, cognitive abilities & load, direct manipulation of 2D & 3D ...
2308.00862
Sarah Shoker
Sarah Shoker, Andrew Reddie, Sarah Barrington, Ruby Booth, Miles Brundage, Husanjot Chahal, Michael Depp, Bill Drexel, Ritwik Gupta, Marina Favaro, Jake Hecla, Alan Hickey, Margarita Konaev, Kirthi Kumar, Nathan Lambert, Andrew Lohn, Cullen O'Keefe, Nazneen Rajani, Michael Sellitto, Robert Trager, Leah Walker, ...
Confidence-Building Measures for Artificial Intelligence: Workshop Proceedings
null
null
null
null
cs.CY
http://creativecommons.org/licenses/by/4.0/
Foundation models could eventually introduce several pathways for undermining state security: accidents, inadvertent escalation, unintentional conflict, the proliferation of weapons, and the interference with human diplomacy are just a few on a long list. The Confidence-Building Measures for Artificial Intelligence w...
[ { "created": "Tue, 1 Aug 2023 22:20:11 GMT", "version": "v1" }, { "created": "Thu, 3 Aug 2023 20:06:39 GMT", "version": "v2" } ]
2023-08-07
[ [ "Shoker", "Sarah", "" ], [ "Reddie", "Andrew", "" ], [ "Barrington", "Sarah", "" ], [ "Booth", "Ruby", "" ], [ "Brundage", "Miles", "" ], [ "Chahal", "Husanjot", "" ], [ "Depp", "Michael", "" ], [ "...
Foundation models could eventually introduce several pathways for undermining state security: accidents, inadvertent escalation, unintentional conflict, the proliferation of weapons, and the interference with human diplomacy are just a few on a long list. The Confidence-Building Measures for Artificial Intelligence wor...
1902.09711
Jing Yan
Jing Nathan Yan, Oliver Schulte, Jiannan Wang, Reynold Cheng
Detecting Data Errors with Statistical Constraints
null
null
null
null
cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A powerful approach to detecting erroneous data is to check which potentially dirty data records are incompatible with a user's domain knowledge. Previous approaches allow the user to specify domain knowledge in the form of logical constraints (e.g., functional dependency and denial constraints). We extend the constr...
[ { "created": "Tue, 26 Feb 2019 02:44:20 GMT", "version": "v1" } ]
2019-02-27
[ [ "Yan", "Jing Nathan", "" ], [ "Schulte", "Oliver", "" ], [ "Wang", "Jiannan", "" ], [ "Cheng", "Reynold", "" ] ]
A powerful approach to detecting erroneous data is to check which potentially dirty data records are incompatible with a user's domain knowledge. Previous approaches allow the user to specify domain knowledge in the form of logical constraints (e.g., functional dependency and denial constraints). We extend the constrai...
2305.09641
Alexandros Lattas
Alexandros Lattas, Stylianos Moschoglou, Stylianos Ploumpis, Baris Gecer, Jiankang Deng, Stefanos Zafeiriou
FitMe: Deep Photorealistic 3D Morphable Model Avatars
Accepted at CVPR 2023, project page at https://lattas.github.io/fitme , 17 pages including supplementary material
null
null
null
cs.CV cs.GR cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we introduce FitMe, a facial reflectance model and a differentiable rendering optimization pipeline, that can be used to acquire high-fidelity renderable human avatars from single or multiple images. The model consists of a multi-modal style-based generator, that captures facial appearance in terms of ...
[ { "created": "Tue, 16 May 2023 17:42:45 GMT", "version": "v1" } ]
2023-05-17
[ [ "Lattas", "Alexandros", "" ], [ "Moschoglou", "Stylianos", "" ], [ "Ploumpis", "Stylianos", "" ], [ "Gecer", "Baris", "" ], [ "Deng", "Jiankang", "" ], [ "Zafeiriou", "Stefanos", "" ] ]
In this paper, we introduce FitMe, a facial reflectance model and a differentiable rendering optimization pipeline, that can be used to acquire high-fidelity renderable human avatars from single or multiple images. The model consists of a multi-modal style-based generator, that captures facial appearance in terms of di...
1712.07810
Zhao Li
Zhao Li, Fengjuan Guo, Kang G Shin, Yinghou Liu, and Jia Liu
Interference Steering to Manage Interference
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
To enable densely deployed base stations (BSs) or access points (APs) to serve an increasing number of users and provide diverse mobile services, we need to improve spectrum utilization in wireless communication networks. Although spectral efficiency (SE) can be enhanced via smart and dynamic resource allocation, int...
[ { "created": "Thu, 21 Dec 2017 06:32:43 GMT", "version": "v1" } ]
2017-12-22
[ [ "Li", "Zhao", "" ], [ "Guo", "Fengjuan", "" ], [ "Shin", "Kang G", "" ], [ "Liu", "Yinghou", "" ], [ "Liu", "Jia", "" ] ]
To enable densely deployed base stations (BSs) or access points (APs) to serve an increasing number of users and provide diverse mobile services, we need to improve spectrum utilization in wireless communication networks. Although spectral efficiency (SE) can be enhanced via smart and dynamic resource allocation, inter...
2211.09019
Minttu Alakuijala
Minttu Alakuijala, Gabriel Dulac-Arnold, Julien Mairal, Jean Ponce and Cordelia Schmid
Learning Reward Functions for Robotic Manipulation by Observing Humans
null
null
null
null
cs.RO cs.AI cs.CV cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Observing a human demonstrator manipulate objects provides a rich, scalable and inexpensive source of data for learning robotic policies. However, transferring skills from human videos to a robotic manipulator poses several challenges, not least a difference in action and observation spaces. In this work, we use unla...
[ { "created": "Wed, 16 Nov 2022 16:26:48 GMT", "version": "v1" }, { "created": "Tue, 7 Mar 2023 16:29:49 GMT", "version": "v2" } ]
2023-03-08
[ [ "Alakuijala", "Minttu", "" ], [ "Dulac-Arnold", "Gabriel", "" ], [ "Mairal", "Julien", "" ], [ "Ponce", "Jean", "" ], [ "Schmid", "Cordelia", "" ] ]
Observing a human demonstrator manipulate objects provides a rich, scalable and inexpensive source of data for learning robotic policies. However, transferring skills from human videos to a robotic manipulator poses several challenges, not least a difference in action and observation spaces. In this work, we use unlabe...
2204.07749
Mamtaj Akter
Mamtaj Akter, Amy Godfrey, Jess Kropczynski, Heather Lipford, and Pamela Wisniewski
From Parental Control to Joint Family Oversight: Can Parents and Teens Manage Mobile Online Safety and Privacy as Equals?
null
null
10.1145/3512904
null
cs.HC
http://creativecommons.org/licenses/by-nc-nd/4.0/
Our research aims to highlight and alleviate the complex tensions around online safety, privacy, and smartphone usage in families so that parents and teens can work together to better manage mobile privacy and security-related risks. We developed a mobile application ("app") for Community Oversight of Privacy and Sec...
[ { "created": "Sat, 16 Apr 2022 08:30:08 GMT", "version": "v1" }, { "created": "Tue, 16 Apr 2024 03:18:34 GMT", "version": "v2" } ]
2024-04-17
[ [ "Akter", "Mamtaj", "" ], [ "Godfrey", "Amy", "" ], [ "Kropczynski", "Jess", "" ], [ "Lipford", "Heather", "" ], [ "Wisniewski", "Pamela", "" ] ]
Our research aims to highlight and alleviate the complex tensions around online safety, privacy, and smartphone usage in families so that parents and teens can work together to better manage mobile privacy and security-related risks. We developed a mobile application ("app") for Community Oversight of Privacy and Secur...
1905.11244
Andrew Collins Mr
Andrew Collins, Joeran Beel
Document Embeddings vs. Keyphrases vs. Terms: An Online Evaluation in Digital Library Recommender Systems
null
null
null
null
cs.IR cs.DL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Many recommendation algorithms are available to digital library recommender system operators. The effectiveness of algorithms is largely unreported by way of online evaluation. We compare a standard term-based recommendation approach to two promising approaches for related-article recommendation in digital libraries:...
[ { "created": "Mon, 27 May 2019 14:05:50 GMT", "version": "v1" } ]
2019-05-28
[ [ "Collins", "Andrew", "" ], [ "Beel", "Joeran", "" ] ]
Many recommendation algorithms are available to digital library recommender system operators. The effectiveness of algorithms is largely unreported by way of online evaluation. We compare a standard term-based recommendation approach to two promising approaches for related-article recommendation in digital libraries: d...