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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1103.5580
|
Saheeb Kayani Engr.
|
Saheeb Ahmed Kayani
|
Designing a Miniature Wheel Arrangement for Mobile Robot Platforms
|
Final published version, hardcopy available from technical library of
NUST College of E&ME, Rawalpindi, Pakistan on request
| null | null |
DME-RR-02
|
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this research report details of design of a miniature wheel arrangement
are presented. This miniature wheel arrangement is essentially a direction
control mechanism intended for use on a mobile robot platform or base. The
design is a specific one employing a stepper motor as actuator and as described
can only be used on a certain type of wheeled robots. However, as a basic
steering control element, more than one of these miniature wheel arrangements
can be grouped together to implement more elaborate and intelligent direction
control schemes on varying configurations of wheeled mobile robot platforms.
|
[
{
"version": "v1",
"created": "Tue, 29 Mar 2011 09:35:49 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Mar 2011 09:32:01 GMT"
},
{
"version": "v3",
"created": "Sat, 2 Apr 2011 10:20:28 GMT"
}
] | 2011-04-05T00:00:00 |
[
[
"Kayani",
"Saheeb Ahmed",
""
]
] |
new_dataset
| 0.997999 |
1104.0388
|
Vladimir Gusev
|
Vladimir V. Gusev, Elena V. Pribavkina
|
On Non-Complete Sets and Restivo's Conjecture
|
11 pages
| null | null | null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A finite set S of words over the alphabet A is called non-complete if
Fact(S*) is different from A*. A word w in A* - Fact(S*) is said to be
uncompletable. We present a series of non-complete sets S_k whose minimal
uncompletable words have length 5k^2 - 17k + 13, where k > 3 is the maximal
length of words in S_k. This is an infinite series of counterexamples to
Restivo's conjecture, which states that any non-complete set possesses an
uncompletable word of length at most 2k^2.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2011 15:13:50 GMT"
}
] | 2011-04-05T00:00:00 |
[
[
"Gusev",
"Vladimir V.",
""
],
[
"Pribavkina",
"Elena V.",
""
]
] |
new_dataset
| 0.979042 |
1104.0422
|
Wojciech Mazurczyk
|
Bartosz Jankowski, Wojciech Mazurczyk, Krzysztof Szczypiorski
|
PadSteg: Introducing Inter-Protocol Steganography
|
9 pages, 12 figures, 5 tables
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hiding information in network traffic may lead to leakage of confidential
information. In this paper we introduce a new steganographic system: the
PadSteg (Padding Steganography). To authors' best knowledge it is the first
information hiding solution which represents inter-protocol steganography i.e.
usage of relation between two or more protocols from the TCP/IP stack to enable
secret communication. PadSteg utilizes ARP and TCP protocols together with an
Etherleak vulnerability (improper Ethernet frame padding) to facilitate secret
communication for hidden groups in LANs (Local Area Networks). Basing on real
network traces we confirm that PadSteg is feasible in today's networks and we
estimate what steganographic bandwidth is achievable while limiting the chance
of disclosure. We also point at possible countermeasures against PadSteg.
|
[
{
"version": "v1",
"created": "Sun, 3 Apr 2011 19:52:12 GMT"
}
] | 2011-04-05T00:00:00 |
[
[
"Jankowski",
"Bartosz",
""
],
[
"Mazurczyk",
"Wojciech",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] |
new_dataset
| 0.996406 |
1104.0579
|
Michael Lew
|
Ye Ji
|
Image Retrieval Method Using Top-surf Descriptor
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This report presents the results and details of a content-based image
retrieval project using the Top-surf descriptor. The experimental results are
preliminary, however, it shows the capability of deducing objects from parts of
the objects or from the objects that are similar. This paper uses a dataset
consisting of 1200 images of which 800 images are equally divided into 8
categories, namely airplane, beach, motorbike, forest, elephants, horses, bus
and building, while the other 400 images are randomly picked from the Internet.
The best results achieved are from building category.
|
[
{
"version": "v1",
"created": "Mon, 4 Apr 2011 14:14:47 GMT"
}
] | 2011-04-05T00:00:00 |
[
[
"Ji",
"Ye",
""
]
] |
new_dataset
| 0.986731 |
1104.0644
|
Mohamed El-Zawawy
|
Mohamed A. El-Zawawy
|
Program Optimization Based Pointer Analysis and Live Stack-Heap Analysis
|
10 pages, 7 figures
|
International Journal of Computer Science Issues, Volume 8, Issue
2, pages 98-107, March 2011
| null | null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we present type systems for flow-sensitive pointer analysis,
live stack-heap (variables) analysis, and program optimization. The type system
for live stack-heap analysis is an enrichment of that for pointer analysis; the
enrichment has the form of a second component being added to types of the
latter system. Results of pointer analysis are proved useful via their use in
the type system for live stack-heap analysis. The type system for program
optimization is also an augmentation of that for live stack-heap analysis, but
the augmentation takes the form of a transformation component being added to
inference rules of the latter system. The form of program optimization being
achieved is that of dead-code elimination. A form of program correction may
result indirectly from eliminating faulty code (causing the program to abort)
that is dead. Therefore program optimization can result in program correction.
Our type systems have the advantage of being compositional and
relatively-simply structured.
The novelty of our work comes from the fact that our type system for program
optimization associates the optimized version of a program with a justification
(in the form of a type derivation) for the optimization. This justification is
pretty much appreciated in many research areas like certified code
(proof-carrying code) which is the motivation of this work
|
[
{
"version": "v1",
"created": "Mon, 4 Apr 2011 18:14:52 GMT"
}
] | 2011-04-05T00:00:00 |
[
[
"El-Zawawy",
"Mohamed A.",
""
]
] |
new_dataset
| 0.973003 |
0908.1669
|
Martianus Frederic Ezerman
|
Martianus Frederic Ezerman, Markus Grassl, and Patrick Sole
|
The Weights in MDS Codes
|
5 pages, submitted to IEEE Trans. IT. This version 2 is the revised
version after the refereeing process. Accepted for publication
|
IEEE Transactions on Information Theory, vol. 57, no. 1, January
2011, pp. 392-396
|
10.1109/TIT.2010.2090246
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The weights in MDS codes of length n and dimension k over the finite field
GF(q) are studied. Up to some explicit exceptional cases, the MDS codes with
parameters given by the MDS conjecture are shown to contain all k weights in
the range n-k+1 to n. The proof uses the covering radius of the dual code
|
[
{
"version": "v1",
"created": "Wed, 12 Aug 2009 10:38:56 GMT"
},
{
"version": "v2",
"created": "Fri, 30 Jul 2010 10:10:11 GMT"
}
] | 2011-03-31T00:00:00 |
[
[
"Ezerman",
"Martianus Frederic",
""
],
[
"Grassl",
"Markus",
""
],
[
"Sole",
"Patrick",
""
]
] |
new_dataset
| 0.99212 |
1103.5760
|
M. Shahriar Hossain
|
M. Shahriar Hossain, Kazi Muhammad Najmul Hasan Khan, M. Muztaba Fuad,
Debzani Deb
|
Triangular Dynamic Architecture for Distributed Computing in a LAN
Environment
|
Published
|
6th International Conference on Computer and Information
Technology, Dhaka, Bangladesh, 2003, Pages 481-486
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A computationally intensive large job, granulized to concurrent pieces and
operating in a dynamic environment should reduce the total processing time.
However, distributing jobs across a networked environment is a tedious and
difficult task. Job distribution in a Local Area Network based on Triangular
Dynamic Architecture (TDA) is a mechanism that establishes a dynamic
environment for job distribution, load balancing and distributed processing
with minimum interaction from the user. This paper introduces TDA and discusses
its architecture and shows the benefits gained by utilizing such architecture
in a distributed computing environment.
|
[
{
"version": "v1",
"created": "Tue, 29 Mar 2011 20:05:50 GMT"
}
] | 2011-03-31T00:00:00 |
[
[
"Hossain",
"M. Shahriar",
""
],
[
"Khan",
"Kazi Muhammad Najmul Hasan",
""
],
[
"Fuad",
"M. Muztaba",
""
],
[
"Deb",
"Debzani",
""
]
] |
new_dataset
| 0.999295 |
1103.5410
|
Alberto Pepe
|
Alberto Pepe and Corinna di Gennaro
|
Political protest Italian-style: The dissonance between the blogosphere
and mainstream media in the promotion and coverage of Beppe Grillo's V-day
|
30 pages; First Monday. Volume 14, Number 12. 2009
|
First Monday. Volume 14, Number 12. 2009
| null | null |
cs.SI cs.CY physics.soc-ph
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
We analyze the organization, promotion and public perception of V-day, a
political rally that took place on September 8, 2007, to protest against
corruption in the Italian Parliament. Launched by blogger Beppe Grillo, and
promoted via a word of mouth mobilization on the Italian blogosphere, V-day
brought close to one million Italians in the streets on a single day, but was
mostly ignored by mainstream media. This article is divided into two parts. In
the first part, we analyze the volume and content of online articles published
by both bloggers and mainstream news sources from June 14 (the day V-day was
announced) until September 15, 2007 (one week after it took place) . We find
that the success of V-day can be attributed to the coverage of bloggers and
small-scale local news outlets only, suggesting a strong grassroots component
in the organization of the rally. We also find a dissonant thematic
relationship between content published by blogs and mainstream media: while the
majority of blogs analyzed promote V-day, major mainstream media sources
critique the methods of information production and dissemination employed by
Grillo. Based on this finding, in the second part of the study, we explore the
role of Grillo in the organization of the rally from a network analysis
perspective. We study the interlinking structure of the V-day blogosphere
network, to determine its structure, its levels of heterogeneity, and
resilience. Our analysis contradicts the hypothesis that Grillo served as a
top-down, broadcast-like source of information. Rather, we find that
information about V-day was transferred across heterogeneous nodes in a
moderately robust and resilient core network of blogs. We speculate that the
organization of V-day represents the very first case, in Italian history, of a
political demonstration developed and promoted primarily via the use of social
media on the web.
|
[
{
"version": "v1",
"created": "Mon, 28 Mar 2011 16:37:46 GMT"
}
] | 2011-03-30T00:00:00 |
[
[
"Pepe",
"Alberto",
""
],
[
"di Gennaro",
"Corinna",
""
]
] |
new_dataset
| 0.999471 |
1103.5531
|
Andrew Lyons
|
Andrew Lyons
|
Acyclic and Star Colorings of Cographs
|
11 pages, 4 figures
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An \emph{acyclic coloring} of a graph is a proper vertex coloring such that
the union of any two color classes induces a disjoint collection of trees. The
more restricted notion of \emph{star coloring} requires that the union of any
two color classes induces a disjoint collection of stars. We prove that every
acyclic coloring of a cograph is also a star coloring and give a linear-time
algorithm for finding an optimal acyclic and star coloring of a cograph. If the
graph is given in the form of a cotree, the algorithm runs in O(n) time. We
also show that the acyclic chromatic number, the star chromatic number, the
treewidth plus one, and the pathwidth plus one are all equal for cographs.
|
[
{
"version": "v1",
"created": "Tue, 29 Mar 2011 02:25:49 GMT"
}
] | 2011-03-30T00:00:00 |
[
[
"Lyons",
"Andrew",
""
]
] |
new_dataset
| 0.998538 |
1103.5676
|
Tobias Kuhn
|
Tobias Kuhn
|
Codeco: A Grammar Notation for Controlled Natural Language in Predictive
Editors
| null |
In Pre-Proceedings of the Second Workshop on Controlled Natural
Languages (CNL 2010), CEUR Workshop Proceedings, Volume 622, 2010
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing grammar frameworks do not work out particularly well for controlled
natural languages (CNL), especially if they are to be used in predictive
editors. I introduce in this paper a new grammar notation, called Codeco, which
is designed specifically for CNLs and predictive editors. Two different parsers
have been implemented and a large subset of Attempto Controlled English (ACE)
has been represented in Codeco. The results show that Codeco is practical,
adequate and efficient.
|
[
{
"version": "v1",
"created": "Tue, 29 Mar 2011 15:05:11 GMT"
}
] | 2011-03-30T00:00:00 |
[
[
"Kuhn",
"Tobias",
""
]
] |
new_dataset
| 0.998658 |
1103.5115
|
Pars Mutaf
|
Pars Mutaf
|
Defeating Internet attacks and Spam using "disposable" Mobile IPv6 home
addresses
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a model of operation for next generation wireless Internet, in
which a mobile host has hundreds of "disposable" Mobile IPv6 home addresses.
Each correspondent is distributed a different disposable home address. If
attacked on a given home address, the mobile user can block packets to that
address and become unreachable to the attacker. Blocking one address does not
affect other addresses. Other correspondents can still reach the mobile host. A
new home address can also be requested via e-mail, instant messaging, or
directly from the target host using a protocol that we develop. This model is
especially useful against battery exhausting Denial-of-Service (DoS) attacks
and CPU exhausting distributed DoS attacks, since it seems to be the only
viable solution, currently. We show however that this model can also be used to
defeat other attacks and also to stop spam.
|
[
{
"version": "v1",
"created": "Sat, 26 Mar 2011 08:25:02 GMT"
}
] | 2011-03-29T00:00:00 |
[
[
"Mutaf",
"Pars",
""
]
] |
new_dataset
| 0.999204 |
1103.5128
|
Chia-han Lee
|
Chia-han Lee and Wayne Wolf
|
Power Consumption of LDPC Decoders in Software Radio
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
LDPC code is a powerful error correcting code and has been applied to many
advanced communication systems. The prosperity of software radio has motivated
us to investigate the implementation of LDPC decoders on processors. In this
paper, we estimate and compare complexity and power consumption of LDPC
decoding algorithms running on general purpose processors. Using the estimation
results, we show two power control schemes for software radio: SNR-based
algorithm diversity and joint transmit power and receiver energy management.
Overall, this paper discusses general concerns about using processors as the
software radio platform for the implementation of LDPC decoders.
|
[
{
"version": "v1",
"created": "Sat, 26 Mar 2011 13:10:35 GMT"
}
] | 2011-03-29T00:00:00 |
[
[
"Lee",
"Chia-han",
""
],
[
"Wolf",
"Wayne",
""
]
] |
new_dataset
| 0.996133 |
1103.5197
|
Parisa Babaheidarian
|
Parisa Babaheidarian and Somayeh Salimi and Mohammad Reza Aref
|
A New Secret key Agreement Scheme in a Four-Terminal Network
|
6 pages, 3 figures
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new scenario for generating a secret key and two private keys among three
Terminals in the presence of an external eavesdropper is considered. Terminals
1, 2 and 3 intend to share a common secret key concealed from the external
eavesdropper (Terminal 4) and simultaneously, each of Terminals 1 and 2 intends
to share a private key with Terminal 3 while keeping it concealed from each
other and from Terminal 4. All four Terminals observe i.i.d. outputs of
correlated sources and there is a public channel from Terminal 3 to Terminals 1
and 2. An inner bound of the "secret key-private keys capacity region" is
derived and the single letter capacity regions are obtained for some special
cases.
|
[
{
"version": "v1",
"created": "Sun, 27 Mar 2011 11:08:07 GMT"
}
] | 2011-03-29T00:00:00 |
[
[
"Babaheidarian",
"Parisa",
""
],
[
"Salimi",
"Somayeh",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] |
new_dataset
| 0.999047 |
1011.5814
|
Sagarmoy Dutta
|
Sagarmoy Dutta and Piyush P Kurur
|
Quantum Cyclic Code of length dividing $p^{t}+1$
|
Improvement on the previous papaer titled "Quantum Cyclic Codes"
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study cyclic stabiliser codes over $\mathbb{F}_p$ of length
dividing $p^t+1$ for some positive integer $t$. We call these $t$-Frobenius
codes or just Frobenius codes for short. We give methods to construct them and
show that they have efficient decoding algorithms. An important subclass of
stabiliser codes are the linear stabiliser codes. For linear Frobenius codes we
have stronger results: We completely characterise all linear Frobenius codes.
As a consequence, we show that for every integer $n$ that divides $p^t+1$ for
an odd $t$, there are no linear cyclic codes of length $n$. On the other hand
for even $t$, we give an explicit method to construct all of them. This gives
us a many explicit example of Frobenius codes which include the well studied
Laflamme code. We show that the classical notion of BCH distance can be
generalised to all the Frobenius codes that we construct, including the
non-linear ones, and show that the algorithm of Berlekamp can be generalised to
correct quantum errors within the BCH limit. This gives, for the first time, a
family of codes that are neither CSS nor linear for which efficient decoding
algorithm exits. The explicit examples that we construct are summarised in
Table \ref{tab:explicit-examples-short} and explained in detail in Tables
\ref{tab:explicit-examples-2} (linear case) and \ref{tab:explicit-examples-3}
(non-linear case).
|
[
{
"version": "v1",
"created": "Fri, 26 Nov 2010 15:03:47 GMT"
},
{
"version": "v2",
"created": "Fri, 25 Mar 2011 11:30:45 GMT"
}
] | 2011-03-28T00:00:00 |
[
[
"Dutta",
"Sagarmoy",
""
],
[
"Kurur",
"Piyush P",
""
]
] |
new_dataset
| 0.970943 |
1102.2734
|
Navin Kashyap
|
Navin Kashyap and Andrew Thangaraj
|
The Treewidth of MDS and Reed-Muller Codes
|
This constitutes a major upgrade of previous versions; submitted to
IEEE Transactions on Information Theory
| null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The constraint complexity of a graphical realization of a linear code is the
maximum dimension of the local constraint codes in the realization. The
treewidth of a linear code is the least constraint complexity of any of its
cycle-free graphical realizations. This notion provides a useful
parametrization of the maximum-likelihood decoding complexity for linear codes.
In this paper, we prove the surprising fact that for maximum distance separable
codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code,
is defined to be the least constraint complexity (or branch complexity) of any
of its trellis realizations. From this, we obtain exact expressions for the
treewidth of these codes, which constitute the only known explicit expressions
for the treewidth of algebraic codes.
|
[
{
"version": "v1",
"created": "Mon, 14 Feb 2011 11:25:39 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Feb 2011 10:49:42 GMT"
},
{
"version": "v3",
"created": "Fri, 25 Mar 2011 06:32:24 GMT"
}
] | 2011-03-28T00:00:00 |
[
[
"Kashyap",
"Navin",
""
],
[
"Thangaraj",
"Andrew",
""
]
] |
new_dataset
| 0.999515 |
1103.1824
|
Sumanta Chaudhuri Dr.
|
Sumanta Chaudhuri and Sylvain Guilley
|
Side-Channel Oscilloscope
|
2 pages, 1 figure. a brief outline paper
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Side-Channel Analysis used for codebreaking could be used constructively as a
probing tool for internal gates in integrated circuits. This paper outlines
basic methods and mathematics for that purpose
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2011 12:25:20 GMT"
}
] | 2011-03-28T00:00:00 |
[
[
"Chaudhuri",
"Sumanta",
""
],
[
"Guilley",
"Sylvain",
""
]
] |
new_dataset
| 0.991675 |
1103.1482
|
Christoph Lange
|
Christoph Lange, Michael Kohlhase, Catalin David, Deyan Ginev, Andrea
Kohlhase, Bogdan Matican, Stefan Mirea and Vyacheslav Zholudev
|
The Planetary System: Executable Science, Technology, Engineering and
Math Papers
|
Extended Semantic Web Conference (ESWC 2011), Demo Track. To be
published in the Springer LNCS series
| null | null | null |
cs.DL cs.MS
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Executable scientific papers contain not just layouted text for reading. They
contain, or link to, machine-comprehensible representations of the scientific
findings or experiments they describe. Client-side players can thus enable
readers to "check, manipulate and explore the result space". We have realized
executable papers in the STEM domain with the Planetary system. Semantic
annotations associate the papers with a content commons holding the background
ontology, the annotations are exposed as Linked Data, and a frontend player
application hooks modular interactive services into the semantic annotations.
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2011 10:12:40 GMT"
}
] | 2011-03-27T00:00:00 |
[
[
"Lange",
"Christoph",
""
],
[
"Kohlhase",
"Michael",
""
],
[
"David",
"Catalin",
""
],
[
"Ginev",
"Deyan",
""
],
[
"Kohlhase",
"Andrea",
""
],
[
"Matican",
"Bogdan",
""
],
[
"Mirea",
"Stefan",
""
],
[
"Zholudev",
"Vyacheslav",
""
]
] |
new_dataset
| 0.998776 |
1103.4676
|
Ashok Kumar Das
|
Ashok Kumar Das and Debasis Giri
|
An Identity Based Key Management Scheme in Wireless Sensor Networks
|
7 pages, Published in Proceedings of 4th Asian International Mobile
Computing Conference (AMOC 2006), Kolkata, India, pp. 70-76, January 4-7,
2006
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pairwise key establishment is one of the fundamental security services in
sensor networks which enables sensor nodes in a sensor network to communicate
securely with each other using cryptographic techniques. It is not feasible to
apply traditional public key management techniques in resource-constrained
sensor nodes, and also because the sensor nodes are vulnerable to physical
capture. In this paper, we introduce a new scheme called the identity based key
pre-distribution using a pseudo random function (IBPRF), which has better
trade-off between communication overhead, network connectivity and resilience
against node capture compared to the other key pre-distribution schemes. Our
scheme can be easily adapted in mobile sensor networks. This scheme supports
the addition of new sensor nodes after the initial deployment and also works
for any deployment topology. In addition, we propose an improved version of our
scheme to support large sensor networks.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2011 04:22:19 GMT"
}
] | 2011-03-25T00:00:00 |
[
[
"Das",
"Ashok Kumar",
""
],
[
"Giri",
"Debasis",
""
]
] |
new_dataset
| 0.98203 |
1103.4686
|
Suresh Badarla
|
Suresh Badarla, R Rama
|
Note on minimally k-connected graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A k-tree is either a complete graph on (k+1) vertices or given a k-tree G'
with n vertices, a k-tree G with (n+1) vertices can be constructed by
introducing a new vertex v and picking a k-clique Q in G' and then joining each
vertex u in Q. A graph G is k-edge-connected if the graph remains connected
even after deleting fewer edges than k from the graph. A k-edge-connected graph
G is said to be minimally k-connected if G \ {e} is no longer k-edge-connected
for any edge e belongs to E(G) where E(G) denotes the set of edges of G. In
this paper we find two separate O (n2) algorithms so that a minimally
2-connected graph can be obtained from a 2-tree and a minimally k-connected
graph can be obtained from a k-tree. In a k-tree (k \geq 2) we find the edges
which are insensitive to the k-connectivity have both their end vertices of
degrees greater than or equal to k+1.This property is fully exploited to find
an algorithm which reduces any k-tree to a minimally k-connected graph.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2011 06:35:29 GMT"
}
] | 2011-03-25T00:00:00 |
[
[
"Badarla",
"Suresh",
""
],
[
"Rama",
"R",
""
]
] |
new_dataset
| 0.957747 |
1103.4694
|
Mengran Li
|
Razvan Voicu, Mengran Li
|
Cyclic and Inductive Calculi are equivalent
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Brotherston and Simpson [citation] have formalized and investigated cyclic
reasoning, reaching the important conclusion that it is at least as powerful as
inductive reasoning (specifically, they showed that each inductive proof can be
translated into a cyclic proof). We add to their investigation by proving the
converse of this result, namely that each inductive proof can be translated
into an inductive one. This, in effect, establishes the equivalence between
first order cyclic and inductive calculi.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2011 08:07:01 GMT"
}
] | 2011-03-25T00:00:00 |
[
[
"Voicu",
"Razvan",
""
],
[
"Li",
"Mengran",
""
]
] |
new_dataset
| 0.983095 |
1103.4712
|
Vijay Kumar K Mr
|
Vijay Kumar Kodavalla and Dr. P.G. Krishna Mohan
|
Distributed Video Coding: Codec Architecture and Implementation
|
Signal & Image Processing : An International Journal(SIPIJ) Vol.2,
No.1, March 2011
| null |
10.5121/sipij.2011.2111
| null |
cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed Video Coding (DVC) is a new coding paradigm for video
compression, based on Slepian- Wolf (lossless coding) and Wyner-Ziv (lossy
coding) information theoretic results. DVC is useful for emerging applications
such as wireless video cameras, wireless low-power surveillance networks and
disposable video cameras for medical applications etc. The primary objective of
DVC is low-complexity video encoding, where bulk of computation is shifted to
the decoder, as opposed to low-complexity decoder in conventional video
compression standards such as H.264 and MPEG etc. There are couple of early
architectures and implementations of DVC from Stanford University[2][3] in
2002, Berkeley University PRISM (Power-efficient, Robust, hIgh-compression,
Syndrome-based Multimedia coding)[4][5] in 2002 and European project DISCOVER
(DIStributed COding for Video SERvices)[6] in 2007. Primarily there are two
types of DVC techniques namely pixel domain and transform domain based.
Transform domain design will have better rate-distortion (RD) performance as it
exploits spatial correlation between neighbouring samples and compacts the
block energy into as few transform coefficients as possible (aka energy
compaction). In this paper, architecture, implementation details and "C" model
results of our transform domain DVC are presented.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2011 09:50:26 GMT"
}
] | 2011-03-25T00:00:00 |
[
[
"Kodavalla",
"Vijay Kumar",
""
],
[
"Mohan",
"Dr. P. G. Krishna",
""
]
] |
new_dataset
| 0.995251 |
1103.4769
|
Manju
|
Manju, Arun K. Pujari
|
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage
Problem
|
14 pages, 6 figures, IJASUC
|
International Journal of Ad hoc, Sensor & Ubiquitous Computing
(IJASUC) Vol.2, No.1, March 2011
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Target coverage problem in wireless sensor networks is concerned with
maximizing the lifetime of the network while continuously monitoring a set of
targets. A sensor covers targets which are within the sensing range. For a set
of sensors and a set of targets, the sensor-target coverage relationship is
assumed to be known. A sensor cover is a set of sensors that covers all the
targets. The target coverage problem is to determine a set of sensor covers
with maximum aggregated lifetime while constraining the life of each sensor by
its initial battery life. The problem is proved to be NP-complete and heuristic
algorithms to solve this problem are proposed. In the present study, we give a
unified interpretation of earlier algorithms and propose a new and efficient
algorithm. We show that all known algorithms are based on a common reasoning
though they seem to be derived from different algorithmic paradigms. We also
show that though some algorithms guarantee bound on the quality of the
solution, this bound is not meaningful and not practical too. Our
interpretation provides a better insight to the solution techniques. We propose
a new greedy heuristic which prioritizes sensors on residual battery life. We
show empirically that the proposed algorithm outperforms all other heuristics
in terms of quality of solution. Our experimental study over a large set of
randomly generated problem instances also reveals that a very na\"ive greedy
approach yields solutions which is reasonably (appx. 10%) close to the actual
optimal solutions.
|
[
{
"version": "v1",
"created": "Thu, 24 Mar 2011 14:07:38 GMT"
}
] | 2011-03-25T00:00:00 |
[
[
"Manju",
"",
""
],
[
"Pujari",
"Arun K.",
""
]
] |
new_dataset
| 0.995132 |
1103.4438
|
Ravi Teja Sukhavasi
|
Ravi Teja Sukhavasi, Babak Hassibi
|
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
|
Submitted to CDC 2011
| null | null | null |
cs.SY cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of stabilizing an unstable plant over a noisy communication link
is an increasingly important one that arises in problems of distributed control
and networked control systems. Although the work of Schulman and Sahai over the
past two decades, and their development of the notions of "tree codes" and
"anytime capacity", provides the theoretical framework for studying such
problems, there has been scant practical progress in this area because explicit
constructions of tree codes with efficient encoding and decoding did not exist.
To stabilize an unstable plant driven by bounded noise over a noisy channel one
needs real-time encoding and real-time decoding and a reliability which
increases exponentially with delay, which is what tree codes guarantee. We
prove the existence of linear tree codes with high probability and, for erasure
channels, give an explicit construction with an expected encoding and decoding
complexity that is constant per time instant. We give sufficient conditions on
the rate and reliability required of the tree codes to stabilize vector plants
and argue that they are asymptotically tight. This work takes a major step
towards controlling plants over noisy channels, and we demonstrate the efficacy
of the method through several examples.
|
[
{
"version": "v1",
"created": "Wed, 23 Mar 2011 05:27:42 GMT"
}
] | 2011-03-24T00:00:00 |
[
[
"Sukhavasi",
"Ravi Teja",
""
],
[
"Hassibi",
"Babak",
""
]
] |
new_dataset
| 0.99947 |
1103.3742
|
Harry Yosh
|
Harry Yosh
|
The key exchange cryptosystem used with higher order Diophantine
equations
|
8 pages, 0 figure
|
International Journal of Network Security & Its Applications
(IJNSA), Vol.3, No.2, March 2011
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One-way functions are widely used for encrypting the secret in public key
cryptography, although they are regarded as plausibly one-way but have not been
proven so. Here we discuss the public key cryptosystem based on the system of
higher order Diophantine equations. In this system those Diophantine equations
are used as public keys for sender and recipient, and sender can recover the
secret from the Diophantine equation returned from recipient with a trapdoor.
In general the system of Diophantine equations is hard to solve when it is
positive-dimensional and it implies the Diophantine equations in this
cryptosystem works as a possible one-way function. We also discuss some
problems on implementation, which are caused from additional complexity
necessary for constructing Diophantine equations in order to prevent from
attacking by tamperers.
|
[
{
"version": "v1",
"created": "Sat, 19 Mar 2011 02:52:19 GMT"
}
] | 2011-03-22T00:00:00 |
[
[
"Yosh",
"Harry",
""
]
] |
new_dataset
| 0.992758 |
1103.3766
|
Meng Shen
|
Jie Li, Jian-ping Wu, Ke Xu
|
SafeZone: A Hierarchical Inter-Domain Authenticated Source Address
Validation Solution
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by/3.0/
|
Next generation Internet is highly concerned about the issue of reliability.
Principally, the foundation of reliability is authentication of the source IP
address. With the signature-and-verification based defense mechanisms available
today, unfortunately, there is a lack of hierarchical architecture, which makes
the structure of the trust alliance excessively flat and single. Moreover, with
the increasing scale of the trust alliance, costs of validation grow so quickly
that they do not adapt to incremental deployment. Via comparison with
traditional solutions, this article proposes a hierarchical, inter-domain
authenticated source address validation solution named SafeZone. SafeZone
employs two intelligent designs, lightweight tag replacement and a hierarchical
partitioning scheme, each of which helps to ensure that SafeZone can construct
trustworthy and hierarchical trust alliances without the negative influences
and complex operations on de facto networks. Extensive experiments also
indicate that SafeZone can effectively obtain the design goals of a
hierarchical architecture, along with lightweight, loose coupling and
"multi-fence support" and as well as an incremental deployment scheme.
|
[
{
"version": "v1",
"created": "Sat, 19 Mar 2011 09:04:31 GMT"
}
] | 2011-03-22T00:00:00 |
[
[
"Li",
"Jie",
""
],
[
"Wu",
"Jian-ping",
""
],
[
"Xu",
"Ke",
""
]
] |
new_dataset
| 0.995192 |
1103.3831
|
Himansu Sekhar Behera
|
H. S. Behera, Rakesh Mohanty, Debashree Nayak
|
A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling
Algorithm and Its Performance Analysis
|
06 pages; International Journal of Computer Applications, Vol. 5, No.
5, August 2010
| null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Scheduling is the central concept used frequently in Operating System. It
helps in choosing the processes for execution. Round Robin (RR) is one of the
most widely used CPU scheduling algorithm. But, its performance degrades with
respect to context switching, which is an overhead and it occurs during each
scheduling. Overall performance of the system depends on choice of an optimal
time quantum, so that context switching can be reduced. In this paper, we have
proposed a new variant of RR scheduling algorithm, known as Dynamic Quantum
with Readjusted Round Robin (DQRRR) algorithm. We have experimentally shown
that performance of DQRRR is better than RR by reducing number of context
switching, average waiting time and average turn around time.
|
[
{
"version": "v1",
"created": "Sun, 20 Mar 2011 06:45:16 GMT"
}
] | 2011-03-22T00:00:00 |
[
[
"Behera",
"H. S.",
""
],
[
"Mohanty",
"Rakesh",
""
],
[
"Nayak",
"Debashree",
""
]
] |
new_dataset
| 0.973754 |
1103.3832
|
Himansu Sekhar Behera
|
H.S. Behera, Simpi Patel, Bijayalakshmi Panda
|
A New Dynamic Round Robin and SRTN Algorithm with Variable Original Time
Slice and Intelligent Time Slice for Soft Real Time Systems
|
07 pages; International Journal of Computer Applications, Vol 16, No.
1(9) February 2011
| null |
10.5120/2037-2648
| null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The main objective of the paper is to improve the Round Robin (RR) algorithm
using dynamic ITS by coalescing it with Shortest Remaining Time Next (SRTN)
algorithm thus reducing the average waiting time, average turnaround time and
the number of context switches. The original time slice has been calculated for
each process based on its burst time.This is mostly suited for soft real time
systems where meeting of deadlines is desirable to increase its performance.
The advantage is that processes that are closer to their remaining completion
time will get more chances to execute and leave the ready queue. This will
reduce the number of processes in the ready queue by knocking out short jobs
relatively faster in a hope to reduce the average waiting time, turn around
time and number of context switches. This paper improves the algorithm [8] and
the experimental analysis shows that the proposed algorithm performs better
than algorithm [6] and [8] when the processes are having an increasing order,
decreasing order and random order of burst time.
|
[
{
"version": "v1",
"created": "Sun, 20 Mar 2011 06:56:27 GMT"
}
] | 2011-03-22T00:00:00 |
[
[
"Behera",
"H. S.",
""
],
[
"Patel",
"Simpi",
""
],
[
"Panda",
"Bijayalakshmi",
""
]
] |
new_dataset
| 0.996919 |
1103.3569
|
Deqing Wang
|
Deqing Wang, Mengxiang Lin, Hui Zhang, Hongping Hu
|
Detect Related Bugs from Source Code Using Bug Information
|
10 pages, 5 figures, 4 tables conference; 2010 IEEE 34th Annual
Computer Software and Applications Conference
| null |
10.1109/COMPSAC.2010.27
| null |
cs.SE
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Open source projects often maintain open bug repositories during development
and maintenance, and the reporters often point out straightly or implicitly the
reasons why bugs occur when they submit them. The comments about a bug are very
valuable for developers to locate and fix the bug. Meanwhile, it is very common
in large software for programmers to override or overload some methods
according to the same logic. If one method causes a bug, it is obvious that
other overridden or overloaded methods maybe cause related or similar bugs. In
this paper, we propose and implement a tool Rebug- Detector, which detects
related bugs using bug information and code features. Firstly, it extracts bug
features from bug information in bug repositories; secondly, it locates bug
methods from source code, and then extracts code features of bug methods;
thirdly, it calculates similarities between each overridden or overloaded
method and bug methods; lastly, it determines which method maybe causes
potential related or similar bugs. We evaluate Rebug-Detector on an open source
project: Apache Lucene-Java. Our tool totally detects 61 related bugs,
including 21 real bugs and 10 suspected bugs, and it costs us about 15.5
minutes. The results show that bug features and code features extracted by our
tool are useful to find real bugs in existing projects.
|
[
{
"version": "v1",
"created": "Fri, 18 Mar 2011 07:50:51 GMT"
}
] | 2011-03-21T00:00:00 |
[
[
"Wang",
"Deqing",
""
],
[
"Lin",
"Mengxiang",
""
],
[
"Zhang",
"Hui",
""
],
[
"Hu",
"Hongping",
""
]
] |
new_dataset
| 0.999171 |
1103.3308
|
Mana Mohammed
|
Mohammed Mana, Mohammed Feham, and Boucif Amar Bensaber
|
A Light Weight Protocol to Provide Location Privacy in Wireless Body
Area networks
|
11 pages
|
International Journal of Network Security & Its Applications
(IJNSA), Vol.3, No.2, March 2011
|
10.5121/ijnsa.2011.3201
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Location privacy is one of the major security problems in a Wireless Body
Area Networks (WBANs). An eavesdropper can keep track of the place and time
devices are communicating. To make things even worse, the attacker does not
have to be physically close to the communicating devices, he can use a device
with a stronger antenna. The unique hardware address of a mobile device can
often be linked to the identity of the user operating the device. This
represents a violation of the user's privacy. The user should decide when
his/her location is revealed and when not. In this paper, we first categorize
the type of eavesdroppers for WBANs, and then we propose a new scheme to
provide the location privacy in Wireless Body Area Networks (WBANs).
|
[
{
"version": "v1",
"created": "Wed, 16 Mar 2011 22:10:18 GMT"
}
] | 2011-03-18T00:00:00 |
[
[
"Mana",
"Mohammed",
""
],
[
"Feham",
"Mohammed",
""
],
[
"Bensaber",
"Boucif Amar",
""
]
] |
new_dataset
| 0.997179 |
1103.3322
|
EPTCS
|
Freek Wiedijk (Radboud University Nijmegen)
|
Stateless HOL
|
In Proceedings TYPES 2009, arXiv:1103.3111
|
EPTCS 53, 2011, pp. 47-61
|
10.4204/EPTCS.53.4
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a version of the HOL Light system that supports undoing
definitions in such a way that this does not compromise the soundness of the
logic. In our system the code that keeps track of the constants that have been
defined thus far has been moved out of the kernel. This means that the kernel
now is purely functional.
The changes to the system are small. All existing HOL Light developments can
be run by the stateless system with only minor changes.
The basic principle behind the system is not to name constants by strings,
but by pairs consisting of a string and a definition. This means that the data
structures for the terms are all merged into one big graph. OCaml - the
implementation language of the system - can use pointer equality to establish
equality of data structures fast. This allows the system to run at acceptable
speeds. Our system runs at about 85% of the speed of the stateful version of
HOL Light.
|
[
{
"version": "v1",
"created": "Thu, 17 Mar 2011 00:19:48 GMT"
}
] | 2011-03-18T00:00:00 |
[
[
"Wiedijk",
"Freek",
"",
"Radboud University Nijmegen"
]
] |
new_dataset
| 0.985181 |
1103.3340
|
Ahmed Riadh Rebai
|
Ahmed Riadh Rebai and Said Hanafi
|
A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11
WLANs
|
15 pages, 8 figures, 3 tables, International Journal of Computer
Networks & Communications (IJCNC)
|
International Journal of Computer Networks & Communications
(IJCNC) Vol.3, No.2, March 2011
|
10.5121/ijcnc.2011.3214
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we expose a dynamic traffic-classification scheme to support
multimedia applications such as voice and broadband video transmissions over
IEEE 802.11 Wireless Local Area Networks (WLANs). Obviously, over a Wi-Fi link
and to better serve these applications - which normally have strict bounded
transmission delay or minimum link rate requirement - a service differentiation
technique can be applied to the media traffic transmitted by the same mobile
node using the well-known 802.11e Enhanced Distributed Channel Access (EDCA)
protocol. However, the given EDCA mode does not offer user differentiation,
which can be viewed as a deficiency in multi-access wireless networks.
Accordingly, we propose a new inter-node priority access scheme for IEEE
802.11e networks which is compatible with the EDCA scheme. The proposed scheme
joins a dynamic user-weight to each mobile station depending on its outgoing
data, and therefore deploys inter-node priority for the channel access to
complement the existing EDCA inter-frame priority. This provides efficient
quality of service control across multiple users within the same coverage area
of an access point. We provide performance evaluations to compare the proposed
access model with the basic EDCA 802.11 MAC protocol mode to elucidate the
quality improvement achieved for multimedia communication over 802.11 WLANs.
|
[
{
"version": "v1",
"created": "Thu, 17 Mar 2011 05:58:35 GMT"
}
] | 2011-03-18T00:00:00 |
[
[
"Rebai",
"Ahmed Riadh",
""
],
[
"Hanafi",
"Said",
""
]
] |
new_dataset
| 0.998946 |
1103.2811
|
EPTCS
|
Bob Coecke (Oxford University Computing Laboratory), Bill Edwards
(Oxford University Computing Laboratory)
|
Three qubit entanglement within graphical Z/X-calculus
|
In Proceedings HPC 2010, arXiv:1103.2268
|
EPTCS 52, 2011, pp. 22-33
|
10.4204/EPTCS.52.3
| null |
cs.LO quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The compositional techniques of categorical quantum mechanics are applied to
analyse 3-qubit quantum entanglement. In particular the graphical calculus of
complementary observables and corresponding phases due to Duncan and one of the
authors is used to construct representative members of the two genuinely
tripartite SLOCC classes of 3-qubit entangled states, GHZ and W. This nicely
illustrates the respectively pairwise and global tripartite entanglement found
in the W- and GHZ-class states. A new concept of supplementarity allows us to
characterise inhabitants of the W class within the abstract diagrammatic
calculus; these method extends to more general multipartite qubit states.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2011 23:15:40 GMT"
}
] | 2011-03-17T00:00:00 |
[
[
"Coecke",
"Bob",
"",
"Oxford University Computing Laboratory"
],
[
"Edwards",
"Bill",
"",
"Oxford University Computing Laboratory"
]
] |
new_dataset
| 0.996836 |
1103.2812
|
EPTCS
|
Bob Coecke, Aleks Kissinger, Alex Merry, Shibdas Roy
|
The GHZ/W-calculus contains rational arithmetic
|
In Proceedings HPC 2010, arXiv:1103.2268
|
EPTCS 52, 2011, pp. 34-48
|
10.4204/EPTCS.52.4
| null |
cs.LO quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Graphical calculi for representing interacting quantum systems serve a number
of purposes: compositionally, intuitive graphical reasoning, and a logical
underpinning for automation. The power of these calculi stems from the fact
that they embody generalized symmetries of the structure of quantum operations,
which, for example, stretch well beyond the Choi-Jamiolkowski isomorphism. One
such calculus takes the GHZ and W states as its basic generators. Here we show
that this language allows one to encode standard rational calculus, with the
GHZ state as multiplication, the W state as addition, the Pauli X gate as
multiplicative inversion, and the Pauli Z gate as additive inversion.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2011 23:15:53 GMT"
}
] | 2011-03-17T00:00:00 |
[
[
"Coecke",
"Bob",
""
],
[
"Kissinger",
"Aleks",
""
],
[
"Merry",
"Alex",
""
],
[
"Roy",
"Shibdas",
""
]
] |
new_dataset
| 0.999462 |
1005.4997
|
Sitabhra Sinha
|
Sitabhra Sinha, Md Izhar Ashraf, Raj Kumar Pan and Bryan Kenneth Wells
|
Network analysis of a corpus of undeciphered Indus civilization
inscriptions indicates syntactic organization
|
17 pages (includes 4 page appendix containing Indus sign list), 14
figures
|
Computer Speech and Language, 25 (2011) 639-654
|
10.1016/j.csl.2010.05.007
| null |
cs.CL physics.data-an physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Archaeological excavations in the sites of the Indus Valley civilization
(2500-1900 BCE) in Pakistan and northwestern India have unearthed a large
number of artifacts with inscriptions made up of hundreds of distinct signs. To
date there is no generally accepted decipherment of these sign sequences and
there have been suggestions that the signs could be non-linguistic. Here we
apply complex network analysis techniques to a database of available Indus
inscriptions, with the aim of detecting patterns indicative of syntactic
organization. Our results show the presence of patterns, e.g., recursive
structures in the segmentation trees of the sequences, that suggest the
existence of a grammar underlying these inscriptions.
|
[
{
"version": "v1",
"created": "Thu, 27 May 2010 07:24:29 GMT"
}
] | 2011-03-15T00:00:00 |
[
[
"Sinha",
"Sitabhra",
""
],
[
"Ashraf",
"Md Izhar",
""
],
[
"Pan",
"Raj Kumar",
""
],
[
"Wells",
"Bryan Kenneth",
""
]
] |
new_dataset
| 0.987916 |
1103.2376
|
Leonid Perlovsky
|
Leonid Perlovsky (Harvard University and the AFRL)
|
Language, Emotions, and Cultures: Emotional Sapir-Whorf Hypothesis
|
16p, 2 figs
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An emotional version of Sapir-Whorf hypothesis suggests that differences in
language emotionalities influence differences among cultures no less than
conceptual differences. Conceptual contents of languages and cultures to
significant extent are determined by words and their semantic differences;
these could be borrowed among languages and exchanged among cultures. Emotional
differences, as suggested in the paper, are related to grammar and mostly
cannot be borrowed. Conceptual and emotional mechanisms of languages are
considered here along with their functions in the mind and cultural evolution.
A fundamental contradiction in human mind is considered: language evolution
requires reduced emotionality, but "too low" emotionality makes language
"irrelevant to life," disconnected from sensory-motor experience. Neural
mechanisms of these processes are suggested as well as their mathematical
models: the knowledge instinct, the language instinct, the dual model
connecting language and cognition, dynamic logic, neural modeling fields.
Mathematical results are related to cognitive science, linguistics, and
psychology. Experimental evidence and theoretical arguments are discussed.
Approximate equations for evolution of human minds and cultures are obtained.
Their solutions identify three types of cultures: "conceptual"-pragmatic
cultures, in which emotionality of language is reduced and differentiation
overtakes synthesis resulting in fast evolution at the price of uncertainty of
values, self doubts, and internal crises; "traditional-emotional" cultures
where differentiation lags behind synthesis, resulting in cultural stability at
the price of stagnation; and "multi-cultural" societies combining fast cultural
evolution and stability. Unsolved problems and future theoretical and
experimental directions are discussed.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2011 21:13:38 GMT"
}
] | 2011-03-15T00:00:00 |
[
[
"Perlovsky",
"Leonid",
"",
"Harvard University and the AFRL"
]
] |
new_dataset
| 0.998998 |
1103.2408
|
Sandeep Tata
|
Jun Rao (LinkedIn), Eugene J. Shekita (IBM Research), Sandeep Tata
(IBM Research)
|
Using Paxos to Build a Scalable, Consistent, and Highly Available
Datastore
|
VLDB2011
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 4, pp.
243-254 (2011)
| null | null |
cs.DB cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spinnaker is an experimental datastore that is designed to run on a large
cluster of commodity servers in a single datacenter. It features key-based
range partitioning, 3-way replication, and a transactional get-put API with the
option to choose either strong or timeline consistency on reads. This paper
describes Spinnaker's Paxos-based replication protocol. The use of Paxos
ensures that a data partition in Spinnaker will be available for reads and
writes as long a majority of its replicas are alive. Unlike traditional
master-slave replication, this is true regardless of the failure sequence that
occurs. We show that Paxos replication can be competitive with alternatives
that provide weaker consistency guarantees. Compared to an eventually
consistent datastore, we show that Spinnaker can be as fast or even faster on
reads and only 5% to 10% slower on writes.
|
[
{
"version": "v1",
"created": "Sat, 12 Mar 2011 01:06:32 GMT"
}
] | 2011-03-15T00:00:00 |
[
[
"Rao",
"Jun",
"",
"LinkedIn"
],
[
"Shekita",
"Eugene J.",
"",
"IBM Research"
],
[
"Tata",
"Sandeep",
"",
"IBM Research"
]
] |
new_dataset
| 0.992521 |
1103.2409
|
Bolin Ding
|
Bolin Ding (UIUC), Arnd Christian K\"onig (Microsoft Research)
|
Fast Set Intersection in Memory
|
VLDB2011
|
Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 4, pp.
255-266 (2011)
| null | null |
cs.DB cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Set intersection is a fundamental operation in information retrieval and
database systems. This paper introduces linear space data structures to
represent sets such that their intersection can be computed in a worst-case
efficient way. In general, given k (preprocessed) sets, with totally n
elements, we will show how to compute their intersection in expected time
O(n/sqrt(w)+kr), where r is the intersection size and w is the number of bits
in a machine-word. In addition,we introduce a very simple version of this
algorithm that has weaker asymptotic guarantees but performs even better in
practice; both algorithms outperform the state of the art techniques in terms
of execution time for both synthetic and real data sets and workloads.
|
[
{
"version": "v1",
"created": "Sat, 12 Mar 2011 01:08:36 GMT"
}
] | 2011-03-15T00:00:00 |
[
[
"Ding",
"Bolin",
"",
"UIUC"
],
[
"König",
"Arnd Christian",
"",
"Microsoft Research"
]
] |
new_dataset
| 0.998383 |
1103.2590
|
Rajkumar Buyya
|
Yi Wei, Karthik Sukumar, Christian Vecchiola, Dileban Karunamoorthy
and Rajkumar Buyya
|
Aneka Cloud Application Platform and Its Integration with Windows Azure
|
30 pages, 24 figures
|
Cloud Computing: Methodology, Systems, and Applications, L. Wang,
Rajiv Ranjan, Jinjun Chen, and Boualem Benatallah (eds), ISBN: 9781439856413,
CRC Press, Boca Raton, FL, USA, 2011
| null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Aneka is an Application Platform-as-a-Service (Aneka PaaS) for Cloud
Computing. It acts as a framework for building customized applications and
deploying them on either public or private Clouds. One of the key features of
Aneka is its support for provisioning resources on different public Cloud
providers such as Amazon EC2, Windows Azure and GoGrid. In this chapter, we
will present Aneka platform and its integration with one of the public Cloud
infrastructures, Windows Azure, which enables the usage of Windows Azure
Compute Service as a resource provider of Aneka PaaS. The integration of the
two platforms will allow users to leverage the power of Windows Azure Platform
for Aneka Cloud Computing, employing a large number of compute instances to run
their applications in parallel. Furthermore, customers of the Windows Azure
platform can benefit from the integration with Aneka PaaS by embracing the
advanced features of Aneka in terms of multiple programming models, scheduling
and management services, application execution services, accounting and pricing
services and dynamic provisioning services. Finally, in addition to the Windows
Azure Platform we will illustrate in this chapter the integration of Aneka PaaS
with other public Cloud platforms such as Amazon EC2 and GoGrid, and virtual
machine management platforms such as Xen Server. The new support of
provisioning resources on Windows Azure once again proves the adaptability,
extensibility and flexibility of Aneka.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2011 06:38:11 GMT"
}
] | 2011-03-15T00:00:00 |
[
[
"Wei",
"Yi",
""
],
[
"Sukumar",
"Karthik",
""
],
[
"Vecchiola",
"Christian",
""
],
[
"Karunamoorthy",
"Dileban",
""
],
[
"Buyya",
"Rajkumar",
""
]
] |
new_dataset
| 0.999707 |
1103.2690
|
Valentin Savin
|
Lam Pham Sy, Valentin Savin, David Declercq, Nghia Pham
|
Scheduled-PEG construction of LDPC codes for Upper-Layer FEC
|
WCC 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Progressive Edge Growth (PEG) algorithm is one of the most widely-used
method for constructing finite length LDPC codes. In this paper we consider the
PEG algorithm together with a scheduling distribution, which specifies the
order in which edges are established in the graph. The goal is to find a
scheduling distribution that yields "the best" performance in terms of decoding
overhead, performance metric specific to erasure codes and widely used for
upper-layer forward error correction (UL-FEC). We rigorously formulate this
optimization problem, and we show that it can be addressed by using genetic
optimization algorithms. We also exhibit PEG codes with optimized scheduling
distribution, whose decoding overhead is less than half of the decoding
overhead of their classical-PEG counterparts.
|
[
{
"version": "v1",
"created": "Mon, 14 Mar 2011 15:29:02 GMT"
}
] | 2011-03-15T00:00:00 |
[
[
"Sy",
"Lam Pham",
""
],
[
"Savin",
"Valentin",
""
],
[
"Declercq",
"David",
""
],
[
"Pham",
"Nghia",
""
]
] |
new_dataset
| 0.990592 |
1010.4891
|
Gael Varoquaux
|
Prabhu Ramachandran, Ga\"el Varoquaux (LNAO, INRIA Saclay - Ile de
France)
|
Mayavi: a package for 3D visualization of scientific data
| null |
Computing and Science and Engineering 13, 2 (2011) 40-51
|
10.1109/MCSE.2011.35
| null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mayavi is an open-source, general-purpose, 3D scientific visualization
package. It seeks to provide easy and interactive tools for data visualization
that fit with the scientific user's workflow. For this purpose, Mayavi provides
several entry points: a full-blown interactive application; a Python library
with both a MATLAB-like interface focused on easy scripting and a feature-rich
object hierarchy; widgets associated with these objects for assembling in a
domain-specific application, and plugins that work with a general purpose
application-building framework. In this article, we present an overview of the
various features of Mayavi, we then provide insight on the design and
engineering decisions made in implementing Mayavi, and finally discuss a few
novel applications.
|
[
{
"version": "v1",
"created": "Sat, 23 Oct 2010 16:34:51 GMT"
}
] | 2011-03-14T00:00:00 |
[
[
"Ramachandran",
"Prabhu",
"",
"LNAO, INRIA Saclay - Ile de\n France"
],
[
"Varoquaux",
"Gaël",
"",
"LNAO, INRIA Saclay - Ile de\n France"
]
] |
new_dataset
| 0.998652 |
1102.1523
|
Gael Varoquaux
|
Stefan Van Der Walt, S. Chris Colbert, Ga\"el Varoquaux (Parietal)
|
The NumPy array: a structure for efficient numerical computation
| null |
Computing in Science and Engineering 13, 2 (2011) 22-30
|
10.1109/MCSE.2011.37
| null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In the Python world, NumPy arrays are the standard representation for
numerical data. Here, we show how these arrays enable efficient implementation
of numerical computations in a high-level language. Overall, three techniques
are applied to improve performance: vectorizing calculations, avoiding copying
data in memory, and minimizing operation counts. We first present the NumPy
array structure, then show how to use it for efficient computation, and finally
how to share array data with other libraries.
|
[
{
"version": "v1",
"created": "Tue, 8 Feb 2011 07:25:56 GMT"
}
] | 2011-03-14T00:00:00 |
[
[
"Van Der Walt",
"Stefan",
"",
"Parietal"
],
[
"Colbert",
"S. Chris",
"",
"Parietal"
],
[
"Varoquaux",
"Gaël",
"",
"Parietal"
]
] |
new_dataset
| 0.99913 |
1103.2336
|
Raul
|
Nabil Litayem, Ahmed Ben Achballah, Slim Ben Saoud
|
Building XenoBuntu Linux Distribution for Teaching and Prototyping
Real-Time Operating Systems
| null | null | null | null |
cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper describes the realization of a new Linux distribution based on
Ubuntu Linux and Xenomai Real-Time framework. This realization is motivated by
the eminent need of real-time systems in modern computer science courses. The
majority of the technical choices are made after qualitative comparison. The
main goal of this distribution is to offer standard Operating Systems (OS) that
include Xenomai infrastructure and the essential tools to begin hard real-time
application development inside a convivial desktop environment. The released
live/installable DVD can be adopted to emulate several classic RTOS Application
Program Interfaces (APIs), directly use and understand real-time Linux in
convivial desktop environment and prototyping real-time embedded applications.
|
[
{
"version": "v1",
"created": "Fri, 11 Mar 2011 18:36:38 GMT"
}
] | 2011-03-14T00:00:00 |
[
[
"Litayem",
"Nabil",
""
],
[
"Achballah",
"Ahmed Ben",
""
],
[
"Saoud",
"Slim Ben",
""
]
] |
new_dataset
| 0.985874 |
1103.1778
|
Jan Egger
|
Jan Egger, Miriam H. A. Bauer, Daniela Kuhnt, Bernd Freisleben,
Christopher Nimsky
|
Pituitary Adenoma Segmentation
|
4 pages, 5 figures, BIOSIGNAL, Berlin, 2010
| null | null | null |
cs.CE physics.med-ph q-bio.TO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sellar tumors are approximately 10-15% among all intracranial neoplasms. The
most common sellar lesion is the pituitary adenoma. Manual segmentation is a
time-consuming process that can be shortened by using adequate algorithms. In
this contribution, we present a segmentation method for pituitary adenoma. The
method is based on an algorithm we developed recently in previous work where
the novel segmentation scheme was successfully used for segmentation of
glioblastoma multiforme and provided an average Dice Similarity Coefficient
(DSC) of 77%. This scheme is used for automatic adenoma segmentation. In our
experimental evaluation, neurosurgeons with strong experiences in the treatment
of pituitary adenoma performed manual slice-by-slice segmentation of 10
magnetic resonance imaging (MRI) cases. Afterwards, the segmentations were
compared with the segmentation results of the proposed method via the DSC. The
average DSC for all data sets was 77.49% +/- 4.52%. Compared with a manual
segmentation that took, on the average, 3.91 +/- 0.54 minutes, the overall
segmentation in our implementation required less than 4 seconds.
|
[
{
"version": "v1",
"created": "Wed, 9 Mar 2011 13:33:23 GMT"
}
] | 2011-03-10T00:00:00 |
[
[
"Egger",
"Jan",
""
],
[
"Bauer",
"Miriam H. A.",
""
],
[
"Kuhnt",
"Daniela",
""
],
[
"Freisleben",
"Bernd",
""
],
[
"Nimsky",
"Christopher",
""
]
] |
new_dataset
| 0.982867 |
1103.1360
|
Sumanta Chaudhuri Dr.
|
Sumanta Chaudhuri, Sylvain Guilley, Philippe Hoogvorst, Jean-Luc
Danger, Taha Beyrouthy, Alin Razafindraibe, Laurent Fesquet, Marc Renaudin
|
A Secure Asynchronous FPGA Architecture, Experimental Results and Some
Debug Feedback
|
18 Pages, 23 figures. In detail description of a 3X3 Aysnchronous
FPGA Tape-Out
| null | null | null |
cs.AR cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents an asynchronous FPGA architecture for implementing
cryptographic algorithms secured against physical cryptanalysis. We discuss the
suitability of asynchronous reconfigurable architectures for such applications
before proceeding to model the side channel and defining our objectives. The
logic block architecture is presented in detail. We discuss several solutions
for the interconnect architecture, and how these solutions can be ported to
other flavours of interconnect (i.e. single driver). Next We discuss in detail
a high speed asynchronous configuration chain architecture used to configure
our asynchronous FPGA with simulation results, and we present a 3 X 3 prototype
FPGA fabricated in 65 nm CMOS. Lastly we present experiments to test the high
speed asynchronous configuration chain and evaluate how far our objectives have
been achieved with proposed solutions, and we conclude with emphasis on
complementary FPGA CAD algorithms, and the effect of CMOS variation on
Side-Channel Vulnerability.
|
[
{
"version": "v1",
"created": "Mon, 7 Mar 2011 20:04:05 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Mar 2011 12:13:20 GMT"
}
] | 2011-03-09T00:00:00 |
[
[
"Chaudhuri",
"Sumanta",
""
],
[
"Guilley",
"Sylvain",
""
],
[
"Hoogvorst",
"Philippe",
""
],
[
"Danger",
"Jean-Luc",
""
],
[
"Beyrouthy",
"Taha",
""
],
[
"Razafindraibe",
"Alin",
""
],
[
"Fesquet",
"Laurent",
""
],
[
"Renaudin",
"Marc",
""
]
] |
new_dataset
| 0.995331 |
1103.1544
|
Ranjan Pal
|
Ranjan Pal, Aravind Kailas
|
Cost Sharing in Social Community Networks
| null | null | null | null |
cs.NI cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless social community networks (WSCNs) is an emerging technology that
operate in the unlicensed spectrum and have been created as an alternative to
cellular wireless networks for providing low-cost, high speed wireless data
access in urban areas. WSCNs is an upcoming idea that is starting to gain
attention amongst the civilian Internet users. By using \emph{special} WiFi
routers that are provided by a social community network provider (SCNP), users
can effectively share their connection with the neighborhood in return for some
monthly monetary benefits. However, deployment maps of existing WSCNs reflect
their slow progress in capturing the WiFi router market. In this paper, we look
at a router design and cost sharing problem in WSCNs to improve deployment. We
devise asimple to implement, successful a mechanism is successful if it
achieves its intended purpose. For example in this work, a successful mechanism
would help install routers in a locality}, \emph{budget-balanced},
\emph{ex-post efficient}, and \emph{individually rational} {a mechanism is
individually rational if the benefit each agent obtains is greater than its
cost.} auction-based mechanism that generates the \emph{optimal} number of
features a router should have and allocates costs to residential users in
\emph{proportion} to the feature benefits they receive. Our problem is
important to a new-entrant SCNP when it wants to design its multi-feature
routers with the goal to popularize them and increase their deployment in a
residential locality. Our proposed mechanism accounts for heterogeneous user
preferences towards different router features and comes up with the optimal
\emph{(feature-set, user costs)} router blueprint that satisfies each user in a
locality, in turn motivating them to buy routers and thereby improve
deployment.
|
[
{
"version": "v1",
"created": "Tue, 8 Mar 2011 14:47:38 GMT"
}
] | 2011-03-09T00:00:00 |
[
[
"Pal",
"Ranjan",
""
],
[
"Kailas",
"Aravind",
""
]
] |
new_dataset
| 0.997633 |
cs/0703019
|
Jean Cardinal
|
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwena\"el Joret,
Stefan Langerman, Ilan Newman, Oren Weimann
|
The Stackelberg Minimum Spanning Tree Game
|
v3: Referees' comments incorporated. A preliminary version appeared
in the proceedings of the 10th Workshop on Algorithms and Data Structures
(WADS 2007)
|
Algorithmica, vol. 59, no. 2, pp. 129--144, 2011
|
10.1007/s00453-009-9299-y
| null |
cs.GT cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a one-round two-player network pricing game, the Stackelberg
Minimum Spanning Tree game or StackMST.
The game is played on a graph (representing a network), whose edges are
colored either red or blue, and where the red edges have a given fixed cost
(representing the competitor's prices). The first player chooses an assignment
of prices to the blue edges, and the second player then buys the cheapest
possible minimum spanning tree, using any combination of red and blue edges.
The goal of the first player is to maximize the total price of purchased blue
edges. This game is the minimum spanning tree analog of the well-studied
Stackelberg shortest-path game.
We analyze the complexity and approximability of the first player's best
strategy in StackMST. In particular, we prove that the problem is APX-hard even
if there are only two different red costs, and give an approximation algorithm
whose approximation ratio is at most $\min \{k,1+\ln b,1+\ln W\}$, where $k$ is
the number of distinct red costs, $b$ is the number of blue edges, and $W$ is
the maximum ratio between red costs. We also give a natural integer linear
programming formulation of the problem, and show that the integrality gap of
the fractional relaxation asymptotically matches the approximation guarantee of
our algorithm.
|
[
{
"version": "v1",
"created": "Mon, 5 Mar 2007 09:46:26 GMT"
},
{
"version": "v2",
"created": "Mon, 22 Sep 2008 15:44:40 GMT"
},
{
"version": "v3",
"created": "Thu, 17 Sep 2009 15:20:43 GMT"
}
] | 2011-03-07T00:00:00 |
[
[
"Cardinal",
"Jean",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Fiorini",
"Samuel",
""
],
[
"Joret",
"Gwenaël",
""
],
[
"Langerman",
"Stefan",
""
],
[
"Newman",
"Ilan",
""
],
[
"Weimann",
"Oren",
""
]
] |
new_dataset
| 0.981436 |
1103.0633
|
Yashwant Dongre prof
|
Y. V. Dongare, P. S. Dhabe and S. V. Deshmukh
|
RDBNorma: - A semi-automated tool for relational database schema
normalization up to third normal form
|
22 pages and international journal
|
International Journal of Database Management Systems ( IJDMS ),
Vol.3, No.1, February 2011
| null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper a tool called RDBNorma is proposed, that uses a novel approach
to represent a relational database schema and its functional dependencies in
computer memory using only one linked list and used for semi-automating the
process of relational database schema normalization up to third normal form.
This paper addresses all the issues of representing a relational schema along
with its functional dependencies using one linked list along with the
algorithms to convert a relation into second and third normal form by using
above representation. We have compared performance of RDBNorma with existing
tool called Micro using standard relational schemas collected from various
resources. It is observed that proposed tool is at least 2.89 times faster than
the Micro and requires around half of the space than Micro to represent a
relation. Comparison is done by entering all the attributes and functional
dependencies holds on a relation in the same order and implementing both the
tools in same language and on same machine.
|
[
{
"version": "v1",
"created": "Thu, 3 Mar 2011 09:44:14 GMT"
}
] | 2011-03-04T00:00:00 |
[
[
"Dongare",
"Y. V.",
""
],
[
"Dhabe",
"P. S.",
""
],
[
"Deshmukh",
"S. V.",
""
]
] |
new_dataset
| 0.980244 |
1103.0697
|
Adrian Walker
|
Adrian Walker
|
A Wiki for Business Rules in Open Vocabulary, Executable English
|
9 pages
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of business-IT alignment is of widespread economic concern.
As one way of addressing the problem, this paper describes an online system
that functions as a kind of Wiki -- one that supports the collaborative writing
and running of business and scientific applications, as rules in open
vocabulary, executable English, using a browser.
Since the rules are in English, they are indexed by Google and other search
engines. This is useful when looking for rules for a task that one has in mind.
The design of the system integrates the semantics of data, with a semantics
of an inference method, and also with the meanings of English sentences. As
such, the system has functionality that may be useful for the Rules, Logic,
Proof and Trust requirements of the Semantic Web.
The system accepts rules, and small numbers of facts, typed or copy-pasted
directly into a browser. One can then run the rules, again using a browser. For
larger amounts of data, the system uses information in the rules to
automatically generate and run SQL over networked databases. From a few highly
declarative rules, the system typically generates SQL that would be too
complicated to write reliably by hand. However, the system can explain its
results in step-by-step hypertexted English, at the business or scientific
level
As befits a Wiki, shared use of the system is free.
|
[
{
"version": "v1",
"created": "Thu, 3 Mar 2011 14:31:32 GMT"
}
] | 2011-03-04T00:00:00 |
[
[
"Walker",
"Adrian",
""
]
] |
new_dataset
| 0.982439 |
1103.0759
|
Fangfei Zhou
|
Fangfei Zhou, Manish Goel, Peter Desnoyers, Ravi Sundaram
|
Scheduler Vulnerabilities and Attacks in Cloud Computing
| null | null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In hardware virtualization a hypervisor provides multiple Virtual Machines
(VMs) on a single physical system, each executing a separate operating system
instance. The hypervisor schedules execution of these VMs much as the scheduler
in an operating system does, balancing factors such as fairness and I/O
performance. As in an operating system, the scheduler may be vulnerable to
malicious behavior on the part of users seeking to deny service to others or
maximize their own resource usage.
Recently, publically available cloud computing services such as Amazon EC2
have used virtualization to provide customers with virtual machines running on
the provider's hardware, typically charging by wall clock time rather than
resources consumed. Under this business model, manipulation of the scheduler
may allow theft of service at the expense of other customers, rather than
merely reallocating resources within the same administrative domain.
We describe a flaw in the Xen scheduler allowing virtual machines to consume
almost all CPU time, in preference to other users, and demonstrate kernel-based
and user-space versions of the attack. We show results demonstrating the
vulnerability in the lab, consuming as much as 98% of CPU time regardless of
fair share, as well as on Amazon EC2, where Xen modifications protect other
users but still allow theft of service. In case of EC2, following the
responsible disclosure model, we have reported this vulnerability to Amazon;
they have since implemented a fix that we have tested and verified (See
Appendix B). We provide a novel analysis of the necessary conditions for such
attacks, and describe scheduler modifications to eliminate the vulnerability.
We present experimental results demonstrating the effectiveness of these
defenses while imposing negligible overhead.
|
[
{
"version": "v1",
"created": "Thu, 3 Mar 2011 19:09:47 GMT"
}
] | 2011-03-04T00:00:00 |
[
[
"Zhou",
"Fangfei",
""
],
[
"Goel",
"Manish",
""
],
[
"Desnoyers",
"Peter",
""
],
[
"Sundaram",
"Ravi",
""
]
] |
new_dataset
| 0.954265 |
1103.0358
|
Anthony Kim
|
Anthony Kim
|
On Network Coding Capacity - Matroidal Networks and Network Capacity
Regions
|
Master of Engineering Thesis, MIT, September 2010, 70 pages, 10
figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One fundamental problem in the field of network coding is to determine the
network coding capacity of networks under various network coding schemes. In
this thesis, we address the problem with two approaches: matroidal networks and
capacity regions.
In our matroidal approach, we prove the converse of the theorem which states
that, if a network is scalar-linearly solvable then it is a matroidal network
associated with a representable matroid over a finite field. As a consequence,
we obtain a correspondence between scalar-linearly solvable networks and
representable matroids over finite fields in the framework of matroidal
networks. We prove a theorem about the scalar-linear solvability of networks
and field characteristics. We provide a method for generating scalar-linearly
solvable networks that are potentially different from the networks that we
already know are scalar-linearly solvable.
In our capacity region approach, we define a multi-dimensional object, called
the network capacity region, associated with networks that is analogous to the
rate regions in information theory. For the network routing capacity region, we
show that the region is a computable rational polytope and provide exact
algorithms and approximation heuristics for computing the region. For the
network linear coding capacity region, we construct a computable rational
polytope, with respect to a given finite field, that inner bounds the linear
coding capacity region and provide exact algorithms and approximation
heuristics for computing the polytope. The exact algorithms and approximation
heuristics we present are not polynomial time schemes and may depend on the
output size.
|
[
{
"version": "v1",
"created": "Wed, 2 Mar 2011 07:33:17 GMT"
}
] | 2011-03-03T00:00:00 |
[
[
"Kim",
"Anthony",
""
]
] |
new_dataset
| 0.968303 |
1012.2248
|
Marek Jawurek
|
Marek Jawurek, Martin Johns, Florian Kerschbaum
|
Plug-in privacy for Smart Metering billing
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditional electricity meters are replaced by Smart Meters in customers'
households. Smart Meters collects fine-grained utility consumption profiles
from customers, which in turn enables the introduction of dynamic, time-of-use
tariffs. However, the fine-grained usage data that is compiled in this process
also allows to infer the inhabitant's personal schedules and habits. We propose
a privacy-preserving protocol that enables billing with time-of-use tariffs
without disclosing the actual consumption profile to the supplier. Our approach
relies on a zero-knowledge proof based on Pedersen Commitments performed by a
plug-in privacy component that is put into the communication link between Smart
Meter and supplier's back-end system. We require no changes to the Smart Meter
hardware and only small changes to the software of Smart Meter and back-end
system. In this paper we describe the functional and privacy requirements, the
specification and security proof of our solution and give a performance
evaluation of a prototypical implementation.
|
[
{
"version": "v1",
"created": "Fri, 10 Dec 2010 12:29:20 GMT"
},
{
"version": "v2",
"created": "Tue, 1 Mar 2011 11:42:22 GMT"
}
] | 2011-03-02T00:00:00 |
[
[
"Jawurek",
"Marek",
""
],
[
"Johns",
"Martin",
""
],
[
"Kerschbaum",
"Florian",
""
]
] |
new_dataset
| 0.973248 |
1103.0116
|
Remous-Aris Koutsiamanis
|
Remous-Aris Koutsiamanis, Pavlos S. Efraimidis
|
An exact and O(1) time heaviest and lightest hitters algorithm for
sliding-window data streams
| null | null | null | null |
cs.DS cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we focus on the problem of finding the heaviest-k and lightest-k
hitters in a sliding window data stream. The most recent research endeavours
have yielded an epsilon-approximate algorithm with update operations in
constant time with high probability and O(1/epsilon) query time for the
heaviest hitters case. We propose a novel algorithm which for the first time,
to our knowledge, provides exact, not approximate, results while at the same
time achieves O(1) time with high probability complexity on both update and
query operations. Furthermore, our algorithm is able to provide both the
heaviest-k and the lightest-k hitters at the same time without any overhead. In
this work, we describe the algorithm and the accompanying data structure that
supports it and perform quantitative experiments with synthetic data to verify
our theoretical predictions.
|
[
{
"version": "v1",
"created": "Tue, 1 Mar 2011 09:42:01 GMT"
}
] | 2011-03-02T00:00:00 |
[
[
"Koutsiamanis",
"Remous-Aris",
""
],
[
"Efraimidis",
"Pavlos S.",
""
]
] |
new_dataset
| 0.980946 |
0802.1361
|
Menelaos Karavelas
|
Menelaos I. Karavelas
|
Guarding curvilinear art galleries with edge or mobile guards via
2-dominance of triangulation graphs
|
45 pages, 33 figures, short version has appeared in [M. I. Karavelas.
Guarding curvilinear art galleries with edge or mobile guards. 2008 ACM
Symposium on Solid and Physical Modeling (SPM08), 339-345, 2008.]; v2: new
lower bound for the edge 2-dominance problem which now matches the upper
bound
|
Comput. Geom. Theory Appl. 44(1):20-51, 2011
|
10.1016/j.comgeo.2010.07.002
| null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider the problem of monitoring an art gallery modeled as a polygon,
the edges of which are arcs of curves, with edge or mobile guards. Our focus is
on piecewise-convex polygons, i.e., polygons that are locally convex, except
possibly at the vertices, and their edges are convex arcs. We transform the
problem of monitoring a piecewise-convex polygon to the problem of 2-dominating
a properly defined triangulation graph with edges or diagonals, where
2-dominance requires that every triangle in the triangulation graph has at
least two of its vertices in its 2-dominating set. We show that
$\lfloor\frac{n+1}{3}\rfloor$ diagonal guards or $\lfloor\frac{2n+1}{5}\rfloor$
edge guards are always sufficient and sometimes necessary, in order to
2-dominate a triangulation graph. Furthermore, we show how to compute: a
diagonal 2-dominating set of size $\lfloor\frac{n+1}{3}\rfloor$ in linear time,
an edge 2-dominating set of size $\lfloor\frac{2n+1}{5}\rfloor$ in $O(n^2)$
time, and an edge 2-dominating set of size $\lfloor\frac{3n}{7}\rfloor$ in O(n)
time. Based on the above-mentioned results, we prove that, for piecewise-convex
polygons, we can compute: a mobile guard set of size
$\lfloor\frac{n+1}{3}\rfloor$ in $O(n\log{}n)$ time, an edge guard set of size
$\lfloor\frac{2n+1}{5}\rfloor$ in $O(n^2)$ time, and an edge guard set of size
$\lfloor\frac{3n}{7}\rfloor$ in $O(n\log{}n)$ time. Finally, we show that
$\lfloor\frac{n}{3}\rfloor$ mobile or $\lceil\frac{n}{3}\rceil$ edge guards are
sometimes necessary. When restricting our attention to monotone
piecewise-convex polygons, the bounds mentioned above drop:
$\lceil\frac{n+1}{4}\rceil$ edge or mobile guards are always sufficient and
sometimes necessary; such an edge or mobile guard set, of size at most
$\lceil\frac{n+1}{4}\rceil$, can be computed in O(n) time.
|
[
{
"version": "v1",
"created": "Mon, 11 Feb 2008 00:40:37 GMT"
},
{
"version": "v2",
"created": "Tue, 20 Apr 2010 19:52:11 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Karavelas",
"Menelaos I.",
""
]
] |
new_dataset
| 0.995324 |
0909.2526
|
Olli Pottonen
|
Patric R. J. \"Osterg{\aa}rd and Olli Pottonen
|
Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly
Shortened Perfect Codes
|
v2: a correction concerning shortened codes of length 12
| null |
10.1007/s10623-010-9450-4
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The doubly shortened perfect codes of length 13 are classified utilizing the
classification of perfect codes in [P.R.J. \"Osterg{\aa}rd and O. Pottonen, The
perfect binary one-error-correcting codes of length 15: Part I -
Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such
(13,512,3) codes. By applying a switching operation to those codes, two more
(13,512,3) codes are obtained, which are then not doubly shortened perfect
codes.
|
[
{
"version": "v1",
"created": "Mon, 14 Sep 2009 12:04:50 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Feb 2011 13:57:11 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Östergård",
"Patric R. J.",
""
],
[
"Pottonen",
"Olli",
""
]
] |
new_dataset
| 0.98282 |
1102.2216
|
Tolga Duman
|
Tolga M Duman
|
On the Capacity of Memoryless Channels with Synchronization Errors
|
The paper is withdrawn from Arxiv due to a gap in the proof of Lemma
2. If a fix can be found, the paper will be resubmitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Memoryless channels with synchronization errors as defined by a stochastic
channel matrix allowing for symbol insertions and deletions in addition to
random errors are considered. Such channels are information stable, hence their
Shannon capacity exists. However, computation of the channel capacity is
formidable, and only some upper and lower bounds on the capacity (for some
special cases) exist. In this short paper, using a simple methodology, we prove
that the channel capacity is a convex function of the stochastic channel
matrix. Since the more widely studied model of an independent identically
distributed (i.i.d.) deletion channel is a particular case, as an immediate
corollary to this result we also argue that the i.i.d. deletion channel
capacity is a convex function of the deletion probability. We further use this
result to improve the existing capacity upper bounds on the deletion channel by
a proper "convexification" argument. In particular, we prove that the capacity
of the deletion channel, as the deletion probability d --> 1, is upper bounded
by $0.4143(1-d)$ (which was also observed by a different (weaker) recent
result).
|
[
{
"version": "v1",
"created": "Thu, 10 Feb 2011 20:14:05 GMT"
},
{
"version": "v2",
"created": "Mon, 28 Feb 2011 04:02:47 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Duman",
"Tolga M",
""
]
] |
new_dataset
| 0.961953 |
1102.5357
|
Aanatoly Khina
|
A. Khina, Y. Kochman, U. Erez
|
Physical-Layer MIMO Relaying
|
5 pages, 3 figures, submitted to ISIT 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The physical-layer network coding (PNC) approach provides improved
performance in many scenarios over "traditional" relaying techniques or network
coding. This work addresses the generalization of PNC to wireless scenarios
where network nodes have multiple antennas. We use a recent matrix
decomposition, which allows, by linear pre- and post-processing, to
simultaneously transform both channel matrices to triangular forms, where the
diagonal entries, corresponding to both channels, are equal. This
decomposition, in conjunction with precoding, allows to convert any two-input
multiple-access channel (MAC) into parallel MACs, over which single-antenna PNC
may be used. The technique is demonstrated using the two-way relay channel with
multiple antennas. For this case it is shown that, in the high signal-to-noise
regime, the scheme approaches the cut-set bound, thus establishing the
asymptotic network capacity.
|
[
{
"version": "v1",
"created": "Fri, 25 Feb 2011 21:48:18 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Khina",
"A.",
""
],
[
"Kochman",
"Y.",
""
],
[
"Erez",
"U.",
""
]
] |
new_dataset
| 0.998749 |
1102.5450
|
Viswanath Nagarajan
|
Inge Li Goertz and Viswanath Nagarajan and R. Ravi
|
Minimum Makespan Multi-vehicle Dial-a-Ride
|
22 pages, 1 figure. Preliminary version appeared in ESA 2009
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dial a ride problems consist of a metric space (denoting travel time between
vertices) and a set of m objects represented as source-destination pairs, where
each object requires to be moved from its source to destination vertex. We
consider the multi-vehicle Dial a ride problem, with each vehicle having
capacity k and its own depot-vertex, where the objective is to minimize the
maximum completion time (makespan) of the vehicles. We study the "preemptive"
version of the problem, where an object may be left at intermediate vertices
and transported by more than one vehicle, while being moved from source to
destination. Our main results are an O(log^3 n)-approximation algorithm for
preemptive multi-vehicle Dial a ride, and an improved O(log t)-approximation
for its special case when there is no capacity constraint. We also show that
the approximation ratios improve by a log-factor when the underlying metric is
induced by a fixed-minor-free graph.
|
[
{
"version": "v1",
"created": "Sat, 26 Feb 2011 21:37:08 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Goertz",
"Inge Li",
""
],
[
"Nagarajan",
"Viswanath",
""
],
[
"Ravi",
"R.",
""
]
] |
new_dataset
| 0.998819 |
1102.5478
|
Arindam Pal
|
Arindam Pal
|
Minimum multicuts and Steiner forests for Okamura-Seymour graphs
|
6 pages, 1 figure
| null | null | null |
cs.DS cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the problem of finding minimum multicuts for an undirected planar
graph, where all the terminal vertices are on the boundary of the outer face.
This is known as an Okamura-Seymour instance. We show that for such an
instance, the minimum multicut problem can be reduced to the minimum-cost
Steiner forest problem on a suitably defined dual graph. The minimum-cost
Steiner forest problem has a 2-approximation algorithm. Hence, the minimum
multicut problem has a 2-approximation algorithm for an Okamura-Seymour
instance.
|
[
{
"version": "v1",
"created": "Sun, 27 Feb 2011 06:55:32 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Pal",
"Arindam",
""
]
] |
new_dataset
| 0.981706 |
1102.5584
|
EPTCS
|
Bernardo Toninho (Faculdade de Ci\^encias e Tecnologia, Universidade
Nova de Lisboa and Computer Science Department, Carnegie Mellon University),
Lu\'is Caires (Departamento de Informatica / Universidade Nova de Lisboa)
|
A Spatial-Epistemic Logic for Reasoning about Security Protocols
|
In Proceedings SecCo 2010, arXiv:1102.5161
|
EPTCS 51, 2011, pp. 1-15
|
10.4204/EPTCS.51.1
| null |
cs.LO cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Reasoning about security properties involves reasoning about where the
information of a system is located, and how it evolves over time. While most
security analysis techniques need to cope with some notions of information
locality and knowledge propagation, usually they do not provide a general
language for expressing arbitrary properties involving local knowledge and
knowledge transfer. Building on this observation, we introduce a framework for
security protocol analysis based on dynamic spatial logic specifications. Our
computational model is a variant of existing pi-calculi, while specifications
are expressed in a dynamic spatial logic extended with an epistemic operator.
We present the syntax and semantics of the model and logic, and discuss the
expressiveness of the approach, showing it complete for passive attackers. We
also prove that generic Dolev-Yao attackers may be mechanically determined for
any deterministic finite protocol, and discuss how this result may be used to
reason about security properties of open systems. We also present a
model-checking algorithm for our logic, which has been implemented as an
extension to the SLMC system.
|
[
{
"version": "v1",
"created": "Mon, 28 Feb 2011 03:38:21 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Toninho",
"Bernardo",
"",
"Faculdade de Ciências e Tecnologia, Universidade\n Nova de Lisboa and Computer Science Department, Carnegie Mellon University"
],
[
"Caires",
"Luís",
"",
"Departamento de Informatica / Universidade Nova de Lisboa"
]
] |
new_dataset
| 0.993039 |
1102.5670
|
Emanuele Lindo Secco
|
Matteo Lanati, Davide Curone, Emanuele Lindo Secco, Giovanni Magenes
and Paolo Gamba
|
An Autonomous Long Range Monitoring System For Emergency Operators
|
13 pages, 7 figures, 1 table
|
International Journal of Wireless & Mobile Networks, vol. 3, no.
1, pp. 10-23, 2011
| null | null |
cs.OH
|
http://creativecommons.org/licenses/by/3.0/
|
Miniaturization and portability of new electronics lead up to wearable
devices embedded within garments: a European program called ProeTEX developed
multi-purpose sensors integrated within emergency operators' garments in order
to monitor their health state and the surrounding environment. This work deals
with the development of an autonomous Long Range communication System (LRS),
suitable to transmit data between operators' equipment and the local command
post, where remote monitoring software is set up. The LRS infrastructure is
based on Wi-Fi protocol and modular architecture. Field tests carried out on
the developed prototype showed a high reliability in terms of correctly
exchanged data and recovering capabilities in case of temporary disconnection,
due to the operator's movements.
|
[
{
"version": "v1",
"created": "Mon, 28 Feb 2011 14:19:28 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Lanati",
"Matteo",
""
],
[
"Curone",
"Davide",
""
],
[
"Secco",
"Emanuele Lindo",
""
],
[
"Magenes",
"Giovanni",
""
],
[
"Gamba",
"Paolo",
""
]
] |
new_dataset
| 0.995584 |
1102.5688
|
Liyakath Unisa
|
Liyakathunisa and C.N .Ravi Kumar
|
A novel super resolution reconstruction of low reoslution images
progressively using dct and zonal filter based denoising
|
20 pages, 11 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the factors like processing power limitations and channel capabilities
images are often down sampled and transmitted at low bit rates resulting in a
low resolution compressed image. High resolution images can be reconstructed
from several blurred, noisy and down sampled low resolution images using a
computational process know as super resolution reconstruction. Super-resolution
is the process of combining multiple aliased low-quality images to produce a
high resolution, high-quality image. The problem of recovering a high
resolution image progressively from a sequence of low resolution compressed
images is considered. In this paper we propose a novel DCT based progressive
image display algorithm by stressing on the encoding and decoding process. At
the encoder we consider a set of low resolution images which are corrupted by
additive white Gaussian noise and motion blur. The low resolution images are
compressed using 8 by 8 blocks DCT and noise is filtered using our proposed
novel zonal filter. Multiframe fusion is performed in order to obtain a single
noise free image. At the decoder the image is reconstructed progressively by
transmitting the coarser image first followed by the detail image. And finally
a super resolution image is reconstructed by applying our proposed novel
adaptive interpolation technique. We have performed both objective and
subjective analysis of the reconstructed image, and the resultant image has
better super resolution factor, and a higher ISNR and PSNR. A comparative study
done with Iterative Back Projection (IBP) and Projection on to Convex Sets
(POCS),Papoulis Grechberg, FFT based Super resolution Reconstruction shows that
our method has out performed the previous contributions.
|
[
{
"version": "v1",
"created": "Mon, 28 Feb 2011 15:24:06 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Liyakathunisa",
"",
""
],
[
"Kumar",
"C. N . Ravi",
""
]
] |
new_dataset
| 0.998306 |
1102.5711
|
St\'ephane Mottelet
|
St\'ephane Mottelet and Andr\'e Pauss
|
XMLlab : multimedia publication of simulations applets using XML and
Scilab
| null | null | null | null |
cs.MS
|
http://creativecommons.org/licenses/by/3.0/
|
We present an XML-based simulation authoring environment. The proposed
description language allows to describe mathematical objects such as systems of
ordinary differential equations, partial differential equations in two
dimensions, or simple curves and surfaces. It also allows to describe the
parameters on which these objects depend. This language is independent of the
target software and allows to ensure the perennity of author's work, as well as
collaborative work and content reuse. The actual implementation of XMLlab
allows to run the generated simulations within the open source mathematical
software Scilab, either locally when Scilab is installed on the client
machines, or on thin clients running a simple web browser, when XMLlab and
Scilab are installed on a distant server running a standard HTTP server.
|
[
{
"version": "v1",
"created": "Mon, 28 Feb 2011 17:16:06 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Mottelet",
"Stéphane",
""
],
[
"Pauss",
"André",
""
]
] |
new_dataset
| 0.987714 |
1102.5728
|
Wahiba Ben abdessalem Karaa
|
Wahiba Ben Abdessalem Karaa
|
Named Entity Recognition Using Web Document Corpus
|
11 pages 4 figures, 2 tables
|
International Journal of Managing Information Technology (IJMIT)
Vol.3, No.1, February 2011
|
10.5121/ijmit.2011.3104
| null |
cs.IR cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a named entity recognition approach in textual corpus.
This Named Entity (NE) can be a named: location, person, organization, date,
time, etc., characterized by instances. A NE is found in texts accompanied by
contexts: words that are left or right of the NE. The work mainly aims at
identifying contexts inducing the NE's nature. As such, The occurrence of the
word "President" in a text, means that this word or context may be followed by
the name of a president as President "Obama". Likewise, a word preceded by the
string "footballer" induces that this is the name of a footballer. NE
recognition may be viewed as a classification method, where every word is
assigned to a NE class, regarding the context. The aim of this study is then to
identify and classify the contexts that are most relevant to recognize a NE,
those which are frequently found with the NE. A learning approach using
training corpus: web documents, constructed from learning examples is then
suggested. Frequency representations and modified tf-idf representations are
used to calculate the context weights associated to context frequency, learning
example frequency, and document frequency in the corpus.
|
[
{
"version": "v1",
"created": "Mon, 28 Feb 2011 18:33:09 GMT"
}
] | 2011-03-01T00:00:00 |
[
[
"Karaa",
"Wahiba Ben Abdessalem",
""
]
] |
new_dataset
| 0.992776 |
1102.5197
|
Moez Hizem
|
Moez Hizem and Ridha Bouallegue
|
Fine Synchronization through UWB TH-PPM Impulse Radios
|
11 pages, 7 figures
|
International Journal of Wireless & Mobile Networks (IJWMN) Vol.
3, No. 1, February 2011
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a novel fine timing algorithm has been tested and developed to
synchronize Ultra-Wideband (UWB) signals with pulse position modulation (PPM).
By applying this algorithm, we evaluate timing algorithms in both data-aided
(DA) and non-data-aided (NDA) modes. Based on correlation operations, our
algorithm remains operational in practical UWB settings. The proposed timing
scheme consists of two complementary floors or steps. The first floor consists
on a coarse synchronization which is founded on the recently proposed
acquisition scheme based on dirty templates (TDT). In the second floor, we
investigate a new fine synchronization algorithm which gives an improved
estimate of timing offset. Simulations confirm performance improvement of our
timing synchronization compared to the original TDT algorithm in terms of mean
square error.
|
[
{
"version": "v1",
"created": "Fri, 25 Feb 2011 09:31:28 GMT"
}
] | 2011-02-28T00:00:00 |
[
[
"Hizem",
"Moez",
""
],
[
"Bouallegue",
"Ridha",
""
]
] |
new_dataset
| 0.992856 |
1102.5204
|
Zhongwei Si
|
Zhongwei Si, Ragnar Thobaben, Mikael Skoglund
|
Bilayer LDPC Convolutional Codes for Half-Duplex Relay Channels
|
5 pages, 5 figures, submitted to ISIT 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present regular bilayer LDPC convolutional codes for
half-duplex relay channels. For the binary erasure relay channel, we prove that
the proposed code construction achieves the capacities for the source-relay
link and the source-destination link provided that the channel conditions are
known when designing the code. Meanwhile, this code enables the highest
transmission rate with decode-and-forward relaying. In addition, its regular
degree distributions can easily be computed from the channel parameters, which
significantly simplifies the code optimization. Numerical results are provided
for both binary erasure channels (BEC) and AWGN channels. In BECs, we can
observe that the gaps between the decoding thresholds and the Shannon limits
are impressively small. In AWGN channels, the bilayer LDPC convolutional code
clearly outperforms its block code counterpart in terms of bit error rate.
|
[
{
"version": "v1",
"created": "Fri, 25 Feb 2011 10:29:20 GMT"
}
] | 2011-02-28T00:00:00 |
[
[
"Si",
"Zhongwei",
""
],
[
"Thobaben",
"Ragnar",
""
],
[
"Skoglund",
"Mikael",
""
]
] |
new_dataset
| 0.999631 |
0912.3730
|
Jean-Camille Birget
|
Jean-Camille Birget
|
On the circuit-size of inverses
|
8 pages
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We reprove a result of Boppana and Lagarias: If Pi_2^P is different from
Sigma_2^P then there exists a partial function f that is computable by a
polynomial-size family of circuits, but no inverse of f is computable by a
polynomial-size family of circuits. We strengthen this result by showing that
there exist length-preserving total functions that are one-way by circuit size
and that are computable in uniform polynomial time. We also prove, if Pi_2^P is
different from Sigma_2^P, that there exist polynomially balanced total
surjective functions that are one-way by circuit size; here non-uniformity is
used.
|
[
{
"version": "v1",
"created": "Fri, 18 Dec 2009 16:34:15 GMT"
},
{
"version": "v2",
"created": "Thu, 24 Feb 2011 19:13:53 GMT"
}
] | 2011-02-25T00:00:00 |
[
[
"Birget",
"Jean-Camille",
""
]
] |
new_dataset
| 0.993925 |
1004.5230
|
Florent Foucaud
|
Florent Foucaud (LaBRI), Eleonora Guerrini (IF), Matjaz Kovse (LaBRI),
Reza Naserasr (LaBRI), Aline Parreau (IF), Petru Valicov (LaBRI)
|
Extremal graphs for the identifying code problem
| null |
European Journal of Combinatorics 32, 4 (2011) 628-638
|
10.1016/j.ejc.2011.01.002
| null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An identifying code of a graph G is a dominating set C such that every vertex
x of G is distinguished from all other vertices by the set of vertices in C
that are at distance at most 1 from x. The problem of finding an identifying
code of minimum possible size turned out to be a challenging problem. It was
proved by N. Bertrand that if a graph on n vertices with at least one edge
admits an identifying code, then a minimum identifying code has size at most
n-1. Some classes of graphs whose smallest identifying code is of size n-1 were
already known, and few conjectures were formulated to classify all these
graphs. In this paper, disproving these conjectures, we classify all finite
graphs for which all but one of the vertices are needed to form an identifying
code. We also classify all infinite graphs needing the whole set of vertices in
any identifying code. New upper bounds in terms of the number of vertices and
the maximum degree of a graph are also provided.
|
[
{
"version": "v1",
"created": "Thu, 29 Apr 2010 09:32:28 GMT"
},
{
"version": "v2",
"created": "Thu, 28 Oct 2010 14:08:37 GMT"
},
{
"version": "v3",
"created": "Tue, 25 Jan 2011 15:25:51 GMT"
},
{
"version": "v4",
"created": "Thu, 24 Feb 2011 09:05:36 GMT"
}
] | 2011-02-25T00:00:00 |
[
[
"Foucaud",
"Florent",
"",
"LaBRI"
],
[
"Guerrini",
"Eleonora",
"",
"IF"
],
[
"Kovse",
"Matjaz",
"",
"LaBRI"
],
[
"Naserasr",
"Reza",
"",
"LaBRI"
],
[
"Parreau",
"Aline",
"",
"IF"
],
[
"Valicov",
"Petru",
"",
"LaBRI"
]
] |
new_dataset
| 0.998877 |
1102.4951
|
Srimanta Bhattacharya
|
Srimanta Bhattacharya, Sushmita Ruj, and Bimal Roy
|
Combinatorial Batch Codes: A Lower Bound and Optimal Constructions
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [1],
are methods for solving the following data storage problem: n data items are to
be stored in m servers in such a way that any k of the n items can be retrieved
by reading at most t items from each server, and that the total number of items
stored in m servers is N . A Combinatorial batch code (CBC) is a batch code
where each data item is stored without change, i.e., each stored data item is a
copy of one of the n data items. One of the basic yet challenging problems is
to find optimal CBCs, i.e., CBCs for which total storage (N) is minimal for
given values of n, m, k, and t. In [2], Paterson, Stinson and Wei exclusively
studied CBCs and gave constructions of some optimal CBCs. In this article, we
give a lower bound on the total storage (N) for CBCs. We give explicit
construction of optimal CBCs for a range of values of n. For a different range
of values of n, we give explicit construction of optimal and almost optimal
CBCs. Our results partly settle an open problem of [2].
|
[
{
"version": "v1",
"created": "Thu, 24 Feb 2011 10:39:46 GMT"
}
] | 2011-02-25T00:00:00 |
[
[
"Bhattacharya",
"Srimanta",
""
],
[
"Ruj",
"Sushmita",
""
],
[
"Roy",
"Bimal",
""
]
] |
new_dataset
| 0.991454 |
1102.4972
|
Quentin Merigot
|
Leonidas J. Guibas, Quentin M\'erigot (LJK), Dmitriy Morozov (LBNL)
|
Witnessed k-Distance
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distance function to a compact set plays a central role in several areas of
computational geometry. Methods that rely on it are robust to the perturbations
of the data by the Hausdorff noise, but fail in the presence of outliers. The
recently introduced distance to a measure offers a solution by extending the
distance function framework to reasoning about the geometry of probability
measures, while maintaining theoretical guarantees about the quality of the
inferred information. A combinatorial explosion hinders working with distance
to a measure as an ordinary (power) distance function. In this paper, we
analyze an approximation scheme that keeps the representation linear in the
size of the input, while maintaining the guarantees on the inference quality
close to those for the exact (but costly) representation.
|
[
{
"version": "v1",
"created": "Thu, 24 Feb 2011 12:29:50 GMT"
}
] | 2011-02-25T00:00:00 |
[
[
"Guibas",
"Leonidas J.",
"",
"LJK"
],
[
"Mérigot",
"Quentin",
"",
"LJK"
],
[
"Morozov",
"Dmitriy",
"",
"LBNL"
]
] |
new_dataset
| 0.966878 |
1102.5043
|
Ash Mohammad Abbas
|
Ash Mohammad Abbas
|
uRbAn: A Multipath Routing based Architecture with Energy and Mobility
Management for Quality of Service Support in Mobile Ad hoc Networks
|
6 pages, 6 figures, 1 table
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Designing a wireless node that supports quality of service (QoS) in a mobile
ad hoc network is a challenging task. In this paper, we propose an architecture
of a wireless node that may be used to form a mobile ad hoc network that
supports QoS. We discuss the core functionalities required for such a node and
how those functionalities can be incorporated. A feature of our architecture is
that the node has the ability to utilize multiple paths, if available, for the
provision of QoS. However, in the absence of multiple paths it can utilize the
resources provided by a single path between the source and the destination. We
follow a modular approach where each module is expanded iteratively. We compare
the features of our architecture with the existing architectures proposed in
the literature. Our architecture has provisions of energy and mobility
management and it can be customized to design a system-on-chip (SoC).
|
[
{
"version": "v1",
"created": "Thu, 24 Feb 2011 17:25:50 GMT"
}
] | 2011-02-25T00:00:00 |
[
[
"Abbas",
"Ash Mohammad",
""
]
] |
new_dataset
| 0.98267 |
1102.4684
|
Vincent Mahe
|
Vincent Mahe (INRIA - EMN), Salvador Martinez Perez (INRIA - EMN),
Guillaume Doux (INRIA - EMN), Hugo Bruneli\`ere (INRIA - EMN), Jordi Cabot
(INRIA - EMN)
|
P ORTOLAN: a Model-Driven Cartography Framework
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Processing large amounts of data to extract useful information is an
essential task within companies. To help in this task, visualization techniques
have been commonly used due to their capacity to present data in synthesized
views, easier to understand and manage. However, achieving the right
visualization display for a data set is a complex cartography process that
involves several transformation steps to adapt the (domain) data to the
(visualization) data format expected by visualization tools. To maximize the
benefits of visualization we propose Portolan, a generic model-driven
cartography framework that facilitates the discovery of the data to visualize,
the specification of view definitions for that data and the transformations to
bridge the gap with the visualization tools. Our approach has been implemented
on top of the Eclipse EMF modeling framework and validated on three different
use cases.
|
[
{
"version": "v1",
"created": "Wed, 23 Feb 2011 08:21:43 GMT"
}
] | 2011-02-24T00:00:00 |
[
[
"Mahe",
"Vincent",
"",
"INRIA - EMN"
],
[
"Perez",
"Salvador Martinez",
"",
"INRIA - EMN"
],
[
"Doux",
"Guillaume",
"",
"INRIA - EMN"
],
[
"Brunelière",
"Hugo",
"",
"INRIA - EMN"
],
[
"Cabot",
"Jordi",
"",
"INRIA - EMN"
]
] |
new_dataset
| 0.995051 |
1102.4727
|
Vadim E. Levit
|
Vadim E. Levit and Eugen Mandrescu
|
On the Core of a Unicyclic Graph
|
8 pages, 5 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set S is independent in a graph G if no two vertices from S are adjacent.
By core(G) we mean the intersection of all maximum independent sets. The
independence number alpha(G) is the cardinality of a maximum independent set,
while mu(G) is the size of a maximum matching in G. A connected graph having
only one cycle, say C, is a unicyclic graph. In this paper we prove that if G
is a unicyclic graph of order n and n-1 = alpha(G) + mu(G), then core(G)
coincides with the union of cores of all trees in G-C.
|
[
{
"version": "v1",
"created": "Wed, 23 Feb 2011 12:55:44 GMT"
}
] | 2011-02-24T00:00:00 |
[
[
"Levit",
"Vadim E.",
""
],
[
"Mandrescu",
"Eugen",
""
]
] |
new_dataset
| 0.998692 |
0911.4522
|
Arya Mazumdar
|
Alexander Barg, Arya Mazumdar
|
On the Number of Errors Correctable with Codes on Graphs
|
Published in the Ralf Koetter Memorial Issue of IEEE Transactions on
Information Theory
|
IEEE Transactions on Information Theory, Vol. 57, No. 2, February
2011
|
10.1109/TIT.2010.2094812
| null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study ensembles of codes on graphs (generalized low-density parity-check,
or LDPC codes) constructed from random graphs and fixed local constrained
codes, and their extension to codes on hypergraphs. It is known that the
average minimum distance of codes in these ensembles grows linearly with the
code length. We show that these codes can correct a linearly growing number of
errors under simple iterative decoding algorithms. In particular, we show that
this property extends to codes constructed by parallel concatenation of Hamming
codes and other codes with small minimum distance. Previously known results
that proved this property for graph codes relied on graph expansion and
required the choice of local codes with large distance relative to their
length.
|
[
{
"version": "v1",
"created": "Mon, 23 Nov 2009 23:49:13 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Feb 2011 19:56:18 GMT"
}
] | 2011-02-22T00:00:00 |
[
[
"Barg",
"Alexander",
""
],
[
"Mazumdar",
"Arya",
""
]
] |
new_dataset
| 0.995505 |
1007.0522
|
Ahmed Badr
|
Ahmed Badr, Ashish Khisti, Emin Martinian
|
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and
Optimality
|
JSAC, May 2011, Special Issue on Trading Rate for Delay at the
Transport and Application Layers, Shorter version will appear in Globecom
2010
| null | null | null |
cs.IT cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Streaming erasure codes guarantee that each source packet is recovered within
a fixed delay at the receiver over a burst-erasure channel. This paper
introduces a new class of streaming codes: Diversity Embedded Streaming Erasure
Codes (DE-SCo), that provide a flexible tradeoff between the channel quality
and receiver delay. When the channel conditions are good, the source stream is
recovered with a low delay, whereas when the channel conditions are poor the
source stream is still recovered, albeit with a larger delay. Information
theoretic analysis of the underlying burst-erasure broadcast channel reveals
that DE-SCo achieve the minimum possible delay for the weaker user, without
sacrificing the single-user optimal performance of the stronger user. Our
constructions are explicit, incur polynomial time encoding and decoding
complexity and outperform random linear codes over burst-erasure channels.
|
[
{
"version": "v1",
"created": "Sun, 4 Jul 2010 02:14:49 GMT"
},
{
"version": "v2",
"created": "Mon, 21 Feb 2011 15:26:09 GMT"
}
] | 2011-02-22T00:00:00 |
[
[
"Badr",
"Ahmed",
""
],
[
"Khisti",
"Ashish",
""
],
[
"Martinian",
"Emin",
""
]
] |
new_dataset
| 0.997778 |
1102.4119
|
EPTCS
|
Andreas Morgenstern (University Kaiserslautern), Klaus Schneider
(University Kaiserslautern)
|
A LTL Fragment for GR(1)-Synthesis
|
In Proceedings iWIGP 2011, arXiv:1102.3741
|
EPTCS 50, 2011, pp. 33-45
|
10.4204/EPTCS.50.3
| null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The idea of automatic synthesis of reactive programs starting from temporal
logic (LTL) specifications is quite old, but was commonly thought to be
infeasible due to the known double exponential complexity of the problem.
However, new ideas have recently renewed the interest in LTL synthesis: One
major new contribution in this area is the recent work of Piterman et al. who
showed how polynomial time synthesis can be achieved for a large class of LTL
specifications that is expressive enough to cover many practical examples.
These LTL specifications are equivalent to omega-automata having a so-called
GR(1) acceptance condition. This approach has been used to automatically
synthesize implementations of real-world applications. To this end, manually
written deterministic omega-automata having GR(1) conditions were used instead
of the original LTL specifications. However, manually generating deterministic
monitors is, of course, a hard and error-prone task. In this paper, we
therefore present algorithms to automatically translate specifications of a
remarkable large fragment of LTL to deterministic monitors having a GR(1)
acceptance condition so that the synthesis algorithms can start with more
readable LTL specifications.
|
[
{
"version": "v1",
"created": "Mon, 21 Feb 2011 02:30:38 GMT"
}
] | 2011-02-22T00:00:00 |
[
[
"Morgenstern",
"Andreas",
"",
"University Kaiserslautern"
],
[
"Schneider",
"Klaus",
"",
"University Kaiserslautern"
]
] |
new_dataset
| 0.998493 |
1102.4135
|
Wenbo He
|
Wenbo He, Xue Liu, Mai Ren
|
Location Cheating: A Security Challenge to Location-based Social Network
Services
|
10 pages, 8 figures, accepted by the 31st International Conference on
Distributed Computing Systems (ICDCS 2011)
| null | null | null |
cs.SI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Location-based mobile social network services such as foursquare and Gowalla
have grown exponentially over the past several years. These location-based
services utilize the geographical position to enrich user experiences in a
variety of contexts, including location-based searching and location-based
mobile advertising. To attract more users, the location-based mobile social
network services provide real-world rewards to the user, when a user checks in
at a certain venue or location. This gives incentives for users to cheat on
their locations. In this report, we investigate the threat of location cheating
attacks, find the root cause of the vulnerability, and outline the possible
defending mechanisms. We use foursquare as an example to introduce a novel
location cheating attack, which can easily pass the current location
verification mechanism (e.g., cheater code of foursquare). We also crawl the
foursquare website. By analyzing the crawled data, we show that automated large
scale cheating is possible. Through this work, we aim to call attention to
location cheating in mobile social network services and provide insights into
the defending mechanisms.
|
[
{
"version": "v1",
"created": "Mon, 21 Feb 2011 05:17:11 GMT"
}
] | 2011-02-22T00:00:00 |
[
[
"He",
"Wenbo",
""
],
[
"Liu",
"Xue",
""
],
[
"Ren",
"Mai",
""
]
] |
new_dataset
| 0.998282 |
1102.4258
|
Michael Bronstein
|
E. Boyer, A. M. Bronstein, M. M. Bronstein, B. Bustos, T. Darom, R.
Horaud, I. Hotz, Y. Keller, J. Keustermans, A. Kovnatsky, R. Litman, J.
Reininghaus, I. Sipiran, D. Smeets, P. Suetens, D. Vandermeulen, A.
Zaharescu, V. Zobel
|
SHREC 2011: robust feature detection and description benchmark
|
This is a full version of the SHREC'11 report published in 3DOR
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Feature-based approaches have recently become very popular in computer vision
and image analysis applications, and are becoming a promising direction in
shape retrieval. SHREC'11 robust feature detection and description benchmark
simulates the feature detection and description stages of feature-based shape
retrieval algorithms. The benchmark tests the performance of shape feature
detectors and descriptors under a wide variety of transformations. The
benchmark allows evaluating how algorithms cope with certain classes of
transformations and strength of the transformations that can be dealt with. The
present paper is a report of the SHREC'11 robust feature detection and
description benchmark results.
|
[
{
"version": "v1",
"created": "Mon, 21 Feb 2011 15:43:19 GMT"
}
] | 2011-02-22T00:00:00 |
[
[
"Boyer",
"E.",
""
],
[
"Bronstein",
"A. M.",
""
],
[
"Bronstein",
"M. M.",
""
],
[
"Bustos",
"B.",
""
],
[
"Darom",
"T.",
""
],
[
"Horaud",
"R.",
""
],
[
"Hotz",
"I.",
""
],
[
"Keller",
"Y.",
""
],
[
"Keustermans",
"J.",
""
],
[
"Kovnatsky",
"A.",
""
],
[
"Litman",
"R.",
""
],
[
"Reininghaus",
"J.",
""
],
[
"Sipiran",
"I.",
""
],
[
"Smeets",
"D.",
""
],
[
"Suetens",
"P.",
""
],
[
"Vandermeulen",
"D.",
""
],
[
"Zaharescu",
"A.",
""
],
[
"Zobel",
"V.",
""
]
] |
new_dataset
| 0.999563 |
1102.3763
|
Hsuan-Jung Su
|
Hsuan-Yi Chu and Hsuan-Jung Su
|
On the Capacity Region of the Cognitive Interference Channel with
Unidirectional Destination Cooperation
|
submitted to ISIT 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cognitive interference channel with unidirectional destination
cooperation (CIFC-UDC) is a variant of the cognitive interference channel
(CIFC) where the cognitive (secondary) destination not only decodes the
information sent from its sending dual but also helps enhance the communication
of the primary user. This channel is an extension of the original CIFC to
achieve a win-win solution under the coexistence condition. The CIFC-UDC
comprises a broadcast channel (BC), a relay channel (RC), as well as a
partially cooperative relay broadcast channel (PCRBC), and can be degraded to
any one of them. In this paper, we propose a new achievable rate region for the
dis-crete memoryless CIFC-UDC which improves the previous re-sults and includes
the largest known rate regions of the BC, the RC, the PCRBC and the CIFC. A new
outer bound is presented and proved to be tight for two classes of the
CIFC-UDCs, result-ing in the characterization of the capacity region.
|
[
{
"version": "v1",
"created": "Fri, 18 Feb 2011 06:45:15 GMT"
}
] | 2011-02-21T00:00:00 |
[
[
"Chu",
"Hsuan-Yi",
""
],
[
"Su",
"Hsuan-Jung",
""
]
] |
new_dataset
| 0.993594 |
1102.3896
|
V\'itor Santos Costa
|
V\'itor Santos Costa, Lu\'is Damas, Ricardo Rocha
|
The YAP Prolog System
|
30 pages, 2 figures. To appear in Theory and Practice of Logic
Programming (TPLP)
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Yet Another Prolog (YAP) is a Prolog system originally developed in the
mid-eighties and that has been under almost constant development since then.
This paper presents the general structure and design of the YAP system,
focusing on three important contributions to the Logic Programming community.
First, it describes the main techniques used in YAP to achieve an efficient
Prolog engine. Second, most Logic Programming systems have a rather limited
indexing algorithm. YAP contributes to this area by providing a dynamic
indexing mechanism, or just-in-time indexer (JITI). Third, a important
contribution of the YAP system has been the integration of both or-parallelism
and tabling in a single Logic Programming system.
|
[
{
"version": "v1",
"created": "Fri, 18 Feb 2011 19:57:18 GMT"
}
] | 2011-02-21T00:00:00 |
[
[
"Costa",
"Vítor Santos",
""
],
[
"Damas",
"Luís",
""
],
[
"Rocha",
"Ricardo",
""
]
] |
new_dataset
| 0.994535 |
cs/0412051
|
Vedran Kordic
|
Oliver Adria, Hermann Streich, Joachim Hertzberg
|
Dynamic replanning in uncertain environments for a sewer inspection
robot
| null |
International Journal of Advanced Robotic Systems, Volume 1,
Number 1, March 2004, pp.33-38
| null | null |
cs.RO
| null |
The sewer inspection robot MAKRO is an autonomous multi-segment robot with
worm-like shape driven by wheels. It is currently under development in the
project MAKRO-PLUS. The robot has to navigate autonomously within sewer
systems. Its first tasks will be to take water probes, analyze it onboard, and
measure positions of manholes and pipes to detect polluted-loaded sewage and to
improve current maps of sewer systems. One of the challenging problems is the
controller software, which should enable the robot to navigate in the sewer
system and perform the inspection tasks autonomously, not inflicting any
self-damage. This paper focuses on the route planning and replanning aspect of
the robot. The robots software has four different levels, of which the planning
system is the highest level, and the remaining three are controller levels each
with a different degree of abstraction. The planner coordinates the sequence of
actions that are to be successively executed by the robot.
|
[
{
"version": "v1",
"created": "Sat, 11 Dec 2004 12:42:10 GMT"
}
] | 2011-02-19T00:00:00 |
[
[
"Adria",
"Oliver",
""
],
[
"Streich",
"Hermann",
""
],
[
"Hertzberg",
"Joachim",
""
]
] |
new_dataset
| 0.999348 |
cs/0701168
|
Jim Gray
|
Russell Sears, Catharine Van Ingen, Jim Gray
|
To BLOB or Not To BLOB: Large Object Storage in a Database or a
Filesystem?
| null |
CIDR 2007
| null |
MSR-TR-2006-45
|
cs.DB
| null |
Application designers often face the question of whether to store large
objects in a filesystem or in a database. Often this decision is made for
application design simplicity. Sometimes, performance measurements are also
used. This paper looks at the question of fragmentation - one of the
operational issues that can affect the performance and/or manageability of the
system as deployed long term. As expected from the common wisdom, objects
smaller than 256KB are best stored in a database while objects larger than 1M
are best stored in the filesystem. Between 256KB and 1MB, the read:write ratio
and rate of object overwrite or replacement are important factors. We used the
notion of "storage age" or number of object overwrites as way of normalizing
wall clock time. Storage age allows our results or similar such results to be
applied across a number of read:write ratios and object replacement rates.
|
[
{
"version": "v1",
"created": "Fri, 26 Jan 2007 00:54:04 GMT"
}
] | 2011-02-19T00:00:00 |
[
[
"Sears",
"Russell",
""
],
[
"Van Ingen",
"Catharine",
""
],
[
"Gray",
"Jim",
""
]
] |
new_dataset
| 0.999122 |
1102.3491
|
Jos\'e Soto
|
Jos\'e A. Soto
|
A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable
Matroids
|
8 pages, 3 figures. To appear in LAGOS 2011
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We give a simple polynomial time approximation scheme for the weighted
matroid matching problem on strongly base orderable matroids. We also show that
even the unweighted version of this problem is NP-complete and not in
oracle-coNP.
|
[
{
"version": "v1",
"created": "Thu, 17 Feb 2011 04:22:13 GMT"
}
] | 2011-02-18T00:00:00 |
[
[
"Soto",
"José A.",
""
]
] |
new_dataset
| 0.997813 |
1102.3605
|
Radoslav Kirov M
|
Martianu Frederic Ezerman and Radoslav Kirov
|
Nonbinary Quantum Codes from Two-Point Divisors on Hermitian Curves
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sarvepalli and Klappenecker showed how classical one-point codes on the
Hermitian curve can be used to construct quantum codes. Homma and Kim
determined the parameters of a larger family of codes, the two-point codes. In
quantum error-correction, the observed presence of asymmetry in some quantum
channels led to the study of asymmetric quantum codes (AQECCs) where we no
longer assume that the different types of errors are equiprobable. This paper
considers quantum codes constructed from the two-point codes. In the asymmetric
case, we show strict improvements over all possible finite fields for a range
of designed distances. We produce large dimension pure AQECC and small
dimension impure AQECC that have better parameters than AQECC from one-point
codes. Numerical results for the Hermitian curves over F16 and F64 are used to
illustrate the gain.
|
[
{
"version": "v1",
"created": "Thu, 17 Feb 2011 15:22:15 GMT"
}
] | 2011-02-18T00:00:00 |
[
[
"Ezerman",
"Martianu Frederic",
""
],
[
"Kirov",
"Radoslav",
""
]
] |
new_dataset
| 0.998391 |
1102.3670
|
Guillermo Diez-Canas
|
Guillermo D. Canas and Steven J. Gortler
|
Orphan-Free Anisotropic Voronoi Diagrams
|
17 pages, 6 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe conditions under which an appropriately-defined anisotropic
Voronoi diagram of a set of sites in Euclidean space is guaranteed to be
composed of connected cells in any number of dimensions. These conditions are
natural for problems in optimization and approximation, and algorithms already
exist to produce sets of sites that satisfy them.
|
[
{
"version": "v1",
"created": "Thu, 17 Feb 2011 19:44:23 GMT"
}
] | 2011-02-18T00:00:00 |
[
[
"Canas",
"Guillermo D.",
""
],
[
"Gortler",
"Steven J.",
""
]
] |
new_dataset
| 0.997129 |
1102.3082
|
Erhan Yilmaz
|
Erhan Yilmaz and Raymond Knopp
|
Hash-and-Forward Relaying for Two-Way Relay Channel
|
5 pages, 2 figures, submitted to the IEEE ISIT'11 conference
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers a communication network comprised of two nodes, which
have no mutual direct communication links, communicating two-way with the aid
of a common relay node (RN), also known as separated two-way relay (TWR)
channel.
We first recall a cut-set outer bound for the set of rates in the context of
this network topology assuming full-duplex transmission capabilities. Then, we
derive a new achievable rate region based on hash-and-forward (HF) relaying
where the RN does not attempt to decode but instead hashes its received signal,
and show that under certain channel conditions it coincides with Shannon's
inner-bound for the two-way channel [1]. Moreover, for binary adder TWR channel
with additive noise at the nodes and the RN we provide a detailed capacity
achieving coding scheme based on structure codes.
|
[
{
"version": "v1",
"created": "Tue, 15 Feb 2011 14:32:38 GMT"
},
{
"version": "v2",
"created": "Wed, 16 Feb 2011 11:05:37 GMT"
}
] | 2011-02-17T00:00:00 |
[
[
"Yilmaz",
"Erhan",
""
],
[
"Knopp",
"Raymond",
""
]
] |
new_dataset
| 0.984716 |
1102.3216
|
Amin Jafarian
|
Amin Jafarian and Sriram Vishwanath
|
The Two-User Gaussian Fading Broadcast Channel
|
Also submitted to ISIT 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents outerbounds for the two-user Gaussian fading broadcast
channel. These outerbounds are based on Costa's entropy power inequality
(Costa-EPI) and are formulated mathematically as a feasibility problem. For
classes of the two-user Gaussian fading broadcast channel where the outerbound
is found to have a feasible solution, we find conditions under which a suitable
inner and outer bound meet. For all such cases, this paper provides a partial
characterization of the capacity region of the Gaussian two-user fading
broadcast channel.
|
[
{
"version": "v1",
"created": "Wed, 16 Feb 2011 01:24:25 GMT"
}
] | 2011-02-17T00:00:00 |
[
[
"Jafarian",
"Amin",
""
],
[
"Vishwanath",
"Sriram",
""
]
] |
new_dataset
| 0.990389 |
1102.3243
|
Aria Ghasemian Sahebi
|
Aria Ghasemian Sahebi, S. Sandeep Pradhan
|
On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For most discrete memoryless channels, there does not exist a linear code for
the channel which uses all of the channel's input symbols. Therefore, linearity
of the code for such channels is a very restrictive condition and there should
be a loosening of the algebraic structure of the code to a degree that the code
can admit any channel input alphabet. For any channel input alphabet size,
there always exists an Abelian group structure defined on the alphabet. We
investigate the capacity of Abelian group codes over discrete memoryless
channels and provide lower and upper bounds on the capacity.
|
[
{
"version": "v1",
"created": "Wed, 16 Feb 2011 05:26:11 GMT"
}
] | 2011-02-17T00:00:00 |
[
[
"Sahebi",
"Aria Ghasemian",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] |
new_dataset
| 0.997524 |
1102.3392
|
Junghoon Lee
|
Junghoon Lee and Cihan Tepedelenlioglu
|
Space-Time Coding over Fading Channels with Stable Noise
|
22 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the performance of space-time coding over fading
channels with impulsive noise which is known to accurately capture network
interference. We use the symmetric alpha stable noise distribution and adopt
two models which assume dependent and independent noise components across
receive antennas. We derive pairwise error probability (PEP) of orthogonal
space-time block codes (STBC) with a benchmark genie-aided receiver (GAR), or
the minimum distance receiver (MDR) which is optimal in the Gaussian case. For
general space-time codes we propose a maximum-likelihood (ML) receiver, and its
approximation at high signal-to-noise ratio (SNR). The resulting asymptotically
optimal receiver (AOR) does not depend on noise parameters and is
computationally simple. Monte-Carlo simulations are used to supplement our
analytical results and compare the performance of the receivers.
|
[
{
"version": "v1",
"created": "Wed, 16 Feb 2011 18:30:00 GMT"
}
] | 2011-02-17T00:00:00 |
[
[
"Lee",
"Junghoon",
""
],
[
"Tepedelenlioglu",
"Cihan",
""
]
] |
new_dataset
| 0.973704 |
1102.2700
|
Antonia Wachter
|
Antonia Wachter, Vladimir Sidorenko, Martin Bossert, Victor Zyablov
|
On (Partial) Unit Memory Codes Based on Gabidulin Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
(Partial) Unit Memory ((P)UM) codes provide a powerful possibility to
construct convolutional codes based on block codes in order to achieve a high
decoding performance. In this contribution, a construction based on Gabidulin
codes is considered. This construction requires a modified rank metric, the
so-called sum rank metric. For the sum rank metric, the free rank distance, the
extended row rank distance and its slope are defined analogous to the extended
row distance in Hamming metric. Upper bounds for the free rank distance and the
slope of (P)UM codes in the sum rank metric are derived and an explicit
construction of (P)UM codes based on Gabidulin codes is given, achieving the
upper bound for the free rank distance.
|
[
{
"version": "v1",
"created": "Mon, 14 Feb 2011 08:53:34 GMT"
},
{
"version": "v2",
"created": "Tue, 15 Feb 2011 12:29:32 GMT"
}
] | 2011-02-16T00:00:00 |
[
[
"Wachter",
"Antonia",
""
],
[
"Sidorenko",
"Vladimir",
""
],
[
"Bossert",
"Martin",
""
],
[
"Zyablov",
"Victor",
""
]
] |
new_dataset
| 0.971169 |
1102.2986
|
Tuvi Etzion
|
Tuvi Etzion
|
Sidon Sequences and Doubly Periodic Two-Dimensional Synchronization
Patterns
|
submitted to International Symposium on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sidon sequences and their generalizations have found during the years and
especially recently various applications in coding theory. One of the most
important applications of these sequences is in the connection of
synchronization patterns. A few constructions of two-dimensional
synchronization patterns are based on these sequences. In this paper we present
sufficient conditions that a two-dimensional synchronization pattern can be
transformed into a Sidon sequence. We also present a new construction for Sidon
sequences over an alphabet of size q(q-1), where q is a power of a prime.
|
[
{
"version": "v1",
"created": "Tue, 15 Feb 2011 07:54:28 GMT"
}
] | 2011-02-16T00:00:00 |
[
[
"Etzion",
"Tuvi",
""
]
] |
new_dataset
| 0.99978 |
1102.3127
|
Hsuan-Jung Su
|
Hsuan-Yi Chu and Hsuan-Jung Su
|
On the Cognitive Interference Channel with Unidirectional Destination
Cooperation
|
18 pages, 3 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The cognitive interference channel with unidirectional destination
cooperation (CIFC-UDC) is a cognitive interference channel (CIFC) where the
cognitive (secondary) destination not only decodes the information sent from
its sending dual but also helps enhance the communication of the primary user.
This channel model is an extension of the original CIFC to achieve a win-win
solution under the coexistence condition. From an information-theoretic
perspective, the CIFC-UDC comprises a broadcast channel (BC), a relay channel
(RC) and a partially cooperative relay broadcast channel (PCRBC), and can be
degraded to any one of them. Our main result is the establishment of a new
unified achieva-ble rate region for the CIFC-UDC which is the largest known to
date and can be explicitly shown to include the previous result proposed by Chu
and the largest known rate regions for the BC, the RC and the PCRBC. In
addition, an interesting viewpoint on the unidirectional destination
cooperation in the CIFC-UDC is discussed: to enable the decoder of the primary
user to perform interference mitigation can be considered as a complementary
idea to the interference mitigation via Gel'fand-Pinsker precod-ing in the CIFC
proposed by Devroye et al. Henceforth, by com-bing these two ideas, the
interferences caused at both the desti-nations can be alleviated. Lastly, an
outer bound is presented and proved to be tight for a class of the CIFC-UDC,
resulting in the characterization of the capacity region for this class.
|
[
{
"version": "v1",
"created": "Tue, 15 Feb 2011 17:05:24 GMT"
}
] | 2011-02-16T00:00:00 |
[
[
"Chu",
"Hsuan-Yi",
""
],
[
"Su",
"Hsuan-Jung",
""
]
] |
new_dataset
| 0.997001 |
1001.0251
|
Pierre Guillon
|
Julien Cervelle and Enrico Formenti and Pierre Guillon
|
Ultimate Traces of Cellular Automata
|
12 pages + 5 of appendix conference STACS'10
| null | null | null |
cs.FL cs.DM nlin.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A cellular automaton (CA) is a parallel synchronous computing model, which
consists in a juxtaposition of finite automata (cells) whose state evolves
according to that of their neighbors. Its trace is the set of infinite words
representing the sequence of states taken by some particular cell. In this
paper we study the ultimate trace of CA and partial CA (a CA restricted to a
particular subshift). The ultimate trace is the trace observed after a long
time run of the CA. We give sufficient conditions for a set of infinite words
to be the trace of some CA and prove the undecidability of all properties over
traces that are stable by ultimate coincidence.
|
[
{
"version": "v1",
"created": "Fri, 1 Jan 2010 19:15:02 GMT"
},
{
"version": "v2",
"created": "Sat, 12 Feb 2011 10:30:48 GMT"
}
] | 2011-02-15T00:00:00 |
[
[
"Cervelle",
"Julien",
""
],
[
"Formenti",
"Enrico",
""
],
[
"Guillon",
"Pierre",
""
]
] |
new_dataset
| 0.997695 |
1102.2180
|
Filippo Petroni
|
M. Serva, F. Petroni, D. Volchenkov and S. Wichmann
|
Malagasy Dialects and the Peopling of Madagascar
| null | null | null | null |
cs.CL physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The origin of Malagasy DNA is half African and half Indonesian, nevertheless
the Malagasy language, spoken by the entire population, belongs to the
Austronesian family. The language most closely related to Malagasy is Maanyan
(Greater Barito East group of the Austronesian family), but related languages
are also in Sulawesi, Malaysia and Sumatra. For this reason, and because
Maanyan is spoken by a population which lives along the Barito river in
Kalimantan and which does not possess the necessary skill for long maritime
navigation, the ethnic composition of the Indonesian colonizers is still
unclear.
There is a general consensus that Indonesian sailors reached Madagascar by a
maritime trek, but the time, the path and the landing area of the first
colonization are all disputed. In this research we try to answer these problems
together with other ones, such as the historical configuration of Malagasy
dialects, by types of analysis related to lexicostatistics and glottochronology
which draw upon the automated method recently proposed by the authors
\cite{Serva:2008, Holman:2008, Petroni:2008, Bakker:2009}. The data were
collected by the first author at the beginning of 2010 with the invaluable help
of Joselin\`a Soafara N\'er\'e and consist of Swadesh lists of 200 items for 23
dialects covering all areas of the Island.
|
[
{
"version": "v1",
"created": "Thu, 10 Feb 2011 17:16:50 GMT"
},
{
"version": "v2",
"created": "Sun, 13 Feb 2011 16:12:21 GMT"
}
] | 2011-02-15T00:00:00 |
[
[
"Serva",
"M.",
""
],
[
"Petroni",
"F.",
""
],
[
"Volchenkov",
"D.",
""
],
[
"Wichmann",
"S.",
""
]
] |
new_dataset
| 0.999857 |
1102.2445
|
Michael Dietz
|
Michael Dietz and Shashi Shekhar and Yuliy Pisetsky and Anhei Shu and
Dan S. Wallach
|
Quire: Lightweight Provenance for Smart Phone Operating Systems
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Smartphone apps often run with full privileges to access the network and
sensitive local resources, making it difficult for remote systems to have any
trust in the provenance of network connections they receive. Even within the
phone, different apps with different privileges can communicate with one
another, allowing one app to trick another into improperly exercising its
privileges (a Confused Deputy attack). In Quire, we engineered two new security
mechanisms into Android to address these issues. First, we track the call chain
of IPCs, allowing an app the choice of operating with the diminished privileges
of its callers or to act explicitly on its own behalf. Second, a lightweight
signature scheme allows any app to create a signed statement that can be
verified anywhere inside the phone. Both of these mechanisms are reflected in
network RPCs, allowing remote systems visibility into the state of the phone
when an RPC is made. We demonstrate the usefulness of Quire with two example
applications. We built an advertising service, running distinctly from the app
which wants to display ads, which can validate clicks passed to it from its
host. We also built a payment service, allowing an app to issue a request which
the payment service validates with the user. An app cannot not forge a payment
request by directly connecting to the remote server, nor can the local payment
service tamper with the request.
|
[
{
"version": "v1",
"created": "Fri, 11 Feb 2011 21:24:57 GMT"
}
] | 2011-02-15T00:00:00 |
[
[
"Dietz",
"Michael",
""
],
[
"Shekhar",
"Shashi",
""
],
[
"Pisetsky",
"Yuliy",
""
],
[
"Shu",
"Anhei",
""
],
[
"Wallach",
"Dan S.",
""
]
] |
new_dataset
| 0.986717 |
1102.2506
|
Behrouz Maham
|
Behrouz Maham and Are Hj{\o}rungnes
|
Opportunistic Relaying for Space-Time Coded Cooperation with Multiple
Antenna Terminals
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a wireless relay network with multiple antenna terminals over
Rayleigh fading channels, and apply distributed space-time coding (DSTC) in
amplify-and-forward (A&F) mode. The A&F scheme is used in a way that each relay
transmits a scaled version of the linear combination of the received symbols.
It turns out that, combined with power allocation in the relays, A&F DSTC
results in an opportunistic relaying scheme, in which only the best relay is
selected to retransmit the source's space-time coded signal. Furthermore,
assuming the knowledge of source-relay CSI at the source node, we design an
efficient power allocation which outperforms uniform power allocation across
the source antennas. Next, assuming M-PSK or M-QAM modulations, we analyze the
performance of the proposed cooperative diversity transmission schemes in a
wireless relay networks with the multiple-antenna source and destination. We
derive the probability density function (PDF) of the received SNR at the
destination. Then, the PDF is used to determine the symbol error rate (SER) in
Rayleigh fading channels. We derived closed-form approximations of the average
SER in the high SNR scenario, from which we find the diversity order of system
RminfNs;Ndg, where R, Ns, and Nd are the number of the relays, source antennas,
and destination antennas, respectively. Simulation results show that the
proposed system obtain more than 6 dB gain in SNR over A&F MIMO DSTC for BER
10^{-4}, when R = 2, Ns = 2, and Nd = 1.
|
[
{
"version": "v1",
"created": "Sat, 12 Feb 2011 12:28:41 GMT"
}
] | 2011-02-15T00:00:00 |
[
[
"Maham",
"Behrouz",
""
],
[
"Hjørungnes",
"Are",
""
]
] |
new_dataset
| 0.989633 |
1102.2673
|
Eric Feron
|
Pierrick Burgain and Eric Feron
|
Environmental benefits of enhanced surveillance technology on airport
departure operations
|
25 pages, submitted to US/EUrope 2011 ATM seminar
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Airport departure operations constitute an important source of airline delays
and passenger frustration. Excessive surface traffic is the cause of increased
controller and pilot workload; It is also the source of increased emissions; It
worsens traffic safety and often does not yield improved runway throughput.
Acknowledging this fact, this paper explores some of the feedback mechanisms by
which airport traffic can be optimized in real time according to its current
degree of congestion. In particular, it examines the environmnetal benefits
that improved surveillance technologies can bring in the context of gate- or
spot-release aircraft strategies. It is shown that improvements can lead yield
4% to 6% emission reductions for busy airports like New-York La Guardia or
Seattle Tacoma. These benefits come on top of the benefits already obtained by
adopting threshold strategies currently under evaluation.
|
[
{
"version": "v1",
"created": "Mon, 14 Feb 2011 04:27:41 GMT"
}
] | 2011-02-15T00:00:00 |
[
[
"Burgain",
"Pierrick",
""
],
[
"Feron",
"Eric",
""
]
] |
new_dataset
| 0.974617 |
1102.2787
|
Anas Chaaban
|
Anas Chaaban, Aydin Sezgin, and Salman Avestimehr
|
On the Sum Capacity of the Y-Channel
|
12 pages, 8 figures, submitted to ISIT 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A network where three users communicate with each other via a relay is
considered. Users do not receive other users' signals via a direct link, and
thus the relay is essential for their communication. Each user is assumed to
have an individual message to be delivered to each other user. Thus, each user
wants to send two messages and to decode two messages. In general, the transmit
signals of different nodes can be dependent since they can depend on previously
received symbols. We call this case the general case. The sum-capacity is
studied, and upper bounds and lower bounds are given. If all nodes have the
same power, the sum-capacity is characterized to within a gap of 5/2 bits or a
factor of 3 for all values of channel coefficients. This gap is also shown to
approach 3/2 bits as the transmit power increases. Moreover, for the symmetric
case with equal channel coefficients, the gap is shown to be less than 1 bit.
The restricted case is also considered where the transmit signal does not
depend on previously received symbols. In this case, the sum-capacity is
characterized to within a gap of 2 bits or a factor of 3 for all values of
channel coefficients, and approaches 1 bit as the transmit power increases.
|
[
{
"version": "v1",
"created": "Mon, 14 Feb 2011 14:57:18 GMT"
}
] | 2011-02-15T00:00:00 |
[
[
"Chaaban",
"Anas",
""
],
[
"Sezgin",
"Aydin",
""
],
[
"Avestimehr",
"Salman",
""
]
] |
new_dataset
| 0.990377 |
1102.2280
|
Constantinos Daskalakis
|
Constantinos Daskalakis and Christos H. Papadimitriou
|
On Oblivious PTAS's for Nash Equilibrium
|
extended version of paper of the same title that appeared in STOC
2009
|
STOC 2009
| null | null |
cs.GT stat.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
If a game has a Nash equilibrium with probability values that are either zero
or Omega(1) then this equilibrium can be found exhaustively in polynomial time.
Somewhat surprisingly, we show that there is a PTAS for the games whose
equilibria are guaranteed to have small-O(1/n)-values, and therefore
large-Omega(n)-supports. We also point out that there is a PTAS for games with
sparse payoff matrices, which are known to be PPAD-complete to solve exactly.
Both algorithms are of a special kind that we call oblivious: The algorithm
just samples a fixed distribution on pairs of mixed strategies, and the game is
only used to determine whether the sampled strategies comprise an eps-Nash
equilibrium; the answer is yes with inverse polynomial probability. These
results bring about the question: Is there an oblivious PTAS for Nash
equilibrium in general games? We answer this question in the negative; our
lower bound comes close to the quasi-polynomial upper bound of [Lipton,
Markakis, Mehta 2003].
Another recent PTAS for anonymous games is also oblivious in a weaker sense
appropriate for this class of games (it samples from a fixed distribution on
unordered collections of mixed strategies), but its runtime is exponential in
1/eps. We prove that any oblivious PTAS for anonymous games with two strategies
and three player types must have 1/eps^c in the exponent of the running time
for some c>1/3, rendering the algorithm in [Daskalakis 2008] essentially
optimal within oblivious algorithms. In contrast, we devise a poly(n)
(1/eps)^O(log^2(1/eps)) non-oblivious PTAS for anonymous games with 2
strategies and any bounded number of player types.
Our algorithm is based on the construction of a sparse (and efficiently
computable) eps-cover of the set of all possible sums of n independent
indicators, under the total variation distance. The size of the cover is
poly(n) (1/ eps^{O(log^2 (1/eps))}.
|
[
{
"version": "v1",
"created": "Fri, 11 Feb 2011 04:42:36 GMT"
}
] | 2011-02-14T00:00:00 |
[
[
"Daskalakis",
"Constantinos",
""
],
[
"Papadimitriou",
"Christos H.",
""
]
] |
new_dataset
| 0.99248 |
1102.2332
|
Ashish Mani Mr.
|
Ashish Mani and C Patvardhan
|
A Fast Measurement based fixed-point Quantum Search Algorithm
| null | null | null | null |
cs.DB quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Generic quantum search algorithm searches for target entity in an unsorted
database by repeatedly applying canonical Grover's quantum rotation transform
to reach near the vicinity of the target entity represented by a basis state in
the Hilbert space associated with the qubits. Thus, when qubits are measured,
there is a high probability of finding the target entity. However, the number
of times quantum rotation transform is to be applied for reaching near the
vicinity of the target is a function of the number of target entities present
in the unsorted database, which is generally unknown. A wrong estimate of the
number of target entities can lead to overshooting or undershooting the
targets, thus reducing the success probability. Some proposals have been made
to overcome this limitation. These proposals either employ quantum counting to
estimate the number of solutions or fixed point schemes. This paper proposes a
new scheme for stopping the application of quantum rotation transformation on
reaching near the targets by measurement and subsequent processing to estimate
the distance of the state vector from the target states. It ensures a success
probability, which is at least greater than half for all the ratios of the
number of target entities to the total number of entities in a database, which
are less than half. The search problem is trivial for remaining possible
ratios. The proposed scheme is simpler than quantum counting and more efficient
than the known fixed-point schemes. It has same order of computational
complexity as canonical Grover's search algorithm but is slow by a factor of
two and requires an additional ancilla qubit.
|
[
{
"version": "v1",
"created": "Fri, 11 Feb 2011 11:53:01 GMT"
}
] | 2011-02-14T00:00:00 |
[
[
"Mani",
"Ashish",
""
],
[
"Patvardhan",
"C",
""
]
] |
new_dataset
| 0.98725 |
1102.2079
|
David N. Jansen
|
David N. Jansen (Radboud Universiteit Nijmegen, The Netherlands)
|
Erratum to: Model-checking continuous-time Markov chains by Aziz et al
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This note corrects a discrepancy between the semantics and the algorithm of
the multiple until operator of CSL, like in Pr_{> 0.0025} (a until[1,2] b
until[3,4] c), of the article: Model-checking continuous-time Markov chains by
Aziz, Sanwal, Singhal and Brayton, TOCL 1(1), July 2000, pp. 162-170.
|
[
{
"version": "v1",
"created": "Thu, 10 Feb 2011 11:05:29 GMT"
}
] | 2011-02-11T00:00:00 |
[
[
"Jansen",
"David N.",
"",
"Radboud Universiteit Nijmegen, The Netherlands"
]
] |
new_dataset
| 0.995579 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.