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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1702.05638
|
Martin Potthast
|
Martin Potthast, Johannes Kiesel, Kevin Reinartz, Janek Bevendorff,
Benno Stein
|
A Stylometric Inquiry into Hyperpartisan and Fake News
|
10 pages, 3 figures, 6 tables, submitted to ACL 2017
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper reports on a writing style analysis of hyperpartisan (i.e.,
extremely one-sided) news in connection to fake news. It presents a large
corpus of 1,627 articles that were manually fact-checked by professional
journalists from BuzzFeed. The articles originated from 9 well-known political
publishers, 3 each from the mainstream, the hyperpartisan left-wing, and the
hyperpartisan right-wing. In sum, the corpus contains 299 fake news, 97% of
which originated from hyperpartisan publishers.
We propose and demonstrate a new way of assessing style similarity between
text categories via Unmasking---a meta-learning approach originally devised for
authorship verification---, revealing that the style of left-wing and
right-wing news have a lot more in common than any of the two have with the
mainstream. Furthermore, we show that hyperpartisan news can be discriminated
well by its style from the mainstream (F1=0.78), as can be satire from both
(F1=0.81). Unsurprisingly, style-based fake news detection does not live up to
scratch (F1=0.46). Nevertheless, the former results are important to implement
pre-screening for fake news detectors.
|
[
{
"version": "v1",
"created": "Sat, 18 Feb 2017 18:10:04 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Potthast",
"Martin",
""
],
[
"Kiesel",
"Johannes",
""
],
[
"Reinartz",
"Kevin",
""
],
[
"Bevendorff",
"Janek",
""
],
[
"Stein",
"Benno",
""
]
] |
new_dataset
| 0.987981 |
1702.05693
|
Shanshan Zhang
|
Shanshan Zhang, Rodrigo Benenson and Bernt Schiele
|
CityPersons: A Diverse Dataset for Pedestrian Detection
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Convnets have enabled significant progress in pedestrian detection recently,
but there are still open questions regarding suitable architectures and
training data. We revisit CNN design and point out key adaptations, enabling
plain FasterRCNN to obtain state-of-the-art results on the Caltech dataset.
To achieve further improvement from more and better data, we introduce
CityPersons, a new set of person annotations on top of the Cityscapes dataset.
The diversity of CityPersons allows us for the first time to train one single
CNN model that generalizes well over multiple benchmarks. Moreover, with
additional training with CityPersons, we obtain top results using FasterRCNN on
Caltech, improving especially for more difficult cases (heavy occlusion and
small scale) and providing higher localization quality.
|
[
{
"version": "v1",
"created": "Sun, 19 Feb 2017 03:01:55 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Zhang",
"Shanshan",
""
],
[
"Benenson",
"Rodrigo",
""
],
[
"Schiele",
"Bernt",
""
]
] |
new_dataset
| 0.999395 |
1702.05699
|
ElMouatez Billah Karbab
|
ElMouatez Billah Karbab, Mourad Debbabi, Saed Alrabaee, Djedjiga
Mouheb
|
DySign: Dynamic Fingerprinting for the Automatic Detection of Android
Malware
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The astonishing spread of Android OS, not only in smartphones and tablets but
also in IoT devices, makes this operating system a very tempting target for
malware threats. Indeed, the latter are expanding at a similar rate. In this
respect, malware fingerprints, whether based on cryptographic or fuzzy-hashing,
are the first defense line against such attacks. Fuzzy-hashing fingerprints are
suitable for capturing malware static features. Moreover, they are more
resilient to small changes in the actual static content of malware files. On
the other hand, dynamic analysis is another technique for malware detection
that uses emulation environments to extract behavioral features of Android
malware. However, to the best of our knowledge, there is no such fingerprinting
technique that leverages dynamic analysis and would act as the first defense
against Android malware attacks. In this paper, we address the following
question: could we generate effective fingerprints for Android malware through
dynamic analysis? To this end, we propose DySign, a novel technique for
fingerprinting Android malware's dynamic behaviors. This is achieved through
the generation of a digest from the dynamic analysis of a malware sample on
existing known malware. It is important to mention that: (i) DySign
fingerprints are approximated of the observed behaviors during dynamic analysis
so as to achieve resiliency to small changes in the behaviors of future malware
variants; (ii) Fingerprint computation is agnostic to the analyzed malware
sample or family. DySign leverages state-of-the-art Natural Language Processing
(NLP) techniques to generate the aforementioned fingerprints, which are then
leveraged to build an enhanced Android malware detection system with family
attribution.
|
[
{
"version": "v1",
"created": "Sun, 19 Feb 2017 04:19:11 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Karbab",
"ElMouatez Billah",
""
],
[
"Debbabi",
"Mourad",
""
],
[
"Alrabaee",
"Saed",
""
],
[
"Mouheb",
"Djedjiga",
""
]
] |
new_dataset
| 0.998745 |
1702.05723
|
Daniel M\'endez Fern\'andez
|
Marco Kuhrmann and Daniel M\'endez Fern\'andez
|
From Pragmatic to Systematic Software Process Improvement: An Evaluated
Approach
|
IET Software, 2015
| null |
10.1049/iet-sen.2014.0190
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software processes improvement (SPI) is a challenging task, as many different
stakeholders, project settings, and contexts and goals need to be considered.
SPI projects are often operated in a complex and volatile environment and,
thus, require a sound management that is resource-intensive requiring many
stakeholders to contribute to the process assessment, analysis, design,
realisation, and deployment. Although there exist many valuable SPI approaches,
none address the needs of both process engineers and project managers. This
article presents an Artefact-based Software Process Improvement & Management
approach (ArSPI) that closes this gap. ArSPI was developed and tested across
several SPI projects in large organisations in Germany and Eastern Europe. The
approach further encompasses a template for initiating, performing, and
managing SPI projects by defining a set of 5 key artefacts and 24 support
artefacts. We present ArSPI and discus results of its validation indicating
ArSPI to be a helpful instrument to set up and steer SPI projects.
|
[
{
"version": "v1",
"created": "Sun, 19 Feb 2017 08:43:07 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Kuhrmann",
"Marco",
""
],
[
"Fernández",
"Daniel Méndez",
""
]
] |
new_dataset
| 0.981187 |
1702.05833
|
Preeti Kumari
|
Preeti Kumari, Junil Choi, Nuria Gonzalez-Prelcic, and Robert W. Heath
Jr
|
IEEE 802.11ad-based Radar: An Approach to Joint Vehicular
Communication-Radar System
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Millimeter-wave (mmWave) radar is widely used in vehicles for applications
such as adaptive cruise control and collision avoidance. In this paper, we
propose an IEEE 802.11ad-based radar for long-range radar (LRR) applications at
the 60 GHz unlicensed band. We exploit the preamble of a single-carrier (SC)
physical layer (PHY) frame, which consists of Golay complementary sequences
with good correlation properties, as a radar waveform. This system enables a
joint waveform for automotive radar and a potential mmWave vehicular
communication system based on IEEE 802.11ad, allowing hardware reuse. To
formulate an integrated framework of vehicle-to-vehicle (V2V) communication and
LRR based on a mmWave consumer wireless local area network (WLAN) standard, we
make typical assumptions for LRR applications and incorporate the full duplex
radar assumption due to the possibility of sufficient isolation and
self-interference cancellation. We develop single- and multi-frame radar
receiver algorithms for target detection as well as range and velocity
estimation within a coherent processing interval. Our proposed radar processing
algorithms leverage channel estimation and time-frequency synchronization
techniques used in a conventional IEEE 802.11ad receiver with minimal
modifications. Analysis and simulations show that in a single target scenario,
a Gbps data rate is achieved simultaneously with cm-level range accuracy and
cm/s-level velocity accuracy. The target vehicle is detected with a high
probability of detection ($>$99.9$\%$) at a low false alarm of 10$^{-6}$ for an
equivalent isotropically radiated power (EIRP) of 43 dBm up to a vehicle
separation distance of 200 m.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 01:58:04 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Kumari",
"Preeti",
""
],
[
"Choi",
"Junil",
""
],
[
"Gonzalez-Prelcic",
"Nuria",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.998858 |
1702.05983
|
Weiwei Hu
|
Weiwei Hu and Ying Tan
|
Generating Adversarial Malware Examples for Black-Box Attacks Based on
GAN
| null | null | null | null |
cs.LG cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Machine learning has been used to detect new malware in recent years, while
malware authors have strong motivation to attack such algorithms. Malware
authors usually have no access to the detailed structures and parameters of the
machine learning models used by malware detection systems, and therefore they
can only perform black-box attacks. This paper proposes a generative
adversarial network (GAN) based algorithm named MalGAN to generate adversarial
malware examples, which are able to bypass black-box machine learning based
detection models. MalGAN uses a substitute detector to fit the black-box
malware detection system. A generative network is trained to minimize the
generated adversarial examples' malicious probabilities predicted by the
substitute detector. The superiority of MalGAN over traditional gradient based
adversarial example generation algorithms is that MalGAN is able to decrease
the detection rate to nearly zero and make the retraining based defensive
method against adversarial examples hard to work.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 14:32:17 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Hu",
"Weiwei",
""
],
[
"Tan",
"Ying",
""
]
] |
new_dataset
| 0.98626 |
1702.06025
|
Saravanan Thirumuruganathan
|
Rade Stanojevic, Sofiane Abbar, Saravanan Thirumuruganathan, Sanjay
Chawla, Fethi Filali, Ahid Aleimat
|
Kharita: Robust Map Inference using Graph Spanners
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The widespread availability of GPS information in everyday devices such as
cars, smartphones and smart watches make it possible to collect large amount of
geospatial trajectory information. A particularly important, yet technically
challenging, application of this data is to identify the underlying road
network and keep it updated under various changes. In this paper, we propose
efficient algorithms that can generate accurate maps in both batch and online
settings. Our algorithms utilize techniques from graph spanners so that they
produce maps can effectively handle a wide variety of road and intersection
shapes. We conduct a rigorous evaluation of our algorithms over two real-world
datasets and under a wide variety of performance metrics. Our experiments show
a significant improvement over prior work. In particular, we observe an
increase in Biagioni f-score of up to 20% when compared to the state of the art
while reducing the execution time by an order of magnitude. We also make our
source code open source for reproducibility and enable other researchers to
build on our work.
|
[
{
"version": "v1",
"created": "Mon, 20 Feb 2017 15:51:07 GMT"
}
] | 2017-02-21T00:00:00 |
[
[
"Stanojevic",
"Rade",
""
],
[
"Abbar",
"Sofiane",
""
],
[
"Thirumuruganathan",
"Saravanan",
""
],
[
"Chawla",
"Sanjay",
""
],
[
"Filali",
"Fethi",
""
],
[
"Aleimat",
"Ahid",
""
]
] |
new_dataset
| 0.986139 |
1606.01655
|
Andrew Paverd
|
Sandeep Tamrakar, Jian Liu, Andrew Paverd, Jan-Erik Ekberg, Benny
Pinkas, N. Asokan
|
The Circle Game: Scalable Private Membership Test Using Trusted Hardware
|
Extended version of a paper published at ACM ASIACCS 2017
| null |
10.1145/3052973.3053006
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Malware checking is changing from being a local service to a cloud-assisted
one where users' devices query a cloud server, which hosts a dictionary of
malware signatures, to check if particular applications are potentially
malware. Whilst such an architecture gains all the benefits of cloud-based
services, it opens up a major privacy concern since the cloud service can infer
personal traits of the users based on the lists of applications queried by
their devices. Private membership test (PMT) schemes can remove this privacy
concern. However, known PMT schemes do not scale well to a large number of
simultaneous users and high query arrival rates. We propose a simple PMT
approach using a carousel: circling the entire dictionary through trusted
hardware on the cloud server. Users communicate with the trusted hardware via
secure channels. We show how the carousel approach, using different data
structures to represent the dictionary, can be realized on two different
commercial hardware security architectures (ARM TrustZone and Intel SGX). We
highlight subtle aspects of securely implementing seemingly simple PMT schemes
on these architectures. Through extensive experimental analysis, we show that
for the malware checking scenario our carousel approach surprisingly
outperforms Path ORAM on the same hardware by supporting a much higher query
arrival rate while guaranteeing acceptable response latency for individual
queries.
|
[
{
"version": "v1",
"created": "Mon, 6 Jun 2016 08:29:22 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Jun 2016 08:20:13 GMT"
},
{
"version": "v3",
"created": "Wed, 24 Aug 2016 08:44:52 GMT"
},
{
"version": "v4",
"created": "Fri, 17 Feb 2017 15:32:40 GMT"
}
] | 2017-02-20T00:00:00 |
[
[
"Tamrakar",
"Sandeep",
""
],
[
"Liu",
"Jian",
""
],
[
"Paverd",
"Andrew",
""
],
[
"Ekberg",
"Jan-Erik",
""
],
[
"Pinkas",
"Benny",
""
],
[
"Asokan",
"N.",
""
]
] |
new_dataset
| 0.999472 |
1702.04940
|
Karl von Ellenrieder
|
Ivan R. Bertaska and Karl D. von Ellenrieder
|
Supervisory Switching Control of an Unmanned Surface Vehicle
| null |
MTS/IEEE Oceans 2015
| null | null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel method to determine the switching of controllers to increase the
performance of a system is presented. Three controllers are utilized to capture
three behaviors representative of unmanned surface vehicles (USVs). An
underactuated nonlinear controller is derived to transit the vehicle between
locations; a fully-actuated nonlinear controller is given to station-keep the
vehicle at a setpoint; and a linear anti-windup controller is presented for the
reversing mode of operation. Given a trajectory to follow, a performance-based
supervisory switching control system (PBSSC) dictates the switching between
controllers to improve system performance. Experimental results are shown that
indicate that the PBSSC system is able to mitigate errors in pose better than
any of the individual controllers.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 12:12:22 GMT"
}
] | 2017-02-20T00:00:00 |
[
[
"Bertaska",
"Ivan R.",
""
],
[
"von Ellenrieder",
"Karl D.",
""
]
] |
new_dataset
| 0.976947 |
1702.04941
|
Karl Von Ellenrieder
|
Edoardo I. Sarda, Huajin Qu, Ivan R. Bertaska and Karl D. von
Ellenrieder
|
Station-keeping control of an unmanned surface vehicle exposed to
current and wind disturbances
| null |
Journal of Ocean Engineering, Volume 127, Pages 305-324, 2016
|
10.1016/j.oceaneng.2016.09.037
| null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Field trials of a 4 meter long, 180 kilogram, unmanned surface vehicle (USV)
have been conducted to evaluate the performance of station-keeping heading and
position controllers in an outdoor marine environment disturbed by wind and
current. The USV has a twin hull configuration and a custom-designed propulsion
system, which consists of two azimuthing thrusters, one for each hull.
Nonlinear proportional derivative, backstepping and sliding mode feedback
controllers were tested in winds of about 4-5 knots, with and without wind
feedforward control. The controllers were tested when the longitudinal axis of
the USV was aligned with the mean wind direction and when the longitudinal axis
was perpendicular to the mean wind direction. It was found that the sliding
mode controller performed best overall and that the addition of wind
feedforward control did not significantly improve its effectiveness. However,
wind feedforward control did substantially improve the performance of the
proportional derivative and backstepping controllers when the mean wind
direction was perpendicular to the longitudinal axis of the USV. An analysis of
the length scales present in the power spectrum of the turbulent speed
fluctuations in the wind suggests that a single anemometer is sufficient to
characterize the speed and direction of the wind acting on the USV.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 12:15:36 GMT"
}
] | 2017-02-20T00:00:00 |
[
[
"Sarda",
"Edoardo I.",
""
],
[
"Qu",
"Huajin",
""
],
[
"Bertaska",
"Ivan R.",
""
],
[
"von Ellenrieder",
"Karl D.",
""
]
] |
new_dataset
| 0.999487 |
1702.05183
|
Vincent Jug\'e
|
Patricia Bouyer-Decitre, Vincent Jug\'e, Nicolas Markey
|
Courcelle's Theorem Made Dynamic
|
14 pages, 4 figures. arXiv admin note: text overlap with
arXiv:1610.00571
| null | null | null |
cs.CC cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dynamic complexity is concerned with updating the output of a problem when
the input is slightly changed. We study the dynamic complexity of model
checking a fixed monadic second-order formula over evolving subgraphs of a
fixed maximal graph having bounded tree-width; here the subgraph evolves by
losing or gaining edges (from the maximal graph). We show that this problem is
in DynFO (with LOGSPACE precomputation), via a reduction to a Dyck reachability
problem on an acyclic automaton.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 23:21:34 GMT"
}
] | 2017-02-20T00:00:00 |
[
[
"Bouyer-Decitre",
"Patricia",
""
],
[
"Jugé",
"Vincent",
""
],
[
"Markey",
"Nicolas",
""
]
] |
new_dataset
| 0.997413 |
1702.05241
|
Nils Ole Tippenhauer
|
Naman Govil and Anand Agrawal and Nils Ole Tippenhauer
|
On Ladder Logic Bombs in Industrial Control Systems
|
11 pages, 14 figures, 2 tables, 1 algorithm
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In industrial control systems, devices such as Programmable Logic Controllers
(PLCs) are commonly used to directly interact with sensors and actuators, and
perform local automatic control. PLCs run software on two different layers: a)
firmware (i.e. the OS) and b) control logic (processing sensor readings to
determine control actions). In this work, we discuss ladder logic bombs, i.e.
malware written in ladder logic (or one of the other IEC 61131-3-compatible
languages). Such malware would be inserted by an attacker into existing control
logic on a PLC, and either persistently change the behavior, or wait for
specific trigger signals to activate malicious behaviour. For example, the LLB
could replace legitimate sensor readings with manipulated values. We see the
concept of LLBs as a generalization of attacks such as the Stuxnet attack. We
introduce LLBs on an abstract level, and then demonstrate several designs based
on real PLC devices in our lab. In particular, we also focus on stealthy LLBs,
i.e. LLBs that are hard to detect by human operators manually validating the
program running in PLCs. In addition to introducing vulnerabilities on the
logic layer, we also discuss countermeasures and we propose two detection
techniques.
|
[
{
"version": "v1",
"created": "Fri, 17 Feb 2017 07:18:01 GMT"
}
] | 2017-02-20T00:00:00 |
[
[
"Govil",
"Naman",
""
],
[
"Agrawal",
"Anand",
""
],
[
"Tippenhauer",
"Nils Ole",
""
]
] |
new_dataset
| 0.999634 |
1312.1231
|
Ulrich Bauer
|
Ulrich Bauer, Herbert Edelsbrunner
|
The Morse theory of \v{C}ech and Delaunay complexes
|
21 pages, 2 figures, improved exposition
|
Trans. Amer. Math. Soc. 369 (2017), 3741-3762
|
10.1090/tran/6991
| null |
cs.CG math.AT math.GT math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a finite set of points in $\mathbb R^n$ and a radius parameter, we
study the \v{C}ech, Delaunay-\v{C}ech, Delaunay (or Alpha), and Wrap complexes
in the light of generalized discrete Morse theory. Establishing the \v{C}ech
and Delaunay complexes as sublevel sets of generalized discrete Morse
functions, we prove that the four complexes are simple-homotopy equivalent by a
sequence of simplicial collapses, which are explicitly described by a single
discrete gradient field.
|
[
{
"version": "v1",
"created": "Wed, 4 Dec 2013 16:21:05 GMT"
},
{
"version": "v2",
"created": "Mon, 10 Aug 2015 11:31:47 GMT"
},
{
"version": "v3",
"created": "Sat, 30 Apr 2016 10:00:26 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Bauer",
"Ulrich",
""
],
[
"Edelsbrunner",
"Herbert",
""
]
] |
new_dataset
| 0.976902 |
1412.0981
|
Sergey Vostokin
|
Sergey Vostokin
|
Templet: a Markup Language for Concurrent Programming
|
13 pages
| null |
10.18287/1613-0073-2016-1638-460-468
| null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose a new approach to the description of a network of
interacting processes in a traditional programming language. Special
programming languages or extensions to sequential languages are usually
designed to express the semantics of concurrent execution. Using libraries in
C++, Java, C#, and other languages is more practical way of concurrent
programming. However, this method leads to an increase in workload of a manual
coding. Besides, stock compilers can not detect semantic errors related to the
programming model in such libraries. The new markup language and a special
technique of automatic programming based on the marked code can solve these
problems. The article provides a detailed specification of the markup language
without discussing its implementation details. The language is used for
programming of current and prospective multi-core and many-core systems.
|
[
{
"version": "v1",
"created": "Tue, 2 Dec 2014 17:06:28 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Vostokin",
"Sergey",
""
]
] |
new_dataset
| 0.999422 |
1608.01889
|
Lorenzo Fagiano
|
Lorenzo Fagiano, Eric Nguyen-Van, Felix Rager, Stephan Schnez, and
Christian Ohler
|
Autonomous Take-Off and Flight of a Tethered Aircraft for Airborne Wind
Energy
|
This is the pre-print of a paper accepted for publication on the IEEE
Transactions on Control systems Technology and is subject to IEEE Copyright.
doi: 10.1109/TCST.2017.2661825
| null |
10.1109/TCST.2017.2661825
| null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A control design approach to achieve fully autonomous take-off and flight
maneuvers with a tethered aircraft is presented and demonstrated in real-world
flight tests with a small-scale prototype. A ground station equipped with a
controlled winch and a linear motion system accelerates the aircraft to
take-off speed and controls the tether reeling in order to limit the pulling
force. This setup corresponds to airborne wind energy systems with ground-based
energy generation and rigid aircrafts. A simple model of the aircraft's
dynamics is introduced and its parameters are identified from experimental
data. A model-based, hierarchical feedback controller is then designed, whose
aim is to manipulate the elevator, aileron and propeller inputs in order to
stabilize the aircraft during the take-off and to achieve figure-of-eight
flight patterns parallel to the ground. The controller operates in a fully
decoupled mode with respect to the ground station. Parameter tuning and
stability/robustness aspect are discussed, too. The experimental results
indicate that the controller is able to achieve satisfactory performance and
robustness, notwithstanding its simplicity, and confirm that the considered
take-off approach is technically viable and solves the issue of launching this
kind of airborne wind energy systems in a compact space and at low additional
cost.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2016 14:07:04 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Feb 2017 09:33:05 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Fagiano",
"Lorenzo",
""
],
[
"Nguyen-Van",
"Eric",
""
],
[
"Rager",
"Felix",
""
],
[
"Schnez",
"Stephan",
""
],
[
"Ohler",
"Christian",
""
]
] |
new_dataset
| 0.999447 |
1701.08280
|
Kunal Narayan Chaudhury
|
Sanjay Ghosh, Amit K. Mandal, and Kunal N. Chaudhury
|
Pruned non-local means
|
Published in IET Image Processing
| null |
10.1049/iet-ipr.2016.0331
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Non-Local Means (NLM), each pixel is denoised by performing a weighted
averaging of its neighboring pixels, where the weights are computed using image
patches. We demonstrate that the denoising performance of NLM can be improved
by pruning the neighboring pixels, namely, by rejecting neighboring pixels
whose weights are below a certain threshold $\lambda$. While pruning can
potentially reduce pixel averaging in uniform-intensity regions, we demonstrate
that there is generally an overall improvement in the denoising performance. In
particular, the improvement comes from pixels situated close to edges and
corners. The success of the proposed method strongly depends on the choice of
the global threshold $\lambda$, which in turn depends on the noise level and
the image characteristics. We show how Stein's unbiased estimator of the
mean-squared error can be used to optimally tune $\lambda$, at a marginal
computational overhead. We present some representative denoising results to
demonstrate the superior performance of the proposed method over NLM and its
variants.
|
[
{
"version": "v1",
"created": "Sat, 28 Jan 2017 10:57:01 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Feb 2017 12:11:05 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Ghosh",
"Sanjay",
""
],
[
"Mandal",
"Amit K.",
""
],
[
"Chaudhury",
"Kunal N.",
""
]
] |
new_dataset
| 0.959778 |
1702.03880
|
Timo Kumberg
|
Timo Kumberg, Marc Schink, Leonhard Reindl, Christian Schindelhauer
|
T-ROME: A Simple and Energy Efficient Tree Routing Protocol for
Low-Power Wake-up Receivers
| null | null |
10.1016/j.adhoc.2017.02.003
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor networks are deployed in many monitoring applications but
still suffer from short lifetimes originating from limited energy sources and
storages. Due to their low-power consumption and their on-demand communication
ability, wake-up receivers represent an energy efficient and simple enhancement
to wireless sensor nodes and wireless sensor network protocols. In this
context, wake-up receivers have the ability to increase the network lifetime.
In this article, we present T-ROME, a simple and energy efficient cross-layer
routing protocol for wireless sensor nodes containing wake-up receivers. The
protocol makes use of the different transmission ranges of wake-up and main
radios in order to save energy by skipping nodes during data transfer. With
respect to energy consumption and latency, T-ROME outperforms existing
protocols in many scenarios. Here, we describe and analyze the cross layer
multi-hop protocol by means of a Markov chain model that we verify using a
laboratory test setup.
|
[
{
"version": "v1",
"created": "Mon, 13 Feb 2017 17:11:17 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Kumberg",
"Timo",
""
],
[
"Schink",
"Marc",
""
],
[
"Reindl",
"Leonhard",
""
],
[
"Schindelhauer",
"Christian",
""
]
] |
new_dataset
| 0.998749 |
1702.03906
|
Annie Ying
|
Erik Wittern, Annie T. T. Ying, Yunhui Zheng, Julian Dolby, Jim A.
Laredo
|
Statically Checking Web API Requests in JavaScript
|
International Conference on Software Engineering, 2017
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many JavaScript applications perform HTTP requests to web APIs, relying on
the request URL, HTTP method, and request data to be constructed correctly by
string operations. Traditional compile-time error checking, such as calling a
non-existent method in Java, are not available for checking whether such
requests comply with the requirements of a web API. In this paper, we propose
an approach to statically check web API requests in JavaScript. Our approach
first extracts a request's URL string, HTTP method, and the corresponding
request data using an inter-procedural string analysis, and then checks whether
the request conforms to given web API specifications. We evaluated our approach
by checking whether web API requests in JavaScript files mined from GitHub are
consistent or inconsistent with publicly available API specifications. From the
6575 requests in scope, our approach determined whether the request's URL and
HTTP method was consistent or inconsistent with web API specifications with a
precision of 96.0%. Our approach also correctly determined whether extracted
request data was consistent or inconsistent with the data requirements with a
precision of 87.9% for payload data and 99.9% for query data. In a systematic
analysis of the inconsistent cases, we found that many of them were due to
errors in the client code. The here proposed checker can be integrated with
code editors or with continuous integration tools to warn programmers about
code containing potentially erroneous requests.
|
[
{
"version": "v1",
"created": "Mon, 13 Feb 2017 18:15:19 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Feb 2017 22:39:21 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Wittern",
"Erik",
""
],
[
"Ying",
"Annie T. T.",
""
],
[
"Zheng",
"Yunhui",
""
],
[
"Dolby",
"Julian",
""
],
[
"Laredo",
"Jim A.",
""
]
] |
new_dataset
| 0.989046 |
1702.04479
|
Sungeun Hong
|
Sungeun Hong, Jongbin Ryu, Woobin Im, Hyun S. Yang
|
Recognizing Dynamic Scenes with Deep Dual Descriptor based on Key Frames
and Key Segments
|
10 pages, 7 figures, 8 tables
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
Recognizing dynamic scenes is one of the fundamental problems in scene
understanding, which categorizes moving scenes such as a forest fire,
landslide, or avalanche. While existing methods focus on reliable capturing of
static and dynamic information, few works have explored frame selection from a
dynamic scene sequence. In this paper, we propose dynamic scene recognition
using a deep dual descriptor based on `key frames' and `key segments.' Key
frames that reflect the feature distribution of the sequence with a small
number are used for capturing salient static appearances. Key segments, which
are captured from the area around each key frame, provide an additional
discriminative power by dynamic patterns within short time intervals. To this
end, two types of transferred convolutional neural network features are used in
our approach. A fully connected layer is used to select the key frames and key
segments, while the convolutional layer is used to describe them. We conducted
experiments using public datasets as well as a new dataset comprised of 23
dynamic scene classes with 10 videos per class. The evaluation results
demonstrated the state-of-the-art performance of the proposed method.
|
[
{
"version": "v1",
"created": "Wed, 15 Feb 2017 06:59:01 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Feb 2017 07:14:19 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Hong",
"Sungeun",
""
],
[
"Ryu",
"Jongbin",
""
],
[
"Im",
"Woobin",
""
],
[
"Yang",
"Hyun S.",
""
]
] |
new_dataset
| 0.998641 |
1702.04843
|
Abdul Kawsar Tushar
|
Mohammad Asiful Hossain and Abdul Kawsar Tushar
|
Chord Angle Deviation using Tangent (CADT), an Efficient and Robust
Contour-based Corner Detector
|
Conference Name - 2017 IEEE International Conference on Imaging,
Vision & Pattern Recognition (icIVPR17); Conference Date - 13 Feb, 2017;
Conference Venue - University of Dhaka, Dhaka, Bangladesh
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Detection of corner is the most essential process in a large number of
computer vision and image processing applications. We have mentioned a number
of popular contour-based corner detectors in our paper. Among all these
detectors chord to triangular arm angle (CTAA) has been demonstrated as the
most dominant corner detector in terms of average repeatability. We introduce a
new effective method to calculate the value of curvature in this paper. By
demonstrating experimental results, our proposed technique outperforms CTAA and
other detectors mentioned in this paper. The results exhibit that our proposed
method is simple yet efficient at finding out corners more accurately and
reliably.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 02:52:36 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Hossain",
"Mohammad Asiful",
""
],
[
"Tushar",
"Abdul Kawsar",
""
]
] |
new_dataset
| 0.991055 |
1702.04863
|
Md Salman Nazir
|
Md Salman Nazir and Ian A. Hiskens
|
Load Synchronization and Sustained Oscillations Induced by Transactive
Control
|
5 pages, 8 figures, accepted version for presentation at the 2017
IEEE PES General Meeting, July 16-20, 2017
| null | null | null |
cs.SY cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Transactive or market-based coordination strategies have recently been
proposed for controlling the aggregate demand of a large number of electric
loads. Such schemes offer operational benefits such as enforcing distribution
feeder capacity limits and providing users with flexibility to consume energy
based on the price they are willing to pay. However, this paper demonstrates
that they are also prone to load synchronization and power oscillations. A
transactive energy framework has been adopted and applied to a population of
thermostatically controlled loads (TCLs). A modified TCL switching logic takes
into account market coordination signals, alongside the natural
hysteresis-based switching conditions. Studies of this market-based
coordination scheme suggest that several factors may contribute to load
synchronism, including sharp changes in the market prices that are broadcast to
loads, lack of diversity in user specified bid curves, low feeder limits that
are encountered periodically, and the form of user bid curves. Case studies
illustrate challenges associated with market-based coordination strategies and
provide insights into modifications that address those issues.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 05:40:48 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Nazir",
"Md Salman",
""
],
[
"Hiskens",
"Ian A.",
""
]
] |
new_dataset
| 0.95785 |
1702.04886
|
Ilya Dumer
|
Ilya Dumer
|
Polar codes with a stepped boundary
|
This article has been submitted to ISIT 2017
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider explicit polar constructions of blocklength $n\rightarrow\infty$
for the two extreme cases of code rates $R\rightarrow1$ and $R\rightarrow0.$
For code rates $R\rightarrow1,$ we design codes with complexity order of $n\log
n$ in code construction, encoding, and decoding. These codes achieve the
vanishing output bit error rates on the binary symmetric channels with any
transition error probability $p\rightarrow 0$ and perform this task with a
substantially smaller redundancy $(1-R)n$ than do other known high-rate codes,
such as BCH codes or Reed-Muller (RM). We then extend our design to the
low-rate codes that achieve the vanishing output error rates with the same
complexity order of $n\log n$ and an asymptotically optimal code rate
$R\rightarrow0$ for the case of $p\rightarrow1/2.$
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 08:28:05 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Dumer",
"Ilya",
""
]
] |
new_dataset
| 0.989541 |
1702.04943
|
Pavlos Sermpezis
|
Pavlos Sermpezis, Thrasyvoulos Spyropoulos, Luigi Vigneri, Theodoros
Giannakas
|
Femto-Caching with Soft Cache Hits: Improving Performance through
Recommendation and Delivery of Related Content
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pushing popular content to cheap "helper" nodes (e.g., small cells) during
off-peak hours has recently been proposed to cope with the increase in mobile
data traffic. User requests can be served locally from these helper nodes, if
the requested content is available in at least one of the nearby helpers.
Nevertheless, the collective storage of a few nearby helper nodes does not
usually suffice to achieve a high enough hit rate in practice. We propose to
depart from the assumption of hard cache hits, common in existing works, and
consider "soft" cache hits, where if the original content is not available,
some related contents that are locally cached can be recommended instead. Given
that Internet content consumption is entertainment-oriented, we argue that
there exist scenarios where a user might accept an alternative content (e.g.,
better download rate for alternative content, low rate plans, etc.), thus
avoiding to access expensive/congested links. We formulate the problem of
optimal edge caching with soft cache hits in a relatively generic setup,
propose efficient algorithms, and analyze the expected gains. We then show
using synthetic and real datasets of related video contents that promising
caching gains could be achieved in practice.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 12:41:25 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Sermpezis",
"Pavlos",
""
],
[
"Spyropoulos",
"Thrasyvoulos",
""
],
[
"Vigneri",
"Luigi",
""
],
[
"Giannakas",
"Theodoros",
""
]
] |
new_dataset
| 0.994886 |
1702.05042
|
Bhaskar Mitra
|
Bhaskar Mitra, Fernando Diaz and Nick Craswell
|
Luandri: a Clean Lua Interface to the Indri Search Engine
|
Under review for SIGIR'17
| null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, the information retrieval (IR) community has witnessed the
first successful applications of deep neural network models to short-text
matching and ad-hoc retrieval. It is exciting to see the research on deep
neural networks and IR converge on these tasks of shared interest. However, the
two communities have less in common when it comes to the choice of programming
languages. Indri, an indexing framework popularly used by the IR community, is
written in C++, while Torch, a popular machine learning library for deep
learning, is written in the light-weight scripting language Lua. To bridge this
gap, we introduce Luandri (pronounced "laundry"), a simple interface for
exposing the search capabilities of Indri to Torch models implemented in Lua.
|
[
{
"version": "v1",
"created": "Thu, 16 Feb 2017 16:30:06 GMT"
}
] | 2017-02-17T00:00:00 |
[
[
"Mitra",
"Bhaskar",
""
],
[
"Diaz",
"Fernando",
""
],
[
"Craswell",
"Nick",
""
]
] |
new_dataset
| 0.997962 |
1506.00122
|
Mohammad Sabokrou
|
Mohammad Sabokrou, Mahmood Fathy and Mojtaba Hoseini
|
IDSA: Intelligent Distributed Sensor Activation Algorithm For Target
Tracking With Wireless Sensor Network
|
We have found several mistake in this our paper. (1) The English
writing of paper must improved (2) the experimental results especially Figure
9, 10 and 12 are wrong (3) Some references must revised. We are providing new
version of paper. We are concern about, this version make confusion for
readers
| null | null | null |
cs.NI cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One important application of the Wireless Sensor Network(WSN) is target
tracking, the aim of this application is converging to an event or object in an
area. In this paper, we propose an energy-efficient distributed sensor
activation protocol based on predicted location technique, called Intelligent
Distributed Sensor Activation Algorithm (IDSA). The proposed algorithm predicts
the location of target in the next time interval, by analyzing current location
and movement history of the target, this prediction is done by computational
intelligence. The fewest essential number of sensor nodes within the predicted
location will be activated to cover the target. The results show that the
proposed method outperforms the existing methods such as Na\"ive and DSA in
terms of energy consumption and the number of nodes that was involved in
tracking the target.
|
[
{
"version": "v1",
"created": "Sat, 30 May 2015 14:32:19 GMT"
},
{
"version": "v2",
"created": "Tue, 29 Mar 2016 09:15:40 GMT"
},
{
"version": "v3",
"created": "Mon, 25 Apr 2016 12:00:13 GMT"
},
{
"version": "v4",
"created": "Wed, 15 Feb 2017 08:28:32 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Sabokrou",
"Mohammad",
""
],
[
"Fathy",
"Mahmood",
""
],
[
"Hoseini",
"Mojtaba",
""
]
] |
new_dataset
| 0.984352 |
1606.05975
|
Marcin Wrochna
|
Archontia C. Giannopoulou, Micha{\l} Pilipczuk, Jean-Florent Raymond,
Dimitrios M. Thilikos, Marcin Wrochna
|
Cutwidth: obstructions and algorithmic aspects
| null | null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cutwidth is one of the classic layout parameters for graphs. It measures how
well one can order the vertices of a graph in a linear manner, so that the
maximum number of edges between any prefix and its complement suffix is
minimized. As graphs of cutwidth at most $k$ are closed under taking
immersions, the results of Robertson and Seymour imply that there is a finite
list of minimal immersion obstructions for admitting a cut layout of width at
most $k$. We prove that every minimal immersion obstruction for cutwidth at
most $k$ has size at most $2^{O(k^3\log k)}$.
As an interesting algorithmic byproduct, we design a new fixed-parameter
algorithm for computing the cutwidth of a graph that runs in time $2^{O(k^2\log
k)}\cdot n$, where $k$ is the optimum width and $n$ is the number of vertices.
While being slower by a $\log k$-factor in the exponent than the fastest known
algorithm, given by Thilikos, Bodlaender, and Serna in [Cutwidth I: A linear
time fixed parameter algorithm, J. Algorithms, 56(1):1--24, 2005] and [Cutwidth
II: Algorithms for partial $w$-trees of bounded degree, J. Algorithms,
56(1):25--49, 2005], our algorithm has the advantage of being simpler and
self-contained; arguably, it explains better the combinatorics of optimum-width
layouts.
|
[
{
"version": "v1",
"created": "Mon, 20 Jun 2016 05:31:39 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Feb 2017 13:07:23 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Giannopoulou",
"Archontia C.",
""
],
[
"Pilipczuk",
"Michał",
""
],
[
"Raymond",
"Jean-Florent",
""
],
[
"Thilikos",
"Dimitrios M.",
""
],
[
"Wrochna",
"Marcin",
""
]
] |
new_dataset
| 0.99973 |
1609.05264
|
Jeffrey Peters
|
Jeffrey R. Peters, Sean J. Wang, Amit Surana, Francesco Bullo
|
Asynchronous and Dynamic Coverage Control Scheme for Persistent
Surveillance Missions
| null | null | null | null |
cs.MA cs.RO cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A decomposition-based coverage control scheme is proposed for multi-agent,
persistent surveillance missions operating in a communication-constrained,
dynamic environment. The proposed approach decouples high-level task assignment
from low-level motion planning in a modular framework. Coverage assignments and
surveillance parameters are managed by a central base station, and transmitted
to mobile agents via unplanned and asynchronous exchanges. Coverage updates
promote load balancing, while maintaining geometric and temporal
characteristics that allow effective pairing with generic path planners.
Namely, the proposed scheme guarantees that (i) coverage regions are connected
and collectively cover the environment, (ii) subregions may only go uncovered
for bounded periods of time, (iii) collisions (or sensing overlaps) are
inherently avoided, and (iv) under static event likelihoods, the collective
coverage regions converge to a Pareto-optimal configuration. This management
scheme is then paired with a generic path planner satisfying loose assumptions.
The scheme is illustrated through simulated surveillance missions.
|
[
{
"version": "v1",
"created": "Sat, 17 Sep 2016 01:15:22 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Feb 2017 00:46:48 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Peters",
"Jeffrey R.",
""
],
[
"Wang",
"Sean J.",
""
],
[
"Surana",
"Amit",
""
],
[
"Bullo",
"Francesco",
""
]
] |
new_dataset
| 0.998648 |
1612.05416
|
Andrea Zanella
|
Federico Chiariotti, Massimo Condoluci, Toktam Mahmoodi, Andrea
Zanella
|
SymbioCity: Smart Cities for Smarter Networks
|
14 pages, submitted for publication to ETT Transactions on Emerging
Telecommunications Technologies
| null | null | null |
cs.NI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The "Smart City" (SC) concept revolves around the idea of embodying
cutting-edge ICT solutions in the very fabric of future cities, in order to
offer new and better services to citizens while lowering the city management
costs, both in monetary, social, and environmental terms. In this framework,
communication technologies are perceived as subservient to the SC services,
providing the means to collect and process the data needed to make the services
function. In this paper, we propose a new vision in which technology and SC
services are designed to take advantage of each other in a symbiotic manner.
According to this new paradigm, which we call "SymbioCity", SC services can
indeed be exploited to improve the performance of the same communication
systems that provide them with data. Suggestive examples of this symbiotic
ecosystem are discussed in the paper. The dissertation is then substantiated in
a proof-of-concept case study, where we show how the traffic monitoring service
provided by the London Smart City initiative can be used to predict the density
of users in a certain zone and optimize the cellular service in that area.
|
[
{
"version": "v1",
"created": "Fri, 16 Dec 2016 10:18:32 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Feb 2017 13:12:53 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Chiariotti",
"Federico",
""
],
[
"Condoluci",
"Massimo",
""
],
[
"Mahmoodi",
"Toktam",
""
],
[
"Zanella",
"Andrea",
""
]
] |
new_dataset
| 0.999525 |
1701.06204
|
Kedar Kulkarni
|
Kedar Kulkarni and Adrish Banerjee
|
On Optimal Spectrum Access of Cognitive Relay With Finite Packet Buffer
|
Accepted for publication in IEEE Transactions on Vehicular Technology
| null |
10.1109/TVT.2017.2664502
| null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate a cognitive radio system where secondary user (SU) relays
primary user (PU) packets using two-phase relaying. SU transmits its own
packets with some access probability in relaying phase using time sharing. PU
and SU have queues of finite capacity which results in packet loss when the
queues are full. Utilizing knowledge of relay queue state, SU aims to maximize
its packet throughput while keeping packet loss probability of PU below a
threshold. By exploiting structure of the problem, we formulate it as a linear
program and find optimal access policy of SU. We also propose low complexity
sub-optimal access policies, namely constant probability transmission and step
transmission. Numerical results are presented to compare performance of
proposed methods and study effect of queue sizes on packet throughput.
|
[
{
"version": "v1",
"created": "Sun, 22 Jan 2017 18:34:33 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Kulkarni",
"Kedar",
""
],
[
"Banerjee",
"Adrish",
""
]
] |
new_dataset
| 0.954953 |
1701.08877
|
Fei Li
|
Yilei F. Li, Li Du
|
1.5 bit-per-stage 8-bit Pipelined CMOS A/D Converter for Neuromophic
Vision Processor
| null | null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neuromorphic vision processor is an electronic implementation of vision
algorithm processor on semiconductor. To image the world, a low-power CMOS
image sensor array is required in the vision processor. The image sensor array
is typically formed through photo diodes and analog to digital converter (ADC).
To achieve low power acquisition, a low-power mid-resolution ADC is necessary.
In this paper, a 1.8V, 8-bit, 166MS/s pipelined ADC was proposed in a 0.18 um
CMOS technology. The ADC used operational amplifier sharing architecture to
reduce power consumption and achieved maximum DNL of 0.24 LSB, maximum INL of
0.35 LSB, at a power consumption of 38.9mW. When input frequency is 10.4MHz, it
achieved an SNDR 45.9dB, SFDR 50dB, and an ENOB of 7.33 bit.
|
[
{
"version": "v1",
"created": "Tue, 31 Jan 2017 00:14:32 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Feb 2017 02:56:28 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Li",
"Yilei F.",
""
],
[
"Du",
"Li",
""
]
] |
new_dataset
| 0.998804 |
1702.04434
|
Ruxandra F. Olimid
|
Stig F. Mj{\o}lsnes and Ruxandra F. Olimid
|
Easy 4G/LTE IMSI Catchers for Non-Programmers
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
IMSI Catchers are tracking devices that break the privacy of the subscribers
of mobile access networks, with disruptive effects to both the communication
services and the trust and credibility of mobile network operators. Recently,
we verified that IMSI Catcher attacks are really practical for the
state-of-the-art 4G/LTE mobile systems too. Our IMSI Catcher device acquires
subscription identities (IMSIs) within an area or location within a few seconds
of operation and then denies access of subscribers to the commercial network.
Moreover, we demonstrate that these attack devices can be easily built and
operated using readily available tools and equipment, and without any
programming. We describe our experiments and procedures that are based on
commercially available hardware and unmodified open source software.
|
[
{
"version": "v1",
"created": "Wed, 15 Feb 2017 01:13:45 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Mjølsnes",
"Stig F.",
""
],
[
"Olimid",
"Ruxandra F.",
""
]
] |
new_dataset
| 0.998366 |
1702.04467
|
Paul Gazzillo
|
Thomas Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen
|
Adding Concurrency to Smart Contracts
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern cryptocurrency systems, such as Ethereum, permit complex financial
transactions through scripts called smart contracts. These smart contracts are
executed many, many times, always without real concurrency. First, all smart
contracts are serially executed by miners before appending them to the
blockchain. Later, those contracts are serially re-executed by validators to
verify that the smart contracts were executed correctly by miners.
Serial execution limits system throughput and fails to exploit today's
concurrent multicore and cluster architectures. Nevertheless, serial execution
appears to be required: contracts share state, and contract programming
languages have a serial semantics.
This paper presents a novel way to permit miners and validators to execute
smart contracts in parallel, based on techniques adapted from software
transactional memory. Miners execute smart contracts speculatively in parallel,
allowing non-conflicting contracts to proceed concurrently, and "discovering" a
serializable concurrent schedule for a block's transactions, This schedule is
captured and encoded as a deterministic fork-join program used by validators to
re-execute the miner's parallel schedule deterministically but concurrently.
Smart contract benchmarks run on a JVM with ScalaSTM show that a speedup of
of 1.33x can be obtained for miners and 1.69x for validators with just three
concurrent threads.
|
[
{
"version": "v1",
"created": "Wed, 15 Feb 2017 05:38:37 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Dickerson",
"Thomas",
""
],
[
"Gazzillo",
"Paul",
""
],
[
"Herlihy",
"Maurice",
""
],
[
"Koskinen",
"Eric",
""
]
] |
new_dataset
| 0.992709 |
1702.04663
|
Abdul Kawsar Tushar
|
Akm Ashiquzzaman and Abdul Kawsar Tushar
|
Handwritten Arabic Numeral Recognition using Deep Learning Neural
Networks
|
Conference Name - 2017 IEEE International Conference on Imaging,
Vision & Pattern Recognition (icIVPR17) 4 pages, 5 figures, 1 table
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Handwritten character recognition is an active area of research with
applications in numerous fields. Past and recent works in this field have
concentrated on various languages. Arabic is one language where the scope of
research is still widespread, with it being one of the most popular languages
in the world and being syntactically different from other major languages. Das
et al. \cite{DBLP:journals/corr/abs-1003-1891} has pioneered the research for
handwritten digit recognition in Arabic. In this paper, we propose a novel
algorithm based on deep learning neural networks using appropriate activation
function and regularization layer, which shows significantly improved accuracy
compared to the existing Arabic numeral recognition methods. The proposed model
gives 97.4 percent accuracy, which is the recorded highest accuracy of the
dataset used in the experiment. We also propose a modification of the method
described in \cite{DBLP:journals/corr/abs-1003-1891}, where our method scores
identical accuracy as that of \cite{DBLP:journals/corr/abs-1003-1891}, with the
value of 93.8 percent.
|
[
{
"version": "v1",
"created": "Wed, 15 Feb 2017 16:06:15 GMT"
}
] | 2017-02-16T00:00:00 |
[
[
"Ashiquzzaman",
"Akm",
""
],
[
"Tushar",
"Abdul Kawsar",
""
]
] |
new_dataset
| 0.956021 |
1603.04660
|
Binqiang Chen
|
Binqiang Chen and Chenyang Yang
|
Energy Costs for Traffic Offloading by Cache-enabled D2D Communications
|
Accepted by IEEE WCNC 2016
| null |
10.1109/WCNC.2016.7564731
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Device-to-Device (D2D) communications can offload the traffic and boost the
throughput of cellular networks. By caching files at users, content delivery
traffic can be offloaded via D2D links, if a helper user are willing to send
the cached file to the user who requests the file. Yet it is unclear how much
energy needs to be consumed at a helper user to support the traffic offloading.
In this paper, we strive to find the minimal energy consumption required at a
helper user to maximize the amount of offloaded traffic. To this end, we
introduce a user-centric proactive caching policy that can control the energy
cost for a helper user to convey a file, and then optimize the caching policy
to maximize the offloaded traffic. To reduce the energy during transmission, we
optimize the transmit power to minimize the energy consumed by a helper to send
a file. We analyze the relationship between traffic offloading and energy cost
with the optimized caching policy and transmit power by numerical and
simulation results, which demonstrate that a significant amount of traffic can
be offloaded with affordable energy costs.
|
[
{
"version": "v1",
"created": "Tue, 15 Mar 2016 12:31:53 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Chen",
"Binqiang",
""
],
[
"Yang",
"Chenyang",
""
]
] |
new_dataset
| 0.97321 |
1610.06495
|
Delaram Kahrobaei
|
Ram\'on Flores and Delaram Kahrobaei
|
Cryptography with right-angled Artin groups
| null | null | null | null |
cs.CR math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose right-angled Artin groups as a platform for secret
sharing schemes based on the efficiency (linear time) of the word problem.
Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we
define two new problems: Subgroup Isomorphism Problem and Group Homomorphism
Problem. Based on them, we also propose two new authentication schemes. For
right-angled Artin groups, the Group Homomorphism and Graph Homomorphism
problems are equivalent, and the later is known to be NP-complete. In the case
of the Subgroup Isomorphism problem, we bring some results due to Bridson who
shows there are right-angled Artin groups in which this problem is unsolvable.
|
[
{
"version": "v1",
"created": "Thu, 20 Oct 2016 16:41:57 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Nov 2016 16:57:38 GMT"
},
{
"version": "v3",
"created": "Mon, 13 Feb 2017 20:21:21 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Flores",
"Ramón",
""
],
[
"Kahrobaei",
"Delaram",
""
]
] |
new_dataset
| 0.959793 |
1702.03970
|
Ray Smith
|
Raymond Smith, Chunhui Gu, Dar-Shyang Lee, Huiyi Hu, Ranjith
Unnikrishnan, Julian Ibarz, Sacha Arnoud, Sophia Lin
|
End-to-End Interpretation of the French Street Name Signs Dataset
|
Presented at the IWRR workshop at ECCV 2016
|
Computer Vision - ECCV 2016 Workshops Volume 9913 of the series
Lecture Notes in Computer Science pp 411-426
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the French Street Name Signs (FSNS) Dataset consisting of more
than a million images of street name signs cropped from Google Street View
images of France. Each image contains several views of the same street name
sign. Every image has normalized, title case folded ground-truth text as it
would appear on a map. We believe that the FSNS dataset is large and complex
enough to train a deep network of significant complexity to solve the street
name extraction problem "end-to-end" or to explore the design trade-offs
between a single complex engineered network and multiple sub-networks designed
and trained to solve sub-problems. We present such an "end-to-end"
network/graph for Tensor Flow and its results on the FSNS dataset.
|
[
{
"version": "v1",
"created": "Mon, 13 Feb 2017 20:18:18 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Smith",
"Raymond",
""
],
[
"Gu",
"Chunhui",
""
],
[
"Lee",
"Dar-Shyang",
""
],
[
"Hu",
"Huiyi",
""
],
[
"Unnikrishnan",
"Ranjith",
""
],
[
"Ibarz",
"Julian",
""
],
[
"Arnoud",
"Sacha",
""
],
[
"Lin",
"Sophia",
""
]
] |
new_dataset
| 0.999876 |
1702.04066
|
Courtney Napoles
|
Courtney Napoles, Keisuke Sakaguchi, and Joel Tetreault
|
JFLEG: A Fluency Corpus and Benchmark for Grammatical Error Correction
|
To appear in EACL 2017 (short papers)
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new parallel corpus, JHU FLuency-Extended GUG corpus (JFLEG) for
developing and evaluating grammatical error correction (GEC). Unlike other
corpora, it represents a broad range of language proficiency levels and uses
holistic fluency edits to not only correct grammatical errors but also make the
original text more native sounding. We describe the types of corrections made
and benchmark four leading GEC systems on this corpus, identifying specific
areas in which they do well and how they can improve. JFLEG fulfills the need
for a new gold standard to properly assess the current state of GEC.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2017 03:47:34 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Napoles",
"Courtney",
""
],
[
"Sakaguchi",
"Keisuke",
""
],
[
"Tetreault",
"Joel",
""
]
] |
new_dataset
| 0.999617 |
1702.04143
|
Nicolae Paladi
|
Nicolae Paladi and Christian Gehrmann
|
TruSDN: Bootstrapping Trust in Cloud Network Infrastructure
|
SecureComm 2016 12th EAI International Conference on Security and
Privacy in Communication Networks October 10-12, 2016 Guangzhou, People's
Republic of China
| null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software-Defined Networking (SDN) is a novel architectural model for cloud
network infrastructure, improving resource utilization, scalability and
administration. SDN deployments increasingly rely on virtual switches executing
on commodity operating systems with large code bases, which are prime targets
for adversaries attacking the net- work infrastructure. We describe and
implement TruSDN, a framework for bootstrapping trust in SDN infrastructure
using Intel Software Guard Extensions (SGX), allowing to securely deploy SDN
components and protect communication between network endpoints. We introduce
ephemeral flow-specific pre-shared keys and propose a novel defense against
cuckoo attacks on SGX enclaves. TruSDN is secure under a powerful adversary
model, with a minor performance overhead.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2017 10:30:49 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Paladi",
"Nicolae",
""
],
[
"Gehrmann",
"Christian",
""
]
] |
new_dataset
| 0.992538 |
1702.04174
|
Enrique S\'anchez Lozano
|
Michel F. Valstar, Enrique S\'anchez-Lozano, Jeffrey F. Cohn,
L\'aszl\'o A. Jeni, Jeffrey M. Girard, Zheng Zhang, Lijun Yin, and Maja
Pantic
|
FERA 2017 - Addressing Head Pose in the Third Facial Expression
Recognition and Analysis Challenge
|
FERA 2017 Baseline Paper
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The field of Automatic Facial Expression Analysis has grown rapidly in recent
years. However, despite progress in new approaches as well as benchmarking
efforts, most evaluations still focus on either posed expressions, near-frontal
recordings, or both. This makes it hard to tell how existing expression
recognition approaches perform under conditions where faces appear in a wide
range of poses (or camera views), displaying ecologically valid expressions.
The main obstacle for assessing this is the availability of suitable data, and
the challenge proposed here addresses this limitation. The FG 2017 Facial
Expression Recognition and Analysis challenge (FERA 2017) extends FERA 2015 to
the estimation of Action Units occurrence and intensity under different camera
views. In this paper we present the third challenge in automatic recognition of
facial expressions, to be held in conjunction with the 12th IEEE conference on
Face and Gesture Recognition, May 2017, in Washington, United States. Two
sub-challenges are defined: the detection of AU occurrence, and the estimation
of AU intensity. In this work we outline the evaluation protocol, the data
used, and the results of a baseline method for both sub-challenges.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2017 12:22:30 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Valstar",
"Michel F.",
""
],
[
"Sánchez-Lozano",
"Enrique",
""
],
[
"Cohn",
"Jeffrey F.",
""
],
[
"Jeni",
"László A.",
""
],
[
"Girard",
"Jeffrey M.",
""
],
[
"Zhang",
"Zheng",
""
],
[
"Yin",
"Lijun",
""
],
[
"Pantic",
"Maja",
""
]
] |
new_dataset
| 0.986701 |
1702.04218
|
John Prpic
|
J. Prpic and P. Shukla
|
Crowd Capital in Governance Contexts
|
Oxford Internet Institute, University of Oxford - IPP 2014 -
Crowdsourcing for Politics and Policy
| null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To begin to understand the implications of the implementation of IT-mediated
Crowds for Politics and Policy purposes, this research builds the first-known
dataset of IT-mediated Crowd applications currently in use in the governance
context. Using Crowd Capital theory and governance theory as frameworks to
organize our data collection, we undertake an exploratory data analysis of some
fundamental factors defining this emerging field. Specific factors outlined and
discussed include the type of actors implementing IT-mediated Crowds in the
governance context, the global geographic distribution of the applications, and
the nature of the Crowd-derived resources being generated for governance
purposes. The findings from our dataset of 209 on-going endeavours indicates
that a wide-diversity of actors are engaging IT-mediated Crowds in the
governance context, both jointly and severally, that these endeavours can be
found to exist on all continents, and that said actors are generating
Crowd-derived resources in at least ten distinct governance sectors. We discuss
the ramifications of these and our other findings in comparison to the research
literature on the private-sector use of IT-mediated Crowds, while highlighting
some unique future research opportunities stemming from our work.
|
[
{
"version": "v1",
"created": "Fri, 10 Feb 2017 09:45:57 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Prpic",
"J.",
""
],
[
"Shukla",
"P.",
""
]
] |
new_dataset
| 0.994347 |
1702.04256
|
Gianluca Stringhini
|
Enrico Mariconti, Jeremiah Onaolapo, Syed Sharique Ahmad, Nicolas
Nikiforou, Manuel Egele, Nick Nikiforakis, and Gianluca Stringhini
|
What's in a Name? Understanding Profile Name Reuse on Twitter
|
International World Wide Web Conference 2017
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Users on Twitter are commonly identified by their profile names. These names
are used when directly addressing users on Twitter, are part of their profile
page URLs, and can become a trademark for popular accounts, with people
referring to celebrities by their real name and their profile name,
interchangeably. Twitter, however, has chosen to not permanently link profile
names to their corresponding user accounts. In fact, Twitter allows users to
change their profile name, and afterwards makes the old profile names available
for other users to take. In this paper, we provide a large-scale study of the
phenomenon of profile name reuse on Twitter. We show that this phenomenon is
not uncommon, investigate the dynamics of profile name reuse, and characterize
the accounts that are involved in it. We find that many of these accounts adopt
abandoned profile names for questionable purposes, such as spreading malicious
content, and using the profile name's popularity for search engine
optimization. Finally, we show that this problem is not unique to Twitter (as
other popular online social networks also release profile names) and argue that
the risks involved with profile-name reuse outnumber the advantages provided by
this feature.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2017 15:17:38 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Mariconti",
"Enrico",
""
],
[
"Onaolapo",
"Jeremiah",
""
],
[
"Ahmad",
"Syed Sharique",
""
],
[
"Nikiforou",
"Nicolas",
""
],
[
"Egele",
"Manuel",
""
],
[
"Nikiforakis",
"Nick",
""
],
[
"Stringhini",
"Gianluca",
""
]
] |
new_dataset
| 0.999104 |
1702.04263
|
Diego Didona Dr
|
Diego Didona, Kristina Spirovska, Willy Zwaenepoel
|
Okapi: Causally Consistent Geo-Replication Made Faster, Cheaper and More
Available
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Okapi is a new causally consistent geo-replicated key- value store. Okapi
leverages two key design choices to achieve high performance. First, it relies
on hybrid logical/physical clocks to achieve low latency even in the presence
of clock skew. Second, Okapi achieves higher resource efficiency and better
availability, at the expense of a slight increase in update visibility latency.
To this end, Okapi implements a new stabilization protocol that uses a
combination of vector and scalar clocks and makes a remote update visible when
its delivery has been acknowledged by every data center. We evaluate Okapi with
different workloads on Amazon AWS, using three geographically distributed
regions and 96 nodes. We compare Okapi with two recent approaches to causal
consistency, Cure and GentleRain. We show that Okapi delivers up to two orders
of magnitude better performance than GentleRain and that Okapi achieves up to
3.5x lower latency and a 60% reduction of the meta-data overhead with respect
to Cure.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2017 15:34:56 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Didona",
"Diego",
""
],
[
"Spirovska",
"Kristina",
""
],
[
"Zwaenepoel",
"Willy",
""
]
] |
new_dataset
| 0.99288 |
1702.04343
|
Manish Gupta
|
Amay Agrawal, Birva Patel, Dixita Limbachiya and Manish K. Gupta
|
3DNA Printer: A Tool for Automated DNA Origami
|
5 pages, 9 figures, 3DNAprinter software available at
http://www.guptalab.org/3dnaprinter
| null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the last two decades, DNA self-assembly has grown into a major area of
research attracting people from diverse background. It has numerous potential
applications such as targeted drug delivery, artificial photosynthesis etc. In
the last decade, another area received wide attention known as DNA origami,
where using M13 virus and carefully designed staple strands one can fold the
DNA into desired 2-D and 3-D shapes. In 2016, a group of researchers at MIT
have developed an automated DNA nanostructures strategy and an open source
software 'daedalus' based on MATLAB for developing the nanostructures. In this
work, we present a truly open source software '3dnaprinter' based on Java
(without MATLAB) that can do the same work.
|
[
{
"version": "v1",
"created": "Tue, 14 Feb 2017 18:57:33 GMT"
}
] | 2017-02-15T00:00:00 |
[
[
"Agrawal",
"Amay",
""
],
[
"Patel",
"Birva",
""
],
[
"Limbachiya",
"Dixita",
""
],
[
"Gupta",
"Manish K.",
""
]
] |
new_dataset
| 0.999573 |
1411.5240
|
Leandro Montero
|
Raquel \'Agueda, Valentin Borozan, Raquel D\'iaz, Yannis Manoussakis,
Leandro Montero
|
Proper Hamiltonian Cycles in Edge-Colored Multigraphs
|
13 pages
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A $c$-edge-colored multigraph has each edge colored with one of the $c$
available colors and no two parallel edges have the same color. A proper
Hamiltonian cycle is a cycle containing all the vertices of the multigraph such
that no two adjacent edges have the same color. In this work we establish
sufficient conditions for a multigraph to have a proper Hamiltonian cycle,
depending on several parameters such as the number of edges and the rainbow
degree.
|
[
{
"version": "v1",
"created": "Wed, 19 Nov 2014 14:38:05 GMT"
},
{
"version": "v2",
"created": "Wed, 24 Jun 2015 14:43:19 GMT"
},
{
"version": "v3",
"created": "Mon, 31 Aug 2015 10:24:44 GMT"
},
{
"version": "v4",
"created": "Fri, 30 Oct 2015 14:23:58 GMT"
},
{
"version": "v5",
"created": "Wed, 27 Jul 2016 16:52:06 GMT"
},
{
"version": "v6",
"created": "Mon, 13 Feb 2017 13:17:39 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Águeda",
"Raquel",
""
],
[
"Borozan",
"Valentin",
""
],
[
"Díaz",
"Raquel",
""
],
[
"Manoussakis",
"Yannis",
""
],
[
"Montero",
"Leandro",
""
]
] |
new_dataset
| 0.99981 |
1506.04130
|
Harsh Agrawal
|
Harsh Agrawal, Clint Solomon Mathialagan, Yash Goyal, Neelima Chavali,
Prakriti Banik, Akrit Mohapatra, Ahmed Osman, Dhruv Batra
|
CloudCV: Large Scale Distributed Computer Vision as a Cloud Service
| null | null | null | null |
cs.CV cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We are witnessing a proliferation of massive visual data. Unfortunately
scaling existing computer vision algorithms to large datasets leaves
researchers repeatedly solving the same algorithmic, logistical, and
infrastructural problems. Our goal is to democratize computer vision; one
should not have to be a computer vision, big data and distributed computing
expert to have access to state-of-the-art distributed computer vision
algorithms. We present CloudCV, a comprehensive system to provide access to
state-of-the-art distributed computer vision algorithms as a cloud service
through a Web Interface and APIs.
|
[
{
"version": "v1",
"created": "Fri, 12 Jun 2015 19:50:07 GMT"
},
{
"version": "v2",
"created": "Wed, 15 Jun 2016 22:01:51 GMT"
},
{
"version": "v3",
"created": "Mon, 13 Feb 2017 07:30:56 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Agrawal",
"Harsh",
""
],
[
"Mathialagan",
"Clint Solomon",
""
],
[
"Goyal",
"Yash",
""
],
[
"Chavali",
"Neelima",
""
],
[
"Banik",
"Prakriti",
""
],
[
"Mohapatra",
"Akrit",
""
],
[
"Osman",
"Ahmed",
""
],
[
"Batra",
"Dhruv",
""
]
] |
new_dataset
| 0.997792 |
1507.03166
|
Jo\~ao Sousa Pinto
|
Jo\"el Ouaknine, Jo\~ao Sousa-Pinto, James Worrell
|
On the Polytope Escape Problem for Continuous Linear Dynamical Systems
|
Accepted to HSCC 2017
| null |
10.1145/3049797.3049798
| null |
cs.CC
|
http://creativecommons.org/licenses/by/4.0/
|
The Polyhedral Escape Problem for continuous linear dynamical systems
consists of deciding, given an affine function $f: \mathbb{R}^{d} \rightarrow
\mathbb{R}^{d}$ and a convex polyhedron $\mathcal{P} \subseteq \mathbb{R}^{d}$,
whether, for some initial point $\boldsymbol{x}_{0}$ in $\mathcal{P}$, the
trajectory of the unique solution to the differential equation
$\dot{\boldsymbol{x}}(t)=f(\boldsymbol{x}(t))$,
$\boldsymbol{x}(0)=\boldsymbol{x}_{0}$, is entirely contained in $\mathcal{P}$.
We show that this problem is decidable, by reducing it in polynomial time to
the decision version of linear programming with real algebraic coefficients,
thus placing it in $\exists \mathbb{R}$, which lies between NP and PSPACE. Our
algorithm makes use of spectral techniques and relies among others on tools
from Diophantine approximation.
|
[
{
"version": "v1",
"created": "Sat, 11 Jul 2015 22:56:01 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Feb 2017 19:11:42 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Ouaknine",
"Joël",
""
],
[
"Sousa-Pinto",
"João",
""
],
[
"Worrell",
"James",
""
]
] |
new_dataset
| 0.97466 |
1602.01600
|
David Doty
|
David Doty and Andrew Winslow
|
Design of Geometric Molecular Bonds
|
Accepted to appear in IEEE Transactions on Molecular, Biological, and
Multi-Scale Communications
| null | null | null |
cs.IT cs.CG cs.ET math.IT q-bio.MN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An example of a nonspecific molecular bond is the affinity of any positive
charge for any negative charge (like-unlike), or of nonpolar material for
itself when in aqueous solution (like-like). This contrasts specific bonds such
as the affinity of the DNA base A for T, but not for C, G, or another A. Recent
experimental breakthroughs in DNA nanotechnology demonstrate that a particular
nonspecific like-like bond ("blunt-end DNA stacking" that occurs between the
ends of any pair of DNA double-helices) can be used to create specific
"macrobonds" by careful geometric arrangement of many nonspecific blunt ends,
motivating the need for sets of macrobonds that are orthogonal: two macrobonds
not intended to bind should have relatively low binding strength, even when
misaligned.
To address this need, we introduce geometric orthogonal codes that abstractly
model the engineered DNA macrobonds as two-dimensional binary codewords. While
motivated by completely different applications, geometric orthogonal codes
share similar features to the optical orthogonal codes studied by Chung,
Salehi, and Wei. The main technical difference is the importance of 2D geometry
in defining codeword orthogonality.
|
[
{
"version": "v1",
"created": "Thu, 4 Feb 2016 09:07:20 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Apr 2016 19:55:33 GMT"
},
{
"version": "v3",
"created": "Mon, 1 Aug 2016 16:40:47 GMT"
},
{
"version": "v4",
"created": "Sun, 12 Feb 2017 18:23:31 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Doty",
"David",
""
],
[
"Winslow",
"Andrew",
""
]
] |
new_dataset
| 0.962727 |
1612.05390
|
Iddo Bentov
|
Andrew Miller and Iddo Bentov
|
Zero-Collateral Lotteries in Bitcoin and Ethereum
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present cryptocurrency-based lottery protocols that do not require any
collateral from the players. Previous protocols for this task required a
security deposit that is $O(N^2)$ times larger than the bet amount, where $N$
is the number of players. Our protocols are based on a tournament bracket
construction, and require only $O(\log N)$ rounds. Our lottery protocols thus
represent a significant improvement, both because they allow players with
little money to participate, and because of the time value of money. The
Ethereum-based implementation of our lottery is highly efficient. The Bitcoin
implementation requires an $O(2^N)$ off-chain setup phase, which demonstrates
that the expressive power of the scripting language can have important
implications. We also describe a minimal modification to the Bitcoin protocol
that would eliminate the exponential blowup.
|
[
{
"version": "v1",
"created": "Fri, 16 Dec 2016 08:11:32 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Dec 2016 05:07:33 GMT"
},
{
"version": "v3",
"created": "Mon, 13 Feb 2017 16:52:17 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Miller",
"Andrew",
""
],
[
"Bentov",
"Iddo",
""
]
] |
new_dataset
| 0.968403 |
1701.06726
|
Iddo Bentov
|
Iddo Bentov, Ranjit Kumaresan, Andrew Miller
|
Instantaneous Decentralized Poker
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present efficient protocols for amortized secure multiparty computation
with penalties and secure cash distribution, of which poker is a prime example.
Our protocols have an initial phase where the parties interact with a
cryptocurrency network, that then enables them to interact only among
themselves over the course of playing many poker games in which money changes
hands.
The high efficiency of our protocols is achieved by harnessing the power of
stateful contracts. Compared to the limited expressive power of Bitcoin
scripts, stateful contracts enable richer forms of interaction between standard
secure computation and a cryptocurrency.
We formalize the stateful contract model and the security notions that our
protocols accomplish, and provide proofs using the simulation paradigm.
Moreover, we provide a reference implementation in Ethereum/Solidity for the
stateful contracts that our protocols are based on.
We also adopt our off-chain cash distribution protocols to the special case
of stateful duplex micropayment channels, which are of independent interest. In
comparison to Bitcoin based payment channels, our duplex channel implementation
is more efficient and has additional features.
|
[
{
"version": "v1",
"created": "Tue, 24 Jan 2017 04:24:40 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Jan 2017 07:00:10 GMT"
},
{
"version": "v3",
"created": "Sat, 11 Feb 2017 05:26:58 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Bentov",
"Iddo",
""
],
[
"Kumaresan",
"Ranjit",
""
],
[
"Miller",
"Andrew",
""
]
] |
new_dataset
| 0.99626 |
1702.03467
|
Lei Yang
|
Lei Yang, Qingji Zheng, Xinxin Fan
|
RSPP: A Reliable, Searchable and Privacy-Preserving e-Healthcare System
for Cloud-Assisted Body Area Networks
|
to be published in IEEE INFOCOM 2017
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The integration of cloud computing and Internet of Things (IoT) is quickly
becoming the key enabler for the digital transformation of the healthcare
industry by offering comprehensive improvements in patient engagements,
productivity and risk mitigation. This paradigm shift, while bringing numerous
benefits and new opportunities to healthcare organizations, has raised a lot of
security and privacy concerns. In this paper, we present a reliable, searchable
and privacy-preserving e-healthcare system, which takes advantage of emerging
cloud storage and IoT infrastructure and enables healthcare service providers
(HSPs) to realize remote patient monitoring in a secure and regulatory
compliant manner. Our system is built upon a novel dynamic searchable symmetric
encryption scheme with forward privacy and delegated verifiability for
periodically generated healthcare data. While the forward privacy is achieved
by maintaining an increasing counter for each keyword at an IoT gateway, the
data owner delegated verifiability comes from the combination of the Bloom
filter and aggregate message authentication code. Moreover, our system is able
to support multiple HSPs through either data owner assistance or delegation.
The detailed security analysis as well as the extensive simulations on a large
data set with millions of records demonstrate the practical efficiency of the
proposed system for real world healthcare applications.
|
[
{
"version": "v1",
"created": "Sat, 11 Feb 2017 23:18:30 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Yang",
"Lei",
""
],
[
"Zheng",
"Qingji",
""
],
[
"Fan",
"Xinxin",
""
]
] |
new_dataset
| 0.999621 |
1702.03555
|
Iuliia Kotseruba
|
Amir Rasouli, Iuliia Kotseruba, John K. Tsotsos
|
Agreeing to Cross: How Drivers and Pedestrians Communicate
|
6 pages, 6 figures
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The contribution of this paper is twofold. The first is a novel dataset for
studying behaviors of traffic participants while crossing. Our dataset contains
more than 650 samples of pedestrian behaviors in various street configurations
and weather conditions. These examples were selected from approx. 240 hours of
driving in the city, suburban and urban roads. The second contribution is an
analysis of our data from the point of view of joint attention. We identify
what types of non-verbal communication cues road users use at the point of
crossing, their responses, and under what circumstances the crossing event
takes place. It was found that in more than 90% of the cases pedestrians gaze
at the approaching cars prior to crossing in non-signalized crosswalks. The
crossing action, however, depends on additional factors such as time to
collision (TTC), explicit driver's reaction or structure of the crosswalk.
|
[
{
"version": "v1",
"created": "Sun, 12 Feb 2017 18:41:06 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Rasouli",
"Amir",
""
],
[
"Kotseruba",
"Iuliia",
""
],
[
"Tsotsos",
"John K.",
""
]
] |
new_dataset
| 0.998966 |
1702.03587
|
Pedro Hecht
|
Pedro Hecht
|
Post-Quantum Cryptography(PQC): Generalized ElGamal Cipher over
GF(251^8)
|
6 pages, 6 Tables, 14 Figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols
resistant to attacks by means of for instance Shor's polynomial time algorithm
for numerical field problems like integer factorization (IFP) or the discrete
logarithm (DLP). Other aspects are the backdoors discovered in deterministic
random generators or recent advances in solving some instances of DLP. The use
of alternative algebraic structures like non-commutative or non-associative
partial groupoids, magmas, monoids, semigroups, quasigroups or groups, are
valid choices for these new kinds of protocols. In this paper, we focus in an
asymmetric cipher based on a generalized ElGamal non-arbitrated protocol using
a non-commutative general linear group. The developed protocol forces a hard
subgroup membership search problem into a non-commutative structure. The
protocol involves at first a generalized Diffie-Hellman key interchange and
further on the private and public parameters are recursively updated each time
a new cipher session is launched. Security is based on a hard variation of the
Generalized Symmetric Decomposition Problem (GSDP). Working with GF(251^8) a
64-bits security is achieved, and if GF(251^16) is chosen, the security rises
to 127-bits. An appealing feature is that there is no need for big number
libraries as all arithmetic if performed in Z_251 and therefore the new
protocol is particularly useful for computational platforms with very limited
capabilities like smartphones or smartcards.
|
[
{
"version": "v1",
"created": "Sun, 12 Feb 2017 22:50:28 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Hecht",
"Pedro",
""
]
] |
new_dataset
| 0.996942 |
1702.03790
|
Ralph Ewerth
|
Markus M\"uhling, Manja Meister, Nikolaus Korfhage, J\"org Wehling,
Angelika H\"orth, Ralph Ewerth, Bernd Freisleben
|
Content-Based Video Retrieval in Historical Collections of the German
Broadcasting Archive
|
TPDL 2016, Hannover, Germany. Final version is available at Springer
via DOI
| null |
10.1007/978-3-319-43997-6_6
| null |
cs.DL cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The German Broadcasting Archive (DRA) maintains the cultural heritage of
radio and television broadcasts of the former German Democratic Republic (GDR).
The uniqueness and importance of the video material stimulates a large
scientific interest in the video content. In this paper, we present an
automatic video analysis and retrieval system for searching in historical
collections of GDR television recordings. It consists of video analysis
algorithms for shot boundary detection, concept classification, person
recognition, text recognition and similarity search. The performance of the
system is evaluated from a technical and an archival perspective on 2,500 hours
of GDR television recordings.
|
[
{
"version": "v1",
"created": "Mon, 13 Feb 2017 14:42:31 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Mühling",
"Markus",
""
],
[
"Meister",
"Manja",
""
],
[
"Korfhage",
"Nikolaus",
""
],
[
"Wehling",
"Jörg",
""
],
[
"Hörth",
"Angelika",
""
],
[
"Ewerth",
"Ralph",
""
],
[
"Freisleben",
"Bernd",
""
]
] |
new_dataset
| 0.965359 |
1702.03799
|
Mansi Peer Ms
|
Ankush Jolly, Mansi Peer, Vivek Ashok Bohara
|
Powering Future Mobile Phones Through RF Energy Harvesting
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present the preliminary measurement results of harvesting
radio frequency(RF) energy from the mobile phones. The aim is to revolutionize
the way mobile phones are being charged and paving a way of charging the future
mobile phones through RF energy harvesting. In order to measure the amount of
energy that can be harvested, mobile phones from two different manufactures
namely Asus and Samsung have been used. It was shown that depending on the
manufacturer it is possible to harvest 1.53 joules amount of energy per day.
|
[
{
"version": "v1",
"created": "Tue, 7 Feb 2017 16:29:35 GMT"
}
] | 2017-02-14T00:00:00 |
[
[
"Jolly",
"Ankush",
""
],
[
"Peer",
"Mansi",
""
],
[
"Bohara",
"Vivek Ashok",
""
]
] |
new_dataset
| 0.979303 |
1610.08717
|
Kashyap Thimmaraju
|
Kashyap Thimmaraju, Bhargava Shastry, Tobias Fiebig, Felicitas
Hetzelt, Jean-Pierre Seifert, Anja Feldmann, Stefan Schmid
|
Reins to the Cloud: Compromising Cloud Systems via the Data Plane
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Virtual switches have become popular among cloud operating systems to
interconnect virtual machines in a more flexible manner. However, this paper
demonstrates that virtual switches introduce new attack surfaces in cloud
setups, whose effects can be disastrous. Our analysis shows that these
vulnerabilities are caused by: (1) inappropriate security assumptions
(privileged virtual switch execution in kernel and user space), (2) the logical
centralization of such networks (e.g., OpenStack or SDN), (3) the presence of
bi-directional communication channels between data plane systems and the
centralized controller, and (4) non-standard protocol parsers.
Our work highlights the need to accommodate the data plane(s) in our threat
models. In particular, it forces us to revisit today's assumption that the data
plane can only be compromised by a sophisticated attacker: we show that
compromising the data plane of modern computer networks can actually be
performed by a very simple attacker with limited resources only and at low cost
(i.e., at the cost of renting a virtual machine in the Cloud). As a case study,
we fuzzed only 2\% of the code-base of a production quality virtual switch's
packet processor (namely OvS), identifying serious vulnerabilities leading to
unauthenticated remote code execution. In particular, we present the "rein
worm" which allows us to fully compromise test-setups in less than 100 seconds.
We also evaluate the performance overhead of existing mitigations such as ASLR,
PIEs, and unconditional stack canaries on OvS. We find that while applying
these countermeasures in kernel-space incurs a significant overhead, in
user-space the performance overhead is negligible.
|
[
{
"version": "v1",
"created": "Thu, 27 Oct 2016 11:39:47 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Feb 2017 16:24:25 GMT"
}
] | 2017-02-13T00:00:00 |
[
[
"Thimmaraju",
"Kashyap",
""
],
[
"Shastry",
"Bhargava",
""
],
[
"Fiebig",
"Tobias",
""
],
[
"Hetzelt",
"Felicitas",
""
],
[
"Seifert",
"Jean-Pierre",
""
],
[
"Feldmann",
"Anja",
""
],
[
"Schmid",
"Stefan",
""
]
] |
new_dataset
| 0.969882 |
1702.02907
|
Ahmed Fawaz
|
Ahmed M. Fawaz, Mohammad Noureddine, William H. Sanders
|
PowerAlert: An Integrity Checker using Power Measurement
| null | null | null | null |
cs.CR cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose PowerAlert, an efficient external integrity checker for untrusted
hosts. Current attestation systems suffer from shortcomings in requiring
complete checksum of the code segment, being static, use of timing information
sourced from the untrusted machine, or use of timing information with high
error (network round trip time). We address those shortcomings by (1) using
power measurements from the host to ensure that the checking code is executed
and (2) checking a subset of the kernel space over a long period of time. We
compare the power measurement against a learned power model of the execution of
the machine and validate that the execution was not tampered. Finally, power
diversifies the integrity checking program to prevent the attacker from
adapting. We implement a prototype of PowerAlert using Raspberry pi and
evaluate the performance of the integrity checking program generation. We model
the interaction between PowerAlert and an attacker as a game. We study the
effectiveness of the random initiation strategy in deterring the attacker. The
study shows that \power forces the attacker to trade-off stealthiness for the
risk of detection, while still maintaining an acceptable probability of
detection given the long lifespan of stealthy attacks.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 17:24:43 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Feb 2017 04:03:04 GMT"
}
] | 2017-02-13T00:00:00 |
[
[
"Fawaz",
"Ahmed M.",
""
],
[
"Noureddine",
"Mohammad",
""
],
[
"Sanders",
"William H.",
""
]
] |
new_dataset
| 0.995273 |
1702.02999
|
Jonas Weber
|
Jonas Weber
|
Idiomatic and Reproducible Software Builds using Containers for Reliable
Computing
|
77 pages, Master's Thesis
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Containers as the unit of application delivery are the 'next big thing' in
the software development world. They enable developers to create an executable
image containing an application bundled with all its dependencies which a user
can run inside a controlled environment with virtualized resources. Complex
workflows for business-critical applications and research environments require
a high degree of reproducibility which can be accomplished using uniquely
identified images as units of computation.
It will be shown in this thesis that the most widely used approaches to
create an image from pre-existing software or from source code lack the ability
to provide idiomaticity in their use of the technology as well as proper
reproducibility safe-guards. In the first part, existing approaches are
formalized and discussed and a new approach is introduced. The approaches are
then evaluated using a suite of three different examples.
This thesis provides a framework for formalizing operations involving a
layered file system, containers and images, and a novel approach to the
creation of images using utility containers and layer donning fulfilling the
idiomaticity and reproducibility criteria.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 21:59:17 GMT"
}
] | 2017-02-13T00:00:00 |
[
[
"Weber",
"Jonas",
""
]
] |
new_dataset
| 0.999272 |
1702.03128
|
Sha Hu
|
Sha Hu, Fredrik Rusek, and Ove Edfors
|
The Potential of Using Large Antenna Arrays on Intelligent Surfaces
|
6 pages, 10 figures,conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider capacities of single-antenna terminals
communicating to large antenna arrays that are deployed on surfaces. That is,
the entire surface is used as an intelligent receiving antenna array. Under the
condition that the surface area is sufficiently large, the received signal
after matched-filtering (MF) can be well approximated by an intersymbol
interference (ISI) channel where channel taps are closely related to a sinc
function. Based on such an approximation, we have derived the capacities for
both one-dimensional (terminals on a line) and high dimensional (terminals on a
plane or in a cube) terminal-deployments. In particular, we analyze the
normalized capacity $\bar{\mathcal{C}}$, measured in nats/s/Hz/m$^2$, under the
constraint that the transmit power per m$^2$, $\bar{P}$, is fixed. We show that
when the user-density increases, the limit of $\bar{\mathcal{C}}$, achieved as
the wavelength $\lambda$ approaches 0, is $\bar{P}/(2N_0)$ nats/s/Hz/m$^2$,
where $N_0$ is the spatial power spectral density (PSD) of noise. In addition,
we also show that the number of signal dimensions is $2/\lambda$ per meter
deployed surface for the one-dimensional case, and $\pi/\lambda^2$ per m$^2$
deployed surface for two and three dimensional terminal-deployments.
|
[
{
"version": "v1",
"created": "Fri, 10 Feb 2017 11:08:09 GMT"
}
] | 2017-02-13T00:00:00 |
[
[
"Hu",
"Sha",
""
],
[
"Rusek",
"Fredrik",
""
],
[
"Edfors",
"Ove",
""
]
] |
new_dataset
| 0.979418 |
1702.03257
|
Sandip Chakraborty
|
Raja Karmakar and Sandip Chakraborty and Samiran Chattopadhyay
|
Impact of IEEE 802.11n/ac PHY/MAC High Throughput Enhancements over
Transport/Application Layer Protocols - A Survey
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since the inception of Wireless Local Area Networks (WLANs) in the year 1997,
it has tremendously grown in the last few years. IEEE 802.11 is popularly known
as WLAN. To provide the last mile wireless broadband connectivity to users,
IEEE 802.11 is enriched with IEEE 802.11a, IEEE 802.11b and IEEE 802.11g. More
recently, IEEE 802.11n, IEEE 802.11ac and IEEE 802.11ad are introduced with
enhancements to the physical (PHY) layer and medium access control (MAC)
sublayer to provide much higher data rates and thus these amendments are called
High Throughput WLANs (HT-WLANs). For both standards, PHY is enhanced with
multiple-input multiple-output (MIMO) antenna technologies, channel bonding,
short guard intervals (SGI), enhanced modulation and coding schemes (MCS). At
the same time, MAC layer overhead is reduced by introducing frame aggregation
and block acknowledgement technologies. However, existing studies reveal that
although PHY and MAC enhancements promise to improve physical data rate
significantly, they yield negative impact over upper layer protocols -- mainly
for reliable end-to-end transport/application layer protocols. As a
consequence, a large number of schools have focused researches on HT-WLANs to
improve the coordination among PHY/MAC and upper layer protocols and thus,
boost up the performance benefit. In this survey, we discuss the impact of
enhancements of PHY/MAC layer in HT-WLANs over transport/application layer
protocols. list down different open challenges that can be explored for the
development of next generation HT-WLAN technologies.
|
[
{
"version": "v1",
"created": "Fri, 10 Feb 2017 17:25:48 GMT"
}
] | 2017-02-13T00:00:00 |
[
[
"Karmakar",
"Raja",
""
],
[
"Chakraborty",
"Sandip",
""
],
[
"Chattopadhyay",
"Samiran",
""
]
] |
new_dataset
| 0.996693 |
1702.03288
|
Christopher Banks
|
Christopher J. Banks and Ian Stark
|
A More Sensitive Context
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Logic of Behaviour in Context (LBC) is a spatio-temporal logic for expressing
properties of continuous-state processes, such as biochemical reaction
networks. LBC builds on the existing Metric Interval Temporal Logic (MITL) and
adds a "context modality" that explores the behaviour of a system when composed
with an external process. LBC models are terms of the Continuous {\pi}-Calculus
(c{\pi}), a process algebra with continuous state space. Our previously
published LBC model-checking technique required examining many points along the
behavioural trajectory of a process; and potentially computing further
trajectories branching off at every such point. This raised two difficulties:
mixing temporal and spatial modalities could require computing a large number
of trajectories, with costly numerical solution of differential equations; and
might still fail to check intermediate values between discrete points on those
trajectories. In this paper we make progress against both of these problems
using techniques from signal temporal logic and from sensitivity analysis.
Boolean signals aggressively compress trace information, allowing more
efficient computation; and sensitivity analysis lets us reliably check formulae
over a region by calculating a smaller number of sample trajectories.
|
[
{
"version": "v1",
"created": "Fri, 10 Feb 2017 18:59:20 GMT"
}
] | 2017-02-13T00:00:00 |
[
[
"Banks",
"Christopher J.",
""
],
[
"Stark",
"Ian",
""
]
] |
new_dataset
| 0.997286 |
1409.8196
|
Blair Dowling Sullivan
|
Matthew Farrell, Timothy Goodrich, Nathan Lemons, Felix Reidl,
Fernando S\'anchez Villaamil, Blair D. Sullivan
|
Hyperbolicity, degeneracy, and expansion of random intersection graphs
|
Updating license to CC-BY
| null | null | null |
cs.SI cs.DM
|
http://creativecommons.org/licenses/by/4.0/
|
We establish the conditions under which several algorithmically exploitable
structural features hold for random intersection graphs, a natural model for
many real-world networks where edges correspond to shared attributes.
Specifically, we fully characterize the degeneracy of random intersection
graphs, and prove that the model asymptotically almost surely produces graphs
with hyperbolicity at least $\log{n}$. Further, we prove that in the parametric
regime where random intersection graphs are degenerate an even stronger notion
of sparseness, so called bounded expansion, holds with high probability. We
supplement our theoretical findings with experimental evaluations of the
relevant statistics.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2014 17:16:32 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Sep 2014 13:42:29 GMT"
},
{
"version": "v3",
"created": "Mon, 6 Oct 2014 09:00:46 GMT"
},
{
"version": "v4",
"created": "Mon, 9 Mar 2015 15:58:38 GMT"
},
{
"version": "v5",
"created": "Wed, 30 Sep 2015 17:45:21 GMT"
},
{
"version": "v6",
"created": "Wed, 8 Feb 2017 12:35:02 GMT"
},
{
"version": "v7",
"created": "Thu, 9 Feb 2017 16:49:26 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Farrell",
"Matthew",
""
],
[
"Goodrich",
"Timothy",
""
],
[
"Lemons",
"Nathan",
""
],
[
"Reidl",
"Felix",
""
],
[
"Villaamil",
"Fernando Sánchez",
""
],
[
"Sullivan",
"Blair D.",
""
]
] |
new_dataset
| 0.966823 |
1603.08878
|
Alexander Barg
|
Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, and Robert
Calderbank
|
Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of
cyclic codes
|
12pp., submitted for publication. An extended abstract of this
submission was posted earlier as arXiv:1502.01414 and was published in
Proceedings of the 2015 IEEE International Symposium on Information Theory,
Hong Kong, China, June 14-19, 2015, pp. 1262--1266
|
International Journal of Information and Coding Theory, vol. 3,
no. 4, pp.345-364 (2016)
|
10.1504/IJICOT.2016.079496
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider linear cyclic codes with the locality property, or locally
recoverable codes (LRC codes). A family of LRC codes that generalize the
classical construction of Reed-Solomon codes was constructed in a recent paper
by I. Tamo and A. Barg (IEEE Trans. Inform. Theory, no. 8, 2014). In this paper
we focus on optimal cyclic codes that arise from this construction. We give a
characterization of these codes in terms of their zeros, and observe that there
are many equivalent ways of constructing optimal cyclic LRC codes over a given
field. We also study subfield subcodes of cyclic LRC codes (BCH-like LRC codes)
and establish several results about their locality and minimum distance. The
locality parameter of a cyclic code is related to the dual distance of this
code, and we phrase our results in terms of upper bounds on the dual distance.
|
[
{
"version": "v1",
"created": "Tue, 29 Mar 2016 18:41:24 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Tamo",
"Itzhak",
""
],
[
"Barg",
"Alexander",
""
],
[
"Goparaju",
"Sreechakra",
""
],
[
"Calderbank",
"Robert",
""
]
] |
new_dataset
| 0.998469 |
1606.06698
|
Amin Ghafouri
|
Amin Ghafouri, Waseem Abbas, Yevgeniy Vorobeychik, and Xenofon
Koutsoukos
|
Vulnerability of Fixed-Time Control of Signalized Intersections to
Cyber-Tampering
| null |
9th International Symposium on Resilient Control Systems (ISRCS),
Chicago, IL, pp. 130-135 (2016)
| null | null |
cs.SY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent experimental studies have shown that traffic management systems are
vulnerable to cyber-attacks on sensor data. This paper studies the
vulnerability of fixed-time control of signalized intersections when sensors
measuring traffic flow information are compromised and perturbed by an
adversary. The problems are formulated by considering three malicious
objectives: 1) worst-case network accumulation, which aims to destabilize the
overall network as much as possible; 2) worst-case lane accumulation, which
aims to cause worst-case accumulation on some target lanes; and 3) risk-averse
target accumulation, which aims to reach a target accumulation by making the
minimum perturbation to sensor data. The problems are solved using bilevel
programming optimization methods. Finally, a case study of a real network is
used to illustrate the results.
|
[
{
"version": "v1",
"created": "Tue, 21 Jun 2016 18:41:46 GMT"
},
{
"version": "v2",
"created": "Mon, 11 Jul 2016 18:43:11 GMT"
},
{
"version": "v3",
"created": "Wed, 8 Feb 2017 22:15:31 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Ghafouri",
"Amin",
""
],
[
"Abbas",
"Waseem",
""
],
[
"Vorobeychik",
"Yevgeniy",
""
],
[
"Koutsoukos",
"Xenofon",
""
]
] |
new_dataset
| 0.980706 |
1608.08324
|
Jean Cardinal
|
Jean Cardinal and Stefan Felsner
|
Topological Drawings of Complete Bipartite Graphs
|
A preliminary version appeared in the Proceedings of the 24th
International Symposium on Graph Drawing and Network Visualization (GD 2016)
| null | null | null |
cs.CG cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Topological drawings are natural representations of graphs in the plane,
where vertices are represented by points, and edges by curves connecting the
points. Topological drawings of complete graphs and of complete bipartite
graphs have been studied extensively in the context of crossing number
problems. We consider a natural class of simple topological drawings of
complete bipartite graphs, in which we require that one side of the vertex set
bipartition lies on the outer boundary of the drawing.
We investigate the combinatorics of such drawings. For this purpose, we
define combinatorial encodings of the drawings by enumerating the distinct
drawings of subgraphs isomorphic to $K_{2,2}$ and $K_{3,2}$, and investigate
the constraints they must satisfy. We prove that a drawing of $K_{k,n}$ exists
if and only if some simple local conditions are satisfied by the encodings.
This directly yields a polynomial-time algorithm for deciding the existence of
such a drawing given the encoding. We show the encoding is equivalent to
specifying which pairs of edges cross, yielding a similar polynomial-time
algorithm for the realizability of abstract topological graphs.
We also completely characterize and enumerate such drawings of $K_{k,n}$ in
which the order of the edges around each vertex is the same for vertices on the
same side of the bipartition. Finally, we investigate drawings of $K_{k,n}$
using straight lines and pseudolines, and consider the complexity of the
corresponding realizability problems.
|
[
{
"version": "v1",
"created": "Tue, 30 Aug 2016 04:38:19 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Feb 2017 11:29:09 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Felsner",
"Stefan",
""
]
] |
new_dataset
| 0.998705 |
1701.07544
|
Jekan Thangavelautham
|
Laksh Raura, Andrew Warren and Jekan Thangavelautham
|
Spherical Planetary Robot for Rugged Terrain Traversal
|
10 pages, 16 figures in Proceedings of the IEEE Aerospace Conference
2017
| null | null | null |
cs.RO astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wheeled planetary rovers such as the Mars Exploration Rovers (MERs) and Mars
Science Laboratory (MSL) have provided unprecedented, detailed images of the
Mars surface. However, these rovers are large and are of high-cost as they need
to carry sophisticated instruments and science laboratories. We propose the
development of low-cost planetary rovers that are the size and shape of
cantaloupes and that can be deployed from a larger rover. The rover named
SphereX is 2 kg in mass, is spherical, holonomic and contains a hopping
mechanism to jump over rugged terrain. A small low-cost rover complements a
larger rover, particularly to traverse rugged terrain or roll down a canyon,
cliff or crater to obtain images and science data. While it may be a one-way
journey for these small robots, they could be used tactically to obtain
high-reward science data. The robot is equipped with a pair of stereo cameras
to perform visual navigation and has room for a science payload. In this paper,
we analyze the design and development of a laboratory prototype. The results
show a promising pathway towards development of a field system.
|
[
{
"version": "v1",
"created": "Thu, 26 Jan 2017 01:54:15 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Feb 2017 16:21:07 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Raura",
"Laksh",
""
],
[
"Warren",
"Andrew",
""
],
[
"Thangavelautham",
"Jekan",
""
]
] |
new_dataset
| 0.999824 |
1702.02363
|
Bahadir Sahin
|
H. Bahadir Sahin, Caglar Tirkaz, Eray Yildiz, Mustafa Tolga Eren, Ozan
Sonmez
|
Automatically Annotated Turkish Corpus for Named Entity Recognition and
Text Categorization using Large-Scale Gazetteers
|
10 page, 1 figure, white paper, update: added correct download link
for dataset
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Turkish Wikipedia Named-Entity Recognition and Text Categorization (TWNERTC)
dataset is a collection of automatically categorized and annotated sentences
obtained from Wikipedia. We constructed large-scale gazetteers by using a graph
crawler algorithm to extract relevant entity and domain information from a
semantic knowledge base, Freebase. The constructed gazetteers contains
approximately 300K entities with thousands of fine-grained entity types under
77 different domains. Since automated processes are prone to ambiguity, we also
introduce two new content specific noise reduction methodologies. Moreover, we
map fine-grained entity types to the equivalent four coarse-grained types:
person, loc, org, misc. Eventually, we construct six different dataset versions
and evaluate the quality of annotations by comparing ground truths from human
annotators. We make these datasets publicly available to support studies on
Turkish named-entity recognition (NER) and text categorization (TC).
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2017 10:45:23 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Feb 2017 08:35:12 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Sahin",
"H. Bahadir",
""
],
[
"Tirkaz",
"Caglar",
""
],
[
"Yildiz",
"Eray",
""
],
[
"Eren",
"Mustafa Tolga",
""
],
[
"Sonmez",
"Ozan",
""
]
] |
new_dataset
| 0.999715 |
1702.02588
|
Assaf Eisenman
|
Assaf Eisenman, Asaf Cidon, Evgenya Pergament, Or Haimovich, Ryan
Stutsman, Mohammad Alizadeh, and Sachin Katti
|
Flashield: a Key-value Cache that Minimizes Writes to Flash
| null | null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As its price per bit drops, SSD is increasingly becoming the default storage
medium for cloud application databases. However, it has not become the
preferred storage medium for key-value caches, even though SSD offers more than
10x lower price per bit and sufficient performance compared to DRAM. This is
because key-value caches need to frequently insert, update and evict small
objects. This causes excessive writes and erasures on flash storage, since
flash only supports writes and erasures of large chunks of data. These
excessive writes and erasures significantly shorten the lifetime of flash,
rendering it impractical to use for key-value caches. We present Flashield, a
hybrid key-value cache that uses DRAM as a "filter" to minimize writes to SSD.
Flashield performs light-weight machine learning profiling to predict which
objects are likely to be read frequently before getting updated; these objects,
which are prime candidates to be stored on SSD, are written to SSD in large
chunks sequentially. In order to efficiently utilize the cache's available
memory, we design a novel in-memory index for the variable-sized objects stored
on flash that requires only 4 bytes per object in DRAM. We describe Flashield's
design and implementation and, we evaluate it on a real-world cache trace.
Compared to state-of-the-art systems that suffer a write amplification of 2.5x
or more, Flashield maintains a median write amplification of 0.5x without any
loss of hit rate or throughput.
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2017 19:21:13 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Eisenman",
"Assaf",
""
],
[
"Cidon",
"Asaf",
""
],
[
"Pergament",
"Evgenya",
""
],
[
"Haimovich",
"Or",
""
],
[
"Stutsman",
"Ryan",
""
],
[
"Alizadeh",
"Mohammad",
""
],
[
"Katti",
"Sachin",
""
]
] |
new_dataset
| 0.998373 |
1702.02671
|
Sian-Jheng Lin
|
Sian-Jheng Lin
|
On the Local Correctabilities of Projective Reed-Muller Codes
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In this paper, we show that the projective Reed-Muller~(PRM) codes form a
family of locally correctable codes~(LCC) in the regime of low query
complexities. A PRM code is specified by the alphabet size $q$, the number of
variables $m$, and the degree $d$. When $d\leq q-1$, we present a perfectly
smooth local decoder to recover a symbol by accessing $\gamma\leq q$ symbols to
the coordinates fall on a line. There are three major parameters considered in
LCCs, namely the query complexity, the message length and the code length. This
paper shows that PRM codes are shorter than generalized Reed-Muller~(GRM) codes
in LCCs. Precisely, given a GRM code over a field of size $q$, there exists a
class of shorter codes over a field of size $q-1$, while maintaining the same
values on the query complexities and the message lengths.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 01:32:26 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Lin",
"Sian-Jheng",
""
]
] |
new_dataset
| 0.997014 |
1702.02695
|
Mingming Cai
|
Mingming Cai and J. Nicholas Laneman
|
Wideband Distributed Spectrum Sharing with Multichannel Immediate
Multiple Access
|
16 pages, to be published in Analog Integrated Circuits and Signal
Processing
| null |
10.1007/s10470-017-0934-2
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes a radio architecture for distributed spectrum sharing of
multiple channels among secondary users (SUs) in a wide band of frequencies and
a localized area. A novel Multichannel Immediate Multiple Access (MIMA)
physical layer is developed such that each SU can monitor all the channels
simultaneously for incoming signals and achieve fast rendezvous within the
multiple channels. The spectrum utilized by an SU pair can be changed
dynamically based upon spectrum sensing at the transmitter and tracking
synchronization and control messages at the receiver. Although information
about the number of active SUs can be used to improve the spectrum sharing
efficiency, the improvement is small relative to the cost of obtaining such
information. Therefore, the architecture adopts Multichannel Carrier Sense
Multiple Access (CSMA) for medium access control regardless of the number of
active SUs. A prototype implementation of the architecture has been developed
using an advanced software defined radio (SDR) platform. System tests
demonstrate that the spectrum sharing efficiency of the prototype is close to
an upper bound if the signal-to-noise ratio (SNR) is sufficiently high. Among
other practical issues, imaged interference caused by hardware IQ imbalance
limits system performance. In the prototype, the MIMA is based on an LTE
waveform. Therefore, the spectrum sharing radio can be potentially applied to
the 3.5 GHz radar band for Citizens Broadband Radio Service (CBRS).
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 04:11:32 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Cai",
"Mingming",
""
],
[
"Laneman",
"J. Nicholas",
""
]
] |
new_dataset
| 0.973812 |
1702.02716
|
Shan Lu
|
Shan Lu, Horoshi Kamabe, Jun Cheng and Akira Yamawaki
|
Construction of Unrestricted Rate Parallel Random Input Output Code
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/publicdomain/zero/1.0/
|
A coding scheme for two-page unrestricted-rate PRIO code that each page may
have different code rates is proposed. In the second page, the code for each
messages consists of two complementary codewords with code length n. There are
a total of 2n-1 codes which are disjoint to guarantees uniquely decodable for
2n-1 messages. In the first page, the code for each message consists of all
weight-u vectors with their non-zero elements restricted to (2u-1) same
positions, where non-negative integer u is less than or equal to half of code
length. Finding codes to be disjoint in first page is equivalent to
construction of constant-weight codes, and the numbers of disjoint codes are
the best-known numbers of codewords in constant-weight codes. Our coding scheme
is constructive, and the code length is arbitrary.The sum rates of our proposed
codes are higher than those of previous work.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 06:11:30 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Lu",
"Shan",
""
],
[
"Kamabe",
"Horoshi",
""
],
[
"Cheng",
"Jun",
""
],
[
"Yamawaki",
"Akira",
""
]
] |
new_dataset
| 0.966718 |
1702.02722
|
Junlin Yu
|
Junlin Yu, Man Hon Cheung, Jianwei Huang, H. Vincent Poor
|
Mobile Data Trading: Behavioral Economics Analysis and Algorithm Design
|
21 pages, 12 figures
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by the recently launched mobile data trading markets (e.g., China
Mobile Hong Kong's 2nd exChange Market), in this paper we study the mobile data
trading problem under the future data demand uncertainty. We introduce a
brokerage-based market, where sellers and buyers propose their selling and
buying quantities, respectively, to the trading platform that matches the
market supply and demand. To understand the users' realistic trading behaviors,
a prospect theory (PT) model from behavioral economics is proposed, which
includes the widely adopted expected utility theory (EUT) as a special case.
Although the PT modeling leads to a challenging non-convex optimization
problem, the optimal solution can be characterized by exploiting the unimodal
structure of the objective function. Building upon our analysis, we design an
algorithm to help estimate the user's risk preference and provide trading
recommendations dynamically, considering the latest market and usage
information. It is shown in our simulation that the risk preferences have a
significant impact on the user's decision and outcome: a risk-averse dominant
user can guarantee a higher minimum profit in the trading, while a risk-seeking
dominant user can achieve a higher maximum profit. By comparing with the EUT
benchmark, it is shown that a PT user with a low reference point is more
willing to buy mobile data. Moreover, when the probability of high future data
demand is low, a PT user is more willing to buy mobile data due to the
probability distortion comparing with an EUT user.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 06:40:10 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Yu",
"Junlin",
""
],
[
"Cheung",
"Man Hon",
""
],
[
"Huang",
"Jianwei",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.998274 |
1702.02799
|
Sheng Wang
|
Anh Dinh, Ji Wang, Sheng Wang, Gang Chen, Wei-Ngan Chin, Qian Lin,
Beng Chin Ooi, Pingcheng Ruan, Kian-Lee Tan, Zhongle Xie, Hao Zhang, and
Meihui Zhang
|
UStore: A Distributed Storage With Rich Semantics
|
21 pages
| null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's storage systems expose abstractions which are either too low-level
(e.g., key-value store, raw-block store) that they require developers to
re-invent the wheels, or too high-level (e.g., relational databases, Git) that
they lack generality to support many classes of applications. In this work, we
propose and implement a general distributed data storage system, called UStore,
which has rich semantics. UStore delivers three key properties, namely
immutability, sharing and security, which unify and add values to many classes
of today's applications, and which also open the door for new applications. By
keeping the core properties within the storage, UStore helps reduce application
development efforts while offering high performance at hand. The storage
embraces current hardware trends as key enablers. It is built around a
data-structure similar to that of Git, a popular source code versioning system,
but it also synthesizes many designs from distributed systems and databases.
Our current implementation of UStore has better performance than general
in-memory key-value storage systems, especially for version scan operations. We
port and evaluate four applications on top of UStore: a Git-like application, a
collaborative data science application, a transaction management application,
and a blockchain application. We demonstrate that UStore enables faster
development and the UStore-backed applications can have better performance than
the existing implementations.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 12:06:37 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Dinh",
"Anh",
""
],
[
"Wang",
"Ji",
""
],
[
"Wang",
"Sheng",
""
],
[
"Chen",
"Gang",
""
],
[
"Chin",
"Wei-Ngan",
""
],
[
"Lin",
"Qian",
""
],
[
"Ooi",
"Beng Chin",
""
],
[
"Ruan",
"Pingcheng",
""
],
[
"Tan",
"Kian-Lee",
""
],
[
"Xie",
"Zhongle",
""
],
[
"Zhang",
"Hao",
""
],
[
"Zhang",
"Meihui",
""
]
] |
new_dataset
| 0.999676 |
1702.02805
|
Qi Guo
|
Qi Guo, Ce Zhu, Zhiqiang Xia, Zhengtao Wang, Yipeng Liu
|
Attribute-controlled face photo synthesis from simple line drawing
|
5 pages, 5 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face photo synthesis from simple line drawing is a one-to-many task as simple
line drawing merely contains the contour of human face. Previous exemplar-based
methods are over-dependent on the datasets and are hard to generalize to
complicated natural scenes. Recently, several works utilize deep neural
networks to increase the generalization, but they are still limited in the
controllability of the users. In this paper, we propose a deep generative model
to synthesize face photo from simple line drawing controlled by face attributes
such as hair color and complexion. In order to maximize the controllability of
face attributes, an attribute-disentangled variational auto-encoder (AD-VAE) is
firstly introduced to learn latent representations disentangled with respect to
specified attributes. Then we conduct photo synthesis from simple line drawing
based on AD-VAE. Experiments show that our model can well disentangle the
variations of attributes from other variations of face photos and synthesize
detailed photorealistic face images with desired attributes. Regarding
background and illumination as the style and human face as the content, we can
also synthesize face photos with the target style of a style photo.
|
[
{
"version": "v1",
"created": "Thu, 9 Feb 2017 12:21:36 GMT"
}
] | 2017-02-10T00:00:00 |
[
[
"Guo",
"Qi",
""
],
[
"Zhu",
"Ce",
""
],
[
"Xia",
"Zhiqiang",
""
],
[
"Wang",
"Zhengtao",
""
],
[
"Liu",
"Yipeng",
""
]
] |
new_dataset
| 0.991264 |
1401.1448
|
Denis Kuperberg
|
Denis Kuperberg
|
Linear Temporal Logic for Regular Cost Functions
|
37 pages, 13 figures, accepted to LMCS, updated version 08/02/2017
|
Logical Methods in Computer Science, Volume 10, Issue 1 (February
4, 2014) lmcs:1222
|
10.2168/LMCS-10(1:4)2014
| null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Regular cost functions have been introduced recently as an extension to the
notion of regular languages with counting capabilities, which retains strong
closure, equivalence, and decidability properties. The specificity of cost
functions is that exact values are not considered, but only estimated. In this
paper, we define an extension of Linear Temporal Logic (LTL) over finite words
to describe cost functions. We give an explicit translation from this new logic
to two dual form of cost automata, and we show that the natural decision
problems for this logic are PSPACE-complete, as it is the case in the classical
setting. We then algebraically characterize the expressive power of this logic,
using a new syntactic congruence for cost functions introduced in this paper.
|
[
{
"version": "v1",
"created": "Tue, 7 Jan 2014 17:24:18 GMT"
},
{
"version": "v2",
"created": "Sun, 2 Feb 2014 22:02:49 GMT"
},
{
"version": "v3",
"created": "Thu, 8 May 2014 16:06:09 GMT"
},
{
"version": "v4",
"created": "Tue, 7 Feb 2017 16:35:41 GMT"
},
{
"version": "v5",
"created": "Wed, 8 Feb 2017 12:52:42 GMT"
}
] | 2017-02-09T00:00:00 |
[
[
"Kuperberg",
"Denis",
""
]
] |
new_dataset
| 0.984433 |
1602.05314
|
Tobias Weyand
|
Tobias Weyand, Ilya Kostrikov, James Philbin
|
PlaNet - Photo Geolocation with Convolutional Neural Networks
| null | null |
10.1007/978-3-319-46484-8_3
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Is it possible to build a system to determine the location where a photo was
taken using just its pixels? In general, the problem seems exceptionally
difficult: it is trivial to construct situations where no location can be
inferred. Yet images often contain informative cues such as landmarks, weather
patterns, vegetation, road markings, and architectural details, which in
combination may allow one to determine an approximate location and occasionally
an exact location. Websites such as GeoGuessr and View from your Window suggest
that humans are relatively good at integrating these cues to geolocate images,
especially en-masse. In computer vision, the photo geolocation problem is
usually approached using image retrieval methods. In contrast, we pose the
problem as one of classification by subdividing the surface of the earth into
thousands of multi-scale geographic cells, and train a deep network using
millions of geotagged images. While previous approaches only recognize
landmarks or perform approximate matching using global image descriptors, our
model is able to use and integrate multiple visible cues. We show that the
resulting model, called PlaNet, outperforms previous approaches and even
attains superhuman levels of accuracy in some cases. Moreover, we extend our
model to photo albums by combining it with a long short-term memory (LSTM)
architecture. By learning to exploit temporal coherence to geolocate uncertain
photos, we demonstrate that this model achieves a 50% performance improvement
over the single-image model.
|
[
{
"version": "v1",
"created": "Wed, 17 Feb 2016 06:27:55 GMT"
}
] | 2017-02-09T00:00:00 |
[
[
"Weyand",
"Tobias",
""
],
[
"Kostrikov",
"Ilya",
""
],
[
"Philbin",
"James",
""
]
] |
new_dataset
| 0.999224 |
1608.07547
|
Caroline Trippel
|
Caroline Trippel, Yatin A. Manerkar, Daniel Lustig, Michael Pellauer,
Margaret Martonosi
|
TriCheck: Memory Model Verification at the Trisection of Software,
Hardware, and ISA
|
Proceedings of the Twenty-Second International Conference on
Architectural Support for Programming Languages and Operating Systems
| null |
10.1145/3037697.3037719
| null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Memory consistency models (MCMs) which govern inter-module interactions in a
shared memory system, are a significant, yet often under-appreciated, aspect of
system design. MCMs are defined at the various layers of the hardware-software
stack, requiring thoroughly verified specifications, compilers, and
implementations at the interfaces between layers. Current verification
techniques evaluate segments of the system stack in isolation, such as proving
compiler mappings from a high-level language (HLL) to an ISA or proving
validity of a microarchitectural implementation of an ISA.
This paper makes a case for full-stack MCM verification and provides a
toolflow, TriCheck, capable of verifying that the HLL, compiler, ISA, and
implementation collectively uphold MCM requirements. The work showcases
TriCheck's ability to evaluate a proposed ISA MCM in order to ensure that each
layer and each mapping is correct and complete. Specifically, we apply TriCheck
to the open source RISC-V ISA, seeking to verify accurate, efficient, and legal
compilations from C11. We uncover under-specifications and potential
inefficiencies in the current RISC-V ISA documentation and identify possible
solutions for each. As an example, we find that a RISC-V-compliant
microarchitecture allows 144 outcomes forbidden by C11 to be observed out of
1,701 litmus tests examined. Overall, this paper demonstrates the necessity of
full-stack verification for detecting MCM-related bugs in the hardware-software
stack.
|
[
{
"version": "v1",
"created": "Fri, 26 Aug 2016 18:13:57 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Feb 2017 17:45:52 GMT"
}
] | 2017-02-09T00:00:00 |
[
[
"Trippel",
"Caroline",
""
],
[
"Manerkar",
"Yatin A.",
""
],
[
"Lustig",
"Daniel",
""
],
[
"Pellauer",
"Michael",
""
],
[
"Martonosi",
"Margaret",
""
]
] |
new_dataset
| 0.968325 |
1611.07302
|
Rodolfo Reyes-B\'aez
|
Rodolfo Reyes-B\'aez, Arjan van der Schaft, Bayu Jayawardhana
|
Tracking Control of Fully-actuated Mechanical port-Hamiltonian Systems
using Sliding Manifolds and Contraction
|
7 pages, 3 figures
| null | null | null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel trajectory tracking controller for
fully-actuated mechanical port-Hamiltonian (pH) systems, which is based on
recent advances in contraction-based control theory. Our proposed controller
renders a desired sliding manifold (where the reference trajectory lies)
attractive by making the corresponding error system partially contracting.
Finally, we present numerical simulation results where a SCARA robot is
commanded by our proposed tracking control law.
|
[
{
"version": "v1",
"created": "Tue, 22 Nov 2016 13:59:22 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Jan 2017 10:47:28 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Feb 2017 10:48:05 GMT"
},
{
"version": "v4",
"created": "Wed, 8 Feb 2017 01:40:00 GMT"
}
] | 2017-02-09T00:00:00 |
[
[
"Reyes-Báez",
"Rodolfo",
""
],
[
"van der Schaft",
"Arjan",
""
],
[
"Jayawardhana",
"Bayu",
""
]
] |
new_dataset
| 0.99358 |
1702.00483
|
Jason Y. Du
|
Chengkai Guo, Jason Y. Du
|
FPGA-based real-time 105-channel data acquisition platform for imaging
system
|
This paper has been withdrawn by the author due to a crucial sign
error in figure 1
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a real-time 105-channel data acquisition platform based on
FPGA for imaging will be implemented for mm-wave imaging systems. PC platform
is also realized for imaging results monitoring purpose. Mm-wave imaging
expands our vision by letting us see things under poor visibility conditions.
With this extended vision ability, a wide range of military imaging missions
would benefit, such as surveillance, precision targeting, navigation, and
rescue. Based on the previously designed imager modules, this project would go
on finishing the PCB design (both schematic and layout) of the following signal
processing systems consisting of Programmable Gain Amplifier(PGA) (4 PGA for
each ADC) and 16-channel Analog to Digital Converter (ADC) (7 ADC in total).
Then the system verification would be performed on the Artix-7 35T Arty FPGA
with the developing of proper controlling code to configure the ADC and realize
the communication between the FPGA and the PC (through both UART and Ethernet).
For the verification part, a simple test on a breadboard with a simple analog
input (generated from a resistor divider) would first be performed. After the
PCB design is finished, the whole system would be tested again with a precise
reference and analog input.
|
[
{
"version": "v1",
"created": "Wed, 18 Jan 2017 01:08:14 GMT"
},
{
"version": "v2",
"created": "Wed, 8 Feb 2017 18:13:55 GMT"
}
] | 2017-02-09T00:00:00 |
[
[
"Guo",
"Chengkai",
""
],
[
"Du",
"Jason Y.",
""
]
] |
new_dataset
| 0.998754 |
1702.02497
|
Dalin Zhu
|
Dalin Zhu and Junil Choi and Robert W. Heath Jr
|
Two-Dimensional AoD and AoA Acquisition for Wideband mmWave Systems with
Cross-Polarized MIMO
|
Submitted to IEEE Transactions on Wireless Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a novel two-dimensional super-resolution angle-of-departure
(AoD) and angle-of-arrival (AoA) estimation technique is proposed for wideband
millimeter-wave multiple-input multiple-output systems with cross-polarized
antenna elements. The key ingredient of the proposed method is to form custom
designed beam pairs, and devise an invertible function of the AoD/AoA to be
estimated from the corresponding beam pairs. Further, a new multi-layer
reference signal structure is developed for the proposed method to facilitate
angle estimation for wideband channels with cross-polarized antenna elements.
To facilitate feedback in closed-loop frequency division duplexing systems, a
novel differential feedback strategy is proposed aiming at feedback reduction
for the two-dimensional angle estimation. Numerical results demonstrate that by
using the proposed method, good azimuth/elevation AoD and AoA estimation
performance can be achieved under different levels of signal-to-noise ratio,
channel conditions, and antenna array configurations.
|
[
{
"version": "v1",
"created": "Wed, 8 Feb 2017 16:28:41 GMT"
}
] | 2017-02-09T00:00:00 |
[
[
"Zhu",
"Dalin",
""
],
[
"Choi",
"Junil",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.998067 |
1506.04787
|
Olalekan Ogunmolu
|
Olalekan Ogunmolu, Xuejun Gu, Steve Jiang, Nicholas Gans
|
A Real-Time Soft Robotic Patient Positioning System for Maskless
Head-and-Neck Cancer Radiotherapy: An Initial Investigation
|
IEEE Conference on Automation Science and Engineering, Gothenburg,
Sweden. 2015. Life Sciences and Health Care; Mechatronics; Emerging Topics in
Automation
| null |
10.1118/1.4924100
| null |
cs.RO
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We present an initial examination of a novel approach to accurately position
a patient during head and neck intensity modulated radiotherapy (IMRT).
Position-based visual-servoing of a radio-transparent soft robot is used to
control the flexion/extension cranial motion of a manikin head. A Kinect RGB-D
camera is used to measure head position and the error between the sensed and
desired position is used to control a pneumatic system which regulates pressure
within an inflatable air bladder (IAB). Results show that the system is capable
of controlling head motion to within 2mm with respect to a reference
trajectory. This establishes proof-of-concept that using multiple IABs and
actuators can improve cancer treatment.
|
[
{
"version": "v1",
"created": "Mon, 15 Jun 2015 22:08:49 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Sep 2015 22:29:03 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Ogunmolu",
"Olalekan",
""
],
[
"Gu",
"Xuejun",
""
],
[
"Jiang",
"Steve",
""
],
[
"Gans",
"Nicholas",
""
]
] |
new_dataset
| 0.992162 |
1611.02205
|
Nadav Bhonker
|
Nadav Bhonker, Shai Rozenberg and Itay Hubara
|
Playing SNES in the Retro Learning Environment
| null | null | null | null |
cs.LG cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mastering a video game requires skill, tactics and strategy. While these
attributes may be acquired naturally by human players, teaching them to a
computer program is a far more challenging task. In recent years, extensive
research was carried out in the field of reinforcement learning and numerous
algorithms were introduced, aiming to learn how to perform human tasks such as
playing video games. As a result, the Arcade Learning Environment (ALE)
(Bellemare et al., 2013) has become a commonly used benchmark environment
allowing algorithms to train on various Atari 2600 games. In many games the
state-of-the-art algorithms outperform humans. In this paper we introduce a new
learning environment, the Retro Learning Environment --- RLE, that can run
games on the Super Nintendo Entertainment System (SNES), Sega Genesis and
several other gaming consoles. The environment is expandable, allowing for more
video games and consoles to be easily added to the environment, while
maintaining the same interface as ALE. Moreover, RLE is compatible with Python
and Torch. SNES games pose a significant challenge to current algorithms due to
their higher level of complexity and versatility.
|
[
{
"version": "v1",
"created": "Mon, 7 Nov 2016 18:33:38 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Feb 2017 18:50:50 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Bhonker",
"Nadav",
""
],
[
"Rozenberg",
"Shai",
""
],
[
"Hubara",
"Itay",
""
]
] |
new_dataset
| 0.999518 |
1611.08481
|
Harm de Vries
|
Harm de Vries, Florian Strub, Sarath Chandar, Olivier Pietquin, Hugo
Larochelle, Aaron Courville
|
GuessWhat?! Visual object discovery through multi-modal dialogue
|
23 pages; CVPR 2017 submission; see https://guesswhat.ai
| null | null | null |
cs.AI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce GuessWhat?!, a two-player guessing game as a testbed for
research on the interplay of computer vision and dialogue systems. The goal of
the game is to locate an unknown object in a rich image scene by asking a
sequence of questions. Higher-level image understanding, like spatial reasoning
and language grounding, is required to solve the proposed task. Our key
contribution is the collection of a large-scale dataset consisting of 150K
human-played games with a total of 800K visual question-answer pairs on 66K
images. We explain our design decisions in collecting the dataset and introduce
the oracle and questioner tasks that are associated with the two players of the
game. We prototyped deep learning models to establish initial baselines of the
introduced tasks.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 20:56:13 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Feb 2017 12:52:53 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"de Vries",
"Harm",
""
],
[
"Strub",
"Florian",
""
],
[
"Chandar",
"Sarath",
""
],
[
"Pietquin",
"Olivier",
""
],
[
"Larochelle",
"Hugo",
""
],
[
"Courville",
"Aaron",
""
]
] |
new_dataset
| 0.995409 |
1611.09830
|
Tong Wang
|
Adam Trischler, Tong Wang, Xingdi Yuan, Justin Harris, Alessandro
Sordoni, Philip Bachman, Kaheer Suleman
|
NewsQA: A Machine Comprehension Dataset
| null | null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present NewsQA, a challenging machine comprehension dataset of over
100,000 human-generated question-answer pairs. Crowdworkers supply questions
and answers based on a set of over 10,000 news articles from CNN, with answers
consisting of spans of text from the corresponding articles. We collect this
dataset through a four-stage process designed to solicit exploratory questions
that require reasoning. A thorough analysis confirms that NewsQA demands
abilities beyond simple word matching and recognizing textual entailment. We
measure human performance on the dataset and compare it to several strong
neural models. The performance gap between humans and machines (0.198 in F1)
indicates that significant progress can be made on NewsQA through future
research. The dataset is freely available at
https://datasets.maluuba.com/NewsQA.
|
[
{
"version": "v1",
"created": "Tue, 29 Nov 2016 20:38:07 GMT"
},
{
"version": "v2",
"created": "Thu, 22 Dec 2016 18:12:57 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Feb 2017 16:27:59 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Trischler",
"Adam",
""
],
[
"Wang",
"Tong",
""
],
[
"Yuan",
"Xingdi",
""
],
[
"Harris",
"Justin",
""
],
[
"Sordoni",
"Alessandro",
""
],
[
"Bachman",
"Philip",
""
],
[
"Suleman",
"Kaheer",
""
]
] |
new_dataset
| 0.999814 |
1612.02170
|
Odysseas Zografos
|
Odysseas Zografos, Sourav Dutta, Mauricio Manfrini, Adrien Vaysset,
Bart Sor\'ee, Azad Naeemi, Praveen Raghavan, Rudy Lauwereins, Iuliana P. Radu
|
Non-volatile spin wave majority gate at the nanoscale
| null |
AIP Advances, Volume 7, Issue 5, 2017
|
10.1063/1.4975693
| null |
cs.ET cond-mat.mes-hall
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A spin wave majority fork-like structure with feature size of 40\,nm, is
presented and investigated, through micromagnetic simulations. The structure
consists of three merging out-of-plane magnetization spin wave buses and four
magneto-electric cells serving as three inputs and an output. The information
of the logic signals is encoded in the phase of the transmitted spin waves and
subsequently stored as direction of magnetization of the magneto-electric cells
upon detection. The minimum dimensions of the structure that produce an
operational majority gate are identified. For all input combinations, the
detection scheme employed manages to capture the majority phase result of the
spin wave interference and ignore all reflection effects induced by the
geometry of the structure.
|
[
{
"version": "v1",
"created": "Wed, 7 Dec 2016 09:51:29 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Zografos",
"Odysseas",
""
],
[
"Dutta",
"Sourav",
""
],
[
"Manfrini",
"Mauricio",
""
],
[
"Vaysset",
"Adrien",
""
],
[
"Sorée",
"Bart",
""
],
[
"Naeemi",
"Azad",
""
],
[
"Raghavan",
"Praveen",
""
],
[
"Lauwereins",
"Rudy",
""
],
[
"Radu",
"Iuliana P.",
""
]
] |
new_dataset
| 0.999268 |
1701.04148
|
Dongsheng Yang
|
Tong Yang, Lingtong Liu, Yibo Yan, Muhammad Shahzad, Yulong Shen,
Xiaoming Li, Bin Cui, Gaogang Xie
|
SF-sketch: A Two-stage Sketch for Data Streams
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A sketch is a probabilistic data structure used to record frequencies of
items in a multi-set. Sketches are widely used in various fields, especially
those that involve processing and storing data streams. In streaming
applications with high data rates, a sketch "fills up" very quickly. Thus, its
contents are periodically transferred to the remote collector, which is
responsible for answering queries. In this paper, we propose a new sketch,
called Slim-Fat (SF) sketch, which has a significantly higher accuracy compared
to prior art, a much smaller memory footprint, and at the same time achieves
the same speed as the best prior sketch. The key idea behind our proposed
SF-sketch is to maintain two separate sketches: a small sketch called
Slim-subsketch and a large sketch called Fat-subsketch. The Slim-subsketch is
periodically transferred to the remote collector for answering queries quickly
and accurately. The Fat-subsketch, however, is not transferred to the remote
collector because it is used only to assist the Slim-subsketch during the
insertions and deletions and is not used to answer queries. We implemented and
extensively evaluated SF-sketch along with several prior sketches and compared
them side by side. Our experimental results show that SF-sketch outperforms the
most widely used CM-sketch by up to 33.1 times in terms of accuracy. We have
released the source codes of our proposed sketch as well as existing sketches
at Github. The short version of this paper will appear in ICDE 2017.
|
[
{
"version": "v1",
"created": "Mon, 16 Jan 2017 02:51:22 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Jan 2017 14:52:10 GMT"
},
{
"version": "v3",
"created": "Tue, 7 Feb 2017 14:42:46 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Yang",
"Tong",
""
],
[
"Liu",
"Lingtong",
""
],
[
"Yan",
"Yibo",
""
],
[
"Shahzad",
"Muhammad",
""
],
[
"Shen",
"Yulong",
""
],
[
"Li",
"Xiaoming",
""
],
[
"Cui",
"Bin",
""
],
[
"Xie",
"Gaogang",
""
]
] |
new_dataset
| 0.996427 |
1702.01160
|
Hao Fu
|
Hao Fu, Zizhan Zheng, Somdutta Bose, Matt Bishop, Prasant Mohapatra
|
LeakSemantic: Identifying Abnormal Sensitive Network Transmissions in
Mobile Applications
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile applications (apps) often transmit sensitive data through network with
various intentions. Some transmissions are needed to fulfill the app's
functionalities. However, transmissions with malicious receivers may lead to
privacy leakage and tend to behave stealthily to evade detection. The problem
is twofold: how does one unveil sensitive transmissions in mobile apps, and
given a sensitive transmission, how does one determine if it is legitimate?
In this paper, we propose LeakSemantic, a framework that can automatically
locate abnormal sensitive network transmissions from mobile apps. LeakSemantic
consists of a hybrid program analysis component and a machine learning
component. Our program analysis component combines static analysis and dynamic
analysis to precisely identify sensitive transmissions. Compared to existing
taint analysis approaches, LeakSemantic achieves better accuracy with fewer
false positives and is able to collect runtime data such as network traffic for
each transmission. Based on features derived from the runtime data, machine
learning classifiers are built to further differentiate between the legal and
illegal disclosures. Experiments show that LeakSemantic achieves 91% accuracy
on 2279 sensitive connections from 1404 apps.
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2017 21:07:59 GMT"
},
{
"version": "v2",
"created": "Tue, 7 Feb 2017 01:24:59 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Fu",
"Hao",
""
],
[
"Zheng",
"Zizhan",
""
],
[
"Bose",
"Somdutta",
""
],
[
"Bishop",
"Matt",
""
],
[
"Mohapatra",
"Prasant",
""
]
] |
new_dataset
| 0.998842 |
1702.01805
|
Renato J Cintra
|
F. M. Bayer, R. J. Cintra, A. Edirisuriya, A. Madanayake
|
A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel
16-point Approximate DCT for Image Compression Applications
|
17 pages, 6 figures, 6 tables
|
Measurement Science and Technology, Volume 23, Number 11, 2012
|
10.1088/0957-0233/23/11/114010
| null |
cs.MM cs.AR cs.DS cs.IT math.IT stat.ME
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The discrete cosine transform (DCT) is the key step in many image and video
coding standards. The 8-point DCT is an important special case, possessing
several low-complexity approximations widely investigated. However, 16-point
DCT transform has energy compaction advantages. In this sense, this paper
presents a new 16-point DCT approximation with null multiplicative complexity.
The proposed transform matrix is orthogonal and contains only zeros and ones.
The proposed transform outperforms the well-know Walsh-Hadamard transform and
the current state-of-the-art 16-point approximation. A fast algorithm for the
proposed transform is also introduced. This fast algorithm is experimentally
validated using hardware implementations that are physically realized and
verified on a 40 nm CMOS Xilinx Virtex-6 XC6VLX240T FPGA chip for a maximum
clock rate of 342 MHz. Rapid prototypes on FPGA for 8-bit input word size shows
significant improvement in compressed image quality by up to 1-2 dB at the cost
of only eight adders compared to the state-of-art 16-point DCT approximation
algorithm in the literature [S. Bouguezel, M. O. Ahmad, and M. N. S. Swamy. A
novel transform for image compression. In {\em Proceedings of the 53rd IEEE
International Midwest Symposium on Circuits and Systems (MWSCAS)}, 2010].
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 22:00:34 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Bayer",
"F. M.",
""
],
[
"Cintra",
"R. J.",
""
],
[
"Edirisuriya",
"A.",
""
],
[
"Madanayake",
"A.",
""
]
] |
new_dataset
| 0.974115 |
1702.01870
|
Ameer Pasha Hosseinbor
|
A. Pasha Hosseinbor, Renat Zhdanov, Alexander Ushveridze
|
A New Point-set Registration Algorithm for Fingerprint Matching
|
Point pattern matching, point-set registration, fingerprint, minutia
matching, alignment
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel minutia-based fingerprint matching algorithm is proposed that employs
iterative global alignment on two minutia sets. The matcher considers all
possible minutia pairings and iteratively aligns the two sets until the number
of minutia pairs does not exceed the maximum number of allowable one-to-one
pairings. The optimal alignment parameters are derived analytically via linear
least squares. The first alignment establishes a region of overlap between the
two minutia sets, which is then (iteratively) refined by each successive
alignment. After each alignment, minutia pairs that exhibit weak correspondence
are discarded. The process is repeated until the number of remaining pairs no
longer exceeds the maximum number of allowable one-to-one pairings. The
proposed algorithm is tested on both the FVC2000 and FVC2002 databases, and the
results indicate that the proposed matcher is both effective and efficient for
fingerprint authentication; it is fast and does not utilize any computationally
expensive mathematical functions (e.g. trigonometric, exponential). In addition
to the proposed matcher, another contribution of the paper is the analytical
derivation of the least squares solution for the optimal alignment parameters
for two point-sets lacking exact correspondence.
|
[
{
"version": "v1",
"created": "Tue, 7 Feb 2017 03:43:31 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Hosseinbor",
"A. Pasha",
""
],
[
"Zhdanov",
"Renat",
""
],
[
"Ushveridze",
"Alexander",
""
]
] |
new_dataset
| 0.989762 |
1702.01872
|
Jeremy Yallop
|
Jeremy Yallop (University of Cambridge) and Damien Doligez (INRIA)
|
Proceedings ML Family / OCaml Users and Developers workshops
| null |
EPTCS 241, 2017
|
10.4204/EPTCS.241
| null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This volume contains the joint post-proceedings of the 2015 edition of the ML
Family Workshop and OCaml Users and Developers Workshop, held in Vancouver,
British Columbia, Canada, in affiliation with ICFP 2015.
|
[
{
"version": "v1",
"created": "Tue, 7 Feb 2017 03:55:07 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Yallop",
"Jeremy",
"",
"University of Cambridge"
],
[
"Doligez",
"Damien",
"",
"INRIA"
]
] |
new_dataset
| 0.981341 |
1702.01894
|
Shaoshan Liu
|
Shaoshan Liu, Jie Tang, Zhe Zhang, and Jean-Luc Gaudiot
|
CAAD: Computer Architecture for Autonomous Driving
|
7 pages, 4 figures, accepted by IEEE Computer Magazine
| null | null | null |
cs.AR cs.RO
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
We describe the computing tasks involved in autonomous driving, examine
existing autonomous driving computing platform implementations. To enable
autonomous driving, the computing stack needs to simultaneously provide high
performance, low power consumption, and low thermal dissipation, at low cost.
We discuss possible approaches to design computing platforms that will meet
these needs.
|
[
{
"version": "v1",
"created": "Tue, 7 Feb 2017 06:55:03 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Liu",
"Shaoshan",
""
],
[
"Tang",
"Jie",
""
],
[
"Zhang",
"Zhe",
""
],
[
"Gaudiot",
"Jean-Luc",
""
]
] |
new_dataset
| 0.999548 |
1702.02063
|
Thanh Nho Do
|
Thanh Nho Do, Tegoeh Tjahjowidodo, Michael Wai Shing Lau, and Soo Jay
Phee
|
Performance Control of Tendon-Driven Endoscopic Surgical Robots With
Friction and Hysteresis
|
8 pages, 11 figures
| null | null | null |
cs.RO math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this study, a new position control scheme for the tendon-sheath mechanism
(TSM) which is used in flexible medical devices is presented. TSM is widely
used in dexterous robotic applications because it can flexibly work in limited
space, in constrained environments, and provides efficient power transmission
from the external actuator to the distal joint. However, nonlinearities from
friction and backlash hysteresis between the tendon and the sheath pose
challenges in achieving precise position controls of the end effector. Previous
studies on the TSM only address the control problem under the assumptions of
known tendon-sheath configuration and known model parameters of the backlash
hysteresis nonlinearity. These approaches can have adverse impact and
limitations on the overall system performances and practical implementation.
This paper presents a new approach to model and control the TSM-driven flexible
robotic systems. The designed controller does not require exact knowledge of
nonlinear friction and backlash hysteresis parameters, only their bounds are
online estimated. Simulation and experimental validation results show that the
proposed control scheme can significantly improve the tracking performances
without the presence of the exact knowledge of the model parameters and the
sheath configuration.
|
[
{
"version": "v1",
"created": "Mon, 6 Feb 2017 18:23:15 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Do",
"Thanh Nho",
""
],
[
"Tjahjowidodo",
"Tegoeh",
""
],
[
"Lau",
"Michael Wai Shing",
""
],
[
"Phee",
"Soo Jay",
""
]
] |
new_dataset
| 0.997311 |
1702.02121
|
Xuhong Chen
|
Xuhong Chen, Jiaxun Lu and Pingyi Fan
|
Massive MIMO Beam-forming for High Speed Train Communication:
Directivity vs Beamwidth
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High-mobility adaption and massive Multiple-input Multiple-output (MIMO)
application are two primary evolving objectives for the next generation high
speed train communication system. In this paper, we consider how to design a
location-aware beam-forming for the massive MIMO system.We first analyze the
tradeoff between beam directivity and beamwidth, based on which we present the
sensitivity analysis of positioning accuracy. Then, we derive the maximum beam
directivity and corresponding beamwidth under the restriction of diverse
positioning accuracies to guarantee a high efficient transmission. Finally, we
present a low-complexity beam-forming design with positioning robustness
utilizing location information, which requires neither eigen-decomposing (ED)
the uplink channel covariance matrix (CCM) nor ED the downlink CCM (DCCM).
Numerical simulation indicates that a massive MIMO system with less than a
certain positioning error can guarantee a required performance with satisfying
transmission efficiency in the high-mobility scenario.
|
[
{
"version": "v1",
"created": "Tue, 7 Feb 2017 18:10:09 GMT"
}
] | 2017-02-08T00:00:00 |
[
[
"Chen",
"Xuhong",
""
],
[
"Lu",
"Jiaxun",
""
],
[
"Fan",
"Pingyi",
""
]
] |
new_dataset
| 0.982229 |
1406.2949
|
Rajai Nasser
|
Rajai Nasser
|
Ergodic Theory Meets Polarization. II: A Foundation of Polarization
Theory
|
33 pages. Accepted to IEEE Trans. Inform. Theory and presented in
part at ISIT'15
|
IEEE Transactions on Information Theory, vol. 63, no. 2, pp.
1063-1083, Feb. 2017
|
10.1109/TIT.2016.2617958
| null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An open problem in polarization theory is to determine the binary operations
that always lead to polarization (in the general multilevel sense) when they
are used in Ar{\i}kan style constructions. This paper, which is presented in
two parts, solves this problem by providing a necessary and sufficient
condition for a binary operation to be polarizing. This (second) part provides
a foundation of polarization theory based on the ergodic theory of binary
operations which we developed in the first part. We show that a binary
operation is polarizing if and only if it is uniformity preserving and its
right-inverse is strongly ergodic. The rate of polarization of single user
channels is studied. It is shown that the exponent of any polarizing operation
cannot exceed $\frac{1}{2}$, which is the exponent of quasigroup operations. We
also study the polarization of multiple access channels (MAC). In particular,
we show that a sequence of binary operations is MAC-polarizing if and only if
each binary operation in the sequence is polarizing. It is shown that the
exponent of any MAC-polarizing sequence cannot exceed $\frac{1}{2}$, which is
the exponent of sequences of quasigroup operations.
|
[
{
"version": "v1",
"created": "Wed, 11 Jun 2014 16:07:57 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Jun 2014 08:14:55 GMT"
},
{
"version": "v3",
"created": "Thu, 23 Oct 2014 15:22:04 GMT"
},
{
"version": "v4",
"created": "Tue, 3 Feb 2015 18:46:28 GMT"
},
{
"version": "v5",
"created": "Fri, 30 Sep 2016 13:23:24 GMT"
},
{
"version": "v6",
"created": "Tue, 4 Oct 2016 23:52:59 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Nasser",
"Rajai",
""
]
] |
new_dataset
| 0.991198 |
1504.02863
|
Andreas Bulling
|
Xucong Zhang, Yusuke Sugano, Mario Fritz, Andreas Bulling
|
Appearance-Based Gaze Estimation in the Wild
| null | null |
10.1109/CVPR.2015.7299081
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Appearance-based gaze estimation is believed to work well in real-world
settings, but existing datasets have been collected under controlled laboratory
conditions and methods have been not evaluated across multiple datasets. In
this work we study appearance-based gaze estimation in the wild. We present the
MPIIGaze dataset that contains 213,659 images we collected from 15 participants
during natural everyday laptop use over more than three months. Our dataset is
significantly more variable than existing ones with respect to appearance and
illumination. We also present a method for in-the-wild appearance-based gaze
estimation using multimodal convolutional neural networks that significantly
outperforms state-of-the art methods in the most challenging cross-dataset
evaluation. We present an extensive evaluation of several state-of-the-art
image-based gaze estimation algorithms on three current datasets, including our
own. This evaluation provides clear insights and allows us to identify key
research challenges of gaze estimation in the wild.
|
[
{
"version": "v1",
"created": "Sat, 11 Apr 2015 11:52:33 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Zhang",
"Xucong",
""
],
[
"Sugano",
"Yusuke",
""
],
[
"Fritz",
"Mario",
""
],
[
"Bulling",
"Andreas",
""
]
] |
new_dataset
| 0.998416 |
1511.05768
|
Andreas Bulling
|
Marc Tonsen, Xucong Zhang, Yusuke Sugano, Andreas Bulling
|
Labeled pupils in the wild: A dataset for studying pupil detection in
unconstrained environments
| null | null |
10.1145/2857491.2857520
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present labelled pupils in the wild (LPW), a novel dataset of 66
high-quality, high-speed eye region videos for the development and evaluation
of pupil detection algorithms. The videos in our dataset were recorded from 22
participants in everyday locations at about 95 FPS using a state-of-the-art
dark-pupil head-mounted eye tracker. They cover people with different
ethnicities, a diverse set of everyday indoor and outdoor illumination
environments, as well as natural gaze direction distributions. The dataset also
includes participants wearing glasses, contact lenses, as well as make-up. We
benchmark five state-of-the-art pupil detection algorithms on our dataset with
respect to robustness and accuracy. We further study the influence of image
resolution, vision aids, as well as recording location (indoor, outdoor) on
pupil detection performance. Our evaluations provide valuable insights into the
general pupil detection problem and allow us to identify key challenges for
robust pupil detection on head-mounted eye trackers.
|
[
{
"version": "v1",
"created": "Wed, 18 Nov 2015 13:30:55 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Tonsen",
"Marc",
""
],
[
"Zhang",
"Xucong",
""
],
[
"Sugano",
"Yusuke",
""
],
[
"Bulling",
"Andreas",
""
]
] |
new_dataset
| 0.999748 |
1605.01627
|
Yuan Lu
|
Yuan Lu, Alexandra Duel-Hallen
|
A Sensing Contribution-based Two-layer Game for Channel Selection and
Spectrum Access in Cognitive Radio Ad-hoc Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In cognitive radio (CR) networks, the secondary users (SUs) sense the
spectrum licensed to the primary users (PUs) to identify and possibly transmit
over temporarily unoccupied channels. Cooperative sensing was proposed to
improve the sensing accuracy, but in heterogeneous scenarios SUs do not
contribute equally to the cooperative sensing result because they experience
different received PU signal quality at their sensors. In this paper, a
two-layer coalitional game is developed for distributed sensing and access in
multichannel CR ad hoc networks where the SUs' transmission opportunities are
commensurate with their sensing contributions, thus fostering cooperation and
eliminating free-riders. Numerical results show that the proposed two-layer
game is computationally efficient and outperforms previously investigated
collaborative sensing and spectrum access approaches for heterogeneous
multichannel CR networks in terms of energy efficiency, throughput, SU
fairness, and complexity. Moreover, it is demonstrated that this game is robust
to changes in the network topology and the number of SUs in low-mobility
scenarios. Finally, we propose a new physical-layer approach to distributing
the network-level miss-detection (MD) constraints fairly among the interfering
SUs for guaranteed PU protection and demonstrate the performance advantages of
the AND-rule combining of spectrum sensing results for heterogeneous SUs.
|
[
{
"version": "v1",
"created": "Thu, 5 May 2016 15:44:21 GMT"
},
{
"version": "v2",
"created": "Sun, 5 Feb 2017 19:30:49 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Lu",
"Yuan",
""
],
[
"Duel-Hallen",
"Alexandra",
""
]
] |
new_dataset
| 0.977858 |
1610.09526
|
Ying Cui
|
Dongdong Jiang and Ying Cui
|
Partition-based Caching in Large-Scale SIC-Enabled Wireless Networks
|
30 pages, 7 figures, submitted to Trans. on Wireless Commun
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing designs for content dissemination do not fully explore and exploit
potential caching and computation capabilities in advanced wireless networks.
In this paper, we propose two partition-based caching designs, i.e., a coded
caching design based on Random Linear Network Coding and an uncoded caching
design. We consider the analysis and optimization of the two caching designs in
a large-scale successive interference cancelation (SIC)-enabled wireless
network. First, under each caching design, by utilizing tools from stochastic
geometry and adopting appropriate approximations, we derive a tractable
expression for the successful transmission probability in the general file size
regime. To further obtain design insights, we also derive closed-form
expressions for the successful transmission probability in the small and large
file size regimes, respectively. Then, under each caching design, we consider
the successful transmission probability maximization in the general file size
regime, which is an NP-hard problem. By exploring structural properties, we
successfully transform the original optimization problem into a Multiple-Choice
Knapsack Problem (MCKP), and obtain a near optimal solution with 1/2
approximation guarantee and polynomial complexity. We also obtain closed-form
asymptotically optimal solutions. The analysis and optimization results show
the advantage of the coded caching design over the uncoded caching design, and
reveal the impact of caching and SIC capabilities. Finally, by numerical
results, we show that the two proposed caching designs achieve significant
performance gains over some baseline caching designs.
|
[
{
"version": "v1",
"created": "Sat, 29 Oct 2016 15:19:46 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Nov 2016 02:07:31 GMT"
},
{
"version": "v3",
"created": "Sat, 4 Feb 2017 13:37:53 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Jiang",
"Dongdong",
""
],
[
"Cui",
"Ying",
""
]
] |
new_dataset
| 0.997708 |
1611.07810
|
Tegan Maharaj
|
Tegan Maharaj and Nicolas Ballas and Anna Rohrbach and Aaron Courville
and Christopher Pal
|
A dataset and exploration of models for understanding video data through
fill-in-the-blank question-answering
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
While deep convolutional neural networks frequently approach or exceed
human-level performance at benchmark tasks involving static images, extending
this success to moving images is not straightforward. Having models which can
learn to understand video is of interest for many applications, including
content recommendation, prediction, summarization, event/object detection and
understanding human visual perception, but many domains lack sufficient data to
explore and perfect video models. In order to address the need for a simple,
quantitative benchmark for developing and understanding video, we present
MovieFIB, a fill-in-the-blank question-answering dataset with over 300,000
examples, based on descriptive video annotations for the visually impaired. In
addition to presenting statistics and a description of the dataset, we perform
a detailed analysis of 5 different models' predictions, and compare these with
human performance. We investigate the relative importance of language, static
(2D) visual features, and moving (3D) visual features; the effects of
increasing dataset size, the number of frames sampled; and of vocabulary size.
We illustrate that: this task is not solvable by a language model alone; our
model combining 2D and 3D visual information indeed provides the best result;
all models perform significantly worse than human-level. We provide human
evaluations for responses given by different models and find that accuracy on
the MovieFIB evaluation corresponds well with human judgement. We suggest
avenues for improving video models, and hope that the proposed dataset can be
useful for measuring and encouraging progress in this very interesting field.
|
[
{
"version": "v1",
"created": "Wed, 23 Nov 2016 14:22:51 GMT"
},
{
"version": "v2",
"created": "Sun, 5 Feb 2017 17:51:19 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Maharaj",
"Tegan",
""
],
[
"Ballas",
"Nicolas",
""
],
[
"Rohrbach",
"Anna",
""
],
[
"Courville",
"Aaron",
""
],
[
"Pal",
"Christopher",
""
]
] |
new_dataset
| 0.999178 |
1701.07521
|
Nikita Polyanskii
|
Nikita Polyanskii, Vasiliy Usatyuk, and Ilya Vorobyev
|
Floor Scale Modulo Lifting for QC-LDPC codes
|
7 pages, 2 columns
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the given paper we present a novel approach for constructing a QC-LDPC
code of smaller length by lifting a given QC-LDPC code. The proposed method can
be considered as a generalization of floor lifting. Also we prove several
probabilistic statements concerning a theoretical improvement of the method
with respect to the number of small cycles. Making some offline calculation of
scale parameter it is possible to construct a sequence of QC-LDPC codes with
different circulant sizes generated from a single exponent matrix using only
floor and scale operations. The only parameter we store in memory is a constant
needed for scaling.
|
[
{
"version": "v1",
"created": "Wed, 25 Jan 2017 23:57:17 GMT"
},
{
"version": "v2",
"created": "Sat, 4 Feb 2017 23:52:23 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Polyanskii",
"Nikita",
""
],
[
"Usatyuk",
"Vasiliy",
""
],
[
"Vorobyev",
"Ilya",
""
]
] |
new_dataset
| 0.998924 |
1702.00956
|
Suwon Shon
|
Suwon Shon, Hanseok Ko
|
KU-ISPL Speaker Recognition Systems under Language mismatch condition
for NIST 2016 Speaker Recognition Evaluation
|
SRE16, NIST SRE 2016 system description
| null | null | null |
cs.SD cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Korea University Intelligent Signal Processing Lab. (KU-ISPL) developed
speaker recognition system for SRE16 fixed training condition. Data for
evaluation trials are collected from outside North America, spoken in Tagalog
and Cantonese while training data only is spoken English. Thus, main issue for
SRE16 is compensating the discrepancy between different languages. As
development dataset which is spoken in Cebuano and Mandarin, we could prepare
the evaluation trials through preliminary experiments to compensate the
language mismatched condition. Our team developed 4 different approaches to
extract i-vectors and applied state-of-the-art techniques as backend. To
compensate language mismatch, we investigated and endeavored unique method such
as unsupervised language clustering, inter language variability compensation
and gender/language dependent score normalization.
|
[
{
"version": "v1",
"created": "Fri, 3 Feb 2017 10:15:29 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Feb 2017 03:37:28 GMT"
}
] | 2017-02-07T00:00:00 |
[
[
"Shon",
"Suwon",
""
],
[
"Ko",
"Hanseok",
""
]
] |
new_dataset
| 0.999516 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.