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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1305.7482 | Uwe Aickelin | Xiyang Liu, Zhongjie Ren, Xiuling Chang, Haichang Gao, Uwe Aickelin | Draw a line on your PDA to authenticate | The sixth Symposium on Usable Privacy and Security, SOUPS2010, July
14-16, Redmond, WA, 7, 2010 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The trend toward a highly mobile workforce and the ubiquity of graphical
interfaces (such as the stylus and touch-screen) has enabled the emergence of
graphical authentications in Personal Digital Assistants (PDAs) [1]. However,
most of the current graphical password schemes are vulnerable to
shoulder-surfing [2,3], ... | [
{
"created": "Fri, 31 May 2013 16:41:47 GMT",
"version": "v1"
}
] | 2013-06-03 | [
[
"Liu",
"Xiyang",
""
],
[
"Ren",
"Zhongjie",
""
],
[
"Chang",
"Xiuling",
""
],
[
"Gao",
"Haichang",
""
],
[
"Aickelin",
"Uwe",
""
]
] | The trend toward a highly mobile workforce and the ubiquity of graphical interfaces (such as the stylus and touch-screen) has enabled the emergence of graphical authentications in Personal Digital Assistants (PDAs) [1]. However, most of the current graphical password schemes are vulnerable to shoulder-surfing [2,3], a ... |
2401.06772 | Qisong Li | Sijia Wei, Wenwen Zhang, Qisong Li, Jiang Zhao | Semantic Parsing for Question Answering over Knowledge Graphs | arXiv admin note: text overlap with arXiv:2401.02968 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | In this paper, we introduce a novel method with graph-to-segment mapping for
question answering over knowledge graphs, which helps understanding question
utterances. This method centers on semantic parsing, a key approach for
interpreting these utterances. The challenges lie in comprehending implicit
entities, relati... | [
{
"created": "Fri, 1 Dec 2023 20:45:06 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Jan 2024 20:56:20 GMT",
"version": "v2"
}
] | 2024-01-30 | [
[
"Wei",
"Sijia",
""
],
[
"Zhang",
"Wenwen",
""
],
[
"Li",
"Qisong",
""
],
[
"Zhao",
"Jiang",
""
]
] | In this paper, we introduce a novel method with graph-to-segment mapping for question answering over knowledge graphs, which helps understanding question utterances. This method centers on semantic parsing, a key approach for interpreting these utterances. The challenges lie in comprehending implicit entities, relation... |
1807.04735 | Maksims Dimitrijevs | Maksims Dimitrijevs, Abuzer Yakary{\i}lmaz | Probabilistic verification of all languages | 20 pages | null | null | null | cs.CC cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present three protocols for verifying all languages: (i) For any unary
(binary) language, there is a log-space (linear-space) interactive proof system
(IPS); (ii) for any language, there is a constant-space weak-IPS (the
non-members may not be rejected with high probability); and, (iii) for any
language, there is ... | [
{
"created": "Thu, 12 Jul 2018 17:20:27 GMT",
"version": "v1"
}
] | 2018-07-13 | [
[
"Dimitrijevs",
"Maksims",
""
],
[
"Yakaryılmaz",
"Abuzer",
""
]
] | We present three protocols for verifying all languages: (i) For any unary (binary) language, there is a log-space (linear-space) interactive proof system (IPS); (ii) for any language, there is a constant-space weak-IPS (the non-members may not be rejected with high probability); and, (iii) for any language, there is a ... |
1303.2017 | Tunji Adebiyi | A. Adebiyi, Johnnes Arreymbi and Chris Imafidon | Security Assessment of Software Design using Neural Network | 7 pages, 1 figure, 4 tables, (IJARAI) International Journal of
Advanced Research in Artificial Intelligence, Vol. 1(4), 2012, pp.1-7,
ISSN:2165-4069 (Online), ISSN:2165-4050 (Print) | (IJARAI) International Journal of Advanced Research in Artificial
Intelligence, Vol. 1(4), 2012, pp.1-7 | null | null | cs.CR cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Security flaws in software applications today has been attributed mostly to
design flaws. With limited budget and time to release software into the market,
many developers often consider security as an afterthought. Previous research
shows that integrating security into software applications at a later stage of
softw... | [
{
"created": "Fri, 8 Mar 2013 15:09:53 GMT",
"version": "v1"
}
] | 2013-03-11 | [
[
"Adebiyi",
"A.",
""
],
[
"Arreymbi",
"Johnnes",
""
],
[
"Imafidon",
"Chris",
""
]
] | Security flaws in software applications today has been attributed mostly to design flaws. With limited budget and time to release software into the market, many developers often consider security as an afterthought. Previous research shows that integrating security into software applications at a later stage of softwar... |
2001.01458 | Yingshi Chen | Yingshi Chen | Express Wavenet -- a low parameter optical neural network with random
shift wavelet pattern | 5 pages,4 figures | null | 10.1016/j.optcom.2020.126709 | null | cs.LG cs.CV eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Express Wavenet is an improved optical diffractive neural network. At each
layer, it uses wavelet-like pattern to modulate the phase of optical waves. For
input image with n2 pixels, express wavenet reduce parameter number from O(n2)
to O(n). Only need one percent of the parameters, and the accuracy is still
very hig... | [
{
"created": "Mon, 6 Jan 2020 09:45:20 GMT",
"version": "v1"
}
] | 2021-02-03 | [
[
"Chen",
"Yingshi",
""
]
] | Express Wavenet is an improved optical diffractive neural network. At each layer, it uses wavelet-like pattern to modulate the phase of optical waves. For input image with n2 pixels, express wavenet reduce parameter number from O(n2) to O(n). Only need one percent of the parameters, and the accuracy is still very high.... |
1711.08199 | He Chen | Yifan Gu, He Chen, Yonghui Li, Branka Vucetic | Ultra-Reliable Short-Packet Communications: Half-Duplex or Full-Duplex
Relaying? | Accepted to appear in IEEE Wireless Communication Letters | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This letter analyzes and compares the performance of full-duplex relaying
(FDR) and half-duplex relaying (HDR) for ultra-reliable short-packet
communications. Specifically, we derive both approximate and asymptotic
closed-form expressions of the block error rate (BLER) for FDR and HDR using
short packets with finite ... | [
{
"created": "Wed, 22 Nov 2017 09:57:05 GMT",
"version": "v1"
}
] | 2017-11-23 | [
[
"Gu",
"Yifan",
""
],
[
"Chen",
"He",
""
],
[
"Li",
"Yonghui",
""
],
[
"Vucetic",
"Branka",
""
]
] | This letter analyzes and compares the performance of full-duplex relaying (FDR) and half-duplex relaying (HDR) for ultra-reliable short-packet communications. Specifically, we derive both approximate and asymptotic closed-form expressions of the block error rate (BLER) for FDR and HDR using short packets with finite bl... |
1202.2981 | Bogdan Alexandru Caprarescu | Bogdan Alexandru Caprarescu, Eva Kaslik, Dana Petcu | Theoretical Analysis and Tuning of Decentralized Probabilistic
Auto-Scaling | Submitted to Journal of Computer and System Sciences | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A major impediment towards the industrial adoption of decentralized
distributed systems comes from the difficulty to theoretically prove that these
systems exhibit the required behavior. In this paper, we use probability theory
to analyze a decentralized auto-scaling algorithm in which each node
probabilistically dec... | [
{
"created": "Tue, 14 Feb 2012 10:21:51 GMT",
"version": "v1"
}
] | 2012-02-15 | [
[
"Caprarescu",
"Bogdan Alexandru",
""
],
[
"Kaslik",
"Eva",
""
],
[
"Petcu",
"Dana",
""
]
] | A major impediment towards the industrial adoption of decentralized distributed systems comes from the difficulty to theoretically prove that these systems exhibit the required behavior. In this paper, we use probability theory to analyze a decentralized auto-scaling algorithm in which each node probabilistically decid... |
1407.6877 | Minati Mishra | Minati Mishra and M. C. Adhikary | An Easy yet Effective Method for Detecting Spatial Domain LSB
Steganography | 12 pages; International Journal of Computer Science and Business
Informatics, Dec 2012 | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Digitization of image was a revolutionary step for the fields of photography
and Image processing as this made the editing of images much effortless and
easier. Image editing was not an issue until it was limited to corrective
editing procedures used to enhance the quality of an image such as, contrast
stretching, no... | [
{
"created": "Fri, 25 Jul 2014 12:58:23 GMT",
"version": "v1"
}
] | 2014-07-28 | [
[
"Mishra",
"Minati",
""
],
[
"Adhikary",
"M. C.",
""
]
] | Digitization of image was a revolutionary step for the fields of photography and Image processing as this made the editing of images much effortless and easier. Image editing was not an issue until it was limited to corrective editing procedures used to enhance the quality of an image such as, contrast stretching, nois... |
1905.08723 | Ting-Shuo Yo | Ting-Shuo Yo and Edwin de Jong | A comparison of evaluation methods in coevolution | 8 pages, 7 figures, GECCO '07: Proceedings of the 9th annual
conference on Genetic and evolutionary computation | null | 10.1145/1276958.1277060 | null | cs.NE cs.LG | http://creativecommons.org/licenses/by/4.0/ | In this research, we compare four different evaluation methods in coevolution
on the Majority Function problem. The size of the problem is selected such that
evaluation against all possible test cases is feasible. Two measures are used
for the comparisons, i.e., the objective fitness derived from evaluating
solutions... | [
{
"created": "Tue, 21 May 2019 16:11:00 GMT",
"version": "v1"
}
] | 2019-05-22 | [
[
"Yo",
"Ting-Shuo",
""
],
[
"de Jong",
"Edwin",
""
]
] | In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. The size of the problem is selected such that evaluation against all possible test cases is feasible. Two measures are used for the comparisons, i.e., the objective fitness derived from evaluating solutions a... |
1802.09232 | Diogo Luvizon | Diogo C. Luvizon and David Picard and Hedi Tabia | 2D/3D Pose Estimation and Action Recognition using Multitask Deep
Learning | To appear in CVPR 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Action recognition and human pose estimation are closely related but both
problems are generally handled as distinct tasks in the literature. In this
work, we propose a multitask framework for jointly 2D and 3D pose estimation
from still images and human action recognition from video sequences. We show
that a single ... | [
{
"created": "Mon, 26 Feb 2018 10:16:48 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Mar 2018 13:39:45 GMT",
"version": "v2"
}
] | 2018-03-22 | [
[
"Luvizon",
"Diogo C.",
""
],
[
"Picard",
"David",
""
],
[
"Tabia",
"Hedi",
""
]
] | Action recognition and human pose estimation are closely related but both problems are generally handled as distinct tasks in the literature. In this work, we propose a multitask framework for jointly 2D and 3D pose estimation from still images and human action recognition from video sequences. We show that a single ar... |
2112.09925 | Jinpeng Hu | Jinpeng Hu, Jianling Li, Zhihong Chen, Yaling Shen, Yan Song, Xiang
Wan, Tsung-Hui Chang | Word Graph Guided Summarization for Radiology Findings | 11 pages, 6 figures, ACL2021 Findings | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Radiology reports play a critical role in communicating medical findings to
physicians. In each report, the impression section summarizes essential
radiology findings. In clinical practice, writing impression is highly demanded
yet time-consuming and prone to errors for radiologists. Therefore, automatic
impression g... | [
{
"created": "Sat, 18 Dec 2021 13:20:18 GMT",
"version": "v1"
}
] | 2021-12-21 | [
[
"Hu",
"Jinpeng",
""
],
[
"Li",
"Jianling",
""
],
[
"Chen",
"Zhihong",
""
],
[
"Shen",
"Yaling",
""
],
[
"Song",
"Yan",
""
],
[
"Wan",
"Xiang",
""
],
[
"Chang",
"Tsung-Hui",
""
]
] | Radiology reports play a critical role in communicating medical findings to physicians. In each report, the impression section summarizes essential radiology findings. In clinical practice, writing impression is highly demanded yet time-consuming and prone to errors for radiologists. Therefore, automatic impression gen... |
2309.12033 | Bartosz W\'ojcik | Adrian Suwa{\l}a, Bartosz W\'ojcik, Magdalena Proszewska, Jacek Tabor,
Przemys{\l}aw Spurek, Marek \'Smieja | Face Identity-Aware Disentanglement in StyleGAN | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Conditional GANs are frequently used for manipulating the attributes of face
images, such as expression, hairstyle, pose, or age. Even though the
state-of-the-art models successfully modify the requested attributes, they
simultaneously modify other important characteristics of the image, such as a
person's identity. ... | [
{
"created": "Thu, 21 Sep 2023 12:54:09 GMT",
"version": "v1"
}
] | 2023-09-22 | [
[
"Suwała",
"Adrian",
""
],
[
"Wójcik",
"Bartosz",
""
],
[
"Proszewska",
"Magdalena",
""
],
[
"Tabor",
"Jacek",
""
],
[
"Spurek",
"Przemysław",
""
],
[
"Śmieja",
"Marek",
""
]
] | Conditional GANs are frequently used for manipulating the attributes of face images, such as expression, hairstyle, pose, or age. Even though the state-of-the-art models successfully modify the requested attributes, they simultaneously modify other important characteristics of the image, such as a person's identity. In... |
2311.06158 | Jiazhan Feng | Jiazhan Feng, Ruochen Xu, Junheng Hao, Hiteshi Sharma, Yelong Shen,
Dongyan Zhao, Weizhu Chen | Language Models can be Logical Solvers | Preprint | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Logical reasoning is a fundamental aspect of human intelligence and a key
component of tasks like problem-solving and decision-making. Recent
advancements have enabled Large Language Models (LLMs) to potentially exhibit
reasoning capabilities, but complex logical reasoning remains a challenge. The
state-of-the-art, s... | [
{
"created": "Fri, 10 Nov 2023 16:23:50 GMT",
"version": "v1"
}
] | 2023-11-13 | [
[
"Feng",
"Jiazhan",
""
],
[
"Xu",
"Ruochen",
""
],
[
"Hao",
"Junheng",
""
],
[
"Sharma",
"Hiteshi",
""
],
[
"Shen",
"Yelong",
""
],
[
"Zhao",
"Dongyan",
""
],
[
"Chen",
"Weizhu",
""
]
] | Logical reasoning is a fundamental aspect of human intelligence and a key component of tasks like problem-solving and decision-making. Recent advancements have enabled Large Language Models (LLMs) to potentially exhibit reasoning capabilities, but complex logical reasoning remains a challenge. The state-of-the-art, sol... |
2205.07147 | Ion Stoica | Sarah Chasins, Alvin Cheung, Natacha Crooks, Ali Ghodsi, Ken Goldberg,
Joseph E. Gonzalez, Joseph M. Hellerstein, Michael I. Jordan, Anthony D.
Joseph, Michael W. Mahoney, Aditya Parameswaran, David Patterson, Raluca Ada
Popa, Koushik Sen, Scott Shenker, Dawn Song, Ion Stoica | The Sky Above The Clouds | 35 pages | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Technology ecosystems often undergo significant transformations as they
mature. For example, telephony, the Internet, and PCs all started with a single
provider, but in the United States each is now served by a competitive market
that uses comprehensive and universal technology standards to provide
compatibility. Thi... | [
{
"created": "Sat, 14 May 2022 23:13:00 GMT",
"version": "v1"
}
] | 2022-05-17 | [
[
"Chasins",
"Sarah",
""
],
[
"Cheung",
"Alvin",
""
],
[
"Crooks",
"Natacha",
""
],
[
"Ghodsi",
"Ali",
""
],
[
"Goldberg",
"Ken",
""
],
[
"Gonzalez",
"Joseph E.",
""
],
[
"Hellerstein",
"Joseph M.",
""
],
... | Technology ecosystems often undergo significant transformations as they mature. For example, telephony, the Internet, and PCs all started with a single provider, but in the United States each is now served by a competitive market that uses comprehensive and universal technology standards to provide compatibility. This ... |
1709.01956 | Yang He | Yang He, Margret Keuper, Bernt Schiele, Mario Fritz | Learning Dilation Factors for Semantic Segmentation of Street Scenes | GCPR2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contextual information is crucial for semantic segmentation. However, finding
the optimal trade-off between keeping desired fine details and at the same time
providing sufficiently large receptive fields is non trivial. This is even more
so, when objects or classes present in an image significantly vary in size.
Dila... | [
{
"created": "Wed, 6 Sep 2017 18:19:10 GMT",
"version": "v1"
}
] | 2017-09-08 | [
[
"He",
"Yang",
""
],
[
"Keuper",
"Margret",
""
],
[
"Schiele",
"Bernt",
""
],
[
"Fritz",
"Mario",
""
]
] | Contextual information is crucial for semantic segmentation. However, finding the optimal trade-off between keeping desired fine details and at the same time providing sufficiently large receptive fields is non trivial. This is even more so, when objects or classes present in an image significantly vary in size. Dilate... |
2306.08765 | Charles Assaad | Daria Bystrova, Charles K. Assaad, Julyan Arbel, Emilie Devijver, Eric
Gaussier, Wilfried Thuiller | Causal Discovery from Time Series with Hybrids of Constraint-Based and
Noise-Based Algorithms | Accepted in TMLR: https://openreview.net/forum?id=PGLbZpVk2n | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Constraint-based methods and noise-based methods are two distinct families of
methods proposed for uncovering causal graphs from observational data. However,
both operate under strong assumptions that may be challenging to validate or
could be violated in real-world scenarios. In response to these challenges,
there i... | [
{
"created": "Wed, 14 Jun 2023 22:27:26 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Apr 2024 17:12:18 GMT",
"version": "v2"
}
] | 2024-05-01 | [
[
"Bystrova",
"Daria",
""
],
[
"Assaad",
"Charles K.",
""
],
[
"Arbel",
"Julyan",
""
],
[
"Devijver",
"Emilie",
""
],
[
"Gaussier",
"Eric",
""
],
[
"Thuiller",
"Wilfried",
""
]
] | Constraint-based methods and noise-based methods are two distinct families of methods proposed for uncovering causal graphs from observational data. However, both operate under strong assumptions that may be challenging to validate or could be violated in real-world scenarios. In response to these challenges, there is ... |
2303.12032 | Eamon Duede | Eamon Duede | The Representational Status of Deep Learning Models | 19 pages | null | null | null | cs.AI cs.CY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper aims to clarify the representational status of Deep Learning
Models (DLMs). While commonly referred to as 'representations', what this
entails is ambiguous due to a conflation of functional and relational
conceptions of representation. This paper argues that while DLMs represent
their targets in a relation... | [
{
"created": "Tue, 21 Mar 2023 17:19:35 GMT",
"version": "v1"
}
] | 2023-03-22 | [
[
"Duede",
"Eamon",
""
]
] | This paper aims to clarify the representational status of Deep Learning Models (DLMs). While commonly referred to as 'representations', what this entails is ambiguous due to a conflation of functional and relational conceptions of representation. This paper argues that while DLMs represent their targets in a relational... |
2406.08673 | Zhilin Wang | Zhilin Wang, Yi Dong, Olivier Delalleau, Jiaqi Zeng, Gerald Shen,
Daniel Egert, Jimmy J. Zhang, Makesh Narsimhan Sreedhar, Oleksii Kuchaiev | HelpSteer2: Open-source dataset for training top-performing reward
models | null | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High-quality preference datasets are essential for training reward models
that can effectively guide large language models (LLMs) in generating
high-quality responses aligned with human preferences. As LLMs become stronger
and better aligned, permissively licensed preference datasets, such as Open
Assistant, HH-RLHF,... | [
{
"created": "Wed, 12 Jun 2024 22:28:08 GMT",
"version": "v1"
}
] | 2024-06-14 | [
[
"Wang",
"Zhilin",
""
],
[
"Dong",
"Yi",
""
],
[
"Delalleau",
"Olivier",
""
],
[
"Zeng",
"Jiaqi",
""
],
[
"Shen",
"Gerald",
""
],
[
"Egert",
"Daniel",
""
],
[
"Zhang",
"Jimmy J.",
""
],
[
"Sreedhar",... | High-quality preference datasets are essential for training reward models that can effectively guide large language models (LLMs) in generating high-quality responses aligned with human preferences. As LLMs become stronger and better aligned, permissively licensed preference datasets, such as Open Assistant, HH-RLHF, a... |
1003.5891 | Sandip Rakshit | Sandip Rakshit, Subhadip Basu | Recognition of Handwritten Roman Script Using Tesseract Open source OCR
Engine | Proc. National Conference on NAQC (2008) 141-145 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the present work, we have used Tesseract 2.01 open source Optical
Character Recognition (OCR) Engine under Apache License 2.0 for recognition of
handwriting samples of lower case Roman script. Handwritten isolated and
free-flow text samples were collected from multiple users. Tesseract is trained
to recognize user... | [
{
"created": "Tue, 30 Mar 2010 18:35:37 GMT",
"version": "v1"
}
] | 2010-03-31 | [
[
"Rakshit",
"Sandip",
""
],
[
"Basu",
"Subhadip",
""
]
] | In the present work, we have used Tesseract 2.01 open source Optical Character Recognition (OCR) Engine under Apache License 2.0 for recognition of handwriting samples of lower case Roman script. Handwritten isolated and free-flow text samples were collected from multiple users. Tesseract is trained to recognize user-s... |
2009.10697 | Leopold Cambier | L\'eopold Cambier, Yizhou Qian, Eric Darve | TaskTorrent: a Lightweight Distributed Task-Based Runtime System in C++ | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present TaskTorrent, a lightweight distributed task-based runtime in C++.
TaskTorrent uses a parametrized task graph to express the task DAG, and
one-sided active messages to trigger remote tasks asynchronously. As a result
the task DAG is completely distributed and discovered in parallel. It is a
C++14 library an... | [
{
"created": "Tue, 22 Sep 2020 17:16:11 GMT",
"version": "v1"
}
] | 2020-09-23 | [
[
"Cambier",
"Léopold",
""
],
[
"Qian",
"Yizhou",
""
],
[
"Darve",
"Eric",
""
]
] | We present TaskTorrent, a lightweight distributed task-based runtime in C++. TaskTorrent uses a parametrized task graph to express the task DAG, and one-sided active messages to trigger remote tasks asynchronously. As a result the task DAG is completely distributed and discovered in parallel. It is a C++14 library and ... |
2306.15419 | Tianxiang Ma | Tianxiang Ma, Kang Zhao, Jianxin Sun, Yingya Zhang, Jing Dong | Freestyle 3D-Aware Portrait Synthesis Based on Compositional Generative
Priors | project website: https://tianxiangma.github.io/FF3D | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Efficiently generating a freestyle 3D portrait with high quality and
3D-consistency is a promising yet challenging task. The portrait styles
generated by most existing methods are usually restricted by their 3D
generators, which are learned in specific facial datasets, such as FFHQ. To get
the diverse 3D portraits, o... | [
{
"created": "Tue, 27 Jun 2023 12:23:04 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Jun 2023 07:20:58 GMT",
"version": "v2"
},
{
"created": "Sun, 24 Dec 2023 08:35:38 GMT",
"version": "v3"
}
] | 2023-12-27 | [
[
"Ma",
"Tianxiang",
""
],
[
"Zhao",
"Kang",
""
],
[
"Sun",
"Jianxin",
""
],
[
"Zhang",
"Yingya",
""
],
[
"Dong",
"Jing",
""
]
] | Efficiently generating a freestyle 3D portrait with high quality and 3D-consistency is a promising yet challenging task. The portrait styles generated by most existing methods are usually restricted by their 3D generators, which are learned in specific facial datasets, such as FFHQ. To get the diverse 3D portraits, one... |
2206.14337 | Jinyoung Park | Jinyoung Park, Seongjun Yun, Hyeonjin Park, Jaewoo Kang, Jisu Jeong,
Kyung-Min Kim, Jung-woo Ha, Hyunwoo J. Kim | Deformable Graph Transformer | 16 pages, 3 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformer-based models have recently shown success in representation
learning on graph-structured data beyond natural language processing and
computer vision. However, the success is limited to small-scale graphs due to
the drawbacks of full dot-product attention on graphs such as the quadratic
complexity with resp... | [
{
"created": "Wed, 29 Jun 2022 00:23:25 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Oct 2022 03:13:03 GMT",
"version": "v2"
}
] | 2022-10-05 | [
[
"Park",
"Jinyoung",
""
],
[
"Yun",
"Seongjun",
""
],
[
"Park",
"Hyeonjin",
""
],
[
"Kang",
"Jaewoo",
""
],
[
"Jeong",
"Jisu",
""
],
[
"Kim",
"Kyung-Min",
""
],
[
"Ha",
"Jung-woo",
""
],
[
"Kim",
... | Transformer-based models have recently shown success in representation learning on graph-structured data beyond natural language processing and computer vision. However, the success is limited to small-scale graphs due to the drawbacks of full dot-product attention on graphs such as the quadratic complexity with respec... |
2110.02068 | Lukas Kondmann | Lukas Kondmann, Aysim Toker, Sudipan Saha, Bernhard Sch\"olkopf, Laura
Leal-Taix\'e, Xiao Xiang Zhu | Spatial Context Awareness for Unsupervised Change Detection in Optical
Satellite Images | Submitted to IEEE Transactions on Geoscience and Remote Sensing (IEEE
TGRS) | null | 10.1109/TGRS.2021.3130842 | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Detecting changes on the ground in multitemporal Earth observation data is
one of the key problems in remote sensing. In this paper, we introduce Sibling
Regression for Optical Change detection (SiROC), an unsupervised method for
change detection in optical satellite images with medium and high resolution.
SiROC is a... | [
{
"created": "Tue, 5 Oct 2021 14:13:48 GMT",
"version": "v1"
}
] | 2022-05-04 | [
[
"Kondmann",
"Lukas",
""
],
[
"Toker",
"Aysim",
""
],
[
"Saha",
"Sudipan",
""
],
[
"Schölkopf",
"Bernhard",
""
],
[
"Leal-Taixé",
"Laura",
""
],
[
"Zhu",
"Xiao Xiang",
""
]
] | Detecting changes on the ground in multitemporal Earth observation data is one of the key problems in remote sensing. In this paper, we introduce Sibling Regression for Optical Change detection (SiROC), an unsupervised method for change detection in optical satellite images with medium and high resolution. SiROC is a s... |
2208.09948 | Ashwin Maran | Jin-Yi Cai, Ashwin Maran | Counting Cycles on Planar Graphs in Subexponential Time | 28 pages, 6 figures, COCOON 2022 | null | null | null | cs.DS math.CO | http://creativecommons.org/licenses/by/4.0/ | We study the problem of counting all cycles or self-avoiding walks (SAWs) on
triangulated planar graphs. We present a subexponential $2^{O(\sqrt{n})}$ time
algorithm for this counting problem. Among the technical ingredients used in
this algorithm are the planar separator theorem and a delicate analysis using
pairs o... | [
{
"created": "Sun, 21 Aug 2022 19:00:33 GMT",
"version": "v1"
}
] | 2022-08-23 | [
[
"Cai",
"Jin-Yi",
""
],
[
"Maran",
"Ashwin",
""
]
] | We study the problem of counting all cycles or self-avoiding walks (SAWs) on triangulated planar graphs. We present a subexponential $2^{O(\sqrt{n})}$ time algorithm for this counting problem. Among the technical ingredients used in this algorithm are the planar separator theorem and a delicate analysis using pairs of ... |
1910.14528 | Shu Jiang | Shu Jiang, Rui Wang, Zuchao Li, Masao Utiyama, Kehai Chen, Eiichiro
Sumita, Hai Zhao, Bao-liang Lu | Document-level Neural Machine Translation with Associated Memory Network | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Standard neural machine translation (NMT) is on the assumption that the
document-level context is independent. Most existing document-level NMT
approaches are satisfied with a smattering sense of global document-level
information, while this work focuses on exploiting detailed document-level
context in terms of a mem... | [
{
"created": "Thu, 31 Oct 2019 15:14:54 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Aug 2021 10:14:20 GMT",
"version": "v2"
}
] | 2021-08-25 | [
[
"Jiang",
"Shu",
""
],
[
"Wang",
"Rui",
""
],
[
"Li",
"Zuchao",
""
],
[
"Utiyama",
"Masao",
""
],
[
"Chen",
"Kehai",
""
],
[
"Sumita",
"Eiichiro",
""
],
[
"Zhao",
"Hai",
""
],
[
"Lu",
"Bao-liang"... | Standard neural machine translation (NMT) is on the assumption that the document-level context is independent. Most existing document-level NMT approaches are satisfied with a smattering sense of global document-level information, while this work focuses on exploiting detailed document-level context in terms of a memor... |
1711.04898 | Eun-jin Kim | Eun-jin Kim and Ismail Movahedi | Effect of enhanced dissipation by shear flows on transient relaxation
and probability density function in two dimensions | 26 pages, 5 figures | null | 10.1063/1.5003014 | null | cs.IT math.IT physics.flu-dyn physics.plasm-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report a non-perturbative study of the effects of shear flows on
turbulence reduction in a decaying turbulence in two dimensions. By considering
different initial power spectra and shear flows (zonal flows, combined zonal
flows and streamers), we demonstrate how shear flows rapidly generate small
scales, leading t... | [
{
"created": "Tue, 14 Nov 2017 01:23:09 GMT",
"version": "v1"
}
] | 2017-12-05 | [
[
"Kim",
"Eun-jin",
""
],
[
"Movahedi",
"Ismail",
""
]
] | We report a non-perturbative study of the effects of shear flows on turbulence reduction in a decaying turbulence in two dimensions. By considering different initial power spectra and shear flows (zonal flows, combined zonal flows and streamers), we demonstrate how shear flows rapidly generate small scales, leading to ... |
2010.04977 | Gang Chen | Gang Chen, Wei Dong, Xinjun Sheng, Xiangyang Zhu, Han Ding | An Active Sense and Avoid System for Flying Robots in Dynamic
Environments | Accepted by IEEE Transactions on Mechatronics on 27 Jan 2021 | null | 10.1109/TMECH.2021.3060511 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates a novel active-sensing-based obstacle avoidance
paradigm for flying robots in dynamic environments. Instead of fusing multiple
sensors to enlarge the field of view (FOV), we introduce an alternative
approach that utilizes a stereo camera with an independent rotational DOF to
sense the obstacle... | [
{
"created": "Sat, 10 Oct 2020 11:36:56 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Feb 2021 15:00:59 GMT",
"version": "v2"
}
] | 2021-02-18 | [
[
"Chen",
"Gang",
""
],
[
"Dong",
"Wei",
""
],
[
"Sheng",
"Xinjun",
""
],
[
"Zhu",
"Xiangyang",
""
],
[
"Ding",
"Han",
""
]
] | This paper investigates a novel active-sensing-based obstacle avoidance paradigm for flying robots in dynamic environments. Instead of fusing multiple sensors to enlarge the field of view (FOV), we introduce an alternative approach that utilizes a stereo camera with an independent rotational DOF to sense the obstacles ... |
1811.12373 | Ke Li | Ke Li, Tianhao Zhang, Jitendra Malik | Diverse Image Synthesis from Semantic Layouts via Conditional IMLE | 18 pages, 16 figures; IEEE International Conference on Computer
Vision (ICCV), 2019 | null | null | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most existing methods for conditional image synthesis are only able to
generate a single plausible image for any given input, or at best a fixed
number of plausible images. In this paper, we focus on the problem of
generating images from semantic segmentation maps and present a simple new
method that can generate an ... | [
{
"created": "Thu, 29 Nov 2018 18:36:00 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Aug 2019 17:54:53 GMT",
"version": "v2"
}
] | 2019-08-30 | [
[
"Li",
"Ke",
""
],
[
"Zhang",
"Tianhao",
""
],
[
"Malik",
"Jitendra",
""
]
] | Most existing methods for conditional image synthesis are only able to generate a single plausible image for any given input, or at best a fixed number of plausible images. In this paper, we focus on the problem of generating images from semantic segmentation maps and present a simple new method that can generate an ar... |
1708.01461 | Hamid Hoorfar | Hamid Hoorfar and Alireza Bagheri | A Linear-time Algorithm for Orthogonal Watchman Route Problem with
Minimum Bends | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given an orthogonal polygon $ P $ with $ n $ vertices, the goal of the
watchman route problem is finding a path $ S $ of the minimum length in $ P $
such that every point of the polygon $ P $ is visible from at least one of the
point of $ S $. In the other words, in the watchman route problem we must
compute a shorte... | [
{
"created": "Fri, 4 Aug 2017 11:49:52 GMT",
"version": "v1"
}
] | 2017-08-07 | [
[
"Hoorfar",
"Hamid",
""
],
[
"Bagheri",
"Alireza",
""
]
] | Given an orthogonal polygon $ P $ with $ n $ vertices, the goal of the watchman route problem is finding a path $ S $ of the minimum length in $ P $ such that every point of the polygon $ P $ is visible from at least one of the point of $ S $. In the other words, in the watchman route problem we must compute a shortest... |
2405.14278 | Zhaorui Tan | Kai Yao, Zhaorui Tan, Zixian Su, Xi Yang, Jie Sun, Kaizhu Huang | SCMix: Stochastic Compound Mixing for Open Compound Domain Adaptation in
Semantic Segmentation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open compound domain adaptation (OCDA) aims to transfer knowledge from a
labeled source domain to a mix of unlabeled homogeneous compound target domains
while generalizing to open unseen domains. Existing OCDA methods solve the
intra-domain gaps by a divide-and-conquer strategy, which divides the problem
into several... | [
{
"created": "Thu, 23 May 2024 07:53:10 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Yao",
"Kai",
""
],
[
"Tan",
"Zhaorui",
""
],
[
"Su",
"Zixian",
""
],
[
"Yang",
"Xi",
""
],
[
"Sun",
"Jie",
""
],
[
"Huang",
"Kaizhu",
""
]
] | Open compound domain adaptation (OCDA) aims to transfer knowledge from a labeled source domain to a mix of unlabeled homogeneous compound target domains while generalizing to open unseen domains. Existing OCDA methods solve the intra-domain gaps by a divide-and-conquer strategy, which divides the problem into several i... |
1403.5524 | Brendan McLaughlin Dr | Brendan M. McLaughlin and Connor P. Ballance | Petascale computations for Large-scale Atomic and Molecular collisions | 14 pages, 5 figures, 3 tables, Chapter in: Workshop on Sustained
Simulated Performance 2013, Published by Springer, 2014, edited by Michael
Resch, Yevgeniya Kovalenko, Eric Focht, Wolfgang Bez and Hiroaki Kobaysahi | null | null | null | cs.DC physics.atom-ph physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Petaflop architectures are currently being utilized efficiently to perform
large scale computations in Atomic, Molecular and Optical Collisions. We solve
the Schroedinger or Dirac equation for the appropriate collision problem using
the R-matrix or R-matrix with pseudo-states approach. We briefly outline the
parallel... | [
{
"created": "Fri, 21 Mar 2014 17:38:25 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Aug 2014 09:40:57 GMT",
"version": "v2"
}
] | 2014-08-18 | [
[
"McLaughlin",
"Brendan M.",
""
],
[
"Ballance",
"Connor P.",
""
]
] | Petaflop architectures are currently being utilized efficiently to perform large scale computations in Atomic, Molecular and Optical Collisions. We solve the Schroedinger or Dirac equation for the appropriate collision problem using the R-matrix or R-matrix with pseudo-states approach. We briefly outline the parallel m... |
2107.04986 | Han Zhang | Dazhuan Xu, Han Zhang, Nan Wang | Theoretical Performance Limit for Radar Parameter Estimation | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we employ the thoughts and methodologies of Shannon's
information theory to solve the problem of the optimal radar parameter
estimation. Based on a general radar system model, the \textit{a posteriori}
probability density function of targets' parameters is derived. Range
information (RI) and entropy er... | [
{
"created": "Sun, 11 Jul 2021 07:16:57 GMT",
"version": "v1"
},
{
"created": "Sun, 12 Jun 2022 11:34:18 GMT",
"version": "v2"
},
{
"created": "Mon, 6 Feb 2023 08:19:39 GMT",
"version": "v3"
}
] | 2023-02-07 | [
[
"Xu",
"Dazhuan",
""
],
[
"Zhang",
"Han",
""
],
[
"Wang",
"Nan",
""
]
] | In this paper, we employ the thoughts and methodologies of Shannon's information theory to solve the problem of the optimal radar parameter estimation. Based on a general radar system model, the \textit{a posteriori} probability density function of targets' parameters is derived. Range information (RI) and entropy erro... |
2001.04333 | R\'emi Morvan | Marcin Jurdzi\'nski, R\'emi Morvan, K. S. Thejaswini | Universal Algorithms for Parity Games and Nested Fixpoints | null | null | null | null | cs.DS cs.FL cs.GT cs.LO | http://creativecommons.org/licenses/by/4.0/ | An attractor decomposition meta-algorithm for solving parity games is given
that generalises the classic McNaughton-Zielonka algorithm and its recent
quasi-polynomial variants due to Parys (2019), and to Lehtinen, Schewe, and
Wojtczak (2019). The central concepts studied and exploited are attractor
decompositions of ... | [
{
"created": "Mon, 13 Jan 2020 15:19:05 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Aug 2022 09:08:49 GMT",
"version": "v2"
}
] | 2022-08-30 | [
[
"Jurdziński",
"Marcin",
""
],
[
"Morvan",
"Rémi",
""
],
[
"Thejaswini",
"K. S.",
""
]
] | An attractor decomposition meta-algorithm for solving parity games is given that generalises the classic McNaughton-Zielonka algorithm and its recent quasi-polynomial variants due to Parys (2019), and to Lehtinen, Schewe, and Wojtczak (2019). The central concepts studied and exploited are attractor decompositions of do... |
1002.2191 | Rdv Ijcsis | S. Sumathi, S. K. Srivatsa, M. Uma Maheswari | Vision Based Game Development Using Human Computer Interaction | IEEE format, International Journal of Computer Science and
Information Security, IJCSIS January 2010, ISSN 1947 5500,
http://sites.google.com/site/ijcsis/ | International Journal of Computer Science and Information
Security, IJCSIS, Vol. 7, No. 1, pp. 147-153, January 2010, USA | null | Journal of Computer Science, ISSN 19475500 | cs.HC cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Human Computer Interface (HCI) System for playing games is designed here
for more natural communication with the machines. The system presented here is
a vision-based system for detection of long voluntary eye blinks and
interpretation of blink patterns for communication between man and machine.
This system replace... | [
{
"created": "Wed, 10 Feb 2010 19:46:07 GMT",
"version": "v1"
}
] | 2010-02-11 | [
[
"Sumathi",
"S.",
""
],
[
"Srivatsa",
"S. K.",
""
],
[
"Maheswari",
"M. Uma",
""
]
] | A Human Computer Interface (HCI) System for playing games is designed here for more natural communication with the machines. The system presented here is a vision-based system for detection of long voluntary eye blinks and interpretation of blink patterns for communication between man and machine. This system replaces ... |
1911.09157 | Gal Dalal | Gal Dalal, Balazs Szorenyi, Gugan Thoppe | A Tale of Two-Timescale Reinforcement Learning with the Tightest
Finite-Time Bound | null | null | null | null | cs.LG math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Policy evaluation in reinforcement learning is often conducted using
two-timescale stochastic approximation, which results in various gradient
temporal difference methods such as GTD(0), GTD2, and TDC. Here, we provide
convergence rate bounds for this suite of algorithms. Algorithms such as these
have two iterates, $... | [
{
"created": "Wed, 20 Nov 2019 20:21:21 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Dec 2019 13:07:57 GMT",
"version": "v2"
}
] | 2019-12-05 | [
[
"Dalal",
"Gal",
""
],
[
"Szorenyi",
"Balazs",
""
],
[
"Thoppe",
"Gugan",
""
]
] | Policy evaluation in reinforcement learning is often conducted using two-timescale stochastic approximation, which results in various gradient temporal difference methods such as GTD(0), GTD2, and TDC. Here, we provide convergence rate bounds for this suite of algorithms. Algorithms such as these have two iterates, $\t... |
2408.08300 | Andy Xu | Andy Xu, Arno Gau | HELP: Hierarchical Embeddings-based Log Parsing | null | null | null | null | cs.SE cs.LG | http://creativecommons.org/licenses/by/4.0/ | Logs are a first-hand source of information for software maintenance and
failure diagnosis. Log parsing, which converts semi-structured log messages
into structured templates, is a prerequisite for automated log analysis tasks
such as anomaly detection, troubleshooting, and root cause analysis. However,
existing log ... | [
{
"created": "Thu, 15 Aug 2024 17:54:31 GMT",
"version": "v1"
}
] | 2024-08-16 | [
[
"Xu",
"Andy",
""
],
[
"Gau",
"Arno",
""
]
] | Logs are a first-hand source of information for software maintenance and failure diagnosis. Log parsing, which converts semi-structured log messages into structured templates, is a prerequisite for automated log analysis tasks such as anomaly detection, troubleshooting, and root cause analysis. However, existing log pa... |
1708.06887 | EPTCS | Alexei Lisitsa (University of Liverpool, UK), Andrei P. Nemytykh
(ISPRAS, Russia), Maurizio Proietti (CNR-IASI, Italy) | Proceedings Fifth International Workshop on Verification and Program
Transformation | null | EPTCS 253, 2017 | 10.4204/EPTCS.253 | null | cs.LO cs.PL cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This volume contains the proceedings of the Fifth International Workshop on
Verification and Program Transformation (VPT 2017). The workshop took place in
Uppsala, Sweden, on April 29th, 2017, affiliated with the European Joint
Conferences on Theory and Practice of Software (ETAPS). The aim of the VPT
workshop series... | [
{
"created": "Wed, 23 Aug 2017 05:39:02 GMT",
"version": "v1"
}
] | 2017-08-24 | [
[
"Lisitsa",
"Alexei",
"",
"University of Liverpool, UK"
],
[
"Nemytykh",
"Andrei P.",
"",
"ISPRAS, Russia"
],
[
"Proietti",
"Maurizio",
"",
"CNR-IASI, Italy"
]
] | This volume contains the proceedings of the Fifth International Workshop on Verification and Program Transformation (VPT 2017). The workshop took place in Uppsala, Sweden, on April 29th, 2017, affiliated with the European Joint Conferences on Theory and Practice of Software (ETAPS). The aim of the VPT workshop series i... |
2004.08340 | Vahid Moosavi | Zifeng Guo, Joao P. Leitao, Nuno E. Simoes, and Vahid Moosavi | Data-driven Flood Emulation: Speeding up Urban Flood Predictions by Deep
Convolutional Neural Networks | null | null | null | null | cs.CV cs.CY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computational complexity has been the bottleneck of applying physically-based
simulations on large urban areas with high spatial resolution for efficient and
systematic flooding analyses and risk assessments. To address this issue of
long computational time, this paper proposes that the prediction of maximum
water de... | [
{
"created": "Fri, 17 Apr 2020 16:44:46 GMT",
"version": "v1"
},
{
"created": "Wed, 13 May 2020 10:19:29 GMT",
"version": "v2"
}
] | 2020-05-14 | [
[
"Guo",
"Zifeng",
""
],
[
"Leitao",
"Joao P.",
""
],
[
"Simoes",
"Nuno E.",
""
],
[
"Moosavi",
"Vahid",
""
]
] | Computational complexity has been the bottleneck of applying physically-based simulations on large urban areas with high spatial resolution for efficient and systematic flooding analyses and risk assessments. To address this issue of long computational time, this paper proposes that the prediction of maximum water dept... |
2102.09249 | Nicolas Grislain | Johan Leduc and Nicolas Grislain | Composable Generative Models | 11 pages | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative modeling has recently seen many exciting developments with the
advent of deep generative architectures such as Variational Auto-Encoders (VAE)
or Generative Adversarial Networks (GAN). The ability to draw synthetic i.i.d.
observations with the same joint probability distribution as a given dataset
has a wi... | [
{
"created": "Thu, 18 Feb 2021 10:11:29 GMT",
"version": "v1"
}
] | 2021-02-19 | [
[
"Leduc",
"Johan",
""
],
[
"Grislain",
"Nicolas",
""
]
] | Generative modeling has recently seen many exciting developments with the advent of deep generative architectures such as Variational Auto-Encoders (VAE) or Generative Adversarial Networks (GAN). The ability to draw synthetic i.i.d. observations with the same joint probability distribution as a given dataset has a wide... |
2102.08896 | Arvind Kiwelekar | Arvind W. Kiwelekar, Pramod Patil, Laxman D. Netak, Sanjay U Waikar | Blockchain-based Security Services for Fog Computing | This is a pre-print of the following Chapter: Arvind W. Kiwelekar,
Pramod Patil Laxman D. Netak and Sanjay U Waikar, {\em Blockchain-Based
Security Services for Fog Computing} accepted and final version is published
in Chang W., Wu J. (eds) Fog/Edge Computing For Security, Privacy, and
Applications. Advances in... | null | 10.1007/978-3-030-57328-7_11 | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Fog computing is a paradigm for distributed computing that enables sharing of
resources such as computing, storage and network services. Unlike cloud
computing, fog computing platforms primarily support {\em non-functional
properties} such as location awareness, mobility and reduced latency. This
emerging paradigm ha... | [
{
"created": "Tue, 16 Feb 2021 08:26:20 GMT",
"version": "v1"
}
] | 2021-02-18 | [
[
"Kiwelekar",
"Arvind W.",
""
],
[
"Patil",
"Pramod",
""
],
[
"Netak",
"Laxman D.",
""
],
[
"Waikar",
"Sanjay U",
""
]
] | Fog computing is a paradigm for distributed computing that enables sharing of resources such as computing, storage and network services. Unlike cloud computing, fog computing platforms primarily support {\em non-functional properties} such as location awareness, mobility and reduced latency. This emerging paradigm has ... |
2002.12888 | Bingchen Liu | Bingchen Liu, Kunpeng Song, Ahmed Elgammal | Sketch-to-Art: Synthesizing Stylized Art Images From Sketches | 24 pages | ACCV 2020 | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new approach for synthesizing fully detailed art-stylized images
from sketches. Given a sketch, with no semantic tagging, and a reference image
of a specific style, the model can synthesize meaningful details with colors
and textures. The model consists of three modules designed explicitly for
better art... | [
{
"created": "Wed, 26 Feb 2020 19:02:10 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Mar 2020 19:07:49 GMT",
"version": "v2"
},
{
"created": "Fri, 2 Oct 2020 17:20:25 GMT",
"version": "v3"
}
] | 2020-10-05 | [
[
"Liu",
"Bingchen",
""
],
[
"Song",
"Kunpeng",
""
],
[
"Elgammal",
"Ahmed",
""
]
] | We propose a new approach for synthesizing fully detailed art-stylized images from sketches. Given a sketch, with no semantic tagging, and a reference image of a specific style, the model can synthesize meaningful details with colors and textures. The model consists of three modules designed explicitly for better artis... |
2305.08481 | Arsham Mostaani | Arsham Mostaani, Thang X. Vu, Hamed Habibi, Symeon Chatzinotas, Bjorn
Ottersten | Task-Oriented Communication Design at Scale | null | null | null | null | cs.IT cs.LG cs.MA math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With countless promising applications in various domains such as IoT and
industry 4.0, task-oriented communication design (TOCD) is getting accelerated
attention from the research community. This paper presents a novel approach for
designing scalable task-oriented quantization and communications in cooperative
multi-... | [
{
"created": "Mon, 15 May 2023 09:32:42 GMT",
"version": "v1"
}
] | 2023-05-16 | [
[
"Mostaani",
"Arsham",
""
],
[
"Vu",
"Thang X.",
""
],
[
"Habibi",
"Hamed",
""
],
[
"Chatzinotas",
"Symeon",
""
],
[
"Ottersten",
"Bjorn",
""
]
] | With countless promising applications in various domains such as IoT and industry 4.0, task-oriented communication design (TOCD) is getting accelerated attention from the research community. This paper presents a novel approach for designing scalable task-oriented quantization and communications in cooperative multi-ag... |
2006.05944 | Hua Sun | Hua Sun | Secure Groupcast: Extra-Entropic Structure and Linear Feasibility | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the secure groupcast problem, a transmitter wants to securely groupcast a
message with the maximum rate to the first $N$ of $K$ receivers by broadcasting
with the minimum bandwidth, where the $K$ receivers are each equipped with a
key variable from a known joint distribution. Examples are provided to prove
that di... | [
{
"created": "Wed, 10 Jun 2020 16:50:47 GMT",
"version": "v1"
}
] | 2020-06-11 | [
[
"Sun",
"Hua",
""
]
] | In the secure groupcast problem, a transmitter wants to securely groupcast a message with the maximum rate to the first $N$ of $K$ receivers by broadcasting with the minimum bandwidth, where the $K$ receivers are each equipped with a key variable from a known joint distribution. Examples are provided to prove that diff... |
1711.03373 | Ziqi Zhang | Ziqi Zhang, Jie Gao, Fabio Ciravegna | SemRe-Rank: Improving Automatic Term Extraction By Incorporating
Semantic Relatedness With Personalised PageRank | Accepted by ACM TKDD. This is a pre-print | null | null | null | cs.IR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic Term Extraction deals with the extraction of terminology from a
domain specific corpus, and has long been an established research area in data
and knowledge acquisition. ATE remains a challenging task as it is known that
there is no existing ATE methods that can consistently outperform others in any
domain.... | [
{
"created": "Thu, 9 Nov 2017 13:39:21 GMT",
"version": "v1"
},
{
"created": "Thu, 15 Mar 2018 20:55:54 GMT",
"version": "v2"
},
{
"created": "Wed, 28 Mar 2018 20:52:19 GMT",
"version": "v3"
}
] | 2018-03-30 | [
[
"Zhang",
"Ziqi",
""
],
[
"Gao",
"Jie",
""
],
[
"Ciravegna",
"Fabio",
""
]
] | Automatic Term Extraction deals with the extraction of terminology from a domain specific corpus, and has long been an established research area in data and knowledge acquisition. ATE remains a challenging task as it is known that there is no existing ATE methods that can consistently outperform others in any domain. T... |
2403.09188 | Yu-Tang Chang | Yu Tang Chang and Shih Fang Chen | Design of an basis-projected layer for sparse datasets in deep learning
training using gc-ms spectra as a case study | 5 pages, 2 figures, 2 tables, conference | null | null | null | cs.LG eess.SP | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Deep learning (DL) models encompass millions or even billions of parameters
and learn complex patterns from big data. However, not all data are initially
stored in a suitable formation to effectively train a DL model, e.g., gas
chromatography-mass spectrometry (GC-MS) spectra and DNA sequence. These
datasets commonly... | [
{
"created": "Thu, 14 Mar 2024 09:03:51 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Chang",
"Yu Tang",
""
],
[
"Chen",
"Shih Fang",
""
]
] | Deep learning (DL) models encompass millions or even billions of parameters and learn complex patterns from big data. However, not all data are initially stored in a suitable formation to effectively train a DL model, e.g., gas chromatography-mass spectrometry (GC-MS) spectra and DNA sequence. These datasets commonly c... |
2406.03146 | Erik Landolsi | Erik Landolsi, Fredrik Kahl | Tiny models from tiny data: Textual and null-text inversion for few-shot
distillation | 21 pages (9 main pages + references and appendix) | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Few-shot image classification involves classifying images using very few
training examples. Recent vision foundation models show excellent few-shot
transfer abilities, but are large and slow at inference. Using knowledge
distillation, the capabilities of high-performing but slow models can be
transferred to tiny, eff... | [
{
"created": "Wed, 5 Jun 2024 11:01:42 GMT",
"version": "v1"
}
] | 2024-06-06 | [
[
"Landolsi",
"Erik",
""
],
[
"Kahl",
"Fredrik",
""
]
] | Few-shot image classification involves classifying images using very few training examples. Recent vision foundation models show excellent few-shot transfer abilities, but are large and slow at inference. Using knowledge distillation, the capabilities of high-performing but slow models can be transferred to tiny, effic... |
2306.06823 | Sujoy Paul | Sujoy Paul and Gagan Madan and Akankshya Mishra and Narayan Hegde and
Pradeep Kumar and Gaurav Aggarwal | Weakly supervised information extraction from inscrutable handwritten
document images | Accepted at ICDAR 2023 | null | null | null | cs.CV cs.CL | http://creativecommons.org/licenses/by/4.0/ | State-of-the-art information extraction methods are limited by OCR errors.
They work well for printed text in form-like documents, but unstructured,
handwritten documents still remain a challenge. Adapting existing models to
domain-specific training data is quite expensive, because of two factors, 1)
limited availabi... | [
{
"created": "Mon, 12 Jun 2023 02:22:30 GMT",
"version": "v1"
}
] | 2023-06-13 | [
[
"Paul",
"Sujoy",
""
],
[
"Madan",
"Gagan",
""
],
[
"Mishra",
"Akankshya",
""
],
[
"Hegde",
"Narayan",
""
],
[
"Kumar",
"Pradeep",
""
],
[
"Aggarwal",
"Gaurav",
""
]
] | State-of-the-art information extraction methods are limited by OCR errors. They work well for printed text in form-like documents, but unstructured, handwritten documents still remain a challenge. Adapting existing models to domain-specific training data is quite expensive, because of two factors, 1) limited availabili... |
2401.14009 | Yuxia Wu | Yuxia Wu, Yuan Fang and Lizi Liao | On the Feasibility of Simple Transformer for Dynamic Graph Modeling | accepted by WWW'24 | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dynamic graph modeling is crucial for understanding complex structures in web
graphs, spanning applications in social networks, recommender systems, and
more. Most existing methods primarily emphasize structural dependencies and
their temporal changes. However, these approaches often overlook detailed
temporal aspect... | [
{
"created": "Thu, 25 Jan 2024 08:18:31 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Feb 2024 02:30:01 GMT",
"version": "v2"
}
] | 2024-02-28 | [
[
"Wu",
"Yuxia",
""
],
[
"Fang",
"Yuan",
""
],
[
"Liao",
"Lizi",
""
]
] | Dynamic graph modeling is crucial for understanding complex structures in web graphs, spanning applications in social networks, recommender systems, and more. Most existing methods primarily emphasize structural dependencies and their temporal changes. However, these approaches often overlook detailed temporal aspects ... |
2105.05751 | Revanth V S | Revanth V S, Suthan L | Prevention Of Attack In Vehicular Adhoc Network Using Trust Model | i have to modify the contents of the paper | null | null | null | cs.NI | http://creativecommons.org/publicdomain/zero/1.0/ | Vehicular ad hoc networks is a modern technology that holds an important
aspect in the transportation domain due to its abilities to increase traffic
efficiency and safety. It is a another variant of Mobile ad-hoc networks that
provides Vehicles to Vehicles (V2V), Rode-side Unit to Road-side Unit(R2R) and
Vehicles to... | [
{
"created": "Wed, 12 May 2021 16:08:54 GMT",
"version": "v1"
},
{
"created": "Wed, 19 May 2021 14:16:57 GMT",
"version": "v2"
}
] | 2021-05-20 | [
[
"S",
"Revanth V",
""
],
[
"L",
"Suthan",
""
]
] | Vehicular ad hoc networks is a modern technology that holds an important aspect in the transportation domain due to its abilities to increase traffic efficiency and safety. It is a another variant of Mobile ad-hoc networks that provides Vehicles to Vehicles (V2V), Rode-side Unit to Road-side Unit(R2R) and Vehicles to r... |
1204.5981 | Barnaby Martin | Florent Madelaine and Barnaby Martin | Containment, Equivalence and Coreness from CSP to QCSP and beyond | null | null | null | null | cs.LO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The constraint satisfaction problem (CSP) and its quantified extensions,
whether without (QCSP) or with disjunction (QCSP_or), correspond naturally to
the model checking problem for three increasingly stronger fragments of
positive first-order logic. Their complexity is often studied when
parameterised by a fixed mod... | [
{
"created": "Thu, 26 Apr 2012 16:46:25 GMT",
"version": "v1"
}
] | 2012-04-27 | [
[
"Madelaine",
"Florent",
""
],
[
"Martin",
"Barnaby",
""
]
] | The constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP_or), correspond naturally to the model checking problem for three increasingly stronger fragments of positive first-order logic. Their complexity is often studied when parameterised by a fixed model... |
2210.13852 | Zhuoran Zheng | Weiyi Cong, Zhuoran Zheng and Xiuyi Jia | TabMixer: Excavating Label Distribution Learning with Small-scale
Features | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Label distribution learning (LDL) differs from multi-label learning which
aims at representing the polysemy of instances by transforming single-label
values into descriptive degrees. Unfortunately, the feature space of the label
distribution dataset is affected by human factors and the inductive bias of the
feature e... | [
{
"created": "Tue, 25 Oct 2022 09:18:15 GMT",
"version": "v1"
}
] | 2022-10-26 | [
[
"Cong",
"Weiyi",
""
],
[
"Zheng",
"Zhuoran",
""
],
[
"Jia",
"Xiuyi",
""
]
] | Label distribution learning (LDL) differs from multi-label learning which aims at representing the polysemy of instances by transforming single-label values into descriptive degrees. Unfortunately, the feature space of the label distribution dataset is affected by human factors and the inductive bias of the feature ext... |
1708.03366 | Sangdon Park | Sangdon Park, James Weimer and Insup Lee | Resilient Linear Classification: An Approach to Deal with Attacks on
Training Data | Accepted as a conference paper at ICCPS17 | null | 10.1145/3055004.3055006 | null | cs.LG cs.AI cs.CR cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data-driven techniques are used in cyber-physical systems (CPS) for
controlling autonomous vehicles, handling demand responses for energy
management, and modeling human physiology for medical devices. These
data-driven techniques extract models from training data, where their
performance is often analyzed with respec... | [
{
"created": "Thu, 10 Aug 2017 19:54:58 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Aug 2017 15:25:16 GMT",
"version": "v2"
}
] | 2017-08-16 | [
[
"Park",
"Sangdon",
""
],
[
"Weimer",
"James",
""
],
[
"Lee",
"Insup",
""
]
] | Data-driven techniques are used in cyber-physical systems (CPS) for controlling autonomous vehicles, handling demand responses for energy management, and modeling human physiology for medical devices. These data-driven techniques extract models from training data, where their performance is often analyzed with respect ... |
2408.06709 | Zhuoran Zheng | Xin Su, Zhuoran Zheng, Chen Wu | Review Learning: Advancing All-in-One Ultra-High-Definition Image
Restoration Training Method | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | All-in-one image restoration tasks are becoming increasingly important,
especially for ultra-high-definition (UHD) images. Existing all-in-one UHD
image restoration methods usually boost the model's performance by introducing
prompt or customized dynamized networks for different degradation types. For
the inference s... | [
{
"created": "Tue, 13 Aug 2024 08:08:45 GMT",
"version": "v1"
}
] | 2024-08-14 | [
[
"Su",
"Xin",
""
],
[
"Zheng",
"Zhuoran",
""
],
[
"Wu",
"Chen",
""
]
] | All-in-one image restoration tasks are becoming increasingly important, especially for ultra-high-definition (UHD) images. Existing all-in-one UHD image restoration methods usually boost the model's performance by introducing prompt or customized dynamized networks for different degradation types. For the inference sta... |
2201.05057 | Qingzhao Zhang | Qingzhao Zhang, Shengtuo Hu, Jiachen Sun, Qi Alfred Chen, Z. Morley
Mao | On Adversarial Robustness of Trajectory Prediction for Autonomous
Vehicles | 13 pages, 13 figures, accepted by CVPR 2022 | null | null | null | cs.CV cs.CR | http://creativecommons.org/licenses/by/4.0/ | Trajectory prediction is a critical component for autonomous vehicles (AVs)
to perform safe planning and navigation. However, few studies have analyzed the
adversarial robustness of trajectory prediction or investigated whether the
worst-case prediction can still lead to safe planning. To bridge this gap, we
study th... | [
{
"created": "Thu, 13 Jan 2022 16:33:04 GMT",
"version": "v1"
},
{
"created": "Fri, 11 Mar 2022 18:09:01 GMT",
"version": "v2"
},
{
"created": "Mon, 22 Aug 2022 01:51:52 GMT",
"version": "v3"
}
] | 2022-08-23 | [
[
"Zhang",
"Qingzhao",
""
],
[
"Hu",
"Shengtuo",
""
],
[
"Sun",
"Jiachen",
""
],
[
"Chen",
"Qi Alfred",
""
],
[
"Mao",
"Z. Morley",
""
]
] | Trajectory prediction is a critical component for autonomous vehicles (AVs) to perform safe planning and navigation. However, few studies have analyzed the adversarial robustness of trajectory prediction or investigated whether the worst-case prediction can still lead to safe planning. To bridge this gap, we study the ... |
2006.00617 | Casper Hansen | Casper Hansen and Christian Hansen and Jakob Grue Simonsen and Stephen
Alstrup and Christina Lioma | Content-aware Neural Hashing for Cold-start Recommendation | Accepted to SIGIR 2020 | null | 10.1145/3397271.3401060 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Content-aware recommendation approaches are essential for providing
meaningful recommendations for \textit{new} (i.e., \textit{cold-start}) items
in a recommender system. We present a content-aware neural hashing-based
collaborative filtering approach (NeuHash-CF), which generates binary hash
codes for users and item... | [
{
"created": "Sun, 31 May 2020 21:29:38 GMT",
"version": "v1"
}
] | 2020-06-02 | [
[
"Hansen",
"Casper",
""
],
[
"Hansen",
"Christian",
""
],
[
"Simonsen",
"Jakob Grue",
""
],
[
"Alstrup",
"Stephen",
""
],
[
"Lioma",
"Christina",
""
]
] | Content-aware recommendation approaches are essential for providing meaningful recommendations for \textit{new} (i.e., \textit{cold-start}) items in a recommender system. We present a content-aware neural hashing-based collaborative filtering approach (NeuHash-CF), which generates binary hash codes for users and items,... |
2405.15310 | Duke Nguyen | Duke Nguyen, Aditya Joshi, Flora Salim | Spectraformer: A Unified Random Feature Framework for Transformer | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Linearization of attention using various kernel approximation and kernel
learning techniques has shown promise. Past methods use a subset of
combinations of component functions and weight matrices within the random
features paradigm. We identify the need for a systematic comparison of
different combinations of weight... | [
{
"created": "Fri, 24 May 2024 07:52:53 GMT",
"version": "v1"
},
{
"created": "Wed, 29 May 2024 04:45:26 GMT",
"version": "v2"
}
] | 2024-05-30 | [
[
"Nguyen",
"Duke",
""
],
[
"Joshi",
"Aditya",
""
],
[
"Salim",
"Flora",
""
]
] | Linearization of attention using various kernel approximation and kernel learning techniques has shown promise. Past methods use a subset of combinations of component functions and weight matrices within the random features paradigm. We identify the need for a systematic comparison of different combinations of weight m... |
1912.09528 | Nirupam Gupta | Nirupam Gupta and Nitin H. Vaidya | Randomized Reactive Redundancy for Byzantine Fault-Tolerance in
Parallelized Learning | null | null | null | null | cs.DC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This report considers the problem of Byzantine fault-tolerance in synchronous
parallelized learning that is founded on the parallelized stochastic gradient
descent (parallelized-SGD) algorithm. The system comprises a master, and $n$
workers, where up to $f$ of the workers are Byzantine faulty. Byzantine workers
need ... | [
{
"created": "Thu, 19 Dec 2019 20:15:28 GMT",
"version": "v1"
}
] | 2019-12-23 | [
[
"Gupta",
"Nirupam",
""
],
[
"Vaidya",
"Nitin H.",
""
]
] | This report considers the problem of Byzantine fault-tolerance in synchronous parallelized learning that is founded on the parallelized stochastic gradient descent (parallelized-SGD) algorithm. The system comprises a master, and $n$ workers, where up to $f$ of the workers are Byzantine faulty. Byzantine workers need no... |
2112.02701 | Xuanli He | Xuanli He, Qiongkai Xu, Lingjuan Lyu, Fangzhao Wu, Chenguang Wang | Protecting Intellectual Property of Language Generation APIs with
Lexical Watermark | accepted to AAAI2022 | null | null | null | cs.CR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, due to the breakthrough in natural language generation (NLG),
including machine translation, document summarization, image captioning, etc
NLG models have been encapsulated in cloud APIs to serve over half a billion
people worldwide and process over one hundred billion word generations per day.
Thus, NLG AP... | [
{
"created": "Sun, 5 Dec 2021 22:54:54 GMT",
"version": "v1"
}
] | 2021-12-07 | [
[
"He",
"Xuanli",
""
],
[
"Xu",
"Qiongkai",
""
],
[
"Lyu",
"Lingjuan",
""
],
[
"Wu",
"Fangzhao",
""
],
[
"Wang",
"Chenguang",
""
]
] | Nowadays, due to the breakthrough in natural language generation (NLG), including machine translation, document summarization, image captioning, etc NLG models have been encapsulated in cloud APIs to serve over half a billion people worldwide and process over one hundred billion word generations per day. Thus, NLG APIs... |
2006.11404 | Safalya Pal | Safalya Pal | Auto-Encoding for Shared Cross Domain Feature Representation and
Image-to-Image Translation | null | null | null | null | cs.CV cs.LG eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image-to-image translation is a subset of computer vision and pattern
recognition problems where our goal is to learn a mapping between input images
of domain $\mathbf{X}_1$ and output images of domain $\mathbf{X}_2$. Current
methods use neural networks with an encoder-decoder structure to learn a
mapping $G:\mathbf{... | [
{
"created": "Thu, 11 Jun 2020 21:38:23 GMT",
"version": "v1"
}
] | 2020-06-23 | [
[
"Pal",
"Safalya",
""
]
] | Image-to-image translation is a subset of computer vision and pattern recognition problems where our goal is to learn a mapping between input images of domain $\mathbf{X}_1$ and output images of domain $\mathbf{X}_2$. Current methods use neural networks with an encoder-decoder structure to learn a mapping $G:\mathbf{X}... |
1608.06235 | Yunpeng Pan | Yunpeng Pan, Xinyan Yan, Evangelos Theodorou and Byron Boots | Adaptive Probabilistic Trajectory Optimization via Efficient Approximate
Inference | null | null | null | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robotic systems must be able to quickly and robustly make decisions when
operating in uncertain and dynamic environments. While Reinforcement Learning
(RL) can be used to compute optimal policies with little prior knowledge about
the environment, it suffers from slow convergence. An alternative approach is
Model Pred... | [
{
"created": "Mon, 22 Aug 2016 17:49:50 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Sep 2016 23:11:23 GMT",
"version": "v2"
}
] | 2016-09-13 | [
[
"Pan",
"Yunpeng",
""
],
[
"Yan",
"Xinyan",
""
],
[
"Theodorou",
"Evangelos",
""
],
[
"Boots",
"Byron",
""
]
] | Robotic systems must be able to quickly and robustly make decisions when operating in uncertain and dynamic environments. While Reinforcement Learning (RL) can be used to compute optimal policies with little prior knowledge about the environment, it suffers from slow convergence. An alternative approach is Model Predic... |
2006.07589 | Minseon Kim | Minseon Kim, Jihoon Tack, Sung Ju Hwang | Adversarial Self-Supervised Contrastive Learning | NeurIPS 2020. Code: https://github.com/Kim-Minseon/RoCL | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing adversarial learning approaches mostly use class labels to generate
adversarial samples that lead to incorrect predictions, which are then used to
augment the training of the model for improved robustness. While some recent
works propose semi-supervised adversarial learning methods that utilize
unlabeled dat... | [
{
"created": "Sat, 13 Jun 2020 08:24:33 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Oct 2020 14:04:48 GMT",
"version": "v2"
}
] | 2020-10-27 | [
[
"Kim",
"Minseon",
""
],
[
"Tack",
"Jihoon",
""
],
[
"Hwang",
"Sung Ju",
""
]
] | Existing adversarial learning approaches mostly use class labels to generate adversarial samples that lead to incorrect predictions, which are then used to augment the training of the model for improved robustness. While some recent works propose semi-supervised adversarial learning methods that utilize unlabeled data,... |
1909.06317 | Shigeki Karita | Shigeki Karita, Nanxin Chen, Tomoki Hayashi, Takaaki Hori, Hirofumi
Inaguma, Ziyan Jiang, Masao Someki, Nelson Enrique Yalta Soplin, Ryuichi
Yamamoto, Xiaofei Wang, Shinji Watanabe, Takenori Yoshimura, Wangyou Zhang | A Comparative Study on Transformer vs RNN in Speech Applications | Accepted at ASRU 2019 | IEEE Automatic Speech Recognition and Understanding Workshop 2019 | 10.1109/ASRU46091.2019.9003750 | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sequence-to-sequence models have been widely used in end-to-end speech
processing, for example, automatic speech recognition (ASR), speech translation
(ST), and text-to-speech (TTS). This paper focuses on an emergent
sequence-to-sequence model called Transformer, which achieves state-of-the-art
performance in neural ... | [
{
"created": "Fri, 13 Sep 2019 16:27:08 GMT",
"version": "v1"
},
{
"created": "Sat, 28 Sep 2019 11:11:38 GMT",
"version": "v2"
}
] | 2021-06-10 | [
[
"Karita",
"Shigeki",
""
],
[
"Chen",
"Nanxin",
""
],
[
"Hayashi",
"Tomoki",
""
],
[
"Hori",
"Takaaki",
""
],
[
"Inaguma",
"Hirofumi",
""
],
[
"Jiang",
"Ziyan",
""
],
[
"Someki",
"Masao",
""
],
[
"So... | Sequence-to-sequence models have been widely used in end-to-end speech processing, for example, automatic speech recognition (ASR), speech translation (ST), and text-to-speech (TTS). This paper focuses on an emergent sequence-to-sequence model called Transformer, which achieves state-of-the-art performance in neural ma... |
1411.5319 | Kota Hara | Kota Hara, Vignesh Jagadeesh, Robinson Piramuthu | Fashion Apparel Detection: The Role of Deep Convolutional Neural Network
and Pose-dependent Priors | Accepted for publication at IEEE Winter Conference on Applications of
Computer Vision (WACV) 2016 | null | 10.1109/WACV.2016.7477611 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we propose and address a new computer vision task, which we
call fashion item detection, where the aim is to detect various fashion items a
person in the image is wearing or carrying. The types of fashion items we
consider in this work include hat, glasses, bag, pants, shoes and so on. The
detection of ... | [
{
"created": "Wed, 19 Nov 2014 19:09:00 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Jan 2016 19:45:37 GMT",
"version": "v2"
}
] | 2016-11-17 | [
[
"Hara",
"Kota",
""
],
[
"Jagadeesh",
"Vignesh",
""
],
[
"Piramuthu",
"Robinson",
""
]
] | In this work, we propose and address a new computer vision task, which we call fashion item detection, where the aim is to detect various fashion items a person in the image is wearing or carrying. The types of fashion items we consider in this work include hat, glasses, bag, pants, shoes and so on. The detection of fa... |
2006.14808 | Masayoshi Aritsugi | Riku Anegawa and Masayoshi Aritsugi | Text Detection on Roughly Placed Books by Leveraging a Learning-based
Model Trained with Another Domain Data | null | null | null | null | cs.CV cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text detection enables us to extract rich information from images. In this
paper, we focus on how to generate bounding boxes that are appropriate to grasp
text areas on books to help implement automatic text detection. We attempt not
to improve a learning-based model by training it with an enough amount of data
in th... | [
{
"created": "Fri, 26 Jun 2020 05:53:23 GMT",
"version": "v1"
}
] | 2020-06-29 | [
[
"Anegawa",
"Riku",
""
],
[
"Aritsugi",
"Masayoshi",
""
]
] | Text detection enables us to extract rich information from images. In this paper, we focus on how to generate bounding boxes that are appropriate to grasp text areas on books to help implement automatic text detection. We attempt not to improve a learning-based model by training it with an enough amount of data in the ... |
2110.04599 | Sarah Di | Sarah Di, Robin Yu, Amol Kapoor | Embed Everything: A Method for Efficiently Co-Embedding Multi-Modal
Spaces | 7 pages, 4 figures | null | null | null | cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Any general artificial intelligence system must be able to interpret, operate
on, and produce data in a multi-modal latent space that can represent audio,
imagery, text, and more. In the last decade, deep neural networks have seen
remarkable success in unimodal data distributions, while transfer learning
techniques h... | [
{
"created": "Sat, 9 Oct 2021 15:39:27 GMT",
"version": "v1"
}
] | 2021-10-12 | [
[
"Di",
"Sarah",
""
],
[
"Yu",
"Robin",
""
],
[
"Kapoor",
"Amol",
""
]
] | Any general artificial intelligence system must be able to interpret, operate on, and produce data in a multi-modal latent space that can represent audio, imagery, text, and more. In the last decade, deep neural networks have seen remarkable success in unimodal data distributions, while transfer learning techniques hav... |
1005.1856 | Mohsen Toorani | M. Toorani, A. A. Beheshti | An Elliptic Curve-based Signcryption Scheme with Forward Secrecy | 13 Pages, 5 Figures, 2 Tables | Journal of Applied Sciences, Vol.9, No.6, pp.1025-1035, 2009 | 10.3923/jas.2009.1025.1035 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An elliptic curve-based signcryption scheme is introduced in this paper that
effectively combines the functionalities of digital signature and encryption,
and decreases the computational costs and communication overheads in comparison
with the traditional signature-then-encryption schemes. It simultaneously
provides ... | [
{
"created": "Tue, 11 May 2010 15:14:54 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Mar 2012 20:35:20 GMT",
"version": "v2"
}
] | 2012-03-21 | [
[
"Toorani",
"M.",
""
],
[
"Beheshti",
"A. A.",
""
]
] | An elliptic curve-based signcryption scheme is introduced in this paper that effectively combines the functionalities of digital signature and encryption, and decreases the computational costs and communication overheads in comparison with the traditional signature-then-encryption schemes. It simultaneously provides th... |
2108.08255 | Linan Huang | Linan Huang and Quanyan Zhu | Combating Informational Denial-of-Service (IDoS) Attacks: Modeling and
Mitigation of Attentional Human Vulnerability | null | null | 10.1007/978-3-030-90370-1_17 | null | cs.CR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work proposes a new class of proactive attacks called the Informational
Denial-of-Service (IDoS) attacks that exploit the attentional human
vulnerability. By generating a large volume of feints, IDoS attacks deplete the
cognitive resources of human operators to prevent humans from identifying the
real attacks hi... | [
{
"created": "Wed, 4 Aug 2021 05:09:32 GMT",
"version": "v1"
},
{
"created": "Sat, 16 Oct 2021 19:00:01 GMT",
"version": "v2"
}
] | 2021-10-19 | [
[
"Huang",
"Linan",
""
],
[
"Zhu",
"Quanyan",
""
]
] | This work proposes a new class of proactive attacks called the Informational Denial-of-Service (IDoS) attacks that exploit the attentional human vulnerability. By generating a large volume of feints, IDoS attacks deplete the cognitive resources of human operators to prevent humans from identifying the real attacks hidd... |
1711.09360 | Alexios Balatsoukas-Stimming | Alexios Balatsoukas Stimming and Athanasios P. Liavas | Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple
Access Channel | null | null | 10.1109/LWC.2018.2833855 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we describe an LDPC code design framework for the unequal power
two-user Gaussian multiple access channel using EXIT charts. We show that the
sum-rate of the LDPC codes designed using our approach can get close to the
maximal sum-rate of the two-user Gaussian multiple access channel. Moreover, we
provid... | [
{
"created": "Sun, 26 Nov 2017 09:59:13 GMT",
"version": "v1"
},
{
"created": "Fri, 4 May 2018 08:40:08 GMT",
"version": "v2"
},
{
"created": "Wed, 16 May 2018 09:06:56 GMT",
"version": "v3"
}
] | 2018-05-17 | [
[
"Stimming",
"Alexios Balatsoukas",
""
],
[
"Liavas",
"Athanasios P.",
""
]
] | In this work, we describe an LDPC code design framework for the unequal power two-user Gaussian multiple access channel using EXIT charts. We show that the sum-rate of the LDPC codes designed using our approach can get close to the maximal sum-rate of the two-user Gaussian multiple access channel. Moreover, we provide ... |
2407.14023 | Aakash Sorathiya | Aakash Sorathiya, Gouri Ginde | Towards Extracting Ethical Concerns-related Software Requirements from
App Reviews | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | As mobile applications become increasingly integral to our daily lives,
concerns about ethics have grown drastically. Users share their experiences,
report bugs, and request new features in application reviews, often
highlighting safety, privacy, and accountability concerns. Approaches using
machine learning techniqu... | [
{
"created": "Fri, 19 Jul 2024 04:50:32 GMT",
"version": "v1"
}
] | 2024-07-22 | [
[
"Sorathiya",
"Aakash",
""
],
[
"Ginde",
"Gouri",
""
]
] | As mobile applications become increasingly integral to our daily lives, concerns about ethics have grown drastically. Users share their experiences, report bugs, and request new features in application reviews, often highlighting safety, privacy, and accountability concerns. Approaches using machine learning techniques... |
2101.11704 | Mahsa Shafaei | Mahsa Shafaei, Christos Smailis, Ioannis A. Kakadiaris, Thamar Solorio | A Case Study of Deep Learning Based Multi-Modal Methods for Predicting
the Age-Suitability Rating of Movie Trailers | null | null | null | null | cs.LG cs.MM cs.SD eess.AS eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we explore different approaches to combine modalities for the
problem of automated age-suitability rating of movie trailers. First, we
introduce a new dataset containing videos of movie trailers in English
downloaded from IMDB and YouTube, along with their corresponding
age-suitability rating labels. Se... | [
{
"created": "Tue, 26 Jan 2021 17:15:35 GMT",
"version": "v1"
}
] | 2021-01-29 | [
[
"Shafaei",
"Mahsa",
""
],
[
"Smailis",
"Christos",
""
],
[
"Kakadiaris",
"Ioannis A.",
""
],
[
"Solorio",
"Thamar",
""
]
] | In this work, we explore different approaches to combine modalities for the problem of automated age-suitability rating of movie trailers. First, we introduce a new dataset containing videos of movie trailers in English downloaded from IMDB and YouTube, along with their corresponding age-suitability rating labels. Seco... |
1701.03274 | Jun Chen | Jun Chen, Chaokun Wang | Investigating the role of musical genre in human perception of music
stretching resistance | null | null | null | null | cs.MM cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To stretch a music piece to a given length is a common demand in people's
daily lives, e.g., in audio-video synchronization and animation production.
However, it is not always guaranteed that the stretched music piece is
acceptable for general audience since music stretching suffers from people's
perceptual artefacts... | [
{
"created": "Thu, 12 Jan 2017 09:26:22 GMT",
"version": "v1"
}
] | 2017-01-13 | [
[
"Chen",
"Jun",
""
],
[
"Wang",
"Chaokun",
""
]
] | To stretch a music piece to a given length is a common demand in people's daily lives, e.g., in audio-video synchronization and animation production. However, it is not always guaranteed that the stretched music piece is acceptable for general audience since music stretching suffers from people's perceptual artefacts. ... |
1208.6269 | Hadi Katebi | Hadi Katebi and Karem A. Sakallah and Igor L. Markov | Conflict Anticipation in the Search for Graph Automorphisms | 15 pages, 9 Figures, 1 Table, Int'l Conf. on Logic for Programming,
Artificial Intelligence and Reasoning (LPAR) | H. Katebi, K. A. Sakallah and I. L. Markov, "Conflict Anticipation
in the Search for Graph Automorphisms" in Proc. Int'l Conf. on Logic for
Programming, Artificial Intelligence and Reasoning (LPAR), pp. 243-257,
Merida, Venezuela, 2012 | null | null | cs.DS math.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Effective search for graph automorphisms allows identifying symmetries in
many discrete structures, ranging from chemical molecules to microprocessor
circuits. Using this type of structure can enhance visualization as well as
speed up computational optimization and verification. Competitive algorithms
for the graph a... | [
{
"created": "Thu, 30 Aug 2012 19:10:11 GMT",
"version": "v1"
}
] | 2012-08-31 | [
[
"Katebi",
"Hadi",
""
],
[
"Sakallah",
"Karem A.",
""
],
[
"Markov",
"Igor L.",
""
]
] | Effective search for graph automorphisms allows identifying symmetries in many discrete structures, ranging from chemical molecules to microprocessor circuits. Using this type of structure can enhance visualization as well as speed up computational optimization and verification. Competitive algorithms for the graph aut... |
2302.10891 | Matthieu NASTORG | Matthieu Nastorg (TAU, IFPEN), Michele Alessandro Bucci (TAU),
Thibault Faney (IFPEN), Jean-Marc Gratien (IFPEN), Guillaume Charpiat (TAU),
Marc Schoenauer (TAU) | An Implicit GNN Solver for Poisson-like problems | null | null | null | null | cs.LG cs.AI math.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents $\Psi$-GNN, a novel Graph Neural Network (GNN) approach
for solving the ubiquitous Poisson PDE problems with mixed boundary conditions.
By leveraging the Implicit Layer Theory, $\Psi$-GNN models an "infinitely" deep
network, thus avoiding the empirical tuning of the number of required Message
Pass... | [
{
"created": "Mon, 6 Feb 2023 10:08:42 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Feb 2023 14:55:41 GMT",
"version": "v2"
},
{
"created": "Tue, 26 Mar 2024 08:50:19 GMT",
"version": "v3"
}
] | 2024-03-27 | [
[
"Nastorg",
"Matthieu",
"",
"TAU, IFPEN"
],
[
"Bucci",
"Michele Alessandro",
"",
"TAU"
],
[
"Faney",
"Thibault",
"",
"IFPEN"
],
[
"Gratien",
"Jean-Marc",
"",
"IFPEN"
],
[
"Charpiat",
"Guillaume",
"",
"TAU"
],
[
... | This paper presents $\Psi$-GNN, a novel Graph Neural Network (GNN) approach for solving the ubiquitous Poisson PDE problems with mixed boundary conditions. By leveraging the Implicit Layer Theory, $\Psi$-GNN models an "infinitely" deep network, thus avoiding the empirical tuning of the number of required Message Passin... |
2301.07390 | Alberto De Marchi | Luca Sciullo, Alberto De Marchi, Angelo Trotta, Federico Montori,
Luciano Bononi, Marco Di Felice | Relativistic Digital Twin: Bringing the IoT to the Future | 18 pages, 10 figures, 4 tables, 6 listings | Future Generation Computer Systems 153, 521-536 (2024) | 10.1016/j.future.2023.12.016 | null | cs.NI cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | Complex IoT ecosystems often require the usage of Digital Twins (DTs) of
their physical assets in order to perform predictive analytics and simulate
what-if scenarios. DTs are able to replicate IoT devices and adapt over time to
their behavioral changes. However, DTs in IoT are typically tailored to a
specific use ca... | [
{
"created": "Wed, 18 Jan 2023 09:37:05 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Sep 2023 21:13:01 GMT",
"version": "v2"
},
{
"created": "Sat, 30 Dec 2023 11:12:13 GMT",
"version": "v3"
}
] | 2024-01-02 | [
[
"Sciullo",
"Luca",
""
],
[
"De Marchi",
"Alberto",
""
],
[
"Trotta",
"Angelo",
""
],
[
"Montori",
"Federico",
""
],
[
"Bononi",
"Luciano",
""
],
[
"Di Felice",
"Marco",
""
]
] | Complex IoT ecosystems often require the usage of Digital Twins (DTs) of their physical assets in order to perform predictive analytics and simulate what-if scenarios. DTs are able to replicate IoT devices and adapt over time to their behavioral changes. However, DTs in IoT are typically tailored to a specific use case... |
2102.09150 | Decky Aspandi | Decky Aspandi, Federico Sukno, Bj\"orn Schuller and Xavier Binefa | An Enhanced Adversarial Network with Combined Latent Features for
Spatio-Temporal Facial Affect Estimation in the Wild | Accepted Version on VISAPP 2021 | null | 10.5220/0010332001720181 | null | cs.CV cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Affective Computing has recently attracted the attention of the research
community, due to its numerous applications in diverse areas. In this context,
the emergence of video-based data allows to enrich the widely used spatial
features with the inclusion of temporal information. However, such
spatio-temporal modellin... | [
{
"created": "Thu, 18 Feb 2021 04:10:12 GMT",
"version": "v1"
}
] | 2021-02-19 | [
[
"Aspandi",
"Decky",
""
],
[
"Sukno",
"Federico",
""
],
[
"Schuller",
"Björn",
""
],
[
"Binefa",
"Xavier",
""
]
] | Affective Computing has recently attracted the attention of the research community, due to its numerous applications in diverse areas. In this context, the emergence of video-based data allows to enrich the widely used spatial features with the inclusion of temporal information. However, such spatio-temporal modelling ... |
1501.05153 | Nadeem Akhtar | Nadeem Akhtar, Yann Le Guyadec, Flavio Oquendo | Formal requirement and architecture specifications of a multi-agent
robotic system | 6 pages | Journal of Computing, eISSN 2151-9617. Volume 4, Issue 4, April
2012 | null | null | cs.SE cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most challenging tasks in specification engineering for a
multi-agent robotic system is to formally specify and architect the system,
especially as a multi-agent robotic system is concurrent having concurrent
processing, and often having dynamic environment. The formal requirement and
architecture specific... | [
{
"created": "Wed, 21 Jan 2015 12:32:42 GMT",
"version": "v1"
}
] | 2015-01-22 | [
[
"Akhtar",
"Nadeem",
""
],
[
"Guyadec",
"Yann Le",
""
],
[
"Oquendo",
"Flavio",
""
]
] | One of the most challenging tasks in specification engineering for a multi-agent robotic system is to formally specify and architect the system, especially as a multi-agent robotic system is concurrent having concurrent processing, and often having dynamic environment. The formal requirement and architecture specificat... |
2207.01706 | Raja Karmakar | Raja Karmakar, Georges Kaddoum, Samiran Chattopadhyay | Mobility Management in 5G and Beyond: A Novel Smart Handover with
Adaptive Time-to-Trigger and Hysteresis Margin | 16 pages | IEEE Transactions on Mobile Computing, 2022 | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | The 5th Generation (5G) New Radio (NR) and beyond technologies will support
enhanced mobile broadband, very low latency communications, and huge numbers of
mobile devices. Therefore, for very high speed users, seamless mobility needs
to be maintained during the migration from one cell to another in the handover.
Due ... | [
{
"created": "Mon, 4 Jul 2022 20:12:33 GMT",
"version": "v1"
}
] | 2022-07-06 | [
[
"Karmakar",
"Raja",
""
],
[
"Kaddoum",
"Georges",
""
],
[
"Chattopadhyay",
"Samiran",
""
]
] | The 5th Generation (5G) New Radio (NR) and beyond technologies will support enhanced mobile broadband, very low latency communications, and huge numbers of mobile devices. Therefore, for very high speed users, seamless mobility needs to be maintained during the migration from one cell to another in the handover. Due to... |
2402.16237 | Giang Ngo | Giang Ngo, Dang Nguyen, Dat Phan-Trong, Sunil Gupta | Active Level Set Estimation for Continuous Search Space with Theoretical
Guarantee | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | A common problem encountered in many real-world applications is level set
estimation where the goal is to determine the region in the function domain
where the function is above or below a given threshold. When the function is
black-box and expensive to evaluate, the level sets need to be found in a
minimum set of fu... | [
{
"created": "Mon, 26 Feb 2024 01:46:56 GMT",
"version": "v1"
}
] | 2024-02-27 | [
[
"Ngo",
"Giang",
""
],
[
"Nguyen",
"Dang",
""
],
[
"Phan-Trong",
"Dat",
""
],
[
"Gupta",
"Sunil",
""
]
] | A common problem encountered in many real-world applications is level set estimation where the goal is to determine the region in the function domain where the function is above or below a given threshold. When the function is black-box and expensive to evaluate, the level sets need to be found in a minimum set of func... |
2010.13407 | Dominique Vaufreydaz | Niranjan Deshpande (CHROMA), Dominique Vaufreydaz (LIG), Anne
Spalanzani (CHROMA) | Behavioral decision-making for urban autonomous driving in the presence
of pedestrians using Deep Recurrent Q-Network | null | 16th International Conference on Control, Automation, Robotics and
Vision (ICARCV), Dec 2020, Shenzhen, China | null | null | cs.NE cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Decision making for autonomous driving in urban environments is challenging
due to the complexity of the road structure and the uncertainty in the behavior
of diverse road users. Traditional methods consist of manually designed rules
as the driving policy, which require expert domain knowledge, are difficult to
gener... | [
{
"created": "Mon, 26 Oct 2020 08:08:06 GMT",
"version": "v1"
}
] | 2020-10-27 | [
[
"Deshpande",
"Niranjan",
"",
"CHROMA"
],
[
"Vaufreydaz",
"Dominique",
"",
"LIG"
],
[
"Spalanzani",
"Anne",
"",
"CHROMA"
]
] | Decision making for autonomous driving in urban environments is challenging due to the complexity of the road structure and the uncertainty in the behavior of diverse road users. Traditional methods consist of manually designed rules as the driving policy, which require expert domain knowledge, are difficult to general... |
1510.00857 | Ramazan Gokberk Cinbis | Ramazan Gokberk Cinbis, Jakob Verbeek, Cordelia Schmid | Approximate Fisher Kernels of non-iid Image Models for Image
Categorization | IEEE Transactions on Pattern Analysis and Machine Intelligence, in
press, 2015 | IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 38,
no. 6, pp. 1084-1098, June 1 2016 | 10.1109/TPAMI.2015.2484342 | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The bag-of-words (BoW) model treats images as sets of local descriptors and
represents them by visual word histograms. The Fisher vector (FV)
representation extends BoW, by considering the first and second order
statistics of local descriptors. In both representations local descriptors are
assumed to be identically a... | [
{
"created": "Sat, 3 Oct 2015 19:35:38 GMT",
"version": "v1"
}
] | 2016-05-30 | [
[
"Cinbis",
"Ramazan Gokberk",
""
],
[
"Verbeek",
"Jakob",
""
],
[
"Schmid",
"Cordelia",
""
]
] | The bag-of-words (BoW) model treats images as sets of local descriptors and represents them by visual word histograms. The Fisher vector (FV) representation extends BoW, by considering the first and second order statistics of local descriptors. In both representations local descriptors are assumed to be identically and... |
2406.00034 | Yinghao Zhu | Tianlong Wang, Xianfeng Jiao, Yifan He, Zhongzhi Chen, Yinghao Zhu, Xu
Chu, Junyi Gao, Yasha Wang, Liantao Ma | Adaptive Activation Steering: A Tuning-Free LLM Truthfulness Improvement
Method for Diverse Hallucinations Categories | arXiv admin note: text overlap with arXiv:2402.17811 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies have indicated that Large Language Models (LLMs) harbor an
inherent understanding of truthfulness, yet often fail to express fully and
generate false statements. This gap between "knowing" and "telling" poses a
challenge for ensuring the truthfulness of generated content. To address this,
we introduce ... | [
{
"created": "Sun, 26 May 2024 21:39:53 GMT",
"version": "v1"
}
] | 2024-06-06 | [
[
"Wang",
"Tianlong",
""
],
[
"Jiao",
"Xianfeng",
""
],
[
"He",
"Yifan",
""
],
[
"Chen",
"Zhongzhi",
""
],
[
"Zhu",
"Yinghao",
""
],
[
"Chu",
"Xu",
""
],
[
"Gao",
"Junyi",
""
],
[
"Wang",
"Yasha",... | Recent studies have indicated that Large Language Models (LLMs) harbor an inherent understanding of truthfulness, yet often fail to express fully and generate false statements. This gap between "knowing" and "telling" poses a challenge for ensuring the truthfulness of generated content. To address this, we introduce Ad... |
2103.00738 | Aoran Xiao | Aoran Xiao, Xiaofei Yang, Shijian Lu, Dayan Guan and Jiaxing Huang | FPS-Net: A Convolutional Fusion Network for Large-Scale LiDAR Point
Cloud Segmentation | 20 pages, 7 figures | null | 10.1016/j.isprsjprs.2021.04.011 | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Scene understanding based on LiDAR point cloud is an essential task for
autonomous cars to drive safely, which often employs spherical projection to
map 3D point cloud into multi-channel 2D images for semantic segmentation. Most
existing methods simply stack different point attributes/modalities (e.g.
coordinates, in... | [
{
"created": "Mon, 1 Mar 2021 04:08:28 GMT",
"version": "v1"
}
] | 2021-07-19 | [
[
"Xiao",
"Aoran",
""
],
[
"Yang",
"Xiaofei",
""
],
[
"Lu",
"Shijian",
""
],
[
"Guan",
"Dayan",
""
],
[
"Huang",
"Jiaxing",
""
]
] | Scene understanding based on LiDAR point cloud is an essential task for autonomous cars to drive safely, which often employs spherical projection to map 3D point cloud into multi-channel 2D images for semantic segmentation. Most existing methods simply stack different point attributes/modalities (e.g. coordinates, inte... |
2407.20502 | Yeqing Shen | Yeqing Shen, Shang Li and Kun Song | Restoring Real-World Degraded Events Improves Deblurring Quality | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to its high speed and low latency, DVS is frequently employed in motion
deblurring. Ideally, high-quality events would adeptly capture intricate motion
information. However, real-world events are generally degraded, thereby
introducing significant artifacts into the deblurred results. In response to
this challeng... | [
{
"created": "Tue, 30 Jul 2024 02:29:59 GMT",
"version": "v1"
}
] | 2024-07-31 | [
[
"Shen",
"Yeqing",
""
],
[
"Li",
"Shang",
""
],
[
"Song",
"Kun",
""
]
] | Due to its high speed and low latency, DVS is frequently employed in motion deblurring. Ideally, high-quality events would adeptly capture intricate motion information. However, real-world events are generally degraded, thereby introducing significant artifacts into the deblurred results. In response to this challenge,... |
2212.02640 | Quentin Stout | Quentin Stout | Low Power Mesh Algorithms for Image Problems | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We analyze a physically motivated fine-grained mesh-connected computer model,
assuming that a word of information takes a fixed area and that it takes unit
time and unit energy to move a word unit distance. This is a representation of
computing on a chip with myriad tiny processors arranged as a mesh. While most
mesh... | [
{
"created": "Mon, 5 Dec 2022 22:53:57 GMT",
"version": "v1"
}
] | 2022-12-07 | [
[
"Stout",
"Quentin",
""
]
] | We analyze a physically motivated fine-grained mesh-connected computer model, assuming that a word of information takes a fixed area and that it takes unit time and unit energy to move a word unit distance. This is a representation of computing on a chip with myriad tiny processors arranged as a mesh. While most mesh a... |
2309.12642 | Hao Zhu | Hao Zhu, Fengyi Liu, Qi Zhang, Xun Cao, Zhan Ma | RHINO: Regularizing the Hash-based Implicit Neural Representation | 17 pages, 11 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The use of Implicit Neural Representation (INR) through a hash-table has
demonstrated impressive effectiveness and efficiency in characterizing
intricate signals. However, current state-of-the-art methods exhibit
insufficient regularization, often yielding unreliable and noisy results during
interpolations. We find t... | [
{
"created": "Fri, 22 Sep 2023 06:20:41 GMT",
"version": "v1"
}
] | 2023-09-25 | [
[
"Zhu",
"Hao",
""
],
[
"Liu",
"Fengyi",
""
],
[
"Zhang",
"Qi",
""
],
[
"Cao",
"Xun",
""
],
[
"Ma",
"Zhan",
""
]
] | The use of Implicit Neural Representation (INR) through a hash-table has demonstrated impressive effectiveness and efficiency in characterizing intricate signals. However, current state-of-the-art methods exhibit insufficient regularization, often yielding unreliable and noisy results during interpolations. We find tha... |
2405.11311 | Tianxin Zhou | Tianxin Zhou, Xiang Li, Haibing Lu | A Dual Power Grid Cascading Failure Model for the Vulnerability Analysis | null | null | null | null | cs.LG cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Considering the attacks against the power grid, one of the most effective
approaches could be the attack to the transmission lines that leads to large
cascading failures. Hence, the problem of locating the most critical or
vulnerable transmission lines for a Power Grid Cascading Failure (PGCF) has
drawn much attentio... | [
{
"created": "Sat, 18 May 2024 15:04:44 GMT",
"version": "v1"
}
] | 2024-05-21 | [
[
"Zhou",
"Tianxin",
""
],
[
"Li",
"Xiang",
""
],
[
"Lu",
"Haibing",
""
]
] | Considering the attacks against the power grid, one of the most effective approaches could be the attack to the transmission lines that leads to large cascading failures. Hence, the problem of locating the most critical or vulnerable transmission lines for a Power Grid Cascading Failure (PGCF) has drawn much attention ... |
2104.06599 | Guanghui Qin | Guanghui Qin, Jason Eisner | Learning How to Ask: Querying LMs with Mixtures of Soft Prompts | NAACL-HLT 2021 camera-ready | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Natural-language prompts have recently been used to coax pretrained language
models into performing other AI tasks, using a fill-in-the-blank paradigm
(Petroni et al., 2019) or a few-shot extrapolation paradigm (Brown et al.,
2020). For example, language models retain factual knowledge from their
training corpora tha... | [
{
"created": "Wed, 14 Apr 2021 02:56:14 GMT",
"version": "v1"
}
] | 2021-04-15 | [
[
"Qin",
"Guanghui",
""
],
[
"Eisner",
"Jason",
""
]
] | Natural-language prompts have recently been used to coax pretrained language models into performing other AI tasks, using a fill-in-the-blank paradigm (Petroni et al., 2019) or a few-shot extrapolation paradigm (Brown et al., 2020). For example, language models retain factual knowledge from their training corpora that ... |
1603.07692 | Diego Klabjan | Taeheon Jeong, Diego Klabjan, Justin Starren | Predictive Analytics Using Smartphone Sensors for Depressive Episodes | HIAI 2016, Expanding the Boundaries of Health Informatics using AI,
Phoenix, AZ | null | null | null | cs.CY cs.HC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The behaviors of patients with depression are usually difficult to predict
because the patients demonstrate the symptoms of a depressive episode without a
warning at unexpected times. The goal of this research is to build algorithms
that detect signals of such unusual moments so that doctors can be proactive in
appro... | [
{
"created": "Thu, 24 Mar 2016 18:14:43 GMT",
"version": "v1"
}
] | 2016-03-25 | [
[
"Jeong",
"Taeheon",
""
],
[
"Klabjan",
"Diego",
""
],
[
"Starren",
"Justin",
""
]
] | The behaviors of patients with depression are usually difficult to predict because the patients demonstrate the symptoms of a depressive episode without a warning at unexpected times. The goal of this research is to build algorithms that detect signals of such unusual moments so that doctors can be proactive in approac... |
1811.10074 | Roman Snytsar | Roman Snytsar and Yatish Turakhia | Parallel approach to sliding window sums | 10 pages, 5 figures | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sliding window sums are widely used in bioinformatics applications, including
sequence assembly, k-mer generation, hashing and compression. New vector
algorithms which utilize the advanced vector extension (AVX) instructions
available on modern processors, or the parallel compute units on GPUs and
FPGAs, would provid... | [
{
"created": "Sun, 25 Nov 2018 19:09:47 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Sep 2019 14:39:58 GMT",
"version": "v2"
}
] | 2019-09-04 | [
[
"Snytsar",
"Roman",
""
],
[
"Turakhia",
"Yatish",
""
]
] | Sliding window sums are widely used in bioinformatics applications, including sequence assembly, k-mer generation, hashing and compression. New vector algorithms which utilize the advanced vector extension (AVX) instructions available on modern processors, or the parallel compute units on GPUs and FPGAs, would provide ... |
1605.04761 | Maurizio Naldi | Maurizio Naldi | Concentration in the mobile operating systems market | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Concentration phenomena concern the ICT market. Though the regulatory action
has been active mainly in the telecom network operators industry, even more
significant worldwide concentration phenomena affect other industries. The
market of mobile operating systems is analysed through two concentration
indices to get a ... | [
{
"created": "Mon, 16 May 2016 13:08:30 GMT",
"version": "v1"
}
] | 2016-05-17 | [
[
"Naldi",
"Maurizio",
""
]
] | Concentration phenomena concern the ICT market. Though the regulatory action has been active mainly in the telecom network operators industry, even more significant worldwide concentration phenomena affect other industries. The market of mobile operating systems is analysed through two concentration indices to get a qu... |
2406.03403 | Kangyu Zheng | Kangyu Zheng, Yingzhou Lu, Zaixi Zhang, Zhongwei Wan, Yao Ma, Marinka
Zitnik, Tianfan Fu | Structure-based Drug Design Benchmark: Do 3D Methods Really Dominate? | null | null | null | null | cs.LG cs.AI q-bio.QM | http://creativecommons.org/licenses/by/4.0/ | Currently, the field of structure-based drug design is dominated by three
main types of algorithms: search-based algorithms, deep generative models, and
reinforcement learning. While existing works have typically focused on
comparing models within a single algorithmic category, cross-algorithm
comparisons remain scar... | [
{
"created": "Tue, 4 Jun 2024 15:37:14 GMT",
"version": "v1"
}
] | 2024-06-06 | [
[
"Zheng",
"Kangyu",
""
],
[
"Lu",
"Yingzhou",
""
],
[
"Zhang",
"Zaixi",
""
],
[
"Wan",
"Zhongwei",
""
],
[
"Ma",
"Yao",
""
],
[
"Zitnik",
"Marinka",
""
],
[
"Fu",
"Tianfan",
""
]
] | Currently, the field of structure-based drug design is dominated by three main types of algorithms: search-based algorithms, deep generative models, and reinforcement learning. While existing works have typically focused on comparing models within a single algorithmic category, cross-algorithm comparisons remain scarce... |
1505.05231 | Steve Hanneke | Liu Yang, Steve Hanneke, Jaime Carbonell | Bounds on the Minimax Rate for Estimating a Prior over a VC Class from
Independent Learning Tasks | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the optimal rates of convergence for estimating a prior distribution
over a VC class from a sequence of independent data sets respectively labeled
by independent target functions sampled from the prior. We specifically derive
upper and lower bounds on the optimal rates under a smoothness condition on the
cor... | [
{
"created": "Wed, 20 May 2015 02:43:24 GMT",
"version": "v1"
}
] | 2015-05-21 | [
[
"Yang",
"Liu",
""
],
[
"Hanneke",
"Steve",
""
],
[
"Carbonell",
"Jaime",
""
]
] | We study the optimal rates of convergence for estimating a prior distribution over a VC class from a sequence of independent data sets respectively labeled by independent target functions sampled from the prior. We specifically derive upper and lower bounds on the optimal rates under a smoothness condition on the corre... |
2101.06749 | Mateus Roder | Mateus Roder, Leandro A. Passos, Luiz Carlos Felix Ribeiro, Clayton
Pereira, Jo\~ao Paulo Papa | A Layer-Wise Information Reinforcement Approach to Improve Learning in
Deep Belief Networks | null | null | 10.1007/978-3-030-61401-0_22 | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | With the advent of deep learning, the number of works proposing new methods
or improving existent ones has grown exponentially in the last years. In this
scenario, "very deep" models were emerging, once they were expected to extract
more intrinsic and abstract features while supporting a better performance.
However, ... | [
{
"created": "Sun, 17 Jan 2021 18:53:18 GMT",
"version": "v1"
}
] | 2021-01-19 | [
[
"Roder",
"Mateus",
""
],
[
"Passos",
"Leandro A.",
""
],
[
"Ribeiro",
"Luiz Carlos Felix",
""
],
[
"Pereira",
"Clayton",
""
],
[
"Papa",
"João Paulo",
""
]
] | With the advent of deep learning, the number of works proposing new methods or improving existent ones has grown exponentially in the last years. In this scenario, "very deep" models were emerging, once they were expected to extract more intrinsic and abstract features while supporting a better performance. However, su... |
2001.02801 | Olga Moskvyak | Olga Moskvyak, Frederic Maire, Feras Dayoub and Mahsa Baktashmotlagh | Learning landmark guided embeddings for animal re-identification | 7 pages, 7 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Re-identification of individual animals in images can be ambiguous due to
subtle variations in body markings between different individuals and no
constraints on the poses of animals in the wild. Person re-identification is a
similar task and it has been approached with a deep convolutional neural
network (CNN) that l... | [
{
"created": "Thu, 9 Jan 2020 01:31:00 GMT",
"version": "v1"
}
] | 2020-01-10 | [
[
"Moskvyak",
"Olga",
""
],
[
"Maire",
"Frederic",
""
],
[
"Dayoub",
"Feras",
""
],
[
"Baktashmotlagh",
"Mahsa",
""
]
] | Re-identification of individual animals in images can be ambiguous due to subtle variations in body markings between different individuals and no constraints on the poses of animals in the wild. Person re-identification is a similar task and it has been approached with a deep convolutional neural network (CNN) that lea... |
2011.05180 | Daniel Rodriguez Criado | Daniel Rodriguez-Criado and Pilar Bachiller and Luis J. Manso | Generation of Human-aware Navigation Maps using Graph Neural Networks | 6 pages, 4 figures, conference paper | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | Minimising the discomfort caused by robots when navigating in social
situations is crucial for them to be accepted. The paper presents a machine
learning-based framework that bootstraps existing one-dimensional datasets to
generate a cost map dataset and a model combining Graph Neural Network and
Convolutional Neural... | [
{
"created": "Tue, 10 Nov 2020 15:32:14 GMT",
"version": "v1"
}
] | 2020-11-11 | [
[
"Rodriguez-Criado",
"Daniel",
""
],
[
"Bachiller",
"Pilar",
""
],
[
"Manso",
"Luis J.",
""
]
] | Minimising the discomfort caused by robots when navigating in social situations is crucial for them to be accepted. The paper presents a machine learning-based framework that bootstraps existing one-dimensional datasets to generate a cost map dataset and a model combining Graph Neural Network and Convolutional Neural N... |
1907.08304 | Lavina Jain | Syamantak Das, Lavina Jain, Nikhil Kumar | A Constant Factor Approximation for Capacitated Min-Max Tree Cover | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer
parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most
$k$ subtrees of $G$, such that the union of the trees is the vertex set $V$.
The objective is to minimize the maximum length among all the trees. We give
the first ... | [
{
"created": "Thu, 18 Jul 2019 21:59:33 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Dec 2019 13:44:40 GMT",
"version": "v2"
}
] | 2019-12-13 | [
[
"Das",
"Syamantak",
""
],
[
"Jain",
"Lavina",
""
],
[
"Kumar",
"Nikhil",
""
]
] | Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The objective is to minimize the maximum length among all the trees. We give the first co... |
2212.07536 | Md Masudur Rahman | Md Masudur Rahman and Yexiang Xue | Robust Policy Optimization in Deep Reinforcement Learning | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The policy gradient method enjoys the simplicity of the objective where the
agent optimizes the cumulative reward directly. Moreover, in the continuous
action domain, parameterized distribution of action distribution allows easy
control of exploration, resulting from the variance of the representing
distribution. Ent... | [
{
"created": "Wed, 14 Dec 2022 22:43:56 GMT",
"version": "v1"
}
] | 2022-12-16 | [
[
"Rahman",
"Md Masudur",
""
],
[
"Xue",
"Yexiang",
""
]
] | The policy gradient method enjoys the simplicity of the objective where the agent optimizes the cumulative reward directly. Moreover, in the continuous action domain, parameterized distribution of action distribution allows easy control of exploration, resulting from the variance of the representing distribution. Entro... |
1308.2362 | Bo young Lim | Yunsik Jake Jang, Bo young Lim | Harmonization among national cyber security and cybercrime response
organizations: New challenges of cybercrime | 4th Asian Criminology Conference (2012) | null | null | null | cs.CY | http://creativecommons.org/licenses/by/3.0/ | This paper will discuss the need for national-level organizational strategies
to effectively combat cyber security threats and cybercrime. In many countries,
new agencies have been established and/or new roles have been allotted to
existing agencies to cope with the needs for cyber security or fighting against
cyberc... | [
{
"created": "Sun, 11 Aug 2013 03:28:07 GMT",
"version": "v1"
}
] | 2013-08-13 | [
[
"Jang",
"Yunsik Jake",
""
],
[
"Lim",
"Bo young",
""
]
] | This paper will discuss the need for national-level organizational strategies to effectively combat cyber security threats and cybercrime. In many countries, new agencies have been established and/or new roles have been allotted to existing agencies to cope with the needs for cyber security or fighting against cybercri... |
2205.10729 | Haoyuan Cai | Haoyuan Cai, Tengyu Ma, Simon Du | Near-Optimal Algorithms for Autonomous Exploration and Multi-Goal
Stochastic Shortest Path | ICML 2022 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We revisit the incremental autonomous exploration problem proposed by Lim &
Auer (2012). In this setting, the agent aims to learn a set of near-optimal
goal-conditioned policies to reach the $L$-controllable states: states that are
incrementally reachable from an initial state $s_0$ within $L$ steps in
expectation. W... | [
{
"created": "Sun, 22 May 2022 03:54:15 GMT",
"version": "v1"
}
] | 2022-05-24 | [
[
"Cai",
"Haoyuan",
""
],
[
"Ma",
"Tengyu",
""
],
[
"Du",
"Simon",
""
]
] | We revisit the incremental autonomous exploration problem proposed by Lim & Auer (2012). In this setting, the agent aims to learn a set of near-optimal goal-conditioned policies to reach the $L$-controllable states: states that are incrementally reachable from an initial state $s_0$ within $L$ steps in expectation. We ... |
1811.06749 | Jakub T\v{e}tek | Tom\'a\v{s} Gaven\v{c}iak, Jakub T\v{e}tek | Compact I/O-Efficient Representation of Separable Graphs and Optimal
Tree Layouts | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compact and I/O-efficient data representations play an important role in
efficient algorithm design, as memory bandwidth and latency can present a
significant performance bottleneck, slowing the computation by orders of
magnitude. While this problem is very well explored in e.g. uniform numerical
data processing, str... | [
{
"created": "Fri, 16 Nov 2018 11:01:06 GMT",
"version": "v1"
}
] | 2018-11-19 | [
[
"Gavenčiak",
"Tomáš",
""
],
[
"Tětek",
"Jakub",
""
]
] | Compact and I/O-efficient data representations play an important role in efficient algorithm design, as memory bandwidth and latency can present a significant performance bottleneck, slowing the computation by orders of magnitude. While this problem is very well explored in e.g. uniform numerical data processing, struc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.