id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1803.03417
|
Ramana Kumar
|
Ramana Kumar, Magnus O. Myreen
|
Clocked Definitions in HOL
| null | null | null | null |
cs.LO
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Many potentially non-terminating functions cannot be directly defined in a
logic of total functions, such as HOL. A well-known solution to this is to
define non-terminating functions using a clock that forces termination at a
certain depth of evaluation. Such clocked definitions are often frowned upon
and avoided, since the clock is perceived as extra clutter. In this short
paper, we explain that there are different ways to add a clock, some less
intrusive than others. Our contribution is a technique by which termination
proofs are kept simple even when minimising the use of the clock mechanism. Our
examples are definitions of semantic interpreters for programming languages, so
called functional big-step semantics.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2018 08:53:10 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Kumar",
"Ramana",
""
],
[
"Myreen",
"Magnus O.",
""
]
] |
new_dataset
| 0.967611 |
1803.03494
|
Peter Jung
|
Peter Jung
|
The Szeg\"o-Asymptotics for Doubly-Dispersive Gaussian Channels
|
20 pages, 1 figure
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the time-continuous doubly--dispersive channel with additive
Gaussian noise and establish a capacity formula for the case where the channel
operator is represented by a symbol which is periodic in time and fulfills some
further integrability, smoothness and oscillation conditions. More precisely,
we apply the well-known Holsinger-Gallager model for translating a
time-continuous channel for a sequence of time--intervals of increasing length
$\alpha\rightarrow\infty$ to a series of equivalent sets of discrete, parallel
channels, known at the transmitter. We quantify conditions when this procedure
converges. Finally, under periodicity assumptions this result can indeed be
justified as the channel capacity in the sense Shannon. The key to this is
result is a new Szeg\"o formula for certain pseudo--differential operators with
real-valued symbol. The Szeg\"o limit holds if the symbol belongs to the
homogeneous Besov space $\dot{B}^1_{\infty,1}$ with respect to its
time-dependency, characterizing the oscillatory behavior in time. Finally, the
formula justifies the water-filling principle in time and frequency as general
technique independent of a sampling scheme.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2018 12:56:53 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Jung",
"Peter",
""
]
] |
new_dataset
| 0.99209 |
1803.03508
|
Hanxu Hou
|
Hanxu Hou, Yunghsiang S. Han, Kenneth W. Shum and Hui Li
|
A Unified Form of EVENODD and RDP Codes and Their Efficient Decoding
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Array codes have been widely employed in storage systems, such as Redundant
Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and
EVENODD codes are two popular double-parity array codes. As the capacity of
hard disks increases, better fault tolerance by using array codes with three or
more parity disks is needed. Although many extensions of RDP codes and EVENODD
codes have been proposed, the high decoding complexity is the main drawback of
them. In this paper, we present a new construction for all families of EVENODD
codes and RDP codes, and propose a unified form of them. Under this unified
form, RDP codes can be treated as shortened codes of EVENODD codes. Moreover,
an efficient decoding algorithm based on an LU factorization of Vandermonde
matrix is proposed when the number of continuous surviving parity columns is no
less than the number of erased information columns. The new decoding algorithm
is faster than the existing algorithms when more than three information columns
fail. The proposed efficient decoding algorithm is also applicable to other
Vandermonde array codes. Thus the proposed MDS array code is practically very
meaningful for storage systems that need higher reliability.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2018 13:53:41 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Hou",
"Hanxu",
""
],
[
"Han",
"Yunghsiang S.",
""
],
[
"Shum",
"Kenneth W.",
""
],
[
"Li",
"Hui",
""
]
] |
new_dataset
| 0.999796 |
1803.03576
|
Shweta Bhatt
|
Shweta Bhatt, Sagar Joglekar, Shehar Bano, Nishanth Sastry
|
Illuminating an Ecosystem of Partisan Websites
|
Published at The Web Conference 2018 (WWW 2018). Please cite the WWW
version
| null |
10.1145/3184558.3188725
| null |
cs.SI
|
http://creativecommons.org/licenses/by/4.0/
|
This paper aims to shed light on alternative news media ecosystems that are
believed to have influenced opinions and beliefs by false and/or biased news
reporting during the 2016 US Presidential Elections. We examine a large,
professionally curated list of 668 hyper-partisan websites and their
corresponding Facebook pages, and identify key characteristics that mediate the
traffic flow within this ecosystem. We uncover a pattern of new websites being
established in the run up to the elections, and abandoned after. Such websites
form an ecosystem, creating links from one website to another, and by `liking'
each others' Facebook pages. These practices are highly effective in directing
user traffic internally within the ecosystem in a highly partisan manner, with
right-leaning sites linking to and liking other right-leaning sites and
similarly left-leaning sites linking to other sites on the left, thus forming a
filter bubble amongst news producers similar to the filter bubble which has
been widely observed among consumers of partisan news. Whereas there is
activity along both left- and right-leaning sites, right-leaning sites are more
evolved, accounting for a disproportionate number of abandoned websites and
partisan internal links. We also examine demographic characteristics of
consumers of hyper-partisan news and find that some of the more populous
demographic groups in the US tend to be consumers of more right-leaning sites.
|
[
{
"version": "v1",
"created": "Fri, 9 Mar 2018 15:48:00 GMT"
}
] | 2018-03-12T00:00:00 |
[
[
"Bhatt",
"Shweta",
""
],
[
"Joglekar",
"Sagar",
""
],
[
"Bano",
"Shehar",
""
],
[
"Sastry",
"Nishanth",
""
]
] |
new_dataset
| 0.990539 |
1602.01202
|
Yongjune Kim
|
Yongjune Kim, Abhishek A. Sharma, Robert Mateescu, Seung-Hwan Song,
Zvonimir Z. Bandic, James A. Bain, B. V. K. Vijaya Kumar
|
Locally rewritable codes for resistive memories
|
accepted by IEEE International Conference on Communications (ICC)
2016
| null |
10.1109/ICC.2016.7510727
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose locally rewritable codes (LWC) for resistive memories inspired by
locally repairable codes (LRC) for distributed storage systems. Small values of
repair locality of LRC enable fast repair of a single failed node since the
lost data in the failed node can be recovered by accessing only a small
fraction of other nodes. By using rewriting locality, LWC can improve endurance
limit and power consumption which are major challenges for resistive memories.
We point out the duality between LRC and LWC, which indicates that existing
construction methods of LRC can be applied to construct LWC.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 06:43:10 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Kim",
"Yongjune",
""
],
[
"Sharma",
"Abhishek A.",
""
],
[
"Mateescu",
"Robert",
""
],
[
"Song",
"Seung-Hwan",
""
],
[
"Bandic",
"Zvonimir Z.",
""
],
[
"Bain",
"James A.",
""
],
[
"Kumar",
"B. V. K. Vijaya",
""
]
] |
new_dataset
| 0.969271 |
1705.01167
|
Corey Walsh
|
Corey Walsh, Sertac Karaman
|
CDDT: Fast Approximate 2D Ray Casting for Accelerated Localization
|
8 pages, 14 figures, ICRA version
| null | null | null |
cs.DS cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Localization is an essential component for autonomous robots. A
well-established localization approach combines ray casting with a particle
filter, leading to a computationally expensive algorithm that is difficult to
run on resource-constrained mobile robots. We present a novel data structure
called the Compressed Directional Distance Transform for accelerating ray
casting in two dimensional occupancy grid maps. Our approach allows online map
updates, and near constant time ray casting performance for a fixed size map,
in contrast with other methods which exhibit poor worst case performance. Our
experimental results show that the proposed algorithm approximates the
performance characteristics of reading from a three dimensional lookup table of
ray cast solutions while requiring two orders of magnitude less memory and
precomputation. This results in a particle filter algorithm which can maintain
2500 particles with 61 ray casts per particle at 40Hz, using a single CPU
thread onboard a mobile robot.
|
[
{
"version": "v1",
"created": "Tue, 2 May 2017 20:38:42 GMT"
},
{
"version": "v2",
"created": "Wed, 7 Mar 2018 19:00:34 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Walsh",
"Corey",
""
],
[
"Karaman",
"Sertac",
""
]
] |
new_dataset
| 0.998315 |
1801.07495
|
Wafa Alorainy
|
Wafa Alorainy, Pete Burnap, Han Liu, Matthew Williams
|
The Enemy Among Us: Detecting Hate Speech with Threats Based 'Othering'
Language Embeddings
| null | null | null | null |
cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Offensive or antagonistic language targeted at individuals and social groups
based on their personal characteristics (also known as cyber hate speech or
cyberhate) has been frequently posted and widely circulated viathe World Wide
Web. This can be considered as a key risk factor for individual and societal
tension linked toregional instability. Automated Web-based cyberhate detection
is important for observing and understandingcommunity and regional societal
tension - especially in online social networks where posts can be rapidlyand
widely viewed and disseminated. While previous work has involved using
lexicons, bags-of-words orprobabilistic language parsing approaches, they often
suffer from a similar issue which is that cyberhate can besubtle and indirect -
thus depending on the occurrence of individual words or phrases can lead to a
significantnumber of false negatives, providing inaccurate representation of
the trends in cyberhate. This problemmotivated us to challenge thinking around
the representation of subtle language use, such as references toperceived
threats from "the other" including immigration or job prosperity in a hateful
context. We propose anovel framework that utilises language use around the
concept of "othering" and intergroup threat theory toidentify these subtleties
and we implement a novel classification method using embedding learning to
computesemantic distances between parts of speech considered to be part of an
"othering" narrative. To validate ourapproach we conduct several experiments on
different types of cyberhate, namely religion, disability, race andsexual
orientation, with F-measure scores for classifying hateful instances obtained
through applying ourmodel of 0.93, 0.86, 0.97 and 0.98 respectively, providing
a significant improvement in classifier accuracy overthe state-of-the-art
|
[
{
"version": "v1",
"created": "Tue, 23 Jan 2018 11:43:54 GMT"
},
{
"version": "v2",
"created": "Sun, 28 Jan 2018 11:37:38 GMT"
},
{
"version": "v3",
"created": "Thu, 8 Mar 2018 12:25:38 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Alorainy",
"Wafa",
""
],
[
"Burnap",
"Pete",
""
],
[
"Liu",
"Han",
""
],
[
"Williams",
"Matthew",
""
]
] |
new_dataset
| 0.98344 |
1803.02623
|
Behrouz Bolourian Haghighi
|
Behrouz Bolourian Haghighi, Amir Hossein Taherinia, Amir Hossein
Mohajerzadeh
|
TRLG: Fragile blind quad watermarking for image tamper detection and
recovery by providing compact digests with quality optimized using LWT and GA
| null | null | null | null |
cs.CR cs.CV cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, an efficient fragile blind quad watermarking scheme for image
tamper detection and recovery based on lifting wavelet transform and genetic
algorithm is proposed. TRLG generates four compact digests with super quality
based on lifting wavelet transform and halftoning technique by distinguishing
the types of image blocks. In other words, for each 2*2 non-overlap blocks,
four chances for recovering destroyed blocks are considered. A special
parameter estimation technique based on genetic algorithm is performed to
improve and optimize the quality of digests and watermarked image. Furthermore,
CCS map is used to determine the mapping block for embedding information,
encrypting and confusing the embedded information. In order to improve the
recovery rate, Mirror-aside and Partner-block are proposed. The experiments
that have been conducted to evaluate the performance of TRLG proved the
superiority in terms of quality of the watermarked and recovered image, tamper
localization and security compared with state-of-the-art methods. The results
indicate that the PSNR and SSIM of the watermarked image are about 46 dB and
approximately one, respectively. Also, the mean of PSNR and SSIM of several
recovered images which has been destroyed about 90% is reached to 24 dB and
0.86, respectively.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2018 12:47:18 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Haghighi",
"Behrouz Bolourian",
""
],
[
"Taherinia",
"Amir Hossein",
""
],
[
"Mohajerzadeh",
"Amir Hossein",
""
]
] |
new_dataset
| 0.996665 |
1803.02887
|
Shayan Eskandari
|
Shayan Eskandari, Andreas Leoutsarakos, Troy Mursch, Jeremy Clark
|
A first look at browser-based Cryptojacking
|
9 pages, IEEE SECURITY & PRIVACY ON THE BLOCKCHAIN (IEEE S&B) 2018
University College London (UCL), London, UK
| null | null | null |
cs.CR cs.CY cs.HC econ.EM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we examine the recent trend towards in-browser mining of
cryptocurrencies; in particular, the mining of Monero through Coinhive and
similar code- bases. In this model, a user visiting a website will download a
JavaScript code that executes client-side in her browser, mines a
cryptocurrency, typically without her consent or knowledge, and pays out the
seigniorage to the website. Websites may consciously employ this as an
alternative or to supplement advertisement revenue, may offer premium content
in exchange for mining, or may be unwittingly serving the code as a result of a
breach (in which case the seigniorage is collected by the attacker). The
cryptocurrency Monero is preferred seemingly for its unfriendliness to
large-scale ASIC mining that would drive browser-based efforts out of the
market, as well as for its purported privacy features. In this paper, we survey
this landscape, conduct some measurements to establish its prevalence and
profitability, outline an ethical framework for considering whether it should
be classified as an attack or business opportunity, and make suggestions for
the detection, mitigation and/or prevention of browser-based mining for non-
consenting users.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2018 21:50:37 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Eskandari",
"Shayan",
""
],
[
"Leoutsarakos",
"Andreas",
""
],
[
"Mursch",
"Troy",
""
],
[
"Clark",
"Jeremy",
""
]
] |
new_dataset
| 0.979876 |
1803.02994
|
Liang Jiang
|
Linli Xu, Liang Jiang, Chuan Qin, Zhe Wang, Dongfang Du
|
How Images Inspire Poems: Generating Classical Chinese Poetry from
Images with Memory Networks
|
Accepted by AAAI 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the recent advances of neural models and natural language processing,
automatic generation of classical Chinese poetry has drawn significant
attention due to its artistic and cultural value. Previous works mainly focus
on generating poetry given keywords or other text information, while visual
inspirations for poetry have been rarely explored. Generating poetry from
images is much more challenging than generating poetry from text, since images
contain very rich visual information which cannot be described completely using
several keywords, and a good poem should convey the image accurately. In this
paper, we propose a memory based neural model which exploits images to generate
poems. Specifically, an Encoder-Decoder model with a topic memory network is
proposed to generate classical Chinese poetry from images. To the best of our
knowledge, this is the first work attempting to generate classical Chinese
poetry from images with neural networks. A comprehensive experimental
investigation with both human evaluation and quantitative analysis demonstrates
that the proposed model can generate poems which convey images accurately.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2018 08:07:31 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Xu",
"Linli",
""
],
[
"Jiang",
"Liang",
""
],
[
"Qin",
"Chuan",
""
],
[
"Wang",
"Zhe",
""
],
[
"Du",
"Dongfang",
""
]
] |
new_dataset
| 0.998657 |
1803.03015
|
Chetan Singh Thakur
|
Runchun Wang, Chetan Singh Thakur, Andre van Schaik
|
An FPGA-based Massively Parallel Neuromorphic Cortex Simulator
|
18 pages
| null | null | null |
cs.NE
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper presents a massively parallel and scalable neuromorphic cortex
simulator designed for simulating large and structurally connected spiking
neural networks, such as complex models of various areas of the cortex. The
main novelty of this work is the abstraction of a neuromorphic architecture
into clusters represented by minicolumns and hypercolumns, analogously to the
fundamental structural units observed in neurobiology. Without this approach,
simulating large-scale fully connected networks needs prohibitively large
memory to store look-up tables for point-to-point connections. Instead, we use
a novel architecture, based on the structural connectivity in the neocortex,
such that all the required parameters and connections can be stored in on-chip
memory. The cortex simulator can be easily reconfigured for simulating
different neural networks without any change in hardware structure by
programming the memory. A hierarchical communication scheme allows one neuron
to have a fan-out of up to 200k neurons. As a proof-of-concept, an
implementation on one Altera Stratix V FPGA was able to simulate 20 million to
2.6 billion leaky-integrate-and-fire (LIF) neurons in real time. We verified
the system by emulating a simplified auditory cortex (with 100 million
neurons). This cortex simulator achieved a low power dissipation of 1.62 {\mu}W
per neuron. With the advent of commercially available FPGA boards, our system
offers an accessible and scalable tool for the design, real-time simulation,
and analysis of large-scale spiking neural networks.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2018 09:31:04 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Wang",
"Runchun",
""
],
[
"Thakur",
"Chetan Singh",
""
],
[
"van Schaik",
"Andre",
""
]
] |
new_dataset
| 0.983646 |
1803.03106
|
Thomas Szyrkowiec
|
Thomas Szyrkowiec, Michele Santuari, Mohit Chamania, Domenico
Siracusa, Achim Autenrieth, Victor Lopez, Joo Cho, and Wolfgang Kellerer
|
Automatic Intent-Based Secure Service Creation Through a Multilayer SDN
Network Orchestration
|
Parts of the presented work has received funding from the European
Commission within the H2020 Research and Innovation Programme, under grant
agreeement n.645127, project ACINO
|
J. Opt. Commun. Netw. 10, 289-297 (2018)
|
10.1364/JOCN.10.000289
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Growing traffic demands and increasing security awareness are driving the
need for secure services. Current solutions require manual configuration and
deployment based on the customer's requirements. In this work, we present an
architecture for an automatic intent-based provisioning of a secure service in
a multilayer - IP, Ethernet, and optical - network while choosing the
appropriate encryption layer using an open-source software-defined networking
(SDN) orchestrator. The approach is experimentally evaluated in a testbed with
commercial equipment. Results indicate that the processing impact of secure
channel creation on a controller is negligible. As the time for setting up
services over WDM varies between technologies, it needs to be taken into
account in the decision-making process.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2018 14:39:11 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Szyrkowiec",
"Thomas",
""
],
[
"Santuari",
"Michele",
""
],
[
"Chamania",
"Mohit",
""
],
[
"Siracusa",
"Domenico",
""
],
[
"Autenrieth",
"Achim",
""
],
[
"Lopez",
"Victor",
""
],
[
"Cho",
"Joo",
""
],
[
"Kellerer",
"Wolfgang",
""
]
] |
new_dataset
| 0.962461 |
1803.03178
|
Preslav Nakov
|
Tsvetomila Mihaylova, Preslav Nakov, Lluis Marquez, Alberto
Barron-Cedeno, Mitra Mohtarami, Georgi Karadzhov, James Glass
|
Fact Checking in Community Forums
|
AAAI-2018; Fact-Checking; Veracity; Community-Question Answering;
Neural Networks; Distributed Representations
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Community Question Answering (cQA) forums are very popular nowadays, as they
represent effective means for communities around particular topics to share
information. Unfortunately, this information is not always factual. Thus, here
we explore a new dimension in the context of cQA, which has been ignored so
far: checking the veracity of answers to particular questions in cQA forums. As
this is a new problem, we create a specialized dataset for it. We further
propose a novel multi-faceted model, which captures information from the answer
content (what is said and how), from the author profile (who says it), from the
rest of the community forum (where it is said), and from external authoritative
sources of information (external support). Evaluation results show a MAP value
of 86.54, which is 21 points absolute above the baseline.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2018 16:06:54 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Mihaylova",
"Tsvetomila",
""
],
[
"Nakov",
"Preslav",
""
],
[
"Marquez",
"Lluis",
""
],
[
"Barron-Cedeno",
"Alberto",
""
],
[
"Mohtarami",
"Mitra",
""
],
[
"Karadzhov",
"Georgi",
""
],
[
"Glass",
"James",
""
]
] |
new_dataset
| 0.99982 |
1803.03186
|
David Gutierrez Estevez
|
D. M. Gutierrez-Estevez, \"O. Bulakci, M. Ericson, A. Prasad, E.
Pateromichelakis, J. Belschner, P. Arnold, G. Calochira
|
RAN Enablers for 5G Radio Resource Management
| null |
Gutierrez-Estevez, D. M., et. al. "RAN enablers for 5G radio
resource management.", IEEE Conference on Standards for Communications and
Networking (CSCN), pp. 1-6. IEEE, 2017
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the description of several key RAN enablers for the radio
resource management (RRM) framework of the fifth generation (5G) radio access
network (RAN), referred to as building blocks of the 5G RRM. In particular, the
following key RAN enablers are discussed: i) interference management techniques
for dense and dynamic deployments, focusing on cell-edge performance
enhancement; ii) dynamic traffic steering mechanisms that aim to attain the
optimum mapping of 5G services to any available resources when and where needed
by considering the peculiarities of different air interface variants (AIVs);
iii) resource management strategies that deal with network slices; and iv)
tight interworking between novel 5G AIVs and evolved legacy AIVs such as
Long-term Evolution (LTE). Evaluation results for each of these key RAN
enablers are also presented.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2018 16:23:28 GMT"
}
] | 2018-03-09T00:00:00 |
[
[
"Gutierrez-Estevez",
"D. M.",
""
],
[
"Bulakci",
"Ö.",
""
],
[
"Ericson",
"M.",
""
],
[
"Prasad",
"A.",
""
],
[
"Pateromichelakis",
"E.",
""
],
[
"Belschner",
"J.",
""
],
[
"Arnold",
"P.",
""
],
[
"Calochira",
"G.",
""
]
] |
new_dataset
| 0.978779 |
1605.06799
|
Victor Barger
|
Andrea Webb Luangrath, Joann Peck, Victor A. Barger
|
Textual Paralanguage and its Implications for Marketing Communications
|
Forthcoming in the Journal of Consumer Psychology
|
Journal of Consumer Psychology 27 (2017) 98-107
|
10.1016/j.jcps.2016.05.002
| null |
cs.CL cs.SI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Both face-to-face communication and communication in online environments
convey information beyond the actual verbal message. In a traditional
face-to-face conversation, paralanguage, or the ancillary meaning- and
emotion-laden aspects of speech that are not actual verbal prose, gives
contextual information that allows interactors to more appropriately understand
the message being conveyed. In this paper, we conceptualize textual
paralanguage (TPL), which we define as written manifestations of nonverbal
audible, tactile, and visual elements that supplement or replace written
language and that can be expressed through words, symbols, images, punctuation,
demarcations, or any combination of these elements. We develop a typology of
textual paralanguage using data from Twitter, Facebook, and Instagram. We
present a conceptual framework of antecedents and consequences of brands' use
of textual paralanguage. Implications for theory and practice are discussed.
|
[
{
"version": "v1",
"created": "Sun, 22 May 2016 14:22:03 GMT"
}
] | 2018-03-08T00:00:00 |
[
[
"Luangrath",
"Andrea Webb",
""
],
[
"Peck",
"Joann",
""
],
[
"Barger",
"Victor A.",
""
]
] |
new_dataset
| 0.999242 |
1802.07420
|
Siddharth Dalmia
|
Siddharth Dalmia, Ramon Sanabria, Florian Metze and Alan W. Black
|
Sequence-based Multi-lingual Low Resource Speech Recognition
|
5 pages, 5 figures, to appear in 2018 IEEE International Conference
on Acoustics, Speech and Signal Processing (ICASSP 2018)
| null | null | null |
cs.CL cs.SD eess.AS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Techniques for multi-lingual and cross-lingual speech recognition can help in
low resource scenarios, to bootstrap systems and enable analysis of new
languages and domains. End-to-end approaches, in particular sequence-based
techniques, are attractive because of their simplicity and elegance. While it
is possible to integrate traditional multi-lingual bottleneck feature
extractors as front-ends, we show that end-to-end multi-lingual training of
sequence models is effective on context independent models trained using
Connectionist Temporal Classification (CTC) loss. We show that our model
improves performance on Babel languages by over 6% absolute in terms of
word/phoneme error rate when compared to mono-lingual systems built in the same
setting for these languages. We also show that the trained model can be adapted
cross-lingually to an unseen language using just 25% of the target data. We
show that training on multiple languages is important for very low resource
cross-lingual target scenarios, but not for multi-lingual testing scenarios.
Here, it appears beneficial to include large well prepared datasets.
|
[
{
"version": "v1",
"created": "Wed, 21 Feb 2018 04:09:26 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Mar 2018 19:51:21 GMT"
}
] | 2018-03-08T00:00:00 |
[
[
"Dalmia",
"Siddharth",
""
],
[
"Sanabria",
"Ramon",
""
],
[
"Metze",
"Florian",
""
],
[
"Black",
"Alan W.",
""
]
] |
new_dataset
| 0.988263 |
1803.02560
|
Yisroel Mirsky Mr.
|
Yisroel Mirsky, Naor Kalbo, Yuval Elovici, Asaf Shabtai
|
Vesper: Using Echo-Analysis to Detect Man-in-the-Middle Attacks in LANs
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Man-in-the-Middle (MitM) attack is a cyber-attack in which an attacker
intercepts traffic, thus harming the confidentiality, integrity, and
availability of the network. It remains a popular attack vector due to its
simplicity. However, existing solutions are either not portable, suffer from a
high false positive rate, or are simply not generic. In this paper, we propose
Vesper: a novel plug-and-play MitM detector for local area networks. Vesper
uses a technique inspired from impulse response analysis used in the domain of
acoustic signal processing. Analogous to how echoes in a cave capture the shape
and construction of the environment, so to can a short and intense pulse of
ICMP echo requests model the link between two network hosts. Vesper uses neural
networks called autoencoders to model the normal patterns of the echoed pulses,
and detect when the environment changes. Using this technique, Vesper is able
to detect MitM attacks with high accuracy while incurring minimal network
overhead. We evaluate Vesper on LANs consisting of video surveillance cameras,
servers, and PC workstations. We also investigate several possible adversarial
attacks against Vesper, and demonstrate how Vesper mitigates these attacks.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2018 08:28:29 GMT"
}
] | 2018-03-08T00:00:00 |
[
[
"Mirsky",
"Yisroel",
""
],
[
"Kalbo",
"Naor",
""
],
[
"Elovici",
"Yuval",
""
],
[
"Shabtai",
"Asaf",
""
]
] |
new_dataset
| 0.999763 |
1803.02723
|
Tao Pang
|
Di Deng, Tao Pang, Prasanth Palli, Fang Shu, Kenji Shimada
|
Heterogeneous Vehicles Routing for Water Canal Damage Assessment
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Japan, inspection of irrigation water canals has been mostly conducted
manually. However, the huge demand for more regular inspections as
infrastructure ages, coupled with the limited time window available for
inspection, has rendered manual inspection increasingly insufficient. With
shortened inspection time and reduced labor cost, automated inspection using a
combination of unmanned aerial vehicles (UAVs) and ground vehicles (cars) has
emerged as an attractive alternative to manual inspection. In this paper, we
propose a path planning framework that generates optimal plans for UAVs and
cars to inspect water canals in a large agricultural area (tens of square
kilometers). In addition to optimality, the paths need to satisfy several
constraints, in order to guarantee UAV navigation safety and to abide by local
traffic regulations. In the proposed framework, the canal and road networks are
first modeled as two graphs, which are then partitioned into smaller subgraphs
that can be covered by a given fleet of UAVs within one battery charge. The
problem of finding optimal paths for both UAVs and cars on the graphs, subject
to the constraints, is formulated as a mixed-integer quadratic program (MIQP).
The proposed framework can also quickly generate new plans when a current plan
is interrupted. The effectiveness of the proposed framework is validated by
simulation results showing the successful generation of plans covering all
given canal segments, and the ability to quickly revise the plan when
conditions change.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2018 15:47:14 GMT"
}
] | 2018-03-08T00:00:00 |
[
[
"Deng",
"Di",
""
],
[
"Pang",
"Tao",
""
],
[
"Palli",
"Prasanth",
""
],
[
"Shu",
"Fang",
""
],
[
"Shimada",
"Kenji",
""
]
] |
new_dataset
| 0.996883 |
1803.02751
|
Georgios Chasparis
|
Georgios C. Chasparis
|
Aspiration-based Perturbed Learning Automata
|
arXiv admin note: text overlap with arXiv:1709.05859,
arXiv:1702.08334
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a novel payoff-based learning scheme for distributed
optimization in repeatedly-played strategic-form games. Standard
reinforcement-based learning exhibits several limitations with respect to their
asymptotic stability. For example, in two-player coordination games,
payoff-dominant (or efficient) Nash equilibria may not be stochastically
stable. In this work, we present an extension of perturbed learning automata,
namely aspiration-based perturbed learning automata (APLA) that overcomes these
limitations. We provide a stochastic stability analysis of APLA in multi-player
coordination games. We further show that payoff-dominant Nash equilibria are
the only stochastically stable states.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2018 16:29:28 GMT"
}
] | 2018-03-08T00:00:00 |
[
[
"Chasparis",
"Georgios C.",
""
]
] |
new_dataset
| 0.998355 |
1803.02791
|
Aravindh Raman
|
Aravindh Raman, Gareth Tyson and Nishanth Sastry
|
Facebook (A)Live? Are live social broadcasts really broadcasts?
|
Published at The Web Conference 2018 (WWW 2018). Please cite the WWW
version
| null |
10.1145/3178876.3186061
| null |
cs.SI cs.NI
|
http://creativecommons.org/licenses/by/4.0/
|
The era of live-broadcast is back but with two major changes. First, unlike
traditional TV broadcasts, content is now streamed over the Internet enabling
it to reach a wider audience. Second, due to various user-generated content
platforms it has become possible for anyone to get involved, streaming their
own content to the world. This emerging trend of going live usually happens via
social platforms, where users perform live social broadcasts predominantly from
their mobile devices, allowing their friends (and the general public) to engage
with the stream in real-time. With the growing popularity of such platforms,
the burden on the current Internet infrastructure is therefore expected to
multiply. With this in mind, we explore one such prominent platform - Facebook
Live. We gather 3TB of data, representing one month of global activity and
explore the characteristics of live social broadcast. From this, we derive
simple yet effective principles which can decrease the network burden. We then
dissect global and hyper-local properties of the video while on-air, by
capturing the geography of the broadcasters or the users who produce the video
and the viewers or the users who interact with it. Finally, we study the social
engagement while the video is live and distinguish the key aspects when the
same video goes on-demand. A common theme throughout the paper is that, despite
its name, many attributes of Facebook Live deviate from both the concepts of
live and broadcast.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2018 18:01:43 GMT"
}
] | 2018-03-08T00:00:00 |
[
[
"Raman",
"Aravindh",
""
],
[
"Tyson",
"Gareth",
""
],
[
"Sastry",
"Nishanth",
""
]
] |
new_dataset
| 0.999197 |
1803.02818
|
Jekan Thangavelautham
|
Himangshu Kalita, Steven Morad, Jekan Thangavelautham
|
Path Planning and Navigation Inside Off-World Lava Tubes and Caves
|
9 pages, 10 figures, IEEE ION PLAN Conference. arXiv admin note: text
overlap with arXiv:1701.07550
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Detailed surface images of the Moon and Mars reveal hundreds of cave-like
openings. These cave-like openings are theorized to be remnants of lava-tubes
and their interior maybe in pristine conditions. These locations may have well
preserved geological records of the Moon and Mars, including evidence of past
water flow and habitability. Exploration of these caves using wheeled rovers
remains a daunting challenge. These caves are likely to have entrances with
caved-in ceilings much like the lava-tubes of Arizona and New Mexico. Thus, the
entrances are nearly impossible to traverse even for experienced human hikers.
Our approach is to utilize the SphereX robot, a 3 kg, 30 cm diameter robot with
computer hardware and sensors of a smartphone attached to rocket thrusters.
Each SphereX robot can hop, roll or fly short distances in low gravity, airless
or low-pressure environments. Several SphereX robots maybe deployed to minimize
single-point failure and exploit cooperative behaviors to traverse the cave.
There are some important challenges for navigation and path planning in these
cave environments. Localization systems such as GPS are not available nor are
they easy to install due to the signal blockage from the rocks. These caves are
too dark and too large for conventional sensor such as cameras and miniature
laser sensors to perform detailed mapping and navigation. In this paper, we
identify new techniques to map these caves by performing localized, cooperative
mapping and navigation.
|
[
{
"version": "v1",
"created": "Wed, 7 Mar 2018 18:50:30 GMT"
}
] | 2018-03-08T00:00:00 |
[
[
"Kalita",
"Himangshu",
""
],
[
"Morad",
"Steven",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.998291 |
1802.10417
|
Abbas Acar
|
Abbas Acar, Hidayet Aksu, A. Selcuk Uluagac, and Kemal Akkaya
|
WACA: Wearable-Assisted Continuous Authentication
|
A shorter version of this paper will appear in BioSTAR 2018 Workshop.
This is the full version of the paper. 1st update: added ACK section
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One-time login process in conventional authentication systems does not
guarantee that the identified user is the actual user throughout the session.
However, it is necessary to re-verify the user identity periodically throughout
a login session without reducing the user convenience. Continuous
authentication can address this issue. However, existing methods are either not
reliable or not usable. In this paper, we introduce a usable and reliable
method called Wearable Assisted Continuous Authentication (WACA). WACA relies
on the sensor based keystroke dynamics, where the authentication data is
acquired through the built in sensors of a wearable (e.g., smartwatch) while
the user is typing. We implemented the WACA framework and evaluated its
performance on real devices with real users. The empirical evaluation of WACA
reveals that WACA is feasible and its error rate is as low as 1 percent with 30
seconds of processing time and 2 3% for 20 seconds. The computational overhead
is minimal. Furthermore, we tested WACA against different attack scenarios.
WACA is capable of identifying insider threats with very high accuracy (99.2%)
and also robust against powerful adversaries such as imitation and statistical
attackers.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 14:04:31 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Mar 2018 19:30:55 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Acar",
"Abbas",
""
],
[
"Aksu",
"Hidayet",
""
],
[
"Uluagac",
"A. Selcuk",
""
],
[
"Akkaya",
"Kemal",
""
]
] |
new_dataset
| 0.999723 |
1803.01592
|
Matthew England Dr
|
James H. Davenport, Matthew England, Roberto Sebastiani, Patrick
Trentin
|
OpenMath and SMT-LIB
|
Presented in the OpenMath 2017 Workshop, at CICM 2017, Edinburgh, UK
| null | null | null |
cs.SC cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
OpenMath and SMT-LIB are languages with very different origins, but both
"represent mathematics". We describe SMT-LIB for the OpenMath community and
consider adaptations for both languages to support the growing SC-Square
initiative.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2018 10:33:50 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Davenport",
"James H.",
""
],
[
"England",
"Matthew",
""
],
[
"Sebastiani",
"Roberto",
""
],
[
"Trentin",
"Patrick",
""
]
] |
new_dataset
| 0.956556 |
1803.01845
|
Vidya Narayanan
|
Vidya Narayanan, Vlad Barash, John Kelly, Bence Kollanyi, Lisa-Maria
Neudert, Philip N. Howard
|
Polarization, Partisanship and Junk News Consumption over Social Media
in the US
|
arXiv admin note: text overlap with arXiv:1802.03572
| null | null |
Data Memo 2018.1
|
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
What kinds of social media users read junk news? We examine the distribution
of the most significant sources of junk news in the three months before
President Donald Trump first State of the Union Address. Drawing on a list of
sources that consistently publish political news and information that is
extremist, sensationalist, conspiratorial, masked commentary, fake news and
other forms of junk news, we find that the distribution of such content is
unevenly spread across the ideological spectrum. We demonstrate that (1) on
Twitter, a network of Trump supporters shares the widest range of known junk
news sources and circulates more junk news than all the other groups put
together; (2) on Facebook, extreme hard right pages, distinct from Republican
pages, share the widest range of known junk news sources and circulate more
junk news than all the other audiences put together; (3) on average, the
audiences for junk news on Twitter share a wider range of known junk news
sources than audiences on Facebook public pages.
|
[
{
"version": "v1",
"created": "Sun, 4 Mar 2018 20:54:33 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Narayanan",
"Vidya",
""
],
[
"Barash",
"Vlad",
""
],
[
"Kelly",
"John",
""
],
[
"Kollanyi",
"Bence",
""
],
[
"Neudert",
"Lisa-Maria",
""
],
[
"Howard",
"Philip N.",
""
]
] |
new_dataset
| 0.997137 |
1803.02100
|
David Robb
|
Helen Hastie, Katrin Lohan, Mike Chantler, David A. Robb, Subramanian
Ramamoorthy, Ron Petrick, Sethu Vijayakumar and David Lane
|
The ORCA Hub: Explainable Offshore Robotics through Intelligent
Interfaces
|
2 pages. Peer reviewed position paper accepted in the Explainable
Robotic Systems Workshop, ACM Human-Robot Interaction conference, March 2018,
Chicago, IL USA
| null | null | null |
cs.AI cs.HC cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the UK Robotics and Artificial Intelligence Hub for Offshore
Robotics for Certification of Assets (ORCA Hub), a 3.5 year EPSRC funded,
multi-site project. The ORCA Hub vision is to use teams of robots and
autonomous intelligent systems (AIS) to work on offshore energy platforms to
enable cheaper, safer and more efficient working practices. The ORCA Hub will
research, integrate, validate and deploy remote AIS solutions that can operate
with existing and future offshore energy assets and sensors, interacting safely
in autonomous or semi-autonomous modes in complex and cluttered environments,
co-operating with remote operators. The goal is that through the use of such
robotic systems offshore, the need for personnel will decrease. To enable this
to happen, the remote operator will need a high level of situation awareness
and key to this is the transparency of what the autonomous systems are doing
and why. This increased transparency will facilitate a trusting relationship,
which is particularly key in high-stakes, hazardous situations.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2018 10:43:38 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Hastie",
"Helen",
""
],
[
"Lohan",
"Katrin",
""
],
[
"Chantler",
"Mike",
""
],
[
"Robb",
"David A.",
""
],
[
"Ramamoorthy",
"Subramanian",
""
],
[
"Petrick",
"Ron",
""
],
[
"Vijayakumar",
"Sethu",
""
],
[
"Lane",
"David",
""
]
] |
new_dataset
| 0.997432 |
1803.02122
|
Jose Berengueres Ph.D
|
Lojain Jibawi, Saoussen Said, Kenjiro Tadakuma and Jose Berengueres
|
Smartphone-based Home Robotics
|
6 pages, 3 figures, IEEE IROS 2018
| null | null | null |
cs.RO cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Humanoid robotics is a promising field because the strong human preference to
interact with anthropomorphic interfaces. Despite this, humanoid robots are far
from reaching main stream adoption and the features available in such robots
seem to lag that of the latest smartphones. A fragmented robot ecosystem and
low incentives to developers do not help to foster the creation of Robot-Apps
either. In contrast, smartphones enjoy high adoption rates and a vibrant app
ecosystem (4M apps published). Given this, it seems logical to apply the mobile
SW and HW development model to humanoid robots. One way is to use a smartphone
to power the robot. Smartphones have been embedded in toys and drones before.
However, they have never been used as the main compute unit in a humanoid
embodiment. Here, we introduce a novel robot architecture based on smartphones
that demonstrates x3 cost reduction and that is compatible with iOS/Android.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2018 11:29:21 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Jibawi",
"Lojain",
""
],
[
"Said",
"Saoussen",
""
],
[
"Tadakuma",
"Kenjiro",
""
],
[
"Berengueres",
"Jose",
""
]
] |
new_dataset
| 0.995123 |
1803.02124
|
David Robb
|
Helen Hastie, Francisco J. Chiyah Garcia, David A. Robb, Pedro Patron
and Atanas Laskov
|
MIRIAM: A Multimodal Chat-Based Interface for Autonomous Systems
|
2 pages, ICMI'17, 19th ACM International Conference on Multimodal
Interaction, November 13-17 2017, Glasgow, UK
| null |
10.1145/3136755.3143022
| null |
cs.AI cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present MIRIAM (Multimodal Intelligent inteRactIon for Autonomous
systeMs), a multimodal interface to support situation awareness of autonomous
vehicles through chat-based interaction. The user is able to chat about the
vehicle's plan, objectives, previous activities and mission progress. The
system is mixed initiative in that it pro-actively sends messages about key
events, such as fault warnings. We will demonstrate MIRIAM using SeeByte's
SeeTrack command and control interface and Neptune autonomy simulator.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2018 11:33:04 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Hastie",
"Helen",
""
],
[
"Garcia",
"Francisco J. Chiyah",
""
],
[
"Robb",
"David A.",
""
],
[
"Patron",
"Pedro",
""
],
[
"Laskov",
"Atanas",
""
]
] |
new_dataset
| 0.999536 |
1803.02181
|
Vandit Gajjar J
|
Vandit Gajjar
|
2^B3^C: 2 Box 3 Crop of Facial Image for Gender Classification with
Convolutional Networks
|
8 Pages, 7 Figures, Submitted to IEEE Computer Society Biometrics
2018 workshop in conjuction with CVPR 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we tackle the classification of gender in facial images with
deep learning. Our convolutional neural networks (CNN) use the VGG-16
architecture [1] and are pretrained on ImageNet for image classification. Our
proposed method (2^B3^C) first detects the face in the facial image, increases
the margin of a detected face by 50%, cropping the face with two boxes three
crop schemes (Left, Middle, and Right crop) and extracts the CNN predictions on
the cropped schemes. The CNNs of our method is fine-tuned on the Adience and
LFW with gender annotations. We show the effectiveness of our method by
achieving 90.8% classification on Adience and achieving competitive 95.3%
classification accuracy on LFW dataset. In addition, to check the true ability
of our method, our gender classification system has a frame rate of 7-10 fps
(frames per seconds) on a GPU considering real-time scenarios.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2018 11:25:14 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Gajjar",
"Vandit",
""
]
] |
new_dataset
| 0.980045 |
1803.02307
|
Youngjun Cho
|
Youngjun Cho, Andrea Bianchi, Nicolai Marquardt and Nadia
Bianchi-Berthouze
|
RealPen: Providing Realism in Handwriting Tasks on Touch Surfaces using
Auditory-Tactile Feedback
|
Proceedings of the 29th Annual Symposium on User Interface Software
and Technology (UIST '16)
| null |
10.1145/2984511.2984550
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present RealPen, an augmented stylus for capacitive tablet screens that
recreates the physical sensation of writing on paper with a pencil, ball-point
pen or marker pen. The aim is to create a more engaging experience when writing
on touch surfaces, such as screens of tablet computers. This is achieved by
re-generating the friction-induced oscillation and sound of a real writing tool
in contact with paper. To generate realistic tactile feedback, our algorithm
analyses the frequency spectrum of the friction oscillation generated when
writing with traditional tools, extracts principal frequencies, and uses the
actuator's frequency response profile for an adjustment weighting function. We
enhance the realism by providing the sound feedback aligned with the writing
pressure and speed. Furthermore, we investigated the effects of superposition
and fluctuation of several frequencies on human tactile perception, evaluated
the performance of RealPen, and characterized users' perception and preference
of each feedback type.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2018 17:17:19 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Cho",
"Youngjun",
""
],
[
"Bianchi",
"Andrea",
""
],
[
"Marquardt",
"Nicolai",
""
],
[
"Bianchi-Berthouze",
"Nadia",
""
]
] |
new_dataset
| 0.999596 |
1803.02337
|
Hantao Cui
|
Hantao Cui, Fangxing Li, Kevin Tomsovic, Siqi Wang, Riyasat Azim,
Yidan Lu, Haoyu Yuan
|
Cyber-Physical Testbed for Power System Wide-Area Measurement-Based
Control Using Open-Source Software
|
Submitted to IET CPS
| null | null | null |
cs.SY cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The electric power system is a cyber-physical system with power flow in the
physical system and information flow in the cyber. Simulation is crucial to
understanding the dynamics and control of electric power systems yet the
underlying communication system has historically been ignored in these studies.
This paper aims at meeting the increasing needs to simulate the operations of a
real power system including the physical system, the energy management system,
the communication system, and the emerging wide-area measurement-based
controls. This paper proposes a cyber-physical testbed design and
implementation for verifying and demonstrating wide-area control methods based
on streaming telemetry and phasor measurement unit data. The proposed decoupled
architecture is composed of a differential algebraic equation based physical
system simulator, a software-defined network, a scripting language environment
for prototyping an EMS system and a control system, all of which are integrated
over industry-standard communication protocols. The proposed testbed is
implemented using open-source software packages managed by a Python dispatcher.
Finally, demonstrations are presented to show two wide-area measurement-based
controls - system separation control and hierarchical voltage control, in the
implemented testbed.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2018 18:51:34 GMT"
}
] | 2018-03-07T00:00:00 |
[
[
"Cui",
"Hantao",
""
],
[
"Li",
"Fangxing",
""
],
[
"Tomsovic",
"Kevin",
""
],
[
"Wang",
"Siqi",
""
],
[
"Azim",
"Riyasat",
""
],
[
"Lu",
"Yidan",
""
],
[
"Yuan",
"Haoyu",
""
]
] |
new_dataset
| 0.980905 |
1101.1477
|
Lorne Applebaum
|
Lorne Applebaum, Waheed U. Bajwa, Marco F. Duarte, and Robert
Calderbank
|
Asynchronous Code-Division Random Access Using Convex Optimization
|
Journal version of work presented at 2010 Allerton Conference on
Communication, Control and Computing. Version 2 includes additional analysis
of randomly distributed user delays as well as a comparison with a matched
filter receiver
|
Elsevier Phy. Commun., vol. 5, no. 2, pp. 129-147, Jun. 2012
|
10.1016/j.phycom.2011.09.006
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many applications in cellular systems and sensor networks involve a random
subset of a large number of users asynchronously reporting activity to a base
station. This paper examines the problem of multiuser detection (MUD) in random
access channels for such applications. Traditional orthogonal signaling ignores
the random nature of user activity in this problem and limits the total number
of users to be on the order of the number of signal space dimensions.
Contention-based schemes, on the other hand, suffer from delays caused by
colliding transmissions and the hidden node problem. In contrast, this paper
presents a novel pairing of an asynchronous non-orthogonal code-division random
access scheme with a convex optimization-based MUD algorithm that overcomes the
issues associated with orthogonal signaling and contention-based methods. Two
key distinguishing features of the proposed MUD algorithm are that it does not
require knowledge of the delay or channel state information of every user and
it has polynomial-time computational complexity. The main analytical
contribution of this paper is the relationship between the performance of the
proposed MUD algorithm in the presence of arbitrary or random delays and two
simple metrics of the set of user codewords. The study of these metrics is then
focused on two specific sets of codewords, random binary codewords and
specially constructed algebraic codewords, for asynchronous random access. The
ensuing analysis confirms that the proposed scheme together with either of
these two codeword sets significantly outperforms the orthogonal
signaling-based random access in terms of the total number of users in the
system.
|
[
{
"version": "v1",
"created": "Fri, 7 Jan 2011 17:14:43 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Jun 2011 23:21:05 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Applebaum",
"Lorne",
""
],
[
"Bajwa",
"Waheed U.",
""
],
[
"Duarte",
"Marco F.",
""
],
[
"Calderbank",
"Robert",
""
]
] |
new_dataset
| 0.994567 |
1607.06544
|
Albert Reuther
|
Albert Reuther, Chansup Byun, William Arcand, David Bestor, Bill
Bergeron, Matthew Hubbell, Michael Jones, Peter Michaleas, Andrew Prout,
Antonio Rosa, Jeremy Kepner
|
Scheduler Technologies in Support of High Performance Data Analysis
|
6 pages, 5 figures, IEEE High Performance Extreme Computing
Conference 2016
| null |
10.1109/HPEC.2016.7761604
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Job schedulers are a key component of scalable computing infrastructures.
They orchestrate all of the work executed on the computing infrastructure and
directly impact the effectiveness of the system. Recently, job workloads have
diversified from long-running, synchronously-parallel simulations to include
short-duration, independently parallel high performance data analysis (HPDA)
jobs. Each of these job types requires different features and scheduler tuning
to run efficiently. A number of schedulers have been developed to address both
job workload and computing system heterogeneity. High performance computing
(HPC) schedulers were designed to schedule large-scale scientific modeling and
simulations on supercomputers. Big Data schedulers were designed to schedule
data processing and analytic jobs on clusters. This paper compares and
contrasts the features of HPC and Big Data schedulers with a focus on
accommodating both scientific computing and high performance data analytic
workloads. Job latency is critical for the efficient utilization of scalable
computing infrastructures, and this paper presents the results of job launch
benchmarking of several current schedulers: Slurm, Son of Grid Engine, Mesos,
and Yarn. We find that all of these schedulers have low utilization for
short-running jobs. Furthermore, employing multilevel scheduling significantly
improves the utilization across all schedulers.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2016 03:02:04 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Reuther",
"Albert",
""
],
[
"Byun",
"Chansup",
""
],
[
"Arcand",
"William",
""
],
[
"Bestor",
"David",
""
],
[
"Bergeron",
"Bill",
""
],
[
"Hubbell",
"Matthew",
""
],
[
"Jones",
"Michael",
""
],
[
"Michaleas",
"Peter",
""
],
[
"Prout",
"Andrew",
""
],
[
"Rosa",
"Antonio",
""
],
[
"Kepner",
"Jeremy",
""
]
] |
new_dataset
| 0.990714 |
1702.07893
|
Facundo Memoli
|
Patrizio Frosini, Claudia Landi, Facundo Memoli
|
The Persistent Homotopy Type Distance
|
version 2: Extended dHT to vector-valued functions and reworked
Section 5
| null | null | null |
cs.CG math.AT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the persistent homotopy type distance dHT to compare real valued
functions defined on possibly different homotopy equivalent topological spaces.
The underlying idea in the definition of dHT is to measure the minimal shift
that is necessary to apply to one of the two functions in order that the
sublevel sets of the two functions become homotopically equivalent. This
distance is interesting in connection with persistent homology. Indeed, our
main result states that dHT still provides an upper bound for the bottleneck
distance between the persistence diagrams of the intervening functions.
Moreover, because homotopy equivalences are weaker than homeomorphisms, this
implies a lifting of the standard stability results provided by the L-infty
distance and the natural pseudo-distance dNP. From a different standpoint, we
prove that dHT extends the L-infty distance and dNP in two ways. First, we show
that, appropriately restricting the category of objects to which dHT applies,
it can be made to coincide with the other two distances. Finally, we show that
dHT has an interpretation in terms of interleavings that naturally places it in
the family of distances used in persistence theory.
|
[
{
"version": "v1",
"created": "Sat, 25 Feb 2017 13:55:53 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Mar 2018 16:15:19 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Frosini",
"Patrizio",
""
],
[
"Landi",
"Claudia",
""
],
[
"Memoli",
"Facundo",
""
]
] |
new_dataset
| 0.999333 |
1707.03515
|
Jeremy Kepner
|
Chansup Byun, Jeremy Kepner, William Arcand, David Bestor, Bill
Bergeron, Vijay Gadepally, Michael Houle, Matthew Hubbell, Michael Jones,
Anna Klein, Peter Michaleas, Lauren Milechin, Julie Mullen, Andrew Prout,
Antonio Rosa, Siddharth Samsi, Charles Yee, Albert Reuther
|
Benchmarking Data Analysis and Machine Learning Applications on the
Intel KNL Many-Core Processor
|
6 pages; 9 figures; accepted to IEEE HPEC 2017
| null |
10.1109/HPEC.2017.8091067
| null |
cs.PF astro-ph.IM cs.DC physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Knights Landing (KNL) is the code name for the second-generation Intel Xeon
Phi product family. KNL has generated significant interest in the data analysis
and machine learning communities because its new many-core architecture targets
both of these workloads. The KNL many-core vector processor design enables it
to exploit much higher levels of parallelism. At the Lincoln Laboratory
Supercomputing Center (LLSC), the majority of users are running data analysis
applications such as MATLAB and Octave. More recently, machine learning
applications, such as the UC Berkeley Caffe deep learning framework, have
become increasingly important to LLSC users. Thus, the performance of these
applications on KNL systems is of high interest to LLSC users and the broader
data analysis and machine learning communities. Our data analysis benchmarks of
these application on the Intel KNL processor indicate that single-core
double-precision generalized matrix multiply (DGEMM) performance on KNL systems
has improved by ~3.5x compared to prior Intel Xeon technologies. Our data
analysis applications also achieved ~60% of the theoretical peak performance.
Also a performance comparison of a machine learning application, Caffe, between
the two different Intel CPUs, Xeon E5 v3 and Xeon Phi 7210, demonstrated a 2.7x
improvement on a KNL node.
|
[
{
"version": "v1",
"created": "Wed, 12 Jul 2017 02:04:58 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Byun",
"Chansup",
""
],
[
"Kepner",
"Jeremy",
""
],
[
"Arcand",
"William",
""
],
[
"Bestor",
"David",
""
],
[
"Bergeron",
"Bill",
""
],
[
"Gadepally",
"Vijay",
""
],
[
"Houle",
"Michael",
""
],
[
"Hubbell",
"Matthew",
""
],
[
"Jones",
"Michael",
""
],
[
"Klein",
"Anna",
""
],
[
"Michaleas",
"Peter",
""
],
[
"Milechin",
"Lauren",
""
],
[
"Mullen",
"Julie",
""
],
[
"Prout",
"Andrew",
""
],
[
"Rosa",
"Antonio",
""
],
[
"Samsi",
"Siddharth",
""
],
[
"Yee",
"Charles",
""
],
[
"Reuther",
"Albert",
""
]
] |
new_dataset
| 0.996373 |
1707.05900
|
Jeremy Kepner
|
Andrew Prout, William Arcand, David Bestor, Bill Bergeron, Chansup
Byun, Vijay Gadepally, Matthew Hubbell, Michael Houle, Michael Jones, Peter
Michaleas, Lauren Milechin, Julie Mullen, Antonio Rosa, Siddharth Samsi,
Albert Reuther, Jeremy Kepner
|
MIT SuperCloud Portal Workspace: Enabling HPC Web Application Deployment
|
6 pages, 3 figures, to appear in IEEE HPEC 2017
| null |
10.1109/HPEC.2017.8091097
| null |
cs.DC cs.HC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MIT SuperCloud Portal Workspace enables the secure exposure of web
services running on high performance computing (HPC) systems. The portal allows
users to run any web application as an HPC job and access it from their
workstation while providing authentication, encryption, and access control at
the system level to prevent unintended access. This capability permits users to
seamlessly utilize existing and emerging tools that present their user
interface as a website on an HPC system creating a portal workspace.
Performance measurements indicate that the MIT SuperCloud Portal Workspace
incurs marginal overhead when compared to a direct connection of the same
service.
|
[
{
"version": "v1",
"created": "Wed, 19 Jul 2017 00:04:21 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Prout",
"Andrew",
""
],
[
"Arcand",
"William",
""
],
[
"Bestor",
"David",
""
],
[
"Bergeron",
"Bill",
""
],
[
"Byun",
"Chansup",
""
],
[
"Gadepally",
"Vijay",
""
],
[
"Hubbell",
"Matthew",
""
],
[
"Houle",
"Michael",
""
],
[
"Jones",
"Michael",
""
],
[
"Michaleas",
"Peter",
""
],
[
"Milechin",
"Lauren",
""
],
[
"Mullen",
"Julie",
""
],
[
"Rosa",
"Antonio",
""
],
[
"Samsi",
"Siddharth",
""
],
[
"Reuther",
"Albert",
""
],
[
"Kepner",
"Jeremy",
""
]
] |
new_dataset
| 0.999647 |
1711.02741
|
Kuan Fang
|
Kuan Fang, Yu Xiang, Xiaocheng Li, Silvio Savarese
|
Recurrent Autoregressive Networks for Online Multi-Object Tracking
|
10 pages, 3 figures, 6 tables
| null | null | null |
cs.CV cs.AI cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main challenge of online multi-object tracking is to reliably associate
object trajectories with detections in each video frame based on their tracking
history. In this work, we propose the Recurrent Autoregressive Network (RAN), a
temporal generative modeling framework to characterize the appearance and
motion dynamics of multiple objects over time. The RAN couples an external
memory and an internal memory. The external memory explicitly stores previous
inputs of each trajectory in a time window, while the internal memory learns to
summarize long-term tracking history and associate detections by processing the
external memory. We conduct experiments on the MOT 2015 and 2016 datasets to
demonstrate the robustness of our tracking method in highly crowded and
occluded scenes. Our method achieves top-ranked results on the two benchmarks.
|
[
{
"version": "v1",
"created": "Tue, 7 Nov 2017 21:51:22 GMT"
},
{
"version": "v2",
"created": "Sun, 4 Mar 2018 04:21:03 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Fang",
"Kuan",
""
],
[
"Xiang",
"Yu",
""
],
[
"Li",
"Xiaocheng",
""
],
[
"Savarese",
"Silvio",
""
]
] |
new_dataset
| 0.97847 |
1801.00409
|
Haris Bin Zia
|
Haris Bin Zia, Agha Ali Raza, Awais Athar
|
PronouncUR: An Urdu Pronunciation Lexicon Generator
|
5 pages, LREC 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
State-of-the-art speech recognition systems rely heavily on three basic
components: an acoustic model, a pronunciation lexicon and a language model. To
build these components, a researcher needs linguistic as well as technical
expertise, which is a barrier in low-resource domains. Techniques to construct
these three components without having expert domain knowledge are in great
demand. Urdu, despite having millions of speakers all over the world, is a
low-resource language in terms of standard publically available linguistic
resources. In this paper, we present a grapheme-to-phoneme conversion tool for
Urdu that generates a pronunciation lexicon in a form suitable for use with
speech recognition systems from a list of Urdu words. The tool predicts the
pronunciation of words using a LSTM-based model trained on a handcrafted expert
lexicon of around 39,000 words and shows an accuracy of 64% upon internal
evaluation. For external evaluation on a speech recognition task, we obtain a
word error rate comparable to one achieved using a fully handcrafted expert
lexicon.
|
[
{
"version": "v1",
"created": "Mon, 1 Jan 2018 07:54:09 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Mar 2018 17:57:03 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Zia",
"Haris Bin",
""
],
[
"Raza",
"Agha Ali",
""
],
[
"Athar",
"Awais",
""
]
] |
new_dataset
| 0.998744 |
1802.03373
|
Sai Qian Zhang
|
Sai Qian Zhang, H.T. Kung, Youngjune Gwon
|
InferBeam: A Fast Beam Alignment Protocol for Millimeter-wave Networking
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce fast millimeter-wave base station (BS) and its antenna sector
selection for user equipment based on its location. Using a conditional random
field inference model with specially designed parameters, which are robust to
change of environment, InferBeam allows the use of measurement samples on best
beam selection at a small number of locations to infer the rest dynamically.
Compared to beam-sweeping based approaches in the literature, InferBeam can
drastically reduce the setup cost for beam alignment for a new environment, and
also the latency in acquiring a new beam under intermittent blockage. We have
evaluated InferBeam using a discrete event simulation. Our results indicate
that the system can make best beam selection for 98% of locations in test
environments comprising smallsized apartment or office spaces, while sampling
fewer than 1% of locations. InferBeam is a complete protocol for best beam
inference that can be integrated into millimeter-wave standards for
accelerating the much-needed fast and economic beam alignment capability.
|
[
{
"version": "v1",
"created": "Fri, 9 Feb 2018 18:19:25 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Mar 2018 16:02:03 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Zhang",
"Sai Qian",
""
],
[
"Kung",
"H. T.",
""
],
[
"Gwon",
"Youngjune",
""
]
] |
new_dataset
| 0.996155 |
1803.01047
|
Mehmet Turan
|
Mehmet Turan, Evin Pinar Ornek, Nail Ibrahimli, Can Giracoglu, Yasin
Almalioglu, Mehmet Fatih Yanik, and Metin Sitti
|
Unsupervised Odometry and Depth Learning for Endoscopic Capsule Robots
|
submitted to IROS 2018
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last decade, many medical companies and research groups have tried to
convert passive capsule endoscopes as an emerging and minimally invasive
diagnostic technology into actively steerable endoscopic capsule robots which
will provide more intuitive disease detection, targeted drug delivery and
biopsy-like operations in the gastrointestinal(GI) tract. In this study, we
introduce a fully unsupervised, real-time odometry and depth learner for
monocular endoscopic capsule robots. We establish the supervision by warping
view sequences and assigning the re-projection minimization to the loss
function, which we adopt in multi-view pose estimation and single-view depth
estimation network. Detailed quantitative and qualitative analyses of the
proposed framework performed on non-rigidly deformable ex-vivo porcine stomach
datasets proves the effectiveness of the method in terms of motion estimation
and depth recovery.
|
[
{
"version": "v1",
"created": "Fri, 2 Mar 2018 21:30:39 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Turan",
"Mehmet",
""
],
[
"Ornek",
"Evin Pinar",
""
],
[
"Ibrahimli",
"Nail",
""
],
[
"Giracoglu",
"Can",
""
],
[
"Almalioglu",
"Yasin",
""
],
[
"Yanik",
"Mehmet Fatih",
""
],
[
"Sitti",
"Metin",
""
]
] |
new_dataset
| 0.978918 |
1803.01136
|
Marco Giordani
|
Marco Giordani, Mattia Rebato, Andrea Zanella, Michele Zorzi
|
Coverage and Connectivity Analysis of Millimeter Wave Vehicular Networks
|
In press of Elsevier Ad Hoc Networks
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The next generations of vehicles will require data transmission rates in the
order of terabytes per driving hour, to support advanced automotive services.
This unprecedented amount of data to be exchanged goes beyond the capabilities
of existing communication technologies for vehicular communication and calls
for new solutions. A possible answer to this growing demand for ultra-high
transmission speeds can be found in the millimeter-wave (mmWave) bands which,
however, are subject to high signal attenuation and challenging propagation
characteristics. In particular, mmWave links are typically directional, to
benefit from the resulting beamforming gain, and require precise alignment of
the transmitter and the receiver beams, an operation which may increase the
latency of the communication and lead to deafness due to beam misalignment. In
this paper, we propose a stochastic model for characterizing the beam coverage
and connectivity probability in mmWave automotive networks. The purpose is to
exemplify some of the complex and interesting tradeoffs that have to be
considered when designing solutions for vehicular scenarios based on mmWave
links. The results show that the performance of the automotive nodes in highly
mobile mmWave systems strictly depends on the specific environment in which the
vehicles are deployed, and must account for several automotive-specific
features such as the nodes speed, the beam alignment periodicity, the base
stations density and the antenna geometry.
|
[
{
"version": "v1",
"created": "Sat, 3 Mar 2018 10:01:11 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Giordani",
"Marco",
""
],
[
"Rebato",
"Mattia",
""
],
[
"Zanella",
"Andrea",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.972516 |
1803.01261
|
Anastasia Shuba
|
Anastasia Shuba, Evita Bakopoulou, Milad Asgari Mehrabadi, Hieu Le,
David Choffnes, Athina Markopoulou
|
AntShield: On-Device Detection of Personal Information Exposure
| null | null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile devices have access to personal, potentially sensitive data, and there
is a growing number of applications that transmit this personally identifiable
information (PII) over the network. In this paper, we present the AntShield
system that performs on-device packet-level monitoring and detects the
transmission of such sensitive information accurately and in real-time. A key
insight is to distinguish PII that is predefined and is easily available on the
device from PII that is unknown a priori but can be automatically detected by
classifiers. Our system not only combines, for the first time, the advantages
of on-device monitoring with the power of learning unknown PII, but also
outperforms either of the two approaches alone. We demonstrate the real-time
performance of our prototype as well as the classification performance using a
dataset that we collect and analyze from scratch (including new findings in
terms of leaks and patterns). AntShield is a first step towards enabling
distributed learning of private information exposure.
|
[
{
"version": "v1",
"created": "Sat, 3 Mar 2018 23:31:49 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Shuba",
"Anastasia",
""
],
[
"Bakopoulou",
"Evita",
""
],
[
"Mehrabadi",
"Milad Asgari",
""
],
[
"Le",
"Hieu",
""
],
[
"Choffnes",
"David",
""
],
[
"Markopoulou",
"Athina",
""
]
] |
new_dataset
| 0.980347 |
1803.01276
|
Miguel Mosteiro
|
Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, and Prudence W. H.
Wong
|
Station Assignment with Reallocation
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a dynamic allocation problem that arises in various scenarios where
mobile clients joining and leaving the system have to communicate with static
stations via radio transmissions. Restrictions are a maximum delay, or laxity,
between consecutive client transmissions and a maximum bandwidth that a station
can share among its clients. We study the problem of assigning clients to
stations so that every client transmits to some station, satisfying those
restrictions. We consider reallocation algorithms, where clients are revealed
at its arrival time, the departure time is unknown until they leave, and
clients may be reallocated to another station, but at a cost proportional to
the reciprocal of the client laxity. We present negative results for previous
related protocols that motivate the study; we introduce new protocols that
expound trade-offs between station usage and reallocation cost; we determine
experimentally a classification of the clients attempting to balance those
opposite goals; we prove theoretically bounds on our performance metrics; and
we show through simulations that, for realistic scenarios, our protocols behave
much better than our theoretical guarantees.
|
[
{
"version": "v1",
"created": "Sun, 4 Mar 2018 00:55:39 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Halper",
"Austin",
""
],
[
"Mosteiro",
"Miguel A.",
""
],
[
"Rossikova",
"Yulia",
""
],
[
"Wong",
"Prudence W. H.",
""
]
] |
new_dataset
| 0.972139 |
1803.01362
|
Adri\'an G\'omez-Brand\'on
|
Nieves R. Brisaboa, Travis Gagie, Adri\'an G\'omez-Brand\'on and
Gonzalo Navarro
|
Two-Dimensional Block Trees
|
This research has received funding from the European Union's Horizon
2020 research and innovation programme under the Marie Sk{\l}odowska-Curie
Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Block Tree (BT) is a novel compact data structure designed to compress
sequence collections. It obtains compression ratios close to Lempel-Ziv and
supports efficient direct access to any substring. The BT divides the text
recursively into fixed-size blocks and those appearing earlier are represented
with pointers. On repetitive collections, a few blocks can represent all the
others, and thus the BT reduces the size by orders of magnitude. In this paper
we extend the BT to two dimensions, to exploit repetitiveness in collections of
images, graphs, and maps. This two-dimensional Block Tree divides the image
regularly into subimages and replaces some of them by pointers to other
occurrences thereof. We develop a specific variant aimed at compressing the
adjacency matrices of Web graphs, obtaining space reductions of up to 50\%
compared with the $k^2$-tree, which is the best alternative supporting direct
and reverse navigation in the graph.
|
[
{
"version": "v1",
"created": "Sun, 4 Mar 2018 14:46:32 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Brisaboa",
"Nieves R.",
""
],
[
"Gagie",
"Travis",
""
],
[
"Gómez-Brandón",
"Adrián",
""
],
[
"Navarro",
"Gonzalo",
""
]
] |
new_dataset
| 0.996423 |
1803.01394
|
Roberto Tonelli
|
Gianni Fenu, Lodovica Marchesi, Michele Marchesi and Roberto Tonelli
|
The ICO Phenomenon and Its Relationships with Ethereum Smart Contract
Environment
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Initial Coin Offerings (ICO) are public offers of new cryptocurrencies in
exchange of existing ones, aimed to finance projects in the blockchain
development arena. In the last 8 months of 2017, the total amount gathered by
ICOs exceeded 4 billion US$, and overcame the venture capital funnelled toward
high tech initiatives in the same period. A high percentage of ICOS is managed
through Smart Contracts running on Ethereum blockchain, and in particular to
ERC-20 Token Standard Contract. In this work we examine 1388 ICOs, published on
December 31, 2017 on icobench.com Web site, gathering information relevant to
the assessment of their quality and software development management, including
data on their development teams. We also study, at the same date, the financial
data of 450 ICO tokens available on coinmarketcap.com Web site, among which 355
tokens are managed on Ethereum blochain. We define success criteria for the
ICOs, based on the funds actually gathered, and on the behavior of the price of
the related tokens, finding the factors that most likely influence the ICO
success likeliness.
|
[
{
"version": "v1",
"created": "Sun, 4 Mar 2018 17:57:01 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Fenu",
"Gianni",
""
],
[
"Marchesi",
"Lodovica",
""
],
[
"Marchesi",
"Michele",
""
],
[
"Tonelli",
"Roberto",
""
]
] |
new_dataset
| 0.998932 |
1803.01413
|
Gedas Bertasius
|
Gedas Bertasius, Aaron Chan, Jianbo Shi
|
Egocentric Basketball Motion Planning from a Single First-Person Image
|
CVPR 2018
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a model that uses a single first-person image to generate an
egocentric basketball motion sequence in the form of a 12D camera configuration
trajectory, which encodes a player's 3D location and 3D head orientation
throughout the sequence. To do this, we first introduce a future convolutional
neural network (CNN) that predicts an initial sequence of 12D camera
configurations, aiming to capture how real players move during a one-on-one
basketball game. We also introduce a goal verifier network, which is trained to
verify that a given camera configuration is consistent with the final goals of
real one-on-one basketball players. Next, we propose an inverse synthesis
procedure to synthesize a refined sequence of 12D camera configurations that
(1) sufficiently matches the initial configurations predicted by the future
CNN, while (2) maximizing the output of the goal verifier network. Finally, by
following the trajectory resulting from the refined camera configuration
sequence, we obtain the complete 12D motion sequence.
Our model generates realistic basketball motion sequences that capture the
goals of real players, outperforming standard deep learning approaches such as
recurrent neural networks (RNNs), long short-term memory networks (LSTMs), and
generative adversarial networks (GANs).
|
[
{
"version": "v1",
"created": "Sun, 4 Mar 2018 20:12:58 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Bertasius",
"Gedas",
""
],
[
"Chan",
"Aaron",
""
],
[
"Shi",
"Jianbo",
""
]
] |
new_dataset
| 0.999167 |
1803.01469
|
EPTCS
|
Mario Frank (University of Potsdam, Institute for Computer Science,
Potsdam, Germany), Christoph Kreitz (University of Potsdam, Institute for
Computer Science, Potsdam, Germany)
|
A Theorem Prover for Scientific and Educational Purposes
|
In Proceedings ThEdu'17, arXiv:1803.00722
|
EPTCS 267, 2018, pp. 59-69
|
10.4204/EPTCS.267.4
| null |
cs.HC cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a prototype of an integrated reasoning environment for educational
purposes. The presented tool is a fragment of a proof assistant and automated
theorem prover. We describe the existing and planned functionality of the
theorem prover and especially the functionality of the educational fragment.
This currently supports working with terms of the untyped lambda calculus and
addresses both undergraduate students and researchers. We show how the tool can
be used to support the students' understanding of functional programming and
discuss general problems related to the process of building theorem proving
software that aims at supporting both research and education.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2018 02:46:32 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Frank",
"Mario",
"",
"University of Potsdam, Institute for Computer Science,\n Potsdam, Germany"
],
[
"Kreitz",
"Christoph",
"",
"University of Potsdam, Institute for\n Computer Science, Potsdam, Germany"
]
] |
new_dataset
| 0.97533 |
1803.01473
|
EPTCS
|
J{\o}rgen Villadsen (Technical University of Denmark), Andreas
Halkj{\ae}r From (Technical University of Denmark), Anders Schlichtkrull
(Technical University of Denmark)
|
Natural Deduction and the Isabelle Proof Assistant
|
In Proceedings ThEdu'17, arXiv:1803.00722
|
EPTCS 267, 2018, pp. 140-155
|
10.4204/EPTCS.267.9
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe our Natural Deduction Assistant (NaDeA) and the interfaces
between the Isabelle proof assistant and NaDeA. In particular, we explain how
NaDeA, using a generated prover that has been verified in Isabelle, provides
feedback to the student, and also how NaDeA, for each formula proved by the
student, provides a generated theorem that can be verified in Isabelle.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2018 02:47:59 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Villadsen",
"Jørgen",
"",
"Technical University of Denmark"
],
[
"From",
"Andreas Halkjær",
"",
"Technical University of Denmark"
],
[
"Schlichtkrull",
"Anders",
"",
"Technical University of Denmark"
]
] |
new_dataset
| 0.998622 |
1803.01579
|
Christos Verginis PhD student
|
Christos K. Verginis and Dimos V. Dimarogonas
|
Motion and Cooperative Transportation Planning for Multi-Agent Systems
under Temporal Logic Formulas
|
Submitted to IEEE Transactions on Automation Science and Engineering.
arXiv admin note: text overlap with arXiv:1611.05186
| null | null | null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a hybrid control framework for the motion planning of a
multi-agent system including N robotic agents and M objects, under high level
goals expressed as Linear Temporal Logic (LTL) formulas. In particular, we
design control protocols that allow the transition of the agents as well as the
cooperative transportation of the objects by the agents, among predefined
regions of interest in the workspace. This allows to abstract the coupled
behavior of the agents and the objects as a finite transition system and to
design a high-level multi-agent plan that satisfies the agents' and the
objects' specifications, given as temporal logic formulas. Simulation results
verify the proposed framework.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2018 10:05:44 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Verginis",
"Christos K.",
""
],
[
"Dimarogonas",
"Dimos V.",
""
]
] |
new_dataset
| 0.961887 |
1803.01598
|
Florian Quinkert
|
Florian Quinkert, Thorsten Holz, KSM Tozammel Hossain, Emilio Ferrara,
and Kristina Lerman
|
RAPTOR: Ransomware Attack PredicTOR
|
20 pages
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/4.0/
|
Ransomware, a type of malicious software that encrypts a victim's files and
only releases the cryptographic key once a ransom is paid, has emerged as a
potentially devastating class of cybercrimes in the past few years. In this
paper, we present RAPTOR, a promising line of defense against ransomware
attacks. RAPTOR fingerprints attackers' operations to forecast ransomware
activity. More specifically, our method learns features of malicious domains by
looking at examples of domains involved in known ransomware attacks, and then
monitors newly registered domains to identify potentially malicious ones. In
addition, RAPTOR uses time series forecasting techniques to learn models of
historical ransomware activity and then leverages malicious domain
registrations as an external signal to forecast future ransomware activity. We
illustrate RAPTOR's effectiveness by forecasting all activity stages of Cerber,
a popular ransomware family. By monitoring zone files of the top-level domain
.top starting from August 30, 2016 through May 31, 2017, RAPTOR predicted 2,126
newly registered domains to be potential Cerber domains. Of these, 378 later
actually appeared in blacklists. Our empirical evaluation results show that
using predicted domain registrations helped improve forecasts of future Cerber
activity. Most importantly, our approach demonstrates the value of fusing
different signals in forecasting applications in the cyber domain.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2018 10:51:24 GMT"
}
] | 2018-03-06T00:00:00 |
[
[
"Quinkert",
"Florian",
""
],
[
"Holz",
"Thorsten",
""
],
[
"Hossain",
"KSM Tozammel",
""
],
[
"Ferrara",
"Emilio",
""
],
[
"Lerman",
"Kristina",
""
]
] |
new_dataset
| 0.997051 |
1701.07842
|
Nicholas V. Lewchenko
|
Arjun Radhakrishna, Nicholas V. Lewchenko, Shawn Meier, Sergio Mover,
Krishna Chaitanya Sripada, Damien Zufferey, Bor-Yuh Evan Chang, and Pavol
\v{C}ern\'y
|
DroidStar: Callback Typestates for Android Classes
|
Appearing at ICSE 2018
| null | null | null |
cs.LO cs.LG cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Event-driven programming frameworks, such as Android, are based on components
with asynchronous interfaces. The protocols for interacting with these
components can often be described by finite-state machines we dub *callback
typestates*. Callback typestates are akin to classical typestates, with the
difference that their outputs (callbacks) are produced asynchronously. While
useful, these specifications are not commonly available, because writing them
is difficult and error-prone.
Our goal is to make the task of producing callback typestates significantly
easier. We present a callback typestate assistant tool, DroidStar, that
requires only limited user interaction to produce a callback typestate. Our
approach is based on an active learning algorithm, L*. We improved the
scalability of equivalence queries (a key component of L*), thus making active
learning tractable on the Android system.
We use DroidStar to learn callback typestates for Android classes both for
cases where one is already provided by the documentation, and for cases where
the documentation is unclear. The results show that DroidStar learns callback
typestates accurately and efficiently. Moreover, in several cases, the
synthesized callback typestates uncovered surprising and undocumented
behaviors.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 19:06:45 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Feb 2018 23:43:09 GMT"
},
{
"version": "v3",
"created": "Fri, 2 Mar 2018 18:45:04 GMT"
}
] | 2018-03-05T00:00:00 |
[
[
"Radhakrishna",
"Arjun",
""
],
[
"Lewchenko",
"Nicholas V.",
""
],
[
"Meier",
"Shawn",
""
],
[
"Mover",
"Sergio",
""
],
[
"Sripada",
"Krishna Chaitanya",
""
],
[
"Zufferey",
"Damien",
""
],
[
"Chang",
"Bor-Yuh Evan",
""
],
[
"Černý",
"Pavol",
""
]
] |
new_dataset
| 0.996144 |
1802.02669
|
Tolga Birdal
|
Haowen Deng, Tolga Birdal and Slobodan Ilic
|
PPFNet: Global Context Aware Local Features for Robust 3D Point Matching
|
Accepted for publication at CVPR 2018
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present PPFNet - Point Pair Feature NETwork for deeply learning a globally
informed 3D local feature descriptor to find correspondences in unorganized
point clouds. PPFNet learns local descriptors on pure geometry and is highly
aware of the global context, an important cue in deep learning. Our 3D
representation is computed as a collection of point-pair-features combined with
the points and normals within a local vicinity. Our permutation invariant
network design is inspired by PointNet and sets PPFNet to be ordering-free. As
opposed to voxelization, our method is able to consume raw point clouds to
exploit the full sparsity. PPFNet uses a novel $\textit{N-tuple}$ loss and
architecture injecting the global information naturally into the local
descriptor. It shows that context awareness also boosts the local feature
representation. Qualitative and quantitative evaluations of our network suggest
increased recall, improved robustness and invariance as well as a vital step in
the 3D descriptor extraction performance.
|
[
{
"version": "v1",
"created": "Wed, 7 Feb 2018 23:01:52 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Mar 2018 20:26:25 GMT"
}
] | 2018-03-05T00:00:00 |
[
[
"Deng",
"Haowen",
""
],
[
"Birdal",
"Tolga",
""
],
[
"Ilic",
"Slobodan",
""
]
] |
new_dataset
| 0.981076 |
1802.08979
|
Xi Victoria Lin
|
Xi Victoria Lin and Chenglong Wang and Luke Zettlemoyer and Michael D.
Ernst
|
NL2Bash: A Corpus and Semantic Parser for Natural Language Interface to
the Linux Operating System
|
Accepted at the Language Resource and Evaluation Conference (LREC)
2018
| null | null | null |
cs.CL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present new data and semantic parsing methods for the problem of mapping
English sentences to Bash commands (NL2Bash). Our long-term goal is to enable
any user to perform operations such as file manipulation, search, and
application-specific scripting by simply stating their goals in English. We
take a first step in this domain, by providing a new dataset of challenging but
commonly used Bash commands and expert-written English descriptions, along with
baseline methods to establish performance levels on this task.
|
[
{
"version": "v1",
"created": "Sun, 25 Feb 2018 09:52:24 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Mar 2018 17:46:59 GMT"
}
] | 2018-03-05T00:00:00 |
[
[
"Lin",
"Xi Victoria",
""
],
[
"Wang",
"Chenglong",
""
],
[
"Zettlemoyer",
"Luke",
""
],
[
"Ernst",
"Michael D.",
""
]
] |
new_dataset
| 0.999728 |
1803.00451
|
Prabath Jayatissa Dr
|
W.G.P.T Jayathissa (Post Graduate Institute of Medicine University of
Colombo), Vajira H W Dissanayake (Post Graduate Institute of Medicine
University of Colombo), Roshan Hewapathirana (Post Graduate Institute of
Medicine University of Colombo)
|
Developing a functional prototype master patient index (MPI) for
interoperability of e-health systems in Sri Lanka
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Introduction: A Master Patient Index(MPI) is a centralized index of all
patients in a healthcare system. This index is composed of a unique identifier
for each patient link to his/her demographic data and clinical encounters. A
MPI is essential to ensure data interoperability in the different healthcare
institution. The The health ministry of Sri Lanka planning to develop MPI for
the country. This project focused on developing the prototype MPI for Sri Lanka
with the view to implementing and scaling up at the national level. Methods:
This project consisted of 3 phases. Phase 1: requirement analysis using focus
group discussions (FGD) with information system users. Phase 2: identification
of the suitable Application Programming interface (API) model. Phase 3:
development of the prototype MPI. Results: FGD were conducted in 6 hospitals.
There were 78 interviewers (Male -36, and female - 42). They highlighted the
key requirements for the MPI. Which were the unique identification method and
different searching criteria and merging records to avoid duplication. Using
this information, the requirements specification for MPI was developed. A
combination of monolithic and microservices architecture was selected to
develop the MPI. The API using the Personal Health Number (PHN) as the unique
patient identifier and HL7 standard was developed and implemented. Conclusions:
Development and implementation of a MPI has facilitated the long due need for
interoperability among health information systems in Sri Lankan. KEYWORDS MPI,
Interoperability, Unique Identifier, PHN, API
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 15:36:33 GMT"
},
{
"version": "v2",
"created": "Fri, 2 Mar 2018 15:10:15 GMT"
}
] | 2018-03-05T00:00:00 |
[
[
"Jayathissa",
"W. G. P. T",
"",
"Post Graduate Institute of Medicine University of\n Colombo"
],
[
"Dissanayake",
"Vajira H W",
"",
"Post Graduate Institute of Medicine\n University of Colombo"
],
[
"Hewapathirana",
"Roshan",
"",
"Post Graduate Institute of\n Medicine University of Colombo"
]
] |
new_dataset
| 0.976195 |
1803.00653
|
Alexey Dosovitskiy
|
Nikolay Savinov, Alexey Dosovitskiy, Vladlen Koltun
|
Semi-parametric Topological Memory for Navigation
|
Published at International Conference on Learning Representations
(ICLR) 2018. Project website at https://sites.google.com/view/SPTM
| null | null | null |
cs.LG cs.AI cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new memory architecture for navigation in previously unseen
environments, inspired by landmark-based navigation in animals. The proposed
semi-parametric topological memory (SPTM) consists of a (non-parametric) graph
with nodes corresponding to locations in the environment and a (parametric)
deep network capable of retrieving nodes from the graph based on observations.
The graph stores no metric information, only connectivity of locations
corresponding to the nodes. We use SPTM as a planning module in a navigation
system. Given only 5 minutes of footage of a previously unseen maze, an
SPTM-based navigation agent can build a topological map of the environment and
use it to confidently navigate towards goals. The average success rate of the
SPTM agent in goal-directed navigation across test environments is higher than
the best-performing baseline by a factor of three. A video of the agent is
available at https://youtu.be/vRF7f4lhswo
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 22:50:35 GMT"
}
] | 2018-03-05T00:00:00 |
[
[
"Savinov",
"Nikolay",
""
],
[
"Dosovitskiy",
"Alexey",
""
],
[
"Koltun",
"Vladlen",
""
]
] |
new_dataset
| 0.997991 |
1803.00900
|
Sukjin Lee
|
Suk Jin Lee, Hongsik Choi, Sungun Kim
|
Slotted CSMA/CA Based Energy Efficient MAC Protocol Design in
Nanonetworks
|
12 pages, 9 figures, Journal
|
International Journal of Wireless & Mobile Networks, 2018
|
10.5121/ijwmn.2018.10101
| null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Devices in a beacon-enabled network use slotted CSMA/CA to contend for
channel usage. Each node in the network competes for the channels when ready to
transmit data. The slotted CSMA/CA mechanism based on the super-frame structure
fairly provides communication chance for each node and makes a reasonable usage
of the available energy in beacon-enabled Zigbee networks. When wireless
nano-sensor nodes are implanted into the target human body area for detecting
disease symptoms or virus existence, each node also requires a similar
characteristic in channel sharing and in the transmission of event-driven data
with a short length. In this paper, we suggest a wireless network model with
nano-sensor nodes for the in-body application. We propose a novel MAC protocol
derived from an existing Zigbee MAC protocol scheme and analyze the performance
of energy usage with variable super-frame durations and packet sizes.
|
[
{
"version": "v1",
"created": "Fri, 2 Mar 2018 15:38:44 GMT"
}
] | 2018-03-05T00:00:00 |
[
[
"Lee",
"Suk Jin",
""
],
[
"Choi",
"Hongsik",
""
],
[
"Kim",
"Sungun",
""
]
] |
new_dataset
| 0.998176 |
1803.00902
|
Duygu Altinok
|
Duygu Altinok
|
DEMorphy, German Language Morphological Analyzer
|
7 pages, 2 figures
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
DEMorphy is a morphological analyzer for German. It is built onto large,
compactified lexicons from German Morphological Dictionary. A guesser based on
German declension suffixed is also provided. For German, we provided a
state-of-art morphological analyzer. DEMorphy is implemented in Python with
ease of usability and accompanying documentation. The package is suitable for
both academic and commercial purposes wit a permissive licence.
|
[
{
"version": "v1",
"created": "Fri, 2 Mar 2018 15:41:33 GMT"
}
] | 2018-03-05T00:00:00 |
[
[
"Altinok",
"Duygu",
""
]
] |
new_dataset
| 0.999354 |
1501.02741
|
Ming-Ming Cheng Prof.
|
Ali Borji, Ming-Ming Cheng, Huaizu Jiang, Jia Li
|
Salient Object Detection: A Benchmark
| null |
Image Processing, IEEE Transactions on (Volume:24, Issue: 12),
2015
|
10.1109/TIP.2015.2487833
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We extensively compare, qualitatively and quantitatively, 40 state-of-the-art
models (28 salient object detection, 10 fixation prediction, 1 objectness, and
1 baseline) over 6 challenging datasets for the purpose of benchmarking salient
object detection and segmentation methods. From the results obtained so far,
our evaluation shows a consistent rapid progress over the last few years in
terms of both accuracy and running time. The top contenders in this benchmark
significantly outperform the models identified as the best in the previous
benchmark conducted just two years ago. We find that the models designed
specifically for salient object detection generally work better than models in
closely related areas, which in turn provides a precise definition and suggests
an appropriate treatment of this problem that distinguishes it from other
problems. In particular, we analyze the influences of center bias and scene
complexity in model performance, which, along with the hard cases for
state-of-the-art models, provide useful hints towards constructing more
challenging large scale datasets and better saliency models. Finally, we
propose probable solutions for tackling several open problems such as
evaluation scores and dataset bias, which also suggest future research
directions in the rapidly-growing field of salient object detection.
|
[
{
"version": "v1",
"created": "Mon, 5 Jan 2015 20:24:01 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Feb 2018 06:24:39 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Borji",
"Ali",
""
],
[
"Cheng",
"Ming-Ming",
""
],
[
"Jiang",
"Huaizu",
""
],
[
"Li",
"Jia",
""
]
] |
new_dataset
| 0.99905 |
1704.00675
|
Jordi Pont-Tuset
|
Jordi Pont-Tuset and Federico Perazzi and Sergi Caelles and Pablo
Arbel\'aez and Alex Sorkine-Hornung and Luc Van Gool
|
The 2017 DAVIS Challenge on Video Object Segmentation
|
Challenge website: http://davischallenge.org
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the 2017 DAVIS Challenge on Video Object Segmentation, a public
dataset, benchmark, and competition specifically designed for the task of video
object segmentation. Following the footsteps of other successful initiatives,
such as ILSVRC and PASCAL VOC, which established the avenue of research in the
fields of scene classification and semantic segmentation, the DAVIS Challenge
comprises a dataset, an evaluation methodology, and a public competition with a
dedicated workshop co-located with CVPR 2017. The DAVIS Challenge follows up on
the recent publication of DAVIS (Densely-Annotated VIdeo Segmentation), which
has fostered the development of several novel state-of-the-art video object
segmentation techniques. In this paper we describe the scope of the benchmark,
highlight the main characteristics of the dataset, define the evaluation
metrics of the competition, and present a detailed analysis of the results of
the participants to the challenge.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 16:44:46 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Apr 2017 18:07:57 GMT"
},
{
"version": "v3",
"created": "Thu, 1 Mar 2018 17:50:08 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Pont-Tuset",
"Jordi",
""
],
[
"Perazzi",
"Federico",
""
],
[
"Caelles",
"Sergi",
""
],
[
"Arbeláez",
"Pablo",
""
],
[
"Sorkine-Hornung",
"Alex",
""
],
[
"Van Gool",
"Luc",
""
]
] |
new_dataset
| 0.999618 |
1801.02608
|
Danny Karmon
|
Danny Karmon, Daniel Zoran and Yoav Goldberg
|
LaVAN: Localized and Visible Adversarial Noise
| null | null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most works on adversarial examples for deep-learning based image classifiers
use noise that, while small, covers the entire image. We explore the case where
the noise is allowed to be visible but confined to a small, localized patch of
the image, without covering any of the main object(s) in the image. We show
that it is possible to generate localized adversarial noises that cover only 2%
of the pixels in the image, none of them over the main object, and that are
transferable across images and locations, and successfully fool a
state-of-the-art Inception v3 model with very high success rates.
|
[
{
"version": "v1",
"created": "Mon, 8 Jan 2018 18:44:23 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Mar 2018 12:49:11 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Karmon",
"Danny",
""
],
[
"Zoran",
"Daniel",
""
],
[
"Goldberg",
"Yoav",
""
]
] |
new_dataset
| 0.955626 |
1803.00085
|
Tai-Ling Yuan
|
Tai-Ling Yuan, Zhe Zhu, Kun Xu, Cheng-Jun Li, Shi-Min Hu
|
Chinese Text in the Wild
| null | null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We introduce Chinese Text in the Wild, a very large dataset of Chinese text
in street view images. While optical character recognition (OCR) in document
images is well studied and many commercial tools are available, detection and
recognition of text in natural images is still a challenging problem,
especially for more complicated character sets such as Chinese text. Lack of
training data has always been a problem, especially for deep learning methods
which require massive training data.
In this paper we provide details of a newly created dataset of Chinese text
with about 1 million Chinese characters annotated by experts in over 30
thousand street view images. This is a challenging dataset with good diversity.
It contains planar text, raised text, text in cities, text in rural areas, text
under poor illumination, distant text, partially occluded text, etc. For each
character in the dataset, the annotation includes its underlying character, its
bounding box, and 6 attributes. The attributes indicate whether it has complex
background, whether it is raised, whether it is handwritten or printed, etc.
The large size and diversity of this dataset make it suitable for training
robust neural networks for various tasks, particularly detection and
recognition. We give baseline results using several state-of-the-art networks,
including AlexNet, OverFeat, Google Inception and ResNet for character
recognition, and YOLOv2 for character detection in images. Overall Google
Inception has the best performance on recognition with 80.5% top-1 accuracy,
while YOLOv2 achieves an mAP of 71.0% on detection. Dataset, source code and
trained models will all be publicly available on the website.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 21:03:58 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Yuan",
"Tai-Ling",
""
],
[
"Zhu",
"Zhe",
""
],
[
"Xu",
"Kun",
""
],
[
"Li",
"Cheng-Jun",
""
],
[
"Hu",
"Shi-Min",
""
]
] |
new_dataset
| 0.999677 |
1803.00097
|
Maximo Loizu Cisquella
|
Carlos Gilarranz Casado, Maximo Loizu Cisquella, Sergio Altares
L\'opez
|
Intelligent Irrigation System Based on Arduino
|
6 pages, 9 figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper explains how to build an intelligent irrigation system using
Arduino (a micro- controller) and many devices (humidity, temperature, pressure
and water flow sensors). Our irrigation system combines a precise method to
determine water balance of soils with an automatic response to water content
oscillations. Thus, it is an example of how we can perform better irrigation
systems by increasing the precision of measurements but also by automating
decisions.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 21:32:43 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Casado",
"Carlos Gilarranz",
""
],
[
"Cisquella",
"Maximo Loizu",
""
],
[
"López",
"Sergio Altares",
""
]
] |
new_dataset
| 0.988959 |
1803.00127
|
Nitin J Sanket
|
Huai-Jen Liang, Nitin J. Sanket, Cornelia Ferm\"uller, Yiannis
Aloimonos
|
SalientDSO: Bringing Attention to Direct Sparse Odometry
| null | null | null | null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although cluttered indoor scenes have a lot of useful high-level semantic
information which can be used for mapping and localization, most Visual
Odometry (VO) algorithms rely on the usage of geometric features such as
points, lines and planes. Lately, driven by this idea, the joint optimization
of semantic labels and obtaining odometry has gained popularity in the robotics
community. The joint optimization is good for accurate results but is generally
very slow. At the same time, in the vision community, direct and sparse
approaches for VO have stricken the right balance between speed and accuracy.
We merge the successes of these two communities and present a way to
incorporate semantic information in the form of visual saliency to Direct
Sparse Odometry - a highly successful direct sparse VO algorithm. We also
present a framework to filter the visual saliency based on scene parsing. Our
framework, SalientDSO, relies on the widely successful deep learning based
approaches for visual saliency and scene parsing which drives the feature
selection for obtaining highly-accurate and robust VO even in the presence of
as few as 40 point features per frame. We provide extensive quantitative
evaluation of SalientDSO on the ICL-NUIM and TUM monoVO datasets and show that
we outperform DSO and ORB-SLAM - two very popular state-of-the-art approaches
in the literature. We also collect and publicly release a CVL-UMD dataset which
contains two indoor cluttered sequences on which we show qualitative
evaluations. To our knowledge this is the first paper to use visual saliency
and scene parsing to drive the feature selection in direct VO.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 23:02:47 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Liang",
"Huai-Jen",
""
],
[
"Sanket",
"Nitin J.",
""
],
[
"Fermüller",
"Cornelia",
""
],
[
"Aloimonos",
"Yiannis",
""
]
] |
new_dataset
| 0.997598 |
1803.00160
|
Hamid Foroughi
|
Hamid Foroughi, Hamidreza Askarieh Yazdi, Mojtaba Azhari
|
Buckling of thin composite plates reinforced with randomly oriented,
straight single-walled carbon nanotubes using B3-Spline finite strip method
| null |
1st National Conference on New Materials and Systems in Civil
Engineering, Graduate University of Advanced Technology, Kerman, Iran, 2013
| null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is devoted to the mechanical buckling analysis of thin composite
plates under straight single-walled carbon nanotubes reinforcement with uniform
distribution and random orientations. In order to develop the fundamental
equations, the B3-Spline finite strip method along with the classical plate
theory is employed and the total potential energy is minimized which leads to
an eigenvalue problem. For deriving the effective modulus of thin composite
plates reinforced with carbon nanotubes, the Mori-Tanaka method is used in
which each straight carbon nanotube is modeled as a fiber with transversely
isotropic elastic properties. The results of our numerical experiments
including the critical buckling loads for rectangular thin composite plates
reinforced by carbon nanotubes with various boundary conditions and different
volume fractions of nanotubes are provided and the positive effect of using
carbon nanotubes reinforcement in mechanical buckling of thin plates is
illustrated.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 01:51:49 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Foroughi",
"Hamid",
""
],
[
"Yazdi",
"Hamidreza Askarieh",
""
],
[
"Azhari",
"Mojtaba",
""
]
] |
new_dataset
| 0.99522 |
1803.00185
|
Yang Hu Dr.
|
Tianyuan Chang, Guihua Wen, Yang Hu, JiaJiong Ma
|
Facial Expression Recognition Based on Complexity Perception
Classification Algorithm
| null | null | null | null |
cs.CV cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Facial expression recognition (FER) has always been a challenging issue in
computer vision. The different expressions of emotion and uncontrolled
environmental factors lead to inconsistencies in the complexity of FER and
variability of between expression categories, which is often overlooked in most
facial expression recognition systems. In order to solve this problem
effectively, we presented a simple and efficient CNN model to extract facial
features, and proposed a complexity perception classification (CPC) algorithm
for FER. The CPC algorithm divided the dataset into an easy classification
sample subspace and a complex classification sample subspace by evaluating the
complexity of facial features that are suitable for classification. The
experimental results of our proposed algorithm on Fer2013 and CK-plus datasets
demonstrated the algorithm's effectiveness and superiority over other
state-of-the-art approaches.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 03:05:50 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Chang",
"Tianyuan",
""
],
[
"Wen",
"Guihua",
""
],
[
"Hu",
"Yang",
""
],
[
"Ma",
"JiaJiong",
""
]
] |
new_dataset
| 0.993818 |
1803.00219
|
Yang Hu Dr.
|
Jiajiong Ma, Guihua Wen, Yang Hu, Tianyuan Chang, Haibin Zeng, Lijun
Jiang, Jianzeng Qin
|
Tongue image constitution recognition based on Complexity Perception
method
| null | null | null | null |
cs.CV cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Background and Object: In China, body constitution is highly related to
physiological and pathological functions of human body and determines the
tendency of the disease, which is of great importance for treatment in clinical
medicine. Tongue diagnosis, as a key part of Traditional Chinese Medicine
inspection, is an important way to recognize the type of constitution.In order
to deploy tongue image constitution recognition system on non-invasive mobile
device to achieve fast, efficient and accurate constitution recognition, an
efficient method is required to deal with the challenge of this kind of complex
environment. Methods: In this work, we perform the tongue area detection,
tongue area calibration and constitution classification using methods which are
based on deep convolutional neural network. Subject to the variation of
inconstant environmental condition, the distribution of the picture is uneven,
which has a bad effect on classification performance. To solve this problem, we
propose a method based on the complexity of individual instances to divide
dataset into two subsets and classify them separately, which is capable of
improving classification accuracy. To evaluate the performance of our proposed
method, we conduct experiments on three sizes of tongue datasets, in which deep
convolutional neural network method and traditional digital image analysis
method are respectively applied to extract features for tongue images. The
proposed method is combined with the base classifier Softmax, SVM, and
DecisionTree respectively. Results: As the experiments results shown, our
proposed method improves the classification accuracy by 1.135% on average and
achieves 59.99% constitution classification accuracy. Conclusions: Experimental
results on three datasets show that our proposed method can effectively improve
the classification accuracy of tongue constitution recognition.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 05:32:43 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Ma",
"Jiajiong",
""
],
[
"Wen",
"Guihua",
""
],
[
"Hu",
"Yang",
""
],
[
"Chang",
"Tianyuan",
""
],
[
"Zeng",
"Haibin",
""
],
[
"Jiang",
"Lijun",
""
],
[
"Qin",
"Jianzeng",
""
]
] |
new_dataset
| 0.99677 |
1803.00232
|
Alexandre Thiery
|
Sripad Krishna Devalla, Prajwal K. Renukanand, Bharathwaj K. Sreedhar,
Shamira Perera, Jean-Martial Mari, Khai Sing Chin, Tin A. Tun, Nicholas G.
Strouthidis, Tin Aung, Alexandre H. Thiery, Michael J. A. Girard
|
DRUNET: A Dilated-Residual U-Net Deep Learning Network to Digitally
Stain Optic Nerve Head Tissues in Optical Coherence Tomography Images
| null | null | null | null |
cs.CV cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given that the neural and connective tissues of the optic nerve head (ONH)
exhibit complex morphological changes with the development and progression of
glaucoma, their simultaneous isolation from optical coherence tomography (OCT)
images may be of great interest for the clinical diagnosis and management of
this pathology. A deep learning algorithm was designed and trained to digitally
stain (i.e. highlight) 6 ONH tissue layers by capturing both the local (tissue
texture) and contextual information (spatial arrangement of tissues). The
overall dice coefficient (mean of all tissues) was $0.91 \pm 0.05$ when
assessed against manual segmentations performed by an expert observer. We offer
here a robust segmentation framework that could be extended for the automated
parametric study of the ONH tissues.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 06:37:30 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Devalla",
"Sripad Krishna",
""
],
[
"Renukanand",
"Prajwal K.",
""
],
[
"Sreedhar",
"Bharathwaj K.",
""
],
[
"Perera",
"Shamira",
""
],
[
"Mari",
"Jean-Martial",
""
],
[
"Chin",
"Khai Sing",
""
],
[
"Tun",
"Tin A.",
""
],
[
"Strouthidis",
"Nicholas G.",
""
],
[
"Aung",
"Tin",
""
],
[
"Thiery",
"Alexandre H.",
""
],
[
"Girard",
"Michael J. A.",
""
]
] |
new_dataset
| 0.9994 |
1803.00239
|
F. J. Lobillo
|
Jos\'e G\'omez-Torrecillas and F. J. Lobillo and Gabriel Navarro
|
Dual skew codes from annihilators: Transpose Hamming ring extensions
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a framework to study the dual of skew cyclic codes is proposed.
The transposed Hamming ring extensions are based in the existence of an
anti-isomorphism of algebras between skew polynomial rings. Our construction is
applied to left ideal convolutional codes, skew constacyclic codes and skew
Reed-Solomon code, showing that the dual of these codes belong to the same
class.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 08:00:24 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Gómez-Torrecillas",
"José",
""
],
[
"Lobillo",
"F. J.",
""
],
[
"Navarro",
"Gabriel",
""
]
] |
new_dataset
| 0.974352 |
1803.00262
|
Xiaojing Chen
|
Xiaojing Chen, Shixin Zhu, Xiaoshan Kai
|
Entanglement-assisted quantum MDS codes constructed from constacyclic
codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, entanglement-assisted quantum error correcting codes (EAQECCs) have
been constructed by cyclic codes and negacyclic codes. In this paper, by
analyzing the cyclotomic cosets in the defining set of constacyclic codes, we
constructed three classes of new EAQECCs which satisfy the
entanglement-assisted quantum Singleton bound. Besides, three classes of
EAQECCs with maximal entanglement from constacyclic codes are constructed in
the meanwhile.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 09:12:52 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Chen",
"Xiaojing",
""
],
[
"Zhu",
"Shixin",
""
],
[
"Kai",
"Xiaoshan",
""
]
] |
new_dataset
| 0.999638 |
1803.00275
|
Hasan Mahmood Aminul Islam
|
Hasan M A Islam, Dmitrij Lagutin, Andrey Lukyanenko, Andrei Gurtov and
Antti Yl\"a-J\"a\"aski
|
CIDOR: Content Distribution and Retrieval in Disaster Networks for
Public Protection
|
International Conference on Wireless and Mobile Computing, Networking
and Communications (WiMob)
| null |
10.1109/WiMOB.2017.8115834
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information-Centric Networking (ICN) introduces a paradigm shift from a host
centric communication model for Future Internet architectures. It supports the
retrieval of a particular content regardless of the physical location of the
content. Emergency network in a disaster scenario or disruptive network
presents a significant challenge to the ICN deployment. In this paper, we
present a Content dIstribution and retrieval framework in disaster netwOrks for
public pRotection (CIDOR) which exploits the design principle of the native CCN
architecture in the native Delay Tolerant Networking (DTN) architecture. We
prove the feasibility and investigate the performance of our proposed solution
using extensive simulation with different classes of the DTN routing strategies
in different mobility scenarios. The simulation result shows that CIDOR can
reduce the content retrieval time up to 50% while the response ratio is close
to 100%.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 09:57:33 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Islam",
"Hasan M A",
""
],
[
"Lagutin",
"Dmitrij",
""
],
[
"Lukyanenko",
"Andrey",
""
],
[
"Gurtov",
"Andrei",
""
],
[
"Ylä-Jääski",
"Antti",
""
]
] |
new_dataset
| 0.997002 |
1803.00346
|
Silvia Cruciani
|
Silvia Cruciani, Christian Smith, Danica Kragic, Kaiyu Hang
|
Dexterous Manipulation Graphs
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose the Dexterous Manipulation Graph as a tool to address in-hand
manipulation and reposition an object inside a robot's end-effector. This graph
is used to plan a sequence of manipulation primitives so to bring the object to
the desired end pose. This sequence of primitives is translated into motions of
the robot to move the object held by the end-effector. We use a dual arm robot
with parallel grippers to test our method on a real system and show successful
planning and execution of in-hand manipulation.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 12:47:18 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Cruciani",
"Silvia",
""
],
[
"Smith",
"Christian",
""
],
[
"Kragic",
"Danica",
""
],
[
"Hang",
"Kaiyu",
""
]
] |
new_dataset
| 0.98627 |
1803.00367
|
Samuel Coogan
|
Samuel Coogan and Murat Arcak
|
A Benchmark Problem in Transportation Networks
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this note, we propose a case study of freeway traffic flow modeled as a
hybrid system. We describe two general classes of networks that model flow
along a freeway with merging onramps. The admission rate of traffic flow from
each onramp is metered via a control input. Both classes of networks are easily
scaled to accommodate arbitrary state dimension. The model is discrete-time and
possesses piecewise-affine dynamics. Moreover, we present several control
objectives that are especially relevant for traffic flow management. The
proposed model is flexible and extensible and offers a benchmark for evaluating
tools and techniques developed for hybrid systems.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 13:59:24 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Coogan",
"Samuel",
""
],
[
"Arcak",
"Murat",
""
]
] |
new_dataset
| 0.982913 |
1803.00387
|
Xinxin Du
|
Xinxin Du, Marcelo H. Ang Jr., Sertac Karaman, Daniela Rus
|
A General Pipeline for 3D Detection of Vehicles
|
Accepted at ICRA 2018
| null | null | null |
cs.CV eess.IV stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous driving requires 3D perception of vehicles and other objects in
the in environment. Much of the current methods support 2D vehicle detection.
This paper proposes a flexible pipeline to adopt any 2D detection network and
fuse it with a 3D point cloud to generate 3D information with minimum changes
of the 2D detection networks. To identify the 3D box, an effective model
fitting algorithm is developed based on generalised car models and score maps.
A two-stage convolutional neural network (CNN) is proposed to refine the
detected 3D box. This pipeline is tested on the KITTI dataset using two
different 2D detection networks. The 3D detection results based on these two
networks are similar, demonstrating the flexibility of the proposed pipeline.
The results rank second among the 3D detection algorithms, indicating its
competencies in 3D detection.
|
[
{
"version": "v1",
"created": "Mon, 12 Feb 2018 15:32:23 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Du",
"Xinxin",
""
],
[
"Ang",
"Marcelo H.",
"Jr."
],
[
"Karaman",
"Sertac",
""
],
[
"Rus",
"Daniela",
""
]
] |
new_dataset
| 0.969519 |
1803.00424
|
Gerard Le Lann
|
G\'erard Le Lann (RITS)
|
Autonomic Vehicular Networks: Safety, Privacy, Cybersecurity and
Societal Issues
| null |
IEEE Vehicular Technology Conference Spring 2018 -- First
International Workshop on research advances in Cooperative ITS cyber security
and privacy (C-ITSec), Jun 2018, Porto, Portugal
| null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Safety, efficiency, privacy, and cybersecurity can be achieved jointly in
self-organizing networks of communicating vehicles of various automated driving
levels. The underlying approach, solutions and novel results are briefly
exposed. We explain why we are faced with a crucial choice regarding motorized
society and cyber surveillance.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 15:06:29 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Lann",
"Gérard Le",
"",
"RITS"
]
] |
new_dataset
| 0.970663 |
1803.00466
|
Hyunji Chung
|
Hyunji Chung and Sangjin Lee
|
Intelligent Virtual Assistant knows Your Life
|
6 pages, 7 figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the IoT world, intelligent virtual assistant (IVA) is a popular service to
interact with users based on voice command. For optimal performance and
efficient data management, famous IVAs like Amazon Alexa and Google Assistant
usually operate based on the cloud computing architecture. In this process, a
large amount of behavioral traces that include user voice activity history with
detailed descriptions can be stored in the remote servers within an IVA
ecosystem. If those data (as also known as IVA cloud native data) are leaked by
attacks, malicious person may be able to not only harvest detailed usage
history of IVA services, but also reveals additional user related information
through various data analysis techniques. In this paper, we firstly show and
categorize types of IVA related data that can be collected from popular IVA,
Amazon Alexa. We then analyze an experimental dataset covering three months
with Alexa service, and characterize the properties of user lifestyle and life
patterns. Our results show that it is possible to uncover new insights on
personal information such as user interests, IVA usage patterns and sleeping,
wakeup patterns. The results presented in this paper provide important
implications for and privacy threats to IVA vendors and users as well.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 01:06:57 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Chung",
"Hyunji",
""
],
[
"Lee",
"Sangjin",
""
]
] |
new_dataset
| 0.995413 |
1803.00467
|
Yuan Cao
|
Yuan Cao, Yonglin Cao
|
Negacyclic codes over the local ring $\mathbb{Z}_4[v]/\langle
v^2+2v\rangle$ of oddly even length and their Gray images
|
arXiv admin note: text overlap with arXiv:1710.09236
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $R=\mathbb{Z}_{4}[v]/\langle
v^2+2v\rangle=\mathbb{Z}_{4}+v\mathbb{Z}_{4}$ ($v^2=2v$) and $n$ be an odd
positive integer. Then $R$ is a local non-principal ideal ring of $16$ elements
and there is a $\mathbb{Z}_{4}$-linear Gray map from $R$ onto
$\mathbb{Z}_{4}^2$ which preserves Lee distance and orthogonality. First, a
canonical form decomposition and the structure for any negacyclic code over $R$
of length $2n$ are presented. From this decomposition, a complete
classification of all these codes is obtained. Then the cardinality and the
dual code for each of these codes are given, and self-dual negacyclic codes
over $R$ of length $2n$ are presented. Moreover, all $23\cdot(4^p+5\cdot
2^p+9)^{\frac{2^{p}-2}{p}}$ negacyclic codes over $R$ of length $2M_p$ and all
$3\cdot(4^p+5\cdot 2^p+9)^{\frac{2^{p-1}-1}{p}}$ self-dual codes among them are
presented precisely, where $M_p=2^p-1$ is a Mersenne prime. Finally, $36$ new
and good self-dual $2$-quasi-twisted linear codes over $\mathbb{Z}_4$ with
basic parameters $(28,2^{28}, d_L=8,d_E=12)$ and of type $2^{14}4^7$ and basic
parameters $(28,2^{28}, d_L=6,d_E=12)$ and of type $2^{16}4^6$ which are Gray
images of self-dual negacyclic codes over $R$ of length $14$ are listed.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 00:31:22 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Cao",
"Yuan",
""
],
[
"Cao",
"Yonglin",
""
]
] |
new_dataset
| 0.999871 |
1803.00486
|
Henry K. Schenck
|
John Little, Hal Schenck
|
Codes from surfaces with small Picard number
|
17 pages
| null | null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Extending work of M. Zarzar, we evaluate the potential of Goppa-type
evaluation codes constructed from linear systems on projective algebraic
surfaces with small Picard number. Putting this condition on the Picard number
provides some control over the numbers of irreducible components of curves on
the surface and hence over the minimum distance of the codes. We find that such
surfaces do not automatically produce good codes; the sectional genus of the
surface also has a major influence. Using that additional invariant, we derive
bounds on the minimum distance under the assumption that the hyperplane section
class generates the N\'eron-Severi group. We also give several examples of
codes from such surfaces with minimum distance better than the best known
bounds in Grassl's tables.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 16:36:36 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Little",
"John",
""
],
[
"Schenck",
"Hal",
""
]
] |
new_dataset
| 0.999366 |
1803.00532
|
Mohammad M. Aref
|
Arttu Hautakoski, Mohammad M. Aref, Jouni Mattila
|
Reconfigurable Manipulator Simulation for Robotics and Multimodal
Machine Learning Application: Aaria
|
preprint before submission to conference: 2018 IEEE International
Conference on Automation Science and Engineering , 7 pages
| null | null | null |
cs.RO
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
This paper represents a systematic way for generation of Aaria, a simulated
model for serial manipulators for the purpose of kinematic or dynamic analysis
with a vast variety of structures based on Simulink SimMechanics. The proposed
model can receive configuration parameters, for instance in accordance with
modified Denavit-Hartenberg convention, or trajectories for its base or joints
for structures with 1 to 6 degrees of freedom (DOF). The manipulator is
equipped with artificial joint sensors as well as simulated Inertial
Measurement Units (IMUs) on each link. The simulation output can be positions,
velocities, torques, in the joint space or IMU outputs; angular velocity,
linear acceleration, tool coordinates with respect to the inertial frame. This
simulation model is a source of a dataset for virtual multimodal sensory data
for automation of robot modeling and control designed for machine learning and
deep learning approaches based on big data.
|
[
{
"version": "v1",
"created": "Thu, 1 Mar 2018 17:57:13 GMT"
}
] | 2018-03-02T00:00:00 |
[
[
"Hautakoski",
"Arttu",
""
],
[
"Aref",
"Mohammad M.",
""
],
[
"Mattila",
"Jouni",
""
]
] |
new_dataset
| 0.998702 |
1708.00922
|
Siyuan Dong
|
Siyuan Dong, Wenzhen Yuan, Edward Adelson
|
Improved GelSight Tactile Sensor for Measuring Geometry and Slip
|
IEEE/RSJ International Conference on Intelligent Robots and Systems
| null |
10.1109/IROS.2017.8202149
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A GelSight sensor uses an elastomeric slab covered with a reflective membrane
to measure tactile signals. It measures the 3D geometry and contact force
information with high spacial resolution, and successfully helped many
challenging robot tasks. A previous sensor, based on a semi-specular membrane,
produces high resolution but with limited geometry accuracy. In this paper, we
describe a new design of GelSight for robot gripper, using a Lambertian
membrane and new illumination system, which gives greatly improved geometric
accuracy while retaining the compact size. We demonstrate its use in measuring
surface normals and reconstructing height maps using photometric stereo. We
also use it for the task of slip detection, using a combination of information
about relative motions on the membrane surface and the shear distortions. Using
a robotic arm and a set of 37 everyday objects with varied properties, we find
that the sensor can detect translational and rotational slip in general cases,
and can be used to improve the stability of the grasp.
|
[
{
"version": "v1",
"created": "Wed, 2 Aug 2017 20:32:17 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Dong",
"Siyuan",
""
],
[
"Yuan",
"Wenzhen",
""
],
[
"Adelson",
"Edward",
""
]
] |
new_dataset
| 0.987686 |
1710.01779
|
Alexander Panchenko
|
Alexander Panchenko, Eugen Ruppert, Stefano Faralli, Simone Paolo
Ponzetto, Chris Biemann
|
Building a Web-Scale Dependency-Parsed Corpus from CommonCrawl
|
In Proceedings of the 11th Conference on Language Resources and
Evaluation (LREC'2018). Miyazaki, Japan
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
We present DepCC, the largest-to-date linguistically analyzed corpus in
English including 365 million documents, composed of 252 billion tokens and 7.5
billion of named entity occurrences in 14.3 billion sentences from a web-scale
crawl of the \textsc{Common Crawl} project. The sentences are processed with a
dependency parser and with a named entity tagger and contain provenance
information, enabling various applications ranging from training syntax-based
word embeddings to open information extraction and question answering. We built
an index of all sentences and their linguistic meta-data enabling quick search
across the corpus. We demonstrate the utility of this corpus on the verb
similarity task by showing that a distributional model trained on our corpus
yields better results than models trained on smaller corpora, like Wikipedia.
This distributional model outperforms the state of art models of verb
similarity trained on smaller corpora on the SimVerb3500 dataset.
|
[
{
"version": "v1",
"created": "Wed, 4 Oct 2017 19:42:37 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Feb 2018 18:14:30 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Panchenko",
"Alexander",
""
],
[
"Ruppert",
"Eugen",
""
],
[
"Faralli",
"Stefano",
""
],
[
"Ponzetto",
"Simone Paolo",
""
],
[
"Biemann",
"Chris",
""
]
] |
new_dataset
| 0.99757 |
1711.11392
|
Reza Alijani
|
Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi, Kostas
Kollias, Kamesh Munagala
|
Two-sided Facility Location
| null | null | null | null |
cs.GT cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent years have witnessed the rise of many successful e-commerce
marketplace platforms like the Amazon marketplace, AirBnB, Uber/Lyft, and
Upwork, where a central platform mediates economic transactions between buyers
and sellers. Motivated by these platforms, we formulate a set of facility
location problems that we term Two-sided Facility location. In our model,
agents arrive at nodes in an underlying metric space, where the metric distance
between any buyer and seller captures the quality of the corresponding match.
The platform posts prices and wages at the nodes, and opens a set of facilities
to route the agents to. The agents at any facility are assumed to be matched.
The platform ensures high match quality by imposing a distance constraint
between a node and the facilities it is routed to. It ensures high service
availability by ensuring flow to the facility is at least a pre-specified lower
bound. Subject to these constraints, the goal of the platform is to maximize
the social surplus (or gains from trade) subject to weak budget balance, i.e.,
profit being non-negative.
We present an approximation algorithm for this problem that yields a $(1 +
\epsilon)$ approximation to surplus for any constant $\epsilon > 0$, while
relaxing the match quality (i.e., maximum distance of any match) by a constant
factor. We use an LP rounding framework that easily extends to other objectives
such as maximizing volume of trade or profit.
We justify our models by considering a dynamic marketplace setting where
agents arrive according to a stochastic process and have finite patience (or
deadlines) for being matched. We perform queueing analysis to show that for
policies that route agents to facilities and match them, ensuring a low
abandonment probability of agents reduces to ensuring sufficient flow arrives
at each facility.
|
[
{
"version": "v1",
"created": "Thu, 30 Nov 2017 13:48:40 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Feb 2018 22:09:10 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Alijani",
"Reza",
""
],
[
"Banerjee",
"Siddhartha",
""
],
[
"Gollapudi",
"Sreenivas",
""
],
[
"Kollias",
"Kostas",
""
],
[
"Munagala",
"Kamesh",
""
]
] |
new_dataset
| 0.998089 |
1801.02229
|
Stavros Toumpis
|
Riccardo Cavallari and Stavros Toumpis and Roberto Verdone and Ioannis
Kontoyiannis
|
Packet Speed and Cost in Mobile Wireless Delay-Tolerant Networks
|
Submitted to the IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mobile wireless delay-tolerant network (DTN) model is proposed and
analyzed, in which infinitely many nodes are initially placed on R^2 according
to a uniform Poisson point process (PPP) and subsequently travel, independently
of each other, along trajectories comprised of line segments, changing travel
direction at time instances that form a Poisson process, each time selecting a
new travel direction from an arbitrary distribution; all nodes maintain
constant speed. A single information packet is traveling towards a given
direction using both wireless transmissions and sojourns on node buffers,
according to a member of a broad class of possible routing rules. For this
model, we compute the long-term averages of the speed with which the packet
travels towards its destination and the rate with which the wireless
transmission cost accumulates. Because of the complexity of the problem, we
employ two intuitive, simplifying approximations; simulations verify that the
approximation error is typically small. Our results quantify the fundamental
trade-off that exists in mobile wireless DTNs between the packet speed and the
packet delivery cost. The framework developed here is both general and
versatile, and can be used as a starting point for further investigation.
|
[
{
"version": "v1",
"created": "Sun, 7 Jan 2018 18:49:35 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Feb 2018 17:39:50 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Cavallari",
"Riccardo",
""
],
[
"Toumpis",
"Stavros",
""
],
[
"Verdone",
"Roberto",
""
],
[
"Kontoyiannis",
"Ioannis",
""
]
] |
new_dataset
| 0.999273 |
1801.09510
|
Andrea Tassi
|
Ioannis Mavromatis, Andrea Tassi, Giovanni Rigazzi, Robert J.
Piechocki, Andrew Nix
|
Multi-Radio 5G Architecture for Connected and Autonomous Vehicles:
Application and Design Insights
|
Invited paper on EAI Transactions on Industrial Networks and
Intelligent Systems
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Connected and Autonomous Vehicles (CAVs) will play a crucial role in
next-generation Cooperative Intelligent Transportation Systems (C-ITSs). Not
only is the information exchange fundamental to improve road safety and
efficiency, but it also paves the way to a wide spectrum of advanced ITS
applications enhancing efficiency, mobility and accessibility. Highly dynamic
network topologies and unpredictable wireless channel conditions entail
numerous design challenges and open questions. In this paper, we address the
beneficial interactions between CAVs and an ITS and propose a novel
architecture design paradigm. Our solution can accommodate multi-layer
applications over multiple Radio Access Technologies (RATs) and provide a smart
configuration interface for enhancing the performance of each RAT.
|
[
{
"version": "v1",
"created": "Mon, 29 Jan 2018 14:04:14 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Feb 2018 22:15:27 GMT"
},
{
"version": "v3",
"created": "Wed, 28 Feb 2018 12:35:16 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Mavromatis",
"Ioannis",
""
],
[
"Tassi",
"Andrea",
""
],
[
"Rigazzi",
"Giovanni",
""
],
[
"Piechocki",
"Robert J.",
""
],
[
"Nix",
"Andrew",
""
]
] |
new_dataset
| 0.996241 |
1802.07370
|
Siddhartha Brahma
|
Siddhartha Brahma
|
SufiSent - Universal Sentence Representations Using Suffix Encodings
|
4 pages, Submitted to ICLR 2018 workshop
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computing universal distributed representations of sentences is a fundamental
task in natural language processing. We propose a method to learn such
representations by encoding the suffixes of word sequences in a sentence and
training on the Stanford Natural Language Inference (SNLI) dataset. We
demonstrate the effectiveness of our approach by evaluating it on the SentEval
benchmark, improving on existing approaches on several transfer tasks.
|
[
{
"version": "v1",
"created": "Tue, 20 Feb 2018 23:08:19 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Brahma",
"Siddhartha",
""
]
] |
new_dataset
| 0.999643 |
1802.09345
|
Jinsong Wu
|
Jinsong Wu, Song Guo, Huawei Huang, William Liu, Yong Xiang
|
Information and Communications Technologies for Sustainable Development
Goals: State-of-the-Art, Needs and Perspectives
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In September 2015, the United Nations General Assembly accepted the 2030
Development Agenda, which has included 92 paragraphs, and the Paragraph 91
defined 17 sustainable development goals (SDGs) and 169 associated targets. The
goal of this paper is to discover the correlations among SDGs and information
and communications technologies (ICTs). This paper discusses the roles and
opportunities that ICTs play in pursuing the SDGs. We identify a number of
research gaps to those three pillars, social, economic, and environmental
perspectives, of sustainable development. After extensive literature reviews on
the SDG-related research initiatives and activities, we find that the majority
of contributions to SDGs recognized by the IEEE and ACM research communities
have mainly focused on the technical aspects, while there are lack of the
holistic social good perspectives. Therefore, there are essential and urgent
needs to raise the awareness and call for attentions on how to innovate and
energize ICTs in order to best assist all nations to achieve the SDGs by 2030.
|
[
{
"version": "v1",
"created": "Mon, 19 Feb 2018 16:13:13 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Feb 2018 18:00:50 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Wu",
"Jinsong",
""
],
[
"Guo",
"Song",
""
],
[
"Huang",
"Huawei",
""
],
[
"Liu",
"William",
""
],
[
"Xiang",
"Yong",
""
]
] |
new_dataset
| 0.974915 |
1802.10135
|
Mansour Ahmadi
|
Royi Ronen and Marian Radu and Corina Feuerstein and Elad Yom-Tov and
Mansour Ahmadi
|
Microsoft Malware Classification Challenge
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Microsoft Malware Classification Challenge was announced in 2015 along
with a publication of a huge dataset of nearly 0.5 terabytes, consisting of
disassembly and bytecode of more than 20K malware samples. Apart from serving
in the Kaggle competition, the dataset has become a standard benchmark for
research on modeling malware behaviour. To date, the dataset has been cited in
more than 50 research papers. Here we provide a high-level comparison of the
publications citing the dataset. The comparison simplifies finding potential
research directions in this field and future performance evaluation of the
dataset.
|
[
{
"version": "v1",
"created": "Thu, 22 Feb 2018 12:27:38 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Ronen",
"Royi",
""
],
[
"Radu",
"Marian",
""
],
[
"Feuerstein",
"Corina",
""
],
[
"Yom-Tov",
"Elad",
""
],
[
"Ahmadi",
"Mansour",
""
]
] |
new_dataset
| 0.997913 |
1802.10162
|
Rafael Hurtado
|
Jorge Useche, Rafael Hurtado, Federico Demmer
|
Interplay between musical practices and tuning in the marimba de chonta
music
|
Total number of pages: 52, main manuscript: 18 pages, supplemental
material: 34 pages, the main manuscript contains 6 tables and 9 figures
| null | null | null |
cs.SD eess.AS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the Pacific Coast of Colombia there is a type of marimba called marimba de
chonta, which provides the melodic and harmonic contour for traditional music
with characteristic chants and dances. The tunings of this marimba are based on
the voice of female singers and allows musical practices, as a transposition
that preserves relative distances between bars. Here we show that traditional
tunings are consistent with isotonic scales, and that they have changed in the
last three decades due to the influence of Western music. Specifically, low
octaves have changed into just octaves. Additionally, consonance properties of
this instrument include the occurrence of a broad minimum of dissonance that is
used in the musical practices, while the narrow local peaks of dissonance are
avoided. We found that the main reason for this is the occurrence of
uncertainties in the tunings with respect to the mathematical successions of
isotonic scales. We conclude that in this music the emergence of tunings and
musical practices cannot be considered as separate issues. Consonance, timbre,
and musical practices are entangled.
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 21:03:37 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Useche",
"Jorge",
""
],
[
"Hurtado",
"Rafael",
""
],
[
"Demmer",
"Federico",
""
]
] |
new_dataset
| 0.992129 |
1802.10271
|
Jongmin Jeong
|
Jongmin Jeong, Tae Sung Yoon, Jin Bae Park
|
Multimodal Sensor-Based Semantic 3D Mapping for a Large-Scale
Environment
|
10 pages, 9 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Semantic 3D mapping is one of the most important fields in robotics, and has
been used in many applications, such as robot navigation, surveillance, and
virtual reality. In general, semantic 3D mapping is mainly composed of 3D
reconstruction and semantic segmentation. As these technologies evolve, there
has been great progress in semantic 3D mapping in recent years. Furthermore,
the number of robotic applications requiring semantic information in 3D mapping
to perform high-level tasks has increased, and many studies on semantic 3D
mapping have been published. Existing methods use a camera for both 3D
reconstruction and semantic segmentation. However, this is not suitable for
large-scale environments and has the disadvantage of high computational
complexity. To address this problem, we propose a multimodal sensor-based
semantic 3D mapping system using a 3D Lidar combined with a camera. In this
study, we build a 3D map by estimating odometry based on a global positioning
system (GPS) and an inertial measurement unit (IMU), and use the latest 2D
convolutional neural network (CNN) for semantic segmentation. To build a
semantic 3D map, we integrate the 3D map with semantic information by using
coordinate transformation and Bayes' update scheme. In order to improve the
semantic 3D map, we propose a 3D refinement process to correct wrongly
segmented voxels and remove traces of moving vehicles in the 3D map. Through
experiments on challenging sequences, we demonstrate that our method
outperforms state-of-the-art methods in terms of accuracy and intersection over
union (IoU). Thus, our method can be used for various applications that require
semantic information in 3D map.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 06:02:55 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Jeong",
"Jongmin",
""
],
[
"Yoon",
"Tae Sung",
""
],
[
"Park",
"Jin Bae",
""
]
] |
new_dataset
| 0.999073 |
1802.10371
|
Liang Liu
|
Liang Liu, Shuowen Zhang, Rui Zhang
|
CoMP in the Sky: UAV Placement and Movement Optimization for Multi-User
Communications
|
submitted for possible journal publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Driven by the recent advancement in unmanned aerial vehicle (UAV) technology,
this paper proposes a new wireless network architecture of \emph{coordinate
multipoint (CoMP) in the sky} to harness both the benefits of interference
mitigation via CoMP and high mobility of UAVs. Specifically, we consider uplink
communications in a multi-UAV enabled multi-user system, where each UAV
forwards its received signals from all ground users to a central processor (CP)
for joint decoding. Moreover, we consider the case where the users may move on
the ground, thus the UAVs need to adjust their locations in accordance with the
user locations over time to maximize the network throughput. Utilizing random
matrix theory, we first characterize in closed-form a set of approximated upper
and lower bounds of the user's achievable rate in each time episode under a
realistic line-of-sight (LoS) channel model with random phase, which are shown
very tight both analytically and numerically. UAV placement and movement over
different episodes are then optimized based on the derived bounds to maximize
the minimum of user average achievable rates over all episodes for both cases
of full information (of current and future episodes) and current information on
the user's movement. Interestingly, it is shown that the optimized location of
each UAV at any particular episode is the weighted average of the ground user
locations at the current episode as well as its own location at the previous
and/or next episode. Finally, simulation results are provided to validate and
compare the performance of the proposed UAV placement and movement designs
under different practical application scenarios.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 11:42:26 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Liu",
"Liang",
""
],
[
"Zhang",
"Shuowen",
""
],
[
"Zhang",
"Rui",
""
]
] |
new_dataset
| 0.956442 |
1802.10375
|
Pablo Chico De Guzman
|
Pablo Chico de Guzman, Felipe Gorostiaga, Cesar Sanchez
|
i2kit: A Tool for Immutable Infrastructure Deployments based on
Lightweight Virtual Machines specialized to run Containers
|
8 pages, 3 figures
| null | null | null |
cs.DC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Container technologies, like Docker, are becoming increasingly popular.
Containers provide exceptional developer experience because containers offer
lightweight isolation and ease of software distribution. Containers are also
widely used in production environments, where a different set of challenges
arise such as security, networking, service discovery and load balancing.
Container cluster management tools, such as Kubernetes, attempt to solve these
problems by introducing a new control layer with the container as the unit of
deployment. However, adding a new control layer is an extra configuration step
and an additional potential source of runtime errors. The virtual machine
technology offered by cloud providers is more mature and proven in terms of
security, networking, service discovery and load balancing. However, virtual
machines are heavier than containers for local development, are less flexible
for resource allocation, and suffer longer boot times. This paper presents an
alternative to containers that enjoy the best features of both approaches: (1)
the use of mature, proven cloud vendor technology; (2) no need for a new
control layer; and (3) as lightweight as containers. Our solution is i2kit, a
deployment tool based on the immutable infrastructure pattern, where the
virtual machine is the unit of deployment. The i2kit tool accepts a simplified
format of Kubernetes Deployment Manifests in order to reuse Kubernetes' most
successful principles, but it creates a lightweight virtual machine for each
Pod using Linuxkit. Linuxkit alleviates the drawback in size that using virtual
machines would otherwise entail, because the footprint of Linuxkit is
approximately 60MB. Finally, the attack surface of the system is reduced since
Linuxkit only installs the minimum set of OS dependencies to run containers,
and different Pods are isolated by hypervisor technology.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 11:51:21 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"de Guzman",
"Pablo Chico",
""
],
[
"Gorostiaga",
"Felipe",
""
],
[
"Sanchez",
"Cesar",
""
]
] |
new_dataset
| 0.998538 |
1802.10426
|
Hamed Alizadeh Ghazijahani
|
Hossein Nejati, Hamed Alizadeh Ghazijahani, Milad Abdollahzadeh, Tooba
Malekzadeh, Ngai-Man Cheung, Kheng Hock Lee, Lian Leng Low
|
Fine-grained wound tissue analysis using deep neural network
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tissue assessment for chronic wounds is the basis of wound grading and
selection of treatment approaches. While several image processing approaches
have been proposed for automatic wound tissue analysis, there has been a
shortcoming in these approaches for clinical practices. In particular,
seemingly, all previous approaches have assumed only 3 tissue types in the
chronic wounds, while these wounds commonly exhibit 7 distinct tissue types
that presence of each one changes the treatment procedure. In this paper, for
the first time, we investigate the classification of 7 wound issue types. We
work with wound professionals to build a new database of 7 types of wound
tissue. We propose to use pre-trained deep neural networks for feature
extraction and classification at the patch-level. We perform experiments to
demonstrate that our approach outperforms other state-of-the-art. We will make
our database publicly available to facilitate research in wound assessment.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 14:18:36 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Nejati",
"Hossein",
""
],
[
"Ghazijahani",
"Hamed Alizadeh",
""
],
[
"Abdollahzadeh",
"Milad",
""
],
[
"Malekzadeh",
"Tooba",
""
],
[
"Cheung",
"Ngai-Man",
""
],
[
"Lee",
"Kheng Hock",
""
],
[
"Low",
"Lian Leng",
""
]
] |
new_dataset
| 0.992937 |
1802.10438
|
Banu Kabakulak
|
Banu Kabakulak
|
Sensor and Sink Placement, Scheduling and Routing Algorithms for
Connected Coverage of Wireless Sensor Networks
|
30 pages, 1 figure, 7 tables
| null | null | null |
cs.NI eess.SP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A sensor is a small electronic device which has the ability to sense, compute
and communicate either with other sensors or directly with a base station
(sink). In a wireless sensor network (WSN), the sensors monitor a region and
transmit the collected data packets through routes to the sinks. In this study,
we propose a mixed--integer linear programming (MILP) model to maximize the
number of time periods that a WSN carries out the desired tasks with limited
energy and budget. Our sink and sensor placement, scheduling, routing with
connected coverage ($SPSRC$) model is the first in the literature that combines
the decisions for the locations of sinks and sensors, activity schedules of the
deployed sensors, and data flow routes from each active sensor to its assigned
sink for connected coverage of the network over a finite planning horizon. The
problem is NP--hard and difficult to solve even for small instances. Assuming
that the sink locations are known, we develop heuristics which construct a
feasible solution of the problem by gradually satisfying the constraints. Then,
we introduce search heuristics to determine the locations of the sinks to
maximize the network lifetime. Computational experiments reveal that our
heuristic methods can find near optimal solutions in an acceptable amount of
time compared to the commercial solver CPLEX 12.7.0.
|
[
{
"version": "v1",
"created": "Wed, 28 Feb 2018 14:43:30 GMT"
}
] | 2018-03-01T00:00:00 |
[
[
"Kabakulak",
"Banu",
""
]
] |
new_dataset
| 0.999159 |
1711.03694
|
Junting Zhang
|
Junting Zhang, Chen Liang, C.-C. Jay Kuo
|
A Fully Convolutional Tri-branch Network (FCTN) for Domain Adaptation
|
Accepted by ICASSP 2018
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
A domain adaptation method for urban scene segmentation is proposed in this
work. We develop a fully convolutional tri-branch network, where two branches
assign pseudo labels to images in the unlabeled target domain while the third
branch is trained with supervision based on images in the pseudo-labeled target
domain. The re-labeling and re-training processes alternate. With this design,
the tri-branch network learns target-specific discriminative representations
progressively and, as a result, the cross-domain capability of the segmenter
improves. We evaluate the proposed network on large-scale domain adaptation
experiments using both synthetic (GTA) and real (Cityscapes) images. It is
shown that our solution achieves the state-of-the-art performance and it
outperforms previous methods by a significant margin.
|
[
{
"version": "v1",
"created": "Fri, 10 Nov 2017 05:01:28 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Feb 2018 01:43:35 GMT"
}
] | 2018-02-28T00:00:00 |
[
[
"Zhang",
"Junting",
""
],
[
"Liang",
"Chen",
""
],
[
"Kuo",
"C. -C. Jay",
""
]
] |
new_dataset
| 0.962645 |
1802.09685
|
Khavee Agustus Botangen
|
Khavee Agustus Botangen, Shahper Vodanovich, Jian Yu
|
Preservation of Indigenous Culture among Indigenous Migrants through
Social Media: the Igorot Peoples
|
10 pages, in Proceedings of the 50th Hawaii International Conference
on System Sciences 2017
|
Botangen, K.A., Vodanovich, S. and Yu, J., 2017, January.
Preservation of Indigenous Culture among Indigenous Migrants through Social
Media: The Igorot Peoples. In Proceedings of the 50th Hawaii International
Conference on System Sciences
|
10.24251/HICSS.2017.278
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The value and relevance of indigenous knowledge towards sustainability of
human societies drives for its preservation. This work explored the use of
Facebook groups to promote indigenous knowledge among Igorot peoples in the
diaspora. The virtual communities help intensify the connection of Igorot
migrants to their traditional culture despite the challenges of assimilation to
a different society. A survey of posts on 20 Facebook groups identified and
classified the indigenous cultural elements conveyed through social media. A
subsequent survey of 56 Igorot migrants revealed that popular social media has
a significant role in the exchange, revitalization, practice, and learning of
indigenous culture; inciting an effective medium to leverage preservation
strategies.
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 02:13:45 GMT"
}
] | 2018-02-28T00:00:00 |
[
[
"Botangen",
"Khavee Agustus",
""
],
[
"Vodanovich",
"Shahper",
""
],
[
"Yu",
"Jian",
""
]
] |
new_dataset
| 0.997603 |
1802.09714
|
Feiyun Zhu
|
Feiyun Zhu, Jun Guo, Ruoyu Li, Junzhou Huang
|
Robust Actor-Critic Contextual Bandit for Mobile Health (mHealth)
Interventions
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the actor-critic contextual bandit for the mobile health
(mHealth) intervention. State-of-the-art decision-making algorithms generally
ignore the outliers in the dataset. In this paper, we propose a novel robust
contextual bandit method for the mHealth. It can achieve the conflicting goal
of reducing the influence of outliers while seeking for a similar solution
compared with the state-of-the-art contextual bandit methods on the datasets
without outliers. Such performance relies on two technologies: (1) the
capped-$\ell_{2}$ norm; (2) a reliable method to set the thresholding
hyper-parameter, which is inspired by one of the most fundamental techniques in
the statistics. Although the model is non-convex and non-differentiable, we
propose an effective reweighted algorithm and provide solid theoretical
analyses. We prove that the proposed algorithm can find sufficiently decreasing
points after each iteration and finally converges after a finite number of
iterations. Extensive experiment results on two datasets demonstrate that our
method can achieve almost identical results compared with state-of-the-art
contextual bandit methods on the dataset without outliers, and significantly
outperform those state-of-the-art methods on the badly noised dataset with
outliers in a variety of parameter settings.
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 04:23:00 GMT"
}
] | 2018-02-28T00:00:00 |
[
[
"Zhu",
"Feiyun",
""
],
[
"Guo",
"Jun",
""
],
[
"Li",
"Ruoyu",
""
],
[
"Huang",
"Junzhou",
""
]
] |
new_dataset
| 0.987801 |
1802.09737
|
EPTCS
|
Bob Coecke, Aleks Kissinger
|
Proceedings 14th International Conference on Quantum Physics and Logic
| null |
EPTCS 266, 2018
|
10.4204/EPTCS.266
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the proceedings of the 14th International Conference on
Quantum Physics and Logic (QPL 2017), which was held July 3-7, 2017 at the LUX
Cinema Nijmegen, the Netherlands, and was hosted by Radboud University. QPL is
a conference that brings together researchers working on mathematical
foundations of quantum physics, quantum computing, and related areas, with a
focus on structural perspectives and the use of logical tools, ordered
algebraic and category-theoretic structures, formal languages, semantical
methods, and other computer science techniques applied to the study of physical
behaviour in general. This conference also welcomes work that applies
structures and methods inspired by quantum theory to other fields (including
computer science).
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 06:25:29 GMT"
}
] | 2018-02-28T00:00:00 |
[
[
"Coecke",
"Bob",
""
],
[
"Kissinger",
"Aleks",
""
]
] |
new_dataset
| 0.999114 |
1802.09795
|
Giulia Cervia
|
Giulia Cervia, Laura Luzzi, Ma\"el Le Treust and Matthieu R. Bloch
|
Polar codes for empirical coordination over noisy channels with strictly
causal encoding
|
4 pages, 1 figure, conference paper presented at XXVI\`eme colloque
GRETSI (2017)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a coding scheme based on polar codes for empirical
coordination of autonomous devices. We consider a two-node network with a noisy
link in which the input and output signals have to be coordinated with the
source and the reconstruction. In the case of strictly causal encoding, we show
that polar codes achieve the empirical coordination region, provided that a
vanishing rate of common randomness is available.
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 09:50:13 GMT"
}
] | 2018-02-28T00:00:00 |
[
[
"Cervia",
"Giulia",
""
],
[
"Luzzi",
"Laura",
""
],
[
"Treust",
"Maël Le",
""
],
[
"Bloch",
"Matthieu R.",
""
]
] |
new_dataset
| 0.997609 |
1802.09860
|
Chen Yang
|
Chen Yang, Haohong Wang
|
CCP: Conflicts Check Protocol for Bitcoin Block Security
|
An earlier version appeared at 2018 IEEE ICNC Workshop on Computing,
Networking and Communications (with aditional appendix)
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we present our early stage results on a Conflicts Check
Protocol (CCP) that enables preventing potential attacks on bitcoin system.
Based on the observation and discovery of a common symptom that many attacks
may generate, CCP refines the current bitcoin systems by proposing a novel
arbitration mechanism that is capable to determine the approval or abandon of
certain transactions involved in confliction. This work examines the security
issue of bitcoin from a new perspective, which may extend to a larger scope of
attack analysis and prevention
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 12:59:35 GMT"
}
] | 2018-02-28T00:00:00 |
[
[
"Yang",
"Chen",
""
],
[
"Wang",
"Haohong",
""
]
] |
new_dataset
| 0.999369 |
1802.09919
|
Minjia Shi
|
Minjia Shi, Liqin Qian, Patrick Sole
|
Linear codes with few weights over $\mathbb{F}_2+u\mathbb{F}_2$
|
14 pages, need help in page 12. arXiv admin note: text overlap with
arXiv:1612.00966
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we construct an infinite family of five-weight codes from
trace codes over the ring $R=\mathbb{F}_2+u\mathbb{F}_2$, where $u^2=0.$ The
trace codes have the algebraic structure of abelian codes. Their Lee weight is
computed by using character sums. Combined with Pless power moments and
Newton's Identities, the weight distribution of the Gray image of trace codes
was present. Their support structure is determined. An application to secret
sharing schemes is given.
|
[
{
"version": "v1",
"created": "Sat, 24 Feb 2018 12:04:13 GMT"
}
] | 2018-02-28T00:00:00 |
[
[
"Shi",
"Minjia",
""
],
[
"Qian",
"Liqin",
""
],
[
"Sole",
"Patrick",
""
]
] |
new_dataset
| 0.999557 |
1802.10019
|
Hee Seok Lee
|
Hee Seok Lee and Kang Kim
|
Simultaneous Traffic Sign Detection and Boundary Estimation using
Convolutional Neural Network
|
Accepted for publication in IEEE Transactions on Intelligent
Transportation Systems
| null |
10.1109/TITS.2018.2801560
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel traffic sign detection system that simultaneously
estimates the location and precise boundary of traffic signs using
convolutional neural network (CNN). Estimating the precise boundary of traffic
signs is important in navigation systems for intelligent vehicles where traffic
signs can be used as 3D landmarks for road environment. Previous traffic sign
detection systems, including recent methods based on CNN, only provide bounding
boxes of traffic signs as output, and thus requires additional processes such
as contour estimation or image segmentation to obtain the precise sign
boundary. In this work, the boundary estimation of traffic signs is formulated
as a 2D pose and shape class prediction problem, and this is effectively solved
by a single CNN. With the predicted 2D pose and the shape class of a target
traffic sign in an input image, we estimate the actual boundary of the target
sign by projecting the boundary of a corresponding template sign image into the
input image plane. By formulating the boundary estimation problem as a
CNN-based pose and shape prediction task, our method is end-to-end trainable,
and more robust to occlusion and small targets than other boundary estimation
methods that rely on contour estimation or image segmentation. The proposed
method with architectural optimization provides an accurate traffic sign
boundary estimation which is also efficient in compute, showing a detection
frame rate higher than 7 frames per second on low-power mobile platforms.
|
[
{
"version": "v1",
"created": "Tue, 27 Feb 2018 16:51:04 GMT"
}
] | 2018-02-28T00:00:00 |
[
[
"Lee",
"Hee Seok",
""
],
[
"Kim",
"Kang",
""
]
] |
new_dataset
| 0.993812 |
1610.02516
|
Ren Yang
|
Ren Yang, Mai Xu, Zulin Wang, Yiping Duan, Xiaoming Tao
|
Saliency-Guided Complexity Control for HEVC Decoding
|
IEEE Transactions on Broadcasting
| null |
10.1109/TBC.2018.2795459
| null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The latest High Efficiency Video Coding (HEVC) standard significantly
improves coding efficiency over its previous video coding standards. The
expense of such improvement is enormous computational complexity, from both
encoding and decoding sides. Since computational capability and power capacity
are diverse across portable devices, it is necessary to reduce decoding
complexity to a target with tolerable quality loss, so called complexity
control. This paper proposes a Saliency-Guided Complexity Control (SGCC)
approach for HEVC decoding, which reduces the decoding complexity to the target
with minimal perceptual quality loss. First, we establish the SGCC formulation
to minimize perceptual quality loss at the constraint on reduced decoding
complexity, which is achieved via disabling Deblocking Filter (DF) and
simplifying Motion Compensation (MC) of some non-salient Coding Tree Units
(CTUs). One important component in this formulation is the modelled
relationship between decoding complexity reduction and DF disabling/MC
simplification, which determines the control accuracy of our approach. Another
component is the modelled relationship between quality loss and DF disabling/MC
simplification, responsible for optimizing perceptual quality. By solving the
SGCC formulation for a given target complexity, we can obtain the DF and MC
settings of each CTU, and then decoding complexity can be reduced to the
target. Finally, the experimental results validate the effectiveness of our
SGCC approach, from the aspects of control performance, complexity-distortion
performance, fluctuation of quality loss and subjective quality.
|
[
{
"version": "v1",
"created": "Sat, 8 Oct 2016 12:09:38 GMT"
},
{
"version": "v2",
"created": "Wed, 18 Jan 2017 15:42:24 GMT"
},
{
"version": "v3",
"created": "Tue, 4 Apr 2017 02:34:44 GMT"
},
{
"version": "v4",
"created": "Thu, 10 Aug 2017 01:15:55 GMT"
},
{
"version": "v5",
"created": "Tue, 9 Jan 2018 12:15:59 GMT"
}
] | 2018-02-27T00:00:00 |
[
[
"Yang",
"Ren",
""
],
[
"Xu",
"Mai",
""
],
[
"Wang",
"Zulin",
""
],
[
"Duan",
"Yiping",
""
],
[
"Tao",
"Xiaoming",
""
]
] |
new_dataset
| 0.987647 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.