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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1106.5742
|
Alireza Vahid
|
Alireza Vahid, Vaneet Aggarwal, A. Salman Avestimehr, and Ashutosh
Sabharwal
|
Wireless Network Coding with Local Network Views: Coded Layer Scheduling
|
Technical report. A paper based on the results of this report will
appear
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the fundamental challenges in the design of distributed wireless
networks is the large dynamic range of network state. Since continuous tracking
of global network state at all nodes is practically impossible, nodes can only
acquire limited local views of the whole network to design their transmission
strategies. In this paper, we study multi-layer wireless networks and assume
that each node has only a limited knowledge, namely 1-local view, where each
S-D pair has enough information to perform optimally when other pairs do not
interfere, along with connectivity information for rest of the network. We
investigate the information-theoretic limits of communication with such limited
knowledge at the nodes. We develop a novel transmission strategy, namely Coded
Layer Scheduling, that solely relies on 1-local view at the nodes and
incorporates three different techniques: (1) per layer interference avoidance,
(2) repetition coding to allow overhearing of the interference, and (3) network
coding to allow interference neutralization. We show that our proposed scheme
can provide a significant throughput gain compared with the conventional
interference avoidance strategies. Furthermore, we show that our strategy
maximizes the achievable normalized sum-rate for some classes of networks,
hence, characterizing the normalized sum-capacity of those networks with
1-local view.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2011 17:47:29 GMT"
},
{
"version": "v2",
"created": "Sun, 5 Feb 2012 23:58:47 GMT"
},
{
"version": "v3",
"created": "Fri, 14 Apr 2017 21:01:52 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Vahid",
"Alireza",
""
],
[
"Aggarwal",
"Vaneet",
""
],
[
"Avestimehr",
"A. Salman",
""
],
[
"Sabharwal",
"Ashutosh",
""
]
] |
new_dataset
| 0.981222 |
1601.05879
|
Jun Muramatsu
|
Jun Muramatsu and Shigeki Miyake
|
Construction of a Channel Code from an Arbitrary Source Code with
Decoder Side Information
|
(v.1) 9 pages. A short version is submitted to ISIT2016. (v.2) 21
pages. Submitted to IEEE Transactions on Information Theory. The second
author is added
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The construction of a channel code by using a source code with decoder side
information is introduced. For the construction, any pair of encoder and
decoder is available for a source code with decoder side information. A
constrained-random-number generator, which generates random numbers satisfying
a condition specified by a function and its value, is used to construct a
stochastic channel encoder. The result suggests that we can divide the channel
coding problem into the problems of channel encoding and source decoding with
side information.
|
[
{
"version": "v1",
"created": "Fri, 22 Jan 2016 05:28:28 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Apr 2017 03:04:40 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Muramatsu",
"Jun",
""
],
[
"Miyake",
"Shigeki",
""
]
] |
new_dataset
| 0.993368 |
1611.09714
|
Meghna Mankalale
|
Meghna G. Mankalale, Zhaoxin Liang, Zhengyang Zhao, Chris Kim,
Jian-Ping Wang, and Sachin S. Sapatnekar
|
CoMET: Composite-Input Magnetoelectric-based Logic Technology
| null | null | null | null |
cs.ET cond-mat.mes-hall
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work proposes CoMET, a fast and energy-efficient spintronics device for
logic applications. An input voltage is applied to a ferroelectric (FE)
material, in contact with a composite structure - a ferromagnet (FM) with
in-plane magnetic anisotropy (IMA) placed on top of an intra-gate FM
interconnect with perpendicular magnetic anisotropy (PMA). Through the
magnetoelectric (ME) effect, the input voltage nucleates a domain wall (DW) at
the input end of the PMA-FM interconnect. An applied current then rapidly
propagates the DW towards the output FE structure, where the inverse-ME effect
generates an output voltage. This voltage is propagated to the input of the
next CoMET device using a novel circuit structure that enables efficient device
cascading. The material parameters for CoMET are optimized by systematically
exploring the impact of parameter choices on device performance. Simulations on
a 7nm CoMET device show fast, low-energy operation, with a delay/energy of
98ps/68aJ for INV and 135ps/85aJ for MAJ3.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 16:35:48 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Apr 2017 17:59:31 GMT"
},
{
"version": "v3",
"created": "Mon, 17 Apr 2017 02:53:27 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Mankalale",
"Meghna G.",
""
],
[
"Liang",
"Zhaoxin",
""
],
[
"Zhao",
"Zhengyang",
""
],
[
"Kim",
"Chris",
""
],
[
"Wang",
"Jian-Ping",
""
],
[
"Sapatnekar",
"Sachin S.",
""
]
] |
new_dataset
| 0.999814 |
1612.03216
|
Peter Potash
|
Peter Potash, Alexey Romanov, Anna Rumshisky
|
#HashtagWars: Learning a Sense of Humor
|
10 Pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we present a new dataset for computational humor, specifically
comparative humor ranking, which attempts to eschew the ubiquitous binary
approach to humor detection. The dataset consists of tweets that are humorous
responses to a given hashtag. We describe the motivation for this new dataset,
as well as the collection process, which includes a description of our
semi-automated system for data collection. We also present initial experiments
for this dataset using both unsupervised and supervised approaches. Our best
supervised system achieved 63.7% accuracy, suggesting that this task is much
more difficult than comparable humor detection tasks. Initial experiments
indicate that a character-level model is more suitable for this task than a
token-level model, likely due to a large amount of puns that can be captured by
a character-level model.
|
[
{
"version": "v1",
"created": "Fri, 9 Dec 2016 23:28:16 GMT"
},
{
"version": "v2",
"created": "Sat, 15 Apr 2017 18:41:44 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Potash",
"Peter",
""
],
[
"Romanov",
"Alexey",
""
],
[
"Rumshisky",
"Anna",
""
]
] |
new_dataset
| 0.999664 |
1704.04573
|
Xi Yang
|
Xi Yang, Zhichao Huang, Bin Han, Senjie Zhang, Chao-Kai Wen, Feifei
Gao, and Shi Jin
|
RaPro: A Novel 5G Rapid Prototyping System Architecture
|
accepted by IEEE Wireless Communication Letters
| null |
10.1109/LWC.2017.2692780
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel fifth-generation (5G) rapid prototyping (RaPro) system
architecture by combining FPGA-privileged modules from a software defined radio
(or FPGA-coprocessor) and high-level programming language for advanced
algorithms from multi-core general purpose processors. The proposed system
architecture exhibits excellent flexibility and scalability in the development
of a 5G prototyping system. As a proof of concept, a multi-user full-dimension
multiple-input and multiple-output system is established based on the proposed
architecture. Experimental results demonstrate the superiority of the proposed
architecture in large-scale antenna and wideband communication systems.
|
[
{
"version": "v1",
"created": "Sat, 15 Apr 2017 03:43:18 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Yang",
"Xi",
""
],
[
"Huang",
"Zhichao",
""
],
[
"Han",
"Bin",
""
],
[
"Zhang",
"Senjie",
""
],
[
"Wen",
"Chao-Kai",
""
],
[
"Gao",
"Feifei",
""
],
[
"Jin",
"Shi",
""
]
] |
new_dataset
| 0.993285 |
1704.04585
|
Hung La
|
Devin Connell and Hung Manh La
|
Dynamic Path Planning and Replanning for Mobile Robots using RRT*
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is necessary for a mobile robot to be able to efficiently plan a path from
its starting, or current, location to a desired goal location. This is a
trivial task when the environment is static. However, the operational
environment of the robot is rarely static, and it often has many moving
obstacles. The robot may encounter one, or many, of these unknown and
unpredictable moving obstacles. The robot will need to decide how to proceed
when one of these obstacles is obstructing it's path. A method of dynamic
replanning using RRT* is presented. The robot will modify it's current plan
when an unknown random moving obstacle obstructs the path. Various experimental
results show the effectiveness of the proposed method.
|
[
{
"version": "v1",
"created": "Sat, 15 Apr 2017 05:03:57 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Connell",
"Devin",
""
],
[
"La",
"Hung Manh",
""
]
] |
new_dataset
| 0.99833 |
1704.04672
|
Hung La
|
Alexander C. Woods and Hung M. La
|
A Novel Potential Field Controller for Use on Aerial Robots
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Unmanned Aerial Vehicles (UAV), commonly known as drones, have many potential
uses in real world applications. Drones require advanced planning and
navigation algorithms to enable them to safely move through and interact with
the world around them. This paper presents an extended potential field
controller (ePFC) which enables an aerial robot, or drone, to safely track a
dynamic target location while simultaneously avoiding any obstacles in its
path. The ePFC outperforms a traditional potential field controller (PFC) with
smoother tracking paths and shorter settling times. The proposed ePFC's
stability is evaluated by Lyapunov approach, and its performance is simulated
in a Matlab environment. Finally, the controller is implemented on an
experimental platform in a laboratory environment which demonstrates the
effectiveness of the controller.
|
[
{
"version": "v1",
"created": "Sat, 15 Apr 2017 18:13:28 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Woods",
"Alexander C.",
""
],
[
"La",
"Hung M.",
""
]
] |
new_dataset
| 0.998092 |
1704.04689
|
Amir Mazaheri
|
Amir Mazaheri, Dong Zhang, Mubarak Shah
|
Video Fill In the Blank using LR/RL LSTMs with Spatial-Temporal
Attentions
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a video and a description sentence with one missing word (we call it
the "source sentence"), Video-Fill-In-the-Blank (VFIB) problem is to find the
missing word automatically. The contextual information of the sentence, as well
as visual cues from the video, are important to infer the missing word
accurately. Since the source sentence is broken into two fragments: the
sentence's left fragment (before the blank) and the sentence's right fragment
(after the blank), traditional Recurrent Neural Networks cannot encode this
structure accurately because of many possible variations of the missing word in
terms of the location and type of the word in the source sentence. For example,
a missing word can be the first word or be in the middle of the sentence and it
can be a verb or an adjective. In this paper, we propose a framework to tackle
the textual encoding: Two separate LSTMs (the LR and RL LSTMs) are employed to
encode the left and right sentence fragments and a novel structure is
introduced to combine each fragment with an "external memory" corresponding the
opposite fragments. For the visual encoding, end-to-end spatial and temporal
attention models are employed to select discriminative visual representations
to find the missing word. In the experiments, we demonstrate the superior
performance of the proposed method on challenging VFIB problem. Furthermore, we
introduce an extended and more generalized version of VFIB, which is not
limited to a single blank. Our experiments indicate the generalization
capability of our method in dealing with such more realistic scenarios.
|
[
{
"version": "v1",
"created": "Sat, 15 Apr 2017 21:13:41 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Mazaheri",
"Amir",
""
],
[
"Zhang",
"Dong",
""
],
[
"Shah",
"Mubarak",
""
]
] |
new_dataset
| 0.954279 |
1704.04766
|
He Jiang
|
Jifeng Xuan, Yan Hu, He Jiang
|
Debt-Prone Bugs: Technical Debt in Software Maintenance
|
9 pages, 4 figures, International Journal of Advancements in
Computing Technology, 2012
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fixing bugs is an important phase in software development and maintenance. In
practice, the process of bug fixing may conflict with the release schedule.
Such confliction leads to a trade-off between software quality and release
schedule, which is known as the technical debt metaphor. In this article, we
propose the concept of debt-prone bugs to model the technical debt in software
maintenance. We identify three types of debt-prone bugs, namely tag bugs,
reopened bugs, and duplicate bugs. A case study on Mozilla is conducted to
examine the impact of debt-prone bugs in software products. We investigate the
correlation between debt-prone bugs and the product quality. For a product
under development, we build prediction models based on historical products to
predict the time cost of fixing bugs. The result shows that identifying
debt-prone bugs can assist in monitoring and improving software quality.
|
[
{
"version": "v1",
"created": "Sun, 16 Apr 2017 12:47:38 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Xuan",
"Jifeng",
""
],
[
"Hu",
"Yan",
""
],
[
"Jiang",
"He",
""
]
] |
new_dataset
| 0.999496 |
1704.04792
|
Dhagash Mehta
|
Souvik Chandra, Dhagash Mehta, Aranya Chakrabortty
|
Locating Power Flow Solution Space Boundaries: A Numerical Polynomial
Homotopy Approach
|
9 pages, 5 figures
| null | null | null |
cs.SY math.AG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The solution space of any set of power flow equations may contain different
number of real-valued solutions. The boundaries that separate these regions are
referred to as power flow solution space boundaries. Knowledge of these
boundaries is important as they provide a measure for voltage stability.
Traditionally, continuation based methods have been employed to compute these
boundaries on the basis of initial guesses for the solution. However, with
rapid growth of renewable energy sources these boundaries will be increasingly
affected by variable parameters such as penetration levels, locations of the
renewable sources, and voltage set-points, making it difficult to generate an
initial guess that can guarantee all feasible solutions for the power flow
problem. In this paper we solve this problem by applying a numerical polynomial
homotopy based continuation method. The proposed method guarantees to find all
solution boundaries within a given parameter space up to a chosen level of
discretization, independent of any initial guess. Power system operators can
use this computational tool conveniently to plan the penetration levels of
renewable sources at different buses. We illustrate the proposed method through
simulations on 3-bus and 10-bus power system examples with renewable
generation.
|
[
{
"version": "v1",
"created": "Sun, 16 Apr 2017 16:05:52 GMT"
}
] | 2017-04-18T00:00:00 |
[
[
"Chandra",
"Souvik",
""
],
[
"Mehta",
"Dhagash",
""
],
[
"Chakrabortty",
"Aranya",
""
]
] |
new_dataset
| 0.958274 |
1701.07715
|
Julie Grollier
|
Jacob Torrejon, Mathieu Riou, Flavio Abreu Araujo, Sumito Tsunegi,
Guru Khalsa, Damien Querlioz, Paolo Bortolotti, Vincent Cros, Akio Fukushima,
Hitoshi Kubota, Shinji Yuasa, M. D. Stiles and Julie Grollier
|
Neuromorphic computing with nanoscale spintronic oscillators
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neurons in the brain behave as non-linear oscillators, which develop rhythmic
activity and interact to process information. Taking inspiration from this
behavior to realize high density, low power neuromorphic computing will require
huge numbers of nanoscale non-linear oscillators. Indeed, a simple estimation
indicates that, in order to fit a hundred million oscillators organized in a
two-dimensional array inside a chip the size of a thumb, their lateral
dimensions must be smaller than one micrometer. However, despite multiple
theoretical proposals, there is no proof of concept today of neuromorphic
computing with nano-oscillators. Indeed, nanoscale devices tend to be noisy and
to lack the stability required to process data in a reliable way. Here, we show
experimentally that a nanoscale spintronic oscillator can achieve spoken digit
recognition with accuracies similar to state of the art neural networks. We
pinpoint the regime of magnetization dynamics leading to highest performance.
These results, combined with the exceptional ability of these spintronic
oscillators to interact together, their long lifetime, and low energy
consumption, open the path to fast, parallel, on-chip computation based on
networks of oscillators.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 14:54:14 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Apr 2017 11:15:52 GMT"
}
] | 2017-04-17T00:00:00 |
[
[
"Torrejon",
"Jacob",
""
],
[
"Riou",
"Mathieu",
""
],
[
"Araujo",
"Flavio Abreu",
""
],
[
"Tsunegi",
"Sumito",
""
],
[
"Khalsa",
"Guru",
""
],
[
"Querlioz",
"Damien",
""
],
[
"Bortolotti",
"Paolo",
""
],
[
"Cros",
"Vincent",
""
],
[
"Fukushima",
"Akio",
""
],
[
"Kubota",
"Hitoshi",
""
],
[
"Yuasa",
"Shinji",
""
],
[
"Stiles",
"M. D.",
""
],
[
"Grollier",
"Julie",
""
]
] |
new_dataset
| 0.998288 |
1704.00057
|
Layla El Asri
|
Layla El Asri and Hannes Schulz and Shikhar Sharma and Jeremie Zumer
and Justin Harris and Emery Fine and Rahul Mehrotra and Kaheer Suleman
|
Frames: A Corpus for Adding Memory to Goal-Oriented Dialogue Systems
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the Frames dataset (Frames is available at
http://datasets.maluuba.com/Frames), a corpus of 1369 human-human dialogues
with an average of 15 turns per dialogue. We developed this dataset to study
the role of memory in goal-oriented dialogue systems. Based on Frames, we
introduce a task called frame tracking, which extends state tracking to a
setting where several states are tracked simultaneously. We propose a baseline
model for this task. We show that Frames can also be used to study memory in
dialogue management and information presentation through natural language
generation.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 21:03:58 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Apr 2017 18:22:49 GMT"
}
] | 2017-04-17T00:00:00 |
[
[
"Asri",
"Layla El",
""
],
[
"Schulz",
"Hannes",
""
],
[
"Sharma",
"Shikhar",
""
],
[
"Zumer",
"Jeremie",
""
],
[
"Harris",
"Justin",
""
],
[
"Fine",
"Emery",
""
],
[
"Mehrotra",
"Rahul",
""
],
[
"Suleman",
"Kaheer",
""
]
] |
new_dataset
| 0.974931 |
1704.04365
|
Jianhua Mo
|
Jianhua Mo and Robert W. Heath Jr
|
Limited Feedback in Single and Multi-user MIMO Systems with Finite-Bit
ADCs
|
30 pages, 12 figures, submitted to IEEE Transactions on Wireless
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Communication systems with low-resolution analog-to-digital-converters (ADCs)
can exploit channel state information at the transmitter and receiver. This
paper presents codebook designs and performance analyses for limited feedback
MIMO systems with finite-bit ADCs. A point-to-point single-user channel is
firstly considered. When the received signal is sliced by 1-bit ADCs, the
absolute phase at the receiver is important to align the phase of the received
signals. A new codebook design for beamforming, which separately quantizes the
channel direction and the residual phase, is therefore proposed. For the
multi-bit case where the optimal transmission method is unknown, suboptimal
Gaussian signaling and eigenvector beamforming is assumed to obtain a lower
bound of the achievable rate. It is found that to limit the rate loss, more
feedback bits are needed in the medium SNR regime than the low and high SNR
regimes, which is quite different from the conventional infinite-bit ADC case.
Second, a multi-user system where a multiple-antenna transmitter sends signals
to multiple single-antenna receivers with finite-bit ADCs is considered. Based
on the derived performance loss due to finite-bit ADCs and finite-bit CSI
feedback, the number of bits per feedback should increase linearly with the ADC
resolution in order to restrict the rate loss.
|
[
{
"version": "v1",
"created": "Fri, 14 Apr 2017 06:53:31 GMT"
}
] | 2017-04-17T00:00:00 |
[
[
"Mo",
"Jianhua",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.995451 |
1704.04460
|
Alexander Singh
|
Alexander Singh, Konstantinos Giannakis, Theodore Andronikos
|
Qumin, a minimalist quantum programming language
|
34 pages
| null | null | null |
cs.PL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we introduce Qumin, a novel quantum programming language with a
focus on providing an easy to use, minimalist, high-level, and easily
extensible platform for quantum programming. Qumin's design concentrates on
encompassing the various interactions between classical and quantum computation
via the use of two sublanguages: an untyped one that handles classical
preparation and control, and one linearly typed that explicitly handles quantum
routines. This allows the classical part of the language to be freely used for
general programming while placing restrictions on the quantum part that enforce
rules of quantum computing like the no-cloning of qubits.
We describe both the language's theoretical foundations in terms of lambda
calculi and linear type systems, and more practical matters such as
implementations of algorithms and useful programming tools like matrix and
oracle generators that streamline the interaction of the classical and quantum
fragments of a program. Finally, we provide an experimental open-source
implementation of an interpreter, typechecker and related tools for the
language (which can be found in \url{https://github.com/wintershammer/QImp}).
|
[
{
"version": "v1",
"created": "Fri, 14 Apr 2017 15:38:22 GMT"
}
] | 2017-04-17T00:00:00 |
[
[
"Singh",
"Alexander",
""
],
[
"Giannakis",
"Konstantinos",
""
],
[
"Andronikos",
"Theodore",
""
]
] |
new_dataset
| 0.999793 |
1704.04464
|
Ashish Kundu
|
Ashish Kundu, Zhiqiang Lin, Joshua Hammond
|
Energy Attacks on Mobile Devices
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
All mobile devices are energy-constrained. They use batteries that allows
using the device for a limited amount of time. In general, energy attacks on
mobile devices are denial of service (DoS) type of attacks. While previous
studies have analyzed the energy attacks in servers, no existing work has
analyzed the energy attacks on mobile devices. As such, in this paper, we
present the first systematic study on how to exploit the energy attacks on
smartphones. In particular, we explore energy attacks from the following
aspect: hardware components, software resources, and network communications
through the design and implementation of concrete malicious apps, and malicious
web pages. We quantitatively show how quickly we can drain the battery through
each individual attack, as well as their combinations. Finally, we believe
energy exploit will be a practical attack vector and mobile users should be
aware of this type of attacks.
|
[
{
"version": "v1",
"created": "Fri, 14 Apr 2017 16:08:35 GMT"
}
] | 2017-04-17T00:00:00 |
[
[
"Kundu",
"Ashish",
""
],
[
"Lin",
"Zhiqiang",
""
],
[
"Hammond",
"Joshua",
""
]
] |
new_dataset
| 0.998951 |
1704.04470
|
L. Elisa Celis
|
L. Elisa Celis and Farnood Salehi
|
Lean From Thy Neighbor: Stochastic & Adversarial Bandits in a Network
|
This article was first circulated in January 2015 and presented at
ISMP 2015 under the title "Bandit in a Network"
(https://informs.emeetingsonline.com/emeetings/formbuilder/clustersessiondtl.asp?csnno=22329&mmnno=264&ppnno=85856)
| null | null | null |
cs.LG cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An individual's decisions are often guided by those of his or her peers,
i.e., neighbors in a social network. Presumably, being privy to the experiences
of others aids in learning and decision making, but how much advantage does an
individual gain by observing her neighbors? Such problems make appearances in
sociology and economics and, in this paper, we present a novel model to capture
such decision-making processes and appeal to the classical multi-armed bandit
framework to analyze it. Each individual, in addition to her own actions, can
observe the actions and rewards obtained by her neighbors, and can use all of
this information in order to minimize her own regret. We provide algorithms for
this setting, both for stochastic and adversarial bandits, and show that their
regret smoothly interpolates between the regret in the classical bandit setting
and that of the full-information setting as a function of the neighbors'
exploration. In the stochastic setting the additional information must simply
be incorporated into the usual estimation of the rewards, while in the
adversarial setting this is attained by constructing a new unbiased estimator
for the rewards and appropriately bounding the amount of additional information
provided by the neighbors. These algorithms are optimal up to log factors;
despite the fact that the agents act independently and selfishly, this implies
that it is an approximate Nash equilibria for all agents to use our algorithms.
Further, we show via empirical simulations that our algorithms, often
significantly, outperform existing algorithms that one could apply to this
setting.
|
[
{
"version": "v1",
"created": "Fri, 14 Apr 2017 16:24:58 GMT"
}
] | 2017-04-17T00:00:00 |
[
[
"Celis",
"L. Elisa",
""
],
[
"Salehi",
"Farnood",
""
]
] |
new_dataset
| 0.993014 |
1609.06204
|
Alessio Palmero Aprosio
|
Alessio Palmero Aprosio and Giovanni Moretti
|
Italy goes to Stanford: a collection of CoreNLP modules for Italian
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this we paper present Tint, an easy-to-use set of fast, accurate and
extendable Natural Language Processing modules for Italian. It is based on
Stanford CoreNLP and is freely available as a standalone software or a library
that can be integrated in an existing project.
|
[
{
"version": "v1",
"created": "Tue, 20 Sep 2016 14:53:05 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Apr 2017 08:33:33 GMT"
}
] | 2017-04-14T00:00:00 |
[
[
"Aprosio",
"Alessio Palmero",
""
],
[
"Moretti",
"Giovanni",
""
]
] |
new_dataset
| 0.99835 |
1610.08809
|
Safa Jammali
|
Safa Jammali, Esaie Kuitche, Ayoub Rachati, Fran\c{c}ois B\'elanger,
Michelle Scott, A\"ida Ouangraoua
|
Aligning coding sequences with frameshift extension penalties
|
24 pages, 4 figures
|
Algorithms for Molecular Biology, 2017, vol. 12, no 1, p. 10
|
10.1186/s13015-017-0101-4
| null |
cs.DS q-bio.GN q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Frameshift translation is an important phenomenon that contributes to the
appearance of novel Coding DNA Sequences (CDS) and functions in gene evolution,
by allowing alternative amino acid translations of genes coding regions.
Frameshift translations can be identified by aligning two CDS, from a same gene
or from homologous genes, while accounting for their codon structure. Two main
classes of algorithms have been proposed to solve the problem of aligning CDS,
either by amino acid sequence alignment back-translation, or by simultaneously
accounting for the nucleotide and amino acid levels. The former does not allow
to account for frameshift translations and up to now, the latter exclusively
accounts for frameshift translation initiation, not accounting for the length
of the translation disruption caused by a frameshift.
Here, we introduce a new scoring scheme with an algorithm for the pairwise
alignment of CDS accounting for frameshift translation initiation and length,
while simultaneously accounting for nucleotide and amino acid sequences. We
compare the method to other CDS alignment methods based on an application to
the comparison of pairs of CDS from homologous \emph{human}, \emph{mouse} and
\emph{cow} genes of ten mammalian gene families from the Ensembl-Compara
database. The results show that our method is particularly robust to parameter
changes as compared to existing methods. It also appears to be a good
compromise, performing well both in the presence and absence of frameshift
translations between the CDS. An implementation of the method is available at
https://github.com/UdeS-CoBIUS/FsePSA.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2016 14:43:48 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Apr 2017 17:04:29 GMT"
}
] | 2017-04-14T00:00:00 |
[
[
"Jammali",
"Safa",
""
],
[
"Kuitche",
"Esaie",
""
],
[
"Rachati",
"Ayoub",
""
],
[
"Bélanger",
"François",
""
],
[
"Scott",
"Michelle",
""
],
[
"Ouangraoua",
"Aïda",
""
]
] |
new_dataset
| 0.991088 |
1701.06478
|
Alireza Vahid
|
Alireza Vahid, Georgios Mappouras, Daniel J. Sorin, Robert Calderbank
|
Correcting Two Deletions and Insertions in Racetrack Memory
|
Technical report 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Racetrack memory is a non-volatile memory engineered to provide both high
density and low latency, that is subject to synchronization or shift errors.
This paper describes a fast coding solution, in which delimiter bits assist in
identifying the type of shift error, and easily implementable graph-based codes
are used to correct the error, once identified. A code that is able to detect
and correct double shift errors is described in detail.
|
[
{
"version": "v1",
"created": "Mon, 23 Jan 2017 16:24:14 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Apr 2017 01:25:19 GMT"
}
] | 2017-04-14T00:00:00 |
[
[
"Vahid",
"Alireza",
""
],
[
"Mappouras",
"Georgios",
""
],
[
"Sorin",
"Daniel J.",
""
],
[
"Calderbank",
"Robert",
""
]
] |
new_dataset
| 0.981953 |
1704.03978
|
Sheng Wang
|
Sheng Wang, Zhifeng Bao, J. Shane Culpepper, Timos Sellis, Gao Cong
|
Reverse k Nearest Neighbor Search over Trajectories
|
12 pages
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
GPS enables mobile devices to continuously provide new opportunities to
improve our daily lives. For example, the data collected in applications
created by Uber or Public Transport Authorities can be used to plan
transportation routes, estimate capacities, and proactively identify low
coverage areas. In this paper, we study a new kind of query-Reverse k Nearest
Neighbor Search over Trajectories (RkNNT), which can be used for route planning
and capacity estimation. Given a set of existing routes DR, a set of passenger
transitions DT, and a query route Q, a RkNNT query returns all transitions that
take Q as one of its k nearest travel routes. To solve the problem, we first
develop an index to handle dynamic trajectory updates, so that the most
up-to-date transition data are available for answering a RkNNT query. Then we
introduce a filter refinement framework for processing RkNNT queries using the
proposed indexes. Next, we show how to use RkNNT to solve the optimal route
planning problem MaxRkNNT (MinRkNNT), which is to search for the optimal route
from a start location to an end location that could attract the maximum (or
minimum) number of passengers based on a pre-defined travel distance threshold.
Experiments on real datasets demonstrate the efficiency and scalability of our
approaches. To the best of our best knowledge, this is the first work to study
the RkNNT problem for route planning.
|
[
{
"version": "v1",
"created": "Thu, 13 Apr 2017 03:14:00 GMT"
}
] | 2017-04-14T00:00:00 |
[
[
"Wang",
"Sheng",
""
],
[
"Bao",
"Zhifeng",
""
],
[
"Culpepper",
"J. Shane",
""
],
[
"Sellis",
"Timos",
""
],
[
"Cong",
"Gao",
""
]
] |
new_dataset
| 0.994273 |
1609.07859
|
Taewan Kim
|
Taewan Kim, Seyeong Kim, Sangil Na, Hayoon Kim, Moonki Kim, Byoung-Ki
Jeon
|
Visual Fashion-Product Search at SK Planet
|
13 pages, 11 figures, 3 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We build a large-scale visual search system which finds similar product
images given a fashion item. Defining similarity among arbitrary
fashion-products is still remains a challenging problem, even there is no exact
ground-truth. To resolve this problem, we define more than 90 fashion-related
attributes, and combination of these attributes can represent thousands of
unique fashion-styles. The fashion-attributes are one of the ingredients to
define semantic similarity among fashion-product images. To build our system at
scale, these fashion-attributes are again used to build an inverted indexing
scheme. In addition to these fashion-attributes for semantic similarity, we
extract colour and appearance features in a region-of-interest (ROI) of a
fashion item for visual similarity. By sharing our approach, we expect active
discussion on that how to apply current computer vision research into the
e-commerce industry.
|
[
{
"version": "v1",
"created": "Mon, 26 Sep 2016 06:53:36 GMT"
},
{
"version": "v2",
"created": "Tue, 27 Sep 2016 04:47:48 GMT"
},
{
"version": "v3",
"created": "Fri, 7 Oct 2016 08:28:22 GMT"
},
{
"version": "v4",
"created": "Wed, 19 Oct 2016 12:50:49 GMT"
},
{
"version": "v5",
"created": "Sun, 6 Nov 2016 07:57:32 GMT"
},
{
"version": "v6",
"created": "Wed, 12 Apr 2017 03:51:23 GMT"
}
] | 2017-04-13T00:00:00 |
[
[
"Kim",
"Taewan",
""
],
[
"Kim",
"Seyeong",
""
],
[
"Na",
"Sangil",
""
],
[
"Kim",
"Hayoon",
""
],
[
"Kim",
"Moonki",
""
],
[
"Jeon",
"Byoung-Ki",
""
]
] |
new_dataset
| 0.99433 |
1611.05594
|
Long Chen
|
Long Chen, Hanwang Zhang, Jun Xiao, Liqiang Nie, Jian Shao, Wei Liu,
Tat-Seng Chua
|
SCA-CNN: Spatial and Channel-wise Attention in Convolutional Networks
for Image Captioning
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visual attention has been successfully applied in structural prediction tasks
such as visual captioning and question answering. Existing visual attention
models are generally spatial, i.e., the attention is modeled as spatial
probabilities that re-weight the last conv-layer feature map of a CNN encoding
an input image. However, we argue that such spatial attention does not
necessarily conform to the attention mechanism --- a dynamic feature extractor
that combines contextual fixations over time, as CNN features are naturally
spatial, channel-wise and multi-layer. In this paper, we introduce a novel
convolutional neural network dubbed SCA-CNN that incorporates Spatial and
Channel-wise Attentions in a CNN. In the task of image captioning, SCA-CNN
dynamically modulates the sentence generation context in multi-layer feature
maps, encoding where (i.e., attentive spatial locations at multiple layers) and
what (i.e., attentive channels) the visual attention is. We evaluate the
proposed SCA-CNN architecture on three benchmark image captioning datasets:
Flickr8K, Flickr30K, and MSCOCO. It is consistently observed that SCA-CNN
significantly outperforms state-of-the-art visual attention-based image
captioning methods.
|
[
{
"version": "v1",
"created": "Thu, 17 Nov 2016 07:39:46 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Apr 2017 05:48:44 GMT"
}
] | 2017-04-13T00:00:00 |
[
[
"Chen",
"Long",
""
],
[
"Zhang",
"Hanwang",
""
],
[
"Xiao",
"Jun",
""
],
[
"Nie",
"Liqiang",
""
],
[
"Shao",
"Jian",
""
],
[
"Liu",
"Wei",
""
],
[
"Chua",
"Tat-Seng",
""
]
] |
new_dataset
| 0.953949 |
1611.07700
|
Silvia Zuffi
|
Silvia Zuffi, Angjoo Kanazawa, David Jacobs, Michael J. Black
|
3D Menagerie: Modeling the 3D shape and pose of animals
|
Accepted at CVPR 2017 (camera ready version)
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There has been significant work on learning realistic, articulated, 3D models
of the human body. In contrast, there are few such models of animals, despite
many applications. The main challenge is that animals are much less cooperative
than humans. The best human body models are learned from thousands of 3D scans
of people in specific poses, which is infeasible with live animals.
Consequently, we learn our model from a small set of 3D scans of toy figurines
in arbitrary poses. We employ a novel part-based shape model to compute an
initial registration to the scans. We then normalize their pose, learn a
statistical shape model, and refine the registrations and the model together.
In this way, we accurately align animal scans from different quadruped families
with very different shapes and poses. With the registration to a common
template we learn a shape space representing animals including lions, cats,
dogs, horses, cows and hippos. Animal shapes can be sampled from the model,
posed, animated, and fit to data. We demonstrate generalization by fitting it
to images of real animals including species not seen in training.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 09:30:50 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Apr 2017 10:39:46 GMT"
}
] | 2017-04-13T00:00:00 |
[
[
"Zuffi",
"Silvia",
""
],
[
"Kanazawa",
"Angjoo",
""
],
[
"Jacobs",
"David",
""
],
[
"Black",
"Michael J.",
""
]
] |
new_dataset
| 0.994573 |
1612.08843
|
Hexiang Hu
|
Hexiang Hu, Shiyi Lan, Yuning Jiang, Zhimin Cao, Fei Sha
|
FastMask: Segment Multi-scale Object Candidates in One Shot
|
Accepted as CVPR 2017
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Objects appear to scale differently in natural images. This fact requires
methods dealing with object-centric tasks (e.g. object proposal) to have robust
performance over variances in object scales. In the paper, we present a novel
segment proposal framework, namely FastMask, which takes advantage of
hierarchical features in deep convolutional neural networks to segment
multi-scale objects in one shot. Innovatively, we adapt segment proposal
network into three different functional components (body, neck and head). We
further propose a weight-shared residual neck module as well as a
scale-tolerant attentional head module for efficient one-shot inference. On MS
COCO benchmark, the proposed FastMask outperforms all state-of-the-art segment
proposal methods in average recall being 2~5 times faster. Moreover, with a
slight trade-off in accuracy, FastMask can segment objects in near real time
(~13 fps) with 800*600 resolution images, demonstrating its potential in
practical applications. Our implementation is available on
https://github.com/voidrank/FastMask.
|
[
{
"version": "v1",
"created": "Wed, 28 Dec 2016 10:24:42 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Dec 2016 08:03:28 GMT"
},
{
"version": "v3",
"created": "Mon, 16 Jan 2017 06:46:35 GMT"
},
{
"version": "v4",
"created": "Tue, 11 Apr 2017 21:20:57 GMT"
}
] | 2017-04-13T00:00:00 |
[
[
"Hu",
"Hexiang",
""
],
[
"Lan",
"Shiyi",
""
],
[
"Jiang",
"Yuning",
""
],
[
"Cao",
"Zhimin",
""
],
[
"Sha",
"Fei",
""
]
] |
new_dataset
| 0.996946 |
1704.03519
|
Patrick Sol\'e
|
A. Melakhessou, K. Guenda, T. A. Gulliver, M. Shi and P. Sol\'e
|
On Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
|
19 pages
| null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate linear codes with complementary dual (LCD) codes
and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$,
where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes
and present construction of formally self-dual codes over $R$. Further, we give
bounds on the minimum distance of LCD codes over $\F_q$ and extend these to
codes over $R$.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 20:05:05 GMT"
}
] | 2017-04-13T00:00:00 |
[
[
"Melakhessou",
"A.",
""
],
[
"Guenda",
"K.",
""
],
[
"Gulliver",
"T. A.",
""
],
[
"Shi",
"M.",
""
],
[
"Solé",
"P.",
""
]
] |
new_dataset
| 0.999174 |
1704.03604
|
Guanbin Li
|
Guanbin Li, Yuan Xie, Liang Lin, Yizhou Yu
|
Instance-Level Salient Object Segmentation
|
To appear in CVPR2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image saliency detection has recently witnessed rapid progress due to deep
convolutional neural networks. However, none of the existing methods is able to
identify object instances in the detected salient regions. In this paper, we
present a salient instance segmentation method that produces a saliency mask
with distinct object instance labels for an input image. Our method consists of
three steps, estimating saliency map, detecting salient object contours and
identifying salient object instances. For the first two steps, we propose a
multiscale saliency refinement network, which generates high-quality salient
region masks and salient object contours. Once integrated with multiscale
combinatorial grouping and a MAP-based subset optimization framework, our
method can generate very promising salient object instance segmentation
results. To promote further research and evaluation of salient instance
segmentation, we also construct a new database of 1000 images and their
pixelwise salient instance annotations. Experimental results demonstrate that
our proposed method is capable of achieving state-of-the-art performance on all
public benchmarks for salient region detection as well as on our new dataset
for salient instance segmentation.
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2017 03:05:27 GMT"
}
] | 2017-04-13T00:00:00 |
[
[
"Li",
"Guanbin",
""
],
[
"Xie",
"Yuan",
""
],
[
"Lin",
"Liang",
""
],
[
"Yu",
"Yizhou",
""
]
] |
new_dataset
| 0.993146 |
1704.03761
|
Juan Jacobo Sim\'on-Pinero
|
J. J. Bernal, M. Guerreiro, J. J. Sim\'on
|
From ds-bounds for cyclic codes to true distance for abelian codes
|
arXiv admin note: text overlap with arXiv:1604.02949
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we develop a technique to extend any bound for the minimum
distance of cyclic codes constructed from its defining sets (ds-bounds) to
abelian (or multivariate) codes through the notion of $\mathbb{B}$-apparent
distance. We use this technique to improve the searching for new bounds for the
minimum distance of abelian codes. We also study conditions for an abelian code
to verify that its $\mathbb{B}$-apparent distance reaches its (true) minimum
distance. Then we construct some tables of such codes as an application
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2017 14:00:45 GMT"
}
] | 2017-04-13T00:00:00 |
[
[
"Bernal",
"J. J.",
""
],
[
"Guerreiro",
"M.",
""
],
[
"Simón",
"J. J.",
""
]
] |
new_dataset
| 0.997637 |
1704.03847
|
Nikolay Savinov
|
Timo Hackel, Nikolay Savinov, Lubor Ladicky, Jan D. Wegner, Konrad
Schindler, Marc Pollefeys
|
Semantic3D.net: A new Large-scale Point Cloud Classification Benchmark
|
Accepted to ISPRS Annals. The benchmark website is available at
http://www.semantic3d.net/ . The baseline code is available at
https://github.com/nsavinov/semantic3dnet
| null | null | null |
cs.CV cs.LG cs.NE cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new 3D point cloud classification benchmark data set
with over four billion manually labelled points, meant as input for data-hungry
(deep) learning methods. We also discuss first submissions to the benchmark
that use deep convolutional neural networks (CNNs) as a work horse, which
already show remarkable performance improvements over state-of-the-art. CNNs
have become the de-facto standard for many tasks in computer vision and machine
learning like semantic segmentation or object detection in images, but have no
yet led to a true breakthrough for 3D point cloud labelling tasks due to lack
of training data. With the massive data set presented in this paper, we aim at
closing this data gap to help unleash the full potential of deep learning
methods for 3D labelling tasks. Our semantic3D.net data set consists of dense
point clouds acquired with static terrestrial laser scanners. It contains 8
semantic classes and covers a wide range of urban outdoor scenes: churches,
streets, railroad tracks, squares, villages, soccer fields and castles. We
describe our labelling interface and show that our data set provides more dense
and complete point clouds with much higher overall number of labelled points
compared to those already available to the research community. We further
provide baseline method descriptions and comparison between methods submitted
to our online system. We hope semantic3D.net will pave the way for deep
learning methods in 3D point cloud labelling to learn richer, more general 3D
representations, and first submissions after only a few months indicate that
this might indeed be the case.
|
[
{
"version": "v1",
"created": "Wed, 12 Apr 2017 17:12:57 GMT"
}
] | 2017-04-13T00:00:00 |
[
[
"Hackel",
"Timo",
""
],
[
"Savinov",
"Nikolay",
""
],
[
"Ladicky",
"Lubor",
""
],
[
"Wegner",
"Jan D.",
""
],
[
"Schindler",
"Konrad",
""
],
[
"Pollefeys",
"Marc",
""
]
] |
new_dataset
| 0.991985 |
1610.01687
|
Zifan Li
|
Zifan Li, Ambuj Tewari
|
Sampled Fictitious Play is Hannan Consistent
| null | null | null | null |
cs.GT cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fictitious play is a simple and widely studied adaptive heuristic for playing
repeated games. It is well known that fictitious play fails to be Hannan
consistent. Several variants of fictitious play including regret matching,
generalized regret matching and smooth fictitious play, are known to be Hannan
consistent. In this note, we consider sampled fictitious play: at each round,
the player samples past times and plays the best response to previous moves of
other players at the sampled time points. We show that sampled fictitious play,
using Bernoulli sampling, is Hannan consistent. Unlike several existing Hannan
consistency proofs that rely on concentration of measure results, ours instead
uses anti-concentration results from Littlewood-Offord theory.
|
[
{
"version": "v1",
"created": "Wed, 5 Oct 2016 23:41:23 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Apr 2017 15:52:46 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Li",
"Zifan",
""
],
[
"Tewari",
"Ambuj",
""
]
] |
new_dataset
| 0.992926 |
1701.01295
|
Sven Puchinger
|
Peter Beelen and Sven Puchinger and Johan Rosenkilde n\'e Nielsen
|
Twisted Reed-Solomon Codes
|
5 pages, accepted at IEEE International Symposium on Information
Theory 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new general construction of MDS codes over a finite field
$\mathbb{F}_q$. We describe two explicit subclasses which contain new MDS codes
of length at least $q/2$ for all values of $q \ge 11$. Moreover, we show that
most of the new codes are not equivalent to a Reed-Solomon code.
|
[
{
"version": "v1",
"created": "Thu, 5 Jan 2017 12:40:02 GMT"
},
{
"version": "v2",
"created": "Tue, 11 Apr 2017 06:57:52 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Beelen",
"Peter",
""
],
[
"Puchinger",
"Sven",
""
],
[
"Nielsen",
"Johan Rosenkilde né",
""
]
] |
new_dataset
| 0.991817 |
1704.03092
|
Jianyu Huang
|
Jianyu Huang, Devin A. Matthews, Robert A. van de Geijn
|
Strassen's Algorithm for Tensor Contraction
| null | null | null |
FLAME Working Note #84, The University of Texas at Austin,
Department of Computer Science, Technical Report TR-17-02
|
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tensor contraction (TC) is an important computational kernel widely used in
numerous applications. It is a multi-dimensional generalization of matrix
multiplication (GEMM). While Strassen's algorithm for GEMM is well studied in
theory and practice, extending it to accelerate TC has not been previously
pursued. Thus, we believe this to be the first paper to demonstrate how one can
in practice speed up tensor contraction with Strassen's algorithm. By adopting
a Block-Scatter-Matrix format, a novel matrix-centric tensor layout, we can
conceptually view TC as GEMM for a general stride storage, with an implicit
tensor-to-matrix transformation. This insight enables us to tailor a recent
state-of-the-art implementation of Strassen's algorithm to TC, avoiding
explicit transpositions (permutations) and extra workspace, and reducing the
overhead of memory movement that is incurred. Performance benefits are
demonstrated with a performance model as well as in practice on modern single
core, multicore, and distributed memory parallel architectures, achieving up to
1.3x speedup. The resulting implementations can serve as a drop-in replacement
for various applications with significant speedup.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 00:37:59 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Huang",
"Jianyu",
""
],
[
"Matthews",
"Devin A.",
""
],
[
"van de Geijn",
"Robert A.",
""
]
] |
new_dataset
| 0.999391 |
1704.03094
|
EPTCS
|
Elias Castegren (Uppsala University, Sweden), Tobias Wrigstad (Uppsala
University, Sweden)
|
Actors without Borders: Amnesty for Imprisoned State
|
In Proceedings PLACES 2017, arXiv:1704.02418
|
EPTCS 246, 2017, pp. 10-20
|
10.4204/EPTCS.246.4
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In concurrent systems, some form of synchronisation is typically needed to
achieve data-race freedom, which is important for correctness and safety. In
actor-based systems, messages are exchanged concurrently but executed
sequentially by the receiving actor. By relying on isolation and non-sharing,
an actor can access its own state without fear of data-races, and the internal
behavior of an actor can be reasoned about sequentially.
However, actor isolation is sometimes too strong to express useful patterns.
For example, letting the iterator of a data-collection alias the internal
structure of the collection allows a more efficient implementation than if each
access requires going through the interface of the collection. With full
isolation, in order to maintain sequential reasoning the iterator must be made
part of the collection, which bloats the interface of the collection and means
that a client must have access to the whole data-collection in order to use the
iterator.
In this paper, we propose a programming language construct that enables a
relaxation of isolation but without sacrificing sequential reasoning. We
formalise the mechanism in a simple lambda calculus with actors and passive
objects, and show how an actor may leak parts of its internal state while
ensuring that any interaction with this data is still synchronised.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 00:43:06 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Castegren",
"Elias",
"",
"Uppsala University, Sweden"
],
[
"Wrigstad",
"Tobias",
"",
"Uppsala\n University, Sweden"
]
] |
new_dataset
| 0.995562 |
1704.03118
|
Neil Zhenqiang Gong
|
Neil Zhenqiang Gong, Altay Ozen, Yu Wu, Xiaoyu Cao, Richard Shin, Dawn
Song, Hongxia Jin and Xuan Bao
|
PIANO: Proximity-based User Authentication on Voice-Powered
Internet-of-Things Devices
|
To appear in ICDCS'17
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Voice is envisioned to be a popular way for humans to interact with
Internet-of-Things (IoT) devices. We propose a proximity-based user
authentication method (called PIANO) for access control on such voice-powered
IoT devices. PIANO leverages the built-in speaker, microphone, and Bluetooth
that voice-powered IoT devices often already have. Specifically, we assume that
a user carries a personal voice-powered device (e.g., smartphone, smartwatch,
or smartglass), which serves as the user's identity. When another voice-powered
IoT device of the user requires authentication, PIANO estimates the distance
between the two devices by playing and detecting certain acoustic signals;
PIANO grants access if the estimated distance is no larger than a user-selected
threshold. We implemented a proof-of-concept prototype of PIANO. Through
theoretical and empirical evaluations, we find that PIANO is secure, reliable,
personalizable, and efficient.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 02:27:31 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Gong",
"Neil Zhenqiang",
""
],
[
"Ozen",
"Altay",
""
],
[
"Wu",
"Yu",
""
],
[
"Cao",
"Xiaoyu",
""
],
[
"Shin",
"Richard",
""
],
[
"Song",
"Dawn",
""
],
[
"Jin",
"Hongxia",
""
],
[
"Bao",
"Xuan",
""
]
] |
new_dataset
| 0.997232 |
1704.03168
|
Yeong-Jae Woo
|
Yeong-Jae Woo, Sang Lyul Min
|
FMMU: A Hardware-Automated Flash Map Management Unit for Scalable
Performance of NAND Flash-Based SSDs
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
NAND flash-based Solid State Drives (SSDs), which are widely used from
embedded systems to enterprise servers, are enhancing performance by exploiting
the parallelism of NAND flash memories. To cope with the performance
improvement of SSDs, storage systems have rapidly adopted the host interface
for SSDs from Serial-ATA, which is used for existing hard disk drives, to
high-speed PCI express. Since NAND flash memory does not allow in-place
updates, it requires special software called Flash Translation Layer (FTL), and
SSDs are equipped with embedded processors to run FTL. Existing SSDs increase
the clock frequency of embedded processors or increase the number of embedded
processors in order to prevent FTL from acting as bottleneck of SSD
performance, but these approaches are not scalable. This paper proposes a
hardware-automated Flash Map Management Unit, called FMMU, that handles the
address translation process dominating the execution time of the FTL by
hardware automation. FMMU provides methods for exploiting the parallelism of
flash memory by processing outstanding requests in a non-blocking manner while
reducing the number of flash operations. The experimental results show that the
FMMU reduces the FTL execution time in the map cache hit case and the miss case
by 44% and 37%, respectively, compared with the existing software-based
approach operating in 4-core. FMMU also prevents FTL from acting as a
performance bottleneck for up to 32-channel, 8-way SSD using PCIe 3.0 x32 host
interface.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 06:46:51 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Woo",
"Yeong-Jae",
""
],
[
"Min",
"Sang Lyul",
""
]
] |
new_dataset
| 0.998942 |
1704.03287
|
Namyoon Lee
|
Song-Nam Hong, Seonho Kim, and Namyoon Lee
|
Uplink Multiuser Massive MIMO Systems with Low-Resolution ADCs: A
Coding-Theoretic Approach
|
Submitted to IEEE TWC
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers an uplink multiuser massive
multiple-input-multiple-output (MIMO) system with low-resolution
analog-to-digital converters (ADCs), in which K users with a single-antenna
communicate with one base station (BS) with Nr antennas. In this system, we
present a novel multiuser MIMO detection framework that is inspired by coding
theory. The key idea of the proposed framework is to create a code C of length
2Nr over a spatial domain. This code is constructed by a so-called
auto-encoding function that is not designable but is completely described by a
channel transformation followed by a quantization function of the ADCs. From
this point of view, we convert a multiuser MIMO detection problem into an
equivalent channel coding problem, in which a codeword of C corresponding to
users' messages is sent over 2Nr parallel channels, each with different channel
reliability. To the resulting problem, we propose a novel weighted minimum
distance decoding (wMDD) that appropriately exploits the unequal channel
reliabilities. It is shown that the proposed wMDD yields a non-trivial gain
over the conventional minimum distance decoding (MDD). From coding-theoretic
viewpoint, we identify that bit-error-rate (BER) exponentially decreases with
the minimum distance of the code C, which plays a similar role with a condition
number in conventional MIMO systems. Furthermore, we develop the communication
method that uses the wMDD for practical scenarios where the BS has no knowledge
of channel state information. Finally, numerical results are provided to verify
the superiority of the proposed method.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 13:49:41 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Hong",
"Song-Nam",
""
],
[
"Kim",
"Seonho",
""
],
[
"Lee",
"Namyoon",
""
]
] |
new_dataset
| 0.99155 |
1704.03298
|
Ralf Mikut
|
Ralf Mikut, Andreas Bartschat, Wolfgang Doneit, Jorge \'Angel
Gonz\'alez Ordiano, Benjamin Schott, Johannes Stegmaier, Simon Waczowicz,
Markus Reischl
|
The MATLAB Toolbox SciXMiner: User's Manual and Programmer's Guide
| null | null | null | null |
cs.LG
|
http://creativecommons.org/licenses/by-sa/4.0/
|
The Matlab toolbox SciXMiner is designed for the visualization and analysis
of time series and features with a special focus to classification problems. It
was developed at the Institute of Applied Computer Science of the Karlsruhe
Institute of Technology (KIT), a member of the Helmholtz Association of German
Research Centres in Germany. The aim was to provide an open platform for the
development and improvement of data mining methods and its applications to
various medical and technical problems. SciXMiner bases on Matlab (tested for
the version 2017a). Many functions do not require additional standard toolboxes
but some parts of Signal, Statistics and Wavelet toolboxes are used for special
cases. The decision to a Matlab-based solution was made to use the wide
mathematical functionality of this package provided by The Mathworks Inc.
SciXMiner is controlled by a graphical user interface (GUI) with menu items and
control elements like popup lists, checkboxes and edit elements. This makes it
easier to work with SciXMiner for inexperienced users. Furthermore, an
automatization and batch standardization of analyzes is possible using macros.
The standard Matlab style using the command line is also available. SciXMiner
is an open source software. The download page is
http://sourceforge.net/projects/SciXMiner. It is licensed under the conditions
of the GNU General Public License (GNU-GPL) of The Free Software Foundation.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 14:17:47 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Mikut",
"Ralf",
""
],
[
"Bartschat",
"Andreas",
""
],
[
"Doneit",
"Wolfgang",
""
],
[
"Ordiano",
"Jorge Ángel González",
""
],
[
"Schott",
"Benjamin",
""
],
[
"Stegmaier",
"Johannes",
""
],
[
"Waczowicz",
"Simon",
""
],
[
"Reischl",
"Markus",
""
]
] |
new_dataset
| 0.982972 |
1704.03342
|
Mieczys{\l}aw K{\l}opotek
|
Mieczys{\l}aw A. K{\l}opotek
|
Beliefs and Probability in Bacchus' l.p. Logic: A~3-Valued Logic
Solution to Apparent Counter-intuition
|
Draft for the conference M.A. K{\l}opotek: Beliefs and Probability in
Bacchus' l.p. Logic: A 3-Valued Logic Solution to Apparent Counter-intuition.
[in:] R. Trappl Ed,: Cybernetics and Systems Research. Proc. 11 European
Meeting on Cybernetics and System Research EMCSR'92, Wien, Osterreich, 20.
April 1992. World Scientific Singapore, New Jersey, London, HongKong Vol. 1,
pp. 519-526
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fundamental discrepancy between first order logic and statistical inference
(global versus local properties of universe) is shown to be the obstacle for
integration of logic and probability in L.p. logic of Bacchus. To overcome the
counterintuitiveness of L.p. behaviour, a 3-valued logic is proposed.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 15:04:45 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Kłopotek",
"Mieczysław A.",
""
]
] |
new_dataset
| 0.958936 |
1704.03383
|
Felipe A. Cruz
|
Lucas Benedicic, Felipe A. Cruz, Alberto Madonna and Kean Mariotti
|
Portable, high-performance containers for HPC
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Building and deploying software on high-end computing systems is a
challenging task. High performance applications have to reliably run across
multiple platforms and environments, and make use of site-specific resources
while resolving complicated software-stack dependencies. Containers are a type
of lightweight virtualization technology that attempt to solve this problem by
packaging applications and their environments into standard units of software
that are: portable, easy to build and deploy, have a small footprint, and low
runtime overhead. In this work we present an extension to the container runtime
of Shifter that provides containerized applications with a mechanism to access
GPU accelerators and specialized networking from the host system, effectively
enabling performance portability of containers across HPC resources. The
presented extension makes possible to rapidly deploy high-performance software
on supercomputers from containerized applications that have been developed,
built, and tested in non-HPC commodity hardware, e.g. the laptop or workstation
of a researcher.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 15:57:33 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Benedicic",
"Lucas",
""
],
[
"Cruz",
"Felipe A.",
""
],
[
"Madonna",
"Alberto",
""
],
[
"Mariotti",
"Kean",
""
]
] |
new_dataset
| 0.99946 |
1704.03446
|
Xuhong Chen
|
Xuhong Chen, Jiaxun Lu, Tao Li, Pingyi Fan and Khaled Ben Letaief
|
Directivity-Beamwidth Tradeoff of Massive MIMO Uplink Beamforming for
High Speed Train Communication
|
This paper has been accepted for future publication in IEEE ACCESS.
arXiv admin note: substantial text overlap with arXiv:1702.02121
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High-mobility adaption and massive Multiple-input Multiple-output (MIMO)
application are two primary evolving objectives for the next generation high
speed train (HST) wireless communication system. In this paper, we consider how
to design a location-aware beamforming for the massive MIMO system in the high
traffic density HST network. We first analyze the tradeoff between beam
directivity and beamwidth, based on which we present the sensitivity analysis
of positioning accuracy. Then, in order to guarantee a high efficient
transmission, we derive an optimal problem to maximize the beam directivity
under the restriction of diverse positioning accuracies. After that, we present
a low-complexity beamforming design by utilizing location information, which
requires neither eigen-decomposing (ED) the uplink channel covariance matrix
(CCM) nor ED the downlink CCM (DCCM). Finally, we study the beamforming scheme
in future high traffic density HST network, where a two HSTs encountering
scenario is emphasized. By utilizing the real-time location information, we
propose an optimal adaptive beamforming scheme to maximize the achievable rate
region under limited channel source constraint. Numerical simulation indicates
that a massive MIMO system with less than a certain positioning error can
guarantee a required performance with satisfying transmission efficiency in the
high traffic density HST scenario and the achievable rate region when two HSTs
encounter is greatly improved as well.
|
[
{
"version": "v1",
"created": "Tue, 11 Apr 2017 17:47:54 GMT"
}
] | 2017-04-12T00:00:00 |
[
[
"Chen",
"Xuhong",
""
],
[
"Lu",
"Jiaxun",
""
],
[
"Li",
"Tao",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Letaief",
"Khaled Ben",
""
]
] |
new_dataset
| 0.990192 |
1410.8202
|
Jesko H\"uttenhain
|
Jesko H\"uttenhain and Christian Ikenmeyer
|
Binary Determinantal Complexity
|
10 pages, C source code for the computation available as ancillary
files
|
Linear Algebra and its Applications, 504:559-573, 2016
|
10.1016/j.laa.2016.04.027
| null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that for writing the 3 by 3 permanent polynomial as a determinant of
a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7
matrix is required. Our proof is computer based and uses the enumeration of
bipartite graphs. Furthermore, we analyze sequences of polynomials that are
determinants of polynomially sized matrices consisting only of zeros, ones, and
variables. We show that these are exactly the sequences in the complexity class
of constant free polynomially sized (weakly) skew circuits.
|
[
{
"version": "v1",
"created": "Wed, 29 Oct 2014 23:57:38 GMT"
},
{
"version": "v2",
"created": "Fri, 23 Jan 2015 22:20:31 GMT"
}
] | 2017-04-11T00:00:00 |
[
[
"Hüttenhain",
"Jesko",
""
],
[
"Ikenmeyer",
"Christian",
""
]
] |
new_dataset
| 0.982381 |
1512.03384
|
Xintong Han
|
Xintong Han, Bharat Singh, Vlad I. Morariu and Larry S. Davis
|
VRFP: On-the-fly Video Retrieval using Web Images and Fast Fisher Vector
Products
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
VRFP is a real-time video retrieval framework based on short text input
queries, which obtains weakly labeled training images from the web after the
query is known. The retrieved web images representing the query and each
database video are treated as unordered collections of images, and each
collection is represented using a single Fisher Vector built on CNN features.
Our experiments show that a Fisher Vector is robust to noise present in web
images and compares favorably in terms of accuracy to other standard
representations. While a Fisher Vector can be constructed efficiently for a new
query, matching against the test set is slow due to its high dimensionality. To
perform matching in real-time, we present a lossless algorithm that accelerates
the inner product computation between high dimensional Fisher Vectors. We prove
that the expected number of multiplications required decreases quadratically
with the sparsity of Fisher Vectors. We are not only able to construct and
apply query models in real-time, but with the help of a simple re-ranking
scheme, we also outperform state-of-the-art automatic retrieval methods by a
significant margin on TRECVID MED13 (3.5%), MED14 (1.3%) and CCV datasets
(5.2%). We also provide a direct comparison on standard datasets between two
different paradigms for automatic video retrieval - zero-shot learning and
on-the-fly retrieval.
|
[
{
"version": "v1",
"created": "Thu, 10 Dec 2015 19:50:50 GMT"
},
{
"version": "v2",
"created": "Thu, 7 Apr 2016 01:25:42 GMT"
},
{
"version": "v3",
"created": "Mon, 10 Apr 2017 17:28:16 GMT"
}
] | 2017-04-11T00:00:00 |
[
[
"Han",
"Xintong",
""
],
[
"Singh",
"Bharat",
""
],
[
"Morariu",
"Vlad I.",
""
],
[
"Davis",
"Larry S.",
""
]
] |
new_dataset
| 0.996038 |
1704.02245
|
Gang Yang
|
Gang Yang and Ying-Chang Liang and Rui Zhang and Yiyang Pei
|
Modulation in the Air: Backscatter Communication over Ambient OFDM
Carrier
|
32 pages, 10 figures, journal paper
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ambient backscatter communication (AmBC) enables radio-frequency (RF) powered
backscatter devices (BDs) (e.g., sensors, tags) to modulate their information
bits over ambient RF carriers in an over-the-air manner. This technology also
called "modulation in the air", thus has emerged as a promising solution to
achieve green communications for future Internet-of-Things. This paper studies
an AmBC system by leveraging the ambient orthogonal frequency division
multiplexing (OFDM) modulated signals in the air. We first model such AmBC
system from a spread-spectrum communication perspective, upon which a novel
joint design for BD waveform and receiver detector is proposed. The BD symbol
period is designed to be in general an integer multiplication of the OFDM
symbol period, and the waveform for BD bit `0' maintains the same state within
a BD symbol period, while the waveform for BD bit `1' has a state transition in
the middle of each OFDM symbol period within a BD symbol period. In the
receiver detector design, we construct the test statistic that cancels out the
direct-link interference by exploiting the repeating structure of the ambient
OFDM signals due to the use of cyclic prefix. For the system with a
single-antenna receiver, the maximum-likelihood detector is proposed to recover
the BD bits, for which the optimal threshold is obtained in closed-form
expression. For the system with a multi-antenna receiver, we propose a new test
statistic, and derive the optimal detector. Moreover, practical timing
synchronization algorithms are proposed, and we also analyze the effect of
various system parameters on the system performance. Finally, extensive
numerical results are provided to verify that the proposed transceiver design
can improve the system bit-error-rate (BER) performance and the operating range
significantly, and achieve much higher data rate, as compared to the
conventional design.
|
[
{
"version": "v1",
"created": "Fri, 7 Apr 2017 14:22:43 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Apr 2017 02:36:00 GMT"
}
] | 2017-04-11T00:00:00 |
[
[
"Yang",
"Gang",
""
],
[
"Liang",
"Ying-Chang",
""
],
[
"Zhang",
"Rui",
""
],
[
"Pei",
"Yiyang",
""
]
] |
new_dataset
| 0.996618 |
1704.02375
|
Yanhong Annie Liu
|
David S. Warren and Yanhong A. Liu
|
AppLP: A Dialogue on Applications of Logic Programming
|
David S. Warren and Yanhong A. Liu (Editors). 33 pages. Including
summaries by Christopher Kane and abstracts or position papers by M. Aref, J.
Rosenwald, I. Cervesato, E.S.L. Lam, M. Balduccini, J. Lobo, A. Russo, E.
Lupu, N. Leone, F. Ricca, G. Gupta, K. Marple, E. Salazar, Z. Chen, A. Sobhi,
S. Srirangapalli, C.R. Ramakrishnan, N. Bj{\o}rner, N.P. Lopes, A.
Rybalchenko, and P. Tarau
| null | null | null |
cs.PL cs.AI cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document describes the contributions of the 2016 Applications of Logic
Programming Workshop (AppLP), which was held on October 17 and associated with
the International Conference on Logic Programming (ICLP) in Flushing, New York
City.
|
[
{
"version": "v1",
"created": "Fri, 7 Apr 2017 21:10:00 GMT"
}
] | 2017-04-11T00:00:00 |
[
[
"Warren",
"David S.",
""
],
[
"Liu",
"Yanhong A.",
""
]
] |
new_dataset
| 0.977037 |
1704.02553
|
Sean Rowan
|
Sean Rowan, Michael Clear, Mario Gerla, Meriel Huggard, Ciar\'an Mc
Goldrick
|
Securing Vehicle to Vehicle Communications using Blockchain through
Visible Light and Acoustic Side-Channels
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous and self-driving vehicles are appearing on the public highways.
These vehicles commonly use wireless communication techniques for both
vehicle-to-vehicle and vehicle-to-infrastructure communications. Manufacturers,
regulators and the public are understandably concerned about large-scale
systems failure or malicious attack via these wireless vehicular networks. This
paper explores the use of sensing and signalling devices that are commonly
integrated into modern vehicles for side-channel communication purposes.
Visible light (using a CMOS camera) and acoustic (ultrasonic audio)
side-channel encoding techniques are proposed, developed and evaluated in this
context. The side-channels are examined both theoretically and experimentally
and an upper bound on the line code modulation rate that is achievable with
these side channel schemes in the vehicular networking context is established.
A novel inter-vehicle session key establishment protocol, leveraging both
side-channels and a blockchain public key infrastructure, is then presented. In
light of the limited channel capacity and the interoperability/security
requirements for vehicular communications, techniques for constraining the
throughput requirement, providing device independence and validating the
location of the intended recipient vehicle, are presented. These reduce the
necessary device handshake throughput to 176 bits for creating symmetric
encryption and message authentication keys and in verifying a vehicle's
certificate with a recognised certification authority.
|
[
{
"version": "v1",
"created": "Sun, 9 Apr 2017 01:48:57 GMT"
}
] | 2017-04-11T00:00:00 |
[
[
"Rowan",
"Sean",
""
],
[
"Clear",
"Michael",
""
],
[
"Gerla",
"Mario",
""
],
[
"Huggard",
"Meriel",
""
],
[
"Goldrick",
"Ciarán Mc",
""
]
] |
new_dataset
| 0.989183 |
1704.02724
|
Byungmoon Kim Dr
|
Yeojin Kim, Byungmoon Kim, Jiyang Kim, Young J. Kim
|
CanvoX: High-resolution VR Painting in Large Volumetric Canvas
| null | null | null | null |
cs.GR
|
http://creativecommons.org/publicdomain/zero/1.0/
|
With virtual reality, digital painting on 2D canvases is now being extended
to 3D spaces. Tilt Brush and Oculus Quill are widely accepted among artists as
tools that pave the way to a new form of art - 3D emmersive painting. Current
3D painting systems are only a start, emitting textured triangular geometries.
In this paper, we advance this new art of 3D painting to 3D volumetric painting
that enables an artist to draw a huge scene with full control of spatial color
fields. Inspired by the fact that 2D paintings often use vast space to paint
background and small but detailed space for foreground, we claim that
supporting a large canvas in varying detail is essential for 3D painting. In
order to help artists focus and audiences to navigate the large canvas space,
we provide small artist-defined areas, called rooms, that serve as beacons for
artist-suggested scales, spaces, locations for intended appreciation view of
the painting. Artists and audiences can easily transport themselves between
different rooms. Technically, our canvas is represented as an array of deep
octrees of depth 24 or higher, built on CPU for volume painting and on GPU for
volume rendering using accurate ray casting. In CPU side, we design an
efficient iterative algorithm to refine or coarsen octree, as a result of
volumetric painting strokes, at highly interactive rates, and update the
corresponding GPU textures. Then we use GPU-based ray casting algorithms to
render the volumetric painting result. We explore precision issues stemming
from ray-casting the octree of high depth, and provide a new analysis and
verification. From our experimental results as well as the positive feedback
from the participating artists, we strongly believe that our new 3D volume
painting system can open up a new possibility for VR-driven digital art medium
to professional artists as well as to novice users.
|
[
{
"version": "v1",
"created": "Mon, 10 Apr 2017 06:40:56 GMT"
}
] | 2017-04-11T00:00:00 |
[
[
"Kim",
"Yeojin",
""
],
[
"Kim",
"Byungmoon",
""
],
[
"Kim",
"Jiyang",
""
],
[
"Kim",
"Young J.",
""
]
] |
new_dataset
| 0.999589 |
1603.09364
|
Upal Mahbub
|
Upal Mahbub, Vishal M. Patel, Deepak Chandra, Brandon Barbello, Rama
Chellappa
|
Partial Face Detection for Continuous Authentication
| null |
2016 IEEE International Conference on Image Processing (ICIP),
Phoenix, AZ, USA, 2016, pp. 2991-2995
|
10.1109/ICIP.2016.7532908
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a part-based technique for real time detection of users' faces
on mobile devices is proposed. This method is specifically designed for
detecting partially cropped and occluded faces captured using a smartphone's
front-facing camera for continuous authentication. The key idea is to detect
facial segments in the frame and cluster the results to obtain the region which
is most likely to contain a face. Extensive experimentation on a mobile dataset
of 50 users shows that our method performs better than many state-of-the-art
face detection methods in terms of accuracy and processing speed.
|
[
{
"version": "v1",
"created": "Wed, 30 Mar 2016 20:15:08 GMT"
}
] | 2017-04-10T00:00:00 |
[
[
"Mahbub",
"Upal",
""
],
[
"Patel",
"Vishal M.",
""
],
[
"Chandra",
"Deepak",
""
],
[
"Barbello",
"Brandon",
""
],
[
"Chellappa",
"Rama",
""
]
] |
new_dataset
| 0.998465 |
1610.07930
|
Upal Mahbub
|
Upal Mahbub, Sayantan Sarkar, Vishal M. Patel, Rama Chellappa
|
Active User Authentication for Smartphones: A Challenge Data Set and
Benchmark Results
|
8 pages, 12 figures, 6 tables. Best poster award at BTAS 2016
| null |
10.1109/BTAS.2016.7791155
| null |
cs.CV cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, automated user verification techniques for smartphones are
investigated. A unique non-commercial dataset, the University of Maryland
Active Authentication Dataset 02 (UMDAA-02) for multi-modal user authentication
research is introduced. This paper focuses on three sensors - front camera,
touch sensor and location service while providing a general description for
other modalities. Benchmark results for face detection, face verification,
touch-based user identification and location-based next-place prediction are
presented, which indicate that more robust methods fine-tuned to the mobile
platform are needed to achieve satisfactory verification accuracy. The dataset
will be made available to the research community for promoting additional
research.
|
[
{
"version": "v1",
"created": "Tue, 25 Oct 2016 15:56:07 GMT"
}
] | 2017-04-10T00:00:00 |
[
[
"Mahbub",
"Upal",
""
],
[
"Sarkar",
"Sayantan",
""
],
[
"Patel",
"Vishal M.",
""
],
[
"Chellappa",
"Rama",
""
]
] |
new_dataset
| 0.999558 |
1611.07727
|
Umar Iqbal
|
Umar Iqbal, Anton Milan, Juergen Gall
|
PoseTrack: Joint Multi-Person Pose Estimation and Tracking
|
Accepted to CVPR 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we introduce the challenging problem of joint multi-person pose
estimation and tracking of an unknown number of persons in unconstrained
videos. Existing methods for multi-person pose estimation in images cannot be
applied directly to this problem, since it also requires to solve the problem
of person association over time in addition to the pose estimation for each
person. We therefore propose a novel method that jointly models multi-person
pose estimation and tracking in a single formulation. To this end, we represent
body joint detections in a video by a spatio-temporal graph and solve an
integer linear program to partition the graph into sub-graphs that correspond
to plausible body pose trajectories for each person. The proposed approach
implicitly handles occlusion and truncation of persons. Since the problem has
not been addressed quantitatively in the literature, we introduce a challenging
"Multi-Person PoseTrack" dataset, and also propose a completely unconstrained
evaluation protocol that does not make any assumptions about the scale, size,
location or the number of persons. Finally, we evaluate the proposed approach
and several baseline methods on our new dataset.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 10:30:06 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Nov 2016 12:56:22 GMT"
},
{
"version": "v3",
"created": "Fri, 7 Apr 2017 14:16:38 GMT"
}
] | 2017-04-10T00:00:00 |
[
[
"Iqbal",
"Umar",
""
],
[
"Milan",
"Anton",
""
],
[
"Gall",
"Juergen",
""
]
] |
new_dataset
| 0.994195 |
1703.10135
|
Yuxuan Wang
|
Yuxuan Wang, RJ Skerry-Ryan, Daisy Stanton, Yonghui Wu, Ron J. Weiss,
Navdeep Jaitly, Zongheng Yang, Ying Xiao, Zhifeng Chen, Samy Bengio, Quoc Le,
Yannis Agiomyrgiannakis, Rob Clark, Rif A. Saurous
|
Tacotron: Towards End-to-End Speech Synthesis
|
Submitted to Interspeech 2017. v2 changed paper title to be
consistent with our conference submission (no content change other than typo
fixes)
| null | null | null |
cs.CL cs.LG cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A text-to-speech synthesis system typically consists of multiple stages, such
as a text analysis frontend, an acoustic model and an audio synthesis module.
Building these components often requires extensive domain expertise and may
contain brittle design choices. In this paper, we present Tacotron, an
end-to-end generative text-to-speech model that synthesizes speech directly
from characters. Given <text, audio> pairs, the model can be trained completely
from scratch with random initialization. We present several key techniques to
make the sequence-to-sequence framework perform well for this challenging task.
Tacotron achieves a 3.82 subjective 5-scale mean opinion score on US English,
outperforming a production parametric system in terms of naturalness. In
addition, since Tacotron generates speech at the frame level, it's
substantially faster than sample-level autoregressive methods.
|
[
{
"version": "v1",
"created": "Wed, 29 Mar 2017 16:55:13 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Apr 2017 21:20:34 GMT"
}
] | 2017-04-10T00:00:00 |
[
[
"Wang",
"Yuxuan",
""
],
[
"Skerry-Ryan",
"RJ",
""
],
[
"Stanton",
"Daisy",
""
],
[
"Wu",
"Yonghui",
""
],
[
"Weiss",
"Ron J.",
""
],
[
"Jaitly",
"Navdeep",
""
],
[
"Yang",
"Zongheng",
""
],
[
"Xiao",
"Ying",
""
],
[
"Chen",
"Zhifeng",
""
],
[
"Bengio",
"Samy",
""
],
[
"Le",
"Quoc",
""
],
[
"Agiomyrgiannakis",
"Yannis",
""
],
[
"Clark",
"Rob",
""
],
[
"Saurous",
"Rif A.",
""
]
] |
new_dataset
| 0.989333 |
1704.01984
|
Yi Li
|
Yi Li, M. Cenk Gursoy and Senem Velipasalar
|
A Delay-Aware Caching Algorithm for Wireless D2D Caching Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, wireless caching techniques have been studied to satisfy lower
delay requirements and offload traffic from peak periods. By storing parts of
the popular files at the mobile users, users can locate some of their requested
files in their own caches or the caches at their neighbors. In the latter case,
when a user receives files from its neighbors, device-to-device (D2D)
communication is enabled. D2D communication underlaid with cellular networks is
also a new paradigm for the upcoming 5G wireless systems. By allowing a pair of
adjacent D2D users to communicate directly, D2D communication can achieve
higher throughput, better energy efficiency and lower traffic delay. In this
work, we propose a very efficient caching algorithm for D2D-enabled cellular
networks to minimize the average transmission delay. Instead of searching over
all possible solutions, our algorithm finds out the best <file,user> pairs,
which provide the best delay improvement in each loop to form a caching policy
with very low transmission delay and high throughput. This algorithm is also
extended to address a more general scenario, in which the distributions of
fading coefficients and values of system parameters potentially change over
time. Via numerical results, the superiority of the proposed algorithm is
verified by comparing it with a naive algorithm, in which all users simply
cache their favorite files.
|
[
{
"version": "v1",
"created": "Thu, 6 Apr 2017 18:30:24 GMT"
}
] | 2017-04-10T00:00:00 |
[
[
"Li",
"Yi",
""
],
[
"Gursoy",
"M. Cenk",
""
],
[
"Velipasalar",
"Senem",
""
]
] |
new_dataset
| 0.998611 |
1704.02199
|
Yuta Matsuzaki Mr
|
Yuta Matsuzaki, Kazushige Okayasu, Takaaki Imanari, Naomichi
Kobayashi, Yoshihiro Kanehara, Ryousuke Takasawa, Akio Nakamura, Hirokatsu
Kataoka
|
Could you guess an interesting movie from the posters?: An evaluation of
vision-based features on movie poster database
|
4 pages, 4 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we aim to estimate the Winner of world-wide film festival from
the exhibited movie poster. The task is an extremely challenging because the
estimation must be done with only an exhibited movie poster, without any film
ratings and box-office takings. In order to tackle this problem, we have
created a new database which is consist of all movie posters included in the
four biggest film festivals. The movie poster database (MPDB) contains historic
movies over 80 years which are nominated a movie award at each year. We apply a
couple of feature types, namely hand-craft, mid-level and deep feature to
extract various information from a movie poster. Our experiments showed
suggestive knowledge, for example, the Academy award estimation can be better
rate with a color feature and a facial emotion feature generally performs good
rate on the MPDB. The paper may suggest a possibility of modeling human taste
for a movie recommendation.
|
[
{
"version": "v1",
"created": "Fri, 7 Apr 2017 12:17:38 GMT"
}
] | 2017-04-10T00:00:00 |
[
[
"Matsuzaki",
"Yuta",
""
],
[
"Okayasu",
"Kazushige",
""
],
[
"Imanari",
"Takaaki",
""
],
[
"Kobayashi",
"Naomichi",
""
],
[
"Kanehara",
"Yoshihiro",
""
],
[
"Takasawa",
"Ryousuke",
""
],
[
"Nakamura",
"Akio",
""
],
[
"Kataoka",
"Hirokatsu",
""
]
] |
new_dataset
| 0.989201 |
1704.02224
|
Xiaoming Deng
|
Xiaoming Deng, Shuo Yang, Yinda Zhang, Ping Tan, Liang Chang, Hongan
Wang
|
Hand3D: Hand Pose Estimation using 3D Neural Network
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel 3D neural network architecture for 3D hand pose estimation
from a single depth image. Different from previous works that mostly run on 2D
depth image domain and require intermediate or post process to bring in the
supervision from 3D space, we convert the depth map to a 3D volumetric
representation, and feed it into a 3D convolutional neural network(CNN) to
directly produce the pose in 3D requiring no further process. Our system does
not require the ground truth reference point for initialization, and our
network architecture naturally integrates both local feature and global context
in 3D space. To increase the coverage of the hand pose space of the training
data, we render synthetic depth image by transferring hand pose from existing
real image datasets. We evaluation our algorithm on two public benchmarks and
achieve the state-of-the-art performance. The synthetic hand pose dataset will
be available.
|
[
{
"version": "v1",
"created": "Fri, 7 Apr 2017 13:27:48 GMT"
}
] | 2017-04-10T00:00:00 |
[
[
"Deng",
"Xiaoming",
""
],
[
"Yang",
"Shuo",
""
],
[
"Zhang",
"Yinda",
""
],
[
"Tan",
"Ping",
""
],
[
"Chang",
"Liang",
""
],
[
"Wang",
"Hongan",
""
]
] |
new_dataset
| 0.998833 |
1604.02531
|
Liang Zheng
|
Liang Zheng, Hengheng Zhang, Shaoyan Sun, Manmohan Chandraker, Yi
Yang, Qi Tian
|
Person Re-identification in the Wild
|
accepted as spotlight to CVPR 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel large-scale dataset and comprehensive baselines for
end-to-end pedestrian detection and person recognition in raw video frames. Our
baselines address three issues: the performance of various combinations of
detectors and recognizers, mechanisms for pedestrian detection to help improve
overall re-identification accuracy and assessing the effectiveness of different
detectors for re-identification. We make three distinct contributions. First, a
new dataset, PRW, is introduced to evaluate Person Re-identification in the
Wild, using videos acquired through six synchronized cameras. It contains 932
identities and 11,816 frames in which pedestrians are annotated with their
bounding box positions and identities. Extensive benchmarking results are
presented on this dataset. Second, we show that pedestrian detection aids
re-identification through two simple yet effective improvements: a
discriminatively trained ID-discriminative Embedding (IDE) in the person
subspace using convolutional neural network (CNN) features and a Confidence
Weighted Similarity (CWS) metric that incorporates detection scores into
similarity measurement. Third, we derive insights in evaluating detector
performance for the particular scenario of accurate person re-identification.
|
[
{
"version": "v1",
"created": "Sat, 9 Apr 2016 06:57:28 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Apr 2017 15:02:40 GMT"
}
] | 2017-04-07T00:00:00 |
[
[
"Zheng",
"Liang",
""
],
[
"Zhang",
"Hengheng",
""
],
[
"Sun",
"Shaoyan",
""
],
[
"Chandraker",
"Manmohan",
""
],
[
"Yang",
"Yi",
""
],
[
"Tian",
"Qi",
""
]
] |
new_dataset
| 0.999779 |
1609.02789
|
Donghyeon Lee
|
Donghyeon Lee
|
Arachneum: Blockchain meets Distributed Web
|
This paper has been withdrawn by the author. I feel need some
experiments
| null | null | null |
cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Appearance of Bitcoin raise up evolution in currency. Blockchain database
also raise up possibilities to share important data between untrusted peers. In
this paper, we propose Arachneum, a decentralized, distributed, and
model-view-controller-based web service using blockchain and new privileges
model. Therefore, we can enjoy the freedom against censorship of government or
organizations, keep transparency of our web services, fork our web services,
and create/read/update/delete(CRUD) all model-view-controller(MVC) components
dynamically.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2016 20:27:28 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Apr 2017 23:00:20 GMT"
}
] | 2017-04-07T00:00:00 |
[
[
"Lee",
"Donghyeon",
""
]
] |
new_dataset
| 0.999111 |
1702.01105
|
Iro Armeni
|
Iro Armeni, Sasha Sax, Amir R. Zamir and Silvio Savarese
|
Joint 2D-3D-Semantic Data for Indoor Scene Understanding
|
The dataset is available http://3Dsemantics.stanford.edu/
| null | null | null |
cs.CV cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a dataset of large-scale indoor spaces that provides a variety of
mutually registered modalities from 2D, 2.5D and 3D domains, with
instance-level semantic and geometric annotations. The dataset covers over
6,000m2 and contains over 70,000 RGB images, along with the corresponding
depths, surface normals, semantic annotations, global XYZ images (all in forms
of both regular and 360{\deg} equirectangular images) as well as camera
information. It also includes registered raw and semantically annotated 3D
meshes and point clouds. The dataset enables development of joint and
cross-modal learning models and potentially unsupervised approaches utilizing
the regularities present in large-scale indoor spaces. The dataset is available
here: http://3Dsemantics.stanford.edu/
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2017 18:28:33 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Apr 2017 01:46:13 GMT"
}
] | 2017-04-07T00:00:00 |
[
[
"Armeni",
"Iro",
""
],
[
"Sax",
"Sasha",
""
],
[
"Zamir",
"Amir R.",
""
],
[
"Savarese",
"Silvio",
""
]
] |
new_dataset
| 0.999701 |
1704.01570
|
Utku Kose
|
Aslihan Tufekci, Kamuran Samanci, Utku Kose
|
Developing a FPGA-supported touchscreen writing / drawing system for
educational environments
|
31 pages, 13 figures, 6 tables
|
Journal of Multidisciplinary Developments, 1(1), 2016, 60-90
| null | null |
cs.HC
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Developments in information and communication technologies have been greatly
influential on the practices in all fields, and education is not an exception
to this. To illustrate with, computers were first used in computer assisted
education in order to increase the efficiency of teaching process. Recently,
computer has contributed more to the field through interactive and smart class
applications that are specially designed for classroom use. The aim of this
study is to develop a low cost, portable and projection supported touchscreen
to be used in educational environments by using FPGA technology and to test its
usability. For the purposes of the study, the above mentioned system was
developed by using the necessary hardware and software, and later it was tested
in terms of usability. This usability test was administered to teachers, who
were the target end users of this touchscreen writing / drawing system. The aim
of this test was to determine user friendliness, subservientness and usability
of the system. Several tools were used to obtain data from the users that
participated in the study. The analysis and evaluation of the data collected
revealed that the system has achieved its objectives successfully.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 18:28:50 GMT"
}
] | 2017-04-07T00:00:00 |
[
[
"Tufekci",
"Aslihan",
""
],
[
"Samanci",
"Kamuran",
""
],
[
"Kose",
"Utku",
""
]
] |
new_dataset
| 0.999449 |
1704.01669
|
Valentin Khrulkov
|
Valentin Khrulkov, Maxim Rakhuba and Ivan Oseledets
|
Vico-Greengard-Ferrando quadratures in the tensor solver for integral
equations
| null | null | null | null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Convolution with Green's function of a differential operator appears in a lot
of applications e.g. Lippmann-Schwinger integral equation. Algorithms for
computing such are usually non-trivial and require non-uniform mesh. However,
recently Vico, Greengard and Ferrando developed method for computing
convolution with smooth functions with compact support with spectral accuracy,
requiring nothing more than Fast Fourier Transform (FFT). Their approach is
very suitable for the low-rank tensor implementation which we develop using
Quantized Tensor Train (QTT) decomposition.
|
[
{
"version": "v1",
"created": "Wed, 5 Apr 2017 23:47:57 GMT"
}
] | 2017-04-07T00:00:00 |
[
[
"Khrulkov",
"Valentin",
""
],
[
"Rakhuba",
"Maxim",
""
],
[
"Oseledets",
"Ivan",
""
]
] |
new_dataset
| 0.991751 |
1704.01802
|
Henrique Oliveira Santos
|
Henrique Santos, Vasco Furtado, Paulo Pinheiro, Deborah L. McGuinness
|
Contextual Data Collection for Smart Cities
|
In Proceedings of the 6th Workshop on Semantics for Smarter Cities
(S4SC 2015), Bethlehem, PA, USA, October 11-12, 2015
| null | null | null |
cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As part of Smart Cities initiatives, national, regional and local governments
all over the globe are under the mandate of being more open regarding how they
share their data. Under this mandate, many of these governments are publishing
data under the umbrella of open government data, which includes measurement
data from city-wide sensor networks. Furthermore, many of these data are
published in so-called data portals as documents that may be spreadsheets,
comma-separated value (CSV) data files, or plain documents in PDF or Word
documents. The sharing of these documents may be a convenient way for the data
provider to convey and publish data but it is not the ideal way for data
consumers to reuse the data. For example, the problems of reusing the data may
range from difficulty opening a document that is provided in any format that is
not plain text, to the actual problem of understanding the meaning of each
piece of knowledge inside of the document. Our proposal tackles those
challenges by identifying metadata that has been regarded to be relevant for
measurement data and providing a schema for this metadata. We further leverage
the Human-Aware Sensor Network Ontology (HASNetO) to build an architecture for
data collected in urban environments. We discuss the use of HASNetO and the
supporting infrastructure to manage both data and metadata in support of the
City of Fortaleza, a large metropolitan area in Brazil.
|
[
{
"version": "v1",
"created": "Thu, 6 Apr 2017 12:21:57 GMT"
}
] | 2017-04-07T00:00:00 |
[
[
"Santos",
"Henrique",
""
],
[
"Furtado",
"Vasco",
""
],
[
"Pinheiro",
"Paulo",
""
],
[
"McGuinness",
"Deborah L.",
""
]
] |
new_dataset
| 0.950354 |
1704.01859
|
Raluca Necula
|
Raluca Necula (1), Mihaela Breaban (1) and Madalina Raschip (1) ((1)
Faculty of Computer Science, Alexandru Ioan Cuza University, Iasi, Romania)
|
Tackling Dynamic Vehicle Routing Problem with Time Windows by means of
Ant Colony System
|
10 pages, 2 figures
| null | null | null |
cs.NE cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) is an
extension of the well-known Vehicle Routing Problem (VRP), which takes into
account the dynamic nature of the problem. This aspect requires the vehicle
routes to be updated in an ongoing manner as new customer requests arrive in
the system and must be incorporated into an evolving schedule during the
working day. Besides the vehicle capacity constraint involved in the classical
VRP, DVRPTW considers in addition time windows, which are able to better
capture real-world situations. Despite this, so far, few studies have focused
on tackling this problem of greater practical importance. To this end, this
study devises for the resolution of DVRPTW, an ant colony optimization based
algorithm, which resorts to a joint solution construction mechanism, able to
construct in parallel the vehicle routes. This method is coupled with a local
search procedure, aimed to further improve the solutions built by ants, and
with an insertion heuristics, which tries to reduce the number of vehicles used
to service the available customers. The experiments indicate that the proposed
algorithm is competitive and effective, and on DVRPTW instances with a higher
dynamicity level, it is able to yield better results compared to existing
ant-based approaches.
|
[
{
"version": "v1",
"created": "Thu, 6 Apr 2017 14:29:14 GMT"
}
] | 2017-04-07T00:00:00 |
[
[
"Necula",
"Raluca",
""
],
[
"Breaban",
"Mihaela",
""
],
[
"Raschip",
"Madalina",
""
]
] |
new_dataset
| 0.991038 |
1611.04268
|
Anastasia Shuba
|
Anastasia Shuba, Anh Le, Emmanouil Alimpertis, Minas Gjoka, Athina
Markopoulou
|
AntMonitor: A System for On-Device Mobile Network Monitoring and its
Applications
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a complete system for on-device passive monitoring,
collection, and analysis of fine grained, large-scale packet measurements from
mobile devices. First, we describe the design and implementation of AntMonitor
as a userspace mobile app based on a VPN-service but only on the device
(without the need to route through a remote VPN server) and using only the
minimum resources required. We evaluate our prototype and show that it
significantly outperforms prior state-of-the-art approaches: it achieves
throughput of over 90 Mbps downlink and 65 Mbps uplink, which is 2x and 8x
faster than mobile-only baselines and is 94% of the throughput without VPN,
while using 2-12x less energy. Second, we show that AntMonitor is uniquely
positioned to serve as a platform for passive on-device mobile network
monitoring and to enable a number of applications, including: (i) real-time
detection and prevention of private information leakage from the device to the
network; (ii) passive network performance monitoring; and (iii) application
classification and user profiling. We showcase preliminary results from a pilot
user study at a university campus.
|
[
{
"version": "v1",
"created": "Mon, 14 Nov 2016 07:16:59 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Apr 2017 01:37:53 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"Shuba",
"Anastasia",
""
],
[
"Le",
"Anh",
""
],
[
"Alimpertis",
"Emmanouil",
""
],
[
"Gjoka",
"Minas",
""
],
[
"Markopoulou",
"Athina",
""
]
] |
new_dataset
| 0.999216 |
1701.02632
|
Cristian Gonz\'alez Garc\'ia Cgg
|
Cristian Gonz\'alez Garc\'ia, Daniel Meana-Llori\'an, B. Cristina
Pelayo G-Bustelo, Juan Manuel Cueva Lovelle, N\'estor Garcia-Fernandez
|
Midgar: Detection of people through computer vision in the Internet of
Things scenarios to improve the security in Smart Cities, Smart Towns, and
Smart Homes
| null | null |
10.1016/j.future.2016.12.033
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Could we use Computer Vision in the Internet of Things for using pictures as
sensors? This is the principal hypothesis that we want to resolve. Currently,
in order to create safety areas, cities, or homes, people use IP cameras.
Nevertheless, this system needs people who watch the camera images, watch the
recording after something occurred, or watch when the camera notifies them of
any movement. These are the disadvantages. Furthermore, there are many Smart
Cities and Smart Homes around the world. This is why we thought of using the
idea of the Internet of Things to add a way of automating the use of IP
cameras. In our case, we propose the analysis of pictures through Computer
Vision to detect people in the analysed pictures. With this analysis, we are
able to obtain if these pictures contain people and handle the pictures as if
they were sensors with two possible states. Notwithstanding, Computer Vision is
a very complicated field. This is why we needed a second hypothesis: Could we
work with Computer Vision in the Internet of Things with a good accuracy to
automate or semi-automate this kind of events? The demonstration of these
hypotheses required a testing over our Computer Vision module to check the
possibilities that we have to use this module in a possible real environment
with a good accuracy. Our proposal, as a possible solution, is the analysis of
entire sequence instead of isolated pictures for using pictures as sensors in
the Internet of Things.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2017 15:19:14 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Feb 2017 15:22:23 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Apr 2017 06:58:50 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"García",
"Cristian González",
""
],
[
"Meana-Llorián",
"Daniel",
""
],
[
"G-Bustelo",
"B. Cristina Pelayo",
""
],
[
"Lovelle",
"Juan Manuel Cueva",
""
],
[
"Garcia-Fernandez",
"Néstor",
""
]
] |
new_dataset
| 0.998317 |
1702.05153
|
Alexander Zhdanov
|
Alexander Zhdanov
|
Convolutional encoding of 60,64,68,72-bit self-dual codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12]
self-dual codes as tailbitting convolutional codes with the smallest constraint
length K=9. In this construction one information bit is modulo two added to the
one of the encoder outputs and the first row in the quasi-cyclic generator
matrix is replaced by the obtained row. The pure quasi-cyclic construction with
K=10 is also available for [68,34,12] and [72,36,12] codes. The new [72,36,12]
singly even self-dual code with parameters Beta=483 Gamma=0 was obtained.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 21:07:18 GMT"
},
{
"version": "v2",
"created": "Wed, 5 Apr 2017 16:11:22 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"Zhdanov",
"Alexander",
""
]
] |
new_dataset
| 0.994789 |
1703.05614
|
Xiao-Fan Niu
|
Xiao-Fan Niu, Wu-Jun Li
|
ParaGraphE: A Library for Parallel Knowledge Graph Embedding
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Knowledge graph embedding aims at translating the knowledge graph into
numerical representations by transforming the entities and relations into
continuous low-dimensional vectors. Recently, many methods [1, 5, 3, 2, 6] have
been proposed to deal with this problem, but existing single-thread
implementations of them are time-consuming for large-scale knowledge graphs.
Here, we design a unified parallel framework to parallelize these methods,
which achieves a significant time reduction without influencing the accuracy.
We name our framework as ParaGraphE, which provides a library for parallel
knowledge graph embedding. The source code can be downloaded from
https://github.com/LIBBLE/LIBBLE-MultiThread/tree/master/ParaGraphE .
|
[
{
"version": "v1",
"created": "Thu, 16 Mar 2017 13:36:41 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Mar 2017 06:15:48 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Apr 2017 02:56:45 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"Niu",
"Xiao-Fan",
""
],
[
"Li",
"Wu-Jun",
""
]
] |
new_dataset
| 0.994106 |
1704.01139
|
Adrian Garcia-Rodriguez
|
Adrian Garcia-Rodriguez, Giovanni Geraci, Lorenzo Galati Giordano,
Andrea Bonfante, Ming Ding, and David Lopez-Perez
|
Massive MIMO Unlicensed: A New Approach to Dynamic Spectrum Access
|
6 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Nowadays, the demand for wireless mobile services is copious, and will
continue increasing in the near future. Mobile cellular operators are therefore
looking at the unlicensed spectrum as an economical supplement to augment the
capacity of their soon-to-be overloaded networks. The same unlicensed bands are
luring internet service providers, venue owners, and authorities into
autonomously setting up and managing their high-performance private networks.
In light of this exciting future, ensuring coexistence between multiple
unlicensed technologies becomes a pivotal issue. So far this issue has been
merely addressed via inefficient sharing schemes based on intermittent
transmission. In this article, we present the fundamentals and the main
challenges behind massive MIMO unlicensed, a brand-new approach for technology
coexistence in the unlicensed bands, which is envisioned to boost spectrum
reuse for a plethora of use cases.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 18:20:09 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"Garcia-Rodriguez",
"Adrian",
""
],
[
"Geraci",
"Giovanni",
""
],
[
"Giordano",
"Lorenzo Galati",
""
],
[
"Bonfante",
"Andrea",
""
],
[
"Ding",
"Ming",
""
],
[
"Lopez-Perez",
"David",
""
]
] |
new_dataset
| 0.98569 |
1704.01244
|
Azade Fotouhi Ms
|
Azade Fotouhi, Ming Ding, Mahbub Hassan
|
Dynamic Base Station Repositioning to Improve Spectral Efficiency of
Drone Small Cells
|
Accepted at IEEE WoWMoM 2017 - 9 pages, 2 tables, 4 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With recent advancements in drone technology, researchers are now considering
the possibility of deploying small cells served by base stations mounted on
flying drones. A major advantage of such drone small cells is that the
operators can quickly provide cellular services in areas of urgent demand
without having to pre-install any infrastructure. Since the base station is
attached to the drone, technically it is feasible for the base station to
dynamic reposition itself in response to the changing locations of users for
reducing the communication distance, decreasing the probability of signal
blocking, and ultimately increasing the spectral efficiency. In this paper, we
first propose distributed algorithms for autonomous control of drone movements,
and then model and analyse the spectral efficiency performance of a drone small
cell to shed new light on the fundamental benefits of dynamic repositioning. We
show that, with dynamic repositioning, the spectral efficiency of drone small
cells can be increased by nearly 100\% for realistic drone speed, height, and
user traffic model and without incurring any major increase in drone energy
consumption.
|
[
{
"version": "v1",
"created": "Wed, 5 Apr 2017 02:16:49 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"Fotouhi",
"Azade",
""
],
[
"Ding",
"Ming",
""
],
[
"Hassan",
"Mahbub",
""
]
] |
new_dataset
| 0.97531 |
1704.01279
|
Jesse Engel
|
Jesse Engel, Cinjon Resnick, Adam Roberts, Sander Dieleman, Douglas
Eck, Karen Simonyan, Mohammad Norouzi
|
Neural Audio Synthesis of Musical Notes with WaveNet Autoencoders
| null | null | null | null |
cs.LG cs.AI cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generative models in vision have seen rapid progress due to algorithmic
improvements and the availability of high-quality image datasets. In this
paper, we offer contributions in both these areas to enable similar progress in
audio modeling. First, we detail a powerful new WaveNet-style autoencoder model
that conditions an autoregressive decoder on temporal codes learned from the
raw audio waveform. Second, we introduce NSynth, a large-scale and high-quality
dataset of musical notes that is an order of magnitude larger than comparable
public datasets. Using NSynth, we demonstrate improved qualitative and
quantitative performance of the WaveNet autoencoder over a well-tuned spectral
autoencoder baseline. Finally, we show that the model learns a manifold of
embeddings that allows for morphing between instruments, meaningfully
interpolating in timbre to create new types of sounds that are realistic and
expressive.
|
[
{
"version": "v1",
"created": "Wed, 5 Apr 2017 06:34:22 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"Engel",
"Jesse",
""
],
[
"Resnick",
"Cinjon",
""
],
[
"Roberts",
"Adam",
""
],
[
"Dieleman",
"Sander",
""
],
[
"Eck",
"Douglas",
""
],
[
"Simonyan",
"Karen",
""
],
[
"Norouzi",
"Mohammad",
""
]
] |
new_dataset
| 0.999593 |
1704.01346
|
Laurent Besacier
|
Jeremy Ferrero, Frederic Agnes, Laurent Besacier, Didier Schwab
|
CompiLIG at SemEval-2017 Task 1: Cross-Language Plagiarism Detection
Methods for Semantic Textual Similarity
| null | null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
We present our submitted systems for Semantic Textual Similarity (STS) Track
4 at SemEval-2017. Given a pair of Spanish-English sentences, each system must
estimate their semantic similarity by a score between 0 and 5. In our
submission, we use syntax-based, dictionary-based, context-based, and MT-based
methods. We also combine these methods in unsupervised and supervised way. Our
best run ranked 1st on track 4a with a correlation of 83.02% with human
annotations.
|
[
{
"version": "v1",
"created": "Wed, 5 Apr 2017 10:07:22 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"Ferrero",
"Jeremy",
""
],
[
"Agnes",
"Frederic",
""
],
[
"Besacier",
"Laurent",
""
],
[
"Schwab",
"Didier",
""
]
] |
new_dataset
| 0.998235 |
1704.01482
|
Jianwei Huang
|
Juan Wang, Feng Xiao, Jianwei Huang, Daochen Zha, Hongxin Hu and
Huanguo Zhan
|
CHAOS: an SDN-based Moving Target Defense System
| null | null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The static nature of current cyber systems has made them easy to be attacked
and compromised. By constantly changing a system, Moving Target Defense (MTD)
has provided a promising way to reduce or move the attack surface that is
available for exploitation by an adversary. However, the current network- based
MTD obfuscates networks indiscriminately that makes some networks key services,
such as web and DNS services, unavailable, because many information of these
services has to be opened to the outside and remain real without compromising
their usability. Moreover, the indiscriminate obfuscation also severely reduces
the performance of networks. In this paper, we propose CHAOS, an SDN
(Software-defined networking)-based MTD system, which discriminately obfuscates
hosts with different security levels in a network. In CHAOS, we introduce a
Chaos Tower Obfuscation (CTO) method, which uses a Chaos Tower Structure (CTS)
to depict the hierarchy of all the hosts in an intranet and provides a more
unpredictable and flexible obfuscation method. We also present the design of
CHAOS, which leverages SDN features to obfuscate the attack surface including
IP obfuscation, ports obfuscation, and fingerprint obfuscation thereby
enhancing the unpredictability of the networking environment. We develop fast
CTO algorithms to achieve a different degree of obfuscation for the hosts in
each layer. Our experimental results show that a network protected by CHAOS is
capable of decreasing the percentage of information disclosure effectively to
guarantee the normal flow of traffic.
|
[
{
"version": "v1",
"created": "Wed, 5 Apr 2017 15:25:11 GMT"
}
] | 2017-04-06T00:00:00 |
[
[
"Wang",
"Juan",
""
],
[
"Xiao",
"Feng",
""
],
[
"Huang",
"Jianwei",
""
],
[
"Zha",
"Daochen",
""
],
[
"Hu",
"Hongxin",
""
],
[
"Zhan",
"Huanguo",
""
]
] |
new_dataset
| 0.998855 |
1411.0406
|
Arjun Bhardwaj
|
Arjun Bhardwaj and Sangeetha
|
GC-SROIQ(C) : Expressive Constraint Modelling and Grounded
Circumscription for SROIQ
|
For an improved formulation of the problem, which addresses critical
shortcomings of this paper, please refer to the following : Extending SROIQ
with Constraint Networks and Grounded Circumscription, arXiv:1508.00116
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Developments in semantic web technologies have promoted ontological encoding
of knowledge from diverse domains. However, modelling many practical domains
requires more expressive representations schemes than what the standard
description logics(DLs) support. We extend the DL SROIQ with constraint
networks and grounded circumscription. Applications of constraint modelling
include embedding ontologies with temporal or spatial information, while
grounded circumscription allows defeasible inference and closed world
reasoning. This paper overcomes restrictions on existing constraint modelling
approaches by introducing expressive constructs. Grounded circumscription
allows concept and role minimization and is decidable for DL. We provide a
general and intuitive algorithm for the framework of grounded circumscription
that can be applied to a whole range of logics. We present the resulting logic:
GC-SROIQ(C), and describe a tableau decision procedure for it.
|
[
{
"version": "v1",
"created": "Mon, 3 Nov 2014 10:05:29 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Nov 2014 07:46:47 GMT"
},
{
"version": "v3",
"created": "Tue, 28 Jul 2015 08:45:52 GMT"
},
{
"version": "v4",
"created": "Mon, 3 Apr 2017 18:04:45 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Bhardwaj",
"Arjun",
""
],
[
"Sangeetha",
"",
""
]
] |
new_dataset
| 0.993305 |
1509.06349
|
Jarkko Peltom\"aki
|
Jarkko Peltom\"aki, Markus Whiteland
|
A square root map on Sturmian words
|
Extended version. 40 pages, 5 figures, 2 tables
|
The Electronic Journal of Combinatorics Vol. 24, Issue 1, #P1.54
(2017)
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a square root map on Sturmian words and study its properties.
Given a Sturmian word of slope $\alpha$, there exists exactly six minimal
squares in its language (a minimal square does not have a square as a proper
prefix). A Sturmian word $s$ of slope $\alpha$ can be written as a product of
these six minimal squares: $s = X_1^2 X_2^2 X_3^2 \cdots$. The square root of
$s$ is defined to be the word $\sqrt{s} = X_1 X_2 X_3 \cdots$. The main result
of this paper is that that $\sqrt{s}$ is also a Sturmian word of slope
$\alpha$. Further, we characterize the Sturmian fixed points of the square root
map, and we describe how to find the intercept of $\sqrt{s}$ and an occurrence
of any prefix of $\sqrt{s}$ in $s$. Related to the square root map, we
characterize the solutions of the word equation $X_1^2 X_2^2 \cdots X_n^2 =
(X_1 X_2 \cdots X_n)^2$ in the language of Sturmian words of slope $\alpha$
where the words $X_i^2$ are minimal squares of slope $\alpha$.
We also study the square root map in a more general setting. We explicitly
construct an infinite set of non-Sturmian fixed points of the square root map.
We show that the subshifts $\Omega$ generated by these words have a curious
property: for all $w \in \Omega$ either $\sqrt{w} \in \Omega$ or $\sqrt{w}$ is
periodic. In particular, the square root map can map an aperiodic word to a
periodic word.
|
[
{
"version": "v1",
"created": "Mon, 21 Sep 2015 19:16:45 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Peltomäki",
"Jarkko",
""
],
[
"Whiteland",
"Markus",
""
]
] |
new_dataset
| 0.999125 |
1603.08188
|
Yimin Liu
|
Yimin Liu, Hang Ruan, Lei Wang, and Arye Nehorai
|
The Random Frequency Diverse Array: A New Antenna Structure for
Uncoupled Direction-Range Indication in Active Sensing
|
13 pages, 10 figures
| null |
10.1109/JSTSP.2016.2627183
| null |
cs.IT math.IT stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new type of array antenna, termed the Random
Frequency Diverse Array (RFDA), for an uncoupled indication of target direction
and range with low system complexity. In RFDA, each array element has a narrow
bandwidth and a randomly assigned carrier frequency. The beampattern of the
array is shown to be stochastic but thumbtack-like, and its stochastic
characteristics, such as the mean, variance, and asymptotic distribution are
derived analytically. Based on these two features, we propose two kinds of
algorithms for signal processing. One is matched filtering, due to the
beampattern's good characteristics. The other is compressive sensing, because
the new approach can be regarded as a sparse and random sampling of target
information in the spatial-frequency domain. Fundamental limits, such as the
Cram\'er-Rao bound and the observing matrix's mutual coherence, are provided as
performance guarantees of the new array structure. The features and
performances of RFDA are verified with numerical results.
|
[
{
"version": "v1",
"created": "Sun, 27 Mar 2016 08:50:45 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Liu",
"Yimin",
""
],
[
"Ruan",
"Hang",
""
],
[
"Wang",
"Lei",
""
],
[
"Nehorai",
"Arye",
""
]
] |
new_dataset
| 0.999145 |
1605.00626
|
Sihua Shao
|
Sihua Shao, Abdallah Khreishah, Hany Elgala
|
Pixelated VLC-backscattering for Self-charging Indoor IoT Devices
| null | null |
10.1109/LPT.2016.2631946
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Visible light communication (VLC) backscatter has been proposed as a wireless
access option for Internet of Things (IoT). However, the throughput of the
state-of-the-art VLC backscatter is limited by simple single-carrier pulsed
modulation scheme, such as on-off keying (OOK). In this paper, a novel
pixelated VLC backscatter is proposed and implemented to overcome the channel
capacity limitation. In particular, multiple smaller VLC backscatters,
switching on or off, are integrated to generate multi-level signals, which
enables the usage of more advanced modulation schemes than OOK. Based on
experimental results, rate adaptation at different communication distances can
be employed to enhance the achievable data rate. Compared to OOK, the data rate
can be tripled when 8-PAM is used at 2 meters. In general, $n$-fold throughput
enhancement is realized by utilizing $n$ smaller VLC backscatters while
incurring negligible additional energy using the same device space as that of a
single large backscatter.
|
[
{
"version": "v1",
"created": "Thu, 21 Apr 2016 05:38:15 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Shao",
"Sihua",
""
],
[
"Khreishah",
"Abdallah",
""
],
[
"Elgala",
"Hany",
""
]
] |
new_dataset
| 0.959943 |
1605.07480
|
Luca Sanguinetti
|
Houssem Sifaou, Abla Kammoun, Luca Sanguinetti, M\'erouane Debbah,
Mohamed-Slim Alouini
|
Max-Min SINR in Large-Scale Single-Cell MU-MIMO: Asymptotic Analysis and
Low Complexity Transceivers
|
13 pages, 4 figures, submitted to IEEE Transactions on Signal
Processing
| null |
10.1109/TSP.2016.2645518
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work focuses on the downlink and uplink of large-scale single-cell
MU-MIMO systems in which the base station (BS) endowed with $M$ antennas
communicates with $K$ single-antenna user equipments (UEs). Particularly, we
aim at reducing the complexity of the linear precoder and receiver that
maximize the minimum signal-to-interference-plus-noise ratio subject to a given
power constraint. To this end, we consider the asymptotic regime in which $M$
and $K$ grow large with a given ratio. Tools from random matrix theory (RMT)
are then used to compute, in closed form, accurate approximations for the
parameters of the optimal precoder and receiver, when imperfect channel state
information (modeled by the generic Gauss-Markov formulation form) is available
at the BS. The asymptotic analysis allows us to derive the asymptotically
optimal linear precoder and receiver that are characterized by a lower
complexity (due to the dependence on the large scale components of the channel)
and, possibly, by a better resilience to imperfect channel state information.
However, the implementation of both is still challenging as it requires fast
inversions of large matrices in every coherence period. To overcome this issue,
we apply the truncated polynomial expansion (TPE) technique to the precoding
and receiving vector of each UE and make use of RMT to determine the optimal
weighting coefficients on a per-UE basis that asymptotically solve the max-min
SINR problem. Numerical results are used to validate the asymptotic analysis in
the finite system regime and to show that the proposed TPE transceivers
efficiently mimic the optimal ones, while requiring much lower computational
complexity.
|
[
{
"version": "v1",
"created": "Tue, 24 May 2016 14:35:02 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Feb 2017 13:45:24 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Sifaou",
"Houssem",
""
],
[
"Kammoun",
"Abla",
""
],
[
"Sanguinetti",
"Luca",
""
],
[
"Debbah",
"Mérouane",
""
],
[
"Alouini",
"Mohamed-Slim",
""
]
] |
new_dataset
| 0.969101 |
1606.08761
|
Piero Triverio
|
Fadime Bekmambetova, Xinyue Zhang and Piero Triverio
|
A Dissipative Systems Theory for FDTD with Application to Stability
Analysis and Subgridding
| null | null |
10.1109/TAP.2016.2637867
| null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper establishes a far-reaching connection between the
Finite-Difference Time-Domain method (FDTD) and the theory of dissipative
systems. The FDTD equations for a rectangular region are written as a dynamical
system having the magnetic and electric fields on the boundary as inputs and
outputs. Suitable expressions for the energy stored in the region and the
energy absorbed from the boundaries are introduced, and used to show that the
FDTD system is dissipative under a generalized Courant-Friedrichs-Lewy
condition. Based on the concept of dissipation, a powerful theoretical
framework to investigate the stability of FDTD methods is devised. The new
method makes FDTD stability proofs simpler, more intuitive, and modular.
Stability conditions can indeed be given on the individual components (e.g.
boundary conditions, meshes, embedded models) instead of the whole coupled
setup. As an example of application, we derive a new subgridding method with
material traverse, arbitrary grid refinement, and guaranteed stability. The
method is easy to implement and has a straightforward stability proof.
Numerical results confirm its stability, low reflections, and ability to handle
material traverse.
|
[
{
"version": "v1",
"created": "Tue, 28 Jun 2016 15:45:32 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Bekmambetova",
"Fadime",
""
],
[
"Zhang",
"Xinyue",
""
],
[
"Triverio",
"Piero",
""
]
] |
new_dataset
| 0.998358 |
1611.05579
|
Yustinus Soelistio Eko
|
Kenny Supangat, Yustinus Eko Soelistio
|
Bus Stops Location and Bus Route Planning Using Mean Shift Clustering
and Ant Colony in West Jakarta
|
Original publication in the ICITDA 2016 Conference (14-16 Nov. 2016),
icitda.uii.ac.id
| null |
10.1088/1757-899X/185/1/012022
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traffic Jam has been a daily problem for people in Jakarta which is one of
the busiest city in Indonesia up until now. Even though the official government
has tried to reduce the impact of traffic issues by developing a new public
transportation which takes up a lot of resources and time, it failed to
diminish the problem. The actual concern to this problem actually lies in how
people move between places in Jakarta where they always using their own vehicle
like cars, and motorcycles that fill most of the street in Jakarta. Among much
other public transportations that roams the street of Jakarta, Buses is
believed to be an efficient transportation that can move many people at once.
However, the location of the bus stop is now have moved to the middle of the
main road, and it is too far for the nearby residence to access to it. This
paper proposes an optimal location of optimal bus stops in West Jakarta that is
experimentally proven to have a maximal distance of 350 m. The optimal location
is estimated by means of mean shift clustering method while the optimal routes
are calculated using Ant Colony algorithm. The bus stops locations rate of
error is 0.07% with overall route area of 32 km. Based on our experiments, we
believe our proposed bus stop plan can be an interesting alternative to reduce
traffic congestion in West Jakarta.
|
[
{
"version": "v1",
"created": "Thu, 17 Nov 2016 06:23:36 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Supangat",
"Kenny",
""
],
[
"Soelistio",
"Yustinus Eko",
""
]
] |
new_dataset
| 0.999685 |
1701.01909
|
Amir Sadeghian
|
Amir Sadeghian, Alexandre Alahi, and Silvio Savarese
|
Tracking The Untrackable: Learning To Track Multiple Cues with Long-Term
Dependencies
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The majority of existing solutions to the Multi-Target Tracking (MTT) problem
do not combine cues in a coherent end-to-end fashion over a long period of
time. However, we present an online method that encodes long-term temporal
dependencies across multiple cues. One key challenge of tracking methods is to
accurately track occluded targets or those which share similar appearance
properties with surrounding objects. To address this challenge, we present a
structure of Recurrent Neural Networks (RNN) that jointly reasons on multiple
cues over a temporal window. We are able to correct many data association
errors and recover observations from an occluded state. We demonstrate the
robustness of our data-driven approach by tracking multiple targets using their
appearance, motion, and even interactions. Our method outperforms previous
works on multiple publicly available datasets including the challenging MOT
benchmark.
|
[
{
"version": "v1",
"created": "Sun, 8 Jan 2017 03:29:26 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Apr 2017 21:42:58 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Sadeghian",
"Amir",
""
],
[
"Alahi",
"Alexandre",
""
],
[
"Savarese",
"Silvio",
""
]
] |
new_dataset
| 0.990054 |
1703.09268
|
Curt Da Silva
|
Curt Da Silva, Felix J. Herrmann
|
A Unified 2D/3D Large Scale Software Environment for Nonlinear Inverse
Problems
| null | null | null | null |
cs.MS cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large scale parameter estimation problems are among some of the most
computationally demanding problems in numerical analysis. An academic
researcher's domain-specific knowledge often precludes that of software design,
which results in inversion frameworks that are technically correct, but not
scalable to realistically-sized problems. On the other hand, the computational
demands for realistic problems result in industrial codebases that are geared
solely for high performance, rather than comprehensibility or flexibility. We
propose a new software design for inverse problems constrained by partial
differential equations that bridges the gap between these two seemingly
disparate worlds. A hierarchical and modular design allows a user to delve into
as much detail as she desires, while exploiting high performance primitives at
the lower levels. Our code has the added benefit of actually reflecting the
underlying mathematics of the problem, which lowers the cognitive load on user
using it and reduces the initial startup period before a researcher can be
fully productive. We also introduce a new preconditioner for the 3D Helmholtz
equation that is suitable for fault-tolerant distributed systems. Numerical
experiments on a variety of 2D and 3D test problems demonstrate the
effectiveness of this approach on scaling algorithms from small to large scale
problems with minimal code changes.
|
[
{
"version": "v1",
"created": "Mon, 27 Mar 2017 19:01:10 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Apr 2017 00:19:08 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Da Silva",
"Curt",
""
],
[
"Herrmann",
"Felix J.",
""
]
] |
new_dataset
| 0.974703 |
1704.00853
|
Fred Glover
|
Kenneth Sorensen, Marc Sevaux and Fred Glover
|
A History of Metaheuristics
|
27 pages, to appear in: R. Marti, P. Pardalos, and M. Resende, eds.,
Handbook of Heuristics, Springer
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This chapter describes the history of metaheuristics in five distinct
periods, starting long before the first use of the term and ending a long time
in the future.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 02:28:59 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Sorensen",
"Kenneth",
""
],
[
"Sevaux",
"Marc",
""
],
[
"Glover",
"Fred",
""
]
] |
new_dataset
| 0.97133 |
1704.00939
|
Jacopo Staiano
|
Youness Mansar, Lorenzo Gatti, Sira Ferradans, Marco Guerini, Jacopo
Staiano
|
Fortia-FBK at SemEval-2017 Task 5: Bullish or Bearish? Inferring
Sentiment towards Brands from Financial News Headlines
|
6 pages, 1 figure; accepted for publication at the International
Workshop on Semantic Evaluation (SemEval-2017) to be held in conjunction with
ACL 2017
| null | null | null |
cs.CL cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe a methodology to infer Bullish or Bearish
sentiment towards companies/brands. More specifically, our approach leverages
affective lexica and word embeddings in combination with convolutional neural
networks to infer the sentiment of financial news headlines towards a target
company. Such architecture was used and evaluated in the context of the SemEval
2017 challenge (task 5, subtask 2), in which it obtained the best performance.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 10:01:47 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Mansar",
"Youness",
""
],
[
"Gatti",
"Lorenzo",
""
],
[
"Ferradans",
"Sira",
""
],
[
"Guerini",
"Marco",
""
],
[
"Staiano",
"Jacopo",
""
]
] |
new_dataset
| 0.99636 |
1704.00988
|
Ahmad Nauman Ghazi
|
Ahmad Nauman Ghazi, Ratna Pranathi Garigapati, Kai Petersen
|
Checklists to Support Test Charter Design in Exploratory Testing
|
In proceedings of 18th International conference of agile software
development. XP 2017
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
During exploratory testing sessions the tester simultaneously learns, designs
and executes tests. The activity is iterative and utilizes the skills of the
tester and provides flexibility and creativity.Test charters are used as a
vehicle to support the testers during the testing. The aim of this study is to
support practitioners in the design of test charters through checklists. We
aimed to identify factors allowing practitioners to critically reflect on their
designs and contents of test charters to support practitioners in making
informed decisions of what to include in test charters. The factors and
contents have been elicited through interviews. Overall, 30 factors and 35
content elements have been elicited.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 12:48:08 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Ghazi",
"Ahmad Nauman",
""
],
[
"Garigapati",
"Ratna Pranathi",
""
],
[
"Petersen",
"Kai",
""
]
] |
new_dataset
| 0.997561 |
1704.01003
|
Florent Altche
|
Florent Altch\'e, Philip Polack and Arnaud de la Fortelle
|
High-Speed Trajectory Planning for Autonomous Vehicles Using a Simple
Dynamic Model
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To improve safety and energy efficiency, autonomous vehicles are expected to
drive smoothly in most situations, while maintaining their velocity below a
predetermined speed limit. However, some scenarios such as low road adherence
or inadequate speed limit may require vehicles to automatically adapt their
velocity without external input, while nearing the limits of their dynamic
capacities. Many of the existing trajectory planning approaches are incapable
of making such adjustments, since they assume a feasible velocity reference is
given. Moreover, near-limits trajectory planning often implies high-complexity
dynamic vehicle models, making computations difficult. In this article, we use
a simple dynamic model derived from numerical simulations to design a
trajectory planner for high-speed driving of an autonomous vehicle based on
model predictive control. Unlike existing techniques, our formulation includes
the selection of a feasible velocity to track a predetermined path while
avoiding obstacles. Simulation results on a highly precise vehicle model show
that our approach can be used in real-time to provide feasible trajectories
that can be tracked using a simple control architecture. Moreover, the use of
our simplified model makes the planner more robust and yields better
trajectories compared to kinematic models commonly used in trajectory planning.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 13:36:34 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Altché",
"Florent",
""
],
[
"Polack",
"Philip",
""
],
[
"de la Fortelle",
"Arnaud",
""
]
] |
new_dataset
| 0.995602 |
1704.01036
|
Telmo Menezes
|
Telmo Menezes (CMB), Camille Roth (IEP Paris, CNRS, CMB)
|
Natural Scales in Geographical Patterns
| null |
Scientific Reports, Nature Publishing Group, 2017, 7 (45823)
|
10.1080/01621459.1971.10482356
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Human mobility is known to be distributed across several orders of magnitude
of physical distances , which makes it generally difficult to endogenously find
or define typical and meaningful scales. Relevant analyses, from movements to
geographical partitions, seem to be relative to some ad-hoc scale, or no scale
at all. Relying on geotagged data collected from photo-sharing social media, we
apply community detection to movement networks constrained by increasing
percentiles of the distance distribution. Using a simple parameter-free
discontinuity detection algorithm, we discover clear phase transitions in the
community partition space. The detection of these phases constitutes the first
objective method of characterising endogenous, natural scales of human
movement. Our study covers nine regions, ranging from cities to countries of
various sizes and a transnational area. For all regions, the number of natural
scales is remarkably low (2 or 3). Further, our results hint at scale-related
behaviours rather than scale-related users. The partitions of the natural
scales allow us to draw discrete multi-scale geographical boundaries,
potentially capable of providing key insights in fields such as epidemiology or
cultural contagion where the introduction of spatial boundaries is pivotal.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 14:38:19 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Menezes",
"Telmo",
"",
"CMB"
],
[
"Roth",
"Camille",
"",
"IEP Paris, CNRS, CMB"
]
] |
new_dataset
| 0.984233 |
1704.01071
|
Mikolas Janota
|
Mikol\'a\v{s} Janota
|
An Achilles' Heel of Term-Resolution
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Term-resolution provides an elegant mechanism to prove that a quantified
Boolean formula (QBF) is true. It is a dual to Q-resolution (also referred to
as clause-resolution) and is practically highly important as it enables
certifying answers of DPLL-based QBF solvers. While term-resolution and
Q-resolution are very similar, they're not completely symmetric. In particular,
Q-resolution operates on clauses and term-resolution operates on models of the
matrix. This paper investigates what impact this asymmetry has. We'll see that
there is a large class of formulas (formulas with "big models") whose
term-resolution proofs are exponential. As a possible remedy, the paper
suggests to prove true QBFs by refuting their negation ({\em negate-refute}),
rather than proving them by term-resolution. The paper shows that from the
theoretical perspective this is indeed a favorable approach. In particular,
negation-refutation can p-simulates term-resolution and there is an exponential
separation between the two calculi. These observations further our
understanding of proof systems for QBFs and provide a strong theoretical
underpinning for the effort towards non-CNF QBF solvers.
|
[
{
"version": "v1",
"created": "Tue, 4 Apr 2017 15:41:14 GMT"
}
] | 2017-04-05T00:00:00 |
[
[
"Janota",
"Mikoláš",
""
]
] |
new_dataset
| 0.97404 |
1506.02163
|
Jie Ding
|
Zhun Deng, Jie Ding, Mohammad Noshad, and Vahid Tarokh
|
Capacity of Hexagonal Checkerboard Codes
|
This manuscript has been withdrawn by the authors as they have some
new progress and will rewrite it
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a new method to bound the capacity of checkerboard
codes on the hexagonal lattice. This produces rigorous bounds that are tighter
than those commonly known.
|
[
{
"version": "v1",
"created": "Sat, 6 Jun 2015 15:18:15 GMT"
},
{
"version": "v2",
"created": "Sat, 1 Apr 2017 22:09:42 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Deng",
"Zhun",
""
],
[
"Ding",
"Jie",
""
],
[
"Noshad",
"Mohammad",
""
],
[
"Tarokh",
"Vahid",
""
]
] |
new_dataset
| 0.999124 |
1605.07322
|
Asahi Takaoka
|
Asahi Takaoka
|
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
|
13 pages, 14 figures, the Author's accepted version of a paper in
WALCOM 2017, Keywords: Chain cover, Graph sandwich problem, PI graphs,
Simple-triangle graphs, Threshold dimension 2 graphs
|
WALCOM: Algorithms and Computation. Volume 10167 of Lecture Notes
in Computer Science (2017) 177-189
|
10.1007/978-3-319-53925-6_14
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A simple-triangle graph (also known as a PI graph) is the intersection graph
of a family of triangles defined by a point on a horizontal line and an
interval on another horizontal line. The recognition problem for
simple-triangle graphs was a longstanding open problem, and recently a
polynomial-time algorithm has been given [G. B. Mertzios, The Recognition of
Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial, SIAM J.
Discrete Math., 29(3):1150--1185, 2015]. Along with the approach of this paper,
we show a simpler recognition algorithm for simple-triangle graphs. To do this,
we provide a polynomial-time algorithm to solve the following problem: Given a
bipartite graph $G$ and a set $F$ of edges of $G$, find a 2-chain subgraph
cover of $G$ such that one of two chain subgraphs has no edges in $F$.
|
[
{
"version": "v1",
"created": "Tue, 24 May 2016 07:26:39 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Apr 2017 05:31:52 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Takaoka",
"Asahi",
""
]
] |
new_dataset
| 0.999521 |
1607.00773
|
Mingzhe Chen
|
Mingzhe Chen, Walid Saad, Changchuan Yin, M\'erouane Debbah
|
Echo State Networks for Proactive Caching in Cloud-Based Radio Access
Networks with Mobile Users
|
Accepted in the IEEE Transactions on Wireless Communications
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, the problem of proactive caching is studied for cloud radio
access networks (CRANs). In the studied model, the baseband units (BBUs) can
predict the content request distribution and mobility pattern of each user,
determine which content to cache at remote radio heads and BBUs. This problem
is formulated as an optimization problem which jointly incorporates backhaul
and fronthaul loads and content caching. To solve this problem, an algorithm
that combines the machine learning framework of echo state networks with
sublinear algorithms is proposed. Using echo state networks (ESNs), the BBUs
can predict each user's content request distribution and mobility pattern while
having only limited information on the network's and user's state. In order to
predict each user's periodic mobility pattern with minimal complexity, the
memory capacity of the corresponding ESN is derived for a periodic input. This
memory capacity is shown to be able to record the maximum amount of user
information for the proposed ESN model. Then, a sublinear algorithm is proposed
to determine which content to cache while using limited content request
distribution samples. Simulation results using real data from Youku and the
Beijing University of Posts and Telecommunications show that the proposed
approach yields significant gains, in terms of sum effective capacity, that
reach up to 27.8% and 30.7%, respectively, compared to random caching with
clustering and random caching without clustering algorithm.
|
[
{
"version": "v1",
"created": "Mon, 4 Jul 2016 08:41:24 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Mar 2017 18:22:18 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Chen",
"Mingzhe",
""
],
[
"Saad",
"Walid",
""
],
[
"Yin",
"Changchuan",
""
],
[
"Debbah",
"Mérouane",
""
]
] |
new_dataset
| 0.98811 |
1703.02243
|
Wei Ke
|
Wei Ke, Jie Chen, Jianbin Jiao, Guoying Zhao, Qixiang Ye
|
SRN: Side-output Residual Network for Object Symmetry Detection in the
Wild
|
Proceedings of the IEEE Conference on Computer Vision and Pattern
Recognition, 2017
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we establish a baseline for object symmetry detection in
complex backgrounds by presenting a new benchmark and an end-to-end deep
learning approach, opening up a promising direction for symmetry detection in
the wild. The new benchmark, named Sym-PASCAL, spans challenges including
object diversity, multi-objects, part-invisibility, and various complex
backgrounds that are far beyond those in existing datasets. The proposed
symmetry detection approach, named Side-output Residual Network (SRN),
leverages output Residual Units (RUs) to fit the errors between the object
symmetry groundtruth and the outputs of RUs. By stacking RUs in a
deep-to-shallow manner, SRN exploits the 'flow' of errors among multiple scales
to ease the problems of fitting complex outputs with limited layers,
suppressing the complex backgrounds, and effectively matching object symmetry
of different scales. Experimental results validate both the benchmark and its
challenging aspects related to realworld images, and the state-of-the-art
performance of our symmetry detection approach. The benchmark and the code for
SRN are publicly available at https://github.com/KevinKecc/SRN.
|
[
{
"version": "v1",
"created": "Tue, 7 Mar 2017 07:09:40 GMT"
},
{
"version": "v2",
"created": "Sat, 1 Apr 2017 01:58:50 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Ke",
"Wei",
""
],
[
"Chen",
"Jie",
""
],
[
"Jiao",
"Jianbin",
""
],
[
"Zhao",
"Guoying",
""
],
[
"Ye",
"Qixiang",
""
]
] |
new_dataset
| 0.997876 |
1703.06933
|
Caifa Zhou
|
Caifa Zhou, Andreas Wieser, and Xuezhi Tan
|
Fast Radio Map Construction and Position Estimation via Direct Mapping
for WLAN Indoor Localization System
|
more refined analysis required
| null | null | null |
cs.NI stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main limitation that constrains the fast and comprehensive application of
Wireless Local Area Network (WLAN) based indoor localization systems with
Received Signal Strength (RSS) positioning algorithms is the building of the
fingerprinting radio map, which is time-consuming especially when the indoor
environment is large and/or with high frequent changes. Different approaches
have been proposed to reduce workload, including fingerprinting deployment and
update efforts, but the performance degrades greatly when the workload is
reduced below a certain level. In this paper, we propose an indoor localization
scenario that applies metric learning and manifold alignment to realize direct
mapping localization (DML) using a low resolution radio map with single sample
of RSS that reduces the fingerprinting workload by up to 87\%. Compared to
previous work. The proposed two localization approaches, DML and $k$ nearest
neighbors based on reconstructed radio map (reKNN), were shown to achieve less
than 4.3\ m and 3.7\ m mean localization error respectively in a typical office
environment with an area of approximately 170\ m$^2$, while the unsupervised
localization with perturbation algorithm was shown to achieve 4.7\ m mean
localization error with 8 times more workload than the proposed methods. As for
the room level localization application, both DML and reKNN can meet the
requirement with at most 9\ m of localization error which is enough to tell
apart different rooms with over 99\% accuracy.
|
[
{
"version": "v1",
"created": "Tue, 14 Mar 2017 19:46:32 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Apr 2017 13:51:01 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Zhou",
"Caifa",
""
],
[
"Wieser",
"Andreas",
""
],
[
"Tan",
"Xuezhi",
""
]
] |
new_dataset
| 0.988245 |
1703.10193
|
Kiran Somasundaram
|
Onkar Dabeer, Radhika Gowaikar, Slawomir K. Grzechnik, Mythreya J.
Lakshman, Gerhard Reitmayr, Kiran Somasundaram, Ravi Teja Sukhavasi, Xinzhou
Wu
|
An End-to-End System for Crowdsourced 3d Maps for Autonomous Vehicles:
The Mapping Component
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous vehicles rely on precise high definition (HD) 3d maps for
navigation. This paper presents the mapping component of an end-to-end system
for crowdsourcing precise 3d maps with semantically meaningful landmarks such
as traffic signs (6 dof pose, shape and size) and traffic lanes (3d splines).
The system uses consumer grade parts, and in particular, relies on a single
front facing camera and a consumer grade GPS. Using real-time sign and lane
triangulation on-device in the vehicle, with offline sign/lane clustering
across multiple journeys and offline Bundle Adjustment across multiple journeys
in the backend, we construct maps with mean absolute accuracy at sign corners
of less than 20 cm from 25 journeys. To the best of our knowledge, this is the
first end-to-end HD mapping pipeline in global coordinates in the automotive
context using cost effective sensors.
|
[
{
"version": "v1",
"created": "Wed, 29 Mar 2017 18:44:11 GMT"
},
{
"version": "v2",
"created": "Fri, 31 Mar 2017 21:28:39 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Dabeer",
"Onkar",
""
],
[
"Gowaikar",
"Radhika",
""
],
[
"Grzechnik",
"Slawomir K.",
""
],
[
"Lakshman",
"Mythreya J.",
""
],
[
"Reitmayr",
"Gerhard",
""
],
[
"Somasundaram",
"Kiran",
""
],
[
"Sukhavasi",
"Ravi Teja",
""
],
[
"Wu",
"Xinzhou",
""
]
] |
new_dataset
| 0.998774 |
1704.00077
|
Hieu Le
|
Hieu Le, Vu Nguyen, Chen-Ping Yu, Dimitris Samaras
|
Geodesic Distance Histogram Feature for Video Segmentation
| null | null |
10.1007/978-3-319-54181-5_18
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a geodesic-distance-based feature that encodes global
information for improved video segmentation algorithms. The feature is a joint
histogram of intensity and geodesic distances, where the geodesic distances are
computed as the shortest paths between superpixels via their boundaries. We
also incorporate adaptive voting weights and spatial pyramid configurations to
include spatial information into the geodesic histogram feature and show that
this further improves results. The feature is generic and can be used as part
of various algorithms. In experiments, we test the geodesic histogram feature
by incorporating it into two existing video segmentation frameworks. This leads
to significantly better performance in 3D video segmentation benchmarks on two
datasets.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 22:39:32 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Le",
"Hieu",
""
],
[
"Nguyen",
"Vu",
""
],
[
"Yu",
"Chen-Ping",
""
],
[
"Samaras",
"Dimitris",
""
]
] |
new_dataset
| 0.992614 |
1704.00172
|
Manoel Horta Ribeiro
|
Sagar Sen, Manoel Horta Ribeiro, Raquel C. de Melo Minardi, Wagner
Meira Jr., Mari Nigard
|
Portinari: A Data Exploration Tool to Personalize Cervical Cancer
Screening
|
Conference paper published at ICSE 2017 Buenos Aires, at the Software
Engineering in Society Track. 10 pages, 5 figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Socio-technical systems play an important role in public health screening
programs to prevent cancer. Cervical cancer incidence has significantly
decreased in countries that developed systems for organized screening engaging
medical practitioners, laboratories and patients. The system automatically
identifies individuals at risk of developing the disease and invites them for a
screening exam or a follow-up exam conducted by medical professionals. A triage
algorithm in the system aims to reduce unnecessary screening exams for
individuals at low-risk while detecting and treating individuals at high-risk.
Despite the general success of screening, the triage algorithm is a
one-size-fits all approach that is not personalized to a patient. This can
easily be observed in historical data from screening exams. Often patients rely
on personal factors to determine that they are either at high risk or not at
risk at all and take action at their own discretion. Can exploring patient
trajectories help hypothesize personal factors leading to their decisions? We
present Portinari, a data exploration tool to query and visualize future
trajectories of patients who have undergone a specific sequence of screening
exams. The web-based tool contains (a) a visual query interface (b) a backend
graph database of events in patients' lives (c) trajectory visualization using
sankey diagrams. We use Portinari to explore diverse trajectories of patients
following the Norwegian triage algorithm. The trajectories demonstrated
variable degrees of adherence to the triage algorithm and allowed
epidemiologists to hypothesize about the possible causes.
|
[
{
"version": "v1",
"created": "Sat, 1 Apr 2017 14:24:21 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Sen",
"Sagar",
""
],
[
"Ribeiro",
"Manoel Horta",
""
],
[
"Minardi",
"Raquel C. de Melo",
""
],
[
"Meira",
"Wagner",
"Jr."
],
[
"Nigard",
"Mari",
""
]
] |
new_dataset
| 0.974666 |
1704.00280
|
Marius Cordts
|
Marius Cordts, Timo Rehfeld, Lukas Schneider, David Pfeiffer, Markus
Enzweiler, Stefan Roth, Marc Pollefeys, Uwe Franke
|
The Stixel world: A medium-level representation of traffic scenes
|
Accepted for publication in Image and Vision Computing
| null |
10.1016/j.imavis.2017.01.009
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent progress in advanced driver assistance systems and the race towards
autonomous vehicles is mainly driven by two factors: (1) increasingly
sophisticated algorithms that interpret the environment around the vehicle and
react accordingly, and (2) the continuous improvements of sensor technology
itself. In terms of cameras, these improvements typically include higher
spatial resolution, which as a consequence requires more data to be processed.
The trend to add multiple cameras to cover the entire surrounding of the
vehicle is not conducive in that matter. At the same time, an increasing number
of special purpose algorithms need access to the sensor input data to correctly
interpret the various complex situations that can occur, particularly in urban
traffic.
By observing those trends, it becomes clear that a key challenge for vision
architectures in intelligent vehicles is to share computational resources. We
believe this challenge should be faced by introducing a representation of the
sensory data that provides compressed and structured access to all relevant
visual content of the scene. The Stixel World discussed in this paper is such a
representation. It is a medium-level model of the environment that is
specifically designed to compress information about obstacles by leveraging the
typical layout of outdoor traffic scenes. It has proven useful for a multitude
of automotive vision applications, including object detection, tracking,
segmentation, and mapping.
In this paper, we summarize the ideas behind the model and generalize it to
take into account multiple dense input streams: the image itself, stereo depth
maps, and semantic class probability maps that can be generated, e.g., by CNNs.
Our generalization is embedded into a novel mathematical formulation for the
Stixel model. We further sketch how the free parameters of the model can be
learned using structured SVMs.
|
[
{
"version": "v1",
"created": "Sun, 2 Apr 2017 10:38:49 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Cordts",
"Marius",
""
],
[
"Rehfeld",
"Timo",
""
],
[
"Schneider",
"Lukas",
""
],
[
"Pfeiffer",
"David",
""
],
[
"Enzweiler",
"Markus",
""
],
[
"Roth",
"Stefan",
""
],
[
"Pollefeys",
"Marc",
""
],
[
"Franke",
"Uwe",
""
]
] |
new_dataset
| 0.990064 |
1704.00316
|
Chinh Hoang
|
Kathie Cameron, and Ch\'inh T. Ho\`ang
|
Solving the clique cover problem on (bull, $C_4$)-free graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an $O(n^4)$ algorithm to find a minimum clique cover of a (bull,
$C_4$)-free graph, or equivalently, a minimum colouring of a (bull,
$2K_2$)-free graph, where $n$ is the number of vertices of the graphs.
|
[
{
"version": "v1",
"created": "Sun, 2 Apr 2017 15:29:19 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Cameron",
"Kathie",
""
],
[
"Hoàng",
"Chính T.",
""
]
] |
new_dataset
| 0.988882 |
1704.00534
|
Hector Garcia de Marina Dr.
|
Hector Garcia de Marina and Zhiyong Sun and Ming Cao and Brian D.O.
Anderson
|
Controlling a triangular flexible formation of autonomous agents
|
7 pages, accepted in the 20th World Congress of the International
Federation of Automatic Control (IFAC)
| null | null | null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In formation control, triangular formations consisting of three autonomous
agents serve as a class of benchmarks that can be used to test and compare the
performances of different controllers. We present an algorithm that combines
the advantages of both position- and distance-based gradient descent control
laws. For example, only two pairs of neighboring agents need to be controlled,
agents can work in their own local frame of coordinates and the orientation of
the formation with respect to a global frame of coordinates is not prescribed.
We first present a novel technique based on adding artificial biases to
neighboring agents' range sensors such that their eventual positions correspond
to a collinear configuration. Right after, a small modification in the bias
terms by introducing a prescribed rotation matrix will allow the control of the
bearing of the neighboring agents.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 11:27:20 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"de Marina",
"Hector Garcia",
""
],
[
"Sun",
"Zhiyong",
""
],
[
"Cao",
"Ming",
""
],
[
"Anderson",
"Brian D. O.",
""
]
] |
new_dataset
| 0.963028 |
1704.00556
|
Hassan Khosravi
|
Hassan Khosravi, Kendra Cooper, Kirsty Kitto
|
RiPLE: Recommendation in Peer-Learning Environments Based on Knowledge
Gaps and Interests
|
25 pages, 7 figures. The paper is accepted for publication in the
Journal of Educational Data Mining
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Various forms of Peer-Learning Environments are increasingly being used in
post-secondary education, often to help build repositories of student generated
learning objects. However, large classes can result in an extensive repository,
which can make it more challenging for students to search for suitable objects
that both reflect their interests and address their knowledge gaps. Recommender
Systems for Technology Enhanced Learning (RecSysTEL) offer a potential solution
to this problem by providing sophisticated filtering techniques to help
students to find the resources that they need in a timely manner. Here, a new
RecSysTEL for Recommendation in Peer-Learning Environments (RiPLE) is
presented. The approach uses a collaborative filtering algorithm based upon
matrix factorization to create personalized recommendations for individual
students that address their interests and their current knowledge gaps. The
approach is validated using both synthetic and real data sets. The results are
promising, indicating RiPLE is able to provide sensible personalized
recommendations for both regular and cold-start users under reasonable
assumptions about parameters and user behavior.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 12:59:24 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Khosravi",
"Hassan",
""
],
[
"Cooper",
"Kendra",
""
],
[
"Kitto",
"Kirsty",
""
]
] |
new_dataset
| 0.998374 |
1704.00565
|
Eva Rotenberg
|
Jacob Holm, Eva Rotenberg
|
Dynamic Planar Embeddings of Dynamic Graphs
|
Announced at STACS'15
| null | null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an algorithm to support the dynamic embedding in the plane of a
dynamic graph. An edge can be inserted across a face between two vertices on
the face boundary (we call such a vertex pair linkable), and edges can be
deleted. The planar embedding can also be changed locally by flipping
components that are connected to the rest of the graph by at most two vertices.
Given vertices $u,v$, linkable$(u,v)$ decides whether $u$ and $v$ are
linkable in the current embedding, and if so, returns a list of suggestions for
the placement of $(u,v)$ in the embedding. For non-linkable vertices $u,v$, we
define a new query, one-flip-linkable$(u,v)$ providing a suggestion for a flip
that will make them linkable if one exists. We support all updates and queries
in O(log$^2 n$) time. Our time bounds match those of Italiano et al. for a
static (flipless) embedding of a dynamic graph.
Our new algorithm is simpler, exploiting that the complement of a spanning
tree of a connected plane graph is a spanning tree of the dual graph. The
primal and dual trees are interpreted as having the same Euler tour, and a main
idea of the new algorithm is an elegant interaction between top trees over the
two trees via their common Euler tour.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 13:15:59 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Holm",
"Jacob",
""
],
[
"Rotenberg",
"Eva",
""
]
] |
new_dataset
| 0.996255 |
1704.00573
|
Claudio Paliotta
|
Mohammed Maghenem, Dennis W.J. Belleter, Claudio Paliotta, and Kristin
Y. Pettersen
|
Observer Based Path Following for Underactuated Marine Vessels in the
Presence of Ocean Currents: A Local Approach - With proofs
| null | null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article a solution to the problem of following a curved path in the
presence of a constant unknown ocean current disturbance is presented. The path
is parametrised by a path variable that is used to propagate a path-tangential
reference frame. The update law for the path variable is chosen such that the
motion of the path-tangential frame ensures that the vessel remains on the
normal of the path-tangential reference frame. As shown in the seminal work
[20] such a parametrisation is only possible locally. A tube is defined in
which the aforementioned parametrisation is valid and the path-following
problem is solved within this tube. The size of the tube is proportional to the
maximum curvature of the path. It is shown that within this tube, the
closed-loop system of the proposed controller, guidance law, and the ocean
current observer provides exponential stability of the path-following error
dynamics. The sway velocity dynamics are analysed taking into account couplings
previously overlooked in the literature, and is shown to remain bounded.
Simulation results are presented.
|
[
{
"version": "v1",
"created": "Fri, 31 Mar 2017 09:38:00 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Maghenem",
"Mohammed",
""
],
[
"Belleter",
"Dennis W. J.",
""
],
[
"Paliotta",
"Claudio",
""
],
[
"Pettersen",
"Kristin Y.",
""
]
] |
new_dataset
| 0.988773 |
1704.00623
|
Jose Flordelis
|
Jose Flordelis, Fredrik Rusek, Fredrik Tufvesson, Erik G. Larsson, and
Ove Edfors
|
Massive MIMO Performance - TDD Versus FDD: What Do Measurements Say?
|
Submitted to IEEE Transactions on Wireless Communications,
31/Mar/2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Downlink beamforming in Massive MIMO either relies on uplink pilot
measurements - exploiting reciprocity and TDD operation, or on the use of a
predetermined grid of beams with user equipments reporting their preferred
beams, mostly in FDD operation. Massive MIMO in its originally conceived form
uses the first strategy, with uplink pilots, whereas there is currently
significant commercial interest in the second, grid-of-beams. It has been
analytically shown that in isotropic scattering (independent Rayleigh fading)
the first approach outperforms the second. Nevertheless there remains
controversy regarding their relative performance in practice. In this
contribution, the performances of these two strategies are compared using
measured channel data at 2.6 GHz.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 14:44:59 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Flordelis",
"Jose",
""
],
[
"Rusek",
"Fredrik",
""
],
[
"Tufvesson",
"Fredrik",
""
],
[
"Larsson",
"Erik G.",
""
],
[
"Edfors",
"Ove",
""
]
] |
new_dataset
| 0.971177 |
1704.00663
|
Deekshith P K
|
P. K. Deekshith, K. R. Sahasranand
|
Polar Codes over Fading Channels with Power and Delay Constraints
|
6 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The inherent nature of polar codes being channel specific makes it difficult
to use them in a setting where the communication channel changes with time. In
particular, to be able to use polar codes in a wireless scenario, varying
attenuation due to fading needs to be mitigated. To the best of our knowledge,
there has been no comprehensive work in this direction thus far. In this work,
a practical scheme involving channel inversion with the knowledge of the
channel state at the transmitter, is proposed. An additional practical
constraint on the permissible average and peak power is imposed, which in turn
makes the channel equivalent to an additive white Gaussian noise (AWGN) channel
cascaded with an erasure channel. It is shown that the constructed polar code
could be made to achieve the symmetric capacity of this channel. Further, a
means to compute the optimal design rate of the polar code for a given power
constraint is also discussed.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 16:21:02 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Deekshith",
"P. K.",
""
],
[
"Sahasranand",
"K. R.",
""
]
] |
new_dataset
| 0.999112 |
1704.00715
|
David Poulin
|
Andrew James Ferris, Christoph Hirche and David Poulin
|
Convolutional Polar Codes
|
Subsumes arXiv:1312.4575
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arikan's Polar codes attracted much attention as the first efficiently
decodable and capacity achieving codes. Furthermore, Polar codes exhibit an
exponentially decreasing block error probability with an asymptotic error
exponent upper bounded by 1/2. Since their discovery, many attempts have been
made to improve the error exponent and the finite block-length performance,
while keeping the bloc-structured kernel. Recently, two of us introduced a new
family of efficiently decodable error-correction codes based on a recently
discovered efficiently-contractible tensor network family in quantum many-body
physics, called branching MERA. These codes, called branching MERA codes,
include Polar codes and also extend them in a non-trivial way by substituting
the bloc-structured kernel by a convolutional structure. Here, we perform an
in-depth study of a particular example that can be thought of as a direct
extension to Arikan's Polar code, which we therefore name Convolutional Polar
codes. We prove that these codes polarize and exponentially suppress the
channel's error probability, with an asymptotic error exponent log_2(3)/2 which
is provably better than for Polar codes under successive cancellation decoding.
We also perform finite block-size numerical simulations which display improved
error-correcting capability with only a minor impact on decoding complexity.
|
[
{
"version": "v1",
"created": "Mon, 3 Apr 2017 17:57:34 GMT"
}
] | 2017-04-04T00:00:00 |
[
[
"Ferris",
"Andrew James",
""
],
[
"Hirche",
"Christoph",
""
],
[
"Poulin",
"David",
""
]
] |
new_dataset
| 0.999728 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.