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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1403.4829
|
Qinggang Yue
|
Qinggang Yue, Zhen Ling, Benyuan Liu, Xinwen Fu, Wei Zhao
|
Blind Recognition of Touched Keys: Attack and Countermeasures
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce a novel computer vision based attack that
discloses inputs on a touch enabled device, while the attacker cannot see any
text or popups from a video of the victim tapping on the touch screen. In the
attack, we use the optical flow algorithm to identify touching frames where the
finger touches the screen surface. We innovatively use intersections of
detected edges of the touch screen to derive the homography matrix mapping the
touch screen surface in video frames to a reference image of the virtual
keyboard. We analyze the shadow formation around the fingertip and use the
k-means clustering algorithm to identify touched points. Homography can then
map these touched points to keys of the virtual keyboard. Our work is
substantially different from existing work. We target password input and are
able to achieve a high success rate. We target scenarios like classrooms,
conferences and similar gathering places and use a webcam or smartphone camera.
In these scenes, single-lens reflex (SLR) cameras and high-end camcorders used
in related work will appear suspicious. To defeat such computer vision based
attacks, we design, implement and evaluate the Privacy Enhancing Keyboard (PEK)
where a randomized virtual keyboard is used to input sensitive information.
|
[
{
"version": "v1",
"created": "Wed, 19 Mar 2014 14:55:17 GMT"
}
] | 2014-03-20T00:00:00 |
[
[
"Yue",
"Qinggang",
""
],
[
"Ling",
"Zhen",
""
],
[
"Liu",
"Benyuan",
""
],
[
"Fu",
"Xinwen",
""
],
[
"Zhao",
"Wei",
""
]
] |
new_dataset
| 0.998989 |
1403.4847
|
Emil Bj\"ornson
|
Emil Bj\"ornson, Michail Matthaiou and M\'erouane Debbah
|
Massive MIMO Systems with Hardware-Constrained Base Stations
|
Published at IEEE International Conference on Acoustics, Speech and
Signal Processing (ICASSP 2014), 5 pages, 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Massive multiple-input multiple-output (MIMO) systems are cellular networks
where the base stations (BSs) are equipped with unconventionally many antennas.
Such large antenna arrays offer huge spatial degrees-of-freedom for
transmission optimization; in particular, great signal gains, resilience to
imperfect channel knowledge, and small inter-user interference are all
achievable without extensive inter-cell coordination. The key to cost-efficient
deployment of large arrays is the use of hardware-constrained base stations
with low-cost antenna elements, as compared to today's expensive and
power-hungry BSs. Low-cost transceivers are prone to hardware imperfections,
but it has been conjectured that the excessive degrees-of-freedom of massive
MIMO would bring robustness to such imperfections. We herein prove this claim
for an uplink channel with multiplicative phase-drift, additive distortion
noise, and noise amplification. Specifically, we derive a closed-form scaling
law that shows how fast the imperfections increase with the number of antennas.
|
[
{
"version": "v1",
"created": "Wed, 19 Mar 2014 15:38:33 GMT"
}
] | 2014-03-20T00:00:00 |
[
[
"Björnson",
"Emil",
""
],
[
"Matthaiou",
"Michail",
""
],
[
"Debbah",
"Mérouane",
""
]
] |
new_dataset
| 0.99943 |
1403.4928
|
Leon Derczynski
|
Steven Bethard, Leon Derczynski, James Pustejovsky, Marc Verhagen
|
Clinical TempEval
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the Clinical TempEval task which is currently in preparation for
the SemEval-2015 evaluation exercise. This task involves identifying and
describing events, times and the relations between them in clinical text. Six
discrete subtasks are included, focusing on recognising mentions of times and
events, describing those mentions for both entity types, identifying the
relation between an event and the document creation time, and identifying
narrative container relations.
|
[
{
"version": "v1",
"created": "Wed, 19 Mar 2014 19:59:49 GMT"
}
] | 2014-03-20T00:00:00 |
[
[
"Bethard",
"Steven",
""
],
[
"Derczynski",
"Leon",
""
],
[
"Pustejovsky",
"James",
""
],
[
"Verhagen",
"Marc",
""
]
] |
new_dataset
| 0.99849 |
1203.3705
|
Artur Je\.z
|
Artur Je\.z
|
Recompression: a simple and powerful technique for word equations
|
Submitted to a journal. Since previous version the proofs were
simplified, overall presentation improved
| null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present an application of a simple technique of local
recompression, previously developed by the author in the context of compressed
membership problems and compressed pattern matching, to word equations. The
technique is based on local modification of variables (replacing X by aX or Xa)
and iterative replacement of pairs of letters appearing in the equation by a
`fresh' letter, which can be seen as a bottom-up compression of the solution of
the given word equation, to be more specific, building an SLP (Straight-Line
Programme) for the solution of the word equation.
Using this technique we give a new, independent and self-contained proofs of
most of the known results for word equations. To be more specific, the
presented (nondeterministic) algorithm runs in O(n log n) space and in time
polynomial in log N, where N is the size of the length-minimal solution of the
word equation. The presented algorithm can be easily generalised to a generator
of all solutions of the given word equation (without increasing the space
usage). Furthermore, a further analysis of the algorithm yields a doubly
exponential upper bound on the size of the length-minimal solution. The
presented algorithm does not use exponential bound on the exponent of
periodicity. Conversely, the analysis of the algorithm yields an independent
proof of the exponential bound on exponent of periodicity.
We believe that the presented algorithm, its idea and analysis are far
simpler than all previously applied. Furthermore, thanks to it we can obtain a
unified and simple approach to most of known results for word equations.
As a small additional result we show that for O(1) variables (with arbitrary
many appearances in the equation) word equations can be solved in linear space,
i.e. they are context-sensitive.
|
[
{
"version": "v1",
"created": "Fri, 16 Mar 2012 13:43:45 GMT"
},
{
"version": "v2",
"created": "Thu, 20 Sep 2012 10:45:05 GMT"
},
{
"version": "v3",
"created": "Tue, 18 Mar 2014 12:49:35 GMT"
}
] | 2014-03-19T00:00:00 |
[
[
"Jeż",
"Artur",
""
]
] |
new_dataset
| 0.988692 |
1403.4357
|
Yunquan Dong
|
Yunquan Dong, Pingyi Fan, Khaled Ben Letaief
|
High Speed Railway Wireless Communications: Efficiency v.s. Fairness
|
16 pages, 6 figures
|
IEEE Trans. Veh. Technol., vol. 62, no. 2, 2014, pp: 925-930
|
10.1109/TVT.2013.2281401
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
High speed railways (HSRs) have been deployed widely all over the world in
recent years. Different from traditional cellular communication, its high
mobility makes it essential to implement power allocation along the time. In
the HSR case, the transmission rate depends greatly on the distance between the
base station (BS) and the train. As a result, the train receives a time varying
data rate service when passing by a BS. It is clear that the most efficient
power allocation will spend all the power when the train is nearest from the
BS, which will cause great unfairness along the time. On the other hand, the
channel inversion allocation achieves the best fairness in terms of constant
rate transmission. However, its power efficiency is much lower. Therefore, the
power efficiency and the fairness along time are two incompatible objects. For
the HSR cellular system considered in this paper, a trade-off between the two
is achieved by proposing a temporal proportional fair power allocation scheme.
Besides, near optimal closed form solution and one algorithm finding the
$\epsilon$-optimal allocation are presented.
|
[
{
"version": "v1",
"created": "Tue, 18 Mar 2014 06:32:44 GMT"
}
] | 2014-03-19T00:00:00 |
[
[
"Dong",
"Yunquan",
""
],
[
"Fan",
"Pingyi",
""
],
[
"Letaief",
"Khaled Ben",
""
]
] |
new_dataset
| 0.977387 |
1403.4452
|
Heide Gluesing-Luerssen
|
Heide Gluesing-Luerssen
|
The Homogeneous Weight Partition and its Character-Theoretic Dual
| null | null | null | null |
cs.IT math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The values of the normalized homogeneous weight are determined for arbitrary
finite Frobenius rings and expressed in a form that is independent from a
generating character and the M\"obius function on the ring. The weight
naturally induces a partition of the ring, which is invariant under left or
right multiplication by units. It is shown that the character-theoretic
left-sided dual of this partition coincides with the right-sided dual, and even
more, the left- and right-sided Krawtchouk coefficients coincide. An example is
provided showing that this is not the case for general invariant partitions if
the ring is not semisimple.
|
[
{
"version": "v1",
"created": "Tue, 18 Mar 2014 13:48:45 GMT"
}
] | 2014-03-19T00:00:00 |
[
[
"Gluesing-Luerssen",
"Heide",
""
]
] |
new_dataset
| 0.956921 |
1403.4469
|
Rahul Upadhyay
|
Rahul R Upadhyay
|
Synchronous Relaying Of Sensor Data
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we have put forth a novel methodology to relay data obtained by
inbuilt sensors of smart phones in real time to remote database followed by
fetching of this data . Smart phones are becoming very common and they are
laced with a number of sensors that can not only be used in native applications
but can also be sent to external nodes to be used by third parties for
application and service development.
|
[
{
"version": "v1",
"created": "Sat, 15 Mar 2014 15:55:26 GMT"
}
] | 2014-03-19T00:00:00 |
[
[
"Upadhyay",
"Rahul R",
""
]
] |
new_dataset
| 0.985314 |
1403.4482
|
Pili Hu
|
Pili Hu, Qijiang Fan, Wing Cheong Lau
|
SNSAPI: A Cross-Platform Middleware for Rapid Deployment of
Decentralized Social Networks
| null | null | null | null |
cs.SI cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present the design, implementation and our year-long
maintenance experience of SNSAPI, a Python-based middleware which unifies the
interfaces and data structures of heterogeneous Social Networking Services
(SNS). Unlike most prior works, our middleware is user-oriented and requires
zero infrastructure support. It enables a user to readily conduct online social
activities in a programmable, cross-platform fashion while gradually reducing
the dependence on centralized Online Social Networks (OSN). More importantly,
as the SNSAPI middleware can be used to support decentralized social networking
services via conventional communication channels such as RSS or Email, it
enables the deployment of Decentralized Social Networks (DSN) in an
incremental, ad hoc manner. To demonstrate the viability of such type of DSNs,
we have deployed an experimental 6000-node SNSAPI-based DSN on PlanetLab and
evaluate its performance by replaying traces of online social activities
collected from a mainstream OSN. Our results show that, with only mild resource
consumption, the SNSAPI-based DSN can achieve acceptable forwarding latency
comparable to that of a centralized OSN. We also develop an analytical model to
characterize the trade-offs between resource consumption and message forwarding
delay in our DSN. Via 20 parameterized experiments on PlanetLab, we have found
that the empirical measurement results match reasonably with the performance
predicted by our analytical model.
|
[
{
"version": "v1",
"created": "Tue, 18 Mar 2014 14:43:15 GMT"
}
] | 2014-03-19T00:00:00 |
[
[
"Hu",
"Pili",
""
],
[
"Fan",
"Qijiang",
""
],
[
"Lau",
"Wing Cheong",
""
]
] |
new_dataset
| 0.999162 |
1403.3752
|
Gav Wood
|
Gavin Wood
|
Martta: A C++ Language Workbench
| null | null | null | null |
cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Language-orientated programming promises to elevate programmer productivity
through increased abstrac- tion capabilities. Structural programming
environments provide apparatus to reduce the difficulties with syntax. The
language workbench, a conceptual combination of these two approaches, is a
comparatively novel approach to software development and has so far been
attempted only in dynamic-dispatch, run-time-compiled languages (e.g. Java).
However, it must be remembered that several fields of engineering exist, each
having their own priorities. In the video games industry, where large, complex
and diverse projects are routinely developed, efficiency is paramount and as
such C++, as a development platform, is widely used. I explore the possibility
of a language workbench capable of a gradual transition in both skills and code
from the traditional C++ development environment. This article is the design
for a language workbench. It uses novel techniques including a
context-sensitive event- driven input system and a hybrid
single/multiple-inherited class model and through a prototype implementation
demon- strates that is both concise and practical for C++. I refute the
hitherto implicit hypothesis that the language workbench paradigm is not
applicable to the C++ language, showing that C++ can be used for creating an
effective development framework usable in otherwise pure-C++ programming
environments.
|
[
{
"version": "v1",
"created": "Sat, 15 Mar 2014 04:12:39 GMT"
}
] | 2014-03-18T00:00:00 |
[
[
"Wood",
"Gavin",
""
]
] |
new_dataset
| 0.999367 |
1403.3829
|
Wei Di
|
Zixuan Wang, Wei Di, Anurag Bhardwaj, Vignesh Jagadeesh, Robinson
Piramuthu
|
Geometric VLAD for Large Scale Image Search
|
8 pages
| null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/3.0/
|
We present a novel compact image descriptor for large scale image search. Our
proposed descriptor - Geometric VLAD (gVLAD) is an extension of VLAD (Vector of
Locally Aggregated Descriptors) that incorporates weak geometry information
into the VLAD framework. The proposed geometry cues are derived as a membership
function over keypoint angles which contain evident and informative information
but yet often discarded. A principled technique for learning the membership
function by clustering angles is also presented. Further, to address the
overhead of iterative codebook training over real-time datasets, a novel
codebook adaptation strategy is outlined. Finally, we demonstrate the efficacy
of proposed gVLAD based retrieval framework where we achieve more than 15%
improvement in mAP over existing benchmarks.
|
[
{
"version": "v1",
"created": "Sat, 15 Mar 2014 17:35:26 GMT"
}
] | 2014-03-18T00:00:00 |
[
[
"Wang",
"Zixuan",
""
],
[
"Di",
"Wei",
""
],
[
"Bhardwaj",
"Anurag",
""
],
[
"Jagadeesh",
"Vignesh",
""
],
[
"Piramuthu",
"Robinson",
""
]
] |
new_dataset
| 0.997431 |
1403.3992
|
Elena Pribavkina
|
Vladimir V. Gusev, Elena V. Pribavkina
|
Reset thresholds of automata with two cycle lengths
|
11 pages, 5 figures, submitted to CIAA 2014
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present several series of synchronizing automata with multiple parameters,
generalizing previously known results. Let p and q be two arbitrary co-prime
positive integers, q > p. We describe reset thresholds of the colorings of
primitive digraphs with exactly one cycle of length p and one cycle of length
q. Also, we study reset thresholds of the colorings of primitive digraphs with
exactly one cycle of length q and two cycles of length p.
|
[
{
"version": "v1",
"created": "Mon, 17 Mar 2014 04:02:50 GMT"
}
] | 2014-03-18T00:00:00 |
[
[
"Gusev",
"Vladimir V.",
""
],
[
"Pribavkina",
"Elena V.",
""
]
] |
new_dataset
| 0.973733 |
1403.3996
|
Vineeth Kashyap
|
Vineeth Kashyap, Kyle Dewey, Ethan A. Kuefner, John Wagner, Kevin
Gibbons, John Sarracino, Ben Wiedermann, Ben Hardekopf
|
JSAI: Designing a Sound, Configurable, and Efficient Static Analyzer for
JavaScript
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe JSAI, an abstract interpreter for JavaScript. JSAI uses novel
abstract domains to compute a reduced product of type inference, pointer
analysis, string analysis, integer and boolean constant propagation, and
control-flow analysis. In addition, JSAI allows for analysis control-flow
sensitivity (i.e., context-, path-, and heap-sensitivity) to be modularly
configured without requiring any changes to the analysis implementation. JSAI
is designed to be provably sound with respect to a specific concrete semantics
for JavaScript, which has been extensively tested against existing
production-quality JavaScript implementations.
We provide a comprehensive evaluation of JSAI's performance and precision
using an extensive benchmark suite. This benchmark suite includes real-world
JavaScript applications, machine-generated JavaScript code via Emscripten, and
browser addons. We use JSAI's configurability to evaluate a large number of
analysis sensitivities (some well-known, some novel) and observe some
surprising results. We believe that JSAI's configurability and its formal
specifications position it as a useful research platform to experiment on novel
sensitivities, abstract domains, and client analyses for JavaScript.
|
[
{
"version": "v1",
"created": "Mon, 17 Mar 2014 04:29:25 GMT"
}
] | 2014-03-18T00:00:00 |
[
[
"Kashyap",
"Vineeth",
""
],
[
"Dewey",
"Kyle",
""
],
[
"Kuefner",
"Ethan A.",
""
],
[
"Wagner",
"John",
""
],
[
"Gibbons",
"Kevin",
""
],
[
"Sarracino",
"John",
""
],
[
"Wiedermann",
"Ben",
""
],
[
"Hardekopf",
"Ben",
""
]
] |
new_dataset
| 0.9976 |
1403.4026
|
Jingwei Chen
|
Yong Feng, Jingwei Chen, Wenyuan Wu
|
A Short Note on Zero-error Computation for Algebraic Numbers by IPSLQ
|
4 pages
|
ACM Communications in Computer Algebra, 47(3), 2013
| null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The PSLQ algorithm is one of the most popular algorithm for finding
nontrivial integer relations for several real numbers. In the present work, we
present an incremental version of PSLQ. For some applications needing to call
PSLQ many times, such as finding the minimal polynomial of an algebraic number
without knowing the degree, the incremental PSLQ algorithm is more efficient
than PSLQ, both theoretically and practically.
|
[
{
"version": "v1",
"created": "Mon, 17 Mar 2014 08:32:59 GMT"
}
] | 2014-03-18T00:00:00 |
[
[
"Feng",
"Yong",
""
],
[
"Chen",
"Jingwei",
""
],
[
"Wu",
"Wenyuan",
""
]
] |
new_dataset
| 0.968516 |
1403.4232
|
Tanushri Chakravorty
|
Tanushri Chakravorty, Guillaume-Alexandre Bilodeau, Eric Granger
|
Automatic Image Registration in Infrared-Visible Videos using Polygon
Vertices
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, an automatic method is proposed to perform image registration
in visible and infrared pair of video sequences for multiple targets. In
multimodal image analysis like image fusion systems, color and IR sensors are
placed close to each other and capture a same scene simultaneously, but the
videos are not properly aligned by default because of different fields of view,
image capturing information, working principle and other camera specifications.
Because the scenes are usually not planar, alignment needs to be performed
continuously by extracting relevant common information. In this paper, we
approximate the shape of the targets by polygons and use affine transformation
for aligning the two video sequences. After background subtraction, keypoints
on the contour of the foreground blobs are detected using DCE (Discrete Curve
Evolution)technique. These keypoints are then described by the local shape at
each point of the obtained polygon. The keypoints are matched based on the
convexity of polygon's vertices and Euclidean distance between them. Only good
matches for each local shape polygon in a frame, are kept. To achieve a global
affine transformation that maximises the overlapping of infrared and visible
foreground pixels, the matched keypoints of each local shape polygon are stored
temporally in a buffer for a few number of frames. The matrix is evaluated at
each frame using the temporal buffer and the best matrix is selected, based on
an overlapping ratio criterion. Our experimental results demonstrate that this
method can provide highly accurate registered images and that we outperform a
previous related method.
|
[
{
"version": "v1",
"created": "Mon, 17 Mar 2014 19:58:14 GMT"
}
] | 2014-03-18T00:00:00 |
[
[
"Chakravorty",
"Tanushri",
""
],
[
"Bilodeau",
"Guillaume-Alexandre",
""
],
[
"Granger",
"Eric",
""
]
] |
new_dataset
| 0.979765 |
1301.0014
|
Denis Krotov
|
Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia),
Vladimir Potapov (Sobolev Institute of Mathematics, Novosibirsk, Russia)
|
Propelinear 1-perfect codes from quadratic functions
|
4 IEEE pages. v2: minor revision, + upper bound (Sect. III.B),
+remarks (Sect. V.A); v3: minor revision, + length 15 (Sect. V.B)
|
IEEE Trans. Inf. Theory 60(4) 2014, 2065-2068
|
10.1109/TIT.2014.2303158
| null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Perfect codes obtained by the Vasil'ev--Sch\"onheim construction from a
linear base code and quadratic switching functions are transitive and,
moreover, propelinear. This gives at least $\exp(cN^2)$ propelinear $1$-perfect
codes of length $N$ over an arbitrary finite field, while an upper bound on the
number of transitive codes is $\exp(C(N\ln N)^2)$. Keywords: perfect code,
propelinear code, transitive code, automorphism group, Boolean function.
|
[
{
"version": "v1",
"created": "Mon, 31 Dec 2012 21:05:29 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Dec 2013 02:33:42 GMT"
},
{
"version": "v3",
"created": "Thu, 20 Feb 2014 07:53:27 GMT"
}
] | 2014-03-17T00:00:00 |
[
[
"Krotov",
"Denis",
"",
"Sobolev Institute of Mathematics, Novosibirsk, Russia"
],
[
"Potapov",
"Vladimir",
"",
"Sobolev Institute of Mathematics, Novosibirsk, Russia"
]
] |
new_dataset
| 0.99963 |
1403.3547
|
Rakesh Kumar Pandey
|
Rakesh Kumar Pandey, Dilip Kumar
|
Distributed Transformer Monitoring System Based On Zigbee Technology
|
3 Pages, 5 Figures, International Journal of Engineering Trends and
Technology (IJETT)-Volume4 Issue5-May (2013)
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Distributed transformer networks remote monitoring system is developed and
constructed,for monitor and record the parameters like temperature, oil level
status, of a distribution transformer.The system consists of a micro controller
based circuit,with solid-state components for handling sensors,power
back-up,real time clock and data communication module which based on ZigBee
protocol.
|
[
{
"version": "v1",
"created": "Fri, 14 Mar 2014 12:08:22 GMT"
}
] | 2014-03-17T00:00:00 |
[
[
"Pandey",
"Rakesh Kumar",
""
],
[
"Kumar",
"Dilip",
""
]
] |
new_dataset
| 0.996368 |
1403.3660
|
Delaram Kahrobaei
|
Delaram Kahrobaei, Charalambos Koupparis, and Vladimir Shpilrain
|
A CCA secure cryptosystem using matrices over group rings
| null | null | null | null |
cs.CR math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a cryptosystem based on matrices over group rings and claim that
it is secure against adaptive chosen ciphertext attack.
|
[
{
"version": "v1",
"created": "Fri, 14 Mar 2014 18:14:40 GMT"
}
] | 2014-03-17T00:00:00 |
[
[
"Kahrobaei",
"Delaram",
""
],
[
"Koupparis",
"Charalambos",
""
],
[
"Shpilrain",
"Vladimir",
""
]
] |
new_dataset
| 0.987084 |
1309.7937
|
Matthew Bellman
|
Matthew J. Bellman and Teng-Hu Cheng and Ryan J. Downey and Warren E.
Dixon
|
Stationary Cycling Induced by Switched Functional Electrical Stimulation
Control
|
8 pages, 3 figures, submitted to ACC 2014
| null | null | null |
cs.SY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Functional electrical stimulation (FES) is used to activate the dysfunctional
lower limb muscles of individuals with neuromuscular disorders to produce
cycling as a means of exercise and rehabilitation. However, FES-cycling is
still metabolically inefficient and yields low power output at the cycle crank
compared to able-bodied cycling. Previous literature suggests that these
problems are symptomatic of poor muscle control and non-physiological muscle
fiber recruitment. The latter is a known problem with FES in general, and the
former motivates investigation of better control methods for FES-cycling.In
this paper, a stimulation pattern for quadriceps femoris-only FES-cycling is
derived based on the effectiveness of knee joint torque in producing forward
pedaling. In addition, a switched sliding-mode controller is designed for the
uncertain, nonlinear cycle-rider system with autonomous state-dependent
switching. The switched controller yields ultimately bounded tracking of a
desired trajectory in the presence of an unknown, time-varying, bounded
disturbance, provided a reverse dwell-time condition is satisfied by
appropriate choice of the control gains and a sufficient desired cadence.
Stability is derived through Lyapunov methods for switched systems, and
experimental results demonstrate the performance of the switched control system
under typical cycling conditions.
|
[
{
"version": "v1",
"created": "Mon, 30 Sep 2013 17:39:04 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Oct 2013 14:50:46 GMT"
},
{
"version": "v3",
"created": "Thu, 13 Mar 2014 06:18:20 GMT"
}
] | 2014-03-14T00:00:00 |
[
[
"Bellman",
"Matthew J.",
""
],
[
"Cheng",
"Teng-Hu",
""
],
[
"Downey",
"Ryan J.",
""
],
[
"Dixon",
"Warren E.",
""
]
] |
new_dataset
| 0.996735 |
1403.3118
|
Rodrigo da Silva Moreira
|
Rodrigo da Silva Moreira and Nelson Francisco Favilla Ebecken
|
Parallel WiSARD object tracker: a ram-based tracking system
|
15 pages, 7 figures
|
Computer Science & Engineering: An International Journal (CSEIJ),
Vol. 4, No. 1, February 2014
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes the Parallel WiSARD Object Tracker (PWOT), a new object
tracker based on the WiSARD weightless neural network that is robust against
quantization errors. Object tracking in video is an important and challenging
task in many applications. Difficulties can arise due to weather conditions,
target trajectory and appearance, occlusions, lighting conditions and noise.
Tracking is a high-level application and requires the object location frame by
frame in real time. This paper proposes a fast hybrid image segmentation
(threshold and edge detection) in YcbCr color model and a parallel RAM based
discriminator that improves efficiency when quantization errors occur. The
original WiSARD training algorithm was changed to allow the tracking.
|
[
{
"version": "v1",
"created": "Wed, 12 Mar 2014 21:23:52 GMT"
}
] | 2014-03-14T00:00:00 |
[
[
"Moreira",
"Rodrigo da Silva",
""
],
[
"Ebecken",
"Nelson Francisco Favilla",
""
]
] |
new_dataset
| 0.97806 |
1403.3336
|
Kenneth Knowles
|
Kenneth Knowles
|
Executable Refinement Types
|
Ph.D. dissertation. Accepted by the University of California, Santa
Cruz, in March 2014. 278 pages (295 including frontmatter)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This dissertation introduces executable refinement types, which refine
structural types by semi-decidable predicates, and establishes their metatheory
and accompanying implementation techniques. These results are useful for
undecidable type systems in general.
Particular contributions include: (1) Type soundness and a logical relation
for extensional equivalence for executable refinement types (though type
checking is undecidable); (2) hybrid type checking for executable refinement
types, which blends static and dynamic checks in a novel way, in some sense
performing better statically than any decidable approximation; (3) a type
reconstruction algorithm - reconstruction is decidable even though type
checking is not, when suitably redefined to apply to undecidable type systems;
(4) a novel use of existential types with dependent types to ensure that the
language of logical formulae is closed under type checking (5) a prototype
implementation, Sage, of executable refinement types such that all dynamic
errors are communicated back to the compiler and are thenceforth static errors.
|
[
{
"version": "v1",
"created": "Thu, 13 Mar 2014 17:31:39 GMT"
}
] | 2014-03-14T00:00:00 |
[
[
"Knowles",
"Kenneth",
""
]
] |
new_dataset
| 0.99784 |
1403.3366
|
Anupam Das
|
Anupam Das, Nikita Borisov, Matthew Caesar
|
Fingerprinting Smart Devices Through Embedded Acoustic Components
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The widespread use of smart devices gives rise to both security and privacy
concerns. Fingerprinting smart devices can assist in authenticating physical
devices, but it can also jeopardize privacy by allowing remote identification
without user awareness. We propose a novel fingerprinting approach that uses
the microphones and speakers of smart phones to uniquely identify an individual
device. During fabrication, subtle imperfections arise in device microphones
and speakers which induce anomalies in produced and received sounds. We exploit
this observation to fingerprint smart devices through playback and recording of
audio samples. We use audio-metric tools to analyze and explore different
acoustic features and analyze their ability to successfully fingerprint smart
devices. Our experiments show that it is even possible to fingerprint devices
that have the same vendor and model; we were able to accurately distinguish
over 93% of all recorded audio clips from 15 different units of the same model.
Our study identifies the prominent acoustic features capable of fingerprinting
devices with high success rate and examines the effect of background noise and
other variables on fingerprinting accuracy.
|
[
{
"version": "v1",
"created": "Thu, 13 Mar 2014 18:56:56 GMT"
}
] | 2014-03-14T00:00:00 |
[
[
"Das",
"Anupam",
""
],
[
"Borisov",
"Nikita",
""
],
[
"Caesar",
"Matthew",
""
]
] |
new_dataset
| 0.984167 |
1403.2980
|
Rocio Gonzalez-Diaz
|
Rocio Gonzalez-Diaz, Maria-Jose Jimenez, Belen Medrano
|
3D Well-composed Polyhedral Complexes
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A binary three-dimensional (3D) image $I$ is well-composed if the boundary
surface of its continuous analog is a 2D manifold. Since 3D images are not
often well-composed, there are several voxel-based methods ("repairing"
algorithms) for turning them into well-composed ones but these methods either
do not guarantee the topological equivalence between the original image and its
corresponding well-composed one or involve sub-sampling the whole image.
In this paper, we present a method to locally "repair" the cubical complex
$Q(I)$ (embedded in $\mathbb{R}^3$) associated to $I$ to obtain a polyhedral
complex $P(I)$ homotopy equivalent to $Q(I)$ such that the boundary of every
connected component of $P(I)$ is a 2D manifold. The reparation is performed via
a new codification system for $P(I)$ under the form of a 3D grayscale image
that allows an efficient access to cells and their faces.
|
[
{
"version": "v1",
"created": "Wed, 12 Mar 2014 15:44:17 GMT"
}
] | 2014-03-13T00:00:00 |
[
[
"Gonzalez-Diaz",
"Rocio",
""
],
[
"Jimenez",
"Maria-Jose",
""
],
[
"Medrano",
"Belen",
""
]
] |
new_dataset
| 0.992027 |
1403.2499
|
Guanghui Zhang
|
Bocong Chen, San Ling, Guanghui Zhang
|
Application of Constacyclic codes to Quantum MDS Codes
|
16 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum maximal-distance-separable (MDS) codes form an important class of
quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS
codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the
Hermitian construction and the quantum Singleton bound. If
$C^{\perp_{H}}\subseteq C$, we say that $C$ is a dual-containing code. Many new
quantum MDS codes with relatively large minimum distance have been produced by
constructing dual-containing constacyclic MDS codes (see \cite{Guardia11},
\cite{Kai13}, \cite{Kai14}). These works motivate us to make a careful study on
the existence condition for nontrivial dual-containing constacyclic codes. This
would help us to avoid unnecessary attempts and provide effective ideas in
order to construct dual-containing codes. Several classes of dual-containing
MDS constacyclic codes are constructed and their parameters are computed.
Consequently, new quantum MDS codes are derived from these parameters. The
quantum MDS codes exhibited here have parameters better than the ones available
in the literature.
|
[
{
"version": "v1",
"created": "Tue, 11 Mar 2014 08:39:08 GMT"
}
] | 2014-03-12T00:00:00 |
[
[
"Chen",
"Bocong",
""
],
[
"Ling",
"San",
""
],
[
"Zhang",
"Guanghui",
""
]
] |
new_dataset
| 0.985391 |
1403.2548
|
Neenu George
|
Neenu George, T.K.Parani
|
Detection of Node Clones in Wireless Sensor Network Using Detection
Protocols
|
6 pages,5 figures,"Published with International Journal of
Engineering Trends and Technology (IJETT)"Volume8 Number 6-Feb2014
|
nternational Journal of Engineering Trends and Technology (IJETT)
Volume8 Number 6-Feb2014
|
10.14445/22315381/IJETT-V8P253
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor networks consist of hundreds to thousands of sensor nodes and
are widely used in civilian and security applications. One of the serious
physical attacks faced by the wireless sensor network is node clone attack.
Thus two node clone detection protocols are introduced via distributed hash
table and randomly directed exploration to detect node clones. The former is
based on a hash table value which is already distributed and provides key based
facilities like checking and caching to detect node clones. The later one is
using probabilistic directed forwarding technique and border determination. The
simulation results for storage consumption, communication cost and detection
probability is done using NS2 and obtained randomly directed exploration is the
best one having low communication cost and storage consumption and has good
detection probability.
Keywords: wireless sensor networks (wsn), distributed hash table, randomly
directed exploration.
|
[
{
"version": "v1",
"created": "Tue, 11 Mar 2014 12:06:26 GMT"
}
] | 2014-03-12T00:00:00 |
[
[
"George",
"Neenu",
""
],
[
"Parani",
"T. K.",
""
]
] |
new_dataset
| 0.997038 |
1403.2630
|
Edinah Gnang K
|
Edinah K. Gnang, Ori Parzanchevski, Yuval Filmus
|
A SageTeX Hypermatrix Algebra Package
| null | null | null | null |
cs.MS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe here a rudimentary sage implementation of the Bhattacharya-Mesner
hypermatrix algebra package.
|
[
{
"version": "v1",
"created": "Tue, 11 Mar 2014 16:23:23 GMT"
}
] | 2014-03-12T00:00:00 |
[
[
"Gnang",
"Edinah K.",
""
],
[
"Parzanchevski",
"Ori",
""
],
[
"Filmus",
"Yuval",
""
]
] |
new_dataset
| 0.991181 |
1207.3574
|
Lawrence Ong
|
Lawrence Ong, Sarah J. Johnson, Christopher M. Kellett
|
On the Capacity of the Binary-Symmetric Parallel-Relay Network
|
Author's final version (to appear in Transactions on Emerging
Telecommunications Technologies)
|
Transactions on Emerging Telecommunications Technologies, Volume
25, Issue 2, pages 217-230, February 2014
|
10.1002/ett.2561
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the binary-symmetric parallel-relay network where there is one
source, one destination, and multiple relays in parallel. We show that
forwarding relays, where the relays merely transmit their received signals,
achieve the capacity in two ways: with coded transmission at the source and a
finite number of relays, or uncoded transmission at the source and a
sufficiently large number of relays. On the other hand, decoding relays, where
the relays decode the source message, re-encode, and forward it to the
destination, achieve the capacity when the number of relays is small. In
addition, we show that any coding scheme that requires decoding at any relay is
suboptimal in large parallel-relay networks, where forwarding relays achieve
strictly higher rates.
|
[
{
"version": "v1",
"created": "Mon, 16 Jul 2012 04:28:58 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Ong",
"Lawrence",
""
],
[
"Johnson",
"Sarah J.",
""
],
[
"Kellett",
"Christopher M.",
""
]
] |
new_dataset
| 0.998515 |
1307.2661
|
Sourangsu Banerji
|
Sourangsu Banerji, Rahul Singha Chowdhury
|
On IEEE 802.11: Wireless LAN Technology
|
19 pages, 4 figures, 3 tables
|
International Journal of Mobile Network Communications &
Telematics (IJMNCT),Volume 3,Issue 4, August 2013
|
10.5121/ijmnct.2013.3405
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network technologies are traditionally based on wireline solutions. But the
introduction of the IEEE 802.11 standards have made a huge impact on the market
such that laptops, PCs, printers, cellphones, and VoIP phones, MP3 players in
our homes, in offices and even in public areas have incorporated the wireless
LAN technology. Wireless broadband technologies nowadays provide unlimited
broadband access to users which were previously offered only to wireline users.
In this paper, we review and summarize one of the emerging wireless broadband
technology i.e. IEEE 802.11,which is a set of physical layer standard for
implementing wireless local area network computer communication in the
2.4,3.6,5 and 60GHz frequency band. They fix technology issues or add
functionality which is expected to be required by future applications. Though
some of the earlier versions of these technologies are obsolete (such as
HiperLAN) now but still we have included them in this review for the sake of
completeness.
|
[
{
"version": "v1",
"created": "Wed, 10 Jul 2013 03:27:15 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Jul 2013 05:02:02 GMT"
},
{
"version": "v3",
"created": "Sun, 4 Aug 2013 16:21:50 GMT"
},
{
"version": "v4",
"created": "Thu, 15 Aug 2013 06:29:51 GMT"
},
{
"version": "v5",
"created": "Fri, 23 Aug 2013 15:14:11 GMT"
},
{
"version": "v6",
"created": "Sun, 16 Feb 2014 18:43:31 GMT"
},
{
"version": "v7",
"created": "Sun, 9 Mar 2014 08:36:05 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Banerji",
"Sourangsu",
""
],
[
"Chowdhury",
"Rahul Singha",
""
]
] |
new_dataset
| 0.999221 |
1312.3422
|
Travis Gagie
|
Travis Gagie, Giovanni Manzini and Daniel Valenzuela
|
Compressed Spaced Suffix Arrays
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spaced seeds are important tools for similarity search in bioinformatics, and
using several seeds together often significantly improves their performance.
With existing approaches, however, for each seed we keep a separate linear-size
data structure, either a hash table or a spaced suffix array (SSA). In this
paper we show how to compress SSAs relative to normal suffix arrays (SAs) and
still support fast random access to them. We first prove a theoretical upper
bound on the space needed to store an SSA when we already have the SA. We then
present experiments indicating that our approach works even better in practice.
|
[
{
"version": "v1",
"created": "Thu, 12 Dec 2013 09:15:47 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Feb 2014 22:31:53 GMT"
},
{
"version": "v3",
"created": "Sun, 9 Mar 2014 10:40:30 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Gagie",
"Travis",
""
],
[
"Manzini",
"Giovanni",
""
],
[
"Valenzuela",
"Daniel",
""
]
] |
new_dataset
| 0.992593 |
1403.1890
|
Sherin Abdel Hamid M.Sc.
|
Sherin Abdel Hamid, Hossam S. Hassanein, Glen Takahara
|
Vehicle as a Resource (VaaR)
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intelligent vehicles are considered key enablers for intelligent
transportation systems. They are equipped with resources/components to enable
services for vehicle occupants, other vehicles on the road, and third party
recipients. In-vehicle sensors, communication modules, and on-board units with
computing and storage capabilities allow the intelligent vehicle to work as a
mobile service provider of sensing, data storage, computing, cloud, data
relaying, infotainment, and localization services. In this paper, we introduce
the concept of Vehicle as a Resource (VaaR) and shed light on the services a
vehicle can potentially provide on the road or parked. We anticipate that an
intelligent vehicle can be a significant service provider in a variety of
situations, including emergency scenarios.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2014 22:37:18 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Hamid",
"Sherin Abdel",
""
],
[
"Hassanein",
"Hossam S.",
""
],
[
"Takahara",
"Glen",
""
]
] |
new_dataset
| 0.999683 |
1403.1988
|
Konstantinos Georgiou
|
Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc
|
Excuse Me! or The Courteous Theatregoers' Problem
|
21 pages, 5 figures. An extended abstract of this paper appears in
the Proceedings of Seventh International Conference on Fun with Algorithms,
July 1--3, 2014, Lipari Island, Sicily, Italy, Springer LNCS
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Consider a theatre consisting of $m$ rows each containing $n$ seats.
Theatregoers enter the theatre along aisles and pick a row which they enter
along one of its two entrances so as to occupy a seat. Assume they select their
seats uniformly and independently at random among the empty ones. A row of
seats is narrow and an occupant who is already occupying a seat is blocking
passage to new incoming theatregoers. As a consequence, occupying a specific
seat depends on the courtesy of theatregoers and their willingness to get up so
as to create free space that will allow passage to others. Thus, courtesy
facilitates and may well increase the overall seat occupancy of the theatre. We
say a theatregoer is courteous if (s)he will get up to let others pass.
Otherwise, the theatregoer is selfish. A set of theatregoers is $p$-courteous
if each theatregoer in the set is courteous with probability $p$, randomly and
independently. It is assumed that the behaviour of a theatregoer does not
change during the occupancy of the row.
In this paper, we are interested in the following question: what is the
expected number of occupied seats as a function of the total number of seats in
a theatre, $n$, and the probability that a theatregoer is courteous, $p$? We
study and analyze interesting variants of this problem reflecting behaviour of
the theatregoers as entirely selfish, and $p$-courteous for a row of seats with
one or two entrances and as a consequence for a theatre with $m$ rows of seats
with multiple aisles. We also consider the case where seats in a row are chosen
according to the geometric distribution and the Zipf distibrution (as opposed
to the uniform distribution) and provide bounds on the occupancy of a row (and
thus the theatre) in each case.
|
[
{
"version": "v1",
"created": "Sat, 8 Mar 2014 17:23:59 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Georgiou",
"Konstantinos",
""
],
[
"Kranakis",
"Evangelos",
""
],
[
"Krizanc",
"Danny",
""
]
] |
new_dataset
| 0.988909 |
1403.2000
|
Simon Kramer
|
Simon Kramer
|
A Galois-Connection between Myers-Briggs' Type Indicators and Szondi's
Personality Profiles
| null | null | null | null |
cs.CE cs.CY
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We propose a computable Galois-connection between Myers-Briggs' Type
Indicators (MBTIs), the most widely-used personality measure for
non-psychiatric populations (based on C.G. Jung's personality types), and
Szondi's personality profiles (SPPs), a less well-known but, as we show, finer
personality measure for psychiatric as well as non-psychiatric populations
(conceived as a unification of the depth psychology of S. Freud, C.G. Jung, and
A. Adler). The practical significance of our result is that our
Galois-connection provides a pair of computable, interpreting translations
between the two personality spaces of MBTIs and SPPs: one concrete from
MBTI-space to SPP-space (because SPPs are finer) and one abstract from
SPP-space to MBTI-space (because MBTIs are coarser). Thus Myers-Briggs' and
Szondi's personality-test results are mutually interpretable and
inter-translatable, even automatically by computers.
|
[
{
"version": "v1",
"created": "Sat, 8 Mar 2014 19:25:36 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Kramer",
"Simon",
""
]
] |
new_dataset
| 0.950274 |
1403.2031
|
Asha V
|
V.Asha, N.U.Bhajantri, P.Nagabhushan
|
Texture Defect Detection in Gradient Space
|
4 pages, ICFoCS-2011
| null | null |
ICFoCS-2011
|
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a machine vision algorithm for automatically
detecting defects in patterned textures with the help of gradient space and its
energy. Experiments on real fabric images with defects show that the proposed
method can be used for automatic detection of fabric defects in textile
industries.
|
[
{
"version": "v1",
"created": "Sun, 9 Mar 2014 06:53:13 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Asha",
"V.",
""
],
[
"Bhajantri",
"N. U.",
""
],
[
"Nagabhushan",
"P.",
""
]
] |
new_dataset
| 0.99245 |
1403.2036
|
Mathew McLean
|
Mathew W. McLean
|
Straightforward Bibliography Management in R with the RefManageR Package
|
30 pages
| null | null | null |
cs.DL cs.MS stat.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work introduces the R package RefManageR, which provides tools for
importing and working with bibliographic references. It extends the bibentry
class in R in a number of useful ways, including providing R with previously
unavailable support for BibLaTeX. BibLaTeX provides a superset of the
functionality of BibTeX, including full Unicode support, no memory limitations,
additional fields and entry types, and more sophisticated sorting of
references. RefManageR provides functions for citing and generating a
bibliography with hyperlinks for documents prepared with RMarkdown or RHTML.
Existing .bib files can be read into R and converted from BibTeX to BibLaTeX
and vice versa. References can also be imported via queries to NCBI's Entrez,
Zotero libraries, Google Scholar, and CrossRef. Additionally, references can be
created by reading PDFs stored on the user's machine with the help of Poppler.
Entries stored in the reference manager can be easily searched by any field, by
date ranges, and by various formats for name lists (author by last names,
translator by full names, etc.). Entries can also be updated, combined, sorted,
printed in a number of styles, and exported.
|
[
{
"version": "v1",
"created": "Sun, 9 Mar 2014 08:09:02 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"McLean",
"Mathew W.",
""
]
] |
new_dataset
| 0.999204 |
1403.2042
|
Niharika Sachdeva
|
Niharika Sachdeva and Ponnurangam Kumaraguru
|
Online Social Media and Police in India: Behavior, Perceptions,
Challenges
| null | null | null | null |
cs.CY cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Police agencies across the globe are increasingly using Online Social Media
(OSM) to acquire intelligence and connect with citizens. Developed nations have
well thought of strategies to use OSM for policing. However, developing nations
like India are exploring and evolving OSM as a policing solution. India, in
recent years, experienced many events where rumors and fake content on OSM
instigated communal violence. In contrast to traditional media (e.g. television
and print media) used by Indian police departments, OSM offers velocity,
variety, veracity and large volume of information. These introduce new
challenges for police like platforms selection, secure usage strategy,
developing trust, handling offensive comments, and security / privacy
implication of information shared through OSM. Success of police initiatives on
OSM to maintain law and order depends both on their understanding of OSM and
citizen's acceptance / participation on these platforms.
This study provides multidimensional understanding of behavior, perceptions,
interactions, and expectation regarding policing through OSM. First, we
examined recent updates from four different police pages- Delhi, Bangalore,
Uttar Pradesh and Chennai to comprehend various dimensions of police
interaction with citizens on OSM. Second, we conducted 20 interviews with IPS
officers (Indian Police Service) and 17 interviews with citizens to understand
decision rationales and expectation gaps between two stakeholders (police and
citizens); this was followed up with 445 policemen surveys and 204 citizen
surveys. We also present differences between police expectations of Indian and
police departments in developed countries.
|
[
{
"version": "v1",
"created": "Sun, 9 Mar 2014 09:57:48 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Sachdeva",
"Niharika",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] |
new_dataset
| 0.998283 |
1403.2111
|
Tsung-Yi Chen
|
Tsung-Yi Chen, Kasra Vakilinia, Dariush Divsalar, Richard D. Wesel
|
Protograph-Based Raptor-Like LDPC Codes
|
12 pages, 9 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper proposes a class of rate-compatible LDPC codes, called
protograph-based Raptor-like (PBRL) codes. The construction is focused on
binary codes for BI-AWGN channels. As with the Raptor codes, additional parity
bits are produced by exclusive-OR operations on the precoded bits, providing
extensive rate compatibility. Unlike Raptor codes, the structure of each
additional parity bit in the protograph is explicitly designed through density
evolution. The construction method provides low iterative decoding thresholds
and the lifted codes result in excellent error rate performance for
long-blocklength PBRL codes. For short-blocklength PBRL codes the protograph
design and lifting must avoid undesired graphical structures such as trapping
sets and absorbing sets while also seeking to minimize the density evolution
threshold. Simulation results are shown in information block sizes of $k=192$,
$16368$ and $16384$. Comparing at the same information block size of $k=16368$
bits, the PBRL codes outperform the best known standardized code, the AR4JA
codes in the waterfall region. The PBRL codes also perform comparably to DVB-S2
codes even though the DVB-S2 codes use LDPC codes with longer blocklengths and
are concatenated with outer BCH codes.
|
[
{
"version": "v1",
"created": "Sun, 9 Mar 2014 22:41:52 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Chen",
"Tsung-Yi",
""
],
[
"Vakilinia",
"Kasra",
""
],
[
"Divsalar",
"Dariush",
""
],
[
"Wesel",
"Richard D.",
""
]
] |
new_dataset
| 0.995527 |
1403.2331
|
Guang Tan
|
Bo Xie, Guang Tan, Yunhuai Liu, Mingming Lu, Kongyang Chen, and Tian
He
|
LIPS: A Light Intensity Based Positioning System For Indoor Environments
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents LIPS, a Light Intensity based Positioning System for
indoor environments. The system uses off-the-shelf LED lamps as signal sources,
and uses light sensors as signal receivers. The design is inspired by the
observation that a light sensor has deterministic sensitivity to both distance
and incident angle of light signal, an under-utilized feature of photodiodes
now widely found on mobile devices. We develop a stable and accurate light
intensity model to capture the phenomenon, based on which a new positioning
principle, Multi-Face Light Positioning (MFLP), is established that uses three
collocated sensors to uniquely determine the receiver's position, assuming
merely a single source of light. We have implemented a prototype on both
dedicated embedded systems and smartphones. Experimental results show average
positioning accuracy within 0.4 meters across different environments, with high
stability against interferences from obstacles, ambient lights, temperature
variation, etc.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2014 07:55:41 GMT"
}
] | 2014-03-11T00:00:00 |
[
[
"Xie",
"Bo",
""
],
[
"Tan",
"Guang",
""
],
[
"Liu",
"Yunhuai",
""
],
[
"Lu",
"Mingming",
""
],
[
"Chen",
"Kongyang",
""
],
[
"He",
"Tian",
""
]
] |
new_dataset
| 0.999208 |
1309.1536
|
Weibing Deng
|
W.B. Deng, A.E. Allahverdyan, B. Li, Q.A. Wang
|
Rank-frequency relation for Chinese characters
|
To appear in European Physical Journal B (EPJ B), 2014 (22 pages, 7
figures)
|
Eur. Phys. J. B (2014) 87: 47
|
10.1140/epjb/e2014-40805-2
| null |
cs.CL physics.data-an
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that the Zipf's law for Chinese characters perfectly holds for
sufficiently short texts (few thousand different characters). The scenario of
its validity is similar to the Zipf's law for words in short English texts. For
long Chinese texts (or for mixtures of short Chinese texts), rank-frequency
relations for Chinese characters display a two-layer, hierarchic structure that
combines a Zipfian power-law regime for frequent characters (first layer) with
an exponential-like regime for less frequent characters (second layer). For
these two layers we provide different (though related) theoretical descriptions
that include the range of low-frequency characters (hapax legomena). The
comparative analysis of rank-frequency relations for Chinese characters versus
English words illustrates the extent to which the characters play for Chinese
writers the same role as the words for those writing within alphabetical
systems.
|
[
{
"version": "v1",
"created": "Fri, 6 Sep 2013 04:48:19 GMT"
},
{
"version": "v2",
"created": "Sun, 26 Jan 2014 15:47:54 GMT"
}
] | 2014-03-10T00:00:00 |
[
[
"Deng",
"W. B.",
""
],
[
"Allahverdyan",
"A. E.",
""
],
[
"Li",
"B.",
""
],
[
"Wang",
"Q. A.",
""
]
] |
new_dataset
| 0.99766 |
1402.4515
|
Trent Rogers
|
Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers, and Scott M.
Summers
|
The Power of Duples (in Self-Assembly): It's Not So Hip To Be Square
| null | null | null | null |
cs.ET cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we define the Dupled abstract Tile Assembly Model (DaTAM),
which is a slight extension to the abstract Tile Assembly Model (aTAM) that
allows for not only the standard square tiles, but also "duple" tiles which are
rectangles pre-formed by the joining of two square tiles. We show that the
addition of duples allows for powerful behaviors of self-assembling systems at
temperature 1, meaning systems which exclude the requirement of cooperative
binding by tiles (i.e., the requirement that a tile must be able to bind to at
least 2 tiles in an existing assembly if it is to attach). Cooperative binding
is conjectured to be required in the standard aTAM for Turing universal
computation and the efficient self-assembly of shapes, but we show that in the
DaTAM these behaviors can in fact be exhibited at temperature 1. We then show
that the DaTAM doesn't provide asymptotic improvements over the aTAM in its
ability to efficiently build thin rectangles. Finally, we present a series of
results which prove that the temperature-2 aTAM and temperature-1 DaTAM have
mutually exclusive powers. That is, each is able to self-assemble shapes that
the other can't, and each has systems which cannot be simulated by the other.
Beyond being of purely theoretical interest, these results have practical
motivation as duples have already proven to be useful in laboratory
implementations of DNA-based tiles.
|
[
{
"version": "v1",
"created": "Tue, 18 Feb 2014 22:23:27 GMT"
},
{
"version": "v2",
"created": "Fri, 7 Mar 2014 00:52:37 GMT"
}
] | 2014-03-10T00:00:00 |
[
[
"Hendricks",
"Jacob",
""
],
[
"Patitz",
"Matthew J.",
""
],
[
"Rogers",
"Trent A.",
""
],
[
"Summers",
"Scott M.",
""
]
] |
new_dataset
| 0.998503 |
1403.1628
|
Francisco Soulignac
|
Martiniano Egu\'ia and Francisco J. Soulignac
|
Disimplicial arcs, transitive vertices, and disimplicial eliminations
|
17 pags., 3 figs
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article we deal with the problems of finding the disimplicial arcs of
a digraph and recognizing some interesting graph classes defined by their
existence. A diclique of a digraph is a pair $V \to W$ of sets of vertices such
that $v \to w$ is an arc for every $v \in V$ and $w \in W$. An arc $v \to w$ is
disimplicial when $N^-(w) \to N^+(v)$ is a diclique. We show that the problem
of finding the disimplicial arcs is equivalent, in terms of time and space
complexity, to that of locating the transitive vertices. As a result, an
efficient algorithm to find the bisimplicial edges of bipartite graphs is
obtained. Then, we develop simple algorithms to build disimplicial elimination
schemes, which can be used to generate bisimplicial elimination schemes for
bipartite graphs. Finally, we study two classes related to perfect disimplicial
elimination digraphs, namely weakly diclique irreducible digraphs and diclique
irreducible digraphs. The former class is associated to finite posets, while
the latter corresponds to dedekind complete finite posets.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2014 00:59:55 GMT"
}
] | 2014-03-10T00:00:00 |
[
[
"Eguía",
"Martiniano",
""
],
[
"Soulignac",
"Francisco J.",
""
]
] |
new_dataset
| 0.976409 |
1403.1687
|
Laurent Sifre
|
Laurent SIfre and St\'ephane Mallat
|
Rigid-Motion Scattering for Texture Classification
|
19 pages, submitted to International Journal of Computer Vision
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A rigid-motion scattering computes adaptive invariants along translations and
rotations, with a deep convolutional network. Convolutions are calculated on
the rigid-motion group, with wavelets defined on the translation and rotation
variables. It preserves joint rotation and translation information, while
providing global invariants at any desired scale. Texture classification is
studied, through the characterization of stationary processes from a single
realization. State-of-the-art results are obtained on multiple texture data
bases, with important rotation and scaling variabilities.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2014 08:57:12 GMT"
}
] | 2014-03-10T00:00:00 |
[
[
"SIfre",
"Laurent",
""
],
[
"Mallat",
"Stéphane",
""
]
] |
new_dataset
| 0.972602 |
1403.1706
|
Johannes K\"oster
|
Johannes K\"oster, Sven Rahmann
|
Massively parallel read mapping on GPUs with PEANUT
| null | null | null | null |
cs.DS cs.DC q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present PEANUT (ParallEl AligNment UTility), a highly parallel GPU-based
read mapper with several distinguishing features, including a novel q-gram
index (called the q-group index) with small memory footprint built on-the-fly
over the reads and the possibility to output both the best hits or all hits of
a read. Designing the algorithm particularly for the GPU architecture, we were
able to reach maximum core occupancy for several key steps. Our benchmarks show
that PEANUT outperforms other state-of- the-art mappers in terms of speed and
sensitivity. The software is available at http://peanut.readthedocs.org.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2014 10:10:07 GMT"
}
] | 2014-03-10T00:00:00 |
[
[
"Köster",
"Johannes",
""
],
[
"Rahmann",
"Sven",
""
]
] |
new_dataset
| 0.968947 |
1403.1727
|
Yukihiro Kamada
|
Yukihiro Kamada and Kiyonori Miyasaki
|
On the Sequence of State Configurations in the Garden of Eden
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Autonomous threshold element circuit networks are used to investigate the
structure of neural networks. With these circuits, as the transition functions
are threshold functions, it is necessary to consider the existence of sequences
of state configurations that cannot be transitioned. In this study, we focus on
all logical functions of four or fewer variables, and we discuss the periodic
sequences and transient series that transition from all sequences of state
configurations. Furthermore, by using the sequences of state configurations in
the Garden of Eden, we show that it is easy to obtain functions that determine
the operation of circuit networks.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2014 11:49:23 GMT"
}
] | 2014-03-10T00:00:00 |
[
[
"Kamada",
"Yukihiro",
""
],
[
"Miyasaki",
"Kiyonori",
""
]
] |
new_dataset
| 0.999049 |
1403.1314
|
Roshan Ragel
|
R. G. Ragel, P. Herath and U. Senanayake
|
Authorship detection of SMS messages using unigrams
| null |
Industrial and Information Systems (ICIIS), 2013 8th IEEE
International Conference on, pp. 387-392 , 17-20 Dec. 2013
|
10.1109/ICIInfS.2013.6732015
| null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SMS messaging is a popular media of communication. Because of its popularity
and privacy, it could be used for many illegal purposes. Additionally, since
they are part of the day to day life, SMSes can be used as evidence for many
legal disputes. Since a cellular phone might be accessible to people close to
the owner, it is important to establish the fact that the sender of the message
is indeed the owner of the phone. For this purpose, the straight forward
solutions seem to be the use of popular stylometric methods. However, in
comparison with the data used for stylometry in the literature, SMSes have
unusual characteristics making it hard or impossible to apply these methods in
a conventional way. Our target is to come up with a method of authorship
detection of SMS messages that could still give a usable accuracy. We argue
that, considering the methods of author attribution, the best method that could
be applied to SMS messages is an n-gram method. To prove our point, we checked
two different methods of distribution comparison with varying number of
training and testing data. We specifically try to compare how well our
algorithms work under less amount of testing data and large number of candidate
authors (which we believe to be the real world scenario) against controlled
tests with less number of authors and selected SMSes with large number of
words. To counter the lack of information in an SMS message, we propose the
method of stacking together few SMSes.
|
[
{
"version": "v1",
"created": "Thu, 6 Mar 2014 01:33:55 GMT"
}
] | 2014-03-07T00:00:00 |
[
[
"Ragel",
"R. G.",
""
],
[
"Herath",
"P.",
""
],
[
"Senanayake",
"U.",
""
]
] |
new_dataset
| 0.98118 |
1403.1381
|
Daniel Zaragoza
|
Daniel Zaragoza
|
The TCP-modified Engset Model Revisited
|
arXiv admin note: substantial text overlap with arXiv:1401.8173
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We revisit the TCP-modified Engset model proposed by Heyman et al. in [1].
The model deals with the superposition of a limited number of TCP connections
alternating between file transmission and silence in a web-like fashion. We
consider homogeneous sources only. (a) We take into account the effects of slow
start and limited receiver window as well as small average file sizes. (b) We
propose an alternative way for calculating the average connection rate in the
superposition. (c) From the model we propose a way for calculating the queuing
behavior; i.e., the overflow probability. (d) From this last point, we propose
a new link buffer sizing rule. Comparison with extensive simulations shows that
the average rate and duration, as well as, link utilization are accurately
predicted for exponentially distributed file sizes. For longer tail
distributions, the model remains accurate provided the receiver window is
adjusted appropriately. The accuracy increases with increasing load. As
concerns the queuing behavior, the same observation applies. Finally, the
revisited model cannot be used to predict losses larger than about 1%. The
model overestimates loss rates above that threshold.
|
[
{
"version": "v1",
"created": "Thu, 6 Mar 2014 09:27:47 GMT"
}
] | 2014-03-07T00:00:00 |
[
[
"Zaragoza",
"Daniel",
""
]
] |
new_dataset
| 0.963854 |
1310.5037
|
Riccardo Dondi
|
Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni, Riccardo Dondi,
Yuri Pirola
|
Covering Pairs in Directed Acyclic Graphs
| null |
Proc. of Language and Automata Theory and Applications (LATA
2014), LNCS Vol. 8370, 2014, pp 126-137
|
10.1007/978-3-319-04921-2_10
| null |
cs.DS cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a
classical problem that provides a clear and simple mathematical formulation for
several applications in different areas and that has an efficient algorithmic
solution. In this paper, we study the computational complexity of two
constrained variants of Minimum Path Cover motivated by the recent introduction
of next-generation sequencing technologies in bioinformatics. The first problem
(MinPCRP), given a DAG and a set of pairs of vertices, asks for a minimum
cardinality set of paths "covering" all the vertices such that both vertices of
each pair belong to the same path. For this problem, we show that, while it is
NP-hard to compute if there exists a solution consisting of at most three
paths, it is possible to decide in polynomial time whether a solution
consisting of at most two paths exists. The second problem (MaxRPSP), given a
DAG and a set of pairs of vertices, asks for a path containing the maximum
number of the given pairs of vertices. We show its NP-hardness and also its
W[1]-hardness when parametrized by the number of covered pairs. On the positive
side, we give a fixed-parameter algorithm when the parameter is the maximum
overlapping degree, a natural parameter in the bioinformatics applications of
the problem.
|
[
{
"version": "v1",
"created": "Fri, 18 Oct 2013 14:33:06 GMT"
}
] | 2014-03-06T00:00:00 |
[
[
"Beerenwinkel",
"Niko",
""
],
[
"Beretta",
"Stefano",
""
],
[
"Bonizzoni",
"Paola",
""
],
[
"Dondi",
"Riccardo",
""
],
[
"Pirola",
"Yuri",
""
]
] |
new_dataset
| 0.998898 |
1403.1120
|
Carlos Luis Gonz\'alez-Valiente
|
C. L. Gonz\'alez-Valiente, Y. S\'anchez-Rodr\'iguez, Y.
Lezcano-P\'erez
|
Estudio exploratorio sobre las competencias informacionales de los
estudiantes de la Universidad de La Habana
|
http://www.redalyc.org/pdf/1814/181423798009.pdf
|
Ciencias de la Informaci\'on; 2012, 43 (2): 61-68
| null | null |
cs.CY
|
http://creativecommons.org/licenses/by/3.0/
|
The present article shows the results of a survey aimed at identifying the
informational abilities of Havana University students. Several methods such as
the survey, expert's interviews and content and document analysis are used. The
questionnaire has been structured base on three basic variables: information
search, information analysis and release and self evaluation elements. The
identification of these abilities was a key element for guiding libraries in
the development of actions focused on their communities.
|
[
{
"version": "v1",
"created": "Wed, 5 Mar 2014 13:34:55 GMT"
}
] | 2014-03-06T00:00:00 |
[
[
"González-Valiente",
"C. L.",
""
],
[
"Sánchez-Rodríguez",
"Y.",
""
],
[
"Lezcano-Pérez",
"Y.",
""
]
] |
new_dataset
| 0.985906 |
1403.1169
|
J. G. Wolff
|
J Gerard Wolff
|
A proof challenge: multiple alignment and information compression
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
These notes pose a "proof challenge": a proof, or disproof, of the
proposition that "For any given body of information, I, expressed as a
one-dimensional sequence of atomic symbols, a multiple alignment concept,
described in the document, provides a means of encoding all the redundancy that
may exist in I. Aspects of the challenge are described.
|
[
{
"version": "v1",
"created": "Tue, 4 Mar 2014 17:00:19 GMT"
}
] | 2014-03-06T00:00:00 |
[
[
"Wolff",
"J Gerard",
""
]
] |
new_dataset
| 0.973682 |
1403.1218
|
Heide Gluesing-Luerssen
|
Heide Gluesing-Luerssen and Katherine Morrison and Carolyn Troha
|
Cyclic Orbit Codes and Stabilizer Subfields
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cyclic orbit codes are constant dimension subspace codes that arise as the
orbit of a cyclic subgroup of the general linear group acting on subspaces in
the given ambient space. With the aid of the largest subfield over which the
given subspace is a vector space, the cardinality of the orbit code can be
determined, and estimates for its distance can be found. This subfield is
closely related to the stabilizer of the generating subspace. Finally, with a
linkage construction larger, and longer, constant dimension codes can be
derived from cyclic orbit codes without compromising the distance.
|
[
{
"version": "v1",
"created": "Wed, 5 Mar 2014 18:41:23 GMT"
}
] | 2014-03-06T00:00:00 |
[
[
"Gluesing-Luerssen",
"Heide",
""
],
[
"Morrison",
"Katherine",
""
],
[
"Troha",
"Carolyn",
""
]
] |
new_dataset
| 0.99961 |
1304.0357
|
Arkadiusz Stopczynski Mr.
|
Arkadiusz Stopczynski, Carsten Stahlhut, Jakob Eg Larsen, Michael Kai
Petersen, and Lars Kai Hansen
|
The Smartphone Brain Scanner: A Mobile Real-time Neuroimaging System
| null | null |
10.1371/journal.pone.0086733
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Combining low cost wireless EEG sensors with smartphones offers novel
opportunities for mobile brain imaging in an everyday context. We present a
framework for building multi-platform, portable EEG applications with real-time
3D source reconstruction. The system - Smartphone Brain Scanner - combines an
off-the-shelf neuroheadset or EEG cap with a smartphone or tablet, and as such
represents the first fully mobile system for real-time 3D EEG imaging. We
discuss the benefits and challenges of a fully portable system, including
technical limitations as well as real-time reconstruction of 3D images of brain
activity. We present examples of the brain activity captured in a simple
experiment involving imagined finger tapping, showing that the acquired signal
in a relevant brain region is similar to that obtained with standard EEG lab
equipment. Although the quality of the signal in a mobile solution using a
off-the-shelf consumer neuroheadset is lower compared to that obtained using
high density standard EEG equipment, we propose that mobile application
development may offset the disadvantages and provide completely new
opportunities for neuroimaging in natural settings.
|
[
{
"version": "v1",
"created": "Mon, 1 Apr 2013 13:51:52 GMT"
}
] | 2014-03-05T00:00:00 |
[
[
"Stopczynski",
"Arkadiusz",
""
],
[
"Stahlhut",
"Carsten",
""
],
[
"Larsen",
"Jakob Eg",
""
],
[
"Petersen",
"Michael Kai",
""
],
[
"Hansen",
"Lars Kai",
""
]
] |
new_dataset
| 0.996617 |
1310.0070
|
Nariman Farsad Mr.
|
Nariman Farsad and Weisi Guo and Andrew W. Eckford
|
Table-Top Molecular Communication: Text Messages Through Chemical
Signals
| null | null |
10.1371/journal.pone.0082935
| null |
cs.ET cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we describe the first modular, and programmable platform
capable of transmitting a text message using chemical signalling -- a method
also known as molecular communication. This form of communication is attractive
for applications where conventional wireless systems perform poorly, from
nanotechnology to urban health monitoring. Using examples, we demonstrate the
use of our platform as a testbed for molecular communication, and illustrate
the features of these communication systems using experiments. By providing a
simple and inexpensive means of performing experiments, our system fills an
important gap in the molecular communication literature, where much current
work is done in simulation with simplified system models. A key finding in this
paper is that these systems are often nonlinear in practice, whereas current
simulations and analysis often assume that the system is linear. However, as we
show in this work, despite the nonlinearity, reliable communication is still
possible. Furthermore, this work motivates future studies on more realistic
modelling, analysis, and design of theoretical models and algorithms for these
systems.
|
[
{
"version": "v1",
"created": "Mon, 30 Sep 2013 21:46:37 GMT"
}
] | 2014-03-05T00:00:00 |
[
[
"Farsad",
"Nariman",
""
],
[
"Guo",
"Weisi",
""
],
[
"Eckford",
"Andrew W.",
""
]
] |
new_dataset
| 0.998089 |
1402.7122
|
Anonymous Anonymous Mr.
|
Meghyn Bienvenu, Diego Calvanese, Magdalena Ortiz, Mantas Simkus
|
Nested Regular Path Queries in Description Logics
|
added Figure 1
| null | null | null |
cs.LO cs.AI cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Two-way regular path queries (2RPQs) have received increased attention
recently due to their ability to relate pairs of objects by flexibly navigating
graph-structured data. They are present in property paths in SPARQL 1.1, the
new standard RDF query language, and in the XML query language XPath. In line
with XPath, we consider the extension of 2RPQs with nesting, which allows one
to require that objects along a path satisfy complex conditions, in turn
expressed through (nested) 2RPQs. We study the computational complexity of
answering nested 2RPQs and conjunctions thereof (CN2RPQs) in the presence of
domain knowledge expressed in description logics (DLs). We establish tight
complexity bounds in data and combined complexity for a variety of DLs, ranging
from lightweight DLs (DL-Lite, EL) up to highly expressive ones. Interestingly,
we are able to show that adding nesting to (C)2RPQs does not affect worst-case
data complexity of query answering for any of the considered DLs. However, in
the case of lightweight DLs, adding nesting to 2RPQs leads to a surprising jump
in combined complexity, from P-complete to Exp-complete.
|
[
{
"version": "v1",
"created": "Fri, 28 Feb 2014 02:52:57 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Mar 2014 18:18:00 GMT"
}
] | 2014-03-05T00:00:00 |
[
[
"Bienvenu",
"Meghyn",
""
],
[
"Calvanese",
"Diego",
""
],
[
"Ortiz",
"Magdalena",
""
],
[
"Simkus",
"Mantas",
""
]
] |
new_dataset
| 0.958107 |
1403.0802
|
Jianting Zhang
|
Jianting Zhang Simin You
|
Large-Scale Geospatial Processing on Multi-Core and Many-Core
Processors: Evaluations on CPUs, GPUs and MICs
|
10 pages
| null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Geospatial Processing, such as queries based on point-to-polyline shortest
distance and point-in-polygon test, are fundamental to many scientific and
engineering applications, including post-processing large-scale environmental
and climate model outputs and analyzing traffic and travel patterns from
massive GPS collections in transportation engineering and urban studies.
Commodity parallel hardware, such as multi-core CPUs, many-core GPUs and Intel
MIC accelerators, provide enormous computing power which can potentially
achieve significant speedups on existing geospatial processing and open the
opportunities for new applications. However, the realizable potential for
geospatial processing on these new hardware devices is largely unknown due to
the complexity in porting serial algorithms to diverse parallel hardware
platforms. In this study, we aim at experimenting our data-parallel designs and
implementations of point-to-polyline shortest distance computation (P2P) and
point-in-polygon topological test (PIP) on different commodity hardware using
real large-scale geospatial data, comparing their performance and discussing
important factors that may significantly affect the performance. Our
experiments have shown that, while GPUs can be several times faster than
multi-core CPUs without utilizing the increasingly available SIMD computing
power on Vector Processing Units (VPUs) that come with multi-core CPUs and
MICs, multi-core CPUs and MICs can be several times faster than GPUs when VPUs
are utilized. By adopting a Domain Specific Language (DSL) approach to
exploiting the VPU computing power in geospatial processing, we are free from
programming SIMD intrinsic functions directly which makes the new approach more
effective, portable and scalable. Our designs, implementations and experiments
can serve as case studies for parallel geospatial computing on modern commodity
parallel hardware.
|
[
{
"version": "v1",
"created": "Tue, 4 Mar 2014 14:46:29 GMT"
}
] | 2014-03-05T00:00:00 |
[
[
"You",
"Jianting Zhang Simin",
""
]
] |
new_dataset
| 0.966625 |
1403.0804
|
Mehdi Samadieh
|
Mehdi Samadieh and Mohammad Gholamiy
|
Double Cylinder Cycle codes of Arbitrary Girth
|
e.g.: 10 pages, 5 figures
| null | null | null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A particular class of low-density parity-check codes referred to as
cylinder-type BC-LDPC codes is proposed by Gholami and Eesmaeili. In this paper
We represent a double cylinder-type parity-check matrix H by a graph called the
block-structure graph of H and denoted by BSG(H). Using the properties of
BSG(H) we propose some mother matrices with column-weight two such that the
rate of corresponding cycle codes are greater tan cycle codes constructed by
Gholami with same girth.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 11:57:56 GMT"
}
] | 2014-03-05T00:00:00 |
[
[
"Samadieh",
"Mehdi",
""
],
[
"Gholamiy",
"Mohammad",
""
]
] |
new_dataset
| 0.997773 |
1403.0930
|
Ahmed Alaa
|
Ahmed M. Alaa, Mahmoud H. Ismail, and Hazim Tawfik
|
Spectrum Sensing Via Reconfigurable Antennas: Fundamental Limits and
Potential Gains
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a novel paradigm for spectrum sensing in cognitive radio networks
that provides diversity and capacity benefits using a single antenna at the
Secondary User (SU) receiver. The proposed scheme is based on a reconfigurable
antenna: an antenna that is capable of altering its radiation characteristics
by changing its geometric configuration. Each configuration is designated as an
antenna mode or state and corresponds to a distinct channel realization. Based
on an abstract model for the reconfigurable antenna, we tackle two different
settings for the cognitive radio problem and present fundamental limits on the
achievable diversity and throughput gains. First, we explore the (to cooperate
or not to cooperate) tradeoff between the diversity and coding gains in
conventional cooperative and noncooperative spectrum sensing schemes, showing
that cooperation is not always beneficial. Based on this analysis, we propose
two sensing schemes based on reconfigurable antennas that we term as state
switching and state selection. It is shown that each of these schemes
outperform both cooperative and non-cooperative spectrum sensing under a global
energy constraint. Next, we study the (sensing-throughput) trade-off, and
demonstrate that using reconfigurable antennas, the optimal sensing time is
reduced allowing for a longer transmission time, and thus better throughput.
Moreover, state selection can be applied to boost the capacity of SU
transmission.
|
[
{
"version": "v1",
"created": "Tue, 4 Mar 2014 20:12:11 GMT"
}
] | 2014-03-05T00:00:00 |
[
[
"Alaa",
"Ahmed M.",
""
],
[
"Ismail",
"Mahmoud H.",
""
],
[
"Tawfik",
"Hazim",
""
]
] |
new_dataset
| 0.999664 |
1403.0052
|
Laurent Romary
|
Laurent Romary (IDSL, INRIA Saclay - Ile de France, CMB)
|
TBX goes TEI -- Implementing a TBX basic extension for the Text Encoding
Initiative guidelines
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an attempt to customise the TEI (Text Encoding
Initiative) guidelines in order to offer the possibility to incorporate TBX
(TermBase eXchange) based terminological entries within any kind of TEI
documents. After presenting the general historical, conceptual and technical
contexts, we describe the various design choices we had to take while creating
this customisation, which in turn have led to make various changes in the
actual TBX serialisation. Keeping in mind the objective to provide the TEI
guidelines with, again, an onomasiological model, we try to identify the best
comprise in maintaining both the isomorphism with the existing TBX Basic
standard and the characteristics of the TEI framework.
|
[
{
"version": "v1",
"created": "Sat, 1 Mar 2014 06:46:11 GMT"
}
] | 2014-03-04T00:00:00 |
[
[
"Romary",
"Laurent",
"",
"IDSL, INRIA Saclay - Ile de France, CMB"
]
] |
new_dataset
| 0.998459 |
1403.0062
|
Quentin Merigot
|
Pedro Machado Manh\~aes De Castro (CIn), Quentin M\'erigot (LJK),
Boris Thibert (LJK)
|
Intersection of paraboloids and application to Minkowski-type problems
| null | null | null | null |
cs.CG math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, we study the intersection (or union) of the convex hull of N
confocal paraboloids (or ellipsoids) of revolution. This study is motivated by
a Minkowski-type problem arising in geometric optics. We show that in each of
the four cases, the combinatorics is given by the intersection of a power
diagram with the unit sphere. We prove the complexity is O(N) for the
intersection of paraboloids and Omega(N^2) for the intersection and the union
of ellipsoids. We provide an algorithm to compute these intersections using the
exact geometric computation paradigm. This algorithm is optimal in the case of
the intersection of ellipsoids and is used to solve numerically the far-field
reflector problem.
|
[
{
"version": "v1",
"created": "Sat, 1 Mar 2014 07:59:19 GMT"
}
] | 2014-03-04T00:00:00 |
[
[
"De Castro",
"Pedro Machado Manhães",
"",
"CIn"
],
[
"Mérigot",
"Quentin",
"",
"LJK"
],
[
"Thibert",
"Boris",
"",
"LJK"
]
] |
new_dataset
| 0.996306 |
1403.0335
|
Sanjaya Kumar Panda
|
Sanjaya Kumar Panda, Debasis Dash, Jitendra Kumar Rout
|
A Group based Time Quantum Round Robin Algorithm using Min-Max Spread
Measure
|
7 pages, 16 figures
|
International Journal of Computer Applications 2013
|
10.5120/10667-5445
|
pxc3885445
|
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Round Robin (RR) Scheduling is the basis of time sharing environment. It is
the combination of First Come First Served (FCFS) scheduling algorithm and
preemption among processes. It is basically used in a time sharing operating
system. It switches from one process to another process in a time interval. The
time interval or Time Quantum (TQ) is fixed for all available processes. So,
the larger process suffers from Context Switches (CS). To increase efficiency,
we have to select different TQ for processes. The main objective of RR is to
reduce the CS, maximize the utilization of CPU and minimize the turn around and
the waiting time. In this paper, we have considered different TQ for a group of
processes. It reduces CS as well as enhancing the performance of RR algorithm.
TQ can be calculated using min-max dispersion measure. Our experimental
analysis shows that Group Based Time Quantum (GBTQ) RR algorithm performs
better than existing RR algorithm with respect to Average Turn Around Time
(ATAT), Average Waiting Time (AWT) and CS.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2014 08:27:29 GMT"
}
] | 2014-03-04T00:00:00 |
[
[
"Panda",
"Sanjaya Kumar",
""
],
[
"Dash",
"Debasis",
""
],
[
"Rout",
"Jitendra Kumar",
""
]
] |
new_dataset
| 0.995103 |
1403.0338
|
Sanjaya Kumar Panda
|
Jitendra Kumar Rout, Sourav Kumar Bhoi, Sanjaya Kumar Panda
|
SFTP : A Secure and Fault-Tolerant Paradigm against Blackhole Attack in
MANET
|
6 pages, 9 figures
|
International Journal of Computer Applications 2013
|
10.5120/10623-5343
|
pxc3885343
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Security issues in MANET are a challenging task nowadays. MANETs are
vulnerable to passive attacks and active attacks because of a limited number of
resources and lack of centralized authority. Blackhole attack is an attack in
network layer which degrade the network performance by dropping the packets. In
this paper, we have proposed a Secure Fault-Tolerant Paradigm (SFTP) which
checks the Blackhole attack in the network. The three phases used in SFTP
algorithm are designing of coverage area to find the area of coverage, Network
Connection algorithm to design a fault-tolerant model and Route Discovery
algorithm to discover the route and data delivery from source to destination.
SFTP gives better network performance by making the network fault free.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2014 08:36:22 GMT"
}
] | 2014-03-04T00:00:00 |
[
[
"Rout",
"Jitendra Kumar",
""
],
[
"Bhoi",
"Sourav Kumar",
""
],
[
"Panda",
"Sanjaya Kumar",
""
]
] |
new_dataset
| 0.999522 |
1403.0531
|
Josiah Zayner Ph.D.
|
Josiah P. Zayner
|
We Tweet Like We Talk and Other Interesting Observations: An Analysis of
English Communication Modalities
|
9 pages, 8 figures, 7 tables
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modalities of communication for human beings are gradually increasing in
number with the advent of new forms of technology. Many human beings can
readily transition between these different forms of communication with little
or no effort, which brings about the question: How similar are these different
communication modalities? To understand technology$\text{'}$s influence on
English communication, four different corpora were analyzed and compared:
Writing from Books using the 1-grams database from the Google Books project,
Twitter, IRC Chat, and transcribed Talking. Multi-word confusion matrices
revealed that Talking has the most similarity when compared to the other modes
of communication, while 1-grams were the least similar form of communication
analyzed. Based on the analysis of word usage, word usage frequency
distributions, and word class usage, among other things, Talking is also the
most similar to Twitter and IRC Chat. This suggests that communicating using
Twitter and IRC Chat evolved from Talking rather than Writing. When we
communicate online, even though we are writing, we do not Tweet or Chat how we
write books; we Tweet and Chat how we Speak. Nonfiction and Fiction writing
were clearly differentiable from our analysis with Twitter and Chat being much
more similar to Fiction than Nonfiction writing. These hypotheses were then
tested using author and journalists Cory Doctorow. Mr. Doctorow$\text{'}$s
Writing, Twitter usage, and Talking were all found to have very similar
vocabulary usage patterns as the amalgamized populations, as long as the
writing was Fiction. However, Mr. Doctorow$\text{'}$s Nonfiction writing is
different from 1-grams and other collected Nonfiction writings. This data could
perhaps be used to create more entertaining works of Nonfiction.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2014 19:27:23 GMT"
}
] | 2014-03-04T00:00:00 |
[
[
"Zayner",
"Josiah P.",
""
]
] |
new_dataset
| 0.997781 |
1309.5671
|
Nicolas Schiper
|
Robbert Van Renesse, Nicolas Schiper, and Fred B. Schneider
|
Vive la Diff\'erence: Paxos vs. Viewstamped Replication vs. Zab
|
16 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Paxos, Viewstamped Replication, and Zab are replication protocols that ensure
high-availability in asynchronous environments with crash failures. Various
claims have been made about similarities and differences between these
protocols. But how does one determine whether two protocols are the same, and
if not, how significant the differences are?
We propose to address these questions using refinement mappings, where
protocols are expressed as succinct specifications that are progressively
refined to executable implementations. Doing so enables a principled
understanding of the correctness of the different design decisions that went
into implementing the various protocols. Additionally, it allowed us to
identify key differences that have a significant impact on performance.
|
[
{
"version": "v1",
"created": "Mon, 23 Sep 2013 00:31:36 GMT"
},
{
"version": "v2",
"created": "Mon, 30 Sep 2013 20:08:06 GMT"
},
{
"version": "v3",
"created": "Thu, 27 Feb 2014 23:40:26 GMT"
}
] | 2014-03-03T00:00:00 |
[
[
"Van Renesse",
"Robbert",
""
],
[
"Schiper",
"Nicolas",
""
],
[
"Schneider",
"Fred B.",
""
]
] |
new_dataset
| 0.998554 |
1311.0680
|
Bartosz Hawelka
|
Bartosz Hawelka, Izabela Sitko, Euro Beinat, Stanislav Sobolevsky,
Pavlos Kazakopoulos and Carlo Ratti
|
Geo-located Twitter as the proxy for global mobility patterns
|
17 pages, 13 figures
| null |
10.1080/15230406.2014.890072
| null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the advent of a pervasive presence of location sharing services
researchers gained an unprecedented access to the direct records of human
activity in space and time. This paper analyses geo-located Twitter messages in
order to uncover global patterns of human mobility. Based on a dataset of
almost a billion tweets recorded in 2012 we estimate volumes of international
travelers in respect to their country of residence. We examine mobility
profiles of different nations looking at the characteristics such as mobility
rate, radius of gyration, diversity of destinations and a balance of the
inflows and outflows. The temporal patterns disclose the universal seasons of
increased international mobility and the peculiar national nature of overseen
travels. Our analysis of the community structure of the Twitter mobility
network, obtained with the iterative network partitioning, reveals spatially
cohesive regions that follow the regional division of the world. Finally, we
validate our result with the global tourism statistics and mobility models
provided by other authors, and argue that Twitter is a viable source to
understand and quantify global mobility patterns.
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2013 12:46:08 GMT"
},
{
"version": "v2",
"created": "Sat, 28 Dec 2013 13:40:30 GMT"
}
] | 2014-03-03T00:00:00 |
[
[
"Hawelka",
"Bartosz",
""
],
[
"Sitko",
"Izabela",
""
],
[
"Beinat",
"Euro",
""
],
[
"Sobolevsky",
"Stanislav",
""
],
[
"Kazakopoulos",
"Pavlos",
""
],
[
"Ratti",
"Carlo",
""
]
] |
new_dataset
| 0.995114 |
1402.7035
|
Patrick Butler
|
Naren Ramakrishnan, Patrick Butler, Sathappan Muthiah, Nathan Self,
Rupinder Khandpur, Parang Saraf, Wei Wang, Jose Cadena, Anil Vullikanti,
Gizem Korkmaz, Chris Kuhlman, Achla Marathe, Liang Zhao, Ting Hua, Feng Chen,
Chang-Tien Lu, Bert Huang, Aravind Srinivasan, Khoa Trinh, Lise Getoor,
Graham Katz, Andy Doyle, Chris Ackermann, Ilya Zavorin, Jim Ford, Kristen
Summers, Youssef Fayed, Jaime Arredondo, Dipak Gupta, David Mares
|
'Beating the news' with EMBERS: Forecasting Civil Unrest using Open
Source Indicators
| null | null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe the design, implementation, and evaluation of EMBERS, an
automated, 24x7 continuous system for forecasting civil unrest across 10
countries of Latin America using open source indicators such as tweets, news
sources, blogs, economic indicators, and other data sources. Unlike
retrospective studies, EMBERS has been making forecasts into the future since
Nov 2012 which have been (and continue to be) evaluated by an independent T&E
team (MITRE). Of note, EMBERS has successfully forecast the uptick and downtick
of incidents during the June 2013 protests in Brazil. We outline the system
architecture of EMBERS, individual models that leverage specific data sources,
and a fusion and suppression engine that supports trading off specific
evaluation criteria. EMBERS also provides an audit trail interface that enables
the investigation of why specific predictions were made along with the data
utilized for forecasting. Through numerous evaluations, we demonstrate the
superiority of EMBERS over baserate methods and its capability to forecast
significant societal happenings.
|
[
{
"version": "v1",
"created": "Thu, 27 Feb 2014 19:40:02 GMT"
},
{
"version": "v2",
"created": "Fri, 28 Feb 2014 02:25:57 GMT"
}
] | 2014-03-03T00:00:00 |
[
[
"Ramakrishnan",
"Naren",
""
],
[
"Butler",
"Patrick",
""
],
[
"Muthiah",
"Sathappan",
""
],
[
"Self",
"Nathan",
""
],
[
"Khandpur",
"Rupinder",
""
],
[
"Saraf",
"Parang",
""
],
[
"Wang",
"Wei",
""
],
[
"Cadena",
"Jose",
""
],
[
"Vullikanti",
"Anil",
""
],
[
"Korkmaz",
"Gizem",
""
],
[
"Kuhlman",
"Chris",
""
],
[
"Marathe",
"Achla",
""
],
[
"Zhao",
"Liang",
""
],
[
"Hua",
"Ting",
""
],
[
"Chen",
"Feng",
""
],
[
"Lu",
"Chang-Tien",
""
],
[
"Huang",
"Bert",
""
],
[
"Srinivasan",
"Aravind",
""
],
[
"Trinh",
"Khoa",
""
],
[
"Getoor",
"Lise",
""
],
[
"Katz",
"Graham",
""
],
[
"Doyle",
"Andy",
""
],
[
"Ackermann",
"Chris",
""
],
[
"Zavorin",
"Ilya",
""
],
[
"Ford",
"Jim",
""
],
[
"Summers",
"Kristen",
""
],
[
"Fayed",
"Youssef",
""
],
[
"Arredondo",
"Jaime",
""
],
[
"Gupta",
"Dipak",
""
],
[
"Mares",
"David",
""
]
] |
new_dataset
| 0.992709 |
1402.7224
|
Nela Lekic
|
Alexander Grigoriev, Steven Kelk, Nela Lekic
|
On low treewidth graphs and supertrees
| null | null | null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compatibility of unrooted phylogenetic trees is a well studied problem in
phylogenetics. It asks to determine whether for a set of k input trees there
exists a larger tree (called a supertree) that contains the topologies of all k
input trees. When any such supertree exists we call the instance compatible and
otherwise incompatible. It is known that the problem is NP-hard and FPT,
although a constructive FPT algorithm is not known. It has been shown that
whenever the treewidth of an auxiliary structure known as the display graph is
strictly larger than the number of input trees, the instance is incompatible.
Here we show that whenever the treewidth of the display graph is at most 2, the
instance is compatible. Furthermore, we give a polynomial-time algorithm to
construct a supertree in this case. Finally, we demonstrate both compatible and
incompatible instances that have display graphs with treewidth 3, highlighting
that the treewidth of the display graph is (on its own) not sufficient to
determine compatibility.
|
[
{
"version": "v1",
"created": "Fri, 28 Feb 2014 12:37:40 GMT"
}
] | 2014-03-03T00:00:00 |
[
[
"Grigoriev",
"Alexander",
""
],
[
"Kelk",
"Steven",
""
],
[
"Lekic",
"Nela",
""
]
] |
new_dataset
| 0.999457 |
1402.7228
|
Henning Hasemann
|
Henning Hasemann, Alexander Kr\"oller, Max Pagel
|
The Wiselib TupleStore: A Modular RDF Database for the Internet of
Things
| null | null | null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Internet of Things movement provides self-configuring and universally
interoperable devices. While such devices are often built with a specific
application in mind, they often turn out to be useful in other contexts as
well. We claim that by describing the devices' knowledge in a universal way,
IoT devices can become first-class citizens in the Internet. They can then
exchange data between heterogeneous hardware, different applications and large
data sources on the Web. Our key idea --- in contrast to most existing
approaches --- is to not restrict the domain of knowledge that can be expressed
on the device in any way and, at the same time, allow this knowledge to be
machine-understandable and linkable across different locations.
We propose an architecture that allows to connect embedded devices to the
Semantic Web by expressing their knowledge in the Resource Description
Framework (RDF). We present the Wiselib TupleStore, a modular embedded database
tailored specifically for the storage of RDF. The Wiselib TupleStore is
portable to many platforms including Contiki and TinyOS and allows a variety of
trade-offs, making it able to scale to a large variety of hardware scenarios.
We discuss the applicability of RDF to heterogeneous resource-constrained
devices and compare our system to the existing embedded tuple stores Antelope
and TeenyLIME.
|
[
{
"version": "v1",
"created": "Fri, 28 Feb 2014 12:52:47 GMT"
}
] | 2014-03-03T00:00:00 |
[
[
"Hasemann",
"Henning",
""
],
[
"Kröller",
"Alexander",
""
],
[
"Pagel",
"Max",
""
]
] |
new_dataset
| 0.977602 |
1303.7127
|
Alexios Balatsoukas-Stimming
|
A. Balatsoukas-Stimming, A. J. Raymond, W. J. Gross, and A. Burg
|
Hardware Architecture for List SC Decoding of Polar Codes
| null | null | null | null |
cs.IT cs.AR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a hardware architecture and algorithmic improvements for list SC
decoding of polar codes. More specifically, we show how to completely avoid
copying of the likelihoods, which is algorithmically the most cumbersome part
of list SC decoding. The hardware architecture was synthesized for a
blocklength of N = 1024 bits and list sizes L = 2, 4 using a UMC 90nm VLSI
technology. The resulting decoder can achieve a coded throughput of 181 Mbps at
a frequency of 459 MHz.
|
[
{
"version": "v1",
"created": "Thu, 28 Mar 2013 14:04:54 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Jun 2013 14:51:17 GMT"
},
{
"version": "v3",
"created": "Thu, 27 Feb 2014 15:53:10 GMT"
}
] | 2014-02-28T00:00:00 |
[
[
"Balatsoukas-Stimming",
"A.",
""
],
[
"Raymond",
"A. J.",
""
],
[
"Gross",
"W. J.",
""
],
[
"Burg",
"A.",
""
]
] |
new_dataset
| 0.98992 |
1312.3245
|
Hien Thi Thu Truong
|
Hien Thi Thu Truong, Eemil Lagerspetz, Petteri Nurmi, Adam J. Oliner,
Sasu Tarkoma, N. Asokan, Sourav Bhattacharya
|
The Company You Keep: Mobile Malware Infection Rates and Inexpensive
Risk Indicators
| null | null |
10.1145/2566486.2568046
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
There is little information from independent sources in the public domain
about mobile malware infection rates. The only previous independent estimate
(0.0009%) [12], was based on indirect measurements obtained from domain name
resolution traces. In this paper, we present the first independent study of
malware infection rates and associated risk factors using data collected
directly from over 55,000 Android devices. We find that the malware infection
rates in Android devices estimated using two malware datasets (0.28% and
0.26%), though small, are significantly higher than the previous independent
estimate. Using our datasets, we investigate how indicators extracted
inexpensively from the devices correlate with malware infection. Based on the
hypothesis that some application stores have a greater density of malicious
applications and that advertising within applications and cross-promotional
deals may act as infection vectors, we investigate whether the set of
applications used on a device can serve as an indicator for infection of that
device. Our analysis indicates that this alone is not an accurate indicator for
pinpointing infection. However, it is a very inexpensive but surprisingly
useful way for significantly narrowing down the pool of devices on which
expensive monitoring and analysis mechanisms must be deployed. Using our two
malware datasets we show that this indicator performs 4.8 and 4.6 times
(respectively) better at identifying infected devices than the baseline of
random checks. Such indicators can be used, for example, in the search for new
or previously undetected malware. It is therefore a technique that can
complement standard malware scanning by anti-malware tools. Our analysis also
demonstrates a marginally significant difference in battery use between
infected and clean devices.
|
[
{
"version": "v1",
"created": "Wed, 11 Dec 2013 17:06:16 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Feb 2014 16:58:12 GMT"
}
] | 2014-02-28T00:00:00 |
[
[
"Truong",
"Hien Thi Thu",
""
],
[
"Lagerspetz",
"Eemil",
""
],
[
"Nurmi",
"Petteri",
""
],
[
"Oliner",
"Adam J.",
""
],
[
"Tarkoma",
"Sasu",
""
],
[
"Asokan",
"N.",
""
],
[
"Bhattacharya",
"Sourav",
""
]
] |
new_dataset
| 0.993168 |
1402.6783
|
EPTCS
|
Yu-Fang Chen (Academia Sinica, Taiwan), Bow-Yaw Wang (Academia Sinica,
Taiwan), Di-De Yen (Academia Sinica, Taiwan)
|
A Finite Exact Representation of Register Automata Configurations
|
In Proceedings INFINITY 2013, arXiv:1402.6610
|
EPTCS 140, 2014, pp. 16-34
|
10.4204/EPTCS.140.2
| null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A register automaton is a finite automaton with finitely many registers
ranging from an infinite alphabet. Since the valuations of registers are
infinite, there are infinitely many configurations. We describe a technique to
classify infinite register automata configurations into finitely many exact
representative configurations. Using the finitary representation, we give an
algorithm solving the reachability problem for register automata. We moreover
define a computation tree logic for register automata and solve its model
checking problem.
|
[
{
"version": "v1",
"created": "Thu, 27 Feb 2014 03:44:51 GMT"
}
] | 2014-02-28T00:00:00 |
[
[
"Chen",
"Yu-Fang",
"",
"Academia Sinica, Taiwan"
],
[
"Wang",
"Bow-Yaw",
"",
"Academia Sinica,\n Taiwan"
],
[
"Yen",
"Di-De",
"",
"Academia Sinica, Taiwan"
]
] |
new_dataset
| 0.967248 |
1402.6888
|
Adam Erskine
|
Adam Erskine, J Michael Herrmann
|
CriPS: Critical Dynamics in Particle Swarm Optimization
| null | null | null | null |
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Particle Swarm Optimisation (PSO) makes use of a dynamical system for solving
a search task. Instead of adding search biases in order to improve performance
in certain problems, we aim to remove algorithm-induced scales by controlling
the swarm with a mechanism that is scale-free except possibly for a suppression
of scales beyond the system size. In this way a very promising performance is
achieved due to the balance of large-scale exploration and local search. The
resulting algorithm shows evidence for self-organised criticality, brought
about via the intrinsic dynamics of the swarm as it interacts with the
objective function, rather than being explicitly specified. The Critical
Particle Swarm (CriPS) can be easily combined with many existing extensions
such as chaotic exploration, additional force terms or non-trivial topologies.
|
[
{
"version": "v1",
"created": "Thu, 27 Feb 2014 12:35:27 GMT"
}
] | 2014-02-28T00:00:00 |
[
[
"Erskine",
"Adam",
""
],
[
"Herrmann",
"J Michael",
""
]
] |
new_dataset
| 0.96505 |
1402.6942
|
Jakub Nalepa
|
Jakub Nalepa and Zbigniew J. Czech
|
A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with
Time Windows
|
15 pages
|
Studia Informatica 33 (1), pp 91-106 (2012)
| null | null |
cs.DC cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a parallel memetic algorithm for solving the vehicle
routing problem with time windows (VRPTW). The VRPTW is a well-known NP-hard
discrete optimization problem with two objectives. The main objective is to
minimize the number of vehicles serving customers scattered on the map, and the
second one is to minimize the total distance traveled by the vehicles. Here,
the fleet size is minimized in the first phase of the proposed method using the
parallel heuristic algorithm (PHA), and the traveled distance is minimized in
the second phase by the parallel memetic algorithm (PMA). In both parallel
algorithms, the parallel components co-operate periodically in order to
exchange the best solutions found so far. An extensive experimental study
performed on the Gehring and Homberger's benchmark proves the high convergence
capabilities and robustness of both PHA and PMA. Also, we present the speedup
analysis of the PMA.
|
[
{
"version": "v1",
"created": "Thu, 27 Feb 2014 15:41:05 GMT"
}
] | 2014-02-28T00:00:00 |
[
[
"Nalepa",
"Jakub",
""
],
[
"Czech",
"Zbigniew J.",
""
]
] |
new_dataset
| 0.997708 |
1402.6973
|
Michael Markovitch
|
Michael Markovitch, Gabriel Scalosub
|
Bounded Delay Scheduling with Packet Dependencies
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A common situation occurring when dealing with multimedia traffic is having
large data frames fragmented into smaller IP packets, and having these packets
sent independently through the network. For real-time multimedia traffic,
dropping even few packets of a frame may render the entire frame useless. Such
traffic is usually modeled as having {\em inter-packet dependencies}. We study
the problem of scheduling traffic with such dependencies, where each packet has
a deadline by which it should arrive at its destination. Such deadlines are
common for real-time multimedia applications, and are derived from stringent
delay constraints posed by the application. The figure of merit in such
environments is maximizing the system's {\em goodput}, namely, the number of
frames successfully delivered.
We study online algorithms for the problem of maximizing goodput of
delay-bounded traffic with inter-packet dependencies, and use competitive
analysis to evaluate their performance. We present competitive algorithms for
the problem, as well as matching lower bounds that are tight up to a constant
factor. We further present the results of a simulation study which further
validates our algorithmic approach and shows that insights arising from our
analysis are indeed manifested in practice.
|
[
{
"version": "v1",
"created": "Thu, 27 Feb 2014 17:02:30 GMT"
}
] | 2014-02-28T00:00:00 |
[
[
"Markovitch",
"Michael",
""
],
[
"Scalosub",
"Gabriel",
""
]
] |
new_dataset
| 0.998918 |
1402.7019
|
Ossi Kaltiokallio J.
|
Ossi Kaltiokallio, H\"useyin Yi\u{g}itler, and Riku J\"antti
|
A Three-State Received Signal Strength Model for Device-free
Localization
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The indoor radio propagation channel is typically modeled as a two-state
time-variant process where one of the states represents the channel when the
environment is static, whereas the other state characterizes the medium when it
is altered by people. In this paper, the aforementioned process is augmented
with an additional state. It is shown that the changes in received signal
strength are dictated by: i) electronic noise, when a person is not present in
the monitored area; ii) reflection, when a person is moving in the close
vicinity of the line-of-sight; iii) shadowing, when a person is obstructing the
line-of-sight component of the transmitter-receiver pair. Statistical and
spatial models for the three states are derived and the models are empirically
validated. Based on the models, a simplistic device-free localization
application is designed which aims to: first, estimate the temporal state of
the channel using a hidden Markov model; second, track a person using a
particle filter. The results suggest that the tracking accuracy is enhanced by
at least 65% while the link's sensitivity region is increased by 100% or more
with respect to empirical models presented in earlier works.
|
[
{
"version": "v1",
"created": "Mon, 24 Feb 2014 18:31:56 GMT"
}
] | 2014-02-28T00:00:00 |
[
[
"Kaltiokallio",
"Ossi",
""
],
[
"Yiğitler",
"Hüseyin",
""
],
[
"Jäntti",
"Riku",
""
]
] |
new_dataset
| 0.997475 |
1306.6584
|
Alberto Mart\'in-Mart\'in
|
Daniel Torres-Salinas, Alberto Mart\'in-Mart\'in, Enrique
Fuente-Guti\'errez
|
An introduction to the coverage of the Data Citation Index
(Thomson-Reuters): disciplines, document types and repositories
| null |
Rev. Esp. Doc. Cient., 37(1), enero-marzo 2014, e036. ISSN-L:
0210-0614
|
10.3989/redc.2014.1.1114
| null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the past years, the movement of data sharing has been enjoying great
popularity. Within this context, Thomson Reuters launched at the end of 2012 a
new product inside the Web of Knowledge family: the Data Citation Index. The
aim of this tool is to enable discovery and access, from a single place, to
data from a variety of data repositories from different subject areas and from
around the world. In this short note we present some preliminary results from
the analysis of the Data Citation Index. Specifically, we address the following
issues: discipline coverage, data types present in the database, and
repositories that were included at the time of the study
|
[
{
"version": "v1",
"created": "Thu, 27 Jun 2013 17:43:33 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Feb 2014 19:51:38 GMT"
}
] | 2014-02-27T00:00:00 |
[
[
"Torres-Salinas",
"Daniel",
""
],
[
"Martín-Martín",
"Alberto",
""
],
[
"Fuente-Gutiérrez",
"Enrique",
""
]
] |
new_dataset
| 0.9916 |
1107.1630
|
Anke van Zuylen
|
Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen
|
On the Integrality Gap of the Subtour LP for the 1,2-TSP
|
Changes wrt previous version: upper bound on integrality gap improved
to 5/4 (using the same techniques as in the previous version)
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the integrality gap of the subtour LP relaxation for
the traveling salesman problem in the special case when all edge costs are
either 1 or 2. For the general case of symmetric costs that obey triangle
inequality, a famous conjecture is that the integrality gap is 4/3. Little
progress towards resolving this conjecture has been made in thirty years. We
conjecture that when all edge costs $c_{ij}\in \{1,2\}$, the integrality gap is
$10/9$. We show that this conjecture is true when the optimal subtour LP
solution has a certain structure. Under a weaker assumption, which is an analog
of a recent conjecture by Schalekamp, Williamson and van Zuylen, we show that
the integrality gap is at most $7/6$. When we do not make any assumptions on
the structure of the optimal subtour LP solution, we can show that integrality
gap is at most $5/4$; this is the first bound on the integrality gap of the
subtour LP strictly less than $4/3$ known for an interesting special case of
the TSP. We show computationally that the integrality gap is at most $10/9$ for
all instances with at most 12 cities.
|
[
{
"version": "v1",
"created": "Fri, 8 Jul 2011 13:39:09 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Apr 2012 14:13:11 GMT"
},
{
"version": "v3",
"created": "Tue, 25 Feb 2014 03:48:15 GMT"
}
] | 2014-02-26T00:00:00 |
[
[
"Qian",
"Jiawei",
""
],
[
"Schalekamp",
"Frans",
""
],
[
"Williamson",
"David P.",
""
],
[
"van Zuylen",
"Anke",
""
]
] |
new_dataset
| 0.961046 |
1402.6013
|
Joaquin Vanschoren
|
Joaquin Vanschoren and Mikio L. Braun and Cheng Soon Ong
|
Open science in machine learning
| null | null | null | null |
cs.LG cs.DL
|
http://creativecommons.org/licenses/by/3.0/
|
We present OpenML and mldata, open science platforms that provides easy
access to machine learning data, software and results to encourage further
study and application. They go beyond the more traditional repositories for
data sets and software packages in that they allow researchers to also easily
share the results they obtained in experiments and to compare their solutions
with those of others.
|
[
{
"version": "v1",
"created": "Mon, 24 Feb 2014 23:12:42 GMT"
}
] | 2014-02-26T00:00:00 |
[
[
"Vanschoren",
"Joaquin",
""
],
[
"Braun",
"Mikio L.",
""
],
[
"Ong",
"Cheng Soon",
""
]
] |
new_dataset
| 0.983635 |
1402.6050
|
Saurabh Ariyan
|
Saurabh Kumar Ariyan, Eshant Bagela, Akanksha Priyadarshin
|
Abiot: A Low cost agile sonic pest control tricopter
|
4 pages; workshop paper
| null | null | null |
cs.RO
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper we introduce the concept of an agile electronic pest control
intelligent device for commercial usage and we have evaluated its performance
in comparison with other existing similar technologies. The frequency and
intensities are changed with respect to the target pest however human behavior
has been found to be inert with their exposure. The unit has been tested in lab
conditions as well as field testing done have given encouraging results. The
device can be a standalone unit and hence work for small scale viz. kitchen
garden on the other hand multiple devices acting in coordination with each
other give the desired output on a larger scale.
|
[
{
"version": "v1",
"created": "Tue, 25 Feb 2014 04:27:53 GMT"
}
] | 2014-02-26T00:00:00 |
[
[
"Ariyan",
"Saurabh Kumar",
""
],
[
"Bagela",
"Eshant",
""
],
[
"Priyadarshin",
"Akanksha",
""
]
] |
new_dataset
| 0.999093 |
1402.6282
|
Ayad Ghany Ismaeel
|
Ayad Ghany Ismaeel, Nur Gaylan Hamead
|
Mobile GIS and Open Source Platform Based on Android: Technology for
System Pregnant Women
|
8 pages, 16 figures, 1 Table
|
International Journal of Scientific & Engineering Research, Volume
5, Issue 2, February-2014, Pages 847-854
|
10.14299/000000
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The statistic of World Health Organization shows at one year about 287000
women died most of them during and following pregnancy and childbirth in Africa
and south Asia. This paper suggests system for serving pregnant women using
open source based on Android technology, the proposed system works based on
mobile GIS to select closest care centre or hospital maternity on Google map
for the pregnant woman, which completed an online registration by sending SMS
via GPRS network (or internet) contains her name and phone number and region
(Longitude and Latitude) and other required information the server will save
the information in server database then find the closest care centre and call
her for first review at the selected care centre, the proposed system allowed
the pregnant women from her location (home, market, etc) can send a help
request in emergency cases (via SMS by click one button) contains the ID for
this pregnant woman, and her coordinates (Longitude and Latitude) via GPRS
network, then the server will locate the pregnant on Google map and retrieve
the pregnant information from the database. This information will be used by
the server to send succoring to pregnant woman at her location and at the same
time notify the nearest hospital and moreover, the server will send SMS over IP
to inform her husband and the hospital doctors. Implement and applied this
proposed system of pregnant women shows more effective cost than other systems
because it works in economic mode (SMS), and the services of proposed system
are flexible (open source platform) as well as rapidly (mobile GIS based on
Android) achieved locally registration, succoring in emergency cases, change
the review date of pregnant woman, addition to different types of advising
according to pregnancy. Index Terms: Build-in GPS; GPRS; Mobile GIS; SoIP; Open
Source; Google Maps API ; Android Technology
|
[
{
"version": "v1",
"created": "Tue, 25 Feb 2014 19:14:44 GMT"
}
] | 2014-02-26T00:00:00 |
[
[
"Ismaeel",
"Ayad Ghany",
""
],
[
"Hamead",
"Nur Gaylan",
""
]
] |
new_dataset
| 0.998703 |
1308.3603
|
Renaud Lambiotte
|
Vsevolod Salnikov, Daniel Schien, Hyejin Youn, Renaud Lambiotte and
Michael T. Gastner
|
The geography and carbon footprint of mobile phone use in Cote d'Ivoire
|
23 pages, 8 figures, 1 table
|
EPJ Data Science 2014, 3:3
|
10.1140/epjds21
| null |
cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The newly released Orange D4D mobile phone data base provides new insights
into the use of mobile technology in a developing country. Here we perform a
series of spatial data analyses that reveal important geographic aspects of
mobile phone use in Cote d'Ivoire. We first map the locations of base stations
with respect to the population distribution and the number and duration of
calls at each base station. On this basis, we estimate the energy consumed by
the mobile phone network. Finally, we perform an analysis of inter-city
mobility, and identify high-traffic roads in the country.
|
[
{
"version": "v1",
"created": "Fri, 16 Aug 2013 11:14:57 GMT"
},
{
"version": "v2",
"created": "Mon, 24 Feb 2014 13:48:27 GMT"
}
] | 2014-02-25T00:00:00 |
[
[
"Salnikov",
"Vsevolod",
""
],
[
"Schien",
"Daniel",
""
],
[
"Youn",
"Hyejin",
""
],
[
"Lambiotte",
"Renaud",
""
],
[
"Gastner",
"Michael T.",
""
]
] |
new_dataset
| 0.999672 |
1402.5477
|
Huazi Zhang
|
Huazi Zhang, Zhaoyang Zhang, Huaiyu Dai
|
Mobile Conductance and Gossip-based Information Spreading in Mobile
Networks
|
arXiv admin note: substantial text overlap with arXiv:1202.2586
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a general analytical framework for information
spreading in mobile networks based on a new performance metric, mobile
conductance, which allows us to separate the details of mobility models from
the study of mobile spreading time. We derive a general result for the
information spreading time in mobile networks in terms of this new metric, and
instantiate it through several popular mobility models. Large scale network
simulation is conducted to verify our analysis.
|
[
{
"version": "v1",
"created": "Sat, 22 Feb 2014 04:35:09 GMT"
}
] | 2014-02-25T00:00:00 |
[
[
"Zhang",
"Huazi",
""
],
[
"Zhang",
"Zhaoyang",
""
],
[
"Dai",
"Huaiyu",
""
]
] |
new_dataset
| 0.978789 |
1402.5592
|
Shamim Ripon
|
Shamim Ripon, Mohammad Salah Uddin and Aoyan Barua
|
Web Service Composition - BPEL vs cCSP Process Algebra
|
6 pages, 4 figures, Advanced Computer Science Applications and
Technologies (ACSAT), 2012 International Conference on
| null |
10.1109/ACSAT.2012.47
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web services technology provides a platform on which we can develop
distributed services. The interoperability among these services is achieved by
various standard protocols. In recent years, several researches suggested that
process algebras provide a satisfactory assistance to the whole process of web
services development. Business transactions, on the other hand, involve the
coordination and interaction between multiple partners. With the emergence of
web services, business transactions are conducted using these services. The
coordination among the business processes is crucial, so is the handling of
faults that can arise at any stage of a transaction. BPEL models the behavior
of business process interaction by providing a XML based grammar to describe
the control logic required to coordinate the web services participating in a
process flow. However BPEL lacks a proper formal description where the
composition of business processes cannot be formally verified. Process algebra,
on the other hand, facilitates a formal foundation for rigorous verification of
the composition. This paper presents a comparison of web service composition
between BPEL and process algebra, cCSP.
|
[
{
"version": "v1",
"created": "Sun, 23 Feb 2014 09:55:51 GMT"
}
] | 2014-02-25T00:00:00 |
[
[
"Ripon",
"Shamim",
""
],
[
"Uddin",
"Mohammad Salah",
""
],
[
"Barua",
"Aoyan",
""
]
] |
new_dataset
| 0.993886 |
1402.5639
|
Zhen Kan
|
Zhen Kan, Justin Klotz, Eduardo L. Pasiliao Jr, John M. Shea, Warren
E. Dixon
|
Decentralized Rendezvous of Nonholonomic Robots with Sensing and
Connectivity Constraints
|
9 pages, 5 figures, submitted to Automatica
| null | null | null |
cs.SY cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A group of wheeled robots with nonholonomic constraints is considered to
rendezvous at a common specified setpoint with a desired orientation while
maintaining network connectivity and ensuring collision avoidance within the
robots. Given communication and sensing constraints for each robot, only a
subset of the robots are aware or informed of the global destination, and the
remaining robots must move within the network connectivity constraint so that
the informed robots can guide the group to the goal. The mobile robots are also
required to avoid collisions with each other outside a neighborhood of the
common rendezvous point. To achieve the rendezvous control objective,
decentralized time-varying controllers are developed based on a navigation
function framework to steer the robots to perform rendezvous while preserving
network connectivity and ensuring collision avoidance. Only local sensing
feedback, which includes position feedback from immediate neighbors and
absolute orientation measurement, is used to navigate the robots and enables
radio silence during navigation. Simulation results demonstrate the performance
of the developed approach.
|
[
{
"version": "v1",
"created": "Sun, 23 Feb 2014 17:24:48 GMT"
}
] | 2014-02-25T00:00:00 |
[
[
"Kan",
"Zhen",
""
],
[
"Klotz",
"Justin",
""
],
[
"Pasiliao",
"Eduardo L.",
"Jr"
],
[
"Shea",
"John M.",
""
],
[
"Dixon",
"Warren E.",
""
]
] |
new_dataset
| 0.991905 |
1402.5644
|
Zhen Kan
|
Zhen Kan, Justin Klotz, Eduardo L. Pasiliao Jr, Warren E. Dixon
|
Containment Control for a Social Network with State-Dependent
Connectivity
|
9 pages, 2 figures, submitted to Automatica
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social interactions influence our thoughts, opinions and actions. In this
paper, social interactions are studied within a group of individuals composed
of influential social leaders and followers. Each person is assumed to maintain
a social state, which can be an emotional state or an opinion. Followers update
their social states based on the states of local neighbors, while social
leaders maintain a constant desired state. Social interactions are modeled as a
general directed graph where each directed edge represents an influence from
one person to another. Motivated by the non-local property of fractional-order
systems, the social response of individuals in the network are modeled by
fractional-order dynamics whose states depend on influences from local
neighbors and past experiences. A decentralized influence method is then
developed to maintain existing social influence between individuals (i.e.,
without isolating peers in the group) and to influence the social group to a
common desired state (i.e., within a convex hull spanned by social leaders).
Mittag-Leffler stability methods are used to prove asymptotic stability of the
networked fractional-order system.
|
[
{
"version": "v1",
"created": "Sun, 23 Feb 2014 18:13:47 GMT"
}
] | 2014-02-25T00:00:00 |
[
[
"Kan",
"Zhen",
""
],
[
"Klotz",
"Justin",
""
],
[
"Pasiliao",
"Eduardo L.",
"Jr"
],
[
"Dixon",
"Warren E.",
""
]
] |
new_dataset
| 0.996491 |
1402.5692
|
Rodrigo de Lamare
|
A. G. D. Uchoa, C. T. Healy and R. C. de Lamare
|
Repeat Accumulate Based Designs for LDPC Codes on Fading Channels
|
5 pages, 7 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Irregular repeat-accumulate Root-Check LDPC codes based on Progressive Edge
Growth (PEG) techniques for block-fading channels are proposed. The proposed
Root-Check LDPC codes are {both suitable for channels under $F = 2, 3$
independent fadings per codeword and} for fast fading channels. An IRA(A)
Root-Check structure is devised for $F = 2, 3$ independent fadings. The
performance of the new codes is investigated in terms of the Frame Error Rate
(FER). Numerical results show that the IRAA LDPC codes constructed by the
proposed algorithm {outperform by about 1dB the existing} IRA Root-Check LDPC
codes under fast-fading channels.
|
[
{
"version": "v1",
"created": "Mon, 24 Feb 2014 00:09:28 GMT"
}
] | 2014-02-25T00:00:00 |
[
[
"Uchoa",
"A. G. D.",
""
],
[
"Healy",
"C. T.",
""
],
[
"de Lamare",
"R. C.",
""
]
] |
new_dataset
| 0.998661 |
1402.5708
|
Lavdim Kurtaj
|
Lavdim Kurtaj, Ilir Limani, Vjosa Shatri and Avni Skeja
|
The Cerebellum: New Computational Model that Reveals its Primary
Function to Calculate Multibody Dynamics Conform to Lagrange-Euler
Formulation
|
18 pages, 4 figures
|
IJCSI International Journal of Computer Science Issues, Vol. 10,
Issue 5, No 2, September 2013
| null | null |
cs.NE cs.CE cs.RO q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cerebellum is part of the brain that occupies only 10% of the brain volume,
but it contains about 80% of total number of brain neurons. New cerebellar
function model is developed that sets cerebellar circuits in context of
multibody dynamics model computations, as important step in controlling balance
and movement coordination, functions performed by two oldest parts of the
cerebellum. Model gives new functional interpretation for granule cells-Golgi
cell circuit, including distinct function for upper and lower Golgi cell
dendritc trees, and resolves issue of sharing Granule cells between Purkinje
cells. Sets new function for basket cells, and for stellate cells according to
position in molecular layer. New model enables easily and direct integration of
sensory information from vestibular system and cutaneous mechanoreceptors, for
balance, movement and interaction with environments. Model gives explanation of
Purkinje cells convergence on deep-cerebellar nuclei.
|
[
{
"version": "v1",
"created": "Mon, 24 Feb 2014 02:40:05 GMT"
}
] | 2014-02-25T00:00:00 |
[
[
"Kurtaj",
"Lavdim",
""
],
[
"Limani",
"Ilir",
""
],
[
"Shatri",
"Vjosa",
""
],
[
"Skeja",
"Avni",
""
]
] |
new_dataset
| 0.998869 |
1402.5734
|
Cunsheng Ding
|
Cunsheng Ding, Longjiang Qu, Qiang Wang, Jin Yuan and Pingzhi Yuan
|
Permutation trinomials over finite fields with even characteristic
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Permutation polynomials have been a subject of study for a long time and have
applications in many areas of science and engineering. However, only a small
number of specific classes of permutation polynomials are described in the
literature so far. In this paper we present a number of permutation trinomials
over finite fields, which are of different forms.
|
[
{
"version": "v1",
"created": "Mon, 24 Feb 2014 06:58:44 GMT"
}
] | 2014-02-25T00:00:00 |
[
[
"Ding",
"Cunsheng",
""
],
[
"Qu",
"Longjiang",
""
],
[
"Wang",
"Qiang",
""
],
[
"Yuan",
"Jin",
""
],
[
"Yuan",
"Pingzhi",
""
]
] |
new_dataset
| 0.992373 |
1212.3883
|
Mir Mahmood H
|
Mir H. Mahmood, Mark R. Bell
|
Bayes Information-theoretic Radar Waveform Design and Delay-Doppler
Resolution for Extended Targets
|
The paper has been withdrawn because a more efficient algorithm for
waveform design has been proposed the authors. The journal version of the
paper will be uploaded shortly
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we consider the problem of information-theoretic waveform
design for active sensing systems such as radar for extended targets. Contrary
to the popular formulation of the problem in the estimation-theoretic context,
we are rather interested in a Bayes decision theoretic approach where a target
present in the environment belongs to two or more classes whose priors are
known. Optimal information theory based transmit waveforms are designed by
maximizing mutual information (MI) between the received signal and the target
impulse response, resulting in a novel iterative design equation. We also
derive signal to noise ratio (SNR) maximization based waveforms. In an effort
to quantize the benefits of such a design approach, the delay-Doppler ambiguity
function of information-theoretic waveforms are presented and is compared with
Barker codes of similar time-bandwidth product. It is found that the ambiguity
function of information-theoretic waveforms has very sharp main lobe in general
and excellent time autocorrelation properties in particular.
|
[
{
"version": "v1",
"created": "Mon, 17 Dec 2012 04:47:05 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Feb 2014 06:32:34 GMT"
}
] | 2014-02-24T00:00:00 |
[
[
"Mahmood",
"Mir H.",
""
],
[
"Bell",
"Mark R.",
""
]
] |
new_dataset
| 0.972282 |
1402.5188
|
Chao Wang
|
Chao Wang
|
Collision free autonomous navigation and formation building for
non-holonomic ground robots
| null | null | null | null |
cs.RO math.OC
|
http://creativecommons.org/licenses/by/3.0/
|
The primary objective of a safe navigation algorithm is to guide the object
from its current position to the target position while avoiding any collision
with the en-route obstacles, and the appropriate obstacle avoidance strategies
are the key factors to ensure safe navigation tasks in dynamic environments. In
this report, three different obstacle avoidance strategies for safe navigation
in dynamic environments have been presented. The biologically-inspired
navigation algorithm (BINA) is efficient in terms of avoidance time. The
equidistant based navigation algorithm (ENA) is able to achieve navigation task
with in uncertain dynamic environments. The navigation algorithm algorithm
based on an integrated environment representation (NAIER) allows the object to
seek a safe path through obstacles in unknown dynamic environment in a
human-like fashion. The performances and features of the proposed navigation
algorithms are confirmed by extensive simulation results and experiments with a
real non-holonomic mobile robot. The algorithms have been implemented on two
real control systems: intelligent wheelchair and robotic hospital bed. The
performance of the proposed algorithms with SAM and Flexbed demonstrate their
capabilities to achieve navigation tasks in complicated real time scenarios.
The proposed algorithms are easy to be implemented in real time and costly
efficient. An extra study on networked multi-robots formation building
algorithm is presented in this paper. A constructive and easy-to-implement
decentralised control is proposed for a formation building of a group of random
positioned objects. Furthermore, the problem of formation building with
anonymous objects is addressed. This randomised decentralised navigation
algorithm achieves the convergence to a desired configuration with probability
1.
|
[
{
"version": "v1",
"created": "Fri, 21 Feb 2014 02:22:57 GMT"
}
] | 2014-02-24T00:00:00 |
[
[
"Wang",
"Chao",
""
]
] |
new_dataset
| 0.977364 |
1402.5196
|
Kensuke Nakanishi
|
Kensuke Nakanishi, Shinsuke Hara, Takahiro Matsuda, Kenichi Takizawa,
Fumie Ono, and Ryu Miura
|
Synchronization-Free Delay Tomography Based on Compressed Sensing
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Delay tomography has so far burdened source and receiver measurement nodes in
a network with two requirements such as path establishment and clock
synchronization between them. In this letter, we focus on the clock
synchronization problem in delay tomography and propose a synchronization-free
delay tomography scheme. The proposed scheme selects a path between source and
receiver measurement nodes as a reference path, which results in a loss of
equation in a conventional delay tomography problem. However, by utilizing
compressed sensing, the proposed scheme becomes robust to the loss. Simulation
experiments confirm that the proposed scheme works comparable to a conventional
delay tomography scheme in networks with no clock synchronization between
source and receiver measurement nodes.
|
[
{
"version": "v1",
"created": "Fri, 21 Feb 2014 03:33:24 GMT"
}
] | 2014-02-24T00:00:00 |
[
[
"Nakanishi",
"Kensuke",
""
],
[
"Hara",
"Shinsuke",
""
],
[
"Matsuda",
"Takahiro",
""
],
[
"Takizawa",
"Kenichi",
""
],
[
"Ono",
"Fumie",
""
],
[
"Miura",
"Ryu",
""
]
] |
new_dataset
| 0.994894 |
1402.4826
|
Federico Maggi
|
Andrea Gianazza and Federico Maggi and Aristide Fattori and Lorenzo
Cavallaro and Stefano Zanero
|
PuppetDroid: A User-Centric UI Exerciser for Automatic Dynamic Analysis
of Similar Android Applications
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Popularity and complexity of malicious mobile applications are rising, making
their analysis difficult and labor intensive. Mobile application analysis is
indeed inherently different from desktop application analysis: In the latter,
the interaction of the user (i.e., victim) is crucial for the malware to
correctly expose all its malicious behaviors.
We propose a novel approach to analyze (malicious) mobile applications. The
goal is to exercise the user interface (UI) of an Android application to
effectively trigger malicious behaviors, automatically. Our key intuition is to
record and reproduce the UI interactions of a potential victim of the malware,
so as to stimulate the relevant behaviors during dynamic analysis. To make our
approach scale, we automatically re-execute the recorded UI interactions on
apps that are similar to the original ones. These characteristics make our
system orthogonal and complementary to current dynamic analysis and
UI-exercising approaches.
We developed our approach and experimentally shown that our stimulation
allows to reach a higher code coverage than automatic UI exercisers, so to
unveil interesting malicious behaviors that are not exposed when using other
approaches.
Our approach is also suitable for crowdsourcing scenarios, which would push
further the collection of new stimulation traces. This can potentially change
the way we conduct dynamic analysis of (mobile) applications, from fully
automatic only, to user-centric and collaborative too.
|
[
{
"version": "v1",
"created": "Wed, 19 Feb 2014 21:08:11 GMT"
}
] | 2014-02-21T00:00:00 |
[
[
"Gianazza",
"Andrea",
""
],
[
"Maggi",
"Federico",
""
],
[
"Fattori",
"Aristide",
""
],
[
"Cavallaro",
"Lorenzo",
""
],
[
"Zanero",
"Stefano",
""
]
] |
new_dataset
| 0.995665 |
1402.4958
|
Dan Dobre Dan Dobre
|
Elli Androulaki, Christian Cachin, Dan Dobre, Marko Vukolic
|
Erasure-Coded Byzantine Storage with Separate Metadata
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although many distributed storage protocols have been introduced, a solution
that combines the strongest properties in terms of availability, consistency,
fault-tolerance, storage complexity and the supported level of concurrency, has
been elusive for a long time. Combining these properties is difficult,
especially if the resulting solution is required to be efficient and incur low
cost. We present AWE, the first erasure-coded distributed implementation of a
multi-writer multi-reader read/write storage object that is, at the same time:
(1) asynchronous, (2) wait-free, (3) atomic, (4) amnesic, (i.e., with data
nodes storing a bounded number of values) and (5) Byzantine fault-tolerant
(BFT) using the optimal number of nodes. Furthermore, AWE is efficient since it
does not use public-key cryptography and requires data nodes that support only
reads and writes, further reducing the cost of deployment and ownership of a
distributed storage solution. Notably, AWE stores metadata separately from
$k$-out-of-$n$ erasure-coded fragments. This enables AWE to be the first BFT
protocol that uses as few as $2t+k$ data nodes to tolerate $t$ Byzantine nodes,
for any $k \ge 1$.
|
[
{
"version": "v1",
"created": "Thu, 20 Feb 2014 10:53:07 GMT"
}
] | 2014-02-21T00:00:00 |
[
[
"Androulaki",
"Elli",
""
],
[
"Cachin",
"Christian",
""
],
[
"Dobre",
"Dan",
""
],
[
"Vukolic",
"Marko",
""
]
] |
new_dataset
| 0.954439 |
1311.0709
|
Yanshan Wang
|
Yanshan Wang
|
A novel soft keyboard for touchscreen phones: QWERT
| null |
Int. J. of Human Factors and Ergonomics, 2013 Vol.2, No.4, pp.246
- 261
|
10.1504/IJHFE.2013.059374
| null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The popularity of touchscreen phones has been growing around the world since
the iPhones and Android phones were released. More and more mobile phones with
large touchscreen have been produced, however, the phones with small size
displays are still in the majority of touch phones. The foremost interface on
touch smartphones is the information input module using soft keyboards.
Traditional input methods on touch phones have either too small key buttons
(such as QWERTY) or too many functions (such as 3$\times$4 keyboard), which are
inconvenient to use. Moreover, the conventional soft keyboards only use tapping
to input texts while current touch smartphones allow various gestures on the
touchscreen, such as sliding. In this paper, a novel soft keyboard called QWERT
is proposed for touchscreen-based smartphones. The users can interact with
phones via finger gestures of tapping or sliding when input text by using the
QWERT. In doing so, the interactions between users and smartphones will be
faster and easier. An experiment carried out on inexperienced human subjects
shows that they can learn very fast due to their familiarities with QWERTY. A
simulation experiment based on a cognitive architecture, ACT-R, was also
conducted to predict the movement time (MT) of experienced human subjects. The
simulation results show that the MT using QWERT outperforms other default
keyboards. These outcomes imply that the novel QWERT is a viable option for
touch smartphone users. Based on the novel design, an application is released
on Android systems. This application is expected to give better user experience
for customers who use touch smartphones.
|
[
{
"version": "v1",
"created": "Mon, 4 Nov 2013 14:25:29 GMT"
}
] | 2014-02-20T00:00:00 |
[
[
"Wang",
"Yanshan",
""
]
] |
new_dataset
| 0.999715 |
1311.1013
|
Per Zetterberg
|
Per Zetterberg
|
Interference Alignment (IA) and Coordinated Multi-Point (CoMP) with
IEEE802.11ac feedback compression: testbed results
|
To appear in ICASSP 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have implemented interference alignment (IA) and joint transmission
coordinated multipoint (CoMP) on a wireless testbed using the feedback
compression scheme of the new 802.11ac standard. The performance as a function
of the frequency domain granularity is assessed. Realistic throughput gains are
obtained by probing each spatial modulation stream with ten different coding
and modulation schemes. The gain of IA and CoMP over TDMA MIMO is found to be
26% and 71%, respectively under stationary conditions. In our dense indoor
office deployment, the frequency domain granularity of the feedback can be
reduced down to every 8th subcarrier (2.5MHz), without sacrificing performance.
|
[
{
"version": "v1",
"created": "Tue, 5 Nov 2013 11:15:54 GMT"
},
{
"version": "v2",
"created": "Wed, 19 Feb 2014 14:12:09 GMT"
}
] | 2014-02-20T00:00:00 |
[
[
"Zetterberg",
"Per",
""
]
] |
new_dataset
| 0.99893 |
1402.4543
|
Boyu Li
|
Dengkui Zhu, Boyu Li, Ping Liang
|
Normalized Volume of Hyperball in Complex Grassmann Manifold and Its
Application in Large-Scale MU-MIMO Communication Systems
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides a solution to a critical issue in large-scale Multi-User
Multiple-Input Multiple-Output (MU-MIMO) communication systems: how to estimate
the Signal-to-Interference-plus-Noise-Ratios (SINRs) and their expectations in
MU-MIMO mode at the Base Station (BS) side when only the Channel Quality
Information (CQI) in Single-User MIMO (SU-MIMO) mode and non-ideal Channel
State Information (CSI) are known? A solution to this problem would be very
beneficial for the BS to predict the capacity of MU-MIMO and choose the proper
modulation and channel coding for MU-MIMO. To that end, this paper derives a
normalized volume formula of a hyperball based on the probability density
function of the canonical angle between any two points in a complex Grassmann
manifold, and shows that this formula provides a solution to the aforementioned
issue. It enables the capability of a BS to predict the capacity loss due to
non-ideal CSI, group users in MU-MIMO mode, choose the proper modulation and
channel coding, and adaptively switch between SU-MIMO and MU-MIMO modes, as
well as between Conjugate Beamforming (CB) and Zero-Forcing (ZF) precoding.
Numerical results are provided to verify the validity and accuracy of the
solution.
|
[
{
"version": "v1",
"created": "Wed, 19 Feb 2014 01:35:40 GMT"
}
] | 2014-02-20T00:00:00 |
[
[
"Zhu",
"Dengkui",
""
],
[
"Li",
"Boyu",
""
],
[
"Liang",
"Ping",
""
]
] |
new_dataset
| 0.988153 |
1402.4778
|
Jan Bergstra
|
Jan A. Bergstra and Peter Weijland
|
Bitcoin: a Money-like Informational Commodity
| null | null | null |
Report TCS 1402
|
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The question "what is Bitcoin" allows for many answers depending on the
objectives aimed at when providing such answers. The question addressed in this
paper is to determine a top-level classification, or type, for Bitcoin. We will
classify Bitcoin as a system of type money-like informational commodity (MLIC).
|
[
{
"version": "v1",
"created": "Wed, 19 Feb 2014 19:25:15 GMT"
}
] | 2014-02-20T00:00:00 |
[
[
"Bergstra",
"Jan A.",
""
],
[
"Weijland",
"Peter",
""
]
] |
new_dataset
| 0.999808 |
1402.4164
|
Eduardo R. B. Marques
|
Eduardo R. B. Marques
|
Fine-grained Patches for Java Software Upgrades
|
In Proc. HotSWUp'13, 6 pages, 4 figures, 1 table
|
Proc. 5th Workshop on Hot Topics in Software Upgrades, USENIX,
2013
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel methodology for deriving fine-grained patches of Java
software. We consider an abstract-syntax tree (AST) representation of Java
classes compiled to the Java Virtual Machine (JVM) format, and a difference
analysis over the AST representation to derive patches. The AST representation
defines an appropriate abstraction level for analyzing differences, yielding
compact patches that correlate modularly to actual source code changes. The
approach contrasts to other common, coarse-grained approaches, like plain
binary differences, which may easily lead to disproportionately large patches.
We present the main traits of the methodology, a prototype tool called aspa
that implements it, and a case-study analysis on the use of aspa to derive
patches for the Java 2 SE API. The case-study results illustrate that aspa
patches have a significantly smaller size than patches derived by binary
differencing tools.
|
[
{
"version": "v1",
"created": "Mon, 17 Feb 2014 22:05:42 GMT"
}
] | 2014-02-19T00:00:00 |
[
[
"Marques",
"Eduardo R. B.",
""
]
] |
new_dataset
| 0.995638 |
1402.4465
|
Marijn Heule
|
Peter van der Tak and Marijn J.H. Heule and Armin Biere
|
Concurrent Cube-and-Conquer
|
Third International Workshop on Pragmatics of SAT (PoS 2012)
| null | null | null |
cs.DS cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent work introduced the cube-and-conquer technique to solve hard SAT
instances. It partitions the search space into cubes using a lookahead solver.
Each cube is tackled by a conflict-driven clause learning (CDCL) solver.
Crucial for strong performance is the cutoff heuristic that decides when to
switch from lookahead to CDCL. Yet, this offline heuristic is far from ideal.
In this paper, we present a novel hybrid solver that applies the cube and
conquer steps simultaneously. A lookahead and a CDCL solver work together on
each cube, while communication is restricted to synchronization. Our concurrent
cube-and-conquer solver can solve many instances faster than pure lookahead,
pure CDCL and offline cube-and-conquer, and can abort early in favor of a pure
CDCL search if an instance is not suitable for cube-and-conquer techniques.
|
[
{
"version": "v1",
"created": "Tue, 18 Feb 2014 20:39:30 GMT"
}
] | 2014-02-19T00:00:00 |
[
[
"van der Tak",
"Peter",
""
],
[
"Heule",
"Marijn J. H.",
""
],
[
"Biere",
"Armin",
""
]
] |
new_dataset
| 0.998454 |
1306.5606
|
Barry Hurley
|
Barry Hurley, Lars Kotthoff, Yuri Malitsky, Barry O'Sullivan
|
Proteus: A Hierarchical Portfolio of Solvers and Transformations
|
11th International Conference on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems. The final
publication is available at link.springer.com
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, portfolio approaches to solving SAT problems and CSPs have
become increasingly common. There are also a number of different encodings for
representing CSPs as SAT instances. In this paper, we leverage advances in both
SAT and CSP solving to present a novel hierarchical portfolio-based approach to
CSP solving, which we call Proteus, that does not rely purely on CSP solvers.
Instead, it may decide that it is best to encode a CSP problem instance into
SAT, selecting an appropriate encoding and a corresponding SAT solver. Our
experimental evaluation used an instance of Proteus that involved four CSP
solvers, three SAT encodings, and six SAT solvers, evaluated on the most
challenging problem instances from the CSP solver competitions, involving
global and intensional constraints. We show that significant performance
improvements can be achieved by Proteus obtained by exploiting alternative
view-points and solvers for combinatorial problem-solving.
|
[
{
"version": "v1",
"created": "Mon, 24 Jun 2013 13:11:54 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Feb 2014 12:26:45 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Hurley",
"Barry",
""
],
[
"Kotthoff",
"Lars",
""
],
[
"Malitsky",
"Yuri",
""
],
[
"O'Sullivan",
"Barry",
""
]
] |
new_dataset
| 0.954347 |
1310.1530
|
Henry Hong-Ning Dai Dr.
|
Hong-Ning Dai and Raymond Chi-Wing Wong and Qinglin Zhao
|
Multi-channel Wireless Networks with Infrastructure Support: Capacity
and Delay
|
12 pages, 6 figures, 3 tables
| null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In this paper, we propose a novel multi-channel network with infrastructure
support, called an \textit{MC-IS} network, which has not been studied in the
literature. To the best of our knowledge, we are the first to study such an
\textit{MC-IS} network. Our \textit{MC-IS} network is equipped with a number of
infrastructure nodes which can communicate with common nodes using a number of
channels where a communication between a common node and an infrastructure node
is called an infrastructure communication and a communication between two
common nodes is called an ad-hoc communication. Our proposed \textit{MC-IS}
network has a number of advantages over three existing conventional networks,
namely a single-channel wireless ad hoc network (called an \textit{SC-AH}
network), a multi-channel wireless ad hoc network (called an \textit{MC-AH}
network) and a single-channel network with infrastructure support (called an
\textit{SC-IS} network). In particular, the \textit{network capacity} of our
proposed \textit{MC-IS} network is $\sqrt{n \log n}$ times higher than that of
an \textit{SC-AH} network and an \textit{MC-AH} network and the same as that of
an \textit{SC-IS} network, where $n$ is the number of nodes in the network. The
\textit{average delay} of our \textit{MC-IS} network is $\sqrt{\log n/n}$ times
lower than that of an \textit{SC-AH} network and an \textit{MC-AH} network, and
$\min(C_I,m)$ times lower than the average delay of an \textit{SC-IS} network,
where $C_I$ and $m$ denote the number of channels dedicated for infrastructure
communications and the number of interfaces mounted at each infrastructure
node, respectively.
|
[
{
"version": "v1",
"created": "Sun, 6 Oct 2013 02:41:49 GMT"
},
{
"version": "v2",
"created": "Sat, 15 Feb 2014 04:14:27 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Dai",
"Hong-Ning",
""
],
[
"Wong",
"Raymond Chi-Wing",
""
],
[
"Zhao",
"Qinglin",
""
]
] |
new_dataset
| 0.996202 |
1312.4190
|
Jakub Konecny
|
Jakub Kone\v{c}n\'y and Michal Hagara
|
One-Shot-Learning Gesture Recognition using HOG-HOF Features
|
20 pages, 10 figures, 2 tables To appear in Journal of Machine
Learning Research subject to minor revision
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The purpose of this paper is to describe one-shot-learning gesture
recognition systems developed on the \textit{ChaLearn Gesture Dataset}. We use
RGB and depth images and combine appearance (Histograms of Oriented Gradients)
and motion descriptors (Histogram of Optical Flow) for parallel temporal
segmentation and recognition. The Quadratic-Chi distance family is used to
measure differences between histograms to capture cross-bin relationships. We
also propose a new algorithm for trimming videos --- to remove all the
unimportant frames from videos. We present two methods that use combination of
HOG-HOF descriptors together with variants of Dynamic Time Warping technique.
Both methods outperform other published methods and help narrow down the gap
between human performance and algorithms on this task. The code has been made
publicly available in the MLOSS repository.
|
[
{
"version": "v1",
"created": "Sun, 15 Dec 2013 20:58:21 GMT"
},
{
"version": "v2",
"created": "Sat, 15 Feb 2014 17:47:11 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Konečný",
"Jakub",
""
],
[
"Hagara",
"Michal",
""
]
] |
new_dataset
| 0.994764 |
1402.2184
|
Boris Konev
|
Boris Konev and Alexei Lisitsa
|
A SAT Attack on the Erdos Discrepancy Conjecture
|
8 pages. The description of the automata is clarified
| null | null | null |
cs.DM math.CO math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 1930s Paul Erdos conjectured that for any positive integer C in any
infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... ,
x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... +
x_{kd}|> C. The conjecture has been referred to as one of the major open
problems in combinatorial number theory and discrepancy theory. For the
particular case of C=1 a human proof of the conjecture exists; for C=2 a
bespoke computer program had generated sequences of length 1124 having
discrepancy 2, but the status of the conjecture remained open even for such a
small bound. We show that by encoding the problem into Boolean satisfiability
and applying the state of the art SAT solvers, one can obtain a sequence of
length 1160 with discrepancy 2 and a proof of the Erdos discrepancy conjecture
for C=2, claiming that no sequence of length 1161 and discrepancy 2 exists. We
also present our partial results for the case of C=3.
|
[
{
"version": "v1",
"created": "Mon, 10 Feb 2014 15:33:07 GMT"
},
{
"version": "v2",
"created": "Mon, 17 Feb 2014 09:06:41 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Konev",
"Boris",
""
],
[
"Lisitsa",
"Alexei",
""
]
] |
new_dataset
| 0.997611 |
1402.3689
|
Radu Horaud P
|
Maxime Janvier, Xavier Alameda-Pineda, Laurent Girin and Radu Horaud
|
Sound Representation and Classification Benchmark for Domestic Robots
|
8 pages, 2 figures
| null | null | null |
cs.SD cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We address the problem of sound representation and classification and present
results of a comparative study in the context of a domestic robotic scenario. A
dataset of sounds was recorded in realistic conditions (background noise,
presence of several sound sources, reverberations, etc.) using the humanoid
robot NAO. An extended benchmark is carried out to test a variety of
representations combined with several classifiers. We provide results obtained
with the annotated dataset and we assess the methods quantitatively on the
basis of their classification scores, computation times and memory
requirements. The annotated dataset is publicly available at
https://team.inria.fr/perception/nard/.
|
[
{
"version": "v1",
"created": "Sat, 15 Feb 2014 13:27:01 GMT"
}
] | 2014-02-18T00:00:00 |
[
[
"Janvier",
"Maxime",
""
],
[
"Alameda-Pineda",
"Xavier",
""
],
[
"Girin",
"Laurent",
""
],
[
"Horaud",
"Radu",
""
]
] |
new_dataset
| 0.999656 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.