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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1605.05362
|
Nabiha Asghar
|
Nabiha Asghar
|
Yelp Dataset Challenge: Review Rating Prediction
| null | null | null | null |
cs.CL cs.IR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Review websites, such as TripAdvisor and Yelp, allow users to post online
reviews for various businesses, products and services, and have been recently
shown to have a significant influence on consumer shopping behaviour. An online
review typically consists of free-form text and a star rating out of 5. The
problem of predicting a user's star rating for a product, given the user's text
review for that product, is called Review Rating Prediction and has lately
become a popular, albeit hard, problem in machine learning. In this paper, we
treat Review Rating Prediction as a multi-class classification problem, and
build sixteen different prediction models by combining four feature extraction
methods, (i) unigrams, (ii) bigrams, (iii) trigrams and (iv) Latent Semantic
Indexing, with four machine learning algorithms, (i) logistic regression, (ii)
Naive Bayes classification, (iii) perceptrons, and (iv) linear Support Vector
Classification. We analyse the performance of each of these sixteen models to
come up with the best model for predicting the ratings from reviews. We use the
dataset provided by Yelp for training and testing the models.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 20:52:33 GMT"
}
] | 2016-05-19T00:00:00 |
[
[
"Asghar",
"Nabiha",
""
]
] |
new_dataset
| 0.967881 |
1605.05384
|
Xingqin Lin
|
Xingqin Lin, Ansuman Adhikary, and Y.-P. Eric Wang
|
Random Access Preamble Design and Detection for 3GPP Narrowband IoT
Systems
|
4 pages, 2 figures, submitted for publication
| null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Narrowband internet of things (NB-IoT) is an emerging cellular technology
that will provide improved coverage for massive number of low-throughput
low-cost devices with low device power consumption in delay-tolerant
applications. A new single tone signal with frequency hopping has been designed
for NB-IoT physical random access channel (NPRACH). In this letter we describe
this new NPRACH design and explain in detail the design rationale. We further
propose possible receiver algorithms for NPRACH detection and time-of-arrival
estimation. Simulation results on NPRACH performance including detection rate,
false alarm rate, and time-of-arrival estimation accuracy are presented to shed
light on the overall potential of NB-IoT systems.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 22:22:06 GMT"
}
] | 2016-05-19T00:00:00 |
[
[
"Lin",
"Xingqin",
""
],
[
"Adhikary",
"Ansuman",
""
],
[
"Wang",
"Y. -P. Eric",
""
]
] |
new_dataset
| 0.977791 |
1605.05401
|
Yu Wang
|
Yu Wang, Yang Feng, Yuncheng Li, Xiyang Zhang, Richard Niemi, Jiebo
Luo
|
Pricing the Woman Card: Gender Politics between Hillary Clinton and
Donald Trump
|
4 pages, 6 figures, 7 tables, under review
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a data-driven method to measure the impact of the
'woman card' exchange between Hillary Clinton and Donald Trump. Building from a
unique dataset of the two candidates' Twitter followers, we first examine the
transition dynamics of the two candidates' Twitter followers one week before
the exchange and one week after. Then we train a convolutional neural network
to classify the gender of the followers and unfollowers, and study how women in
particular are reacting to the 'woman card' exchange. Our study suggests that
the 'woman card' comment has made women more likely to follow Hillary Clinton,
less likely to unfollow her and that it has apparently not affected the gender
composition of Trump followers.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2016 00:00:44 GMT"
}
] | 2016-05-19T00:00:00 |
[
[
"Wang",
"Yu",
""
],
[
"Feng",
"Yang",
""
],
[
"Li",
"Yuncheng",
""
],
[
"Zhang",
"Xiyang",
""
],
[
"Niemi",
"Richard",
""
],
[
"Luo",
"Jiebo",
""
]
] |
new_dataset
| 0.995669 |
1605.05448
|
Aish Fenton
|
Aish Fenton
|
The Bees Algorithm for the Vehicle Routing Problem
| null | null | null | null |
cs.NE cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this thesis we present a new algorithm for the Vehicle Routing Problem
called the Enhanced Bees Algorithm. It is adapted from a fairly recent
algorithm, the Bees Algorithm, which was developed for continuous optimisation
problems. We show that the results obtained by the Enhanced Bees Algorithm are
competitive with the best meta-heuristics available for the Vehicle Routing
Problem (within 0.5% of the optimal solution for common benchmark problems). We
show that the algorithm has good runtime performance, producing results within
2% of the optimal solution within 60 seconds, making it suitable for use within
real world dispatch scenarios.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2016 05:53:44 GMT"
}
] | 2016-05-19T00:00:00 |
[
[
"Fenton",
"Aish",
""
]
] |
new_dataset
| 0.957249 |
1605.05566
|
Joseph M. Hellerstein
|
Joseph M. Hellerstein
|
Naughton's Wisconsin Bibliography: A Brief Guide
|
Presented at the Wisconsin Database Group 40 Year Event, on the
occasion of Jeff Naughton's retirement from the University of Wisconsin
| null | null | null |
cs.GL cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over nearly three decades at the University of Wisconsin, Jeff Naughton has
left an indelible mark on computer science. He has been a global leader of the
database research field, deepening its core and pushing its boundaries. Many of
Naughton's ideas were translated directly into practice in commercial and
open-source systems. But software comes and goes. In the end, it is the ideas
themselves that have had impact, ideas written down in papers.
Naughton has been a prolific scholar over the last thirty years, with over
175 publications in his bibliography, covering a wide range of topics. This
document does not attempt to enumerate or even summarize the wealth of ideas
that Naughton has published over the course of his academic career--the task is
too daunting. Instead, the best this short note aims to do is to serve as a
rough map of the territory: something to help other researchers navigate the
wide spaces of Naughton's work.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 05:54:01 GMT"
}
] | 2016-05-19T00:00:00 |
[
[
"Hellerstein",
"Joseph M.",
""
]
] |
new_dataset
| 0.999742 |
1605.05629
|
Michael Deakin
|
Michael Deakin, Jack Snoeyink
|
On the Precision to Sort Line-Quadric Intersections
|
CCCG 2016 submission, 6 pages, 2 figures, 1 table
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To support exactly tracking a neutron moving along a given line segment
through a CAD model with quadric surfaces, this paper considers the arithmetic
precision required to compute the order of intersection points of two quadrics
along the line segment. When the orders of all but one pair of intersections
are known, we show that a resultant can resolve the order of the remaining pair
using only half the precision that may be required to eliminate radicals by
repeated squaring. We compare the time and accuracy of our technique with
converting to extended precision to calculate roots.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2016 15:51:22 GMT"
}
] | 2016-05-19T00:00:00 |
[
[
"Deakin",
"Michael",
""
],
[
"Snoeyink",
"Jack",
""
]
] |
new_dataset
| 0.988809 |
1605.05633
|
Chen-Feng Liu
|
Marco Maso and Chen-Feng Liu and Chia-Han Lee and Tony Q. S. Quek and
Leonardo S. Cardoso
|
Energy-Recycling Full-Duplex Radios for Next-Generation Networks
| null |
IEEE Journal on Selected Areas in Communications, vol. 33, no. 12,
pp. 2948-2962, Dec. 2015
|
10.1109/JSAC.2015.2482058
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, a novel energy-recycling single-antenna full-duplex (FD) radio
is designed, in which a new 3-port element including a power divider and an
energy harvester is added between the circulator and the receiver (RX) chain.
The presence of this new element brings advantages over the state of the art in
terms of both spectral efficiency and energy consumption. In particular, it
provides the means of performing both an arbitrary attenuation of the incoming
signal, which in turn increases the effectiveness of the state-of-the-art
self-interference cancellation strategies subsequently adopted in the RX chain,
and the recycling of a non-negligible portion of the energy leaked through the
non-ideal circulator. The performance of this architecture is analyzed in a
practically relevant 4-node scenario in which 2 nodes operate in FD and 2 nodes
in half-duplex (HD). Analytical approximations are derived for both the
achievable rates of the transmissions performed by the FD and HD radios and the
energy recycled by the FD radios. The accuracy of these derivations is
confirmed by numerical simulations. Quantitatively, achievable rate gains up to
40% over the state-of-the-art alternatives, in the considered scenario, are
highlighted. Furthermore, up to 50% of the leaked energy at the circulator,
i.e., 5% of the energy of the transmitted signal, can be recycled.
|
[
{
"version": "v1",
"created": "Wed, 18 May 2016 15:54:30 GMT"
}
] | 2016-05-19T00:00:00 |
[
[
"Maso",
"Marco",
""
],
[
"Liu",
"Chen-Feng",
""
],
[
"Lee",
"Chia-Han",
""
],
[
"Quek",
"Tony Q. S.",
""
],
[
"Cardoso",
"Leonardo S.",
""
]
] |
new_dataset
| 0.993553 |
1509.05100
|
Arjun Guha
|
Rian Shambaugh, Aaron Weiss and Arjun Guha
|
Rehearsal: A Configuration Verification Tool for Puppet
|
In proceedings of ACM SIGPLAN Conference on Programming Language
Design and Implementation (PLDI) 2016
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-scale data centers and cloud computing have turned system configuration
into a challenging problem. Several widely-publicized outages have been blamed
not on software bugs, but on configuration bugs. To cope, thousands of
organizations use system configuration languages to manage their computing
infrastructure. Of these, Puppet is the most widely used with thousands of
paying customers and many more open-source users. The heart of Puppet is a
domain-specific language that describes the state of a system. Puppet already
performs some basic static checks, but they only prevent a narrow range of
errors. Furthermore, testing is ineffective because many errors are only
triggered under specific machine states that are difficult to predict and
reproduce. With several examples, we show that a key problem with Puppet is
that configurations can be non-deterministic.
This paper presents Rehearsal, a verification tool for Puppet configurations.
Rehearsal implements a sound, complete, and scalable determinacy analysis for
Puppet. To develop it, we (1) present a formal semantics for Puppet, (2) use
several analyses to shrink our models to a tractable size, and (3) frame
determinism-checking as decidable formulas for an SMT solver. Rehearsal then
leverages the determinacy analysis to check other important properties, such as
idempotency. Finally, we apply Rehearsal to several real-world Puppet
configurations.
|
[
{
"version": "v1",
"created": "Thu, 17 Sep 2015 01:53:49 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Sep 2015 18:35:19 GMT"
},
{
"version": "v3",
"created": "Tue, 17 May 2016 14:30:48 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Shambaugh",
"Rian",
""
],
[
"Weiss",
"Aaron",
""
],
[
"Guha",
"Arjun",
""
]
] |
new_dataset
| 0.995184 |
1605.03481
|
Bhuwan Dhingra
|
Bhuwan Dhingra, Zhong Zhou, Dylan Fitzpatrick, Michael Muehl, William
W. Cohen
|
Tweet2Vec: Character-Based Distributed Representations for Social Media
|
6 pages, 2 figures, 4 tables, accepted as conference paper at ACL
2016
| null | null | null |
cs.LG cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Text from social media provides a set of challenges that can cause
traditional NLP approaches to fail. Informal language, spelling errors,
abbreviations, and special characters are all commonplace in these posts,
leading to a prohibitively large vocabulary size for word-level approaches. We
propose a character composition model, tweet2vec, which finds vector-space
representations of whole tweets by learning complex, non-local dependencies in
character sequences. The proposed model outperforms a word-level baseline at
predicting user-annotated hashtags associated with the posts, doing
significantly better when the input contains many out-of-vocabulary words or
unusual character sequences. Our tweet2vec encoder is publicly available.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2016 15:30:09 GMT"
},
{
"version": "v2",
"created": "Tue, 17 May 2016 15:00:38 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Dhingra",
"Bhuwan",
""
],
[
"Zhou",
"Zhong",
""
],
[
"Fitzpatrick",
"Dylan",
""
],
[
"Muehl",
"Michael",
""
],
[
"Cohen",
"William W.",
""
]
] |
new_dataset
| 0.999557 |
1605.04930
|
Jean-Marc Valin
|
Jean-Marc Valin, Nathan E. Egge, Thomas Daede, Timothy B. Terriberry,
Christopher Montgomery
|
Daala: A Perceptually-Driven Still Picture Codec
|
Accepted for ICIP 2016, 5 pages
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Daala is a new royalty-free video codec based on perceptually-driven coding
techniques. We explore using its keyframe format for still picture coding and
show how it has improved over the past year. We believe the technology used in
Daala could be the basis of an excellent, royalty-free image format.
|
[
{
"version": "v1",
"created": "Mon, 16 May 2016 20:12:02 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Valin",
"Jean-Marc",
""
],
[
"Egge",
"Nathan E.",
""
],
[
"Daede",
"Thomas",
""
],
[
"Terriberry",
"Timothy B.",
""
],
[
"Montgomery",
"Christopher",
""
]
] |
new_dataset
| 0.989464 |
1605.04971
|
Rasha Abu Samra
|
R. Z. Abu Samra, H. A. Bany salameh
|
A Dynamic Multi-cast Routing Algorithm for Opportunistic Networks:
Implementing the Expected Transmission Count Metric
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cognitive radio (CR) technology enables an intelligent wireless communication
system. CR provides an efficient solution for the inefficient spectrum
utilization by allowing dynamic and opportunistic spectrum access. In designing
CR networks, the main challenge is how to increase network throughput while
protecting the performance of licensed primary radio networks (PRNs) and
keeping the interference between primary users (PUs) and cognitive users (CUs)
within a prescribed threshold. In this work, we develop a multi-cast routing
algorithm that based on the expected transmission count metric (ETX), which
implemented as a metric combined with minimum spanning tree (MST) and shortest
path tree (SPT) schemes according to the various traffic loads in CRN to
determine the path selection method and used the probability of Success (POS)
metric for the channel assignment that used the required transmission time and
the channel availability time in choosing unified channel. The main objective
of our algorithm is to reduce the total number of the expected packet
transmissions (with retransmissions) needed for successfully forwarding a data
packet to a specific group of destinations and provide guarantees on the
chances of a successful transmission over a given channel. This metric is
capable to capture the CRNs environment, in which the channel availabilities
are diversity and dynamically changing due to the dynamic and uncertainty
activity of PUs. Our proposed protocol achieves high-throughput and packet
delivery rate (PDR) through a joint channel assignment and path selection to
the specific destinations. Simulation results is used to demonstrate the
effectiveness of our proposed algorithm in terms of throughput and packet
delivery rate compared to other existing multi-cast routing protocols over
different network conditions by using matlab as a simulations.
|
[
{
"version": "v1",
"created": "Mon, 16 May 2016 22:22:45 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Samra",
"R. Z. Abu",
""
],
[
"salameh",
"H. A. Bany",
""
]
] |
new_dataset
| 0.95324 |
1605.05024
|
Swati Rawal
|
Swati Rawal
|
Multi-Prime RSA Over Galois Approach
|
4 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many variants of RSA cryptosystem exist in the literature. One of them is RSA
over polynomials based on Galois approach. In standard RSA modulus is product
of two large primes whereas in the Galois approach author considered the
modulus as a product of two irriduciable polynomials. We use this idea and
extend Multi-prime RSA over polynomials.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 05:53:16 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Rawal",
"Swati",
""
]
] |
new_dataset
| 0.952265 |
1605.05054
|
Minseok Park
|
Minseok Park, Hanxiang Li, Junmo Kim
|
HARRISON: A Benchmark on HAshtag Recommendation for Real-world Images in
Social Networks
| null | null | null | null |
cs.CV cs.IR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Simple, short, and compact hashtags cover a wide range of information on
social networks. Although many works in the field of natural language
processing (NLP) have demonstrated the importance of hashtag recommendation,
hashtag recommendation for images has barely been studied. In this paper, we
introduce the HARRISON dataset, a benchmark on hashtag recommendation for real
world images in social networks. The HARRISON dataset is a realistic dataset,
composed of 57,383 photos from Instagram and an average of 4.5 associated
hashtags for each photo. To evaluate our dataset, we design a baseline
framework consisting of visual feature extractor based on convolutional neural
network (CNN) and multi-label classifier based on neural network. Based on this
framework, two single feature-based models, object-based and scene-based model,
and an integrated model of them are evaluated on the HARRISON dataset. Our
dataset shows that hashtag recommendation task requires a wide and contextual
understanding of the situation conveyed in the image. As far as we know, this
work is the first vision-only attempt at hashtag recommendation for real world
images in social networks. We expect this benchmark to accelerate the
advancement of hashtag recommendation.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 08:21:07 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Park",
"Minseok",
""
],
[
"Li",
"Hanxiang",
""
],
[
"Kim",
"Junmo",
""
]
] |
new_dataset
| 0.999839 |
1605.05057
|
Simon Hampe
|
Ewgenij Gawrilow, Simon Hampe, Michael Joswig
|
The polymake XML file format
|
8 pages. Extended abstract for the 5th International Congress on
Mathematical Software (ICMS), Berlin 2016
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an XML file format for storing data from computations in algebra
and geometry. We also present a formal specification based on a RELAX-NG
schema.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 08:40:14 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Gawrilow",
"Ewgenij",
""
],
[
"Hampe",
"Simon",
""
],
[
"Joswig",
"Michael",
""
]
] |
new_dataset
| 0.99975 |
1605.05067
|
Simone Faro
|
Simone Faro
|
Exact Online String Matching Bibliography
|
23 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this short note we present a comprehensive bibliography for the online
exact string matching problem. The problem consists in finding all occurrences
of a given pattern in a text. It is an extensively studied problem in computer
science, mainly due to its direct applications to such diverse areas as text,
image and signal processing, speech analysis and recognition, data compression,
information retrieval, computational biology and chemistry. Since 1970 more
than 120 string matching algorithms have been proposed. In this note we present
a comprehensive list of (almost) all string matching algorithms. The list is
updated to May 2016.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 09:14:50 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Faro",
"Simone",
""
]
] |
new_dataset
| 0.98869 |
1605.05122
|
Kursad Agpak
|
Kursad Agpak, Huseyin Karateke, Suleyman Mete
|
Two-Finger Keyboard Layout Problem: An Application On Turkish Language
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smart phone and tablet usage has sharply increased for the last decade. While
entering test on these devices, virtual keyboards are generally used instead of
conventional hardware keyboards. In this study, a new problem which is
two-finger keyboard layout problem and solution approach is presented for
increasing user test entrance performance, especially on virtual keyboards.
Defined two-finger keyboard layout problem is modeled as Quadratic Assignment
Problem. Because of combinatorial structure of the problem a genetic algorithm
is developed. Its result is given to mathematical model as initial solution for
finding better solutions with mathematical model. Proposed approach is applied
on Turkish language. The new two finger keyboard layout for Turkish language is
compared with F and QWERTY keyboard layouts based on certain performance
measurement techniques.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 11:55:38 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Agpak",
"Kursad",
""
],
[
"Karateke",
"Huseyin",
""
],
[
"Mete",
"Suleyman",
""
]
] |
new_dataset
| 0.99868 |
1605.05281
|
Evyatar Hemo
|
Evyatar Hemo and Yuval Cassuto
|
$d$-imbalance WOM Codes for Reduced Inter-Cell Interference in
Multi-Level NVMs
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, due to the spread of multi-level non-volatile memories
(NVM), $q$-ary write-once memories (WOM) codes have been extensively studied.
By using WOM codes, it is possible to rewrite NVMs $t$ times before erasing the
cells. The use of WOM codes enables to improve the performance of the storage
device, however, it may also increase errors caused by inter-cell interference
(ICI). This work presents WOM codes that restrict the imbalance between code
symbols throughout the write sequence, hence decreasing ICI. We first specify
the imbalance model as a bound $d$ on the difference between codeword levels.
Then a $2$-cell code construction for general $q$ and input size is proposed.
An upper bound on the write count is also derived, showing the optimality of
the proposed construction. In addition to direct WOM constructions, we derive
closed-form optimal write regions for codes constructed with continuous
lattices. On the coding side, the proposed codes are shown to be competitive
with known codes not adhering to the bounded imbalance constraint. On the
memory side, we show how the codes can be deployed within flash wordlines, and
quantify their BER advantage using accepted ICI models.
|
[
{
"version": "v1",
"created": "Tue, 17 May 2016 18:37:41 GMT"
}
] | 2016-05-18T00:00:00 |
[
[
"Hemo",
"Evyatar",
""
],
[
"Cassuto",
"Yuval",
""
]
] |
new_dataset
| 0.955858 |
1410.3191
|
Dani Korpi
|
Dani Korpi, Joose Tamminen, Matias Turunen, Timo Huusari, Yang-Seok
Choi, Lauri Anttila, Shilpa Talwar, and Mikko Valkama
|
Full-Duplex Mobile Device - Pushing the Limits
|
18 pages, submitted for review
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we address the challenges of transmitter-receiver isolation
in \emph{mobile full-duplex devices}, building on shared-antenna based
transceiver architecture. Firstly, self-adaptive analog RF cancellation
circuitry is required, since the capability to track time-varying
self-interference coupling characteristics is of utmost importance in mobile
devices. In addition, novel adaptive nonlinear DSP methods are also required
for final self-interference suppression at digital baseband, since mobile-scale
devices typically operate under highly nonlinear low-cost RF components.
In addition to describing above kind of advanced circuit and signal
processing solutions, comprehensive RF measurement results from a complete
demonstrator implementation are also provided, evidencing beyond 40~dB of
active RF cancellation over an 80 MHz waveform bandwidth with a highly
nonlinear transmitter power amplifier. Measured examples also demonstrate the
good self-healing characteristics of the developed control loop against fast
changes in the coupling channel. Furthermore, when complemented with nonlinear
digital cancellation processing, the residual self-interference level is pushed
down to the noise floor of the demonstration system, despite the harsh
nonlinear nature of the self-interference. These findings indicate that
deploying the full-duplex principle can indeed be feasible also in mobile
devices, and thus be one potential technology in, e.g., 5G and beyond radio
systems.
|
[
{
"version": "v1",
"created": "Mon, 13 Oct 2014 05:34:14 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Feb 2016 14:34:49 GMT"
},
{
"version": "v3",
"created": "Mon, 16 May 2016 08:41:49 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Korpi",
"Dani",
""
],
[
"Tamminen",
"Joose",
""
],
[
"Turunen",
"Matias",
""
],
[
"Huusari",
"Timo",
""
],
[
"Choi",
"Yang-Seok",
""
],
[
"Anttila",
"Lauri",
""
],
[
"Talwar",
"Shilpa",
""
],
[
"Valkama",
"Mikko",
""
]
] |
new_dataset
| 0.990934 |
1510.08943
|
Scott Ruoti
|
Scott Ruoti, Jeff Andersen, Tyler Monson, Daniel Zappala, Kent Seamons
|
MessageGuard: A Browser-based Platform for Usable, Content-Based
Encryption Research
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes MessageGuard, a browser-based platform for research into
usable content-based encryption. MessageGuard is designed to enable
collaboration between security and usability researchers on long-standing
research questions in this area. It significantly simplifies the effort
required to work in this space and provides a place for research results to be
shared, replicated, and compared with minimal confounding factors. MessageGuard
provides ubiquitous encryption and secure cryptographic operations, enabling
research on any existing web application, with realistic usability studies on a
secure platform. We validate MessageGuard's compatibility and performance, and
we illustrate its utility with case studies for Gmail and Facebook Chat.
|
[
{
"version": "v1",
"created": "Fri, 30 Oct 2015 00:33:52 GMT"
},
{
"version": "v2",
"created": "Mon, 16 May 2016 17:30:28 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Ruoti",
"Scott",
""
],
[
"Andersen",
"Jeff",
""
],
[
"Monson",
"Tyler",
""
],
[
"Zappala",
"Daniel",
""
],
[
"Seamons",
"Kent",
""
]
] |
new_dataset
| 0.999302 |
1605.02142
|
Jonathan Sterling
|
Jonathan Sterling
|
Nominal LCF: A Language for Generic Proof
|
Accepted to TFP 2016, the paper has been withdrawn by the author
because he has found a serious flaw in the denotational semantics given in
section 5
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The syntax and semantics of user-supplied hypothesis names in tactic
languages is a thorny problem, because the binding structure of a proof is a
function of the goal at which a tactic script is executed. We contribute a new
language to deal with the dynamic and interactive character of names in tactic
scripts called Nominal LCF, and endow it with a denotational semantics in
dI-domains. A large fragment of Nominal LCF has already been implemented and
used to great effect in the new RedPRL proof assistant.
|
[
{
"version": "v1",
"created": "Sat, 7 May 2016 05:05:40 GMT"
},
{
"version": "v2",
"created": "Sat, 14 May 2016 01:24:06 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Sterling",
"Jonathan",
""
]
] |
new_dataset
| 0.999393 |
1605.04343
|
Adam Yedidia
|
Adam Yedidia and Scott Aaronson
|
A Relatively Small Turing Machine Whose Behavior Is Independent of Set
Theory
|
31 pages, 6 figures, with the last 10 pages devoted to bibliography
and appendices. Submitted to Complex Systems
| null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the definition of the Busy Beaver function by Rado in 1962, an
interesting open question has been the smallest value of n for which BB(n) is
independent of ZFC set theory. Is this n approximately 10, or closer to
1,000,000, or is it even larger? In this paper, we show that it is at most
7,910 by presenting an explicit description of a 7,910-state Turing machine Z
with 1 tape and a 2-symbol alphabet that cannot be proved to run forever in ZFC
(even though it presumably does), assuming ZFC is consistent. The machine is
based on the work of Harvey Friedman on independent statements involving
order-invariant graphs. In doing so, we give the first known upper bound on the
highest provable Busy Beaver number in ZFC. To create Z, we develop and use a
higher-level language, Laconic, which is much more convenient than direct state
manipulation. We also use Laconic to design two Turing machines, G and R, that
halt if and only if there are counterexamples to Goldbach's Conjecture and the
Riemann Hypothesis, respectively.
|
[
{
"version": "v1",
"created": "Fri, 13 May 2016 22:05:58 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Yedidia",
"Adam",
""
],
[
"Aaronson",
"Scott",
""
]
] |
new_dataset
| 0.998321 |
1605.04421
|
Travis Gagie
|
Anthony J. Cox, Andrea Farruggia, Travis Gagie, Simon J. Puglisi and
Jouni Sir\'en
|
RLZAP: Relative Lempel-Ziv with Adaptive Pointers
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Relative Lempel-Ziv (RLZ) is a popular algorithm for compressing databases of
genomes from individuals of the same species when fast random access is
desired. With Kuruppu et al.'s (SPIRE 2010) original implementation, a
reference genome is selected and then the other genomes are greedily parsed
into phrases exactly matching substrings of the reference. Deorowicz and
Grabowski (Bioinformatics, 2011) pointed out that letting each phrase end with
a mismatch character usually gives better compression because many of the
differences between individuals' genomes are single-nucleotide substitutions.
Ferrada et al. (SPIRE 2014) then pointed out that also using relative pointers
and run-length compressing them usually gives even better compression. In this
paper we generalize Ferrada et al.'s idea to handle well also short insertions,
deletions and multi-character substitutions. We show experimentally that our
generalization achieves better compression than Ferrada et al.'s implementation
with comparable random-access times.
|
[
{
"version": "v1",
"created": "Sat, 14 May 2016 13:49:27 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Cox",
"Anthony J.",
""
],
[
"Farruggia",
"Andrea",
""
],
[
"Gagie",
"Travis",
""
],
[
"Puglisi",
"Simon J.",
""
],
[
"Sirén",
"Jouni",
""
]
] |
new_dataset
| 0.971863 |
1605.04538
|
Ofer Neiman
|
Michael Elkin and Ofer Neiman
|
Hopsets with Constant Hopbound, and Applications to Approximate Shortest
Paths
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $(\beta,\epsilon)$-hopset for a weighted undirected $n$-vertex graph
$G=(V,E)$ is a set of edges, whose addition to the graph guarantees that every
pair of vertices has a path between them that contains at most $\beta$ edges,
whose length is within $1+\epsilon$ of the shortest path. In her seminal paper,
Cohen \cite[JACM 2000]{C00} introduced the notion of hopsets in the context of
parallel computation of approximate shortest paths, and since then it has found
numerous applications in various other settings, such as dynamic graph
algorithms, distributed computing, and the streaming model.
Cohen \cite{C00} devised efficient algorithms for constructing hopsets with
{\em polylogarithmic} in $n$ number of hops. Her constructions remain the
state-of-the--art since the publication of her paper in STOC'94, i.e., for more
than two decades.
In this paper we exhibit the first construction of sparse hopsets with a {\em
constant number of hops}. We also find efficient algorithms for hopsets in
various computational settings, improving the best known constructions.
Generally, our hopsets strictly outperform the hopsets of \cite{C00}, both in
terms of their parameters, and in terms of the resources required to construct
them.
We demonstrate the applicability of our results for the fundamental problem
of computing approximate shortest paths from $s$ sources. Our results improve
the running time for this problem in the parallel, distributed and streaming
models, for a vast range of $s$.
|
[
{
"version": "v1",
"created": "Sun, 15 May 2016 12:56:42 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Elkin",
"Michael",
""
],
[
"Neiman",
"Ofer",
""
]
] |
new_dataset
| 0.999192 |
1605.04611
|
Ray Li
|
Venkatesan Guruswami, Ray Li
|
Efficiently decodable insertion/deletion codes for high-noise and
high-rate regimes
| null | null | null | null |
cs.IT cs.DS math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work constructs codes that are efficiently decodable from a constant
fraction of \emph{worst-case} insertion and deletion errors in three parameter
settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant
rate for error fraction approaching 1 over fixed alphabet size; and (iii)
Constant rate codes over an alphabet of size $k$ for error fraction approaching
$(k-1)/(k+1)$. When errors are constrained to deletions alone, efficiently
decodable codes in each of these regimes were constructed recently. We complete
the picture by constructing similar codes that are efficiently decodable in the
insertion/deletion regime.
|
[
{
"version": "v1",
"created": "Sun, 15 May 2016 22:30:28 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Guruswami",
"Venkatesan",
""
],
[
"Li",
"Ray",
""
]
] |
new_dataset
| 0.9943 |
1605.04696
|
Ayman Abdel-Hamid
|
Ahmed H. Salem, Ayman Abdel-Hamid, Mohamad Abou El-Nasr
|
The Case for Dynamic Key Distribution for PKI-Based VANETs
| null |
International Journal of Computer Networks & Communications
(IJCNC) Vol.6, No.1, pp. 61-78, January 2014
|
10.5121/ijcnc.2014.6105
| null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vehicular Ad hoc Networks (VANETs) are becoming a reality where secure
communication is a prerequisite. Public key infrastructure (PKI) can be used to
secure VANETs where an onboard tamper proof device (TPD) stores a number of
encryption keys which are renewed upon visiting a certificate authority (CA).
We previously proposed a dynamic key distribution protocol for PKI-based VANETs
[1] to reduce the role of the TPD. A vehicle dynamically requests a key from
its nearest road side unit. This request is propagated through network
infrastructure to reach a CA cloud and a key is securely returned. A proposed
key revocation mechanism reduced the number of messages needed for revocation
through Certificate Revocation List (CRL) distribution. In this paper,
performance evaluation and security of the proposed dynamic key distribution is
investigated analytically and through network simulation. Furthermore,
extensive analysis is performed to demonstrate how the proposed protocol can
dynamically support efficient and cost-reduced key distribution. Analysis and
performance evaluation results clearly make the case for dynamic key
distribution for PKI-based VANETS.
|
[
{
"version": "v1",
"created": "Mon, 16 May 2016 09:35:16 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Salem",
"Ahmed H.",
""
],
[
"Abdel-Hamid",
"Ayman",
""
],
[
"El-Nasr",
"Mohamad Abou",
""
]
] |
new_dataset
| 0.965795 |
1605.04814
|
Giulio Giaconi
|
Giulio Giaconi and Deniz Gunduz
|
Smart Meter Privacy with Renewable Energy and a Finite Capacity Battery
|
To appear in IEEE SPAWC 2016
| null | null | null |
cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the smart meter (SM) privacy problem by considering the
availability of a renewable energy source (RES) and a battery which can be
exploited by a consumer to partially hide the consumption pattern from the
utility provider (UP). Privacy is measured by the mutual information rate
between the consumer's energy consumption and the renewable energy generation
process, and the energy received from the grid, where the latter is known by
the UP through the SM readings, and the former two are to be kept private. By
expressing the information leakage as an additive quantity, we cast the problem
as a stochastic control problem, and formulate the corresponding Bellman
equations.
|
[
{
"version": "v1",
"created": "Mon, 16 May 2016 15:53:32 GMT"
}
] | 2016-05-17T00:00:00 |
[
[
"Giaconi",
"Giulio",
""
],
[
"Gunduz",
"Deniz",
""
]
] |
new_dataset
| 0.979954 |
1603.00898
|
Emanuele Natale
|
Luciano Gual\`a, Stefano Leucci, Emanuele Natale, Roberto Tauraso
|
Large Peg-Army Maneuvers
|
Conference version
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Despite its long history, the classical game of peg solitaire continues to
attract the attention of the scientific community. In this paper, we consider
two problems with an algorithmic flavour which are related with this game,
namely Solitaire-Reachability and Solitaire-Army. In the first one, we show
that deciding whether there is a sequence of jumps which allows a given initial
configuration of pegs to reach a target position is NP-complete. Regarding
Solitaire-Army, the aim is to successfully deploy an army of pegs in a given
region of the board in order to reach a target position. By solving an
auxiliary problem with relaxed constraints, we are able to answer some open
questions raised by Cs\'ak\'any and Juh\'asz (Mathematics Magazine, 2000). To
appreciate the combinatorial beauty of our solutions, we recommend to visit the
gallery of animations provided at http://solitairearmy.isnphard.com.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 21:31:54 GMT"
},
{
"version": "v2",
"created": "Fri, 13 May 2016 00:50:38 GMT"
}
] | 2016-05-16T00:00:00 |
[
[
"Gualà",
"Luciano",
""
],
[
"Leucci",
"Stefano",
""
],
[
"Natale",
"Emanuele",
""
],
[
"Tauraso",
"Roberto",
""
]
] |
new_dataset
| 0.999402 |
1605.01032
|
Gaye Deegan
|
Frada Burstein, Helana Scheepers, Gaye Deegan
|
Australasian Conference on Information Systems (ACIS) 2015 Proceedings
| null | null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
These proceedings include full papers and research-in-progress papers
presented at the ACIS 2015 Conference in Adelaide, Australia from November 30th
to December 4th, 2015.
|
[
{
"version": "v1",
"created": "Sun, 1 May 2016 23:47:57 GMT"
}
] | 2016-05-16T00:00:00 |
[
[
"Burstein",
"Frada",
""
],
[
"Scheepers",
"Helana",
""
],
[
"Deegan",
"Gaye",
""
]
] |
new_dataset
| 0.995817 |
1605.04098
|
Giovanna Rosone
|
Anthony J. Cox, Fabio Garofalo, Giovanna Rosone, Marinella Sciortino
|
Lightweight LCP Construction for Very Large Collections of Strings
|
This manuscript version is made available under the CC-BY-NC-ND 4.0
license http://creativecommons.org/licenses/by-nc-nd/4.0/ The final version
of this manuscript is in press in Journal of Discrete Algorithms
| null |
10.1016/j.jda.2016.03.003
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The longest common prefix array is a very advantageous data structure that,
combined with the suffix array and the Burrows-Wheeler transform, allows to
efficiently compute some combinatorial properties of a string useful in several
applications, especially in biological contexts. Nowadays, the input data for
many problems are big collections of strings, for instance the data coming from
"next-generation" DNA sequencing (NGS) technologies. In this paper we present
the first lightweight algorithm (called extLCP) for the simultaneous
computation of the longest common prefix array and the Burrows-Wheeler
transform of a very large collection of strings having any length. The
computation is realized by performing disk data accesses only via sequential
scans, and the total disk space usage never needs more than twice the output
size, excluding the disk space required for the input. Moreover, extLCP allows
to compute also the suffix array of the strings of the collection, without any
other further data structure is needed. Finally, we test our algorithm on real
data and compare our results with another tool capable to work in external
memory on large collections of strings.
|
[
{
"version": "v1",
"created": "Fri, 13 May 2016 09:42:10 GMT"
}
] | 2016-05-16T00:00:00 |
[
[
"Cox",
"Anthony J.",
""
],
[
"Garofalo",
"Fabio",
""
],
[
"Rosone",
"Giovanna",
""
],
[
"Sciortino",
"Marinella",
""
]
] |
new_dataset
| 0.968869 |
1509.06693
|
Vishesh Vikas
|
Vishesh Vikas, Eliad Cohen, Rob Grassi, Canberk Sozer and Barry
Trimmer
|
Design and locomotion control of soft robot using friction manipulation
and motor-tendon actuation
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robots built from soft materials can alter their shape and size in a
particular profile. This shape-changing ability could be extremely helpful for
rescue robots and those operating in unknown terrains and environments. In
changing shape, soft materials also store and release elastic energy, a feature
that can be exploited for effective robot movement. However, design and control
of these moving soft robots are non-trivial. The research presents design
methodology for a 3D-printed, motor-tendon actuated soft robot capable of
locomotion. In addition to shape change, the robot uses friction manipulation
mechanisms to effect locomotion. The motor-tendon actuators comprise of nylon
tendons embedded inside the soft body structure along a given path with one end
fixed on the body and the other attached to a motor. These actuators directly
control the deformation of the soft body which influences the robot locomotion
behavior. Static stress analysis is used as a tool for designing the shape of
the paths of these tendons embedded inside the body. The research also presents
a novel model-free learning-based control approach for soft robots which
interact with the environment at discrete contact points. This approach
involves discretization of factors dominating robot-environment interactions as
states, learning of the results as robot transitions between these robot states
and evaluation of desired periodic state control sequences optimizing a cost
function corresponding to a locomotion task (rotation or translation). The
clever discretization allows the framework to exist in robot's task space,
hence, facilitating calculation of control sequences without modeling the
actuator, body material or details of the friction mechanisms. The flexibility
of the framework is experimentally explored by applying it to robots with
different friction mechanisms and different shapes of tendon paths.
|
[
{
"version": "v1",
"created": "Tue, 22 Sep 2015 17:22:07 GMT"
},
{
"version": "v2",
"created": "Thu, 12 May 2016 17:31:08 GMT"
}
] | 2016-05-13T00:00:00 |
[
[
"Vikas",
"Vishesh",
""
],
[
"Cohen",
"Eliad",
""
],
[
"Grassi",
"Rob",
""
],
[
"Sozer",
"Canberk",
""
],
[
"Trimmer",
"Barry",
""
]
] |
new_dataset
| 0.997685 |
1603.06850
|
Przemys{\l}aw Daca
|
Przemys{\l}aw Daca, Thomas A. Henzinger, Andrey Kupriyanov
|
Array Folds Logic
| null | null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an extension to the quantifier-free theory of integer arrays which
allows us to express counting. The properties expressible in Array Folds Logic
(AFL) include statements such as "the first array cell contains the array
length," and "the array contains equally many minimal and maximal elements."
These properties cannot be expressed in quantified fragments of the theory of
arrays, nor in the theory of concatenation. Using reduction to counter
machines, we show that the satisfiability problem of AFL is PSPACE-complete,
and with a natural restriction the complexity decreases to NP. We also show
that adding either universal quantifiers or concatenation leads to
undecidability.
AFL contains terms that fold a function over an array. We demonstrate that
folding, a well-known concept from functional languages, allows us to concisely
summarize loops that count over arrays, which occurs frequently in real-life
programs. We provide a tool that can discharge proof obligations in AFL, and we
demonstrate on practical examples that our decision procedure can solve a broad
range of problems in symbolic testing and program verification.
|
[
{
"version": "v1",
"created": "Tue, 22 Mar 2016 16:10:47 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Mar 2016 19:49:04 GMT"
},
{
"version": "v3",
"created": "Thu, 12 May 2016 14:41:29 GMT"
}
] | 2016-05-13T00:00:00 |
[
[
"Daca",
"Przemysław",
""
],
[
"Henzinger",
"Thomas A.",
""
],
[
"Kupriyanov",
"Andrey",
""
]
] |
new_dataset
| 0.999837 |
1605.03705
|
Marcus Rohrbach
|
Anna Rohrbach, Atousa Torabi, Marcus Rohrbach, Niket Tandon,
Christopher Pal, Hugo Larochelle, Aaron Courville, Bernt Schiele
|
Movie Description
| null | null | null | null |
cs.CV cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Audio Description (AD) provides linguistic descriptions of movies and allows
visually impaired people to follow a movie along with their peers. Such
descriptions are by design mainly visual and thus naturally form an interesting
data source for computer vision and computational linguistics. In this work we
propose a novel dataset which contains transcribed ADs, which are temporally
aligned to full length movies. In addition we also collected and aligned movie
scripts used in prior work and compare the two sources of descriptions. In
total the Large Scale Movie Description Challenge (LSMDC) contains a parallel
corpus of 118,114 sentences and video clips from 202 movies. First we
characterize the dataset by benchmarking different approaches for generating
video descriptions. Comparing ADs to scripts, we find that ADs are indeed more
visual and describe precisely what is shown rather than what should happen
according to the scripts created prior to movie production. Furthermore, we
present and compare the results of several teams who participated in a
challenge organized in the context of the workshop "Describing and
Understanding Video & The Large Scale Movie Description Challenge (LSMDC)", at
ICCV 2015.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2016 07:34:08 GMT"
}
] | 2016-05-13T00:00:00 |
[
[
"Rohrbach",
"Anna",
""
],
[
"Torabi",
"Atousa",
""
],
[
"Rohrbach",
"Marcus",
""
],
[
"Tandon",
"Niket",
""
],
[
"Pal",
"Christopher",
""
],
[
"Larochelle",
"Hugo",
""
],
[
"Courville",
"Aaron",
""
],
[
"Schiele",
"Bernt",
""
]
] |
new_dataset
| 0.999895 |
1605.03779
|
Borzoo Rassouli
|
Borzoo Rassouli and Bruno Clerckx
|
Constant Envelope Signaling in MIMO Channels
|
Submitted to IEEE Trans. on Information Theory July 2015
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity of the point-to-point vector Gaussian channel under the peak
power constraint is not known in general. This paper considers a simpler
scenario in which the input signal vector is forced to have a constant envelope
(or norm). The capacity-achieving distribution for the non-identity $2\times 2$
MIMO channel when the input vector lies on a circle in $\mathbb{R}^2$ is
obtained and is shown to have a finite number of mass points on the circle.
Subsequently, it is shown that the degrees of freedom (DoF) of a full-rank $n$
by $n$ channel with constant envelope signaling is $n-1$ and it can be achieved
by a uniform distribution over the surface of the hypersphere whose radius is
defined by the constant envelope. Finally, for the 2 by 2 channel, the power
allocation scheme of the constant envelope signaling is compared with that of
the conventional case, in which the constraint is on the average transmitted
power. It is observed that when the condition number of the channel is close to
one, both schemes have a similar trend while this is not the case as the
condition number grows.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2016 12:23:23 GMT"
}
] | 2016-05-13T00:00:00 |
[
[
"Rassouli",
"Borzoo",
""
],
[
"Clerckx",
"Bruno",
""
]
] |
new_dataset
| 0.956411 |
1605.03785
|
Stefano Bilotta
|
Stefano Bilotta
|
Variable-length Non-overlapping Codes
| null | null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define a variable-length code having the property that no (non-empty)
prefix of each its codeword is a suffix of any other one, and vice versa. This
kind of code can be seen as an extension of two well-known codes in literature,
called respectively fix-free code and non-overlapping code. In this paper, some
constructive algorithms for such codes are presented as well as numerical
results about their cardinality.
|
[
{
"version": "v1",
"created": "Thu, 12 May 2016 12:44:26 GMT"
}
] | 2016-05-13T00:00:00 |
[
[
"Bilotta",
"Stefano",
""
]
] |
new_dataset
| 0.99921 |
1604.00648
|
Stefano Buzzi
|
Stefano Buzzi and Carmen D'Andrea
|
On Clustered Statistical MIMO Millimeter Wave Channel Simulation
|
4 double-column pages; submitted to IEEE Wireless Communications
Letters, version 2
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of mmWave frequencies is one of the key strategies to achieve the
fascinating 1000x increase in the capacity of future 5G wireless systems. While
for traditional sub-6 GHz cellular frequencies several well-developed
statistical channel models are available for system simulation, similar tools
are not available for mmWave frequencies, thus preventing a fair comparison of
independently developed transmission and reception schemes. In this paper we
provide a simple albeit accurate statistical procedure for the generation of a
clustered MIMO channel model operating at mmWaves, for both the cases of slowly
and rapidly time-varying channels. Matlab scripts for channel generation are
also provided, along with an example of their use.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2016 16:03:34 GMT"
},
{
"version": "v2",
"created": "Wed, 11 May 2016 13:34:46 GMT"
}
] | 2016-05-12T00:00:00 |
[
[
"Buzzi",
"Stefano",
""
],
[
"D'Andrea",
"Carmen",
""
]
] |
new_dataset
| 0.998674 |
1604.05966
|
Tharindu Rathnayake
|
Tharindu Rathnayake, Reza Hoseinnezhad, Ruwan Tennakoon and Alireza
Bab-Hadiashar
|
Labeled Multi-Bernoulli Tracking for Industrial Mobile Platform Safety
|
The conference which this paper was submitted, has rejected this
paper. Thus, we are in the process of enhancing the content of the paper and
submit it to another conference/journal
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a track-before-detect labeled multi-Bernoulli filter
tailored for industrial mobile platform safety applications. We derive two
application specific separable likelihood functions that capture the geometric
shape and colour information of the human targets who are wearing a high
visible vest. These likelihoods are then used in a labeled multi-Bernoulli
filter with a novel two step Bayesian update. Preliminary simulation results
show that the proposed solution can successfully track human workers wearing a
luminous yellow colour vest in an industrial environment.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 14:00:09 GMT"
},
{
"version": "v2",
"created": "Wed, 11 May 2016 00:00:09 GMT"
}
] | 2016-05-12T00:00:00 |
[
[
"Rathnayake",
"Tharindu",
""
],
[
"Hoseinnezhad",
"Reza",
""
],
[
"Tennakoon",
"Ruwan",
""
],
[
"Bab-Hadiashar",
"Alireza",
""
]
] |
new_dataset
| 0.98055 |
1605.03236
|
Kairan Sun
|
Kairan Sun, Huazi Zhang, Dapeng Wu
|
Delay-aware Fountain Codes for Video Streaming with Optimal Sampling
Strategy
|
12 pages, 15 figures
| null | null | null |
cs.MM cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The explosive demand of on-line video from smart mobile devices poses
unprecedented challenges to delivering high quality of experience (QoE) over
wireless networks. Streaming high-definition video with low delay is difficult
mainly due to (i) the stochastic nature of wireless channels and (ii) the
fluctuating videos bit rate. To address this, we propose a novel delay-aware
fountain coding (DAF) technique that integrates channel coding and video
coding. In this paper, we reveal that the fluctuation of video bit rate can
also be exploited to further improve fountain codes for wireless video
streaming. Specifically, we develop two coding techniques: the time-based
sliding window and the optimal window-wise sampling strategy. By adaptively
selecting the window length and optimally adjusting the sampling pattern
according to the ongoing video bit rate, the proposed schemes deliver
significantly higher video quality than existing schemes, with low delay and
constant data rate. To validate our design, we implement the protocols of DAF,
DAF-L (a low-complexity version) and the existing delay-aware video streaming
schemes by streaming H.264/AVC standard videos over an 802.11b network on CORE
emulation platform. The results show that the decoding ratio of our scheme is
15% to 100% higher than the state of the art techniques.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 22:55:04 GMT"
}
] | 2016-05-12T00:00:00 |
[
[
"Sun",
"Kairan",
""
],
[
"Zhang",
"Huazi",
""
],
[
"Wu",
"Dapeng",
""
]
] |
new_dataset
| 0.980824 |
1605.03261
|
Junpei Zhong
|
Junpei Zhong and Martin Peniak and Jun Tani and Tetsuya Ogata and
Angelo Cangelosi
|
Sensorimotor Input as a Language Generalisation Tool: A Neurorobotics
Model for Generation and Generalisation of Noun-Verb Combinations with
Sensorimotor Inputs
|
Submitted to Autonomous Robots
| null | null | null |
cs.RO cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a neurorobotics cognitive model to explain the
understanding and generalisation of nouns and verbs combinations when a vocal
command consisting of a verb-noun sentence is provided to a humanoid robot.
This generalisation process is done via the grounding process: different
objects are being interacted, and associated, with different motor behaviours,
following a learning approach inspired by developmental language acquisition in
infants. This cognitive model is based on Multiple Time-scale Recurrent Neural
Networks (MTRNN).With the data obtained from object manipulation tasks with a
humanoid robot platform, the robotic agent implemented with this model can
ground the primitive embodied structure of verbs through training with
verb-noun combination samples. Moreover, we show that a functional hierarchical
architecture, based on MTRNN, is able to generalise and produce novel
combinations of noun-verb sentences. Further analyses of the learned network
dynamics and representations also demonstrate how the generalisation is
possible via the exploitation of this functional hierarchical recurrent
network.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2016 02:31:21 GMT"
}
] | 2016-05-12T00:00:00 |
[
[
"Zhong",
"Junpei",
""
],
[
"Peniak",
"Martin",
""
],
[
"Tani",
"Jun",
""
],
[
"Ogata",
"Tetsuya",
""
],
[
"Cangelosi",
"Angelo",
""
]
] |
new_dataset
| 0.998342 |
1605.03353
|
Sarbajit Manna
|
Sarbajit Manna, Saurabh Dutta
|
Proposing A Symmetric Key Bit-Level Block Cipher
|
arXiv admin note: substantial text overlap with arXiv:1605.02954
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-sa/4.0/
|
A novel bit level block cipher based symmetric key cryptographic technique
using G.C.D is proposed in this research paper. Entire plain text file is read
one character at a time and according to the binary representation of ASCII
value of the characters, entire plain text file is divided into n number of 16
bit blocks. Then an agreed-upon symmetric key file is formed by dividing each
16 bit block into two 8 bit sub blocks and by using Greatest Common Divisor
(G.C.D) operation among them. The key size is 40 times the number of 16 bit
blocks present in the plain text file as each block produces a key of size 40
bits. The character corresponding to the G.C.D value for each block is stored
in the cipher text file which is sent by the sender to the receiver along with
the symmetric key file. From the symmetric key file and the cipher text file,
the receiver by applying reverse procedure, gets back the original plain text
file. This technique has several merits, some of them are formation of
symmetric key file dynamically, achievement of 50% compression rate in the
cipher text file, better security in terms of brute force attack and
applicability of the technique for a large number of files of different size
and type.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2016 09:44:10 GMT"
}
] | 2016-05-12T00:00:00 |
[
[
"Manna",
"Sarbajit",
""
],
[
"Dutta",
"Saurabh",
""
]
] |
new_dataset
| 0.981595 |
1605.03460
|
Bocong Chen
|
Bocong Chen, Liren Lin and Hongwei Liu
|
Constacyclic symbol-pair codes: lower bounds and optimal constructions
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Symbol-pair codes introduced by Cassuto and Blaum (2010) are designed to
protect against pair errors in symbol-pair read channels. The higher the
minimum pair distance, the more pair errors the code can correct. MDS
symbol-pair codes are optimal in the sense that pair distance cannot be
improved for given length and code size. The contribution of this paper is
twofold. First we present three lower bounds for the minimum pair distance of
constacyclic codes, the first two of which generalize the previously known
results due to Cassuto and Blaum (2011) and Kai {\it et al.} (2015). The third
one exhibits a lower bound for the minimum pair distance of repeated-root
cyclic codes. Second we obtain new MDS symbol-pair codes with minimum pair
distance seven and eight through repeated-root cyclic codes.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2016 14:38:47 GMT"
}
] | 2016-05-12T00:00:00 |
[
[
"Chen",
"Bocong",
""
],
[
"Lin",
"Liren",
""
],
[
"Liu",
"Hongwei",
""
]
] |
new_dataset
| 0.999827 |
1605.03560
|
Nikolaus Hansen
|
Nikolaus Hansen, Anne Auger, Dimo Brockhoff, Dejan Tu\v{s}ar, Tea
Tu\v{s}ar
|
COCO: Performance Assessment
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an any-time performance assessment for benchmarking numerical
optimization algorithms in a black-box scenario, applied within the COCO
benchmarking platform. The performance assessment is based on runtimes measured
in number of objective function evaluations to reach one or several quality
indicator target values. We argue that runtime is the only available measure
with a generic, meaningful, and quantitative interpretation. We discuss the
choice of the target values, runlength-based targets, and the aggregation of
results by using simulated restarts, averages, and empirical distribution
functions.
|
[
{
"version": "v1",
"created": "Wed, 11 May 2016 19:49:43 GMT"
}
] | 2016-05-12T00:00:00 |
[
[
"Hansen",
"Nikolaus",
""
],
[
"Auger",
"Anne",
""
],
[
"Brockhoff",
"Dimo",
""
],
[
"Tušar",
"Dejan",
""
],
[
"Tušar",
"Tea",
""
]
] |
new_dataset
| 0.998233 |
1605.02304
|
Dr. Zubair Asghar
|
Muhammad Zubair Asghar, Ammara Habib, Anam Habib, Syeda Rabail Zahra,
Sadia Ismail
|
AndorEstimator: Android based Software Cost Estimation Application
|
11 pages, 22 figures, International Journal of Computer Science and
Information Security (IJCSIS),Vol. 14, No. 4, April 2016
|
International Journal of Computer Science and Information Security
(IJCSIS), Vol. 14, No. 4, April 2016
| null | null |
cs.CY cs.SE
|
http://creativecommons.org/licenses/by/4.0/
|
The main aim of the proposed system is to assist the software development
team to estimate the cost, effort and maintenance of the project under
development. Android-based platform, namely MIT App Inventor is used for the
development of application, which contains visual block programming language.
The current study has following uniqueness of (1)Accuracy of results,(2)user
friendly environment(3)no such application is available on android platform to
the best of our knowledge. Questionnaire regarding CoCoMo model is developed
and circulated by using objective qualitative method. Findings: The estimation
module of our application is quite important with respect to facilitating the
students of software engineering for performing CoCoMo-based cost estimation
easily, and enabling the software developers for performing software cost
estimation easily. The cost estimator based on CoCoMo model is developed on
android platform however, to the best of our knowledge no such application is
available. This system can be used by business and educational stakeholders,
such as students, software developers, and business organizations
|
[
{
"version": "v1",
"created": "Sun, 8 May 2016 10:15:48 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Asghar",
"Muhammad Zubair",
""
],
[
"Habib",
"Ammara",
""
],
[
"Habib",
"Anam",
""
],
[
"Zahra",
"Syeda Rabail",
""
],
[
"Ismail",
"Sadia",
""
]
] |
new_dataset
| 0.98959 |
1605.02815
|
Youming Qiao
|
Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao
|
Boundaries of VP and VNP
|
31 pages. A preliminary version of this paper appears in ICALP 2016
| null | null | null |
cs.CC math.AG math.CO math.RT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One fundamental question in the context of the geometric complexity theory
approach to the VP vs. VNP conjecture is whether VP = $\overline{\textrm{VP}}$,
where VP is the class of families of polynomials that are of polynomial degree
and can be computed by arithmetic circuits of polynomial size, and
$\overline{\textrm{VP}}$ is the class of families of polynomials that are of
polynomial degree and can be approximated infinitesimally closely by arithmetic
circuits of polynomial size. The goal of this article is to study the
conjecture in (Mulmuley, FOCS 2012) that $\overline{\textrm{VP}}$ is not
contained in VP.
Towards that end, we introduce three degenerations of VP (i.e., sets of
points in $\overline{\textrm{VP}}$), namely the stable degeneration Stable-VP,
the Newton degeneration Newton-VP, and the p-definable one-parameter
degeneration VP*. We also introduce analogous degenerations of VNP. We show
that Stable-VP $\subseteq$ Newton-VP $\subseteq$ VP* $\subseteq$ VNP, and
Stable-VNP = Newton-VNP = VNP* = VNP. The three notions of degenerations and
the proof of this result shed light on the problem of separating
$\overline{\textrm{VP}}$ from VP.
Although we do not yet construct explicit candidates for the polynomial
families in $\overline{\textrm{VP}}\setminus$VP, we prove results which tell us
where not to look for such families. Specifically, we demonstrate that the
families in Newton-VP $\setminus$ VP based on semi-invariants of quivers would
have to be non-generic by showing that, for many finite quivers (including some
wild ones), any Newton degeneration of a generic semi-invariant can be computed
by a circuit of polynomial size. We also show that the Newton degenerations of
perfect matching Pfaffians, monotone arithmetic circuits over the reals, and
Schur polynomials have polynomial-size circuits.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 01:06:40 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Grochow",
"Joshua A.",
""
],
[
"Mulmuley",
"Ketan D.",
""
],
[
"Qiao",
"Youming",
""
]
] |
new_dataset
| 0.995645 |
1605.02860
|
Fahmida Aseez
|
Fahmida Aseez and Sheena Mathew
|
Hierarchical Partition-Based Anonymous Routing Protocol(HPAR) in Manet
for Efficient and Secure Transmission
|
8 pages, 5 figues
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anonymous routing protocols are used in MANET's to hide the nodes from
outsiders in order to protect from various attacks. HPAR partitions the network
area dynamically into zones and chooses nodes in zones randomly as intermediate
relay nodes .This relay nodes help in secure routing. In HPAR anonymity
protection is given to source, destination and route. HPAR have low cost and
provide high level of protection. It has techniques to counter various attacks.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 05:40:35 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Aseez",
"Fahmida",
""
],
[
"Mathew",
"Sheena",
""
]
] |
new_dataset
| 0.99726 |
1605.02892
|
Marco Bertini
|
Simone Ercoli, Marco Bertini and Alberto Del Bimbo
|
Compact Hash Codes for Efficient Visual Descriptors Retrieval in Large
Scale Databases
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present an efficient method for visual descriptors retrieval
based on compact hash codes computed using a multiple k-means assignment. The
method has been applied to the problem of approximate nearest neighbor (ANN)
search of local and global visual content descriptors, and it has been tested
on different datasets: three large scale public datasets of up to one billion
descriptors (BIGANN) and, supported by recent progress in convolutional neural
networks (CNNs), also on the CIFAR-10 and MNIST datasets. Experimental results
show that, despite its simplicity, the proposed method obtains a very high
performance that makes it superior to more complex state-of-the-art methods.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 08:53:04 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Ercoli",
"Simone",
""
],
[
"Bertini",
"Marco",
""
],
[
"Del Bimbo",
"Alberto",
""
]
] |
new_dataset
| 0.999233 |
1605.03012
|
Fang Lu
|
Fang Lu and Fa Wu and Peijun Hu and Zhiyi Peng and Dexing Kong
|
Automatic 3D liver location and segmentation via convolutional neural
networks and graph cut
|
12 pages, 12 figures, 4 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purpose Segmentation of the liver from abdominal computed tomography (CT)
image is an essential step in some computer assisted clinical interventions,
such as surgery planning for living donor liver transplant (LDLT), radiotherapy
and volume measurement. In this work, we develop a deep learning algorithm with
graph cut refinement to automatically segment liver in CT scans. Methods The
proposed method consists of two main steps: (i) simultaneously liver detection
and probabilistic segmentation using 3D convolutional neural networks (CNNs);
(ii) accuracy refinement of initial segmentation with graph cut and the
previously learned probability map. Results The proposed approach was validated
on forty CT volumes taken from two public databases MICCAI-Sliver07 and
3Dircadb. For the MICCAI-Sliver07 test set, the calculated mean ratios of
volumetric overlap error (VOE), relative volume difference (RVD), average
symmetric surface distance (ASD), root mean square symmetric surface distance
(RMSD) and maximum symmetric surface distance (MSD) are 5.9%, 2.7%, 0.91%, 1.88
mm, and 18.94 mm, respectively. In the case of 20 3Dircadb data, the calculated
mean ratios of VOE, RVD, ASD, RMSD and MSD are 9.36%, 0.97%, 1.89%, 4.15 mm and
33.14 mm, respectively. Conclusion The proposed method is fully automatic
without any user interaction. Quantitative results reveal that the proposed
approach is efficient and accurate for hepatic volume estimation in a clinical
setup. The high correlation between the automatic and manual references shows
that the proposed method can be good enough to replace the time-consuming and
non-reproducible manual segmentation method.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 13:42:51 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Lu",
"Fang",
""
],
[
"Wu",
"Fa",
""
],
[
"Hu",
"Peijun",
""
],
[
"Peng",
"Zhiyi",
""
],
[
"Kong",
"Dexing",
""
]
] |
new_dataset
| 0.967088 |
1605.03036
|
Salman Faraji
|
Salman Faraji and Auke J. Ijspeert
|
3LP: a linear 3D-walking model including torso and swing dynamics
|
Journal paper under review
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a new model of biped locomotion which is composed
of three linear pendulums (one per leg and one for the whole upper body) to
describe stance, swing and torso dynamics. In addition to double support, this
model has different actuation possibilities in the swing hip and stance ankle
which could be widely used to produce different walking gaits. Without the need
for numerical time-integration, closed-form solutions help finding periodic
gaits which could be simply scaled in certain dimensions to modulate the motion
online. Thanks to linearity properties, the proposed model can provide a
computationally fast platform for model predictive controllers to predict the
future and consider meaningful inequality constraints to ensure feasibility of
the motion. Such property is coming from describing dynamics with joint torques
directly and therefore, reflecting hardware limitations more precisely, even in
the very abstract high level template space. The proposed model produces
human-like torque and ground reaction force profiles and thus, compared to
point-mass models, it is more promising for precise control of humanoid robots.
Despite being linear and lacking many other features of human walking like CoM
excursion, knee flexion and ground clearance, we show that the proposed model
can predict one of the main optimality trends in human walking, i.e. nonlinear
speed-frequency relationship. In this paper, we mainly focus on describing the
model and its capabilities, comparing it with human data and calculating
optimal human gait variables. Setting up control problems and advanced
biomechanical analysis still remain for future works.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 14:38:53 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Faraji",
"Salman",
""
],
[
"Ijspeert",
"Auke J.",
""
]
] |
new_dataset
| 0.998381 |
1605.03039
|
Salman Faraji
|
Salman Faraji and Auke J. Ijspeert
|
A new time-projecting controller based on 3LP model to recover
intermittent pushes
|
Journal paper under review
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a new walking controller based on 3LP model. Taking
advantage of linear equations and closed-form solutions of 3LP, the proposed
controller can project the state of the robot at any time during the phase back
to a certain event for which, a discrete LQR controller is designed. After the
projection, a proper control policy is generated by the expert discrete
controller and used online. This projecting architecture reacts to disturbances
with minimal delay and compared to discrete controllers, it provides superior
performance in recovering intermittent external pushes. Further analysis of
closed-loop eigenvalues and disturbance rejection shows that the proposed
time-projecting controller has strong stabilization properties. Controllable
regions also show that the projecting architecture covers most of the maximal
controllable set of states. It is computationally much faster than model
predictive controllers, but still optimal.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 14:55:12 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Faraji",
"Salman",
""
],
[
"Ijspeert",
"Auke J.",
""
]
] |
new_dataset
| 0.988688 |
1605.03096
|
Xuezhi Yang
|
Xuezhi Yang
|
On the Capacity Region of Multiple Access Channel
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity region of a multiple access channel is discussed. It was found
that orthogonal multiple access and non orthogonal multiple access have the
same capacity region under the constraint of same sum power.
|
[
{
"version": "v1",
"created": "Sat, 7 May 2016 03:01:13 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Yang",
"Xuezhi",
""
]
] |
new_dataset
| 0.966166 |
1605.03116
|
Ethan Rudd
|
Ethan M. Rudd and Terrance E. Boult
|
CALIPER: Continuous Authentication Layered with Integrated PKI Encoding
Recognition
|
Accepted to CVPR 2016 Biometrics Workshop
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Architectures relying on continuous authentication require a secure way to
challenge the user's identity without trusting that the Continuous
Authentication Subsystem (CAS) has not been compromised, i.e., that the
response to the layer which manages service/application access is not fake. In
this paper, we introduce the CALIPER protocol, in which a separate Continuous
Access Verification Entity (CAVE) directly challenges the user's identity in a
continuous authentication regime. Instead of simply returning authentication
probabilities or confidence scores, CALIPER's CAS uses live hard and soft
biometric samples from the user to extract a cryptographic private key embedded
in a challenge posed by the CAVE. The CAS then uses this key to sign a response
to the CAVE. CALIPER supports multiple modalities, key lengths, and security
levels and can be applied in two scenarios: One where the CAS must authenticate
its user to a CAVE running on a remote server (device-server) for access to
remote application data, and another where the CAS must authenticate its user
to a locally running trusted computing module (TCM) for access to local
application data (device-TCM). We further demonstrate that CALIPER can leverage
device hardware resources to enable privacy and security even when the device's
kernel is compromised, and we show how this authentication protocol can even be
expanded to obfuscate direct kernel object manipulation (DKOM) malwares.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 17:33:02 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Rudd",
"Ethan M.",
""
],
[
"Boult",
"Terrance E.",
""
]
] |
new_dataset
| 0.981314 |
1605.03150
|
Yasamin Alkhorshid
|
Yasamin Alkhorshid, Kamelia Aryafar, Sven Bauer, and Gerd Wanielik
|
Road Detection through Supervised Classification
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous driving is a rapidly evolving technology. Autonomous vehicles are
capable of sensing their environment and navigating without human input through
sensory information such as radar, lidar, GNSS, vehicle odometry, and computer
vision. This sensory input provides a rich dataset that can be used in
combination with machine learning models to tackle multiple problems in
supervised settings. In this paper we focus on road detection through
gray-scale images as the sole sensory input. Our contributions are twofold:
first, we introduce an annotated dataset of urban roads for machine learning
tasks; second, we introduce a road detection framework on this dataset through
supervised classification and hand-crafted feature vectors.
|
[
{
"version": "v1",
"created": "Tue, 10 May 2016 18:53:09 GMT"
}
] | 2016-05-11T00:00:00 |
[
[
"Alkhorshid",
"Yasamin",
""
],
[
"Aryafar",
"Kamelia",
""
],
[
"Bauer",
"Sven",
""
],
[
"Wanielik",
"Gerd",
""
]
] |
new_dataset
| 0.998785 |
1408.6927
|
Olli Pottonen
|
Denis S. Krotov, Patric R. J. \"Osterg{\aa}rd, Olli Pottonen
|
Non-existence of a ternary constant weight $(16, 5, 15; 2048)$ diameter
perfect code
|
9 pages. Submitted for publication
|
Adv. Math. Commun. 10(2) 2016, 393-399
|
10.3934/amc.2016013
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ternary constant weight codes of length $n=2^m$, weight $n-1$, cardinality
$2^n$ and distance $5$ are known to exist for every $m$ for which there exists
an APN permutation of order $2^m$, that is, at least for all odd $m \geq 3$ and
for $m=6$. We show the non-existence of such codes for $m=4$ and prove that any
codes with the parameters above are diameter perfect.
|
[
{
"version": "v1",
"created": "Fri, 29 Aug 2014 06:06:30 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Krotov",
"Denis S.",
""
],
[
"Östergård",
"Patric R. J.",
""
],
[
"Pottonen",
"Olli",
""
]
] |
new_dataset
| 0.995561 |
1511.04285
|
Fredrik Jansson
|
Fredrik Jansson, Matthew Hartley, Martin Hinsch, Ivica Slavkov,
Noem\'i Carranza, Tjelvar S. G. Olsson, Roland M. Dries, Johanna H.
Gr\"onqvist, Athanasius F. M. Mar\'ee, James Sharpe, Jaap A. Kaandorp,
Ver\^onica A. Grieneisen
|
Kilombo: a Kilobot simulator to enable effective research in swarm
robotics
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Kilobot is a widely used platform for investigation of swarm robotics.
Physical Kilobots are slow moving and require frequent recalibration and
charging, which significantly slows down the development cycle. Simulators can
speed up the process of testing, exploring and hypothesis generation, but
usually require time consuming and error-prone translation of code between
simulator and robot. Moreover, code of different nature often obfuscates direct
comparison, as well as determination of the cause of deviation, between
simulator and actual robot swarm behaviour. To tackle these issues we have
developed a C-based simulator that allows those working with Kilobots to use
the same programme code in both the simulator and the physical robots. Use of
our simulator, coined Kilombo, significantly simplifies and speeds up
development, given that a simulation of 1000 robots can be run at a speed 100
times faster than real time on a desktop computer, making high-throughput
pre-screening possible of potential algorithms that could lead to desired
emergent behaviour. We argue that this strategy, here specifically developed
for Kilobots, is of general importance for effective robot swarm research. The
source code is freely available under the MIT license.
|
[
{
"version": "v1",
"created": "Fri, 13 Nov 2015 14:11:31 GMT"
},
{
"version": "v2",
"created": "Mon, 9 May 2016 12:38:44 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Jansson",
"Fredrik",
""
],
[
"Hartley",
"Matthew",
""
],
[
"Hinsch",
"Martin",
""
],
[
"Slavkov",
"Ivica",
""
],
[
"Carranza",
"Noemí",
""
],
[
"Olsson",
"Tjelvar S. G.",
""
],
[
"Dries",
"Roland M.",
""
],
[
"Grönqvist",
"Johanna H.",
""
],
[
"Marée",
"Athanasius F. M.",
""
],
[
"Sharpe",
"James",
""
],
[
"Kaandorp",
"Jaap A.",
""
],
[
"Grieneisen",
"Verônica A.",
""
]
] |
new_dataset
| 0.998088 |
1605.00176
|
Pranav Sakulkar
|
Pranav Sakulkar and Bhaskar Krishnamachari
|
Stochastic Contextual Bandits with Known Reward Functions
|
A version of this technical report is under submission in IEEE/ACM
Transactions on Networking
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many sequential decision-making problems in communication networks can be
modeled as contextual bandit problems, which are natural extensions of the
well-known multi-armed bandit problem. In contextual bandit problems, at each
time, an agent observes some side information or context, pulls one arm and
receives the reward for that arm. We consider a stochastic formulation where
the context-reward tuples are independently drawn from an unknown distribution
in each trial. Motivated by networking applications, we analyze a setting where
the reward is a known non-linear function of the context and the chosen arm's
current state. We first consider the case of discrete and finite context-spaces
and propose DCB($\epsilon$), an algorithm that we prove, through a careful
analysis, yields regret (cumulative reward gap compared to a distribution-aware
genie) scaling logarithmically in time and linearly in the number of arms that
are not optimal for any context, improving over existing algorithms where the
regret scales linearly in the total number of arms. We then study continuous
context-spaces with Lipschitz reward functions and propose CCB($\epsilon,
\delta$), an algorithm that uses DCB($\epsilon$) as a subroutine.
CCB($\epsilon, \delta$) reveals a novel regret-storage trade-off that is
parametrized by $\delta$. Tuning $\delta$ to the time horizon allows us to
obtain sub-linear regret bounds, while requiring sub-linear storage. By
exploiting joint learning for all contexts we get regret bounds for
CCB($\epsilon, \delta$) that are unachievable by any existing contextual bandit
algorithm for continuous context-spaces. We also show similar performance
bounds for the unknown horizon case.
|
[
{
"version": "v1",
"created": "Sat, 30 Apr 2016 22:16:22 GMT"
},
{
"version": "v2",
"created": "Fri, 6 May 2016 20:32:36 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Sakulkar",
"Pranav",
""
],
[
"Krishnamachari",
"Bhaskar",
""
]
] |
new_dataset
| 0.998524 |
1605.02175
|
Yonglong Li
|
Yonglong Li and Guangyue Han
|
Asymptotics of Input-Constrained Erasure Channel Capacity
|
Submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we examine an input-constrained erasure channel and we
characterize the asymptotics of its capacity when the erasure rate is low. More
specifically, for a general memoryless erasure channel with its input supported
on an irreducible finite-type constraint, we derive partial asymptotics of its
capacity, using some series expansion type formulas of its mutual information
rate; and for a binary erasure channel with its first-order Markovian input
supported on the $(1, \infty)$-RLL constraint, based on the concavity of its
mutual information rate with respect to some parameterization of the input, we
numerically evaluate its first-order Markov capacity and further derive its
full asymptotics. The asymptotics obtained in this paper, when compared with
the recently derived feedback capacity for a binary erasure channel with the
same input constraint, enable us to draw the conclusion that feedback may
increase the capacity of an input-constrained channel, even if the channel is
memoryless.
|
[
{
"version": "v1",
"created": "Sat, 7 May 2016 11:42:26 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Li",
"Yonglong",
""
],
[
"Han",
"Guangyue",
""
]
] |
new_dataset
| 0.995333 |
1605.02196
|
Peter Radecki
|
Peter Radecki, Mark Campbell and Kevin Matzen
|
All Weather Perception: Joint Data Association, Tracking, and
Classification for Autonomous Ground Vehicles
|
35 pages, 21 figures, 14 tables
| null | null | null |
cs.SY cs.CV cs.LG cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel probabilistic perception algorithm is presented as a real-time joint
solution to data association, object tracking, and object classification for an
autonomous ground vehicle in all-weather conditions. The presented algorithm
extends a Rao-Blackwellized Particle Filter originally built with a particle
filter for data association and a Kalman filter for multi-object tracking
(Miller et al. 2011a) to now also include multiple model tracking for
classification. Additionally a state-of-the-art vision detection algorithm that
includes heading information for autonomous ground vehicle (AGV) applications
was implemented. Cornell's AGV from the DARPA Urban Challenge was upgraded and
used to experimentally examine if and how state-of-the-art vision algorithms
can complement or replace lidar and radar sensors. Sensor and algorithm
performance in adverse weather and lighting conditions is tested. Experimental
evaluation demonstrates robust all-weather data association, tracking, and
classification where camera, lidar, and radar sensors complement each other
inside the joint probabilistic perception algorithm.
|
[
{
"version": "v1",
"created": "Sat, 7 May 2016 14:36:34 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Radecki",
"Peter",
""
],
[
"Campbell",
"Mark",
""
],
[
"Matzen",
"Kevin",
""
]
] |
new_dataset
| 0.970211 |
1605.02317
|
Shirin Saeedi Bidokhti
|
Shirin Saeedi Bidokhti and Mich\`ele Wigger and Roy Timo
|
Noisy Broadcast Networks with Receiver Caching
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study noisy broadcast networks with local cache memories at the receivers,
where the transmitter can pre-store information even before learning the
receivers' requests. We mostly focus on packet-erasure broadcast networks with
two disjoint sets of receivers: a set of weak receivers with all-equal erasure
probabilities and equal cache sizes and a set of strong receivers with
all-equal erasure probabilities and no cache memories. We present lower and
upper bounds on the capacity-memory tradeoff of this network. The lower bound
is achieved by a new joint cache-channel coding idea and significantly improves
on schemes that are based on separate cache-channel coding. We discuss how this
coding idea could be extended to more general discrete memoryless broadcast
channels and to unequal cache sizes. Our upper bound holds for all
stochastically degraded broadcast channels.
For the described packet-erasure broadcast network, our lower and upper
bounds are tight when there is a single weak receiver (and any number of strong
receivers) and the cache memory size does not exceed a given threshold. When
there are a single weak receiver, a single strong receiver, and two files, then
we can strengthen our upper and lower bounds so as they coincide over a wide
regime of cache sizes.
Finally, we completely characterise the rate-memory tradeoff for general
discrete-memoryless broadcast channels with arbitrary cache memory sizes and
arbitrary (asymmetric) rates when all receivers always demand exactly the same
file.
|
[
{
"version": "v1",
"created": "Sun, 8 May 2016 12:44:21 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Bidokhti",
"Shirin Saeedi",
""
],
[
"Wigger",
"Michèle",
""
],
[
"Timo",
"Roy",
""
]
] |
new_dataset
| 0.958593 |
1605.02457
|
Tobias Kuhn
|
Tobias Kuhn
|
The Controlled Natural Language of Randall Munroe's Thing Explainer
| null |
Proceedings of the Fifth Workshop on Controlled Natural Language
(CNL 2016), Springer 2016
| null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
It is rare that texts or entire books written in a Controlled Natural
Language (CNL) become very popular, but exactly this has happened with a book
that has been published last year. Randall Munroe's Thing Explainer uses only
the 1'000 most often used words of the English language together with drawn
pictures to explain complicated things such as nuclear reactors, jet engines,
the solar system, and dishwashers. This restricted language is a very
interesting new case for the CNL community. I describe here its place in the
context of existing approaches on Controlled Natural Languages, and I provide a
first analysis from a scientific perspective, covering the word production
rules and word distributions.
|
[
{
"version": "v1",
"created": "Mon, 9 May 2016 07:48:40 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Kuhn",
"Tobias",
""
]
] |
new_dataset
| 0.999189 |
1605.02559
|
Olivier Colliot
|
Linda Marrakchi-Kacem (ARAMIS), Alexandre Vignaud (NEUROSPIN), Julien
Sein (CRMBM), Johanne Germain (ARAMIS), Thomas R Henry (CMRR), Cyril Poupon
(NEUROSPIN), Lucie Hertz-Pannier, St\'ephane Leh\'ericy (CENIR, ICM), Olivier
Colliot (ARAMIS, ICM), Pierre-Fran\c{c}ois Van de Moortele (CMRR), Marie
Chupin (ARAMIS, ICM)
|
Robust imaging of hippocampal inner structure at 7T: in vivo acquisition
protocol and methodological choices
| null |
Magnetic Resonance Materials in Physics, Biology and Medicine,
Springer Verlag, 2016
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
OBJECTIVE:Motion-robust multi-slab imaging of hippocampal inner structure in
vivo at 7T.MATERIALS AND METHODS:Motion is a crucial issue for ultra-high
resolution imaging, such as can be achieved with 7T MRI. An acquisition
protocol was designed for imaging hippocampal inner structure at 7T. It relies
on a compromise between anatomical details visibility and robustness to motion.
In order to reduce acquisition time and motion artifacts, the full slab
covering the hippocampus was split into separate slabs with lower acquisition
time. A robust registration approach was implemented to combine the acquired
slabs within a final 3D-consistent high-resolution slab covering the whole
hippocampus. Evaluation was performed on 50 subjects overall, made of three
groups of subjects acquired using three acquisition settings; it focused on
three issues: visibility of hippocampal inner structure, robustness to motion
artifacts and registration procedure performance.RESULTS:Overall, T2-weighted
acquisitions with interleaved slabs proved robust. Multi-slab registration
yielded high quality datasets in 96 % of the subjects, thus compatible with
further analyses of hippocampal inner structure.CONCLUSION:Multi-slab
acquisition and registration setting is efficient for reducing acquisition time
and consequently motion artifacts for ultra-high resolution imaging of the
inner structure of the hippocampus.
|
[
{
"version": "v1",
"created": "Mon, 9 May 2016 12:38:44 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Marrakchi-Kacem",
"Linda",
"",
"ARAMIS"
],
[
"Vignaud",
"Alexandre",
"",
"NEUROSPIN"
],
[
"Sein",
"Julien",
"",
"CRMBM"
],
[
"Germain",
"Johanne",
"",
"ARAMIS"
],
[
"Henry",
"Thomas R",
"",
"CMRR"
],
[
"Poupon",
"Cyril",
"",
"NEUROSPIN"
],
[
"Hertz-Pannier",
"Lucie",
"",
"CENIR, ICM"
],
[
"Lehéricy",
"Stéphane",
"",
"CENIR, ICM"
],
[
"Colliot",
"Olivier",
"",
"ARAMIS, ICM"
],
[
"Van de Moortele",
"Pierre-François",
"",
"CMRR"
],
[
"Chupin",
"Marie",
"",
"ARAMIS, ICM"
]
] |
new_dataset
| 0.994519 |
1605.02628
|
Fenix Huang
|
Fenix W.D. Huang and Christian M. Reidys
|
Topological language for RNA
|
29 pages, 13 figures, 1 table
| null | null | null |
cs.FL q-bio.BM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a novel, context-free grammar, {\it
RNAFeatures$^*$}, capable of generating any RNA structure including pseudoknot
structures (pk-structure). We represent pk-structures as orientable fatgraphs,
which naturally leads to a filtration by their topological genus. Within this
framework, RNA secondary structures correspond to pk-structures of genus zero.
{\it RNAFeatures$^*$} acts on formal, arc-labeled RNA secondary structures,
called $\lambda$-structures. $\lambda$-structures correspond one-to-one to
pk-structures together with some additional information. This information
consists of the specific rearrangement of the backbone, by which a pk-structure
can be made cross-free. {\it RNAFeatures$^*$} is an extension of the grammar
for secondary structures and employs an enhancement by labelings of the symbols
as well as the production rules. We discuss how to use {\it RNAFeatures$^*$} to
obtain a stochastic context-free grammar for pk-structures, using data of RNA
sequences and structures. The induced grammar facilitates fast Boltzmann
sampling and statistical analysis. As a first application, we present an $O(n
log(n))$ runtime algorithm which samples pk-structures based on ninety tRNA
sequences and structures from the Nucleic Acid Database (NDB).
|
[
{
"version": "v1",
"created": "Mon, 9 May 2016 15:44:59 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"Huang",
"Fenix W. D.",
""
],
[
"Reidys",
"Christian M.",
""
]
] |
new_dataset
| 0.998205 |
1605.02677
|
Quanzeng You
|
Quanzeng You, Jiebo Luo, Hailin Jin, Jianchao Yang
|
Building a Large Scale Dataset for Image Emotion Recognition: The Fine
Print and The Benchmark
|
7 pages, 7 figures, AAAI 2016
| null | null | null |
cs.AI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Psychological research results have confirmed that people can have different
emotional reactions to different visual stimuli. Several papers have been
published on the problem of visual emotion analysis. In particular, attempts
have been made to analyze and predict people's emotional reaction towards
images. To this end, different kinds of hand-tuned features are proposed. The
results reported on several carefully selected and labeled small image data
sets have confirmed the promise of such features. While the recent successes of
many computer vision related tasks are due to the adoption of Convolutional
Neural Networks (CNNs), visual emotion analysis has not achieved the same level
of success. This may be primarily due to the unavailability of confidently
labeled and relatively large image data sets for visual emotion analysis. In
this work, we introduce a new data set, which started from 3+ million weakly
labeled images of different emotions and ended up 30 times as large as the
current largest publicly available visual emotion data set. We hope that this
data set encourages further research on visual emotion analysis. We also
perform extensive benchmarking analyses on this large data set using the state
of the art methods including CNNs.
|
[
{
"version": "v1",
"created": "Mon, 9 May 2016 18:14:52 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"You",
"Quanzeng",
""
],
[
"Luo",
"Jiebo",
""
],
[
"Jin",
"Hailin",
""
],
[
"Yang",
"Jianchao",
""
]
] |
new_dataset
| 0.999672 |
1605.02688
|
Simon Lefrancois
|
The Theano Development Team: Rami Al-Rfou, Guillaume Alain, Amjad
Almahairi, Christof Angermueller, Dzmitry Bahdanau, Nicolas Ballas,
Fr\'ed\'eric Bastien, Justin Bayer, Anatoly Belikov, Alexander Belopolsky,
Yoshua Bengio, Arnaud Bergeron, James Bergstra, Valentin Bisson, Josh
Bleecher Snyder, Nicolas Bouchard, Nicolas Boulanger-Lewandowski, Xavier
Bouthillier, Alexandre de Br\'ebisson, Olivier Breuleux, Pierre-Luc Carrier,
Kyunghyun Cho, Jan Chorowski, Paul Christiano, Tim Cooijmans, Marc-Alexandre
C\^ot\'e, Myriam C\^ot\'e, Aaron Courville, Yann N. Dauphin, Olivier
Delalleau, Julien Demouth, Guillaume Desjardins, Sander Dieleman, Laurent
Dinh, M\'elanie Ducoffe, Vincent Dumoulin, Samira Ebrahimi Kahou, Dumitru
Erhan, Ziye Fan, Orhan Firat, Mathieu Germain, Xavier Glorot, Ian Goodfellow,
Matt Graham, Caglar Gulcehre, Philippe Hamel, Iban Harlouchet, Jean-Philippe
Heng, Bal\'azs Hidasi, Sina Honari, Arjun Jain, S\'ebastien Jean, Kai Jia,
Mikhail Korobov, Vivek Kulkarni, Alex Lamb, Pascal Lamblin, Eric Larsen,
C\'esar Laurent, Sean Lee, Simon Lefrancois, Simon Lemieux, Nicholas
L\'eonard, Zhouhan Lin, Jesse A. Livezey, Cory Lorenz, Jeremiah Lowin, Qianli
Ma, Pierre-Antoine Manzagol, Olivier Mastropietro, Robert T. McGibbon, Roland
Memisevic, Bart van Merri\"enboer, Vincent Michalski, Mehdi Mirza, Alberto
Orlandi, Christopher Pal, Razvan Pascanu, Mohammad Pezeshki, Colin Raffel,
Daniel Renshaw, Matthew Rocklin, Adriana Romero, Markus Roth, Peter Sadowski,
John Salvatier, Fran\c{c}ois Savard, Jan Schl\"uter, John Schulman, Gabriel
Schwartz, Iulian Vlad Serban, Dmitriy Serdyuk, Samira Shabanian, \'Etienne
Simon, Sigurd Spieckermann, S. Ramana Subramanyam, Jakub Sygnowski,
J\'er\'emie Tanguay, Gijs van Tulder, Joseph Turian, Sebastian Urban, Pascal
Vincent, Francesco Visin, Harm de Vries, David Warde-Farley, Dustin J. Webb,
Matthew Willson, Kelvin Xu, Lijun Xue, Li Yao, Saizheng Zhang, Ying Zhang
|
Theano: A Python framework for fast computation of mathematical
expressions
|
19 pages, 5 figures
| null | null | null |
cs.SC cs.LG cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Theano is a Python library that allows to define, optimize, and evaluate
mathematical expressions involving multi-dimensional arrays efficiently. Since
its introduction, it has been one of the most used CPU and GPU mathematical
compilers - especially in the machine learning community - and has shown steady
performance improvements. Theano is being actively and continuously developed
since 2008, multiple frameworks have been built on top of it and it has been
used to produce many state-of-the-art machine learning models.
The present article is structured as follows. Section I provides an overview
of the Theano software and its community. Section II presents the principal
features of Theano and how to use them, and compares them with other similar
projects. Section III focuses on recently-introduced functionalities and
improvements. Section IV compares the performance of Theano against Torch7 and
TensorFlow on several machine learning models. Section V discusses current
limitations of Theano and potential ways of improving it.
|
[
{
"version": "v1",
"created": "Mon, 9 May 2016 18:32:34 GMT"
}
] | 2016-05-10T00:00:00 |
[
[
"The Theano Development Team",
"",
""
],
[
"Al-Rfou",
"Rami",
""
],
[
"Alain",
"Guillaume",
""
],
[
"Almahairi",
"Amjad",
""
],
[
"Angermueller",
"Christof",
""
],
[
"Bahdanau",
"Dzmitry",
""
],
[
"Ballas",
"Nicolas",
""
],
[
"Bastien",
"Frédéric",
""
],
[
"Bayer",
"Justin",
""
],
[
"Belikov",
"Anatoly",
""
],
[
"Belopolsky",
"Alexander",
""
],
[
"Bengio",
"Yoshua",
""
],
[
"Bergeron",
"Arnaud",
""
],
[
"Bergstra",
"James",
""
],
[
"Bisson",
"Valentin",
""
],
[
"Snyder",
"Josh Bleecher",
""
],
[
"Bouchard",
"Nicolas",
""
],
[
"Boulanger-Lewandowski",
"Nicolas",
""
],
[
"Bouthillier",
"Xavier",
""
],
[
"de Brébisson",
"Alexandre",
""
],
[
"Breuleux",
"Olivier",
""
],
[
"Carrier",
"Pierre-Luc",
""
],
[
"Cho",
"Kyunghyun",
""
],
[
"Chorowski",
"Jan",
""
],
[
"Christiano",
"Paul",
""
],
[
"Cooijmans",
"Tim",
""
],
[
"Côté",
"Marc-Alexandre",
""
],
[
"Côté",
"Myriam",
""
],
[
"Courville",
"Aaron",
""
],
[
"Dauphin",
"Yann N.",
""
],
[
"Delalleau",
"Olivier",
""
],
[
"Demouth",
"Julien",
""
],
[
"Desjardins",
"Guillaume",
""
],
[
"Dieleman",
"Sander",
""
],
[
"Dinh",
"Laurent",
""
],
[
"Ducoffe",
"Mélanie",
""
],
[
"Dumoulin",
"Vincent",
""
],
[
"Kahou",
"Samira Ebrahimi",
""
],
[
"Erhan",
"Dumitru",
""
],
[
"Fan",
"Ziye",
""
],
[
"Firat",
"Orhan",
""
],
[
"Germain",
"Mathieu",
""
],
[
"Glorot",
"Xavier",
""
],
[
"Goodfellow",
"Ian",
""
],
[
"Graham",
"Matt",
""
],
[
"Gulcehre",
"Caglar",
""
],
[
"Hamel",
"Philippe",
""
],
[
"Harlouchet",
"Iban",
""
],
[
"Heng",
"Jean-Philippe",
""
],
[
"Hidasi",
"Balázs",
""
],
[
"Honari",
"Sina",
""
],
[
"Jain",
"Arjun",
""
],
[
"Jean",
"Sébastien",
""
],
[
"Jia",
"Kai",
""
],
[
"Korobov",
"Mikhail",
""
],
[
"Kulkarni",
"Vivek",
""
],
[
"Lamb",
"Alex",
""
],
[
"Lamblin",
"Pascal",
""
],
[
"Larsen",
"Eric",
""
],
[
"Laurent",
"César",
""
],
[
"Lee",
"Sean",
""
],
[
"Lefrancois",
"Simon",
""
],
[
"Lemieux",
"Simon",
""
],
[
"Léonard",
"Nicholas",
""
],
[
"Lin",
"Zhouhan",
""
],
[
"Livezey",
"Jesse A.",
""
],
[
"Lorenz",
"Cory",
""
],
[
"Lowin",
"Jeremiah",
""
],
[
"Ma",
"Qianli",
""
],
[
"Manzagol",
"Pierre-Antoine",
""
],
[
"Mastropietro",
"Olivier",
""
],
[
"McGibbon",
"Robert T.",
""
],
[
"Memisevic",
"Roland",
""
],
[
"van Merriënboer",
"Bart",
""
],
[
"Michalski",
"Vincent",
""
],
[
"Mirza",
"Mehdi",
""
],
[
"Orlandi",
"Alberto",
""
],
[
"Pal",
"Christopher",
""
],
[
"Pascanu",
"Razvan",
""
],
[
"Pezeshki",
"Mohammad",
""
],
[
"Raffel",
"Colin",
""
],
[
"Renshaw",
"Daniel",
""
],
[
"Rocklin",
"Matthew",
""
],
[
"Romero",
"Adriana",
""
],
[
"Roth",
"Markus",
""
],
[
"Sadowski",
"Peter",
""
],
[
"Salvatier",
"John",
""
],
[
"Savard",
"François",
""
],
[
"Schlüter",
"Jan",
""
],
[
"Schulman",
"John",
""
],
[
"Schwartz",
"Gabriel",
""
],
[
"Serban",
"Iulian Vlad",
""
],
[
"Serdyuk",
"Dmitriy",
""
],
[
"Shabanian",
"Samira",
""
],
[
"Simon",
"Étienne",
""
],
[
"Spieckermann",
"Sigurd",
""
],
[
"Subramanyam",
"S. Ramana",
""
],
[
"Sygnowski",
"Jakub",
""
],
[
"Tanguay",
"Jérémie",
""
],
[
"van Tulder",
"Gijs",
""
],
[
"Turian",
"Joseph",
""
],
[
"Urban",
"Sebastian",
""
],
[
"Vincent",
"Pascal",
""
],
[
"Visin",
"Francesco",
""
],
[
"de Vries",
"Harm",
""
],
[
"Warde-Farley",
"David",
""
],
[
"Webb",
"Dustin J.",
""
],
[
"Willson",
"Matthew",
""
],
[
"Xu",
"Kelvin",
""
],
[
"Xue",
"Lijun",
""
],
[
"Yao",
"Li",
""
],
[
"Zhang",
"Saizheng",
""
],
[
"Zhang",
"Ying",
""
]
] |
new_dataset
| 0.971338 |
1605.01744
|
David Cinciruk
|
Mengke Hu, David Cinciruk, and John MacLaren Walsh
|
Improving Automated Patent Claim Parsing: Dataset, System, and
Experiments
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Off-the-shelf natural language processing software performs poorly when
parsing patent claims owing to their use of irregular language relative to the
corpora built from news articles and the web typically utilized to train this
software. Stopping short of the extensive and expensive process of accumulating
a large enough dataset to completely retrain parsers for patent claims, a
method of adapting existing natural language processing software towards patent
claims via forced part of speech tag correction is proposed. An Amazon
Mechanical Turk collection campaign organized to generate a public corpus to
train such an improved claim parsing system is discussed, identifying lessons
learned during the campaign that can be of use in future NLP dataset collection
campaigns with AMT. Experiments utilizing this corpus and other patent claim
sets measure the parsing performance improvement garnered via the claim parsing
system. Finally, the utility of the improved claim parsing system within other
patent processing applications is demonstrated via experiments showing improved
automated patent subject classification when the new claim parsing system is
utilized to generate the features.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2016 20:11:57 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Hu",
"Mengke",
""
],
[
"Cinciruk",
"David",
""
],
[
"Walsh",
"John MacLaren",
""
]
] |
new_dataset
| 0.998339 |
1605.01755
|
Yin Xian
|
Yin Xian, Andrew Thompson, Xiaobai Sun, Douglas Nowacek, and Loren
Nolte
|
DCTNet and PCANet for acoustic signal feature extraction
|
22 figures
| null | null | null |
cs.SD cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the use of DCTNet, an efficient approximation and alternative to
PCANet, for acoustic signal classification. In PCANet, the eigenfunctions of
the local sample covariance matrix (PCA) are used as filterbanks for
convolution and feature extraction. When the eigenfunctions are well
approximated by the Discrete Cosine Transform (DCT) functions, each layer of of
PCANet and DCTNet is essentially a time-frequency representation. We relate
DCTNet to spectral feature representation methods, such as the the short time
Fourier transform (STFT), spectrogram and linear frequency spectral
coefficients (LFSC). Experimental results on whale vocalization data show that
DCTNet improves classification rate, demonstrating DCTNet's applicability to
signal processing problems such as underwater acoustics.
|
[
{
"version": "v1",
"created": "Thu, 28 Apr 2016 22:21:01 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Xian",
"Yin",
""
],
[
"Thompson",
"Andrew",
""
],
[
"Sun",
"Xiaobai",
""
],
[
"Nowacek",
"Douglas",
""
],
[
"Nolte",
"Loren",
""
]
] |
new_dataset
| 0.994886 |
1605.01821
|
Snehanshu Saha
|
Gouri Ginde, Snehanshu Saha, Archana Mathur, Sukrit Venkatagiri,
Sujith Vadakkepat, Anand Narasimhamurthy, B. S. Daya Sagar
|
ScientoBASE: A Framework and Model for Computing Scholastic Indicators
of non-local influence of Journals via Native Data Acquisition algorithms
|
Journal Influence Score; Journal Internationality modeling index
(JIMI); web scraping; feature extraction; Cobb-Douglas Production Function;
convex optimization; supervised learning; Non-Local Influence Quotient
(NLIQ), Source-Normalized Impact per Paper (SNIP). arXiv admin note: text
overlap with arXiv:1407.2037 by other authors without attribution
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Defining and measuring internationality as a function of influence diffusion
of scientific journals is an open problem. There exists no metric to rank
journals based on the extent or scale of internationality. Measuring
internationality is qualitative, vague, open to interpretation and is limited
by vested interests. With the tremendous increase in the number of journals in
various fields and the unflinching desire of academics across the globe to
publish in "international" journals, it has become an absolute necessity to
evaluate, rank and categorize journals based on internationality. Authors, in
the current work have defined internationality as a measure of influence that
transcends across geographic boundaries. There are concerns raised by the
authors about unethical practices reflected in the process of journal
publication whereby scholarly influence of a select few are artificially
boosted, primarily by resorting to editorial maneuvres. To counter the impact
of such tactics, authors have come up with a new method that defines and
measures internationality by eliminating such local effects when computing the
influence of journals. A new metric, Non-Local Influence Quotient(NLIQ) is
proposed as one such parameter for internationality computation along with
another novel metric, Other-Citation Quotient as the complement of the ratio of
self-citation and total citation. In addition, SNIP and International
Collaboration Ratio are used as two other parameters.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2016 04:52:18 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Ginde",
"Gouri",
""
],
[
"Saha",
"Snehanshu",
""
],
[
"Mathur",
"Archana",
""
],
[
"Venkatagiri",
"Sukrit",
""
],
[
"Vadakkepat",
"Sujith",
""
],
[
"Narasimhamurthy",
"Anand",
""
],
[
"Sagar",
"B. S. Daya",
""
]
] |
new_dataset
| 0.989234 |
1605.01829
|
Kasper Fl{\o}e Trillingsgaard
|
Kasper Fl{\o}e Trillingsgaard and Petar Popovski
|
Downlink Transmission of Short Packets: Framing and Control Information
Revisited
|
10 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cellular wireless systems rely on frame-based transmissions. The frame design
is conventionally based on heuristics, consisting of a frame header and a data
part. The frame header contains control information that provides pointers to
the messages within the data part. In this paper, we revisit the principles of
frame design and show the impact of the new design in scenarios that feature
short data packets which are central to various 5G and Internet of Things
applications. We treat framing for downlink transmission in an AWGN broadcast
channel with K users, where the sizes of the messages to the users are random
variables. Using approximations from finite blocklength information theory, we
establish a framework in which a message to a given user is not necessarily
encoded as a single packet, but may be grouped with the messages to other users
and benefit from the improved efficiency of longer codes. This requires changes
in the way control information is sent, and it requires that the users need to
spend power decoding other messages, thereby increasing the average power
consumption. We show that the common heuristic design is only one point on a
curve that represents the trade-off between latency and power consumption.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2016 05:53:56 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Trillingsgaard",
"Kasper Fløe",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.995906 |
1605.01878
|
Radhakrishna Vangipuram
|
Vangipuram Radhakrishna
|
Design and Analysis of Novel Kernel Measure for Software Fault
Localization
|
ICEMIS '15: Proceedings of the The International Conference on
Engineering & MIS 2015
| null |
10.1145/2832987.2833042
| null |
cs.SE
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
The problem of software fault localization may be viewed as an approach for
finding hidden faults or bugs in the existing program codes which are
syntactically correct and give fault free output for some input instances but
fail for all other input instances. Some of the reasons include logical errors,
wrong interpretation of specification, coding errors. Finding such faults is
not possible sometimes with the help of compilers. This is where the necessity
and significance of software fault localization stems out. The main
contribution for this work is to first introduce the block hit-miss function
which relates block vectors of execution sequences of software code over sample
runs performed and the decision vector which denotes fault or error free
output. The similarity measure is applied to the block vector and decision
vectors as input and the pair with maximum similarity is considered as faulty
block.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2016 10:11:30 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Radhakrishna",
"Vangipuram",
""
]
] |
new_dataset
| 0.995921 |
1605.01886
|
Fritz M\"uller
|
Fritz M\"uller
|
From Sazonov's Non-Dcpo Natural Domains to Closed Directed-Lub Partial
Orders
|
35 pages, 4 figures
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Normann proved that the domains of the game model of PCF (the domains of
sequential functionals) need not be dcpos. Sazonov has defined natural domains
for a theory of such incomplete domains. This paper further develops that
theory. It defines lub-rules that infer natural lubs from existing natural
lubs, and lub-rule classes that describe axiom systems like that of natural
domains. There is a canonical proper subcategory of the natural domains, the
closed directed lub partial orders (cdlubpo), that corresponds to the complete
lub-rule class of all valid lub-rules. Cdlubpos can be completed to restricted
dcpos, which are dcpos that retain the data of the incomplete cdlubpo as a
subset.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2016 10:50:35 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Müller",
"Fritz",
""
]
] |
new_dataset
| 0.960555 |
1605.01977
|
Davide Sanvito
|
Giuseppe Bianchi, Marco Bonola, Salvatore Pontarelli, Davide Sanvito,
Antonio Capone, Carmelo Cascone
|
Open Packet Processor: a programmable architecture for wire speed
platform-independent stateful in-network processing
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper aims at contributing to the ongoing debate on how to bring
programmability of stateful packet processing tasks inside the network
switches, while retaining platform independency. Our proposed approach, named
"Open Packet Processor" (OPP), shows the viability (via an hardware prototype
relying on commodity HW technologies and operating in a strictly bounded number
of clock cycles) of eXtended Finite State Machines (XFSM) as low-level data
plane programming abstraction. With the help of examples, including a token
bucket and a C4.5 traffic classifier based on a binary tree, we show the
ability of OPP to support stateful operation and flow-level feature tracking.
Platform independence is accomplished by decoupling the implementation of
hardware primitives (registries, conditions, update instructions, forwarding
actions, matching facilities) from their usage by an application formally
described via an abstract XFSM. We finally discuss limitations and extensions.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2016 15:39:44 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Bianchi",
"Giuseppe",
""
],
[
"Bonola",
"Marco",
""
],
[
"Pontarelli",
"Salvatore",
""
],
[
"Sanvito",
"Davide",
""
],
[
"Capone",
"Antonio",
""
],
[
"Cascone",
"Carmelo",
""
]
] |
new_dataset
| 0.967846 |
1605.01987
|
Luke Hsiao
|
Kevin Miller, Luke W. Hsiao
|
TCPTuner: Congestion Control Your Way
|
6 pages, 9 figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
TCPTuner is a TCP (transmission control protocol) congestion control kernel
module and GUI (graphical user interface) for Linux that allows real-time
modification of the congestion control parameters of TCP CUBIC, the current
default algorithm in Linux. Specifically, the tool provides access to alpha,
the rate at which a sender's congestion window grows; beta, the multiplicative
factor to decrease the congestion window on a loss event; as well as CUBIC's
fast convergence and tcp friendliness parameters. Additionally, the interface
provides access to ip-route parameters for the minimum retransmission time and
initial congestion window size. In this paper, we describe the implementation
of TCPTuner and show experimental data of the effects of adjusting congestion
control parameters.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2016 16:07:08 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Miller",
"Kevin",
""
],
[
"Hsiao",
"Luke W.",
""
]
] |
new_dataset
| 0.999792 |
1605.01993
|
Mohammad Mohammadi Amiri Mr.
|
Mohammad Mohammadi Amiri, Qianqian Yang, and Deniz Gunduz
|
Coded Caching for a Large Number Of Users
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Information theoretic analysis of a coded caching system is considered, in
which a server with a database of N equal-size files, each F bits long, serves
K users. Each user is assumed to have a local cache that can store M files,
i.e., capacity of MF bits. Proactive caching to user terminals is considered,
in which the caches are filled by the server in advance during the placement
phase, without knowing the user requests. Each user requests a single file, and
all the requests are satisfied simultaneously through a shared error-free link
during the delivery phase.
First, centralized coded caching is studied assuming both the number and the
identity of the active users in the delivery phase are known by the server
during the placement phase. A novel group-based centralized coded caching (GBC)
scheme is proposed for a cache capacity of M = N/K. It is shown that this
scheme achieves a smaller delivery rate than all the known schemes in the
literature. The improvement is then extended to a wider range of cache
capacities through memory-sharing between the proposed scheme and other known
schemes in the literature. Next, the proposed centralized coded caching idea is
exploited in the decentralized setting, in which the identities of the users
that participate in the delivery phase are assumed to be unknown during the
placement phase. It is shown that the proposed decentralized caching scheme
also achieves a delivery rate smaller than the state-of-the-art. Numerical
simulations are also presented to corroborate our theoretical results.
|
[
{
"version": "v1",
"created": "Fri, 6 May 2016 16:17:19 GMT"
}
] | 2016-05-09T00:00:00 |
[
[
"Amiri",
"Mohammad Mohammadi",
""
],
[
"Yang",
"Qianqian",
""
],
[
"Gunduz",
"Deniz",
""
]
] |
new_dataset
| 0.993948 |
1402.5835
|
J\'er\^ome Kunegis
|
J\'er\^ome Kunegis
|
Polcovar: Software for Computing the Mean and Variance of Subgraph
Counts in Random Graphs
|
5 pages; fixed some wording; added link to Github
| null | null | null |
cs.MS
|
http://creativecommons.org/licenses/by-sa/4.0/
|
The mean and variance of the number of appearances of a given subgraph $H$ in
an Erd\H{o}s--R\'enyi random graph over $n$ nodes are rational polynomials in
$n$. We present a piece of software named Polcovar (from "polynomial" and
"covariance") that computes the exact rational coefficients of these
polynomials in function of $H$.
|
[
{
"version": "v1",
"created": "Mon, 24 Feb 2014 14:26:08 GMT"
},
{
"version": "v2",
"created": "Wed, 4 May 2016 20:34:48 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Kunegis",
"Jérôme",
""
]
] |
new_dataset
| 0.982565 |
1412.4564
|
Karel Lenc
|
Andrea Vedaldi, Karel Lenc
|
MatConvNet - Convolutional Neural Networks for MATLAB
|
Updated for release v1.0-beta20
| null | null | null |
cs.CV cs.LG cs.MS cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MatConvNet is an implementation of Convolutional Neural Networks (CNNs) for
MATLAB. The toolbox is designed with an emphasis on simplicity and flexibility.
It exposes the building blocks of CNNs as easy-to-use MATLAB functions,
providing routines for computing linear convolutions with filter banks, feature
pooling, and many more. In this manner, MatConvNet allows fast prototyping of
new CNN architectures; at the same time, it supports efficient computation on
CPU and GPU allowing to train complex models on large datasets such as ImageNet
ILSVRC. This document provides an overview of CNNs and how they are implemented
in MatConvNet and gives the technical details of each computational block in
the toolbox.
|
[
{
"version": "v1",
"created": "Mon, 15 Dec 2014 12:23:35 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Jun 2015 15:35:25 GMT"
},
{
"version": "v3",
"created": "Thu, 5 May 2016 14:31:06 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Vedaldi",
"Andrea",
""
],
[
"Lenc",
"Karel",
""
]
] |
new_dataset
| 0.994323 |
1505.05124
|
Imad Ahmad
|
Imad Ahmad and Chih-Chun Wang
|
Locally Repairable Regenerating Codes: Node Unavailability and the
Insufficiency of Stationary Local Repair
|
21 pages, 5 figures, submitted to IEEE Trans. on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Locally repairable codes (LRCs) are ingeniously designed distributed storage
codes with a (usually small) fixed set of helper nodes participating in repair.
Since most existing LRCs assume exact repair and allow full exchange of the
stored data ($\beta=\alpha$) from the helper nodes, they can be viewed as a
generalization of the traditional erasure codes (ECs) with a much desired
feature of local repairability via predetermined sets of helpers. However, it
also means that they lack the features of (i) functional repair, and (ii)
partial information-exchange ($\beta<\alpha$) in the original regenerating
codes (RCs), which could further reduce the repair bandwidth. Motivated by the
significant bandwidth reduction of RCs over ECs, existing works by Ahmad et al
and by Hollmann studied the concept of "locally repairable regenerating codes
(LRRCs)" that successfully combine functional repair and partial information
exchange of regenerating codes with the much-desired local repairability
feature of LRC. The resulting LRRCs demonstrate significant bandwidth
reduction.
One important issue that needs to be addressed by any local repair schemes
(including both LRCs and LRRCs) is that sometimes designated helper nodes may
be temporarily unavailable, the result of multiple failures, degraded reads, or
other network dynamics. Under the setting of LRRCs with temporary node
unavailability, this work studies the impact of different helper selection
methods. It proves that with node unavailability, all existing methods of
helper selection, including those used in RCs and LRCs, can be insufficient in
terms of achieving the optimal repair-bandwidth. For some scenarios, it is
necessary to combine LRRCs with a new helper selection method, termed dynamic
helper selection, to achieve optimal repair bandwidth. This work also compares
the performance of different helper selection methods and answers...
|
[
{
"version": "v1",
"created": "Tue, 19 May 2015 19:30:24 GMT"
},
{
"version": "v2",
"created": "Wed, 4 May 2016 21:36:49 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Ahmad",
"Imad",
""
],
[
"Wang",
"Chih-Chun",
""
]
] |
new_dataset
| 0.985799 |
1602.02481
|
Sungjoon Choi
|
Sungjoon Choi, Qian-Yi Zhou, Stephen Miller, and Vladlen Koltun
|
A Large Dataset of Object Scans
|
Technical report
| null | null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have created a dataset of more than ten thousand 3D scans of real objects.
To create the dataset, we recruited 70 operators, equipped them with
consumer-grade mobile 3D scanning setups, and paid them to scan objects in
their environments. The operators scanned objects of their choosing, outside
the laboratory and without direct supervision by computer vision professionals.
The result is a large and diverse collection of object scans: from shoes, mugs,
and toys to grand pianos, construction vehicles, and large outdoor sculptures.
We worked with an attorney to ensure that data acquisition did not violate
privacy constraints. The acquired data was irrevocably placed in the public
domain and is available freely at http://redwood-data.org/3dscan .
|
[
{
"version": "v1",
"created": "Mon, 8 Feb 2016 07:20:52 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Feb 2016 17:21:24 GMT"
},
{
"version": "v3",
"created": "Thu, 5 May 2016 05:35:48 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Choi",
"Sungjoon",
""
],
[
"Zhou",
"Qian-Yi",
""
],
[
"Miller",
"Stephen",
""
],
[
"Koltun",
"Vladlen",
""
]
] |
new_dataset
| 0.999799 |
1602.03573
|
Pedro Roque
|
Pedro Roque and Rodrigo Ventura
|
Space CoBot: a collaborative aerial robot for indoor microgravity
environments
|
21 pages, 13 figures. Previously at arXiv:1603.07545
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a first contribution to the design of a small aerial
robot for inhabited microgravity environments, such as orbiting space stations.
In particular, we target a fleet of robots for collaborative tasks with humans,
such as telepresence and cooperative mobile manipulation. We explore a
propeller based propulsion system, arranged in such a way that the
translational and the rotational components can be decoupled, resulting in an
holonomic hexarotor. Since propellers have limited thrust, we employ an
optimization approach to select the geometric configuration given a criteria of
uniform maximum thrust across all directions in the body reference frame. We
also tackle the problem of motion control: due to the decoupling of
translational and rotational modes we use separate converging controllers for
each one of these modes. In addition, we present preliminary simulation results
in a realistic simulator, in closed loop with the proposed controller, thus
providing a first validation of the followed methodology.
|
[
{
"version": "v1",
"created": "Wed, 10 Feb 2016 23:36:14 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Apr 2016 23:15:58 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Roque",
"Pedro",
""
],
[
"Ventura",
"Rodrigo",
""
]
] |
new_dataset
| 0.999164 |
1605.00971
|
Peter Dugan Dr
|
Peter J. Dugan, Christopher W. Clark, Yann Andr\'e LeCun, Sofie M. Van
Parijs
|
Phase 1: DCL System Research Using Advanced Approaches for Land-based or
Ship-based Real-Time Recognition and Localization of Marine Mammals - HPC
System Implementation
|
Year 1 National Oceanic Partnership Program Report, sponsored ONR,
NFWF. N000141210585
| null | null |
N000141210585
|
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We aim to investigate advancing the state of the art of detection,
classification and localization (DCL) in the field of bioacoustics. The two
primary goals are to develop transferable technologies for detection and
classification in: (1) the area of advanced algorithms, such as deep learning
and other methods; and (2) advanced systems, capable of real-time and archival
and processing. This project will focus on long-term, continuous datasets to
provide automatic recognition, minimizing human time to annotate the signals.
Effort will begin by focusing on several years of multi-channel acoustic data
collected in the Stellwagen Bank National Marine Sanctuary (SBNMS) between 2006
and 2010. Our efforts will incorporate existing technologies in the
bioacoustics signal processing community, advanced high performance computing
(HPC) systems, and new approaches aimed at automatically detecting-classifying
and measuring features for species-specific marine mammal sounds within passive
acoustic data.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2016 16:35:35 GMT"
},
{
"version": "v2",
"created": "Thu, 5 May 2016 18:27:35 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Dugan",
"Peter J.",
""
],
[
"Clark",
"Christopher W.",
""
],
[
"LeCun",
"Yann André",
""
],
[
"Van Parijs",
"Sofie M.",
""
]
] |
new_dataset
| 0.953213 |
1605.01530
|
Akim Demaille
|
Akim Demaille
|
Derived-term Automata for Extended Weighted Rational Expressions
|
21 pages
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an algorithm to build an automaton from a rational expression.
This approach introduces support for extended weighted expressions. Inspired by
derived-term based algorithms, its core relies on a different construct,
rational expansions. We introduce an inductive algorithm to compute the
expansion of an expression from which the automaton follows. This algorithm is
independent of the size of the alphabet, and actually even supports infinite
alphabets. It can easily be accommodated to generate deterministic (weighted)
automata. These constructs are implemented in Vcsn, a free-software platform
dedicated to weighted automata and rational expressions.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2016 08:50:48 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Demaille",
"Akim",
""
]
] |
new_dataset
| 0.991709 |
1605.01576
|
Tao Zhou
|
Tao Zhou, Brian Johnson, Rui Li
|
Patch-based Texture Synthesis for Image Inpainting
|
in Computer Science and Applications, 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image inpaiting is an important task in image processing and vision. In this
paper, we develop a general method for patch-based image inpainting by
synthesizing new textures from existing one. A novel framework is introduced to
find several optimal candidate patches and generate a new texture patch in the
process. We form it as an optimization problem that identifies the potential
patches for synthesis from an coarse-to-fine manner. We use the texture
descriptor as a clue in searching for matching patches from the known region.
To ensure the structure faithful to the original image, a geometric constraint
metric is formally defined that is applied directly to the patch synthesis
procedure. We extensively conducted our experiments on a wide range of testing
images on various scenarios and contents by arbitrarily specifying the target
the regions for inference followed by using existing evaluation metrics to
verify its texture coherency and structural consistency. Our results
demonstrate the high accuracy and desirable output that can be potentially used
for numerous applications: object removal, background subtraction, and image
retrieval.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2016 13:04:09 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Zhou",
"Tao",
""
],
[
"Johnson",
"Brian",
""
],
[
"Li",
"Rui",
""
]
] |
new_dataset
| 0.999676 |
1605.01655
|
Saif Mohammad Dr.
|
Saif M. Mohammad, Parinaz Sobhani, and Svetlana Kiritchenko
|
Stance and Sentiment in Tweets
|
22 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We can often detect from a person's utterances whether he/she is in favor of
or against a given target entity -- their stance towards the target. However, a
person may express the same stance towards a target by using negative or
positive language. Here for the first time we present a dataset of
tweet--target pairs annotated for both stance and sentiment. The targets may or
may not be referred to in the tweets, and they may or may not be the target of
opinion in the tweets. Partitions of this dataset were used as training and
test sets in a SemEval-2016 shared task competition. We propose a simple stance
detection system that outperforms submissions from all 19 teams that
participated in the shared task. Additionally, access to both stance and
sentiment annotations allows us to explore several research questions. We show
that while knowing the sentiment expressed by a tweet is beneficial for stance
classification, it alone is not sufficient. Finally, we use additional
unlabeled data through distant supervision techniques and word embeddings to
further improve stance classification.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2016 17:07:54 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Mohammad",
"Saif M.",
""
],
[
"Sobhani",
"Parinaz",
""
],
[
"Kiritchenko",
"Svetlana",
""
]
] |
new_dataset
| 0.99968 |
1605.01696
|
Jeremy Thorpe
|
Philip Gossett, Jeremy Thorpe, Bob Nuckolls, Brett Coon, Dan
McCloskey, David Chang, Greg Steuck, Paul Rodman, Sasha Levitskiy, Yuan Yuan
|
A Many Antenna High Rate Wireless System
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a TDD MIMO wireless system designed to operate at high bandwidth
and low SNR. Signals are transmitted as a direct sequence. In the uplink
(Multiple Access Channel), signal detection is done by a space-time whitening
filter followed by a matched filter. In the downlink (Broadcast Channel),
precoding is done by the transpose of these filters.
We further describe an implementation of this system that uses an array of 32
antennas to communicate with 32 single-antenna clients simultaneously on the
same frequencies between 512-608 and 614-698 MHz. At close range, all 32 links
achieve the full PHY data rate, both uplink and downlink, with less than 1\%
Block Error Rate on each link. The total system rate is 3.8 Gb/s. The system
spectral efficiency is 21.7 b/s/Hz for both uplink and downlink.
We close with some projections to the not-to-distant future.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2016 19:17:13 GMT"
}
] | 2016-05-06T00:00:00 |
[
[
"Gossett",
"Philip",
""
],
[
"Thorpe",
"Jeremy",
""
],
[
"Nuckolls",
"Bob",
""
],
[
"Coon",
"Brett",
""
],
[
"McCloskey",
"Dan",
""
],
[
"Chang",
"David",
""
],
[
"Steuck",
"Greg",
""
],
[
"Rodman",
"Paul",
""
],
[
"Levitskiy",
"Sasha",
""
],
[
"Yuan",
"Yuan",
""
]
] |
new_dataset
| 0.998512 |
1603.00831
|
Anton Milan
|
Anton Milan, Laura Leal-Taixe, Ian Reid, Stefan Roth, Konrad Schindler
|
MOT16: A Benchmark for Multi-Object Tracking
|
arXiv admin note: substantial text overlap with arXiv:1504.01942
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Standardized benchmarks are crucial for the majority of computer vision
applications. Although leaderboards and ranking tables should not be
over-claimed, benchmarks often provide the most objective measure of
performance and are therefore important guides for reseach.
Recently, a new benchmark for Multiple Object Tracking, MOTChallenge, was
launched with the goal of collecting existing and new data and creating a
framework for the standardized evaluation of multiple object tracking methods.
The first release of the benchmark focuses on multiple people tracking, since
pedestrians are by far the most studied object in the tracking community. This
paper accompanies a new release of the MOTChallenge benchmark. Unlike the
initial release, all videos of MOT16 have been carefully annotated following a
consistent protocol. Moreover, it not only offers a significant increase in the
number of labeled boxes, but also provides multiple object classes beside
pedestrians and the level of visibility for every single object of interest.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2016 19:07:56 GMT"
},
{
"version": "v2",
"created": "Tue, 3 May 2016 23:55:38 GMT"
}
] | 2016-05-05T00:00:00 |
[
[
"Milan",
"Anton",
""
],
[
"Leal-Taixe",
"Laura",
""
],
[
"Reid",
"Ian",
""
],
[
"Roth",
"Stefan",
""
],
[
"Schindler",
"Konrad",
""
]
] |
new_dataset
| 0.999305 |
1605.01072
|
Max Wolotsky
|
Max Wolotsky, Mohammad Husain, Elisha Choe
|
Chill-Pass: Using Neuro-Physiological Responses to Chill Music to Defeat
Coercion Attacks
|
14 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current alphanumeric and biometric authentication systems cannot withstand
situations where a user is coerced into releasing their authentication
materials under hostile circumstances. Existing approaches of coercion
resistant authentication systems (CRAS) propose authentication factors such as
implicit learning tasks, which are non-transferable, but still have the
drawback that an attacker can force the victim (causing stress) to perform the
task in order to gain unauthorized access. Alternatively, there could be cases
where the user could claim that they were coerced into giving up the
authentication materials, whereas in reality they acted as an insider attacker.
Therefore, being able to detect stress during authentication also helps to
achieve non-repudiation in such cases. To address these concerns, we need CRAS
that have both the non-transferable property as well as a mechanism to detect
stress related to coercion. In this paper, we study the feasibility of using
Chill (intensely pleasurable) music as a stimulus to elicit unique
neuro-physiological responses that can be used as an authenticating factor for
CRAS. Chill music and stress are both stimuli for a neuro-chemical called
Dopamine. However, they release the Dopamine at different parts of the brain,
resulting in different neuro-physiological responses, which gives us both the
non-transferable and stress-detection properties necessary for CRAS. We have
experimentally validated our proposed Chill music based CRAS using human
subjects and measuring their neuro-physiological responses on our prototype
system. Based on the 100 samples collected from the subjects, we were able to
successfully authenticate the subjects with an accuracy of over 90\%. Our work
not only demonstrates the potential of Chill music as a unique stimulus for
CRAS, but also paves the path of wider adoption of CRAS in general.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2016 20:09:27 GMT"
}
] | 2016-05-05T00:00:00 |
[
[
"Wolotsky",
"Max",
""
],
[
"Husain",
"Mohammad",
""
],
[
"Choe",
"Elisha",
""
]
] |
new_dataset
| 0.999031 |
1605.01120
|
John Kieffer
|
John C. Kieffer
|
Information Sources on a Bratteli diagram
| null | null | null | null |
cs.IT math.DS math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Bratteli diagram is a type of graph in which the vertices are split into
finite subsets occupying an infinite sequence of levels, starting with a bottom
level and moving to successively higher levels along edges connecting
consecutive levels. An information source on a Bratteli diagram consists of a
sequence of PMFs on the vertex sets at each level that are compatible under
edge transport. By imposing a regularity condition on the Bratteli diagram, we
obtain various results for its information sources including ergodic and
entropy rate decomposition theorems, a Shannon-Mcmillan-Breiman theorem, and
lossless and lossy source coding theorems. Proof methodology exploits the
Vershik transformation on the path space of a Bratteli diagram. Some results
for finite alphabet stationary sequential information sources are seen to be a
special case of the results of this paper.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2016 00:27:19 GMT"
}
] | 2016-05-05T00:00:00 |
[
[
"Kieffer",
"John C.",
""
]
] |
new_dataset
| 0.991042 |
1605.01194
|
Sharmistha Jat
|
Lavanya Sita Tekumalla and Sharmistha
|
IISCNLP at SemEval-2016 Task 2: Interpretable STS with ILP based
Multiple Chunk Aligner
|
SEMEVAL Workshop @ NAACL 2016
| null | null | null |
cs.CL stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Interpretable semantic textual similarity (iSTS) task adds a crucial
explanatory layer to pairwise sentence similarity. We address various
components of this task: chunk level semantic alignment along with assignment
of similarity type and score for aligned chunks with a novel system presented
in this paper. We propose an algorithm, iMATCH, for the alignment of multiple
non-contiguous chunks based on Integer Linear Programming (ILP). Similarity
type and score assignment for pairs of chunks is done using a supervised
multiclass classification technique based on Random Forrest Classifier. Results
show that our algorithm iMATCH has low execution time and outperforms most
other participating systems in terms of alignment score. Of the three datasets,
we are top ranked for answer- students dataset in terms of overall score and
have top alignment score for headlines dataset in the gold chunks track.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2016 09:36:49 GMT"
}
] | 2016-05-05T00:00:00 |
[
[
"Tekumalla",
"Lavanya Sita",
""
],
[
"Sharmistha",
"",
""
]
] |
new_dataset
| 0.998907 |
1605.01198
|
Kord Eickmeyer
|
Kord Eickmeyer and Ken-ichi Kawarabayashi
|
Successor-Invariant First-Order Logic on Graphs with Excluded
Topological Subgraphs
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the model-checking problem for successor-invariant first-order
logic is fixed-parameter tractable on graphs with excluded topological
subgraphs when parameterised by both the size of the input formula and the size
of the exluded topological subgraph. Furthermore, we show that model-checking
for order-invariant first-order logic is tractable on coloured posets of
bounded width, parameterised by both the size of the input formula and the
width of the poset.
Our result for successor-invariant FO extends previous results for this logic
on planar graphs (Engelmann et al., LICS 2012) and graphs with excluded minors
(Eickmeyer et al., LICS 2013), further narrowing the gap between what is known
for FO and what is known for successor-invariant FO. The proof uses Grohe and
Marx's structure theorem for graphs with excluded topological subgraphs. For
order-invariant FO we show that Gajarsk\'y et al.'s recent result for FO
carries over to order-invariant FO.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2016 09:44:03 GMT"
}
] | 2016-05-05T00:00:00 |
[
[
"Eickmeyer",
"Kord",
""
],
[
"Kawarabayashi",
"Ken-ichi",
""
]
] |
new_dataset
| 0.996748 |
1605.01401
|
Zheng Wang
|
Zheng Wang
|
Combating Malicious DNS Tunnel
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a defense scheme against malicious use of DNS tunnel. A
tunnel validator is designed to provide trustworthy tunnel-aware defensive
recursive service. In addition to the detection algorithm of malicious tunnel
domains, the tunnel validation relies on registered tunnel domains as whitelist
and identified malicious tunnel domains as blacklist. A benign tunnel user is
thus motivated to register its tunnel domain before using it. Through the
tunnel validation, the secure domains are allowed to the recursive service
provided by the tunnel validator and the insecure domains are blocked. All
inbound suspicious DNS queries are recorded and stored for forensics and future
malicious tunnel detection by the tunnel validator.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2016 19:54:57 GMT"
}
] | 2016-05-05T00:00:00 |
[
[
"Wang",
"Zheng",
""
]
] |
new_dataset
| 0.994622 |
1503.06882
|
Deli Qiao
|
Deli Qiao, Haifeng Qian, and Geoffrey Ye Li
|
Broadbeam for Massive MIMO Systems
| null | null |
10.1109/TSP.2016.2521609
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Massive MIMO has been identified as one of the promising disruptive air
interface techniques to address the huge capacity requirement demanded by 5G
wireless communications. For practical deployment of such systems, the control
message need to be broadcast to all users reliably in the cell using broadbeam.
A broadbeam is expected to have the same radiated power in all directions to
cover users in any place in a cell. In this paper, we will show that there is
no perfect broadbeam. Therefore, we develop a method for generating broadbeam
that can allow tiny fluctuations in radiated power. Overall, this can serve as
an ingredient for practical deployment of the massive MIMO systems.
|
[
{
"version": "v1",
"created": "Tue, 24 Mar 2015 00:53:48 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Qiao",
"Deli",
""
],
[
"Qian",
"Haifeng",
""
],
[
"Li",
"Geoffrey Ye",
""
]
] |
new_dataset
| 0.990372 |
1504.00126
|
Maximilian Matthe
|
Maximilian Matth\'e, Gerhard Fettweis
|
Conjugate-Root Offset-QAM for Orthogonal Multicarrier Transmission
|
4pages, revised version submitted to IEEE WCL
| null |
10.1186/s13634-016-0342-2
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Current implementations of OFDM/OQAM are restricted to band-limited symmetric
filters. To circumvent this, non-symmetric conjugate root (CR) filters are
proposed for OQAM modulation. The system is applied to Generalized Frequency
Division Multiplexing (GFDM) and a method for achieving transmit diversity with
OQAM modulation is presented. The proposal reduces implementation complexity
compared to existing works and provides a more regular phase space.
GFDM/CR-OQAM outperforms conventional GFDM in terms of symbol error rate in
fading multipath channels and provides a more localized spectrum compared to
conventional OQAM.
|
[
{
"version": "v1",
"created": "Wed, 1 Apr 2015 07:17:12 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Jun 2015 11:29:27 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Matthé",
"Maximilian",
""
],
[
"Fettweis",
"Gerhard",
""
]
] |
new_dataset
| 0.962449 |
1505.07487
|
Joshua Joy
|
Joshua Joy, Eric Chung, Zengwen Yuan, Leqi Zou, Jiayao Li, Mario Gerla
|
DiscoverFriends: Secure Social Network Communication in Mobile Ad Hoc
Networks
|
Eric and Joshua contributed equally to this work
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a secure communication application called
DiscoverFriends. Its purpose is to securely communicate to a group of online
friends while bypassing their respective social networking servers under a
mobile ad hoc network environment. DiscoverFriends leverages Bloom filters and
a hybrid encryption technique with a self-organized public-key management
scheme to securely identify friends and provide authentication. Additionally,
DiscoverFriends enables anonymous location check-ins by utilizing a new
cryptographic primitive called Function Secret Sharing. Finally, to the best of
our knowledge, DiscoverFriends implements and evaluates the first Android
multi-hop WiFi direct protocol using IPv6.
|
[
{
"version": "v1",
"created": "Wed, 27 May 2015 20:42:57 GMT"
},
{
"version": "v2",
"created": "Mon, 2 May 2016 20:40:09 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Joy",
"Joshua",
""
],
[
"Chung",
"Eric",
""
],
[
"Yuan",
"Zengwen",
""
],
[
"Zou",
"Leqi",
""
],
[
"Li",
"Jiayao",
""
],
[
"Gerla",
"Mario",
""
]
] |
new_dataset
| 0.991655 |
1506.02160
|
Jie Ding
|
Jie Ding, Mohammad Noshad, and Vahid Tarokh
|
Complementary Lattice Arrays for Coded Aperture Imaging
| null | null |
10.1364/JOSAA.33.000863
| null |
cs.IT astro-ph.IM math.CO math.IT physics.optics
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we consider complementary lattice arrays in order to enable a
broader range of designs for coded aperture imaging systems. We provide a
general framework and methods that generate richer and more flexible designs
than existing ones. Besides this, we review and interpret the state-of-the-art
uniformly redundant arrays (URA) designs, broaden the related concepts, and
further propose some new design methods.
|
[
{
"version": "v1",
"created": "Sat, 6 Jun 2015 14:57:12 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Aug 2015 14:40:55 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Ding",
"Jie",
""
],
[
"Noshad",
"Mohammad",
""
],
[
"Tarokh",
"Vahid",
""
]
] |
new_dataset
| 0.987348 |
1506.05367
|
Dinesh Ramasamy
|
Zhinus Marzi, Dinesh Ramasamy and Upamanyu Madhow
|
Compressive channel estimation and tracking for large arrays in mm wave
picocells
| null | null |
10.1109/JSTSP.2016.2520899
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose and investigate a compressive architecture for estimation and
tracking of sparse spatial channels in millimeter (mm) wave picocellular
networks. The base stations are equipped with antenna arrays with a large
number of elements (which can fit within compact form factors because of the
small carrier wavelength) and employ radio frequency (RF) beamforming, so that
standard least squares adaptation techniques (which require access to
individual antenna elements) are not applicable. We focus on the downlink, and
show that "compressive beacons," transmitted using pseudorandom phase settings
at the base station array, and compressively processed using pseudorandom phase
settings at the mobile array, provide information sufficient for accurate
estimation of the two-dimensional (2D) spatial frequencies associated with the
directions of departure of the dominant rays from the base station, and the
associated complex gains. This compressive approach is compatible with coarse
phase-only control, and is based on a near-optimal sequential algorithm for
frequency estimation which can exploit the geometric continuity of the channel
across successive beaconing intervals to reduce the overhead to less than 1%
even for very large (32 x 32) arrays. Compressive beaconing is essentially
omnidirectional, and hence does not enjoy the SNR and spatial reuse benefits of
beamforming obtained during data transmission. We therefore discuss system
level design considerations for ensuring that the beacon SNR is sufficient for
accurate channel estimation, and that inter-cell beacon interference is
controlled by an appropriate reuse scheme.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2015 15:27:37 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Marzi",
"Zhinus",
""
],
[
"Ramasamy",
"Dinesh",
""
],
[
"Madhow",
"Upamanyu",
""
]
] |
new_dataset
| 0.993839 |
1509.02604
|
Tsung-Hui Chang
|
Tsung-Hui Chang, Wei-Cheng Liao, Mingyi Hong and Xiangfeng Wang
|
Asynchronous Distributed ADMM for Large-Scale Optimization- Part II:
Linear Convergence Analysis and Numerical Performance
|
submitted for publication, 28 pages
| null |
10.1109/TSP.2016.2537261
| null |
cs.DC cs.LG cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The alternating direction method of multipliers (ADMM) has been recognized as
a versatile approach for solving modern large-scale machine learning and signal
processing problems efficiently. When the data size and/or the problem
dimension is large, a distributed version of ADMM can be used, which is capable
of distributing the computation load and the data set to a network of computing
nodes. Unfortunately, a direct synchronous implementation of such algorithm
does not scale well with the problem size, as the algorithm speed is limited by
the slowest computing nodes. To address this issue, in a companion paper, we
have proposed an asynchronous distributed ADMM (AD-ADMM) and studied its
worst-case convergence conditions. In this paper, we further the study by
characterizing the conditions under which the AD-ADMM achieves linear
convergence. Our conditions as well as the resulting linear rates reveal the
impact that various algorithm parameters, network delay and network size have
on the algorithm performance. To demonstrate the superior time efficiency of
the proposed AD-ADMM, we test the AD-ADMM on a high-performance computer
cluster by solving a large-scale logistic regression problem.
|
[
{
"version": "v1",
"created": "Wed, 9 Sep 2015 02:07:27 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Chang",
"Tsung-Hui",
""
],
[
"Liao",
"Wei-Cheng",
""
],
[
"Hong",
"Mingyi",
""
],
[
"Wang",
"Xiangfeng",
""
]
] |
new_dataset
| 0.990335 |
1602.03638
|
Mikael Mortensen
|
Mikael Mortensen and Hans Petter Langtangen
|
High performance Python for direct numerical simulations of turbulent
flows
| null | null |
10.1016/j.cpc.2016.02.005
| null |
cs.MS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Direct Numerical Simulations (DNS) of the Navier Stokes equations is an
invaluable research tool in fluid dynamics. Still, there are few publicly
available research codes and, due to the heavy number crunching implied,
available codes are usually written in low-level languages such as C/C++ or
Fortran. In this paper we describe a pure scientific Python pseudo-spectral DNS
code that nearly matches the performance of C++ for thousands of processors and
billions of unknowns. We also describe a version optimized through Cython, that
is found to match the speed of C++. The solvers are written from scratch in
Python, both the mesh, the MPI domain decomposition, and the temporal
integrators. The solvers have been verified and benchmarked on the Shaheen
supercomputer at the KAUST supercomputing laboratory, and we are able to show
very good scaling up to several thousand cores.
A very important part of the implementation is the mesh decomposition (we
implement both slab and pencil decompositions) and 3D parallel Fast Fourier
Transforms (FFT). The mesh decomposition and FFT routines have been implemented
in Python using serial FFT routines (either NumPy, pyFFTW or any other serial
FFT module), NumPy array manipulations and with MPI communications handled by
MPI for Python (mpi4py). We show how we are able to execute a 3D parallel FFT
in Python for a slab mesh decomposition using 4 lines of compact Python code,
for which the parallel performance on Shaheen is found to be slightly better
than similar routines provided through the FFTW library. For a pencil mesh
decomposition 7 lines of code is required to execute a transform.
|
[
{
"version": "v1",
"created": "Thu, 11 Feb 2016 08:12:37 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Mortensen",
"Mikael",
""
],
[
"Langtangen",
"Hans Petter",
""
]
] |
new_dataset
| 0.966064 |
1602.04115
|
Maryam Mehrnezhad
|
Maryam Mehrnezhad, Ehsan Toreini, Siamak F. Shahandashti, Feng Hao
|
TouchSignatures: Identification of User Touch Actions and PINs Based on
Mobile Sensor Data via JavaScript
| null | null |
10.1016/j.jisa.2015.11.007
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Conforming to W3C specifications, mobile web browsers allow JavaScript code
in a web page to access motion and orientation sensor data without the user's
permission. The associated risks to user security and privacy are however not
considered in W3C specifications. In this work, for the first time, we show how
user security can be compromised using these sensor data via browser, despite
that the data rate is 3 to 5 times slower than what is available in app. We
examine multiple popular browsers on Android and iOS platforms and study their
policies in granting permissions to JavaScript code with respect to access to
motion and orientation sensor data. Based on our observations, we identify
multiple vulnerabilities, and propose TouchSignatures which implements an
attack where malicious JavaScript code on an attack tab listens to such sensor
data measurements. Based on these streams, TouchSignatures is able to
distinguish the user's touch actions (i.e., tap, scroll, hold, and zoom) and
her PINs, allowing a remote website to learn the client-side user activities.
We demonstrate the practicality of this attack by collecting data from real
users and reporting high success rates using our proof-of-concept
implementations. We also present a set of potential solutions to address the
vulnerabilities. The W3C community and major mobile browser vendors including
Mozilla, Google, Apple and Opera have acknowledge our work and are implementing
some of our proposed countermeasures.
|
[
{
"version": "v1",
"created": "Fri, 12 Feb 2016 16:44:55 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Mehrnezhad",
"Maryam",
""
],
[
"Toreini",
"Ehsan",
""
],
[
"Shahandashti",
"Siamak F.",
""
],
[
"Hao",
"Feng",
""
]
] |
new_dataset
| 0.998813 |
1603.05335
|
Delu Zeng
|
Tong Zhao, Lin Li, Xinghao Ding, Yue Huang and Delu Zeng
|
Saliency Detection with Spaces of Background-based Distribution
|
5 pages, 6 figures, Accepted by IEEE Signal Processing Letters in
March 2016
| null |
10.1109/LSP.2016.2544781
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this letter, an effective image saliency detection method is proposed by
constructing some novel spaces to model the background and redefine the
distance of the salient patches away from the background. Concretely, given the
backgroundness prior, eigendecomposition is utilized to create four spaces of
background-based distribution (SBD) to model the background, in which a more
appropriate metric (Mahalanobis distance) is quoted to delicately measure the
saliency of every image patch away from the background. After that, a coarse
saliency map is obtained by integrating the four adjusted Mahalanobis distance
maps, each of which is formed by the distances between all the patches and
background in the corresponding SBD. To be more discriminative, the coarse
saliency map is further enhanced into the posterior probability map within
Bayesian perspective. Finally, the final saliency map is generated by properly
refining the posterior probability map with geodesic distance. Experimental
results on two usual datasets show that the proposed method is effective
compared with the state-of-the-art algorithms.
|
[
{
"version": "v1",
"created": "Thu, 17 Mar 2016 02:18:30 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Zhao",
"Tong",
""
],
[
"Li",
"Lin",
""
],
[
"Ding",
"Xinghao",
""
],
[
"Huang",
"Yue",
""
],
[
"Zeng",
"Delu",
""
]
] |
new_dataset
| 0.999601 |
1604.00515
|
Honggang Hu
|
Honggang Hu, Qingsheng Zhang, and Shuai Shao
|
On the Dual of the Coulter-Matthews Bent Functions
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For any bent function, it is very interesting to determine its dual function
because the dual function is also bent in certain cases. For $k$ odd and
$\gcd(n, k)=1$, it is known that the Coulter-Matthews bent function
$f(x)=Tr(ax^{\frac{3^k+1}{2}})$ is weakly regular bent over $\mathbb{F}_{3^n}$,
where $a\in\mathbb{F}_{3^n}^{*}$, and
$Tr(\cdot):\mathbb{F}_{3^n}\rightarrow\mathbb{F}_3$ is the trace function. In
this paper, we investigate the dual function of $f(x)$, and dig out an
universal formula. In particular, for two cases, we determine the formula
explicitly: for the case of $n=3t+1$ and $k=2t+1$ with $t\geq 2$, the dual
function is given by
$$Tr\left(-\frac{x^{3^{2t+1}+3^{t+1}+2}}{a^{3^{2t+1}+3^{t+1}+1}}-\frac{x^{3^{2t}+1}}{a^{-3^{2t}+3^{t}+1}}+\frac{x^{2}}{a^{-3^{2t+1}+3^{t+1}+1}}\right);$$
and for the case of $n=3t+2$ and $k=2t+1$ with $t\geq 2$, the dual function is
given by
$$Tr\left(-\frac{x^{3^{2t+2}+1}}{a^{3^{2t+2}-3^{t+1}+3}}-\frac{x^{2\cdot3^{2t+1}+3^{t+1}+1}}{a^{3^{2t+2}+3^{t+1}+1}}+\frac{x^2}{a^{-3^{2t+2}+3^{t+1}+3}}\right).$$
As a byproduct, we find two new classes of ternary bent functions with only
three terms. Moreover, we also prove that in certain cases $f(x)$ is regular
bent.
|
[
{
"version": "v1",
"created": "Sat, 2 Apr 2016 15:14:16 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Apr 2016 10:44:26 GMT"
},
{
"version": "v3",
"created": "Tue, 3 May 2016 14:41:39 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Hu",
"Honggang",
""
],
[
"Zhang",
"Qingsheng",
""
],
[
"Shao",
"Shuai",
""
]
] |
new_dataset
| 0.99765 |
1605.00017
|
Seunghyun Park
|
Seunghyun Park, Seonwoo Min, Hyunsoo Choi, and Sungroh Yoon
|
deepMiRGene: Deep Neural Network based Precursor microRNA Prediction
| null | null | null | null |
cs.LG q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since microRNAs (miRNAs) play a crucial role in post-transcriptional gene
regulation, miRNA identification is one of the most essential problems in
computational biology. miRNAs are usually short in length ranging between 20
and 23 base pairs. It is thus often difficult to distinguish miRNA-encoding
sequences from other non-coding RNAs and pseudo miRNAs that have a similar
length, and most previous studies have recommended using precursor miRNAs
instead of mature miRNAs for robust detection. A great number of conventional
machine-learning-based classification methods have been proposed, but they
often have the serious disadvantage of requiring manual feature engineering,
and their performance is limited as well. In this paper, we propose a novel
miRNA precursor prediction algorithm, deepMiRGene, based on recurrent neural
networks, specifically long short-term memory networks. deepMiRGene
automatically learns suitable features from the data themselves without manual
feature engineering and constructs a model that can successfully reflect
structural characteristics of precursor miRNAs. For the performance evaluation
of our approach, we have employed several widely used evaluation metrics on
three recent benchmark datasets and verified that deepMiRGene delivered
comparable performance among the current state-of-the-art tools.
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2016 20:12:04 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Park",
"Seunghyun",
""
],
[
"Min",
"Seonwoo",
""
],
[
"Choi",
"Hyunsoo",
""
],
[
"Yoon",
"Sungroh",
""
]
] |
new_dataset
| 0.998633 |
1605.00082
|
Ahmad Abboud Dr.
|
Ahmad Abboud, Jean-Pierre Cances, Ali H. Jaber, Vahid Meghdadi
|
Indoor Massive MIMO: Uplink Pilot Mitigation Using Channel State
Information Map
|
7 pages,7 figures, Conference paper
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Massive MIMO brings both motivations and challenges to develop the 5th
generation Mobile wireless technology. The promising number of users and the
high bitrate offered per unit area are challenged by uplink pilot contamination
due to pilot reuse and a limited number of orthogonal pilot sequences. This
paper proposes a solution to mitigate uplink pilot contamination in an indoor
scenario where multi-cell share the same pool of pilot sequences, that are
supposed to be less than the number of users. This can be done by reducing
uplink pilots using Channel State Information (CSI) prediction. The proposed
method is based on machine learning approach, where a quantized version of
Channel State Information (QCSI) is learned during estimation session and
stored at the Base Station (BS) to be exploited for future CSI prediction. The
learned QCSI are represented by a weighted directed graph, which is responsible
to monitor and predict the CSI of User Terminals (UTs) in the local cell. We
introduce an online learning algorithm to create and update this graph which we
call CSI map. Simulation results show an increase in the downlink sum-rate and
a significant feedback reduction.
|
[
{
"version": "v1",
"created": "Sat, 30 Apr 2016 09:23:51 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Abboud",
"Ahmad",
""
],
[
"Cances",
"Jean-Pierre",
""
],
[
"Jaber",
"Ali H.",
""
],
[
"Meghdadi",
"Vahid",
""
]
] |
new_dataset
| 0.992193 |
1605.00681
|
Lu Zhang
|
Lu Zhang, Luis Vega, Michael Taylor
|
Power Side Channels in Security ICs: Hardware Countermeasures
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Power side-channel attacks are a very effective cryptanalysis technique that
can infer secret keys of security ICs by monitoring the power consumption.
Since the emergence of practical attacks in the late 90s, they have been a
major threat to many cryptographic-equipped devices including smart cards,
encrypted FPGA designs, and mobile phones. Designers and manufacturers of
cryptographic devices have in response developed various countermeasures for
protection. Attacking methods have also evolved to counteract resistant
implementations. This paper reviews foundational power analysis attack
techniques and examines a variety of hardware design mitigations. The aim is to
highlight exposed vulnerabilities in hardware-based countermeasures for future
more secure implementations.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 20:41:50 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Zhang",
"Lu",
""
],
[
"Vega",
"Luis",
""
],
[
"Taylor",
"Michael",
""
]
] |
new_dataset
| 0.99353 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.