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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1703.01975
|
Ruben Mayer
|
Ruben Mayer, Harshit Gupta, Enrique Saurez, Umakishore Ramachandran
|
The Fog Makes Sense: Enabling Social Sensing Services With Limited
Internet Connectivity
|
Ruben Mayer, Harshit Gupta, Enrique Saurez, and Umakishore
Ramachandran. 2017. The Fog Makes Sense: Enabling Social Sensing Services
With Limited Internet Connectivity. In Proceedings of The 2nd International
Workshop on Social Sensing, Pittsburgh, PA, USA, April 21 2017
(SocialSens'17), 6 pages
| null |
10.1145/3055601.3055614
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social sensing services use humans as sensor carriers, sensor operators and
sensors themselves in order to provide situation-awareness to applications.
This promises to provide a multitude of benefits to the users, for example in
the management of natural disasters or in community empowerment. However,
current social sensing services depend on Internet connectivity since the
services are deployed on central Cloud platforms. In many circumstances,
Internet connectivity is constrained, for instance when a natural disaster
causes Internet outages or when people do not have Internet access due to
economical reasons. In this paper, we propose the emerging Fog Computing
infrastructure to become a key-enabler of social sensing services in situations
of constrained Internet connectivity. To this end, we develop a generic
architecture and API of Fog-enabled social sensing services. We exemplify the
usage of the proposed social sensing architecture on a number of concrete use
cases from two different scenarios.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 17:02:14 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Mayer",
"Ruben",
""
],
[
"Gupta",
"Harshit",
""
],
[
"Saurez",
"Enrique",
""
],
[
"Ramachandran",
"Umakishore",
""
]
] |
new_dataset
| 0.992869 |
1703.02002
|
Md Mizanur Rahman
|
Mahmudur Rahman, Mizanur Rahman, Bogdan Carbunar, Duen Horng Chau
|
FairPlay: Fraud and Malware Detection in Google Play
|
Proceedings of the 2016 SIAM International Conference on Data Mining.
Society for Industrial and Applied Mathematics, 2016
| null | null | null |
cs.SI cs.CR cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fraudulent behaviors in Google Android app market fuel search rank abuse and
malware proliferation. We present FairPlay, a novel system that uncovers both
malware and search rank fraud apps, by picking out trails that fraudsters leave
behind. To identify suspicious apps, FairPlay PCF algorithm correlates review
activities and uniquely combines detected review relations with linguistic and
behavioral signals gleaned from longitudinal Google Play app data. We
contribute a new longitudinal app dataset to the community, which consists of
over 87K apps, 2.9M reviews, and 2.4M reviewers, collected over half a year.
FairPlay achieves over 95% accuracy in classifying gold standard datasets of
malware, fraudulent and legitimate apps. We show that 75% of the identified
malware apps engage in search rank fraud. FairPlay discovers hundreds of
fraudulent apps that currently evade Google Bouncer detection technology, and
reveals a new type of attack campaign, where users are harassed into writing
positive reviews, and install and review other apps.
|
[
{
"version": "v1",
"created": "Mon, 6 Mar 2017 17:51:16 GMT"
}
] | 2017-03-07T00:00:00 |
[
[
"Rahman",
"Mahmudur",
""
],
[
"Rahman",
"Mizanur",
""
],
[
"Carbunar",
"Bogdan",
""
],
[
"Chau",
"Duen Horng",
""
]
] |
new_dataset
| 0.999856 |
1702.07491
|
Yansong Gao
|
Yansong Gao, Damith C. Ranasinghe
|
R$^3$PUF: A Highly Reliable Memristive Device based Reconfigurable PUF
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a memristive device based R$ ^3 $PUF construction achieving highly
desired PUF properties, which are not offered by most current PUF designs: (1)
High reliability, almost 100\% that is crucial for PUF-based cryptographic key
generations, significantly reducing, or even eliminating the expensive overhead
of on-chip error correction logic and the associated helper on-chip data
storage or off-chip storage and transfer. (2) Reconfigurability, while current
PUF designs rarely exhibit such an attractive property. We validate our R$ ^3
$PUF via extensive Monte-Carlo simulations in Cadence based on parameters of
real devices. The R$ ^3 $PUF is simple, cost-effective and easy to manage
compared to other PUF constructions exhibiting high reliability or
reconfigurability. None of previous PUF constructions is able to provide both
desired high reliability and reconfigurability concurrently.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2017 08:27:09 GMT"
}
] | 2017-03-06T00:00:00 |
[
[
"Gao",
"Yansong",
""
],
[
"Ranasinghe",
"Damith C.",
""
]
] |
new_dataset
| 0.996658 |
1703.00123
|
Jian Dai
|
Jian Dai, Fei He, Wang-Chien Lee, Gang Chen, Beng Chin Ooi
|
DTNC: A New Server-side Data Cleansing Framework for Cellular Trajectory
Services
| null | null | null | null |
cs.NI cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is essential for the cellular network operators to provide cellular
location services to meet the needs of their users and mobile applications.
However, cellular locations, estimated by network-based methods at the
server-side, bear with {\it high spatial errors} and {\it arbitrary missing
locations}. Moreover, auxiliary sensor data at the client-side are not
available to the operators. In this paper, we study the {\em cellular
trajectory cleansing problem} and propose an innovative data cleansing
framework, namely \underline{D}ynamic \underline{T}ransportation
\underline{N}etwork based \underline{C}leansing (DTNC) to improve the quality
of cellular locations delivered in online cellular trajectory services. We
maintain a dynamic transportation network (DTN), which associates a network
edge with a probabilistic distribution of travel times updated continuously. In
addition, we devise an object motion model, namely, {\em travel-time-aware
hidden semi-Markov model} ({\em TT-HsMM}), which is used to infer the most
probable traveled edge sequences on DTN. To validate our ideas, we conduct a
comprehensive evaluation using real-world cellular data provided by a major
cellular network operator and a GPS dataset collected by smartphones as the
ground truth. In the experiments, DTNC displays significant advantages over six
state-of-the-art techniques.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 03:41:40 GMT"
},
{
"version": "v2",
"created": "Fri, 3 Mar 2017 07:42:42 GMT"
}
] | 2017-03-06T00:00:00 |
[
[
"Dai",
"Jian",
""
],
[
"He",
"Fei",
""
],
[
"Lee",
"Wang-Chien",
""
],
[
"Chen",
"Gang",
""
],
[
"Ooi",
"Beng Chin",
""
]
] |
new_dataset
| 0.991597 |
1703.00948
|
Preeti Bhargava
|
Nemanja Spasojevic, Preeti Bhargava, Guoning Hu
|
DAWT: Densely Annotated Wikipedia Texts across multiple languages
|
8 pages, 3 figures, 7 tables, WWW2017, WWW 2017 Companion proceedings
| null |
10.1145/3041021.3053367
| null |
cs.IR cs.AI cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we open up the DAWT dataset - Densely Annotated Wikipedia Texts
across multiple languages. The annotations include labeled text mentions
mapping to entities (represented by their Freebase machine ids) as well as the
type of the entity. The data set contains total of 13.6M articles, 5.0B tokens,
13.8M mention entity co-occurrences. DAWT contains 4.8 times more anchor text
to entity links than originally present in the Wikipedia markup. Moreover, it
spans several languages including English, Spanish, Italian, German, French and
Arabic. We also present the methodology used to generate the dataset which
enriches Wikipedia markup in order to increase number of links. In addition to
the main dataset, we open up several derived datasets including mention entity
co-occurrence counts and entity embeddings, as well as mappings between
Freebase ids and Wikidata item ids. We also discuss two applications of these
datasets and hope that opening them up would prove useful for the Natural
Language Processing and Information Retrieval communities, as well as
facilitate multi-lingual research.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 20:55:20 GMT"
}
] | 2017-03-06T00:00:00 |
[
[
"Spasojevic",
"Nemanja",
""
],
[
"Bhargava",
"Preeti",
""
],
[
"Hu",
"Guoning",
""
]
] |
new_dataset
| 0.995149 |
1703.01107
|
Weiwei Ai Weiwei Ai
|
Weiwei Ai, Nitish Patel, Partha Roop, Avinash Malik, Nathan Allen and
Mark L. Trew
|
An intracardiac electrogram model to bridge virtual hearts and
implantable cardiac devices
| null | null | null | null |
cs.SY physics.med-ph q-bio.TO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Virtual heart models have been proposed to enhance the safety of implantable
cardiac devices through closed loop validation. To communicate with a virtual
heart, devices have been driven by cardiac signals at specific sites. As a
result, only the action potentials of these sites are sensed. However, the real
device implanted in the heart will sense a complex combination of near and
far-field extracellular potential signals. Therefore many device functions,
such as blanking periods and refractory periods, are designed to handle these
unexpected signals. To represent these signals, we develop an intracardiac
electrogram (IEGM) model as an interface between the virtual heart and the
device. The model can capture not only the local excitation but also far-field
signals and pacing afterpotentials. Moreover, the sensing controller can
specify unipolar or bipolar electrogram (EGM) sensing configurations and
introduce various oversensing and undersensing modes. The simulation results
show that the model is able to reproduce clinically observed sensing problems,
which significantly extends the capabilities of the virtual heart model in the
context of device validation.
|
[
{
"version": "v1",
"created": "Fri, 3 Mar 2017 10:46:47 GMT"
}
] | 2017-03-06T00:00:00 |
[
[
"Ai",
"Weiwei",
""
],
[
"Patel",
"Nitish",
""
],
[
"Roop",
"Partha",
""
],
[
"Malik",
"Avinash",
""
],
[
"Allen",
"Nathan",
""
],
[
"Trew",
"Mark L.",
""
]
] |
new_dataset
| 0.997113 |
1703.01122
|
Nicole Schweikardt
|
Dietrich Kuske and Nicole Schweikardt
|
First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always
Exist and Can Be Computed!
|
41 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the logic FOCN(P) which extends first-order logic by counting
and by numerical predicates from a set P, and which can be viewed as a natural
generalisation of various counting logics that have been studied in the
literature.
We obtain a locality result showing that every FOCN(P)-formula can be
transformed into a formula in Hanf normal form that is equivalent on all finite
structures of degree at most d. A formula is in Hanf normal form if it is a
Boolean combination of formulas describing the neighbourhood around its tuple
of free variables and arithmetic sentences with predicates from P over atomic
statements describing the number of realisations of a type with a single
centre. The transformation into Hanf normal form can be achieved in time
elementary in $d$ and the size of the input formula. From this locality result,
we infer the following applications: (*) The Hanf-locality rank of first-order
formulas of bounded quantifier alternation depth only grows polynomially with
the formula size. (*) The model checking problem for the fragment FOC(P) of
FOCN(P) on structures of bounded degree is fixed-parameter tractable (with
elementary parameter dependence). (*) The query evaluation problem for fixed
queries from FOC(P) over fully dynamic databases of degree at most d can be
solved efficiently: there is a dynamic algorithm that can enumerate the tuples
in the query result with constant delay, and that allows to compute the size of
the query result and to test if a given tuple belongs to the query result
within constant time after every database update.
|
[
{
"version": "v1",
"created": "Fri, 3 Mar 2017 12:10:53 GMT"
}
] | 2017-03-06T00:00:00 |
[
[
"Kuske",
"Dietrich",
""
],
[
"Schweikardt",
"Nicole",
""
]
] |
new_dataset
| 0.993714 |
1703.01270
|
Jeffrey Lipton
|
Jeffrey I Lipton, Aidan J Fay, Daniela Rus
|
Baxter's Homunculus: Virtual Reality Spaces for Teleoperation in
Manufacturing
|
8 pages 6 figures, submitted to IROS 2017
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Expensive specialized systems have hampered development of telerobotic
systems for manufacturing systems. In this paper we demonstrate a telerobotic
system which can reduce the cost of such system by leveraging commercial
virtual reality(VR) technology and integrating it with existing robotics
control software. The system runs on a commercial gaming engine using off the
shelf VR hardware. This system can be deployed on multiple network
architectures from a wired local network to a wireless network connection over
the Internet. The system is based on the homunculus model of mind wherein we
embed the user in a virtual reality control room. The control room allows for
multiple sensor display, dynamic mapping between the user and robot, does not
require the production of duals for the robot, or its environment. The control
room is mapped to a space inside the robot to provide a sense of co-location
within the robot. We compared our system with state of the art automation
algorithms for assembly tasks, showing a 100% success rate for our system
compared with a 66% success rate for automated systems. We demonstrate that our
system can be used for pick and place, assembly, and manufacturing tasks.
|
[
{
"version": "v1",
"created": "Fri, 3 Mar 2017 18:03:26 GMT"
}
] | 2017-03-06T00:00:00 |
[
[
"Lipton",
"Jeffrey I",
""
],
[
"Fay",
"Aidan J",
""
],
[
"Rus",
"Daniela",
""
]
] |
new_dataset
| 0.992314 |
1403.7980
|
Andre Schulz
|
Erik D. Demaine and Andre Schulz
|
Embedding Stacked Polytopes on a Polynomial-Size Grid
|
22 pages, 10 Figures
| null | null | null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A stacking operation adds a $d$-simplex on top of a facet of a simplicial
$d$-polytope while maintaining the convexity of the polytope. A stacked
$d$-polytope is a polytope that is obtained from a $d$-simplex and a series of
stacking operations. We show that for a fixed $d$ every stacked $d$-polytope
with $n$ vertices can be realized with nonnegative integer coordinates. The
coordinates are bounded by $O(n^{2\log(2d)})$, except for one axis, where the
coordinates are bounded by $O(n^{3\log(2d)})$. The described realization can be
computed with an easy algorithm.
The realization of the polytopes is obtained with a lifting technique which
produces an embedding on a large grid. We establish a rounding scheme that
places the vertices on a sparser grid, while maintaining the convexity of the
embedding.
|
[
{
"version": "v1",
"created": "Mon, 31 Mar 2014 13:03:45 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Mar 2015 15:04:50 GMT"
},
{
"version": "v3",
"created": "Wed, 13 Jan 2016 14:42:08 GMT"
},
{
"version": "v4",
"created": "Thu, 2 Mar 2017 07:45:17 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Demaine",
"Erik D.",
""
],
[
"Schulz",
"Andre",
""
]
] |
new_dataset
| 0.95555 |
1407.1507
|
Sebastian Deorowicz
|
Sebastian Deorowicz and Marek Kokot and Szymon Grabowski and Agnieszka
Debudaj-Grabysz
|
KMC 2: Fast and resource-frugal $k$-mer counting
| null |
Bioinformatics 31 (10): 1569-1576 (2015)
|
10.1093/bioinformatics/btv022
| null |
cs.DS cs.CE q-bio.GN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivation: Building the histogram of occurrences of every $k$-symbol long
substring of nucleotide data is a standard step in many bioinformatics
applications, known under the name of $k$-mer counting. Its applications
include developing de Bruijn graph genome assemblers, fast multiple sequence
alignment and repeat detection. The tremendous amounts of NGS data require fast
algorithms for $k$-mer counting, preferably using moderate amounts of memory.
Results: We present a novel method for $k$-mer counting, on large datasets at
least twice faster than the strongest competitors (Jellyfish~2, KMC~1), using
about 12\,GB (or less) of RAM memory. Our disk-based method bears some
resemblance to MSPKmerCounter, yet replacing the original minimizers with
signatures (a carefully selected subset of all minimizers) and using $(k,
x)$-mers allows to significantly reduce the I/O, and a highly parallel overall
architecture allows to achieve unprecedented processing speeds. For example,
KMC~2 allows to count the 28-mers of a human reads collection with 44-fold
coverage (106\,GB of compressed size) in about 20 minutes, on a 6-core Intel i7
PC with an SSD.
Availability: KMC~2 is freely available at http://sun.aei.polsl.pl/kmc.
Contact: [email protected]
|
[
{
"version": "v1",
"created": "Sun, 6 Jul 2014 15:39:05 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Deorowicz",
"Sebastian",
""
],
[
"Kokot",
"Marek",
""
],
[
"Grabowski",
"Szymon",
""
],
[
"Debudaj-Grabysz",
"Agnieszka",
""
]
] |
new_dataset
| 0.995218 |
1609.08546
|
Jacob Varley
|
Jacob Varley, Chad DeChant, Adam Richardson, Joaqu\'in Ruales, Peter
Allen
|
Shape Completion Enabled Robotic Grasping
|
Under review at IEEE/RSJ International Conference on Intelligent
Robots and Systems(IROS) 2017
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work provides an architecture to enable robotic grasp planning via shape
completion. Shape completion is accomplished through the use of a 3D
convolutional neural network (CNN). The network is trained on our own new open
source dataset of over 440,000 3D exemplars captured from varying viewpoints.
At runtime, a 2.5D pointcloud captured from a single point of view is fed into
the CNN, which fills in the occluded regions of the scene, allowing grasps to
be planned and executed on the completed object. Runtime shape completion is
very rapid because most of the computational costs of shape completion are
borne during offline training. We explore how the quality of completions vary
based on several factors. These include whether or not the object being
completed existed in the training data and how many object models were used to
train the network. We also look at the ability of the network to generalize to
novel objects allowing the system to complete previously unseen objects at
runtime. Finally, experimentation is done both in simulation and on actual
robotic hardware to explore the relationship between completion quality and the
utility of the completed mesh model for grasping.
|
[
{
"version": "v1",
"created": "Tue, 27 Sep 2016 17:40:06 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Mar 2017 18:19:56 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Varley",
"Jacob",
""
],
[
"DeChant",
"Chad",
""
],
[
"Richardson",
"Adam",
""
],
[
"Ruales",
"Joaquín",
""
],
[
"Allen",
"Peter",
""
]
] |
new_dataset
| 0.958341 |
1612.02113
|
Matthew Kokshoorn
|
Matthew Kokshoorn, He Chen, Yonghui Li and Branka Vucetic
|
Fountain Code-Inspired Channel Estimation for Multi-user Millimeter Wave
MIMO Systems
|
To be presented at ICC, 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper develops a novel channel estimation approach for multi-user
millimeter wave (mmWave) wireless systems with large antenna arrays. By
exploiting the inherent mmWave channel sparsity, we propose a novel
simultaneous-estimation with iterative fountain training (SWIFT) framework, in
which the average number of channel measurements is adapted to various channel
conditions. To this end, the base station (BS) and each user continue to
measure the channel with a random subset of transmit/receive beamforming
directions until the channel estimate converges. We formulate the channel
estimation process as a compressed sensing problem and apply a sparse
estimation approach to recover the virtual channel information. As SWIFT does
not adapt the BS's transmitting beams to any single user, we are able to
estimate all user channels simultaneously. Simulation results show that SWIFT
can significantly outperform existing random-beamforming based approaches that
use a fixed number of measurements, over a range of signal-to-noise ratios and
channel coherence times.
|
[
{
"version": "v1",
"created": "Wed, 7 Dec 2016 04:45:52 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Mar 2017 01:11:02 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Kokshoorn",
"Matthew",
""
],
[
"Chen",
"He",
""
],
[
"Li",
"Yonghui",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.998639 |
1703.00512
|
Randal Olson
|
Randal S. Olson, William La Cava, Patryk Orzechowski, Ryan J.
Urbanowicz, Jason H. Moore
|
PMLB: A Large Benchmark Suite for Machine Learning Evaluation and
Comparison
|
14 pages, 5 figures, submitted for review to JMLR
| null | null | null |
cs.LG cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The selection, development, or comparison of machine learning methods in data
mining can be a difficult task based on the target problem and goals of a
particular study. Numerous publicly available real-world and simulated
benchmark datasets have emerged from different sources, but their organization
and adoption as standards have been inconsistent. As such, selecting and
curating specific benchmarks remains an unnecessary burden on machine learning
practitioners and data scientists. The present study introduces an accessible,
curated, and developing public benchmark resource to facilitate identification
of the strengths and weaknesses of different machine learning methodologies. We
compare meta-features among the current set of benchmark datasets in this
resource to characterize the diversity of available data. Finally, we apply a
number of established machine learning methods to the entire benchmark suite
and analyze how datasets and algorithms cluster in terms of performance. This
work is an important first step towards understanding the limitations of
popular benchmarking suites and developing a resource that connects existing
benchmarking standards to more diverse and efficient standards in the future.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 21:20:11 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Olson",
"Randal S.",
""
],
[
"La Cava",
"William",
""
],
[
"Orzechowski",
"Patryk",
""
],
[
"Urbanowicz",
"Ryan J.",
""
],
[
"Moore",
"Jason H.",
""
]
] |
new_dataset
| 0.999494 |
1703.00536
|
Ania Piotrowska
|
Ania Piotrowska and Jamie Hayes and Tariq Elahi and Sebastian Meiser
and George Danezis
|
The Loopix Anonymity System
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Loopix, a low-latency anonymous communication system that provides
bi-directional 'third-party' sender and receiver anonymity and unobservability.
Loopix leverages cover traffic and brief message delays to provide anonymity
and achieve traffic analysis resistance, including against a global network
adversary. Mixes and clients self-monitor the network via loops of traffic to
provide protection against active attacks, and inject cover traffic to provide
stronger anonymity and a measure of sender and receiver unobservability.
Service providers mediate access in and out of a stratified network of Poisson
mix nodes to facilitate accounting and off-line message reception, as well as
to keep the number of links in the system low, and to concentrate cover
traffic. We provide a theoretical analysis of the Poisson mixing strategy as
well as an empirical evaluation of the anonymity provided by the protocol and a
functional implementation that we analyze in terms of scalability by running it
on AWS EC2. We show that a Loopix relay can handle upwards of 300 messages per
second, at a small delay overhead of less than 1.5 ms on top of the delays
introduced into messages to provide security. Overall message latency is in the
order of seconds - which is low for a mix-system. Furthermore, many mix nodes
can be securely added to a stratified topology to scale throughput without
sacrificing anonymity.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 22:33:41 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Piotrowska",
"Ania",
""
],
[
"Hayes",
"Jamie",
""
],
[
"Elahi",
"Tariq",
""
],
[
"Meiser",
"Sebastian",
""
],
[
"Danezis",
"George",
""
]
] |
new_dataset
| 0.990678 |
1703.00619
|
Claudia Melo
|
Claudia de O. Melo and Thiago C. de Sousa
|
Reflections on Cyberethics Education for Millennial Software Engineers
|
International Workshop on Software Engineering Curricula for
Millennials (SECM), ICSE 2017
| null | null | null |
cs.SE cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software is a key component of solutions for 21st Century problems. These
problems are often "wicked", complex, and unpredictable. To provide the best
possible solution, millennial software engineers must be prepared to make
ethical decisions, thinking critically, and acting systematically. This reality
demands continuous changes in educational systems and curricula delivery, as
misjudgment might have serious social impact. This study aims to investigate
and reflect on Software Engineering (SE) Programs, proposing a conceptual
framework for analyzing cyberethics education and a set of suggestions on how
to integrate it into the SE undergraduate curriculum.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 05:00:50 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Melo",
"Claudia de O.",
""
],
[
"de Sousa",
"Thiago C.",
""
]
] |
new_dataset
| 0.971902 |
1703.00626
|
Onur Mutlu
|
Onur Mutlu
|
The RowHammer Problem and Other Issues We May Face as Memory Becomes
Denser
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As memory scales down to smaller technology nodes, new failure mechanisms
emerge that threaten its correct operation. If such failure mechanisms are not
anticipated and corrected, they can not only degrade system reliability and
availability but also, perhaps even more importantly, open up security
vulnerabilities: a malicious attacker can exploit the exposed failure mechanism
to take over the entire system. As such, new failure mechanisms in memory can
become practical and significant threats to system security.
In this work, we discuss the RowHammer problem in DRAM, which is a prime (and
perhaps the first) example of how a circuit-level failure mechanism in DRAM can
cause a practical and widespread system security vulnerability. RowHammer, as
it is popularly referred to, is the phenomenon that repeatedly accessing a row
in a modern DRAM chip causes bit flips in physically-adjacent rows at
consistently predictable bit locations. It is caused by a hardware failure
mechanism called DRAM disturbance errors, which is a manifestation of
circuit-level cell-to-cell interference in a scaled memory technology. We
analyze the root causes of the RowHammer problem and examine various solutions.
We also discuss what other vulnerabilities may be lurking in DRAM and other
types of memories, e.g., NAND flash memory or Phase Change Memory, that can
potentially threaten the foundations of secure systems, as the memory
technologies scale to higher densities. We conclude by describing and
advocating a principled approach to memory reliability and security research
that can enable us to better anticipate and prevent such vulnerabilities.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 05:19:38 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Mutlu",
"Onur",
""
]
] |
new_dataset
| 0.952224 |
1703.00662
|
Dong Min Kim
|
Dong Min Kim, Henning Thomsen, Petar Popovski
|
On a User-Centric Base Station Cooperation Scheme for Reliable
Communications
|
to be presented in IEEE VTC 2017 Spring
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we describe CoMP2flex, a user-centric base station (BS)
cooperation scheme that provides improvements in reliability of both uplink
(UL) and downlink (DL) communications of wireless cellular networks. CoMP2flex
supports not only cooperation of two BSs with same direction of traffic but
also cooperation of two BSs serving bidirectional traffic. The reliability
performance of CoMP2flex is shown with numerical simulations and analytical
expressions. We quantify and numerically validate the performance of the greedy
BS pairing algorithm by comparing maximum weight matching methods, implemented
as the Edmonds matching algorithm for weighted graphs.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 08:22:24 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Kim",
"Dong Min",
""
],
[
"Thomsen",
"Henning",
""
],
[
"Popovski",
"Petar",
""
]
] |
new_dataset
| 0.999052 |
1703.00745
|
F. J. Lobillo
|
Jos\'e G\'omez-Torrecillas, F. J. Lobillo and Gabriel Navarro
|
Peterson-Gorenstein-Zierler algorithm for skew RS codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We design a non-commutative version of the Peterson-Gorenstein-Zierler
decoding algorithm for a class of codes that we call skew RS codes. These codes
are left ideals of a quotient of a skew polynomial ring, which endow them of a
sort of non-commutative cyclic structure. Since we work over an arbitrary
field, our techniques may be applied both to linear block codes and
convolutional codes. In particular, our decoding algorithm applies for block
codes beyond the classical cyclic case.
|
[
{
"version": "v1",
"created": "Thu, 2 Mar 2017 12:13:28 GMT"
}
] | 2017-03-03T00:00:00 |
[
[
"Gómez-Torrecillas",
"José",
""
],
[
"Lobillo",
"F. J.",
""
],
[
"Navarro",
"Gabriel",
""
]
] |
new_dataset
| 0.999505 |
1503.08623
|
Edd Barrett Dr
|
Edd Barrett, Carl Friedrich Bolz, Lukas Diekmann, Laurence Tratt
|
Fine-grained Language Composition: A Case Study
|
27 pages, 4 tables, 5 figures
|
European Conference on Object-Oriented Programming (ECOOP). July
2016, Pages 3:1--3:27
|
10.4230/LIPIcs.ECOOP.2016.3
| null |
cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
Although run-time language composition is common, it normally takes the form
of a crude Foreign Function Interface (FFI). While useful, such compositions
tend to be coarse-grained and slow. In this paper we introduce a novel
fine-grained syntactic composition of PHP and Python which allows users to
embed each language inside the other, including referencing variables across
languages. This composition raises novel design and implementation challenges.
We show that good solutions can be found to the design challenges; and that the
resulting implementation imposes an acceptable performance overhead of, at
most, 2.6x.
|
[
{
"version": "v1",
"created": "Mon, 30 Mar 2015 10:10:18 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Dec 2015 15:36:57 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jul 2016 11:39:51 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Barrett",
"Edd",
""
],
[
"Bolz",
"Carl Friedrich",
""
],
[
"Diekmann",
"Lukas",
""
],
[
"Tratt",
"Laurence",
""
]
] |
new_dataset
| 0.998375 |
1604.06959
|
David Wu
|
David J. Wu and Ankur Taly and Asim Shankar and Dan Boneh
|
Privacy, Discovery, and Authentication for the Internet of Things
|
Extended version of ESORICS 2016 paper
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Automatic service discovery is essential to realizing the full potential of
the Internet of Things (IoT). While discovery protocols like Multicast DNS,
Apple AirDrop, and Bluetooth Low Energy have gained widespread adoption across
both IoT and mobile devices, most of these protocols do not offer any form of
privacy control for the service, and often leak sensitive information such as
service type, device hostname, device owner's identity, and more in the clear.
To address the need for better privacy in both the IoT and the mobile
landscape, we develop two protocols for private service discovery and private
mutual authentication. Our protocols provide private and authentic service
advertisements, zero round-trip (0-RTT) mutual authentication, and are provably
secure in the Canetti-Krawczyk key-exchange model. In contrast to alternatives,
our protocols are lightweight and require minimal modification to existing
key-exchange protocols. We integrate our protocols into an existing open-source
distributed applications framework, and provide benchmarks on multiple hardware
platforms: Intel Edisons, Raspberry Pis, smartphones, laptops, and desktops.
Finally, we discuss some privacy limitations of the Apple AirDrop protocol (a
peer-to-peer file sharing mechanism) and show how to improve the privacy of
Apple AirDrop using our private mutual authentication protocol.
|
[
{
"version": "v1",
"created": "Sat, 23 Apr 2016 21:57:09 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jul 2016 08:07:13 GMT"
},
{
"version": "v3",
"created": "Tue, 28 Feb 2017 20:08:56 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Wu",
"David J.",
""
],
[
"Taly",
"Ankur",
""
],
[
"Shankar",
"Asim",
""
],
[
"Boneh",
"Dan",
""
]
] |
new_dataset
| 0.985851 |
1702.03775
|
Markus Borg
|
Markus Borg, Thomas Olsson, John Svensson
|
From LiDAR to Underground Maps via 5G - Business Models Enabling a
System-of-Systems Approach to Mapping the Kankberg Mine
|
Technical report origining in the PIMM project, Pilot for Industrial
Mobile communication in Mining. This work was funded by VINNOVA, the Swedish
Agency for Innovation Systems
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With ever-increasing productivity targets in mining operations, there is a
growing interest in mining automation. The PIMM project addresses the
fundamental challenge of network communication by constructing a pilot 5G
network in the underground mine Kankberg. In this report, we discuss how such a
5G network could constitute the essential infrastructure to organize existing
systems in Kankberg into a system-of-systems (SoS). In this report, we analyze
a scenario in which LiDAR equipped vehicles operating in the mine are connected
to existing mine mapping and positioning solutions. The approach is motivated
by the approaching era of remote controlled, or even autonomous, vehicles in
mining operations. The proposed SoS could ensure continuously updated maps of
Kankberg, rendered in unprecedented detail, supporting both productivity and
safety in the underground mine. We present four different SoS solutions from an
organizational point of view, discussing how development and operations of the
constituent systems could be distributed among Boliden and external
stakeholders, e.g., the vehicle suppliers, the hauling company, and the
developers of the mapping software. The four scenarios are compared from both
technical and business perspectives, and based on trade-off discussions and
SWOT analyses. We conclude our report by recommending continued research along
two future paths, namely a closer cooperation with the vehicle suppliers, and
further feasibility studies regarding establishing a Kankberg software
ecosystem.
|
[
{
"version": "v1",
"created": "Mon, 13 Feb 2017 13:55:32 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Mar 2017 11:20:03 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Borg",
"Markus",
""
],
[
"Olsson",
"Thomas",
""
],
[
"Svensson",
"John",
""
]
] |
new_dataset
| 0.99745 |
1702.05373
|
Gregory Cohen
|
Gregory Cohen, Saeed Afshar, Jonathan Tapson, Andr\'e van Schaik
|
EMNIST: an extension of MNIST to handwritten letters
|
The dataset is now available for download from
https://www.westernsydney.edu.au/bens/home/reproducible_research/emnist. This
link is also included in the revised article
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MNIST dataset has become a standard benchmark for learning,
classification and computer vision systems. Contributing to its widespread
adoption are the understandable and intuitive nature of the task, its
relatively small size and storage requirements and the accessibility and
ease-of-use of the database itself. The MNIST database was derived from a
larger dataset known as the NIST Special Database 19 which contains digits,
uppercase and lowercase handwritten letters. This paper introduces a variant of
the full NIST dataset, which we have called Extended MNIST (EMNIST), which
follows the same conversion paradigm used to create the MNIST dataset. The
result is a set of datasets that constitute a more challenging classification
tasks involving letters and digits, and that shares the same image structure
and parameters as the original MNIST task, allowing for direct compatibility
with all existing classifiers and systems. Benchmark results are presented
along with a validation of the conversion process through the comparison of the
classification results on converted NIST digits and the MNIST digits.
|
[
{
"version": "v1",
"created": "Fri, 17 Feb 2017 15:06:14 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Mar 2017 08:55:36 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Cohen",
"Gregory",
""
],
[
"Afshar",
"Saeed",
""
],
[
"Tapson",
"Jonathan",
""
],
[
"van Schaik",
"André",
""
]
] |
new_dataset
| 0.999875 |
1703.00050
|
Manolis Savva
|
Angel X. Chang, Mihail Eric, Manolis Savva, Christopher D. Manning
|
SceneSeer: 3D Scene Design with Natural Language
| null | null | null | null |
cs.GR cs.CL cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Designing 3D scenes is currently a creative task that requires significant
expertise and effort in using complex 3D design interfaces. This effortful
design process starts in stark contrast to the easiness with which people can
use language to describe real and imaginary environments. We present SceneSeer:
an interactive text to 3D scene generation system that allows a user to design
3D scenes using natural language. A user provides input text from which we
extract explicit constraints on the objects that should appear in the scene.
Given these explicit constraints, the system then uses a spatial knowledge base
learned from an existing database of 3D scenes and 3D object models to infer an
arrangement of the objects forming a natural scene matching the input
description. Using textual commands the user can then iteratively refine the
created scene by adding, removing, replacing, and manipulating objects. We
evaluate the quality of 3D scenes generated by SceneSeer in a perceptual
evaluation experiment where we compare against manually designed scenes and
simpler baselines for 3D scene generation. We demonstrate how the generated
scenes can be iteratively refined through simple natural language commands.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2017 20:47:47 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Chang",
"Angel X.",
""
],
[
"Eric",
"Mihail",
""
],
[
"Savva",
"Manolis",
""
],
[
"Manning",
"Christopher D.",
""
]
] |
new_dataset
| 0.999734 |
1703.00061
|
Manolis Savva
|
Manolis Savva, Angel X. Chang, Maneesh Agrawala
|
SceneSuggest: Context-driven 3D Scene Design
| null | null | null | null |
cs.GR cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present SceneSuggest: an interactive 3D scene design system providing
context-driven suggestions for 3D model retrieval and placement. Using a
point-and-click metaphor we specify regions in a scene in which to
automatically place and orient relevant 3D models. Candidate models are ranked
using a set of static support, position, and orientation priors learned from 3D
scenes. We show that our suggestions enable rapid assembly of indoor scenes. We
perform a user study comparing suggestions to manual search and selection, as
well as to suggestions with no automatic orientation. We find that suggestions
reduce total modeling time by 32%, that orientation priors reduce time spent
re-orienting objects by 27%, and that context-driven suggestions reduce the
number of text queries by 50%.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2017 21:21:03 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Savva",
"Manolis",
""
],
[
"Chang",
"Angel X.",
""
],
[
"Agrawala",
"Maneesh",
""
]
] |
new_dataset
| 0.998985 |
1703.00075
|
Rachid Haddadi
|
Rachid Haddadi, Elhassane Abdelmounim, Mustapha El Hanine, Abdelaziz
Belaguid
|
Discrete Wavelet Transform Based Algorithm for Recognition of QRS
Complexes
| null |
World of Computer Science and Information Technology Journal
(WCSIT) ; ISSN: 2221-0741; Vol. 4, No. 9, 127-132, 2014
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes the application of Discrete Wavelet Transform (DWT) to
detect the QRS (ECG is characterized by a recurrent wave sequence of P, QRS and
T-wave) of an electrocardiogram (ECG) signal. Wavelet Transform provides
localization in both time and frequency. In preprocessing stage, DWT is used to
remove the baseline wander in the ECG signal. The performance of the algorithm
of QRS detection is evaluated against the standard MIT BIH (Massachusetts
Institute of Technology, Beth Israel Hospital) Arrhythmia database. The average
QRS complexes detection rate of 98.1 % is achieved.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2017 22:12:00 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Haddadi",
"Rachid",
""
],
[
"Abdelmounim",
"Elhassane",
""
],
[
"Hanine",
"Mustapha El",
""
],
[
"Belaguid",
"Abdelaziz",
""
]
] |
new_dataset
| 0.958542 |
1703.00079
|
Mert Geveci
|
Mert Geveci
|
Fault Tolerant Thermal Control of Steam Turbine Shell Deflections
|
Six pages, nine figures, and one table
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The metal-to-metal clearances of a steam turbine during full or part load
operation are among the main drivers of efficiency. The requirement to add
clearances is driven by a number of factors including the relative movements of
the steam turbine shell and rotor during transient conditions such as startup
and shutdown. This paper includes a description of a control algorithm to
manage external heating blankets for the thermal control of the shell
deflections during turbine shutdown. The proposed method is tolerant of changes
in the heat loss characteristics of the system as well as simultaneous
component failures.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2017 22:31:52 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Geveci",
"Mert",
""
]
] |
new_dataset
| 0.990599 |
1703.00112
|
Lei Qiu
|
Lei Qiu, Yu Zhang, Li Zhang
|
Minimum Enclosing Circle of a Set of Static Points with Dynamic Weight
from One Free Point
|
14 pages, 8 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a set $S$ of $n$ static points and a free point $p$ in the Euclidean
plane, we study a new variation of the minimum enclosing circle problem, in
which a dynamic weight that equals to the reciprocal of the distance from the
free point $p$ to the undetermined circle center is included. In this work, we
prove the optimal solution of the new problem is unique and lies on the
boundary of the farthest-point Voronoi diagram of $S$, once $p$ does not
coincide with any vertex of the convex hull of $S$. We propose a tree structure
constructed from the boundary of the farthest-point Voronoi diagram and use the
hierarchical relationship between edges to locate the optimal solution. The
plane could be divide into at most $3n-4$ non-overlapping regions. When $p$
lies in one of the regions, the optimal solution locates at one node or lies on
the interior of one edge in the boundary of the farthest-point Voronoi diagram.
Moreover, we apply the new variation to calculate the maximum displacement of
one point $p$ under the condition that the displacements of points in $S$ are
restricted in 2D rigid motion.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 02:48:12 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Qiu",
"Lei",
""
],
[
"Zhang",
"Yu",
""
],
[
"Zhang",
"Li",
""
]
] |
new_dataset
| 0.963717 |
1703.00170
|
R\'ehan Noordally Mr.
|
R\'ehan Noordally, Xavier Nicolay, Yassine Gangat and Pascal Anelli
|
How long delays impact TCP performance for a connectivity from Reunion
Island ?
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
TCP is the protocol of transport the most used in the Internet and have a
heavy-dependence on delay. Reunion Island have a specific Internet connection,
based on main links to France, located 10.000 km away. As a result, the minimal
delay between Reunion Island and France is around 180 ms. In this paper, we
will study TCP traces collected in Reunion Island University. The goal is to
determine the metrics to study the impacts of long delays on TCP performance.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 08:03:29 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Noordally",
"Réhan",
""
],
[
"Nicolay",
"Xavier",
""
],
[
"Gangat",
"Yassine",
""
],
[
"Anelli",
"Pascal",
""
]
] |
new_dataset
| 0.979733 |
1703.00185
|
Alessandro Gabbana
|
E. Calore, A. Gabbana, J. Kraus, E. Pellegrini, S.F. Schifano, R.
Tripiccione
|
Massively parallel lattice-Boltzmann codes on large GPU clusters
| null | null |
10.1016/j.parco.2016.08.005
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a massively parallel code for a state-of-the art thermal
lattice- Boltzmann method. Our code has been carefully optimized for
performance on one GPU and to have a good scaling behavior extending to a large
number of GPUs. Versions of this code have been already used for large-scale
studies of convective turbulence. GPUs are becoming increasingly popular in HPC
applications, as they are able to deliver higher performance than traditional
processors. Writing efficient programs for large clusters is not an easy task
as codes must adapt to increasingly parallel architectures, and the overheads
of node-to-node communications must be properly handled. We describe the
structure of our code, discussing several key design choices that were guided
by theoretical models of performance and experimental benchmarks. We present an
extensive set of performance measurements and identify the corresponding main
bot- tlenecks; finally we compare the results of our GPU code with those
measured on other currently available high performance processors. Our results
are a production-grade code able to deliver a sustained performance of several
tens of Tflops as well as a design and op- timization methodology that can be
used for the development of other high performance applications for
computational physics.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 08:59:48 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Calore",
"E.",
""
],
[
"Gabbana",
"A.",
""
],
[
"Kraus",
"J.",
""
],
[
"Pellegrini",
"E.",
""
],
[
"Schifano",
"S. F.",
""
],
[
"Tripiccione",
"R.",
""
]
] |
new_dataset
| 0.971131 |
1703.00207
|
Aditya Ahuja
|
Aditya Ahuja
|
A Quantum-Classical Scheme towards Quantum Functional Encryption
|
13 pages
| null | null | null |
cs.CR quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum encryption is a well studied problem for both classical and quantum
information. However, little is known about quantum encryption schemes which
enable the user, under different keys, to learn different functions of the
plaintext, given the ciphertext. In this paper, we give a novel one-bit
secret-key quantum encryption scheme, a classical extension of which allows
different key holders to learn different length subsequences of the plaintext
from the ciphertext. We prove our quantum-classical scheme secure under the
notions of quantum semantic security, quantum entropic indistinguishability,
and recent security definitions from the field of functional encryption.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 10:11:52 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Ahuja",
"Aditya",
""
]
] |
new_dataset
| 0.961212 |
1703.00331
|
Mahyar Shahsavari
|
Mahyar Shahsavari (CRIStAL), Pierre Boulet (CRIStAL)
|
Memristor nanodevice for unconventional computing:review and
applications
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A memristor is a two-terminal nanodevice that its properties attract a wide
community of researchers from various domains such as physics, chemistry,
electronics, computer and neuroscience.The simple structure for manufacturing,
small scalability, nonvolatility and potential of using inlow power platforms
are outstanding characteristics of this emerging nanodevice. In this report,we
review a brief literature of memristor from mathematic model to the physical
realization. Wediscuss different classes of memristors based on the material
used for its manufacturing. Thepotential applications of memristor are
presented and a wide domain of applications are explainedand classified.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 15:05:44 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Shahsavari",
"Mahyar",
"",
"CRIStAL"
],
[
"Boulet",
"Pierre",
"",
"CRIStAL"
]
] |
new_dataset
| 0.998742 |
1703.00369
|
Rob Meijer
|
Rob J Meijer
|
MattockFS; Page-cache and access-control concerns in asynchronous
message-based forensic frameworks on the Linux platform
|
dissertation, Univ College London, June 2016
| null |
10.13140/RG.2.2.35426.53440
| null |
cs.CR
|
http://creativecommons.org/licenses/by/4.0/
|
In this dissertation the feasibility of creating a page-cache efficient
storage- and messaging solution with integrity geared access control for a
scalable forensic framework is researched. The Open Computer Forensics
Architecture (OCFA),a lab-side scalable computer forensics framework,
introduced the concept of a message passing concurrency based forensic
framework. Since then, the amount of per-investigation data to be processed in
a lab environment has continued to grow significantly while available RAM and
CPU processing power combined with prohibitive cost and limited capacity of SSD
solutions have shifted processing from being largely CPU constrained to being
much more IO constrained. OCFA suffered from several page-cache-miss related
performance issues that have grown more significant as a result of this shift.
In the light of anti-forensics and general issues related to process integrity,
OCFA did not leverage the power of its message passing based design to address
integrity concerns.
The main purpose of this dissertation is to analyze and evaluate a number of
page-cache friendly technologies that could contribute to the creation of a
computer forensics lab-geared scalable message-passing-concurrency based
forensic framework with a significantly reduced quantity of page-cache-miss
induced spurious IO operations, taking into account integrity related issues.
Provenance logs from historic investigations conducted using the Open
Computer Forensics Architecture were thoroughly analyzed in this study, during
which several bottlenecks and design flaws in OCFA were identified. A number of
strategies were devised to address these bottlenecks in future computer
forensic frameworks. Finally, the most prominently page-cache related
strategies were consolidated with access-control measures into a user-space
file-system and low-level API prototype.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 16:30:20 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Meijer",
"Rob J",
""
]
] |
new_dataset
| 0.951817 |
1703.00426
|
Francois Chollet
|
Cezary Kaliszyk, Fran\c{c}ois Chollet, Christian Szegedy
|
HolStep: A Machine Learning Dataset for Higher-order Logic Theorem
Proving
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large computer-understandable proofs consist of millions of intermediate
logical steps. The vast majority of such steps originate from manually selected
and manually guided heuristics applied to intermediate goals. So far, machine
learning has generally not been used to filter or generate these steps. In this
paper, we introduce a new dataset based on Higher-Order Logic (HOL) proofs, for
the purpose of developing new machine learning-based theorem-proving
strategies. We make this dataset publicly available under the BSD license. We
propose various machine learning tasks that can be performed on this dataset,
and discuss their significance for theorem proving. We also benchmark a set of
simple baseline machine learning models suited for the tasks (including
logistic regression, convolutional neural networks and recurrent neural
networks). The results of our baseline models show the promise of applying
machine learning to HOL theorem proving.
|
[
{
"version": "v1",
"created": "Wed, 1 Mar 2017 18:20:19 GMT"
}
] | 2017-03-02T00:00:00 |
[
[
"Kaliszyk",
"Cezary",
""
],
[
"Chollet",
"François",
""
],
[
"Szegedy",
"Christian",
""
]
] |
new_dataset
| 0.999831 |
1501.06091
|
Mostafa El-Khamy
|
Mostafa El-Khamy, Hessam Mahdavifar, Gennady Feygin, Jungwon Lee,
Inyup Kang
|
Relaxed Polar Codes
|
Conference version,Relaxed Channel Polarization for Reduced
Complexity Polar Coding, accepted for presentation at IEEE Wireless
Communications and Networking Conference WCNC 2015
|
IEEE Transactions on Information Theory, 2017
|
10.1109/TIT.2017.2657691
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes are the latest breakthrough in coding theory, as they are the
first family of codes with explicit construction that provably achieve the
symmetric capacity of discrete memoryless channels. Ar{\i}kan's polar encoder
and successive cancellation decoder have complexities of $N \log N$, for code
length $N$. Although, the complexity bound of $N \log N$ is asymptotically
favorable, we report in this work methods to further reduce the encoding and
decoding complexities of polar coding. The crux is to relax the polarization of
certain bit-channels without performance degradation. We consider schemes for
relaxing the polarization of both \emph{very good} and \emph{very bad}
bit-channels, in the process of channel polarization. Relaxed polar codes are
proved to preserve the capacity achieving property of polar codes. Analytical
bounds on the asymptotic and finite-length complexity reduction attainable by
relaxed polarization are derived.
For binary erasure channels, we show that the computation complexity can be
reduced by a factor of 6, while preserving the rate and error performance. We
also show that relaxed polar codes can be decoded with significantly reduced
latency. For AWGN channels with medium code lengths, we show that relaxed polar
codes can have lower error probabilities than conventional polar codes, while
having reduced encoding and decoding computation complexities.
|
[
{
"version": "v1",
"created": "Sat, 24 Jan 2015 22:51:54 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Jul 2015 08:32:06 GMT"
}
] | 2017-03-01T00:00:00 |
[
[
"El-Khamy",
"Mostafa",
""
],
[
"Mahdavifar",
"Hessam",
""
],
[
"Feygin",
"Gennady",
""
],
[
"Lee",
"Jungwon",
""
],
[
"Kang",
"Inyup",
""
]
] |
new_dataset
| 0.999695 |
1504.08248
|
Palash Dey
|
Palash Dey, Neeldhara Misra, and Y. Narahari
|
Frugal Bribery in Voting
|
Full version has been accepted in Theoretical Computer Science
| null | null | null |
cs.AI cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bribery in elections is an important problem in computational social choice
theory. However, bribery with money is often illegal in elections. Motivated by
this, we introduce the notion of frugal bribery and formulate two new pertinent
computational problems which we call Frugal-bribery and Frugal- $bribery to
capture bribery without money in elections. In the proposed model, the briber
is frugal in nature and this is captured by her inability to bribe votes of a
certain kind, namely, non-vulnerable votes. In the Frugal-bribery problem, the
goal is to make a certain candidate win the election by changing only
vulnerable votes. In the Frugal-{dollar}bribery problem, the vulnerable votes
have prices and the goal is to make a certain candidate win the election by
changing only vulnerable votes, subject to a budget constraint of the briber.
We further formulate two natural variants of the Frugal-{dollar}bribery problem
namely Uniform-frugal-{dollar}bribery and Nonuniform-frugal-{dollar}bribery
where the prices of the vulnerable votes are, respectively, all the same or
different.
We study the computational complexity of the above problems for unweighted
and weighted elections for several commonly used voting rules. We observe that,
even if we have only a small number of candidates, the problems are intractable
for all voting rules studied here for weighted elections, with the sole
exception of the Frugal-bribery problem for the plurality voting rule. In
contrast, we have polynomial time algorithms for the Frugal-bribery problem for
plurality, veto, k-approval, k-veto, and plurality with runoff voting rules for
unweighted elections. However, the Frugal-{dollar}bribery problem is
intractable for all the voting rules studied here barring the plurality and the
veto voting rules for unweighted elections.
|
[
{
"version": "v1",
"created": "Thu, 30 Apr 2015 14:42:34 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Nov 2016 16:39:10 GMT"
},
{
"version": "v3",
"created": "Tue, 28 Feb 2017 16:51:02 GMT"
}
] | 2017-03-01T00:00:00 |
[
[
"Dey",
"Palash",
""
],
[
"Misra",
"Neeldhara",
""
],
[
"Narahari",
"Y.",
""
]
] |
new_dataset
| 0.998668 |
1508.03062
|
Steven Chaplick
|
Kathie Cameron, Steven Chaplick, Chinh T. Hoang
|
On the structure of (pan, even hole)-free graphs
|
Accepted to appear in the Journal of Graph Theory
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A hole is a chordless cycle with at least four vertices. A pan is a graph
which consists of a hole and a single vertex with precisely one neighbor on the
hole. An even hole is a hole with an even number of vertices. We prove that a
(pan, even hole)-free graph can be decomposed by clique cutsets into
essentially unit circular-arc graphs. This structure theorem is the basis of
our $O(nm)$-time certifying algorithm for recognizing (pan, even hole)-free
graphs and for our $O(n^{2.5}+nm)$-time algorithm to optimally color them.
Using this structure theorem, we show that the tree-width of a (pan, even
hole)-free graph is at most 1.5 times the clique number minus 1, and thus the
chromatic number is at most 1.5 times the clique number.
|
[
{
"version": "v1",
"created": "Wed, 12 Aug 2015 20:38:01 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Feb 2017 09:07:22 GMT"
}
] | 2017-03-01T00:00:00 |
[
[
"Cameron",
"Kathie",
""
],
[
"Chaplick",
"Steven",
""
],
[
"Hoang",
"Chinh T.",
""
]
] |
new_dataset
| 0.994396 |
1611.00159
|
S. B. Balaji
|
S.B.Balaji, P.Vijay Kumar
|
Bounds on Codes with Locality and Availability
|
submitted to ISIT 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we investigate bounds on rate and minimum distance of codes
with $t$ availability. We present bounds on minimum distance of a code with $t$
availability that are tighter than existing bounds. For bounds on rate of a
code with $t$ availability, we restrict ourselves to a sub-class of codes with
$t$ availability called codes with strict $t$ availability and derive a tighter
rate bound. Codes with strict $t$ availability can be defined as the null space
of an $(m \times n)$ parity-check matrix $H$, where each row has weight $(r+1)$
and each column has weight $t$, with intersection between support of any two
rows atmost one. We also present two general constructions for codes with $t$
availability.
|
[
{
"version": "v1",
"created": "Tue, 1 Nov 2016 08:25:44 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Nov 2016 06:06:18 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Feb 2017 18:56:12 GMT"
},
{
"version": "v4",
"created": "Mon, 13 Feb 2017 05:08:07 GMT"
},
{
"version": "v5",
"created": "Tue, 28 Feb 2017 16:15:24 GMT"
}
] | 2017-03-01T00:00:00 |
[
[
"Balaji",
"S. B.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.999839 |
1612.04265
|
Trinabh Gupta
|
Trinabh Gupta, Henrique Fingler, Lorenzo Alvisi, Michael Walfish
|
Pretzel: Email encryption and provider-supplied functions are compatible
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emails today are often encrypted, but only between mail servers---the vast
majority of emails are exposed in plaintext to the mail servers that handle
them. While better than no encryption, this arrangement leaves open the
possibility of attacks, privacy violations, and other disclosures. Publicly,
email providers have stated that default end-to-end encryption would conflict
with essential functions (spam filtering, etc.), because the latter requires
analyzing email text. The goal of this paper is to demonstrate that there is no
conflict. We do so by designing, implementing, and evaluating Pretzel. Starting
from a cryptographic protocol that enables two parties to jointly perform a
classification task without revealing their inputs to each other, Pretzel
refines and adapts this protocol to the email context. Our experimental
evaluation of a prototype demonstrates that email can be encrypted end-to-end
\emph{and} providers can compute over it, at tolerable cost: clients must
devote some storage and processing, and provider overhead is roughly 5 times
versus the status quo.
|
[
{
"version": "v1",
"created": "Tue, 13 Dec 2016 16:21:39 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Dec 2016 02:32:23 GMT"
},
{
"version": "v3",
"created": "Mon, 27 Feb 2017 21:47:34 GMT"
}
] | 2017-03-01T00:00:00 |
[
[
"Gupta",
"Trinabh",
""
],
[
"Fingler",
"Henrique",
""
],
[
"Alvisi",
"Lorenzo",
""
],
[
"Walfish",
"Michael",
""
]
] |
new_dataset
| 0.999733 |
1702.08819
|
Xuan Zhang
|
Xuan Zhang, Wenbo Shi, Qinran Hu, Bin Yan, Ali Malkawi and Na Li
|
Distributed Temperature Control via Geothermal Heat Pump Systems in
Energy Efficient Buildings
|
8 pages, 10 figures, in Proc. of 2017 American Control Conference,
the long version. arXiv admin note: text overlap with arXiv:1702.03308
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Geothermal Heat Pump (GHP) systems are heating and cooling systems that use
the ground as the temperature exchange medium. GHP systems are becoming more
and more popular in recent years due to their high efficiency. Conventional
control schemes of GHP systems are mainly designed for buildings with a single
thermal zone. For large buildings with multiple thermal zones, those control
schemes either lose efficiency or become costly to implement requiring a lot of
real-time measurement, communication and computation. In this paper, we focus
on developing energy efficient control schemes for GHP systems in buildings
with multiple zones. We present a thermal dynamic model of a building equipped
with a GHP system for floor heating/cooling and formulate the GHP system
control problem as a resource allocation problem with the objective to maximize
user comfort in different zones and to minimize the building energy
consumption. We then propose real-time distributed algorithms to solve the
control problem. Our distributed multi-zone control algorithms are scalable and
do not need to measure or predict any exogenous disturbances such as the
outdoor temperature and indoor heat gains. Thus, it is easy to implement them
in practice. Simulation results demonstrate the effectiveness of the proposed
control schemes.
|
[
{
"version": "v1",
"created": "Tue, 28 Feb 2017 15:18:13 GMT"
}
] | 2017-03-01T00:00:00 |
[
[
"Zhang",
"Xuan",
""
],
[
"Shi",
"Wenbo",
""
],
[
"Hu",
"Qinran",
""
],
[
"Yan",
"Bin",
""
],
[
"Malkawi",
"Ali",
""
],
[
"Li",
"Na",
""
]
] |
new_dataset
| 0.990868 |
cs/0408011
|
Marcel Wild
|
Marcel Wild
|
The asymptotic number of binary codes and binary matroids
|
12 pages
|
SIAM Journal of Discrete Mathematics 19 (2005) 691-699
| null | null |
cs.IT cs.DM math.IT
| null |
The asyptotic number of nonequivalent binary n-codes is determined. This is
also the asymptotic number of nonisomorphic binary n-matroids. The connection
to a result of Lefmann, Roedl, Phelps is explored. The latter states that
almost all binary n-codes have a trivial automorphism group.
|
[
{
"version": "v1",
"created": "Wed, 4 Aug 2004 14:46:49 GMT"
}
] | 2017-03-01T00:00:00 |
[
[
"Wild",
"Marcel",
""
]
] |
new_dataset
| 0.999719 |
1602.07267
|
Dmitry Ignatov
|
Dmitry I. Ignatov
|
On closure operators related to maximal tricliques in tripartite
hypergraphs
|
Draft for spec. issue of DAM (2015)
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Triadic Formal Concept Analysis (3FCA) was introduced by Lehman and Wille
almost two decades ago. And many researchers work in Data Mining and Formal
Concept Analysis using the notions of closed sets, Galois and closure
operators, closure systems, but up-to-date even though that different
researchers actively work on mining triadic and n-ary relations, a proper
closure operator for enumeration of triconcepts, i.e. maximal triadic cliques
of tripartite hypergaphs, was not introduced. In this paper we show that the
previously introduced operators for obtaining triconcepts and maximal connected
and complete sets (MCCSs) are not always consistent and provide the reader with
a definition of valid closure operator and associated set system. Moreover, we
study the difficulties of related problems from order-theoretic and
combinatorial point view as well as provide the reader with justifications of
the complexity classes of these problems.
|
[
{
"version": "v1",
"created": "Tue, 23 Feb 2016 19:13:00 GMT"
},
{
"version": "v2",
"created": "Sun, 26 Feb 2017 12:16:05 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Ignatov",
"Dmitry I.",
""
]
] |
new_dataset
| 0.996589 |
1605.01148
|
Viirj Kan
|
Viirj Kan, Emma Vargo, Noa Machover, Hiroshi Ishii, Serena Pan,
Weixuan Chen, Yasuaki Kakehi
|
Organic Primitives: Synthesis and Design of pH-Reactive Materials using
Molecular I/O for Sensing, Actuation, and Interaction
|
Updated paper
| null |
10.1145/3025453.3025952
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present Organic Primitives, an enabling toolbox that expands
upon the library of input-output devices in HCI and facilitates the design of
interactions with organic, fluid-based systems. We formulated color, odor and
shape changing material primitives which act as sensor-actuators that convert
pH signals into human-readable outputs. Food-grade organic molecules
anthocyanin, vanillin, and chitosan were employed as dopants to synthesize
materials which output a spectrum of colors, degrees of shape deformation, and
switch between odorous and non-odorous states. We evaluated the individual
output properties of our sensor-actuators to assess the rate, range, and
reversibility of the changes as a function of pH 2-10. We present a design
space with techniques for enhancing the functionality of the material
primitives, and offer passive and computational methods for controlling the
material interfaces. Finally, we explore applications enabled by Organic
Primitives under four contexts: environmental, cosmetic, edible, and
interspecies.
|
[
{
"version": "v1",
"created": "Wed, 4 May 2016 05:33:44 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Feb 2017 02:23:43 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Kan",
"Viirj",
""
],
[
"Vargo",
"Emma",
""
],
[
"Machover",
"Noa",
""
],
[
"Ishii",
"Hiroshi",
""
],
[
"Pan",
"Serena",
""
],
[
"Chen",
"Weixuan",
""
],
[
"Kakehi",
"Yasuaki",
""
]
] |
new_dataset
| 0.999197 |
1607.08344
|
Nicolas Gilberto Gutierrez Ortiz
|
Nicolas Gutierrez and Manuela Wiesinger-Widi
|
AUGURY: A time-series based application for the analysis and forecasting
of system and network performance metrics
|
8 pages, 9 figures, submitted to SYNASC2016
| null |
10.1109/SYNASC.2016.062
| null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents AUGURY, an application for the analysis of monitoring
data from computers, servers or cloud infrastructures. The analysis is based on
the extraction of patterns and trends from historical data, using elements of
time-series analysis. The purpose of AUGURY is to aid a server administrator by
forecasting the behaviour and resource usage of specific applications and in
presenting a status report in a concise manner. AUGURY provides tools for
identifying network traffic congestion and peak usage times, and for making
memory usage projections. The application data processing specialises in two
tasks: the parametrisation of the memory usage of individual applications and
the extraction of the seasonal component from network traffic data. AUGURY uses
a different underlying assumption for each of these two tasks. With respect to
the memory usage, a limited number of single-valued parameters are assumed to
be sufficient to parameterize any application being hosted on the server.
Regarding the network traffic data, long-term patterns, such as hourly or daily
exist and are being induced by work-time schedules and automatised
administrative jobs. In this paper, the implementation of each of the two tasks
is presented, tested using locally-generated data, and applied to data from
weather forecasting applications hosted on a web server. This data is used to
demonstrate the insight that AUGURY can add to the monitoring of server and
cloud infrastructures.
|
[
{
"version": "v1",
"created": "Thu, 28 Jul 2016 08:02:29 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Gutierrez",
"Nicolas",
""
],
[
"Wiesinger-Widi",
"Manuela",
""
]
] |
new_dataset
| 0.998938 |
1610.08914
|
Lucas Dixon
|
Ellery Wulczyn, Nithum Thain, Lucas Dixon
|
Ex Machina: Personal Attacks Seen at Scale
| null | null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
The damage personal attacks cause to online discourse motivates many
platforms to try to curb the phenomenon. However, understanding the prevalence
and impact of personal attacks in online platforms at scale remains
surprisingly difficult. The contribution of this paper is to develop and
illustrate a method that combines crowdsourcing and machine learning to analyze
personal attacks at scale. We show an evaluation method for a classifier in
terms of the aggregated number of crowd-workers it can approximate. We apply
our methodology to English Wikipedia, generating a corpus of over 100k high
quality human-labeled comments and 63M machine-labeled ones from a classifier
that is as good as the aggregate of 3 crowd-workers, as measured by the area
under the ROC curve and Spearman correlation. Using this corpus of
machine-labeled scores, our methodology allows us to explore some of the open
questions about the nature of online personal attacks. This reveals that the
majority of personal attacks on Wikipedia are not the result of a few malicious
users, nor primarily the consequence of allowing anonymous contributions from
unregistered users.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2016 18:18:18 GMT"
},
{
"version": "v2",
"created": "Sat, 25 Feb 2017 18:38:16 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Wulczyn",
"Ellery",
""
],
[
"Thain",
"Nithum",
""
],
[
"Dixon",
"Lucas",
""
]
] |
new_dataset
| 0.98758 |
1611.01702
|
Adji Bousso Dieng
|
Adji B. Dieng, Chong Wang, Jianfeng Gao, John Paisley
|
TopicRNN: A Recurrent Neural Network with Long-Range Semantic Dependency
|
International Conference on Learning Representations
| null | null | null |
cs.CL cs.AI cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose TopicRNN, a recurrent neural network (RNN)-based
language model designed to directly capture the global semantic meaning
relating words in a document via latent topics. Because of their sequential
nature, RNNs are good at capturing the local structure of a word sequence -
both semantic and syntactic - but might face difficulty remembering long-range
dependencies. Intuitively, these long-range dependencies are of semantic
nature. In contrast, latent topic models are able to capture the global
underlying semantic structure of a document but do not account for word
ordering. The proposed TopicRNN model integrates the merits of RNNs and latent
topic models: it captures local (syntactic) dependencies using an RNN and
global (semantic) dependencies using latent topics. Unlike previous work on
contextual RNN language modeling, our model is learned end-to-end. Empirical
results on word prediction show that TopicRNN outperforms existing contextual
RNN baselines. In addition, TopicRNN can be used as an unsupervised feature
extractor for documents. We do this for sentiment analysis on the IMDB movie
review dataset and report an error rate of $6.28\%$. This is comparable to the
state-of-the-art $5.91\%$ resulting from a semi-supervised approach. Finally,
TopicRNN also yields sensible topics, making it a useful alternative to
document models such as latent Dirichlet allocation.
|
[
{
"version": "v1",
"created": "Sat, 5 Nov 2016 21:25:07 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Feb 2017 03:03:38 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Dieng",
"Adji B.",
""
],
[
"Wang",
"Chong",
""
],
[
"Gao",
"Jianfeng",
""
],
[
"Paisley",
"John",
""
]
] |
new_dataset
| 0.995423 |
1702.07044
|
Anran Wang
|
Anran Wang, Vikram Iyer, Vamsi Talla, Joshua R. Smith and Shyamnath
Gollakota
|
FM Backscatter: Enabling Connected Cities and Smart Fabrics
|
NSDI 2017
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper enables connectivity on everyday objects by transforming them into
FM radio stations. To do this, we show for the first time that ambient FM radio
signals can be used as a signal source for backscatter communication. Our
design creates backscatter transmissions that can be decoded on any FM receiver
including those in cars and smartphones. This enables us to achieve a
previously infeasible capability: backscattering information to cars and
smartphones in outdoor environments.
Our key innovation is a modulation technique that transforms backscatter,
which is a multiplication operation on RF signals, into an addition operation
on the audio signals output by FM receivers. This enables us to embed both
digital data as well as arbitrary audio into ambient analog FM radio signals.
We build prototype hardware of our design and successfully embed audio
transmissions over ambient FM signals. Further, we achieve data rates of up to
3.2 kbps and ranges of 5-60 feet, while consuming as little as 11.07{\mu}W of
power. To demonstrate the potential of our design, we also fabricate our
prototype on a cotton t-shirt by machine sewing patterns of a conductive thread
to create a smart fabric that can transmit data to a smartphone. We also embed
FM antennas into posters and billboards and show that they can communicate with
FM receivers in cars and smartphones.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 23:37:34 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Feb 2017 23:57:27 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Wang",
"Anran",
""
],
[
"Iyer",
"Vikram",
""
],
[
"Talla",
"Vamsi",
""
],
[
"Smith",
"Joshua R.",
""
],
[
"Gollakota",
"Shyamnath",
""
]
] |
new_dataset
| 0.996501 |
1702.07484
|
Uli Fahrenberg
|
Uli Fahrenberg, Axel Legay
|
Featured Weighted Automata
| null | null | null | null |
cs.FL cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A featured transition system is a transition system in which the transitions
are annotated with feature expressions: Boolean expressions on a finite number
of given features. Depending on its feature expression, each individual
transition can be enabled when some features are present, and disabled for
other sets of features. The behavior of a featured transition system hence
depends on a given set of features. There are algorithms for featured
transition systems which can check their properties for all sets of features at
once, for example for LTL or CTL properties.
Here we introduce a model of featured weighted automata which combines
featured transition systems and (semiring-) weighted automata. We show that
methods and techniques from weighted automata extend to featured weighted
automata and devise algorithms to compute quantitative properties of featured
weighted automata for all sets of features at once. We show applications to
minimum reachability and to energy properties.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2017 07:40:36 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Feb 2017 06:30:58 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Fahrenberg",
"Uli",
""
],
[
"Legay",
"Axel",
""
]
] |
new_dataset
| 0.998992 |
1702.07753
|
Craig DeForest
|
C.E. DeForest, K. Glazebrook
|
Practical Magick with C, PDL, and PDL::PP -- a guide to compiled add-ons
for PDL
|
42 pages, 1 figure, overview of the PDL::PP description language for
vectorized calculation
| null | null | null |
cs.PL
|
http://creativecommons.org/licenses/by/4.0/
|
This guide is intended to knit together, and extend, the existing PP and C
documentation on PDL internals. It draws heavily from prior work by the authors
of the code. Special thanks go to Christian Soeller, and Tuomas Lukka, who
together with Glazebrook conceived and implemented PDL and PP; and to Chris
Marshall, who has led the PDL development team through several groundbreaking
releases and to new levels of usability.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2017 20:45:52 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"DeForest",
"C. E.",
""
],
[
"Glazebrook",
"K.",
""
]
] |
new_dataset
| 0.999803 |
1702.07784
|
Emiliano De Cristofaro
|
Despoina Chatzakou, Nicolas Kourtellis, Jeremy Blackburn, Emiliano De
Cristofaro, Gianluca Stringhini, Athena Vakali
|
Measuring #GamerGate: A Tale of Hate, Sexism, and Bullying
|
WWW Cybersafety Workshop 2017
| null | null | null |
cs.SI cs.AI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the past few years, online aggression and abusive behaviors have
occurred in many different forms and on a variety of platforms. In extreme
cases, these incidents have evolved into hate, discrimination, and bullying,
and even materialized into real-world threats and attacks against individuals
or groups. In this paper, we study the Gamergate controversy. Started in August
2014 in the online gaming world, it quickly spread across various social
networking platforms, ultimately leading to many incidents of cyberbullying and
cyberaggression. We focus on Twitter, presenting a measurement study of a
dataset of 340k unique users and 1.6M tweets to study the properties of these
users, the content they post, and how they differ from random Twitter users. We
find that users involved in this "Twitter war" tend to have more friends and
followers, are generally more engaged and post tweets with negative sentiment,
less joy, and more hate than random users. We also perform preliminary
measurements on how the Twitter suspension mechanism deals with such abusive
behaviors. While we focus on Gamergate, our methodology to collect and analyze
tweets related to aggressive and bullying activities is of independent
interest.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2017 22:14:30 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Chatzakou",
"Despoina",
""
],
[
"Kourtellis",
"Nicolas",
""
],
[
"Blackburn",
"Jeremy",
""
],
[
"De Cristofaro",
"Emiliano",
""
],
[
"Stringhini",
"Gianluca",
""
],
[
"Vakali",
"Athena",
""
]
] |
new_dataset
| 0.99773 |
1702.07831
|
Bocong Chen
|
Bocong Chen, Hongwei Liu
|
New constructions of MDS codes with complementary duals
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Linear complementary-dual (LCD for short) codes are linear codes that
intersect with their duals trivially. LCD codes have been used in certain
communication systems. It is recently found that LCD codes can be applied in
cryptography. This application of LCD codes renewed the interest in the
construction of LCD codes having a large minimum distance. MDS codes are
optimal in the sense that the minimum distance cannot be improved for given
length and code size. Constructing LCD MDS codes is thus of significance in
theory and practice. Recently, Jin (\cite{Jin}, IEEE Trans. Inf. Theory, 2016)
constructed several classes of LCD MDS codes through generalized Reed-Solomon
codes. In this paper, a different approach is proposed to obtain new LCD MDS
codes from generalized Reed-Solomon codes. Consequently, new code constructions
are provided and certain previously known results in \cite{Jin} are extended.
|
[
{
"version": "v1",
"created": "Sat, 25 Feb 2017 03:48:40 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Chen",
"Bocong",
""
],
[
"Liu",
"Hongwei",
""
]
] |
new_dataset
| 0.999269 |
1702.07946
|
Erik Rye
|
Erik Rye, Robert Beverly
|
SDN as Active Measurement Infrastructure
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Active measurements are integral to the operation and management of networks,
and invaluable to supporting empirical network research. Unfortunately, it is
often cost-prohibitive and logistically difficult to widely deploy measurement
nodes, especially in the core. In this work, we consider the feasibility of
tightly integrating measurement within the infrastructure by using Software
Defined Networks (SDNs). We introduce "SDN as Active Measurement
Infrastructure" (SAAMI) to enable measurements to originate from any location
where SDN is deployed, removing the need for dedicated measurement nodes and
increasing vantage point diversity. We implement ping and traceroute using
SAAMI, as well as a proof-of-concept custom measurement protocol to demonstrate
the power and ease of SAAMI's open framework. Via a large-scale measurement
campaign using SDN switches as vantage points, we show that SAAMI is accurate,
scalable, and extensible.
|
[
{
"version": "v1",
"created": "Sat, 25 Feb 2017 21:01:28 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Rye",
"Erik",
""
],
[
"Beverly",
"Robert",
""
]
] |
new_dataset
| 0.979434 |
1702.07951
|
Wolfgang Mauerer
|
Florian Murr and Wolfgang Mauerer
|
McFSM: Globally Taming Complex Systems
|
To appear in SEsCPS@ICSE2017
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Industrial computing devices, in particular cyber-physical, real-time and
safety-critical systems, focus on reacting to external events and the need to
cooperate with other devices to create a functional system. They are often
implemented with languages that focus on a simple, local description of how a
component reacts to external input data and stimuli. Despite the trend in
modern software architectures to structure systems into largely independent
components, the remaining interdependencies still create rich behavioural
dynamics even for small systems. Standard and industrial programming approaches
do usually not model or extensively describe the global properties of an entire
system. Although a large number of approaches to solve this dilemma have been
suggested, it remains a hard and error-prone task to implement systems with
complex interdependencies correctly.
We introduce multiple coupled finite state machines (McFSMs), a novel
mechanism that allows us to model and manage such interdependencies. It is
based on a consistent, well-structured and simple global description. A sound
theoretical foundation is provided, and associated tools allow us to generate
efficient low-level code in various programming languages using model-driven
techniques. We also present a domain specific language to express McFSMs and
their connections to other systems, to model their dynamic behaviour, and to
investigate their efficiency and correctness at compile-time.
|
[
{
"version": "v1",
"created": "Sat, 25 Feb 2017 21:35:56 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Murr",
"Florian",
""
],
[
"Mauerer",
"Wolfgang",
""
]
] |
new_dataset
| 0.997242 |
1702.07960
|
Qiang Wu
|
Xingchen Li, Qiang Wu, Nan Zhang
|
Citation personal display: A case study of personal websites by
physicists in 11 well-known universities
|
25 pages, 4 figures, Journal of Documentation, 2017
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper aims to investigate the extent to which researchers display
citation, and wants to examine whether there are researcher differences in
citation personal display at the level of university, country, and academic
rank. Physicists in 11 well-known universities in USA, Britain, and China were
chosen as the object of study. It was manually identified if physicists had
mentioned citation counts, citation-based indices, or a link to Google Scholar
Citations (GSC) on the personal websites. A chi-square test is constructed to
test researcher differences in citation personal display. Results showed that
the overall proportion of citation personal display is not high (14.8%), with
129 of 870 physicists displaying citation. And physicists from different
well-known universities indeed had a significant difference in citation
personal display. Moreover, at the national level, it was noticed that
physicists in well-known Chinese universities had the highest level of citation
personal display, followed by Britain and the USA. Further, this study also
found that researchers who had the academic rank of professor had the highest
citation personal display. In addition, the differences in h-index personal
display by university, country or academic rank were analyzed, and the results
showed that they were not statistically significant.
|
[
{
"version": "v1",
"created": "Sun, 26 Feb 2017 00:46:11 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Li",
"Xingchen",
""
],
[
"Wu",
"Qiang",
""
],
[
"Zhang",
"Nan",
""
]
] |
new_dataset
| 0.972056 |
1702.08006
|
Arthur-Jozsef Molnar
|
Arthur-Jozsef Molnar, J\"urgen Gro{\ss}mann
|
CRSTIP - An Assessment Scheme for Security Assessment Processes
|
IEEE International Symposium on Software Reliability Engineering
Workshops (ISSREW), 2014
| null |
10.1109/ISSREW.2014.16
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Complex networked systems are an integral part of today's support
infrastructures. Due to their importance, these systems become more and more
the target for cyber-attacks, suffering a notable number of security incidents.
Also, they are subject to regulation by national and international legislation.
An operator of such an infrastructure or system is responsible for ensuring its
security and correct functioning in order to satisfy customers. In addition,
the entire process of risk and quality control needs to be efficient and
manageable. This short paper introduces the Compliance, Risk Assessment and
Security Testing Improvement Profiling (CRSTIP) scheme. CRSTIP is an evaluation
scheme that enables assessing the maturity of security assessment processes,
taking into consideration systematic use of formalisms, integration and
tool-support in the areas of compliance assessment, security risk assessment
and security testing. The paper describes the elements of the scheme and their
application to one of the case studies of the RASEN research project.
|
[
{
"version": "v1",
"created": "Sun, 26 Feb 2017 09:10:06 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Molnar",
"Arthur-Jozsef",
""
],
[
"Großmann",
"Jürgen",
""
]
] |
new_dataset
| 0.997159 |
1702.08008
|
Arthur-Jozsef Molnar
|
Arthur-Jozsef Molnar
|
JETracer - A Framework for Java GUI Event Tracing
|
Proceedings of ENASE 2015, ISBN: 978-989-758-100-7
| null |
10.5220/0005372902070214
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present paper introduces the open-source Java Event Tracer (JETracer)
framework for real-time tracing of GUI events within applications based on the
AWT, Swing or SWT graphical toolkits. Our framework provides a common event
model for supported toolkits, the possibility of receiving GUI events in
real-time, good performance in the case of complex target applications and the
possibility of deployment over a network. The present paper provides the
rationale for JETracer, presents related research and details its technical
implementation. An empirical evaluation where JETracer is used to trace GUI
events within five popular, open-source applications is also presented.
|
[
{
"version": "v1",
"created": "Sun, 26 Feb 2017 09:28:55 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Molnar",
"Arthur-Jozsef",
""
]
] |
new_dataset
| 0.998274 |
1702.08042
|
Caetano Sauer
|
Caetano Sauer, Goetz Graefe, Theo H\"arder
|
Instant restore after a media failure
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Media failures usually leave database systems unavailable for several hours
until recovery is complete, especially in applications with large devices and
high transaction volume. Previous work introduced a technique called
single-pass restore, which increases restore bandwidth and thus substantially
decreases time to repair. Instant restore goes further as it permits read/write
access to any data on a device undergoing restore--even data not yet
restored--by restoring individual data segments on demand. Thus, the restore
process is guided primarily by the needs of applications, and the observed mean
time to repair is effectively reduced from several hours to a few seconds.
This paper presents an implementation and evaluation of instant restore. The
technique is incrementally implemented on a system starting with the
traditional ARIES design for logging and recovery. Experiments show that the
transaction latency perceived after a media failure can be cut down to less
than a second and that the overhead imposed by the technique on normal
processing is minimal. The net effect is that a few "nines" of availability are
added to the system using simple and low-overhead software techniques.
|
[
{
"version": "v1",
"created": "Sun, 26 Feb 2017 14:58:04 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Sauer",
"Caetano",
""
],
[
"Graefe",
"Goetz",
""
],
[
"Härder",
"Theo",
""
]
] |
new_dataset
| 0.997866 |
1702.08104
|
Mike Eichhorn
|
Mike Eichhorn, Christopher D. Williams, Ralf Bachmayer, Brad de Young
|
A Mission Planning System for the AUV "SLOCUM Glider" for the
Newfoundland and Labrador Shelf
|
9 pages, 13 figures, OCEANS 2010 IEEE - Sydney, 24-27 May 2010
| null |
10.1109/OCEANSSYD.2010.5603919
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a system for mission planning for an autonomous
underwater vehicle in time-varying ocean currents. The mission planning system
is designed for the AUV "SLOCUM Glider" to collect oceanographic data along the
Newfoundland and Labrador Shelf. The data will be used in conjunction with a
numerical ocean model currently under development by the Department of
Fisheries and Oceans Canada. This allows for the validation and the
modification of existing ocean current and climate models as well as the design
of new models with the aim of improving the accuracy of forecasts. The use of
the ocean current forecast data in netCDF format in an ocean current model, the
algorithms which consider glider-specific behaviour, details of the program's
technical implementation in C++, and, preliminary results will be described.
|
[
{
"version": "v1",
"created": "Sun, 26 Feb 2017 22:38:50 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Eichhorn",
"Mike",
""
],
[
"Williams",
"Christopher D.",
""
],
[
"Bachmayer",
"Ralf",
""
],
[
"de Young",
"Brad",
""
]
] |
new_dataset
| 0.996645 |
1702.08112
|
Chuong Nguyen
|
Chuong V Nguyen, Jurgen Fripp, David R Lovell, Robert Furbank, Peter
Kuffner, Helen Daily, Xavier Sirault
|
3D Scanning System for Automatic High-Resolution Plant Phenotyping
|
8 papes, DICTA 2016
|
In Digital Image Computing: Techniques and Applications (DICTA),
2016 International Conference on, pp. 1-8. IEEE, 2016
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Thin leaves, fine stems, self-occlusion, non-rigid and slowly changing
structures make plants difficult for three-dimensional (3D) scanning and
reconstruction -- two critical steps in automated visual phenotyping. Many
current solutions such as laser scanning, structured light, and multiview
stereo can struggle to acquire usable 3D models because of limitations in
scanning resolution and calibration accuracy. In response, we have developed a
fast, low-cost, 3D scanning platform to image plants on a rotating stage with
two tilting DSLR cameras centred on the plant. This uses new methods of camera
calibration and background removal to achieve high-accuracy 3D reconstruction.
We assessed the system's accuracy using a 3D visual hull reconstruction
algorithm applied on 2 plastic models of dicotyledonous plants, 2 sorghum
plants and 2 wheat plants across different sets of tilt angles. Scan times
ranged from 3 minutes (to capture 72 images using 2 tilt angles), to 30 minutes
(to capture 360 images using 10 tilt angles). The leaf lengths, widths, areas
and perimeters of the plastic models were measured manually and compared to
measurements from the scanning system: results were within 3-4% of each other.
The 3D reconstructions obtained with the scanning system show excellent
geometric agreement with all six plant specimens, even plants with thin leaves
and fine stems.
|
[
{
"version": "v1",
"created": "Sun, 26 Feb 2017 23:52:00 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Nguyen",
"Chuong V",
""
],
[
"Fripp",
"Jurgen",
""
],
[
"Lovell",
"David R",
""
],
[
"Furbank",
"Robert",
""
],
[
"Kuffner",
"Peter",
""
],
[
"Daily",
"Helen",
""
],
[
"Sirault",
"Xavier",
""
]
] |
new_dataset
| 0.993988 |
1702.08164
|
Reza Malekian Ph.D.
|
Babedi. B. Letswamotse, Kgotlaetsile. M. Modieginyane, Reza Malekian
|
SDN Based QoS Provision in WSN Technologies
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless Sensor Networks (WSNs) have rapidly progressed over the years, they
are now applied in health care systems, home automation, security surveillance,
disaster management and more. With this rapid growth in the number of users and
applications leading to WSNs becoming increasingly complex, this growth makes
high demands on WSNs to provide the requirements of every user and application
that uses them. They have recently been envisioned to be integrated into
Internet of Things (IoT), their role will be to provide sensing services to the
ever increasing community of internet users. However even with so much
potential, WSNs still experience issues in node deployment, fault tolerance,
scalability and Quality of Service (QoS) provisioning amongst others. In this
paper we propose to improve QoS provisioning by introducing Software Defined
principles into WSN technologies.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2017 07:14:40 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Letswamotse",
"Babedi. B.",
""
],
[
"Modieginyane",
"Kgotlaetsile. M.",
""
],
[
"Malekian",
"Reza",
""
]
] |
new_dataset
| 0.99769 |
1702.08208
|
Jakub Breier
|
Jakub Breier and Wei He
|
Multiple Fault Attack on PRESENT with a Hardware Trojan Implementation
in FPGA
|
12 pages, 4 figures
|
Proceedings of the 2015 International Workshop on Secure Internet
of Things (SIoT), pp. 58-64
|
10.1109/SIOT.2015.15
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Internet of Things connects lots of small constrained devices to the
Internet. As in any other environment, communication security is important and
cryptographic algorithms are one of many elements that we use in order to keep
messages secure. Because of the constrained nature of these environments, it is
necessary to use algorithms that do not require high computational power.
Lightweight ciphers are therefore ideal candidates for this purpose.
In this paper, we explore a possibility of attacking an ultra-lightweight
cipher PRESENT by using a multiple fault attack. Utilizing the Differential
Fault Analysis technique, we were able to recover the secret key with two
faulty encryptions and an exhaustive search of 2^16 remaining key bits. Our
attack aims at four nibbles in the penultimate round of the cipher, causing
faulty output in all nibbles of the output. We also provide a practical attack
scenario by exploiting Hardware Trojan (HT) technique for the proposed fault
injection in a Xilinx Spartan-6 FPGA.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2017 09:52:23 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Breier",
"Jakub",
""
],
[
"He",
"Wei",
""
]
] |
new_dataset
| 0.996505 |
1702.08225
|
Pedro A. Garc\'ia-S\'anchez
|
J. I. Farr\'an, P. A. Garc\'ia-S\'anchez, B. A. Heredia
|
On the second Feng-Rao distance of Algebraic Geometry codes related to
Arf semigroups
| null | null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the second (generalized) Feng-Rao distance for elements in an Arf
numerical semigroup that are greater than or equal to the conductor of the
semigroup. This provides a lower bound for the second Hamming weight for one
point AG codes. In particular, we can obtain the second Feng-Rao distance for
the codes defined by asymptotically good towers of function fields whose
Weierstrass semigroups are inductive. In addition, we compute the second
Feng-Rao number, and provide some examples and comparisons with previous
results on this topic. These calculations rely on Ap\'{e}ry sets, and thus
several results concerning Ap\'ery sets of Arf semigroups are presented.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2017 10:50:46 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Farrán",
"J. I.",
""
],
[
"García-Sánchez",
"P. A.",
""
],
[
"Heredia",
"B. A.",
""
]
] |
new_dataset
| 0.991548 |
1702.08291
|
Steffen Staab
|
Wendy Hall, Jim Hendler, Steffen Staab
|
A Manifesto for Web Science @ 10
|
4 pages
| null | null | null |
cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Twenty-seven years ago, one of the biggest societal changes in human history
began slowly when the technical foundations for the World Wide Web were defined
by Tim Berners-Lee. Ever since, the Web has grown exponentially, reaching far
beyond its original technical foundations and deeply affecting the world today
- and even more so the society of the future. We have seen that the Web can
influence the realization of human rights and even the pursuit of happiness.
The Web provides an infrastructure to help us to learn, to work, to communicate
with loved ones, and to provide entertainment. However, it also creates an
environment affected by the digital divide between those who have and those who
do not have access. Additionally, the Web provides challenges we must
understand if we are to find a viable balance between data ownership and
privacy protection, between over-whelming surveillance and the prevention of
terrorism. For the Web to succeed, we need to understand its societal
challenges including increased crime, the impact of social platforms and
socio-economic discrimination, and we must work towards fairness, social
inclusion, and open governance.
Ten Yars ago, the field of Web Science was created to explore the science
underlying the Web from a socio-technical perspective including its
mathematical properties, engineering principles, and social impacts. Ten years
later, we are learning much as the interdisciplinary endeavor to understand the
Web's global information space continues to grow.
In this article we want to elicit the major lessons we have learned through
Web Science and make some cautious predictions of what to expect next.
|
[
{
"version": "v1",
"created": "Mon, 27 Feb 2017 14:08:42 GMT"
}
] | 2017-02-28T00:00:00 |
[
[
"Hall",
"Wendy",
""
],
[
"Hendler",
"Jim",
""
],
[
"Staab",
"Steffen",
""
]
] |
new_dataset
| 0.972396 |
1606.05487
|
Renzo Andri
|
Renzo Andri and Lukas Cavigelli and Davide Rossi and Luca Benini
|
YodaNN: An Architecture for Ultra-Low Power Binary-Weight CNN
Acceleration
| null | null | null | null |
cs.AR cs.CV cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Convolutional neural networks (CNNs) have revolutionized the world of
computer vision over the last few years, pushing image classification beyond
human accuracy. The computational effort of today's CNNs requires power-hungry
parallel processors or GP-GPUs. Recent developments in CNN accelerators for
system-on-chip integration have reduced energy consumption significantly.
Unfortunately, even these highly optimized devices are above the power envelope
imposed by mobile and deeply embedded applications and face hard limitations
caused by CNN weight I/O and storage. This prevents the adoption of CNNs in
future ultra-low power Internet of Things end-nodes for near-sensor analytics.
Recent algorithmic and theoretical advancements enable competitive
classification accuracy even when limiting CNNs to binary (+1/-1) weights
during training. These new findings bring major optimization opportunities in
the arithmetic core by removing the need for expensive multiplications, as well
as reducing I/O bandwidth and storage. In this work, we present an accelerator
optimized for binary-weight CNNs that achieves 1510 GOp/s at 1.2 V on a core
area of only 1.33 MGE (Million Gate Equivalent) or 0.19 mm$^2$ and with a power
dissipation of 895 {\mu}W in UMC 65 nm technology at 0.6 V. Our accelerator
significantly outperforms the state-of-the-art in terms of energy and area
efficiency achieving 61.2 TOp/s/[email protected] V and 1135 GOp/s/[email protected] V, respectively.
|
[
{
"version": "v1",
"created": "Fri, 17 Jun 2016 11:48:29 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Feb 2017 11:00:58 GMT"
},
{
"version": "v3",
"created": "Thu, 16 Feb 2017 10:54:26 GMT"
},
{
"version": "v4",
"created": "Fri, 24 Feb 2017 08:46:12 GMT"
}
] | 2017-02-27T00:00:00 |
[
[
"Andri",
"Renzo",
""
],
[
"Cavigelli",
"Lukas",
""
],
[
"Rossi",
"Davide",
""
],
[
"Benini",
"Luca",
""
]
] |
new_dataset
| 0.99136 |
1611.00459
|
Adam Noel
|
Adam Noel, Andrew W. Eckford
|
Asynchronous Peak Detection for Demodulation in Molecular Communication
|
6 pages, 1 table, 5 figures. To be presented at the IEEE
International Conference on Communications (IEEE ICC 2017) in May 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Molecular communication requires low-complexity symbol detection algorithms
to deal with the many sources of uncertainty that are inherent in these
channels. This paper proposes two variants of a high-performance asynchronous
peak detection algorithm for a receiver that makes independent observations.
The first variant has low complexity and measures the largest observation
within a sampling interval. The second variant adds decision feedback to
mitigate inter-symbol interference. Although the algorithm does not require
synchronization between the transmitter and receiver, results demonstrate that
the bit error performance of symbol-by-symbol detection using the first variant
is better than using a single sample whose sampling time is chosen a priori.
The second variant is shown to have performance comparable to that of an energy
detector. Both variants of the algorithm demonstrate better resilience to
timing offsets than that of existing detectors.
|
[
{
"version": "v1",
"created": "Wed, 2 Nov 2016 03:13:42 GMT"
},
{
"version": "v2",
"created": "Fri, 24 Feb 2017 17:45:09 GMT"
}
] | 2017-02-27T00:00:00 |
[
[
"Noel",
"Adam",
""
],
[
"Eckford",
"Andrew W.",
""
]
] |
new_dataset
| 0.961152 |
1701.00948
|
Gabriele Fici
|
Gabriele Fici, Filippo Mignosi, Jeffrey Shallit
|
Abelian-Square-Rich Words
|
To appear in Theoretical Computer Science. Corrected a flaw in the
proof of Proposition 7
| null |
10.1016/j.tcs.2017.02.012
| null |
cs.DM cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An abelian square is the concatenation of two words that are anagrams of one
another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct
factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct
abelian-square factors, that is, distinct factors that are abelian squares.
This motivates us to study infinite words such that the number of distinct
abelian-square factors of length $n$ grows quadratically with $n$. More
precisely, we say that an infinite word $w$ is {\it abelian-square-rich} if,
for every $n$, every factor of $w$ of length $n$ contains, on average, a number
of distinct abelian-square factors that is quadratic in $n$; and {\it uniformly
abelian-square-rich} if every factor of $w$ contains a number of distinct
abelian-square factors that is proportional to the square of its length. Of
course, if a word is uniformly abelian-square-rich, then it is
abelian-square-rich, but we show that the converse is not true in general. We
prove that the Thue-Morse word is uniformly abelian-square-rich and that the
function counting the number of distinct abelian-square factors of length $2n$
of the Thue-Morse word is $2$-regular. As for Sturmian words, we prove that a
Sturmian word $s_{\alpha}$ of angle $\alpha$ is uniformly abelian-square-rich
if and only if the irrational $\alpha$ has bounded partial quotients, that is,
if and only if $s_{\alpha}$ has bounded exponent.
|
[
{
"version": "v1",
"created": "Wed, 4 Jan 2017 10:16:30 GMT"
},
{
"version": "v2",
"created": "Mon, 13 Feb 2017 16:02:50 GMT"
},
{
"version": "v3",
"created": "Fri, 24 Feb 2017 17:14:54 GMT"
}
] | 2017-02-27T00:00:00 |
[
[
"Fici",
"Gabriele",
""
],
[
"Mignosi",
"Filippo",
""
],
[
"Shallit",
"Jeffrey",
""
]
] |
new_dataset
| 0.997568 |
1702.07470
|
Rajarshi Ray
|
Rajarshi Ray, Arup Deka, Kamalika Datta
|
Exact Synthesis of Reversible Logic Circuits using Model Checking
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Synthesis of reversible logic circuits has gained great atten- tion during
the last decade. Various synthesis techniques have been pro- posed, some
generate optimal solutions (in gate count) and are termed as exact, while
others are scalable in the sense that they can handle larger functions but
generate sub-optimal solutions. Although scalable synthe- sis is very much
essential for circuit design, exact synthesis is also of great importance as it
helps in building design library for the synthesis of larger functions. In this
paper, we propose an exact synthesis technique for re- versible circuits using
model checking. We frame the synthesis problem as a model checking instance and
propose an iterative bounded model checking calls for an optimal synthesis.
Experiments on reversible logic benchmarks shows successful synthesis of
optimal circuits. We also illus- trate optimal synthesis of random functions
with as many as 10 variables and up to 10 gates.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2017 06:02:16 GMT"
}
] | 2017-02-27T00:00:00 |
[
[
"Ray",
"Rajarshi",
""
],
[
"Deka",
"Arup",
""
],
[
"Datta",
"Kamalika",
""
]
] |
new_dataset
| 0.998607 |
1702.07475
|
Fei Han
|
Fei Han, Xue Yang, Yu Zhang, Hao Zhang
|
Sequence-based Multimodal Apprenticeship Learning For Robot Perception
and Decision Making
|
8 pages, 6 figures, accepted by ICRA'17
| null | null | null |
cs.RO cs.AI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Apprenticeship learning has recently attracted a wide attention due to its
capability of allowing robots to learn physical tasks directly from
demonstrations provided by human experts. Most previous techniques assumed that
the state space is known a priori or employed simple state representations that
usually suffer from perceptual aliasing. Different from previous research, we
propose a novel approach named Sequence-based Multimodal Apprenticeship
Learning (SMAL), which is capable to simultaneously fusing temporal information
and multimodal data, and to integrate robot perception with decision making. To
evaluate the SMAL approach, experiments are performed using both simulations
and real-world robots in the challenging search and rescue scenarios. The
empirical study has validated that our SMAL approach can effectively learn
plans for robots to make decisions using sequence of multimodal observations.
Experimental results have also showed that SMAL outperforms the baseline
methods using individual images.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2017 06:37:06 GMT"
}
] | 2017-02-27T00:00:00 |
[
[
"Han",
"Fei",
""
],
[
"Yang",
"Xue",
""
],
[
"Zhang",
"Yu",
""
],
[
"Zhang",
"Hao",
""
]
] |
new_dataset
| 0.985889 |
1702.07589
|
Benjamin L\'ev\^eque
|
Benjamin L\'ev\^eque
|
Generalization of Schnyder woods to orientable surfaces and applications
|
200 pages, Habilitation manuscript
| null | null | null |
cs.DM cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Schnyder woods are particularly elegant combinatorial structures with
numerous applications concerning planar triangulations and more generally
3-connected planar maps. We propose a simple generalization of Schnyder woods
from the plane to maps on orientable surfaces of any genus with a special
emphasis on the toroidal case. We provide a natural partition of the set of
Schnyder woods of a given map into distributive lattices depending on the
surface homology. In the toroidal case we show the existence of particular
Schnyder woods with some global properties that are useful for optimal encoding
or graph drawing purpose.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2017 14:06:31 GMT"
}
] | 2017-02-27T00:00:00 |
[
[
"Lévêque",
"Benjamin",
""
]
] |
new_dataset
| 0.97205 |
1702.07657
|
Richard Barton
|
Richard J. Barton
|
Capacity of the Aperture-Constrained AWGN Free-Space Communication
Channel
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we derive upper and lower bounds as well as a simple
closed-form approximation for the capacity of the continuous-time, bandlimited,
additive white Gaussian noise channel in a three-dimensional free-space
electromagnetic propagation environment subject to constraints on the total
effective antenna aperture area of the link and a total transmitter power
constraint. We assume that the communication range is much larger than the
radius of the sphere containing the antennas at both ends of the link, and we
show that, in general, the capacity can only be achieved by transmitting
multiple spatially-multiplexed data streams simultaneously over the channel.
Furthermore, the lower bound on capacity can be approached asymptotically by
transmitting the data streams between a pair of physically-realizable
distributed antenna arrays at either end of the link. A consequence of this
result is that, in general, communication at close to the maximum achievable
data rate on a deep-space communication link can be achieved in practice if and
only if the communication system utilizes spatial multiplexing over a
distributed MIMO antenna array. Such an approach to deep-space communication
does not appear to be envisioned currently by any of the international space
agencies or any commercial space companies. A second consequence is that the
capacity of a long-range free-space communication link, if properly utilized,
grows asymptotically as a function of the square root of the received SNR
rather than only logarithmically in the received SNR.
|
[
{
"version": "v1",
"created": "Fri, 24 Feb 2017 16:44:11 GMT"
}
] | 2017-02-27T00:00:00 |
[
[
"Barton",
"Richard J.",
""
]
] |
new_dataset
| 0.963939 |
1702.07670
|
Amirali Aghazadeh
|
Amirali Aghazadeh and Mohammad Golbabaee and Andrew S. Lan and Richard
G. Baraniuk
|
Insense: Incoherent Sensor Selection for Sparse Signals
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sensor selection refers to the problem of intelligently selecting a small
subset of a collection of available sensors to reduce the sensing cost while
preserving signal acquisition performance. The majority of sensor selection
algorithms find the subset of sensors that best recovers an arbitrary signal
from a number of linear measurements that is larger than the dimension of the
signal. In this paper, we develop a new sensor selection algorithm for sparse
(or near sparse) signals that finds a subset of sensors that best recovers such
signals from a number of measurements that is much smaller than the dimension
of the signal. Existing sensor selection algorithms cannot be applied in such
situations. Our proposed Incoherent Sensor Selection (Insense) algorithm
minimizes a coherence-based cost function that is adapted from recent results
in sparse recovery theory. Using six datasets, including two real-world
datasets on microbial diagnostics and structural health monitoring, we
demonstrate the superior performance of Insense for sparse-signal sensor
selection.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 16:42:23 GMT"
}
] | 2017-02-27T00:00:00 |
[
[
"Aghazadeh",
"Amirali",
""
],
[
"Golbabaee",
"Mohammad",
""
],
[
"Lan",
"Andrew S.",
""
],
[
"Baraniuk",
"Richard G.",
""
]
] |
new_dataset
| 0.993584 |
1702.06915
|
Ferdinando Fioretto Ferdinando Fioretto
|
Ferdinando Fioretto and Agostino Dovier and Enrico Pontelli and
William Yeoh and Roie Zivan
|
Solving DCOPs with Distributed Large Neighborhood Search
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The field of Distributed Constraint Optimization has gained momentum in
recent years, thanks to its ability to address various applications related to
multi-agent cooperation. Nevertheless, solving Distributed Constraint
Optimization Problems (DCOPs) optimally is NP-hard. Therefore, in large-scale,
complex applications, incomplete DCOP algorithms are necessary. Current
incomplete DCOP algorithms suffer of one or more of the following limitations:
they (a) find local minima without providing quality guarantees; (b) provide
loose quality assessment; or (c) are unable to benefit from the structure of
the problem, such as domain-dependent knowledge and hard constraints.
Therefore, capitalizing on strategies from the centralized constraint solving
community, we propose a Distributed Large Neighborhood Search (D-LNS) framework
to solve DCOPs. The proposed framework (with its novel repair phase) provides
guarantees on solution quality, refining upper and lower bounds during the
iterative process, and can exploit domain-dependent structures. Our
experimental results show that D-LNS outperforms other incomplete DCOP
algorithms on both structured and unstructured problem instances.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 17:54:23 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Feb 2017 01:21:38 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Fioretto",
"Ferdinando",
""
],
[
"Dovier",
"Agostino",
""
],
[
"Pontelli",
"Enrico",
""
],
[
"Yeoh",
"William",
""
],
[
"Zivan",
"Roie",
""
]
] |
new_dataset
| 0.994255 |
1702.06970
|
William Kluegel
|
William Kluegel, Muhammad Aamir Iqbal, Ferdinando Fioretto, William
Yeoh, and Enrico Pontelli
|
A Realistic Dataset for the Smart Home Device Scheduling Problem for
DCOPs
|
15 pages, OPTMAS17
| null | null | null |
cs.AI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The field of Distributed Constraint Optimization has gained momentum in
recent years thanks to its ability to address various applications related to
multi-agent cooperation. While techniques to solve Distributed Constraint
Optimization Problems (DCOPs) are abundant and have matured substantially since
the field inception, the number of DCOP realistic applications and benchmark
used to asses the performance of DCOP algorithms is lagging behind. To contrast
this background we (i) introduce the Smart Home Device Scheduling (SHDS)
problem, which describe the problem of coordinating smart devices schedules
across multiple homes as a multi-agent system, (ii) detail the physical models
adopted to simulate smart sensors, smart actuators, and homes environments, and
(iii) introduce a DCOP realistic benchmark for SHDS problems.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 19:10:30 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Kluegel",
"William",
""
],
[
"Iqbal",
"Muhammad Aamir",
""
],
[
"Fioretto",
"Ferdinando",
""
],
[
"Yeoh",
"William",
""
],
[
"Pontelli",
"Enrico",
""
]
] |
new_dataset
| 0.999727 |
1702.06973
|
Arthur-Jozsef Molnar
|
Arthur-Jozsef Molnar
|
jSET - The Java Software Evolution Tracker
| null |
Proceedings of the International Conference on Knowledge
Engineering, Principles and Techniques (KEPT 2011), Cluj-Napoca, 2011, pages
25-35
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the Java Software Evolution Tracker, a visualization
and analysis tool that provides practitioners the means to examine the
evolution of a software system from a top to bottom perspective, starting with
changes in the graphical user interface all the way to source code
modifications.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 19:23:33 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Molnar",
"Arthur-Jozsef",
""
]
] |
new_dataset
| 0.999735 |
1702.07071
|
Vladimir Vargas-Calder\'on
|
Keith Y. Patarroyo and Vladimir Vargas-Calder\'on
|
Pronunciation recognition of English phonemes /\textipa{@}/, /{\ae}/,
/\textipa{A}:/ and /\textipa{2}/ using Formants and Mel Frequency Cepstral
Coefficients
|
11 pages, pre-print version
| null | null | null |
cs.CL cs.SD
|
http://creativecommons.org/licenses/by/4.0/
|
The Vocal Joystick Vowel Corpus, by Washington University, was used to study
monophthongs pronounced by native English speakers. The objective of this study
was to quantitatively measure the extent at which speech recognition methods
can distinguish between similar sounding vowels. In particular, the phonemes
/\textipa{@}/, /{\ae}/, /\textipa{A}:/ and /\textipa{2}/ were analysed. 748
sound files from the corpus were used and subjected to Linear Predictive Coding
(LPC) to compute their formants, and to Mel Frequency Cepstral Coefficients
(MFCC) algorithm, to compute the cepstral coefficients. A Decision Tree
Classifier was used to build a predictive model that learnt the patterns of the
two first formants measured in the data set, as well as the patterns of the 13
cepstral coefficients. An accuracy of 70\% was achieved using formants for the
mentioned phonemes. For the MFCC analysis an accuracy of 52 \% was achieved and
an accuracy of 71\% when /\textipa{@}/ was ignored. The results obtained show
that the studied algorithms are far from mimicking the ability of
distinguishing subtle differences in sounds like human hearing does.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2017 02:31:03 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Patarroyo",
"Keith Y.",
""
],
[
"Vargas-Calderón",
"Vladimir",
""
]
] |
new_dataset
| 0.986017 |
1702.07124
|
Tatsuya Mori Dr.
|
Seita Maruyama, Satohiro Wakabayashi, Tatsuya Mori
|
Trojan of Things: Embedding Malicious NFC Tags into Common Objects
|
21 pages, 19 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel proof-of-concept attack named Trojan of Things (ToT),
which aims to attack NFC- enabled mobile devices such as smartphones. The key
idea of ToT attacks is to covertly embed maliciously programmed NFC tags into
common objects routinely encountered in daily life such as banknotes, clothing,
or furniture, which are not considered as NFC touchpoints. To fully explore the
threat of ToT, we develop two striking techniques named ToT device and Phantom
touch generator. These techniques enable an attacker to carry out various
severe and sophisticated attacks unbeknownst to the device owner who
unintentionally puts the device close to a ToT. We discuss the feasibility of
the attack as well as the possible countermeasures against the threats of ToT
attacks.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2017 07:57:23 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Maruyama",
"Seita",
""
],
[
"Wakabayashi",
"Satohiro",
""
],
[
"Mori",
"Tatsuya",
""
]
] |
new_dataset
| 0.999613 |
1702.07160
|
Ertugrul Basar
|
Ertugrul Basar, Ibrahim Altunbas
|
Space-Time Channel Modulation
|
Accepted for publication in IEEE Transactions on Vehicular Technology
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce the concept of space-time channel modulation
(STCM), which extends the classical space-time block codes into a new third
dimension: channel states (transmission media) dimension. Three novel STCM
schemes, which provide interesting trade-offs among decoding complexity, error
performance and data rate, are proposed. It is shown via computer simulations
that the proposed STCM schemes achieve considerably better error performance
than the existing media-based modulation (MBM) and classical systems.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2017 10:15:12 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Basar",
"Ertugrul",
""
],
[
"Altunbas",
"Ibrahim",
""
]
] |
new_dataset
| 0.996242 |
1702.07187
|
Stefano Buzzi
|
Stefano Buzzi and Carmen D'Andrea
|
Massive MIMO 5G Cellular Networks: mm-wave vs. \mu-wave Frequencies
|
Invited paper; to appear on the ZTE Communications special issue on
5G New Radio
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Enhanced mobile broadband (eMBB) is one of the key use-cases for the
development of the new standard 5G New Radio for the next generation of mobile
wireless networks. Large-scale antenna arrays, a.k.a. Massive MIMO, the usage
of carrier frequencies in the range 10-100 GHz, the so-called millimeter wave
(mm-wave) band, and the network densification with the introduction of
small-sized cells are the three technologies that will permit implementing eMBB
services and realizing the Gbit/s mobile wireless experience. This paper is
focused on the massive MIMO technology; initially conceived for conventional
cellular frequencies in the sub-6 GHz range (\mu-wave), the massive MIMO
concept has been then progressively extended to the case in which mm-wave
frequencies are used. However, due to different propagation mechanisms in urban
scenarios, the resulting MIMO channel models at \mu-wave and mm-wave are
radically different. Six key basic differences are pinpointed in this paper,
along with the implications that they have on the architecture and algorithms
of the communication transceivers and on the attainable performance in terms of
reliability and multiplexing capabilities.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2017 12:01:25 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Buzzi",
"Stefano",
""
],
[
"D'Andrea",
"Carmen",
""
]
] |
new_dataset
| 0.995107 |
1702.07223
|
Prasanna Karthik Vairam
|
Gnanambikai Krishnakumar, Patanjali SLPSK, Prasanna Karthik Vairam,
Chester Rebeiro
|
GANDALF: A fine-grained hardware-software co-design for preventing
memory attacks
|
5 Pages, 2 figures, Winning entry of CSAW Embedded Security Challenge
2016, Not published elsewhere
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reading or writing outside the bounds of a buffer is a serious security
vulnerability that has been exploited in numerous occasions. These attacks can
be prevented by ensuring that every buffer is only accessed within its
specified bounds. In this paper we present Gandalf, a compiler-assisted
hardware extension for the OpenRISC processor that thwarts all forms of memory
based attacks including buffer overflows and over-reads.The feature associates
lightweight base and bound capabilities to all pointer variables, which are
checked at run time by the hardware. Gandalf is transparent to the user and
does not require significant OS modifications. Moreover, it achieves locality,
thus resulting in small performance penalties.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2017 14:24:49 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Krishnakumar",
"Gnanambikai",
""
],
[
"SLPSK",
"Patanjali",
""
],
[
"Vairam",
"Prasanna Karthik",
""
],
[
"Rebeiro",
"Chester",
""
]
] |
new_dataset
| 0.999033 |
1702.07265
|
Kai Wan
|
Kai Wan, Daniela Tuninetti, Pablo Piantanida
|
A Novel Index Coding Scheme and its Application to Coded Caching
|
ITA 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a novel achievable scheme for the index problem and
applies it to the caching problem. Index coding and caching are noiseless
broadcast channel problems where receivers have message side information.In the
index coding problem the side information sets are fixed, while in the caching
problem the side information sets correspond the cache contents, which are
under the control of the system designer. The proposed index coding scheme,
based on distributed source coding and non-unique decoding,is shown to strictly
enlarge the rate region achievable by composite coding.The novel index coding
scheme applied to the caching problem is then shown to match an outer bound
(previously proposed by the authors and also based on known results for the
index coding problem) under the assumption of uncoded cache
placement/prefetching.
|
[
{
"version": "v1",
"created": "Thu, 23 Feb 2017 15:52:39 GMT"
}
] | 2017-02-24T00:00:00 |
[
[
"Wan",
"Kai",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Piantanida",
"Pablo",
""
]
] |
new_dataset
| 0.997426 |
1702.04814
|
Zhezhi He
|
Zhezhi He, Shaahin Angizi and Deliang Fan
|
Current Induced Dynamics of Multiple Skyrmions with Domain Wall Pair and
Skyrmion-based Majority Gate Design
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As an intriguing ultra-small particle-like magnetic texture, skyrmion has
attracted lots of research interests in next-generation ultra-dense and low
power magnetic memory/logic designs. Previous studies have demonstrated a
single skyrmion-domain wall pair collision in a specially designed magnetic
racetrack junction. In this work, we investigate the dynamics of multiple
skyrmions with domain wall pair in a magnetic racetrack. The numerical
micromagnetic simulation results indicate that the domain wall pair could be
pinned or depinned by the rectangular notch pinning site depending on both the
number of skyrmions in the racetrack and the magnitude of driving current
density. Such emergent dynamical property could be used to implement a
threshold-tunable step function, in which the inputs are skyrmions and
threshold could be tuned by the driving current density. The threshold-tunable
step function is widely used in logic and neural network applications. We also
present a three-input skyrmion-based majority logic gate design to demonstrate
the potential application of such dynamic interaction of multiple skyrmions and
domain wall pair.
|
[
{
"version": "v1",
"created": "Wed, 15 Feb 2017 23:11:38 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Feb 2017 16:07:05 GMT"
}
] | 2017-02-23T00:00:00 |
[
[
"He",
"Zhezhi",
""
],
[
"Angizi",
"Shaahin",
""
],
[
"Fan",
"Deliang",
""
]
] |
new_dataset
| 0.999193 |
1702.06569
|
Johan P. Hansen
|
Johan P. Hansen
|
Toric Codes, Multiplicative Structure and Decoding
|
8 pages
| null | null | null |
cs.IT math.AG math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Long linear codes constructed from toric varieties over finite fields, their
multiplicative structure and decoding. The main theme is the inherent
multiplicative structure on toric codes. The multiplicative structure allows
for \emph{decoding}, resembling the decoding of Reed-Solomon codes and aligns
with decoding by error correcting pairs. We have used the multiplicative
structure on toric codes to construct linear secret sharing schemes with
\emph{strong multiplication} via Massey's construction generalizing the Shamir
Linear secret sharing shemes constructed from Reed-Solomon codes. We have
constructed quantum error correcting codes from toric surfaces by the
Calderbank-Shor-Steane method.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 10:31:28 GMT"
}
] | 2017-02-23T00:00:00 |
[
[
"Hansen",
"Johan P.",
""
]
] |
new_dataset
| 0.99296 |
1702.06875
|
Arman Cohan
|
Arman Cohan, Sydney Young, Andrew Yates, Nazli Goharian
|
Triaging Content Severity in Online Mental Health Forums
|
Accepted for publication in Journal of the Association for
Information Science and Technology (2017)
| null |
10.1002/asi.23865
| null |
cs.CL cs.IR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mental health forums are online communities where people express their issues
and seek help from moderators and other users. In such forums, there are often
posts with severe content indicating that the user is in acute distress and
there is a risk of attempted self-harm. Moderators need to respond to these
severe posts in a timely manner to prevent potential self-harm. However, the
large volume of daily posted content makes it difficult for the moderators to
locate and respond to these critical posts. We present a framework for triaging
user content into four severity categories which are defined based on
indications of self-harm ideation. Our models are based on a feature-rich
classification framework which includes lexical, psycholinguistic, contextual
and topic modeling features. Our approaches improve the state of the art in
triaging the content severity in mental health forums by large margins (up to
17% improvement over the F-1 scores). Using the proposed model, we analyze the
mental state of users and we show that overall, long-term users of the forum
demonstrate a decreased severity of risk over time. Our analysis on the
interaction of the moderators with the users further indicates that without an
automatic way to identify critical content, it is indeed challenging for the
moderators to provide timely response to the users in need.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 16:14:12 GMT"
}
] | 2017-02-23T00:00:00 |
[
[
"Cohan",
"Arman",
""
],
[
"Young",
"Sydney",
""
],
[
"Yates",
"Andrew",
""
],
[
"Goharian",
"Nazli",
""
]
] |
new_dataset
| 0.98123 |
1702.06902
|
Chuchu Fan
|
Chuchu Fan, Bolun Qi, Sayan Mitra and Mahesh Viswanathan
|
DRYVR:Data-driven verification and compositional reasoning for
automotive systems
|
25 pages, 3 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the DRYVR framework for verifying hybrid control systems that are
described by a combination of a black-box simulator for trajectories and a
white-box transition graph specifying mode switches. The framework includes (a)
a probabilistic algorithm for learning sensitivity of the continuous
trajectories from simulation data, (b) a bounded reachability analysis
algorithm that uses the learned sensitivity, and (c) reasoning techniques based
on simulation relations and sequential composition, that enable verification of
complex systems under long switching sequences, from the reachability analysis
of a simpler system under shorter sequences. We demonstrate the utility of the
framework by verifying a suite of automotive benchmarks that include powertrain
control, automatic transmission, and several autonomous and ADAS features like
automatic emergency braking, lane-merge, and auto-passing controllers.
|
[
{
"version": "v1",
"created": "Wed, 22 Feb 2017 17:26:24 GMT"
}
] | 2017-02-23T00:00:00 |
[
[
"Fan",
"Chuchu",
""
],
[
"Qi",
"Bolun",
""
],
[
"Mitra",
"Sayan",
""
],
[
"Viswanathan",
"Mahesh",
""
]
] |
new_dataset
| 0.998838 |
1509.06397
|
David Hallac
|
David Hallac, Christopher Wong, Steven Diamond, Abhijit Sharang, Rok
Sosic, Stephen Boyd, Jure Leskovec
|
SnapVX: A Network-Based Convex Optimization Solver
| null | null | null | null |
cs.SI cs.MS math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SnapVX is a high-performance Python solver for convex optimization problems
defined on networks. For these problems, it provides a fast and scalable
solution with guaranteed global convergence. SnapVX combines the capabilities
of two open source software packages: Snap.py and CVXPY. Snap.py is a large
scale graph processing library, and CVXPY provides a general modeling framework
for small-scale subproblems. SnapVX offers a customizable yet easy-to-use
interface with out-of-the-box functionality. Based on the Alternating Direction
Method of Multipliers (ADMM), it is able to efficiently store, analyze, and
solve large optimization problems from a variety of different applications.
Documentation, examples, and more can be found on the SnapVX website at
http://snap.stanford.edu/snapvx.
|
[
{
"version": "v1",
"created": "Mon, 21 Sep 2015 20:44:12 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Feb 2017 05:50:05 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"Hallac",
"David",
""
],
[
"Wong",
"Christopher",
""
],
[
"Diamond",
"Steven",
""
],
[
"Sharang",
"Abhijit",
""
],
[
"Sosic",
"Rok",
""
],
[
"Boyd",
"Stephen",
""
],
[
"Leskovec",
"Jure",
""
]
] |
new_dataset
| 0.993747 |
1608.02670
|
Cunsheng Ding
|
Shuxing Li, Chengju Li, Cunsheng Ding, Hao Liu
|
Parameters of two classes of LCD BCH codes
|
This is a merged version of arXiv:1608.02169v1 [cs.IT] and
arXiv:1608.02670v1 [cs.IT]
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Historically, LCD cyclic codes were referred to as reversible cyclic codes,
which had application in data storage. Due to a newly discovered application in
cryptography, there has been renewed interest on LCD codes. In this paper, we
explore two special families of LCD cyclic codes, which are both BCH codes. The
dimensions and the minimum distances of these LCD BCH codes are investigated.
As a byproduct, the parameters of some primitive BCH codes are also obtained.
|
[
{
"version": "v1",
"created": "Tue, 9 Aug 2016 01:03:11 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Feb 2017 12:36:12 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"Li",
"Shuxing",
""
],
[
"Li",
"Chengju",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Liu",
"Hao",
""
]
] |
new_dataset
| 0.969394 |
1609.01951
|
Haoran Yu
|
Haoran Yu and Man Hon Cheung and Lin Gao and Jianwei Huang
|
Public Wi-Fi Monetization via Advertising
|
18 pages
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The proliferation of public Wi-Fi hotspots has brought new business
potentials for Wi-Fi networks, which carry a significant amount of global
mobile data traffic today. In this paper, we propose a novel Wi-Fi monetization
model for venue owners (VOs) deploying public Wi-Fi hotspots, where the VOs can
generate revenue by providing two different Wi-Fi access schemes for mobile
users (MUs): (i) the premium access, in which MUs directly pay VOs for their
Wi-Fi usage, and (ii) the advertising sponsored access, in which MUs watch
advertisements in exchange of the free usage of Wi-Fi. VOs sell their ad spaces
to advertisers (ADs) via an ad platform, and share the ADs' payments with the
ad platform. We formulate the economic interactions among the ad platform, VOs,
MUs, and ADs as a three-stage Stackelberg game. In Stage I, the ad platform
announces its advertising revenue sharing policy. In Stage II, VOs determine
the Wi-Fi prices (for MUs) and advertising prices (for ADs). In Stage III, MUs
make access choices and ADs purchase advertising spaces. We analyze the
sub-game perfect equilibrium (SPE) of the proposed game systematically, and our
analysis shows the following useful observations. First, the ad platform's
advertising revenue sharing policy in Stage I will affect only the VOs' Wi-Fi
prices but not the VOs' advertising prices in Stage II. Second, both the VOs'
Wi-Fi prices and advertising prices are non-decreasing in the advertising
concentration level and non-increasing in the MU visiting frequency. Numerical
results further show that the VOs are capable of generating large revenues
through mainly providing one type of Wi-Fi access (the premium access or
advertising sponsored access), depending on their advertising concentration
levels and MU visiting frequencies.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2016 12:07:07 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Jan 2017 07:22:30 GMT"
},
{
"version": "v3",
"created": "Tue, 21 Feb 2017 13:15:05 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"Yu",
"Haoran",
""
],
[
"Cheung",
"Man Hon",
""
],
[
"Gao",
"Lin",
""
],
[
"Huang",
"Jianwei",
""
]
] |
new_dataset
| 0.991117 |
1610.07229
|
O-Joung Kwon
|
Eun Jung Kim and O-joung Kwon
|
A Polynomial Kernel for Distance-Hereditary Vertex Deletion
|
37 pages, 6 figures; improved previous kernel size to O(k^{30}
polylogk)
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A graph is distance-hereditary if for any pair of vertices, their distance in
every connected induced subgraph containing both vertices is the same as their
distance in the original graph. The Distance-Hereditary Vertex Deletion problem
asks, given a graph $G$ on $n$ vertices and an integer $k$, whether there is a
set $S$ of at most $k$ vertices in $G$ such that $G-S$ is distance-hereditary.
This problem is important due to its connection to the graph parameter
rank-width that distance-hereditary graphs are exactly graphs of rank-width at
most $1$. Eiben, Ganian, and Kwon (MFCS' 16) proved that Distance-Hereditary
Vertex Deletion can be solved in time $2^{\mathcal{O}(k)}n^{\mathcal{O}(1)}$,
and asked whether it admits a polynomial kernelization. We show that this
problem admits a polynomial kernel, answering this question positively. For
this, we use a similar idea for obtaining an approximate solution for Chordal
Vertex Deletion due to Jansen and Pilipczuk (SODA' 17) to obtain an approximate
solution with $\mathcal{O}(k^3\log n)$ vertices when the problem is a
YES-instance, and we exploit the structure of split decompositions of
distance-hereditary graphs to reduce the total size.
|
[
{
"version": "v1",
"created": "Sun, 23 Oct 2016 20:30:28 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Oct 2016 08:28:18 GMT"
},
{
"version": "v3",
"created": "Mon, 20 Feb 2017 21:37:09 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"Kim",
"Eun Jung",
""
],
[
"Kwon",
"O-joung",
""
]
] |
new_dataset
| 0.968502 |
1701.07553
|
Jekan Thangavelautham
|
Himangshu Kalita, Ravi Teja Nallapu, Andrew Warren and Jekan
Thangavelautham
|
Guidance, Navigation and Control of Multirobot Systems in Cooperative
Cliff Climbing
|
14 pages, 13 figures in Proceedings of the 40th Annual AAS Guidance,
Navigation and Control Conference, 2017
| null | null | null |
cs.RO astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The application of GNC devices on small robots is a game-changer that enables
these robots to be mobile on low-gravity planetary surfaces and small bodies.
Use of reaction wheels enables these robots to roll, hop, summersault and rest
on precarious/sloped surfaces that would otherwise not be possible with
conven-tional wheeled robots. We are extending this technology to enable robots
to climb off-world canyons, cliffs and caves. A single robot may slip and fall,
however, a multirobot system can work cooperatively by being interlinked using
spring-tethers and work much like a team of mountaineers to systematically
climb a slope. A multirobot system as we will show in this paper can climb
sur-faces not possible with a single robot alone. We consider a team of four
robots that are interlinked with tethers in an 'x' configuration. Each robot
secures itself to a slope using spiny gripping actuators, and one by one each
robot moves up-wards by crawling, rolling or hopping up the slope. If any one
of the robots loses grip, slips or falls, the remaining robots will be holding
it up as they are anchored. This distributed controls approach to cliff
climbing enables the system to reconfigure itself where possible and avoid
getting stuck at one hard to reach location. Instead, the risk is distributed
and through close cooperation, the robots can identify multiple trajectories to
climb a cliff or rugged surface. The benefits can also be realized on
milligravity surfaces such as asteroids. Too fast a jump can result in the
robot flying off the surface into space. Having multiple robots anchored to the
surface keeps the entire system secure. Our work combines dynamics and control
simulation to evaluate the feasibility of our approach. The simulation results
show a promising pathway towards advanced development of this technology on a
team of real robots.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 02:36:41 GMT"
},
{
"version": "v2",
"created": "Tue, 31 Jan 2017 16:19:13 GMT"
},
{
"version": "v3",
"created": "Tue, 21 Feb 2017 13:05:11 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"Kalita",
"Himangshu",
""
],
[
"Nallapu",
"Ravi Teja",
""
],
[
"Warren",
"Andrew",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.977754 |
1702.00335
|
Jekan Thangavelautham
|
Ravi teja Nallapu, Erik Asphaug, Jekan Thangavelautham
|
Control of a Bucket-Wheel for Surface Mining of Asteroids and
Small-Bodies
|
8 pages, 7 figures in 40th AAS Conference on Guidance, Navigation and
Control
| null | null | null |
cs.SY astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Near Earth Asteroids (NEAs) are thought to contain a wealth of resources,
including water, iron, titanium, nickel, platinum and silicates. Future space
missions that can exploit these resources by performing In-Situ Resource
Utilization (ISRU) gain substantial benefit in terms of range, payload capacity
and mission flexibility. Compared to the Moon or Mars, the milligravity on some
asteroids demands a fraction of the energy for digging and accessing hydrated
regolith just below the surface. However, asteroids and small-bodies, because
of their low gravity present a major challenge in landing, surface excavation
and resource capture. These challenges have resulted in adoption of a "touch
and go techniques", like the upcoming Osiris-rex sample-return mission.
Previous asteroid excavation efforts have focused on discrete capture events
(an extension of sampling technology) or whole-asteroid capture and processing.
This paper analyzes the control of a bucket-wheel design for asteroid or
small-body excavation. Our study focuses on system design of two counter
rotating bucket-wheels that are attached to a hovering spacecraft. Regolith is
excavated and heated to 1000 C to extract water. The water in turn is
electrolyzed to produce hydrogen and oxygen for rocket fuel. We analyze control
techniques to maximize traction of the bucket-wheels on the asteroid surface
and minimize lift-off the surface, together with methods to dig deeper into the
asteroid surface. Our studies combine analytical models, with simulation and
hardware testing. For initial evaluation of material-spacecraft dynamics and
mechanics, we assume lunar-like regolith for bulk density, particle size and
cohesion. Our early studies point towards a promising pathway towards
refinement of this technology for demonstration aboard a future space mission.
|
[
{
"version": "v1",
"created": "Wed, 1 Feb 2017 16:14:51 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Feb 2017 13:05:20 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"Nallapu",
"Ravi teja",
""
],
[
"Asphaug",
"Erik",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.999364 |
1702.06119
|
Ameya Patil
|
Ameya D. Patil, Sasikanth Manipatruni, Dmitri Nikonov, Ian A. Young,
Naresh R. Shanbhag
|
Shannon-inspired Statistical Computing to Enable Spintronics
| null | null | null | null |
cs.ET
|
http://creativecommons.org/licenses/by/4.0/
|
Modern computing systems based on the von Neumann architecture are built from
silicon complementary metal oxide semiconductor (CMOS) transistors that need to
operate under practically error free conditions with 1 error in $10^{15}$
switching events. The physical dimensions of CMOS transistors have scaled down
over the past five decades leading to exponential increases in functional
density and energy consumption. Today, the energy and delay reductions from
scaling have stagnated, motivating the search for a CMOS replacement. Of these,
spintronics offers a path for enhancing the functional density and scaling the
energy down to fundamental thermodynamic limits of 100kT to 1000kT. However,
spintronic devices exhibit high error rates of 1 in 10 or more when operating
at these limits, rendering them incompatible with deterministic nature of the
von Neumann architecture. We show that a Shannon-inspired statistical computing
framework can be leveraged to design a computer made from such stochastic
spintronic logic gates to provide a computational accuracy close to that of a
deterministic computer. This extraordinary result allowing a $10^{13}$ fold
relaxation in acceptable error rates is obtained by engineering the error
distribution coupled with statistical error compensation.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 04:11:56 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"Patil",
"Ameya D.",
""
],
[
"Manipatruni",
"Sasikanth",
""
],
[
"Nikonov",
"Dmitri",
""
],
[
"Young",
"Ian A.",
""
],
[
"Shanbhag",
"Naresh R.",
""
]
] |
new_dataset
| 0.988153 |
1702.06318
|
Ferda Ofli
|
Ferda Ofli, Yusuf Aytar, Ingmar Weber, Raggi al Hammouri, Antonio
Torralba
|
Is Saki #delicious? The Food Perception Gap on Instagram and Its
Relation to Health
|
This is a pre-print of our paper accepted to appear in the
Proceedings of 2017 International World Wide Web Conference (WWW'17)
| null | null | null |
cs.CY cs.CV cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Food is an integral part of our life and what and how much we eat crucially
affects our health. Our food choices largely depend on how we perceive certain
characteristics of food, such as whether it is healthy, delicious or if it
qualifies as a salad. But these perceptions differ from person to person and
one person's "single lettuce leaf" might be another person's "side salad".
Studying how food is perceived in relation to what it actually is typically
involves a laboratory setup. Here we propose to use recent advances in image
recognition to tackle this problem. Concretely, we use data for 1.9 million
images from Instagram from the US to look at systematic differences in how a
machine would objectively label an image compared to how a human subjectively
does. We show that this difference, which we call the "perception gap", relates
to a number of health outcomes observed at the county level. To the best of our
knowledge, this is the first time that image recognition is being used to study
the "misalignment" of how people describe food images vs. what they actually
depict.
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2017 10:36:28 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"Ofli",
"Ferda",
""
],
[
"Aytar",
"Yusuf",
""
],
[
"Weber",
"Ingmar",
""
],
[
"Hammouri",
"Raggi al",
""
],
[
"Torralba",
"Antonio",
""
]
] |
new_dataset
| 0.99281 |
1702.06384
|
Wolfgang John
|
Wolfgang John, Andr\'as Kern, Mario Kind, Pontus Sk\"oldstr\"om,
Dimitri Staessens, Hagen Woesner
|
Splitarchitecture: SDN for the carrier domain
|
Pre-print of article published in IEEE Communications Magazine vol.
52, no. 10, pp. 146-152, October 2014
|
IEEE Communications Magazine (Volume: 52, Issue: 10, October 2014)
|
10.1109/MCOM.2014.6917416
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The concept of SDN has emerged as a way to address numerous challenges with
traditional network architectures by decoupling network control and forwarding.
So far, the use cases for SDN mainly targeted data-center applications. This
article considers SDN for network carriers, facing operation of large-scale
networks with millions of customers, multiple technologies, and high
availability demands. With specific carrier-grade features such as scalability,
reliability, flexibility, modularity, and virtualization in mind, the SPARC EU
project has developed the SPARC SplitArchitecture concept. The
SplitArchitecture control plane allows hierarchical layering of several control
plane layers which can be flexibly mapped to data plane layers. Between control
layers open interfaces are used. Furthermore, SplitArchitecture proposes an
additional split of forwarding and processing functions in data path elements,
enabling switch based OAM functionality and handling of tunneling techniques.
The SplitArchitecture concept is evaluated in a prototype demonstrating an SDN
version of BRAS: the floating BRAS. The floating BRAS allows creation of
residential Internet access services with dynamically managed BRAS instances.
The demo is based on a controller enabling protected MPLS transport connections
spanning SDN-controlled aggregation and IP/MPLS-based core domains. The
prototype showcases how SplitArchitecture enables virtualization of service
nodes in an SDN-controlled network, leading to increased flexibility in
configuration and placement of service creation functions. Overall, the results
show that it is technically and economically beneficial to apply SDN, and
specifically the SplitArchitecture concept, to the carrier domain.
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2017 13:56:01 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"John",
"Wolfgang",
""
],
[
"Kern",
"András",
""
],
[
"Kind",
"Mario",
""
],
[
"Sköldström",
"Pontus",
""
],
[
"Staessens",
"Dimitri",
""
],
[
"Woesner",
"Hagen",
""
]
] |
new_dataset
| 0.997581 |
1702.06387
|
Wolfgang John
|
Wolfgang John, Guido Marchetto, Felici\'an N\'emeth, Pontus
Sk\"oldstr\"om, Rebecca Steinert, Catalin Meirosu, Ioanna Papafili, Kostas
Pentikousis
|
Service Provider DevOps
|
Pre-print of article published in IEEE Communications Magazine, vol.
55, no. 1, pp. 204-211, January 2017
|
IEEE Communications Magazine (Volume: 55, Issue: 1, January 2017)
|
10.1109/MCOM.2017.1500803CM
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although there is consensus that software defined networking and network
functions virtualization overhaul service provisioning and deployment, the
community still lacks a definite answer on how carrier-grade operations praxis
needs to evolve. This article presents what lies beyond the first evolutionary
steps in network management, identifies the challenges in service verification,
observability, and troubleshooting, and explains how to address them using our
Service Provider DevOps (SP-DevOps) framework. We compendiously cover the
entire process from design goals to tool realization and employ an elastic
version of an industry-standard use case to show how on-the-fly verification,
software-defined monitoring, and automated troubleshooting of services reduce
the cost of fault management actions. We assess SP-DevOps with respect to key
attributes of software-defined telecommunication infrastructures both
qualitatively and quantitatively, and demonstrate that SP-DevOps paves the way
toward carrier-grade operations and management in the network virtualization
era.
|
[
{
"version": "v1",
"created": "Tue, 21 Feb 2017 13:59:48 GMT"
}
] | 2017-02-22T00:00:00 |
[
[
"John",
"Wolfgang",
""
],
[
"Marchetto",
"Guido",
""
],
[
"Németh",
"Felicián",
""
],
[
"Sköldström",
"Pontus",
""
],
[
"Steinert",
"Rebecca",
""
],
[
"Meirosu",
"Catalin",
""
],
[
"Papafili",
"Ioanna",
""
],
[
"Pentikousis",
"Kostas",
""
]
] |
new_dataset
| 0.966948 |
1604.08845
|
Li Wei Ph.D
|
Li Wei, Wangdong Qi
|
Closed-form, robust and accurate multi-frequency phase unwrapping:
frequency design and algorithm
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A closed-form algorithm, named "concerto", is proposed for phase-based
distance estimation in multi-frequency phase unwrapping (MFPU) system. The
concerto method consists of three coherent estimation stages,i.e., initial
modified BW estimation, residual error estimation and LS estimation , each of
which has a closed-form expression and cooperates closely with each other like
a concerto. Due to a specially designed frequency pattern, concerto is
reliable, accurate, and computationally simple. Meanwhile, measurement
frequency selection is an easier task. Performance comparisons with beat
wavelength (BW), excess fractions (EF) and Chinese remainder theorem (CRT)
method confirm that our method outperforms these methods both in accuracy and
reliability and can asymptotically achieve the Cramer-Rao bound (CRB).
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2016 14:18:28 GMT"
},
{
"version": "v2",
"created": "Sat, 18 Feb 2017 13:07:09 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Wei",
"Li",
""
],
[
"Qi",
"Wangdong",
""
]
] |
new_dataset
| 0.99905 |
1608.07955
|
Yangqi Huang
|
Yangqi Huang, Wang Kang, Xichao Zhang, Yan Zhou and Weisheng Zhao
|
Magnetic skyrmion-based synaptic devices
| null |
Nanotechnology 28, 08LT02 (2017)
|
10.1088/1361-6528/aa5838
| null |
cs.ET cond-mat.str-el cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Magnetic skyrmions are promising candidates for next-generation information
carriers, owing to their small size, topological stability, and ultralow
depinning current density. A wide variety of skyrmionic device concepts and
prototypes have been proposed, highlighting their potential applications. Here,
we report on a bioinspired skyrmionic device with synaptic plasticity. The
synaptic weight of the proposed device can be strengthened/weakened by
positive/negative stimuli, mimicking the potentiation/depression process of a
biological synapse. Both short-term plasticity(STP) and long-term
potentiation(LTP) functionalities have been demonstrated for a spiking
time-dependent plasticity(STDP) scheme. This proposal suggests new
possibilities for synaptic devices for use in spiking neuromorphic computing
applications.
|
[
{
"version": "v1",
"created": "Mon, 29 Aug 2016 09:05:28 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Huang",
"Yangqi",
""
],
[
"Kang",
"Wang",
""
],
[
"Zhang",
"Xichao",
""
],
[
"Zhou",
"Yan",
""
],
[
"Zhao",
"Weisheng",
""
]
] |
new_dataset
| 0.999417 |
1702.05528
|
Osama A. Hanna
|
Osama A. Hanna, Amr El-Keyi and Mohammed Nafie
|
Degrees of Freedom in Cached MIMO Relay Networks With Multiple Base
Stations
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability of physical layer relay caching to increase the degrees of
freedom (DoF) of a single cell was recently illustrated. In this paper, we
extend this result to the case of multiple cells in which a caching relay is
shared among multiple non-cooperative base stations (BSs). In particular, we
show that a large DoF gain can be achieved by exploiting the benefits of having
a shared relay that cooperates with the BSs. We first propose a cache-assisted
relaying protocol that improves the cooperation opportunity between the BSs and
the relay. Next, we consider the cache content placement problem that aims to
design the cache content at the relay such that the DoF gain is maximized. We
propose an optimal algorithm and a near-optimal low-complexity algorithm for
the cache content placement problem. Simulation results show significant
improvement in the DoF gain using the proposed relay-caching protocol.
|
[
{
"version": "v1",
"created": "Fri, 17 Feb 2017 21:51:33 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Hanna",
"Osama A.",
""
],
[
"El-Keyi",
"Amr",
""
],
[
"Nafie",
"Mohammed",
""
]
] |
new_dataset
| 0.95709 |
1702.05547
|
Benjamin Hellouin de Menibus
|
Diego Maldonado, Anah\'i Gajardo, Benjamin Hellouin de Menibus,
Andr\'es Moreira
|
Nontrivial Turmites are Turing-universal
|
19 pages, submitted to Theoretical Computer Science
| null | null | null |
cs.CC nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Turmit is a Turing machine that works over a two-dimensional grid, that is,
an agent that moves, reads and writes symbols over the cells of the grid. Its
state is an arrow and, depending on the symbol that it reads, it turns to the
left or to the right, switching the symbol at the same time. Several symbols
are admitted, and the rule is specified by the turning sense that the machine
has over each symbol. Turmites are a generalization of Langtons ant, and they
present very complex and diverse behaviors. We prove that any Turmite, except
for those whose rule does not depend on the symbol, can simulate any Turing
Machine. We also prove the P-completeness of prediction their future behavior
by explicitly giving a log-space reduction from the Topological Circuit Value
Problem. A similar result was already established for Langtons ant; here we use
a similar technique but prove a stronger notion of simulation, and for a more
general family.
|
[
{
"version": "v1",
"created": "Sat, 18 Feb 2017 00:19:02 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Maldonado",
"Diego",
""
],
[
"Gajardo",
"Anahí",
""
],
[
"de Menibus",
"Benjamin Hellouin",
""
],
[
"Moreira",
"Andrés",
""
]
] |
new_dataset
| 0.999612 |
1702.05552
|
Tharindu Fernando
|
Tharindu Fernando, Simon Denman, Sridha Sridharan and Clinton Fookes
|
Soft + Hardwired Attention: An LSTM Framework for Human Trajectory
Prediction and Abnormal Event Detection
| null | null | null | null |
cs.CV cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As humans we possess an intuitive ability for navigation which we master
through years of practice; however existing approaches to model this trait for
diverse tasks including monitoring pedestrian flow and detecting abnormal
events have been limited by using a variety of hand-crafted features. Recent
research in the area of deep-learning has demonstrated the power of learning
features directly from the data; and related research in recurrent neural
networks has shown exemplary results in sequence-to-sequence problems such as
neural machine translation and neural image caption generation. Motivated by
these approaches, we propose a novel method to predict the future motion of a
pedestrian given a short history of their, and their neighbours, past
behaviour. The novelty of the proposed method is the combined attention model
which utilises both "soft attention" as well as "hard-wired" attention in order
to map the trajectory information from the local neighbourhood to the future
positions of the pedestrian of interest. We illustrate how a simple
approximation of attention weights (i.e hard-wired) can be merged together with
soft attention weights in order to make our model applicable for challenging
real world scenarios with hundreds of neighbours. The navigational capability
of the proposed method is tested on two challenging publicly available
surveillance databases where our model outperforms the current-state-of-the-art
methods. Additionally, we illustrate how the proposed architecture can be
directly applied for the task of abnormal event detection without handcrafting
the features.
|
[
{
"version": "v1",
"created": "Sat, 18 Feb 2017 01:08:18 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Fernando",
"Tharindu",
""
],
[
"Denman",
"Simon",
""
],
[
"Sridharan",
"Sridha",
""
],
[
"Fookes",
"Clinton",
""
]
] |
new_dataset
| 0.988448 |
1702.05564
|
Angus Galloway
|
Angus Galloway, Graham W. Taylor, Aaron Ramsay, Medhat Moussa
|
The Ciona17 Dataset for Semantic Segmentation of Invasive Species in a
Marine Aquaculture Environment
|
Submitted to the Conference on Computer and Robot Vision (CRV) 2017
| null |
10.5683/SP/NTUOK9
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An original dataset for semantic segmentation, Ciona17, is introduced, which
to the best of the authors' knowledge, is the first dataset of its kind with
pixel-level annotations pertaining to invasive species in a marine environment.
Diverse outdoor illumination, a range of object shapes, colour, and severe
occlusion provide a significant real world challenge for the computer vision
community. An accompanying ground-truthing tool for superpixel labeling, Truth
and Crop, is also introduced. Finally, we provide a baseline using a variant of
Fully Convolutional Networks, and report results in terms of the standard mean
intersection over union (mIoU) metric.
|
[
{
"version": "v1",
"created": "Sat, 18 Feb 2017 03:40:33 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Galloway",
"Angus",
""
],
[
"Taylor",
"Graham W.",
""
],
[
"Ramsay",
"Aaron",
""
],
[
"Moussa",
"Medhat",
""
]
] |
new_dataset
| 0.999848 |
1702.05591
|
Lucas Carvalho Cordeiro
|
Lennon Chaves, Iury Bessa, Lucas Cordeiro, Daniel Kroening, Eddie
Filho
|
Verifying Digital Systems with MATLAB
|
4 pages
| null | null | null |
cs.SY cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A MATLAB toolbox is presented, with the goal of checking occurrences of
design errors typically found in fixed-point digital systems, considering
finite word-length effects. In particular, the present toolbox works as a
front-end to a recently introduced verification tool, known as Digital-System
Verifier, and checks overflow, limit cycle, quantization, stability, and
minimum phase errors, in digital systems represented by transfer-function and
state-space equations. It provides a command-line version, with simplified
access to specific functions, and a graphical-user interface, which was
developed as a MATLAB application. The resulting toolbox is important for the
verification community, since it shows the applicability of verification to
real-world systems.
|
[
{
"version": "v1",
"created": "Sat, 18 Feb 2017 09:52:02 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Chaves",
"Lennon",
""
],
[
"Bessa",
"Iury",
""
],
[
"Cordeiro",
"Lucas",
""
],
[
"Kroening",
"Daniel",
""
],
[
"Filho",
"Eddie",
""
]
] |
new_dataset
| 0.990754 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.