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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1612.06345
|
Mohammed Eltayeb
|
Mohammed E. Eltayeb, Tareq Y. Al-Naffouri, and Robert W. Heath Jr
|
Compressive Sensing for Millimeter Wave Antenna Array Diagnosis
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The radiation pattern of an antenna array depends on the excitation weights
and the geometry of the array. Due to wind and atmospheric conditions, outdoor
millimeter wave antenna elements are subject to full or partial blockages from
a plethora of particles like dirt, salt, ice, and water droplets. Handheld
devices are also subject to blockages from random finger placement and/or
finger prints. These blockages cause absorption and scattering to the signal
incident on the array, and change the array geometry. This distorts the
far-field radiation pattern of the array leading to an increase in the sidelobe
level and decrease in gain. This paper studies the effects of blockages on the
far-field radiation pattern of linear arrays and proposes two array diagnosis
techniques for millimeter wave antenna arrays. The proposed techniques jointly
estimate the locations of the blocked antennas and the induced attenuation and
phase shifts. Numerical results show that the proposed techniques provide
satisfactory results in terms of fault detection with reduced number of
measurements (diagnosis time) provided that the number of blockages is small
compared to the array size.
|
[
{
"version": "v1",
"created": "Mon, 19 Dec 2016 20:46:40 GMT"
},
{
"version": "v2",
"created": "Tue, 25 Apr 2017 08:48:27 GMT"
},
{
"version": "v3",
"created": "Fri, 30 Jun 2017 02:45:11 GMT"
},
{
"version": "v4",
"created": "Mon, 9 Oct 2017 14:59:48 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Eltayeb",
"Mohammed E.",
""
],
[
"Al-Naffouri",
"Tareq Y.",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.999788 |
1706.00800
|
Vincent Neiger
|
Elise Barelli, Peter Beelen, Mrinmoy Datta, Vincent Neiger, Johan
Rosenkilde
|
Two-Point Codes for the Generalized GK curve
|
13 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We improve previously known lower bounds for the minimum distance of certain
two-point AG codes constructed using a Generalized Giulietti-Korchmaros curve
(GGK). Castellanos and Tizziotti recently described such bounds for two-point
codes coming from the Giulietti-Korchmaros curve (GK). Our results completely
cover and in many cases improve on their results, using different techniques,
while also supporting any GGK curve. Our method builds on the order bound for
AG codes: to enable this, we study certain Weierstrass semigroups. This allows
an efficient algorithm for computing our improved bounds. We find several new
improvements upon the MinT minimum distance tables.
|
[
{
"version": "v1",
"created": "Fri, 2 Jun 2017 18:25:22 GMT"
},
{
"version": "v2",
"created": "Sat, 7 Oct 2017 15:17:31 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Barelli",
"Elise",
""
],
[
"Beelen",
"Peter",
""
],
[
"Datta",
"Mrinmoy",
""
],
[
"Neiger",
"Vincent",
""
],
[
"Rosenkilde",
"Johan",
""
]
] |
new_dataset
| 0.998522 |
1708.09658
|
Micha{\l} Skrzypczak
|
Micha{\l} Skrzypczak
|
B\"uchi VASS recognise w-languages that are Sigma^1_1 - complete
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This short note exhibits an example of a Sigma^1_1-complete language that can
be recognised by a one blind counter B\"uchi automaton (or equivalently a
B\"uchi VASS with only one place).
|
[
{
"version": "v1",
"created": "Thu, 31 Aug 2017 10:39:04 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Oct 2017 16:09:22 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Skrzypczak",
"Michał",
""
]
] |
new_dataset
| 0.994564 |
1709.10278
|
Omer Ben Porat
|
Omer Ben-Porat, Moshe Tennenholtz
|
Shapley Facility Location Games
|
To appear in WINE 2017: The 13th Conference on Web and Internet
Economics
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Facility location games have been a topic of major interest in economics,
operations research and computer science, starting from the seminal work by
Hotelling. Spatial facility location models have successfully predicted the
outcome of competition in a variety of scenarios. In a typical facility
location game, users/customers/voters are mapped to a metric space representing
their preferences, and each player picks a point (facility) in that space. In
most facility location games considered in the literature, users are assumed to
act deterministically: given the facilities chosen by the players, users are
attracted to their nearest facility. This paper introduces facility location
games with probabilistic attraction, dubbed Shapley facility location games,
due to a surprising connection to the Shapley value. The specific attraction
function we adopt in this model is aligned with the recent findings of the
behavioral economics literature on choice prediction. Given this model, our
first main result is that Shapley facility location games are potential games;
hence, they possess pure Nash equilibrium. Moreover, the latter is true for any
compact user space, any user distribution over that space, and any number of
players. Note that this is in sharp contrast to Hotelling facility location
games. In our second main result we show that under the assumption that players
can compute an approximate best response, approximate equilibrium profiles can
be learned efficiently by the players via dynamics. Our third main result is a
bound on the Price of Anarchy of this class of games, as well as showing the
bound is tight. Ultimately, we show that player payoffs coincide with their
Shapley value in a coalition game, where coalition gains are the social welfare
of the users.
|
[
{
"version": "v1",
"created": "Fri, 29 Sep 2017 08:17:39 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Oct 2017 16:32:18 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Ben-Porat",
"Omer",
""
],
[
"Tennenholtz",
"Moshe",
""
]
] |
new_dataset
| 0.998145 |
1710.02566
|
Kaustubha Mendhurwar
|
Kaustubha Mendhurwar, Qing Gu, Vladimir de la Cruz, Sudhir Mudur, and
Tiberiu Popa
|
CAMREP- Concordia Action and Motion Repository
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Action recognition, motion classification, gait analysis and synthesis are
fundamental problems in a number of fields such as computer graphics,
bio-mechanics and human computer interaction that generate a large body of
research. This type of data is complex because it is inherently
multidimensional and has multiple modalities such as video, motion capture
data, accelerometer data, etc. While some of this data, such as monocular video
are easy to acquire, others are much more difficult and expensive such as
motion capture data or multi-view video. This creates a large barrier of entry
in the research community for data driven research. We have embarked on
creating a new large repository of motion and action data (CAMREP) consisting
of several motion and action databases. What makes this database unique is that
we use a variety of modalities, enabling multi-modal analysis. Presently, the
size of datasets varies with some having a large number of subjects while
others having smaller numbers. We have also acquired long capture sequences in
a number of cases, making some datasets rather large.
|
[
{
"version": "v1",
"created": "Fri, 6 Oct 2017 19:42:13 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Mendhurwar",
"Kaustubha",
""
],
[
"Gu",
"Qing",
""
],
[
"de la Cruz",
"Vladimir",
""
],
[
"Mudur",
"Sudhir",
""
],
[
"Popa",
"Tiberiu",
""
]
] |
new_dataset
| 0.997258 |
1710.02599
|
Pulkit Budhiraja
|
Pulkit Budhiraja, Mark Roman Miller, Abhishek K Modi, David Forsyth
|
Rotation Blurring: Use of Artificial Blurring to Reduce Cybersickness in
Virtual Reality First Person Shooters
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Users of Virtual Reality (VR) systems often experience vection, the
perception of self-motion in the absence of any physical movement. While
vection helps to improve presence in VR, it often leads to a form of motion
sickness called cybersickness. Cybersickness is a major deterrent to large
scale adoption of VR.
Prior work has discovered that changing vection (changing the perceived speed
or moving direction) causes more severe cybersickness than steady vection
(walking at a constant speed or in a constant direction). Based on this idea,
we try to reduce the cybersickness caused by character movements in a First
Person Shooter (FPS) game in VR. We propose Rotation Blurring (RB), uniformly
blurring the screen during rotational movements to reduce cybersickness. We
performed a user study to evaluate the impact of RB in reducing cybersickness.
We found that the blurring technique led to an overall reduction in sickness
levels of the participants and delayed its onset. Participants who experienced
acute levels of cybersickness benefited significantly from this technique.
|
[
{
"version": "v1",
"created": "Fri, 6 Oct 2017 22:02:00 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Budhiraja",
"Pulkit",
""
],
[
"Miller",
"Mark Roman",
""
],
[
"Modi",
"Abhishek K",
""
],
[
"Forsyth",
"David",
""
]
] |
new_dataset
| 0.98454 |
1710.02722
|
Wiktor Daszczuk
|
Wiktor B. Daszczuk, Maciej Bielecki, Jan Michalski
|
Rybu: Imperative-style Preprocessor for Verification of Distributed
Systems in the Dedan Environment
|
16 pages, 1 figure
|
KKIO 2017 - Software Engineering Conference, Rzesz\'ow, Poland,
14-16 Sept 2017, Software Engineering Research for the Practice, Polish
Information Processing Society, pp. 135-150
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Integrated Model of Distributed Systems (IMDS) is developed for specification
and verification of distributed systems, and verification against deadlocks. On
the basis of IMDS, Dedan verification environment was prepared. Universal
deadlock detection formulas allow for automatic verification, without any
knowledge of a temporal logic, which simplifies the verification process.
However, the input language, following the rules of IMDS, seems to be exotic
for many users. For this reason Rybu preprocessor was created. Its purpose is
to build large models in imperative-style language, on much higher abstraction
level.
|
[
{
"version": "v1",
"created": "Sat, 7 Oct 2017 18:57:50 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Daszczuk",
"Wiktor B.",
""
],
[
"Bielecki",
"Maciej",
""
],
[
"Michalski",
"Jan",
""
]
] |
new_dataset
| 0.99667 |
1710.02763
|
Eduardo Seiti De Oliveira
|
Eduardo Oliveira, Jomara Bind\'a, Renato Lopes, Eduardo Valle
|
Paperclickers: Affordable Solution for Classroom Response Systems
|
12 pages, 13 figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a low-cost classroom response system requiring a single mobile
device for the teacher and cards with printed codes for the students. We aim at
broadening the adoption of active learning techniques in developing countries,
offering a tool for easy implementation. We embody the solution as a smartphone
application, describing the development history, pitfalls, and lessons learned
that might be helpful for other small academic teams. We also described the
results of the first round usability tests we performed on the first prototype,
and how the affected the current version of the software. A beta release
version is currently available for the public at large.
|
[
{
"version": "v1",
"created": "Sun, 8 Oct 2017 01:00:51 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Oliveira",
"Eduardo",
""
],
[
"Bindá",
"Jomara",
""
],
[
"Lopes",
"Renato",
""
],
[
"Valle",
"Eduardo",
""
]
] |
new_dataset
| 0.981437 |
1710.02932
|
Haresh Karnan
|
Haresh Karnan, Aritra Biswas, Pranav Vaidik Dhulipala, Jan Dufek and
Robin Murphy
|
Visual Servoing of Unmanned Surface Vehicle from Small Tethered Unmanned
Aerial Vehicle
|
6 pages, 13 images
| null | null | null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an algorithm and the implementation of a motor schema to
aid the visual localization subsystem of the ongoing EMILY project at Texas A
and M University. The EMILY project aims to team an Unmanned Surface Vehicle
(USV) with an Unmanned Aerial Vehicle (UAV) to augment the search and rescue of
marine casualties during an emergency response phase. The USV is designed to
serve as a flotation device once it reaches the victims. A live video feed from
the UAV is provided to the casuality responders giving them a visual estimate
of the USVs orientation and position to help with its navigation. One of the
challenges involved with casualty response using a USV UAV team is to
simultaneously control the USV and track it. In this paper, we present an
implemented solution to automate the UAV camera movements to keep the USV in
view at all times. The motor schema proposed, uses the USVs coordinates from
the visual localization subsystem to control the UAVs camera movements and
track the USV with minimal camera movements such that the USV is always in the
cameras field of view.
|
[
{
"version": "v1",
"created": "Mon, 9 Oct 2017 04:14:05 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Karnan",
"Haresh",
""
],
[
"Biswas",
"Aritra",
""
],
[
"Dhulipala",
"Pranav Vaidik",
""
],
[
"Dufek",
"Jan",
""
],
[
"Murphy",
"Robin",
""
]
] |
new_dataset
| 0.998505 |
1710.02934
|
Yuke Li
|
Yuke Li, A. Stephen Morse, Ji Liu, and Tamer Ba\c{s}ar
|
Countries' Survival in Networked International Environments
|
a shorter version will appear in Proceedings of IEEE conference on
Decision and Control 2017
| null | null | null |
cs.SI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper applies a recently developed power allocation game in Li and Morse
(2017) to study the countries' survival problem in networked international
environments. In the game, countries strategically allocate their power to
support the survival of themselves and their friends and to oppose that of
their foes, where by a country's survival is meant when the country's total
support equals or exceeds its total threats. This paper establishes conditions
that characterize different types of networked international environments in
which a country may survive, such as when all the antagonism among countries
makes up a complete or bipartite graph.
|
[
{
"version": "v1",
"created": "Mon, 9 Oct 2017 04:27:35 GMT"
}
] | 2017-10-10T00:00:00 |
[
[
"Li",
"Yuke",
""
],
[
"Morse",
"A. Stephen",
""
],
[
"Liu",
"Ji",
""
],
[
"Başar",
"Tamer",
""
]
] |
new_dataset
| 0.964825 |
1701.04679
|
Evangelos Pournaras
|
Evangelos Pournaras, Mark Yao, Dirk Helbing
|
Self-regulating Supply-Demand Systems
| null | null |
10.1016/j.future.2017.05.018
| null |
cs.SY cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Supply-demand systems in Smart City sectors such as energy, transportation,
telecommunication, are subject of unprecedented technological transformations
by the Internet of Things. Usually, supply-demand systems involve actors that
produce and consume resources, e.g. energy, and they are regulated such that
supply meets demand, or demand meets available supply. Mismatches of supply and
demand may increase operational costs, can cause catastrophic damage in
infrastructure, for instance power blackouts, and may even lead to social
unrest and security threats. Long-term, operationally offline and top-down
regulatory decision-making by governmental officers, policy makers or system
operators may turn out to be ineffective for matching supply-demand under new
dynamics and opportunities that Internet of Things technologies bring to
supply-demand systems, for instance, interactive cyber-physical systems and
software agents running locally in physical assets to monitor and apply
automated control actions in real-time. e.g. power flow redistributions by
smart transformers to improve the Smart Grid reliability. Existing work on
online regulatory mechanisms of matching supply-demand either focuses on
game-theoretic solutions with assumptions that cannot be easily met in
real-world systems or assume centralized management entities and local access
to global information. This paper contributes a generic decentralized
self-regulatory framework, which, in contrast to related work, is shaped around
standardized control system concepts and Internet of Things technologies for an
easier adoption and applicability. The framework involves a decentralized
combinatorial optimization mechanism that matches supply-demand under different
regulatory scenarios.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 16:53:12 GMT"
},
{
"version": "v2",
"created": "Sun, 9 Apr 2017 21:56:05 GMT"
}
] | 2017-10-09T00:00:00 |
[
[
"Pournaras",
"Evangelos",
""
],
[
"Yao",
"Mark",
""
],
[
"Helbing",
"Dirk",
""
]
] |
new_dataset
| 0.990617 |
1709.01634
|
J. Michael Herrmann
|
J. Michael Herrmann
|
The Voynich Manuscript is Written in Natural Language: The Pahlavi
Hypothesis
|
23 pages, 15 figures, 4 tables. Second version: one reference added,
duplicate text removed from introduction
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The late medieval Voynich Manuscript (VM) has resisted decryption and was
considered a meaningless hoax or an unsolvable cipher. Here, we provide
evidence that the VM is written in natural language by establishing a relation
of the Voynich alphabet and the Iranian Pahlavi script. Many of the Voynich
characters are upside-down versions of their Pahlavi counterparts, which may be
an effect of different writing directions. Other Voynich letters can be
explained as ligatures or departures from Pahlavi with the intent to cope with
known problems due to the stupendous ambiguity of Pahlavi text. While a
translation of the VM text is not attempted here, we can confirm the
Voynich-Pahlavi relation at the character level by the transcription of many
words from the VM illustrations and from parts of the main text. Many of the
transcribed words can be identified as terms from Zoroastrian cosmology which
is in line with the use of Pahlavi script in Zoroastrian communities from
medieval times.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2017 00:15:37 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Oct 2017 16:52:11 GMT"
}
] | 2017-10-09T00:00:00 |
[
[
"Herrmann",
"J. Michael",
""
]
] |
new_dataset
| 0.999646 |
1710.01458
|
Zhixian Lei
|
Zhixian Lei, Yueqi Sheng
|
Sum of Square Proof for Brascamp-Lieb Type Inequality
| null | null | null | null |
cs.CC math.CA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brascamp-Lieb inequality is an important mathematical tool in analysis,
geometry and information theory. There are various ways to prove Brascamp-Lieb
inequality such as heat flow method, Brownian motion and subadditivity of the
entropy. While Brascamp-Lieb inequality is originally stated in Euclidean
Space, discussed Brascamp-Lieb inequality for discrete Abelian group and
discussed Brascamp-Lieb inequality for Markov semigroups.
Many mathematical inequalities can be formulated as algebraic inequalities
which asserts some given polynomial is nonnegative. In 1927, Artin proved that
any non- negative polynomial can be represented as a sum of squares of rational
functions, which can be further formulated as a polynomial certificate of the
nonnegativity of the polynomial. This is a Sum of Square proof of the
inequality. Take the degree of the polynomial certificate as the degree of Sum
of Square proof. The degree of an Sum of Square proof determines the complexity
of generating such proof by Sum of Square algorithm which is a powerful tool
for optimization and computer aided proof.
In this paper, we give a Sum of Square proof for some special settings of
Brascamp- Lieb inequality following and and discuss some applications of
Brascamp-Lieb inequality on Abelian group and Euclidean Sphere. If the original
description of the inequality has constant degree and d is constant, the degree
of the proof is also constant. Therefore, low degree sum of square algorithm
can fully capture the power of low degree finite Brascamp-Lieb inequality.
|
[
{
"version": "v1",
"created": "Wed, 4 Oct 2017 04:46:05 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Oct 2017 22:28:34 GMT"
}
] | 2017-10-09T00:00:00 |
[
[
"Lei",
"Zhixian",
""
],
[
"Sheng",
"Yueqi",
""
]
] |
new_dataset
| 0.967984 |
1710.01928
|
Maheswara Rao Valluri
|
Maheswara Rao Valluri
|
NTRUCipher-Lattice Based Secret Key Encryption
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
NTRU cryptosystem has allowed designing a range of cryptographic schemes due
to its flexibility and efficiency. Although NTRU cryptosystem was introduced
nearly two decades ago, it has not yet received any attention like designing a
secret key encryption. In this paper, we propose a secret key encryption over
NTRU lattices, named as NTRUCipher. This NTRUCipher is designed using
modification of the NTRU public key encryption. We analyze this cipher
efficiency and the space complexity with respect to security aspects, and also
show that the NTRUCipher is secured under the indistinguishability chosen
plaintext attack.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 09:13:47 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Oct 2017 00:50:34 GMT"
}
] | 2017-10-09T00:00:00 |
[
[
"Valluri",
"Maheswara Rao",
""
]
] |
new_dataset
| 0.999104 |
1710.02086
|
Sreelekha S
|
Sreelekha S, Pushpak Bhattacharyya
|
Indowordnets help in Indian Language Machine Translation
|
4 pages with 3 tables submitted to LREC 2018
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Being less resource languages, Indian-Indian and English-Indian language MT
system developments faces the difficulty to translate various lexical
phenomena. In this paper, we present our work on a comparative study of 440
phrase-based statistical trained models for 110 language pairs across 11 Indian
languages. We have developed 110 baseline Statistical Machine Translation
systems. Then we have augmented the training corpus with Indowordnet synset
word entries of lexical database and further trained 110 models on top of the
baseline system. We have done a detailed performance comparison using various
evaluation metrics such as BLEU score, METEOR and TER. We observed significant
improvement in evaluations of translation quality across all the 440 models
after using the Indowordnet. These experiments give a detailed insight in two
ways : (1) usage of lexical database with synset mapping for resource poor
languages (2) efficient usage of Indowordnet sysnset mapping. More over, synset
mapped lexical entries helped the SMT system to handle the ambiguity to a great
extent during the translation.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 16:03:42 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Oct 2017 04:15:38 GMT"
}
] | 2017-10-09T00:00:00 |
[
[
"S",
"Sreelekha",
""
],
[
"Bhattacharyya",
"Pushpak",
""
]
] |
new_dataset
| 0.988102 |
1710.02280
|
Yifei Teng
|
Yifei Teng, An Zhao, Camille Goudeseune
|
Generating Nontrivial Melodies for Music as a Service
|
ISMIR 2017 Conference
| null | null | null |
cs.SD cs.AI eess.AS
|
http://creativecommons.org/licenses/by/4.0/
|
We present a hybrid neural network and rule-based system that generates pop
music. Music produced by pure rule-based systems often sounds mechanical. Music
produced by machine learning sounds better, but still lacks hierarchical
temporal structure. We restore temporal hierarchy by augmenting machine
learning with a temporal production grammar, which generates the music's
overall structure and chord progressions. A compatible melody is then generated
by a conditional variational recurrent autoencoder. The autoencoder is trained
with eight-measure segments from a corpus of 10,000 MIDI files, each of which
has had its melody track and chord progressions identified heuristically. The
autoencoder maps melody into a multi-dimensional feature space, conditioned by
the underlying chord progression. A melody is then generated by feeding a
random sample from that space to the autoencoder's decoder, along with the
chord progression generated by the grammar. The autoencoder can make musically
plausible variations on an existing melody, suitable for recurring motifs. It
can also reharmonize a melody to a new chord progression, keeping the rhythm
and contour. The generated music compares favorably with that generated by
other academic and commercial software designed for the music-as-a-service
industry.
|
[
{
"version": "v1",
"created": "Fri, 6 Oct 2017 05:53:20 GMT"
}
] | 2017-10-09T00:00:00 |
[
[
"Teng",
"Yifei",
""
],
[
"Zhao",
"An",
""
],
[
"Goudeseune",
"Camille",
""
]
] |
new_dataset
| 0.991836 |
1710.02316
|
Jean Stawiaski
|
Jean Stawiaski
|
A Multiscale Patch Based Convolutional Network for Brain Tumor
Segmentation
| null | null | null | null |
cs.CV q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents a multiscale patch based convolutional neural network
for the automatic segmentation of brain tumors in multi-modality 3D MR images.
We use multiscale deep supervision and inputs to train a convolutional network.
We evaluate the effectiveness of the proposed approach on the BRATS 2017
segmentation challenge where we obtained dice scores of 0.755, 0.900, 0.782 and
95% Hausdorff distance of 3.63mm, 4.10mm, and 6.81mm for enhanced tumor core,
whole tumor and tumor core respectively.
|
[
{
"version": "v1",
"created": "Fri, 6 Oct 2017 09:04:28 GMT"
}
] | 2017-10-09T00:00:00 |
[
[
"Stawiaski",
"Jean",
""
]
] |
new_dataset
| 0.99566 |
1710.02382
|
Zeeshan Kaleem
|
Zeeshan Kaleem and Mubashir Husain Rehmani
|
Amateur Drone Monitoring: State-of-the-Art Architectures, Key Enabling
Technologies, and Future Research Directions
|
arXiv admin note: text overlap with arXiv:1510.07390 by other authors
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The unmanned air-vehicle (UAV) or mini-drones equipped with sensors are
becoming increasingly popular for various commercial, industrial, and
public-safety applications. However, drones with uncontrolled deployment poses
challenges for highly security-sensitive areas such as President house, nuclear
plants, and commercial areas because they can be used unlawfully. In this
article, to cope with security-sensitive challenges, we propose point-to-point
and flying ad-hoc network (FANET) architectures to assist the efficient
deployment of monitoring drones (MDr). To capture amateur drone (ADr), MDr must
have the capability to efficiently and timely detect, track, jam, and hunt the
ADr. We discuss the capabilities of the existing detection, tracking,
localization, and routing schemes and also present the limitations in these
schemes as further research challenges. Moreover, the future challenges related
to co-channel interference, channel model design, and cooperative schemes are
discussed. Our findings indicate that MDr deployment is necessary for caring of
ADr, and intensive research and development is required to fill the gaps in the
existing technologies.
|
[
{
"version": "v1",
"created": "Sun, 17 Sep 2017 11:03:57 GMT"
}
] | 2017-10-09T00:00:00 |
[
[
"Kaleem",
"Zeeshan",
""
],
[
"Rehmani",
"Mubashir Husain",
""
]
] |
new_dataset
| 0.990517 |
1401.1541
|
Lorna Stewart
|
Lorna Stewart and Richard Anthony Valenzano
|
On polygon numbers of circle graphs and distance hereditary graphs
|
27 pages, 8 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Circle graphs are intersection graphs of chords in a circle and $k$-polygon
graphs are intersection graphs of chords in a convex $k$-sided polygon where
each chord has its endpoints on distinct sides. The $k$-polygon graphs, for $k
\ge 2$, form an infinite chain of graph classes, each of which contains the
class of permutation graphs. The union of all of those graph classes is the
class of circle graphs. The polygon number $\gp(G)$ of a circle graph $G$ is
the minimum $k$ such that $G$ is a $k$-polygon graph. Given a circle graph $G$
and an integer $k$, determining whether $\gp(G) \le k$ is NP-complete, while
the problem is solvable in polynomial time for fixed $k$.
In this paper, we show that $\gp(G)$ is always at least as large as the
asteroidal number of $G$, and equal to the asteroidal number of $G$ when $G$ is
a connected distance hereditary graph that is not a clique. This implies that
the classes of distance hereditary permutation graphs and distance hereditary
AT-free graphs are the same, and we give a forbidden subgraph characterization
of that class. We also establish the following upper bounds: $\gp(G)$ is at
most the clique cover number of $G$ if $G$ is not a clique, at most 1 plus the
independence number of $G$, and at most $\lceil n/2 \rceil$ where $n \ge 3$ is
the number of vertices of $G$. Our results lead to linear time algorithms for
finding the minimum number of corners that must be added to a given circle
representation to produce a polygon representation, and for finding the
asteroidal number of a distance hereditary graph, both of which are
improvements over previous algorithms for those problems.
|
[
{
"version": "v1",
"created": "Tue, 7 Jan 2014 23:17:25 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Oct 2017 21:38:49 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Stewart",
"Lorna",
""
],
[
"Valenzano",
"Richard Anthony",
""
]
] |
new_dataset
| 0.999793 |
1701.01469
|
Harsha Nagarajan
|
Mowen Lu, Harsha Nagarajan, Emre Yamangil, Russell Bent, Scott
Backhaus, Arthur Barnes
|
Optimal Transmission Line Switching under Geomagnetic Disturbances
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, there have been increasing concerns about how geomagnetic
disturbances (GMDs) impact electrical power systems. Geomagnetically-induced
currents (GICs) can saturate transformers, induce hot spot heating and increase
reactive power losses. These effects can potentially cause catastrophic damage
to transformers and severely impact the ability of a power system to deliver
power. To address this problem, we develop a model of GIC impacts to power
systems that includes 1) GIC thermal capacity of transformers as a function of
normal Alternating Current (AC) and 2) reactive power losses as a function of
GIC. We use this model to derive an optimization problem that protects power
systems from GIC impacts through line switching, generator redispatch, and load
shedding. We employ state-of-the-art convex relaxations of AC power flow
equations to lower bound the objective. We demonstrate the approach on a
modified RTS96 system and the UIUC 150-bus system and show that line switching
is an effective means to mitigate GIC impacts. We also provide a sensitivity
analysis of optimal switching decisions with respect to GMD direction.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2017 20:32:59 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Jun 2017 18:38:24 GMT"
},
{
"version": "v3",
"created": "Sat, 23 Sep 2017 00:18:09 GMT"
},
{
"version": "v4",
"created": "Thu, 5 Oct 2017 05:22:10 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Lu",
"Mowen",
""
],
[
"Nagarajan",
"Harsha",
""
],
[
"Yamangil",
"Emre",
""
],
[
"Bent",
"Russell",
""
],
[
"Backhaus",
"Scott",
""
],
[
"Barnes",
"Arthur",
""
]
] |
new_dataset
| 0.989512 |
1702.01042
|
Jinwen Shi
|
Jinwen Shi, Ling Liu, Deniz G\"und\"uz and Cong Ling
|
Polar Codes and Polar Lattices for the Heegard-Berger Problem
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Explicit coding schemes are proposed to achieve the rate-distortion function
of the Heegard-Berger problem using polar codes. Specifically, a nested polar
code construction is employed to achieve the rate-distortion function for the
doubly-symmetric binary sources when the side information may be absent. The
nested structure contains two optimal polar codes for lossy source coding and
channel coding, respectively. Moreover, a similar nested polar lattice
construction is employed when the source and the side information are jointly
Gaussian. The proposed polar lattice is constructed by nesting a quantization
polar lattice and a capacity-achieving polar lattice for the additive white
Gaussian noise channel.
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2017 15:14:11 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Oct 2017 17:36:14 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Shi",
"Jinwen",
""
],
[
"Liu",
"Ling",
""
],
[
"Gündüz",
"Deniz",
""
],
[
"Ling",
"Cong",
""
]
] |
new_dataset
| 0.998808 |
1709.00252
|
Tony Wauters
|
Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce,
Greet Vanden Berghe
|
MILP and Max-Clique based heuristics for the Eternity II puzzle
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present paper considers a hybrid local search approach to the Eternity II
puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an
original mixed-integer linear programming (MILP) formulation and a novel
Max-Clique formulation are presented for this NP-hard problem. Although the
presented formulations remain computationally intractable for medium and large
sized instances, they can serve as the basis for developing heuristic
decompositions and very large scale neighbourhoods. As a side product of the
Max-Clique formulation, new hard-to-solve instances are published for the
academic research community. Two reasonably well performing MILP-based
constructive methods are presented and used for determining the initial
solution of a multi-neighbourhood local search approach. Experimental results
confirm that this local search can further improve the results obtained by the
constructive heuristics and is quite competitive with the state of the art
procedures.
|
[
{
"version": "v1",
"created": "Fri, 1 Sep 2017 11:27:55 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Oct 2017 11:01:37 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Salassa",
"Fabio",
""
],
[
"Vancroonenburg",
"Wim",
""
],
[
"Wauters",
"Tony",
""
],
[
"Della Croce",
"Federico",
""
],
[
"Berghe",
"Greet Vanden",
""
]
] |
new_dataset
| 0.999185 |
1709.02247
|
Saed Khawaldeh
|
Saed Khawaldeh, Tajwar Abrar Aleef, Usama Pervaiz, Vu Hoang Minh and
Yeman Brhane Hagos
|
Complete End-To-End Low Cost Solution To a 3D Scanning System with
Integrated Turntable
|
22 pages
|
International Journal of Computer Science & Information Technology
(IJCSIT), 9, 39-55 (2017)
|
10.5121/ijcsit.2017.9404
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
3D reconstruction is a technique used in computer vision which has a wide
range of applications in areas like object recognition, city modelling, virtual
reality, physical simulations, video games and special effects. Previously, to
perform a 3D reconstruction, specialized hardwares were required. Such systems
were often very expensive and was only available for industrial or research
purpose. With the rise of the availability of high-quality low cost 3D sensors,
it is now possible to design inexpensive complete 3D scanning systems. The
objective of this work was to design an acquisition and processing system that
can perform 3D scanning and reconstruction of objects seamlessly. In addition,
the goal of this work also included making the 3D scanning process fully
automated by building and integrating a turntable alongside the software. This
means the user can perform a full 3D scan only by a press of a few buttons from
our dedicated graphical user interface. Three main steps were followed to go
from acquisition of point clouds to the finished reconstructed 3D model. First,
our system acquires point cloud data of a person/object using inexpensive
camera sensor. Second, align and convert the acquired point cloud data into a
watertight mesh of good quality. Third, export the reconstructed model to a 3D
printer to obtain a proper 3D print of the model.
|
[
{
"version": "v1",
"created": "Sun, 3 Sep 2017 13:40:23 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Khawaldeh",
"Saed",
""
],
[
"Aleef",
"Tajwar Abrar",
""
],
[
"Pervaiz",
"Usama",
""
],
[
"Minh",
"Vu Hoang",
""
],
[
"Hagos",
"Yeman Brhane",
""
]
] |
new_dataset
| 0.993257 |
1709.03787
|
Balazs Vedres
|
Balazs Vedres
|
Forbidden triads and Creative Success in Jazz: The Miles Davis Factor
| null |
Applied Network Science (2017) 2:31
|
10.1007/s41109-017-0051-2
| null |
cs.SI nlin.AO stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article argues for the importance of forbidden triads - open triads with
high-weight edges - in predicting success in creative fields. Forbidden triads
had been treated as a residual category beyond closed and open triads, yet I
argue that these structures provide opportunities to combine socially evolved
styles in new ways. Using data on the entire history of recorded jazz from 1896
to 2010, I show that observed collaborations have tolerated the openness of
high weight triads more than expected, observed jazz sessions had more
forbidden triads than expected, and the density of forbidden triads contributed
to the success of recording sessions, measured by the number of record releases
of session material. The article also shows that the sessions of Miles Davis
had received an especially high boost from forbidden triads.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2017 11:28:25 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Vedres",
"Balazs",
""
]
] |
new_dataset
| 0.988879 |
1709.09343
|
Francisco Su\'arez-Ruiz
|
Francisco Su\'arez-Ruiz, Teguh Santoso Lembono and Quang-Cuong Pham
|
RoboTSP - A Fast Solution to the Robotic Task Sequencing Problem
|
6 pages, 7 figures, 1 table
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many industrial robotics applications, such as spot-welding,
spray-painting or drilling, the robot is required to visit successively
multiple targets. The robot travel time among the targets is a significant
component of the overall execution time. This travel time is in turn greatly
affected by the order of visit of the targets, and by the robot configurations
used to reach each target. Therefore, it is crucial to optimize these two
elements, a problem known in the literature as the Robotic Task Sequencing
Problem (RTSP). Our contribution in this paper is two-fold. First, we propose a
fast, near-optimal, algorithm to solve RTSP. The key to our approach is to
exploit the classical distinction between task space and configuration space,
which, surprisingly, has been so far overlooked in the RTSP literature. Second,
we provide an open-source implementation of the above algorithm, which has been
carefully benchmarked to yield an efficient, ready-to-use, software solution.
We discuss the relationship between RTSP and other Traveling Salesman Problem
(TSP) variants, such as the Generalized Traveling Salesman Problem (GTSP), and
show experimentally that our method finds motion sequences of the same quality
but using several orders of magnitude less computation time than existing
approaches.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 05:42:31 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Oct 2017 10:29:57 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Suárez-Ruiz",
"Francisco",
""
],
[
"Lembono",
"Teguh Santoso",
""
],
[
"Pham",
"Quang-Cuong",
""
]
] |
new_dataset
| 0.970892 |
1710.01772
|
Yunfeng Zhang
|
Yedendra B. Shrinivasan, Yunfeng Zhang
|
CELIO: An application development framework for interactive spaces
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Developing applications for interactive space is different from developing
cross-platform applications for personal computing. Input, output, and
architectural variations in each interactive space introduce big overhead in
terms of cost and time for developing, deploying and maintaining applications
for interactive spaces. Often, these applications become on-off experience tied
to the deployed spaces. To alleviate this problem and enable rapid responsive
space design applications similar to responsive web design, we present CELIO
application development framework for interactive spaces. The framework is
micro services based and neatly decouples application and design specifications
from hardware and architecture specifications of an interactive space. In this
paper, we describe this framework and its implementation details. Also, we
briefly discuss the use cases developed using this framework.
|
[
{
"version": "v1",
"created": "Wed, 4 Oct 2017 19:19:39 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Shrinivasan",
"Yedendra B.",
""
],
[
"Zhang",
"Yunfeng",
""
]
] |
new_dataset
| 0.995426 |
1710.01872
|
Lingfei Jin
|
Peter Beelen and Lingfei Jin
|
Explicit MDS Codes with Complementary Duals
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1964, Massey introduced a class of codes with complementary duals which
are called Linear Complimentary Dual (LCD for short) codes. He showed that LCD
codes have applications in communication system, side-channel attack (SCA) and
so on. LCD codes have been extensively studied in literature. On the other
hand, MDS codes form an optimal family of classical codes which have wide
applications in both theory and practice. The main purpose of this paper is to
give an explicit construction of several classes of LCD MDS codes, using tools
from algebraic function fields. We exemplify this construction and obtain
several classes of explicit LCD MDS codes for the odd characteristic case.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 03:33:38 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Beelen",
"Peter",
""
],
[
"Jin",
"Lingfei",
""
]
] |
new_dataset
| 0.99927 |
1710.01873
|
Mehdi Shafiei
|
Shiva Geraee, Hamed Mohammadbagherpoor, Mehdi Shafiei, Majid
Valizadehdeh, Farshad Montazeri, Mohammad Reza Feyzi
|
A Modified DTC with Capability of Regenerative Braking Energy in BLDC
driven Electric Vehicles Using Adaptive Control Theory
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper represents a novel regenerative braking approach for the Electric
Vehicles. The proposed method solves the short-range problem which is
corresponding to the charge of the battery pack. The DTC switching algorithm
has been modified to recover the electrical energy from Electrical Vehicle
(EV), driven by Brushless DC motor, without using the additional power
converter or the other electrical energy storage devices. During regenerative
braking process, different switching pattern is applied to the inverter to
convert the mechanical energy to the electrical energy through the reverse
diodes. This switching pattern is different from the normal operation due to
the special arrangement of voltage vectors which is considered to convert the
mechanical energy to electrical energy. The state of charge of the battery is
used as a performance indicator of the method. Simultaneously, a model
reference adaptive system has been designed to tune the system parameters.
Several simulations are carried out to validate the performance and
effectiveness of the proposed methods. The results show the high capability and
performance of the designed method.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 03:36:55 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Geraee",
"Shiva",
""
],
[
"Mohammadbagherpoor",
"Hamed",
""
],
[
"Shafiei",
"Mehdi",
""
],
[
"Valizadehdeh",
"Majid",
""
],
[
"Montazeri",
"Farshad",
""
],
[
"Feyzi",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.960423 |
1710.01887
|
Arif Mohaimin Sadri
|
Arif Mohaimin Sadri, Samiul Hasan, Satish V. Ukkusuri, Manuel Cebrian
|
Crisis Communication Patterns in Social Media during Hurricane Sandy
| null | null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hurricane Sandy was one of the deadliest and costliest of hurricanes over the
past few decades. Many states experienced significant power outage, however
many people used social media to communicate while having limited or no access
to traditional information sources. In this study, we explored the evolution of
various communication patterns using machine learning techniques and determined
user concerns that emerged over the course of Hurricane Sandy. The original
data included ~52M tweets coming from ~13M users between October 14, 2012 and
November 12, 2012. We run topic model on ~763K tweets from top 4,029 most
frequent users who tweeted about Sandy at least 100 times. We identified 250
well-defined communication patterns based on perplexity. Conversations of most
frequent and relevant users indicate the evolution of numerous storm-phase
(warning, response, and recovery) specific topics. People were also concerned
about storm location and time, media coverage, and activities of political
leaders and celebrities. We also present each relevant keyword that contributed
to one particular pattern of user concerns. Such keywords would be particularly
meaningful in targeted information spreading and effective crisis communication
in similar major disasters. Each of these words can also be helpful for
efficient hash-tagging to reach target audience as needed via social media. The
pattern recognition approach of this study can be used in identifying real time
user needs in future crises.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 05:32:07 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Sadri",
"Arif Mohaimin",
""
],
[
"Hasan",
"Samiul",
""
],
[
"Ukkusuri",
"Satish V.",
""
],
[
"Cebrian",
"Manuel",
""
]
] |
new_dataset
| 0.983304 |
1710.01966
|
Erick Peirson
|
B. R. Erick Peirson, Erin Bottino, Julia L. Damerow, Manfred D.
Laubichler
|
Quantitative Perspectives on Fifty Years of the Journal of the History
of Biology
|
45 pages, 14 figures, 4 tables
| null |
10.1007/s10739-017-9499-2
| null |
cs.DL cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Journal of the History of Biology provides a fifty-year long record for
examining the evolution of the history of biology as a scholarly discipline. In
this paper, we present a new dataset and preliminary quantitative analysis of
the thematic content of JHB from the perspectives of geography, organisms, and
thematic fields. The geographic diversity of authors whose work appears in JHB
has increased steadily since 1968, but the geographic coverage of the content
of JHB articles remains strongly lopsided toward the United States, United
Kingdom, and western Europe and has diversified much less dramatically over
time. The taxonomic diversity of organisms discussed in JHB increased steadily
between 1968 and the late 1990s but declined in later years, mirroring broader
patterns of diversification previously reported in the biomedical research
literature. Finally, we used a combination of topic modeling and nonlinear
dimensionality reduction techniques to develop a model of multi-article fields
within JHB. We found evidence for directional changes in the representation of
fields on multiple scales. The diversity of JHB with regard to the
representation of thematic fields has increased overall, with most of that
diversification occurring in recent years. Drawing on the dataset generated in
the course of this analysis, as well as web services in the emerging digital
history and philosophy of science ecosystem, we have developed an interactive
web platform for exploring the content of JHB, and we provide a brief overview
of the platform in this article. As a whole, the data and analyses presented
here provide a starting-place for further critical reflection on the evolution
of the history of biology over the past half-century.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 11:13:16 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Peirson",
"B. R. Erick",
""
],
[
"Bottino",
"Erin",
""
],
[
"Damerow",
"Julia L.",
""
],
[
"Laubichler",
"Manfred D.",
""
]
] |
new_dataset
| 0.999616 |
1710.02019
|
Daniel Augot
|
Daniel Augot (GRACE), Herv\'e Chabanne, Thomas Chenevier, William
George (LIX, GRACE), Laurent Lamber
|
A User-Centric System for Verified Identities on the Bitcoin Blockchain
| null |
International Workshop on Cryptocurrencies and Blockchain
Technology - CBT'17, Sep 2017, Oslo, Norway
| null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an identity management scheme built into the Bitcoin blockchain,
allowing for identities that are as indelible as the blockchain itself.
Moreover, we take advantage of Bitcoin's decentralized nature to facilitate a
shared control between users and identity providers, allowing users to directly
manage their own identities, fluidly coordinating identities from different
providers, even as identity providers can revoke identities and impose
controls.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 13:48:04 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Augot",
"Daniel",
"",
"GRACE"
],
[
"Chabanne",
"Hervé",
"",
"LIX, GRACE"
],
[
"Chenevier",
"Thomas",
"",
"LIX, GRACE"
],
[
"George",
"William",
"",
"LIX, GRACE"
],
[
"Lamber",
"Laurent",
""
]
] |
new_dataset
| 0.990854 |
1710.02041
|
Leslie Barrett
|
Leslie Barrett (Bloomberg, LP), Wayne Krug (Bloomberg, LP), Zefu Lu
(Bloomberg, LP), Karin D. Martin (University of Washington Seattle), Roberto
Martin (Bloomberg, LP), Alexandra Ortan (Bloomberg, LP), Anu Pradhan
(Bloomberg, LP), Alexander Sherman (Alexander Sherman, J.D.), Michael W.
Sherman (Bloomberg, LP), Ryon Smey (Bloomberg, LP), Trent Wenzel (Bloomberg,
LP)
|
Civil Asset Forfeiture: A Judicial Perspective
|
Presented at the Data For Good Exchange 2017
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Civil Asset Forfeiture (CAF) is a longstanding and controversial legal
process viewed on the one hand as a powerful tool for combating drug crimes and
on the other hand as a violation of the rights of US citizens. Data used to
support both sides of the controversy to date has come from government sources
representing records of the events at the time of occurrence. Court dockets
represent litigation events initiated following the forfeiture, however, and
can thus provide a new perspective on the CAF legal process. This paper will
show new evidence supporting existing claims about the growth of the practice
and bias in its application based on the quantitative analysis of data derived
from these court cases.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 14:29:51 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Barrett",
"Leslie",
"",
"Bloomberg, LP"
],
[
"Krug",
"Wayne",
"",
"Bloomberg, LP"
],
[
"Lu",
"Zefu",
"",
"Bloomberg, LP"
],
[
"Martin",
"Karin D.",
"",
"University of Washington Seattle"
],
[
"Martin",
"Roberto",
"",
"Bloomberg, LP"
],
[
"Ortan",
"Alexandra",
"",
"Bloomberg, LP"
],
[
"Pradhan",
"Anu",
"",
"Bloomberg, LP"
],
[
"Sherman",
"Alexander",
"",
"Alexander Sherman, J.D."
],
[
"Sherman",
"Michael W.",
"",
"Bloomberg, LP"
],
[
"Smey",
"Ryon",
"",
"Bloomberg, LP"
],
[
"Wenzel",
"Trent",
"",
"Bloomberg,\n LP"
]
] |
new_dataset
| 0.999198 |
1710.02121
|
Abhijit Makhal
|
Abhijit Makhal, Frederico Thomas, Alba Perez Gracia
|
Grasping Unknown Objects in Clutter by Superquadric Representation
|
Submitted at International conference of Robotics Computing, 2018
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a quick and efficient method is presented for grasping unknown
objects in clutter. The grasping method relies on real-time superquadric (SQ)
representation of partial view objects and incomplete object modelling, well
suited for unknown symmetric objects in cluttered scenarios which is followed
by optimized antipodal grasping. The incomplete object models are processed
through a mirroring algorithm that assumes symmetry to first create an
approximate complete model and then fit for SQ representation. The grasping
algorithm is designed for maximum force balance and stability, taking advantage
of the quick retrieval of dimension and surface curvature information from the
SQ parameters. The pose of the SQs with respect to the direction of gravity is
calculated and used together with the parameters of the SQs and specification
of the gripper, to select the best direction of approach and contact points.
The SQ fitting method has been tested on custom datasets containing objects in
isolation as well as in clutter. The grasping algorithm is evaluated on a PR2
and real time results are presented. Initial results indicate that though the
method is based on simplistic shape information, it outperforms other learning
based grasping algorithms that also work in clutter in terms of time-efficiency
and accuracy.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 17:27:04 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Makhal",
"Abhijit",
""
],
[
"Thomas",
"Frederico",
""
],
[
"Gracia",
"Alba Perez",
""
]
] |
new_dataset
| 0.99822 |
1710.02133
|
Patrick Slade
|
Patrick Slade, Siobhan Powell, Michael F. Howland
|
Optimal control of a single leg hopper by Liouvillian system reduction
|
6 pages, 8 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The benefits of legged locomotion shown in nature overcome challenges such as
obstacles or terrain smoothness typically encountered with wheeled vehicles.
This paper evaluates the benefits of using optimal control on a single leg
hopper during the entire hopping motion. Basic control without considering
physical constraints is implemented through hand-tuned PD controllers following
the Raibert control framework. The differential flatness of the first-order
equations of motion and the Liouvillian property for the second-order equations
for the hopper system are proved, enabling flat outputs for control. A
two-point boundary value problem (BVP) is then used to minimize jerk in the
flat system to gain implicit smoothness in the output controls. This smoothness
ensures that the planned trajectories are feasible, allowing for given
waypoints to be reached.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 17:48:56 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Slade",
"Patrick",
""
],
[
"Powell",
"Siobhan",
""
],
[
"Howland",
"Michael F.",
""
]
] |
new_dataset
| 0.972956 |
1710.02134
|
Grace Kuo
|
Nick Antipa, Grace Kuo, Reinhard Heckel, Ben Mildenhall, Emrah Bostan,
Ren Ng, Laura Waller
|
DiffuserCam: Lensless Single-exposure 3D Imaging
|
The first two authors contributed equally
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We demonstrate a compact and easy-to-build computational camera for
single-shot 3D imaging. Our lensless system consists solely of a diffuser
placed in front of a standard image sensor. Every point within the volumetric
field-of-view projects a unique pseudorandom pattern of caustics on the sensor.
By using a physical approximation and simple calibration scheme, we solve the
large-scale inverse problem in a computationally efficient way. The caustic
patterns enable compressed sensing, which exploits sparsity in the sample to
solve for more 3D voxels than pixels on the 2D sensor. Our 3D voxel grid is
chosen to match the experimentally measured two-point optical resolution across
the field-of-view, resulting in 100 million voxels being reconstructed from a
single 1.3 megapixel image. However, the effective resolution varies
significantly with scene content. Because this effect is common to a wide range
of computational cameras, we provide new theory for analyzing resolution in
such systems.
|
[
{
"version": "v1",
"created": "Thu, 5 Oct 2017 17:48:57 GMT"
}
] | 2017-10-06T00:00:00 |
[
[
"Antipa",
"Nick",
""
],
[
"Kuo",
"Grace",
""
],
[
"Heckel",
"Reinhard",
""
],
[
"Mildenhall",
"Ben",
""
],
[
"Bostan",
"Emrah",
""
],
[
"Ng",
"Ren",
""
],
[
"Waller",
"Laura",
""
]
] |
new_dataset
| 0.987811 |
1503.04069
|
Klaus Greff
|
Klaus Greff, Rupesh Kumar Srivastava, Jan Koutn\'ik, Bas R.
Steunebrink, J\"urgen Schmidhuber
|
LSTM: A Search Space Odyssey
|
12 pages, 6 figures
|
IEEE Transactions on Neural Networks and Learning Systems (
Volume: 28, Issue: 10, Oct. 2017 ) Pages: 2222 - 2232
|
10.1109/TNNLS.2016.2582924
| null |
cs.NE cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several variants of the Long Short-Term Memory (LSTM) architecture for
recurrent neural networks have been proposed since its inception in 1995. In
recent years, these networks have become the state-of-the-art models for a
variety of machine learning problems. This has led to a renewed interest in
understanding the role and utility of various computational components of
typical LSTM variants. In this paper, we present the first large-scale analysis
of eight LSTM variants on three representative tasks: speech recognition,
handwriting recognition, and polyphonic music modeling. The hyperparameters of
all LSTM variants for each task were optimized separately using random search,
and their importance was assessed using the powerful fANOVA framework. In
total, we summarize the results of 5400 experimental runs ($\approx 15$ years
of CPU time), which makes our study the largest of its kind on LSTM networks.
Our results show that none of the variants can improve upon the standard LSTM
architecture significantly, and demonstrate the forget gate and the output
activation function to be its most critical components. We further observe that
the studied hyperparameters are virtually independent and derive guidelines for
their efficient adjustment.
|
[
{
"version": "v1",
"created": "Fri, 13 Mar 2015 14:01:38 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Oct 2017 11:40:31 GMT"
}
] | 2017-10-05T00:00:00 |
[
[
"Greff",
"Klaus",
""
],
[
"Srivastava",
"Rupesh Kumar",
""
],
[
"Koutník",
"Jan",
""
],
[
"Steunebrink",
"Bas R.",
""
],
[
"Schmidhuber",
"Jürgen",
""
]
] |
new_dataset
| 0.999198 |
1603.03404
|
Tianwei Zhang
|
Tianwei Zhang, Yinqian Zhang, Ruby B. Lee
|
Memory DoS Attacks in Multi-tenant Clouds: Severity and Mitigation
|
18 pages
| null | null | null |
cs.DC cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In cloud computing, network Denial of Service (DoS) attacks are well studied
and defenses have been implemented, but severe DoS attacks on a victim's
working memory by a single hostile VM are not well understood. Memory DoS
attacks are Denial of Service (or Degradation of Service) attacks caused by
contention for hardware memory resources on a cloud server. Despite the strong
memory isolation techniques for virtual machines (VMs) enforced by the software
virtualization layer in cloud servers, the underlying hardware memory layers
are still shared by the VMs and can be exploited by a clever attacker in a
hostile VM co-located on the same server as the victim VM, denying the victim
the working memory he needs. We first show quantitatively the severity of
contention on different memory resources. We then show that a malicious cloud
customer can mount low-cost attacks to cause severe performance degradation for
a Hadoop distributed application, and 38X delay in response time for an
E-commerce website in the Amazon EC2 cloud.
Then, we design an effective, new defense against these memory DoS attacks,
using a statistical metric to detect their existence and execution throttling
to mitigate the attack damage. We achieve this by a novel re-purposing of
existing hardware performance counters and duty cycle modulation for security,
rather than for improving performance or power consumption. We implement a full
prototype on the OpenStack cloud system. Our evaluations show that this defense
system can effectively defeat memory DoS attacks with negligible performance
overhead.
|
[
{
"version": "v1",
"created": "Thu, 10 Mar 2016 20:16:52 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Mar 2016 04:46:07 GMT"
},
{
"version": "v3",
"created": "Wed, 4 Oct 2017 16:43:59 GMT"
}
] | 2017-10-05T00:00:00 |
[
[
"Zhang",
"Tianwei",
""
],
[
"Zhang",
"Yinqian",
""
],
[
"Lee",
"Ruby B.",
""
]
] |
new_dataset
| 0.954584 |
1710.01328
|
Abhijit Makhal
|
Abhijit Makhal and Alex K. Goins
|
Reuleaux: Robot Base Placement by Reachability Analysis
|
Submitted to International Conference of Robotic Computing 2018
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Before beginning any robot task, users must position the robot's base, a task
that now depends entirely on user intuition. While slight perturbation is
tolerable for robots with moveable bases, correcting the problem is imperative
for fixed-base robots if some essential task sections are out of reach. For
mobile manipulation robots, it is necessary to decide on a specific base
position before beginning manipulation tasks.
This paper presents Reuleaux, an open source library for robot reachability
analyses and base placement. It reduces the amount of extra repositioning and
removes the manual work of identifying potential base locations. Based on the
reachability map, base placement locations of a whole robot or only the arm can
be efficiently determined. This can be applied to both statically mounted
robots, where position of the robot and work piece ensure the maximum amount of
work performed, and to mobile robots, where the maximum amount of workable area
can be reached. Solutions are not limited only to vertically constrained
placement, since complicated robotics tasks require the base to be placed at
unique poses based on task demand.
All Reuleaux library methods were tested on different robots of different
specifications and evaluated for tasks in simulation and real world
environment. Evaluation results indicate that Reuleaux had significantly
improved performance than prior existing methods in terms of time-efficiency
and range of applicability.
|
[
{
"version": "v1",
"created": "Tue, 3 Oct 2017 18:13:58 GMT"
}
] | 2017-10-05T00:00:00 |
[
[
"Makhal",
"Abhijit",
""
],
[
"Goins",
"Alex K.",
""
]
] |
new_dataset
| 0.997047 |
1710.01347
|
David Di Giorgio
|
David Di Giorgio
|
Simple Cortex: A Model of Cells in the Sensory Nervous System
| null | null | null | null |
cs.AI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neuroscience research has produced many theories and computational neural
models of sensory nervous systems. Notwithstanding many different perspectives
towards developing intelligent machines, artificial intelligence has ultimately
been influenced by neuroscience. Therefore, this paper provides an introduction
to biologically inspired machine intelligence by exploring the basic principles
of sensation and perception as well as the structure and behavior of biological
sensory nervous systems like the neocortex. Concepts like spike timing,
synaptic plasticity, inhibition, neural structure, and neural behavior are
applied to a new model, Simple Cortex (SC). A software implementation of SC has
been built and demonstrates fast observation, learning, and prediction of
spatio-temporal sensory-motor patterns and sequences. Finally, this paper
suggests future areas of improvement and growth for Simple Cortex and other
related machine intelligence models.
|
[
{
"version": "v1",
"created": "Tue, 3 Oct 2017 18:51:19 GMT"
}
] | 2017-10-05T00:00:00 |
[
[
"Di Giorgio",
"David",
""
]
] |
new_dataset
| 0.98121 |
1710.01416
|
Saed Khawaldeh
|
Vu Hoang Minh, Tajwar Abrar Aleef, Usama Pervaiz, Yeman Brhane Hagos,
Saed Khawaldeh
|
Smoothness-based Edge Detection using Low-SNR Camera for Robot
Navigation
| null | null | null | null |
cs.CV cs.RO stat.AP stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the emerging advancement in the branch of autonomous robotics, the ability
of a robot to efficiently localize and construct maps of its surrounding is
crucial. This paper deals with utilizing thermal-infrared cameras, as opposed
to conventional cameras as the primary sensor to capture images of the robot's
surroundings. For localization, the images need to be further processed before
feeding them to a navigational system. The main motivation of this paper was to
develop an edge detection methodology capable of utilizing the low-SNR poor
output from such a thermal camera and effectively detect smooth edges of the
surrounding environment. The enhanced edge detector proposed in this paper
takes the raw image from the thermal sensor, denoises the images, applies Canny
edge detection followed by CSS method. The edges are ranked to remove any noise
and only edges of the highest rank are kept. Then, the broken edges are linked
by computing edge metrics and a smooth edge of the surrounding is displayed in
a binary image. Several comparisons are also made in the paper between the
proposed technique and the existing techniques.
|
[
{
"version": "v1",
"created": "Tue, 3 Oct 2017 22:48:41 GMT"
}
] | 2017-10-05T00:00:00 |
[
[
"Minh",
"Vu Hoang",
""
],
[
"Aleef",
"Tajwar Abrar",
""
],
[
"Pervaiz",
"Usama",
""
],
[
"Hagos",
"Yeman Brhane",
""
],
[
"Khawaldeh",
"Saed",
""
]
] |
new_dataset
| 0.967978 |
1710.01475
|
Min Qiu
|
Min Qiu, Lei Yang, Yixuan Xie and Jinhong Yuan
|
On the Design of Multi-Dimensional Irregular Repeat-Accumulate Lattice
Codes
|
Accepted for publication in IEEE Transactions on Communications, 15
pages, 7 figures, 2 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most multi-dimensional (more than two dimensions) lattice partitions only
form additive quotient groups and lack multiplication operations. This prevents
us from constructing lattice codes based on multi-dimensional lattice
partitions directly from non-binary linear codes over finite fields. In this
paper, we design lattice codes from Construction A lattices where the
underlying linear codes are non-binary irregular repeat-accumulate (IRA) codes.
Most importantly, our codes are based on multi-dimensional lattice partitions
with finite constellations. We propose a novel encoding structure that adds
randomly generated lattice sequences to the encoder's messages, instead of
multiplying lattice sequences to the encoder's messages. We prove that our
approach can ensure that the decoder's messages exhibit permutation-invariance
and symmetry properties. With these two properties, the densities of the
messages in the iterative decoder can be modeled by Gaussian distributions
described by a single parameter. With Gaussian approximation, extrinsic
information transfer (EXIT) charts for our multi-dimensional IRA lattice codes
are developed and used for analyzing the convergence behavior and optimizing
the decoding thresholds. Simulation results show that our codes can approach
the unrestricted Shannon limit within 0.46 dB and outperform the previously
designed lattice codes with two-dimensional lattice partitions and existing
lattice coding schemes for large codeword length.
|
[
{
"version": "v1",
"created": "Wed, 4 Oct 2017 06:30:10 GMT"
}
] | 2017-10-05T00:00:00 |
[
[
"Qiu",
"Min",
""
],
[
"Yang",
"Lei",
""
],
[
"Xie",
"Yixuan",
""
],
[
"Yuan",
"Jinhong",
""
]
] |
new_dataset
| 0.957191 |
1701.02991
|
Zaid Hussain
|
Zaid Hussain, Bader AlBdaiwi, Anton Cerny
|
Node-Independent Spanning Trees in Gaussian Networks
| null |
Journal of Parallel and Distributed Computing, Volume 109,
November 2017, Pages 324-332
|
10.1016/j.jpdc.2017.06.018
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Message broadcasting in networks could be carried over spanning trees. A set
of spanning trees in the same network is node independent if two conditions are
satisfied. First, all trees are rooted at node $r$. Second, for every node $u$
in the network, all trees' paths from $r$ to $u$ are node-disjoint, excluding
the end nodes $r$ and $u$. Independent spanning trees have applications in
fault-tolerant communications and secure message distributions. Gaussian
networks and two-dimensional toroidal networks share similar topological
characteristics. They are regular of degree four, symmetric, and
node-transitive. Gaussian networks, however, have relatively lesser network
diameter that could result in a better performance. This promotes Gaussian
networks to be a potential alternative for two-dimensional toroidal networks.
In this paper, we present constructions for node independent spanning trees in
dense Gaussian networks. Based on these constructions, we design routing
algorithms that can be used in fault-tolerant routing and secure message
distribution. We also design fault-tolerant algorithms to construct these trees
in parallel.
|
[
{
"version": "v1",
"created": "Wed, 11 Jan 2017 14:43:05 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Hussain",
"Zaid",
""
],
[
"AlBdaiwi",
"Bader",
""
],
[
"Cerny",
"Anton",
""
]
] |
new_dataset
| 0.981495 |
1707.03435
|
Gustavo Gil
|
Giovanni Savino, Simone Piantini, Gustavo Gil, Marco Pierini
|
Obstacle detection test in real-word traffic contexts for the purposes
of motorcycle autonomous emergency braking (MAEB)
|
25th International Technical Conference on the Enhanced Safety of
Vehicles (2017)
| null | null |
Paper Number 17-0047
|
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Research suggests that a Motorcycle Autonomous Emergency Braking system
(MAEB) could influence 25% of the crashes involving powered two wheelers
(PTWs). By automatically slowing down a host PTW of up to 10 km/h in inevitable
collision scenarios, MAEB could potentially mitigate the crash severity for the
riders. The feasibility of automatic decelerations of motorcycles was shown via
field trials in controlled environment. However, the feasibility of correct
MAEB triggering in the real traffic context is still unclear. In particular,
MAEB requires an accurate obstacle detection, the feasibility of which from a
single track vehicle has not been confirmed yet. To address this issue, our
study presents obstacle detection tests in a real-world MAEB-sensitive crash
scenario.
|
[
{
"version": "v1",
"created": "Sun, 25 Jun 2017 09:44:17 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Oct 2017 20:57:23 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Savino",
"Giovanni",
""
],
[
"Piantini",
"Simone",
""
],
[
"Gil",
"Gustavo",
""
],
[
"Pierini",
"Marco",
""
]
] |
new_dataset
| 0.998316 |
1709.01669
|
Shenghui Su
|
Shenghui Su, Jianhua Zheng and Shuwang Lu
|
A Fast Quantum-safe Asymmetric Cryptosystem Using Extra Superincreasing
Sequences
|
8 Pages. arXiv admin note: text overlap with arXiv:1408.6226
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper gives the definitions of an extra superincreasing sequence and an
anomalous subset sum, and proposes a fast quantum-safe asymmetric cryptosystem
called JUOAN2. The new cryptosystem is based on an additive multivariate
permutation problem (AMPP) and an anomalous subset sum problem (ASSP) which
parallel a multivariate polynomial problem and a shortest vector problem
respectively, and composed of a key generator, an encryption algorithm, and a
decryption algorithm. The authors analyze the security of the new cryptosystem
against the Shamir minima accumulation point attack and the LLL lattice basis
reduction attack, and prove it to be semantically secure (namely IND-CPA) on
the assumption that AMPP and ASSP have no subexponential time solutions.
Particularly, the analysis shows that the new cryptosystem has the potential to
be resistant to quantum computing attack, and is especially suitable to the
secret communication between two mobile terminals in maneuvering field
operations under any weather. At last, an example explaining the correctness of
the new cryptosystem is given.
|
[
{
"version": "v1",
"created": "Wed, 6 Sep 2017 04:32:09 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Oct 2017 01:51:22 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Su",
"Shenghui",
""
],
[
"Zheng",
"Jianhua",
""
],
[
"Lu",
"Shuwang",
""
]
] |
new_dataset
| 0.998321 |
1710.00561
|
Neeraj Varshney
|
Neeraj Varshney, Aditya K. Jagannatham, and Pramod K. Varshney
|
Diffusive Molecular Communication with Nanomachine Mobility
|
To be submitted in 52th Annual Conference on Information Sciences and
Systems (CISS)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work presents a performance analysis for diffusive molecular
communication with mobile transmit and receive nanomachines. To begin with, the
optimal test is obtained for symbol detection at the receiver nanomachine.
Subsequently, closed-form expressions are derived for the probabilities of
detection and false alarm, probability of error, and capacity considering also
aberrations such as multi-source interference, inter-symbol interference, and
counting errors. Simulation results are presented to corroborate the
theoretical results derived and also, to yield various insights into the
performance of the system. Interestingly, it is shown that the performance of
the mobile diffusive molecular communication can be significantly enhanced by
allocating large fraction of total available molecules for transmission as the
slot interval increases.
|
[
{
"version": "v1",
"created": "Mon, 2 Oct 2017 10:01:38 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Varshney",
"Neeraj",
""
],
[
"Jagannatham",
"Aditya K.",
""
],
[
"Varshney",
"Pramod K.",
""
]
] |
new_dataset
| 0.999039 |
1710.00817
|
Ahmadreza Montazerolghaem
|
Ahmadreza Montazerolghaem, Mohammad Hossein Yaghmaee Moghaddam, Farzad
Tashtarian
|
Overload Control in SIP Networks: A Heuristic Approach Based on
Mathematical Optimization
|
arXiv admin note: substantial text overlap with arXiv:1709.10260
|
Global Communications Conference (GLOBECOM), 2015 IEEE
|
10.1109/GLOCOM.2015.7417081
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Session Initiation Protocol (SIP) is an application-layer control
protocol for creating, modifying and terminating multimedia sessions. An open
issue is the control of overload that occurs when a SIP server lacks sufficient
CPU and memory resources to process all messages. We prove that the problem of
overload control in SIP network with a set of n servers and limited resources
is in the form of NP-hard. This paper proposes a Load-Balanced Call Admission
Controller (LB-CAC), based on a heuristic mathematical model to determine an
optimal resource allocation in such a way that maximizes call admission rates
regarding the limited resources of the SIP servers. LB-CAC determines the
optimal "call admission rates" and "signaling paths" for admitted calls along
optimal allocation of CPU and memory resources of the SIP servers through a new
linear programming model. This happens by acquiring some critical information
of SIP servers. An assessment of the numerical and experimental results
demonstrates the efficiency of the proposed method.
|
[
{
"version": "v1",
"created": "Sat, 30 Sep 2017 05:23:56 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Montazerolghaem",
"Ahmadreza",
""
],
[
"Moghaddam",
"Mohammad Hossein Yaghmaee",
""
],
[
"Tashtarian",
"Farzad",
""
]
] |
new_dataset
| 0.998537 |
1710.00893
|
Zhe Zhang
|
Zhe Zhang, Shaoshan Liu, Grace Tsai, Hongbing Hu, Chen-Chi Chu, and
Feng Zheng
|
PIRVS: An Advanced Visual-Inertial SLAM System with Flexible Sensor
Fusion and Hardware Co-Design
| null | null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present the PerceptIn Robotics Vision System (PIRVS)
system, a visual-inertial computing hardware with embedded simultaneous
localization and mapping (SLAM) algorithm. The PIRVS hardware is equipped with
a multi-core processor, a global-shutter stereo camera, and an IMU with precise
hardware synchronization. The PIRVS software features a novel and flexible
sensor fusion approach to not only tightly integrate visual measurements with
inertial measurements and also to loosely couple with additional sensor
modalities. It runs in real-time on both PC and the PIRVS hardware. We perform
a thorough evaluation of the proposed system using multiple public
visual-inertial datasets. Experimental results demonstrate that our system
reaches comparable accuracy of state-of-the-art visual-inertial algorithms on
PC, while being more efficient on the PIRVS hardware.
|
[
{
"version": "v1",
"created": "Mon, 2 Oct 2017 20:17:54 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Zhang",
"Zhe",
""
],
[
"Liu",
"Shaoshan",
""
],
[
"Tsai",
"Grace",
""
],
[
"Hu",
"Hongbing",
""
],
[
"Chu",
"Chen-Chi",
""
],
[
"Zheng",
"Feng",
""
]
] |
new_dataset
| 0.999039 |
1710.00923
|
Michael Gasser
|
Michael Gasser
|
Minimal Dependency Translation: a Framework for Computer-Assisted
Translation for Under-Resourced Languages
|
EAI International Conference on ICT for Development for Africa
September 25-27, 2017, Bahir Dar, Ethiopia
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-sa/4.0/
|
This paper introduces Minimal Dependency Translation (MDT), an ongoing
project to develop a rule-based framework for the creation of rudimentary
bilingual lexicon-grammars for machine translation and computer-assisted
translation into and out of under-resourced languages as well as initial steps
towards an implementation of MDT for English-to-Amharic translation. The basic
units in MDT, called groups, are headed multi-item sequences. In addition to
wordforms, groups may contain lexemes, syntactic-semantic categories, and
grammatical features. Each group is associated with one or more translations,
each of which is a group in a target language. During translation, constraint
satisfaction is used to select a set of source-language groups for the input
sentence and to sequence the words in the associated target-language groups.
|
[
{
"version": "v1",
"created": "Mon, 2 Oct 2017 21:56:16 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Gasser",
"Michael",
""
]
] |
new_dataset
| 0.951561 |
1710.01202
|
F Yan
|
Fei Yan, Krystian Mikolajczyk, Josef Kittler
|
Person Re-Identification with Vision and Language
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a new approach to person re-identification using
images and natural language descriptions. We propose a joint vision and
language model based on CCA and CNN architectures to match across the two
modalities as well as to enrich visual examples for which there are no language
descriptions. We also introduce new annotations in the form of natural language
descriptions for two standard Re-ID benchmarks, namely CUHK03 and VIPeR. We
perform experiments on these two datasets with techniques based on CNN,
hand-crafted features as well as LSTM for analysing visual and natural
description data. We investigate and demonstrate the advantages of using
natural language descriptions compared to attributes as well as CNN compared to
LSTM in the context of Re-ID. We show that the joint use of language and vision
can significantly improve the state-of-the-art performance on standard Re-ID
benchmarks.
|
[
{
"version": "v1",
"created": "Tue, 3 Oct 2017 15:05:31 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Yan",
"Fei",
""
],
[
"Mikolajczyk",
"Krystian",
""
],
[
"Kittler",
"Josef",
""
]
] |
new_dataset
| 0.995234 |
1710.01215
|
Nasim Nematzadeh
|
Nasim Nematzadeh, David M.W. Powers
|
The Cafe Wall Illusion: Local and Global Perception from multiple scale
to multiscale
|
Under revision by Applied Computational Intelligence and Soft
Computing
| null | null | null |
cs.CV
|
http://creativecommons.org/publicdomain/zero/1.0/
|
Geometrical illusions are a subclass of optical illusions in which the
geometrical characteristics of patterns such as orientations and angles are
distorted and misperceived as the result of low- to high-level retinal/cortical
processing. Modelling the detection of tilt in these illusions and their
strengths as they are perceived is a challenging task computationally and leads
to development of techniques that match with human performance. In this study,
we present a predictive and quantitative approach for modeling foveal and
peripheral vision in the induced tilt in Caf\'e Wall illusion in which parallel
mortar lines between shifted rows of black and white tiles appear to converge
and diverge. A bioderived filtering model for the responses of retinal/cortical
simple cells to the stimulus using Difference of Gaussians is utilized with an
analytic processing pipeline introduced in our previous studies to quantify the
angle of tilt in the model. Here we have considered visual characteristics of
foveal and peripheral vision in the perceived tilt in the pattern to predict
different degrees of tilt in different areas of the fovea and periphery as the
eye saccades to different parts of the image. The tilt analysis results from
several sampling sizes and aspect ratios, modelling variant foveal views are
used from our previous investigations on the local tilt, and we specifically
investigate in this work, different configurations of the whole pattern
modelling variant Gestalt views across multiple scales in order to provide
confidence intervals around the predicted tilts. The foveal sample sets are
verified and quantified using two different sampling methods. We present here a
precise and quantified comparison contrasting local tilt detection in the
foveal sets with a global average across all of the Caf\'e Wall configurations
tested in this work.
|
[
{
"version": "v1",
"created": "Sun, 17 Sep 2017 10:12:06 GMT"
}
] | 2017-10-04T00:00:00 |
[
[
"Nematzadeh",
"Nasim",
""
],
[
"Powers",
"David M. W.",
""
]
] |
new_dataset
| 0.956665 |
1603.05736
|
Alexander Barg
|
Talha Cihad Gulcu, Min Ye, and Alexander Barg
|
Construction of polar codes for arbitrary discrete memoryless channels
|
The results are unchanged, minor changes in the proofs
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is known that polar codes can be efficiently constructed for binary-input
channels. At the same time, existing algorithms for general input alphabets are
less practical because of high complexity. We address the construction problem
for the general case, and analyze an algorithm that is based on successive
reduction of the output alphabet size of the subchannels in each recursion
step. For this procedure we estimate the approximation error as
$O(\mu^{-1/(q-1)}),$ where $\mu$ is the "quantization parameter," i.e., the
maximum size of the subchannel output alphabet allowed by the algorithm. The
complexity of the code construction scales as $O(N\mu^4),$ where $N$ is the
length of the code.
We also show that if the polarizing operation relies on modulo-$q$ addition,
it is possible to merge subsets of output symbols without any loss in
subchannel capacity. Performing this procedure before each approximation step
results in a further speed-up of the code construction, and the resulting codes
have smaller gap to capacity. We show that a similar acceleration can be
attained for polar codes over finite field alphabets.
Experimentation shows that the suggested construction algorithms can be used
to construct long polar codes for alphabets of size $q=16$ and more with
acceptable loss of the code rate for a variety of polarizing transforms.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2016 00:34:10 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Sep 2017 20:18:18 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Gulcu",
"Talha Cihad",
""
],
[
"Ye",
"Min",
""
],
[
"Barg",
"Alexander",
""
]
] |
new_dataset
| 0.986384 |
1607.04559
|
Xinyu Gao
|
Xinyu Gao, Linglong Dai, Akbar M. Sayeed
|
Low RF-Complexity Technologies to Enable Millimeter-Wave MIMO with Large
Antenna Array for 5G Wireless Communications
|
This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessible
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter-wave (mmWave) MIMO with large antenna array has attracted
considerable interests from academic and industry communities, as it can
provide larger bandwidth and higher spectrum efficiency. However, with hundreds
of antennas, the number of radio frequency (RF) chains required by mmWave MIMO
is also huge, leading to unaffordable hardware cost and power consumption in
practice. In this paper, we investigate low RF-complexity technologies to solve
this bottleneck. We first review the evolution of low RF-complexity
technologies from microwave frequencies to mmWave frequencies. Then, we discuss
two promising low RF-complexity technologies for mmWave MIMO systems in detail,
i.e., phased array based hybrid precoding (PAHP) and lens array based hybrid
precoding (LAHP), including their principles, advantages, challenges, and
recent results. We compare the performance of these two technologies to draw
some insights about how they can be deployed in practice. Finally, we conclude
this paper and point out some future research directions in this area.
|
[
{
"version": "v1",
"created": "Fri, 15 Jul 2016 15:39:15 GMT"
},
{
"version": "v2",
"created": "Sat, 16 Sep 2017 15:53:28 GMT"
},
{
"version": "v3",
"created": "Sun, 1 Oct 2017 03:10:39 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Gao",
"Xinyu",
""
],
[
"Dai",
"Linglong",
""
],
[
"Sayeed",
"Akbar M.",
""
]
] |
new_dataset
| 0.997878 |
1610.03452
|
Emiliano De Cristofaro
|
Gabriel Emile Hine, Jeremiah Onaolapo, Emiliano De Cristofaro, Nicolas
Kourtellis, Ilias Leontiadis, Riginos Samaras, Gianluca Stringhini, Jeremy
Blackburn
|
Kek, Cucks, and God Emperor Trump: A Measurement Study of 4chan's
Politically Incorrect Forum and Its Effects on the Web
|
A shorter version of this paper appears in the Proceedings of the
11th International AAAI Conference on Web and Social Media (ICWSM'17). Please
cite the ICWSM'17 paper. Corresponding author: [email protected]
| null | null | null |
cs.SI cs.CY cs.HC physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The discussion-board site 4chan has been part of the Internet's dark
underbelly since its inception, and recent political events have put it
increasingly in the spotlight. In particular, /pol/, the "Politically
Incorrect" board, has been a central figure in the outlandish 2016 US election
season, as it has often been linked to the alt-right movement and its rhetoric
of hate and racism. However, 4chan remains relatively unstudied by the
scientific community: little is known about its user base, the content it
generates, and how it affects other parts of the Web. In this paper, we start
addressing this gap by analyzing /pol/ along several axes, using a dataset of
over 8M posts we collected over two and a half months. First, we perform a
general characterization, showing that /pol/ users are well distributed around
the world and that 4chan's unique features encourage fresh discussions. We also
analyze content, finding, for instance, that YouTube links and hate speech are
predominant on /pol/. Overall, our analysis not only provides the first
measurement study of /pol/, but also insight into online harassment and hate
speech trends in social media.
|
[
{
"version": "v1",
"created": "Tue, 11 Oct 2016 18:11:50 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Oct 2016 08:57:43 GMT"
},
{
"version": "v3",
"created": "Mon, 7 Nov 2016 17:35:37 GMT"
},
{
"version": "v4",
"created": "Mon, 13 Mar 2017 14:38:57 GMT"
},
{
"version": "v5",
"created": "Sun, 1 Oct 2017 17:09:21 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Hine",
"Gabriel Emile",
""
],
[
"Onaolapo",
"Jeremiah",
""
],
[
"De Cristofaro",
"Emiliano",
""
],
[
"Kourtellis",
"Nicolas",
""
],
[
"Leontiadis",
"Ilias",
""
],
[
"Samaras",
"Riginos",
""
],
[
"Stringhini",
"Gianluca",
""
],
[
"Blackburn",
"Jeremy",
""
]
] |
new_dataset
| 0.998342 |
1705.06947
|
Emiliano De Cristofaro
|
Savvas Zannettou and Tristan Caulfield and Emiliano De Cristofaro and
Nicolas Kourtellis and Ilias Leontiadis and Michael Sirivianos and Gianluca
Stringhini and Jeremy Blackburn
|
The Web Centipede: Understanding How Web Communities Influence Each
Other Through the Lens of Mainstream and Alternative News Sources
|
To appear in the 17th ACM Internet Measurement Conference (IMC 2017)
| null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the number and the diversity of news outlets on the Web grow, so does the
opportunity for "alternative" sources of information to emerge. Using large
social networks like Twitter and Facebook, misleading, false, or agenda-driven
information can quickly and seamlessly spread online, deceiving people or
influencing their opinions. Also, the increased engagement of tightly knit
communities, such as Reddit and 4chan, further compounds the problem, as their
users initiate and propagate alternative information, not only within their own
communities, but also to different ones as well as various social media. In
fact, these platforms have become an important piece of the modern information
ecosystem, which, thus far, has not been studied as a whole.
In this paper, we begin to fill this gap by studying mainstream and
alternative news shared on Twitter, Reddit, and 4chan. By analyzing millions of
posts around several axes, we measure how mainstream and alternative news flows
between these platforms. Our results indicate that alt-right communities within
4chan and Reddit can have a surprising level of influence on Twitter, providing
evidence that "fringe" communities often succeed in spreading alternative news
to mainstream social networks and the greater Web.
|
[
{
"version": "v1",
"created": "Fri, 19 May 2017 12:01:44 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Sep 2017 12:07:47 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Zannettou",
"Savvas",
""
],
[
"Caulfield",
"Tristan",
""
],
[
"De Cristofaro",
"Emiliano",
""
],
[
"Kourtellis",
"Nicolas",
""
],
[
"Leontiadis",
"Ilias",
""
],
[
"Sirivianos",
"Michael",
""
],
[
"Stringhini",
"Gianluca",
""
],
[
"Blackburn",
"Jeremy",
""
]
] |
new_dataset
| 0.994248 |
1708.02139
|
Zeming Lin
|
Zeming Lin, Jonas Gehring, Vasil Khalidov, Gabriel Synnaeve
|
STARDATA: A StarCraft AI Research Dataset
|
To be presented at AIIDE17
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We release a dataset of 65646 StarCraft replays that contains 1535 million
frames and 496 million player actions. We provide full game state data along
with the original replays that can be viewed in StarCraft. The game state data
was recorded every 3 frames which ensures suitability for a wide variety of
machine learning tasks such as strategy classification, inverse reinforcement
learning, imitation learning, forward modeling, partial information extraction,
and others. We use TorchCraft to extract and store the data, which standardizes
the data format for both reading from replays and reading directly from the
game. Furthermore, the data can be used on different operating systems and
platforms. The dataset contains valid, non-corrupted replays only and its
quality and diversity was ensured by a number of heuristics. We illustrate the
diversity of the data with various statistics and provide examples of tasks
that benefit from the dataset. We make the dataset available at
https://github.com/TorchCraft/StarData . En Taro Adun!
|
[
{
"version": "v1",
"created": "Mon, 7 Aug 2017 14:47:47 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Lin",
"Zeming",
""
],
[
"Gehring",
"Jonas",
""
],
[
"Khalidov",
"Vasil",
""
],
[
"Synnaeve",
"Gabriel",
""
]
] |
new_dataset
| 0.999811 |
1709.09612
|
Abhishek Dubey
|
Michael A. Walker, Abhishek Dubey, Aron Laszka, and Douglas C. Schmidt
|
PlaTIBART: a Platform for Transactive IoT Blockchain Applications with
Repeatable Testing
|
Workshop on Middleware and Applications for the Internet of Things
(M4IoT) 2017
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of blockchain-enabled IoT applications, there is an increased
need for related software patterns, middleware concepts, and testing practices
to ensure adequate quality and productivity. IoT and blockchain each provide
different design goals, concepts, and practices that must be integrated,
including the distributed actor model and fault tolerance from IoT and
transactive information integrity over untrustworthy sources from blockchain.
Both IoT and blockchain are emerging technologies and both lack codified
patterns and practices for development of applications when combined. This
paper describes PlaTIBART, which is a platform for transactive IoT blockchain
applications with repeatable testing that combines the Actor pattern (which is
a commonly used model of computation in IoT) together with a custom Domain
Specific Language (DSL) and test network management tools. We show how
PlaTIBART has been applied to develop, test, and analyze fault-tolerant IoT
blockchain applications.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 16:38:03 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Sep 2017 01:44:46 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Walker",
"Michael A.",
""
],
[
"Dubey",
"Abhishek",
""
],
[
"Laszka",
"Aron",
""
],
[
"Schmidt",
"Douglas C.",
""
]
] |
new_dataset
| 0.970857 |
1710.00082
|
Anthony Rhodes
|
Anthony D. Rhodes
|
Real-Time Wind Noise Detection and Suppression with Neural-Based Signal
Reconstruction for Mult-Channel, Low-Power Devices
|
5 pages, 8 figures
| null | null | null |
cs.SD eess.AS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Active wind noise detection and suppression techniques are a new and
essential paradigm for enhancing ASR-based functionality with smart glasses, in
addition to other wearable and smart devices in the broader IoT (Internet of
things). In this paper, we develop two separate algorithms for wind noise
detection and suppression, respectively, operational in a challenging,
low-energy regime. Together, these algorithms comprise a robust wind noise
suppression system. In the first case, we advance a real-time wind detection
algorithm (RTWD) that uses two distinct sets of low-dimensional signal features
to discriminate the presence of wind noise with high accuracy. For wind noise
suppression, we employ an additional algorithm - attentive neural wind
suppression (ANWS) - that utilizes a neural network to reconstruct the wearer
speech signal from wind-corrupted audio in the spectral regions that are most
adversely affected by wind noise. Finally, we test our algorithms through
real-time experiments using low-power, multi-microphone devices with a wind
simulator under challenging detection criteria and a variety of wind
intensities.
|
[
{
"version": "v1",
"created": "Fri, 29 Sep 2017 20:33:38 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Rhodes",
"Anthony D.",
""
]
] |
new_dataset
| 0.993841 |
1710.00166
|
Tian Lei
|
Lei Tian, Xiaopeng Hong, Guoying Zhao, Chunxiao Fan, Yue Ming, and
Matti Pietik\"ainen
|
PCANet-II: When PCANet Meets the Second Order Pooling
| null | null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
PCANet, as one noticeable shallow network, employs the histogram
representation for feature pooling. However, there are three main problems
about this kind of pooling method. First, the histogram-based pooling method
binarizes the feature maps and leads to inevitable discriminative information
loss. Second, it is difficult to effectively combine other visual cues into a
compact representation, because the simple concatenation of various visual cues
leads to feature representation inefficiency. Third, the dimensionality of
histogram-based output grows exponentially with the number of feature maps
used. In order to overcome these problems, we propose a novel shallow network
model, named as PCANet-II. Compared with the histogram-based output, the second
order pooling not only provides more discriminative information by preserving
both the magnitude and sign of convolutional responses, but also dramatically
reduces the size of output features. Thus we combine the second order
statistical pooling method with the shallow network, i.e., PCANet. Moreover, it
is easy to combine other discriminative and robust cues by using the second
order pooling. So we introduce the binary feature difference encoding scheme
into our PCANet-II to further improve robustness. Experiments demonstrate the
effectiveness and robustness of our proposed PCANet-II method.
|
[
{
"version": "v1",
"created": "Sat, 30 Sep 2017 09:11:38 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Tian",
"Lei",
""
],
[
"Hong",
"Xiaopeng",
""
],
[
"Zhao",
"Guoying",
""
],
[
"Fan",
"Chunxiao",
""
],
[
"Ming",
"Yue",
""
],
[
"Pietikäinen",
"Matti",
""
]
] |
new_dataset
| 0.993327 |
1710.00319
|
Moran Koren
|
Itai Arieli, Moran Koren, Rann Smorodinsky
|
The Crowdfunding Game
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recent success of crowdfunding for supporting new and innovative products
has been overwhelming with over 34 Billion Dollars raised in 2015. In many
crowdfunding platforms, firms set a campaign threshold and contributions are
collected only if this threshold is reached. During the campaign, consumers are
uncertain as to the ex-post value of the product, the business model viability,
and the seller's reliability. Consumer who commit to a contribution therefore
gambles. This gamble is effected by the campaign's threshold. Contributions to
campaigns with higher thresholds are collected only if a greater number of
agents find the offering acceptable. Therefore, high threshold serves as a
social insurance and thus in high-threshold campaigns, potential contributors
feel more at ease with contributing. We introduce the crowdfunding game and
explore the contributor's dilemma in the context of experience goods. We
discuss equilibrium existence and related social welfare, information
aggregation and revenue implications.
|
[
{
"version": "v1",
"created": "Sun, 1 Oct 2017 09:10:47 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Arieli",
"Itai",
""
],
[
"Koren",
"Moran",
""
],
[
"Smorodinsky",
"Rann",
""
]
] |
new_dataset
| 0.980443 |
1710.00379
|
Yao-Yuan Yang
|
Yao-Yuan Yang, Shao-Chuan Lee, Yu-An Chung, Tung-En Wu, Si-An Chen,
Hsuan-Tien Lin
|
libact: Pool-based Active Learning in Python
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
libact is a Python package designed to make active learning easier for
general users. The package not only implements several popular active learning
strategies, but also features the active-learning-by-learning meta-algorithm
that assists the users to automatically select the best strategy on the fly.
Furthermore, the package provides a unified interface for implementing more
strategies, models and application-specific labelers. The package is
open-source on Github, and can be easily installed from Python Package Index
repository.
|
[
{
"version": "v1",
"created": "Sun, 1 Oct 2017 17:18:03 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Yang",
"Yao-Yuan",
""
],
[
"Lee",
"Shao-Chuan",
""
],
[
"Chung",
"Yu-An",
""
],
[
"Wu",
"Tung-En",
""
],
[
"Chen",
"Si-An",
""
],
[
"Lin",
"Hsuan-Tien",
""
]
] |
new_dataset
| 0.998368 |
1710.00453
|
Alane Suhr
|
Stephanie Zhou, Alane Suhr, Yoav Artzi
|
Visual Reasoning with Natural Language
|
AAAI NCHRC 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Natural language provides a widely accessible and expressive interface for
robotic agents. To understand language in complex environments, agents must
reason about the full range of language inputs and their correspondence to the
world. Such reasoning over language and vision is an open problem that is
receiving increasing attention. While existing data sets focus on visual
diversity, they do not display the full range of natural language expressions,
such as counting, set reasoning, and comparisons.
We propose a simple task for natural language visual reasoning, where images
are paired with descriptive statements. The task is to predict if a statement
is true for the given scene. This abstract describes our existing synthetic
images corpus and our current work on collecting real vision data.
|
[
{
"version": "v1",
"created": "Mon, 2 Oct 2017 01:52:05 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Zhou",
"Stephanie",
""
],
[
"Suhr",
"Alane",
""
],
[
"Artzi",
"Yoav",
""
]
] |
new_dataset
| 0.996529 |
1710.00490
|
Catarina Moreira
|
Catarina Moreira and Emmanuel Haven and Sandro Sozzo and Andreas
Wichert
|
The Dutch's Real World Financial Institute: Introducing Quantum-Like
Bayesian Networks as an Alternative Model to deal with Uncertainty
|
15 images, 33 pages
| null | null | null |
cs.AI quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we analyse and model a real life financial loan application
belonging to a sample bank in the Netherlands. The log is robust in terms of
data, containing a total of 262 200 event logs, belonging to 13 087 different
credit applications. The dataset is heterogeneous and consists of a mixture of
computer generated automatic processes and manual human tasks. The goal is to
work out a decision model, which represents the underlying tasks that make up
the loan application service, and to assess potential areas of improvement of
the institution's internal processes. To this end we study the impact of
incomplete event logs for the extraction and analysis of business processes. It
is quite common that event logs are incomplete with several amounts of missing
information (for instance, workers forget to register their tasks). Absence of
data is translated into a drastic decrease of precision and compromises the
decision models, leading to biased and unrepresentative results. We investigate
how classical probabilistic models are affected by incomplete event logs and we
explore quantum-like probabilistic inferences as an alternative mathematical
model to classical probability. This work represents a first step towards
systematic investigation of the impact of quantum interference in a real life
large scale decision scenario. The results obtained in this study indicate
that, under high levels of uncertainty, the quantum-like models generate
quantum interference terms, which allow an additional non-linear
parameterisation of the data. Experimental results attest the efficiency of the
quantum-like Bayesian networks, since the application of interference terms is
able to reduce the error percentage of inferences performed over quantum-like
models when compared to inferences produced by classical models.
|
[
{
"version": "v1",
"created": "Mon, 2 Oct 2017 05:28:03 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Moreira",
"Catarina",
""
],
[
"Haven",
"Emmanuel",
""
],
[
"Sozzo",
"Sandro",
""
],
[
"Wichert",
"Andreas",
""
]
] |
new_dataset
| 0.997334 |
1710.00506
|
Tamoor-Ul-Hassan Syed
|
Syed Tamoor-ul-Hassan, Sumudu Samarakoon, Mehdi Bennis, Matti
Latva-aho, Choong-Seong Hong
|
Learning-based Caching in Cloud-Aided Wireless Networks
|
4 pages, 5 figures, Accepted, IEEE Comm Letter 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies content caching in cloud-aided wireless networks where
small cell base stations with limited storage are connected to the cloud via
limited capacity fronthaul links. By formulating a utility (inverse of service
delay) maximization problem, we propose a cache update algorithm based on
spatio-temporal traffic demands. To account for the large number of contents,
we propose a content clustering algorithm to group similar contents.
Subsequently, with the aid of regret learning at small cell base stations and
the cloud, each base station caches contents based on the learned content
popularity subject to its storage constraints. The performance of the proposed
caching algorithm is evaluated for sparse and dense environments while
investigating the tradeoff between global and local class popularity.
Simulation results show 15% and 40% gains in the proposed method compared to
various baselines.
|
[
{
"version": "v1",
"created": "Mon, 2 Oct 2017 06:45:30 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Tamoor-ul-Hassan",
"Syed",
""
],
[
"Samarakoon",
"Sumudu",
""
],
[
"Bennis",
"Mehdi",
""
],
[
"Latva-aho",
"Matti",
""
],
[
"Hong",
"Choong-Seong",
""
]
] |
new_dataset
| 0.98675 |
1710.00517
|
Hiroshi Kawasaki
|
Yuki Shiba, Satoshi Ono, Ryo Furukawa, Shinsaku Hiura, Hiroshi
Kawasaki
|
Temporal shape super-resolution by intra-frame motion encoding using
high-fps structured light
|
9 pages, Published at the International Conference on Computer Vision
(ICCV 2017)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the solutions of depth imaging of moving scene is to project a static
pattern on the object and use just a single image for reconstruction. However,
if the motion of the object is too fast with respect to the exposure time of
the image sensor, patterns on the captured image are blurred and reconstruction
fails. In this paper, we impose multiple projection patterns into each single
captured image to realize temporal super resolution of the depth image
sequences. With our method, multiple patterns are projected onto the object
with higher fps than possible with a camera. In this case, the observed pattern
varies depending on the depth and motion of the object, so we can extract
temporal information of the scene from each single image. The decoding process
is realized using a learning-based approach where no geometric calibration is
needed. Experiments confirm the effectiveness of our method where sequential
shapes are reconstructed from a single image. Both quantitative evaluations and
comparisons with recent techniques were also conducted.
|
[
{
"version": "v1",
"created": "Mon, 2 Oct 2017 07:52:04 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Shiba",
"Yuki",
""
],
[
"Ono",
"Satoshi",
""
],
[
"Furukawa",
"Ryo",
""
],
[
"Hiura",
"Shinsaku",
""
],
[
"Kawasaki",
"Hiroshi",
""
]
] |
new_dataset
| 0.979639 |
1710.00813
|
Conrad Rosenbrock
|
Conred W. Rosenbrock
|
A Practical Python API for Querying AFLOWLIB
|
7 pages, 3 code listings
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large databases such as aflowlib.org provide valuable data sources for
discovering material trends through machine learning. Although a REST API and
query language are available, there is a learning curve associated with the
AFLUX language that acts as a barrier for new users. Additionally, the data is
stored using non-standard serialization formats. Here we present a high-level
API that allows immediate access to the aflowlib data using standard python
operators and language features. It provides an easy way to integrate aflowlib
data with other python materials packages such as ase and quippy, and provides
automatic deserialization into numpy arrays and python objects. This package is
available via "pip install aflow".
|
[
{
"version": "v1",
"created": "Thu, 28 Sep 2017 20:38:47 GMT"
}
] | 2017-10-03T00:00:00 |
[
[
"Rosenbrock",
"Conred W.",
""
]
] |
new_dataset
| 0.999286 |
1706.02885
|
Satoshi Koide
|
Satoshi Koide, Yukihiro Tadokoro, Chuan Xiao, Yoshiharu Ishikawa
|
CiNCT: Compression and retrieval for massive vehicular trajectories via
relative movement labeling
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a compressed data structure for moving object
trajectories in a road network, which are represented as sequences of road
edges. Unlike existing compression methods for trajectories in a network, our
method supports pattern matching and decompression from an arbitrary position
while retaining a high compressibility with theoretical guarantees.
Specifically, our method is based on FM-index, a fast and compact data
structure for pattern matching. To enhance the compression, we incorporate the
sparsity of road networks into the data structure. In particular, we present
the novel concepts of relative movement labeling and PseudoRank, each
contributing to significant reductions in data size and query processing time.
Our theoretical analysis and experimental studies reveal the advantages of our
proposed method as compared to existing trajectory compression methods and
FM-index variants.
|
[
{
"version": "v1",
"created": "Fri, 9 Jun 2017 10:25:55 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Sep 2017 12:28:12 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Koide",
"Satoshi",
""
],
[
"Tadokoro",
"Yukihiro",
""
],
[
"Xiao",
"Chuan",
""
],
[
"Ishikawa",
"Yoshiharu",
""
]
] |
new_dataset
| 0.992843 |
1709.09409
|
George Fragulis
|
Ioannis A. Skordas, Nikolaos Tsirekas, Nestoras Kolovos, George F.
Fragulis, Athanasios G. Triantafyllou and Maria G. Bouliou
|
e-Sem: Dynamic Seminar Management System for Primary, Secondary and
Tertiary Education
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the dynamic seminar management system named 'e-Sem',
developed according to the opensource software philosophy. Due to its dynamic
management functionality, it can equally adapt to any education environment
(Primary, Secondary, Tertiary). The purpose of the proposed dynamic system is
ease of use and handling, by any class of users, without the need of special
guidance. Also, students are given the opportunity to: a) register as users; b)
enroll in seminars in a simple way; c) receive e-learning material at any time
of day any day of week, and d) be informed of new announcements concerning the
seminar in which they are enrolled . In addition, the administrator and the
tutors have a number of tools such as : management seminars and trainees in a
friendly way, sending educational material as well as new announcements to the
trainees; the possibility of electronic recording of presence or absence of the
trainees in a seminar, and direct printing of a certificate of successful
attendance of a seminar for each trainee. The application also offers features
such as electronic organization, storage and presentation of educational
material, overcoming the limiting factors of space and time of classical
teaching, thus creating a dynamic environment
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 09:31:35 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Sep 2017 10:17:07 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Skordas",
"Ioannis A.",
""
],
[
"Tsirekas",
"Nikolaos",
""
],
[
"Kolovos",
"Nestoras",
""
],
[
"Fragulis",
"George F.",
""
],
[
"Triantafyllou",
"Athanasios G.",
""
],
[
"Bouliou",
"Maria G.",
""
]
] |
new_dataset
| 0.998171 |
1709.10147
|
John Clemens
|
J. Aaron Pendergrass, Sarah Helble, John Clemens, Peter Loscocco
|
Maat: A Platform Service for Measurement and Attestation
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software integrity measurement and attestation (M&A) are critical
technologies for evaluating the trustworthiness of software platforms. To best
support these technologies, next generation systems must provide a centralized
service for securely selecting, collecting, and evaluating integrity
measurements. Centralization of M&A avoids duplication, minimizes security
risks to the system, and ensures correct ad- ministration of integrity policies
and systems. This paper details the desirable features and properties of such a
system, and introduces Maat, a prototype implementation of an M&A service that
meets these properties. Maat is a platform service that provides a centralized
policy-driven framework for determining which measurement tools and protocols
to use to meet the needs of a given integrity evaluation. Maat simplifies the
task of integrating integrity measurements into a range of larger trust
decisions such as authentication, network access control, or delegated
computations.
|
[
{
"version": "v1",
"created": "Thu, 28 Sep 2017 19:50:12 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Pendergrass",
"J. Aaron",
""
],
[
"Helble",
"Sarah",
""
],
[
"Clemens",
"John",
""
],
[
"Loscocco",
"Peter",
""
]
] |
new_dataset
| 0.989818 |
1709.10159
|
Haji Mohammad Saleem
|
Haji Mohammad Saleem, Kelly P Dillon, Susan Benesch and Derek Ruths
|
A Web of Hate: Tackling Hateful Speech in Online Social Spaces
|
9 pages, presented at the first workshop on Text Analytics for
Cybersecurity and Online Safety (TA-COS), collocated with LREC 2016
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Online social platforms are beset with hateful speech - content that
expresses hatred for a person or group of people. Such content can frighten,
intimidate, or silence platform users, and some of it can inspire other users
to commit violence. Despite widespread recognition of the problems posed by
such content, reliable solutions even for detecting hateful speech are lacking.
In the present work, we establish why keyword-based methods are insufficient
for detection. We then propose an approach to detecting hateful speech that
uses content produced by self-identifying hateful communities as training data.
Our approach bypasses the expensive annotation process often required to train
keyword systems and performs well across several established platforms, making
substantial improvements over current state-of-the-art approaches.
|
[
{
"version": "v1",
"created": "Thu, 28 Sep 2017 20:31:30 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Saleem",
"Haji Mohammad",
""
],
[
"Dillon",
"Kelly P",
""
],
[
"Benesch",
"Susan",
""
],
[
"Ruths",
"Derek",
""
]
] |
new_dataset
| 0.999302 |
1709.10275
|
Chris Lehnert
|
Chris Lehnert, Chris McCool, Tristan Perez
|
In-Field Peduncle Detection of Sweet Peppers for Robotic Harvesting: a
comparative study
|
Submitted to International Conference on Robotics and Automation
2018, under review
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robotic harvesting of crops has the potential to disrupt current agricultural
practices. A key element to enabling robotic harvesting is to safely remove the
crop from the plant which often involves locating and cutting the peduncle, the
part of the crop that attaches it to the main stem of the plant.
In this paper we present a comparative study of two methods for performing
peduncle detection. The first method is based on classic colour and geometric
features obtained from the scene with a support vector machine classifier,
referred to as PFH-SVM. The second method is an efficient deep neural network
approach, MiniInception, that is able to be deployed on a robotic platform. In
both cases we employ a secondary filtering process that enforces reasonable
assumptions about the crop structure, such as the proximity of the peduncle to
the crop. Our tests are conducted on Harvey, a sweet pepper harvesting robot,
and is evaluated in a greenhouse using two varieties of sweet pepper, Ducati
and Mercuno. We demonstrate that the MiniInception method achieves impressive
accuracy and considerably outperforms the PFH-SVM approach achieving an F1
score of 0.564 and 0.302 respectively.
|
[
{
"version": "v1",
"created": "Fri, 29 Sep 2017 08:10:33 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Lehnert",
"Chris",
""
],
[
"McCool",
"Chris",
""
],
[
"Perez",
"Tristan",
""
]
] |
new_dataset
| 0.982652 |
1709.10299
|
Souneil Park
|
Souneil Park, Joan Serra, Enrique Frias Martinez, Nuria Oliver
|
MobInsight: A Framework Using Semantic Neighborhood Features for
Localized Interpretations of Urban Mobility
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Collective urban mobility embodies the residents' local insights on the city.
Mobility practices of the residents are produced from their spatial choices,
which involve various considerations such as the atmosphere of destinations,
distance, past experiences, and preferences. The advances in mobile computing
and the rise of geo-social platforms have provided the means for capturing the
mobility practices; however, interpreting the residents' insights is
challenging due to the scale and complexity of an urban environment, and its
unique context. In this paper, we present MobInsight, a framework for making
localized interpretations of urban mobility that reflect various aspects of the
urbanism. MobInsight extracts a rich set of neighborhood features through
holistic semantic aggregation, and models the mobility between all-pairs of
neighborhoods. We evaluate MobInsight with the mobility data of Barcelona and
demonstrate diverse localized and semantically-rich interpretations.
|
[
{
"version": "v1",
"created": "Fri, 29 Sep 2017 09:31:59 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Park",
"Souneil",
""
],
[
"Serra",
"Joan",
""
],
[
"Martinez",
"Enrique Frias",
""
],
[
"Oliver",
"Nuria",
""
]
] |
new_dataset
| 0.997349 |
1709.10371
|
Meryem Benammar
|
Meryem Benammar, Valerio Bioglio, Frederic Gabry, Ingmar Land
|
Multi-Kernel Polar Codes: Proof of Polarization and Error Exponents
|
Accepted and to be presented at ITW 2017, Kaohsiung
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we investigate a novel family of polar codes based on
multi-kernel constructions, proving that this construction actually polarizes.
To this end, we derive a new and more general proof of polarization, which
gives sufficient conditions for kernels to polarize. Finally, we derive the
convergence rate of the multi-kernel construction and relate it to the
convergence rate of each of the constituent kernels.
|
[
{
"version": "v1",
"created": "Fri, 29 Sep 2017 12:39:37 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Benammar",
"Meryem",
""
],
[
"Bioglio",
"Valerio",
""
],
[
"Gabry",
"Frederic",
""
],
[
"Land",
"Ingmar",
""
]
] |
new_dataset
| 0.998228 |
1709.10431
|
Yanchao Yu
|
Yanchao Yu, Arash Eshghi, Gregory Mills, Oliver Joseph Lemon
|
The BURCHAK corpus: a Challenge Data Set for Interactive Learning of
Visually Grounded Word Meanings
|
10 pages, THE 6TH WORKSHOP ON VISION AND LANGUAGE (VL'17)
| null |
10.18653/v1/W17-2001
| null |
cs.CL cs.AI cs.LG cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We motivate and describe a new freely available human-human dialogue dataset
for interactive learning of visually grounded word meanings through ostensive
definition by a tutor to a learner. The data has been collected using a novel,
character-by-character variant of the DiET chat tool (Healey et al., 2003;
Mills and Healey, submitted) with a novel task, where a Learner needs to learn
invented visual attribute words (such as " burchak " for square) from a tutor.
As such, the text-based interactions closely resemble face-to-face conversation
and thus contain many of the linguistic phenomena encountered in natural,
spontaneous dialogue. These include self-and other-correction, mid-sentence
continuations, interruptions, overlaps, fillers, and hedges. We also present a
generic n-gram framework for building user (i.e. tutor) simulations from this
type of incremental data, which is freely available to researchers. We show
that the simulations produce outputs that are similar to the original data
(e.g. 78% turn match similarity). Finally, we train and evaluate a
Reinforcement Learning dialogue control agent for learning visually grounded
word meanings, trained from the BURCHAK corpus. The learned policy shows
comparable performance to a rule-based system built previously.
|
[
{
"version": "v1",
"created": "Fri, 29 Sep 2017 14:43:06 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Yu",
"Yanchao",
""
],
[
"Eshghi",
"Arash",
""
],
[
"Mills",
"Gregory",
""
],
[
"Lemon",
"Oliver Joseph",
""
]
] |
new_dataset
| 0.997161 |
1709.10486
|
Casey Kennington
|
Casey Kennington and Sarah Plane
|
Symbol, Conversational, and Societal Grounding with a Toy Robot
|
2 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Essential to meaningful interaction is grounding at the symbolic,
conversational, and societal levels. We present ongoing work with Anki's Cozmo
toy robot as a research platform where we leverage the recent
words-as-classifiers model of lexical semantics in interactive reference
resolution tasks for language grounding.
|
[
{
"version": "v1",
"created": "Fri, 29 Sep 2017 16:36:53 GMT"
}
] | 2017-10-02T00:00:00 |
[
[
"Kennington",
"Casey",
""
],
[
"Plane",
"Sarah",
""
]
] |
new_dataset
| 0.9798 |
1610.03793
|
Daniel Hein
|
Daniel Hein, Alexander Hentschel, Volkmar Sterzing, Michel Tokic,
Steffen Udluft
|
Introduction to the "Industrial Benchmark"
|
11 pages
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel reinforcement learning benchmark, called Industrial Benchmark, is
introduced. The Industrial Benchmark aims at being be realistic in the sense,
that it includes a variety of aspects that we found to be vital in industrial
applications. It is not designed to be an approximation of any real system, but
to pose the same hardness and complexity.
|
[
{
"version": "v1",
"created": "Wed, 12 Oct 2016 17:18:01 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Sep 2017 11:28:26 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Hein",
"Daniel",
""
],
[
"Hentschel",
"Alexander",
""
],
[
"Sterzing",
"Volkmar",
""
],
[
"Tokic",
"Michel",
""
],
[
"Udluft",
"Steffen",
""
]
] |
new_dataset
| 0.999642 |
1704.00058
|
Makoto Kobayashi
|
Makoto Kobayashi, Ryo Murakami, Shunsuke Saruwatari, Takashi Watanabe
|
Wireless Full-duplex Medium Access Control for Enhancing Energy
Efficiency
|
30 pages, 23 figures, Submitted to IEEE Transactions on Green
Communications and Networking
| null |
10.1109/TGCN.2017.2756883
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent years have witnessed a proliferation of battery-powered mobile
devices, e.g., smartphones, tablets, sensors, and laptops, which leads a
significant demand for high capacity wireless communication with high energy
efficiency. Among technologies to provide the efficiency is full-duplex
wireless communication. Full-duplex wireless enhances capacity by
simultaneously transmitting uplink and downlink data with limited frequency
resources. Previous studies on full-duplex wireless mostly focuses on doubling
the network capacity, whereas in this paper we discuss that full-duplex
wireless can also provide higher energy efficiency. We propose low power
communication by wireless full-duplexing (LPFD), focusing on the fact that the
full-duplex communication duration becomes half of the halfduplex communication
duration. In the LPFD, by using the sleep state in which the transceiver
provided in the wireless communication terminal is turned off, power
consumption of the wireless communication terminal is reduced and energy
efficiency in wireless full duplex is improved. Simulation results show that
the energy efficiency achieved by LPFD is up to approximately 17.3 times higher
than the energy efficiency achieved by existing full-duplex medium access
protocol. Further, it is up to approximately 27.5 times higher than the energy
efficiency using power saving mode of half-duplex communication.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 21:05:48 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Kobayashi",
"Makoto",
""
],
[
"Murakami",
"Ryo",
""
],
[
"Saruwatari",
"Shunsuke",
""
],
[
"Watanabe",
"Takashi",
""
]
] |
new_dataset
| 0.997311 |
1709.09287
|
Kaiyu Feng
|
Kaiyu Feng, Tao Guo, Gao Cong, Sourav S. Bhowmicks, Shuai Ma
|
SURGE: Continuous Detection of Bursty Regions Over a Stream of Spatial
Objects
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the proliferation of mobile devices and location-based services,
continuous generation of massive volume of streaming spatial objects (i.e.,
geo-tagged data) opens up new opportunities to address real-world problems by
analyzing them. In this paper, we present a novel continuous bursty region
detection problem that aims to continuously detect a bursty region of a given
size in a specified geographical area from a stream of spatial objects.
Specifically, a bursty region shows maximum spike in the number of spatial
objects in a given time window. The problem is useful in addressing several
real-world challenges such as surge pricing problem in online transportation
and disease outbreak detection. To solve the problem, we propose an exact
solution and two approximate solutions, and the approximation ratio is
$\frac{1-\alpha}{4}$ in terms of the burst score, where $\alpha$ is a parameter
to control the burst score. We further extend these solutions to support
detection of top-$k$ bursty regions. Extensive experiments with real-world data
are conducted to demonstrate the efficiency and effectiveness of our solutions.
|
[
{
"version": "v1",
"created": "Tue, 26 Sep 2017 23:58:29 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Sep 2017 06:36:04 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Feng",
"Kaiyu",
""
],
[
"Guo",
"Tao",
""
],
[
"Cong",
"Gao",
""
],
[
"Bhowmicks",
"Sourav S.",
""
],
[
"Ma",
"Shuai",
""
]
] |
new_dataset
| 0.996773 |
1709.09551
|
Chiara Boldrini
|
Elisabetta Biondi, Chiara Boldrini, Andrea Passarella, Marco Conti
|
What you lose when you snooze: how duty cycling impacts on the contact
process in opportunistic networks
|
Accepted for publication on ACM Transactions on Modeling and
Performance Evaluation of Computing Systems (ToMPECS)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In opportunistic networks, putting devices in energy saving mode is crucial
to preserve their battery, and hence to increase the lifetime of the network
and foster user participation. A popular strategy for energy saving is duty
cycling. However, when in energy saving mode, users cannot communicate with
each other. The side effects of duty cycling are twofold. On the one hand, duty
cycling may reduce the number of usable contacts for delivering messages,
increasing intercontact times and delays. On the other hand, duty cycling may
break long contacts into smaller contacts, thus also reducing the capacity of
the opportunistic network. Despite the potential serious effects, the role
played by duty cycling in opportunistic networks has been often neglected in
the literature. In order to fill this gap, in this paper we propose a general
model for deriving the pairwise contact and intercontact times measured when a
duty cycling policy is superimposed on the original encounter process
determined only by node mobility. The model we propose is general, i.e., not
bound to a specific distribution of contact and intercontact times, and very
accurate, as we show exploiting two traces of real human mobility for
validation. Using this model, we derive several interesting results about the
properties of measured contact and intercontact times with duty cycling: their
distribution, how their coefficient of variation changes depending on the duty
cycle value, how the duty cycling affects the capacity and delay of an
opportunistic network. The applicability of these results is broad, ranging
from performance models for opportunistic networks that factor in the duty
cycling effect, to the optimisation of the duty cycle to meet a certain target
performance.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 14:23:58 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Sep 2017 12:25:08 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Biondi",
"Elisabetta",
""
],
[
"Boldrini",
"Chiara",
""
],
[
"Passarella",
"Andrea",
""
],
[
"Conti",
"Marco",
""
]
] |
new_dataset
| 0.998738 |
1709.09733
|
Michael Lyons
|
Michael J. Lyons
|
NIME: A Community of Communities
| null |
A NIME Reader: Fifteen Years of New Interfaces for Musical
Expression, A.R. Jensenius and M.J. Lyons (eds.), Springer, pp.477-478, 2017
|
10.6084/m9.figshare.5386786
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Commentary on the article Fourteen Years of NIME: The Value and Meaning of
Community in Interactive Music Research by A. Marquez-Borbon and P. Stapleton.
|
[
{
"version": "v1",
"created": "Thu, 7 Sep 2017 19:25:48 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Lyons",
"Michael J.",
""
]
] |
new_dataset
| 0.999257 |
1709.09770
|
Pengfei Huang
|
Pengfei Huang, Eitan Yaakobi, Paul H. Siegel
|
Multi-Erasure Locally Recoverable Codes Over Small Fields
|
This is an extended version of arXiv:1701.06110. To appear in
Allerton 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erasure codes play an important role in storage systems to prevent data loss.
In this work, we study a class of erasure codes called Multi-Erasure Locally
Recoverable Codes (ME-LRCs) for storage arrays. Compared to previous related
works, we focus on the construction of ME-LRCs over small fields. We first
develop upper and lower bounds on the minimum distance of ME-LRCs. Our main
contribution is to propose a general construction of ME-LRCs based on
generalized tensor product codes, and study their erasure-correcting
properties. A decoding algorithm tailored for erasure recovery is given, and
correctable erasure patterns are identified. We then prove that our
construction yields optimal ME-LRCs with a wide range of code parameters, and
present some explicit ME-LRCs over small fields. Finally, we show that
generalized integrated interleaving (GII) codes can be treated as a subclass of
generalized tensor product codes, thus defining the exact relation between
these codes.
|
[
{
"version": "v1",
"created": "Thu, 28 Sep 2017 00:37:02 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Huang",
"Pengfei",
""
],
[
"Yaakobi",
"Eitan",
""
],
[
"Siegel",
"Paul H.",
""
]
] |
new_dataset
| 0.997009 |
1709.09816
|
Federico Fancellu
|
Ben Krause, Marco Damonte, Mihai Dobre, Daniel Duma, Joachim Fainberg,
Federico Fancellu, Emmanuel Kahembwe, Jianpeng Cheng, Bonnie Webber
|
Edina: Building an Open Domain Socialbot with Self-dialogues
|
10 pages; submitted to the 1st Proceedings of the Alexa Prize
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Edina, the University of Edinburgh's social bot for the Amazon
Alexa Prize competition. Edina is a conversational agent whose responses
utilize data harvested from Amazon Mechanical Turk (AMT) through an innovative
new technique we call self-dialogues. These are conversations in which a single
AMT Worker plays both participants in a dialogue. Such dialogues are
surprisingly natural, efficient to collect and reflective of relevant and/or
trending topics. These self-dialogues provide training data for a generative
neural network as well as a basis for soft rules used by a matching score
component. Each match of a soft rule against a user utterance is associated
with a confidence score which we show is strongly indicative of reply quality,
allowing this component to self-censor and be effectively integrated with other
components. Edina's full architecture features a rule-based system backing off
to a matching score, backing off to a generative neural network. Our hybrid
data-driven methodology thus addresses both coverage limitations of a strictly
rule-based approach and the lack of guarantees of a strictly machine-learning
approach.
|
[
{
"version": "v1",
"created": "Thu, 28 Sep 2017 06:13:33 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Krause",
"Ben",
""
],
[
"Damonte",
"Marco",
""
],
[
"Dobre",
"Mihai",
""
],
[
"Duma",
"Daniel",
""
],
[
"Fainberg",
"Joachim",
""
],
[
"Fancellu",
"Federico",
""
],
[
"Kahembwe",
"Emmanuel",
""
],
[
"Cheng",
"Jianpeng",
""
],
[
"Webber",
"Bonnie",
""
]
] |
new_dataset
| 0.998214 |
1709.09875
|
Jomy John
|
Jomy John
|
Recognition of Documents in Braille
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visually impaired people are integral part of the society and it has been a
must to provide them with means and system through which they may communicate
with the world. In this work, I would like to address how computers can be made
useful to read the scripts in Braille. The importance of this work is to reduce
communication gap between visually impaired people and the society. Braille
remains the most popular tactile reading code even in this century. There are
numerous amount of literature locked up in Braille. Braille recognition not
only reduces time in reading or extracting information from Braille document
but also helps people engaged in special education for correcting papers and
other school related works. The availability of such a system will enhance
communication and collaboration possibilities with visually impaired people.
Existing works supports only documents in white either bright or dull in
colour. Hardly any work could be traced on hand printed ordinary documents in
Braille.
|
[
{
"version": "v1",
"created": "Thu, 28 Sep 2017 09:51:33 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"John",
"Jomy",
""
]
] |
new_dataset
| 0.984298 |
1709.09931
|
Angela He
|
Angela He
|
Educational game design: game elements for promoting engagement
|
54 pages, 3 figures, 2 tables
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Engagement in educational games, a recently popular academic topic, has been
shown to increase learning performance, as well as a number of attitudinal
factors, such as intrinsic interest and motivation. However, there is a lack of
research on how games can be designed to promote engagement. This mixed methods
case study aimed to discover effective game elements for promoting 17-18 year
old high school students' engagement with an educational game. Using
within-case and cross-case analyses and triangulated data, 10 elements emerged
and were categorized into the constructs of story, gameplay, and atmosphere.
Examples and connections to the literature for each element are reported.
Findings implicate that educational game design for both learning and
engagement is composed of educational-game specific elements, game design for
solely engagement is similar for both educational and entertainment games, and
a gap on educational game design technique instead of theory should be
addressed to further benefit educational game development.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 02:48:27 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"He",
"Angela",
""
]
] |
new_dataset
| 0.964687 |
1709.09936
|
Banu Kabakulak
|
Banu Kabakulak, Z. Caner Ta\c{s}k{\i}n, and Ali Emre Pusane
|
A Branch-and-Cut Algorithm to Design LDPC Codes without Small Cycles in
Communication Systems
|
31 pages, 18 figures, 7 tables
| null | null | null |
cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a digital communication system, information is sent from one place to
another over a noisy communication channel using binary symbols (bits).
Original information is encoded by adding redundant bits, which are then used
by low--density parity--check (LDPC) codes to detect and correct errors that
may have been introduced during transmission. Error correction capability of an
LDPC code is severely degraded due to harmful structures such as small cycles
in its bipartite graph representation known as Tanner graph (TG). We introduce
an integer programming formulation to generate a TG for a given smallest cycle
length. We propose a branch-and-cut algorithm for its solution and investigate
structural properties of the problem to derive valid inequalities and variable
fixing rules. We introduce a heuristic to obtain feasible solutions of the
problem. Our computational experiments show that our algorithm can generate
LDPC codes without small cycles in acceptable amount of time for practically
relevant code lengths.
|
[
{
"version": "v1",
"created": "Thu, 28 Sep 2017 13:19:08 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Kabakulak",
"Banu",
""
],
[
"Taşkın",
"Z. Caner",
""
],
[
"Pusane",
"Ali Emre",
""
]
] |
new_dataset
| 0.999671 |
1709.09991
|
Benedikt Bollig
|
Benedikt Bollig, Marie Fortin and Paul Gastin
|
Communicating Finite-State Machines and Two-Variable Logic
| null | null | null | null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Communicating finite-state machines are a fundamental, well-studied model of
finite-state processes that communicate via unbounded first-in first-out
channels. We show that they are expressively equivalent to existential MSO
logic with two first-order variables and the order relation.
|
[
{
"version": "v1",
"created": "Thu, 28 Sep 2017 14:39:36 GMT"
}
] | 2017-09-29T00:00:00 |
[
[
"Bollig",
"Benedikt",
""
],
[
"Fortin",
"Marie",
""
],
[
"Gastin",
"Paul",
""
]
] |
new_dataset
| 0.992365 |
1511.07607
|
Rahul Anand Sharma Mr.
|
Rahul Anand Sharma, Pramod Sankar K and CV Jawahar
|
Fine-Grain Annotation of Cricket Videos
|
ACPR 2015
| null | null | null |
cs.MM cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recognition of human activities is one of the key problems in video
understanding. Action recognition is challenging even for specific categories
of videos, such as sports, that contain only a small set of actions.
Interestingly, sports videos are accompanied by detailed commentaries available
online, which could be used to perform action annotation in a weakly-supervised
setting. For the specific case of Cricket videos, we address the challenge of
temporal segmentation and annotation of ctions with semantic descriptions. Our
solution consists of two stages. In the first stage, the video is segmented
into "scenes", by utilizing the scene category information extracted from
text-commentary. The second stage consists of classifying video-shots as well
as the phrases in the textual description into various categories. The relevant
phrases are then suitably mapped to the video-shots. The novel aspect of this
work is the fine temporal scale at which semantic information is assigned to
the video. As a result of our approach, we enable retrieval of specific actions
that last only a few seconds, from several hours of video. This solution yields
a large number of labeled exemplars, with no manual effort, that could be used
by machine learning algorithms to learn complex actions.
|
[
{
"version": "v1",
"created": "Tue, 24 Nov 2015 08:34:20 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Sep 2017 10:48:11 GMT"
}
] | 2017-09-28T00:00:00 |
[
[
"Sharma",
"Rahul Anand",
""
],
[
"K",
"Pramod Sankar",
""
],
[
"Jawahar",
"CV",
""
]
] |
new_dataset
| 0.999321 |
1709.09443
|
Lea Frermann
|
Lea Frermann and Michael C. Frank
|
Prosodic Features from Large Corpora of Child-Directed Speech as
Predictors of the Age of Acquisition of Words
| null | null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
The impressive ability of children to acquire language is a widely studied
phenomenon, and the factors influencing the pace and patterns of word learning
remains a subject of active research. Although many models predicting the age
of acquisition of words have been proposed, little emphasis has been directed
to the raw input children achieve. In this work we present a comparatively
large-scale multi-modal corpus of prosody-text aligned child directed speech.
Our corpus contains automatically extracted word-level prosodic features, and
we investigate the utility of this information as predictors of age of
acquisition. We show that prosody features boost predictive power in a
regularized regression, and demonstrate their utility in the context of a
multi-modal factorized language models trained and tested on child-directed
speech.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 10:50:12 GMT"
}
] | 2017-09-28T00:00:00 |
[
[
"Frermann",
"Lea",
""
],
[
"Frank",
"Michael C.",
""
]
] |
new_dataset
| 0.989369 |
1709.09484
|
Anisse Ismaili
|
Anisse Ismaili
|
Routing Games over Time with FIFO policy
|
Submission to WINE-2017 Deadline was August 2nd AoE, 2017
| null | null | null |
cs.GT cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study atomic routing games where every agent travels both along its
decided edges and through time. The agents arriving on an edge are first lined
up in a \emph{first-in-first-out} queue and may wait: an edge is associated
with a capacity, which defines how many agents-per-time-step can pop from the
queue's head and enter the edge, to transit for a fixed delay. We show that the
best-response optimization problem is not approximable, and that deciding the
existence of a Nash equilibrium is complete for the second level of the
polynomial hierarchy. Then, we drop the rationality assumption, introduce a
behavioral concept based on GPS navigation, and study its worst-case efficiency
ratio to coordination.
|
[
{
"version": "v1",
"created": "Fri, 4 Aug 2017 02:22:46 GMT"
}
] | 2017-09-28T00:00:00 |
[
[
"Ismaili",
"Anisse",
""
]
] |
new_dataset
| 0.992246 |
1709.09574
|
Jelani Nelson
|
Jacob Teo Por Loong, Jelani Nelson, Huacheng Yu
|
Fillable arrays with constant time operations and a single bit of
redundancy
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the fillable array problem one must maintain an array A[1..n] of $w$-bit
entries subject to random access reads and writes, and also a
$\texttt{fill}(\Delta)$ operation which sets every entry of to some
$\Delta\in\{0,\ldots,2^w-1\}$. We show that with just one bit of redundancy,
i.e. a data structure using $nw+1$ bits of memory,
$\texttt{read}/\texttt{fill}$ can be implemented in worst case constant time,
and $\texttt{write}$ can be implemented in either amortized constant time
(deterministically) or worst case expected constant (randomized). In the latter
case, we need to store an additional $O(\log n)$ random bits to specify a
permutation drawn from an $1/n^2$-almost pairwise independent family.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 15:15:14 GMT"
}
] | 2017-09-28T00:00:00 |
[
[
"Loong",
"Jacob Teo Por",
""
],
[
"Nelson",
"Jelani",
""
],
[
"Yu",
"Huacheng",
""
]
] |
new_dataset
| 0.99889 |
1709.09615
|
Xiao Lu
|
Xiao Lu, Dusit Niyato, Hai Jiang, Dong In Kim, Yong Xiao and Zhu Han
|
Ambient Backscatter Networking: A Novel Paradigm to Assist Wireless
Powered Communications
|
A shortened version of this article is to appear in IEEE Wireless
Communications
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ambient backscatter communication technology has been introduced recently,
and is then quickly becoming a promising choice for self-sustainable
communication systems as an external power supply or a dedicated carrier
emitter is not required. By leveraging existing RF signal resources, ambient
backscatter technology can support sustainable and independent communications
and consequently open up a whole new set of applications that facilitate
Internet-of-Things (IoT). In this article, we study an integration of ambient
backscatter with wireless powered communication networks (WPCNs). We first
present an overview of backscatter communication systems with an emphasis on
the emerging ambient backscatter technology. Then we propose a novel hybrid
transmitter design by combining the advantages of both ambient backscatter and
wireless powered communications. Furthermore, in the cognitive radio
environment, we introduce a multiple access scheme to coordinate the hybrid
data transmissions. The performance evaluation shows that the hybrid
transmitter outperforms traditional designs. In addition, we discuss some open
issues related to the ambient backscatter networking.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 16:42:28 GMT"
}
] | 2017-09-28T00:00:00 |
[
[
"Lu",
"Xiao",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Jiang",
"Hai",
""
],
[
"Kim",
"Dong In",
""
],
[
"Xiao",
"Yong",
""
],
[
"Han",
"Zhu",
""
]
] |
new_dataset
| 0.999409 |
1709.09623
|
Hongxu Chen
|
Hongxu Chen, Alwen Tiu, Zhiwu Xu, Yang Liu
|
A Permission-Dependent Type System for Secure Information Flow Analysis
|
48 pages
| null | null | null |
cs.PL cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a novel type system for enforcing secure information flow in an
imperative language. Our work is motivated by the problem of statically
checking potential information leakage in Android applications. To this end, we
design a lightweight type system featuring Android permission model, where the
permissions are statically assigned to applications and are used to enforce
access control in the applications. We take inspiration from a type system by
Banerjee and Naumann (BN) to allow security types to be dependent on the
permissions of the applications. A novel feature of our type system is a typing
rule for conditional branching induced by permission testing, which introduces
a merging operator on security types, allowing more precise security policies
to be enforced. The soundness of our type system is proved with respect to a
notion of noninterference. In addition, a type inference algorithm is presented
for the underlying security type system, by reducing the inference problem to a
constraint solving problem in the lattice of security types.
|
[
{
"version": "v1",
"created": "Wed, 27 Sep 2017 16:55:25 GMT"
}
] | 2017-09-28T00:00:00 |
[
[
"Chen",
"Hongxu",
""
],
[
"Tiu",
"Alwen",
""
],
[
"Xu",
"Zhiwu",
""
],
[
"Liu",
"Yang",
""
]
] |
new_dataset
| 0.997756 |
1709.04883
|
Nane Kratzke
|
Nane Kratzke and Ren\'e Peinl
|
ClouNS - A Cloud-native Application Reference Model for Enterprise
Architects
| null | null |
10.1109/EDOCW.2016.7584353
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capability to operate cloud-native applications can generate enormous
business growth and value. But enterprise architects should be aware that
cloud-native applications are vulnerable to vendor lock-in. We investigated
cloud-native application design principles, public cloud service providers, and
industrial cloud standards. All results indicate that most cloud service
categories seem to foster vendor lock-in situations which might be especially
problematic for enterprise architectures. This might sound disillusioning at
first. However, we present a reference model for cloud-native applications that
relies only on a small subset of well standardized IaaS services. The reference
model can be used for codifying cloud technologies. It can guide technology
identification, classification, adoption, research and development processes
for cloud-native application and for vendor lock-in aware enterprise
architecture engineering methodologies.
|
[
{
"version": "v1",
"created": "Thu, 14 Sep 2017 17:16:09 GMT"
}
] | 2017-09-27T00:00:00 |
[
[
"Kratzke",
"Nane",
""
],
[
"Peinl",
"René",
""
]
] |
new_dataset
| 0.991146 |
1709.08666
|
Jennifer Carlet
|
Jennifer Carlet, Bernard Abayowa
|
Fast Vehicle Detection in Aerial Imagery
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, several real-time or near real-time object detectors have
been developed. However these object detectors are typically designed for
first-person view images where the subject is large in the image and do not
directly apply well to detecting vehicles in aerial imagery. Though some
detectors have been developed for aerial imagery, these are either slow or do
not handle multi-scale imagery very well. Here the popular YOLOv2 detector is
modified to vastly improve it's performance on aerial data. The modified
detector is compared to Faster RCNN on several aerial imagery datasets. The
proposed detector gives near state of the art performance at more than 4x the
speed.
|
[
{
"version": "v1",
"created": "Mon, 25 Sep 2017 18:41:01 GMT"
}
] | 2017-09-27T00:00:00 |
[
[
"Carlet",
"Jennifer",
""
],
[
"Abayowa",
"Bernard",
""
]
] |
new_dataset
| 0.991737 |
1709.08830
|
Yu Cheng
|
Devu Manikantan Shilay, Kin Gwn Lorey, Tianshu Weiz, Teems Lovetty,
and Yu Cheng
|
Catching Anomalous Distributed Photovoltaics: An Edge-based Multi-modal
Anomaly Detection
| null | null | null | null |
cs.SY cs.CR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A significant challenge in energy system cyber security is the current
inability to detect cyber-physical attacks targeting and originating from
distributed grid-edge devices such as photovoltaics (PV) panels, smart flexible
loads, and electric vehicles. We address this concern by designing and
developing a distributed, multi-modal anomaly detection approach that can sense
the health of the device and the electric power grid from the edge. This is
realized by exploiting unsupervised machine learning algorithms on multiple
sources of time-series data, fusing these multiple local observations and
flagging anomalies when a deviation from the normal behavior is observed.
We particularly focus on the cyber-physical threats to the distributed PVs
that has the potential to cause local disturbances or grid instabilities by
creating supply-demand mismatch, reverse power flow conditions etc. We use an
open source power system simulation tool called GridLAB-D, loaded with real
smart home and solar datasets to simulate the smart grid scenarios and to
illustrate the impact of PV attacks on the power system. Various attacks
targeting PV panels that create voltage fluctuations, reverse power flow etc
were designed and performed. We observe that while individual unsupervised
learning algorithms such as OCSVMs, Corrupt RF and PCA surpasses in identifying
particular attack type, PCA with Convex Hull outperforms all algorithms in
identifying all designed attacks with a true positive rate of 83.64% and an
accuracy of 95.78%. Our key insight is that due to the heterogeneous nature of
the distribution grid and the uncertainty in the type of the attack being
launched, relying on single mode of information for defense can lead to
increased false alarms and missed detection rates as one can design attacks to
hide within those uncertainties and remain stealthy.
|
[
{
"version": "v1",
"created": "Tue, 26 Sep 2017 04:54:46 GMT"
}
] | 2017-09-27T00:00:00 |
[
[
"Shilay",
"Devu Manikantan",
""
],
[
"Lorey",
"Kin Gwn",
""
],
[
"Weiz",
"Tianshu",
""
],
[
"Lovetty",
"Teems",
""
],
[
"Cheng",
"Yu",
""
]
] |
new_dataset
| 0.993879 |
1709.08831
|
Sandeep Konam
|
Sandeep Konam, Stephanie Rosenthal, Manuela Veloso
|
UAV and Service Robot Coordination for Indoor Object Search Tasks
|
IJCAI-2016 Workshop on Autonomous Mobile Service Robots
| null | null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our CoBot robots have successfully performed a variety of service tasks in
our multi-building environment including accompanying people to meetings and
delivering objects to offices due to its navigation and localization
capabilities. However, they lack the capability to visually search over desks
and other confined locations for an object of interest. Conversely, an
inexpensive GPS-denied quadcopter platform such as the Parrot ARDrone 2.0 could
perform this object search task if it had access to reasonable localization. In
this paper, we propose the concept of coordination between CoBot and the Parrot
ARDrone 2.0 to perform service-based object search tasks, in which CoBot
localizes and navigates to the general search areas carrying the ARDrone and
the ARDrone searches locally for objects. We propose a vision-based moving
target navigation algorithm that enables the ARDrone to localize with respect
to CoBot, search for objects, and return to the CoBot for future searches. We
demonstrate our algorithm in indoor environments on several search
trajectories.
|
[
{
"version": "v1",
"created": "Tue, 26 Sep 2017 05:04:37 GMT"
}
] | 2017-09-27T00:00:00 |
[
[
"Konam",
"Sandeep",
""
],
[
"Rosenthal",
"Stephanie",
""
],
[
"Veloso",
"Manuela",
""
]
] |
new_dataset
| 0.975023 |
1709.09029
|
Stanislav Levin
|
Stanislav Levin, Amiram Yehudai
|
The Co-Evolution of Test Maintenance and Code Maintenance through the
lens of Fine-Grained Semantic Changes
|
postprint, ICSME 2017
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic testing is a widely adopted technique for improving software
quality. Software developers add, remove and update test methods and test
classes as part of the software development process as well as during the
evolution phase, following the initial release. In this work we conduct a large
scale study of 61 popular open source projects and report the relationships we
have established between test maintenance, production code maintenance, and
semantic changes (e.g, statement added, method removed, etc.). performed in
developers' commits.
We build predictive models, and show that the number of tests in a software
project can be well predicted by employing code maintenance profiles (i.e., how
many commits were performed in each of the maintenance activities: corrective,
perfective, adaptive). Our findings also reveal that more often than not,
developers perform code fixes without performing complementary test maintenance
in the same commit (e.g., update an existing test or add a new one). When
developers do perform test maintenance, it is likely to be affected by the
semantic changes they perform as part of their commit.
Our work is based on studying 61 popular open source projects, comprised of
over 240,000 commits consisting of over 16,000,000 semantic change type
instances, performed by over 4,000 software engineers.
|
[
{
"version": "v1",
"created": "Tue, 26 Sep 2017 14:13:33 GMT"
}
] | 2017-09-27T00:00:00 |
[
[
"Levin",
"Stanislav",
""
],
[
"Yehudai",
"Amiram",
""
]
] |
new_dataset
| 0.965361 |
1709.09069
|
Andreas Kirsch
|
Andreas Kirsch
|
MDP environments for the OpenAI Gym
|
6 pages, 2 figures
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The OpenAI Gym provides researchers and enthusiasts with simple to use
environments for reinforcement learning. Even the simplest environment have a
level of complexity that can obfuscate the inner workings of RL approaches and
make debugging difficult. This whitepaper describes a Python framework that
makes it very easy to create simple Markov-Decision-Process environments
programmatically by specifying state transitions and rewards of deterministic
and non-deterministic MDPs in a domain-specific language in Python. It then
presents results and visualizations created with this MDP framework.
|
[
{
"version": "v1",
"created": "Tue, 26 Sep 2017 14:52:23 GMT"
}
] | 2017-09-27T00:00:00 |
[
[
"Kirsch",
"Andreas",
""
]
] |
new_dataset
| 0.997514 |
1709.09099
|
Chiwan Park
|
Chiwan Park, Ha-Myung Park, Minji Yoon, U Kang
|
PMV: Pre-partitioned Generalized Matrix-Vector Multiplication for
Scalable Graph Mining
|
10 pages
| null | null | null |
cs.DC cs.DB cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
How can we analyze enormous networks including the Web and social networks
which have hundreds of billions of nodes and edges? Network analyses have been
conducted by various graph mining methods including shortest path computation,
PageRank, connected component computation, random walk with restart, etc. These
graph mining methods can be expressed as generalized matrix-vector
multiplication which consists of few operations inspired by typical
matrix-vector multiplication. Recently, several graph processing systems based
on matrix-vector multiplication or their own primitives have been proposed to
deal with large graphs; however, they all have failed on Web-scale graphs due
to insufficient memory space or the lack of consideration for I/O costs. In
this paper, we propose PMV (Pre-partitioned generalized Matrix-Vector
multiplication), a scalable distributed graph mining method based on
generalized matrix-vector multiplication on distributed systems. PMV
significantly decreases the communication cost, which is the main bottleneck of
distributed systems, by partitioning the input graph in advance and judiciously
applying execution strategies based on the density of the pre-partitioned
sub-matrices. Experiments show that PMV succeeds in processing up to 16x larger
graphs than existing distributed memory-based graph mining methods, and
requires 9x less time than previous disk-based graph mining methods by reducing
I/O costs significantly.
|
[
{
"version": "v1",
"created": "Tue, 26 Sep 2017 15:53:15 GMT"
}
] | 2017-09-27T00:00:00 |
[
[
"Park",
"Chiwan",
""
],
[
"Park",
"Ha-Myung",
""
],
[
"Yoon",
"Minji",
""
],
[
"Kang",
"U",
""
]
] |
new_dataset
| 0.975501 |
1604.04855
|
Ashwin Ganesan
|
Ashwin Ganesan
|
Fault tolerant supergraphs with automorphisms
| null | null | null | null |
cs.DM cs.NI math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a graph $Y$ on $n$ vertices and a desired level of fault-tolerance $k$,
an objective in fault-tolerant system design is to construct a supergraph $X$
on $n + k$ vertices such that the removal of any $k$ nodes from $X$ leaves a
graph containing $Y$. In order to reconfigure around faults when they occur, it
is also required that any two subsets of $k$ nodes of $X$ are in the same orbit
of the action of its automorphism group. In this paper, we prove that such a
supergraph must be the complete graph. This implies that it is very expensive
to have an interconnection network which is $k$-fault-tolerant and which also
supports automorphic reconfiguration. Our work resolves an open problem in the
literature. The proof uses a result due to Cameron on $k$-homogeneous groups.
|
[
{
"version": "v1",
"created": "Sun, 17 Apr 2016 09:42:38 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Mar 2017 08:43:40 GMT"
},
{
"version": "v3",
"created": "Sun, 24 Sep 2017 16:47:55 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Ganesan",
"Ashwin",
""
]
] |
new_dataset
| 0.999626 |
1605.06015
|
Irina Biktasheva
|
Mario Antonioletti, Vadim N. Biktashev, Adrian Jackson, Sanjay R.
Kharche, Tomas Stary, Irina V. Biktasheva
|
BeatBox - HPC Simulation Environment for Biophysically and Anatomically
Realistic Cardiac Electrophysiology
|
37 pages, 10 figures, last version submitted to PLOS ONE
|
PLoS ONE 12(5): e0172292, 2017
|
10.1371/journal.pone.0172292
| null |
cs.CE nlin.AO nlin.PS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The BeatBox simulation environment combines flexible script language user
interface with the robust computational tools, in order to setup cardiac
electrophysiology in-silico experiments without re-coding at low-level, so that
cell excitation, tissue/anatomy models, stimulation protocols may be included
into a BeatBox script, and simulation run either sequentially or in parallel
(MPI) without re-compilation. BeatBox is a free software written in C language
to be run on a Unix-based platform. It provides the whole spectrum of multi
scale tissue modelling from 0-dimensional individual cell simulation,
1-dimensional fibre, 2-dimensional sheet and 3-dimensional slab of tissue, up
to anatomically realistic whole heart simulations, with run time measurements
including cardiac re-entry tip/filament tracing, ECG, local/global samples of
any variables, etc. BeatBox solvers, cell, and tissue/anatomy models
repositories are extended via robust and flexible interfaces, thus providing an
open framework for new developments in the field. In this paper we give an
overview of the BeatBox current state, together with a description of the main
computational methods and MPI parallelisation approaches.
|
[
{
"version": "v1",
"created": "Thu, 19 May 2016 15:46:25 GMT"
},
{
"version": "v2",
"created": "Mon, 14 Nov 2016 20:53:12 GMT"
},
{
"version": "v3",
"created": "Sun, 12 Feb 2017 21:38:56 GMT"
}
] | 2017-09-26T00:00:00 |
[
[
"Antonioletti",
"Mario",
""
],
[
"Biktashev",
"Vadim N.",
""
],
[
"Jackson",
"Adrian",
""
],
[
"Kharche",
"Sanjay R.",
""
],
[
"Stary",
"Tomas",
""
],
[
"Biktasheva",
"Irina V.",
""
]
] |
new_dataset
| 0.994432 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.