id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1605.00684
|
Maria Mera Collantes
|
Maria I. Mera Collantes, Mohamed El Massad, Siddharth Garg
|
Threshold-Dependent Camouflaged Cells to Secure Circuits Against Reverse
Engineering Attacks
| null | null | null | null |
cs.CR cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With current tools and technology, someone who has physical access to a chip
can extract the detailed layout of the integrated circuit (IC). By using
advanced visual imaging techniques, reverse engineering can reveal details that
are meant to be kept secret, such as a secure protocol or novel implementation
that offers a competitive advantage. A promising solution to defend against
reverse engineering attacks is IC camouflaging. In this work, we propose a new
camouflaging technique based on the threshold voltage of the transistors. We
refer to these cells as threshold dependent camouflaged cells. Our work differs
from current commercial solutions in that the latter use look-alike cells, with
the assumption that it is difficult for the reverse engineer to identify the
cell's functionality. Yet, if a structural distinction between cells exists,
then these are still vulnerable, especially as reverse engineers use more
advanced and precise techniques. On the other hand, the proposed threshold
dependent standard cells are structurally identical regardless of the cells'
functionality. Detailed circuit simulations of our proposed threshold dependent
camouflaged cells demonstrate that they can be used to cost-effectively and
robustly camouflage large netlists. Corner analysis of process, temperature,
and supply voltage (PVT) variations show that our cells operate as expected
over all PVT corners simulated.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 20:46:04 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Collantes",
"Maria I. Mera",
""
],
[
"Massad",
"Mohamed El",
""
],
[
"Garg",
"Siddharth",
""
]
] |
new_dataset
| 0.985391 |
1605.00695
|
Sven K\"ohler
|
Christian Schindelhauer, Andreas Jakoby, Sven K\"ohler
|
Cyclone Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce Cyclone codes which are rateless erasure resilient codes. They
combine Pair codes with Luby Transform (LT) codes by computing a code symbol
from a random set of data symbols using bitwise XOR and cyclic shift
operations. The number of data symbols is chosen according to the Robust
Soliton distribution. XOR and cyclic shift operations establish a unitary
commutative ring if data symbols have a length of $p-1$ bits, for some prime
number $p$. We consider the graph given by code symbols combining two data
symbols. If $n/2$ such random pairs are given for $n$ data symbols, then a
giant component appears, which can be resolved in linear time. We can extend
Cyclone codes to data symbols of arbitrary even length, provided the Goldbach
conjecture holds.
Applying results for this giant component, it follows that Cyclone codes have
the same encoding and decoding time complexity as LT codes, while the overhead
is upper-bounded by those of LT codes. Simulations indicate that Cyclone codes
significantly decreases the overhead of extra coding symbols.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 21:42:17 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Schindelhauer",
"Christian",
""
],
[
"Jakoby",
"Andreas",
""
],
[
"Köhler",
"Sven",
""
]
] |
new_dataset
| 0.995129 |
1605.00918
|
More Swamidas Mr
|
M Swamidas, A Govardhan, D Vijayalakshmi
|
QoS Web Service Security Dynamic Intruder Detection System for HTTP SSL
services
|
6 Pages, Indexed in SCOPUS, ISI. Published in Special issue on
Computing Applications and Data Mining International Journal of Computer
Science and Information Security, Vol. 14 S1, February 2016
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web services are expected to play significant role for message communications
over internet applications. Most of the future work is web security. Online
shopping and web services are increasing at rapid rate. In this paper we
presented the fundamental concepts related to Network security, web security
threats. QoS web service security intrusion detection is important concern in
network communications and firewalls security; we discussed various issues and
challenges related to web security. The fundamental concepts network security
XML firewall, XML networks. We proposed a novel Dynamic Intruder Detection
System (DIDA) is safe guard against SSL secured transactions over message
communications in intermediate routers that enable services to sender and
receiver use Secured Session Layer protocol messages. This can be into three
stages 1. Sensor 2. Analyzer and 3.User Interface.
|
[
{
"version": "v1",
"created": "Tue, 3 May 2016 14:13:15 GMT"
}
] | 2016-05-04T00:00:00 |
[
[
"Swamidas",
"M",
""
],
[
"Govardhan",
"A",
""
],
[
"Vijayalakshmi",
"D",
""
]
] |
new_dataset
| 0.999442 |
1105.0103
|
Sariel Har-Peled
|
Sariel Har-Peled
|
A Simple Proof of the Existence of a Planar Separator
|
Now slightly simpler than previous versions
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We provide a simple proof of the existence of a planar separator by showing
that it is an easy consequence of the circle packing theorem. We also reprove
other results on separators, including:
(A) There is a simple cycle separator if the planar graph is triangulated.
Furthermore, if each face has at most $d$ edges on its boundary, then there is
a cycle separator of size O(sqrt{d n}).
(B) For a set of n balls in R^d, that are k-ply, there is a separator, in the
intersection graph of the balls, of size O(k^{1/d}n^{1-1/d}).
(C) The k nearest neighbor graph of a set of n points in R^d contains a
separator of size O(k^{1/d} n^{1-1/d}).
The new proofs are (arguably) significantly simpler than previous proofs.
|
[
{
"version": "v1",
"created": "Sat, 30 Apr 2011 17:47:56 GMT"
},
{
"version": "v2",
"created": "Tue, 31 May 2011 17:14:44 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Jun 2011 01:30:51 GMT"
},
{
"version": "v4",
"created": "Mon, 11 Jul 2011 01:02:35 GMT"
},
{
"version": "v5",
"created": "Wed, 21 Aug 2013 20:50:43 GMT"
},
{
"version": "v6",
"created": "Mon, 2 May 2016 18:07:54 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Har-Peled",
"Sariel",
""
]
] |
new_dataset
| 0.998683 |
1507.03084
|
Joel Kabor\'e
|
Jo\"el Kabor\'e and Mohammed E. Charkani
|
Constacyclic codes over F_q + u F_q + v F_q + u v F_q
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let q be a prime power and F_q be a finite field. In this paper, we study
constacyclic codes over the ring F_q+ u F_q +v F_q+ u v F_q, where u^2=u, v^2=v
and uv=vu. We characterized the generator polynomials of constacyclic codes and
their duals using some decomposition of this ring. We also define a gray map
and characterize the Gray images of self-dual cyclic codes over
F_q+uF_q+vF_q+uvF_q.
|
[
{
"version": "v1",
"created": "Sat, 11 Jul 2015 10:01:22 GMT"
},
{
"version": "v2",
"created": "Thu, 16 Jul 2015 21:06:29 GMT"
},
{
"version": "v3",
"created": "Mon, 2 May 2016 12:57:20 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Kaboré",
"Joël",
""
],
[
"Charkani",
"Mohammed E.",
""
]
] |
new_dataset
| 0.998612 |
1512.08512
|
Andrew Owens
|
Andrew Owens, Phillip Isola, Josh McDermott, Antonio Torralba, Edward
H. Adelson, William T. Freeman
|
Visually Indicated Sounds
| null | null | null | null |
cs.CV cs.LG cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Objects make distinctive sounds when they are hit or scratched. These sounds
reveal aspects of an object's material properties, as well as the actions that
produced them. In this paper, we propose the task of predicting what sound an
object makes when struck as a way of studying physical interactions within a
visual scene. We present an algorithm that synthesizes sound from silent videos
of people hitting and scratching objects with a drumstick. This algorithm uses
a recurrent neural network to predict sound features from videos and then
produces a waveform from these features with an example-based synthesis
procedure. We show that the sounds predicted by our model are realistic enough
to fool participants in a "real or fake" psychophysical experiment, and that
they convey significant information about material properties and physical
interactions.
|
[
{
"version": "v1",
"created": "Mon, 28 Dec 2015 20:56:50 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Apr 2016 03:03:04 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Owens",
"Andrew",
""
],
[
"Isola",
"Phillip",
""
],
[
"McDermott",
"Josh",
""
],
[
"Torralba",
"Antonio",
""
],
[
"Adelson",
"Edward H.",
""
],
[
"Freeman",
"William T.",
""
]
] |
new_dataset
| 0.991595 |
1603.07545
|
Pedro Roque
|
Pedro Roque and Rodrigo Ventura
|
Space CoBot: modular design of an holonomic aerial robot for indoor
microgravity environments
|
Submitted to IROS 2016. Submission was moved to an update of a
previous article. Now, it can be found at arXiv:1602.03573v2
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the design of a small aerial robot for inhabited
microgravity environments, such as orbiting space stations (e.g., ISS). In
particular, we target a fleet of robots, called Space CoBots, for collaborative
tasks with humans, such as telepresence and cooperative mobile manipulation.
The design is modular, comprising an hexrotor based propulsion system, and a
stack of modules including batteries, cameras for navigation, a screen for
telepresence, a robotic arm, space for extension modules, and a pair of docking
ports. These ports can be used for docking and for mechanically attaching two
Space CoBots together. The kinematics is holonomic, and thus the translational
and the rotational components can be fully decoupled. We employ a
multi-criteria optimization approach to determine the best geometric
configuration for maximum thrust and torque across all directions. We also
tackle the problem of motion control: we use separate converging controllers
for position and attitude control. Finally, we present simulation results using
a realistic physics simulator. These experiments include a sensitivity
evaluation to sensor noise and to unmodeled dynamics, namely a load
transportation.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2016 12:27:07 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Apr 2016 20:45:47 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Roque",
"Pedro",
""
],
[
"Ventura",
"Rodrigo",
""
]
] |
new_dataset
| 0.99867 |
1605.00284
|
Heba Abdelnasser
|
Heba Abdelnasser, Moustafa Youssef, Khaled A. Harras
|
MagBoard: Magnetic-based Ubiquitous Homomorphic Off-the-shelf Keyboard
|
Accepted for publication in SECON 2016
| null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the main methods for interacting with mobile devices today is the
error-prone and inflexible touch-screen keyboard. This paper proposes MagBoard:
a homomorphic ubiquitous keyboard for mobile devices. MagBoard allows
application developers and users to design and print different custom keyboards
for the same applications to fit different user's needs. The core idea is to
leverage the triaxial magnetometer embedded in standard mobile phones to
accurately localize the location of a magnet on a virtual grid superimposed on
the printed keyboard. This is achieved through a once in a lifetime
fingerprint. MagBoard also provides a number of modules that allow it to cope
with background magnetic noise, heterogeneous devices, different magnet shapes,
sizes, and strengths, as well as changes in magnet polarity. Our implementation
of MagBoard on Android phones with extensive evaluation in different scenarios
demonstrates that it can achieve a key detection accuracy of more than 91% for
keys as small as 2cm*2cm, reaching 100% for 4cm*4cm keys. This accuracy is
robust with different phones and magnets, highlighting MagBoard promise as a
homomorphic ubiquitous keyboard for mobile devices.
|
[
{
"version": "v1",
"created": "Sun, 1 May 2016 18:06:28 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Abdelnasser",
"Heba",
""
],
[
"Youssef",
"Moustafa",
""
],
[
"Harras",
"Khaled A.",
""
]
] |
new_dataset
| 0.973854 |
1605.00354
|
Nikolaus Correll
|
Nicholas Farrow and Yang Li and Nikolaus Correll
|
Morphological and Embedded Computation in a Self-contained Soft Robotic
Hand
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a self-contained, soft robotic hand composed of soft pneumatic
actuator modules that are equipped with strain and pressure sensing. We show
how this data can be used to discern whether a grasp was successful.
Co-locating sensing and embedded computation with the actuators greatly
simplifies control and system integration. Equipped with a small pump, the hand
is self-contained and needs only power and data supplied by a single USB
connection to a PC. We demonstrate its function by grasping a variety of
objects ranging from very small to large and heavy objects weighing more than
the hand itself. The presented system nicely illustrates the advantages of soft
robotics: low cost, low weight, and intrinsic compliance. We exploit
morphological computation to simplify control, which allows successful grasping
via underactuation. Grasping indeed relies on morphological computation at
multiple levels, ranging from the geometry of the actuator which determines the
actuator's kinematics, embedded strain sensors to measure curvature, to
maximizing contact area and applied force during grasping. Morphological
computation reaches its limitations, however, when objects are too bulky to
self-align with the gripper or when the state of grasping is of interest. We
therefore argue that efficient and reliable grasping also requires not only
intrinsic compliance, but also embedded sensing and computation. In particular,
we show how embedded sensing can be used to detect successful grasps and vary
the force exerted onto an object based on local feedback, which is not possible
using morphological computation alone.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 05:04:20 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Farrow",
"Nicholas",
""
],
[
"Li",
"Yang",
""
],
[
"Correll",
"Nikolaus",
""
]
] |
new_dataset
| 0.988248 |
1605.00362
|
Amar Ranjan Dash
|
Amar Ranjan Dash, Sandipta kumar Sahu, Sanjay Kumar Samantra
|
An optimized round robin cpu scheduling algorithm with dynamic time
quantum
|
20 pages, 7 figures, 16 Tables. arXiv admin note: text overlap with
arXiv:1511.02498
|
International Journal of Computer Science, Engineering and
Information Technology (IJCSEIT), Vol. 5,No.1, February 2015
|
10.5121/ijcseit.2015.5102
| null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
CPU scheduling is one of the most crucial operations performed by operating
system. Different algorithms are available for CPU scheduling amongst them RR
(Round Robin) is considered as optimal in time shared environment. The
effectiveness of Round Robin completely depends on the choice of time quantum.
In this paper a new CPU scheduling algorithm has been proposed, named as DABRR
(Dynamic Average Burst Round Robin). That uses dynamic time quantum instead of
static time quantum used in RR. The performance of the proposed algorithm is
experimentally compared with traditional RR and some existing variants of RR.
The results of our approach presented in this paper demonstrate improved
performance in terms of average waiting time, average turnaround time, and
context switching.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 06:24:43 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Dash",
"Amar Ranjan",
""
],
[
"Sahu",
"Sandipta kumar",
""
],
[
"Samantra",
"Sanjay Kumar",
""
]
] |
new_dataset
| 0.967198 |
1605.00398
|
Akshay Khatri
|
Akshay Khatri, Sankalp Kolhe, Nupur Giri
|
Dynamic Address Allocation Algorithm for Mobile Ad hoc Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Mobile Ad hoc network (MANET) consists of nodes which use multi-hop
communication to establish connection between nodes. Traditional infrastructure
based systems use a centralized architecture for address allocation. However,
this is not possible in Ad hoc networks due to their dynamic structure. Many
schemes have been proposed to solve this problem, but most of them use
network-wide broadcasts to ensure the availability of a new address. This
becomes extremely difficult as network size grows. In this paper, we propose an
address allocation algorithm which avoids network-wide broadcasts to allocate
address to a new node. Moreover, the algorithm allocates addresses dynamically
such that the network maintains an "IP resembles topology" state. In such a
state, routing becomes easier and the overall overhead in communication is
reduced. This algorithm is particularly useful for routing protocols which use
topology information to route messages in the network. Our solution is designed
with scalability in mind such that the cost of address assignment to a new node
is independent of the number of nodes in the network.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 09:10:44 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Khatri",
"Akshay",
""
],
[
"Kolhe",
"Sankalp",
""
],
[
"Giri",
"Nupur",
""
]
] |
new_dataset
| 0.989273 |
1605.00442
|
Marthe Bonamy
|
Marthe Bonamy and Nicolas Bousquet
|
Token Sliding on Chordal Graphs
|
21 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let I be an independent set of a graph G. Imagine that a token is located on
any vertex of I. We can now move the tokens of I along the edges of the graph
as long as the set of tokens still defines an independent set of G. Given two
independent sets I and J, the Token Sliding problem consists in deciding
whether there exists a sequence of independent sets which transforms I into J
so that every pair of consecutive independent sets of the sequence can be
obtained via a token move. This problem is known to be PSPACE-complete even on
planar graphs.
In 2014, Demaine et al. asked whether the Token Sliding reconfiguration
problem is polynomial time solvable on interval graphs and more generally in
chordal graphs. Yamada and Uehara showed in 2016 that a polynomial time
transformation can be found in proper interval graphs.
In this paper, we answer the first question of Demaine et al. and generalize
the result of Yamada and Uehara by showing that we can decide in polynomial
time whether two independent sets of an interval graph are in the same
connected component. Moveover, we answer similar questions by showing that: (i)
determining if there exists a token sliding transformation between every pair
of k-independent sets in an interval graph can be decided in polynomial time;
(ii) deciding this problem becomes co-NP-hard and even co-W[2]-hard
(parameterized by the size of the independent set) on split graphs, a sub-class
of chordal graphs.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 11:42:54 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Bonamy",
"Marthe",
""
],
[
"Bousquet",
"Nicolas",
""
]
] |
new_dataset
| 0.952757 |
1605.00459
|
Desmond Elliott
|
Desmond Elliott, Stella Frank, Khalil Sima'an, Lucia Specia
|
Multi30K: Multilingual English-German Image Descriptions
| null | null | null | null |
cs.CL cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the Multi30K dataset to stimulate multilingual multimodal
research. Recent advances in image description have been demonstrated on
English-language datasets almost exclusively, but image description should not
be limited to English. This dataset extends the Flickr30K dataset with i)
German translations created by professional translators over a subset of the
English descriptions, and ii) descriptions crowdsourced independently of the
original English descriptions. We outline how the data can be used for
multilingual image description and multimodal machine translation, but we
anticipate the data will be useful for a broader range of tasks.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 12:38:03 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Elliott",
"Desmond",
""
],
[
"Frank",
"Stella",
""
],
[
"Sima'an",
"Khalil",
""
],
[
"Specia",
"Lucia",
""
]
] |
new_dataset
| 0.999847 |
1605.00475
|
Yuchao Dai Dr.
|
Yuchao Dai, Hongdong Li and Laurent Kneip
|
Rolling Shutter Camera Relative Pose: Generalized Epipolar Geometry
|
Accepted by CVPR 2016, this is an extended version
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The vast majority of modern consumer-grade cameras employ a rolling shutter
mechanism. In dynamic geometric computer vision applications such as visual
SLAM, the so-called rolling shutter effect therefore needs to be properly taken
into account. A dedicated relative pose solver appears to be the first problem
to solve, as it is of eminent importance to bootstrap any derivation of
multi-view geometry. However, despite its significance, it has received
inadequate attention to date.
This paper presents a detailed investigation of the geometry of the rolling
shutter relative pose problem. We introduce the rolling shutter essential
matrix, and establish its link to existing models such as the push-broom
cameras, summarized in a clean hierarchy of multi-perspective cameras. The
generalization of well-established concepts from epipolar geometry is completed
by a definition of the Sampson distance in the rolling shutter case. The work
is concluded with a careful investigation of the introduced epipolar geometry
for rolling shutter cameras on several dedicated benchmarks.
|
[
{
"version": "v1",
"created": "Mon, 2 May 2016 13:31:02 GMT"
}
] | 2016-05-03T00:00:00 |
[
[
"Dai",
"Yuchao",
""
],
[
"Li",
"Hongdong",
""
],
[
"Kneip",
"Laurent",
""
]
] |
new_dataset
| 0.967821 |
1604.08693
|
Nurassyl Kerimbayev
|
N. Kerimbayev, J. Kultan, S. Abdykarimova and A. Akramova
|
LMS Moodle: Distance international education in cooperation of higher
education institutions of different countries
|
9 pages, 9 figures
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The development of international cooperation requires cooperation in the
sphere of education. An enhanced sharing of experience in the sphere of
practical teaching activities implies the increase of the quality of teaching
process and of scientific cooperation. Sharing of experience in educational
activities implies understanding among representatives of different nations
anywhere in the world. It means that through LSM teaching the principle of
social constructivism is realized, when participants together create a narrow
culture of common objects and senses. The article presents an example of
practical application of electronic media to the process of a real lesson. The
article describes the process of teaching students from different countries
using the system of LMS MOODLE, beginning with preparing study materials,
giving lectures by foreign lecturers, practical tasks and ending with passing
an examination. Training has included some full-time students from the Slovak
Republic, the Republic of Dagestan and the Republic of Kazakhstan, and has been
realized by applying the method of distance learning (LMS).
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2016 05:32:44 GMT"
}
] | 2016-05-02T00:00:00 |
[
[
"Kerimbayev",
"N.",
""
],
[
"Kultan",
"J.",
""
],
[
"Abdykarimova",
"S.",
""
],
[
"Akramova",
"A.",
""
]
] |
new_dataset
| 0.995512 |
1604.08866
|
Jean-Paul Laumond
|
Jean-Paul Laumond (CNRS, LAAS-GEPETTO)
|
Grasping versus Knitting: a Geometric Perspective
|
in Physics of Life Reviews, Elsevier, 2016
| null |
10.1016/j.plrev.2016.04.003
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grasping an object is a matter of first moving a prehensile organ at some
position in the world, and then managing the contact relationship between the
prehensile organ and the object. Once the contact relationship has been
established and made stable, the object is part of the body and it can move in
the world. As any action, the action of grasping is ontologically anchored in
the physical space while the correlative movement originates in the space of
the body. Evolution has found amazing solutions that allow organisms to rapidly
and efficiently manage the relationship between their body and the world. It is
then natural that roboticists consider taking inspiration of these natural
solutions, while contributing to better understand their origin.
|
[
{
"version": "v1",
"created": "Thu, 28 Apr 2016 12:17:45 GMT"
}
] | 2016-05-02T00:00:00 |
[
[
"Laumond",
"Jean-Paul",
"",
"CNRS, LAAS-GEPETTO"
]
] |
new_dataset
| 0.977817 |
1604.08926
|
Mingyu Li
|
Mingyu Li, Jiajun Shi, Mostafizur Rahman, Santosh Khasanvis, Sachin
Bhat, Csaba Andras Moritz
|
Skybridge-3D-CMOS: A Vertically-Composed Fine-Grained 3D CMOS Integrated
Circuit Technology
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Parallel and monolithic 3D integration directions offer pathways to realize
3D integrated circuits (ICs) but still lead to layer-by-layer implementations,
each functional layer being composed in 2D first. This mindset causes
challenging connectivity, routing and layer alignment between layers when
connected in 3D, with a routing access that can be even worse than 2D CMOS,
which fundamentally limits their potential. To fully exploit the opportunities
in the third dimension, we propose Skybridge-3D-CMOS (S3DC), a fine-grained 3D
integration approach that is directly composed in 3D, utilizing the vertical
dimension vs. using a layer-by-layer assembly mindset. S3DC uses a novel wafer
fabric creation with direct 3D design and connectivity in the vertical
dimension. It builds on a uniform vertical nanowire template that is processed
as a single wafer; it incorporates specifically architected structures for
realizing devices, circuits, and heat management directly in 3D. Novel 3D
interconnect concepts, including within the silicon layers, enable
significantly improved routing flexibility in all three dimensions and a
high-density 3D design paradigm overall. Intrinsic components for fabric-level
3D heat management are introduced. Extensive bottom-up simulations and
experiments have been presented to validate the key fabric-enabling concepts.
Evaluation results indicate up to 40x density and 10x performance-per-watt
benefits against conventional 16-nm CMOS for the circuits studied; benefits are
also at least an order of magnitude beyond what was shown to be possible with
other 3D directions.
|
[
{
"version": "v1",
"created": "Fri, 29 Apr 2016 18:08:47 GMT"
}
] | 2016-05-02T00:00:00 |
[
[
"Li",
"Mingyu",
""
],
[
"Shi",
"Jiajun",
""
],
[
"Rahman",
"Mostafizur",
""
],
[
"Khasanvis",
"Santosh",
""
],
[
"Bhat",
"Sachin",
""
],
[
"Moritz",
"Csaba Andras",
""
]
] |
new_dataset
| 0.999804 |
1511.06783
|
Katsunori Ohnishi
|
Katsunori Ohnishi, Atsushi Kanehira, Asako Kanezaki, Tatsuya Harada
|
Recognizing Activities of Daily Living with a Wrist-mounted Camera
|
CVPR2016 spotlight presentation
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel dataset and a novel algorithm for recognizing activities
of daily living (ADL) from a first-person wearable camera. Handled objects are
crucially important for egocentric ADL recognition. For specific examination of
objects related to users' actions separately from other objects in an
environment, many previous works have addressed the detection of handled
objects in images captured from head-mounted and chest-mounted cameras.
Nevertheless, detecting handled objects is not always easy because they tend to
appear small in images. They can be occluded by a user's body. As described
herein, we mount a camera on a user's wrist. A wrist-mounted camera can capture
handled objects at a large scale, and thus it enables us to skip object
detection process. To compare a wrist-mounted camera and a head-mounted camera,
we also develop a novel and publicly available dataset that includes videos and
annotations of daily activities captured simultaneously by both cameras.
Additionally, we propose a discriminative video representation that retains
spatial and temporal information after encoding frame descriptors extracted by
Convolutional Neural Networks (CNN).
|
[
{
"version": "v1",
"created": "Fri, 20 Nov 2015 22:02:09 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Apr 2016 04:39:03 GMT"
}
] | 2016-04-29T00:00:00 |
[
[
"Ohnishi",
"Katsunori",
""
],
[
"Kanehira",
"Atsushi",
""
],
[
"Kanezaki",
"Asako",
""
],
[
"Harada",
"Tatsuya",
""
]
] |
new_dataset
| 0.999416 |
1604.05557
|
Pascal Faudemay
|
Pascal Faudemay
|
AGI and Reflexivity
|
submitted to ECAI-2016
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define a property of intelligent systems, which we call Reflexivity. In
human beings, it is one aspect of consciousness, and an element of
deliberation. We propose a conjecture, that this property is conditioned by a
topological property of the processes which implement this reflexivity. These
processes may be symbolic, or non symbolic e.g. connexionnist. An architecture
which implements reflexivity may be based on the interaction of one or several
modules of deep learning, which may be specialized or not, and interconnected
in a relevant way. A necessary condition of reflexivity is the existence of
recurrence in its processes, we will examine in which cases this condition may
be sufficient. We will then examine how this topology and this property make
possible the expression of a second property, the deliberation. In a final
paragraph, we propose an evaluation of intelligent systems, based on the
fulfillment of all or some of these properties.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2016 19:39:54 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Apr 2016 18:48:02 GMT"
},
{
"version": "v3",
"created": "Thu, 28 Apr 2016 18:49:12 GMT"
}
] | 2016-04-29T00:00:00 |
[
[
"Faudemay",
"Pascal",
""
]
] |
new_dataset
| 0.969899 |
1604.08235
|
Nguyen Phong Hoang
|
Nguyen Phong Hoang, Yasuhito Asano, Masatoshi Yoshikawa
|
Your Neighbors Are My Spies: Location and other Privacy Concerns in
GLBT-focused Location-based Dating Applications
|
This work is a follow-up to arXiv:1604.07850, and is being submitted
to the ICACT Transactions on Advanced Communications Technology, thus not a
final version of this study
| null |
10.13140/RG.2.1.3584.8081
| null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Trilateration is one of the well-known threat models to the user's location
privacy in location-based apps, especially those contain highly sensitive
information such as dating apps. The threat model mainly bases on the publicly
shown distance from a targeted victim to the adversary to pinpoint the victim's
location. As a countermeasure, most of location-based apps have already
implemented the 'hide distance' function, or added noise to the publicly shown
distance in order to protect their user's location privacy. The effectiveness
of such approaches however is still questionable.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 04:31:16 GMT"
}
] | 2016-04-29T00:00:00 |
[
[
"Hoang",
"Nguyen Phong",
""
],
[
"Asano",
"Yasuhito",
""
],
[
"Yoshikawa",
"Masatoshi",
""
]
] |
new_dataset
| 0.998467 |
1604.08245
|
Muhammad Fahad Khan
|
Saira Beg, M. Fahad Khan, Faisal Baig
|
Text writing in the air
|
19 pages, 19 figures,2 tables. see
http://www.tandfonline.com/doi/abs/10.1080/15980316.2013.860928?journalCode=tjid20
| null |
10.1080/15980316.2013.860928
| null |
cs.MM
|
http://creativecommons.org/licenses/by/4.0/
|
This paper presents a real time video based pointing method which allows
sketching and writing of English text over air in front of mobile camera.
Proposed method have two main tasks: first it track the colored finger tip in
the video frames and then apply English OCR over plotted images in order to
recognize the written characters. Moreover, proposed method provides a natural
human-system interaction in such way that it do not require keypad, stylus, pen
or glove etc for character input. For the experiments, we have developed an
application using OpenCv with JAVA language. We tested the proposed method on
Samsung Galaxy3 android mobile. Results show that proposed algorithm gains the
average accuracy of 92.083% when tested for different shaped alphabets. Here,
more than 3000 different Magnetic 3D shaped characters were used [Ref:
http://learnrnd.com/news.php?id=Magnetic_3D_Bio_Printing]. Our proposed system
is the software based approach and relevantly very simple, fast and easy. It
does not require sensors or any hardware rather than camera and red tape.
Moreover, proposed methodology can be applicable for all disconnected languages
but having one issue that it is color sensitive in such a way that existence of
any red color in the background before starting the character writing can lead
to false results.
|
[
{
"version": "v1",
"created": "Wed, 27 Apr 2016 21:11:22 GMT"
}
] | 2016-04-29T00:00:00 |
[
[
"Beg",
"Saira",
""
],
[
"Khan",
"M. Fahad",
""
],
[
"Baig",
"Faisal",
""
]
] |
new_dataset
| 0.995722 |
1603.07054
|
Dangwei Li
|
Dangwei Li, Zhang Zhang, Xiaotang Chen, Haibin Ling, Kaiqi Huang
|
A Richly Annotated Dataset for Pedestrian Attribute Recognition
|
16 pages, 8 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we aim to improve the dataset foundation for pedestrian
attribute recognition in real surveillance scenarios. Recognition of human
attributes, such as gender, and clothes types, has great prospects in real
applications. However, the development of suitable benchmark datasets for
attribute recognition remains lagged behind. Existing human attribute datasets
are collected from various sources or an integration of pedestrian
re-identification datasets. Such heterogeneous collection poses a big challenge
on developing high quality fine-grained attribute recognition algorithms.
Furthermore, human attribute recognition are generally severely affected by
environmental or contextual factors, such as viewpoints, occlusions and body
parts, while existing attribute datasets barely care about them. To tackle
these problems, we build a Richly Annotated Pedestrian (RAP) dataset from real
multi-camera surveillance scenarios with long term collection, where data
samples are annotated with not only fine-grained human attributes but also
environmental and contextual factors. RAP has in total 41,585 pedestrian
samples, each of which is annotated with 72 attributes as well as viewpoints,
occlusions, body parts information. To our knowledge, the RAP dataset is the
largest pedestrian attribute dataset, which is expected to greatly promote the
study of large-scale attribute recognition systems. Furthermore, we empirically
analyze the effects of different environmental and contextual factors on
pedestrian attribute recognition. Experimental results demonstrate that
viewpoints, occlusions and body parts information could assist attribute
recognition a lot in real applications.
|
[
{
"version": "v1",
"created": "Wed, 23 Mar 2016 02:41:59 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Mar 2016 02:54:02 GMT"
},
{
"version": "v3",
"created": "Wed, 27 Apr 2016 06:42:25 GMT"
}
] | 2016-04-28T00:00:00 |
[
[
"Li",
"Dangwei",
""
],
[
"Zhang",
"Zhang",
""
],
[
"Chen",
"Xiaotang",
""
],
[
"Ling",
"Haibin",
""
],
[
"Huang",
"Kaiqi",
""
]
] |
new_dataset
| 0.999415 |
1604.07850
|
Nguyen Phong Hoang
|
Nguyen Phong Hoang, Yasuhito Asano, Masatoshi Yoshikawa
|
Your Neighbors Are My Spies: Location and other Privacy Concerns in
Dating Apps
|
The 18th IEEE International Conference on Advanced Communication
Technology (ICACT 2016)
| null |
10.1109/ICACT.2016.7423532
| null |
cs.CY cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Trilateration has recently become one of the well-known threat models to the
user's location privacy in location-based applications (aka: location-based
services or LBS), especially those containing highly sensitive information such
as dating applications. The threat model mainly depends on the distance shown
from the targeted victim to the adversary to pinpoint the victim's position. As
a countermeasure, most of location-based applications have already implemented
the "hide distance" function to protect their user's location privacy. The
effectiveness of such approaches however is still questionable. Therefore, in
this paper, we first investigate how popular location-based dating applications
are currently protecting their user's privacy by testing the two most popular
GLBT-focused applications: Jack'd and Grindr.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 05:00:49 GMT"
}
] | 2016-04-28T00:00:00 |
[
[
"Hoang",
"Nguyen Phong",
""
],
[
"Asano",
"Yasuhito",
""
],
[
"Yoshikawa",
"Masatoshi",
""
]
] |
new_dataset
| 0.994594 |
1604.07863
|
Joe Gildea
|
Steven T. Dougherty, Joe Gildea, Rhian Taylor and Alexander Tylyshchak
|
Constructions of Self-Dual and Formally Self-Dual Codes from Group Rings
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give constructions of self-dual and formally self-dual codes from group
rings where the ring is a finite commutative Frobenius ring. We improve the
existing construction given in \cite{Hurley1} by showing that one of the
conditions given in the theorem is unnecessary and moreover it restricts the
number of self-dual codes obtained by the construction. We show that several of
the standard constructions of self-dual codes are found within our general
framework. We prove that our constructed codes correspond to ideals in the
group ring $RG$ and as such must have an automorphism group that contains $G$
as a subgroup. We also prove that a common construction technique for producing
self-dual codes cannot produce the putative $[72,36,16]$ Type~II code.
Additionally, we show precisely which groups can be used to construct the
extremal Type II codes over length 24 and 48.
|
[
{
"version": "v1",
"created": "Tue, 26 Apr 2016 21:35:24 GMT"
}
] | 2016-04-28T00:00:00 |
[
[
"Dougherty",
"Steven T.",
""
],
[
"Gildea",
"Joe",
""
],
[
"Taylor",
"Rhian",
""
],
[
"Tylyshchak",
"Alexander",
""
]
] |
new_dataset
| 0.998314 |
1604.08058
|
Martin Suda
|
Olaf Beyersdorff, Leroy Chew, Renate Schmidt, Martin Suda
|
Lifting QBF Resolution Calculi to DQBF
|
SAT 2016
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We examine the existing Resolution systems for quantified Boolean formulas
(QBF) and answer the question which of these calculi can be lifted to the more
powerful Dependency QBFs (DQBF). An interesting picture emerges: While for QBF
we have the strict chain of proof systems Q-Resolution < IR-calc < IRM-calc,
the situation is quite different in DQBF. Q-Resolution and likewise universal
Resolution are too weak: they are not complete. IR-calc has the right strength:
it is sound and complete. IRM-calc is too strong: it is not sound any more, and
the same applies to long-distance Resolution. Conceptually, we use the relation
of DQBF to EPR and explain our new DQBF calculus based on IR-calc as a
subsystem of FO-Resolution.
|
[
{
"version": "v1",
"created": "Wed, 27 Apr 2016 13:27:53 GMT"
}
] | 2016-04-28T00:00:00 |
[
[
"Beyersdorff",
"Olaf",
""
],
[
"Chew",
"Leroy",
""
],
[
"Schmidt",
"Renate",
""
],
[
"Suda",
"Martin",
""
]
] |
new_dataset
| 0.997479 |
1604.08161
|
Michel Raynal
|
Achour Mosteafoui, Matoula Petrolia, Michel Raynal, and Claude Jard
|
Atomic Read/Write Memory in Signature-free Byzantine Asynchronous
Message-passing Systems
|
12 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents a signature-free distributed algorithm which builds an
atomic read/write shared memory on top of an $n$-process asynchronous
message-passing system in which up to $t<n/3$ processes may commit Byzantine
failures. From a conceptual point of view, this algorithm is designed to be as
close as possible to the algorithm proposed by Attiya, Bar-Noy and Dolev (JACM
1995), which builds an atomic register in an $n$-process asynchronous
message-passing system where up to $t<n/2$ processes may crash. The proposed
algorithm is particularly simple. It does not use cryptography to cope with
Byzantine processes, and is optimal from a $t$-resilience point of view
($t<n/3$). A read operation requires $O(n)$ messages, and a write operation
requires $O(n^2)$ messages.
|
[
{
"version": "v1",
"created": "Mon, 7 Dec 2015 08:53:28 GMT"
}
] | 2016-04-28T00:00:00 |
[
[
"Mosteafoui",
"Achour",
""
],
[
"Petrolia",
"Matoula",
""
],
[
"Raynal",
"Michel",
""
],
[
"Jard",
"Claude",
""
]
] |
new_dataset
| 0.999443 |
1604.08164
|
Edgar Simo-Serra
|
Edgar Simo-Serra
|
Understanding Human-Centric Images: From Geometry to Fashion
|
PhD Thesis, May 2015. BarcelonaTech. 169 pages
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Understanding humans from photographs has always been a fundamental goal of
computer vision. In this thesis we have developed a hierarchy of tools that
cover a wide range of topics with the objective of understanding humans from
monocular RGB image: from low level feature point descriptors to high level
fashion-aware conditional random fields models. In order to build these high
level models it is paramount to have a battery of robust and reliable low and
mid level cues. Along these lines, we have proposed two low-level keypoint
descriptors: one based on the theory of the heat diffusion on images, and the
other that uses a convolutional neural network to learn discriminative image
patch representations. We also introduce distinct low-level generative models
for representing human pose: in particular we present a discrete model based on
a directed acyclic graph and a continuous model that consists of poses
clustered on a Riemannian manifold. As mid level cues we propose two 3D human
pose estimation algorithms: one that estimates the 3D pose given a noisy 2D
estimation, and an approach that simultaneously estimates both the 2D and 3D
pose. Finally, we formulate higher level models built upon low and mid level
cues for understanding humans from single images. Concretely, we focus on two
different tasks in the context of fashion: semantic segmentation of clothing,
and predicting the fashionability from images with metadata to ultimately
provide fashion advice to the user. For all presented approaches we present
extensive results and comparisons against the state-of-the-art and show
significant improvements on the entire variety of tasks we tackle.
|
[
{
"version": "v1",
"created": "Mon, 14 Dec 2015 03:15:14 GMT"
}
] | 2016-04-28T00:00:00 |
[
[
"Simo-Serra",
"Edgar",
""
]
] |
new_dataset
| 0.99666 |
1402.0599
|
Duo Han
|
Duo Han, Yilin Mo, Junfeng Wu, Sean Weerakkody, Bruno Sinopoli, Ling
Shi
|
Stochastic Event-triggered Sensor Schedule for Remote State Estimation
| null |
IEEE Trans. Autom. Control, pp. 2661 - 2675, vol 60, issue 10,
2015
|
10.1109/TAC.2015.2406975
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an open-loop and a closed-loop stochastic event-triggered sensor
schedule for remote state estimation. Both schedules overcome the essential
difficulties of existing schedules in recent literature works where, through
introducing a deterministic event-triggering mechanism, the Gaussian property
of the innovation process is destroyed which produces a challenging nonlinear
filtering problem that cannot be solved unless approximation techniques are
adopted. The proposed stochastic event-triggered sensor schedules eliminate
such approximations. Under these two schedules, the MMSE estimator and its
estimation error covariance matrix at the remote estimator are given in a
closed-form. Simulation studies demonstrate that the proposed schedules have
better performance than periodic ones with the same sensor-to-estimator
communication rate.
|
[
{
"version": "v1",
"created": "Tue, 4 Feb 2014 02:54:23 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Han",
"Duo",
""
],
[
"Mo",
"Yilin",
""
],
[
"Wu",
"Junfeng",
""
],
[
"Weerakkody",
"Sean",
""
],
[
"Sinopoli",
"Bruno",
""
],
[
"Shi",
"Ling",
""
]
] |
new_dataset
| 0.963904 |
1404.5813
|
Dmitry N. Kozlov
|
Dmitry N. Kozlov
|
Topology of the immediate snapshot complexes
|
final version as it appears in Topology and it Applications, Article
number 5275. note: this paper is a full version of the second half of the
previous research announcement, which was posted as arXiv:1402.4707
|
Topology Appl. 178 (2014), 160-184
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The immediate snapshot complexes were introduced as combinatorial models for
the protocol complexes in the context of theoretical distributed computing. In
the previous work we have developed a formal language of witness structures in
order to define and to analyze these complexes.
In this paper, we study topology of immediate snapshot complexes. It was
known that these complexes are always pure and that they are pseudomanifolds.
Here we prove two further independent topological properties. First, we show
that immediate snapshot complexes are collapsible. Second, we show that these
complexes are homeomorphic to closed balls. Specifically, given any immediate
snapshot complex $P(\tr)$, we show that there exists a homeomorphism
$\varphi:\da^{|\supp\tr|-1}\ra P(\tr)$, such that $\varphi(\sigma)$ is a
subcomplex of $P(\tr)$, whenever $\sigma$ is a simplex in the simplicial
complex $\da^{|\supp\tr|-1}$.
|
[
{
"version": "v1",
"created": "Wed, 23 Apr 2014 13:05:14 GMT"
},
{
"version": "v2",
"created": "Mon, 12 May 2014 12:52:28 GMT"
},
{
"version": "v3",
"created": "Mon, 24 Nov 2014 10:01:10 GMT"
},
{
"version": "v4",
"created": "Tue, 26 Apr 2016 11:53:44 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Kozlov",
"Dmitry N.",
""
]
] |
new_dataset
| 0.987452 |
1503.01817
|
Bart Thomee
|
Bart Thomee and David A. Shamma and Gerald Friedland and Benjamin
Elizalde and Karl Ni and Douglas Poland and Damian Borth and Li-Jia Li
|
YFCC100M: The New Data in Multimedia Research
| null |
Communications of the ACM, 59(2), pp. 64-73, 2016
|
10.1145/2812802
| null |
cs.MM cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the Yahoo Flickr Creative Commons 100 Million Dataset (YFCC100M),
the largest public multimedia collection that has ever been released. The
dataset contains a total of 100 million media objects, of which approximately
99.2 million are photos and 0.8 million are videos, all of which carry a
Creative Commons license. Each media object in the dataset is represented by
several pieces of metadata, e.g. Flickr identifier, owner name, camera, title,
tags, geo, media source. The collection provides a comprehensive snapshot of
how photos and videos were taken, described, and shared over the years, from
the inception of Flickr in 2004 until early 2014. In this article we explain
the rationale behind its creation, as well as the implications the dataset has
for science, research, engineering, and development. We further present several
new challenges in multimedia research that can now be expanded upon with our
dataset.
|
[
{
"version": "v1",
"created": "Thu, 5 Mar 2015 23:43:42 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Apr 2016 20:10:14 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Thomee",
"Bart",
""
],
[
"Shamma",
"David A.",
""
],
[
"Friedland",
"Gerald",
""
],
[
"Elizalde",
"Benjamin",
""
],
[
"Ni",
"Karl",
""
],
[
"Poland",
"Douglas",
""
],
[
"Borth",
"Damian",
""
],
[
"Li",
"Li-Jia",
""
]
] |
new_dataset
| 0.999871 |
1504.04263
|
David Benton Dr
|
David M. Benton
|
Concurrent codes: A holographic-type encoding robust against noise and
loss
| null | null |
10.1371/journal.pone.0150280
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Concurrent coding is an encoding scheme with "holographic" type properties
that are shown here to be robust against a significant amount of noise and
signal loss. This single encoding scheme is able to correct for random errors
and burst errors simultaneously, but does not rely on cyclic codes. A simple
and practical scheme has been tested that displays perfect decoding when the
signal to noise ratio is of order -18dB. The same scheme also displays perfect
reconstruction when a contiguous block of 40% of the transmission is missing.
In addition this scheme is 50% more efficient in terms of transmitted power
requirements than equivalent cyclic codes. A simple model is presented that
describes the process of decoding and can determine the computational load that
would be expected, as well as describing the critical levels of noise and
missing data at which false messages begin to be generated.
|
[
{
"version": "v1",
"created": "Thu, 16 Apr 2015 15:04:27 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Sep 2015 15:42:22 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Benton",
"David M.",
""
]
] |
new_dataset
| 0.99967 |
1505.07909
|
Bin Gao
|
Huazheng Wang, Fei Tian, Bin Gao, Jiang Bian, Tie-Yan Liu
|
Solving Verbal Comprehension Questions in IQ Test by Knowledge-Powered
Word Embedding
| null | null | null | null |
cs.CL cs.IR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intelligence Quotient (IQ) Test is a set of standardized questions designed
to evaluate human intelligence. Verbal comprehension questions appear very
frequently in IQ tests, which measure human's verbal ability including the
understanding of the words with multiple senses, the synonyms and antonyms, and
the analogies among words. In this work, we explore whether such tests can be
solved automatically by artificial intelligence technologies, especially the
deep learning technologies that are recently developed and successfully applied
in a number of fields. However, we found that the task was quite challenging,
and simply applying existing technologies (e.g., word embedding) could not
achieve a good performance, mainly due to the multiple senses of words and the
complex relations among words. To tackle these challenges, we propose a novel
framework consisting of three components. First, we build a classifier to
recognize the specific type of a verbal question (e.g., analogy,
classification, synonym, or antonym). Second, we obtain distributed
representations of words and relations by leveraging a novel word embedding
method that considers the multi-sense nature of words and the relational
knowledge among words (or their senses) contained in dictionaries. Third, for
each type of questions, we propose a specific solver based on the obtained
distributed word representations and relation representations. Experimental
results have shown that the proposed framework can not only outperform existing
methods for solving verbal comprehension questions but also exceed the average
performance of the Amazon Mechanical Turk workers involved in the study. The
results indicate that with appropriate uses of the deep learning technologies
we might be a further step closer to the human intelligence.
|
[
{
"version": "v1",
"created": "Fri, 29 May 2015 02:46:44 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Jun 2015 13:29:41 GMT"
},
{
"version": "v3",
"created": "Mon, 6 Jul 2015 08:42:22 GMT"
},
{
"version": "v4",
"created": "Tue, 26 Apr 2016 11:37:32 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Wang",
"Huazheng",
""
],
[
"Tian",
"Fei",
""
],
[
"Gao",
"Bin",
""
],
[
"Bian",
"Jiang",
""
],
[
"Liu",
"Tie-Yan",
""
]
] |
new_dataset
| 0.985393 |
1603.07236
|
Dan Stowell
|
Dan Stowell, Veronica Morfi, Lisa F. Gill
|
Individual identity in songbirds: signal representations and metric
learning for locating the information in complex corvid calls
| null | null | null | null |
cs.SD
|
http://creativecommons.org/licenses/by/4.0/
|
Bird calls range from simple tones to rich dynamic multi-harmonic structures.
The more complex calls are very poorly understood at present, such as those of
the scientifically important corvid family (jackdaws, crows, ravens, etc.).
Individual birds can recognise familiar individuals from calls, but where in
the signal is this identity encoded? We studied the question by applying a
combination of feature representations to a dataset of jackdaw calls, including
linear predictive coding (LPC) and adaptive discrete Fourier transform (aDFT).
We demonstrate through a classification paradigm that we can strongly
outperform a standard spectrogram representation for identifying individuals,
and we apply metric learning to determine which time-frequency regions
contribute most strongly to robust individual identification. Computational
methods can help to direct our search for understanding of these complex
biological signals.
|
[
{
"version": "v1",
"created": "Wed, 23 Mar 2016 15:29:39 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Apr 2016 16:32:24 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Stowell",
"Dan",
""
],
[
"Morfi",
"Veronica",
""
],
[
"Gill",
"Lisa F.",
""
]
] |
new_dataset
| 0.998998 |
1604.07103
|
Yu Wang
|
Yu Wang, Yuncheng Li, Quanzeng You, Xiyang Zhang, Richard Niemi, Jiebo
Luo
|
Voting with Feet: Who are Leaving Hillary Clinton and Donald Trump?
|
4 pages, 8 figures, under review
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
From a crowded field with 17 candidates, Hillary Clinton and Donald Trump
have emerged as the two front-runners in the 2016 U.S. presidential campaign.
The two candidates each boast more than 5 million followers on Twitter, and at
the same time both have witnessed hundreds of thousands of people leave their
camps. In this paper we attempt to characterize individuals who have left
Hillary Clinton and Donald Trump between September 2015 and March 2016.
Our study focuses on three dimensions of social demographics: social capital,
gender, and age. Within each camp, we compare the characteristics of the
current followers with former followers, i.e., individuals who have left since
September 2015. We use the number of followers to measure social capital, and
profile images to infer gender and age. For classifying gender, we train a
convolutional neural network (CNN). For age, we use the Face++ API.
Our study shows that for both candidates followers with more social capital
are more likely to leave (or switch camps). For both candidates females make up
a larger presence among unfollowers than among current followers. Somewhat
surprisingly, the effect is particularly pronounced for Clinton. Lastly,
middle-aged individuals are more likely to leave Trump, and the young are more
likely to leave Hillary Clinton.
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2016 01:06:22 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Apr 2016 03:58:22 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Wang",
"Yu",
""
],
[
"Li",
"Yuncheng",
""
],
[
"You",
"Quanzeng",
""
],
[
"Zhang",
"Xiyang",
""
],
[
"Niemi",
"Richard",
""
],
[
"Luo",
"Jiebo",
""
]
] |
new_dataset
| 0.994428 |
1604.07660
|
Haluk O. Bingol
|
Dogukan Erenel and Haluk O. Bingol
|
An Accelerometer Based Calculator for Visually Impaired People Using
Mobile Devices
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent trend of touch-screen devices produces an accessibility barrier for
visually impaired people. On the other hand, these devices come with sensors
such as accelerometer. This calls for new approaches to human computer
interface (HCI). In this study, our aim is to find an alternative approach to
classify 20 different hand gestures captured by iPhone 3GS's built-in
accelerometer and make high accuracy on user-independent classifications using
Dynamic Time Warping (DTW) with dynamic warping window sizes. 20 gestures with
1,100 gesture data are collected from 15 normal-visioned people. This data set
is used for training. Experiment-1 based on this data set produced an accuracy
rate of 96.7~\%. In order for visually impaired people to use the system, a
gesture recognition based "talking" calculator is implemented. In Experiment-2,
4 visually impaired end-users used the calculator and obtained 95.5~\% accuracy
rate among 17 gestures with 720 gesture data totally. Contributions of the
techniques to the end result is also investigated. Dynamic warping window size
is found to be the most effective one. The data and the code is available.
|
[
{
"version": "v1",
"created": "Tue, 26 Apr 2016 12:55:28 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Erenel",
"Dogukan",
""
],
[
"Bingol",
"Haluk O.",
""
]
] |
new_dataset
| 0.981955 |
1604.07803
|
Orestis Liolis
|
Vicky S. Kalogeiton, Dim P. Papadopoulos, Orestis Liolis, Vassilios A.
Mardiris, Georgios Ch. Sirakoulis and Ioannis G. Karafyllidis
|
Programmable Crossbar Quantum-dot Cellular Automata Circuits
| null | null | null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum-dot fabrication and characterization is a well-established
technology, which is used in photonics, quantum optics and nanoelectronics.
Four quantum-dots placed at the corners of a square form a unit cell, which can
hold a bit of information and serve as a basis for Quantum-dot Cellular
Automata (QCA) nanoelectronic circuits. Although several basic QCA circuits
have been designed, fabricated and tested, proving that quantum-dots can form
functional, fast and low-power nanoelectornic circuits, QCA nanoelectronics
still remain at its infancy. One of the reasons for this is the lack of design
automation tools, which will facilitate the systematic design of large QCA
circuits that contemporary applications demand. Here we present novel,
programmable QCA circuits, which are based on crossbar architecture. These
circuits can be programmed to implement any Boolean function in analogy to CMOS
FPGAs and open the road that will lead to full design automation of QCA
nanoelectronic circuits. Using this architecture we designed and simulated QCA
circuits that proved to be area efficient, stable and reliable.
|
[
{
"version": "v1",
"created": "Tue, 26 Apr 2016 19:17:37 GMT"
}
] | 2016-04-27T00:00:00 |
[
[
"Kalogeiton",
"Vicky S.",
""
],
[
"Papadopoulos",
"Dim P.",
""
],
[
"Liolis",
"Orestis",
""
],
[
"Mardiris",
"Vassilios A.",
""
],
[
"Sirakoulis",
"Georgios Ch.",
""
],
[
"Karafyllidis",
"Ioannis G.",
""
]
] |
new_dataset
| 0.999713 |
1505.01410
|
Philipp Kindermann
|
Philipp Kindermann and Andr\'e Schulz and Joachim Spoerhase and
Alexander Wolff
|
On Monotone Drawings of Trees
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A crossing-free straight-line drawing of a graph is monotone if there is a
monotone path between any pair of vertices with respect to some direction. We
show how to construct a monotone drawing of a tree with $n$ vertices on an
$O(n^{1.5}) \times O(n^{1.5})$ grid whose angles are close to the best possible
angular resolution. Our drawings are convex, that is, if every edge to a leaf
is substituted by a ray, the (unbounded) faces form convex regions. It is known
that convex drawings are monotone and, in the case of trees, also
crossing-free.
A monotone drawing is strongly monotone if, for every pair of vertices, the
direction that witnesses the monotonicity comes from the vector that connects
the two vertices. We show that every tree admits a strongly monotone drawing.
For biconnected outerplanar graphs, this is easy to see. On the other hand, we
present a simply-connected graph that does not have a strongly monotone drawing
in any embedding.
|
[
{
"version": "v1",
"created": "Wed, 6 May 2015 15:54:32 GMT"
},
{
"version": "v2",
"created": "Sun, 24 Apr 2016 12:54:01 GMT"
}
] | 2016-04-26T00:00:00 |
[
[
"Kindermann",
"Philipp",
""
],
[
"Schulz",
"André",
""
],
[
"Spoerhase",
"Joachim",
""
],
[
"Wolff",
"Alexander",
""
]
] |
new_dataset
| 0.998335 |
1602.06832
|
Mehmet Bask{\i}n
|
Mehmet Bask{\i}n and Kemal Leblebicio\u{g}lu
|
Robust stabilization loop design for gimbaled electro-optical imaging
system
|
13 pages, 9 figures
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For electro-optical imaging systems, line-of-sight stabilization against
different disturbances created by mobile platforms is crucial property. The
development of high resolution sensors and the demand in increased operating
distances have recently increased the expectations from stabilization loops.
For that reason, higher gains and larger bandwidths become necessary. As the
stabilization loop satisfies these requirements for good disturbance
attenuation, it must also satisfy sufficient loop stability. In gimbaled
imaging systems, the main difficulties in satisfying sufficient loop stability
are structural resonances and model uncertainties. Therefore, satisfying high
stabilization performance in the presence of model uncertainties or modeling
errors requires utilization of robust control methods. In this paper, robust
LQG/LTR controller design is described for a two-axis gimbal. First, the
classical LQG/LTR method is modified such that it becomes very powerful loop
shaping method. Next, using this method, controller is synthesized. Robust
stability and robust performance of stabilization loop is investigated by using
singular value tests. The report is concluded with the experimental validation
of the designed robust controller.
|
[
{
"version": "v1",
"created": "Mon, 22 Feb 2016 15:49:18 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Mar 2016 13:24:13 GMT"
},
{
"version": "v3",
"created": "Mon, 25 Apr 2016 17:44:16 GMT"
}
] | 2016-04-26T00:00:00 |
[
[
"Baskın",
"Mehmet",
""
],
[
"Leblebicioğlu",
"Kemal",
""
]
] |
new_dataset
| 0.982809 |
1604.06996
|
Thomas Westerb\"ack
|
Thomas Westerb\"ack
|
Parity check systems of nonlinear codes over finite commutative
Frobenius rings
|
Submitted for publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The concept of parity check matrices of linear binary codes has been extended
by Heden [9] to parity check systems of nonlinear binary codes. In the present
paper we extend this concept to parity check systems of nonlinear codes over
finite commutative Frobenius rings. Using parity check systems, results on how
to get some fundamental properties of the codes are given. Moreover, parity
check systems and its connection to characters is investigated and a
MacWilliams type theorem on the distance distribution is given.
|
[
{
"version": "v1",
"created": "Sun, 24 Apr 2016 08:45:08 GMT"
}
] | 2016-04-26T00:00:00 |
[
[
"Westerbäck",
"Thomas",
""
]
] |
new_dataset
| 0.98231 |
1604.07048
|
David Karpuk
|
David A. Karpuk, Amaro Barreal, Oliver W. Gnilke, and Camilla Hollanti
|
Nested Lattice Codes for Vector Perturbation Systems
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Vector perturbation is an encoding method for broadcast channels in which the
transmitter solves a shortest vector problem in a lattice to create a
perturbation vector, which is then added to the data before transmission. In
this work, we introduce nested lattice codes into vector perturbation systems,
resulting in a strategy which we deem matrix perturbation. We propose design
criteria for the nested lattice codes, and show empirically that lattices
satisfying these design criteria can improve the performance of vector
perturbation systems. The resulting design criteria are the same as those
recently proposed for the Compute-and-Forward protocol.
|
[
{
"version": "v1",
"created": "Sun, 24 Apr 2016 16:27:28 GMT"
}
] | 2016-04-26T00:00:00 |
[
[
"Karpuk",
"David A.",
""
],
[
"Barreal",
"Amaro",
""
],
[
"Gnilke",
"Oliver W.",
""
],
[
"Hollanti",
"Camilla",
""
]
] |
new_dataset
| 0.998799 |
1604.07102
|
Wei Wang
|
Si Liu, Xinyu Ou, Ruihe Qian, Wei Wang, Xiaochun Cao
|
Makeup like a superstar: Deep Localized Makeup Transfer Network
|
7pages, 11 figures, to appear in IJCAI 2016
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a novel Deep Localized Makeup Transfer Network to
automatically recommend the most suitable makeup for a female and synthesis the
makeup on her face. Given a before-makeup face, her most suitable makeup is
determined automatically. Then, both the beforemakeup and the reference faces
are fed into the proposed Deep Transfer Network to generate the after-makeup
face. Our end-to-end makeup transfer network have several nice properties
including: (1) with complete functions: including foundation, lip gloss, and
eye shadow transfer; (2) cosmetic specific: different cosmetics are transferred
in different manners; (3) localized: different cosmetics are applied on
different facial regions; (4) producing naturally looking results without
obvious artifacts; (5) controllable makeup lightness: various results from
light makeup to heavy makeup can be generated. Qualitative and quantitative
experiments show that our network performs much better than the methods of [Guo
and Sim, 2009] and two variants of NerualStyle [Gatys et al., 2015a].
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2016 01:01:51 GMT"
}
] | 2016-04-26T00:00:00 |
[
[
"Liu",
"Si",
""
],
[
"Ou",
"Xinyu",
""
],
[
"Qian",
"Ruihe",
""
],
[
"Wang",
"Wei",
""
],
[
"Cao",
"Xiaochun",
""
]
] |
new_dataset
| 0.965786 |
1604.07339
|
Ivan Bajic
|
Sayed Hossein Khatoonabadi, Ivan V. Bajic, Yufeng Shan
|
Compressed-domain visual saliency models: A comparative study
| null | null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Computational modeling of visual saliency has become an important research
problem in recent years, with applications in video quality estimation, video
compression, object tracking, retargeting, summarization, and so on. While most
visual saliency models for dynamic scenes operate on raw video, several models
have been developed for use with compressed-domain information such as motion
vectors and transform coefficients. This paper presents a comparative study of
eleven such models as well as two high-performing pixel-domain saliency models
on two eye-tracking datasets using several comparison metrics. The results
indicate that highly accurate saliency estimation is possible based only on a
partially decoded video bitstream. The strategies that have shown success in
compressed-domain saliency modeling are highlighted, and certain challenges are
identified as potential avenues for further improvement.
|
[
{
"version": "v1",
"created": "Mon, 25 Apr 2016 17:39:25 GMT"
}
] | 2016-04-26T00:00:00 |
[
[
"Khatoonabadi",
"Sayed Hossein",
""
],
[
"Bajic",
"Ivan V.",
""
],
[
"Shan",
"Yufeng",
""
]
] |
new_dataset
| 0.952116 |
1309.5314
|
Armin Wei{\ss}
|
Volker Diekert, Alexei Miasnikov, Armin Wei{\ss}
|
Conjugacy in Baumslag's group, generic case complexity, and division in
power circuits
|
Section 5 added: We show that an HNN extension G = < H, b | bab^-1 =
{\phi}(a), a \in A > has a non-amenable Schreier graph with respect to the
base group H if and only if A \neq H \neq B
| null | null | null |
cs.DM cs.CC math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The conjugacy problem belongs to algorithmic group theory. It is the
following question: given two words x, y over generators of a fixed group G,
decide whether x and y are conjugated, i.e., whether there exists some z such
that zxz^{-1} = y in G. The conjugacy problem is more difficult than the word
problem, in general. We investigate the complexity of the conjugacy problem for
two prominent groups: the Baumslag-Solitar group BS(1,2) and the
Baumslag(-Gersten) group G(1,2). The conjugacy problem in BS(1,2) is
TC^0-complete. To the best of our knowledge BS(1,2) is the first natural
infinite non-commutative group where such a precise and low complexity is
shown. The Baumslag group G(1,2) is an HNN-extension of BS(1,2). We show that
the conjugacy problem is decidable (which has been known before); but our
results go far beyond decidability. In particular, we are able to show that
conjugacy in G(1,2) can be solved in polynomial time in a strongly generic
setting. This means that essentially for all inputs conjugacy in G(1,2) can be
decided efficiently. In contrast, we show that under a plausible assumption the
average case complexity of the same problem is non-elementary. Moreover, we
provide a lower bound for the conjugacy problem in G(1,2) by reducing the
division problem in power circuits to the conjugacy problem in G(1,2). The
complexity of the division problem in power circuits is an open and interesting
problem in integer arithmetic.
|
[
{
"version": "v1",
"created": "Fri, 20 Sep 2013 16:34:42 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Nov 2013 16:14:28 GMT"
}
] | 2016-04-25T00:00:00 |
[
[
"Diekert",
"Volker",
""
],
[
"Miasnikov",
"Alexei",
""
],
[
"Weiß",
"Armin",
""
]
] |
new_dataset
| 0.997485 |
1603.09536
|
Isabel Campos Dr.
|
D. Salomoni, I. Campos, L. Gaido, G. Donvito, M. Antonacci, P.
Fuhrman, J. Marco, A. Lopez-Garcia, P. Orviz, I. Blanquer, M. Caballer, G.
Molto, M. Plociennik, M. Owsiak, M. Urbaniak, M. Hardt, A. Ceccanti, B. Wegh,
J. Gomes, M. David, C. Aiftimiei, L. Dutka, B. Kryza, T. Szepieniec, S.
Fiore, G. Aloisio, R. Barbera, R. Bruno, M. Fargetta, E. Giorgio, S. Reynaud,
L. Schwarz, A. Dorigo, T. Bell and R. Rocha
|
INDIGO-Datacloud: foundations and architectural description of a
Platform as a Service oriented to scientific computing
|
31 pages, 12 Figures
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe the architecture of a Platform as a Service (PaaS)
oriented to computing and data analysis. In order to clarify the choices we
made, we explain the features using practical examples, applied to several
known usage patterns in the area of HEP computing. The proposed architecture is
devised to provide researchers with a unified view of distributed computing
infrastructures, focusing in facilitating seamless access. In this respect the
Platform is able to profit from the most recent developments for computing and
processing large amounts of data, and to exploit current storage and
preservation technologies, with the appropriate mechanisms to ensure security
and privacy.
|
[
{
"version": "v1",
"created": "Thu, 31 Mar 2016 11:41:34 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Apr 2016 14:36:51 GMT"
},
{
"version": "v3",
"created": "Fri, 22 Apr 2016 09:25:09 GMT"
}
] | 2016-04-25T00:00:00 |
[
[
"Salomoni",
"D.",
""
],
[
"Campos",
"I.",
""
],
[
"Gaido",
"L.",
""
],
[
"Donvito",
"G.",
""
],
[
"Antonacci",
"M.",
""
],
[
"Fuhrman",
"P.",
""
],
[
"Marco",
"J.",
""
],
[
"Lopez-Garcia",
"A.",
""
],
[
"Orviz",
"P.",
""
],
[
"Blanquer",
"I.",
""
],
[
"Caballer",
"M.",
""
],
[
"Molto",
"G.",
""
],
[
"Plociennik",
"M.",
""
],
[
"Owsiak",
"M.",
""
],
[
"Urbaniak",
"M.",
""
],
[
"Hardt",
"M.",
""
],
[
"Ceccanti",
"A.",
""
],
[
"Wegh",
"B.",
""
],
[
"Gomes",
"J.",
""
],
[
"David",
"M.",
""
],
[
"Aiftimiei",
"C.",
""
],
[
"Dutka",
"L.",
""
],
[
"Kryza",
"B.",
""
],
[
"Szepieniec",
"T.",
""
],
[
"Fiore",
"S.",
""
],
[
"Aloisio",
"G.",
""
],
[
"Barbera",
"R.",
""
],
[
"Bruno",
"R.",
""
],
[
"Fargetta",
"M.",
""
],
[
"Giorgio",
"E.",
""
],
[
"Reynaud",
"S.",
""
],
[
"Schwarz",
"L.",
""
],
[
"Dorigo",
"A.",
""
],
[
"Bell",
"T.",
""
],
[
"Rocha",
"R.",
""
]
] |
new_dataset
| 0.974976 |
1604.03195
|
Carlos Leandro
|
Carlos Leandro and Jorge Ambr\'osio
|
Multibody minimum-energy trajectory with applications to protein folding
|
41 pages, 17 figures
| null | null | null |
cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work addresses the optimal control of multibody systems being actuated
with control forces in order to find a dynamically feasible minimum-energy
trajectory of the system. The optimal control problem and its constraints are
integrated in a discrete version of the equation of motion allowing the
minimization of system energy with respect to a discrete state and control
trajectory. The work is centred on a specific type of open-chain multibody
system, with strong local propensity, where the overall system kinematics is
described essentially by the torsion around the links that connect rigid
bodies. The coupling between the rigid body motion, and the optimal
conformation is described as an elastic band of replicas of the original system
with different conformations. The band forces are used to control system's
motion directly, reflecting the influence of the system energy field on its
conformation, using for that the Nudged-Elastic Band method. Here the equation
of motion of the multibody grid are solved by using the augmented Lagrangean
method. In this context, if a feasible minimum-energy trajectory of the
original system exists it is a stationary state of the extended system. This
approach is applied to the folding of a single chain protein.
|
[
{
"version": "v1",
"created": "Tue, 12 Apr 2016 01:26:44 GMT"
},
{
"version": "v2",
"created": "Fri, 22 Apr 2016 11:17:28 GMT"
}
] | 2016-04-25T00:00:00 |
[
[
"Leandro",
"Carlos",
""
],
[
"Ambrósio",
"Jorge",
""
]
] |
new_dataset
| 0.996624 |
1604.06452
|
Tina Novak
|
Tina Novak, Janez Zerovnik
|
Weighted domination number of cactus graphs
|
17 pages, figures, submitted to Discussiones Mathematicae Graph
Theory
| null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the paper, we write a linear algorithm for calculating the weighted
domination number of a vertex-weighted cactus. The algorithm is based on the
well known depth first search (DFS) structure. Our algorithm needs less than
$12n+5b$ additions and $9n+2b$ $\min$-operations where $n$ is the number of
vertices and $b$ is the number of blocks in the cactus.
|
[
{
"version": "v1",
"created": "Thu, 21 Apr 2016 08:18:01 GMT"
}
] | 2016-04-25T00:00:00 |
[
[
"Novak",
"Tina",
""
],
[
"Zerovnik",
"Janez",
""
]
] |
new_dataset
| 0.969104 |
1604.06583
|
Ildik\'o Pil\'an
|
Elena Volodina and Ildik\'o Pil\'an and Ingegerd Enstr\"om and Lorena
Llozhi and Peter Lundkvist and Gunl\"og Sundberg and Monica Sandell
|
SweLL on the rise: Swedish Learner Language corpus for European
Reference Level studies
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new resource for Swedish, SweLL, a corpus of Swedish Learner
essays linked to learners' performance according to the Common European
Framework of Reference (CEFR). SweLL consists of three subcorpora - SpIn,
SW1203 and Tisus, collected from three different educational establishments.
The common metadata for all subcorpora includes age, gender, native languages,
time of residence in Sweden, type of written task. Depending on the subcorpus,
learner texts may contain additional information, such as text genres, topics,
grades. Five of the six CEFR levels are represented in the corpus: A1, A2, B1,
B2 and C1 comprising in total 339 essays. C2 level is not included since
courses at C2 level are not offered. The work flow consists of collection of
essays and permits, essay digitization and registration, meta-data annotation,
automatic linguistic annotation. Inter-rater agreement is presented on the
basis of SW1203 subcorpus. The work on SweLL is still ongoing with more than
100 essays waiting in the pipeline. This article both describes the resource
and the "how-to" behind the compilation of SweLL.
|
[
{
"version": "v1",
"created": "Fri, 22 Apr 2016 09:19:07 GMT"
}
] | 2016-04-25T00:00:00 |
[
[
"Volodina",
"Elena",
""
],
[
"Pilán",
"Ildikó",
""
],
[
"Enström",
"Ingegerd",
""
],
[
"Llozhi",
"Lorena",
""
],
[
"Lundkvist",
"Peter",
""
],
[
"Sundberg",
"Gunlög",
""
],
[
"Sandell",
"Monica",
""
]
] |
new_dataset
| 0.999626 |
1604.06747
|
Jonathan Hoyland
|
Jonathan Hoyland, Matthew Hague
|
Generating Concurrency Checks Automatically
|
15 pages, 9 figures
| null | null | null |
cs.LO cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article introduces ATAB, a tool that automatically generates pairwise
reachability checks for action trees. Action trees can be used to study the
behaviour of real-world concurrent programs. ATAB encodes pairwise reachability
checks into alternating tree automata that determine whether an action tree has
a schedule where any pair of given points in the program are simultaneously
reachable. Because the pairwise reachability problem is undecidable in general
ATAB operates under a restricted form of lock-based concurrency. ATAB produces
alternating tree automata that are more compact and more efficiently checkable
than those that have been previously used. The process is entirely automated,
which simplifies the process of encoding checks for more complex action trees.
The alternating tree automata produced are easier to scale to large numbers of
locks than previous constructions.
|
[
{
"version": "v1",
"created": "Fri, 22 Apr 2016 16:52:58 GMT"
}
] | 2016-04-25T00:00:00 |
[
[
"Hoyland",
"Jonathan",
""
],
[
"Hague",
"Matthew",
""
]
] |
new_dataset
| 0.953749 |
1604.06751
|
Mazdak Fatahi
|
Mazdak Fatahi, Mahmood Ahmadi, Mahyar Shahsavari, Arash Ahmadi and
Philippe Devienne
|
evt_MNIST: A spike based version of traditional MNIST
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Benchmarks and datasets have important role in evaluation of machine learning
algorithms and neural network implementations. Traditional dataset for images
such as MNIST is applied to evaluate efficiency of different training
algorithms in neural networks. This demand is different in Spiking Neural
Networks (SNN) as they require spiking inputs. It is widely believed, in the
biological cortex the timing of spikes is irregular. Poisson distributions
provide adequate descriptions of the irregularity in generating appropriate
spikes. Here, we introduce a spike-based version of MNSIT (handwritten digits
dataset),using Poisson distribution and show the Poissonian property of the
generated streams. We introduce a new version of evt_MNIST which can be used
for neural network evaluation.
|
[
{
"version": "v1",
"created": "Fri, 22 Apr 2016 17:06:31 GMT"
}
] | 2016-04-25T00:00:00 |
[
[
"Fatahi",
"Mazdak",
""
],
[
"Ahmadi",
"Mahmood",
""
],
[
"Shahsavari",
"Mahyar",
""
],
[
"Ahmadi",
"Arash",
""
],
[
"Devienne",
"Philippe",
""
]
] |
new_dataset
| 0.999025 |
1603.02481
|
Jakob Lykke Andersen
|
Jakob L. Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler
|
A Software Package for Chemically Inspired Graph Transformation
| null | null | null | null |
cs.FL q-bio.BM q-bio.MN
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Chemical reaction networks can be automatically generated from graph grammar
descriptions, where rewrite rules model reaction patterns. Because a molecule
graph is connected and reactions in general involve multiple molecules, the
rewriting must be performed on multisets of graphs. We present a general
software package for this type of graph rewriting system, which can be used for
modelling chemical systems. The package contains a C++ library with algorithms
for working with transformation rules in the Double Pushout formalism, e.g.,
composition of rules and a domain specific language for programming graph
language generation. A Python interface makes these features easily accessible.
The package also has extensive procedures for automatically visualising not
only graphs and rewrite rules, but also Double Pushout diagrams and graph
languages in form of directed hypergraphs. The software is available as an open
source package, and interactive examples can be found on the accompanying
webpage.
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2016 11:20:02 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Apr 2016 06:03:44 GMT"
}
] | 2016-04-22T00:00:00 |
[
[
"Andersen",
"Jakob L.",
""
],
[
"Flamm",
"Christoph",
""
],
[
"Merkle",
"Daniel",
""
],
[
"Stadler",
"Peter F.",
""
]
] |
new_dataset
| 0.998516 |
1604.06157
|
Andrew Connor
|
Jacques Foottit, Dave Brown, Stefan Marks and Andy M. Connor
|
An Intuitive Tangible Game Controller
|
in Proceedings of the 2014 Conference on Interactive Entertainment
| null |
10.1145/2677758.2677774
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper outlines the development of a sensory feedback device providing a
tangible interface for controlling digital environments, in this example a
flight simulator, where the intention for the device is that it is relatively
low cost, versatile and intuitive. Gesture based input allows for a more
immersive experience, so rather than making the user feel like they are
controlling an aircraft the intuitive interface allows the user to become the
aircraft that is controlled by the movements of the user's hand. The movements
are designed to allow a sense of immersion that would be difficult to achieve
with an alternative interface. A vibrotactile based haptic feedback is
incorporated in the device to further enhance the connection between the user
and the game environment by providing immediate confirmation of game events.
When used for navigating an aircraft simulator, this device invites playful
action and thrill. It bridges new territory on portable, low cost solutions for
haptic devices in gaming contexts.
|
[
{
"version": "v1",
"created": "Thu, 21 Apr 2016 01:57:18 GMT"
}
] | 2016-04-22T00:00:00 |
[
[
"Foottit",
"Jacques",
""
],
[
"Brown",
"Dave",
""
],
[
"Marks",
"Stefan",
""
],
[
"Connor",
"Andy M.",
""
]
] |
new_dataset
| 0.996171 |
1508.01045
|
Florian Lonsing
|
Florian Lonsing, Martina Seidl, and Allen Van Gelder
|
The QBF Gallery: Behind the Scenes
|
preprint of an article to appear in Artificial Intelligence,
Elsevier, 2016
| null |
10.1016/j.artint.2016.04.002
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over the last few years, much progress has been made in the theory and
practice of solving quantified Boolean formulas (QBF). Novel solvers have been
presented that either successfully enhance established techniques or implement
novel solving paradigms. Powerful preprocessors have been realized that tune
the encoding of a formula to make it easier to solve. Frameworks for
certification and solution extraction emerged that allow for a detailed
interpretation of a QBF solver's results, and new types of QBF encodings were
presented for various application problems.
To capture these developments the QBF Gallery was established in 2013. The
QBF Gallery aims at providing a forum to assess QBF tools and to collect new,
expressive benchmarks that allow for documenting the status quo and that
indicate promising research directions. These benchmarks became the basis for
the experiments conducted in the context of the QBF Gallery 2013 and follow-up
evaluations. In this paper, we report on the setup of the QBF Gallery. To this
end, we conducted numerous experiments which allowed us not only to assess the
quality of the tools, but also the quality of the benchmarks.
|
[
{
"version": "v1",
"created": "Wed, 5 Aug 2015 12:17:07 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Apr 2016 11:49:17 GMT"
}
] | 2016-04-21T00:00:00 |
[
[
"Lonsing",
"Florian",
""
],
[
"Seidl",
"Martina",
""
],
[
"Van Gelder",
"Allen",
""
]
] |
new_dataset
| 0.990454 |
1604.05791
|
Andrew Connor
|
Jan Kruse, Ricardo Sosa and Andy M. Connor
|
Procedural urban environments for FPS games
| null | null |
10.1145/2843043.2843479
| null |
cs.AI cs.HC cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel approach to procedural generation of urban maps
for First Person Shooter (FPS) games. A multi-agent evolutionary system is
employed to place streets, buildings and other items inside the Unity3D game
engine, resulting in playable video game levels. A computational agent is
trained using machine learning techniques to capture the intent of the game
designer as part of the multi-agent system, and to enable a semi-automated
aesthetic selection for the underlying genetic algorithm.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 02:39:04 GMT"
}
] | 2016-04-21T00:00:00 |
[
[
"Kruse",
"Jan",
""
],
[
"Sosa",
"Ricardo",
""
],
[
"Connor",
"Andy M.",
""
]
] |
new_dataset
| 0.966144 |
1604.05933
|
Jochen Gast
|
Jochen Gast and Anita Sellent and Stefan Roth
|
Parametric Object Motion from Blur
|
Accepted to IEEE Conference on Computer Vision and Pattern
Recognition 2016. Includes supplemental material
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion blur can adversely affect a number of vision tasks, hence it is
generally considered a nuisance. We instead treat motion blur as a useful
signal that allows to compute the motion of objects from a single image.
Drawing on the success of joint segmentation and parametric motion models in
the context of optical flow estimation, we propose a parametric object motion
model combined with a segmentation mask to exploit localized, non-uniform
motion blur. Our parametric image formation model is differentiable w.r.t. the
motion parameters, which enables us to generalize marginal-likelihood
techniques from uniform blind deblurring to localized, non-uniform blur. A
two-stage pipeline, first in derivative space and then in image space, allows
to estimate both parametric object motion as well as a motion segmentation from
a single image alone. Our experiments demonstrate its ability to cope with very
challenging cases of object motion blur.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 13:00:30 GMT"
}
] | 2016-04-21T00:00:00 |
[
[
"Gast",
"Jochen",
""
],
[
"Sellent",
"Anita",
""
],
[
"Roth",
"Stefan",
""
]
] |
new_dataset
| 0.998863 |
1604.05957
|
Efthimios Bothos
|
Evangelia Anagnostopoulou, Efthimios Bothos, Babis Magoutas, Johann
Schrammel, Gregoris Mentzas
|
Persuasive Technologies for Sustainable Urban Mobility
|
Presented at the Persuasive 2016 Workshop "Where are we bound for?
Persuasion in Transport Applications"
| null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, the persuasive interventions for inducing sustainable urban
mobility behaviours has become a very active research field. This review paper
systematically analyses existing approaches and prototype systems and describes
and classifies the persuasive strategies used for changing behaviour in the
domain of transport. It also studies the results and recommendations derived
from pilot studies, and as a result of this analysis highlights the need for
personalizing and tailoring persuasive technology to various user
characteristics. We also discuss the possible role of context-aware persuasive
systems for increasing the number of sustainable choices. Finally,
recommendations for future investigations on scholarly persuasive systems are
proposed.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 13:45:55 GMT"
}
] | 2016-04-21T00:00:00 |
[
[
"Anagnostopoulou",
"Evangelia",
""
],
[
"Bothos",
"Efthimios",
""
],
[
"Magoutas",
"Babis",
""
],
[
"Schrammel",
"Johann",
""
],
[
"Mentzas",
"Gregoris",
""
]
] |
new_dataset
| 0.9758 |
1604.06030
|
Paul Attie
|
Paul C. Attie and Nancy A. Lynch
|
Dynamic Input/Output Automata: a Formal and Compositional Model for
Dynamic Systems
|
65 pages, 11 figures, Information and Computation, Available online
21 March 2016
| null |
10.1016/j.ic.2016.03.008
| null |
cs.DC cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present dynamic I/O automata (DIOA), a compositional model of dynamic
systems. In DIOA, automata can be created and destroyed dynamically, as
computation proceeds, and an automaton can dynamically change its signature,
i.e., the set of actions in which it can participate.
DIOA features operators for parallel composition, action hiding, action
renaming, a notion of automaton creation, and a notion of behavioral subtyping
by means of trace inclusion. DIOA can model mobility, using signature
modification, and is hierarchical: a dynamically changing system of interacting
automata is itself modeled as a single automaton.
We also show that parallel composition, action hiding, action renaming, and
(subject to some technical conditions) automaton creation are all monotonic
with respect to trace inclusion: if one component is replaced by another whose
traces are a subset of the former, then the set of traces of the system as a
whole can only be reduced.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 16:49:32 GMT"
}
] | 2016-04-21T00:00:00 |
[
[
"Attie",
"Paul C.",
""
],
[
"Lynch",
"Nancy A.",
""
]
] |
new_dataset
| 0.959565 |
1604.06061
|
Viktor Winschel
|
Jules Hedges, Evguenia Shprits, Viktor Winschel, Philipp Zahn
|
Compositionality and String Diagrams for Game Theory
| null | null | null | null |
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce string diagrams as a formal mathematical, graphical language to
represent, compose, program and reason about games. The language is well
established in quantum physics, quantum computing and quantum linguistic with
the semantics given by category theory. We apply this language to the game
theoretical setting and show examples how to use it for some economic games
where we highlight the compositional nature of our higher-order game theory.
|
[
{
"version": "v1",
"created": "Wed, 20 Apr 2016 19:03:10 GMT"
}
] | 2016-04-21T00:00:00 |
[
[
"Hedges",
"Jules",
""
],
[
"Shprits",
"Evguenia",
""
],
[
"Winschel",
"Viktor",
""
],
[
"Zahn",
"Philipp",
""
]
] |
new_dataset
| 0.999498 |
0811.2113
|
J\"urgen Koslowski
|
Chris Heunen
|
Compactly accessible categories and quantum key distribution
|
26 pages in Logical Methods in Computer Science, Volume 4, Issue 4
(November 17, 2008) lmcs:1129
|
Logical Methods in Computer Science, Volume 4, Issue 4 (November
17, 2008) lmcs:1129
|
10.2168/LMCS-4(4:9)2008
| null |
cs.LO cs.PL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compact categories have lately seen renewed interest via applications to
quantum physics. Being essentially finite-dimensional, they cannot accomodate
(co)limit-based constructions. For example, they cannot capture protocols such
as quantum key distribution, that rely on the law of large numbers. To overcome
this limitation, we introduce the notion of a compactly accessible category,
relying on the extra structure of a factorisation system. This notion allows
for infinite dimension while retaining key properties of compact categories:
the main technical result is that the choice-of-duals functor on the compact
part extends canonically to the whole compactly accessible category. As an
example, we model a quantum key distribution protocol and prove its correctness
categorically.
|
[
{
"version": "v1",
"created": "Thu, 13 Nov 2008 13:58:48 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Nov 2008 13:17:09 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Apr 2016 12:29:44 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Heunen",
"Chris",
""
]
] |
new_dataset
| 0.989815 |
1501.01352
|
Yun Fan
|
Yun Fan, Liang Zhang
|
Iso-Orthogonality and Type II Duadic Constacyclic Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic
codes, we introduce even-like (i.e.,Type-II) and odd-like duadic constacyclic
codes, and study their properties and existence. We show that even-like duadic
constacyclic codes are isometrically orthogonal, and the duals of even-like
duadic constacyclic codes are odd-like duadic constacyclic codes. We exhibit
necessary and sufficient conditions for the existence of even-like duadic
constacyclic codes. A class of even-like duadic constacyclic codes which are
alternant MDS-codes is constructed.
|
[
{
"version": "v1",
"created": "Wed, 7 Jan 2015 02:40:21 GMT"
},
{
"version": "v2",
"created": "Thu, 15 Jan 2015 15:03:07 GMT"
},
{
"version": "v3",
"created": "Sun, 1 Feb 2015 06:43:42 GMT"
},
{
"version": "v4",
"created": "Tue, 19 Apr 2016 03:02:37 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Fan",
"Yun",
""
],
[
"Zhang",
"Liang",
""
]
] |
new_dataset
| 0.998213 |
1505.02534
|
Tianyu Song
|
Tianyu Song, Pooi-Yuen Kam
|
Robust Data Detection for the Photon-Counting Free-Space Optical System
with Implicit CSI Acquisition and Background Radiation Compensation
|
11pages
| null |
10.1109/JLT.2015.2505360
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since atmospheric turbulence and pointing errors cause signal intensity
fluctuations and the background radiation surrounding the free-space optical
(FSO) receiver contributes an undesired noisy component, the receiver requires
accurate channel state information (CSI) and background information to adjust
the detection threshold. In most previous studies, for CSI acquisition, pilot
symbols were employed, which leads to a reduction of spectral and energy
efficiency; and an impractical assumption that the background radiation
component is perfectly known was made. In this paper, we develop an efficient
and robust sequence receiver, which acquires the CSI and the background
information implicitly and requires no knowledge about the channel model
information. It is robust since it can automatically estimate the CSI and
background component and detect the data sequence accordingly. Its decision
metric has a simple form and involves no integrals, and thus can be easily
evaluated. A Viterbi-type trellis-search algorithm is adopted to improve the
search efficiency, and a selective-store strategy is adopted to overcome a
potential error floor problem as well as to increase the memory efficiency. To
further simplify the receiver, a decision-feedback symbol-by-symbol receiver is
proposed as an approximation of the sequence receiver. By simulations and
theoretical analysis, we show that the performance of both the sequence
receiver and the symbol-by-symbol receiver, approach that of detection with
perfect knowledge of the CSI and background radiation, as the length of the
window for forming the decision metric increases.
|
[
{
"version": "v1",
"created": "Mon, 11 May 2015 09:23:48 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Song",
"Tianyu",
""
],
[
"Kam",
"Pooi-Yuen",
""
]
] |
new_dataset
| 0.954423 |
1510.07410
|
Hamidreza Arjmandi
|
Hamidreza Arjmandi, Arman Ahmadzadeh, Robert Schober and Masoumeh
Nasiri Kenari
|
A Bio-Synthetic Modulator Model for Diffusion-based Molecular
Communications
|
This paper is an extended version of a paper submitted to IEEE
Globecom 2016
| null | null | null |
cs.ET cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In diffusion-based molecular communication (DMC), one important functionality
of a transmitter nano-machine is signal modulation. In particular, the
transmitter has to be able to control the release of signaling molecules for
modulation of the information bits. An important class of control mechanisms in
natural cells for releasing molecules is based on ion channels which are
pore-forming proteins across the cell membrane whose opening and closing may be
controlled by a gating parameter. In this paper, a modulator for DMC based on
ion channels is proposed which controls the rate at which molecules are
released from the transmitter by modulating a gating parameter signal.
Exploiting the capabilities of the proposed modulator, an on-off keying
modulation scheme is introduced and the corresponding average modulated signal,
i.e., the average release rate of the molecules from the transmitter, is
derived in the Laplace domain. By making a simplifying assumption, a
closed-form expression for the average modulated signal in the time domain is
obtained which constitutes an upper bound on the total number of released
molecules regardless of this assumption. The derived average modulated signal
is compared to results obtained with a particle based simulator. The numerical
results show that the derived upper bound is tight if the number of ion
channels distributed across the transmitter (cell) membrane is small.
|
[
{
"version": "v1",
"created": "Mon, 26 Oct 2015 09:13:20 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Nov 2015 12:49:29 GMT"
},
{
"version": "v3",
"created": "Tue, 19 Apr 2016 04:42:14 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Arjmandi",
"Hamidreza",
""
],
[
"Ahmadzadeh",
"Arman",
""
],
[
"Schober",
"Robert",
""
],
[
"Kenari",
"Masoumeh Nasiri",
""
]
] |
new_dataset
| 0.99794 |
1510.08917
|
Chia-Hsiang Lin
|
Chia-Hsiang Lin, Chong-Yung Chi, Yu-Hsiang Wang, and Tsung-Han Chan
|
A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for
Blind Hyperspectral Unmixing
|
36 pages, 8 figures, IEEE Transactions on Signal Processing
| null |
10.1109/TSP.2015.2508778
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hyperspectral unmixing (HU) is a crucial signal processing procedure to
identify the underlying materials (or endmembers) and their corresponding
proportions (or abundances) from an observed hyperspectral scene. A well-known
blind HU criterion, advocated by Craig in early 1990's, considers the vertices
of the minimum-volume enclosing simplex of the data cloud as good endmember
estimates, and it has been empirically and theoretically found effective even
in the scenario of no pure pixels. However, such kind of algorithms may suffer
from heavy simplex volume computations in numerical optimization, etc. In this
work, without involving any simplex volume computations, by exploiting a convex
geometry fact that a simplest simplex of N vertices can be defined by N
associated hyperplanes, we propose a fast blind HU algorithm, for which each of
the N hyperplanes associated with the Craig's simplex of N vertices is
constructed from N-1 affinely independent data pixels, together with an
endmember identifiability analysis for its performance support. Without
resorting to numerical optimization, the devised algorithm searches for the
N(N-1) active data pixels via simple linear algebraic computations, accounting
for its computational efficiency. Monte Carlo simulations and real data
experiments are provided to demonstrate its superior efficacy over some
benchmark Craig-criterion-based algorithms in both computational efficiency and
estimation accuracy.
|
[
{
"version": "v1",
"created": "Thu, 29 Oct 2015 21:41:26 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Lin",
"Chia-Hsiang",
""
],
[
"Chi",
"Chong-Yung",
""
],
[
"Wang",
"Yu-Hsiang",
""
],
[
"Chan",
"Tsung-Han",
""
]
] |
new_dataset
| 0.989122 |
1512.00762
|
Zubair Azim
|
Zubair Al Azim, Abhronil Sengupta, Syed Shakib Sarwar, Kaushik Roy
|
Spin-Torque Sensors for Energy Efficient High Speed Long Interconnects
|
To appear in IEEE Transactions on Electron Devices
| null |
10.1109/TED.2015.2507126
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a Spin-Torque (ST) based sensing scheme that can
enable energy efficient multi-bit long distance interconnect architectures.
Current-mode interconnects have recently been proposed to overcome the
performance degradations associated with conventional voltage mode Copper (Cu)
interconnects. However, the performance of current mode interconnects are
limited by analog current sensing transceivers and equalization circuits. As a
solution, we propose the use of ST based receivers that use Magnetic Tunnel
Junctions (MTJ) and simple digital components for current-to-voltage conversion
and do not require analog transceivers. We incorporate Spin-Hall Metal (SHM) in
our design to achieve high speed sensing. We show both single and multi-bit
operations that reveal major benefits at higher speeds. Our simulation results
show that the proposed technique consumes only 3.93-4.72 fJ/bit/mm energy while
operating at 1-2 Gbits/sec; which is considerably better than existing charge
based interconnects. In addition, Voltage Controlled Magnetic Anisotropy (VCMA)
can reduce the required current at the sensor. With the inclusion of VCMA, the
energy consumption can be further reduced to 2.02-4.02 fJ/bit/mm
|
[
{
"version": "v1",
"created": "Wed, 2 Dec 2015 16:29:26 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Azim",
"Zubair Al",
""
],
[
"Sengupta",
"Abhronil",
""
],
[
"Sarwar",
"Syed Shakib",
""
],
[
"Roy",
"Kaushik",
""
]
] |
new_dataset
| 0.991483 |
1601.05254
|
Ricardo P\'erez Marco
|
Ricardo Perez-Marco
|
Bitcoin and Decentralized Trust Protocols
|
This is a general survey article to appear on the June 2016 issue of
the Newsletter of the EMS. 8 pages, 5 figures
| null | null | null |
cs.CY math.HO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bitcoin is the first decentralized peer-to-peer (P2P) electronic currency. It
was created in November 2008 by Satoshi Nakamoto. Nakamoto released the first
implementation of the protocol in an open source client software and the
genesis of bitcoins began on January 9th 2009. The Bitcoin protocol is based on
clever ideas which solve a form of the Byzantine Generals Problem and sets the
foundation for Decentralized Trust Protocols. Still in its infancy, the
currency and the protocol have the potential to disrupt the international
financial system and other sectors where business is based on trusted third
parties. The security of the bitcoin protocol relies on strong cryptography and
one way hashing algorithms.
|
[
{
"version": "v1",
"created": "Wed, 20 Jan 2016 12:40:16 GMT"
},
{
"version": "v2",
"created": "Tue, 19 Apr 2016 17:13:44 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Perez-Marco",
"Ricardo",
""
]
] |
new_dataset
| 0.999619 |
1602.01890
|
Archith Bency
|
Archith J. Bency, S. Karthikeyan, Carter De Leo, Santhoshkumar
Sunderrajan and B. S. Manjunath
|
Search Tracker: Human-derived object tracking in-the-wild through
large-scale search and retrieval
|
Under review with the IEEE Transactions on Circuits and Systems for
Video Technology
| null |
10.1109/TCSVT.2016.2555718
| null |
cs.CV cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Humans use context and scene knowledge to easily localize moving objects in
conditions of complex illumination changes, scene clutter and occlusions. In
this paper, we present a method to leverage human knowledge in the form of
annotated video libraries in a novel search and retrieval based setting to
track objects in unseen video sequences. For every video sequence, a document
that represents motion information is generated. Documents of the unseen video
are queried against the library at multiple scales to find videos with similar
motion characteristics. This provides us with coarse localization of objects in
the unseen video. We further adapt these retrieved object locations to the new
video using an efficient warping scheme. The proposed method is validated on
in-the-wild video surveillance datasets where we outperform state-of-the-art
appearance-based trackers. We also introduce a new challenging dataset with
complex object appearance changes.
|
[
{
"version": "v1",
"created": "Fri, 5 Feb 2016 00:01:13 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Bency",
"Archith J.",
""
],
[
"Karthikeyan",
"S.",
""
],
[
"De Leo",
"Carter",
""
],
[
"Sunderrajan",
"Santhoshkumar",
""
],
[
"Manjunath",
"B. S.",
""
]
] |
new_dataset
| 0.99721 |
1604.05430
|
Anatoliy Zinovyev
|
Anatoliy Zinovyev, Brian L. Mark
|
Binary Multi-Level Routing Protocol for Mobile Ad Hoc Networks
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Routing in mobile ad hoc networks (MANETs) presents a big challenge,
especially when support for a large number of nodes is needed. This paper
extends the local visibility concept of the recent DHT-based URBAN_XOR routing
protocol, which aims to reduce routing table sizes while keeping efficiency
high. Our main contribution is providing a guarantee that if any two nodes are
connected through other nodes, they are able to communicate with each other. We
propose a new route acquisition method that aims to reduce the total amount of
overhead traffic and improve convergence rate. In addition, we introduce an
abstraction for describing the network structure that makes it easy to
understand and analyze. Compared to existing approaches in ad hoc routing, the
new protocol supports the following features: scalability, guaranteed
connectivity assuming network convergence, absence of single points of failure,
low path-stretch, and mobility.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2016 04:38:06 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Zinovyev",
"Anatoliy",
""
],
[
"Mark",
"Brian L.",
""
]
] |
new_dataset
| 0.998462 |
1604.05479
|
Andrew Connor
|
Jacques Foottit, Dave Brown, Stefan Marks and Andy M. Connor
|
A wearable haptic game controller
| null |
International Journal of Game Theory & Technology, 2(1), 1-19
(2016)
|
10.5121/ijgtt.2016.2101
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper outlines the development of a wearable game controller
incorporating vibrotacticle haptic feedback that provides a low cost, versatile
and intuitive interface for controlling digital games. The device differs from
many traditional haptic feedback implementation in that it combines
vibrotactile based haptic feedback with gesture based input, thus becoming a
two way conduit between the user and the virtual environment. The device is
intended to challenge what is considered an "interface" and draws on work in
the area of Actor-Network theory to purposefully blur the boundary between man
and machine. This allows for a more immersive experience, so rather than making
the user feel like they are controlling an aircraft the intuitive interface
allows the user to become the aircraft that is controlled by the movements of
the user's hand. This device invites playful action and thrill. It bridges new
territory on portable and low cost solutions for haptic controllers in a gaming
context.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2016 09:04:34 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Foottit",
"Jacques",
""
],
[
"Brown",
"Dave",
""
],
[
"Marks",
"Stefan",
""
],
[
"Connor",
"Andy M.",
""
]
] |
new_dataset
| 0.99918 |
1604.05487
|
Jan Van Rijn
|
Hendrik Jan Hoogeboom, Walter A. Kosters, Jan N. van Rijn, Jonathan K.
Vis
|
Acyclic Constraint Logic and Games
|
14 pages, originally published at: ICGA Journal Vol. 37, pp. 3-16,
2014
|
ICGA Journal, Vol. 37, pp. 3-16, 2014
| null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Non-deterministic Constraint Logic is a family of graph games introduced by
Demaine and Hearn that facilitates the construction of complexity proofs. It is
convenient for the analysis of games, providing a uniform view. We focus on the
acyclic version, apply this to Klondike, Mahjong Solitaire and Nonogram (that
requires planarity), and discuss the more complicated game of Dou Shou Qi.
While for the first three games we reobtain known characterizations in a simple
and uniform manner, the result for Dou Shou Qi is new.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2016 09:27:32 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Hoogeboom",
"Hendrik Jan",
""
],
[
"Kosters",
"Walter A.",
""
],
[
"van Rijn",
"Jan N.",
""
],
[
"Vis",
"Jonathan K.",
""
]
] |
new_dataset
| 0.998492 |
1604.05510
|
Balagopal Komarath
|
Balagopal Komarath and Jayalal Sarma and Saurabh Sawlani
|
Pebbling Meets Coloring: Reversible Pebble Game On Trees
|
15 pages, 3 figures, Preliminary version appeared in COCOON 2015
| null | null | null |
cs.CC cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The reversible pebble game is a combinatorial game played on rooted DAGs.
This game was introduced by Bennett (1989) motivated by applications in
designing space efficient reversible algorithms. Recently, Chan (2013) showed
that the reversible pebble game number of any DAG is the same as its
Dymond-Tompa pebble number and Raz-Mckenzie pebble number.
We show, as our main result, that for any rooted directed tree T, its
reversible pebble game number is always just one more than the edge rank
coloring number of the underlying undirected tree U of T. It is known that
given a DAG G as input, determining its reversible pebble game number is
PSPACE-hard. Our result implies that the reversible pebble game number of trees
can be computed in polynomial time.
We also address the question of finding the number of steps required to
optimally pebble various families of trees. It is known that trees can be
pebbled in $n^{O(\log(n))}$ steps where $n$ is the number of nodes in the tree.
Using the equivalence between reversible pebble game and the Dymond-Tompa
pebble game (Chan, 2013), we show that complete binary trees can be pebbled in
$n^{O(\log\log(n))}$ steps, a substantial improvement over the naive upper
bound of $n^{O(\log(n))}$. It remains open whether complete binary trees can be
pebbled in polynomial (in $n$) number of steps. Towards this end, we show that
almost optimal (i.e., within a factor of $(1 + \epsilon)$ for any constant
$\epsilon > 0$) pebblings of complete binary trees can be done in polynomial
number of steps.
We also show a time-space trade-off for reversible pebbling for families of
bounded degree trees by a divide-and-conquer approach: for any constant
$\epsilon > 0$, such families can be pebbled using $O(n^\epsilon)$ pebbles in
$O(n)$ steps. This generalizes an analogous result of Kralovic (2001) for
chains.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2016 10:42:29 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Komarath",
"Balagopal",
""
],
[
"Sarma",
"Jayalal",
""
],
[
"Sawlani",
"Saurabh",
""
]
] |
new_dataset
| 0.995923 |
1604.05562
|
Veronika Loitzenbauer
|
Oren Ben-Zwi and Monika Henzinger and Veronika Loitzenbauer
|
Ad Exchange: Envy-Free Auctions with Mediators
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ad exchanges are an emerging platform for trading advertisement slots on the
web with billions of dollars revenue per year. Every time a user visits a web
page, the publisher of that web page can ask an ad exchange to auction off the
ad slots on this page to determine which advertisements are shown at which
price. Due to the high volume of traffic, ad networks typically act as
mediators for individual advertisers at ad exchanges. If multiple advertisers
in an ad network are interested in the ad slots of the same auction, the ad
network might use a "local" auction to resell the obtained ad slots among its
advertisers.
In this work we want to deepen the theoretical understanding of these new
markets by analyzing them from the viewpoint of combinatorial auctions. Prior
work studied mostly single-item auctions, while we allow the advertisers to
express richer preferences over multiple items. We develop a game-theoretic
model for the entanglement of the central auction at the ad exchange with the
local auctions at the ad networks. We consider the incentives of all three
involved parties and suggest a three-party competitive equilibrium, an
extension of the Walrasian equilibrium that ensures envy-freeness for all
participants. We show the existence of a three-party competitive equilibrium
and a polynomial-time algorithm to find one for gross-substitute bidder
valuations.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2016 13:34:08 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Ben-Zwi",
"Oren",
""
],
[
"Henzinger",
"Monika",
""
],
[
"Loitzenbauer",
"Veronika",
""
]
] |
new_dataset
| 0.978004 |
1604.05603
|
Wolfgang Dvo\v{r}\'ak
|
Wolfgang Dvo\v{r}\'ak and Monika Henzinger
|
Online Ad Assignment with an Ad Exchange
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ad exchanges are becoming an increasingly popular way to sell advertisement
slots on the internet. An ad exchange is basically a spot market for ad
impressions. A publisher who has already signed contracts reserving
advertisement impressions on his pages can choose between assigning a new ad
impression for a new page view to a contracted advertiser or to sell it at an
ad exchange. This leads to an online revenue maximization problem for the
publisher. Given a new impression to sell decide whether (a) to assign it to a
contracted advertiser and if so to which one or (b) to sell it at the ad
exchange and if so at which reserve price. We make no assumptions about the
distribution of the advertiser valuations that participate in the ad exchange
and show that there exists a simple primal-dual based online algorithm, whose
lower bound for the revenue converges to $R_{ADX} + R_A (1 - 1/e)$, where
$R_{ADX}$ is the revenue that the optimum algorithm achieves from the ad
exchange and $R_A$ is the revenue that the optimum algorithm achieves from the
contracted advertisers.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2016 14:44:55 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Dvořák",
"Wolfgang",
""
],
[
"Henzinger",
"Monika",
""
]
] |
new_dataset
| 0.990564 |
1604.05623
|
Marco Giordani
|
Marco Giordani, Marco Mezzavilla, Aditya Dhananjay, Sundeep Rangan,
Michele Zorzi
|
Channel Dynamics and SNR Tracking in Millimeter Wave Cellular Systems
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The millimeter wave (mmWave) frequencies are likely to play a significant
role in fifth-generation (5G) cellular systems. A key challenge in developing
systems in these bands is the potential for rapid channel dynamics: since
mmWave signals are blocked by many materials, small changes in the position or
orientation of the handset relative to objects in the environment can cause
large swings in the channel quality. This paper addresses the issue of tracking
the signal to noise ratio (SNR), which is an essential procedure for rate
prediction, handover and radio link failure detection. A simple method for
estimating the SNR from periodic synchronization signals is considered. The
method is then evaluated using real experiments in common blockage scenarios
combined with outdoor statistical models.
|
[
{
"version": "v1",
"created": "Tue, 19 Apr 2016 15:22:57 GMT"
}
] | 2016-04-20T00:00:00 |
[
[
"Giordani",
"Marco",
""
],
[
"Mezzavilla",
"Marco",
""
],
[
"Dhananjay",
"Aditya",
""
],
[
"Rangan",
"Sundeep",
""
],
[
"Zorzi",
"Michele",
""
]
] |
new_dataset
| 0.999329 |
1410.5626
|
Marcel Caria
|
Marcel Caria, Tamal Das, Admela Jukan, Marco Hoffmann
|
Divide and Conquer: Partitioning OSPF networks with SDN
|
8 pages, 7 figures
| null |
10.1109/INM.2015.7140324
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software Defined Networking (SDN) is an emerging network control paradigm
focused on logical centralization and programmability. At the same time,
distributed routing protocols, most notably OSPF and IS-IS, are still prevalent
in IP networks, as they provide shortest path routing, fast topological
convergence after network failures, and, perhaps most importantly, the
confidence based on decades of reliable operation. Therefore, a hybrid SDN/OSPF
operation remains a desirable proposition. In this paper, we propose a new
method of hybrid SDN/OSPF operation. Our method is different from other hybrid
approaches, as it uses SDN nodes to partition an OSPF domain into sub-domains
thereby achieving the traffic engineering capabilities comparable to full SDN
operation. We place SDN-enabled routers as sub-domain border nodes, while the
operation of the OSPF protocol continues unaffected. In this way, the SDN
controller can tune routing protocol updates for traffic engineering purposes
before they are flooded into sub-domains. While local routing inside
sub-domains remains stable at all times, inter-sub-domain routes can be
optimized by determining the routes in each traversed sub-domain. As the
majority of traffic in non-trivial topologies has to traverse multiple
sub-domains, our simulation results confirm that a few SDN nodes allow traffic
engineering up to a degree that renders full SDN deployment unnecessary.
|
[
{
"version": "v1",
"created": "Tue, 21 Oct 2014 12:03:26 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Caria",
"Marcel",
""
],
[
"Das",
"Tamal",
""
],
[
"Jukan",
"Admela",
""
],
[
"Hoffmann",
"Marco",
""
]
] |
new_dataset
| 0.971784 |
1511.00363
|
Matthieu Courbariaux
|
Matthieu Courbariaux, Yoshua Bengio and Jean-Pierre David
|
BinaryConnect: Training Deep Neural Networks with binary weights during
propagations
|
Accepted at NIPS 2015, 9 pages, 3 figures
| null | null | null |
cs.LG cs.CV cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deep Neural Networks (DNN) have achieved state-of-the-art results in a wide
range of tasks, with the best results obtained with large training sets and
large models. In the past, GPUs enabled these breakthroughs because of their
greater computational speed. In the future, faster computation at both training
and test time is likely to be crucial for further progress and for consumer
applications on low-power devices. As a result, there is much interest in
research and development of dedicated hardware for Deep Learning (DL). Binary
weights, i.e., weights which are constrained to only two possible values (e.g.
-1 or 1), would bring great benefits to specialized DL hardware by replacing
many multiply-accumulate operations by simple accumulations, as multipliers are
the most space and power-hungry components of the digital implementation of
neural networks. We introduce BinaryConnect, a method which consists in
training a DNN with binary weights during the forward and backward
propagations, while retaining precision of the stored weights in which
gradients are accumulated. Like other dropout schemes, we show that
BinaryConnect acts as regularizer and we obtain near state-of-the-art results
with BinaryConnect on the permutation-invariant MNIST, CIFAR-10 and SVHN.
|
[
{
"version": "v1",
"created": "Mon, 2 Nov 2015 02:50:05 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Nov 2015 23:31:09 GMT"
},
{
"version": "v3",
"created": "Mon, 18 Apr 2016 13:11:45 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Courbariaux",
"Matthieu",
""
],
[
"Bengio",
"Yoshua",
""
],
[
"David",
"Jean-Pierre",
""
]
] |
new_dataset
| 0.964823 |
1604.04659
|
Ioannis Raptis
|
Martin Sinclair and Ioannis Raptis
|
Dynamic Endpoint Object Conveyance Using a Large-Scale Actuator Network
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-Scale Actuator Networks (LSAN) are a rapidly growing class of
electromechanical systems. A prime application of LSANs in the industrial
sector is distributed manipulation. LSAN's are typically implemented using:
vibrating plates, air jets, and mobile multi-robot teams. This paper
investigates a surface capable of morphing its shape using an array of linear
actuators to impose two dimensional translational movement on a set of objects.
The collective nature of the actuator network overcomes the limitations of the
single Degree of Freedom (DOF) manipulators, and forms a complex topography to
convey multiple objects to a reference location. A derivation of the kinematic
constraints and limitations of an arbitrary multi-cell surface is provided.
These limitations determine the allowable actuator alignments when configuring
the surface. A fusion of simulation and practical results demonstrate the
advantages of using this technology over static feeders.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2016 22:44:18 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Sinclair",
"Martin",
""
],
[
"Raptis",
"Ioannis",
""
]
] |
new_dataset
| 0.999261 |
1604.04667
|
Varun Chandrasekaran
|
Varun Chandrasekaran, Fareeha Amjad, Ashlesh Sharma, Lakshminarayanan
Subramanian
|
Secure Mobile Identities
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The unique identities of every mobile user (phone number,IMSI) and device
(IMEI) are far from secure and are increasingly vulnerable to a variety of
network-level threats. The exceedingly high reliance on the weak SIM
authentication layer does not present any notion of end-to-end security for
mobile users. We propose the design and implementation of Secure Mobile
Identities (SMI), a repetitive key-exchange protocol that uses this weak SIM
authentication as a foundation to enable mobile users to establish stronger
identity authenticity. The security guarantees of SMI are directly reliant on
the mobility of users and are further enhanced by external trusted entities
providing trusted location signatures (e.g. trusted GPS, NFC synchronization
points). In this paper, we demonstrate the efficacy of our protocol using an
implementation and analysis across standard mobility models.
|
[
{
"version": "v1",
"created": "Sat, 16 Apr 2016 00:21:05 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Chandrasekaran",
"Varun",
""
],
[
"Amjad",
"Fareeha",
""
],
[
"Sharma",
"Ashlesh",
""
],
[
"Subramanian",
"Lakshminarayanan",
""
]
] |
new_dataset
| 0.996684 |
1604.04675
|
Hamid Tizhoosh
|
Shujin Zhu, H.R.Tizhoosh
|
Radon Features and Barcodes for Medical Image Retrieval via SVM
|
To appear in proceedings of The 2016 IEEE International Joint
Conference on Neural Networks (IJCNN 2016), July 24-29, 2016, Vancouver,
Canada
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For more than two decades, research has been performed on content-based image
retrieval (CBIR). By combining Radon projections and the support vector
machines (SVM), a content-based medical image retrieval method is presented in
this work. The proposed approach employs the normalized Radon projections with
corresponding image category labels to build an SVM classifier, and the Radon
barcode database which encodes every image in a binary format is also generated
simultaneously to tag all images. To retrieve similar images when a query image
is given, Radon projections and the barcode of the query image are generated.
Subsequently, the k-nearest neighbor search method is applied to find the
images with minimum Hamming distance of the Radon barcode within the same class
predicted by the trained SVM classifier that uses Radon features. The
performance of the proposed method is validated by using the IRMA 2009 dataset
with 14,410 x-ray images in 57 categories. The results demonstrate that our
method has the capacity to retrieve similar responses for the correctly
identified query image and even for those mistakenly classified by SVM. The
approach further is very fast and has low memory requirement.
|
[
{
"version": "v1",
"created": "Sat, 16 Apr 2016 01:13:23 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Zhu",
"Shujin",
""
],
[
"Tizhoosh",
"H. R.",
""
]
] |
new_dataset
| 0.997588 |
1604.04676
|
Hamid Tizhoosh
|
Xinran Liu, Hamid R. Tizhoosh, Jonathan Kofman
|
Generating Binary Tags for Fast Medical Image Retrieval Based on
Convolutional Nets and Radon Transform
|
To appear in proceedings of The 2016 IEEE International Joint
Conference on Neural Networks (IJCNN 2016), July 24-29, 2016, Vancouver,
Canada
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Content-based image retrieval (CBIR) in large medical image archives is a
challenging and necessary task. Generally, different feature extraction methods
are used to assign expressive and invariant features to each image such that
the search for similar images comes down to feature classification and/or
matching. The present work introduces a new image retrieval method for medical
applications that employs a convolutional neural network (CNN) with recently
introduced Radon barcodes. We combine neural codes for global classification
with Radon barcodes for the final retrieval. We also examine image search based
on regions of interest (ROI) matching after image retrieval. The IRMA dataset
with more than 14,000 x-rays images is used to evaluate the performance of our
method. Experimental results show that our approach is superior to many
published works.
|
[
{
"version": "v1",
"created": "Sat, 16 Apr 2016 01:30:01 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Liu",
"Xinran",
""
],
[
"Tizhoosh",
"Hamid R.",
""
],
[
"Kofman",
"Jonathan",
""
]
] |
new_dataset
| 0.954982 |
1604.04723
|
Luka Malisa
|
Luka Malisa and Kari Kostiainen and Thomas Knell and David Sommer and
Srdjan Capkun
|
Hacking in the Blind: (Almost) Invisible Runtime UI Attacks on
Safety-Critical Terminals
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many terminals are used in safety-critical operations in which humans,
through terminal user interfaces, become a part of the system control loop
(e.g., medical and industrial systems). These terminals are typically embedded,
single-purpose devices with restricted functionality, sometimes air-gapped and
increasingly hardened.
We describe a new way of attacking such terminals in which an adversary has
only temporary, non-invasive, physical access to the terminal. In this attack,
the adversary attaches a small device to the interface that connects user input
peripherals to the terminal. The device executes the attack when the authorized
user is performing safety-critical operations, by modifying or blocking user
input, or injecting new input events.
Given that the attacker has access to user input, the execution of this
attack might seem trivial. However, to succeed, the attacker needs to overcome
a number of challenges including the inability to directly observe the user
interface and avoid being detected by the users. We present techniques that
allow user interface state and input tracking. We evaluate these techniques and
show that they can be implemented efficiently. We further evaluate the
effectiveness of our attack through an online user study and find input
modification attacks that are hard for the users to detect and would therefore
lead to serious violations of the input integrity.
|
[
{
"version": "v1",
"created": "Sat, 16 Apr 2016 10:57:06 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Malisa",
"Luka",
""
],
[
"Kostiainen",
"Kari",
""
],
[
"Knell",
"Thomas",
""
],
[
"Sommer",
"David",
""
],
[
"Capkun",
"Srdjan",
""
]
] |
new_dataset
| 0.992489 |
1604.04725
|
Victor Sanchez-Anguix Dr.
|
Victor Sanchez-Anguix, Reyhan Aydogan, Vicente Julian and Catholijn
Jonker
|
Unanimously acceptable agreements for negotiation teams in unpredictable
domains
|
Electronic Commerce Research and Applications, 2014
| null |
10.1016/j.elerap.2014.05.002
| null |
cs.MA cs.AI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A negotiation team is a set of agents with common and possibly also
conflicting preferences that forms one of the parties of a negotiation. A
negotiation team is involved in two decision making processes simultaneously, a
negotiation with the opponents, and an intra-team process to decide on the
moves to make in the negotiation. This article focuses on negotiation team
decision making for circumstances that require unanimity of team decisions.
Existing agent-based approaches only guarantee unanimity in teams negotiating
in domains exclusively composed of predictable and compatible issues. This
article presents a model for negotiation teams that guarantees unanimous team
decisions in domains consisting of predictable and compatible, and also
unpredictable issues. Moreover, the article explores the influence of using
opponent, and team member models in the proposing strategies that team members
use. Experimental results show that the team benefits if team members employ
Bayesian learning to model their teammates' preferences.
|
[
{
"version": "v1",
"created": "Sat, 16 Apr 2016 11:01:44 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Sanchez-Anguix",
"Victor",
""
],
[
"Aydogan",
"Reyhan",
""
],
[
"Julian",
"Vicente",
""
],
[
"Jonker",
"Catholijn",
""
]
] |
new_dataset
| 0.992085 |
1604.04815
|
Yongchao Liu
|
Yongchao Liu, Srinivas Aluru
|
LightScan: Faster Scan Primitive on CUDA Compatible Manycore Processors
|
21 pages, 6 figures, submitted to Journal of Parallel and Distributed
Computing on Jan 09, 2016
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scan (or prefix sum) is a fundamental and widely used primitive in parallel
computing. In this paper, we present LightScan, a faster parallel scan
primitive for CUDA-enabled GPUs, which investigates a hybrid model combining
intra-block computation and inter-block communication to perform a scan. Our
algorithm employs warp shuffle functions to implement fast intra-block
computation and takes advantage of globally coherent L2 cache and the
associated parallel thread execution (PTX) assembly instructions to realize
lightweight inter-block communication. Performance evaluation using a single
Tesla K40c GPU shows that LightScan outperforms existing GPU algorithms and
implementations, and yields a speedup of up to 2.1, 2.4, 1.5 and 1.2 over the
leading CUDPP, Thrust, ModernGPU and CUB implementations running on the same
GPU, respectively. Furthermore, LightScan runs up to 8.9 and 257.3 times faster
than Intel TBB running on 16 CPU cores and an Intel Xeon Phi 5110P coprocessor,
respectively. Source code of LightScan is available at
http://cupbb.sourceforge.net.
|
[
{
"version": "v1",
"created": "Sun, 17 Apr 2016 01:22:58 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Liu",
"Yongchao",
""
],
[
"Aluru",
"Srinivas",
""
]
] |
new_dataset
| 0.997437 |
1604.04953
|
Lianwen Jin
|
Zecheng Xie, Zenghui Sun, Lianwen Jin, Ziyong Feng, Shuye Zhang
|
Fully Convolutional Recurrent Network for Handwritten Chinese Text
Recognition
|
6 pages, 3 figures, 5 tables
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes an end-to-end framework, namely fully convolutional
recurrent network (FCRN) for handwritten Chinese text recognition (HCTR).
Unlike traditional methods that rely heavily on segmentation, our FCRN is
trained with online text data directly and learns to associate the pen-tip
trajectory with a sequence of characters. FCRN consists of four parts: a
path-signature layer to extract signature features from the input pen-tip
trajectory, a fully convolutional network to learn informative representation,
a sequence modeling layer to make per-frame predictions on the input sequence
and a transcription layer to translate the predictions into a label sequence.
The FCRN is end-to-end trainable in contrast to conventional methods whose
components are separately trained and tuned. We also present a refined beam
search method that efficiently integrates the language model to decode the FCRN
and significantly improve the recognition results.
We evaluate the performance of the proposed method on the test sets from the
databases CASIA-OLHWDB and ICDAR 2013 Chinese handwriting recognition
competition, and both achieve state-of-the-art performance with correct rates
of 96.40% and 95.00%, respectively.
|
[
{
"version": "v1",
"created": "Mon, 18 Apr 2016 01:28:28 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Xie",
"Zecheng",
""
],
[
"Sun",
"Zenghui",
""
],
[
"Jin",
"Lianwen",
""
],
[
"Feng",
"Ziyong",
""
],
[
"Zhang",
"Shuye",
""
]
] |
new_dataset
| 0.971478 |
1604.04961
|
Changho Suh
|
Sunghyun Kim, Soheil Mohajer, Changho Suh
|
Role of a Relay in Bursty Multiple Access Channels
|
26 pages, 13 figures, submitted to the IEEE Transactions on
Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the role of a relay in multiple access channels (MACs) with
bursty user traffic, where intermittent data traffic restricts the users to
bursty transmissions. As our main result, we characterize the degrees of
freedom (DoF) region of a $K$-user bursty multi-input multi-output (MIMO)
Gaussian MAC with a relay, where Bernoulli random states are introduced to
govern bursty user transmissions. To that end, we extend the noisy network
coding scheme to achieve the cut-set bound. Our main contribution is in
exploring the role of a relay from various perspectives. First, we show that a
relay can provide a DoF gain in bursty channels, unlike in conventional
non-bursty channels. Interestingly, we find that the relaying gain can scale
with additional antennas at the relay to some extent. Moreover, observing that
a relay can help achieve collision-free performances, we establish the
necessary and sufficient condition for attaining collision-free DoF. Lastly, we
consider scenarios in which some physical perturbation shared around the users
may generate data traffic simultaneously, causing transmission patterns across
them to be correlated. We demonstrate that for most cases in such scenarios,
the relaying gain is greater when the users' transmission patterns are more
correlated, hence when more severe collisions take place. Our results have
practical implications in various scenarios of wireless networks such as
device-to-device systems and random media access control protocols.
|
[
{
"version": "v1",
"created": "Mon, 18 Apr 2016 02:14:44 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Kim",
"Sunghyun",
""
],
[
"Mohajer",
"Soheil",
""
],
[
"Suh",
"Changho",
""
]
] |
new_dataset
| 0.988198 |
1604.04968
|
Xiaohu Ge
|
Xiaohu Ge, Ran Zi, Haichao Wang, Jing Zhang, Minho Jo
|
Multi-user Massive MIMO Communication Systems Based on Irregular Antenna
Arrays
|
15 pages, 8 figures
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In practical mobile communication engineering applications, surfaces of
antenna array deployment regions are usually uneven. Therefore, massive
multi-input-multi-output (MIMO) communication systems usually transmit wireless
signals by irregular antenna arrays. To evaluate the performance of irregular
antenna arrays, the matrix correlation coefficient and ergodic received gain
are defined for massive MIMO communication systems with mutual coupling
effects. Furthermore, the lower bound of the ergodic achievable rate, symbol
error rate (SER) and average outage probability are firstly derived for
multi-user massive MIMO communication systems using irregular antenna arrays.
Asymptotic results are also derived when the number of antennas approaches
infinity. Numerical results indicate that there exists a maximum achievable
rate when the number of antennas keeps increasing in massive MIMO communication
systems using irregular antenna arrays. Moreover, the irregular antenna array
outperforms the regular antenna array in the achievable rate of massive MIMO
communication systems when the number of antennas is larger than or equal to a
given threshold.
|
[
{
"version": "v1",
"created": "Mon, 18 Apr 2016 03:07:26 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Ge",
"Xiaohu",
""
],
[
"Zi",
"Ran",
""
],
[
"Wang",
"Haichao",
""
],
[
"Zhang",
"Jing",
""
],
[
"Jo",
"Minho",
""
]
] |
new_dataset
| 0.988289 |
1604.05058
|
Anna Engelmann
|
Anna Engelmann and Admela Jukan
|
Optical Onion Routing
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As more and more data is transmitted in the configurable optical layer,
whereby all optical switches forward packets without electronic layers
involved, we envision privacy as the intrinsic property of future optical
networks. In this paper, we propose Optical Onion Routing (OOR) routing and
forwarding techniques, inspired by the onion routing in the Internet layer, the
best known realization of anonymous communication today, but designed with
specific features innate to optical networks. We propose to design the optical
anonymization network system with a new optical anonymization node
architecture, including the optical components and their electronic
counterparts to realize layered encryption. We propose modification to the
secret key generation using Linear Feedback Shift Register (LFSR), able to
utilize different primitive irreducible polynomials, and the usage optical XOR
operation as encryption, an important optical technology coming of age. We
prove formally that, for the proposed encryption techniques and distribution of
secret information, the optical onion network is perfectly private and secure.
The paper aims at providing practical foundations for privacy-enhancing optical
network technologies.
|
[
{
"version": "v1",
"created": "Mon, 18 Apr 2016 09:44:51 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Engelmann",
"Anna",
""
],
[
"Jukan",
"Admela",
""
]
] |
new_dataset
| 0.998128 |
1604.05103
|
Ond\v{r}ej Such\'y
|
Ond\v{r}ej Such\'y
|
On Directed Steiner Trees with Multiple Roots
|
28 pages, 3 figures
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new Steiner-type problem for directed graphs named
\textsc{$q$-Root Steiner Tree}. Here one is given a directed graph $G=(V,A)$
and two subsets of its vertices, $R$ of size $q$ and $T$, and the task is to
find a minimum size subgraph of $G$ that contains a path from each vertex of
$R$ to each vertex of $T$. The special case of this problem with $q=1$ is the
well known \textsc{Directed Steiner Tree} problem, while the special case with
$T=R$ is the \textsc{Strongly Connected Steiner Subgraph} problem.
We first show that the problem is W[1]-hard with respect to $|T|$ for any $q
\ge 2$. Then we restrict ourselves to instances with $R \subseteq T$.
Generalizing the methods of Feldman and Ruhl [SIAM J. Comput. 2006], we present
an algorithm for this restriction with running time $O(2^{2q+4|T|}\cdot
n^{2q+O(1)})$, i.e., this restriction is FPT with respect to $|T|$ for any
constant $q$. We further show that we can, without significantly affecting the
achievable running time, loosen the restriction to only requiring that in the
solution there are a vertex $v$ and a path from each vertex of $R$ to $v$ and
from $v$ to each vertex of~$T$.
Finally, we use the methods of Chitnis et al. [SODA 2014] to show that the
restricted version can be solved in planar graphs in $O(2^{O(q \log q+|T|\log
q)}\cdot n^{O(\sqrt{q})})$ time.
|
[
{
"version": "v1",
"created": "Mon, 18 Apr 2016 11:49:34 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Suchý",
"Ondřej",
""
]
] |
new_dataset
| 0.997809 |
1604.05144
|
Jifeng Dai
|
Di Lin, Jifeng Dai, Jiaya Jia, Kaiming He, Jian Sun
|
ScribbleSup: Scribble-Supervised Convolutional Networks for Semantic
Segmentation
|
accepted by CVPR 2016
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Large-scale data is of crucial importance for learning semantic segmentation
models, but annotating per-pixel masks is a tedious and inefficient procedure.
We note that for the topic of interactive image segmentation, scribbles are
very widely used in academic research and commercial software, and are
recognized as one of the most user-friendly ways of interacting. In this paper,
we propose to use scribbles to annotate images, and develop an algorithm to
train convolutional networks for semantic segmentation supervised by scribbles.
Our algorithm is based on a graphical model that jointly propagates information
from scribbles to unmarked pixels and learns network parameters. We present
competitive object semantic segmentation results on the PASCAL VOC dataset by
using scribbles as annotations. Scribbles are also favored for annotating stuff
(e.g., water, sky, grass) that has no well-defined shape, and our method shows
excellent results on the PASCAL-CONTEXT dataset thanks to extra inexpensive
scribble annotations. Our scribble annotations on PASCAL VOC are available at
http://research.microsoft.com/en-us/um/people/jifdai/downloads/scribble_sup
|
[
{
"version": "v1",
"created": "Mon, 18 Apr 2016 13:46:23 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Lin",
"Di",
""
],
[
"Dai",
"Jifeng",
""
],
[
"Jia",
"Jiaya",
""
],
[
"He",
"Kaiming",
""
],
[
"Sun",
"Jian",
""
]
] |
new_dataset
| 0.997965 |
1604.05210
|
Benjamin Irving
|
Benjamin Irving, James M Franklin, Bartlomiej W Papiez, Ewan M
Anderson, Ricky A Sharma, Fergus V Gleeson, Sir Michael Brady and Julia A
Schnabel
|
Pieces-of-parts for supervoxel segmentation with global context:
Application to DCE-MRI tumour delineation
|
accepted for publication in the Journal of Medical Image Analysis
| null |
10.1016/j.media.2016.03.002
| null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
Rectal tumour segmentation in dynamic contrast-enhanced MRI (DCE-MRI) is a
challenging task, and an automated and consistent method would be highly
desirable to improve the modelling and prediction of patient outcomes from
tissue contrast enhancement characteristics - particularly in routine clinical
practice. A framework is developed to automate DCE-MRI tumour segmentation, by
introducing: perfusion-supervoxels to over-segment and classify DCE-MRI volumes
using the dynamic contrast enhancement characteristics; and the pieces-of-parts
graphical model, which adds global (anatomic) constraints that further refine
the supervoxel components that comprise the tumour. The framework was evaluated
on 23 DCE-MRI scans of patients with rectal adenocarcinomas, and achieved a
voxelwise area-under the receiver operating characteristic curve (AUC) of 0.97
compared to expert delineations. Creating a binary tumour segmentation, 21 of
the 23 cases were segmented correctly with a median Dice similarity coefficient
(DSC) of 0.63, which is close to the inter-rater variability of this
challenging task. A sec- ond study is also included to demonstrate the method's
generalisability and achieved a DSC of 0.71. The framework achieves promising
results for the underexplored area of rectal tumour segmentation in DCE-MRI,
and the methods have potential to be applied to other DCE-MRI and supervoxel
segmentation problems
|
[
{
"version": "v1",
"created": "Mon, 18 Apr 2016 15:31:22 GMT"
}
] | 2016-04-19T00:00:00 |
[
[
"Irving",
"Benjamin",
""
],
[
"Franklin",
"James M",
""
],
[
"Papiez",
"Bartlomiej W",
""
],
[
"Anderson",
"Ewan M",
""
],
[
"Sharma",
"Ricky A",
""
],
[
"Gleeson",
"Fergus V",
""
],
[
"Brady",
"Sir Michael",
""
],
[
"Schnabel",
"Julia A",
""
]
] |
new_dataset
| 0.999094 |
1307.4532
|
Martianus Frederic Ezerman
|
Martianus Frederic Ezerman, Somphong Jitman, and Patrick Sol\'e
|
Xing-Ling Codes, Duals of their Subcodes, and Good Asymmetric Quantum
Codes
|
To appear in Designs, Codes and Cryptography (accepted Sep. 27, 2013)
|
Designs, Codes and Cryptography. April 2015, Volume 75, Issue 1,
pp 21-42
|
10.1007/s10623-013-9885-5
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A class of powerful $q$-ary linear polynomial codes originally proposed by
Xing and Ling is deployed to construct good asymmetric quantum codes via the
standard CSS construction. Our quantum codes are $q$-ary block codes that
encode $k$ qudits of quantum information into $n$ qudits and correct up to
$\flr{(d_{x}-1)/2}$ bit-flip errors and up to $\flr{(d_{z}-1)/2}$ phase-flip
errors.. In many cases where the length $(q^{2}-q)/2 \leq n \leq (q^{2}+q)/2$
and the field size $q$ are fixed and for chosen values of $d_{x} \in
\{2,3,4,5\}$ and $d_{z} \ge \delta$, where $\delta$ is the designed distance of
the Xing-Ling (XL) codes, the derived pure $q$-ary asymmetric quantum CSS codes
possess the best possible size given the current state of the art knowledge on
the best classical linear block codes.
|
[
{
"version": "v1",
"created": "Wed, 17 Jul 2013 08:29:12 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Sep 2013 09:48:25 GMT"
}
] | 2016-04-18T00:00:00 |
[
[
"Ezerman",
"Martianus Frederic",
""
],
[
"Jitman",
"Somphong",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.99919 |
1412.6065
|
Elmar Langetepe
|
Rolf Klein (1), Elmar Langetepe (1), Christos Levcopoulos (2) ((1)
University of Bonn, Germany, Institute of Computer Science I, (2) University
of Lund, Sweden, Department of Computer Science)
|
A Fire Fighter's Problem
|
A preliminary version of the paper was presented at SoCG 2015
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose that a circular fire spreads in the plane at unit speed. A single
fire fighter can build a barrier at speed $v>1$. How large must $v$ be to
ensure that the fire can be contained, and how should the fire fighter proceed?
We contribute two results.
First, we analyze the natural curve $\mbox{FF}_v$ that develops when the
fighter keeps building, at speed $v$, a barrier along the boundary of the
expanding fire. We prove that the behavior of this spiralling curve is governed
by a complex function $(e^{w Z} - s \, Z)^{-1}$, where $w$ and $s$ are real
functions of $v$. For $v>v_c=2.6144 \ldots$ all zeroes are complex conjugate
pairs. If $\phi$ denotes the complex argument of the conjugate pair nearest to
the origin then, by residue calculus, the fire fighter needs $\Theta( 1/\phi)$
rounds before the fire is contained. As $v$ decreases towards $v_c$ these two
zeroes merge into a real one, so that argument $\phi$ goes to~0. Thus, curve
$\mbox{FF}_v$ does not contain the fire if the fighter moves at speed $v=v_c$.
(That speed $v>v_c$ is sufficient for containing the fire has been proposed
before by Bressan et al. [7], who constructed a sequence of logarithmic spiral
segments that stay strictly away from the fire.)
Second, we show that any curve that visits the four coordinate half-axes in
cyclic order, and in inreasing distances from the origin, needs speed
$v>1.618\ldots$, the golden ratio, in order to contain the fire.
Keywords: Motion Planning, Dynamic Environments, Spiralling strategies, Lower
and upper bounds
|
[
{
"version": "v1",
"created": "Tue, 2 Dec 2014 10:46:13 GMT"
},
{
"version": "v2",
"created": "Fri, 15 Apr 2016 13:14:03 GMT"
}
] | 2016-04-18T00:00:00 |
[
[
"Klein",
"Rolf",
""
],
[
"Langetepe",
"Elmar",
""
],
[
"Levcopoulos",
"Christos",
""
]
] |
new_dataset
| 0.994007 |
1501.05432
|
Xingyu Wu
|
Xingyu Wu and Xia Mao and Lijiang Chen and Yuli Xue and Angelo Compare
|
Point Context: An Effective Shape Descriptor for RST-invariant
Trajectory Recognition
|
11 pages, 10 figures
|
Journal of Mathematical Imaging and Vision, 2016
|
10.1007/s10851-016-0648-6
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motion trajectory recognition is important for characterizing the moving
property of an object. The speed and accuracy of trajectory recognition rely on
a compact and discriminative feature representation, and the situations of
varying rotation, scaling and translation has to be specially considered. In
this paper we propose a novel feature extraction method for trajectories.
Firstly a trajectory is represented by a proposed point context, which is a
rotation-scale-translation (RST) invariant shape descriptor with a flexible
tradeoff between computational complexity and discrimination, yet we prove that
it is a complete shape descriptor. Secondly, the shape context is nonlinearly
mapped to a subspace by kernel nonparametric discriminant analysis (KNDA) to
get a compact feature representation, and thus a trajectory is projected to a
single point in a low-dimensional feature space. Experimental results show
that, the proposed trajectory feature shows encouraging improvement than
state-of-art methods.
|
[
{
"version": "v1",
"created": "Thu, 22 Jan 2015 09:10:28 GMT"
}
] | 2016-04-18T00:00:00 |
[
[
"Wu",
"Xingyu",
""
],
[
"Mao",
"Xia",
""
],
[
"Chen",
"Lijiang",
""
],
[
"Xue",
"Yuli",
""
],
[
"Compare",
"Angelo",
""
]
] |
new_dataset
| 0.996957 |
1509.01531
|
Sean Meyn
|
Joel Mathias, Rim Kaddah, Ana Bu\v{s}i\'c, Sean Meyn
|
Smart Fridge / Dumb Grid? Demand Dispatch for the Power Grid of 2020
| null |
Proc. 49th Annual Hawaii International Conference on System
Sciences (HICSS), 2016
|
10.1109/HICSS.2016.312
| null |
cs.SY math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In discussions at the 2015 HICSS meeting, it was argued that loads can
provide most of the ancillary services required today and in the future.
Through load-level and grid-level control design, high-quality ancillary
service for the grid is obtained without impacting quality of service delivered
to the consumer. This approach to grid regulation is called demand dispatch:
loads are providing service continuously and automatically, without consumer
interference.
In this paper we ask, what intelligence is required at the grid-level? In
particular, does the grid-operator require more than one-way communication to
the loads? Our main conclusion: risk is not great in lower frequency ranges,
e.g., PJM's RegA or BPA's balancing reserves. In particular, ancillary services
from refrigerators and pool-pumps can be obtained successfully with only
one-way communication. This requires intelligence at the loads, and much less
intelligence at the grid level.
|
[
{
"version": "v1",
"created": "Fri, 4 Sep 2015 17:12:44 GMT"
}
] | 2016-04-18T00:00:00 |
[
[
"Mathias",
"Joel",
""
],
[
"Kaddah",
"Rim",
""
],
[
"Bušić",
"Ana",
""
],
[
"Meyn",
"Sean",
""
]
] |
new_dataset
| 0.974325 |
1604.04291
|
Xia Li
|
Xia Li, Zhen Hu, Robert C. Qiu
|
MIMO UWB Radar System with Compressive Sensing
|
4 pages
| null | null | null |
cs.IT cs.SY math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multiple input multiple output ultra-wideband cognitive radar based on
compressive sensing is presented in this letter. For traditional UWB radar,
high sampling rate analog to digital converter at the receiver is required to
meet Shannon theorem, which increases hardware complexity. In order to bypass
the bottleneck of ADC or further increase the radar bandwidth using the latest
wideband ADC, we propose to exploit CS for signal reconstruction at the
receiver of UWB radar for the sparse targets in the surveillance area. Besides,
the function of narrowband interference cancellation is integrated into the
proposed MIMO UWB radar. The field demonstration proves the feasibility and
reliability of the proposed algorithm.
|
[
{
"version": "v1",
"created": "Thu, 14 Apr 2016 23:58:13 GMT"
}
] | 2016-04-18T00:00:00 |
[
[
"Li",
"Xia",
""
],
[
"Hu",
"Zhen",
""
],
[
"Qiu",
"Robert C.",
""
]
] |
new_dataset
| 0.999485 |
1604.04427
|
Petr Vabishchevich N.
|
Petr N. Vabishchevich
|
A Singularly Perturbed Boundary Value Problems with Fractional Powers of
Elliptic Operators
|
12 pages, 1 figure. arXiv admin note: text overlap with
arXiv:1510.08297, arXiv:1412.5706
| null | null | null |
cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A boundary value problem for a fractional power $0 < \varepsilon < 1$ of the
second-order elliptic operator is considered. The boundary value problem is
singularly perturbed when $\varepsilon \rightarrow 0$. It is solved numerically
using a time-dependent problem for a pseudo-parabolic equation. For the
auxiliary Cauchy problem, the standard two-level schemes with weights are
applied. The numerical results are presented for a model two-dimen\-sional
boundary value problem with a fractional power of an elliptic operator. Our
work focuses on the solution of the boundary value problem with $0 <
\varepsilon \ll 1$.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2016 10:55:47 GMT"
}
] | 2016-04-18T00:00:00 |
[
[
"Vabishchevich",
"Petr N.",
""
]
] |
new_dataset
| 0.999033 |
1604.04465
|
Stefan Schmid
|
Liron Schiff and Stefan Schmid
|
PRI: Privacy Preserving Inspection of Encrypted Network Traffic
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traffic inspection is a fundamental building block of many security solutions
today. For example, to prevent the leakage or exfiltration of confidential
insider information, as well as to block malicious traffic from entering the
network, most enterprises today operate intrusion detection and prevention
systems that inspect traffic. However, the state-of-the-art inspection systems
do not reflect well the interests of the different involved autonomous roles.
For example, employees in an enterprise, or a company outsourcing its network
management to a specialized third party, may require that their traffic remains
confidential, even from the system administrator. Moreover, the rules used by
the intrusion detection system, or more generally the configuration of an
online or offline anomaly detection engine, may be provided by a third party,
e.g., a security research firm, and can hence constitute a critical business
asset which should be kept confidential. Today, it is often believed that
accounting for these additional requirements is impossible, as they contradict
efficiency and effectiveness. We in this paper explore a novel approach, called
Privacy Preserving Inspection (PRI), which provides a solution to this problem,
by preserving privacy of traffic inspection and confidentiality of inspection
rules and configurations, and e.g., also supports the flexible installation of
additional Data Leak Prevention (DLP) rules specific to the company.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2016 12:48:05 GMT"
}
] | 2016-04-18T00:00:00 |
[
[
"Schiff",
"Liron",
""
],
[
"Schmid",
"Stefan",
""
]
] |
new_dataset
| 0.999088 |
1602.01412
|
Hang Qu
|
Hang Qu, Omid Mashayekhi, David Terei, Philip Levis
|
Canary: A Scheduling Architecture for High Performance Cloud Computing
|
We have some presentation issues with the paper
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Canary, a scheduling architecture that allows high performance
analytics workloads to scale out to run on thousands of cores. Canary is
motivated by the observation that a central scheduler is a bottleneck for high
performance codes: a handful of multicore workers can execute tasks faster than
a controller can schedule them.
The key insight in Canary is to reverse the responsibilities between
controllers and workers. Rather than dispatch tasks to workers, which then
fetch data as necessary, in Canary the controller assigns data partitions to
workers, which then spawn and schedule tasks locally.
We evaluate three benchmark applications in Canary on up to 64 servers and
1,152 cores on Amazon EC2. Canary achieves up to 9-90X speedup over Spark and
up to 4X speedup over GraphX, a highly optimized graph analytics engine. While
current centralized schedulers can schedule 2,500 tasks/second, each Canary
worker can schedule 136,000 tasks/second per core and experiments show this
scales out linearly, with 64 workers scheduling over 120 million tasks per
second, allowing Canary to support optimized jobs running on thousands of
cores.
|
[
{
"version": "v1",
"created": "Wed, 3 Feb 2016 18:58:25 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Apr 2016 17:28:06 GMT"
}
] | 2016-04-15T00:00:00 |
[
[
"Qu",
"Hang",
""
],
[
"Mashayekhi",
"Omid",
""
],
[
"Terei",
"David",
""
],
[
"Levis",
"Philip",
""
]
] |
new_dataset
| 0.999757 |
1604.02706
|
Ashkan Kalantari
|
Ashkan Kalantari, Mojtaba Soltanalian, Sina Maleki, Symeon
Chatzinotas, and Bj\"orn Ottersten
|
Secure M-PSK Communication via Directional Modulation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, a directional modulation-based technique is devised to enhance
the security of a multi-antenna wireless communication system employing M-PSK
modulation to convey information. The directional modulation method operates by
steering the array beam in such a way that the phase of the received signal at
the receiver matches that of the intended M-PSK symbol. Due to the difference
between the channels of the legitimate receiver and the eavesdropper, the
signals received by the eavesdropper generally encompass a phase component
different than the actual symbols. As a result, the transceiver which employs
directional modulation can impose a high symbol error rate on the eavesdropper
without requiring to know the eavesdropper's channel. The optimal directional
modulation beamformer is designed to minimize the consumed power subject to
satisfying a specific resulting phase and minimal signal amplitude at each
antenna of the legitimate receiver. The simulation results show that the
directional modulation results in a much higher symbol error rate at the
eavesdropper compared to the conventional benchmark scheme, i.e., zero-forcing
precoding at the transmitter.
|
[
{
"version": "v1",
"created": "Sun, 10 Apr 2016 15:39:07 GMT"
},
{
"version": "v2",
"created": "Thu, 14 Apr 2016 09:43:35 GMT"
}
] | 2016-04-15T00:00:00 |
[
[
"Kalantari",
"Ashkan",
""
],
[
"Soltanalian",
"Mojtaba",
""
],
[
"Maleki",
"Sina",
""
],
[
"Chatzinotas",
"Symeon",
""
],
[
"Ottersten",
"Björn",
""
]
] |
new_dataset
| 0.995064 |
1604.03962
|
Mark Reynolds
|
Mark Reynolds
|
A traditional tree-style tableau for LTL
|
33 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Propositional linear time temporal logic (LTL) is the standard temporal logic
for computing applications and many reasoning techniques and tools have been
developed for it. Tableaux for deciding satisfiability have existed since the
1980s. However, the tableaux for this logic do not look like traditional
tree-shaped tableau systems and their processing is often quite complicated. We
present a new simple traditional-style tree-shaped tableau for LTL and prove
that it is sound and complete. As well as being simple to understand, to
introduce to students and to use manually, it also seems simple to implement
and promises to be competitive in its automation. It is particularly suitable
for parallel implementations.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 20:18:29 GMT"
}
] | 2016-04-15T00:00:00 |
[
[
"Reynolds",
"Mark",
""
]
] |
new_dataset
| 0.999284 |
1604.03968
|
Francis Ferraro
|
Ting-Hao (Kenneth) Huang, Francis Ferraro, Nasrin Mostafazadeh, Ishan
Misra, Aishwarya Agrawal, Jacob Devlin, Ross Girshick, Xiaodong He, Pushmeet
Kohli, Dhruv Batra, C. Lawrence Zitnick, Devi Parikh, Lucy Vanderwende,
Michel Galley, Margaret Mitchell
|
Visual Storytelling
|
to appear in NAACL 2016
| null | null | null |
cs.CL cs.AI cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the first dataset for sequential vision-to-language, and explore
how this data may be used for the task of visual storytelling. The first
release of this dataset, SIND v.1, includes 81,743 unique photos in 20,211
sequences, aligned to both descriptive (caption) and story language. We
establish several strong baselines for the storytelling task, and motivate an
automatic metric to benchmark progress. Modelling concrete description as well
as figurative and social language, as provided in this dataset and the
storytelling task, has the potential to move artificial intelligence from basic
understandings of typical visual scenes towards more and more human-like
understanding of grounded event structure and subjective expression.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 20:27:43 GMT"
}
] | 2016-04-15T00:00:00 |
[
[
"Ting-Hao",
"",
"",
"Kenneth"
],
[
"Huang",
"",
""
],
[
"Ferraro",
"Francis",
""
],
[
"Mostafazadeh",
"Nasrin",
""
],
[
"Misra",
"Ishan",
""
],
[
"Agrawal",
"Aishwarya",
""
],
[
"Devlin",
"Jacob",
""
],
[
"Girshick",
"Ross",
""
],
[
"He",
"Xiaodong",
""
],
[
"Kohli",
"Pushmeet",
""
],
[
"Batra",
"Dhruv",
""
],
[
"Zitnick",
"C. Lawrence",
""
],
[
"Parikh",
"Devi",
""
],
[
"Vanderwende",
"Lucy",
""
],
[
"Galley",
"Michel",
""
],
[
"Mitchell",
"Margaret",
""
]
] |
new_dataset
| 0.999811 |
1604.04139
|
Yassine Hachaichi
|
Yassine Hacha\"ichi (LAMSIN)
|
Logic for Unambiguous Context-Free Languages
| null |
International Journal of Computer Science Theory and Application,
ORB Academic Publisher, 2016, 5 (1), pp.12-19
| null | null |
cs.FL cs.CC cs.DM cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give in this paper a logical characterization for unambiguous Context Free
Languages, in the vein of descriptive complexity. A fragment of the logic
characterizing context free languages given by Lautemann, Schwentick and
Th\'erien [18] based on implicit definability is used for this aim. We obtain a
new connection between two undecidable problems, a logical one and a language
theoretical one.
|
[
{
"version": "v1",
"created": "Wed, 13 Apr 2016 09:40:14 GMT"
}
] | 2016-04-15T00:00:00 |
[
[
"Hachaïchi",
"Yassine",
"",
"LAMSIN"
]
] |
new_dataset
| 0.971855 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.