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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1005.2770
|
Eran Hof
|
Eran Hof, Igal Sason, Shlomo Shamai, Chao Tian
|
Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel
Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Channel coding over arbitrarily-permuted parallel channels was first studied
by Willems et al. (2008). This paper introduces capacity-achieving polar coding
schemes for arbitrarily-permuted parallel channels where the component channels
are memoryless, binary-input and output-symmetric.
|
[
{
"version": "v1",
"created": "Sun, 16 May 2010 18:53:47 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Oct 2011 07:41:52 GMT"
},
{
"version": "v3",
"created": "Sun, 19 Aug 2012 19:26:14 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Hof",
"Eran",
""
],
[
"Sason",
"Igal",
""
],
[
"Shamai",
"Shlomo",
""
],
[
"Tian",
"Chao",
""
]
] |
new_dataset
| 0.964703 |
1010.0886
|
Michael Reckhaus
|
Michael Reckhaus, Nico Hochgeschwender, Paul G. Ploeger and Gerhard K.
Kraetzschmar
|
A Platform-independent Programming Environment for Robot Control
| null | null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The development of robot control programs is a complex task. Many robots are
different in their electrical and mechanical structure which is also reflected
in the software. Specific robot software environments support the program
development, but are mainly text-based and usually applied by experts in the
field with profound knowledge of the target robot. This paper presents a
graphical programming environment which aims to ease the development of robot
control programs. In contrast to existing graphical robot programming
environments, our approach focuses on the composition of parallel action
sequences. The developed environment allows to schedule independent robot
actions on parallel execution lines and provides mechanism to avoid
side-effects of parallel actions. The developed environment is
platform-independent and based on the model-driven paradigm. The feasibility of
our approach is shown by the application of the sequencer to a simulated
service robot and a robot for educational purpose.
|
[
{
"version": "v1",
"created": "Tue, 5 Oct 2010 13:56:36 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Reckhaus",
"Michael",
""
],
[
"Hochgeschwender",
"Nico",
""
],
[
"Ploeger",
"Paul G.",
""
],
[
"Kraetzschmar",
"Gerhard K.",
""
]
] |
new_dataset
| 0.999706 |
1010.3294
|
Mohamed Elsabagh
|
Mohamed Elsabagh, Yara Abdallah, Moustafa Youssef, Hesham El Gamal
|
ARQ Security in Wi-Fi and RFID Networks
|
8 pages
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present two practical ARQ-Based security schemes for Wi-Fi
and RFID networks. Our proposed schemes enhance the confidentiality and
authenticity functions of these networks, respectively. Both schemes build on
the same idea; by exploiting the statistical independence between the multipath
fading experienced by the legitimate nodes and potential adversaries, secret
keys are established and then are continuously updated. The continuous key
update property of both schemes makes them capable of defending against all of
the passive eavesdropping attacks and most of the currently-known active
attacks against either Wi-Fi or RFID networks. However, each scheme is tailored
to best suit the requirements of its respective paradigm. In Wi-Fi networks, we
overlay, rather than completely replace, the current Wi-Fi security protocols.
Thus, our Wi-Fi scheme can be readily implemented via only minor modifications
over the IEEE 802.11 standards. On the other hand, the proposed RFID scheme
introduces the first provably secure low cost RFID authentication protocol. The
proposed schemes impose a throughput-security tradeoff that is shown, through
our analytical and experimental results, to be practically acceptable.
|
[
{
"version": "v1",
"created": "Fri, 15 Oct 2010 23:06:22 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Elsabagh",
"Mohamed",
""
],
[
"Abdallah",
"Yara",
""
],
[
"Youssef",
"Moustafa",
""
],
[
"Gamal",
"Hesham El",
""
]
] |
new_dataset
| 0.991024 |
1010.5023
|
Matthew Might
|
Matthew Might and David Darais
|
Yacc is dead
|
18 pages; submitted October 2009 to ESOP; rejected
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present two novel approaches to parsing context-free languages. The first
approach is based on an extension of Brzozowski's derivative from regular
expressions to context-free grammars. The second approach is based on a
generalization of the derivative to parser combinators. The payoff of these
techniques is a small (less than 250 lines of code), easy-to-implement parsing
library capable of parsing arbitrary context-free grammars into lazy parse
forests. Implementations for both Scala and Haskell are provided. Preliminary
experiments with S-Expressions parsed millions of tokens per second, which
suggests this technique is efficient enough for use in practice.
|
[
{
"version": "v1",
"created": "Sun, 24 Oct 2010 23:12:28 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Might",
"Matthew",
""
],
[
"Darais",
"David",
""
]
] |
new_dataset
| 0.977463 |
1010.5421
|
Subhash Kak
|
Subhash Kak
|
On the Mesh Array for Matrix Multiplication
|
6 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents new properties of the mesh array for matrix
multiplication. In contrast to the standard array that requires 3n-2 steps to
complete its computation, the mesh array requires only 2n-1 steps. Symmetries
of the mesh array computed values are presented which enhance the efficiency of
the array for specific applications. In multiplying symmetric matrices, the
results are obtained in 3n/2+1 steps. The mesh array is examined for its
application as a scrambling system.
|
[
{
"version": "v1",
"created": "Tue, 26 Oct 2010 15:10:37 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Kak",
"Subhash",
""
]
] |
new_dataset
| 0.998658 |
1010.5974
|
Paul Bonsma
|
Paul Bonsma, Daniel Lokshtanov
|
Feedback Vertex Set in Mixed Graphs
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A mixed graph is a graph with both directed and undirected edges. We present
an algorithm for deciding whether a given mixed graph on $n$ vertices contains
a feedback vertex set (FVS) of size at most $k$, in time $2^{O(k)}k! O(n^4)$.
This is the first fixed parameter tractable algorithm for FVS that applies to
both directed and undirected graphs.
|
[
{
"version": "v1",
"created": "Thu, 28 Oct 2010 14:04:50 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Bonsma",
"Paul",
""
],
[
"Lokshtanov",
"Daniel",
""
]
] |
new_dataset
| 0.998289 |
1011.1638
|
Eric Filiol
|
Anthony Desnos and Robert Erra and Eric Filiol
|
Processor-Dependent Malware... and codes
|
13 pages - Extended version of the paper presented at the iAWACS 2009
conference
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Malware usually target computers according to their operating system. Thus we
have Windows malwares, Linux malwares and so on ... In this paper, we consider
a different approach and show on a technical basis how easily malware can
recognize and target systems selectively, according to the onboard processor
chip. This technology is very easy to build since it does not rely on deep
analysis of chip logical gates architecture. Floating Point Arithmetic (FPA)
looks promising to define a set of tests to identify the processor or, more
precisely, a subset of possible processors. We give results for different
families of processors: AMD, Intel (Dual Core, Atom), Sparc, Digital Alpha,
Cell, Atom ... As a conclusion, we propose two {\it open problems} that are
new, to the authors' knowledge.
|
[
{
"version": "v1",
"created": "Sun, 7 Nov 2010 14:31:15 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Desnos",
"Anthony",
""
],
[
"Erra",
"Robert",
""
],
[
"Filiol",
"Eric",
""
]
] |
new_dataset
| 0.963747 |
1011.2361
|
Nihar Shah B
|
Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar and Kannan Ramchandran
|
Distributed Storage Codes with Repair-by-Transfer and Non-achievability
of Interior Points on the Storage-Bandwidth Tradeoff
|
30 pages, 6 figures. Submitted to IEEE Transactions on Information
Theory
| null |
10.1109/TIT.2011.2173792
| null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Regenerating codes are a class of recently developed codes for distributed
storage that, like Reed-Solomon codes, permit data recovery from any subset of
k nodes within the n-node network. However, regenerating codes possess in
addition, the ability to repair a failed node by connecting to an arbitrary
subset of d nodes. It has been shown that for the case of functional-repair,
there is a tradeoff between the amount of data stored per node and the
bandwidth required to repair a failed node. A special case of functional-repair
is exact-repair where the replacement node is required to store data identical
to that in the failed node. Exact-repair is of interest as it greatly
simplifies system implementation. The first result of the paper is an explicit,
exact-repair code for the point on the storage-bandwidth tradeoff corresponding
to the minimum possible repair bandwidth, for the case when d=n-1. This code
has a particularly simple graphical description and most interestingly, has the
ability to carry out exact-repair through mere transfer of data and without any
need to perform arithmetic operations. Hence the term `repair-by-transfer'. The
second result of this paper shows that the interior points on the
storage-bandwidth tradeoff cannot be achieved under exact-repair, thus pointing
to the existence of a separate tradeoff under exact-repair. Specifically, we
identify a set of scenarios, termed `helper node pooling', and show that it is
the necessity to satisfy such scenarios that over-constrains the system.
|
[
{
"version": "v1",
"created": "Wed, 10 Nov 2010 12:34:46 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Nov 2010 11:00:30 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Shah",
"Nihar B.",
""
],
[
"Rashmi",
"K. V.",
""
],
[
"Kumar",
"P. Vijay",
""
],
[
"Ramchandran",
"Kannan",
""
]
] |
new_dataset
| 0.975927 |
1011.3174
|
Peihua Li
|
Peihua Li
|
Tensor-SIFT based Earth Mover's Distance for Contour Tracking
|
28 pages, 9 figures, 2 tables
| null | null | null |
cs.CV math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Contour tracking in adverse environments is a challenging problem due to
cluttered background, illumination variation, occlusion, and noise, among
others. This paper presents a robust contour tracking method by contributing to
some of the key issues involved, including (a) a region functional formulation
and its optimization; (b) design of a robust and effective feature; and (c)
development of an integrated tracking algorithm. First, we formulate a region
functional based on robust Earth Mover's distance (EMD) with kernel density for
distribution modeling, and propose a two-phase method for its optimization. In
the first phase, letting the candidate contour be fixed, we express EMD as the
transportation problem and solve it by the simplex algorithm. Next, using the
theory of shape derivative, we make a perturbation analysis of the contour
around the best solution to the transportation problem. This leads to a partial
differential equation (PDE) that governs the contour evolution. Second, we
design a novel and effective feature for tracking applications. We propose a
dimensionality reduction method by tensor decomposition, achieving a
low-dimensional description of SIFT features called Tensor-SIFT for
characterizing local image region properties. Applicable to both color and
gray-level images, Tensor-SIFT is very distinctive, insensitive to illumination
changes, and noise. Finally, we develop an integrated algorithm that combines
various techniques of the simplex algorithm, narrow-band level set and fast
marching algorithms. Particularly, we introduce an inter-frame initialization
method and a stopping criterion for the termination of PDE iteration.
Experiments in challenging image sequences show that the proposed work has
promising performance.
|
[
{
"version": "v1",
"created": "Sun, 14 Nov 2010 01:52:52 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Li",
"Peihua",
""
]
] |
new_dataset
| 0.99907 |
1011.3493
|
David Doty
|
Ho-Lin Chen, David Doty, and Shinnosuke Seki
|
Program Size and Temperature in Self-Assembly
|
The previous version contained more sections, but we have split that
paper into two. The other half will be posted as a separate paper
| null | null | null |
cs.CC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Winfree's abstract Tile Assembly Model (aTAM) is a model of molecular
self-assembly of DNA complexes known as tiles, which float freely in solution
and attach one at a time to a growing "seed" assembly based on specific binding
sites on their four sides. We show that there is a polynomial-time algorithm
that, given an n x n square, finds the minimal tile system (i.e., the system
with the smallest number of distinct tile types) that uniquely self-assembles
the square, answering an open question of Adleman, Cheng, Goel, Huang, Kempe,
Moisset de Espanes, and Rothemund ("Combinatorial Optimization Problems in
Self-Assembly", STOC 2002). Our investigation leading to this algorithm reveals
other positive and negative results about the relationship between the size of
a tile system and its "temperature" (the binding strength threshold required
for a tile to attach).
|
[
{
"version": "v1",
"created": "Mon, 15 Nov 2010 20:22:58 GMT"
},
{
"version": "v2",
"created": "Wed, 2 Mar 2011 17:25:06 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Chen",
"Ho-Lin",
""
],
[
"Doty",
"David",
""
],
[
"Seki",
"Shinnosuke",
""
]
] |
new_dataset
| 0.998178 |
1011.3721
|
AbdelRahman Karawia Dr.
|
A.A. Karawia
|
On the Inverse Of General Cyclic Heptadiagonal and Anti-Heptadiagonal
Matrices
|
9 pages
| null | null | null |
cs.SC cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the current work, the author present a symbolic algorithm for finding the
determinant of any general nonsingular cyclic heptadiagonal matrices and
inverse of anti-cyclic heptadiagonal matrices. The algorithms are mainly based
on the work presented in [A. A. KARAWIA, A New Algorithm for Inverting General
Cyclic Heptadiagonal Matrices Recursively, arXiv:1011.2306v1 [cs.SC]]. The
symbolic algorithms are suited for implementation using Computer Algebra
Systems (CAS) such as MATLAB, MAPLE and MATHEMATICA. An illustrative example is
given.
|
[
{
"version": "v1",
"created": "Mon, 15 Nov 2010 11:42:22 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Karawia",
"A. A.",
""
]
] |
new_dataset
| 0.982648 |
1012.0548
|
Vida Dujmovic
|
Vida Dujmovic and Stefan Langerman
|
A Center Transversal Theorem for Hyperplanes and Applications to Graph
Drawing
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by an open problem from graph drawing, we study several
partitioning problems for line and hyperplane arrangements. We prove a
ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l
such that in both line sets, for both halfplanes delimited by l, there are
n^{1/2} lines which pairwise intersect in that halfplane, and this bound is
tight; a centerpoint theorem: for any set of n lines there is a point such that
for any halfplane containing that point there are (n/3)^{1/2} of the lines
which pairwise intersect in that halfplane. We generalize those results in
higher dimension and obtain a center transversal theorem, a same-type lemma,
and a positive portion Erdos-Szekeres theorem for hyperplane arrangements. This
is done by formulating a generalization of the center transversal theorem which
applies to set functions that are much more general than measures. Back to
Graph Drawing (and in the plane), we completely solve the open problem that
motivated our search: there is no set of n labelled lines that are universal
for all n-vertex labelled planar graphs. As a side note, we prove that every
set of n (unlabelled) lines is universal for all n-vertex (unlabelled) planar
graphs.
|
[
{
"version": "v1",
"created": "Thu, 2 Dec 2010 19:36:51 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Aug 2012 18:06:03 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Dujmovic",
"Vida",
""
],
[
"Langerman",
"Stefan",
""
]
] |
new_dataset
| 0.999286 |
1012.1258
|
Ram Rajagopal
|
Ram Rajagopal, XuanLong Nguyen, Sinem Coleri Ergen and Pravin Varaiya
|
Simultaneous Sequential Detection of Multiple Interacting Faults
|
38 pages, 3 figures
| null | null | null |
cs.IT cs.SY math.IT math.ST stat.TH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single fault sequential change point problems have become important in
modeling for various phenomena in large distributed systems, such as sensor
networks. But such systems in many situations present multiple interacting
faults. For example, individual sensors in a network may fail and detection is
performed by comparing measurements between sensors, resulting in statistical
dependency among faults. We present a new formulation for multiple interacting
faults in a distributed system. The formulation includes specifications of how
individual subsystems composing the large system may fail, the information that
can be shared among these subsystems and the interaction pattern between
faults. We then specify a new sequential algorithm for detecting these faults.
The main feature of the algorithm is that it uses composite stopping rules for
a subsystem that depend on the decision of other subsystems. We provide
asymptotic false alarm and detection delay analysis for this algorithm in the
Bayesian setting and show that under certain conditions the algorithm is
optimal. The analysis methodology relies on novel detailed comparison
techniques between stopping times. We validate the approach with some
simulations.
|
[
{
"version": "v1",
"created": "Mon, 6 Dec 2010 17:54:07 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Rajagopal",
"Ram",
""
],
[
"Nguyen",
"XuanLong",
""
],
[
"Ergen",
"Sinem Coleri",
""
],
[
"Varaiya",
"Pravin",
""
]
] |
new_dataset
| 0.970809 |
1012.1403
|
Fanping Du
|
Fanping Du
|
Negative frequency communication
|
21 pages, 11 figures
| null | null | null |
cs.IT math.IT physics.pop-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spectrum is the most valuable resource in communication system, but
unfortunately, so far, a half of the spectrum has been wasted. In this paper,
we will see that the negative frequency not only has a physical meaning but
also can be used in communication. In fact, the complete description of a
frequency signal is a rotating complex-frequency signal, in a complete
description, positive and negative frequency signals are two distinguishable
and independent frequency signals, they can carry different information. But
the current carrier modulation and demodulation do not distinguish positive and
negative frequencies, so half of the spectrum resources and signal energy are
wasted. The complex-carrier modulation and demodulation, proposed by this
paper, use the complex-frequency signal as a carrier signal, the negative and
positive frequency can carry different information, so the spectrum resources
are fully used, the signal energy carried by complex-carrier modulation is
focused on a certain band, so the signal energy will not be lost by the
complex-carrier demodulation.
|
[
{
"version": "v1",
"created": "Tue, 7 Dec 2010 05:46:02 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Dec 2010 01:45:19 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Mar 2011 08:49:39 GMT"
},
{
"version": "v4",
"created": "Mon, 18 Apr 2011 03:10:03 GMT"
},
{
"version": "v5",
"created": "Mon, 26 Sep 2011 08:09:13 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Du",
"Fanping",
""
]
] |
new_dataset
| 0.994161 |
1012.1531
|
Laurent Bartholdi
|
Laurent Bartholdi and Pedro V. Silva
|
Groups defined by automata
|
Chapter 24 in the handbook "AutoMathA". With index
| null | null | null |
cs.FL cs.DM math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been
used effectively in recent years to define infinite groups. The two main lines
of research have as their most representative objects the class of automatic
groups (including word-hyperbolic groups as a particular case) and automata
groups (singled out among the more general self-similar groups).
The first approach implements in the language of automata some tight
constraints on the geometry of the group's Cayley graph, building strange,
beautiful bridges between far-off domains. Automata are used to define a normal
form for group elements, and to monitor the fundamental group operations.
The second approach features groups acting in a finitely constrained manner
on a regular rooted tree. Automata define sequential permutations of the tree,
and represent the group elements themselves. The choice of particular classes
of automata has often provided groups with exotic behaviour which have
revolutioned our perception of infinite finitely generated groups.
|
[
{
"version": "v1",
"created": "Tue, 7 Dec 2010 15:18:36 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Bartholdi",
"Laurent",
""
],
[
"Silva",
"Pedro V.",
""
]
] |
new_dataset
| 0.983902 |
1012.5907
|
Deniz Sarioz
|
J\'anos Pach and Deniz Sarioz
|
Small (2,s)-colorable graphs without 1-obstacle representations
|
14 pages, 13 figures, ancillary to: Janos Pach and Deniz Sarioz, "On
the structure of graphs with low obstacle number", Graphs and Combinatorics,
Volume 27, Number 3, issue entitled "The Japan Conference on Computational
Geometry and Graphs (JCCGG2009)", 465-473, DOI: 10.1007/s00373-011-1027-0,
Springer, 2011. URL: http://www.springerlink.com/content/131r0n307h488825/
| null | null | null |
cs.DM cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An obstacle representation of a graph G is a set of points on the plane
together with a set of polygonal obstacles that determine a visibility graph
isomorphic to G. The obstacle number of G is the minimum number of obstacles
over all obstacle representations of G. Alpert, Koch, and Laison gave a
12-vertex bipartite graph and proved that its obstacle number is two. We show
that a 10-vertex induced subgraph of this graph has obstacle number two. Alpert
et al. also constructed very large graphs with vertex set consisting of a
clique and an independent set in order to show that obstacle number is an
unbounded parameter. We specify a 70-vertex graph with vertex set consisting of
a clique and an independent set, and prove that it has obstacle number greater
than one. This is an ancillary document to our article in press. We conclude by
showing that a 10-vertex graph with vertex set consisting of two cliques has
obstacle number greater than one, improving on a result therein.
|
[
{
"version": "v1",
"created": "Wed, 29 Dec 2010 10:49:44 GMT"
},
{
"version": "v2",
"created": "Sun, 24 Apr 2011 22:00:40 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Pach",
"János",
""
],
[
"Sarioz",
"Deniz",
""
]
] |
new_dataset
| 0.999324 |
1101.0275
|
Mehdi Torbatian
|
Mehdi Torbatian, Hossein Najafi, and Mohamed Oussama Damen
|
Asynchronous Interference Alignment
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A constant K-user interference channel in which the users are not
symbol-synchronous is considered. It is shown that the asynchronism among the
users facilitates aligning interfering signals at each receiver node while it
does not affect the total number of degrees of freedom (DoF) of the channel. To
achieve the total K/2 DoF of the channel when single antenna nodes are used, a
novel practical interference alignment scheme is proposed wherein the alignment
task is performed with the help of asynchronous delays which inherently exist
among the received signals at each receiver node. When each node is equipped
with M > 1 antennas, it is argued that the same alignment scheme is sufficient
to achieve the total MK/2 DoF of the medium when all links between collocated
antennas experience the same asynchronous delay.
|
[
{
"version": "v1",
"created": "Fri, 31 Dec 2010 17:06:37 GMT"
},
{
"version": "v2",
"created": "Thu, 9 Jun 2011 15:09:01 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Torbatian",
"Mehdi",
""
],
[
"Najafi",
"Hossein",
""
],
[
"Damen",
"Mohamed Oussama",
""
]
] |
new_dataset
| 0.998989 |
1101.0294
|
Lei Zhang
|
Lei Zhang and Dongning Guo
|
Virtual Full Duplex Wireless Broadcasting via Compressed Sensing
|
13 pages, 7 figures
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel solution is proposed to undertake a frequent task in wireless
networks, which is to let all nodes broadcast information to and receive
information from their respective one-hop neighboring nodes. The contribution
is two-fold. First, as each neighbor selects one message-bearing codeword from
its unique codebook for transmission, it is shown that decoding their messages
based on a superposition of those codewords through the multiaccess channel is
fundamentally a problem of compressed sensing. In the case where each message
consists of a small number of bits, an iterative algorithm based on belief
propagation is developed for efficient decoding. Second, to satisfy the
half-duplex constraint, each codeword consists of randomly distributed on-slots
and off-slots. A node transmits during its on-slots, and listens to its
neighbors only through its own off-slots. Over one frame interval, each node
broadcasts a message to neighbors and simultaneously decodes neighbors'
messages based on the superposed signals received through its own off-slots.
Thus the solution fully exploits the multiaccess nature of the wireless medium
and addresses the half-duplex constraint at the fundamental level. In a network
consisting of Poisson distributed nodes, numerical results demonstrate that the
proposed scheme often achieves several times the rate of slotted ALOHA and CSMA
with the same packet error rate.
|
[
{
"version": "v1",
"created": "Fri, 31 Dec 2010 19:50:22 GMT"
},
{
"version": "v2",
"created": "Fri, 21 Sep 2012 01:18:49 GMT"
},
{
"version": "v3",
"created": "Sun, 11 Aug 2013 02:02:01 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Zhang",
"Lei",
""
],
[
"Guo",
"Dongning",
""
]
] |
new_dataset
| 0.999385 |
1101.0565
|
Matias Korman
|
Jean Cardinal and Matias Korman
|
Coloring Planar Homothets and Three-Dimensional Hypergraphs
|
Preliminary version of this paper appeared in Latin 2012
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The inclusion relation between simple objects in the plane may be used to
define geometric set systems, or hypergraphs. Properties of various types of
colorings of these hypergraphs have been the subject of recent investigations,
with applications to wireless networking.
We first prove that every set of homothetic copies of a given convex body in
the plane can be colored with four colors so that any point covered by at least
two copies is covered by two copies with distinct colors. This generalizes a
previous result from Smorodinsky [18]. As a corollary, we find improvements to
well studied variations of the coloring problem such as conflict-free
colorings, k-strong (conflict-free) colorings and choosability. We also show a
relation between our proof and Schnyder's characterization of planar graphs.
Then we show that for any k >1, every three-dimensional hypergraph can be
colored with 6(k - 1) colors so that every hyperedge e contains min{|e|, k}
vertices with mutually distinct colors. Furthermore, we also show that at least
2k colors might be necessary. This refines a previous result from Aloupis et
al. [2].
|
[
{
"version": "v1",
"created": "Mon, 3 Jan 2011 17:06:52 GMT"
},
{
"version": "v2",
"created": "Tue, 4 Jan 2011 17:45:11 GMT"
},
{
"version": "v3",
"created": "Wed, 5 Jan 2011 09:56:14 GMT"
},
{
"version": "v4",
"created": "Thu, 6 Jan 2011 15:07:42 GMT"
},
{
"version": "v5",
"created": "Sat, 8 Jan 2011 16:06:11 GMT"
},
{
"version": "v6",
"created": "Mon, 21 Feb 2011 10:38:35 GMT"
},
{
"version": "v7",
"created": "Mon, 10 Oct 2011 13:16:56 GMT"
},
{
"version": "v8",
"created": "Fri, 29 Jun 2012 06:56:27 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Korman",
"Matias",
""
]
] |
new_dataset
| 0.999671 |
1101.1379
|
Xiaoxiao Yang
|
Xiaoxiao Yang
|
A Probabilistic Variant of Projection Temporal Logic
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose Probabilistic discrete-time Projection Temporal
Logic (PrPTL), which extends Projection Temporal Logic (PTL) with probability.
To this end, some useful formulas are derived and some logic laws are given.
Further, we define Time Normal Form (TNF) for PrPTL as the standard form and
prove that any PrPTL formulas can be rewritten to TNF. According to the TNF, we
construct the time normal form graph which can be used for the probabilistic
model checking on PrPTL.
|
[
{
"version": "v1",
"created": "Fri, 7 Jan 2011 08:43:36 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Yang",
"Xiaoxiao",
""
]
] |
new_dataset
| 0.962569 |
1101.2249
|
KyungHi Chang
|
Manar Mohaisen and KyungHi Chang
|
Fixed-complexity Sphere Encoder for Multi-user MIMO Systems
|
7 pages, 7 figures. Accepted by Journal of Communications and
Networks
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose a fixed-complexity sphere encoder (FSE) for
multi-user MIMO (MU-MIMO) systems. The proposed FSE accomplishes a scalable
tradeoff between performance and complexity. Also, because it has a parallel
tree-search structure, the proposed encoder can be easily pipelined, leading to
a tremendous reduction in the precoding latency. The complexity of the proposed
encoder is also analyzed, and we propose two techniques that reduce it.
Simulation and analytical results demonstrate that in a 4 by 4 MU-MIMO system,
the proposed FSE requires only 11.5% of the computational complexity needed by
the conventional QRD-M encoder (QRDM-E). Also, the encoding throughput of the
proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in
the BER performance, while achieving the optimum diversity order.
|
[
{
"version": "v1",
"created": "Wed, 12 Jan 2011 01:17:45 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Mohaisen",
"Manar",
""
],
[
"Chang",
"KyungHi",
""
]
] |
new_dataset
| 0.973946 |
1101.2360
|
Sandor P. Fekete
|
Sandor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt
|
Minimum Covering with Travel Cost
|
17 pages, 12 figures; extended abstract appears in ISAAC 2009, full
version to appear in Journal of Combinatorial Optimization
| null | null | null |
cs.DS cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a polygon and a visibility range, the Myopic Watchman Problem with
Discrete Vision (MWPDV) asks for a closed path P and a set of scan points S,
such that (i) every point of the polygon is within visibility range of a scan
point; and (ii) path length plus weighted sum of scan number along the tour is
minimized. Alternatively, the bicriteria problem (ii') aims at minimizing both
scan number and tour length. We consider both lawn mowing (in which tour and
scan points may leave P) and milling (in which tour, scan points and visibility
must stay within P) variants for the MWPDV; even for simple special cases,
these problems are NP-hard.
We show that this problem is NP-hard, even for the special cases of
rectilinear polygons and L_\infty scan range 1, and negligible small travel
cost or negligible travel cost. For rectilinear MWPDV milling in grid polygons
we present a 2.5-approximation with unit scan range; this holds for the
bicriteria version, thus for any linear combination of travel cost and scan
cost. For grid polygons and circular unit scan range, we describe a bicriteria
4-approximation. These results serve as stepping stones for the general case of
circular scans with scan radius r and arbitrary polygons of feature size a, for
which we extend the underlying ideas to a pi(r/a}+(r+1)/2) bicriteria
approximation algorithm. Finally, we describe approximation schemes for MWPDV
lawn mowing and milling of grid polygons, for fixed ratio between scan cost and
travel cost.
|
[
{
"version": "v1",
"created": "Wed, 12 Jan 2011 13:50:10 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Fekete",
"Sandor P.",
""
],
[
"Mitchell",
"Joseph S. B.",
""
],
[
"Schmidt",
"Christiane",
""
]
] |
new_dataset
| 0.985416 |
1101.2389
|
Uria Basher
|
Uria Basher, Avihay Shirazi, and Haim Permuter
|
Capacity Region of Finite State Multiple-Access Channel with Delayed
State Information at the Transmitters
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A single-letter characterization is provided for the capacity region of
finite-state multiple access channels. The channel state is a Markov process,
the transmitters have access to delayed state information, and channel state
information is available at the receiver. The delays of the channel state
information are assumed to be asymmetric at the transmitters. We apply the
result to obtain the capacity region for a finite-state Gaussian MAC, and for a
finite-state multiple-access fading channel. We derive power control strategies
that maximize the capacity region for these channels.
|
[
{
"version": "v1",
"created": "Wed, 12 Jan 2011 15:42:55 GMT"
},
{
"version": "v2",
"created": "Thu, 13 Jan 2011 11:07:48 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Basher",
"Uria",
""
],
[
"Shirazi",
"Avihay",
""
],
[
"Permuter",
"Haim",
""
]
] |
new_dataset
| 0.986775 |
1101.2524
|
Pavan Srinath
|
K. Pavan Srinath and B. Sundar Rajan
|
Generalized Silver Codes
|
Accepted for publication in the IEEE Transactions on Information
Theory. This revised version has 30 pages, 7 figures and Section III has been
completely revised
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$
system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} =
min(n_t,n_r)$ complex symbols per channel use. The well known Golden code is an
example of a full-rate, full-diversity STBC for 2 transmit antennas. Its
ML-decoding complexity is of the order of $M^{2.5}$ for square $M$-QAM. The
Silver code for 2 transmit antennas has all the desirable properties of the
Golden code except its coding gain, but offers lower ML-decoding complexity of
the order of $M^2$. Importantly, the slight loss in coding gain is negligible
compared to the advantage it offers in terms of lowering the ML-decoding
complexity. For higher number of transmit antennas, the best known codes are
the Perfect codes, which are full-rate, full-diversity, information lossless
codes (for $n_r \geq n_t$) but have a high ML-decoding complexity of the order
of $M^{n_tn_{min}}$ (for $n_r < n_t$, the punctured Perfect codes are
considered). In this paper, a scheme to obtain full-rate STBCs for $2^a$
transmit antennas and any $n_r$ with reduced ML-decoding complexity of the
order of $M^{n_t(n_{min}-(3/4))-0.5}$, is presented. The codes constructed are
also information lossless for $n_r \geq n_t$, like the Perfect codes and allow
higher mutual information than the comparable punctured Perfect codes for $n_r
< n_t$. These codes are referred to as the {\it generalized Silver codes},
since they enjoy the same desirable properties as the comparable Perfect codes
(except possibly the coding gain) with lower ML-decoding complexity, analogous
to the Silver-Golden codes for 2 transmit antennas. Simulation results of the
symbol error rates for 4 and 8 transmit antennas show that the generalized
Silver codes match the punctured Perfect codes in error performance while
offering lower ML-decoding complexity.
|
[
{
"version": "v1",
"created": "Thu, 13 Jan 2011 10:07:12 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Apr 2011 07:32:25 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Srinath",
"K. Pavan",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.966342 |
1101.2719
|
Yao Yu
|
Yao Yu, Athina P. Petropulu and H. Vincent Poor
|
CSSF MIMO RADAR: Low-Complexity Compressive Sensing Based MIMO Radar
That Uses Step Frequency
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new approach is proposed, namely CSSF MIMO radar, which applies the
technique of step frequency (SF) to compressive sensing (CS) based multi-input
multi-output (MIMO) radar. The proposed approach enables high resolution range,
angle and Doppler estimation, while transmitting narrowband pulses. The problem
of joint angle-Doppler-range estimation is first formulated to fit the CS
framework, i.e., as an L1 optimization problem. Direct solution of this problem
entails high complexity as it employs a basis matrix whose construction
requires discretization of the angle-Doppler-range space. Since high resolution
requires fine space discretization, the complexity of joint range, angle and
Doppler estimation can be prohibitively high. For the case of slowly moving
targets, a technique is proposed that achieves significant complexity reduction
by successively estimating angle-range and Doppler in a decoupled fashion and
by employing initial estimates obtained via matched filtering to further reduce
the space that needs to be digitized. Numerical results show that the
combination of CS and SF results in a MIMO radar system that has superior
resolution and requires far less data as compared to a system that uses a
matched filter with SF.
|
[
{
"version": "v1",
"created": "Fri, 14 Jan 2011 05:58:48 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Yu",
"Yao",
""
],
[
"Petropulu",
"Athina P.",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.998058 |
1101.2753
|
Jaydip Sen
|
Jaydip Sen
|
An Efficient and User Privacy-Preserving Routing Protocol for Wireless
Mesh Networks
|
14 pages, 10 figures, i table
|
International Journal of Scalable Computing: Practice and
Experience. Vol. 11, No. 4, pp. 345-358, 2011
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless mesh networks (WMNs) have emerged as a key technology for next
generation wireless broadband networks showing rapid progress and inspiring
numerous compelling applications. A WMN comprises of a set of mesh routers
(MRs) and mesh clients (MCs), where MRs are connected to the Internet backbone
through the Internet gateways (IGWs). The MCs are wireless devices and
communicate among themselves over possibly multi-hop paths with or without the
involvement of MRs. User privacy and security have been primary concerns in
WMNs due to their peer-to-peer network topology, shared wireless medium,
stringent resource constraints, and highly dynamic environment. Moreover, to
support real-time applications, WMNs must also be equipped with robust,
reliable and efficient routing protocols so as to minimize the end-to-end
latency. Design of a secure and efficient routing protocol for WMNs, therefore,
is of paramount importance. In this paper, we propose an efficient and reliable
routing protocol that also provides user anonymity in WMNs. The protocol is
based on an accurate estimation of the available bandwidth in the wireless
links and a robust estimation of the end-to-end delay in a routing path, and
minimization of control message overhead. The user anonymity, authentication
and data privacy is achieved by application of a novel protocol that is based
on Rivest's ring signature scheme. Simulations carried out on the proposed
protocol demonstrate that it is more efficient than some of the existing
routing protocols.
|
[
{
"version": "v1",
"created": "Fri, 14 Jan 2011 09:58:28 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Sen",
"Jaydip",
""
]
] |
new_dataset
| 0.973711 |
1101.3698
|
Ni-Chun Wang
|
Ni-Chun Wang, Ezio Biglieri, and Kung Yao
|
Systolic Arrays for Lattice-Reduction-Aided MIMO Detection
|
13 pages, to be appeared in journal of communications and networks
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multiple-input, multiple-output (MIMO) technology provides high data rate and
enhanced QoS for wireless com- munications. Since the benefits from MIMO result
in a heavy computational load in detectors, the design of low-complexity
sub-optimum receivers is currently an active area of research.
Lattice-reduction-aided detection (LRAD) has been shown to be an effective
low-complexity method with near-ML performance. In this paper we advocate the
use of systolic array architectures for MIMO receivers, and in particular we
exhibit one of them based on LRAD. The "LLL lattice reduction algorithm" and
the ensuing linear detections or successive spatial-interference cancellations
can be located in the same array, which is con- siderably hardware-efficient.
Since the conventional form of the LLL algorithm is not immediately suitable
for parallel processing, two modified LLL algorithms are considered here for
the systolic array. LLL algorithm with full-size reduction (FSR-LLL) is one of
the versions more suitable for parallel processing. Another variant is the
all-swap lattice-reduction (ASLR) algorithm for complex-valued lattices, which
processes all lattice basis vectors simultaneously within one iteration. Our
novel systolic array can operate both algorithms with different external logic
controls. In order to simplify the systolic array design, we replace the
Lov\'asz condition in the definition of LLL-reduced lattice with the looser
Siegel condition. Simulation results show that for LR- aided linear detections,
the bit-error-rate performance is still maintained with this relaxation.
Comparisons between the two algorithms in terms of bit-error-rate performance,
and average FPGA processing time in the systolic array are made, which shows
that ASLR is a better choice for a systolic architecture, especially for
systems with a large number of antennas.
|
[
{
"version": "v1",
"created": "Mon, 17 Jan 2011 18:09:52 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Wang",
"Ni-Chun",
""
],
[
"Biglieri",
"Ezio",
""
],
[
"Yao",
"Kung",
""
]
] |
new_dataset
| 0.998691 |
1101.3891
|
Patricia Marcu
|
Patricia Marcu, Wolfgang Hommel
|
Inter-organizational fault management: Functional and organizational
core aspects of management architectures
|
International Journal of Computer Networks & Communications (IJCNC)
|
International Journal of Computer Networks & Communications
(IJCNC), Editor: AIRCC, January 2011, Volume 3. Number 1, pages:101-117,
ISSN-Online: 0974 - 9322,ISSN-Print: 0975- 2293
|
10.5121/ijcnc.2011.3107
| null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Outsourcing -- successful, and sometimes painful -- has become one of the
hottest topics in IT service management discussions over the past decade. IT
services are outsourced to external service provider in order to reduce the
effort required for and overhead of delivering these services within the own
organization. More recently also IT services providers themselves started to
either outsource service parts or to deliver those services in a
non-hierarchical cooperation with other providers. Splitting a service into
several service parts is a non-trivial task as they have to be implemented,
operated, and maintained by different providers. One key aspect of such
inter-organizational cooperation is fault management, because it is crucial to
locate and solve problems, which reduce the quality of service, quickly and
reliably. In this article we present the results of a thorough use case based
requirements analysis for an architecture for inter-organizational fault
management (ioFMA). Furthermore, a concept of the organizational respective
functional model of the ioFMA is given.
|
[
{
"version": "v1",
"created": "Thu, 20 Jan 2011 13:08:06 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Marcu",
"Patricia",
""
],
[
"Hommel",
"Wolfgang",
""
]
] |
new_dataset
| 0.979895 |
1101.4075
|
Pang-Chang Lan
|
Pang-Chang Lan and Chih-Yao Wu and Chia-Han Lee and Ping-Cheng Yeh and
Chen-Mou Cheng
|
PMI-based MIMO OFDM PHY Integrated Key Exchange (P-MOPI) Scheme
|
6 pages, 4 figures, topic on physical layer security in information
theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the literature, J.-P. Cheng et al. have proposed the MIMO-OFDM PHY
integrated (MOPI) scheme for achieving physical-layer security in practice
without using any cryptographic ciphers. The MOPI scheme uses channel sounding
and physical-layer network coding (PNC) to prevent eavesdroppers from learning
the channel state information (CSI). Nevertheless, due to the use of multiple
antennas for PNC at transmitter and beamforming at receiver, it is not possible
to have spatial multiplexing nor use space-time codes in our previous MOPI
scheme. In this paper, we propose a variant of the MOPI scheme, called P-MOPI,
that works with a cryptographic cipher and utilizes precoding matrix index
(PMI) as an efficient key-exchange mechanism. With channel sounding, the PMI is
only known between the transmitter and the legal receiver. The shared key can
then be used, e.g., as the seed to generate pseudo random bit sequences for
securing subsequent transmissions using a stream cipher. By applying the same
techniques at independent subcarriers of the OFDM system, the P-MOPI scheme
easily allows two communicating parties to exchange over 100 secret bits. As a
result, not only secure communication but also the MIMO gain can be guaranteed
by using the P-MOPI scheme.
|
[
{
"version": "v1",
"created": "Fri, 21 Jan 2011 06:55:52 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Lan",
"Pang-Chang",
""
],
[
"Wu",
"Chih-Yao",
""
],
[
"Lee",
"Chia-Han",
""
],
[
"Yeh",
"Ping-Cheng",
""
],
[
"Cheng",
"Chen-Mou",
""
]
] |
new_dataset
| 0.999296 |
1101.4152
|
Manfred Kufleitner
|
Manfred Kufleitner and Alexander Lauser
|
Languages of Dot-depth One over Infinite Words
|
Presented at LICS 2011
| null | null | null |
cs.FL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Over finite words, languages of dot-depth one are expressively complete for
alternation-free first-order logic. This fragment is also known as the Boolean
closure of existential first-order logic. Here, the atomic formulas comprise
order, successor, minimum, and maximum predicates. Knast (1983) has shown that
it is decidable whether a language has dot-depth one. We extend Knast's result
to infinite words. In particular, we describe the class of languages definable
in alternation-free first-order logic over infinite words, and we give an
effective characterization of this fragment. This characterization has two
components. The first component is identical to Knast's algebraic property for
finite words and the second component is a topological property, namely being a
Boolean combination of Cantor sets.
As an intermediate step we consider finite and infinite words simultaneously.
We then obtain the results for infinite words as well as for finite words as
special cases. In particular, we give a new proof of Knast's Theorem on
languages of dot-depth one over finite words.
|
[
{
"version": "v1",
"created": "Fri, 21 Jan 2011 15:00:08 GMT"
},
{
"version": "v2",
"created": "Fri, 1 Apr 2011 17:47:51 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Kufleitner",
"Manfred",
""
],
[
"Lauser",
"Alexander",
""
]
] |
new_dataset
| 0.99869 |
1101.4356
|
Matteo Cristani PhD
|
Elisa Burato and Matteo Cristani and Luca Vigan\`o
|
Meaning Negotiation as Inference
| null | null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Meaning negotiation (MN) is the general process with which agents reach an
agreement about the meaning of a set of terms. Artificial Intelligence scholars
have dealt with the problem of MN by means of argumentations schemes, beliefs
merging and information fusion operators, and ontology alignment but the
proposed approaches depend upon the number of participants. In this paper, we
give a general model of MN for an arbitrary number of agents, in which each
participant discusses with the others her viewpoint by exhibiting it in an
actual set of constraints on the meaning of the negotiated terms. We call this
presentation of individual viewpoints an angle. The agents do not aim at
forming a common viewpoint but, instead, at agreeing about an acceptable common
angle. We analyze separately the process of MN by two agents (\emph{bilateral}
or \emph{pairwise} MN) and by more than two agents (\emph{multiparty} MN), and
we use game theoretic models to understand how the process develops in both
cases: the models are Bargaining Game for bilateral MN and English Auction for
multiparty MN. We formalize the process of reaching such an agreement by giving
a deduction system that comprises of rules that are consistent and adequate for
representing MN.
|
[
{
"version": "v1",
"created": "Sun, 23 Jan 2011 09:49:55 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Burato",
"Elisa",
""
],
[
"Cristani",
"Matteo",
""
],
[
"Viganò",
"Luca",
""
]
] |
new_dataset
| 0.985437 |
1101.4412
|
R\u{a}zvan Deaconescu
|
R\u{a}zvan Deaconescu, Marius Sandu-Popa, Adriana Dr\u{a}ghici,
Nicolae T\u{a}pus
|
BitTorrent Swarm Analysis through Automation and Enhanced Logging
|
ISSN - [Online: 0974 - 9322; Print : 0975- 2293], pages 52-65
|
International Journal of Computer Networks & Communications
(IJCNC), Volume 3, Number 1, 2011
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Peer-to-Peer protocols currently form the most heavily used protocol class in
the Internet, with BitTorrent, the most popular protocol for content
distribution, as its flagship.
A high number of studies and investigations have been undertaken to measure,
analyse and improve the inner workings of the BitTorrent protocol. Approaches
such as tracker message analysis, network probing and packet sniffing have been
deployed to understand and enhance BitTorrent's internal behaviour.
In this paper we present a novel approach that aims to collect, process and
analyse large amounts of local peer information in BitTorrent swarms. We
classify the information as periodic status information able to be monitored in
real time and as verbose logging information to be used for subsequent
analysis. We have designed and implemented a retrieval, storage and
presentation infrastructure that enables easy analysis of BitTorrent protocol
internals. Our approach can be employed both as a comparison tool, as well as a
measurement system of how network characteristics and protocol implementation
influence the overall BitTorrent swarm performance.
We base our approach on a framework that allows easy swarm creation and
control for different BitTorrent clients. With the help of a virtualized
infrastructure and a client-server software layer we are able to create,
command and manage large sized BitTorrent swarms. The framework allows a user
to run, schedule, start, stop clients within a swarm and collect information
regarding their behavior.
|
[
{
"version": "v1",
"created": "Sun, 23 Jan 2011 22:59:20 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Deaconescu",
"Răzvan",
""
],
[
"Sandu-Popa",
"Marius",
""
],
[
"Drăghici",
"Adriana",
""
],
[
"Tăpus",
"Nicolae",
""
]
] |
new_dataset
| 0.998181 |
1101.4479
|
Daoud Clarke
|
Daoud Clarke
|
A Context-theoretic Framework for Compositionality in Distributional
Semantics
|
Submitted to Computational Linguistics on 20th January 2010 for
review
| null | null | null |
cs.CL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Techniques in which words are represented as vectors have proved useful in
many applications in computational linguistics, however there is currently no
general semantic formalism for representing meaning in terms of vectors. We
present a framework for natural language semantics in which words, phrases and
sentences are all represented as vectors, based on a theoretical analysis which
assumes that meaning is determined by context.
In the theoretical analysis, we define a corpus model as a mathematical
abstraction of a text corpus. The meaning of a string of words is assumed to be
a vector representing the contexts in which it occurs in the corpus model.
Based on this assumption, we can show that the vector representations of words
can be considered as elements of an algebra over a field. We note that in
applications of vector spaces to representing meanings of words there is an
underlying lattice structure; we interpret the partial ordering of the lattice
as describing entailment between meanings. We also define the context-theoretic
probability of a string, and, based on this and the lattice structure, a degree
of entailment between strings.
We relate the framework to existing methods of composing vector-based
representations of meaning, and show that our approach generalises many of
these, including vector addition, component-wise multiplication, and the tensor
product.
|
[
{
"version": "v1",
"created": "Mon, 24 Jan 2011 09:52:39 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Clarke",
"Daoud",
""
]
] |
new_dataset
| 0.993759 |
1306.1713
|
Marcin Peczarski
|
Gerold J\"ager, Marcin Peczarski
|
The Worst Case Number of Questions in Generalized AB Game with and
without White-peg Answers
| null |
Discrete Applied Mathematics 184 (2015), pp. 20-31
|
10.1016/j.dam.2014.10.032
| null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The AB game is a two-player game, where the codemaker has to choose a secret
code and the codebreaker has to guess it in as few questions as possible. It is
a variant of the famous Mastermind game, with the only difference that all pegs
in both, the secret and the questions must have distinct colors. In this work,
we consider the Generalized AB game, where for given arbitrary numbers $p$, $c$
with $p \le c$ the secret code consists of $p$ pegs each having one of $c$
colors and the answer consists only of a number of black and white pegs. There
the number of black pegs equals the number of pegs matching in the
corresponding question and the secret in position and color, and the number of
white pegs equals the additional number of pegs matching in the corresponding
question and the secret only in color. We consider also a variant of the
Generalized AB game, where the information of white pegs is omitted. This
variant is called Generalized Black-peg AB game. Let $\ab(p,c)$ and $\abb(p,c)$
be the worst case number of questions for Generalized AB game and Generalized
Black-peg AB game, respectively. Combining a computer program with theoretical
considerations, we confirm known exact values of $\ab(2,c)$ and $\ab(3,c)$ and
prove tight bounds for $\ab(4,c)$. Furthermore, we present exact values for
$\abb(2,c)$ and $\abb(3,c)$ and tight bounds for $\abb(4,c)$.
|
[
{
"version": "v1",
"created": "Fri, 7 Jun 2013 13:07:18 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Jäger",
"Gerold",
""
],
[
"Peczarski",
"Marcin",
""
]
] |
new_dataset
| 0.972186 |
1409.6736
|
Youssef Khmou
|
Youssef Khmou and Said Safi
|
Angle of Arrival Detection with Fifth Order Phase Operators
|
4 pages, 3 figures
|
World Academy of Science, Engineering and Technology,
International Science Index 90, International Journal of Mathematical,
Computational, Physical and Quantum Engineering, 8(6), 961 - 964. (2014)
| null | null |
cs.IT math.IT physics.space-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a fifth order propagator operators are proposed for estimating
the Angles Of Arrival (AOA) of narrowband electromagnetic waves impinging on
antenna array when its number of sensors is larger than the number of radiating
sources.
The array response matrix is partitioned into five linearly dependent phases
to construct the noise projector using five different propagators from non
diagonal blocks of the spectral matrice of the received data; hence, five
different estimators are proposed to estimate the angles of the sources. The
simulation results proved the performance of the proposed estimators in the
presence of white noise comparatively to high resolution eigen based spectra.
|
[
{
"version": "v1",
"created": "Tue, 23 Sep 2014 20:10:03 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Khmou",
"Youssef",
""
],
[
"Safi",
"Said",
""
]
] |
new_dataset
| 0.99305 |
1503.04250
|
Julia Bernd
|
Julia Bernd, Damian Borth, Benjamin Elizalde, Gerald Friedland,
Heather Gallagher, Luke Gottlieb, Adam Janin, Sara Karabashlieva, Jocelyn
Takahashi, Jennifer Won
|
The YLI-MED Corpus: Characteristics, Procedures, and Plans
|
47 pages; 3 figures; 25 tables. Also published as ICSI Technical
Report TR-15-001
| null | null |
TR-15-001
|
cs.MM cs.CL
|
http://creativecommons.org/licenses/by/3.0/
|
The YLI Multimedia Event Detection corpus is a public-domain index of videos
with annotations and computed features, specialized for research in multimedia
event detection (MED), i.e., automatically identifying what's happening in a
video by analyzing the audio and visual content. The videos indexed in the
YLI-MED corpus are a subset of the larger YLI feature corpus, which is being
developed by the International Computer Science Institute and Lawrence
Livermore National Laboratory based on the Yahoo Flickr Creative Commons 100
Million (YFCC100M) dataset. The videos in YLI-MED are categorized as depicting
one of ten target events, or no target event, and are annotated for additional
attributes like language spoken and whether the video has a musical score. The
annotations also include degree of annotator agreement and average annotator
confidence scores for the event categorization of each video. Version 1.0 of
YLI-MED includes 1823 "positive" videos that depict the target events and
48,138 "negative" videos, as well as 177 supplementary videos that are similar
to event videos but are not positive examples. Our goal in producing YLI-MED is
to be as open about our data and procedures as possible. This report describes
the procedures used to collect the corpus; gives detailed descriptive
statistics about the corpus makeup (and how video attributes affected
annotators' judgments); discusses possible biases in the corpus introduced by
our procedural choices and compares it with the most similar existing dataset,
TRECVID MED's HAVIC corpus; and gives an overview of our future plans for
expanding the annotation effort.
|
[
{
"version": "v1",
"created": "Fri, 13 Mar 2015 23:36:42 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Bernd",
"Julia",
""
],
[
"Borth",
"Damian",
""
],
[
"Elizalde",
"Benjamin",
""
],
[
"Friedland",
"Gerald",
""
],
[
"Gallagher",
"Heather",
""
],
[
"Gottlieb",
"Luke",
""
],
[
"Janin",
"Adam",
""
],
[
"Karabashlieva",
"Sara",
""
],
[
"Takahashi",
"Jocelyn",
""
],
[
"Won",
"Jennifer",
""
]
] |
new_dataset
| 0.99224 |
1503.04263
|
Seung Hyun Jeon
|
Seung Hyun Jeon, Sanghong An, Changwoo Yoon, Hyun-woo Lee, and Junkyun
Choi
|
User Centric Content Management System for Open IPTV Over SNS (ICTC2012)
|
10 pages, 17 figures, An earlier version of this paper was awarded as
best paper at the IEEE International Conference on ICT Convergence (ICTC),
Jeju, Korea, October 2012
| null | null | null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coupled schemes between service-oriented architecture (SOA) and Web 2.0 have
recently been researched. Web-based content providers and telecommunications
company (Telecom) based Internet protocol television (IPTV) providers have
struggled against each other to accommodate more three-screen service
subscribers. Since the advent of Web 2.0, more abundant reproduced content can
be circulated. However, because according to increasing device's resolution and
content formats IPTV providers transcode content in advance, network bandwidth,
storage and operation costs for content management systems (CMSs) are wasted.
In this paper, we present a user centric CMS for open IPTV, which integrates
SOA and Web 2.0. Considering content popularity based on a Zipf-like
distribution to solve these problems, we analyze the performance between the
user centric CMS and the conventional Web syndication system for normalized
costs. Based on the user centric CMS, we implement a social Web TV with
device-aware function, which can aggregate, transcode, and deploy content over
social networking service (SNS) independently.
|
[
{
"version": "v1",
"created": "Sat, 14 Mar 2015 03:56:25 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Jeon",
"Seung Hyun",
""
],
[
"An",
"Sanghong",
""
],
[
"Yoon",
"Changwoo",
""
],
[
"Lee",
"Hyun-woo",
""
],
[
"Choi",
"Junkyun",
""
]
] |
new_dataset
| 0.994937 |
1503.04315
|
Marios Papachristou
|
Marios Papachristou
|
Designing and Building a Three-dimensional Projective Scanner for
Smartphones
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One of the frustrating things in the digital fabrication era is that its
media are neither affordable nor easily accessible and usable.
Three-dimensional (3D) fabrication media (DFM) such as 3D Printers and 3D
Scanners have experienced an upsurge in popularity, while the latter remain
expensive and hard to function. With this paper, we aim to present you the
RhoScanner Project - a an affordable and efficient Three-dimensional Projective
Scanner for Smart-phones, hence shedding light on the extended capabilities of
digital fabrication media on popular use.
|
[
{
"version": "v1",
"created": "Sat, 14 Mar 2015 15:36:10 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Papachristou",
"Marios",
""
]
] |
new_dataset
| 0.964948 |
1503.04575
|
Bo Li
|
Qizhi Fang, Bo Li, Xiaohan Shan, Xiaoming Sun
|
The Least-core and Nucleolus of Path Cooperative Games
| null | null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cooperative games provide an appropriate framework for fair and stable profit
distribution in multiagent systems. In this paper, we study the algorithmic
issues on path cooperative games that arise from the situations where some
commodity flows through a network. In these games, a coalition of edges or
vertices is successful if it enables a path from the source to the sink in the
network, and lose otherwise. Based on dual theory of linear programming and the
relationship with flow games, we provide the characterizations on the CS-core,
least-core and nucleolus of path cooperative games. Furthermore, we show that
the least-core and nucleolus are polynomially solvable for path cooperative
games defined on both directed and undirected network.
|
[
{
"version": "v1",
"created": "Mon, 16 Mar 2015 09:11:01 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Fang",
"Qizhi",
""
],
[
"Li",
"Bo",
""
],
[
"Shan",
"Xiaohan",
""
],
[
"Sun",
"Xiaoming",
""
]
] |
new_dataset
| 0.998064 |
1503.04628
|
Nan Li
|
Nan Li, Gunnar Carlsson, Elena Dubrova, Kim Petersen
|
Logic BIST: State-of-the-Art and Open Problems
|
6 pages, 3 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many believe that in-field hardware faults are too rare in practice to
justify the need for Logic Built-In Self-Test (LBIST) in a design. Until now,
LBIST was primarily used in safety-critical applications. However, this may
change soon. First, even if costly methods like burn-in are applied, it is no
longer possible to get rid of all latent defects in devices at leading-edge
technology. Second, demands for high reliability spread to consumer electronics
as smartphones replace our wallets and IDs. However, today many ASIC vendors
are reluctant to use LBIST. In this paper, we describe the needs for successful
deployment of LBIST in the industrial practice and discuss how these needs can
be addressed. Our work is hoped to attract a wider attention to this important
research topic.
|
[
{
"version": "v1",
"created": "Mon, 16 Mar 2015 12:45:04 GMT"
}
] | 2015-03-17T00:00:00 |
[
[
"Li",
"Nan",
""
],
[
"Carlsson",
"Gunnar",
""
],
[
"Dubrova",
"Elena",
""
],
[
"Petersen",
"Kim",
""
]
] |
new_dataset
| 0.999775 |
1307.6505
|
Aleksandar Ilic
|
Aleksandar Ilic
|
On the variable common due date, minimal tardy jobs bicriteria
two-machine flow shop problem with ordered machines
|
6 pages, 1 algorithm
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a special case of the ordinary NP-hard two-machine flow shop
problem with the objective of determining simultaneously a minimal common due
date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An
O(n^2) algorithm for the variable common due date, minimal tardy jobs
bicriteria two-machine flow shop problem with ordered machines, European
Journal of Operational Research 221 (2012), 7-13.], the authors presented
quadratic algorithm for the problem when each job has its smaller processing
time on the first machine. In this note, we improve the running time of the
algorithm to O(n log n) by efficient implementation using recently introduced
modified binary tree data structure.
|
[
{
"version": "v1",
"created": "Wed, 24 Jul 2013 17:41:00 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Mar 2015 17:49:32 GMT"
}
] | 2015-03-16T00:00:00 |
[
[
"Ilic",
"Aleksandar",
""
]
] |
new_dataset
| 0.979032 |
1503.03202
|
Giza Belciug Felicia
|
Marius Cristian Cerlinca, Tudor Ioan Cerlinca, Cristina Elena Turcu,
Remus Catalin Prodan, Felicia Florentina Giza-Belciug
|
Proiectarea si implementarea unui portal HL7
|
4 pages, in Romanian; Distributed Systems (2009) Suceava
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces some techniques used in developing and implementing an
HL7 clinical data portal used in client-server architecture. The HL7 portal is
used by nonHL7 applications that need medical data from HL7 servers. Also, the
portal can translate a large number of HL7 terms between an indefinite number
of languages.
|
[
{
"version": "v1",
"created": "Wed, 11 Mar 2015 07:52:35 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Mar 2015 08:43:27 GMT"
}
] | 2015-03-16T00:00:00 |
[
[
"Cerlinca",
"Marius Cristian",
""
],
[
"Cerlinca",
"Tudor Ioan",
""
],
[
"Turcu",
"Cristina Elena",
""
],
[
"Prodan",
"Remus Catalin",
""
],
[
"Giza-Belciug",
"Felicia Florentina",
""
]
] |
new_dataset
| 0.983202 |
1503.03884
|
Cristina Turcu
|
Turcu Cristina, Cerlinca Tudor, Cerlinca Marius, Prodan Remus, Turcu
Cornel, G\^iza Felicia
|
An RFID-based Clinical Information System for Identification and
Monitoring of Patients
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Managing health-care records and information is an imperative necessity. Most
patient health records are stored in separate systems and there are still huge
paper trails of records that health-care providers must keep to comply with
different regulations. This paper proposes an RFID-based system, named SIMOPAC,
that integrate RFID technology in health care in order to make patient
emergency care as efficient and risk-free as possible, by providing doctors
with as much information about a patient as quickly as possible. Every hospital
could use SIMOPAC with their existing system in order to promote patient safety
and optimize hospital workflow. We will concentrate on the RFID technology and
how it could be used in emergency care. We describe a general purpose
architecture and data model that is designed for collecting ambulatory data
from various existing devices and systems, as well as for storing and
presenting clinically significant information to the emergency care physician.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2015 20:43:44 GMT"
}
] | 2015-03-16T00:00:00 |
[
[
"Cristina",
"Turcu",
""
],
[
"Tudor",
"Cerlinca",
""
],
[
"Marius",
"Cerlinca",
""
],
[
"Remus",
"Prodan",
""
],
[
"Cornel",
"Turcu",
""
],
[
"Felicia",
"Gîza",
""
]
] |
new_dataset
| 0.990184 |
1503.03940
|
Yixin Sun
|
Yixin Sun, Anne Edmundson, Laurent Vanbever, Oscar Li, Jennifer
Rexford, Mung Chiang, Prateek Mittal
|
RAPTOR: Routing Attacks on Privacy in Tor
| null | null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Tor network is a widely used system for anonymous communication. However,
Tor is known to be vulnerable to attackers who can observe traffic at both ends
of the communication path. In this paper, we show that prior attacks are just
the tip of the iceberg. We present a suite of new attacks, called Raptor, that
can be launched by Autonomous Systems (ASes) to compromise user anonymity.
First, AS-level adversaries can exploit the asymmetric nature of Internet
routing to increase the chance of observing at least one direction of user
traffic at both ends of the communication. Second, AS-level adversaries can
exploit natural churn in Internet routing to lie on the BGP paths for more
users over time. Third, strategic adversaries can manipulate Internet routing
via BGP hijacks (to discover the users using specific Tor guard nodes) and
interceptions (to perform traffic analysis). We demonstrate the feasibility of
Raptor attacks by analyzing historical BGP data and Traceroute data as well as
performing real-world attacks on the live Tor network, while ensuring that we
do not harm real users. In addition, we outline the design of two monitoring
frameworks to counter these attacks: BGP monitoring to detect control-plane
attacks, and Traceroute monitoring to detect data-plane anomalies. Overall, our
work motivates the design of anonymity systems that are aware of the dynamics
of Internet routing.
|
[
{
"version": "v1",
"created": "Fri, 13 Mar 2015 03:05:32 GMT"
}
] | 2015-03-16T00:00:00 |
[
[
"Sun",
"Yixin",
""
],
[
"Edmundson",
"Anne",
""
],
[
"Vanbever",
"Laurent",
""
],
[
"Li",
"Oscar",
""
],
[
"Rexford",
"Jennifer",
""
],
[
"Chiang",
"Mung",
""
],
[
"Mittal",
"Prateek",
""
]
] |
new_dataset
| 0.993279 |
1503.03954
|
Yun Liao
|
Yun Liao, Lingyang Song, Zhu Han, Yonghui Li
|
Full-Duplex Cognitive Radio: A New Design Paradigm for Enhancing
Spectrum Usage
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the rapid growth of demand for ever-increasing data rate, spectrum
resources have become more and more scarce. As a promising technique to
increase the efficiency of the spectrum utilization, cognitive radio (CR)
technique has the great potential to meet such a requirement by allowing
un-licensed users to coexist in licensed bands. In conventional CR systems, the
spectrum sensing is performed at the beginning of each time slot before the
data transmission. This unfortunately results in two major problems: 1)
transmission time reduction due to sensing, and 2) sensing accuracy impairment
due to data transmission. To tackle these problems, in this paper we present a
new design paradigm for future CR by exploring the full-duplex (FD) techniques
to achieve the simultaneous spectrum sensing and data transmission. With FD
radios equipped at the secondary users (SUs), SUs can simultaneously sense and
access the vacant spectrum, and thus, significantly improve sensing
performances and meanwhile increase data transmission efficiency. The aim of
this article is to transform the promising conceptual framework into the
practical wireless network design by addressing a diverse set of challenges
such as protocol design and theoretical analysis. Several application scenarios
with FD enabled CR are elaborated, and key open research directions and novel
algorithms in these systems are discussed.
|
[
{
"version": "v1",
"created": "Fri, 13 Mar 2015 05:07:39 GMT"
}
] | 2015-03-16T00:00:00 |
[
[
"Liao",
"Yun",
""
],
[
"Song",
"Lingyang",
""
],
[
"Han",
"Zhu",
""
],
[
"Li",
"Yonghui",
""
]
] |
new_dataset
| 0.994388 |
1503.04006
|
Jaydeb Bhaumik
|
Jaydeb Bhaumik
|
Synthesis of all Maximum Length Cellular Automata of Cell Size up to 12
|
10 pages
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Maximum length CA has wide range of applications in design of linear block
code, cryptographic primitives and VLSI testing particularly in
Built-In-Self-Test. In this paper, an algorithm to compute all $n$-cell maximum
length CA-rule vectors is proposed. Also rule vectors for each primitive
polynomial in GF(2^2) to GF(2^{12} have been computed by simulation and they
have been listed.Programmable rule vectors based maximum length CA can be used
to design cryptographic primitives.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2015 12:09:37 GMT"
}
] | 2015-03-16T00:00:00 |
[
[
"Bhaumik",
"Jaydeb",
""
]
] |
new_dataset
| 0.998351 |
1004.0403
|
Alessandro Colantonio
|
Alessandro Colantonio and Roberto Di Pietro
|
CONCISE: Compressed 'n' Composable Integer Set
|
Preprint submitted to Information Processing Letters, 7 pages
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bit arrays, or bitmaps, are used to significantly speed up set operations in
several areas, such as data warehousing, information retrieval, and data
mining, to cite a few. However, bitmaps usually use a large storage space, thus
requiring compression. Nevertheless, there is a space-time tradeoff among
compression schemes. The Word Aligned Hybrid (WAH) bitmap compression trades
some space to allow for bitwise operations without first decompressing bitmaps.
WAH has been recognized as the most efficient scheme in terms of computation
time. In this paper we present CONCISE (Compressed 'n' Composable Integer Set),
a new scheme that enjoys significatively better performances than those of WAH.
In particular, when compared to WAH, our algorithm is able to reduce the
required memory up to 50%, by having similar or better performance in terms of
computation time. Further, we show that CONCISE can be efficiently used to
manipulate bitmaps representing sets of integral numbers in lieu of well-known
data structures such as arrays, lists, hashtables, and self-balancing binary
search trees. Extensive experiments over synthetic data show the effectiveness
of our approach.
|
[
{
"version": "v1",
"created": "Sat, 3 Apr 2010 00:07:00 GMT"
}
] | 2015-03-14T00:00:00 |
[
[
"Colantonio",
"Alessandro",
""
],
[
"Di Pietro",
"Roberto",
""
]
] |
new_dataset
| 0.992385 |
1004.0744
|
Valentin Brimkov
|
Valentin E. Brimkov
|
Patrolling a Street Network is Strongly NP-Complete but in P for Tree
Structures
| null | null | null | null |
cs.CG cs.CC cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the following problem: Given a finite set of straight line
segments in the plane, determine the positions of a minimal number of points on
the segments, from which guards can see all segments. This problem can be
interpreted as looking for a minimal number of locations of policemen, guards,
cameras or other sensors, that can observe a network of streets, corridors,
tunnels, tubes, etc. We show that the problem is strongly NP-complete even for
a set of segments with a cubic graph structure, but in P for tree structures.
|
[
{
"version": "v1",
"created": "Tue, 6 Apr 2010 01:06:27 GMT"
}
] | 2015-03-14T00:00:00 |
[
[
"Brimkov",
"Valentin E.",
""
]
] |
new_dataset
| 0.995941 |
1004.1503
|
Tuvi Etzion
|
Tuvi Etzion and Alexander Vardy
|
A New Construction for Constant Weight Codes
|
5 pages, to be presented in ISIT2014, melbourne, Australia
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new construction for constant weight codes is presented. The codes are
constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These
subspaces form a constant dimension code in the Grassmannian space
$\cG_q(n,k)$. Some of the constructed codes are optimal constant weight codes
with parameters not known before. An efficient algorithm for error-correction
is given for the constructed codes. If the constant dimension code has an
efficient encoding and decoding algorithms then also the constructed constant
weight code has an efficient encoding and decoding algorithms.
|
[
{
"version": "v1",
"created": "Fri, 9 Apr 2010 09:13:34 GMT"
},
{
"version": "v2",
"created": "Mon, 3 Mar 2014 19:45:40 GMT"
},
{
"version": "v3",
"created": "Tue, 8 Jul 2014 19:57:35 GMT"
}
] | 2015-03-14T00:00:00 |
[
[
"Etzion",
"Tuvi",
""
],
[
"Vardy",
"Alexander",
""
]
] |
new_dataset
| 0.996675 |
1004.2303
|
Lawrence Ong
|
Lawrence Ong, Sarah J. Johnson, and Christopher M. Kellett
|
The Binary-Symmetric Parallel-Relay Network
|
accepted and to be presented at ISIT 2010
|
Proceedings of the 2010 IEEE International Sysmposium on
Information Theory (ISIT 2010), Austin, USA, pp. 654-658, June 13-18, 2010
|
10.1109/ISIT.2010.5513571
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present capacity results of the binary-symmetric parallel-relay network,
where there is one source, one destination, and K relays in parallel. We show
that forwarding relays, where the relays merely transmit their received
signals, achieve the capacity in two ways: with coded transmission at the
source and a finite number of relays, or uncoded transmission at the source and
a sufficiently large number of relays. On the other hand, decoding relays,
where the relays decode the source message, re-encode, and forward it to the
destination, achieve the capacity when the number of relays is small.
|
[
{
"version": "v1",
"created": "Wed, 14 Apr 2010 01:49:30 GMT"
}
] | 2015-03-14T00:00:00 |
[
[
"Ong",
"Lawrence",
""
],
[
"Johnson",
"Sarah J.",
""
],
[
"Kellett",
"Christopher M.",
""
]
] |
new_dataset
| 0.999575 |
1004.2434
|
Deniz Gunduz
|
Deniz Gunduz, Aylin Yener, Andrea Goldsmith and H. Vincent Poor
|
The Multi-way Relay Channel
|
Revised version of our submission to the Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The multiuser communication channel, in which multiple users exchange
information with the help of a relay terminal, termed the multi-way relay
channel (mRC), is introduced. In this model, multiple interfering clusters of
users communicate simultaneously, where the users within the same cluster wish
to exchange messages among themselves. It is assumed that the users cannot
receive each other's signals directly, and hence the relay terminal in this
model is the enabler of communication. In particular, restricted encoders,
which ignore the received channel output and use only the corresponding
messages for generating the channel input, are considered. Achievable rate
regions and an outer bound are characterized for the Gaussian mRC, and their
comparison is presented in terms of exchange rates in a symmetric Gaussian
network scenario. It is shown that the compress-and-forward (CF) protocol
achieves exchange rates within a constant bit offset of the exchange capacity
independent of the power constraints of the terminals in the network. A finite
bit gap between the exchange rates achieved by the CF and the
amplify-and-forward (AF) protocols is also shown. The two special cases of the
mRC, the full data exchange model, in which every user wants to receive
messages of all other users, and the pairwise data exchange model which
consists of multiple two-way relay channels, are investigated in detail. In
particular for the pairwise data exchange model, in addition to the proposed
random coding based achievable schemes, a nested lattice coding based scheme is
also presented and is shown to achieve exchange rates within a constant bit gap
of the exchange capacity.
|
[
{
"version": "v1",
"created": "Wed, 14 Apr 2010 16:10:03 GMT"
},
{
"version": "v2",
"created": "Mon, 27 Feb 2012 14:06:13 GMT"
}
] | 2015-03-14T00:00:00 |
[
[
"Gunduz",
"Deniz",
""
],
[
"Yener",
"Aylin",
""
],
[
"Goldsmith",
"Andrea",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.999157 |
0707.1151
|
Philip Baback Alipour
|
P. B. Alipour
|
Logic, Design & Organization of PTVD-SHAM; A Parallel Time Varying &
Data Super-helical Access Memory
|
34 pages, 5 figures (2 multi-figures), 1 table. v.1 & v.2: corrupt
file layout due to *.doc file's bad conversion; v.3: fig.2.1 corruption; v.4:
correction to v.1-3; v.5: major content revision, spacing levelled; v.6+:
theorems, hypotheses content, restructured and conformed with its new topic
[arXiv:0710.0244v1] published in cs.CE category. (Avoid corrupted versions.)
| null | null | null |
cs.AR
| null |
This paper encompasses a super helical memory system's design, 'Boolean logic
& image-logic' as a theoretical concept of an invention-model to 'store
time-data' in terms of anticipating the best memory location ever for
data/time. A waterfall effect is deemed to assist the process of
potential-difference output-switch into diverse logic states in quantum dot
computational methods via utilizing coiled carbon nanotubes (CCNTs) and carbon
nanotube field effect transistors (CNFETs). A 'quantum confinement' is thus
derived for a flow of particles in a categorized quantum well substrate with a
normalized capacitance rectifying high B-field flux into electromagnetic
induction. Multi-access of coherent sequences of 'qubit addressing' is gained
in any magnitude as pre-defined for the orientation of array displacement.
Briefly, Gaussian curvature of k<0 is debated in aim of specifying the 2D
electron gas characteristics in scenarios where data is stored in short
intervals versus long ones e.g. when k'>(k<0) for greater CCNT diameters,
space-time continuum is folded by chance for the particle. This benefits from
Maxwell-Lorentz theory in Minkowski's space-time viewpoint alike to crystal
oscillators for precise data timing purposes and radar systems e.g., time
varying self-clocking devices in diverse geographic locations. This application
could also be optional for data depository versus extraction, in the best
supercomputer system's locations, autonomously. For best performance in
minimizing current limiting mechanisms including electromigration, a multilevel
metallization and implant process forming elevated sources/drains for the
circuit's staircase pyramidal construction, is discussed accordingly.
|
[
{
"version": "v1",
"created": "Mon, 9 Jul 2007 19:26:06 GMT"
},
{
"version": "v2",
"created": "Mon, 9 Jul 2007 20:48:51 GMT"
},
{
"version": "v3",
"created": "Thu, 12 Jul 2007 18:36:06 GMT"
},
{
"version": "v4",
"created": "Thu, 12 Jul 2007 20:06:57 GMT"
},
{
"version": "v5",
"created": "Wed, 18 Jul 2007 11:22:22 GMT"
},
{
"version": "v6",
"created": "Tue, 2 Oct 2007 16:31:53 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Alipour",
"P. B.",
""
]
] |
new_dataset
| 0.971382 |
0806.2513
|
Olli Pottonen
|
Patric R. J. \"Osterg{\aa}rd and Olli Pottonen
|
The Perfect Binary One-Error-Correcting Codes of Length 15: Part
I--Classification
|
6 pages. v3: made the codes available in the source of this paper
|
IEEE Trans. Inform. Theory 55 (2009), 4657-4660
|
10.1109/TIT.2009.2027525
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A complete classification of the perfect binary one-error-correcting codes of
length 15 as well as their extensions of length 16 is presented. There are 5983
such inequivalent perfect codes and 2165 extended perfect codes. Efficient
generation of these codes relies on the recent classification of Steiner
quadruple systems of order 16. Utilizing a result of Blackmore, the optimal
binary one-error-correcting codes of length 14 and the (15, 1024, 4) codes are
also classified; there are 38408 and 5983 such codes, respectively.
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2008 07:58:28 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Jun 2009 10:20:09 GMT"
},
{
"version": "v3",
"created": "Wed, 30 Dec 2009 18:56:05 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Östergård",
"Patric R. J.",
""
],
[
"Pottonen",
"Olli",
""
]
] |
new_dataset
| 0.996891 |
0809.2978
|
Jon Wilkening
|
Jon Wilkening and Jia Yu
|
A local construction of the Smith normal form of a matrix polynomial
|
26 pages, 6 figures; introduction expanded, 10 references added, two
additional tests performed
| null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an algorithm for computing a Smith form with multipliers of a
regular matrix polynomial over a field. This algorithm differs from previous
ones in that it computes a local Smith form for each irreducible factor in the
determinant separately and then combines them into a global Smith form, whereas
other algorithms apply a sequence of unimodular row and column operations to
the original matrix. The performance of the algorithm in exact arithmetic is
reported for several test cases.
|
[
{
"version": "v1",
"created": "Wed, 17 Sep 2008 18:58:42 GMT"
},
{
"version": "v2",
"created": "Wed, 9 Jun 2010 19:23:17 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Wilkening",
"Jon",
""
],
[
"Yu",
"Jia",
""
]
] |
new_dataset
| 0.982454 |
0902.1786
|
Shuai Zhang
|
Christian Schlegel and Shuai Zhang
|
On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes
|
15 pages, submitted to IEEE Trans. Inf. Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is shown that dominant trapping sets of regular LDPC codes, so called
absorption sets, undergo a two-phased dynamic behavior in the iterative
message-passing decoding algorithm. Using a linear dynamic model for the
iteration behavior of these sets, it is shown that they undergo an initial
geometric growth phase which stabilizes in a final bit-flipping behavior where
the algorithm reaches a fixed point. This analysis is shown to lead to very
accurate numerical calculations of the error floor bit error rates down to
error rates that are inaccessible by simulation. The topology of the dominant
absorption sets of an example code, the IEEE 802.3an (2048,1723) regular LDPC
code, are identified and tabulated using topological relationships in
combination with search algorithms.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2009 00:29:55 GMT"
},
{
"version": "v2",
"created": "Wed, 11 Feb 2009 23:40:14 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Schlegel",
"Christian",
""
],
[
"Zhang",
"Shuai",
""
]
] |
new_dataset
| 0.961986 |
0908.4499
|
Yann Strozecki
|
Yann Strozecki
|
Monadic second-order model-checking on decomposable matroids
|
32 pages, journal paper. Revision: the last part has been removed and
the writing improved
| null | null | null |
cs.DM cs.DS cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A notion of branch-width, which generalizes the one known for graphs, can be
defined for matroids. We first give a proof of the polynomial time
model-checking of monadic second-order formulas on representable matroids of
bounded branch-width, by reduction to monadic second-order formulas on trees.
This proof is much simpler than the one previously known. We also provide a
link between our logical approach and a grammar that allows to build matroids
of bounded branch-width. Finally, we introduce a new class of non-necessarily
representable matroids, described by a grammar and on which monadic
second-order formulas can be checked in linear time.
|
[
{
"version": "v1",
"created": "Mon, 31 Aug 2009 11:00:44 GMT"
},
{
"version": "v2",
"created": "Sat, 29 Jan 2011 23:43:14 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Strozecki",
"Yann",
""
]
] |
new_dataset
| 0.994918 |
0909.0704
|
Lav Varshney
|
Ha Q. Nguyen, Lav R. Varshney, and Vivek K Goyal
|
Concentric Permutation Source Codes
| null |
IEEE Transactions on Communications, vol. 58, no. 11, pp.
3154-3164, November 2010
|
10.1109/TCOMM.2010.101210.090535
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Permutation codes are a class of structured vector quantizers with a
computationally-simple encoding procedure based on sorting the scalar
components. Using a codebook comprising several permutation codes as subcodes
preserves the simplicity of encoding while increasing the number of
rate-distortion operating points, improving the convex hull of operating
points, and increasing design complexity. We show that when the subcodes are
designed with the same composition, optimization of the codebook reduces to a
lower-dimensional vector quantizer design within a single cone. Heuristics for
reducing design complexity are presented, including an optimization of the rate
allocation in a shape-gain vector quantizer with gain-dependent wrapped
spherical shape codebook.
|
[
{
"version": "v1",
"created": "Thu, 3 Sep 2009 16:33:18 GMT"
},
{
"version": "v2",
"created": "Sat, 19 Sep 2009 21:32:37 GMT"
},
{
"version": "v3",
"created": "Wed, 14 Apr 2010 01:10:13 GMT"
},
{
"version": "v4",
"created": "Wed, 23 Jun 2010 19:19:31 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Nguyen",
"Ha Q.",
""
],
[
"Varshney",
"Lav R.",
""
],
[
"Goyal",
"Vivek K",
""
]
] |
new_dataset
| 0.989961 |
0909.2009
|
Claudio Weidmann
|
Claudio Weidmann and Gottfried Lechner
|
A Fresh Look at Coding for q-ary Symmetric Channels
|
12 pages, 6 figures; revision submitted to IEEE Trans. Inform. Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies coding schemes for the $q$-ary symmetric channel based on
binary low-density parity-check (LDPC) codes that work for any alphabet size
$q=2^m$, $m\in\mathbb{N}$, thus complementing some recently proposed
packet-based schemes requiring large $q$. First, theoretical optimality of a
simple layered scheme is shown, then a practical coding scheme based on a
simple modification of standard binary LDPC decoding is proposed. The decoder
is derived from first principles and using a factor-graph representation of a
front-end that maps $q$-ary symbols to groups of $m$ bits connected to a binary
code. The front-end can be processed with a complexity that is linear in
$m=\log_2 q$. An extrinsic information transfer chart analysis is carried out
and used for code optimization. Finally, it is shown how the same decoder
structure can also be applied to a larger class of $q$-ary channels.
|
[
{
"version": "v1",
"created": "Thu, 10 Sep 2009 18:17:30 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Dec 2011 15:52:39 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Weidmann",
"Claudio",
""
],
[
"Lechner",
"Gottfried",
""
]
] |
new_dataset
| 0.954697 |
0910.3028
|
Natasha Devroye
|
Stefano Rini, Daniela Tuninetti, Natasha Devroye
|
State of the cognitive interference channel: a new unified inner bound
|
Presented at the 2010 International Zurich Seminar on Communications
- an 2nd updated version.
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity region of the interference channel in which one transmitter
non-causally knows the message of the other, termed the cognitive interference
channel, has remained open since its inception in 2005. A number of subtly
differing achievable rate regions and outer bounds have been derived, some of
which are tight under specific conditions. In this work we present a new
unified inner bound for the discrete memoryless cognitive interference channel.
We show explicitly how it encompasses all known discrete memoryless achievable
rate regions as special cases. The presented achievable region was recently
used in deriving the capacity region of the general deterministic cognitive
interference channel, and thus also the linear high-SNR deterministic
approximation of the Gaussian cognitive interference channel. The high-SNR
deterministic approximation was then used to obtain the capacity of the
Gaussian cognitive interference channel to within 1.87 bits.
|
[
{
"version": "v1",
"created": "Fri, 16 Oct 2009 03:14:05 GMT"
},
{
"version": "v2",
"created": "Thu, 11 Mar 2010 05:45:48 GMT"
},
{
"version": "v3",
"created": "Fri, 19 Mar 2010 22:35:24 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Rini",
"Stefano",
""
],
[
"Tuninetti",
"Daniela",
""
],
[
"Devroye",
"Natasha",
""
]
] |
new_dataset
| 0.995486 |
0910.3511
|
Haya Shulman
|
Amir Herzberg and Haya Shulman
|
Stealth-MITM DoS Attacks on Secure Channels
|
14 figures; 21 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define stealth Man-in-the-Middle adversaries, and analyse their ability to
launch denial and degradation of service (DoS) attacks on secure channels. We
show realistic attacks, disrupting TCP communication over secure VPNs using
IPsec. We present:
First amplifying DoS attack on IPsec, when deployed without anti-replay
window.
First amplifying attack on IPsec, when deployed with a `small' anti-replay
window, and analysis of `sufficient' window size.
First amplifying attack on IPsec, when deployed with `sufficient' window
size. This attack (as the previous) is realistic: attacker needs only to
duplicate and speed-up few packets.
We also suggest a solution designed to prevent the presented attacks, and to
provide secure channel immune to degradation and other DoS attacks. Our
solution involves changes (only) to the two gateway machines running IPsec.
In addition to their practical importance, our results also raise the
challenge of formally defining secure channels immune to DoS and degradation
attacks, and providing provably-secure implementations.
|
[
{
"version": "v1",
"created": "Mon, 19 Oct 2009 10:25:17 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Herzberg",
"Amir",
""
],
[
"Shulman",
"Haya",
""
]
] |
new_dataset
| 0.999081 |
0912.0027
|
Yunhui Fu
|
Matthew Cook and Yunhui Fu and Robert T. Schweller
|
Temperature 1 Self-Assembly: Deterministic Assembly in 3D and
Probabilistic Assembly in 2D
| null | null | null | null |
cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the power of the Wang tile self-assembly model at temperature
1, a threshold value that permits attachment between any two tiles that share
even a single bond. When restricted to deterministic assembly in the plane, no
temperature 1 assembly system has been shown to build a shape with a tile
complexity smaller than the diameter of the shape. In contrast, we show that
temperature 1 self-assembly in 3 dimensions, even when growth is restricted to
at most 1 step into the third dimension, is capable of simulating a large class
of temperature 2 systems, in turn permitting the simulation of arbitrary Turing
machines and the assembly of $n\times n$ squares in near optimal $O(\log n)$
tile complexity. Further, we consider temperature 1 probabilistic assembly in
2D, and show that with a logarithmic scale up of tile complexity and shape
scale, the same general class of temperature $\tau=2$ systems can be simulated
with high probability, yielding Turing machine simulation and $O(\log^2 n)$
assembly of $n\times n$ squares with high probability. Our results show a sharp
contrast in achievable tile complexity at temperature 1 if either growth into
the third dimension or a small probability of error are permitted. Motivated by
applications in nanotechnology and molecular computing, and the plausibility of
implementing 3 dimensional self-assembly systems, our techniques may provide
the needed power of temperature 2 systems, while at the same time avoiding the
experimental challenges faced by those systems.
|
[
{
"version": "v1",
"created": "Mon, 30 Nov 2009 21:45:29 GMT"
},
{
"version": "v2",
"created": "Thu, 13 May 2010 00:12:03 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Cook",
"Matthew",
""
],
[
"Fu",
"Yunhui",
""
],
[
"Schweller",
"Robert T.",
""
]
] |
new_dataset
| 0.992036 |
1001.0210
|
Alexander Vardy
|
Hessam Mahdavifar and Alexander Vardy
|
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
|
15 pages, to appear in the IEEE Transactions on Information Theory
| null | null | null |
cs.IT cs.CR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Suppose Alice wishes to send messages to Bob through a communication channel
C_1, but her transmissions also reach an eavesdropper Eve through another
channel C_2. The goal is to design a coding scheme that makes it possible for
Alice to communicate both reliably and securely. Reliability is measured in
terms of Bob's probability of error in recovering the message, while security
is measured in terms of Eve's equivocation ratio. Wyner showed that the
situation is characterized by a single constant C_s, called the secrecy
capacity, which has the following meaning: for all $\epsilon > 0$, there exist
coding schemes of rate $R \ge C_s - \epsilon$ that asymptotically achieve both
the reliability and the security objectives. However, his proof of this result
is based upon a nonconstructive random-coding argument. To date, despite a
considerable research effort, the only case where we know how to construct
coding schemes that achieve secrecy capacity is when Eve's channel C_2 is an
erasure channel, or a combinatorial variation thereof.
Polar codes were recently invented by Arikan; they approach the capacity of
symmetric binary-input discrete memoryless channels with low encoding and
decoding complexity. Herein, we use polar codes to construct a coding scheme
that achieves the secrecy capacity for a wide range of wiretap channels. Our
construction works for any instantiation of the wiretap channel model, as long
as both C_1 and C_2 are symmetric and binary-input, and C_2 is degraded with
respect to C_1. Moreover, we show how to modify our construction in order to
provide strong security, in the sense defined by Maurer, while still operating
at a rate that approaches the secrecy capacity. In this case, we cannot
guarantee that the reliability condition will be satisfied unless the main
channel C_1 is noiseless, although we believe it can be always satisfied in
practice.
|
[
{
"version": "v1",
"created": "Fri, 1 Jan 2010 05:30:10 GMT"
},
{
"version": "v2",
"created": "Mon, 4 Apr 2011 00:48:19 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Mahdavifar",
"Hessam",
""
],
[
"Vardy",
"Alexander",
""
]
] |
new_dataset
| 0.993982 |
1001.0592
|
Georgios Zervas
|
John W. Byers, Michael Mitzenmacher, Georgios Zervas
|
Information Asymmetries in Pay-Per-Bid Auctions: How Swoopo Makes Bank
|
48 pages, 21 figures
| null | null | null |
cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Innovative auction methods can be exploited to increase profits, with
Shubik's famous "dollar auction" perhaps being the most widely known example.
Recently, some mainstream e-commerce web sites have apparently achieved the
same end on a much broader scale, by using "pay-per-bid" auctions to sell
items, from video games to bars of gold. In these auctions, bidders incur a
cost for placing each bid in addition to (or sometimes in lieu of) the winner's
final purchase cost. Thus even when a winner's purchase cost is a small
fraction of the item's intrinsic value, the auctioneer can still profit
handsomely from the bid fees. Our work provides novel analyses for these
auctions, based on both modeling and datasets derived from auctions at
Swoopo.com, the leading pay-per-bid auction site. While previous modeling work
predicts profit-free equilibria, we analyze the impact of information asymmetry
broadly, as well as Swoopo features such as bidpacks and the Swoop It Now
option specifically, to quantify the effects of imperfect information in these
auctions. We find that even small asymmetries across players (cheaper bids,
better estimates of other players' intent, different valuations of items,
committed players willing to play "chicken") can increase the auction duration
well beyond that predicted by previous work and thus skew the auctioneer's
profit disproportionately. Finally, we discuss our findings in the context of a
dataset of thousands of live auctions we observed on Swoopo, which enables us
also to examine behavioral factors, such as the power of aggressive bidding.
Ultimately, our findings show that even with fully rational players, if players
overlook or are unaware any of these factors, the result is outsized profits
for pay-per-bid auctioneers.
|
[
{
"version": "v1",
"created": "Tue, 5 Jan 2010 16:31:06 GMT"
},
{
"version": "v2",
"created": "Wed, 13 Jan 2010 19:58:07 GMT"
},
{
"version": "v3",
"created": "Tue, 30 Mar 2010 21:51:26 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Byers",
"John W.",
""
],
[
"Mitzenmacher",
"Michael",
""
],
[
"Zervas",
"Georgios",
""
]
] |
new_dataset
| 0.989028 |
1001.5019
|
Siamak Tazari
|
Stephan Kreutzer and Siamak Tazari
|
Lower Bounds for the Complexity of Monadic Second-Order Logic
|
Preliminary version appeared in proceedings of the 25th IEEE
symposium on Logic in Computer Science (LICS'10), Edinburgh, Scotland, UK,
pp. 189-198, 2010
| null | null | null |
cs.LO cs.CC cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Courcelle's famous theorem from 1990 states that any property of graphs
definable in monadic second-order logic (MSO) can be decided in linear time on
any class of graphs of bounded treewidth, or in other words, MSO is
fixed-parameter tractable in linear time on any such class of graphs. From a
logical perspective, Courcelle's theorem establishes a sufficient condition, or
an upper bound, for tractability of MSO-model checking.
Whereas such upper bounds on the complexity of logics have received
significant attention in the literature, almost nothing is known about
corresponding lower bounds. In this paper we establish a strong lower bound for
the complexity of monadic second-order logic. In particular, we show that if C
is any class of graphs which is closed under taking subgraphs and whose
treewidth is not bounded by a polylogarithmic function (in fact, $\log^c n$ for
some small c suffices) then MSO-model checking is intractable on C (under a
suitable assumption from complexity theory).
|
[
{
"version": "v1",
"created": "Wed, 27 Jan 2010 20:51:47 GMT"
},
{
"version": "v2",
"created": "Thu, 23 Jun 2011 20:50:43 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Kreutzer",
"Stephan",
""
],
[
"Tazari",
"Siamak",
""
]
] |
new_dataset
| 0.951843 |
1002.3188
|
Sung Hoon LIm
|
Sung Hoon Lim, Young-Han Kim, Abbas El Gamal, Sae-Young Chung
|
Noisy Network Coding
|
33 pages, 4 figures, submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A noisy network coding scheme for sending multiple sources over a general
noisy network is presented. For multi-source multicast networks, the scheme
naturally extends both network coding over noiseless networks by Ahlswede, Cai,
Li, and Yeung, and compress-forward coding for the relay channel by Cover and
El Gamal to general discrete memoryless and Gaussian networks. The scheme also
recovers as special cases the results on coding for wireless relay networks and
deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless
erasure networks by Dana, Gowaikar, Palanki, Hassibi, and Effros. The scheme
involves message repetition coding, relay signal compression, and simultaneous
decoding. Unlike previous compress--forward schemes, where independent messages
are sent over multiple blocks, the same message is sent multiple times using
independent codebooks as in the network coding scheme for cyclic networks.
Furthermore, the relays do not use Wyner--Ziv binning as in previous
compress-forward schemes, and each decoder performs simultaneous joint
typicality decoding on the received signals from all the blocks without
explicitly decoding the compression indices. A consequence of this new scheme
is that achievability is proved simply and more generally without resorting to
time expansion to extend results for acyclic networks to networks with cycles.
The noisy network coding scheme is then extended to general multi-source
networks by combining it with decoding techniques for interference channels.
For the Gaussian multicast network, noisy network coding improves the
previously established gap to the cutset bound. We also demonstrate through two
popular AWGN network examples that noisy network coding can outperform
conventional compress-forward, amplify-forward, and hash-forward schemes.
|
[
{
"version": "v1",
"created": "Tue, 16 Feb 2010 23:48:31 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Mar 2010 00:01:19 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Lim",
"Sung Hoon",
""
],
[
"Kim",
"Young-Han",
""
],
[
"Gamal",
"Abbas El",
""
],
[
"Chung",
"Sae-Young",
""
]
] |
new_dataset
| 0.982713 |
1003.1266
|
Ulrike von Luxburg
|
Ulrike von Luxburg, Agnes Radl, Matthias Hein
|
Hitting and commute times in large graphs are often misleading
| null | null | null | null |
cs.DS cs.LG math.PR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Next to the shortest path distance, the second most popular distance function
between vertices in a graph is the commute distance (resistance distance). For
two vertices u and v, the hitting time H_{uv} is the expected time it takes a
random walk to travel from u to v. The commute time is its symmetrized version
C_{uv} = H_{uv} + H_{vu}. In our paper we study the behavior of hitting times
and commute distances when the number n of vertices in the graph is very large.
We prove that as n converges to infinty, hitting times and commute distances
converge to expressions that do not take into account the global structure of
the graph at all. Namely, the hitting time H_{uv} converges to 1/d_v and the
commute time to 1/d_u + 1/d_v where d_u and d_v denote the degrees of vertices
u and v. In these cases, the hitting and commute times are misleading in the
sense that they do not provide information about the structure of the graph. We
focus on two major classes of random graphs: random geometric graphs (k-nearest
neighbor graphs, epsilon-graphs, Gaussian similarity graphs) and random graphs
with given expected degrees (in particular, Erdos-Renyi graphs with and without
planted partitions)
|
[
{
"version": "v1",
"created": "Fri, 5 Mar 2010 13:54:11 GMT"
},
{
"version": "v2",
"created": "Thu, 26 May 2011 08:07:41 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"von Luxburg",
"Ulrike",
""
],
[
"Radl",
"Agnes",
""
],
[
"Hein",
"Matthias",
""
]
] |
new_dataset
| 0.987195 |
1003.1684
|
R\"udiger Ehlers
|
Ruediger Ehlers
|
Generalised Rabin(1) synthesis
|
14 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a novel method for the synthesis of finite state systems that is a
generalisation of the generalised reactivity(1) synthesis approach by Piterman,
Pnueli and Sa'ar. In particular, we describe an efficient method to synthesize
systems from linear-time temporal logic specifications for which all
assumptions and guarantees have a Rabin index of one. We show how to build a
parity game with at most five colours that captures all solutions to the
synthesis problem from such a specification. This parity game has a structure
that is amenable to symbolic implementations. We furthermore show that the
results obtained are in some sense tight, i.e., that there does not exist a
similar synthesis method for assumptions and specifications of higher Rabin
index, unless P=NP.
|
[
{
"version": "v1",
"created": "Mon, 8 Mar 2010 17:36:02 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Dec 2010 23:00:11 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Ehlers",
"Ruediger",
""
]
] |
new_dataset
| 0.991964 |
1003.3501
|
Jo\~ao Luiz Rebelatto
|
Jo\~ao Luiz Rebelatto, Bartolomeu F. Uch\^oa-Filho, Yonghui Li and
Branka Vucetic
|
Generalized Distributed Network Coding Based on Nonbinary Linear Block
Codes for Multi-User Cooperative Communications
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work, we propose and analyze a generalized construction of
distributed network codes for a network consisting of M users sending different
information to a common base station through independent block fading channels.
The aim is to increase the diversity order of the system without reducing its
code rate. The proposed scheme, called generalized dynamic network codes
(GDNC), is a generalization of the dynamic network codes (DNC) recently
proposed by Xiao and Skoglund. The design of the network codes that maximizes
the diversity order is recognized as equivalent to the design of linear block
codes over a nonbinary finite field under the Hamming metric. The proposed
scheme offers a much better tradeoff between rate and diversity order. An
outage probability analysis showing the improved performance is carried out,
and computer simulations results are shown to agree with the analytical
results.
|
[
{
"version": "v1",
"created": "Thu, 18 Mar 2010 02:45:12 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Mar 2010 23:52:52 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Rebelatto",
"João Luiz",
""
],
[
"Uchôa-Filho",
"Bartolomeu F.",
""
],
[
"Li",
"Yonghui",
""
],
[
"Vucetic",
"Branka",
""
]
] |
new_dataset
| 0.998535 |
1004.0180
|
Jing ( Tiffany ) Li
|
Kai Xie, Jing (Tiffany) Li
|
Precoded Turbo Equalizer for Power Line Communication Systems
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Power line communication continues to draw increasing interest by promising a
wide range of applications including cost-free last-mile communication
solution. However, signal transmitted through the power lines deteriorates
badly due to the presence of severe inter-symbol interference (ISI) and harsh
random pulse noise. This work proposes a new precoded turbo equalization scheme
specifically designed for the PLC channels. By introducing useful precoding to
reshape ISI, optimizing maximum {\it a posteriori} (MAP) detection to address
the non-Gaussian pulse noise, and performing soft iterative decision
refinement, the new equalizer demonstrates a gain significantly better than the
existing turbo equalizers.
|
[
{
"version": "v1",
"created": "Thu, 1 Apr 2010 16:42:29 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Xie",
"Kai",
"",
"Tiffany"
],
[
"Jing",
"",
"",
"Tiffany"
],
[
"Li",
"",
""
]
] |
new_dataset
| 0.993883 |
1107.1753
|
Yavor Parvanov
|
Yavor Parvanov
|
Notes on Electronic Lexicography
|
8 pages, 1 figure
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
These notes are a continuation of topics covered by V. Selegej in his article
"Electronic Dictionaries and Computational lexicography". How can an electronic
dictionary have as its object the description of closely related languages?
Obviously, such a question allows multiple answers.
|
[
{
"version": "v1",
"created": "Sat, 9 Jul 2011 00:40:06 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Parvanov",
"Yavor",
""
]
] |
new_dataset
| 0.988411 |
1202.6447
|
Mingzhi Zhu
|
Mingzhi Zhu, Gennian Ge
|
Quaternary Constant-Composition Codes with Weight Four and Distances
Five or Six
|
23 pages, 3 tables
| null | null | null |
cs.IT math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The sizes of optimal constant-composition codes of weight three have been
determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes
played an important role in their constructions. In this paper, we study the
problem of constructing optimal quaternary constant-composition codes with
Hamming weight four and minimum distances five or six through group divisible
codes and Room square approaches. The problem is solved leaving only five
lengths undetermined. Previously, the results on the sizes of such quaternary
constant-composition codes were scarce.
|
[
{
"version": "v1",
"created": "Wed, 29 Feb 2012 05:32:09 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Mar 2012 05:33:59 GMT"
},
{
"version": "v3",
"created": "Tue, 13 Mar 2012 11:02:35 GMT"
},
{
"version": "v4",
"created": "Thu, 15 Mar 2012 07:27:08 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Zhu",
"Mingzhi",
""
],
[
"Ge",
"Gennian",
""
]
] |
new_dataset
| 0.999029 |
1204.3800
|
Srinivasan Kalyanaraman
|
Srinivasan Kalyanaraman
|
Indus script corpora, archaeo-metallurgy and Meluhha (Mleccha)
|
49 pages
| null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Jules Bloch's work on formation of the Marathi language has to be expanded
further to provide for a study of evolution and formation of Indian languages
in the Indian language union (sprachbund). The paper analyses the stages in the
evolution of early writing systems which began with the evolution of counting
in the ancient Near East. A stage anterior to the stage of syllabic
representation of sounds of a language, is identified. Unique geometric shapes
required for tokens to categorize objects became too large to handle to
abstract hundreds of categories of goods and metallurgical processes during the
production of bronze-age goods. About 3500 BCE, Indus script as a writing
system was developed to use hieroglyphs to represent the 'spoken words'
identifying each of the goods and processes. A rebus method of representing
similar sounding words of the lingua franca of the artisans was used in Indus
script. This method is recognized and consistently applied for the lingua
franca of the Indian sprachbund. That the ancient languages of India,
constituted a sprachbund (or language union) is now recognized by many
linguists. The sprachbund area is proximate to the area where most of the Indus
script inscriptions were discovered, as documented in the corpora. That
hundreds of Indian hieroglyphs continued to be used in metallurgy is evidenced
by their use on early punch-marked coins. This explains the combined use of
syllabic scripts such as Brahmi and Kharoshti together with the hieroglyphs on
Rampurva copper bolt, and Sohgaura copper plate from about 6th century
BCE.Indian hieroglyphs constitute a writing system for meluhha language and are
rebus representations of archaeo-metallurgy lexemes. The rebus principle was
employed by the early scripts and can legitimately be used to decipher the
Indus script, after secure pictorial identification.
|
[
{
"version": "v1",
"created": "Tue, 17 Apr 2012 14:14:26 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Kalyanaraman",
"Srinivasan",
""
]
] |
new_dataset
| 0.99982 |
1207.4291
|
Salvatore Iaconesi
|
Salvatore Iaconesi, Oriana Persico
|
ConnectiCity, augmented perception of the city
|
19 pages, 6 figures, presented at Information Visualization 12,
Montpellier, France
| null | null | null |
cs.CY cs.SI physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
As we move through cities in our daily lives, we are in a constant state of
transformation of the spaces around us. The form and essence of urban space
directly affects people's behavior, describing in their perception what is
possible or impossible, allowed or prohibited, suggested or advised against. We
are now able to fill and stratify space/time with digital information layers,
completely wrapping cities in a membrane of information and of opportunities
for interaction and communication. Mobile devices, smartphones, wearables,
digital tags, near field communication devices, location based services and
mixed/augmented reality have gone much further in this direction, turning the
world into an essentially read/write, ubiquitous publishing surface. The usage
of mobile devices and ubiquitous technologies alters the understanding of
place. In this process, the definition of (urban) landscape powerfully shifts
from a definition which is purely administrative (e.g.: the borders of the
flower bed in the middle of a roundabout) to one that is multiplied according
to all individuals which experience that location; as a lossless sum of their
perceptions; as a stratification of interpretations and activities which forms
our cognition of space and time. In our research we investigated the
possibilities to use the scenario which sees urban spaces progressively filling
with multiple layers of real-time, ubiquitous, digital information to
conceptualize, design and implement a series of usage scenarios. It is possible
to create multiple layers of narratives which traverse the city and which allow
us to read them in different ways, according to the different strategies and
methodologies enabling us to highlight how cities express points of view on the
environment, culture, economy, transports, energy and politics.
|
[
{
"version": "v1",
"created": "Wed, 18 Jul 2012 08:02:33 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Iaconesi",
"Salvatore",
""
],
[
"Persico",
"Oriana",
""
]
] |
new_dataset
| 0.998959 |
1208.1956
|
Kai Yang Kai Yang
|
Kai Yang and Xi Zhou
|
MIDI-LAB, a Powerful Visual Basic Program for Creating MIDI Music
|
12 pages, 10 figures, 2 tables,
http://www.airccse.org/journal/ijsea/ijsea.html; International Journal of
Software Engineering & Applications (IJSEA), Vol.3, No.4, July 2012
| null | null | null |
cs.SE cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Creating MIDI music can be a practical challenge. In the past, working with
it was difficult and frustrating to all but the most accomplished and
determined. Now, however, we are offering a powerful Visual Basic program
called MIDI-LAB, that is easy to learn, and instantly rewarding to even the
newest users. MIDI-LAB has been developed to give users the ability to quickly
create music with a limitless variety of tunes, tempos, speeds, volumes,
instruments, rhythms and major scales. This program has a simple, intuitive,
and user-friendly interface, which provides a straightforward way to enter
musical data with Numbered Musical Notation (NMN) and immediately create MIDI
music. The key feature of this program is the digitalization of music input. It
vastly simplifies creating, editing, and saving MIDI music. MIDI-LAB can be
used virtually anywhere to write music for entertainment, teaching, computer
games, and mobile phone ringtones.
|
[
{
"version": "v1",
"created": "Thu, 9 Aug 2012 15:43:58 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Yang",
"Kai",
""
],
[
"Zhou",
"Xi",
""
]
] |
new_dataset
| 0.995298 |
1209.5039
|
Jaswinder Dilawari Singh
|
Jaswinder Singh Dilawari, Ravinder Khanna
|
Creation of Digital Test Form for Prepress Department
|
5 Pages,4 Figures
|
(IJCSIS) International Journal of Computer Science and Information
Security, Vol. 10, No. 9, September 2012 (IJCSIS) International Journal of
Computer Science and Information Security, Vol. 10, No. 9, September 2012
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main problem in colour management in prepress department is lack of
availability of literature on colour management and knowledge gap between
prepress department and press department. So a digital test from has been
created by Adobe Photoshop to analyse the ICC profile and to create a new
profile and this analysed data is used to study about various grey scale of RGB
and CMYK images. That helps in conversion of image from RGB to CMYK in prepress
department.
|
[
{
"version": "v1",
"created": "Sun, 23 Sep 2012 07:52:01 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Dilawari",
"Jaswinder Singh",
""
],
[
"Khanna",
"Ravinder",
""
]
] |
new_dataset
| 0.961975 |
1209.6037
|
Jaswinder Dilawari Singh
|
Jaswinder Singh Dilawari, Ravinder Khanna
|
Reproduction of Images by Gamut Mapping and Creation of New Test Charts
in Prepress Process
|
5 Pages,10 Figures; International Journal of Scientific and
Engineering Research,Volume 3, Issue 10, October 2012 Edition
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of digital images the problem of keeping picture
visualization uniformity arises because each printing or scanning device has
its own color chart. So, universal color profiles are made by ICC to bring
uniformity in various types of devices. Keeping that color profile in mind
various new color charts are created and calibrated with the help of standard
IT8 test charts available in the market. The main objective to color
reproduction is to produce the identical picture at device output. For that
principles for gamut mapping has been designed
|
[
{
"version": "v1",
"created": "Wed, 26 Sep 2012 19:25:56 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Dilawari",
"Jaswinder Singh",
""
],
[
"Khanna",
"Ravinder",
""
]
] |
new_dataset
| 0.988654 |
1301.4668
|
Kirana Kumara P
|
Kirana Kumara P
|
A MATLAB Code for Three Dimensional Linear Elastostatics using Constant
Boundary Elements
|
12 pages (pdf), 8 supplementary files, accepted author manuscript
|
International Journal of Advances in Engineering Sciences(IJAES)
Vol 2 No 3 (2012) pp. 9-20 [e-ISSN: 2231-0347, Print-ISSN: 2231-2013]
| null | null |
cs.CE physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Present work presents a code written in the very simple programming language
MATLAB, for three dimensional linear elastostatics, using constant boundary
elements. The code, in full or in part, is not a translation or a copy of any
of the existing codes. Present paper explains how the code is written, and
lists all the formulae used. Code is verified by using the code to solve a
simple problem which has the well known approximate analytical solution. Of
course, present work does not make any contribution to research on boundary
elements, in terms of theory. But the work is justified by the fact that, to
the best of author's knowledge, as of now, one cannot find an open access
MATLAB code for three dimensional linear elastostatics using constant boundary
elements. Author hopes this paper to be of help to beginners who wish to
understand how a simple but complete boundary element code works, so that they
can build upon and modify the present open access code to solve complex
engineering problems quickly and easily. The code is available online for open
access (as supplementary file for the present paper), and may be downloaded
from the website for the present journal.
|
[
{
"version": "v1",
"created": "Sun, 20 Jan 2013 16:29:09 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"P",
"Kirana Kumara",
""
]
] |
new_dataset
| 0.999728 |
1312.4597
|
Istv\'an Kov\'acs
|
Istv\'an Kov\'acs
|
Indecomposable coverings with homothetic polygons
| null | null | null | null |
cs.CG math.CO math.MG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that for any convex polygon $S$ with at least four sides, or a
concave one with no parallel sides, and any $m>0$, there is an $m$-fold
covering of the plane with homothetic copies of $S$ that cannot be decomposed
into two coverings.
|
[
{
"version": "v1",
"created": "Tue, 17 Dec 2013 00:22:08 GMT"
},
{
"version": "v2",
"created": "Thu, 12 Mar 2015 14:32:43 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Kovács",
"István",
""
]
] |
new_dataset
| 0.997109 |
1404.5985
|
Matthew Patitz
|
Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers
|
Reflections on Tiles (in Self-Assembly)
|
New results which classify the types of shapes which can
self-assemble in the RTAM have been added
| null | null | null |
cs.CG cs.CC cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We define the Reflexive Tile Assembly Model (RTAM), which is obtained from
the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across
their horizontal and/or vertical axes. We show that the class of directed
temperature-1 RTAM systems is not computationally universal, which is
conjectured but unproven for the aTAM, and like the aTAM, the RTAM is
computationally universal at temperature 2. We then show that at temperature 1,
when starting from a single tile seed, the RTAM is capable of assembling n x n
squares for n odd using only n tile types, but incapable of assembling n x n
squares for n even. Moreover, we show that n is a lower bound on the number of
tile types needed to assemble n x n squares for n odd in the temperature-1
RTAM. The conjectured lower bound for temperature-1 aTAM systems is 2n-1.
Finally, we give preliminary results toward the classification of which finite
connected shapes in Z^2 can be assembled (strictly or weakly) by a singly
seeded (i.e. seed of size 1) RTAM system, including a complete classification
of which finite connected shapes be strictly assembled by a "mismatch-free"
singly seeded RTAM system.
|
[
{
"version": "v1",
"created": "Wed, 23 Apr 2014 21:12:43 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Apr 2014 00:54:08 GMT"
},
{
"version": "v3",
"created": "Wed, 11 Mar 2015 22:12:24 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Hendricks",
"Jacob",
""
],
[
"Patitz",
"Matthew J.",
""
],
[
"Rogers",
"Trent A.",
""
]
] |
new_dataset
| 0.997531 |
1503.03593
|
Sapna Saxena
|
Sapna Saxena, Bhanu Kapoor
|
State of the art parallel approaches for RSA public key based
cryptosystem
|
IJCSA February 2015
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
RSA is one of the most popular Public Key Cryptography based algorithm mainly
used for digital signatures, encryption/decryption etc. It is based on the
mathematical scheme of factorization of very large integers which is a
compute-intensive process and takes very long time as well as power to perform.
Several scientists are working throughout the world to increase the speedup and
to decrease the power consumption of RSA algorithm while keeping the security
of the algorithm intact. One popular technique which can be used to enhance the
performance of RSA is parallel programming. In this paper we are presenting the
survey of various parallel implementations of RSA algorithm involving variety
of hardware and software implementations.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2015 05:35:44 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Saxena",
"Sapna",
""
],
[
"Kapoor",
"Bhanu",
""
]
] |
new_dataset
| 0.973384 |
1503.03614
|
Ankit Chaudhary
|
Jagdish L. Raheja, A. Singhal, A. Chaudhary
|
Android based Portable Hand Sign Recognition System
| null | null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
These days mobile devices like phones or tablets are very common among people
of all age. They are connected with network and provide seamless communications
through internet or cellular services. These devices can be a big help for the
people who are not able to communicate properly and even in emergency
conditions. A disabled person who is not able to speak or a person who speak a
different language, these devices can be a boon for them as understanding,
translating and speaking systems for these people. This chapter discusses a
portable android based hand sign recognition system which can be used by
disabled people. This chapter shows a part of on-going project. Computer Vision
based techniques were used for image analysis and PCA was used after image
tokenizer for recognition. This method was tested with webcam results to make
system more robust.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2015 07:27:27 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Raheja",
"Jagdish L.",
""
],
[
"Singhal",
"A.",
""
],
[
"Chaudhary",
"A.",
""
]
] |
new_dataset
| 0.999573 |
1503.03630
|
Liang-Jian Deng
|
Liang-Jian Deng and Weihong Guo and Ting-Zhu Huang
|
Single image super-resolution by approximated Heaviside functions
| null | null | null | null |
cs.CV cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image super-resolution is a process to enhance image resolution. It is widely
used in medical imaging, satellite imaging, target recognition, etc. In this
paper, we conduct continuous modeling and assume that the unknown image
intensity function is defined on a continuous domain and belongs to a space
with a redundant basis. We propose a new iterative model for single image
super-resolution based on an observation: an image is consisted of smooth
components and non-smooth components, and we use two classes of approximated
Heaviside functions (AHFs) to represent them respectively. Due to sparsity of
the non-smooth components, a $L_{1}$ model is employed. In addition, we apply
the proposed iterative model to image patches to reduce computation and
storage. Comparisons with some existing competitive methods show the
effectiveness of the proposed method.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2015 08:54:54 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Deng",
"Liang-Jian",
""
],
[
"Guo",
"Weihong",
""
],
[
"Huang",
"Ting-Zhu",
""
]
] |
new_dataset
| 0.999685 |
1503.03642
|
Chang Yao
|
Chang Yao, Divyakant Agrawal, Pengfei Chang, Gang Chen, Beng Chin Ooi,
Weng-Fai Wong, Meihui Zhang
|
DGCC:A New Dependency Graph based Concurrency Control Protocol for
Multicore Database Systems
|
12 pages
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multicore CPUs and large memories are increasingly becoming the norm in
modern computer systems. However, current database management systems (DBMSs)
are generally ineffective in exploiting the parallelism of such systems. In
particular, contention can lead to a dramatic fall in performance. In this
paper, we propose a new concurrency control protocol called DGCC (Dependency
Graph based Concurrency Control) that separates concurrency control from
execution. DGCC builds dependency graphs for batched transactions before
executing them. Using these graphs, contentions within the same batch of
transactions are resolved before execution. As a result, the execution of the
transactions does not need to deal with contention while maintaining full
equivalence to that of serialized execution. This better exploits multicore
hardware and achieves higher level of parallelism. To facilitate DGCC, we have
also proposed a system architecture that does not have certain centralized
control components yielding better scalability, as well as supports a more
efficient recovery mechanism. Our extensive experimental study shows that DGCC
achieves up to four times higher throughput compared to that of
state-of-the-art concurrency control protocols for high contention workloads.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2015 09:32:02 GMT"
}
] | 2015-03-13T00:00:00 |
[
[
"Yao",
"Chang",
""
],
[
"Agrawal",
"Divyakant",
""
],
[
"Chang",
"Pengfei",
""
],
[
"Chen",
"Gang",
""
],
[
"Ooi",
"Beng Chin",
""
],
[
"Wong",
"Weng-Fai",
""
],
[
"Zhang",
"Meihui",
""
]
] |
new_dataset
| 0.9993 |
1309.2787
|
Stian Soiland-Reyes
|
Hyde Zhang, Stian Soiland-Reyes, Carole Goble
|
Taverna Mobile: Taverna workflows on Android
|
Abstract, 3 pages, 2 figures. Submitted for Oral communication at
NETTAB 2013 on 2013-09-10. Accepted 2013-09-14. Published 2013-10-14 in
EMBnet.journal.
http://journal.embnet.org/index.php/embnetjournal/article/view/727 Taverna
Mobile: http://dev.mygrid.org.uk/wiki/display/tav/Taverna+Mobile
|
EMBnet.Journal 2013, 19(B), pp. 43-45
|
10.14806/ej.19.B.727
| null |
cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
Researchers are often on the move, say at conferences or projects meetings,
and as workflows are becoming ubiquitous in the scientific process, having
access to scientific workflows from a mobile device would be a significant
advantage. We therefore have developed Taverna Mobile, an application for
Android phones which allows browsing of existing workflows, executing them, and
reviewing the results.
Taverna Mobile does not aim to reproduce the full experience of building
workflows in the Taverna Workbench, rather it focuses on tasks we have deemed
relevant to a scientist that is not at her desk. For instance, when visiting a
conference she might hear about someone's workflow, which she can quickly
locate and mark for later exploration. When in the biology lab, faced with
updated scientific data, the scientist can rerun her own workflow with new
inputs. While commuting, she can monitor the status of a long-running job.
|
[
{
"version": "v1",
"created": "Wed, 11 Sep 2013 11:19:24 GMT"
},
{
"version": "v2",
"created": "Thu, 17 Oct 2013 15:48:31 GMT"
},
{
"version": "v3",
"created": "Fri, 18 Oct 2013 11:07:09 GMT"
},
{
"version": "v4",
"created": "Wed, 11 Mar 2015 11:35:27 GMT"
}
] | 2015-03-12T00:00:00 |
[
[
"Zhang",
"Hyde",
""
],
[
"Soiland-Reyes",
"Stian",
""
],
[
"Goble",
"Carole",
""
]
] |
new_dataset
| 0.990869 |
1503.03166
|
Kirat Pal Er
|
Kirat Pal Singh, Shivani Parmar
|
Design of High Performance MIPS Cryptography Processor Based on T-DES
Algorithm
|
International Journal of Engineering Research & Technology. arXiv
admin note: substantial text overlap with arXiv:1306.1916, arXiv:1503.02304
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper describes the design of high performance MIPS Cryptography
processor based on triple data encryption standard. The organization of
pipeline stages in such a way that pipeline can be clocked at high frequency.
Encryption and Decryption blocks of triple data encryption standard (T-DES)
crypto system and dependency among themselves are explained in detail with the
help of block diagram. In order to increase the processor functionality and
performance, especially for security applications we include three new 32-bit
instructions LKLW, LKUW and CRYPT. The design has been synthesized at 40nm
process technology targeting using Xilinx Virtex-6 device. The overall MIPS
Crypto processor works at 209MHz.
|
[
{
"version": "v1",
"created": "Sun, 8 Mar 2015 18:23:32 GMT"
}
] | 2015-03-12T00:00:00 |
[
[
"Singh",
"Kirat Pal",
""
],
[
"Parmar",
"Shivani",
""
]
] |
new_dataset
| 0.973419 |
1503.03283
|
Ayineedi Venkateswarlu
|
Ayineedi Venkateswarlu, Santanu Sarkar and A. Sai Mali
|
On Acyclic Edge-Coloring of Complete Bipartite Graphs
|
17 pages, 10 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An acyclic edge-coloring of a graph is a proper edge-coloring without
bichromatic ($2$-colored) cycles. The acyclic chromatic index of a graph $G$,
denoted by $a'(G)$, is the least integer $k$ such that $G$ admits an acyclic
edge-coloring using $k$ colors. Let $\Delta = \Delta(G)$ denote the maximum
degree of a vertex in a graph $G$. A complete bipartite graph with $n$ vertices
on each side is denoted by $K_{n,n}$. Basavaraju, Chandran and Kummini proved
that $a'(K_{n,n}) \ge n+2 = \Delta + 2$ when $n$ is odd. Basavaraju and
Chandran provided an acyclic edge-coloring of $K_{p,p}$ using $p+2$ colors and
thus establishing $a'(K_{p,p}) = p+2 = \Delta + 2$ when $p$ is an odd prime.
The main tool in their approach is perfect $1$-factorization of $K_{p,p}$.
Recently, following their approach, Venkateswarlu and Sarkar have shown that
$K_{2p-1,2p-1}$ admits an acyclic edge-coloring using $2p+1$ colors which
implies that $a'(K_{2p-1,2p-1}) = 2p+1 = \Delta + 2$, where $p$ is an odd
prime. In this paper, we generalize this approach and present a general
framework to possibly get an acyclic edge-coloring of $K_{n,n}$ which possess a
perfect $1$-factorization using $n+2 = \Delta+2$ colors. In this general
framework, we show that $K_{p^2,p^2}$ admits an acyclic edge-coloring using
$p^2+2$ colors and thus establishing $a'(K_{p^2,p^2}) = p^2+2 = \Delta + 2$
when $p\ge 5$ is an odd prime.
|
[
{
"version": "v1",
"created": "Wed, 11 Mar 2015 11:41:31 GMT"
}
] | 2015-03-12T00:00:00 |
[
[
"Venkateswarlu",
"Ayineedi",
""
],
[
"Sarkar",
"Santanu",
""
],
[
"Mali",
"A. Sai",
""
]
] |
new_dataset
| 0.999418 |
1503.03293
|
Helio M. de Oliveira
|
R.M. Campello de Souza, E.S.V. Freire and H.M. de Oliveira
|
Fourier Codes
|
6 pages, 2 tables. In: 10th International Symposium on Communication
Theory and Applications 2009, Ambleside, Lake District, UK
| null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new family of error-correcting codes, called Fourier codes, is introduced.
The code parity-check matrix, dimension and an upper bound on its minimum
distance are obtained from the eigenstructure of the Fourier number theoretic
transform. A decoding technique for such codes is proposed.
|
[
{
"version": "v1",
"created": "Wed, 11 Mar 2015 12:14:10 GMT"
}
] | 2015-03-12T00:00:00 |
[
[
"de Souza",
"R. M. Campello",
""
],
[
"Freire",
"E. S. V.",
""
],
[
"de Oliveira",
"H. M.",
""
]
] |
new_dataset
| 0.999543 |
1206.5327
|
Carroline Dewi Puspa Kencana Ramli
|
Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, Flemming
Nielson
|
XACML 3.0 in Answer Set Programming
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a systematic technique for transforming XACML 3.0 policies in
Answer Set Programming (ASP). We show that the resulting logic program has a
unique answer set that directly corresponds to our formalisation of the
standard semantics of XACML 3.0 from Ramli et. al. We demonstrate how our
results make it possible to use off-the-shelf ASP solvers to formally verify
properties of access control policies represented in XACML, such as checking
the completeness of a set of access control policies and verifying policy
properties.
|
[
{
"version": "v1",
"created": "Fri, 22 Jun 2012 21:59:14 GMT"
},
{
"version": "v2",
"created": "Mon, 18 Feb 2013 17:35:04 GMT"
}
] | 2015-03-11T00:00:00 |
[
[
"Ramli",
"Carroline Dewi Puspa Kencana",
""
],
[
"Nielson",
"Hanne Riis",
""
],
[
"Nielson",
"Flemming",
""
]
] |
new_dataset
| 0.989468 |
1503.01804
|
Achuta Kadambi
|
Achuta Kadambi, Vage Taamazyan, Suren Jayasuriya, Ramesh Raskar
|
Frequency Domain TOF: Encoding Object Depth in Modulation Frequency
|
10 pages
| null | null | null |
cs.CV cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Time of flight cameras may emerge as the 3-D sensor of choice. Today, time of
flight sensors use phase-based sampling, where the phase delay between emitted
and received, high-frequency signals encodes distance. In this paper, we
present a new time of flight architecture that relies only on frequency---we
refer to this technique as frequency-domain time of flight (FD-TOF). Inspired
by optical coherence tomography (OCT), FD-TOF excels when frequency bandwidth
is high. With the increasing frequency of TOF sensors, new challenges to time
of flight sensing continue to emerge. At high frequencies, FD-TOF offers
several potential benefits over phase-based time of flight methods.
|
[
{
"version": "v1",
"created": "Thu, 5 Mar 2015 22:15:33 GMT"
}
] | 2015-03-11T00:00:00 |
[
[
"Kadambi",
"Achuta",
""
],
[
"Taamazyan",
"Vage",
""
],
[
"Jayasuriya",
"Suren",
""
],
[
"Raskar",
"Ramesh",
""
]
] |
new_dataset
| 0.990523 |
1503.02774
|
Andrea Lincoln
|
Adam Hesterberg, Andrea Lincoln, Jayson Lynch
|
Improved Connectivity Condition for Byzantine Fault Tolerance
|
10 pages
| null | null | null |
cs.DC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Given a network in which some pairs of nodes can communicate freely, and some
subsets of the nodes could be faulty and colluding to disrupt communication,
when can messages reliably be sent from one given node to another? We give a
new characterization of when the agreement problem can be solved and provide an
agreement algorithm which can reach agreement when the number of Byzantine
nodes along each minimal vertex cut is bounded. Our new bound holds for a
strict superset of cases than the previously known bound. We show that the new
bound is tight. Furthermore, we show that this algorithm does not require the
processes to know the graph structure, as the previously known algorithm did.
Finally, we explore some of the situations in which we can reach agreement if
we assume that individual nodes or entire subgraphs are trustworthy.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 05:21:54 GMT"
}
] | 2015-03-11T00:00:00 |
[
[
"Hesterberg",
"Adam",
""
],
[
"Lincoln",
"Andrea",
""
],
[
"Lynch",
"Jayson",
""
]
] |
new_dataset
| 0.975577 |
1503.02825
|
Rossano Schifanella
|
Daniele Quercia, Luca Maria Aiello, Rossano Schifanella, Adam Davies
|
The Digital Life of Walkable Streets
|
10 pages, 7 figures, Proceedings of International World Wide Web
Conference (WWW 2015)
| null |
10.1145/2736277.2741631
| null |
cs.SI cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Walkability has many health, environmental, and economic benefits. That is
why web and mobile services have been offering ways of computing walkability
scores of individual street segments. Those scores are generally computed from
survey data and manual counting (of even trees). However, that is costly, owing
to the high time, effort, and financial costs. To partly automate the
computation of those scores, we explore the possibility of using the social
media data of Flickr and Foursquare to automatically identify safe and walkable
streets. We find that unsafe streets tend to be photographed during the day,
while walkable streets are tagged with walkability-related keywords. These
results open up practical opportunities (for, e.g., room booking services,
urban route recommenders, and real-estate sites) and have theoretical
implications for researchers who might resort to the use social media data to
tackle previously unanswered questions in the area of walkability.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 09:20:01 GMT"
}
] | 2015-03-11T00:00:00 |
[
[
"Quercia",
"Daniele",
""
],
[
"Aiello",
"Luca Maria",
""
],
[
"Schifanella",
"Rossano",
""
],
[
"Davies",
"Adam",
""
]
] |
new_dataset
| 0.992967 |
1503.02970
|
Alexander Pilz
|
Stefan Felsner, Alexander Pilz
|
Ham-Sandwich Cuts for Abstract Order Types
|
A preliminary version of this paper appeared in the proceedings of
ISAAC 2014
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The linear-time ham-sandwich cut algorithm of Lo, Matou\v{s}ek, and Steiger
for bi-chromatic finite point sets in the plane works by appropriately
selecting crossings of the lines in the dual line arrangement with a set of
well-chosen vertical lines. We consider the setting where we are not given the
coordinates of the point set, but only the orientation of each point triple
(the order type) and give a deterministic linear-time algorithm for the
mentioned sub-algorithm. This yields a linear-time ham-sandwich cut algorithm
even in our restricted setting. We also show that our methods are applicable to
abstract order types.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 16:16:13 GMT"
}
] | 2015-03-11T00:00:00 |
[
[
"Felsner",
"Stefan",
""
],
[
"Pilz",
"Alexander",
""
]
] |
new_dataset
| 0.974177 |
1503.02997
|
No'am Newman
|
No'am Newman
|
Spreadsheets in an ERP environment: not what the doctor ordered
|
In Proceedings of the 2nd Workshop on Software Engineering Methods in
Spreadsheets (http://spreadsheetlab.org/sems15/)
| null | null | null |
cs.SE
|
http://creativecommons.org/licenses/by/3.0/
|
Modern ERP systems contain flexible report generators but the tendency exists
for users to export data to spreadsheets for manipulation, reporting and
decision making. A purported reason for this is that some users are more
familiar with personal reporting tools (spreadsheets) as opposed to enterprise
reporting tools. The author's doctoral research intends to measure the extent
of spreadsheet usage in ERP environments and to determine which factors
facilitate this.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 17:31:47 GMT"
}
] | 2015-03-11T00:00:00 |
[
[
"Newman",
"No'am",
""
]
] |
new_dataset
| 0.994397 |
1503.03012
|
Richard Mayne Dr.
|
Richard Mayne, Andrew Adamatzky and Jeff Jones
|
On the role of the plasmodial cytoskeleton in facilitating intelligent
behaviour in slime mould Physarum polycephalum
|
25 pages, 10 figures
|
Communicative & Integrative Biology 7 (1), e32097, 2014
| null | null |
cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The plasmodium of slime mould Physarum polycephalum behaves as an amorphous
reaction-diffusion computing substrate and is capable of apparently intelligent
behaviour. But how does intelligence emerge in an acellular organism? Through a
range of laboratory experiments, we visualise the plasmodial cytoskeleton, a
ubiquitous cellular protein scaffold whose functions are manifold and essential
to life, and discuss its putative role as a network for transducing,
transmitting and structuring data streams within the plasmodium. Through a
range of computer modelling techniques, we demonstrate how emergent behaviour,
and hence computational intelligence, may occur in cytoskeletal communications
networks. Specifically, we model the topology of both the actin and tubulin
cytoskeletal networks and discuss how computation may occur therein.
Furthermore, we present bespoke cellular automata and particle swarm models for
the computational process within the cytoskeleton and observe the incidence of
emergent patterns in both. Our work grants unique insight into the origins of
natural intelligence; the results presented here are therefore readily
transferable to the fields of natural computation, cell biology and biomedical
science. We conclude by discussing how our results may alter our biological,
computational and philosophical understanding of intelligence and
consciousness.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 17:50:45 GMT"
}
] | 2015-03-11T00:00:00 |
[
[
"Mayne",
"Richard",
""
],
[
"Adamatzky",
"Andrew",
""
],
[
"Jones",
"Jeff",
""
]
] |
new_dataset
| 0.996609 |
1503.03021
|
Anastasios Noulas Anastasios Noulas
|
Vsevolod Salnikov, Renaud Lambiotte, Anastasios Noulas, Cecilia
Mascolo
|
OpenStreetCab: Exploiting Taxi Mobility Patterns in New York City to
Reduce Commuter Costs
|
in NetMob 2015
| null | null | null |
cs.SI cs.CY physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rise of Uber as the global alternative taxi operator has attracted a lot
of interest recently. Aside from the media headlines which discuss the new
phenomenon, e.g. on how it has disrupted the traditional transportation
industry, policy makers, economists, citizens and scientists have engaged in a
discussion that is centred around the means to integrate the new generation of
the sharing economy services in urban ecosystems. In this work, we aim to shed
new light on the discussion, by taking advantage of a publicly available
longitudinal dataset that describes the mobility of yellow taxis in New York
City. In addition to movement, this data contains information on the fares paid
by the taxi customers for each trip. As a result we are given the opportunity
to provide a first head to head comparison between the iconic yellow taxi and
its modern competitor, Uber, in one of the world's largest metropolitan
centres. We identify situations when Uber X, the cheapest version of the Uber
taxi service, tends to be more expensive than yellow taxis for the same
journey. We also demonstrate how Uber's economic model effectively takes
advantage of well known patterns in human movement. Finally, we take our
analysis a step further by proposing a new mobile application that compares
taxi prices in the city to facilitate traveller's taxi choices, hoping to
ultimately to lead to a reduction of commuter costs. Our study provides a case
on how big datasets that become public can improve urban services for consumers
by offering the opportunity for transparency in economic sectors that lack up
to date regulations.
|
[
{
"version": "v1",
"created": "Tue, 10 Mar 2015 18:12:14 GMT"
}
] | 2015-03-11T00:00:00 |
[
[
"Salnikov",
"Vsevolod",
""
],
[
"Lambiotte",
"Renaud",
""
],
[
"Noulas",
"Anastasios",
""
],
[
"Mascolo",
"Cecilia",
""
]
] |
new_dataset
| 0.993371 |
1502.05811
|
Lilla T\'othm\'er\'esz
|
Lilla T\'othm\'er\'esz
|
Rotor-routing orbits in directed graphs and the Picard group
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In [5], Holroyd, Levine, M\'esz\'aros, Peres, Propp and Wilson characterize
recurrent chip-and-rotor configurations for strongly connected digraphs.
However, the number of steps needed to recur, and the number of orbits is left
open for general digraphs. Recently, these questions were answered by Pham [6],
using linear algebraic methods. We give new, purely combinatorial proofs for
these formulas. We also relate rotor-router orbits to the chip-firing game: The
number of recurrent rotor-router unicycle-orbits equals the order of the Picard
group of the graph, defined in the sense of [1], and during a period, the same
chip-moves happen, as during firing the period vector in the chip-firing game.
|
[
{
"version": "v1",
"created": "Fri, 20 Feb 2015 09:54:56 GMT"
},
{
"version": "v2",
"created": "Sun, 8 Mar 2015 19:15:43 GMT"
}
] | 2015-03-10T00:00:00 |
[
[
"Tóthmérész",
"Lilla",
""
]
] |
new_dataset
| 0.998978 |
1503.02354
|
Xinghua Yang
|
Xinghua Yang, Fei Qiao, Qi Wei, Huazhong Yang
|
A General Scheme for Noise-Tolerant Logic Design Based on Probabilistic
and DCVS Approaches
|
4 pages, 10 figures
| null | null | null |
cs.AR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a general circuit scheme for noise-tolerant logic design based
on Markov Random Field theory and differential Cascade Voltage Switch technique
has been proposed, which is an extension of the work in [1-3], [4]. A block
with only four transistors has been successfully inserted to the original
circuit scheme from [3] and extensive simulation results show that our proposed
design can operate correctly with the input signal of 1 dB signal-noise-ratio.
When using the evaluation parameter from [5], the output value of our design
decreases by 76.5% on average than [3] which means that superior noise-immunity
could be obtained through our work.
|
[
{
"version": "v1",
"created": "Mon, 9 Mar 2015 01:36:50 GMT"
}
] | 2015-03-10T00:00:00 |
[
[
"Yang",
"Xinghua",
""
],
[
"Qiao",
"Fei",
""
],
[
"Wei",
"Qi",
""
],
[
"Yang",
"Huazhong",
""
]
] |
new_dataset
| 0.996762 |
1503.02386
|
Johan P. Hansen
|
Johan P. Hansen
|
Riemann-Roch Spaces and Linear Network Codes
|
8 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We construct linear network codes utilizing algebraic curves over finite
fields and certain associated Riemann-Roch spaces and present methods to obtain
their parameters.
In particular we treat the Hermitian curve and the curves associated with the
Suzuki and Ree groups all having the maximal number of points for curves of
their respective genera.
Linear network coding transmits information in terms of a basis of a vector
space and the information is received as a basis of a possibly altered vector
space. Ralf Koetter and Frank R. Kschischang
%\cite{DBLP:journals/tit/KoetterK08} introduced a metric on the set of vector
spaces and showed that a minimal distance decoder for this metric achieves
correct decoding if the dimension of the intersection of the transmitted and
received vector space is sufficiently large.
The vector spaces in our construction have minimal distance bounded from
below in the above metric making them suitable for linear network coding.
|
[
{
"version": "v1",
"created": "Mon, 9 Mar 2015 08:03:57 GMT"
}
] | 2015-03-10T00:00:00 |
[
[
"Hansen",
"Johan P.",
""
]
] |
new_dataset
| 0.99814 |
1311.4947
|
Jie Li
|
Jie Li, Xiaohu Tang and Udaya Parampalli
|
A Framework of Constructions of Minimal Storage Regenerating Codes with
the Optimal Access/Update Property
|
Accepted for publication in IEEE Transactions on Information Theory
| null |
10.1109/TIT.2015.2408600
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present a generic framework for constructing systematic
minimum storage regenerating codes with two parity nodes based on the invariant
subspace technique. Codes constructed in our framework not only contain some
best known codes as special cases, but also include some new codes with key
properties such as the optimal access property and the optimal update property.
In particular, for a given storage capacity of an individual node, one of the
new codes has the largest number of systematic nodes and two of the new codes
have the largest number of systematic nodes with the optimal update property.
|
[
{
"version": "v1",
"created": "Wed, 20 Nov 2013 03:48:13 GMT"
},
{
"version": "v2",
"created": "Sun, 17 Aug 2014 08:28:26 GMT"
},
{
"version": "v3",
"created": "Fri, 6 Mar 2015 02:06:50 GMT"
}
] | 2015-03-09T00:00:00 |
[
[
"Li",
"Jie",
""
],
[
"Tang",
"Xiaohu",
""
],
[
"Parampalli",
"Udaya",
""
]
] |
new_dataset
| 0.961945 |
1503.01918
|
Matej Kristan
|
Matej Kristan, Vildana Sulic, Stanislav Kovacic, Janez Pers
|
Fast image-based obstacle detection from unmanned surface vehicles
|
This is an extended version of the ACCV2014 paper [Kristan et al.,
2014] submitted to a journal. [Kristan et al., 2014] M. Kristan, J. Pers, V.
Sulic, S. Kovacic, A graphical model for rapid obstacle image-map estimation
from unmanned surface vehicles, in Proc. Asian Conf. Computer Vision, 2014
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Obstacle detection plays an important role in unmanned surface vehicles
(USV). The USVs operate in highly diverse environments in which an obstacle may
be a floating piece of wood, a scuba diver, a pier, or a part of a shoreline,
which presents a significant challenge to continuous detection from images
taken onboard. This paper addresses the problem of online detection by
constrained unsupervised segmentation. To this end, a new graphical model is
proposed that affords a fast and continuous obstacle image-map estimation from
a single video stream captured onboard a USV. The model accounts for the
semantic structure of marine environment as observed from USV by imposing weak
structural constraints. A Markov random field framework is adopted and a highly
efficient algorithm for simultaneous optimization of model parameters and
segmentation mask estimation is derived. Our approach does not require
computationally intensive extraction of texture features and comfortably runs
in real-time. The algorithm is tested on a new, challenging, dataset for
segmentation and obstacle detection in marine environments, which is the
largest annotated dataset of its kind. Results on this dataset show that our
model outperforms the related approaches, while requiring a fraction of
computational effort.
|
[
{
"version": "v1",
"created": "Fri, 6 Mar 2015 11:21:07 GMT"
}
] | 2015-03-09T00:00:00 |
[
[
"Kristan",
"Matej",
""
],
[
"Sulic",
"Vildana",
""
],
[
"Kovacic",
"Stanislav",
""
],
[
"Pers",
"Janez",
""
]
] |
new_dataset
| 0.998763 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.