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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0903.0566
|
Gilles Z\'emor
|
Jean-Pierre Tillich and Gilles Zemor
|
Quantum LDPC codes with positive rate and minimum distance proportional
to n^{1/2}
|
21 pages
|
IEEE Trans. Inform. Theory. Vol. 60, No 2, pp. 1193--1202. 2014
|
10.1109/TIT.2013.2292061
| null |
cs.IT math.IT quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The current best asymptotic lower bound on the minimum distance of quantum
LDPC codes with fixed non-zero rate is logarithmic in the blocklength. We
propose a construction of quantum LDPC codes with fixed non-zero rate and prove
that the minimum distance grows proportionally to the square root of the
blocklength.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2009 16:41:00 GMT"
},
{
"version": "v2",
"created": "Fri, 11 Jan 2013 09:25:05 GMT"
}
] | 2015-03-05T00:00:00 |
[
[
"Tillich",
"Jean-Pierre",
""
],
[
"Zemor",
"Gilles",
""
]
] |
new_dataset
| 0.999718 |
1406.5181
|
Jake Williams
|
Jake Ryland Williams, Paul R. Lessard, Suma Desu, Eric Clark, James P.
Bagrow, Christopher M. Danforth, and Peter Sheridan Dodds
|
Zipf's law holds for phrases, not words
|
Manuscript: 6 pages, 3 figures; Supplementary Information: 8 pages,
18 tables
| null | null | null |
cs.CL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With Zipf's law being originally and most famously observed for word
frequency, it is surprisingly limited in its applicability to human language,
holding over no more than three to four orders of magnitude before hitting a
clear break in scaling. Here, building on the simple observation that phrases
of one or more words comprise the most coherent units of meaning in language,
we show empirically that Zipf's law for phrases extends over as many as nine
orders of rank magnitude. In doing so, we develop a principled and scalable
statistical mechanical method of random text partitioning, which opens up a
rich frontier of rigorous text analysis via a rank ordering of mixed length
phrases.
|
[
{
"version": "v1",
"created": "Thu, 19 Jun 2014 20:00:05 GMT"
},
{
"version": "v2",
"created": "Wed, 4 Mar 2015 14:20:45 GMT"
}
] | 2015-03-05T00:00:00 |
[
[
"Williams",
"Jake Ryland",
""
],
[
"Lessard",
"Paul R.",
""
],
[
"Desu",
"Suma",
""
],
[
"Clark",
"Eric",
""
],
[
"Bagrow",
"James P.",
""
],
[
"Danforth",
"Christopher M.",
""
],
[
"Dodds",
"Peter Sheridan",
""
]
] |
new_dataset
| 0.996941 |
1503.01267
|
Andrea Lanna
|
Andrea Lanna and Francesco Liberati and Letterio Zuccaro and
Alessandro Di Giorgio
|
Electric Vehicles Charging Control based on Future Internet Generic
Enablers
|
To appear in IEEE International Electric Vehicle Conference (IEEE
IEVC 2014)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a rationale for the deployment of Future Internet based
applications in the field of Electric Vehicles (EVs) smart charging is
presented. The focus is on the Connected Device Interface (CDI) Generic Enabler
(GE) and the Network Information and Controller (NetIC) GE, which are
recognized to have a potential impact on the charging control problem and the
configuration of communications networks within reconfigurable clusters of
charging points. The CDI GE can be used for capturing the driver feedback in
terms of Quality of Experience (QoE) in those situations where the charging
power is abruptly limited as a consequence of short term grid needs, like the
shedding action asked by the Transmission System Operator to the Distribution
System Operator aimed at clearing networks contingencies due to the loss of a
transmission line or large wind power fluctuations. The NetIC GE can be used
when a master Electric Vehicle Supply Equipment (EVSE) hosts the Load Area
Controller, responsible for managing simultaneous charging sessions within a
given Load Area (LA); the reconfiguration of distribution grid topology results
in shift of EVSEs among LAs, then reallocation of slave EVSEs is needed.
Involved actors, equipment, communications and processes are identified through
the standardized framework provided by the Smart Grid Architecture Model
(SGAM).
|
[
{
"version": "v1",
"created": "Wed, 4 Mar 2015 10:13:48 GMT"
}
] | 2015-03-05T00:00:00 |
[
[
"Lanna",
"Andrea",
""
],
[
"Liberati",
"Francesco",
""
],
[
"Zuccaro",
"Letterio",
""
],
[
"Di Giorgio",
"Alessandro",
""
]
] |
new_dataset
| 0.998066 |
1503.01376
|
Sergio Consoli
|
Sergio Consoli, Nenad Mladenov\`ic, Jos\`e A. Moreno-P\`erez
|
BVNS para el problema del bosque generador k-etiquetado
|
8 pages, in Spanish. X Congreso Espanol sobre Metaheur\`isticas,
Algoritmos Evolutivos y Bioinspirados, MAEB 2015, M\`erida - Almendralejo 4-6
Feb 2015; Proceedings of the X Congreso Espanol sobre Metaheur\`isticas,
Algoritmos Evolutivos y Bioinspirados, MAEB 2015, Francisco Chavez de la O et
al. (Eds.), ISBN: 978-84-697-2150-6, pages: 629-636, 2015
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we propose an efficient solution for the problem of generating
k-labeling forest VNS. This problem is an extension of the Minimum Spanning
Tree Problem Labelling problem with important applications in
telecommunications networks and multimodal transport. It is, given an
undirected graph whose links are labeled, and an integer positive number k,
find the spanning forest with the lowest number of connected components using
at most k different labels. To address the problem a Basic Variable
Neighbourhood Search is proposed where the maximum amplitude of the
neighbourhood space, n, is a key parameter. Different strategies are studied to
establish the value of n. BVNS with the best selected strategy is
experimentally compared with other metaheuristics that have appeared in the
literature applied to this type of problem.
|
[
{
"version": "v1",
"created": "Wed, 4 Mar 2015 16:40:49 GMT"
}
] | 2015-03-05T00:00:00 |
[
[
"Consoli",
"Sergio",
""
],
[
"Mladenovìc",
"Nenad",
""
],
[
"Moreno-Pèrez",
"Josè A.",
""
]
] |
new_dataset
| 0.965486 |
1503.00992
|
Jean-Marie Mirebeau
|
Jean-Marie Mirebeau (CEREMADE), J\'er\^ome Fehrenbach (IMT), Laurent
Risser (IMT), Shaza Tobji (IMT)
|
Anisotropic Diffusion in ITK
| null | null | null | null |
cs.CV math.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anisotropic Non-Linear Diffusion is a powerful image processing technique,
which allows to simultaneously remove the noise and enhance sharp features in
two or three dimensional images. Anisotropic Diffusion is understood here in
the sense of Weickert, meaning that diffusion tensors are anisotropic and
reflect the local orientation of image features. This is in contrast with the
non-linear diffusion filter of Perona and Malik, which only involves scalar
diffusion coefficients, in other words isotropic diffusion tensors. In this
paper, we present an anisotropic non-linear diffusion technique we implemented
in ITK. This technique is based on a recent adaptive scheme making the
diffusion stable and requiring limited numerical resources. (See supplementary
data.)
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2015 16:17:16 GMT"
}
] | 2015-03-04T00:00:00 |
[
[
"Mirebeau",
"Jean-Marie",
"",
"CEREMADE"
],
[
"Fehrenbach",
"Jérôme",
"",
"IMT"
],
[
"Risser",
"Laurent",
"",
"IMT"
],
[
"Tobji",
"Shaza",
"",
"IMT"
]
] |
new_dataset
| 0.950569 |
1503.01058
|
Aleksandr Cariow
|
Aleksandr Cariow, Galina Cariowa, Bartosz Kubsik
|
An algorithm for multiplication of split-octonions
|
14 pages, 4 figures. arXiv admin note: substantial text overlap with
arXiv:1502.06250
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce efficient algorithm for the multiplication of
split-octonions. The direct multiplication of two split-octonions requires 64
real multiplications and 56 real additions. More effective solutions still do
not exist. We show how to compute a product of the split-octonions with 28 real
multiplications and 92 real additions. During synthesis of the discussed
algorithm we use the fact that product of two split-octonions may be
represented as vector-matrix product. The matrix that participates in the
product calculating has unique structural properties that allow performing its
advantageous decomposition. Namely this decomposition leads to significant
reducing of the multiplicative complexity of split-octonions multiplication.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2015 19:09:30 GMT"
}
] | 2015-03-04T00:00:00 |
[
[
"Cariow",
"Aleksandr",
""
],
[
"Cariowa",
"Galina",
""
],
[
"Kubsik",
"Bartosz",
""
]
] |
new_dataset
| 0.969999 |
1503.01063
|
Niv Voskoboynik
|
Niv Voskoboynik, Haim H. Permuter and Asaf Cohen
|
On the Capacity of Wireless Networks with Random Transmission Delay
|
15 pages, 19 figures, submitted to the IEEE/ACM Transactions on
Networking
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce novel coding schemes for wireless networks with
random transmission delays. These coding schemes obviate the need for
synchronicity, reduce the number of transmissions and achieve the optimal rate
region in the corresponding wired model for both multiple unicast and multicast
cases with up to three users under the equal rate constraint. The coding
schemes are presented in two phases; first, coding schemes for line, star and
line-star topologies with random transmission delays are provided. Second, any
general topology with multiple bidirectional unicast and multicast sessions is
shown to be decomposable into these canonical topologies to reduce the number
of transmissions without rate redundancy. As a result, the coding schemes
developed for the line, star and line-star topologies serve as building blocks
for the construction of more general coding schemes for all networks. The
proposed schemes are proved to be Real Time (RT) for wireless networks in the
sense that they achieve the minimal decoding delay. With a negligible size
header, these coding schemes are shown to be applicable to unsynchronized
networks, i.e., networks with random transmission delays. Finally, we
demonstrate the applicability of these schemes by extensive simulations. The
implementation of such coding schemes on a wireless network with random
transmission delay can improve performance and power efficiency.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2015 19:16:09 GMT"
}
] | 2015-03-04T00:00:00 |
[
[
"Voskoboynik",
"Niv",
""
],
[
"Permuter",
"Haim H.",
""
],
[
"Cohen",
"Asaf",
""
]
] |
new_dataset
| 0.976924 |
1503.01070
|
Atousa Torabi
|
Atousa Torabi, Christopher Pal, Hugo Larochelle, Aaron Courville
|
Using Descriptive Video Services to Create a Large Data Source for Video
Annotation Research
|
7 pages
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we introduce a dataset of video annotated with high quality
natural language phrases describing the visual content in a given segment of
time. Our dataset is based on the Descriptive Video Service (DVS) that is now
encoded on many digital media products such as DVDs. DVS is an audio narration
describing the visual elements and actions in a movie for the visually
impaired. It is temporally aligned with the movie and mixed with the original
movie soundtrack. We describe an automatic DVS segmentation and alignment
method for movies, that enables us to scale up the collection of a DVS-derived
dataset with minimal human intervention. Using this method, we have collected
the largest DVS-derived dataset for video description of which we are aware.
Our dataset currently includes over 84.6 hours of paired video/sentences from
92 DVDs and is growing.
|
[
{
"version": "v1",
"created": "Tue, 3 Mar 2015 19:22:01 GMT"
}
] | 2015-03-04T00:00:00 |
[
[
"Torabi",
"Atousa",
""
],
[
"Pal",
"Christopher",
""
],
[
"Larochelle",
"Hugo",
""
],
[
"Courville",
"Aaron",
""
]
] |
new_dataset
| 0.999597 |
1503.01073
|
Vinzenz Maurer
|
Vinzenz Maurer
|
T3PS: Tool for Parallel Processing in Parameter Scans
|
50 pages, 7 figures, available for download at
http://t3ps.hepforge.org/
| null | null | null |
cs.MS cs.CE hep-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
T3PS is a program that can be used to quickly design and perform parameter
scans while easily taking advantage of the multi-core architecture of current
processors. It takes an easy to read and write parameter scan definition file
format as input. Based on the parameter ranges and other options contained
therein, it distributes the calculation of the parameter space over multiple
processes and possibly computers. The derived data is saved in a plain text
file format readable by most plotting software. The supported scanning
strategies include: grid scan, random scan, Markov Chain Monte Carlo, numerical
optimization. Several example parameter scans are shown and compared with
results in the literature.
|
[
{
"version": "v1",
"created": "Fri, 27 Feb 2015 08:48:24 GMT"
}
] | 2015-03-04T00:00:00 |
[
[
"Maurer",
"Vinzenz",
""
]
] |
new_dataset
| 0.985825 |
1201.1377
|
Chinmoy Dutta
|
Chinmoy Dutta and Jaikumar Radhakrishnan
|
On Zarankiewicz Problem and Depth-Two Superconcentrators
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show tight necessary and sufficient conditions on the sizes of small
bipartite graphs whose union is a larger bipartite graph that has no large
bipartite independent set. Our main result is a common generalization of two
classical results in graph theory: the theorem of K\H{o}v\'{a}ri, S\'{o}s and
Tur\'{a}n on the minimum number of edges in a bipartite graph that has no large
independent set, and the theorem of Hansel (also Katona and Szemer\'{e}di,
Krichevskii) on the sum of the sizes of bipartite graphs that can be used to
construct a graph (non-necessarily bipartite) that has no large independent
set.
As an application of our results, we show how they unify the underlying
combinatorial principles developed in the proof of tight lower bounds for
depth-two superconcentrators.
|
[
{
"version": "v1",
"created": "Fri, 6 Jan 2012 09:15:07 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Mar 2015 23:03:32 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Dutta",
"Chinmoy",
""
],
[
"Radhakrishnan",
"Jaikumar",
""
]
] |
new_dataset
| 0.989109 |
1301.1215
|
Sebastian Schaetz
|
Sebastian Schaetz and Martin Uecker
|
A Multi-GPU Programming Library for Real-Time Applications
|
15 pages, 10 figures
|
Algorithms and Architectures for Parallel Processing 7439 (2012)
114-128
|
10.1007/978-3-642-33078-0_9
| null |
cs.DC cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present MGPU, a C++ programming library targeted at single-node multi-GPU
systems. Such systems combine disproportionate floating point performance with
high data locality and are thus well suited to implement real-time algorithms.
We describe the library design, programming interface and implementation
details in light of this specific problem domain. The core concepts of this
work are a novel kind of container abstraction and MPI-like communication
methods for intra-system communication. We further demonstrate how MGPU is used
as a framework for porting existing GPU libraries to multi-device
architectures. Putting our library to the test, we accelerate an iterative
non-linear image reconstruction algorithm for real-time magnetic resonance
imaging using multiple GPUs. We achieve a speed-up of about 1.7 using 2 GPUs
and reach a final speed-up of 2.1 with 4 GPUs. These promising results lead us
to conclude that multi-GPU systems are a viable solution for real-time MRI
reconstruction as well as signal-processing applications in general.
|
[
{
"version": "v1",
"created": "Mon, 7 Jan 2013 14:50:24 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Schaetz",
"Sebastian",
""
],
[
"Uecker",
"Martin",
""
]
] |
new_dataset
| 0.995322 |
1407.0614
|
Ivo Vigan
|
George Rabanca and Ivo Vigan
|
Covering the Boundary of a Simple Polygon with Geodesic Unit Disks
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of covering the boundary of a simple polygon on n
vertices using the minimum number of geodesic unit disks. We present an O(n
\log^2 n+k) time 2-approximation algorithm for finding the centers of the
disks, with k denoting the number centers found by the algorithm.
|
[
{
"version": "v1",
"created": "Wed, 2 Jul 2014 15:32:58 GMT"
},
{
"version": "v2",
"created": "Thu, 3 Jul 2014 03:58:33 GMT"
},
{
"version": "v3",
"created": "Sun, 9 Nov 2014 23:05:20 GMT"
},
{
"version": "v4",
"created": "Sun, 1 Mar 2015 18:17:55 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Rabanca",
"George",
""
],
[
"Vigan",
"Ivo",
""
]
] |
new_dataset
| 0.99186 |
1502.07373
|
Yossef Oren
|
Yossef Oren, Vasileios P. Kemerlis, Simha Sethumadhavan and Angelos D.
Keromytis
|
The Spy in the Sandbox -- Practical Cache Attacks in Javascript
| null | null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the first micro-architectural side-channel attack which runs
entirely in the browser. In contrast to other works in this genre, this attack
does not require the attacker to install any software on the victim's machine
-- to facilitate the attack, the victim needs only to browse to an untrusted
webpage with attacker-controlled content. This makes the attack model highly
scalable and extremely relevant and practical to today's web, especially since
most desktop browsers currently accessing the Internet are vulnerable to this
attack. Our attack, which is an extension of the last-level cache attacks of
Yarom et al., allows a remote adversary recover information belonging to other
processes, other users and even other virtual machines running on the same
physical host as the victim web browser. We describe the fundamentals behind
our attack, evaluate its performance using a high bandwidth covert channel and
finally use it to construct a system-wide mouse/network activity logger.
Defending against this attack is possible, but the required countermeasures can
exact an impractical cost on other benign uses of the web browser and of the
computer.
|
[
{
"version": "v1",
"created": "Wed, 25 Feb 2015 21:25:49 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Mar 2015 22:58:28 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Oren",
"Yossef",
""
],
[
"Kemerlis",
"Vasileios P.",
""
],
[
"Sethumadhavan",
"Simha",
""
],
[
"Keromytis",
"Angelos D.",
""
]
] |
new_dataset
| 0.999444 |
1503.00035
|
Steffen Kopecki
|
Lila Kari, Stavros Konstantinidis, and Steffen Kopecki
|
Transducer Descriptions of DNA Code Properties and Undecidability of
Antimorphic Problems
| null | null | null | null |
cs.FL cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work concerns formal descriptions of DNA code properties, and builds on
previous work on transducer descriptions of classic code properties and on
trajectory descriptions of DNA code properties. This line of research allows us
to give a property as input to an algorithm, in addition to any regular
language, which can then answer questions about the language and the property.
Here we define DNA code properties via transducers and show that this method is
strictly more expressive than that of trajectories, without sacrificing the
efficiency of deciding the satisfaction question. We also show that the
maximality question can be undecidable. Our undecidability results hold not
only for the fixed DNA involution but also for any fixed antimorphic
permutation. Moreover, we also show the undecidability of the antimorphic
version of the Post Corresponding Problem, for any fixed antimorphic
permutation.
|
[
{
"version": "v1",
"created": "Fri, 27 Feb 2015 23:45:25 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Kari",
"Lila",
""
],
[
"Konstantinidis",
"Stavros",
""
],
[
"Kopecki",
"Steffen",
""
]
] |
new_dataset
| 0.953769 |
1503.00071
|
Kamalakar Karlapalem
|
Garima Ahuja and Kamalakar Karlapalem
|
Crowd Congestion and Stampede Management through Multi Robotic Agents
|
Extended version of paper "Managing Multi Robotic Agents to Avoid
Congestion and Stampedes", Garima Ahuja and Kamalakar Karlapalem, to appear
in AAMAS 2015 as a short paper
| null | null | null |
cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crowd management is a complex, challenging and crucial task. Lack of
appropriate management of crowd has, in past, led to many unfortunate stampedes
with significant loss of life. To increase the crowd management efficiency, we
deploy automated real time detection of stampede prone areas. Then, we use
robotic agents to aid the crowd management police in controlling the crowd in
these stampede prone areas. While doing so, we aim for minimum interference by
robotic agents in our environment. Thereby not disturbing the ambiance and
aesthetics of the place. We evaluate the effectiveness of our model in dealing
with difficult scenarios like emergency evacuation and presence of localized
congestion. Lastly, we simulate a multi agent system based on our model and use
it to illustrate the utility of robotic agents for detecting and reducing
congestion.
|
[
{
"version": "v1",
"created": "Sat, 28 Feb 2015 06:06:33 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Ahuja",
"Garima",
""
],
[
"Karlapalem",
"Kamalakar",
""
]
] |
new_dataset
| 0.999538 |
1503.00288
|
Yang Song
|
Yang Song and Robert van Boeschoten
|
Success factors for Crowdfunding founders and funders
|
Proceedings of the 5th International Conference on Collaborative
Innovation Networks COINs15, Tokyo, Japan March 12-14, 2015
(arXiv:1502.01142)
| null | null |
coins15/2015/26
|
cs.CY cs.HC cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Crowdfunding has been used as one of the effective ways for entrepreneurs to
raise funding especially in creative industries. Individuals as well as
organizations are paying more attentions to the emergence of new crowdfunding
platforms. In the Netherlands, the government is also trying to help artists
access financial resources through crowdfunding platforms. This research aims
at discovering the success factors for crowdfunding projects through
crowdfunding platforms from both founders and funders perspective. We designed
our own website for founders and funders to observe crowdfunding behaviors. Our
research will contribute to crowdfunding success factors related to issues of
trust and decision making and provide practical recommendations for
practitioners and researchers.
|
[
{
"version": "v1",
"created": "Sun, 1 Mar 2015 14:44:28 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Song",
"Yang",
""
],
[
"van Boeschoten",
"Robert",
""
]
] |
new_dataset
| 0.983996 |
1503.00366
|
Abir Awad
|
Abir Awad
|
A New Chaos-Based Cryptosystem for Secure Transmitted Images
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel and robust chaos-based cryptosystem for secure
transmitted images and four other versions. In the proposed block
encryption/decryption algorithm, a 2D chaotic map is used to shuffle the image
pixel positions. Then, substitution (confusion) and permutation (diffusion)
operations on every block, with multiple rounds, are combined using two
perturbed chaotic PWLCM maps. The perturbing orbit technique improves the
statistical properties of encrypted images. The obtained error propagation in
various standard cipher block modes demonstrates that the proposed cryptosystem
is suitable to transmit cipher data over a corrupted digital channel. Finally,
to quantify the security level of the proposed cryptosystem, many tests are
performed and experimental results show that the suggested cryptosystem has a
high security level.
|
[
{
"version": "v1",
"created": "Sun, 1 Mar 2015 22:16:40 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Awad",
"Abir",
""
]
] |
new_dataset
| 0.999076 |
1503.00505
|
Chetan Singh Thakur
|
Chetan Singh Thakur, Tara Julia Hamilton, Runchun Wang, Jonathan
Tapson and Andr\'e van Schaik
|
A neuromorphic hardware framework based on population coding
|
In submission to IJCNN2015
| null | null | null |
cs.NE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
In the biological nervous system, large neuronal populations work
collaboratively to encode sensory stimuli. These neuronal populations are
characterised by a diverse distribution of tuning curves, ensuring that the
entire range of input stimuli is encoded. Based on these principles, we have
designed a neuromorphic system called a Trainable Analogue Block (TAB), which
encodes given input stimuli using a large population of neurons with a
heterogeneous tuning curve profile. Heterogeneity of tuning curves is achieved
using random device mismatches in VLSI (Very Large Scale Integration) process
and by adding a systematic offset to each hidden neuron. Here, we present
measurement results of a single test cell fabricated in a 65nm technology to
verify the TAB framework. We have mimicked a large population of neurons by
re-using measurement results from the test cell by varying offset. We thus
demonstrate the learning capability of the system for various regression tasks.
The TAB system may pave the way to improve the design of analogue circuits for
commercial applications, by rendering circuits insensitive to random mismatch
that arises due to the manufacturing process.
|
[
{
"version": "v1",
"created": "Mon, 2 Mar 2015 12:55:54 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Thakur",
"Chetan Singh",
""
],
[
"Hamilton",
"Tara Julia",
""
],
[
"Wang",
"Runchun",
""
],
[
"Tapson",
"Jonathan",
""
],
[
"van Schaik",
"André",
""
]
] |
new_dataset
| 0.953449 |
1503.00524
|
Trista Lin
|
Trista Lin (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes), Herv\'e
Rivano (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes), Fr\'ed\'eric Le
Mou\"el (CITI,CSE)
|
Router deployment of Streetside Parking Sensor Networks in Urban Areas
|
UM - Urban Modelling Symposium, Oct 2014, Lyon, France.
\<http://urbanmodelling.sciencesconf.org/\>
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The deployment of urban infrastructure is very important for urban sensor
applications. In this paper, we studied and introduced the deployment strategy
of wireless on-street parking sensor networks. We defined a multiple-objective
problem with four objectives, and solved them with real street parking map. The
results show two sets of Pareto Front with the minimum energy consumption,
sensing information delay and the amount of deployed routers and gateways. The
result can be considered to provide urban service roadside unit or be taken
into account while designing a deployment algorithm.
|
[
{
"version": "v1",
"created": "Mon, 2 Mar 2015 13:53:09 GMT"
}
] | 2015-03-03T00:00:00 |
[
[
"Lin",
"Trista",
"",
"CITI Insa Lyon / Inria Grenoble Rhône-Alpes"
],
[
"Rivano",
"Hervé",
"",
"CITI Insa Lyon / Inria Grenoble Rhône-Alpes"
],
[
"Mouël",
"Frédéric Le",
"",
"CITI,CSE"
]
] |
new_dataset
| 0.999406 |
1305.5468
|
Stewart Ethier
|
S. N. Ethier and Carlos Gamez
|
A game-theoretic analysis of baccara chemin de fer
|
28 pages
|
Games, 4 (2013) 711-737
| null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Assuming that cards are dealt with replacement from a single deck and that
each of Player and Banker sees the total of his own two-card hand but not its
composition, baccara is a 2 x 2^88 matrix game, which was solved by Kemeny and
Snell in 1957. Assuming that cards are dealt without replacement from a d-deck
shoe and that Banker sees the composition of his own two-card hand while Player
sees only his own total, baccara is a 2 x 2^484 matrix game, which was solved
by Downton and Lockwood in 1975 for d=1,2,...,8. Assuming that cards are dealt
without replacement from a d-deck shoe and that each of Player and Banker sees
the composition of his own two-card hand, baccara is a 2^5 x 2^484 matrix game,
which is solved herein for every positive integer d.
|
[
{
"version": "v1",
"created": "Thu, 23 May 2013 15:47:16 GMT"
}
] | 2015-03-02T00:00:00 |
[
[
"Ethier",
"S. N.",
""
],
[
"Gamez",
"Carlos",
""
]
] |
new_dataset
| 0.998881 |
1410.2031
|
Eike Linn
|
A. Siemon, S. Menzel, R. Waser, E. Linn
|
A Complementary Resistive Switch-based Crossbar Array Adder
|
12 pages, accepted for IEEE Journal on Emerging and Selected Topics
in Circuits and Systems (JETCAS), issue on Computing in Emerging Technologies
| null |
10.1109/JETCAS.2015.2398217
| null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Redox-based resistive switching devices (ReRAM) are an emerging class of
non-volatile storage elements suited for nanoscale memory applications. In
terms of logic operations, ReRAM devices were suggested to be used as
programmable interconnects, large-scale look-up tables or for sequential logic
operations. However, without additional selector devices these approaches are
not suited for use in large scale nanocrossbar memory arrays, which is the
preferred architecture for ReRAM devices due to the minimum area consumption.
To overcome this issue for the sequential logic approach, we recently
introduced a novel concept, which is suited for passive crossbar arrays using
complementary resistive switches (CRSs). CRS cells offer two high resistive
storage states, and thus, parasitic sneak currents are efficiently avoided.
However, until now the CRS-based logic-in-memory approach was only shown to be
able to perform basic Boolean logic operations using a single CRS cell. In this
paper, we introduce two multi-bit adder schemes using the CRS-based
logic-in-memory approach. We proof the concepts by means of SPICE simulations
using a dynamical memristive device model of a ReRAM cell. Finally, we show the
advantages of our novel adder concept in terms of step count and number of
devices in comparison to a recently published adder approach, which applies the
conventional ReRAM-based sequential logic concept introduced by Borghetti et
al.
|
[
{
"version": "v1",
"created": "Wed, 8 Oct 2014 09:13:19 GMT"
},
{
"version": "v2",
"created": "Fri, 27 Feb 2015 14:19:55 GMT"
}
] | 2015-03-02T00:00:00 |
[
[
"Siemon",
"A.",
""
],
[
"Menzel",
"S.",
""
],
[
"Waser",
"R.",
""
],
[
"Linn",
"E.",
""
]
] |
new_dataset
| 0.992738 |
1410.8292
|
el Houssein Chouaib Harik
|
El Houssein Chouaib Harik, Fran\c{c}ois Gu\'erin, Fr\'ed\'eric
Guinand, Jean-Fran\c{c}ois Breth\'e, Herv\'e Pelvillain
|
A Decentralized Interactive Architecture for Aerial and Ground Mobile
Robots Cooperation
|
Submitted to 2015 International Conference on Control, Automation and
Robotics (ICCAR)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a novel decentralized interactive architecture for aerial
and ground mobile robots cooperation. The aerial mobile robot is used to
provide a global coverage during an area inspection, while the ground mobile
robot is used to provide a local coverage of ground features. We include a
human-in-the-loop to provide waypoints for the ground mobile robot to progress
safely in the inspected area. The aerial mobile robot follows continuously the
ground mobile robot in order to always keep it in its coverage view.
|
[
{
"version": "v1",
"created": "Thu, 30 Oct 2014 09:01:57 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Nov 2014 06:00:35 GMT"
},
{
"version": "v3",
"created": "Wed, 25 Feb 2015 21:01:34 GMT"
},
{
"version": "v4",
"created": "Fri, 27 Feb 2015 10:35:57 GMT"
}
] | 2015-03-02T00:00:00 |
[
[
"Harik",
"El Houssein Chouaib",
""
],
[
"Guérin",
"François",
""
],
[
"Guinand",
"Frédéric",
""
],
[
"Brethé",
"Jean-François",
""
],
[
"Pelvillain",
"Hervé",
""
]
] |
new_dataset
| 0.999066 |
1411.2649
|
Philipp Richter
|
Philipp Richter and Mark Allman and Randy Bush and Vern Paxson
|
A Primer on IPv4 Scarcity
|
ACM CCR 45(2), 11 pages, editorial contribution
|
ACM Computer Communication Review 45(2), April 2015
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the ongoing exhaustion of free address pools at the registries serving
the global demand for IPv4 address space, scarcity has become reality. Networks
in need of address space can no longer get more address allocations from their
respective registries.
In this work we frame the fundamentals of the IPv4 address exhaustion
phenomena and connected issues. We elaborate on how the current ecosystem of
IPv4 address space has evolved since the standardization of IPv4, leading to
the rather complex and opaque scenario we face today. We outline the evolution
in address space management as well as address space use patterns, identifying
key factors of the scarcity issues. We characterize the possible solution space
to overcome these issues and open the perspective of address blocks as virtual
resources, which involves issues such as differentiation between address
blocks, the need for resource certification, and issues arising when
transferring address space between networks.
|
[
{
"version": "v1",
"created": "Mon, 10 Nov 2014 22:18:47 GMT"
},
{
"version": "v2",
"created": "Mon, 23 Feb 2015 20:01:56 GMT"
},
{
"version": "v3",
"created": "Fri, 27 Feb 2015 16:47:07 GMT"
}
] | 2015-03-02T00:00:00 |
[
[
"Richter",
"Philipp",
""
],
[
"Allman",
"Mark",
""
],
[
"Bush",
"Randy",
""
],
[
"Paxson",
"Vern",
""
]
] |
new_dataset
| 0.98978 |
1502.07762
|
Tomasz Rutkowski
|
Tomasz M. Rutkowski, Hiromu Mori, Takumi Kodama, and Hiroyuki Shinoda
|
Airborne Ultrasonic Tactile Display Brain-computer Interface -- A Small
Robotic Arm Online Control Study
|
2 pages, 1 figure, accepted for 10th AEARU Workshop on Computer
Science and Web Technology February 25-27, 2015, University of Tsukuba, Japan
| null | null | null |
cs.HC cs.RO q-bio.NC
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We report on an extended robot control application of a contact-less and
airborne ultrasonic tactile display (AUTD) stimulus-based brain-computer
interface (BCI) paradigm, which received last year The Annual BCI Research
Award 2014. In the award winning human communication augmentation paradigm the
six palm positions are used to evoke somatosensory brain responses, in order to
define a novel contactless tactile BCI. An example application of a small robot
management is also presented in which the users control a small robot online.
|
[
{
"version": "v1",
"created": "Fri, 30 Jan 2015 08:21:10 GMT"
}
] | 2015-03-02T00:00:00 |
[
[
"Rutkowski",
"Tomasz M.",
""
],
[
"Mori",
"Hiromu",
""
],
[
"Kodama",
"Takumi",
""
],
[
"Shinoda",
"Hiroyuki",
""
]
] |
new_dataset
| 0.998365 |
1502.07796
|
Matilde Marcolli
|
Matilde Marcolli and Alexander Port
|
Graph Grammars, Insertion Lie Algebras, and Quantum Field Theory
|
19 pages, LaTeX, 3 jpeg figures
| null | null | null |
cs.FL math-ph math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graph grammars extend the theory of formal languages in order to model
distributed parallelism in theoretical computer science. We show here that to
certain classes of context-free and context-sensitive graph grammars one can
associate a Lie algebra, whose structure is reminiscent of the insertion Lie
algebras of quantum field theory. We also show that the Feynman graphs of
quantum field theories are graph languages generated by a theory dependent
graph grammar.
|
[
{
"version": "v1",
"created": "Fri, 27 Feb 2015 01:16:54 GMT"
}
] | 2015-03-02T00:00:00 |
[
[
"Marcolli",
"Matilde",
""
],
[
"Port",
"Alexander",
""
]
] |
new_dataset
| 0.977428 |
1502.07812
|
Kwangsu Lee
|
Kwangsu Lee, Jong Hwan Park, Dong Hoon Lee
|
Anonymous HIBE with Short Ciphertexts: Full Security in Prime Order
Groups
|
31 pages, 1 figure
|
Designs, Codes and Cryptography, vol. 74, no. 2, pp. 395-425, Feb.
2015
|
10.1007/s10623-013-9868-6
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anonymous Hierarchical Identity-Based Encryption (HIBE) is an extension of
Identity-Based Encryption (IBE), and it provides not only a message hiding
property but also an identity hiding property. Anonymous HIBE schemes can be
applicable to anonymous communication systems and public key encryption systems
with keyword searching. However, previous anonymous HIBE schemes have some
disadvantages that the security was proven in the weaker model, the size of
ciphertexts is not short, or the construction was based on composite order
bilinear groups. In this paper, we propose the first efficient anonymous HIBE
scheme with short ciphertexts in prime order (asymmetric) bilinear groups, and
prove its security in the full model with an efficient reduction. To achieve
this, we use the dual system encryption methodology of Waters. We also present
the benchmark results of our scheme by measuring the performance of our
implementation.
|
[
{
"version": "v1",
"created": "Fri, 27 Feb 2015 03:31:04 GMT"
}
] | 2015-03-02T00:00:00 |
[
[
"Lee",
"Kwangsu",
""
],
[
"Park",
"Jong Hwan",
""
],
[
"Lee",
"Dong Hoon",
""
]
] |
new_dataset
| 0.998518 |
1502.07999
|
Christopher Blake
|
Christopher Blake and Frank R. Kschischang
|
On the Energy Complexity of LDPC Decoder Circuits
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is shown that in a sequence of randomly generated bipartite configurations
with number of left nodes approaching infinity, the probability that a
particular configuration in the sequence has a minimum bisection width
proportional to the number of vertices in the configuration approaches $1$ so
long as a sufficient condition on the node degree distribution is satisfied.
This graph theory result implies an almost sure $\Omega\left(n^{2}\right)$
scaling rule for the energy of capacity-approaching LDPC decoder circuits that
directly instantiate their Tanner Graphs and are generated according to a
uniform configuration model, where $n$ is the block length of the code. For a
sequence of circuits that have a full set of check nodes but do not necessarily
directly instantiate a Tanner graph, this implies an
$\Omega\left(n^{1.5}\right)$ scaling rule. In another theorem, it is shown that
all (as opposed to almost all) capacity-approaching LDPC decoding circuits that
directly implement their Tanner graphs must have energy that scales as
$\Omega\left(n\left(\log n\right)^{2}\right)$. These results further imply
scaling rules for the energy of LDPC decoder circuits as a function of gap to
capacity.
|
[
{
"version": "v1",
"created": "Fri, 27 Feb 2015 18:37:09 GMT"
}
] | 2015-03-02T00:00:00 |
[
[
"Blake",
"Christopher",
""
],
[
"Kschischang",
"Frank R.",
""
]
] |
new_dataset
| 0.971715 |
1312.0387
|
Pradeesha Ashok
|
Pradeesha Ashok, Sathish Govindarajan
|
On Strong Centerpoints
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $P$ be a set of $n$ points in $\mathbb{R}^d$ and $\mathcal{F}$ be a
family of geometric objects. We call a point $x \in P$ a strong centerpoint of
$P$ w.r.t $\mathcal{F}$ if $x$ is contained in all $F \in \mathcal{F}$ that
contains more than $cn$ points from $P$, where $c$ is a fixed constant. A
strong centerpoint does not exist even when $\mathcal{F}$ is the family of
halfspaces in the plane. We prove the existence of strong centerpoints with
exact constants for convex polytopes defined by a fixed set of orientations. We
also prove the existence of strong centerpoints for abstract set systems with
bounded intersection.
|
[
{
"version": "v1",
"created": "Mon, 2 Dec 2013 09:32:36 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Feb 2015 10:05:12 GMT"
}
] | 2015-02-27T00:00:00 |
[
[
"Ashok",
"Pradeesha",
""
],
[
"Govindarajan",
"Sathish",
""
]
] |
new_dataset
| 0.992886 |
1502.07449
|
Lan Shi
|
Lan Shi, Christopher Soell, Andreas Baenisch, Robert Weigel, J\"urgen
Seiler, Thomas Ussmueller
|
Concept for a CMOS Image Sensor Suited for Analog Image Pre-Processing
|
Presented at DATE Friday Workshop on Heterogeneous Architectures and
Design Methods for Embedded Image Systems (HIS 2015) (arXiv:1502.07241)
| null | null |
DATEHIS/2015/04
|
cs.ET cs.AR cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A concept for a novel CMOS image sensor suited for analog image
pre-processing is presented in this paper. As an example, an image restoration
algorithm for reducing image noise is applied as image pre-processing in the
analog domain. To supply low-latency data input for analog image preprocessing,
the proposed concept for a CMOS image sensor offers a new sensor signal
acquisition method in 2D. In comparison to image pre-processing in the digital
domain, the proposed analog image pre-processing promises an improved image
quality. Furthermore, the image noise at the stage of analog sensor signal
acquisition can be used to select the most effective restoration algorithm
applied to the analog circuit due to image processing prior to the A/D
converter.
|
[
{
"version": "v1",
"created": "Thu, 26 Feb 2015 06:18:04 GMT"
}
] | 2015-02-27T00:00:00 |
[
[
"Shi",
"Lan",
""
],
[
"Soell",
"Christopher",
""
],
[
"Baenisch",
"Andreas",
""
],
[
"Weigel",
"Robert",
""
],
[
"Seiler",
"Jürgen",
""
],
[
"Ussmueller",
"Thomas",
""
]
] |
new_dataset
| 0.960314 |
1502.07608
|
Jose Gracia
|
Steffen Brinkmann, Jose Gracia
|
CppSs -- a C++ Library for Efficient Task Parallelism
|
accepted for publication at INFOCOMP, work-in-progress track
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the C++ library CppSs (C++ super-scalar), which provides efficient
task-parallelism without the need for special compilers or other software. Any
C++ compiler that supports C++11 is sufficient. CppSs features different
directionality clauses for defining data dependencies. While the variable
argument lists of the taskified functions are evaluated at compile time, the
resulting task dependencies are fixed by the runtime value of the arguments and
are thus analysed at runtime. With CppSs, we provide task-parallelism using
merely native C++.
|
[
{
"version": "v1",
"created": "Thu, 26 Feb 2015 15:56:50 GMT"
}
] | 2015-02-27T00:00:00 |
[
[
"Brinkmann",
"Steffen",
""
],
[
"Gracia",
"Jose",
""
]
] |
new_dataset
| 0.992294 |
1502.05873
|
Matthew Hague
|
Matthew Hague and Vincent Penelle
|
Annotated Stack Trees
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Annotated pushdown automata provide an automaton model of higher-order
recursion schemes, which may in turn be used to model higher-order programs for
the purposes of verification. We study Ground Annotated Stack Tree Rewrite
Systems -- a tree rewrite system where each node is labelled by the
configuration of an annotated pushdown automaton. This allows the modelling of
fork and join constructs in higher-order programs and is a generalisation of
higher-order stack trees recently introduced by Penelle.
We show that, given a regular set of annotated stack trees, the set of trees
that can reach this set is also regular, and constructible in n-EXPTIME for an
order-n system, which is optimal. We also show that our construction can be
extended to allow a global state through which unrelated nodes of the tree may
communicate, provided the number of communications is subject to a fixed bound.
|
[
{
"version": "v1",
"created": "Fri, 20 Feb 2015 13:54:39 GMT"
},
{
"version": "v2",
"created": "Wed, 25 Feb 2015 17:48:03 GMT"
}
] | 2015-02-26T00:00:00 |
[
[
"Hague",
"Matthew",
""
],
[
"Penelle",
"Vincent",
""
]
] |
new_dataset
| 0.973755 |
1502.07026
|
Suhas Ranganath
|
Suhas Ranganath, JJ Thiagarajan, KN Ramamurthy, Shuang Hu, Mahesh
Banavar, and Andreas Spanias
|
Undergraduate Signal Processing Laboratories for the Android Operating
System
|
ASEE (American Society for Engineering Education) 2012
| null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a DSP simulation environment that will enable students to perform
laboratory exercises using Android mobile devices and tablets. Due to the
pervasive nature of the mobile technology, education applications designed for
mobile devices have the potential to stimulate student interest in addition to
offering convenient access and interaction capabilities. This paper describes a
portable signal processing laboratory for the Android platform. This software
is intended to be an educational tool for students and instructors in DSP, and
signals and systems courses. The development of Android JDSP (A-JDSP) is
carried out using the Android SDK, which is a Java-based open source
development platform. The proposed application contains basic DSP functions for
convolution, sampling, FFT, filtering and frequency domain analysis, with a
convenient graphical user interface. A description of the architecture,
functions and planned assessments are presented in this paper.
|
[
{
"version": "v1",
"created": "Wed, 25 Feb 2015 01:30:31 GMT"
}
] | 2015-02-26T00:00:00 |
[
[
"Ranganath",
"Suhas",
""
],
[
"Thiagarajan",
"JJ",
""
],
[
"Ramamurthy",
"KN",
""
],
[
"Hu",
"Shuang",
""
],
[
"Banavar",
"Mahesh",
""
],
[
"Spanias",
"Andreas",
""
]
] |
new_dataset
| 0.999019 |
1502.07288
|
Ananda Theertha Suresh
|
Mehryar Mohri, Michael Riley, Ananda Theertha Suresh
|
Automata and Graph Compression
|
15 pages
| null | null | null |
cs.IT cs.DS cs.FL math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a theoretical framework for the compression of automata, which are
widely used in speech processing and other natural language processing tasks.
The framework extends to graph compression. Similar to stationary ergodic
processes, we formulate a probabilistic process of graph and automata
generation that captures real world phenomena and provide a universal
compression scheme LZA for this probabilistic model. Further, we show that LZA
significantly outperforms other compression techniques such as gzip and the
UNIX compress command for several synthetic and real data sets.
|
[
{
"version": "v1",
"created": "Wed, 25 Feb 2015 18:30:36 GMT"
}
] | 2015-02-26T00:00:00 |
[
[
"Mohri",
"Mehryar",
""
],
[
"Riley",
"Michael",
""
],
[
"Suresh",
"Ananda Theertha",
""
]
] |
new_dataset
| 0.981673 |
1502.07326
|
Vilem Vychodil
|
Vilem Vychodil
|
Rational fuzzy attribute logic
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a logic for reasoning with if-then formulas which involve
constants for rational truth degrees from the unit interval. We introduce
graded semantic and syntactic entailment of formulas. We prove the logic is
complete in Pavelka style and depending on the choice of structure of truth
degrees, the logic is a decidable fragment of the Rational Pavelka logic (RPL)
or the Rational Product Logic (R{\Pi}L). We also present a characterization of
the entailment based on least models and study related closure structures.
|
[
{
"version": "v1",
"created": "Wed, 25 Feb 2015 20:19:03 GMT"
}
] | 2015-02-26T00:00:00 |
[
[
"Vychodil",
"Vilem",
""
]
] |
new_dataset
| 0.98881 |
1502.06757
|
Lse Lse
|
Mart\'in Dias (INRIA Lille - Nord Europe), Alberto Bacchelli, Georgios
Gousios, Damien Cassou (INRIA Lille - Nord Europe), St\'ephane Ducasse (INRIA
Lille - Nord Europe)
|
Untangling Fine-Grained Code Changes
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
After working for some time, developers commit their code changes to a
version control system. When doing so, they often bundle unrelated changes
(e.g., bug fix and refactoring) in a single commit, thus creating a so-called
tangled commit. Sharing tangled commits is problematic because it makes review,
reversion, and integration of these commits harder and historical analyses of
the project less reliable. Researchers have worked at untangling existing
commits, i.e., finding which part of a commit relates to which task. In this
paper, we contribute to this line of work in two ways: (1) A publicly available
dataset of untangled code changes, created with the help of two developers who
accurately split their code changes into self contained tasks over a period of
four months; (2) a novel approach, EpiceaUntangler, to help developers share
untangled commits (aka. atomic commits) by using fine-grained code change
information. EpiceaUntangler is based and tested on the publicly available
dataset, and further evaluated by deploying it to 7 developers, who used it for
2 weeks. We recorded a median success rate of 91% and average one of 75%, in
automatically creating clusters of untangled fine-grained code changes.
|
[
{
"version": "v1",
"created": "Tue, 24 Feb 2015 10:50:13 GMT"
}
] | 2015-02-25T00:00:00 |
[
[
"Dias",
"Martín",
"",
"INRIA Lille - Nord Europe"
],
[
"Bacchelli",
"Alberto",
"",
"INRIA Lille - Nord Europe"
],
[
"Gousios",
"Georgios",
"",
"INRIA Lille - Nord Europe"
],
[
"Cassou",
"Damien",
"",
"INRIA Lille - Nord Europe"
],
[
"Ducasse",
"Stéphane",
"",
"INRIA\n Lille - Nord Europe"
]
] |
new_dataset
| 0.998943 |
1502.06810
|
Xavier Gelabert
|
Carles Anton Haro, Luis Castedo Ribas, Javier del Ser Lorente, Armin
Dekorsy, Miguel Egido Cortes, Xavier Gelabert, Lorenza Giupponi, Xavier
Mestre, Jose Monserrat, Carlos Mosquera, Miquel Soriano, Liesbet van der
Perre, Jon Arambarri, Juan Antonio Romo
|
White Paper: Radio y Redes Cognitivas
|
AEI eMOV White Paper, published 04/11/2011, In Spanish
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditionally, two different policies to access the radio spectrum have
coexisted: licensed regulation, whereby the rights to use specific spectral
bands are granted in exclusivity to an individual operator; or unlicensed
regulation, according to which certain spectral bands are declared open for
free use by any operator or individual following specific rules. While these
paradigms have allowed the wireless communications sector to blossom in the
past, in recent years they have evidenced shortcomings and given signs of
exhaustion. For instance, it is quite usual to encounter fully overloaded
mobile communication systems coexisting with unused contiguous spectral bands.
This clearly advocates for a more flexible and dynamic allocation of the
spectrum resources which can only be achieved with the advent of the so-called
cognitive radios and networks. This whitepaper provides an accurate description
of priority research activities and open challenges related to the different
functionalities of cognitive radios and networks. First, we outline the main
open problems related to the theoretical characterization of cognitive radios,
spectrum sensing techniques as well as the optimization of physical layer
functionalities in these networks. Second, we provide a description of the main
research challenges that arise from a system point of view: MAC protocol
optimization, traffic modelling, RRM strategies, routing paradigms or security
issues. Next, we point out other problems related to the practical hardware
implementation of cognitive radios, giving especial emphasis to sensing
capabilities, reconfigurability and cognitive control and management. Finally,
we succinctly report on a number of current activities related to the
standardization of cognitive radio systems.
|
[
{
"version": "v1",
"created": "Tue, 24 Feb 2015 13:45:02 GMT"
}
] | 2015-02-25T00:00:00 |
[
[
"Haro",
"Carles Anton",
""
],
[
"Ribas",
"Luis Castedo",
""
],
[
"Lorente",
"Javier del Ser",
""
],
[
"Dekorsy",
"Armin",
""
],
[
"Cortes",
"Miguel Egido",
""
],
[
"Gelabert",
"Xavier",
""
],
[
"Giupponi",
"Lorenza",
""
],
[
"Mestre",
"Xavier",
""
],
[
"Monserrat",
"Jose",
""
],
[
"Mosquera",
"Carlos",
""
],
[
"Soriano",
"Miquel",
""
],
[
"van der Perre",
"Liesbet",
""
],
[
"Arambarri",
"Jon",
""
],
[
"Romo",
"Juan Antonio",
""
]
] |
new_dataset
| 0.993036 |
1405.0312
|
Piotr Doll\'ar
|
Tsung-Yi Lin, Michael Maire, Serge Belongie, Lubomir Bourdev, Ross
Girshick, James Hays, Pietro Perona, Deva Ramanan, C. Lawrence Zitnick, Piotr
Doll\'ar
|
Microsoft COCO: Common Objects in Context
|
1) updated annotation pipeline description and figures; 2) added new
section describing datasets splits; 3) updated author list
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new dataset with the goal of advancing the state-of-the-art in
object recognition by placing the question of object recognition in the context
of the broader question of scene understanding. This is achieved by gathering
images of complex everyday scenes containing common objects in their natural
context. Objects are labeled using per-instance segmentations to aid in precise
object localization. Our dataset contains photos of 91 objects types that would
be easily recognizable by a 4 year old. With a total of 2.5 million labeled
instances in 328k images, the creation of our dataset drew upon extensive crowd
worker involvement via novel user interfaces for category detection, instance
spotting and instance segmentation. We present a detailed statistical analysis
of the dataset in comparison to PASCAL, ImageNet, and SUN. Finally, we provide
baseline performance analysis for bounding box and segmentation detection
results using a Deformable Parts Model.
|
[
{
"version": "v1",
"created": "Thu, 1 May 2014 21:43:32 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Jul 2014 18:39:56 GMT"
},
{
"version": "v3",
"created": "Sat, 21 Feb 2015 01:48:49 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Lin",
"Tsung-Yi",
""
],
[
"Maire",
"Michael",
""
],
[
"Belongie",
"Serge",
""
],
[
"Bourdev",
"Lubomir",
""
],
[
"Girshick",
"Ross",
""
],
[
"Hays",
"James",
""
],
[
"Perona",
"Pietro",
""
],
[
"Ramanan",
"Deva",
""
],
[
"Zitnick",
"C. Lawrence",
""
],
[
"Dollár",
"Piotr",
""
]
] |
new_dataset
| 0.999837 |
1410.5387
|
M\'aria Svore\v{n}ov\'a
|
Maria Svorenova, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee,
Ivana Cerna, Calin Belta
|
Temporal Logic Control for Stochastic Linear Systems using Abstraction
Refinement of Probabilistic Games
|
Technical report accompanying HSCC'15 paper
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of computing the set of initial states of a dynamical
system such that there exists a control strategy to ensure that the
trajectories satisfy a temporal logic specification with probability 1
(almost-surely). We focus on discrete-time, stochastic linear dynamics and
specifications given as formulas of the Generalized Reactivity(1) fragment of
Linear Temporal Logic over linear predicates in the states of the system. We
propose a solution based on iterative abstraction-refinement, and turn-based
2-player probabilistic games. While the theoretical guarantee of our algorithm
after any finite number of iterations is only a partial solution, we show that
if our algorithm terminates, then the result is the set of satisfying initial
states. Moreover, for any (partial) solution our algorithm synthesizes witness
control strategies to ensure almost-sure satisfaction of the temporal logic
specification. We demonstrate our approach on an illustrative case study.
|
[
{
"version": "v1",
"created": "Mon, 20 Oct 2014 18:45:55 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Oct 2014 12:01:39 GMT"
},
{
"version": "v3",
"created": "Mon, 23 Feb 2015 11:54:41 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Svorenova",
"Maria",
""
],
[
"Kretinsky",
"Jan",
""
],
[
"Chmelik",
"Martin",
""
],
[
"Chatterjee",
"Krishnendu",
""
],
[
"Cerna",
"Ivana",
""
],
[
"Belta",
"Calin",
""
]
] |
new_dataset
| 0.96584 |
1502.06075
|
Weiyao Lin
|
Weiyao Lin, Yuanzhe Chen, Jianxin Wu, Hanli Wang, Bin Sheng, Hongxiang
Li
|
A new network-based algorithm for human activity recognition in video
|
This manuscript is the accepted version for TCSVT (IEEE Transactions
on Circuits and Systems for Video Technology)
|
IEEE Trans. Circuits and Systems for Video Technology, vol. 24,
no. 5, pp. 826-841, 2014
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a new network-transmission-based (NTB) algorithm is proposed
for human activity recognition in videos. The proposed NTB algorithm models the
entire scene as an error-free network. In this network, each node corresponds
to a patch of the scene and each edge represents the activity correlation
between the corresponding patches. Based on this network, we further model
people in the scene as packages while human activities can be modeled as the
process of package transmission in the network. By analyzing these specific
"package transmission" processes, various activities can be effectively
detected. The implementation of our NTB algorithm into abnormal activity
detection and group activity recognition are described in detail in the paper.
Experimental results demonstrate the effectiveness of our proposed algorithm.
|
[
{
"version": "v1",
"created": "Sat, 21 Feb 2015 07:10:02 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Lin",
"Weiyao",
""
],
[
"Chen",
"Yuanzhe",
""
],
[
"Wu",
"Jianxin",
""
],
[
"Wang",
"Hanli",
""
],
[
"Sheng",
"Bin",
""
],
[
"Li",
"Hongxiang",
""
]
] |
new_dataset
| 0.955808 |
1502.06085
|
Hai Jiang
|
Zhou Zhang, Shuai Zhou, and Hai Jiang
|
Opportunistic Cooperative Channel Access in Distributed Wireless
Networks with Decode-and-Forward Relays
| null | null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This letter studies distributed opportunistic channel access in a wireless
network with decode-and-forward relays. All the sources use channel contention
to get transmission opportunity. If a source wins the contention, the channel
state information in the first-hop channel (from the source to its relay) is
estimated, and a decision is made for the winner source to either give up the
transmission opportunity and let all sources start a new contention, or
transmit to the relay. Once the relay gets the traffic, it may have a sequence
of probings of the second-hop channel (from the relay to the destination).
After each probing, if the second-hop channel is good enough, the relay
transmits to the destination and completes the transmission process of the
source; otherwise, the relay decides either to give up and let all sources
start a new contention, or to continue to probe the second-hop channel. The
optimal decision strategies for the two hops are derived in this letter. The
first-hop strategy is a pure-threshold strategy, i.e., when the first-hop
channel signal-to-noise ratio (SNR) is more than a threshold, the winner source
should transmit to the relay, and subsequently the second-hop strategy should
let the relay keep probing the second-hop channel until a good enough
second-hop channel is observed. Simulation results show that our scheme is
beneficial when the second-hop channels have larger average SNR.
|
[
{
"version": "v1",
"created": "Sat, 21 Feb 2015 08:15:37 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Zhang",
"Zhou",
""
],
[
"Zhou",
"Shuai",
""
],
[
"Jiang",
"Hai",
""
]
] |
new_dataset
| 0.999406 |
1502.06177
|
Shai Shalev-Shwartz
|
Shai Shalev-Shwartz
|
SDCA without Duality
| null | null | null | null |
cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stochastic Dual Coordinate Ascent is a popular method for solving regularized
loss minimization for the case of convex losses. In this paper we show how a
variant of SDCA can be applied for non-convex losses. We prove linear
convergence rate even if individual loss functions are non-convex as long as
the expected loss is convex.
|
[
{
"version": "v1",
"created": "Sun, 22 Feb 2015 04:42:01 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Shalev-Shwartz",
"Shai",
""
]
] |
new_dataset
| 0.964928 |
1502.06323
|
Mohsen Mollanoori
|
Mohsen Mollanoori
|
CSMA-SIC: Carrier Sensing with Successive Interference Cancellation
| null | null | null | null |
cs.NI cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Successive interference cancellation (SIC) is a physical layer technique that
enables the decoders to decode multiple simultaneously transmitted signals. The
complicated model of SIC requires careful design of the MAC protocol and
accurate adjustment of transmission parameters. We propose a new MAC protocol,
known as CSMA-SIC, that employs the multi-packet reception capability of SIC.
The proposed protocol adjusts the transmission probabilities to achieve
throughput optimality.
|
[
{
"version": "v1",
"created": "Mon, 23 Feb 2015 05:56:17 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Mollanoori",
"Mohsen",
""
]
] |
new_dataset
| 0.998095 |
1502.06344
|
Erik Rodner
|
Clemens-Alexander Brust, Sven Sickert, Marcel Simon, Erik Rodner,
Joachim Denzler
|
Convolutional Patch Networks with Spatial Prior for Road Detection and
Urban Scene Understanding
|
VISAPP 2015 paper
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Classifying single image patches is important in many different applications,
such as road detection or scene understanding. In this paper, we present
convolutional patch networks, which are convolutional networks learned to
distinguish different image patches and which can be used for pixel-wise
labeling. We also show how to incorporate spatial information of the patch as
an input to the network, which allows for learning spatial priors for certain
categories jointly with an appearance model. In particular, we focus on road
detection and urban scene understanding, two application areas where we are
able to achieve state-of-the-art results on the KITTI as well as on the
LabelMeFacade dataset.
Furthermore, our paper offers a guideline for people working in the area and
desperately wandering through all the painstaking details that render training
CNs on image patches extremely difficult.
|
[
{
"version": "v1",
"created": "Mon, 23 Feb 2015 08:47:37 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Brust",
"Clemens-Alexander",
""
],
[
"Sickert",
"Sven",
""
],
[
"Simon",
"Marcel",
""
],
[
"Rodner",
"Erik",
""
],
[
"Denzler",
"Joachim",
""
]
] |
new_dataset
| 0.998474 |
1502.06378
|
Loet Leydesdorff
|
Loet Leydesdorff
|
Bibliometrics/Citation networks
|
preprint version of: George A. Barnett (Ed.), The Encyclopedia of
Social Networks, Sage, 2011, pp. 72-74
| null | null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In addition to shaping social networks, for example, in terms of
co-authorship relations, scientific communications induce and reproduce
cognitive structures. Scientific literature is intellectually organized in
terms of disciplines and specialties; these structures are reproduced and
networked reflexively by making references to the authors, concepts and texts
embedded in these literatures. The concept of a cognitive structure was
introduced in social network analysis (SNA) in 1987 by David Krackhardt, but
the focus in SNA has hitherto been on cognition as a psychological attribute of
human agency. In bibliometrics, and in science and technology studies (STS)
more generally, socio-cognitive structures refer to intellectual organization
at the supra-individual level. This intellectual organization emerges and is
reproduced by the collectives of authors who are organized not only in terms of
inter-personal relations, but also more abstractly in terms of codes of
communication that are field-specific. Citations can serve as indicators of
this codification process.
|
[
{
"version": "v1",
"created": "Mon, 23 Feb 2015 10:40:42 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Leydesdorff",
"Loet",
""
]
] |
new_dataset
| 0.974213 |
1502.06422
|
Kerim Goztepe
|
Kerim Goztepe
|
Recommendations on Future Operational Environments Command Control and
Cyber Security
| null | null |
10.13140/2.1.2406.1121
| null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
It is a well-known fact that today a nation's telecommunication networks,
critical infrastructure, and information systems are vulnerable to growing
number of attacks in cyberspace. Cyber space contains very different problems
involving various sets of threats, targets and costs. Cyber security is not
only problem of banking, communication or transportation. It also threatens
core systems of army as command control. Some significant recommendations on
command control (C2) and cyber security have been suggested for army computing
environment in this paper. This study addresses priorities of "what should be
done for a better army cyber future" to cyber security researchers.
|
[
{
"version": "v1",
"created": "Mon, 23 Feb 2015 13:37:29 GMT"
}
] | 2015-02-24T00:00:00 |
[
[
"Goztepe",
"Kerim",
""
]
] |
new_dataset
| 0.971211 |
1305.0127
|
Dominique Perrin
|
Val\'erie Berth\'e, Clelia De Felice, Francesco Dolce, Julien Leroy,
Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
|
The finite index basis property
|
arXiv admin note: text overlap with arXiv:1011.5369, arXiv:1305.0120
|
J. Pure Appl. Algebra, 219 (2015) 2521-2537
| null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe in this paper a connection between bifix codes, symbolic
dynamical systems and free groups. This is in the spirit of the connection
established previously for the symbolic systems corresponding to Sturmian
words. We introduce a class of sets of factors of an infinite word with linear
factor complexity containing Sturmian sets and regular interval exchange sets,
namemly the class of tree sets. We prove as a main result that for a uniformly
recurrent tree set $F$, a finite bifix code $X$ on the alphabet $A$ is
$F$-maximal of $F$-degree $d$ if and only if it is the basis of a subgroup of
index $d$ of the free group on $A$.
|
[
{
"version": "v1",
"created": "Wed, 1 May 2013 09:09:18 GMT"
},
{
"version": "v2",
"created": "Sun, 25 Aug 2013 10:51:09 GMT"
},
{
"version": "v3",
"created": "Tue, 27 Aug 2013 16:08:43 GMT"
},
{
"version": "v4",
"created": "Fri, 27 Dec 2013 09:00:30 GMT"
},
{
"version": "v5",
"created": "Sun, 26 Jan 2014 17:21:23 GMT"
},
{
"version": "v6",
"created": "Sat, 2 Aug 2014 15:41:48 GMT"
},
{
"version": "v7",
"created": "Fri, 20 Feb 2015 18:23:45 GMT"
}
] | 2015-02-23T00:00:00 |
[
[
"Berthé",
"Valérie",
""
],
[
"De Felice",
"Clelia",
""
],
[
"Dolce",
"Francesco",
""
],
[
"Leroy",
"Julien",
""
],
[
"Perrin",
"Dominique",
""
],
[
"Reutenauer",
"Christophe",
""
],
[
"Rindone",
"Giuseppina",
""
]
] |
new_dataset
| 0.979514 |
1502.05784
|
Terry Ferrett
|
Terry Ferrett and Matthew C. Valenti
|
LDPC Code Design for Noncoherent Physical Layer Network Coding
|
Six pages, submitted to 2015 IEEE International Conference on
Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work considers optimizing LDPC codes in the physical-layer network coded
two-way relay channel using noncoherent FSK modulation. The error-rate
performance of channel decoding at the relay node during the multiple-access
phase was improved through EXIT-based optimization of Tanner graph variable
node degree distributions. Codes drawn from the DVB-S2 and WiMAX standards were
used as a basis for design and performance comparison. The computational
complexity characteristics of the standard codes were preserved in the
optimized codes by maintaining the extended irregular repeat-accumulate (eIRA).
The relay receiver performance was optimized considering two modulation orders
M = {4, 8} using iterative decoding in which the decoder and demodulator refine
channel estimates by exchanging information. The code optimization procedure
yielded unique optimized codes for each case of modulation order and available
channel state information. Performance of the standard and optimized codes were
measured using Monte Carlo simulation in the flat Rayleigh fading channel, and
error rate improvements up to 1.2 dB are demonstrated depending on system
parameters.
|
[
{
"version": "v1",
"created": "Fri, 20 Feb 2015 06:13:58 GMT"
}
] | 2015-02-23T00:00:00 |
[
[
"Ferrett",
"Terry",
""
],
[
"Valenti",
"Matthew C.",
""
]
] |
new_dataset
| 0.989996 |
1502.05838
|
Claudia Schon
|
Ulrich Furbach, Claudia Schon, Frieder Stolzenburg
|
Automated Reasoning for Robot Ethics
|
arXiv admin note: substantial text overlap with arXiv:1411.4823
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Deontic logic is a very well researched branch of mathematical logic and
philosophy. Various kinds of deontic logics are considered for different
application domains like argumentation theory, legal reasoning, and acts in
multi-agent systems. In this paper, we show how standard deontic logic can be
used to model ethical codes for multi-agent systems. Furthermore we show how
Hyper, a high performance theorem prover, can be used to prove properties of
these ethical codes.
|
[
{
"version": "v1",
"created": "Fri, 20 Feb 2015 11:38:58 GMT"
}
] | 2015-02-23T00:00:00 |
[
[
"Furbach",
"Ulrich",
""
],
[
"Schon",
"Claudia",
""
],
[
"Stolzenburg",
"Frieder",
""
]
] |
new_dataset
| 0.997137 |
1409.6277
|
Luigi Laura
|
Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis
|
2-Vertex Connectivity in Directed Graphs
|
arXiv admin note: substantial text overlap with arXiv:1407.3041
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We complement our study of 2-connectivity in directed graphs, by considering
the computation of the following 2-vertex-connectivity relations: We say that
two vertices v and w are 2-vertex-connected if there are two internally
vertex-disjoint paths from v to w and two internally vertex-disjoint paths from
w to v. We also say that v and w are vertex-resilient if the removal of any
vertex different from v and w leaves v and w in the same strongly connected
component. We show how to compute the above relations in linear time so that we
can report in constant time if two vertices are 2-vertex-connected or if they
are vertex-resilient. We also show how to compute in linear time a sparse
certificate for these relations, i.e., a subgraph of the input graph that has
O(n) edges and maintains the same 2-vertex-connectivity and vertex-resilience
relations as the input graph, where n is the number of vertices.
|
[
{
"version": "v1",
"created": "Mon, 22 Sep 2014 18:48:27 GMT"
},
{
"version": "v2",
"created": "Thu, 19 Feb 2015 07:51:16 GMT"
}
] | 2015-02-20T00:00:00 |
[
[
"Georgiadis",
"Loukas",
""
],
[
"Italiano",
"Giuseppe F.",
""
],
[
"Laura",
"Luigi",
""
],
[
"Parotsidis",
"Nikos",
""
]
] |
new_dataset
| 0.987331 |
1502.05450
|
Jean-Marc Alliot
|
Jean-Marc Alliot
|
The (Final) countdown
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Countdown game is one of the oldest TV show running in the world. It
started broadcasting in 1972 on the french television and in 1982 on British
channel 4, and it has been running since in both countries. The game, while
extremely popular, never received any serious scientific attention, probably
because it seems too simple at first sight. We present in this article an
in-depth analysis of the numbers round of the countdown game. This includes a
complexity analysis of the game, an analysis of existing algorithms, the
presentation of a new algorithm that increases resolution speed by a factor of
20. It also includes some leads on how to turn the game into a more difficult
one, both for a human player and for a computer, and even to transform it into
a probably undecidable problem.
|
[
{
"version": "v1",
"created": "Thu, 19 Feb 2015 00:41:56 GMT"
}
] | 2015-02-20T00:00:00 |
[
[
"Alliot",
"Jean-Marc",
""
]
] |
new_dataset
| 0.999237 |
1502.05558
|
Pierre-\'Etienne Meunier
|
Florent Becker, Pierre-\'Etienne Meunier
|
It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly)
more Powerful than Competition
| null | null | null | null |
cs.CG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a strict separation between the class of "mismatch free"
self-assembly systems and general aTAM systems. Mismatch free systems are those
systems in which concurrently grown parts must always agree with each other.
Tile self-assembly is a model of the formation of crystal growth, in which a
large number of particles concurrently and selectively stick to each other,
forming complex shapes and structures. It is useful in nanotechnologies, and
more generally in the understanding of these processes, ubiquitous in natural
systems.
The other property of the local assembly process known to change the power of
the model is cooperation between two tiles to attach another. We show that
disagreement (mismatches) and cooperation are incomparable: neither can be used
to simulate the other one.
The fact that mismatches are a hard property is especially surprising, since
no known, explicit construction of a computational device in tile assembly uses
mismatches, except for the recent construction of an intrinsically universal
tileset, i.e. a tileset capable of simulating any other tileset up to
rescaling. This work shows how to use intrinsic universality in a systematic
way to highlight the essence of different features of tile assembly.
Moreover, even the most recent experimental realizations do not use
competition, which, in view of our results, suggests that a large part of the
natural phenomena behind DNA self-assembly remains to be understood
experimentally.
|
[
{
"version": "v1",
"created": "Thu, 19 Feb 2015 13:03:48 GMT"
}
] | 2015-02-20T00:00:00 |
[
[
"Becker",
"Florent",
""
],
[
"Meunier",
"Pierre-Étienne",
""
]
] |
new_dataset
| 0.991758 |
1501.04894
|
Arindam Pal
|
Arindam Pal and Sushmita Ruj
|
CITEX: A new citation index to measure the relative importance of
authors and papers in scientific publications
|
Accepted for publication in IEEE International Conference on
Communications (ICC) 2015
| null | null | null |
cs.DL cs.DM cs.IR cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Evaluating the performance of researchers and measuring the impact of papers
written by scientists is the main objective of citation analysis. Various
indices and metrics have been proposed for this. In this paper, we propose a
new citation index CITEX, which gives normalized scores to authors and papers
to determine their rankings. To the best of our knowledge, this is the first
citation index which simultaneously assigns scores to both authors and papers.
Using these scores, we can get an objective measure of the reputation of an
author and the impact of a paper.
We model this problem as an iterative computation on a publication graph,
whose vertices are authors and papers, and whose edges indicate which author
has written which paper. We prove that this iterative computation converges in
the limit, by using a powerful theorem from linear algebra. We run this
algorithm on several examples, and find that the author and paper scores match
closely with what is suggested by our intuition. The algorithm is theoretically
sound and runs very fast in practice. We compare this index with several
existing metrics and find that CITEX gives far more accurate scores compared to
the traditional metrics.
|
[
{
"version": "v1",
"created": "Tue, 20 Jan 2015 17:44:59 GMT"
}
] | 2015-02-19T00:00:00 |
[
[
"Pal",
"Arindam",
""
],
[
"Ruj",
"Sushmita",
""
]
] |
new_dataset
| 0.993975 |
1502.05275
|
Stefano Bilotta
|
Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani
|
Cross-bifix-free sets in two dimensions
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A bidimensional bifix (in short bibifix) of a square matrix T is a square
submatrix of T which occurs in the top-left and bottom-right corners of T. This
allows us to extend the definition of bifix-free words and cross-bifix-free set
of words to bidimensional structures. In this paper we exhaustively generate
all the bibifix-free square matrices and we construct a particular
non-expandable cross-bibifix-free set of square matrices. Moreover, we provide
a Gray code for listing this set.
|
[
{
"version": "v1",
"created": "Wed, 18 Feb 2015 15:33:43 GMT"
}
] | 2015-02-19T00:00:00 |
[
[
"Barcucci",
"Elena",
""
],
[
"Bernini",
"Antonio",
""
],
[
"Bilotta",
"Stefano",
""
],
[
"Pinzani",
"Renzo",
""
]
] |
new_dataset
| 0.995506 |
1502.05321
|
Dmitry Namiot
|
Dmitry Namiot, Manfred Sneps-Sneppe
|
On Mobile Bluetooth Tags
|
submitted to FRUCT-17 conference (http://fruct.org)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new approach for hyper-local data sharing and delivery
on the base of discoverable Bluetooth nodes. Our approach allows customers to
associate user-defined data with network nodes and use a special mobile
application (context-aware browser) for presenting this information to mobile
users in proximity. Alternatively, mobile services can request and share local
data in M2M applications rely on network proximity. Bluetooth nodes in cars are
among the best candidates for the role of the bearing nodes.
|
[
{
"version": "v1",
"created": "Wed, 18 Feb 2015 17:56:06 GMT"
}
] | 2015-02-19T00:00:00 |
[
[
"Namiot",
"Dmitry",
""
],
[
"Sneps-Sneppe",
"Manfred",
""
]
] |
new_dataset
| 0.996907 |
1502.04321
|
Stefan Schmid
|
Doris Schi\"oberg, Fabian Schneider, Stefan Schmid, Steve Uhlig, Anja
Feldmann
|
Evolution of Directed Triangle Motifs in the Google+ OSN
| null | null | null | null |
cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motifs are a fundamental building block and distinguishing feature of
networks. While characteristic motif distribution have been found in many
networks, very little is known today about the evolution of network motifs.
This paper studies the most important motifs in social networks, triangles, and
how directed triangle motifs change over time. Our chosen subject is one of the
largest Online Social Networks, Google+. Google+ has two distinguishing
features that make it particularly interesting: (1) it is a directed network,
which yields a rich set of triangle motifs, and (2) it is a young and fast
evolving network, whose role in the OSN space is still not fully understood.
For the purpose of this study, we crawled the network over a time period of six
weeks, collecting several snapshots. We find that some triangle types display
significant dynamics, e.g., for some specific initial types, up to 20% of the
instances evolve to other types. Due to the fast growth of the OSN in the
observed time period, many new triangles emerge. We also observe that many
triangles evolve into less-connected motifs (with less edges), suggesting that
growth also comes with pruning. We complement the topological study by also
considering publicly available user profile data (mostly geographic locations).
The corresponding results shed some light on the semantics of the triangle
motifs. Indeed, we find that users in more symmetric triangle motifs live
closer together, indicating more personal relationships. In contrast,
asymmetric links in motifs often point to faraway users with a high in-degree
(celebrities).
|
[
{
"version": "v1",
"created": "Sun, 15 Feb 2015 15:11:50 GMT"
},
{
"version": "v2",
"created": "Tue, 17 Feb 2015 07:06:21 GMT"
}
] | 2015-02-18T00:00:00 |
[
[
"Schiöberg",
"Doris",
""
],
[
"Schneider",
"Fabian",
""
],
[
"Schmid",
"Stefan",
""
],
[
"Uhlig",
"Steve",
""
],
[
"Feldmann",
"Anja",
""
]
] |
new_dataset
| 0.997556 |
1502.04774
|
EPTCS
|
Ugo Dal Lago (Universit\`a di Bologna & INRIA), Margherita Zorzi
(Universit\`a di Verona)
|
Wave-Style Token Machines and Quantum Lambda Calculi
|
In Proceedings LINEARITY 2014, arXiv:1502.04419
|
EPTCS 176, 2015, pp. 64-78
|
10.4204/EPTCS.176.6
| null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Particle-style token machines are a way to interpret proofs and programs,
when the latter are written following the principles of linear logic. In this
paper, we show that token machines also make sense when the programs at hand
are those of a simple quantum lambda-calculus with implicit qubits. This,
however, requires generalising the concept of a token machine to one in which
more than one particle travel around the term at the same time. The presence of
multiple tokens is intimately related to entanglement and allows us to give a
simple operational semantics to the calculus, coherently with the principles of
quantum computation.
|
[
{
"version": "v1",
"created": "Tue, 17 Feb 2015 02:27:51 GMT"
}
] | 2015-02-18T00:00:00 |
[
[
"Lago",
"Ugo Dal",
"",
"Università di Bologna & INRIA"
],
[
"Zorzi",
"Margherita",
"",
"Università di Verona"
]
] |
new_dataset
| 0.999427 |
1502.04801
|
Sonal Shrivastava
|
Sonal Shrivastava, Chetan Agrawal and Anurag Jain
|
An IDS scheme against Black hole Attack to Secure AOMDV Routing in MANET
|
14 pages,6 figures, International Journal on AdHoc Networking Systems
(IJANS) Vol. 5, No. 1, January 2015. arXiv admin note: text overlap with
arXiv:1203.3729 by other authors
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Mobile Ad hoc Network (MANET) all the nodes are freely moves in the
absence of without ant centralized coordination system. Due to that the
attackers or malicious nodes are easily affected that kind of network and
responsible for the routing misbehavior. The routing is network is mandatory to
deliver data in between source and destination. In this research we work on
security field in MANET and proposed a novel security scheme against routing
misbehavior through Black hole attack. The Ad hoc On demand Multipath Routing
(AOMDV) protocol is consider for routing and also to improves the routing
quality as compare to single path routing protocol. The attacker is affected
all the possible paths that is selected by sender for sending data in network.
The malicious nodes are forward optimistic reply at the time of routing by that
their identification is also a complex procedure. The proposed Intrusion
Detection System (IDS) scheme is identified the attacker information through
hop count mechanism. The routing information of actual data is reached to which
intermediate node and the next hop information is exist at that node is confirm
by IDS scheme. The black hole attacker node Identification (ID) is forward in
network by that in future attacker is not participating in routing procedure.
The proposed security scheme detects and provides the deterrence against
routing misbehavior through malicious attack. Here we compare the routing
performance of AOMDV, Attack and IDS scheme. The performance of normal
multipath routing and proposed IDS scheme is almost equal. The attacker has
degrades the whole routing performance but observed that in presence of
attacker, routing misbehavior is completely block by the proposed IDS scheme
and recovers 95 % of data as compare to normal routing. Keywords- -AOMDV,
MANET, IDS, Black hole attack, Routing misbehavior.
|
[
{
"version": "v1",
"created": "Sat, 14 Feb 2015 14:35:36 GMT"
}
] | 2015-02-18T00:00:00 |
[
[
"Shrivastava",
"Sonal",
""
],
[
"Agrawal",
"Chetan",
""
],
[
"Jain",
"Anurag",
""
]
] |
new_dataset
| 0.954566 |
1502.04885
|
Guillaume Pitel
|
Guillaume Pitel and Geoffroy Fouquier
|
Count-Min-Log sketch: Approximately counting with approximate counters
|
7 pages, 3 figures. Some preliminary notes can be found on
http://blog.guillaume-pitel.fr/
| null | null | null |
cs.IR cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Count-Min Sketch is a widely adopted algorithm for approximate event counting
in large scale processing. However, the original version of the
Count-Min-Sketch (CMS) suffers of some deficiences, especially if one is
interested by the low-frequency items, such as in text-mining related tasks.
Several variants of CMS have been proposed to compensate for the high relative
error for low-frequency events, but the proposed solutions tend to correct the
errors instead of preventing them. In this paper, we propose the Count-Min-Log
sketch, which uses logarithm-based, approximate counters instead of linear
counters to improve the average relative error of CMS at constant memory
footprint.
|
[
{
"version": "v1",
"created": "Tue, 17 Feb 2015 13:17:17 GMT"
}
] | 2015-02-18T00:00:00 |
[
[
"Pitel",
"Guillaume",
""
],
[
"Fouquier",
"Geoffroy",
""
]
] |
new_dataset
| 0.994993 |
1502.04898
|
Miko{\l}aj Boja\'nczyk
|
Miko{\l}aj Boja\'nczyk
|
Recognisable languages over monads
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The principle behind algebraic language theory for various kinds of
structures, such as words or trees, is to use a compositional function from the
structures into a finite set. To talk about compositionality, one needs some
way of composing structures into bigger structures. It so happens that category
theory has an abstract concept for this, namely a monad. The goal of this paper
is to propose monads as a unifying framework for discussing existing algebras
and designing new algebras.
|
[
{
"version": "v1",
"created": "Tue, 17 Feb 2015 14:07:12 GMT"
}
] | 2015-02-18T00:00:00 |
[
[
"Bojańczyk",
"Mikołaj",
""
]
] |
new_dataset
| 0.997676 |
1201.4050
|
Gema M. Diaz-Toca
|
J. G. Alc\'azar and G. M. D\'iaz-Toca
|
On the Shape of Curves that are Rational in Polar Coordinates
| null | null |
10.1016/j.cagd.2012.09.001
| null |
cs.SC cs.CG cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we provide a computational approach to the shape of curves
which are rational in polar coordinates, i.e. which are defined by means of a
parametrization (r(t),\theta(t)) where both r(t),\theta(t) are rational
functions. Our study includes theoretical aspects on the shape of these curves,
and algorithmic results which eventually lead to an algorithm for plotting the
"interesting parts" of the curve, i.e. the parts showing the main geometrical
features of it. On the theoretical side, we prove that these curves, with the
exceptions of lines and circles, cannot be algebraic (in cartesian
coordinates), we characterize the existence of infinitely many
self-intersections, and we connect this with certain phenomena which are not
possible in the algebraic world, namely the existence of limit circles, limit
points, or spiral branches. On the practical side, we provide an algorithm
which has been implemented in the computer algebra system Maple to visualize
this kind of curves. Our implementation makes use (and improves some aspects
of) the command polarplot currently available in Maple for plotting curves in
polar form.
|
[
{
"version": "v1",
"created": "Thu, 19 Jan 2012 13:01:17 GMT"
},
{
"version": "v2",
"created": "Tue, 29 May 2012 10:54:28 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Alcázar",
"J. G.",
""
],
[
"Díaz-Toca",
"G. M.",
""
]
] |
new_dataset
| 0.997337 |
1306.1264
|
Emiliano De Cristofaro
|
Erman Ayday and Emiliano De Cristofaro and Jean-Pierre Hubaux and Gene
Tsudik
|
The Chills and Thrills of Whole Genome Sequencing
|
A slightly different version of this article appears in IEEE Computer
Magazine, Vol. 48, No. 2, February 2015, under the title "Whole Genome
Sequencing: Revolutionary Medicine or Privacy Nightmare"
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, Whole Genome Sequencing (WGS) evolved from a
futuristic-sounding research project to an increasingly affordable technology
for determining complete genome sequences of complex organisms, including
humans. This prompts a wide range of revolutionary applications, as WGS
promises to improve modern healthcare and provide a better understanding of the
human genome -- in particular, its relation to diseases and response to
treatments. However, this progress raises worrisome privacy and ethical issues,
since, besides uniquely identifying its owner, the genome contains a treasure
trove of highly personal and sensitive information. In this article, after
summarizing recent advances in genomics, we discuss some important privacy
issues associated with human genomic information and identify a number of
particularly relevant research challenges.
|
[
{
"version": "v1",
"created": "Wed, 5 Jun 2013 23:08:03 GMT"
},
{
"version": "v2",
"created": "Thu, 18 Jul 2013 18:07:57 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Sep 2013 15:06:37 GMT"
},
{
"version": "v4",
"created": "Thu, 24 Oct 2013 11:56:53 GMT"
},
{
"version": "v5",
"created": "Mon, 16 Feb 2015 17:36:21 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Ayday",
"Erman",
""
],
[
"De Cristofaro",
"Emiliano",
""
],
[
"Hubaux",
"Jean-Pierre",
""
],
[
"Tsudik",
"Gene",
""
]
] |
new_dataset
| 0.999089 |
1308.6778
|
Benjamin Niedermann
|
Therese Biedl, Thomas Bl\"asius, Benjamin Niedermann, Martin
N\"ollenburg, Roman Prutkin, Ignaz Rutter
|
Using ILP/SAT to determine pathwidth, visibility representations, and
other grid-based graph drawings
|
Full version of GD 2013 paper
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a simple and versatile formulation of grid-based graph
representation problems as an integer linear program (ILP) and a corresponding
SAT instance. In a grid-based representation vertices and edges correspond to
axis-parallel boxes on an underlying integer grid; boxes can be further
constrained in their shapes and interactions by additional problem-specific
constraints. We describe a general d-dimensional model for grid representation
problems. This model can be used to solve a variety of NP-hard graph problems,
including pathwidth, bandwidth, optimum st-orientation, area-minimal (bar-k)
visibility representation, boxicity-k graphs and others. We implemented
SAT-models for all of the above problems and evaluated them on the Rome graphs
collection. The experiments show that our model successfully solves NP-hard
problems within few minutes on small to medium-size Rome graphs.
|
[
{
"version": "v1",
"created": "Fri, 30 Aug 2013 15:46:54 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Feb 2015 10:16:18 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Biedl",
"Therese",
""
],
[
"Bläsius",
"Thomas",
""
],
[
"Niedermann",
"Benjamin",
""
],
[
"Nöllenburg",
"Martin",
""
],
[
"Prutkin",
"Roman",
""
],
[
"Rutter",
"Ignaz",
""
]
] |
new_dataset
| 0.999701 |
1402.0121
|
Alexandre Maurer
|
Alexandre Maurer (EPFL), S\'ebastien Tixeuil (LINCS, NPA), Xavier
D\'efago (JAIST)
|
Reliable Communication in a Dynamic Network in the Presence of Byzantine
Faults
| null | null | null | null |
cs.DC cs.DS cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the following problem: two nodes want to reliably communicate in
a dynamic multihop network where some nodes have been compromised, and may have
a totally arbitrary and unpredictable behavior. These nodes are called
Byzantine. We consider the two cases where cryptography is available and not
available. We prove the necessary and sufficient condition (that is, the
weakest possible condition) to ensure reliable communication in this context.
Our proof is constructive, as we provide Byzantine-resilient algorithms for
reliable communication that are optimal with respect to our impossibility
results. In a second part, we investigate the impact of our conditions in three
case studies: participants interacting in a conference, robots moving on a grid
and agents in the subway. Our simulations indicate a clear benefit of using our
algorithms for reliable communication in those contexts.
|
[
{
"version": "v1",
"created": "Sat, 1 Feb 2014 20:01:57 GMT"
},
{
"version": "v2",
"created": "Wed, 12 Feb 2014 07:53:09 GMT"
},
{
"version": "v3",
"created": "Tue, 27 May 2014 18:55:43 GMT"
},
{
"version": "v4",
"created": "Mon, 16 Feb 2015 17:34:12 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Maurer",
"Alexandre",
"",
"EPFL"
],
[
"Tixeuil",
"Sébastien",
"",
"LINCS, NPA"
],
[
"Défago",
"Xavier",
"",
"JAIST"
]
] |
new_dataset
| 0.9736 |
1412.6605
|
Reza Rawassizadeh
|
Stefan Foell, Gerd Kortuem, Reza Rawassizadeh, Marcus Handte, Umer
Iqbal, Pedro Marron
|
Micro-Navigation for Urban Bus Passengers: Using the Internet of Things
to Improve the Public Transport Experience
|
Urb-IoT 2014
| null | null | null |
cs.HC cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Public bus services are widely deployed in cities around the world because
they provide cost-effective and economic public transportation. However, from a
passenger point of view urban bus systems can be complex and difficult to
navigate, especially for disadvantaged users, i.e. tourists, novice users,
older people, and people with impaired cognitive or physical abilities. We
present Urban Bus Navigator (UBN), a reality-aware urban navigation system for
bus passengers with the ability to recognize and track the physical public
transport infrastructure such as buses. Unlike traditional location-aware
mobile transport applications, UBN acts as a true navigation assistant for
public transport users. Insights from a six-month long trial in Madrid indicate
that UBN removes barriers for public transport usage and has a positive impact
on how people feel about public transport journeys.
|
[
{
"version": "v1",
"created": "Sat, 20 Dec 2014 05:10:20 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Feb 2015 04:19:28 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Foell",
"Stefan",
""
],
[
"Kortuem",
"Gerd",
""
],
[
"Rawassizadeh",
"Reza",
""
],
[
"Handte",
"Marcus",
""
],
[
"Iqbal",
"Umer",
""
],
[
"Marron",
"Pedro",
""
]
] |
new_dataset
| 0.998871 |
1502.01885
|
Chunlei Liu
|
Haode Yan and Chunlei Liu
|
Linearized Reed-Solomon codes and linearized Wenger graphs
|
8 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A codeword is associated to a linearized polynomial. The weight distribution
of the codewords is determined as the linearized polynomial varies in a family
of fixed degree. There is a corresponding result on Wenger graphs from
linearized polynomials.
|
[
{
"version": "v1",
"created": "Fri, 6 Feb 2015 13:56:39 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Feb 2015 07:14:28 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Yan",
"Haode",
""
],
[
"Liu",
"Chunlei",
""
]
] |
new_dataset
| 0.993835 |
1502.02817
|
Matthias Walter
|
Michele Conforti and Volker Kaibel and Matthias Walter and Stefan
Weltge
|
Subgraph Polytopes and Independence Polytopes of Count Matroids
|
8 pages, update to fix error
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given an undirected graph, the non-empty subgraph polytope is the convex hull
of the characteristic vectors of pairs (F, S) where S is a non-empty subset of
nodes and F is a subset of the edges with both endnodes in S. We obtain a
strong relationship between the non-empty subgraph polytope and the spanning
forest polytope. We further show that these polytopes provide polynomial size
extended formulations for independence polytopes of count matroids, which
generalizes recent results obtained by Iwata et al. referring to sparsity
matroids. As a byproduct, we obtain new lower bounds on the extension
complexity of the spanning forest polytope in terms of extension complexities
of independence polytopes of these matroids.
|
[
{
"version": "v1",
"created": "Tue, 10 Feb 2015 09:08:42 GMT"
},
{
"version": "v2",
"created": "Mon, 16 Feb 2015 13:10:23 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Conforti",
"Michele",
""
],
[
"Kaibel",
"Volker",
""
],
[
"Walter",
"Matthias",
""
],
[
"Weltge",
"Stefan",
""
]
] |
new_dataset
| 0.999109 |
1502.04210
|
Virgilio Sison
|
Bryan Hernandez and Virgilio Sison
|
Grassmannian Codes as Lifts of Matrix Codes Derived as Images of Linear
Block Codes over Finite Fields
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes
over the non-commutative matrix ring of $2 \times 2$ matrices over the prime
field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of
linear block codes over the Galois field $GF(p^2)$ endowed with the Hamming
metric. When seen as rank metric codes, this family of matrix codes satisfies
the Singleton bound and thus are maximum rank distance codes, which are then
lifted to form a special class of subspace codes, the Grassmannian codes, that
meet the anticode bound. These so-called anticode-optimal Grassmannian codes
are associated in some way with complete graphs. New examples of these maximum
rank distance codes and anticode-optimal Grassmannian codes are given.
|
[
{
"version": "v1",
"created": "Sat, 14 Feb 2015 13:30:57 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Hernandez",
"Bryan",
""
],
[
"Sison",
"Virgilio",
""
]
] |
new_dataset
| 0.998997 |
1502.04244
|
Nian Li
|
Maosheng Xiong and Nian Li
|
Optimal cyclic codes with generalized Niho type zeroes and the weight
distribution
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we extend the works \cite{gegeng2,XLZD} further in two
directions and compute the weight distribution of these cyclic codes under more
relaxed conditions. It is interesting to note that many cyclic codes in the
family are optimal and have only a few non-zero weights. Besides using similar
ideas from \cite{gegeng2,XLZD}, we carry out some subtle manipulation of
certain exponential sums.
|
[
{
"version": "v1",
"created": "Sat, 14 Feb 2015 21:15:43 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Xiong",
"Maosheng",
""
],
[
"Li",
"Nian",
""
]
] |
new_dataset
| 0.960166 |
1502.04328
|
Benson Joeris
|
Benson Joeris, Isabel Urrutia, Jorge Urrutia
|
Geometric Spanning Cycles in Bichromatic Point Sets
| null | null |
10.1007/s00373-015-1545-2
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a set of points in the plane each colored either red or blue, we find
non-self-intersecting geometric spanning cycles of the red points and of the
blue points such that each edge of the red spanning cycle is crossed at most
three times by the blue spanning cycle and vice-versa.
|
[
{
"version": "v1",
"created": "Sun, 15 Feb 2015 16:18:40 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Joeris",
"Benson",
""
],
[
"Urrutia",
"Isabel",
""
],
[
"Urrutia",
"Jorge",
""
]
] |
new_dataset
| 0.997874 |
1502.04544
|
Zhengjun Cao
|
Zhengjun Cao and Lihua Liu
|
A Note On Boneh-Gentry-Waters Broadcast Encryption Scheme and Its Like
|
6 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Key establishment is any process whereby a shared secret key becomes
available to two or more parties, for subsequent cryptographic use such as
symmetric-key encryption. Though it is widely known that the primitive of
encryption is different from key establishment, we find some researchers have
confused the two primitives. In this note, we shall clarify the fundamental
difference between the two primitives, and point out that the
Boneh-Gentry-Waters broadcast encryption scheme and its like are key
establishment schemes, not encryption schemes.
|
[
{
"version": "v1",
"created": "Mon, 16 Feb 2015 14:19:53 GMT"
}
] | 2015-02-17T00:00:00 |
[
[
"Cao",
"Zhengjun",
""
],
[
"Liu",
"Lihua",
""
]
] |
new_dataset
| 0.998108 |
1502.03872
|
JongHun Jung
|
JongHun Jung, Hwan-Kuk Kim, Soojin Yoon
|
Malicious web script-based cyber attack protection technology
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recent web-based cyber attacks are evolving into a new form of attacks such
as private information theft and DDoS attack exploiting JavaScript within a web
page. These attacks can be made just by accessing a web site without
distribution of malicious codes and infection. Script-based cyber attacks are
hard to detect with traditional security equipments such as Firewall and IPS
because they inject malicious scripts in a response message for a normal web
request. Furthermore, they are hard to trace because attacks such as DDoS can
be made just by visiting a web page. Due to these reasons, it is expected that
they could result in direct damages and great ripple effects. To cope with
these issues, in this article, a proposal is made for techniques that are used
to detect malicious scripts through real-time web content analysis and to
automatically generate detection signatures for malicious JavaScript.
|
[
{
"version": "v1",
"created": "Fri, 13 Feb 2015 02:19:25 GMT"
}
] | 2015-02-16T00:00:00 |
[
[
"Jung",
"JongHun",
""
],
[
"Kim",
"Hwan-Kuk",
""
],
[
"Yoon",
"Soojin",
""
]
] |
new_dataset
| 0.999054 |
1502.03573
|
Jacques Sakarovitch
|
Jacques Sakarovitch (LTCI)
|
Automata and rational expressions
| null | null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This text is an extended version of the chapter 'Automata and rational
expressions' in the AutoMathA Handbook that will appear soon, published by the
European Science Foundation and edited by JeanEricPin.
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2015 09:26:05 GMT"
}
] | 2015-02-13T00:00:00 |
[
[
"Sakarovitch",
"Jacques",
"",
"LTCI"
]
] |
new_dataset
| 0.999369 |
1502.03641
|
Abdulsalam Yassine Dr.
|
Abdulsalam Yassine
|
A Wavelength Broker for Markets of Competing Optical Transport Networks
|
6 pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The current trend in optical networks is to open the entire wholesale market
to competition. As a result, we will see, instead of a single big market
player, optical transport networks competing with each other to attract
customer demand. This paper presents a wavelength broker who acts on behalf of
enterprises, web host companies, financial firm etc. to buy certain number of
wavelengths from such market. We present the system model, the interaction
protocol and provide analysis of the competition. The simulation results of a
business scenario are also recorded in the paper
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2015 13:06:16 GMT"
}
] | 2015-02-13T00:00:00 |
[
[
"Yassine",
"Abdulsalam",
""
]
] |
new_dataset
| 0.997567 |
1502.03654
|
Paul de Kerret
|
Paul de Kerret and David Gesbert and Umer Salim
|
Regularized ZF in Cooperative Broadcast Channels under Distributed CSIT:
A Large System Analysis
|
Extended version of an ISIT 2015 submission. Addition of the proofs
omitted due to space constraint
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Obtaining accurate Channel State Information (CSI) at the transmitters (TX)
is critical to many cooperation schemes such as Network MIMO, Interference
Alignment etc. Practical CSI feedback and limited backhaul-based sharing
inevitably creates degradations of CSI which are specific to each TX, giving
rise to a distributed form of CSI. In the Distributed CSI (D-CSI) broadcast
channel setting, the various TXs design elements of the precoder based on their
individual estimates of the global multiuser channel matrix, which intuitively
degrades performance when compared with the commonly used centralized CSI
assumption. This paper tackles this challenging scenario and presents a first
analysis of the rate performance for the distributed CSI multi-TX broadcast
channel setting, in the large number of antenna regime. Using Random Matrix
Theory (RMT) tools, we derive deterministic equivalents of the Signal to
Interference plus Noise Ratio (SINR) for the popular regularized Zero-Forcing
(ZF) precoder, allowing to unveil the price of distributedness for such
cooperation methods.
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2015 13:41:57 GMT"
}
] | 2015-02-13T00:00:00 |
[
[
"de Kerret",
"Paul",
""
],
[
"Gesbert",
"David",
""
],
[
"Salim",
"Umer",
""
]
] |
new_dataset
| 0.991398 |
1502.03678
|
Ragaad AlTarawneh
|
Ragaad AlTarawneh, Jens Bauer, Nicole Menck, Shah Rukh Humayoun, Achim
Ebert
|
assistME: A Platform for Assisting Engineers in Maintaining the Factory
Pipeline
|
7 pages, 3 figures, MOBILEng/2014/02
| null | null |
MOBILEng/2014/02
|
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this position paper, we present our approach of utilizing mobile devices
(i.e., mobile phones and tablets) for assisting engineers and experts in
understanding and maintaining the factory pipelines. For this, we present a
platform, called assistME, that is composed of three main components: the
assistME Server, the assistME mobile infrastructure, and the co-assistME
collaborative environment. In order to get full utilization of the assistME
platform, we assume that an initial setup is made in the factory in such a way
that it is equipped with different sensors to collect data about specific
events in the factory pipeline together with the corresponding locations of
these events. The assistME Server works as a central control unit in the
platform and collects data from the installed sensors in the factory pipeline.
In the case of any unexpected behavior or any critical situation in the factory
pipeline, notification and other details are sent to the related group of
engineers and experts through the assistME mobile app. Further, the co-assistME
collaborative environment, equipped with a large shared screen and multiple
mobile devices, helps the engineers and experts to collaborate with to
understand and analyze the current situation in the factory pipeline in order
to maintain it accurately.
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2015 14:40:01 GMT"
}
] | 2015-02-13T00:00:00 |
[
[
"AlTarawneh",
"Ragaad",
""
],
[
"Bauer",
"Jens",
""
],
[
"Menck",
"Nicole",
""
],
[
"Humayoun",
"Shah Rukh",
""
],
[
"Ebert",
"Achim",
""
]
] |
new_dataset
| 0.996354 |
1502.03772
|
Zubair Nabi Zubair Nabi
|
Zubair Nabi
|
A Story of Suo Motos, Judicial Activism, and Article 184 (3)
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The synergy between Big Data and Open Data has the potential to revolutionize
information access in the developing world. Following this mantra, we present
the analysis of more than a decade worth of open judgements and orders from the
Supreme Court of Pakistan. Our overarching goal is to discern the presence of
judicial activism in the country in the wake of the Lawyers' Movement. Using
Apache Spark as the processing engine we analyze hundreds of unstructured PDF
documents to sketch the evolution and various organs of judicial activism in
Pakistan since 2009. Our results show that the judiciary has indeed been
pursuing matters of public interest, especially those that pertain to the
fundamental rights of the citizens. Furthermore, we show how the size of the
presiding bench in a case and citations of Articles from the Constitution and
prior judgements can aid in classifying legal judgements. Throughout the
analysis we also highlight the challenges that anyone who aims to apply Big
Data techniques to Open Data will face. We hope that this work will be one in a
series of community efforts to use Open Data as a lens to analyze real-world
events and phenomena in the developing world.
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2015 19:02:30 GMT"
}
] | 2015-02-13T00:00:00 |
[
[
"Nabi",
"Zubair",
""
]
] |
new_dataset
| 0.998812 |
1502.03158
|
Haitham Bou Ammar PhD
|
Rasul Tutunov, Haitham Bou Ammar, Ali Jadbabaie
|
A Fast Distributed Solver for Symmetric Diagonally Dominant Linear
Equations
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a fast distributed solver for linear equations
given by symmetric diagonally dominant M-Matrices. Our approach is based on a
distributed implementation of the parallel solver of Spielman and Peng by
considering a specific approximated inverse chain which can be computed
efficiently in a distributed fashion. Representing the system of equations by a
graph $\mathbb{G}$, the proposed distributed algorithm is capable of attaining
$\epsilon$-close solutions (for arbitrary $\epsilon$) in time proportional to
$n^{3}$ (number of nodes in $\mathbb{G}$), ${\alpha}$ (upper bound on the size
of the R-Hop neighborhood), and $\frac{{W}_{max}}{{W}_{min}}$ (maximum and
minimum weight of edges in $\mathbb{G}$).
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2015 00:32:28 GMT"
}
] | 2015-02-12T00:00:00 |
[
[
"Tutunov",
"Rasul",
""
],
[
"Ammar",
"Haitham Bou",
""
],
[
"Jadbabaie",
"Ali",
""
]
] |
new_dataset
| 0.955586 |
1502.03203
|
David Budden
|
Josiah Walker, Trent Houliston, Brendan Annable, Alex Biddulph, Jake
Fountain, Mitchell Metcalfe, Anita Sugo, Monica Olejniczak, Stephan K.
Chalup, Robert A.R. King, Alexandre Mendes and Peter Turner
|
The NUbots Team Description Paper 2015
|
RoboCup 2015 team description paper. arXiv admin note: substantial
text overlap with arXiv:1403.6946
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The NUbots are an interdisciplinary RoboCup team from The University of
Newcastle, Australia. The team has a history of strong contributions in the
areas of machine learning and computer vision. The NUbots have participated in
RoboCup leagues since 2002, placing first several times in the past. In 2014
the NUbots also partnered with the University of Newcastle Mechatronics
Laboratory to participate in the RobotX Marine Robotics Challenge, which
resulted in several new ideas and improvements to the NUbots vision system for
RoboCup. This paper summarizes the history of the NUbots team, describes the
roles and research of the team members, gives an overview of the NUbots'
robots, their software system, and several associated research projects.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2015 07:05:51 GMT"
}
] | 2015-02-12T00:00:00 |
[
[
"Walker",
"Josiah",
""
],
[
"Houliston",
"Trent",
""
],
[
"Annable",
"Brendan",
""
],
[
"Biddulph",
"Alex",
""
],
[
"Fountain",
"Jake",
""
],
[
"Metcalfe",
"Mitchell",
""
],
[
"Sugo",
"Anita",
""
],
[
"Olejniczak",
"Monica",
""
],
[
"Chalup",
"Stephan K.",
""
],
[
"King",
"Robert A. R.",
""
],
[
"Mendes",
"Alexandre",
""
],
[
"Turner",
"Peter",
""
]
] |
new_dataset
| 0.998577 |
1502.03407
|
Gokay Saldamli
|
Gokay Saldamli, Richard Chow and Hongxia Jin
|
Albatross: a Privacy-Preserving Location Sharing System
|
12 Pages, Extended version of ASIACCS 2015 paper
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Social networking services are increasingly accessed through mobile devices.
This trend has prompted services such as Facebook and Google+ to incorporate
location as a de facto feature of user interaction. At the same time, services
based on location such as Foursquare and Shopkick are also growing as
smartphone market penetration increases. In fact, this growth is happening
despite concerns (growing at a similar pace) about security and third-party use
of private location information (e.g., for advertising). Nevertheless, service
providers have been unwilling to build truly private systems in which they do
not have access to location information. In this paper, we describe an
architecture and a trial implementation of a privacy-preserving location
sharing system called Albatross. The system protects location information from
the service provider and yet enables fine-grained location-sharing. One main
feature of the system is to protect an individual's social network structure.
The pattern of location sharing preferences towards contacts can reveal this
structure without any knowledge of the locations themselves. Albatross protects
locations sharing preferences through protocol unification and masking.
Albatross has been implemented as a standalone solution, but the technology can
also be integrated into location-based services to enhance privacy.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2015 19:03:28 GMT"
}
] | 2015-02-12T00:00:00 |
[
[
"Saldamli",
"Gokay",
""
],
[
"Chow",
"Richard",
""
],
[
"Jin",
"Hongxia",
""
]
] |
new_dataset
| 0.993445 |
1502.01504
|
Davide Carboni
|
Davide Carboni
|
Feedback based Reputation on top of the Bitcoin Blockchain
|
10 pages, 4 figures, 20 references
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The ability to assess the reputation of a member in a web community is a need
addressed in many different ways according to the many different stages in
which the nature of communities has evolved over time. In the case of
reputation of goods/services suppliers, the solutions available to prevent the
feedback abuse are generally reliable but centralized under the control of few
big Internet companies. In this paper we show how a decentralized and
distributed feedback management system can be built on top of the Bitcoin
blockchain
|
[
{
"version": "v1",
"created": "Thu, 5 Feb 2015 11:17:53 GMT"
},
{
"version": "v2",
"created": "Tue, 10 Feb 2015 15:56:46 GMT"
}
] | 2015-02-11T00:00:00 |
[
[
"Carboni",
"Davide",
""
]
] |
new_dataset
| 0.988487 |
1502.02799
|
Yisong Wang
|
Yisong Wang
|
On Forgetting in Tractable Propositional Fragments
|
27 pages
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distilling from a knowledge base only the part that is relevant to a subset
of alphabet, which is recognized as forgetting, has attracted extensive
interests in AI community. In standard propositional logic, a general algorithm
of forgetting and its computation-oriented investigation in various fragments
whose satisfiability are tractable are still lacking. The paper aims at filling
the gap. After exploring some basic properties of forgetting in propositional
logic, we present a resolution-based algorithm of forgetting for CNF fragment,
and some complexity results about forgetting in Horn, renamable Horn, q-Horn,
Krom, DNF and CNF fragments of propositional logic.
|
[
{
"version": "v1",
"created": "Tue, 10 Feb 2015 07:05:56 GMT"
}
] | 2015-02-11T00:00:00 |
[
[
"Wang",
"Yisong",
""
]
] |
new_dataset
| 0.997425 |
1502.02961
|
Richard Kennaway
|
Richard Kennaway
|
Avatar-independent scripting for real-time gesture animation
|
23 pages, 12 figures. Last revised November 2006
| null | null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When animation of a humanoid figure is to be generated at run-time, instead
of by replaying pre-composed motion clips, some method is required of
specifying the avatar's movements in a form from which the required motion data
can be automatically generated. This form must be of a more abstract nature
than raw motion data: ideally, it should be independent of the particular
avatar's proportions, and both writable by hand and suitable for automatic
generation from higher-level descriptions of the required actions.
We describe here the development and implementation of such a scripting
language for the particular area of sign languages of the deaf, called SiGML
(Signing Gesture Markup Language), based on the existing HamNoSys notation for
sign languages.
We conclude by suggesting how this work may be extended to more general
animation for interactive virtual reality applications.
|
[
{
"version": "v1",
"created": "Tue, 10 Feb 2015 16:03:37 GMT"
}
] | 2015-02-11T00:00:00 |
[
[
"Kennaway",
"Richard",
""
]
] |
new_dataset
| 0.958758 |
1203.1895
|
Alan Guo
|
Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
|
Classic Nintendo Games are (Computationally) Hard
|
36 pages, 36 figures. Fixed some typos. Added NP-hardness results
(with proofs and figures) for American SMB2 and Zelda 2
| null | null | null |
cs.CC cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove NP-hardness results for five of Nintendo's largest video game
franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokemon. Our
results apply to generalized versions of Super Mario Bros. 1-3, The Lost
Levels, and Super Mario World; Donkey Kong Country 1-3; all Legend of Zelda
games; all Metroid games; and all Pokemon role-playing games. In addition, we
prove PSPACE-completeness of the Donkey Kong Country games and several Legend
of Zelda games.
|
[
{
"version": "v1",
"created": "Thu, 8 Mar 2012 19:37:20 GMT"
},
{
"version": "v2",
"created": "Thu, 6 Feb 2014 18:24:15 GMT"
},
{
"version": "v3",
"created": "Sun, 8 Feb 2015 19:45:26 GMT"
}
] | 2015-02-10T00:00:00 |
[
[
"Aloupis",
"Greg",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Guo",
"Alan",
""
],
[
"Viglietta",
"Giovanni",
""
]
] |
new_dataset
| 0.998059 |
1402.0299
|
Panos Rondogiannis
|
Zolt\'an \'Esik and Panos Rondogiannis
|
A Fixed Point Theorem for Non-Monotonic Functions
|
34 pages. Accepted in: Theoretical Computer Science (to appear)
| null | null | null |
cs.LO math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a fixed point theorem for a class of (potentially) non-monotonic
functions over specially structured complete lattices. The theorem has as a
special case the Knaster-Tarski fixed point theorem when restricted to the case
of monotonic functions and Kleene's theorem when the functions are additionally
continuous. From the practical side, the theorem has direct applications in the
semantics of negation in logic programming. In particular, it leads to a more
direct and elegant proof of the least fixed point result of [Rondogiannis and
W.W.Wadge, ACM TOCL 6(2): 441-467 (2005)]. Moreover, the theorem appears to
have potential for possible applications outside the logic programming domain.
|
[
{
"version": "v1",
"created": "Mon, 3 Feb 2014 07:42:10 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Feb 2015 11:57:31 GMT"
},
{
"version": "v3",
"created": "Sat, 7 Feb 2015 14:24:30 GMT"
}
] | 2015-02-10T00:00:00 |
[
[
"Ésik",
"Zoltán",
""
],
[
"Rondogiannis",
"Panos",
""
]
] |
new_dataset
| 0.993129 |
1404.1736
|
Alexios Balatsoukas-Stimming
|
Alexios Balatsoukas-Stimming and Andreas Burg
|
Faulty Successive Cancellation Decoding of Polar Codes for the Binary
Erasure Channel
|
As presented at ISITA 2014
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study faulty successive cancellation decoding of polar codes for the
binary erasure channel. To this end, we introduce a simple erasure-based fault
model and we show that, under this model, polarization does not happen, meaning
that fully reliable communication is not possible at any rate. Moreover, we
provide numerical results for the frame erasure rate and bit erasure rate and
we study an unequal error protection scheme that can significantly improve the
performance of the faulty successive cancellation decoder with negligible
overhead.
|
[
{
"version": "v1",
"created": "Mon, 7 Apr 2014 10:45:28 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Feb 2015 10:35:04 GMT"
}
] | 2015-02-10T00:00:00 |
[
[
"Balatsoukas-Stimming",
"Alexios",
""
],
[
"Burg",
"Andreas",
""
]
] |
new_dataset
| 0.959368 |
1501.07754
|
Xiaoxiong Zhong
|
Yang Qin, Li Li, Xiaohan Zhang, Xiaoxiong Zhong
|
NFCU: A New Friendship-based Routing with Buffer Management in
Opportunistic Networks
|
This paper has been withdrawn by the author due to some crucial
parameters setting error in experiments
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Routing in opportunistic networks is a very important and challenging problem
because opportunistic network utilizes the contact opportunities of mobile
nodes to achieve data communication.Social-based routing uses behavior of human
beings which can form a community with the same interests to deliver the
message.In this paper,we analyze the drawbacks of the original friendship-based
algorithm, which defined social pressure metric to determine nodes'friendship
community, but the metric couldn't distinguish the distribution
characterization of the connection length which has an important impact on the
selection of links with better quality. Further, the existing friendship-based
routing doesn't consider the buffer management, which is vital for routing
design in opportunistic networks. We propose a New Friendship-based routing
with buffer management based on Copy Utility, named NFCU. NFCU algorithm, which
not only considers the contact periods in constructing social pressure metric
to solve the drawbacks of the original friendship-based routing scheme
efficiently, but also considers the buffer management, that can efficiently
determine which copy of the message should be deleted timely according to the
copy utility function. Our proposed strategy can reduce the network overhead
significantly, and increase the message delivery ratio. The extensive
simulation results demonstrate that NFCU performs better than the original
friendship-based routing. Moreover, we compare NFCU with other four
classicalrouting schemes in opportunistic networks in terms of message delivery
ratio, average delay, and comprehensive metric- message delivery
ratio*(1/average delay). The simulation results show that our scheme NFCU can
achieve better performance.
|
[
{
"version": "v1",
"created": "Fri, 30 Jan 2015 12:48:12 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Feb 2015 12:02:13 GMT"
}
] | 2015-02-10T00:00:00 |
[
[
"Qin",
"Yang",
""
],
[
"Li",
"Li",
""
],
[
"Zhang",
"Xiaohan",
""
],
[
"Zhong",
"Xiaoxiong",
""
]
] |
new_dataset
| 0.997959 |
1502.00561
|
Marcelo Cicconet
|
Marcelo Cicconet, Davi Geiger, and Michael Werman
|
Quantum Pairwise Symmetry: Applications in 2D Shape Analysis
|
The paper has been withdrawn since the authors concluded a more
comprehensive study on the choice of parameters needs to be performed
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A pair of rooted tangents -- defining a quantum triangle -- with an
associated quantum wave of spin 1/2 is proposed as the primitive to represent
and compute symmetry. Measures of the spin characterize how "isosceles" or how
"degenerate" these triangles are -- which corresponds to their mirror or
parallel symmetry. We also introduce a complex-valued kernel to model
probability errors in the parameter space, which is more robust to noise and
clutter than the classical model.
|
[
{
"version": "v1",
"created": "Mon, 2 Feb 2015 17:33:55 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Feb 2015 19:38:39 GMT"
}
] | 2015-02-10T00:00:00 |
[
[
"Cicconet",
"Marcelo",
""
],
[
"Geiger",
"Davi",
""
],
[
"Werman",
"Michael",
""
]
] |
new_dataset
| 0.998957 |
1502.02065
|
Saiph Savage
|
Saiph Savage, Andr\'es Monroy-Hern\'andez
|
Participatory Militias: An Analysis of an Armed Movement's Online
Audience
|
Participatory Militias: An Analysis of an Armed Movement's Online
Audience. Saiph Savage, Andres Monroy-Hernandez. CSCW: ACM Conference on
Computer-Supported Cooperative Work 2015
| null |
10.1145/2675133.2675295
| null |
cs.SI cs.CY
|
http://creativecommons.org/licenses/by/3.0/
|
Armed groups of civilians known as "self-defense forces" have ousted the
powerful Knights Templar drug cartel from several towns in Michoacan. This
militia uprising has unfolded on social media, particularly in the "VXM"
("Valor por Michoacan," Spanish for "Courage for Michoacan") Facebook page,
gathering more than 170,000 fans. Previous work on the Drug War has documented
the use of social media for real-time reports of violent clashes. However, VXM
goes one step further by taking on a pro-militia propagandist role, engaging in
two-way communication with its audience. This paper presents a descriptive
analysis of VXM and its audience. We examined nine months of posts, from VXM's
inception until May 2014, totaling 6,000 posts by VXM administrators and more
than 108,000 comments from its audience. We describe the main conversation
themes, post frequency and relationships with offline events and public
figures. We also characterize the behavior of VXM's most active audience
members. Our work illustrates VXM's online mobilization strategies, and how its
audience takes part in defining the narrative of this armed conflict. We
conclude by discussing possible applications of our findings for the design of
future communication technologies.
|
[
{
"version": "v1",
"created": "Fri, 6 Feb 2015 22:09:19 GMT"
}
] | 2015-02-10T00:00:00 |
[
[
"Savage",
"Saiph",
""
],
[
"Monroy-Hernández",
"Andrés",
""
]
] |
new_dataset
| 0.999545 |
1502.02402
|
Matthieu Boutier
|
Matthieu Boutier (PPS), Juliusz Chroboczek (PPS)
|
User-space Multipath UDP in Mosh
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In many network topologies, hosts have multiple IP addresses, and may choose
among multiple network paths by selecting the source and destination addresses
of the packets that they send. This can happen with multihomed hosts (hosts
connected to multiple networks), or in multihomed networks using
source-specific routing. A number of efforts have been made to dynamically
choose between multiple addresses in order to improve the reliability or the
performance of network applications, at the network layer, as in Shim6, or at
the transport layer, as in MPTCP. In this paper, we describe our experience of
implementing dynamic address selection at the application layer within the
Mobile Shell. While our work is specific to Mosh, we hope that it is generic
enough to serve as a basis for designing UDP-based multipath applications or
even more general APIs.
|
[
{
"version": "v1",
"created": "Mon, 9 Feb 2015 09:05:50 GMT"
}
] | 2015-02-10T00:00:00 |
[
[
"Boutier",
"Matthieu",
"",
"PPS"
],
[
"Chroboczek",
"Juliusz",
"",
"PPS"
]
] |
new_dataset
| 0.999834 |
1502.02489
|
Helio M. de Oliveira
|
H.M. de Oliveira, C.M.F. Barros and R.M. Campello de Souza
|
Fourier Codes and Hartley Codes
|
5 pages, 4 tables, 1 appedix. conference: XXV Simposio Brasileiro de
Telecomunicacoes, SBrT'07, Recife, PE, Brazil, 2007
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Real-valued block codes are introduced, which are derived from Discrete
Fourier Transforms (DFT) and Discrete Hartley Transforms (DHT). These algebraic
structures are built from the eigensequences of the transforms. Generator and
parity check matrices were computed for codes up to block length N=24. They can
be viewed as lattices codes so the main parameters (dimension, minimal norm,
area of the Voronoi region, density, and centre density) are computed.
Particularly, Hamming-Hartley and Golay-Hartley block codes are presented.
These codes may possibly help an efficient computation of a DHT/DFT.
|
[
{
"version": "v1",
"created": "Mon, 9 Feb 2015 14:01:20 GMT"
}
] | 2015-02-10T00:00:00 |
[
[
"de Oliveira",
"H. M.",
""
],
[
"Barros",
"C. M. F.",
""
],
[
"de Souza",
"R. M. Campello",
""
]
] |
new_dataset
| 0.999148 |
1409.5181
|
Zhilin Zhang
|
Zhilin Zhang, Zhouyue Pi, Benyuan Liu
|
TROIKA: A General Framework for Heart Rate Monitoring Using Wrist-Type
Photoplethysmographic Signals During Intensive Physical Exercise
|
Matlab codes and data are available at:
https://sites.google.com/site/researchbyzhang/
|
IEEE Transactions on Biomedical Engineering, vol. 62, no. 2, pp.
522-531, February 2015
|
10.1109/TBME.2014.2359372
| null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Heart rate monitoring using wrist-type photoplethysmographic (PPG) signals
during subjects' intensive exercise is a difficult problem, since the signals
are contaminated by extremely strong motion artifacts caused by subjects' hand
movements. So far few works have studied this problem. In this work, a general
framework, termed TROIKA, is proposed, which consists of signal decomposiTion
for denoising, sparse signal RecOnstructIon for high-resolution spectrum
estimation, and spectral peaK trAcking with verification. The TROIKA framework
has high estimation accuracy and is robust to strong motion artifacts. Many
variants can be straightforwardly derived from this framework. Experimental
results on datasets recorded from 12 subjects during fast running at the peak
speed of 15 km/hour showed that the average absolute error of heart rate
estimation was 2.34 beat per minute (BPM), and the Pearson correlation between
the estimates and the ground-truth of heart rate was 0.992. This framework is
of great values to wearable devices such as smart-watches which use PPG signals
to monitor heart rate for fitness.
|
[
{
"version": "v1",
"created": "Thu, 18 Sep 2014 03:24:49 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Jan 2015 07:47:00 GMT"
},
{
"version": "v3",
"created": "Fri, 6 Feb 2015 06:16:09 GMT"
}
] | 2015-02-09T00:00:00 |
[
[
"Zhang",
"Zhilin",
""
],
[
"Pi",
"Zhouyue",
""
],
[
"Liu",
"Benyuan",
""
]
] |
new_dataset
| 0.972657 |
1406.5453
|
Carlo A. Furia
|
Carlo A. Furia
|
Rotation of Sequences: Algorithms and Proofs
|
Added verified implementations for ESC/Java2
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sequence rotation consists of a circular shift of the sequence's elements by
a given number of positions. We present the four classic algorithms to rotate a
sequence; the loop invariants underlying their correctness; detailed
correctness proofs; and fully annotated versions for the verifiers Boogie,
Dafny, and ESC/Java2. The presentation illustrates in detail both how the
algorithms work and what it takes to carry out mechanized proofs of their
correctness.
|
[
{
"version": "v1",
"created": "Fri, 20 Jun 2014 16:24:57 GMT"
},
{
"version": "v2",
"created": "Thu, 27 Nov 2014 18:24:04 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Feb 2015 10:03:41 GMT"
}
] | 2015-02-06T00:00:00 |
[
[
"Furia",
"Carlo A.",
""
]
] |
new_dataset
| 0.999192 |
1410.7614
|
Zhifei Zhang
|
Zhifei Zhang, Alain Sarlette and Zhihao Ling
|
Integral Control on Lie Groups
|
Resubmitted to Systems and Control Letters, February 2015
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we extend the popular integral control technique to systems
evolving on Lie groups. More explicitly, we provide an alternative definition
of "integral action" for proportional(-derivative)-controlled systems whose
configuration evolves on a nonlinear space, where configuration errors cannot
be simply added up to compute a definite integral. We then prove that the
proposed integral control allows to cancel the drift induced by a constant bias
in both first order (velocity) and second order (torque) control inputs for
fully actuated systems evolving on abstract Lie groups. We illustrate the
approach by 3-dimensional motion control applications.
|
[
{
"version": "v1",
"created": "Tue, 28 Oct 2014 13:36:34 GMT"
},
{
"version": "v2",
"created": "Thu, 5 Feb 2015 16:57:46 GMT"
}
] | 2015-02-06T00:00:00 |
[
[
"Zhang",
"Zhifei",
""
],
[
"Sarlette",
"Alain",
""
],
[
"Ling",
"Zhihao",
""
]
] |
new_dataset
| 0.997747 |
1502.01414
|
Alexander Barg
|
Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, and Robert
Calderbank
|
Cyclic LRC Codes and their Subfield Subcodes
|
Submitted for publication
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider linear cyclic codes with the locality property, or locally
recoverable codes (LRC codes). A family of LRC codes that generalizes the
classical construction of Reed-Solomon codes was constructed in a recent paper
by I. Tamo and A. Barg (IEEE Transactions on Information Theory, no. 8, 2014;
arXiv:1311.3284). In this paper we focus on the optimal cyclic codes that arise
from the general construction. We give a characterization of these codes in
terms of their zeros, and observe that there are many equivalent ways of
constructing optimal cyclic LRC codes over a given field. We also study
subfield subcodes of cyclic LRC codes (BCH-like LRC codes) and establish
several results about their locality and minimum distance.
|
[
{
"version": "v1",
"created": "Thu, 5 Feb 2015 02:51:33 GMT"
}
] | 2015-02-06T00:00:00 |
[
[
"Tamo",
"Itzhak",
""
],
[
"Barg",
"Alexander",
""
],
[
"Goparaju",
"Sreechakra",
""
],
[
"Calderbank",
"Robert",
""
]
] |
new_dataset
| 0.986784 |
1502.01454
|
Ali Abdel Aziz
|
Ali Mohamed AbdelAziz, Moustafa Youssef
|
The Diversity and Scale Matter: Ubiquitous Transportation Mode Detection
using Single Cell Tower Information
|
5 pages, 6 figures
| null | null | null |
cs.NI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Detecting the transportation mode of a user is important for a wide range of
applications. While a number of recent systems addressed the transportation
mode detection problem using the ubiquitous mobile phones, these studies either
leverage GPS, the inertial sensors, and/or multiple cell towers information.
However, these different phone sensors have high energy consumption, limited to
a small subset of phones (e.g. high-end phones or phones that support
neighbouring cell tower information), cannot work in certain areas (e.g. inside
tunnels for GPS), and/or work only from the user side.
In this paper, we present a transportation mode detection system, MonoSense,
that leverages the phone serving cell information only. The basic idea is that
the phone speed can be correlated with features extracted from both the serving
cell tower ID and the received signal strength from it. To achieve high
detection accuracy with this limited information, MonoSense leverages diversity
along multiple axes to extract novel features. Specifically, MonoSense extracts
features from both the time and frequency domain information available from the
serving cell tower over different sliding widow sizes. More importantly, we
show also that both the logarithmic and linear RSS scales can provide different
information about the movement of a phone, further enriching the feature space
and leading to higher accuracy.
Evaluation of MonoSense using 135 hours of cellular traces covering 485 km
and collected by four users using different Android phones shows that it can
achieve an average precision and recall of 89.26% and 89.84% respectively in
differentiating between the stationary, walking, and driving modes using only
the serving cell tower information, highlighting MonoSense ability to enable a
wide set of intelligent transportation applications.
|
[
{
"version": "v1",
"created": "Thu, 5 Feb 2015 08:28:18 GMT"
}
] | 2015-02-06T00:00:00 |
[
[
"AbdelAziz",
"Ali Mohamed",
""
],
[
"Youssef",
"Moustafa",
""
]
] |
new_dataset
| 0.999111 |
1502.01657
|
Sudeep Pillai
|
Michael Fleder, Michael S. Kester, Sudeep Pillai
|
Bitcoin Transaction Graph Analysis
| null | null | null | null |
cs.CR cs.IR cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bitcoins have recently become an increasingly popular cryptocurrency through
which users trade electronically and more anonymously than via traditional
electronic transfers. Bitcoin's design keeps all transactions in a public
ledger. The sender and receiver for each transaction are identified only by
cryptographic public-key ids. This leads to a common misconception that it
inherently provides anonymous use. While Bitcoin's presumed anonymity offers
new avenues for commerce, several recent studies raise user-privacy concerns.
We explore the level of anonymity in the Bitcoin system. Our approach is
two-fold: (i) We annotate the public transaction graph by linking bitcoin
public keys to "real" people - either definitively or statistically. (ii) We
run the annotated graph through our graph-analysis framework to find and
summarize activity of both known and unknown users.
|
[
{
"version": "v1",
"created": "Thu, 5 Feb 2015 17:55:27 GMT"
}
] | 2015-02-06T00:00:00 |
[
[
"Fleder",
"Michael",
""
],
[
"Kester",
"Michael S.",
""
],
[
"Pillai",
"Sudeep",
""
]
] |
new_dataset
| 0.999626 |
cs/0102006
|
Hsueh-I. Lu
|
Yi-Ting Chiang, Ching-Chi Lin, and Hsueh-I Lu
|
Orderly Spanning Trees with Applications
|
25 pages, 7 figures, A preliminary version appeared in Proceedings of
the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001),
Washington D.C., USA, January 7-9, 2001, pp. 506-515
|
SIAM Journal on Computing 34(4): 924-945 (2005)
|
10.1137/S0097539702411381
| null |
cs.DS cs.DM
| null |
We introduce and study the {\em orderly spanning trees} of plane graphs. This
algorithmic tool generalizes {\em canonical orderings}, which exist only for
triconnected plane graphs. Although not every plane graph admits an orderly
spanning tree, we provide an algorithm to compute an {\em orderly pair} for any
connected planar graph $G$, consisting of a plane graph $H$ of $G$, and an
orderly spanning tree of $H$. We also present several applications of orderly
spanning trees: (1) a new constructive proof for Schnyder's Realizer Theorem,
(2) the first area-optimal 2-visibility drawing of $G$, and (3) the best known
encodings of $G$ with O(1)-time query support. All algorithms in this paper run
in linear time.
|
[
{
"version": "v1",
"created": "Wed, 7 Feb 2001 15:44:49 GMT"
},
{
"version": "v2",
"created": "Mon, 2 Jul 2001 01:12:56 GMT"
},
{
"version": "v3",
"created": "Sat, 13 Jul 2002 10:54:10 GMT"
}
] | 2015-02-06T00:00:00 |
[
[
"Chiang",
"Yi-Ting",
""
],
[
"Lin",
"Ching-Chi",
""
],
[
"Lu",
"Hsueh-I",
""
]
] |
new_dataset
| 0.997543 |
1502.01222
|
Aaron Striegel
|
Xueheng Hu and Lixing Song and Dirk Van Bruggen and Aaron Striegel
|
Is There WiFi Yet? How Aggressive WiFi Probe Requests Deteriorate Energy
and Throughput
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WiFi offloading has emerged as a key component of cellular operator strategy
to meet the data needs of rich, mobile devices. As such, mobile devices tend to
aggressively seek out WiFi in order to provide improved user Quality of
Experience (QoE) and cellular capacity relief. For home and work environments,
aggressive WiFi scans can significantly improve the speed on which mobile nodes
join the WiFi network. Unfortunately, the same aggressive behavior that excels
in the home environment incurs considerable side effects across crowded
wireless environments. In this paper, we show through empirical studies at both
large (stadium) and small (laboratory) scales how aggressive WiFi scans can
have significant implications for energy and throughput, both for the mobile
nodes scanning and other nearby mobile nodes. We close with several thoughts on
the disjoint incentives for properly balancing WiFi discovery speed and
ultra-dense network interactions.
|
[
{
"version": "v1",
"created": "Wed, 4 Feb 2015 15:01:00 GMT"
}
] | 2015-02-05T00:00:00 |
[
[
"Hu",
"Xueheng",
""
],
[
"Song",
"Lixing",
""
],
[
"Van Bruggen",
"Dirk",
""
],
[
"Striegel",
"Aaron",
""
]
] |
new_dataset
| 0.976475 |
1502.00317
|
Mounia Lalmas Dr
|
David Warnock and Mounia Lalmas
|
An Exploration of Cursor tracking Data
|
Mouse, Cursor, Tracking, Engagement, Involvement, Aesthetics,
Self-report Measure, Experimental Design
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cursor tracking data contains information about website visitors which may
provide new ways to understand visitors and their needs. This paper presents an
Amazon Mechanical Turk study where participants were tracked as they used
modified variants of the Wikipedia and BBC News websites. Participants were
asked to complete reading and information-finding tasks. The results showed
that it was possible to differentiate between users reading content and users
looking for information based on cursor data. The effects of website
aesthetics, user interest and cursor hardware were also analysed which showed
it was possible to identify hardware from cursor data, but no relationship
between cursor data and engagement was found. The implications of these
results, from the impact on web analytics to the design of experiments to
assess user engagement, are discussed.
|
[
{
"version": "v1",
"created": "Sun, 1 Feb 2015 21:42:02 GMT"
},
{
"version": "v2",
"created": "Tue, 3 Feb 2015 14:25:07 GMT"
}
] | 2015-02-04T00:00:00 |
[
[
"Warnock",
"David",
""
],
[
"Lalmas",
"Mounia",
""
]
] |
new_dataset
| 0.983458 |
1502.00859
|
Piotr Micek
|
Piotr Micek and Veit Wiechert
|
An on-line competitive algorithm for coloring bipartite graphs without
long induced paths
| null | null | null | null |
cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The existence of an on-line competitive algorithm for coloring bipartite
graphs remains a tantalizing open problem. So far there are only partial
positive results for bipartite graphs with certain small forbidden graphs as
induced subgraphs. We propose a new on-line competitive coloring algorithm for
$P_9$-free bipartite graphs.
|
[
{
"version": "v1",
"created": "Tue, 3 Feb 2015 13:32:08 GMT"
}
] | 2015-02-04T00:00:00 |
[
[
"Micek",
"Piotr",
""
],
[
"Wiechert",
"Veit",
""
]
] |
new_dataset
| 0.998666 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.