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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1506.05543
|
Rajib Rana
|
Rajib Rana, Margee Hume, John Reilly, Jeffrey Soar
|
wHealth - Transforming Telehealth Services
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A worldwide increase in proportions of older people in the population poses
the challenge of managing their increasing healthcare needs within limited
resources. To achieve this many countries are interested in adopting telehealth
technology. Several shortcomings of state-of-the-art telehealth technology
constrain widespread adoption of telehealth services. We present an
ensemble-sensing framework - wHealth (short form of wireless health) for
effective delivery of telehealth services. It extracts personal health
information using sensors embedded in everyday devices and allows effective and
seamless communication between patients and clinicians. Due to the
non-stigmatizing design, ease of maintenance, simplistic interaction and
seamless intervention, our wHealth platform has the potential to enable
widespread adoption of telehealth services for managing elderly healthcare. We
discuss the key barriers and potential solutions to make the wHealth platform a
reality.
|
[
{
"version": "v1",
"created": "Thu, 18 Jun 2015 03:44:12 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Rana",
"Rajib",
""
],
[
"Hume",
"Margee",
""
],
[
"Reilly",
"John",
""
],
[
"Soar",
"Jeffrey",
""
]
] |
new_dataset
| 0.988852 |
1506.05693
|
Bernard Cousin
|
Omar Smail, Bernard Cousin (UR1, ATNET), Zoulikha Mekkakia, Rachida
Mekki
|
A multipath energy-conserving routing protocol for wireless ad hoc
networks lifetime improvement
| null |
EURASIP Journal on Wireless Communications and Networking,
SpringerOpen, 2014, 2014 (139), pp. 1 - 22
|
10.1186/1687-1499-2014-139
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Ad hoc networks are wireless mobile networks that can operate without
infrastructure and without centralized network management. Traditional
techniques of routing are not well adapted. Indeed, their lack of reactivity
with respect to the variability of network changes makes them difficult to use.
Moreover, conserving energy is a critical concern in the design of routing
protocols for ad hoc networks, because most mobile nodes operate with limited
battery capacity, and the energy depletion of a node affects not only the node
itself but also the overall network lifetime. In all proposed single-path
routing schemes a new path-discovery process is required once a path failure is
detected, and this process causes delay and wastage of node resources. A
multipath routing scheme is an alternative to maximize the network lifetime. In
this paper, we propose an energy-efficient multipath routing protocol, called
AOMR-LM (Ad hoc On-demand Multipath Routing with Lifetime Maximization), which
preserves the residual energy of nodes and balances the consumed energy to
increase the network lifetime. To achieve this goal, we used the residual
energy of nodes for calculating the node energy level. The multipath selection
mechanism uses this energy level to classify the paths. Two parameters are
analyzed: the energy threshold beta and the coefficient alpha. These parameters
are required to classify the nodes and to ensure the preservation of node
energy. Our protocol improves the performance of mobile ad hoc networks by
prolonging the lifetime of the network. This novel protocol has been compared
with other protocols: AOMDV and ZD-AOMDV. The protocol performance has been
evaluated in terms of network lifetime, energy consumption, and end-to-end
delay.
|
[
{
"version": "v1",
"created": "Thu, 18 Jun 2015 14:25:53 GMT"
}
] | 2015-06-19T00:00:00 |
[
[
"Smail",
"Omar",
"",
"UR1, ATNET"
],
[
"Cousin",
"Bernard",
"",
"UR1, ATNET"
],
[
"Mekkakia",
"Zoulikha",
""
],
[
"Mekki",
"Rachida",
""
]
] |
new_dataset
| 0.993534 |
1312.1732
|
Gerard Vidal
|
Gerard Vidal, Murilo Baptista, Hector Mancini
|
A fast and light stream cipher for smartphones
| null | null |
10.1140/epjst/e2014-02185-y
| null |
cs.CR nlin.CD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a stream cipher based on a chaotic dynamical system. Using a
chaotic trajectory sampled under certain rules in order to avoid any attempt to
reconstruct the original one, we create a binary pseudo-random keystream that
can only be exactly reproduced by someone that has fully knowledge of the
communication system parameters formed by a transmitter and a receiver and
sharing the same initial conditions. The plaintext is XORed with the keystream
creating the ciphertext, the encrypted message. This keystream passes the NISTs
randomness test and has been implemented in a videoconference App for
smartphones, in order to show the fast and light nature of the proposed
encryption system.
|
[
{
"version": "v1",
"created": "Thu, 5 Dec 2013 23:26:21 GMT"
}
] | 2015-06-18T00:00:00 |
[
[
"Vidal",
"Gerard",
""
],
[
"Baptista",
"Murilo",
""
],
[
"Mancini",
"Hector",
""
]
] |
new_dataset
| 0.991188 |
1401.7229
|
Rui Wang
|
Rui Wang and Xiaojun Yuan
|
MIMO Multiway Relaying with Pairwise Data Exchange: A Degrees of Freedom
Perspective
|
13 pages, 7 figures
| null |
10.1109/TSP.2014.2347924
| null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper, we study achievable degrees of freedom (DoF) of a
multiple-input multiple-output (MIMO) multiway relay channel (mRC) where $K$
users, each equipped with $M$ antennas, exchange messages in a pairwise manner
via a common $N$-antenna relay node. % A novel and systematic way of joint
beamforming design at the users and at the relay is proposed to align signals
for efficient implementation of physical-layer network coding (PNC). It is
shown that, when the user number $K=3$, the proposed beamforming design can
achieve the DoF capacity of the considered mRC for any $(M,N)$ setups. % For
the scenarios with $K>3$, we show that the proposed signaling scheme can be
improved by disabling a portion of relay antennas so as to align signals more
efficiently. Our analysis reveals that the obtained achievable DoF is always
piecewise linear, and is bounded either by the number of user antennas $M$ or
by the number of relay antennas $N$. Further, we show that the DoF capacity can
be achieved for $\frac{M}{N} \in \left(0,\frac{K-1}{K(K-2)} \right]$ and
$\frac{M}{N} \in \left[\frac{1}{K(K-1)}+\frac{1}{2},\infty \right)$, which
provides a broader range of the DoF capacity than the existing results.
Asymptotic DoF as $K\rightarrow \infty$ is also derived based on the proposed
signaling scheme.
|
[
{
"version": "v1",
"created": "Tue, 28 Jan 2014 15:45:17 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Aug 2014 10:31:58 GMT"
}
] | 2015-06-18T00:00:00 |
[
[
"Wang",
"Rui",
""
],
[
"Yuan",
"Xiaojun",
""
]
] |
new_dataset
| 0.987115 |
1402.1219
|
Brian Tierney
|
Brian B. Tierney and Anthony Grbic
|
Planar Shielded-Loop Resonators
| null | null |
10.1109/TAP.2014.2314305
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The design and analysis of planar shielded-loop resonators for use in
wireless non-radiative power transfer systems is presented. The difficulties
associated with coaxial shielded-loop resonators for wireless power transfer
are discussed and planar alternatives are proposed. The currents along these
planar structures are analyzed and first-order design equations are presented
in the form of a circuit model. In addition, the planar structures are
simulated and fabricated. Planar shielded-loop resonators are compact and
simple to fabricate. Moreover, they are well-suited for printed circuit board
designs or integrated circuits
|
[
{
"version": "v1",
"created": "Thu, 6 Feb 2014 00:50:00 GMT"
}
] | 2015-06-18T00:00:00 |
[
[
"Tierney",
"Brian B.",
""
],
[
"Grbic",
"Anthony",
""
]
] |
new_dataset
| 0.99845 |
1402.5265
|
Rami Mochaourab
|
Rami Mochaourab and Eduard Jorswieck
|
Coalitional Games in MISO Interference Channels: Epsilon-Core and
Coalition Structure Stable Set
|
to appear in IEEE Transactions on Signal Processing, 14 pages, 14
figures, 3 tables
| null |
10.1109/TSP.2014.2367466
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The multiple-input single-output interference channel is considered. Each
transmitter is assumed to know the channels between itself and all receivers
perfectly and the receivers are assumed to treat interference as additive
noise. In this setting, noncooperative transmission does not take into account
the interference generated at other receivers which generally leads to
inefficient performance of the links. To improve this situation, we study
cooperation between the links using coalitional games. The players (links) in a
coalition either perform zero forcing transmission or Wiener filter precoding
to each other. The $\epsilon$-core is a solution concept for coalitional games
which takes into account the overhead required in coalition deviation. We
provide necessary and sufficient conditions for the strong and weak
$\epsilon$-core of our coalitional game not to be empty with zero forcing
transmission. Since, the $\epsilon$-core only considers the possibility of
joint cooperation of all links, we study coalitional games in partition form in
which several distinct coalitions can form. We propose a polynomial time
distributed coalition formation algorithm based on coalition merging and prove
that its solution lies in the coalition structure stable set of our coalition
formation game. Simulation results reveal the cooperation gains for different
coalition formation complexities and deviation overhead models.
|
[
{
"version": "v1",
"created": "Fri, 21 Feb 2014 11:55:42 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Jun 2014 15:12:14 GMT"
},
{
"version": "v3",
"created": "Fri, 31 Oct 2014 18:13:58 GMT"
},
{
"version": "v4",
"created": "Wed, 12 Nov 2014 17:38:05 GMT"
}
] | 2015-06-18T00:00:00 |
[
[
"Mochaourab",
"Rami",
""
],
[
"Jorswieck",
"Eduard",
""
]
] |
new_dataset
| 0.952487 |
1506.01598
|
Ghislain Fourny
|
Ghislain Fourny
|
decimalInfinite: All Decimals In Bits, No Loss, Same Order, Simple
|
Technical report, 9 pages
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a binary encoding that supports arbitrarily large,
small and precise decimals. It completely preserves information and order. It
does not rely on any arbitrary use-case-based choice of calibration and is
readily implementable and usable, as is. Finally, it is also simple to explain
and understand.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2015 14:09:47 GMT"
},
{
"version": "v2",
"created": "Wed, 17 Jun 2015 12:01:04 GMT"
}
] | 2015-06-18T00:00:00 |
[
[
"Fourny",
"Ghislain",
""
]
] |
new_dataset
| 0.999544 |
1506.05257
|
Daniel J Mankowitz
|
Daniel J. Mankowitz and Ehud Rivlin
|
CFORB: Circular FREAK-ORB Visual Odometry
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel Visual Odometry algorithm entitled Circular FREAK-ORB
(CFORB). This algorithm detects features using the well-known ORB algorithm
[12] and computes feature descriptors using the FREAK algorithm [14]. CFORB is
invariant to both rotation and scale changes, and is suitable for use in
environments with uneven terrain. Two visual geometric constraints have been
utilized in order to remove invalid feature descriptor matches. These
constraints have not previously been utilized in a Visual Odometry algorithm. A
variation to circular matching [16] has also been implemented. This allows
features to be matched between images without having to be dependent upon the
epipolar constraint. This algorithm has been run on the KITTI benchmark dataset
and achieves a competitive average translational error of $3.73 \%$ and average
rotational error of $0.0107 deg/m$. CFORB has also been run in an indoor
environment and achieved an average translational error of $3.70 \%$. After
running CFORB in a highly textured environment with an approximately uniform
feature spread across the images, the algorithm achieves an average
translational error of $2.4 \%$ and an average rotational error of $0.009
deg/m$.
|
[
{
"version": "v1",
"created": "Wed, 17 Jun 2015 09:44:42 GMT"
}
] | 2015-06-18T00:00:00 |
[
[
"Mankowitz",
"Daniel J.",
""
],
[
"Rivlin",
"Ehud",
""
]
] |
new_dataset
| 0.996186 |
1203.4031
|
Eric Polizzi
|
Eric Polizzi, James Kestyn
|
FEAST Eigenvalue Solver v3.0 User Guide
|
37 pages, 10 Figures, 12 Tables
| null | null | null |
cs.MS cs.CE physics.chem-ph physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The FEAST eigensolver package is a free high-performance numerical library
for solving the Hermitian and non-Hermitian eigenvalue problems, and obtaining
all the eigenvalues and (right/left) eigenvectors within a given search
interval or arbitrary contour in the complex plane. Its originality lies with a
new transformative numerical approach to the traditional eigenvalue algorithm
design - the FEAST algorithm. The FEAST eigensolver combines simplicity and
efficiency and it offers many important capabilities for achieving high
performance, robustness, accuracy, and scalability on parallel architectures.
FEAST is both a comprehensive library package, and an easy to use software. It
includes flexible reverse communication interfaces and ready to use predefined
interfaces for dense, banded and sparse systems. The current version v3.0 of
the FEAST package can address both Hermitian and non-Hermitian eigenvalue
problems (real symmetric, real non-symmetric, complex Hermitian, complex
symmetric, or complex general systems) on both shared-memory and distributed
memory architectures (i.e contains both FEAST-SMP and FEAST-MPI packages). This
User's guide provides instructions for installation setup, a detailed
description of the FEAST interfaces and a large number of examples.
|
[
{
"version": "v1",
"created": "Mon, 19 Mar 2012 03:47:55 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Feb 2013 02:31:28 GMT"
},
{
"version": "v3",
"created": "Tue, 16 Jun 2015 15:47:52 GMT"
}
] | 2015-06-17T00:00:00 |
[
[
"Polizzi",
"Eric",
""
],
[
"Kestyn",
"James",
""
]
] |
new_dataset
| 0.967794 |
1311.0058
|
R. J. Sobie
|
Ian Gable, Michael Chester, Patrick Armstrong, Frank Berghaus, Andre
Charbonneau, Colin Leavett-Brown, Michael Paterson, Robert Prior, Randall
Sobie, Ryan Taylor
|
Dynamic web cache publishing for IaaS clouds using Shoal
|
Conference paper at the 2013 Computing in HEP (CHEP) Conference,
Amsterdam
| null |
10.1088/1742-6596/513/3/032035
| null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have developed a highly scalable application, called Shoal, for tracking
and utilizing a distributed set of HTTP web caches. Squid servers advertise
their existence to the Shoal server via AMQP messaging by running Shoal Agent.
The Shoal server provides a simple REST interface that allows clients to
determine their closest Squid cache. Our goal is to dynamically instantiate
Squid caches on IaaS clouds in response to client demand. Shoal provides the
VMs on IaaS clouds with the location of the nearest dynamically instantiated
Squid Cache. In this paper, we describe the design and performance of Shoal.
|
[
{
"version": "v1",
"created": "Thu, 31 Oct 2013 22:43:01 GMT"
}
] | 2015-06-17T00:00:00 |
[
[
"Gable",
"Ian",
""
],
[
"Chester",
"Michael",
""
],
[
"Armstrong",
"Patrick",
""
],
[
"Berghaus",
"Frank",
""
],
[
"Charbonneau",
"Andre",
""
],
[
"Leavett-Brown",
"Colin",
""
],
[
"Paterson",
"Michael",
""
],
[
"Prior",
"Robert",
""
],
[
"Sobie",
"Randall",
""
],
[
"Taylor",
"Ryan",
""
]
] |
new_dataset
| 0.994633 |
1311.0790
|
Nicholas Miller
|
Nicholas C. Miller, Andrew D. Baczewski, John D. Albrecht, and
Balasubramaniam Shanker
|
A Discontinuous Galerkin Time Domain Framework for Periodic Structures
Subject To Oblique Excitation
|
Submitted to IEEE TAP on August 5th, 2013. Revision submitted on
February 3rd, 2014
| null |
10.1109/TAP.2014.2324012
| null |
cs.CE
|
http://creativecommons.org/licenses/by/3.0/
|
A nodal Discontinuous Galerkin (DG) method is derived for the analysis of
time-domain (TD) scattering from doubly periodic PEC/dielectric structures
under oblique interrogation. Field transformations are employed to elaborate a
formalism that is free from any issues with causality that are common when
applying spatial periodic boundary conditions simultaneously with incident
fields at arbitrary angles of incidence. An upwind numerical flux is derived
for the transformed variables, which retains the same form as it does in the
original Maxwell problem for domains without explicitly imposed periodicity.
This, in conjunction with the amenability of the DG framework to non-conformal
meshes, provides a natural means of accurately solving the first order TD
Maxwell equations for a number of periodic systems of engineering interest.
Results are presented that substantiate the accuracy and utility of our method.
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2013 17:48:27 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Feb 2014 17:29:17 GMT"
}
] | 2015-06-17T00:00:00 |
[
[
"Miller",
"Nicholas C.",
""
],
[
"Baczewski",
"Andrew D.",
""
],
[
"Albrecht",
"John D.",
""
],
[
"Shanker",
"Balasubramaniam",
""
]
] |
new_dataset
| 0.999402 |
1506.04861
|
Omrit Filtser
|
Omrit Filtser and Matthew J. Katz
|
The Discrete Fr\'echet Gap
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce the discrete Fr\'echet gap and its variants as an alternative
measure of similarity between polygonal curves. We believe that for some
applications the new measure (and its variants) may better reflect our
intuitive notion of similarity than the discrete Fr\'echet distance (and its
variants), since the latter measure is indifferent to (matched) pairs of points
that are relatively close to each other. Referring to the frogs analogy by
which the discrete Fr\'echet distance is often described, the discrete
Fr\'echet gap is the minimum difference between the longest and shortest
positions of the leash needed for the frogs to traverse their point sequences.
We present an optimization scheme, which is suitable for any monotone
function defined for pairs of distances such as the gap and ratio functions. We
apply this scheme to two variants of the discrete Fr\'echet gap, namely, the
one-sided discrete Fr\'echet gap with shortcuts and the weak discrete Fr\'echet
gap, to obtain $O(n^2 \log^2 n)$-time algorithms for computing them.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2015 07:19:26 GMT"
}
] | 2015-06-17T00:00:00 |
[
[
"Filtser",
"Omrit",
""
],
[
"Katz",
"Matthew J.",
""
]
] |
new_dataset
| 0.998406 |
1506.04904
|
Reza Sabzevari
|
Jonas Schuler, Reza Sabzevari and Davide Scaramuzza
|
LightPanel: Active Mobile Platform for Dense 3D Modelling
|
12 pages
| null | null | null |
cs.RO cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a novel platform for dense 3D modelling. This
platform is an active image acquisition setup assisted with a set of light
sources and a distance sensor. The hardware setup is designed for being mounted
on a mobile robot which is remotely driven to create accurate dense 3D models
from out-of-reach objects. For this reason, the object is actively illuminated
by the imaging setup and Photometric Stereo is used to recover the dense 3D
model. The proposed image acquisition setup, called LightPanel, is described
from design to calibration and discusses the practical challenges of using
Photometric Stereo under uncontrolled lighting conditions.
|
[
{
"version": "v1",
"created": "Tue, 16 Jun 2015 10:30:34 GMT"
}
] | 2015-06-17T00:00:00 |
[
[
"Schuler",
"Jonas",
""
],
[
"Sabzevari",
"Reza",
""
],
[
"Scaramuzza",
"Davide",
""
]
] |
new_dataset
| 0.996521 |
1506.05071
|
Sireesha Chiliveri
|
C. Sireesha, G. Jyostna, P. Raghu Varan, and P. R. L. Eswari
|
PROP - Patronage of PHP Web Applications
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
PHP is one of the most commonly used languages to develop web sites because
of its simplicity, easy to learn and it can be easily embedded with any of the
databases. A web developer with his basic knowledge developing an application
without practising secure guidelines, improper validation of user inputs leads
to various source code vulnerabilities. Logical flaws while designing,
implementing and hosting the web application causes work flow deviation
attacks. In this paper, we are analyzing the complete behaviour of a web
application through static and dynamic analysis methodologies.
|
[
{
"version": "v1",
"created": "Mon, 15 Jun 2015 11:08:05 GMT"
}
] | 2015-06-17T00:00:00 |
[
[
"Sireesha",
"C.",
""
],
[
"Jyostna",
"G.",
""
],
[
"Varan",
"P. Raghu",
""
],
[
"Eswari",
"P. R. L.",
""
]
] |
new_dataset
| 0.995011 |
1506.05073
|
Dorai Ashok S A
|
Dorai Ashok Shanmugavel Anbalagan
|
Secure Shell (SSH): Public Key Authentication over Hypertext Transfer
Protocol (HTTP)
|
7 pages
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Secure Shell (SSH) protocol requires all implementations to support public
key authentication method ("publickey") for authentication purposes, so web
applications which provide a SSH client over the web browser need to support
"publickey". However, restrictions in Hypertext Transfer Protocol (HTTP), such
as same origin policy, and limited access to local resources, make it difficult
to perform such authentications. In this document, a system to perform
"publickey" authentication over HTTP is provided. It is ensured that no
compromise is made that would pose a security risk to SSH protocol.
|
[
{
"version": "v1",
"created": "Mon, 15 Jun 2015 11:47:11 GMT"
}
] | 2015-06-17T00:00:00 |
[
[
"Anbalagan",
"Dorai Ashok Shanmugavel",
""
]
] |
new_dataset
| 0.999233 |
1306.3529
|
Alexandre J. Raymond
|
Alexandre J. Raymond and Warren J. Gross
|
Scalable Successive-Cancellation Hardware Decoder for Polar Codes
| null | null |
10.1109/TSP.2014.2347262
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes, discovered by Ar{\i}kan, are the first error-correcting codes
with an explicit construction to provably achieve channel capacity,
asymptotically. However, their error-correction performance at finite lengths
tends to be lower than existing capacity-approaching schemes. Using the
successive-cancellation algorithm, polar decoders can be designed for very long
codes, with low hardware complexity, leveraging the regular structure of such
codes. We present an architecture and an implementation of a scalable hardware
decoder based on this algorithm. This design is shown to scale to code lengths
of up to N = 2^20 on an Altera Stratix IV FPGA, limited almost exclusively by
the amount of available SRAM.
|
[
{
"version": "v1",
"created": "Fri, 14 Jun 2013 23:38:58 GMT"
}
] | 2015-06-16T00:00:00 |
[
[
"Raymond",
"Alexandre J.",
""
],
[
"Gross",
"Warren J.",
""
]
] |
new_dataset
| 0.995925 |
1307.2785
|
Yu-Ru Lin
|
Yu-Ru Lin, Brian Keegan, Drew Margolin, David Lazer
|
Rising tides or rising stars?: Dynamics of shared attention on Twitter
during media events
|
13 pages, 6 figures
| null |
10.1371/journal.pone.0094093
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
"Media events" such as political debates generate conditions of shared
attention as many users simultaneously tune in with the dual screens of
broadcast and social media to view and participate. Are collective patterns of
user behavior under conditions of shared attention distinct from other "bursts"
of activity like breaking news events? Using data from a population of
approximately 200,000 politically-active Twitter users, we compare features of
their behavior during eight major events during the 2012 U.S. presidential
election to examine (1) the impact of "media events" have on patterns of social
media use compared to "typical" time and (2) whether changes during media
events are attributable to changes in behavior across the entire population or
an artifact of changes in elite users' behavior. Our findings suggest that
while this population became more active during media events, this additional
activity reflects concentrated attention to a handful of users, hashtags, and
tweets. Our work is the first study on distinguishing patterns of large-scale
social behavior under condition of uncertainty and shared attention, suggesting
new ways of mining information from social media to support collective
sensemaking following major events.
|
[
{
"version": "v1",
"created": "Wed, 10 Jul 2013 13:27:32 GMT"
}
] | 2015-06-16T00:00:00 |
[
[
"Lin",
"Yu-Ru",
""
],
[
"Keegan",
"Brian",
""
],
[
"Margolin",
"Drew",
""
],
[
"Lazer",
"David",
""
]
] |
new_dataset
| 0.989137 |
1501.00657
|
Scott A. Hale
|
Scott A. Hale
|
Cross-language Wikipedia Editing of Okinawa, Japan
|
In Proceedings of the SIGCHI Conference on Human Factors in Computing
Systems, CHI 2015. ACM
| null |
10.1145/2702123.2702346
| null |
cs.CY cs.CL cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article analyzes users who edit Wikipedia articles about Okinawa, Japan,
in English and Japanese. It finds these users are among the most active and
dedicated users in their primary languages, where they make many large,
high-quality edits. However, when these users edit in their non-primary
languages, they tend to make edits of a different type that are overall smaller
in size and more often restricted to the narrow set of articles that exist in
both languages. Design changes to motivate wider contributions from users in
their non-primary languages and to encourage multilingual users to transfer
more information across language divides are presented.
|
[
{
"version": "v1",
"created": "Sun, 4 Jan 2015 10:10:32 GMT"
},
{
"version": "v2",
"created": "Sun, 22 Mar 2015 16:19:48 GMT"
}
] | 2015-06-16T00:00:00 |
[
[
"Hale",
"Scott A.",
""
]
] |
new_dataset
| 0.976959 |
1505.05123
|
Santhosh Kumar
|
Santhosh Kumar and Henry D. Pfister
|
Reed-Muller Codes Achieve Capacity on Erasure Channels
|
(v2) Added Section V (titled 'Discussion') and a detailed discussion
of primitive narrow-sense BCH codes (Section IV-C)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new approach to proving that a sequence of
deterministic linear codes achieves capacity on an erasure channel under
maximum a posteriori decoding. Rather than relying on the precise structure of
the codes, this method requires only that the codes are highly symmetric. In
particular, the technique applies to any sequence of linear codes where the
blocklengths are strictly increasing, the code rates converge to a number
between 0 and 1, and the permutation group of each code is doubly transitive.
This also provides a rare example in information theory where symmetry alone
implies near-optimal performance.
An important consequence of this result is that a sequence of Reed-Muller
codes with increasing blocklength achieves capacity if its code rate converges
to a number between 0 and 1. This possibility has been suggested previously in
the literature but it has only been proven for cases where the limiting code
rate is 0 or 1. Moreover, these results extend naturally to affine-invariant
codes and, thus, to all extended primitive narrow-sense BCH codes. The primary
tools used in the proof are the sharp threshold property for monotone boolean
functions and the area theorem for extrinsic information transfer functions.
|
[
{
"version": "v1",
"created": "Tue, 19 May 2015 19:29:26 GMT"
},
{
"version": "v2",
"created": "Mon, 15 Jun 2015 17:36:40 GMT"
}
] | 2015-06-16T00:00:00 |
[
[
"Kumar",
"Santhosh",
""
],
[
"Pfister",
"Henry D.",
""
]
] |
new_dataset
| 0.987912 |
1506.02082
|
Philip Baback Alipour
|
Philip B. Alipour, Matteus Magnusson, Martin W. Olsson, Nooshin H.
Ghasemi, Lawrence Henesey
|
A Real-time Cargo Damage Management System via a Sorting Array
Triangulation Technique
|
This article is a report on a developed IDSS system/prototype aimed
to be published for a journal conference proceedings and/or a full paper
under Computer Science and Software Engineering categories. 28 pages; 10
Figures including graphs; 5 tables; presentation file is available at
http://web.uvic.ca/~phibal12/Presentations/IDSS_proj.pptx Ask authors for
full code and/or other files
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report covers an intelligent decision support system (IDSS), which
handles an efficient and effective way to rapidly inspect containerized cargos
for defection. Defection is either cargo exposure to radiation, physical
damages such as holes, punctured surfaces, iron surface oxidation, etc. The
system uses a sorting array triangulation technique (SAT) and surface damage
detection (SDD) to conduct the inspection. This new technique saves time and
money on finding damaged goods during transportation such that, instead of
running $n$ inspections on $n$ containers, only 3 inspections per triangulation
or a ratio of $3:n$ is required, assuming $n > 3$ containers. The damaged stack
in the array is virtually detected contiguous to an actually-damaged cargo by
calculating nearby distances of such cargos, delivering reliable estimates for
the whole local stack population. The estimated values on damaged, somewhat
damaged and undamaged cargo stacks, are listed and profiled after being sorted
by the program, thereby submitted to the manager for a final decision. The
report describes the problem domain and the implementation of the simulator
prototype, showing how the system operates via software, hardware with/without
human agents, conducting real-time inspections and management per se.
|
[
{
"version": "v1",
"created": "Fri, 5 Jun 2015 22:56:18 GMT"
},
{
"version": "v2",
"created": "Sun, 14 Jun 2015 20:49:46 GMT"
}
] | 2015-06-16T00:00:00 |
[
[
"Alipour",
"Philip B.",
""
],
[
"Magnusson",
"Matteus",
""
],
[
"Olsson",
"Martin W.",
""
],
[
"Ghasemi",
"Nooshin H.",
""
],
[
"Henesey",
"Lawrence",
""
]
] |
new_dataset
| 0.998807 |
1506.04228
|
Grigor Iliev
|
Grigor Iliev, Nadezhda Borisova, Elena Karashtranova, Dafina
Kostadinova
|
A Publicly Available Cross-Platform Lemmatizer for Bulgarian
|
5 pages, Sixth International Scientific Conference - FMNS2015
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Our dictionary-based lemmatizer for the Bulgarian language presented here is
distributed as free software, publicly available to download and use under the
GPL v3 license. The presented software is written entirely in Java and is
distributed as a GATE plugin. To our best knowledge, at the time of writing
this article, there are not any other free lemmatization tools specifically
targeting the Bulgarian language. The presented lemmatizer is a work in
progress and currently yields an accuracy of about 95% in comparison to the
manually annotated corpus BulTreeBank-Morph, which contains 273933 tokens.
|
[
{
"version": "v1",
"created": "Sat, 13 Jun 2015 05:47:50 GMT"
}
] | 2015-06-16T00:00:00 |
[
[
"Iliev",
"Grigor",
""
],
[
"Borisova",
"Nadezhda",
""
],
[
"Karashtranova",
"Elena",
""
],
[
"Kostadinova",
"Dafina",
""
]
] |
new_dataset
| 0.995774 |
1506.04498
|
Satoshi Egi
|
Satoshi Egi
|
Egison: Non-Linear Pattern-Matching against Non-Free Data Types
|
9 pages. arXiv admin note: text overlap with arXiv:1407.0729
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces the Egison programming language whose feature is strong
pattern-matching facility against not only algebraic data types but also
non-free data types whose data have multiple ways of representation such as
sets and graphs. Our language supports multiple occurrences of the same
variables in a pattern, multiple results of pattern-matching, polymorphism of
pattern-constructors and loop-patterns, patterns that contain "and-so-forth"
whose repeat count can be changed by the parameter. This paper proposes the way
to design expressions that have all these features and demonstrates how these
features are useful to express programs concise. Egison has already implemented
in Haskell.
|
[
{
"version": "v1",
"created": "Mon, 15 Jun 2015 07:48:14 GMT"
}
] | 2015-06-16T00:00:00 |
[
[
"Egi",
"Satoshi",
""
]
] |
new_dataset
| 0.97658 |
1506.04549
|
Moritz Horsch
|
Moritz Horsch, Andreas H\"ulsing, Johannes Buchmann
|
PALPAS - PAsswordLess PAssword Synchronization
|
An extended abstract of this work appears in the proceedings of ARES
2015
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tools that synchronize passwords over several user devices typically store
the encrypted passwords in a central online database. For encryption, a
low-entropy, password-based key is used. Such a database may be subject to
unauthorized access which can lead to the disclosure of all passwords by an
offline brute-force attack. In this paper, we present PALPAS, a secure and
user-friendly tool that synchronizes passwords between user devices without
storing information about them centrally. The idea of PALPAS is to generate a
password from a high entropy secret shared by all devices and a random salt
value for each service. Only the salt values are stored on a server but not the
secret. The salt enables the user devices to generate the same password but is
statistically independent of the password. In order for PALPAS to generate
passwords according to different password policies, we also present a mechanism
that automatically retrieves and processes the password requirements of
services. PALPAS users need to only memorize a single password and the setup of
PALPAS on a further device demands only a one-time transfer of few static data.
|
[
{
"version": "v1",
"created": "Mon, 15 Jun 2015 11:01:04 GMT"
}
] | 2015-06-16T00:00:00 |
[
[
"Horsch",
"Moritz",
""
],
[
"Hülsing",
"Andreas",
""
],
[
"Buchmann",
"Johannes",
""
]
] |
new_dataset
| 0.999423 |
1302.3412
|
Minglai Cai
|
Holger Boche, Minglai Cai, Ning Cai, Christian Deppe
|
Secrecy capacities of compound quantum wiretap channels and applications
|
We revised and improved our paper arXiv:1208.1151. We added a new
result for capacity and a new section for applications. arXiv admin note:
text overlap with arXiv:1202.0773. Published in the 1 May 2014 issue of
Physical Review A, Vol.89, No.5
| null |
10.1103/PhysRevA.89.052320
| null |
cs.IT math.IT quant-ph
|
http://creativecommons.org/licenses/by/3.0/
|
We determine the secrecy capacity of the compound channel with quantum
wiretapper and channel state information at the transmitter. Moreover, we
derive a lower bound on the secrecy capacity of this channel without channel
state information and determine the secrecy capacity of the compound
classical-quantum wiretap channel with channel state information at the
transmitter. We use this result to derive a new proof for a lower bound on the
entanglement generating capacity of compound quantum channel. We also derive a
new proof for the entanglement generating capacity of compound quantum channel
with channel state information at the encoder.
|
[
{
"version": "v1",
"created": "Thu, 14 Feb 2013 14:40:20 GMT"
},
{
"version": "v2",
"created": "Wed, 27 Feb 2013 16:33:45 GMT"
},
{
"version": "v3",
"created": "Tue, 30 Jul 2013 08:55:48 GMT"
},
{
"version": "v4",
"created": "Fri, 25 Oct 2013 11:01:02 GMT"
},
{
"version": "v5",
"created": "Tue, 3 Jun 2014 12:55:14 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Boche",
"Holger",
""
],
[
"Cai",
"Minglai",
""
],
[
"Cai",
"Ning",
""
],
[
"Deppe",
"Christian",
""
]
] |
new_dataset
| 0.963374 |
1303.3251
|
Li Xiao
|
Li Xiao, Xiang-Gen Xia, and Wenjie Wang
|
Multi-Stage Robust Chinese Remainder Theorem
|
26 pages, 2 figures
| null |
10.1109/TSP.2014.2339798
| null |
cs.IT cs.CE cs.CR math.IT math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well-known that the traditional Chinese remainder theorem (CRT) is not
robust in the sense that a small error in a remainder may cause a large error
in the reconstruction solution. A robust CRT was recently proposed for a
special case when the greatest common divisor (gcd) of all the moduli is more
than 1 and the remaining integers factorized by the gcd of all the moduli are
co-prime. In this special case, a closed-form reconstruction from erroneous
remainders was proposed and a necessary and sufficient condition on the
remainder errors was obtained. It basically says that the reconstruction error
is upper bounded by the remainder error level $\tau$ if $\tau$ is smaller than
a quarter of the gcd of all the moduli. In this paper, we consider the robust
reconstruction problem for a general set of moduli. We first present a
necessary and sufficient condition for the remainder errors for a robust
reconstruction from erroneous remainders with a general set of muduli and also
a corresponding robust reconstruction method. This can be thought of as a
single stage robust CRT. We then propose a two-stage robust CRT by grouping the
moduli into several groups as follows. First, the single stage robust CRT is
applied to each group. Then, with these robust reconstructions from all the
groups, the single stage robust CRT is applied again across the groups. This is
then easily generalized to multi-stage robust CRT. Interestingly, with this
two-stage robust CRT, the robust reconstruction holds even when the remainder
error level $\tau$ is above the quarter of the gcd of all the moduli. In this
paper, we also propose an algorithm on how to group a set of moduli for a
better reconstruction robustness of the two-stage robust CRT in some special
cases.
|
[
{
"version": "v1",
"created": "Wed, 13 Mar 2013 19:02:36 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Xiao",
"Li",
""
],
[
"Xia",
"Xiang-Gen",
""
],
[
"Wang",
"Wenjie",
""
]
] |
new_dataset
| 0.997723 |
1304.6763
|
Joakim And\'en
|
Joakim And\'en, St\'ephane Mallat
|
Deep Scattering Spectrum
| null | null |
10.1109/TSP.2014.2326991
| null |
cs.SD cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A scattering transform defines a locally translation invariant representation
which is stable to time-warping deformations. It extends MFCC representations
by computing modulation spectrum coefficients of multiple orders, through
cascades of wavelet convolutions and modulus operators. Second-order scattering
coefficients characterize transient phenomena such as attacks and amplitude
modulation. A frequency transposition invariant representation is obtained by
applying a scattering transform along log-frequency. State-the-of-art
classification results are obtained for musical genre and phone classification
on GTZAN and TIMIT databases, respectively.
|
[
{
"version": "v1",
"created": "Wed, 24 Apr 2013 21:50:03 GMT"
},
{
"version": "v2",
"created": "Fri, 10 Jan 2014 20:35:56 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Andén",
"Joakim",
""
],
[
"Mallat",
"Stéphane",
""
]
] |
new_dataset
| 0.979979 |
1411.6675
|
Federico Leva
|
Federico Leva
|
From orphan works, a new role of libraries for the public domain and
public interest (Dalle opere orfane, un nuovo ruolo delle biblioteche per il
pubblico dominio e l'utilit\`a sociale)
|
17 pages, 7 figures. Text in Italian. Preprint for digitalia.sbn.it.
Second revision corrected some misunderstandings. ODT, PNG sources. Keywords:
copyright; public domain; digital libraries; european union; directive
2012/28/eu; orphan works; hostage works; mass-digitization; Google Books;
Internet Archive
| null | null | null |
cs.DL
|
http://creativecommons.org/licenses/by/3.0/
|
Summarising the new orphan works law of Italy, we show how it makes the
public interest prevail and allows libraries and other beneficiaries to improve
their services. We then argue that such services are part of their mission
towards the public domain and are a first step for its complete accomplishment,
by the work of each and a reform of european copyright. Failing that, European
culture will disappear.
--
Sintetizzando le nuove norme sulle opere orfane, mostriamo come esse
affermino la prevalenza dell'interesse pubblico e consentano a biblioteche e
altri enti beneficiari di migliorare i propri servizi. Sosteniamo quindi che
questi si inquadrano nella loro missione nei confronti del pubblico dominio e
sono un primo passo per la sua completa realizzazione, mediante il lavoro di
ciascuno e la riforma del diritto d'autore europeo. In caso contrario, la
cultura europea sparir\`a.
|
[
{
"version": "v1",
"created": "Mon, 24 Nov 2014 22:36:58 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Nov 2014 09:13:09 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Leva",
"Federico",
""
]
] |
new_dataset
| 0.996135 |
1501.01436
|
Jianghao He
|
Jianghao He and Soung-Chang Liew
|
ARQ for Physical-layer Network Coding
|
34 pages, 6 figures, 10 Tables,Technical Report
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper investigates ARQ (Automatic Repeat request) designs for PNC
(Physical-layer Network Coding) systems. We have previously found that, besides
TWRC (Two-Way Relay Channel) operated on the principle of PNC, there are many
other PNC building blocks--building blocks are simple small network structures
that can be used to construct a large network. In some of these PNC building
blocks, receivers can obtain side information through overhearing. Although
such overheard information is not the target information that the receivers
desire, the receivers can exploit the overheard information together with a
network-coded packet received to obtain a desired native packet. This leads to
throughput gain. Our previous study, however, assumed what is sent always get
received. In practice, that is not the case. Error control is needed to ensure
reliable communication. This paper focuses on the use of ARQ to ensure reliable
PNC communication. The availability of overheard Information and its potential
exploitation make the ARQ design of a network-coded system different from that
of a non-network-coded system. In this paper, we lay out the fundamental
considerations for such ARQ design: 1) We address how to track the stored coded
packets and overheard packets to increase the chance of packet extraction, and
derive the throughput gain achieved by tracking 2) We investigate two
variations of PNC ARQ, coupled and non-coupled ARQs, and prove that non-coupled
ARQ is more efficient; 3) We show how to optimize parameters in PNC
ARQ--specifically the window size and ACK frequency--to minimize the throughput
degradation caused by ACK feedback overhead and wasteful retransmissions due to
lost ACK.
|
[
{
"version": "v1",
"created": "Wed, 7 Jan 2015 10:50:42 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Jun 2015 10:07:35 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"He",
"Jianghao",
""
],
[
"Liew",
"Soung-Chang",
""
]
] |
new_dataset
| 0.996201 |
1506.02568
|
Hao Chen
|
Liqing Xu and Hao Chen
|
Deterministic Construction of RIP Matrices in Compressed Sensing from
Constant Weight Codes
|
11 pages, submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The expicit restricted isometry property (RIP) measurement matrices are
needed in practical application of compressed sensing in signal processing. RIP
matrices from Reed-Solomon codes, BCH codes, orthogonal codes, expander graphs
have been proposed and analysised. On the other hand binary constant weight
codes have been studied for many years and many optimal or near-optimal small
weight and ditance constant weight codes have been determined. In this paper we
propose a new deterministic construction of RIP measurement matrices in
compressed sensing from binary and ternary contant weight codes. The sparse
orders and the number of budged rows in the new constant-weight-code-based RIP
matrices can be arbitrary. These contant-weight-code based RIP matrices have
better parameters compared with the DeVore RIP matrices when the sizes are
small.
|
[
{
"version": "v1",
"created": "Mon, 8 Jun 2015 16:15:16 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Jun 2015 04:32:15 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Xu",
"Liqing",
""
],
[
"Chen",
"Hao",
""
]
] |
new_dataset
| 0.96648 |
1506.03830
|
Juan Manuel R. Mosso Sr.
|
Juan Manuel R. Mosso
|
Ciberseguridad Inteligente
|
21 pages, in Spanish
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet Economy has a strong dependency on cyberspace. This raises
security risk scenarios due to the increasing number of vulnerabilities and the
increased frequency and sophistication of cyber attacks, especially with the
advent of advanced threats of APT type. This paper presents a model of
Intelligent Cybersecurity (ICS) for detect, deny, disrupt, degrade, deceive and
destroy enemy capabilities in cyberspace. This is achieved through the
conceptual and technical development of a Capacity for Cyber Intelligence (CCI)
which aims to interfere destructively C2 capabilities of the adversary,
penetrating its decision loops with the speed necessary to displace him to a
reactive posture. Finally, unlike the security models raised classically, the
concept of ICSI suggests that the advantage in the conflict can be obtained by
defense and not always by the attacker. As theoretical support, the "Offensive
System Reference Model" (OSRM) is presented, which is used to think cyber
conflict at all levels, from a perspective coordinated and synchronized with
the rest of the traditional forces under the present set; and a justification
of the capacity from the modern perspective C2.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2015 20:44:15 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Mosso",
"Juan Manuel R.",
""
]
] |
new_dataset
| 0.999639 |
1506.04051
|
Lucia Maddalena
|
Lucia Maddalena and Alfredo Petrosino
|
Towards Benchmarking Scene Background Initialization
|
6 pages, SBI dataset, SBMI2015 Workshop
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Given a set of images of a scene taken at different times, the availability
of an initial background model that describes the scene without foreground
objects is the prerequisite for a wide range of applications, ranging from
video surveillance to computational photography. Even though several methods
have been proposed for scene background initialization, the lack of a common
groundtruthed dataset and of a common set of metrics makes it difficult to
compare their performance. To move first steps towards an easy and fair
comparison of these methods, we assembled a dataset of sequences frequently
adopted for background initialization, selected or created ground truths for
quantitative evaluation through a selected suite of metrics, and compared
results obtained by some existing methods, making all the material publicly
available.
|
[
{
"version": "v1",
"created": "Fri, 12 Jun 2015 15:52:46 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Maddalena",
"Lucia",
""
],
[
"Petrosino",
"Alfredo",
""
]
] |
new_dataset
| 0.988191 |
1506.04094
|
Saeedeh Shekarpour
|
Christoph Lange, Saeedeh Shekarpour, Soren Auer
|
The WDAqua ITN: Answering Questions using Web Data
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WDAqua is a Marie Curie Innovative Training Network (ITN) and is funded under
EU grant number 642795 and runs from January 2015 to December 2018. WDAqua aims
at advancing the state of the art by intertwining training, research and
innovation efforts, centered around one service: data-driven question
answering. Question answering is immediately useful to a wide audience of end
users, and we will demonstrate this in settings including e-commerce, public
sector information, publishing and smart cities. Question answering also covers
web science and data science broadly, leading to transferrable research results
and to transferrable skills of the researchers who have finished our training
programme. To ensure that our research improves question answering overall,
every individual research project connects at least two of these steps.
Intersectional secondments (within a consortium covering academia, research
institutes and industrial research as well as network-wide workshops, R and D
challenges and innovation projects further balance ground-breaking research and
the needs of society and industry. Training-wise these offers equip early stage
researchers with the expertise and transferable technical and non-technical
skills that will allow them to pursue a successful career as an academic,
decision maker, practitioner or entrepreneur.
|
[
{
"version": "v1",
"created": "Wed, 10 Jun 2015 10:56:33 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Lange",
"Christoph",
""
],
[
"Shekarpour",
"Saeedeh",
""
],
[
"Auer",
"Soren",
""
]
] |
new_dataset
| 0.998854 |
1506.04104
|
Georgios Kontaxis
|
Georgios Kontaxis and Monica Chew
|
Tracking Protection in Firefox For Privacy and Performance
|
In Proceedings of the 9th Workshop on Web 2.0 Security and Privacy
(W2SP) 2015. Awarded Best Paper prize at workshop
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Tracking Protection in the Mozilla Firefox web browser. Tracking
Protection is a new privacy technology to mitigate invasive tracking of users'
online activity by blocking requests to tracking domains. We evaluate our
approach and demonstrate a 67.5% reduction in the number of HTTP cookies set
during a crawl of the Alexa top 200 news sites. Since Firefox does not download
and render content from tracking domains, Tracking Protection also enjoys
performance benefits of a 44% median reduction in page load time and 39%
reduction in data usage in the Alexa top 200 news sites.
|
[
{
"version": "v1",
"created": "Fri, 12 Jun 2015 18:41:32 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Kontaxis",
"Georgios",
""
],
[
"Chew",
"Monica",
""
]
] |
new_dataset
| 0.996816 |
1506.04110
|
Amit Levy
|
Amit Levy, Henry Corrigan-Gibbs and Dan Boneh
|
Stickler: Defending Against Malicious CDNs in an Unmodified Browser
|
In Proceedings of the 9th Workshop on Web 2.0 Security and Privacy
(W2SP) 2015
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Website publishers can derive enormous performance benefits and cost savings
by directing traffic to their sites through content distribution networks
(CDNs). However, publishers who use CDNs today must trust their CDN not to
modify the site's JavaScript, CSS, images or other media en route to end users.
A CDN that violates this trust could inject ads into websites, downsample media
to save bandwidth or, worse, inject malicious JavaScript code to steal user
secrets it could not otherwise access. We present Stickler, a system for
website publishers that guarantees the end-to-end authenticity of content
served to end users while simultaneously allowing publishers to reap the
benefits of CDNs. Crucially, Stickler achieves these guarantees without
requiring modifications to the browser.
|
[
{
"version": "v1",
"created": "Fri, 12 Jun 2015 18:47:19 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Levy",
"Amit",
""
],
[
"Corrigan-Gibbs",
"Henry",
""
],
[
"Boneh",
"Dan",
""
]
] |
new_dataset
| 0.994169 |
1506.04115
|
Griffin Boyce
|
Paul Syverson and Griffin Boyce
|
Genuine onion: Simple, Fast, Flexible, and Cheap Website Authentication
|
In Proceedings of the 9th Workshop on Web 2.0 Security and Privacy
(W2SP) 2015
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tor is a communications infrastructure widely used for unfettered and
anonymous access to Internet websites. Tor is also used to access sites on the
.onion virtual domain. The focus of .onion use and discussion has traditionally
been on the offering of hidden services, services that separate their
reachability from the identification of their IP addresses. We argue that Tor's
.onion system can be used to provide an entirely separate benefit: basic
website authentication. We also argue that not only can onionsites provide
website authentication, but doing so is easy, fast, cheap, flexible and secure
when compared to alternatives such as the standard use of TLS with
certificates.
|
[
{
"version": "v1",
"created": "Fri, 12 Jun 2015 18:55:44 GMT"
}
] | 2015-06-15T00:00:00 |
[
[
"Syverson",
"Paul",
""
],
[
"Boyce",
"Griffin",
""
]
] |
new_dataset
| 0.997304 |
0909.1381
|
Goutam Paul
|
Sayan Bhattacharya, Goutam Paul, Swagato Sanyal
|
On Necessary and Sufficient Number of Cops in the Game of Cops and
Robber in Multidimensional Grids
|
This is a revised and extended version of the poster paper with the
same title that has been presented in the 8th Asian Symposium on Computer
Mathematics (ASCM), December 15-17, 2007, Singapore
|
Discrete Applied Mathematics, pages 1745--1751, vol. 158, no. 16,
August 2010
|
10.1016/j.dam.2010.06.014
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We theoretically analyze the Cops and Robber Game for the first time in a
multidimensional grid. It is shown that for an $n$-dimensional grid, at least
$n$ cops are necessary to ensure capture of the robber. We also present a set
of cop strategies for which $n$ cops are provably sufficient to catch the
robber. Further, for two-dimensional grid, we provide an efficient cop strategy
for which the robber is caught even by a single cop under certain conditions.
|
[
{
"version": "v1",
"created": "Tue, 8 Sep 2009 03:55:29 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Bhattacharya",
"Sayan",
""
],
[
"Paul",
"Goutam",
""
],
[
"Sanyal",
"Swagato",
""
]
] |
new_dataset
| 0.98855 |
1212.1790
|
Muhammad Fahad Khan
|
Faisal Baig, Saira Beg, Muhammad Fahad Khan
|
Controlling Home Appliances Remotely through Voice Command
|
4 pages, 4, figures, International Journal of Computer Applications
| null |
10.5120/7437-0133
| null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Controlling appliances is a main part of automation. The main object of Home
automation is to provide a wireless communication link of home appliances to
the remote user. The main objective of this work is to make such a system which
controls the home appliances remotely. This paper discusses two methods of
controlling home appliances one is via voice to text SMS and other is to use
the mobile as a remote control, this system will provide a benefit to the
elderly and disable people and also to those who are unaware of typing an SMS.
|
[
{
"version": "v1",
"created": "Sat, 8 Dec 2012 13:38:19 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Baig",
"Faisal",
""
],
[
"Beg",
"Saira",
""
],
[
"Khan",
"Muhammad Fahad",
""
]
] |
new_dataset
| 0.998799 |
1301.4773
|
Tao Feng
|
Tao Feng, Ka Hin Leung, Qing Xiang
|
Binary Cyclic codes with two primitive nonzeros
|
11 pages, submitted to the special volumn of Science Sinica
Mathematics on Coding, Cryptography and Combinatorics
| null |
10.1007/s11425-013-4668-z
| null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we make some progress towards a well-known conjecture on the
minimum weights of binary cyclic codes with two primitive nonzeros. We also
determine the Walsh spectrum of $\Tr(x^d)$ over $\F_{2^{m}}$ in the case where
$m=2t$, $d=3+2^{t+1}$ and $\gcd(d, 2^{m}-1)=1$.
|
[
{
"version": "v1",
"created": "Mon, 21 Jan 2013 07:46:02 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Feng",
"Tao",
""
],
[
"Leung",
"Ka Hin",
""
],
[
"Xiang",
"Qing",
""
]
] |
new_dataset
| 0.994157 |
1310.1294
|
Marc Vuffray
|
Nicolas Macris and Marc Vuffray
|
The Bethe Free Energy Allows to Compute the Conditional Entropy of
Graphical Code Instances. A Proof from the Polymer Expansion
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main objective of this paper is to explore the precise relationship
between the Bethe free energy (or entropy) and the Shannon conditional entropy
of graphical error correcting codes. The main result shows that the Bethe free
energy associated with a low-density parity-check code used over a binary
symmetric channel in a large noise regime is, with high probability,
asymptotically exact as the block length grows. To arrive at this result we
develop new techniques for rather general graphical models based on the loop
sum as a starting point and the polymer expansion from statistical mechanics.
The true free energy is computed as a series expansion containing the Bethe
free energy as its zero-th order term plus a series of corrections. It is
easily seen that convergence criteria for such expansions are satisfied for
general high-temperature models. We apply these general results to ensembles of
low-density generator-matrix and parity-check codes. While the application to
generator-matrix codes follows standard "high temperature" methods, the case of
parity-check codes requires non-trivial new ideas because the hard constraints
correspond to a zero-temperature regime. Nevertheless one can combine the
polymer expansion with expander and counting arguments to show that the
difference between the true and Bethe free energies vanishes with high
probability in the large block
|
[
{
"version": "v1",
"created": "Fri, 4 Oct 2013 14:37:20 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Jun 2015 18:01:19 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Macris",
"Nicolas",
""
],
[
"Vuffray",
"Marc",
""
]
] |
new_dataset
| 0.994649 |
1506.03506
|
Vikram Saraph
|
Maurice Herlihy, Vikram Saraph
|
The Relative Power of Composite Loop Agreement Tasks
|
18 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Loop agreement is a family of wait-free tasks that includes set agreement and
simplex agreement, and was used to prove the undecidability of wait-free
solvability of distributed tasks by read/write memory. Herlihy and Rajsbaum
defined the algebraic signature of a loop agreement task, which consists of a
group and a distinguished element. They used the algebraic signature to
characterize the relative power of loop agreement tasks. In particular, they
showed that one task implements another exactly when there is a homomorphism
between their respective signatures sending one distinguished element to the
other. In this paper, we extend the previous result by defining the composition
of multiple loop agreement tasks to create a new one with the same combined
power. We generalize the original algebraic characterization of relative power
to compositions of tasks. In this way, we can think of loop agreement tasks in
terms of their basic building blocks. We also investigate a category-theoretic
perspective of loop agreement by defining a category of loops, showing that the
algebraic signature is a functor, and proving that our definition of task
composition is the "correct" one, in a categorical sense.
|
[
{
"version": "v1",
"created": "Wed, 10 Jun 2015 23:28:59 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Herlihy",
"Maurice",
""
],
[
"Saraph",
"Vikram",
""
]
] |
new_dataset
| 0.997753 |
1506.03540
|
Kangjin Kim
|
Kangjin Kim, Joe Campbell, William Duong, Yu Zhang and Georgios
Fainekos
|
DisCoF$^+$: Asynchronous DisCoF with Flexible Decoupling for Cooperative
Pathfinding in Distributed Systems
|
9 pages, 3 figures, in Proceedings of the IEEE International
Conference on Automation Science and Engineering, Aug. 2015
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In our prior work, we outlined an approach, named DisCoF, for cooperative
pathfinding in distributed systems with limited sensing and communication
range. Contrasting to prior works on cooperative pathfinding with completeness
guarantees, which often assume the access to global information, DisCoF does
not make this assumption. The implication is that at any given time in DisCoF,
the robots may not all be aware of each other, which is often the case in
distributed systems. As a result, DisCoF represents an inherently online
approach since coordination can only be realized in an opportunistic manner
between robots that are within each other's sensing and communication range.
However, there are a few assumptions made in DisCoF to facilitate a formal
analysis, which must be removed to work with distributed multi-robot platforms.
In this paper, we present DisCoF$^+$, which extends DisCoF by enabling an
asynchronous solution, as well as providing flexible decoupling between robots
for performance improvement. We also extend the formal results of DisCoF to
DisCoF$^+$. Furthermore, we evaluate our implementation of DisCoF$^+$ and
demonstrate a simulation of it running in a distributed multi-robot
environment. Finally, we compare DisCoF$^+$ with DisCoF in terms of plan
quality and planning performance.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2015 03:47:23 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Kim",
"Kangjin",
""
],
[
"Campbell",
"Joe",
""
],
[
"Duong",
"William",
""
],
[
"Zhang",
"Yu",
""
],
[
"Fainekos",
"Georgios",
""
]
] |
new_dataset
| 0.994836 |
1506.03553
|
EPTCS
|
Johan Arcile (Laboratoire IBISC, Universit\'e d'Evry-Val d'Essonne),
Jean-Yves Didier (Laboratoire IBISC, Universit\'e d'Evry-Val d'Essonne),
Hanna Klaudel (Laboratoire IBISC, Universit\'e d'Evry-Val d'Essonne), Raymond
Devillers (D\'epartement d'Informatique, Universit\'e Libre de Bruxelles),
Artur Rataj (Institute of Theoretical and Applied Computer Science)
|
Indefinite waitings in MIRELA systems
|
In Proceedings ESSS 2015, arXiv:1506.03250
|
EPTCS 184, 2015, pp. 5-18
|
10.4204/EPTCS.184.1
| null |
cs.SE cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
MIRELA is a high-level language and a rapid prototyping framework dedicated
to systems where virtual and digital objects coexist in the same environment
and interact in real time. Its semantics is given in the form of networks of
timed automata, which can be checked using symbolic methods. This paper shows
how to detect various kinds of indefinite waitings in the components of such
systems. The method is experimented using the PRISM model checker.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2015 06:10:32 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Arcile",
"Johan",
"",
"Laboratoire IBISC, Université d'Evry-Val d'Essonne"
],
[
"Didier",
"Jean-Yves",
"",
"Laboratoire IBISC, Université d'Evry-Val d'Essonne"
],
[
"Klaudel",
"Hanna",
"",
"Laboratoire IBISC, Université d'Evry-Val d'Essonne"
],
[
"Devillers",
"Raymond",
"",
"Département d'Informatique, Université Libre de Bruxelles"
],
[
"Rataj",
"Artur",
"",
"Institute of Theoretical and Applied Computer Science"
]
] |
new_dataset
| 0.993233 |
1506.03558
|
EPTCS
|
Chen-Wei Wang (York University), Jonathan S. Ostroff (York
University), Simon Hudon (York University)
|
Using Indexed and Synchronous Events to Model and Validate
Cyber-Physical Systems
|
In Proceedings ESSS 2015, arXiv:1506.03250
|
EPTCS 184, 2015, pp. 81-95
|
10.4204/EPTCS.184.6
| null |
cs.SE cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Timed Transition Models (TTMs) are event-based descriptions for modelling,
specifying, and verifying discrete real-time systems. An event can be
spontaneous, fair, or timed with specified bounds. TTMs have a textual syntax,
an operational semantics, and an automated tool supporting linear-time temporal
logic. We extend TTMs and its tool with two novel modelling features for
writing high-level specifications: indexed events and synchronous events.
Indexed events allow for concise description of behaviour common to a set of
actors. The indexing construct allows us to select a specific actor and to
specify a temporal property for that actor. We use indexed events to validate
the requirements of a train control system. Synchronous events allow developers
to decompose simultaneous state updates into actions of separate events. To
specify the intended data flow among synchronized actions, we use primed
variables to reference the post-state (i.e., one resulted from taking the
synchronized actions). The TTM tool automatically infers the data flow from
synchronous events, and reports errors on inconsistencies due to circular data
flow. We use synchronous events to validate part of the requirements of a
nuclear shutdown system. In both case studies, we show how the new notation
facilitates the formal validation of system requirements, and use the TTM tool
to verify safety, liveness, and real-time properties.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2015 06:16:40 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Wang",
"Chen-Wei",
"",
"York University"
],
[
"Ostroff",
"Jonathan S.",
"",
"York\n University"
],
[
"Hudon",
"Simon",
"",
"York University"
]
] |
new_dataset
| 0.995632 |
1506.03724
|
Punarbasu Purkayastha
|
Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, Patrick Sol\'e
|
Product Construction of Affine Codes
|
13 pages, to appear in SIAM Journal on Discrete Mathematics
| null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary matrix codes with restricted row and column weights are a desirable
method of coded modulation for power line communication. In this work, we
construct such matrix codes that are obtained as products of affine codes -
cosets of binary linear codes. Additionally, the constructions have the
property that they are systematic. Subsequently, we generalize our construction
to irregular product of affine codes, where the component codes are affine
codes of different rates.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2015 16:04:20 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Kiah",
"Han Mao",
""
],
[
"Purkayastha",
"Punarbasu",
""
],
[
"Solé",
"Patrick",
""
]
] |
new_dataset
| 0.999282 |
1506.03799
|
Amin Jourabloo
|
Amin Jourabloo, Xiaoming Liu
|
Pose-Invariant 3D Face Alignment
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Face alignment aims to estimate the locations of a set of landmarks for a
given image. This problem has received much attention as evidenced by the
recent advancement in both the methodology and performance. However, most of
the existing works neither explicitly handle face images with arbitrary poses,
nor perform large-scale experiments on non-frontal and profile face images. In
order to address these limitations, this paper proposes a novel face alignment
algorithm that estimates both 2D and 3D landmarks and their 2D visibilities for
a face image with an arbitrary pose. By integrating a 3D deformable model, a
cascaded coupled-regressor approach is designed to estimate both the camera
projection matrix and the 3D landmarks. Furthermore, the 3D model also allows
us to automatically estimate the 2D landmark visibilities via surface normals.
We gather a substantially larger collection of all-pose face images to evaluate
our algorithm and demonstrate superior performances than the state-of-the-art
methods.
|
[
{
"version": "v1",
"created": "Thu, 11 Jun 2015 19:45:13 GMT"
}
] | 2015-06-12T00:00:00 |
[
[
"Jourabloo",
"Amin",
""
],
[
"Liu",
"Xiaoming",
""
]
] |
new_dataset
| 0.998725 |
1208.4048
|
Zhengzheng Xiang
|
Zhengzheng Xiang, Meixia Tao, Jianhua Mo, and Xiaodong Wang
|
Degrees of Freedom for MIMO Two-Way X Relay Channel
|
28 pages, 6 figures
| null |
10.1109/TSP.2013.2238535
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the degrees of freedom (DOF) of a multiple-input multiple-output
(MIMO) two-way X relay channel, where there are two groups of source nodes and
one relay node, each equipped with multiple antennas, and each of the two
source nodes in one group exchanges independent messages with the two source
nodes in the other group via the relay node. It is assumed that every source
node is equipped with M antennas while the relay is equipped with N antennas.
We first show that the upper bound on the total DOF for this network is
2min{2M,N} and then focus on the case of N \leq 2M so that the DOF is upper
bounded by the number of antennas at the relay. By applying signal alignment
for network coding and joint transceiver design for interference cancellation,
we show that this upper bound can be achieved when N \leq8M/5. We also show
that with signal alignment only but no joint transceiver design, the upper
bound is achievable when N\leq4M/3. Simulation results are provided to
corroborate the theoretical results and to demonstrate the performance of the
proposed scheme in the finite signal-to-noise ratio regime.
|
[
{
"version": "v1",
"created": "Mon, 20 Aug 2012 16:19:31 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Dec 2012 01:58:08 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Xiang",
"Zhengzheng",
""
],
[
"Tao",
"Meixia",
""
],
[
"Mo",
"Jianhua",
""
],
[
"Wang",
"Xiaodong",
""
]
] |
new_dataset
| 0.997835 |
1210.8129
|
Sunil K. Narang
|
Sunil K. Narang and Antonio Ortega
|
Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary
Undirected Graphs
|
Submitted for review in IEEE TSP
| null |
10.1109/TSP.2013.2273197
| null |
cs.IT cs.DC math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In our recent work, we proposed the design of perfect reconstruction
orthogonal wavelet filterbanks, called graph- QMF, for arbitrary undirected
weighted graphs. In that formulation we first designed "one-dimensional"
two-channel filterbanks on bipartite graphs, and then extended them to
"multi-dimensional" separable two-channel filterbanks for arbitrary graphs via
a bipartite subgraph decomposition. We specifically designed wavelet filters
based on the spectral decomposition of the graph, and stated necessary and
sufficient conditions for a two-channel graph filter-bank on bipartite graphs
to provide aliasing-cancellation, perfect reconstruction and orthogonal set of
basis (orthogonality). While, the exact graph-QMF designs satisfy all the above
conditions, they are not exactly k-hop localized on the graph. In this paper,
we relax the condition of orthogonality to design a biorthogonal pair of
graph-wavelets that can have compact spatial spread and still satisfy the
perfect reconstruction conditions. The design is analogous to the standard
Cohen-Daubechies-Feauveau's (CDF) construction of factorizing a maximally-flat
Daubechies half-band filter. Preliminary results demonstrate that the proposed
filterbanks can be useful for both standard signal processing applications as
well as for signals defined on arbitrary graphs.
Note: Code examples from this paper are available at
http://biron.usc.edu/wiki/index.php/Graph Filterbanks
|
[
{
"version": "v1",
"created": "Tue, 30 Oct 2012 19:33:35 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Nov 2012 19:29:19 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Narang",
"Sunil K.",
""
],
[
"Ortega",
"Antonio",
""
]
] |
new_dataset
| 0.996391 |
1210.8181
|
Hendrik vom Lehn
|
Jeroen van den Hoven, Dirk Helbing, Dino Pedreschi, Josep
Domingo-Ferrer, Fosca Gianotti, Markus Christen
|
FuturICT - The Road towards Ethical ICT
|
arXiv admin note: text overlap with arXiv:1012.0178
| null |
10.1140/epjst/e2012-01691-2
| null |
cs.CY cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The pervasive use of information and communication technology (ICT) in modern
societies enables countless opportunities for individuals, institutions,
businesses and scientists, but also raises difficult ethical and social
problems. In particular, ICT helped to make societies more complex and thus
harder to understand, which impedes social and political interventions to avoid
harm and to increase the common good. To overcome this obstacle, the
large-scale EU flagship proposal FuturICT intends to create a platform for
accessing global human knowledge as a public good and instruments to increase
our understanding of the information society by making use of ICT-based
research. In this contribution, we outline the ethical justification for such
an endeavor. We argue that the ethical issues raised by FuturICT research
projects overlap substantially with many of the known ethical problems emerging
from ICT use in general. By referring to the notion of Value Sensitive Design,
we show for the example of privacy how this core value of responsible ICT can
be protected in pursuing research in the framework of FuturICT. In addition, we
discuss further ethical issues and outline the institutional design of FuturICT
allowing to address them.
|
[
{
"version": "v1",
"created": "Tue, 30 Oct 2012 21:44:43 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Hoven",
"Jeroen van den",
""
],
[
"Helbing",
"Dirk",
""
],
[
"Pedreschi",
"Dino",
""
],
[
"Domingo-Ferrer",
"Josep",
""
],
[
"Gianotti",
"Fosca",
""
],
[
"Christen",
"Markus",
""
]
] |
new_dataset
| 0.998762 |
1412.7449
|
Oriol Vinyals
|
Oriol Vinyals, Lukasz Kaiser, Terry Koo, Slav Petrov, Ilya Sutskever,
Geoffrey Hinton
|
Grammar as a Foreign Language
| null | null | null | null |
cs.CL cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Syntactic constituency parsing is a fundamental problem in natural language
processing and has been the subject of intensive research and engineering for
decades. As a result, the most accurate parsers are domain specific, complex,
and inefficient. In this paper we show that the domain agnostic
attention-enhanced sequence-to-sequence model achieves state-of-the-art results
on the most widely used syntactic constituency parsing dataset, when trained on
a large synthetic corpus that was annotated using existing parsers. It also
matches the performance of standard parsers when trained only on a small
human-annotated dataset, which shows that this model is highly data-efficient,
in contrast to sequence-to-sequence models without the attention mechanism. Our
parser is also fast, processing over a hundred sentences per second with an
unoptimized CPU implementation.
|
[
{
"version": "v1",
"created": "Tue, 23 Dec 2014 17:16:24 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Feb 2015 03:16:54 GMT"
},
{
"version": "v3",
"created": "Tue, 9 Jun 2015 22:41:07 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Vinyals",
"Oriol",
""
],
[
"Kaiser",
"Lukasz",
""
],
[
"Koo",
"Terry",
""
],
[
"Petrov",
"Slav",
""
],
[
"Sutskever",
"Ilya",
""
],
[
"Hinton",
"Geoffrey",
""
]
] |
new_dataset
| 0.985032 |
1506.01498
|
Chunlei Liu
|
Chunlei Liu
|
Gold type codes of higher relative dimension
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some new Gold type codes of higher relative dimension are introduced. Their
weight distribution is determined.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2015 08:07:21 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Jun 2015 08:18:04 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Liu",
"Chunlei",
""
]
] |
new_dataset
| 0.962784 |
1506.02204
|
Chunlei Liu
|
Chunlei Liu
|
Kasami type codes of higher relative dimension
|
arXiv admin note: substantial text overlap with arXiv:1506.01498
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Some new Kasami type codes of higher relative dimension is introduced. Their
weight distribution is determined.
|
[
{
"version": "v1",
"created": "Sun, 7 Jun 2015 00:55:41 GMT"
},
{
"version": "v2",
"created": "Wed, 10 Jun 2015 08:53:05 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Liu",
"Chunlei",
""
]
] |
new_dataset
| 0.996475 |
1506.03104
|
James Peirce Jr.
|
Eric Eager, Megan Eberle and James Peirce
|
How Infectious Was #Deflategate?
|
12 pages, 4 figures
| null | null | null |
cs.SI physics.soc-ph q-bio.PE stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
On Monday January 19, 2015 a story broke that the National Football League
(NFL) had started an investigation into whether the New England Patriots
deliberately deflated the footballs they used during their championship win
over the Indianapolis Colts. Like an infectious disease, discussion regarding
Deflategate grew rapidly on social media sites in the hours and days after the
release of the story. However, after the Super Bowl was over, the scandal
slowly began to dissipate and lost much of the attention it had originally had,
as interest in the NFL wained at the completion of its season. We construct a
simple epidemic model for the infectiousness of the Deflategate news story. We
then use data from the social media site Twitter to estimate the parameters of
this model using standard techniques from the study of inverse problems. We
find that the infectiousness (as measured by the basic reproduction number) of
Deflategate rivals that of any infectious disease that we are aware of, and is
actually more infectious than recent news stories of greater importance - both
in terms of the basic reproduction number and in terms of the average amount of
time the average tweeter continued to tweet about the news story.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2015 21:09:53 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Eager",
"Eric",
""
],
[
"Eberle",
"Megan",
""
],
[
"Peirce",
"James",
""
]
] |
new_dataset
| 0.998816 |
1506.03128
|
Jani Biju Babjan
|
Jani Biju Babjan
|
License Plate Recognition System Based on Color Coding Of License Plates
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
License Plate Recognition Systems are used to determine the license plate
number of a vehicle. The current system mainly uses Optical Character
Recognition to recognize the number plate. There are several problems to this
system. Some of them include interchanging of several letters or numbers
(letter O with digit 0), difficulty in localizing the license plate, high error
rate, use of different fonts in license plates etc. So a new system to
recognize the license plate number using color coding of license plates is
proposed in this paper. Easier localization of license plate can be done by
searching for the start or stop patters of license plates. An eight segment
display system along with traditional numbering with the first and last
segments left for start or stop patterns is proposed in this paper. Practical
applications include several areas under Internet of Things (IoT).
|
[
{
"version": "v1",
"created": "Mon, 8 Jun 2015 15:44:29 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Babjan",
"Jani Biju",
""
]
] |
new_dataset
| 0.998672 |
1506.03184
|
Cong Yao
|
Xinyu Zhou and Shuchang Zhou and Cong Yao and Zhimin Cao and Qi Yin
|
ICDAR 2015 Text Reading in the Wild Competition
|
3 pages, 2 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, text detection and recognition in natural scenes are becoming
increasing popular in the computer vision community as well as the document
analysis community. However, majority of the existing ideas, algorithms and
systems are specifically designed for English. This technical report presents
the final results of the ICDAR 2015 Text Reading in the Wild (TRW 2015)
competition, which aims at establishing a benchmark for assessing detection and
recognition algorithms devised for both Chinese and English scripts and
providing a playground for researchers from the community. In this article, we
describe in detail the dataset, tasks, evaluation protocols and participants of
this competition, and report the performance of the participating methods.
Moreover, promising directions for future research are discussed.
|
[
{
"version": "v1",
"created": "Wed, 10 Jun 2015 06:46:55 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Zhou",
"Xinyu",
""
],
[
"Zhou",
"Shuchang",
""
],
[
"Yao",
"Cong",
""
],
[
"Cao",
"Zhimin",
""
],
[
"Yin",
"Qi",
""
]
] |
new_dataset
| 0.999639 |
1506.03237
|
Adebayo Omotosho Mr
|
Mikail Olaniyi, Adebayo Omotosho, Esther Oluwatosin, Michael Adegoke,
Tomi Akinmukomi
|
Students Exeat Monitoring System Using Fingerprint Biometric
Authentication and Mobile Short Message Service
|
The Don Bosco International Journal of ICT and Youth Development 2012
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exeat is a generic term commonly used to describe a period of absence from a
centre of learning either for entire day, or parts of a day for appointments,
interviews, open days and other fixtures in privately owned academic
environment. The current method of monitoring students movement is inefficient
and brings difficulty to the University Halls management checking students exit
or entry into the halls of residence as well as impersonation. By using nexus
combination of Ubiquitous Mobile Computing Technology through Mobile Short
Message Service and biometric fingerprint approach exeat management and
monitoring is quick and easy. Result after testing of the designed and
simulated system shows that exeat monitoring systems is less prone to forgery
as stakeholders are carried along, capable of preventing impersonation among
students, and provide absolute electronic compliance to the policy of issuing
exeat to students in the University Halls of Residence.
|
[
{
"version": "v1",
"created": "Wed, 10 Jun 2015 09:44:35 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Olaniyi",
"Mikail",
""
],
[
"Omotosho",
"Adebayo",
""
],
[
"Oluwatosin",
"Esther",
""
],
[
"Adegoke",
"Michael",
""
],
[
"Akinmukomi",
"Tomi",
""
]
] |
new_dataset
| 0.99806 |
1506.03311
|
Konstantin Avrachenkov
|
Konstantin Avrachenkov (MAESTRO), Vikas Vikram Singh (MAESTRO)
|
Stochastic Coalitional Better-response Dynamics and Strong Nash
Equilibrium
| null | null | null | null |
cs.GT cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider coalition formation among players in an n-player finite strategic
game over infinite horizon. At each time a randomly formed coalition makes a
joint deviation from a current action profile such that at new action profile
all players from the coalition are strictly benefited. Such deviations define a
coalitional better-response (CBR) dynamics that is in general stochastic. The
CBR dynamics either converges to a strong Nash equilibrium or stucks in a
closed cycle. We also assume that at each time a selected coalition makes
mistake in deviation with small probability that add mutations (perturbations)
into CBR dynamics. We prove that all strong Nash equilibria and closed cycles
are stochastically stable, i.e., they are selected by perturbed CBR dynamics as
mutations vanish. Similar statement holds for strict strong Nash equilibrium.
We apply CBR dynamics to the network formation games and we prove that all
strongly stable networks and closed cycles are stochastically stable.
|
[
{
"version": "v1",
"created": "Wed, 10 Jun 2015 14:04:16 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Avrachenkov",
"Konstantin",
"",
"MAESTRO"
],
[
"Singh",
"Vikas Vikram",
"",
"MAESTRO"
]
] |
new_dataset
| 0.997113 |
1506.03363
|
Tony Clark
|
Tony Clark, Paul Sammut, James Willans
|
Super-Languages: Developing Languages and Applications with XMF (Second
Edition)
| null | null | null | null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this book is to introduce the language XMF. This is done by
defining the language, providing some examples of applications that can be
written directly in the XOCL language that comes with XMF, and then by showing
how XMF can be used for language engineering. The main focus of this book is on
language engineering by example.
|
[
{
"version": "v1",
"created": "Wed, 10 Jun 2015 15:34:58 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Clark",
"Tony",
""
],
[
"Sammut",
"Paul",
""
],
[
"Willans",
"James",
""
]
] |
new_dataset
| 0.994929 |
1506.03381
|
Tony Clark
|
Tony Clark
|
Meta-Packages: Painless Domain Specific Languages
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Domain Specific Languages are used to provide a tailored modelling notation
for a specific application domain. There are currently two main approaches to
DSLs: standard notations that are tailored by adding simple properties; new
notations that are designed from scratch. There are problems with both of these
approaches which can be addressed by providing access to a small meta-language
based on packages and classes. A meta-modelling approach based on meta-packages
allows a wide range of DSLs to be defined in a standard way. The DSLs can be
processed using standard object-based extension at the meta-level and existing
tooling can easily be defined to adapt to the new languages. This paper
introduces the concept of meta-packages and provides a simple example.
|
[
{
"version": "v1",
"created": "Wed, 10 Jun 2015 16:30:31 GMT"
}
] | 2015-06-11T00:00:00 |
[
[
"Clark",
"Tony",
""
]
] |
new_dataset
| 0.990203 |
1506.01069
|
Xinyu Wu
|
Xinyu Wu, Vishal Saxena, Kehan Zhu
|
A CMOS Spiking Neuron for Dense Memristor-Synapse Connectivity for
Brain-Inspired Computing
|
This is a preprint of an article accepted for publication in
International Joint Conference on Neural Networks (IJCNN) 2015
| null | null | null |
cs.NE cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neuromorphic systems that densely integrate CMOS spiking neurons and
nano-scale memristor synapses open a new avenue of brain-inspired computing.
Existing silicon neurons have molded neural biophysical dynamics but are
incompatible with memristor synapses, or used extra training circuitry thus
eliminating much of the density advantages gained by using memristors, or were
energy inefficient. Here we describe a novel CMOS spiking leaky
integrate-and-fire neuron circuit. Building on a reconfigurable architecture
with a single opamp, the described neuron accommodates a large number of
memristor synapses, and enables online spike timing dependent plasticity (STDP)
learning with optimized power consumption. Simulation results of an 180nm CMOS
design showed 97% power efficiency metric when realizing STDP learning in
10,000 memristor synapses with a nominal 1M{\Omega} memristance, and only
13{\mu}A current consumption when integrating input spikes. Therefore, the
described CMOS neuron contributes a generalized building block for large-scale
brain-inspired neuromorphic systems.
|
[
{
"version": "v1",
"created": "Tue, 2 Jun 2015 21:28:56 GMT"
},
{
"version": "v2",
"created": "Mon, 8 Jun 2015 21:35:19 GMT"
}
] | 2015-06-10T00:00:00 |
[
[
"Wu",
"Xinyu",
""
],
[
"Saxena",
"Vishal",
""
],
[
"Zhu",
"Kehan",
""
]
] |
new_dataset
| 0.993988 |
1506.02740
|
Yiwei Zhang
|
Yiwei Zhang, Gennian Ge
|
Snake-in-the-Box Codes for Rank Modulation under Kendall's $\tau$-Metric
|
arXiv admin note: text overlap with arXiv:1311.4703 by other authors
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For a Gray code in the scheme of rank modulation for flash memories, the
codewords are permutations and two consecutive codewords are obtained using a
push-to-the-top operation. We consider snake-in-the-box codes under Kendall's
$\tau$-metric, which is a Gray code capable of detecting one Kendall's
$\tau$-error. We answer two open problems posed by Horovitz and Etzion.
Firstly, we prove the validity of a construction given by them, resulting in a
snake of size $M_{2n+1}=\frac{(2n+1)!}{2}-2n+1$. Secondly, we come up with a
different construction aiming at a longer snake of size
$M_{2n+1}=\frac{(2n+1)!}{2}-2n+3$. The construction is applied successfully to
$S_7$.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2015 01:23:35 GMT"
}
] | 2015-06-10T00:00:00 |
[
[
"Zhang",
"Yiwei",
""
],
[
"Ge",
"Gennian",
""
]
] |
new_dataset
| 0.995182 |
1506.02833
|
Albert Saa-Garriga
|
Albert Sa\`a-Garriga and David Castells-Rufas and Jordi Carrabina
|
OMP2HMPP: Compiler Framework for Energy Performance Trade-off Analysis
of Automatically Generated Codes
| null |
IJCSI International Journal of Computer Science Issues, Volume 12,
Issue 2, March 2015
| null | null |
cs.DC cs.PF cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present OMP2HMPP, a tool that, in a first step, automatically translates
OpenMP code into various possible transformations of HMPP. In a second step
OMP2HMPP executes all variants to obtain the performance and power consumption
of each transformation. The resulting trade-off can be used to choose the more
convenient version. After running the tool on a set of codes from the Polybench
benchmark we show that the best automatic transformation is equivalent to a
manual one done by an expert. Compared with original OpenMP code running in 2
quad-core processors we obtain an average speed-up of 31x and 5.86x factor in
operations per watt.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2015 09:24:38 GMT"
}
] | 2015-06-10T00:00:00 |
[
[
"Saà-Garriga",
"Albert",
""
],
[
"Castells-Rufas",
"David",
""
],
[
"Carrabina",
"Jordi",
""
]
] |
new_dataset
| 0.989427 |
1506.02850
|
Giuseppe De Nittis
|
Nicola Basilico, Giuseppe De Nittis, Nicola Gatti
|
Adversarial patrolling with spatially uncertain alarm signals
| null | null | null | null |
cs.AI cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When securing complex infrastructures or large environments, constant
surveillance of every area is not affordable. To cope with this issue, a common
countermeasure is the usage of cheap but wide-ranged sensors, able to detect
suspicious events that occur in large areas, supporting patrollers to improve
the effectiveness of their strategies. However, such sensors are commonly
affected by uncertainty. In the present paper, we focus on spatially uncertain
alarm signals. That is, the alarm system is able to detect an attack but it is
uncertain on the exact position where the attack is taking place. This is
common when the area to be secured is wide such as in border patrolling and
fair site surveillance. We propose, to the best of our knowledge, the first
Patrolling Security Game model where a Defender is supported by a spatially
uncertain alarm system which non-deterministically generates signals once a
target is under attack. We show that finding the optimal strategy in arbitrary
graphs is APX-hard even in zero-sum games and we provide two (exponential time)
exact algorithms and two (polynomial time) approximation algorithms.
Furthermore, we analyse what happens in environments with special topologies,
showing that in linear and cycle graphs the optimal patrolling strategy can be
found in polynomial time, de facto allowing our algorithms to be used in
real-life scenarios, while in trees the problem is NP-hard. Finally, we show
that without false positives and missed detections, the best patrolling
strategy reduces to stay in a place, wait for a signal, and respond to it at
best. This strategy is optimal even with non-negligible missed detection rates,
which, unfortunately, affect every commercial alarm system. We evaluate our
methods in simulation, assessing both quantitative and qualitative aspects.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2015 10:22:43 GMT"
}
] | 2015-06-10T00:00:00 |
[
[
"Basilico",
"Nicola",
""
],
[
"De Nittis",
"Giuseppe",
""
],
[
"Gatti",
"Nicola",
""
]
] |
new_dataset
| 0.996466 |
1506.02923
|
Abdulrahman Ibraheem
|
Abdulrahman Oladipupo Ibraheem
|
Compact Shape Trees: A Contribution to the Forest of Shape
Correspondences and Matching Methods
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel technique, termed compact shape trees, for computing
correspondences of single-boundary 2-D shapes in O(n2) time. Together with zero
or more features defined at each of n sample points on the shape's boundary,
the compact shape tree of a shape comprises the O(n) collection of vectors
emanating from any of the sample points on the shape's boundary to the rest of
the sample points on the boundary. As it turns out, compact shape trees have a
number of elegant properties both in the spatial and frequency domains. In
particular, via a simple vector-algebraic argument, we show that the O(n)
collection of vectors in a compact shape tree possesses at least the same
discriminatory power as the O(n2) collection of lines emanating from each
sample point to every other sample point on a shape's boundary. In addition, we
describe neat approaches for achieving scale and rotation invariance with
compact shape trees in the spatial domain; by viewing compact shape trees as
aperiodic discrete signals, we also prove scale and rotation invariance
properties for them in the Fourier domain. Towards these, along the way, using
concepts from differential geometry and the Calculus, we propose a novel theory
for sampling 2-D shape boundaries in a scale and rotation invariant manner.
Finally, we propose a number of shape recognition experiments to test the
efficacy of our concept.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2015 14:18:01 GMT"
}
] | 2015-06-10T00:00:00 |
[
[
"Ibraheem",
"Abdulrahman Oladipupo",
""
]
] |
new_dataset
| 0.997549 |
1506.02955
|
Kai Chen
|
Bin Li, Hui Shen, Kai Chen
|
A Decision-Aided Parallel SC-List Decoder for Polar Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a decision-aided scheme for parallel SC-List
decoding of polar codes. At the parallel SC-List decoder, each survival path is
extended based on multiple information bits, therefore the number of split
paths becomes very large and the sorting to find the top L paths becomes very
complex. We propose a decision-aided scheme to reduce the number of split paths
and thus reduce the sorting complexity.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2015 15:19:00 GMT"
}
] | 2015-06-10T00:00:00 |
[
[
"Li",
"Bin",
""
],
[
"Shen",
"Hui",
""
],
[
"Chen",
"Kai",
""
]
] |
new_dataset
| 0.995408 |
1506.02990
|
Chung-Yu Lou
|
Chung-Yu Lou, Babak Daneshrad, Richard D. Wesel
|
Convolutional-Code-Specific CRC Code Design
|
12 pages, 8 figures, journal paper
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic redundancy check (CRC) codes check if a codeword is correctly
received. This paper presents an algorithm to design CRC codes that are
optimized for the code-specific error behavior of a specified feedforward
convolutional code. The algorithm utilizes two distinct approaches to computing
undetected error probability of a CRC code used with a specific convolutional
code. The first approach enumerates the error patterns of the convolutional
code and tests if each of them is detectable. The second approach reduces
complexity significantly by exploiting the equivalence of the undetected error
probability to the frame error rate of an equivalent catastrophic convolutional
code. The error events of the equivalent convolutional code are exactly the
undetectable errors for the original concatenation of CRC and convolutional
codes. This simplifies the computation because error patterns do not need to be
individually checked for detectability. As an example, we optimize CRC codes
for a commonly used 64-state convolutional code for information length k=1024
demonstrating significant reduction in undetected error probability compared to
the existing CRC codes with the same degrees. For a fixed target undetected
error probability, the optimized CRC codes typically require 2 fewer bits.
|
[
{
"version": "v1",
"created": "Tue, 9 Jun 2015 16:37:15 GMT"
}
] | 2015-06-10T00:00:00 |
[
[
"Lou",
"Chung-Yu",
""
],
[
"Daneshrad",
"Babak",
""
],
[
"Wesel",
"Richard D.",
""
]
] |
new_dataset
| 0.993563 |
1503.05451
|
Katharina Muelling
|
Katharina Muelling, Arun Venkatraman, Jean-Sebastien Valois, John
Downey, Jeffrey Weiss, Shervin Javdani, Martial Hebert, Andrew B. Schwartz,
Jennifer L. Collinger, J. Andrew Bagnell
|
Autonomy Infused Teleoperation with Application to BCI Manipulation
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Robot teleoperation systems face a common set of challenges including
latency, low-dimensional user commands, and asymmetric control inputs. User
control with Brain-Computer Interfaces (BCIs) exacerbates these problems
through especially noisy and erratic low-dimensional motion commands due to the
difficulty in decoding neural activity. We introduce a general framework to
address these challenges through a combination of computer vision, user intent
inference, and arbitration between the human input and autonomous control
schemes. Adjustable levels of assistance allow the system to balance the
operator's capabilities and feelings of comfort and control while compensating
for a task's difficulty. We present experimental results demonstrating
significant performance improvement using the shared-control assistance
framework on adapted rehabilitation benchmarks with two subjects implanted with
intracortical brain-computer interfaces controlling a seven degree-of-freedom
robotic manipulator as a prosthetic. Our results further indicate that shared
assistance mitigates perceived user difficulty and even enables successful
performance on previously infeasible tasks. We showcase the extensibility of
our architecture with applications to quality-of-life tasks such as opening a
door, pouring liquids from containers, and manipulation with novel objects in
densely cluttered environments.
|
[
{
"version": "v1",
"created": "Wed, 18 Mar 2015 15:24:12 GMT"
},
{
"version": "v2",
"created": "Sun, 7 Jun 2015 17:28:59 GMT"
}
] | 2015-06-09T00:00:00 |
[
[
"Muelling",
"Katharina",
""
],
[
"Venkatraman",
"Arun",
""
],
[
"Valois",
"Jean-Sebastien",
""
],
[
"Downey",
"John",
""
],
[
"Weiss",
"Jeffrey",
""
],
[
"Javdani",
"Shervin",
""
],
[
"Hebert",
"Martial",
""
],
[
"Schwartz",
"Andrew B.",
""
],
[
"Collinger",
"Jennifer L.",
""
],
[
"Bagnell",
"J. Andrew",
""
]
] |
new_dataset
| 0.980937 |
1505.05428
|
Kenza Guenda
|
K. Chatouh, K. Guenda, T.A. Gulliver and L. Noui
|
Simplex and MacDonald Codes over $R_{q}$
| null | null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we introduce the homogeneous weight and homogeneous Gray map
over the ring $R_{q}=\mathbb{F}_{2}[u_{1},u_{2},\ldots,u_{q}]/\left\langle
u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\right\rangle$ for $q \geq 2$. We also
consider the construction of simplex and MacDonald codes of types $\alpha$ and
$\beta$ over this ring.
|
[
{
"version": "v1",
"created": "Wed, 20 May 2015 15:49:32 GMT"
},
{
"version": "v2",
"created": "Sat, 6 Jun 2015 23:42:42 GMT"
}
] | 2015-06-09T00:00:00 |
[
[
"Chatouh",
"K.",
""
],
[
"Guenda",
"K.",
""
],
[
"Gulliver",
"T. A.",
""
],
[
"Noui",
"L.",
""
]
] |
new_dataset
| 0.999106 |
1506.02071
|
Krzysztof Szczypiorski
|
Jason Hiney, Tejas Dakve, Krzysztof Szczypiorski, Kris Gaj
|
Using Facebook for Image Steganography
|
6 pages, 4 figures, 2 tables. Accepted to Fourth International
Workshop on Cyber Crime (IWCC 2015), co-located with 10th International
Conference on Availability, Reliability and Security (ARES 2015), Toulouse,
France, 24-28 August 2015
| null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Because Facebook is available on hundreds of millions of desktop and mobile
computing platforms around the world and because it is available on many
different kinds of platforms (from desktops and laptops running Windows, Unix,
or OS X to hand held devices running iOS, Android, or Windows Phone), it would
seem to be the perfect place to conduct steganography. On Facebook, information
hidden in image files will be further obscured within the millions of pictures
and other images posted and transmitted daily. Facebook is known to alter and
compress uploaded images so they use minimum space and bandwidth when displayed
on Facebook pages. The compression process generally disrupts attempts to use
Facebook for image steganography. This paper explores a method to minimize the
disruption so JPEG images can be used as steganography carriers on Facebook.
|
[
{
"version": "v1",
"created": "Fri, 5 Jun 2015 21:16:22 GMT"
}
] | 2015-06-09T00:00:00 |
[
[
"Hiney",
"Jason",
""
],
[
"Dakve",
"Tejas",
""
],
[
"Szczypiorski",
"Krzysztof",
""
],
[
"Gaj",
"Kris",
""
]
] |
new_dataset
| 0.998955 |
1506.02203
|
Matteo Ruggero Ronchi
|
Matteo Ruggero Ronchi and Pietro Perona
|
Describing Common Human Visual Actions in Images
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Which common human actions and interactions are recognizable in monocular
still images? Which involve objects and/or other people? How many is a person
performing at a time? We address these questions by exploring the actions and
interactions that are detectable in the images of the MS COCO dataset. We make
two main contributions. First, a list of 140 common `visual actions', obtained
by analyzing the largest on-line verb lexicon currently available for English
(VerbNet) and human sentences used to describe images in MS COCO. Second, a
complete set of annotations for those `visual actions', composed of
subject-object and associated verb, which we call COCO-a (a for `actions').
COCO-a is larger than existing action datasets in terms of number of actions
and instances of these actions, and is unique because it is data-driven, rather
than experimenter-biased. Other unique features are that it is exhaustive, and
that all subjects and objects are localized. A statistical analysis of the
accuracy of our annotations and of each action, interaction and subject-object
combination is provided.
|
[
{
"version": "v1",
"created": "Sun, 7 Jun 2015 00:33:23 GMT"
}
] | 2015-06-09T00:00:00 |
[
[
"Ronchi",
"Matteo Ruggero",
""
],
[
"Perona",
"Pietro",
""
]
] |
new_dataset
| 0.998724 |
1506.02211
|
Chao Dong
|
Chao Dong and Ximei Zhu and Yubin Deng and Chen Change Loy and Yu Qiao
|
Boosting Optical Character Recognition: A Super-Resolution Approach
|
5 pages, 8 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Text image super-resolution is a challenging yet open research problem in the
computer vision community. In particular, low-resolution images hamper the
performance of typical optical character recognition (OCR) systems. In this
article, we summarize our entry to the ICDAR2015 Competition on Text Image
Super-Resolution. Experiments are based on the provided ICDAR2015 TextSR
dataset and the released Tesseract-OCR 3.02 system. We report that our winning
entry of text image super-resolution framework has largely improved the OCR
performance with low-resolution images used as input, reaching an OCR accuracy
score of 77.19%, which is comparable with that of using the original
high-resolution images 78.80%.
|
[
{
"version": "v1",
"created": "Sun, 7 Jun 2015 02:29:45 GMT"
}
] | 2015-06-09T00:00:00 |
[
[
"Dong",
"Chao",
""
],
[
"Zhu",
"Ximei",
""
],
[
"Deng",
"Yubin",
""
],
[
"Loy",
"Chen Change",
""
],
[
"Qiao",
"Yu",
""
]
] |
new_dataset
| 0.964162 |
1504.02463
|
Ramon Caceres
|
Christopher Small, Richard Becker, Ram\'on C\'aceres, Simon Urbanek
|
Earthquakes, Hurricanes, and Mobile Communication Patterns in the New
York Metro Area: Collective Behavior during Extreme Events
|
24 pages, 10 figures, added 1 sentence to abstract, corrected font
issues
| null | null | null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We use wireless voice-call and text-message volumes to quantify
spatiotemporal communication patterns in the New York Metro area before,
during, and after the Virginia earthquake and Hurricane Irene in 2011. The
earthquake produces an instantaneous and pervasive increase in volume and a
~90-minute temporal disruption to both call and text volume patterns, but call
volume anomalies are much larger. The magnitude of call volume anomaly
diminishes with distance from earthquake epicenter, with multiple clusters of
high response in Manhattan. The hurricane produces a two-day, spatially varying
disruption to normal call and text volume patterns. In most coastal areas, call
volumes dropped anomalously in the afternoon before the hurricane's arrival,
but text volumes showed a much less consistent pattern. These spatial patterns
suggest partial, but not full, compliance with evacuation orders for low-lying
areas. By helping us understand how people behave in actual emergencies,
wireless data patterns may assist network operators and emergency planners who
want to provide the best possible services to the community. We have been
careful to preserve privacy throughout this work by using only anonymous and
aggregate data.
|
[
{
"version": "v1",
"created": "Thu, 9 Apr 2015 18:48:31 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Jun 2015 03:21:11 GMT"
}
] | 2015-06-08T00:00:00 |
[
[
"Small",
"Christopher",
""
],
[
"Becker",
"Richard",
""
],
[
"Cáceres",
"Ramón",
""
],
[
"Urbanek",
"Simon",
""
]
] |
new_dataset
| 0.999669 |
1504.05646
|
Vanessa Teague
|
J. Alex Halderman (University of Michigan) and Vanessa Teague
(University of Melbourne)
|
The New South Wales iVote System: Security Failures and Verification
Flaws in a Live Online Election
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the world's largest-ever deployment of online voting, the iVote Internet
voting system was trusted for the return of 280,000 ballots in the 2015 state
election in New South Wales, Australia. During the election, we performed an
independent security analysis of parts of the live iVote system and uncovered
severe vulnerabilities that could be leveraged to manipulate votes, violate
ballot privacy, and subvert the verification mechanism. These vulnerabilities
do not seem to have been detected by the election authorities before we
disclosed them, despite a pre-election security review and despite the system
having run in a live state election for five days. One vulnerability, the
result of including analytics software from an insecure external server,
exposed some votes to complete compromise of privacy and integrity. At least
one parliamentary seat was decided by a margin much smaller than the number of
votes taken while the system was vulnerable. We also found protocol flaws,
including vote verification that was itself susceptible to manipulation. This
incident underscores the difficulty of conducting secure elections online and
carries lessons for voters, election officials, and the e-voting research
community.
|
[
{
"version": "v1",
"created": "Wed, 22 Apr 2015 03:42:36 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Jun 2015 19:17:31 GMT"
}
] | 2015-06-08T00:00:00 |
[
[
"Halderman",
"J. Alex",
"",
"University of Michigan"
],
[
"Teague",
"Vanessa",
"",
"University of Melbourne"
]
] |
new_dataset
| 0.999583 |
1505.06289
|
Will Monroe
|
Angel Chang, Will Monroe, Manolis Savva, Christopher Potts,
Christopher D. Manning
|
Text to 3D Scene Generation with Rich Lexical Grounding
|
10 pages, 7 figures, 3 tables. To appear in ACL-IJCNLP 2015
| null | null | null |
cs.CL cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability to map descriptions of scenes to 3D geometric representations has
many applications in areas such as art, education, and robotics. However, prior
work on the text to 3D scene generation task has used manually specified object
categories and language that identifies them. We introduce a dataset of 3D
scenes annotated with natural language descriptions and learn from this data
how to ground textual descriptions to physical objects. Our method successfully
grounds a variety of lexical terms to concrete referents, and we show
quantitatively that our method improves 3D scene generation over previous work
using purely rule-based methods. We evaluate the fidelity and plausibility of
3D scenes generated with our grounding approach through human judgments. To
ease evaluation on this task, we also introduce an automated metric that
strongly correlates with human judgments.
|
[
{
"version": "v1",
"created": "Sat, 23 May 2015 08:32:11 GMT"
},
{
"version": "v2",
"created": "Fri, 5 Jun 2015 01:13:17 GMT"
}
] | 2015-06-08T00:00:00 |
[
[
"Chang",
"Angel",
""
],
[
"Monroe",
"Will",
""
],
[
"Savva",
"Manolis",
""
],
[
"Potts",
"Christopher",
""
],
[
"Manning",
"Christopher D.",
""
]
] |
new_dataset
| 0.970017 |
1506.01739
|
Flavio Lombardi
|
Roberto Battistoni, Roberto Di Pietro, Flavio Lombardi
|
CloRoFor: Cloud Robust Forensics
|
12 pages, 6 figures
| null | null | null |
cs.DC cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The malicious alteration of machine time is a big challenge in computer
forensics. Detecting such changes and reconstructing the actual timeline of
events is of paramount importance. However, this can be difficult since the
attacker has many opportunities and means to hide such changes. In particular,
cloud computing, host and guest machine time can be manipulated in various ways
by an attacker. Guest virtual machines are especially vulnerable to attacks
coming from their (more privileged) host. As such, it is important to guarantee
the timeline integrity of both hosts and guests in a cloud, or at least to
ensure that the alteration of such timeline does not go undetected. In this
paper we survey the issues related to host and guest machine time integrity in
the cloud. Further, we describe a novel architecture for host and guest time
alteration detection and correction/resilience with respect to compromised
hosts and guests. The proposed framework has been implemented on an especially
built simulator. Collected results are evaluated and discussed. Performance
figures show the feasibility of our proposal.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2015 22:12:31 GMT"
}
] | 2015-06-08T00:00:00 |
[
[
"Battistoni",
"Roberto",
""
],
[
"Di Pietro",
"Roberto",
""
],
[
"Lombardi",
"Flavio",
""
]
] |
new_dataset
| 0.986428 |
1205.6773
|
Sugata Sanyal
|
Preetida Vinayakray-Jani, Sugata Sanyal
|
Proactive TCP mechanism to improve Handover performance in Mobile
Satellite and Terrestrial Networks
|
5 pages, 2 figures
| null |
10.5120/7546-0643
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Emerging standardization of Geo Mobile Radio (GMR-1) for satellite system is
having strong resemblance to terrestrial GSM (Global System for Mobile
communications) at the upper protocol layers and TCP (Transmission Control
Protocol) is one of them. This space segment technology as well as terrestrial
technology, is characterized by periodic variations in communication properties
and coverage causing the termination of ongoing call as connections of Mobile
Nodes (MN) alter stochastically. Although provisions are made to provide
efficient communication infrastructure this hybrid space and terrestrial
networks must ensure the end-to-end network performance so that MN can move
seamlessly among these networks. However from connectivity point of view
current TCP performance has not been engineered for mobility events in
multi-radio MN. Traditionally, TCP has applied a set of congestion control
algorithms (slow-start, congestion avoidance, fast retransmit, fast recovery)
to probe the currently available bandwidth on the connection path. These
algorithms need several round-trip times to find the correct transmission rate
(i.e. congestion window), and adapt to sudden changes connectivity due to
handover. While there are protocols to maintain the connection continuity on
mobility events, such as Mobile IP (MIP) and Host Identity Protocol (HIP), TCP
performance engineering has had less attention. TCP is implemented as a
separate component in an operating system, and is therefore often unaware of
the mobility events or the nature of multi-radios' communication. This paper
aims to improve TCP communication performance in Mobile satellite and
terrestrial networks.
|
[
{
"version": "v1",
"created": "Wed, 30 May 2012 18:14:01 GMT"
}
] | 2015-06-05T00:00:00 |
[
[
"Vinayakray-Jani",
"Preetida",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.999125 |
1206.3365
|
Soung Chang Liew
|
Qike Wang, Kam-Hon Tse, Lian-Kuan Chen, Soung-Chang Liew
|
Physical-Layer Network Coding for VPN in TDM-PON
| null | null |
10.1109/LPT.2012.2224103
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We experimentally demonstrate a novel optical physical-layer network coding
(PNC) scheme over time-division multiplexing (TDM) passive optical network
(PON). Full-duplex error-free communications between optical network units
(ONUs) at 2.5 Gb/s are shown for all-optical virtual private network (VPN)
applications. Compared to the conventional half-duplex communications set-up,
our scheme can increase the capacity by 100% with power penalty smaller than 3
dB. Synchronization of two ONUs is not required for the proposed VPN scheme
|
[
{
"version": "v1",
"created": "Fri, 15 Jun 2012 03:40:31 GMT"
}
] | 2015-06-05T00:00:00 |
[
[
"Wang",
"Qike",
""
],
[
"Tse",
"Kam-Hon",
""
],
[
"Chen",
"Lian-Kuan",
""
],
[
"Liew",
"Soung-Chang",
""
]
] |
new_dataset
| 0.988834 |
1207.6313
|
Xavier Mestre
|
Francisco Rubio, Xavier Mestre, Walid Hachem
|
A CLT on the SNR of Diagonally Loaded MVDR Filters
|
This is a corrected version of the paper that will appear at IEEE
Transactions on Signal Processing September 2012
| null |
10.1109/TSP.2012.2197396
| null |
cs.IT math.IT math.ST stat.TH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the fluctuations of the signal-to-noise ratio (SNR) of
minimum variance distorsionless response (MVDR) filters implementing diagonal
loading in the estimation of the covariance matrix. Previous results in the
signal processing literature are generalized and extended by considering both
spatially as well as temporarily correlated samples. Specifically, a central
limit theorem (CLT) is established for the fluctuations of the SNR of the
diagonally loaded MVDR filter, under both supervised and unsupervised training
settings in adaptive filtering applications. Our second-order analysis is based
on the Nash-Poincar\'e inequality and the integration by parts formula for
Gaussian functionals, as well as classical tools from statistical asymptotic
theory. Numerical evaluations validating the accuracy of the CLT confirm the
asymptotic Gaussianity of the fluctuations of the SNR of the MVDR filter.
|
[
{
"version": "v1",
"created": "Thu, 26 Jul 2012 16:12:54 GMT"
}
] | 2015-06-05T00:00:00 |
[
[
"Rubio",
"Francisco",
""
],
[
"Mestre",
"Xavier",
""
],
[
"Hachem",
"Walid",
""
]
] |
new_dataset
| 0.995306 |
1506.01698
|
Anna Rohrbach
|
Anna Rohrbach and Marcus Rohrbach and Bernt Schiele
|
The Long-Short Story of Movie Description
| null | null | null | null |
cs.CV cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generating descriptions for videos has many applications including assisting
blind people and human-robot interaction. The recent advances in image
captioning as well as the release of large-scale movie description datasets
such as MPII Movie Description allow to study this task in more depth. Many of
the proposed methods for image captioning rely on pre-trained object classifier
CNNs and Long-Short Term Memory recurrent networks (LSTMs) for generating
descriptions. While image description focuses on objects, we argue that it is
important to distinguish verbs, objects, and places in the challenging setting
of movie description. In this work we show how to learn robust visual
classifiers from the weak annotations of the sentence descriptions. Based on
these visual classifiers we learn how to generate a description using an LSTM.
We explore different design choices to build and train the LSTM and achieve the
best performance to date on the challenging MPII-MD dataset. We compare and
analyze our approach and prior work along various dimensions to better
understand the key challenges of the movie description task.
|
[
{
"version": "v1",
"created": "Thu, 4 Jun 2015 19:45:36 GMT"
}
] | 2015-06-05T00:00:00 |
[
[
"Rohrbach",
"Anna",
""
],
[
"Rohrbach",
"Marcus",
""
],
[
"Schiele",
"Bernt",
""
]
] |
new_dataset
| 0.998384 |
1203.1263
|
Ronald Caplan
|
R. M. Caplan
|
NLSEmagic: Nonlinear Schr\"odinger Equation Multidimensional
Matlab-based GPU-accelerated Integrators using Compact High-order Schemes
|
37 pages, 13 figures
| null |
10.1016/j.cpc.2012.12.010
| null |
cs.MS cs.CE physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a simple to use, yet powerful code package called NLSEmagic to
numerically integrate the nonlinear Schr\"odinger equation in one, two, and
three dimensions. NLSEmagic is a high-order finite-difference code package
which utilizes graphic processing unit (GPU) parallel architectures. The codes
running on the GPU are many times faster than their serial counterparts, and
are much cheaper to run than on standard parallel clusters. The codes are
developed with usability and portability in mind, and therefore are written to
interface with MATLAB utilizing custom GPU-enabled C codes with the
MEX-compiler interface. The packages are freely distributed, including user
manuals and set-up files.
|
[
{
"version": "v1",
"created": "Tue, 6 Mar 2012 17:45:07 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Dec 2012 19:16:52 GMT"
}
] | 2015-06-04T00:00:00 |
[
[
"Caplan",
"R. M.",
""
]
] |
new_dataset
| 0.977489 |
1203.6543
|
Jos Vermaseren A
|
J. Kuipers, T. Ueda, J.A.M. Vermaseren and J. Vollinga
|
FORM version 4.0
|
26 pages. Uses axodraw
| null |
10.1016/j.cpc.2012.12.028
| null |
cs.SC hep-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present version 4.0 of the symbolic manipulation system FORM. The most
important new features are manipulation of rational polynomials and the
factorization of expressions. Many other new functions and commands are also
added; some of them are very general, while others are designed for building
specific high level packages, such as one for Groebner bases. New is also the
checkpoint facility, that allows for periodic backups during long calculations.
Lastly, FORM 4.0 has become available as open source under the GNU General
Public License version 3.
|
[
{
"version": "v1",
"created": "Thu, 29 Mar 2012 14:55:52 GMT"
}
] | 2015-06-04T00:00:00 |
[
[
"Kuipers",
"J.",
""
],
[
"Ueda",
"T.",
""
],
[
"Vermaseren",
"J. A. M.",
""
],
[
"Vollinga",
"J.",
""
]
] |
new_dataset
| 0.991798 |
1204.3431
|
Sumit Katiyar
|
Sumit Katiyar, R. K. Jain, N. K. Agrawal
|
Green Cellular Network Deployment To Reduce RF Pollution
|
6 pages, 6 figures. arXiv admin note: substantial text overlap with
arXiv:1204.2101, arXiv:1110.2627, and with arXiv:0803.0952 and
arXiv:0803.0952 by other authors
| null |
10.5120/8414-9361
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As the mobile telecommunication systems are growing tremendously all over the
world, the numbers of handheld and base stations are also rapidly growing and
it became very popular to see these base stations distributed everywhere in the
neighborhood and on roof tops which has caused a considerable amount of panic
to the public in Palestine concerning wither the radiated electromagnetic
fields from these base stations may cause any health effect or hazard. Recently
UP High Court in India ordered for removal of BTS towers from residential area,
it has created panic among cellular communication network designers too. Green
cellular networks could be a solution for the above problem. This paper deals
with green cellular networks with the help of multi-layer overlaid hierarchical
structure (macro / micro / pico / femto cells). Macrocell for area coverage,
micro for pedestrian and a slow moving traffic while pico for indoor use and
femto for individual high capacity users. This could be the answer of the
problem of energy conservation and enhancement of spectral density also.
|
[
{
"version": "v1",
"created": "Mon, 16 Apr 2012 10:10:59 GMT"
}
] | 2015-06-04T00:00:00 |
[
[
"Katiyar",
"Sumit",
""
],
[
"Jain",
"R. K.",
""
],
[
"Agrawal",
"N. K.",
""
]
] |
new_dataset
| 0.999311 |
1204.5046
|
Zuleita Ka Ming Ho
|
Zuleita Ho and Eduard Jorswieck
|
Instantaneous Relaying: Optimal Strategies and Interference
Neutralization
|
30 pages, journal version, complete proofs
| null |
10.1109/TSP.2012.2210709
| null |
cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a multi-user wireless network equipped with multiple relay nodes, some
relays are more intelligent than other relay nodes. The intelligent relays are
able to gather channel state information, perform linear processing and forward
signals whereas the dumb relays is only able to serve as amplifiers. As the
dumb relays are oblivious to the source and destination nodes, the wireless
network can be modeled as a relay network with *smart instantaneous relay*
only: the signals of source-destination arrive at the same time as
source-relay-destination. Recently, instantaneous relaying is shown to improve
the degrees-of-freedom of the network as compared to classical cut-set bound.
In this paper, we study an achievable rate region and its boundary of the
instantaneous interference relay channel in the scenario of (a) uninformed
non-cooperative source-destination nodes (source and destination nodes are not
aware of the existence of the relay and are non-cooperative) and (b) informed
and cooperative source-destination nodes. Further, we examine the performance
of interference neutralization: a relay strategy which is able to cancel
interference signals at each destination node in the air. We observe that
interference neutralization, although promise to achieve desired
degrees-of-freedom, may not be feasible if relay has limited power. Simulation
results show that the optimal relay strategies improve the achievable rate
region and provide better user-fairness in both uninformed non-cooperative and
informed cooperative scenarios.
|
[
{
"version": "v1",
"created": "Mon, 23 Apr 2012 12:45:43 GMT"
},
{
"version": "v2",
"created": "Wed, 9 May 2012 10:49:50 GMT"
}
] | 2015-06-04T00:00:00 |
[
[
"Ho",
"Zuleita",
""
],
[
"Jorswieck",
"Eduard",
""
]
] |
new_dataset
| 0.993191 |
1301.2005
|
Xiaowang Zhang
|
Xiaowang Zhang and Kewen Wang and Zhe Wang and Yue Ma and Guilin Qi
|
A Distance-based Paraconsistent Semantics for DL-Lite
|
17 pages
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DL-Lite is an important family of description logics. Recently, there is an
increasing interest in handling inconsistency in DL-Lite as the constraint
imposed by a TBox can be easily violated by assertions in ABox in DL-Lite. In
this paper, we present a distance-based paraconsistent semantics based on the
notion of feature in DL-Lite, which provides a novel way to rationally draw
meaningful conclusions even from an inconsistent knowledge base. Finally, we
investigate several important logical properties of this entailment relation
based on the new semantics and show its promising advantages in non-monotonic
reasoning for DL-Lite.
|
[
{
"version": "v1",
"created": "Wed, 9 Jan 2013 23:02:34 GMT"
},
{
"version": "v2",
"created": "Wed, 23 Jan 2013 14:57:25 GMT"
},
{
"version": "v3",
"created": "Wed, 3 Jun 2015 07:03:58 GMT"
}
] | 2015-06-04T00:00:00 |
[
[
"Zhang",
"Xiaowang",
""
],
[
"Wang",
"Kewen",
""
],
[
"Wang",
"Zhe",
""
],
[
"Ma",
"Yue",
""
],
[
"Qi",
"Guilin",
""
]
] |
new_dataset
| 0.997111 |
1506.01075
|
Chien-Liang Fok
|
C.-L. Fok and G. Johnson and J. D. Yamokoski, A. Mok, and L. Sentis
|
ControlIt! - A Software Framework for Whole-Body Operational Space
Control
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Whole Body Operational Space Control (WBOSC) is a pioneering algorithm in the
field of human-centered Whole-Body Control (WBC). It enables floating-base
highly-redundant robots to achieve unified motion/force control of one or more
operational space objectives while adhering to physical constraints. Limited
studies exist on the software architecture and APIs that enable WBOSC to
perform and be integrated into a larger system. In this paper we address this
by presenting ControlIt!, a new open-source software framework for WBOSC.
Unlike previous implementations, ControlIt! is multi-threaded to increase servo
frequencies on standard PC hardware. A new parameter binding mechanism enables
tight integration between ControlIt! and external processes via an extensible
set of transport protocols. To support a new robot, only two plugins and a URDF
model needs to be provided --- the rest of ControlIt! remains unchanged. New
WBC primitives can be added by writing a Task or Constraint plugin.
ControlIt!'s capabilities are demonstrated on Dreamer, a 16-DOF torque
controlled humanoid upper body robot containing both series elastic and
co-actuated joints, and using it to perform a product disassembly task. Using
this testbed, we show that ControlIt! can achieve average servo latencies of
about 0.5ms when configured with two Cartesian position tasks, two orientation
tasks, and a lower priority posture task. This is significantly higher than the
5ms that was achieved using UTA-WBC, the prototype implementation of WBOSC that
is both application and platform-specific. Variations in the product's position
is handled by updating the goal of the Cartesian position task. ControlIt!'s
source code is released under an LGPL license and we hope it will be adopted
and maintained by the WBC community for the long term as a platform for WBC
development and integration.
|
[
{
"version": "v1",
"created": "Tue, 2 Jun 2015 21:59:05 GMT"
}
] | 2015-06-04T00:00:00 |
[
[
"Fok",
"C. -L.",
""
],
[
"Johnson",
"G.",
""
],
[
"Yamokoski",
"J. D.",
""
],
[
"Mok",
"A.",
""
],
[
"Sentis",
"L.",
""
]
] |
new_dataset
| 0.97416 |
1506.01092
|
Seungjin Choi
|
Saehoon Kim and Seungjin Choi
|
Bilinear Random Projections for Locality-Sensitive Binary Codes
|
11 pages, 23 figures, CVPR-2015
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Locality-sensitive hashing (LSH) is a popular data-independent indexing
method for approximate similarity search, where random projections followed by
quantization hash the points from the database so as to ensure that the
probability of collision is much higher for objects that are close to each
other than for those that are far apart. Most of high-dimensional visual
descriptors for images exhibit a natural matrix structure. When visual
descriptors are represented by high-dimensional feature vectors and long binary
codes are assigned, a random projection matrix requires expensive complexities
in both space and time. In this paper we analyze a bilinear random projection
method where feature matrices are transformed to binary codes by two smaller
random projection matrices. We base our theoretical analysis on extending
Raginsky and Lazebnik's result where random Fourier features are composed with
random binary quantizers to form locality sensitive binary codes. To this end,
we answer the following two questions: (1) whether a bilinear random projection
also yields similarity-preserving binary codes; (2) whether a bilinear random
projection yields performance gain or loss, compared to a large linear
projection. Regarding the first question, we present upper and lower bounds on
the expected Hamming distance between binary codes produced by bilinear random
projections. In regards to the second question, we analyze the upper and lower
bounds on covariance between two bits of binary codes, showing that the
correlation between two bits is small. Numerical experiments on MNIST and
Flickr45K datasets confirm the validity of our method.
|
[
{
"version": "v1",
"created": "Wed, 3 Jun 2015 00:30:26 GMT"
}
] | 2015-06-04T00:00:00 |
[
[
"Kim",
"Saehoon",
""
],
[
"Choi",
"Seungjin",
""
]
] |
new_dataset
| 0.998598 |
1506.01256
|
Ndoundam Rene
|
Rene Ndoundam, Stephane Gael Raymond Ekodeck
|
PDF Steganography based on Chinese Remainder Theorem
|
29pages, 5 figures
| null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
We propose different approaches of PDF files based steganography, essentially
based on the Chinese Remainder Theorem. Here, after a cover PDF document has
been released from unnecessary A0, a secret message is hidden in it using one
of the proposed approaches, making it invisible to common PDF readers, and the
file is then transmitted through a non-secure communication channel. Where each
of our methods, ensure the condition that the number of inserted A0 is less
than the number of characters of the secret message s.
|
[
{
"version": "v1",
"created": "Wed, 3 Jun 2015 14:29:07 GMT"
}
] | 2015-06-04T00:00:00 |
[
[
"Ndoundam",
"Rene",
""
],
[
"Ekodeck",
"Stephane Gael Raymond",
""
]
] |
new_dataset
| 0.964162 |
1112.3096
|
Rui Wang
|
Rui Wang and Meixia Tao
|
Joint Source and Relay Precoding Designs for MIMO Two-Way Relaying Based
on MSE Criterion
|
32 pages, 10 figures
| null |
10.1109/TSP.2011.2178598
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Properly designed precoders can significantly improve the spectral efficiency
of multiple-input multiple-output (MIMO) relay systems. In this paper, we
investigate joint source and relay precoding design based on the
mean-square-error (MSE) criterion in MIMO two-way relay systems, where two
multi-antenna source nodes exchange information via a multi-antenna
amplify-and-forward relay node. This problem is non-convex and its optimal
solution remains unsolved. Aiming to find an efficient way to solve the
problem, we first decouple the primal problem into three tractable
sub-problems, and then propose an iterative precoding design algorithm based on
alternating optimization. The solution to each sub-problem is optimal and
unique, thus the convergence of the iterative algorithm is guaranteed.
Secondly, we propose a structured precoding design to lower the computational
complexity. The proposed precoding structure is able to parallelize the
channels in the multiple access (MAC) phase and broadcast (BC) phase. It thus
reduces the precoding design to a simple power allocation problem. Lastly, for
the special case where only a single data stream is transmitted from each
source node, we present a source-antenna-selection (SAS) based precoding design
algorithm. This algorithm selects only one antenna for transmission from each
source and thus requires lower signalling overhead. Comprehensive simulation is
conducted to evaluate the effectiveness of all the proposed precoding designs.
|
[
{
"version": "v1",
"created": "Wed, 14 Dec 2011 02:06:06 GMT"
}
] | 2015-06-03T00:00:00 |
[
[
"Wang",
"Rui",
""
],
[
"Tao",
"Meixia",
""
]
] |
new_dataset
| 0.99166 |
1201.1601
|
Xiaolin Wu
|
Xiaolin Wu and Guangtao Zhai
|
Temporal Psychovisual Modulation: a new paradigm of information display
| null | null |
10.1109/MSP.2012.2219678
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report on a new paradigm of information display that greatly extends the
utility and versatility of current optoelectronic displays. The main innovation
is to let a display of high refresh rate optically broadcast so-called atom
frames, which are designed through non-negative matrix factorization to form
bases for a class of images, and different viewers perceive selfintended images
by using display-synchronized viewing devices and their own human visual
systems to fuse appropriately weighted atom frames. This work is essentially a
scheme of temporal psychovisual modulation in visible spectrum, using an
optoelectronic modulator coupled with a biological demodulator.
|
[
{
"version": "v1",
"created": "Sun, 8 Jan 2012 03:16:50 GMT"
}
] | 2015-06-03T00:00:00 |
[
[
"Wu",
"Xiaolin",
""
],
[
"Zhai",
"Guangtao",
""
]
] |
new_dataset
| 0.996469 |
1201.4106
|
Frank Kschischang
|
Benjamin P. Smith and Arash Farhood and Andrew Hunt and Frank R.
Kschischang and John Lodge
|
Staircase Codes: FEC for 100 Gb/s OTN
|
To appear in IEEE/OSA J. of Lightwave Technology
| null |
10.1109/JLT.2011.2175479
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Staircase codes, a new class of forward-error-correction (FEC) codes suitable
for high-speed optical communications, are introduced. An ITU-T
G.709-compatible staircase code with rate R=239/255 is proposed, and FPGA-based
simulation results are presented, exhibiting a net coding gain (NCG) of 9.41 dB
at an output error rate of 1E-15, an improvement of 0.42 dB relative to the
best code from the ITU-T G.975.1 recommendation. An error floor analysis
technique is presented, and the proposed code is shown to have an error floor
at 4.0E-21.
|
[
{
"version": "v1",
"created": "Thu, 19 Jan 2012 16:49:36 GMT"
}
] | 2015-06-03T00:00:00 |
[
[
"Smith",
"Benjamin P.",
""
],
[
"Farhood",
"Arash",
""
],
[
"Hunt",
"Andrew",
""
],
[
"Kschischang",
"Frank R.",
""
],
[
"Lodge",
"John",
""
]
] |
new_dataset
| 0.997426 |
1411.7855
|
\"Orjan Stenflo
|
Franklin Mendivil and \"Orjan Stenflo
|
V-variable image compression
|
15 pages, 22 figures
|
Fractals, 23, no 02, (2015)
|
10.1142/S0218348X15500073
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
V-variable fractals, where $V$ is a positive integer, are intuitively
fractals with at most $V$ different "forms" or "shapes" at all levels of
magnification. In this paper we describe how V-variable fractals can be used
for the purpose of image compression.
|
[
{
"version": "v1",
"created": "Fri, 28 Nov 2014 13:18:22 GMT"
}
] | 2015-06-03T00:00:00 |
[
[
"Mendivil",
"Franklin",
""
],
[
"Stenflo",
"Örjan",
""
]
] |
new_dataset
| 0.983986 |
1506.00744
|
Hai Liu
|
Zhiyong Lin, Hai Liu, Lu Yu, Yiu-Wing Leung, and Xiaowen Chu
|
ZOS: A Fast Rendezvous Algorithm Based on Set of Available Channels for
Cognitive Radios
|
10 pages
| null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most of existing rendezvous algorithms generate channel-hopping sequences
based on the whole channel set. They are inefficient when the set of available
channels is a small subset of the whole channel set. We propose a new algorithm
called ZOS which uses three types of elementary sequences (namely, Zero-type,
One-type, and S-type) to generate channel-hopping sequences based on the set of
available channels. ZOS provides guaranteed rendezvous without any additional
requirements. The maximum time-to-rendezvous of ZOS is upper-bounded by
O(m1*m2*log2M) where M is the number of all channels and m1 and m2 are the
numbers of available channels of two users.
|
[
{
"version": "v1",
"created": "Tue, 2 Jun 2015 04:13:00 GMT"
}
] | 2015-06-03T00:00:00 |
[
[
"Lin",
"Zhiyong",
""
],
[
"Liu",
"Hai",
""
],
[
"Yu",
"Lu",
""
],
[
"Leung",
"Yiu-Wing",
""
],
[
"Chu",
"Xiaowen",
""
]
] |
new_dataset
| 0.999771 |
0801.1987
|
Neal E. Young
|
Christos Koufogiannakis and Neal E. Young
|
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering
Linear Programs
|
corrected version of FOCS 2007 paper: 10.1109/FOCS.2007.62. Accepted
to Algorithmica, 2013
|
Algorithmica 70(4):648-674(2014)
|
10.1007/s00453-013-9771-6
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give an approximation algorithm for packing and covering linear programs
(linear programs with non-negative coefficients). Given a constraint matrix
with n non-zeros, r rows, and c columns, the algorithm computes feasible primal
and dual solutions whose costs are within a factor of 1+eps of the optimal cost
in time O((r+c)log(n)/eps^2 + n).
|
[
{
"version": "v1",
"created": "Sun, 13 Jan 2008 22:04:49 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Mar 2013 16:03:10 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Koufogiannakis",
"Christos",
""
],
[
"Young",
"Neal E.",
""
]
] |
new_dataset
| 0.994162 |
1502.07391
|
Gideon Segev
|
Gideon Segev, Iddo Amit, Andrey Godkin, Alex Henning and Yossi
Rosenwaks
|
Multiple State EFN Transistors
| null | null |
10.1109/LED.2015.2434793
| null |
cs.ET cond-mat.mes-hall
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Electrostatically Formed Nanowire (EFN) based transistors have been suggested
in the past as gas sensing devices. These transistors are multiple gate
transistors in which the source to drain conduction path is determined by the
bias applied to the back gate, and two junction gates. If a specific bias is
applied to the side gates, the conduction band electrons between them are
confined to a well-defined area forming a narrow channel- the Electrostatically
Formed Nanowire. Recent work has shown that by applying non-symmetric bias on
the side gates, the lateral position of the EFN can be controlled. We propose a
novel Multiple State EFN Transistor (MSET) that utilizes this degree of freedom
for the implementation of complete multiplexer functionality in a single
transistor like device. The multiplexer functionality allows a very simple
implementation of binary and multiple valued logic functions.
|
[
{
"version": "v1",
"created": "Wed, 25 Feb 2015 22:38:02 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Mar 2015 08:33:33 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Segev",
"Gideon",
""
],
[
"Amit",
"Iddo",
""
],
[
"Godkin",
"Andrey",
""
],
[
"Henning",
"Alex",
""
],
[
"Rosenwaks",
"Yossi",
""
]
] |
new_dataset
| 0.997244 |
1503.05502
|
Stanislav Sobolevsky
|
Silvia Paldino, Iva Bojic, Stanislav Sobolevsky, Carlo Ratti, Marta C.
Gonzalez
|
Urban Magnetism Through The Lens of Geo-tagged Photography
|
17 pages, 10 figures, 6 tables
|
EPJ Data Science 2015, 4:5
|
10.1140/epjds/s13688-015-0043-3
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is an increasing trend of people leaving digital traces through social
media. This reality opens new horizons for urban studies. With this kind of
data, researchers and urban planners can detect many aspects of how people live
in cities and can also suggest how to transform cities into more efficient and
smarter places to live in. In particular, their digital trails can be used to
investigate tastes of individuals, and what attracts them to live in a
particular city or to spend their vacation there. In this paper we propose an
unconventional way to study how people experience the city, using information
from geotagged photographs that people take at different locations. We compare
the spatial behavior of residents and tourists in 10 most photographed cities
all around the world. The study was conducted on both a global and local level.
On the global scale we analyze the 10 most photographed cities and measure how
attractive each city is for people visiting it from other cities within the
same country or from abroad. For the purpose of our analysis we construct the
users mobility network and measure the strength of the links between each pair
of cities as a level of attraction of people living in one city (i.e., origin)
to the other city (i.e., destination). On the local level we study the spatial
distribution of user activity and identify the photographed hotspots inside
each city. The proposed methodology and the results of our study are a low cost
mean to characterize a touristic activity within a certain location and can
help in urban organization to strengthen their touristic potential.
|
[
{
"version": "v1",
"created": "Wed, 18 Mar 2015 17:30:21 GMT"
},
{
"version": "v2",
"created": "Tue, 14 Apr 2015 20:45:43 GMT"
},
{
"version": "v3",
"created": "Sat, 30 May 2015 11:37:20 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Paldino",
"Silvia",
""
],
[
"Bojic",
"Iva",
""
],
[
"Sobolevsky",
"Stanislav",
""
],
[
"Ratti",
"Carlo",
""
],
[
"Gonzalez",
"Marta C.",
""
]
] |
new_dataset
| 0.974335 |
1506.00091
|
Leon Abdillah
|
Tri Murti, Leon Andretti Abdillah, Muhammad Sobri
|
Sistem penunjang keputusan kelayakan pemberian pinjaman dengna metode
fuzzy tsukamoto
|
5 pages, in Indonesian, in Seminar Nasional Inovasi dan Tren 2015
(SNIT2015), Bekasi, 2015
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Decision support systems (DSS) can be used to help settlement issues or
decisions that are semi-structured or structured. The method used is Fuzzy
Tsukamoto. PT Triprima Finance is a company engaged in the service sector
lending with collateral in the form of Motor Vehicle Owner Book or car (reg).
PT. Triprima Finance should consider borrowing from its customers with the
consent of the head manager. Such approval requires a long time because they
have to pass through many stages of the reporting procedure. Decision-making
activities at PT Triprima Finance carried out by the analysis process manually.
To help overcome these problems, the need for completion method in accuracy and
speed of decision making feasibility of lending. To overcome this need to
develop a new system that is a decision support system Tsukamoto fuzzy method.
is expected to facilitate kaposko to determine the decisions to be taken.
|
[
{
"version": "v1",
"created": "Sat, 30 May 2015 08:06:20 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Murti",
"Tri",
""
],
[
"Abdillah",
"Leon Andretti",
""
],
[
"Sobri",
"Muhammad",
""
]
] |
new_dataset
| 0.967535 |
1506.00128
|
Pedro Quaresma
|
Pedro Quaresma and Vanda Santos and Milena Mari\'c
|
A Web Environment for Geometry
|
CICM 2015, Conference on Intelligent Computer Mathematics
(Work-in-Progress track), July 13-17, 2015, Washington DC, USA
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Web Geometry Laboratory, (WGL), is a blended-learning, collaborative and
adaptive, Web environment for geometry. It integrates a well known dynamic
geometry system. In a collaborative session, exchange of geometrical and
textual information between the user engaged in the session is possible. In a
normal work session (stand-alone mode), all the geometric steps done by the
students are recorded, alongside the navigation information, allowing, in a
latter stage, their teachers to "play back" the students sessions, using that
info to assert the students level and adjust the teaching strategies to each
individual student. Teachers can register and begin using one of the public
servers, defining students, preparing materials to be released to the students,
open collaborative sessions, etc. Using an action research methodology the WGL
system is being developed, validated through case-studies, and further
improved, in a cycle where the implementation steps are intertwined with case
studies.
|
[
{
"version": "v1",
"created": "Sat, 30 May 2015 15:27:53 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Quaresma",
"Pedro",
""
],
[
"Santos",
"Vanda",
""
],
[
"Marić",
"Milena",
""
]
] |
new_dataset
| 0.999236 |
1506.00190
|
Ruo-Wei Hung
|
Ruo-Wei Hung
|
Hamiltonian Cycles in Linear-Convex Supergrid Graphs
|
17 pages, 24 figurs
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A supergrid graph is a finite induced subgraph of the infinite graph
associated with the two-dimensional supergrid. The supergrid graphs contain
grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle
problem for grid and triangular grid graphs was known to be NP-complete. In the
past, we have shown that the Hamiltonian cycle problem for supergrid graphs is
also NP-complete. The Hamiltonian cycle problem on supergrid graphs can be
applied to control the stitching trace of computerized sewing machines. In this
paper, we will study the Hamiltonian cycle property of linear-convex supergrid
graphs which form a subclass of supergrid graphs. A connected graph is called
$k$-connected if there are $k$ vertex-disjoint paths between every pair of
vertices, and is called locally connected if the neighbors of each vertex in it
form a connected subgraph. In this paper, we first show that any 2-connected,
linear-convex supergrid graph is locally connected. We then prove that any
2-connected, linear-convex supergrid graph contains a Hamiltonian cycle.
|
[
{
"version": "v1",
"created": "Sun, 31 May 2015 03:42:31 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Hung",
"Ruo-Wei",
""
]
] |
new_dataset
| 0.995213 |
1506.00278
|
Licheng Yu
|
Licheng Yu, Eunbyung Park, Alexander C. Berg, and Tamara L. Berg
|
Visual Madlibs: Fill in the blank Image Generation and Question
Answering
|
10 pages; 8 figures; 4 tables
| null | null | null |
cs.CV cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a new dataset consisting of 360,001 focused
natural language descriptions for 10,738 images. This dataset, the Visual
Madlibs dataset, is collected using automatically produced fill-in-the-blank
templates designed to gather targeted descriptions about: people and objects,
their appearances, activities, and interactions, as well as inferences about
the general scene or its broader context. We provide several analyses of the
Visual Madlibs dataset and demonstrate its applicability to two new description
generation tasks: focused description generation, and multiple-choice
question-answering for images. Experiments using joint-embedding and deep
learning methods show promising results on these tasks.
|
[
{
"version": "v1",
"created": "Sun, 31 May 2015 19:39:44 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Yu",
"Licheng",
""
],
[
"Park",
"Eunbyung",
""
],
[
"Berg",
"Alexander C.",
""
],
[
"Berg",
"Tamara L.",
""
]
] |
new_dataset
| 0.999747 |
1506.00312
|
Masrour Zoghi
|
Masrour Zoghi, Zohar Karnin, Shimon Whiteson and Maarten de Rijke
|
Copeland Dueling Bandits
|
33 pages, 8 figures
| null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A version of the dueling bandit problem is addressed in which a Condorcet
winner may not exist. Two algorithms are proposed that instead seek to minimize
regret with respect to the Copeland winner, which, unlike the Condorcet winner,
is guaranteed to exist. The first, Copeland Confidence Bound (CCB), is designed
for small numbers of arms, while the second, Scalable Copeland Bandits (SCB),
works better for large-scale problems. We provide theoretical results bounding
the regret accumulated by CCB and SCB, both substantially improving existing
results. Such existing results either offer bounds of the form $O(K \log T)$
but require restrictive assumptions, or offer bounds of the form $O(K^2 \log
T)$ without requiring such assumptions. Our results offer the best of both
worlds: $O(K \log T)$ bounds without restrictive assumptions.
|
[
{
"version": "v1",
"created": "Mon, 1 Jun 2015 00:44:37 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Zoghi",
"Masrour",
""
],
[
"Karnin",
"Zohar",
""
],
[
"Whiteson",
"Shimon",
""
],
[
"de Rijke",
"Maarten",
""
]
] |
new_dataset
| 0.995895 |
1506.00326
|
Joshua Joy
|
Uichin Lee, Joshua Joy, Youngtae Noh
|
Secure Personal Content Networking over Untrusted Devices
| null | null |
10.1007/s11277-014-2093-4
| null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Securely sharing and managing personal content is a challenging task in
multi-device environments. In this paper, we design and implement a new
platform called Personal Content Networking (PCN). Our work is inspired by
Content-Centric Networking (CCN) because we aim to enable access to personal
content using its name instead of its location. The unique challenge of PCN is
to support secure file operations such as replication, updates, and access
control over distributed untrusted devices. The primary contribution of this
work is the design and implementation of a secure content management platform
that supports secure updates, replications, and fine-grained content-centric
access control of files. Furthermore, we demonstrate its feasibility through a
prototype implementation on the CCNx skeleton.
|
[
{
"version": "v1",
"created": "Mon, 1 Jun 2015 02:06:21 GMT"
}
] | 2015-06-02T00:00:00 |
[
[
"Lee",
"Uichin",
""
],
[
"Joy",
"Joshua",
""
],
[
"Noh",
"Youngtae",
""
]
] |
new_dataset
| 0.960212 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.