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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1109.6052
|
V. R. Lesser
|
V. R. Lesser, R. Mailler
|
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed
Constraint Satisfaction Problems
| null |
Journal Of Artificial Intelligence Research, Volume 25, pages
529-576, 2006
|
10.1613/jair.1786
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed Constraint Satisfaction (DCSP) has long been considered an
important problem in multi-agent systems research. This is because many
real-world problems can be represented as constraint satisfaction and these
problems often present themselves in a distributed form. In this article, we
present a new complete, distributed algorithm called Asynchronous Partial
Overlay (APO) for solving DCSPs that is based on a cooperative mediation
process. The primary ideas behind this algorithm are that agents, when acting
as a mediator, centralize small, relevant portions of the DCSP, that these
centralized subproblems overlap, and that agents increase the size of their
subproblems along critical paths within the DCSP as the problem solving
unfolds. We present empirical evidence that shows that APO outperforms other
known, complete DCSP techniques.
|
[
{
"version": "v1",
"created": "Tue, 27 Sep 2011 22:05:46 GMT"
}
] | 2011-09-29T00:00:00 |
[
[
"Lesser",
"V. R.",
""
],
[
"Mailler",
"R.",
""
]
] |
new_dataset
| 0.963744 |
1109.6270
|
Pabitra Pal Choudhury
|
Avishek Ghosh, Joydeep Banerjee, Sk. S. Hassan, P. Pal Choudhury
|
Fractal String Generation and Its Application in Music Composition
| null | null | null | null |
cs.SD cs.DM
|
http://creativecommons.org/licenses/by/3.0/
|
Music is a string of some of the notes out of 12 notes (Sa, Komal_re, Re,
Komal_ga, Ga, Ma, Kari_ma, Pa, Komal_dha, Dha, Komal_ni, Ni) and their
harmonics. Each note corresponds to a particular frequency. When such strings
are encoded to form discrete sequences, different frequencies present in the
music corresponds to different amplitude levels (value) of the discrete
sequence. Initially, a class of discrete sequences has been generated using
logistic map. All these discrete sequences have at most n-different amplitude
levels (value) (depending on the particular raga). Without loss of generality,
we have chosen two discrete sequences of two types of Indian raga viz. Bhairabi
and Bhupali having same number of amplitude levels to obtain/search close
relatives from the class. The relative / closeness can be assured through
correlation coefficient.The search is unbiased, random and non-adaptive. The
obtained string is that which maximally resembles the given two sequences. The
same can be thought of as a music composition of the given two strings. It is
to be noted that all these string are fractal string which can be persuaded by
fractal dimension.
|
[
{
"version": "v1",
"created": "Tue, 27 Sep 2011 10:04:45 GMT"
}
] | 2011-09-29T00:00:00 |
[
[
"Ghosh",
"Avishek",
""
],
[
"Banerjee",
"Joydeep",
""
],
[
"Hassan",
"Sk. S.",
""
],
[
"Choudhury",
"P. Pal",
""
]
] |
new_dataset
| 0.991496 |
1109.6279
|
Michael Sagraloff
|
Michael Sagraloff
|
When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the
Real Roots of a Polynomial
| null | null | null | null |
cs.SC cs.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new algorithm denoted DSC2 to isolate the real roots of a
univariate square-free polynomial f with integer coefficients. The algorithm
iteratively subdivides an initial interval which is known to contain all real
roots of f. The main novelty of our approach is that we combine Descartes' Rule
of Signs and Newton iteration. More precisely, instead of using a fixed
subdivision strategy such as bisection in each iteration, a Newton step based
on the number of sign variations for an actual interval is considered, and,
only if the Newton step fails, we fall back to bisection. Following this
approach, our analysis shows that, for most iterations, we can achieve
quadratic convergence towards the real roots. In terms of complexity, our
method induces a recursion tree of almost optimal size O(nlog(n tau)), where n
denotes the degree of the polynomial and tau the bitsize of its coefficients.
The latter bound constitutes an improvement by a factor of tau upon all
existing subdivision methods for the task of isolating the real roots. In
addition, we provide a bit complexity analysis showing that DSC2 needs only
\tilde{O}(n^3tau) bit operations to isolate all real roots of f. This matches
the best bound known for this fundamental problem. However, in comparison to
the much more involved algorithms by Pan and Sch\"onhage (for the task of
isolating all complex roots) which achieve the same bit complexity, DSC2
focuses on real root isolation, is very easy to access and easy to implement.
|
[
{
"version": "v1",
"created": "Wed, 28 Sep 2011 17:39:07 GMT"
}
] | 2011-09-29T00:00:00 |
[
[
"Sagraloff",
"Michael",
""
]
] |
new_dataset
| 0.999542 |
0910.0777
|
Brent Heeringa
|
Glencora Borradaile, Brent Heeringa, Gordon Wilfong
|
The Knapsack Problem with Neighbour Constraints
|
Full version of IWOCA 2011 paper
| null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study a constrained version of the knapsack problem in which dependencies
between items are given by the adjacencies of a graph. In the 1-neighbour
knapsack problem, an item can be selected only if at least one of its
neighbours is also selected. In the all-neighbours knapsack problem, an item
can be selected only if all its neighbours are also selected. We give
approximation algorithms and hardness results when the nodes have both uniform
and arbitrary weight and profit functions, and when the dependency graph is
directed and undirected.
|
[
{
"version": "v1",
"created": "Mon, 5 Oct 2009 14:34:09 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Feb 2010 16:59:28 GMT"
},
{
"version": "v3",
"created": "Mon, 11 Jul 2011 16:25:45 GMT"
},
{
"version": "v4",
"created": "Tue, 27 Sep 2011 01:03:05 GMT"
}
] | 2011-09-28T00:00:00 |
[
[
"Borradaile",
"Glencora",
""
],
[
"Heeringa",
"Brent",
""
],
[
"Wilfong",
"Gordon",
""
]
] |
new_dataset
| 0.993972 |
1011.1783
|
Benedikt Meurer
|
Benedikt Meurer
|
OCamlJIT 2.0 - Faster Objective Caml
|
23 pages, 12 figures
| null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents the current state of an ongoing research project to
improve the performance of the OCaml byte-code interpreter using Just-In-Time
native code generation. Our JIT engine OCamlJIT2 currently runs on x86-64
processors, mimicing precisely the behavior of the OCaml virtual machine. Its
design and implementation is described, and performance measures are given.
|
[
{
"version": "v1",
"created": "Mon, 8 Nov 2010 12:16:37 GMT"
},
{
"version": "v2",
"created": "Wed, 11 May 2011 08:35:02 GMT"
},
{
"version": "v3",
"created": "Tue, 27 Sep 2011 14:12:46 GMT"
}
] | 2011-09-28T00:00:00 |
[
[
"Meurer",
"Benedikt",
""
]
] |
new_dataset
| 0.998228 |
1109.5717
|
H. H. Hoos
|
H. H. Hoos, W. Pullan
|
Dynamic Local Search for the Maximum Clique Problem
| null |
Journal Of Artificial Intelligence Research, Volume 25, pages
159-185, 2006
|
10.1613/jair.1815
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we introduce DLS-MC, a new stochastic local search algorithm
for the maximum clique problem. DLS-MC alternates between phases of iterative
improvement, during which suitable vertices are added to the current clique,
and plateau search, during which vertices of the current clique are swapped
with vertices not contained in the current clique. The selection of vertices is
solely based on vertex penalties that are dynamically adjusted during the
search, and a perturbation mechanism is used to overcome search stagnation. The
behaviour of DLS-MC is controlled by a single parameter, penalty delay, which
controls the frequency at which vertex penalties are reduced. We show
empirically that DLS-MC achieves substantial performance improvements over
state-of-the-art algorithms for the maximum clique problem over a large range
of the commonly used DIMACS benchmark instances.
|
[
{
"version": "v1",
"created": "Mon, 26 Sep 2011 20:24:56 GMT"
}
] | 2011-09-28T00:00:00 |
[
[
"Hoos",
"H. H.",
""
],
[
"Pullan",
"W.",
""
]
] |
new_dataset
| 0.993101 |
1109.1454
|
Anis Ismail
|
Anis Ismail, Abd El Salam AL Hajjar and Mohammad Hajjar
|
A Prototype System for Controlling a Computer by Head Movements and
Voice Commands
|
11 pages, 4 figures
| null | null | null |
cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a new prototype system for controlling a PC by head
movements and also with voice commands. Our system is a multimodal interface
concerned with controlling the computer. The selected modes of interaction are
speech and gestures. We are seeing the revolutionary of computers and
information technologies into daily practice. Healthy people use keyboard,
mouse, trackball, or touchpad for controlling the PC. However these peripheries
are usually not suitable for handicapped people. They may have problems using
these standard peripheries, for example when they suffer from myopathy, or
cannot move their hands after an injury. Our system has been developed to
provide computer access for people with severe disabilities. This system tracks
the computer user's Head movements with a video camera and translates them into
the movements of the mouse pointer on the screen and the voice as button
presses. Therefore we are coming with a proposal system that can be used with
handicapped people to control the PC.
|
[
{
"version": "v1",
"created": "Tue, 6 Sep 2011 10:26:17 GMT"
}
] | 2011-09-27T00:00:00 |
[
[
"Ismail",
"Anis",
""
],
[
"Hajjar",
"Abd El Salam AL",
""
],
[
"Hajjar",
"Mohammad",
""
]
] |
new_dataset
| 0.998398 |
1109.5282
|
Elena Villarreal Zapata
|
Elena Villarreal Zapata, Francisco Cruz Ordaz Salazar
|
Aut\'omatas celulares elementales aplicados a la encriptaci\'on de datos
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For data ciphering a key is usually needed as a base, so it is indispensable
to have one that is strong and trustworthy, so as to keep others from accessing
the ciphered data. This requires a pseudo-random number generator that would
provide such a key, so it is proposed to work with cellular automata helped
along with \emph{Mathematica} to check that the rules and to what level are
actually pseudo-random. This project centers on the examination of possible
mathematical rules, analyzing their characteristics in a detailed manner, and
submitting them to a set of randomness tests with the end of knowing which of
them will enable us to obtain those pseudo-random numbers that will conform the
key for data ciphering.
|
[
{
"version": "v1",
"created": "Sat, 24 Sep 2011 16:14:07 GMT"
}
] | 2011-09-27T00:00:00 |
[
[
"Zapata",
"Elena Villarreal",
""
],
[
"Salazar",
"Francisco Cruz Ordaz",
""
]
] |
new_dataset
| 0.980842 |
1109.5323
|
Jeremy Lee
|
Jeremy Lee
|
Squiggle - A Glyph Recognizer for Gesture Input
|
10 pages
| null | null | null |
cs.HC cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Squiggle is a template-based glyph recognizer in the lineage of `$1
Recognizer' and `Protractor'. It seeks a good fit linear affine mapping between
the input and template glyphs which are represented as a list of milestone
points along the glyph path. The algorithm can recognize input glyphs invariant
of rotation, scaling, skew, and reflection symmetries. In practice the
algorithm is fast and robust enough to recognize user-generated glyphs as they
are being drawn in real time, and to project `shadows' of the matching
templates as feedback.
|
[
{
"version": "v1",
"created": "Sun, 25 Sep 2011 04:41:35 GMT"
}
] | 2011-09-27T00:00:00 |
[
[
"Lee",
"Jeremy",
""
]
] |
new_dataset
| 0.981139 |
1109.5665
|
D. McDermott
|
D. McDermott
|
PDDL2.1 - The Art of the Possible? Commentary on Fox and Long
| null |
Journal Of Artificial Intelligence Research, Volume 20, pages
145-148, 2003
|
10.1613/jair.1996
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
PDDL2.1 was designed to push the envelope of what planning algorithms can do,
and it has succeeded. It adds two important features: durative actions,which
take time (and may have continuous effects); and objective functions for
measuring the quality of plans. The concept of durative actions is flawed; and
the treatment of their semantics reveals too strong an attachment to the way
many contemporary planners work. Future PDDL innovators should focus on
producing a clean semantics for additions to the language, and let planner
implementers worry about coupling their algorithms to problems expressed in the
latest version of the language.
|
[
{
"version": "v1",
"created": "Mon, 26 Sep 2011 18:44:25 GMT"
}
] | 2011-09-27T00:00:00 |
[
[
"McDermott",
"D.",
""
]
] |
new_dataset
| 0.991522 |
1109.5683
|
Andrea Sportiello
|
Frederique Bassino, Julien David and Andrea Sportiello
|
Asymptotic enumeration of Minimal Automata
|
12+5 pages, 2 figures, submitted to STACS 2012
| null | null | null |
cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We determine the asymptotic proportion of minimal automata, within n-state
accessible deterministic complete automata over a k-letter alphabet, with the
uniform distribution over the possible transition structures, and a binomial
distribution over terminal states, with arbitrary parameter b. It turns out
that a fraction ~ 1-C(k,b) n^{-k+2} of automata is minimal, with C(k,b) a
function, explicitly determined, involving the solution of a transcendental
equation.
|
[
{
"version": "v1",
"created": "Mon, 26 Sep 2011 19:39:56 GMT"
}
] | 2011-09-27T00:00:00 |
[
[
"Bassino",
"Frederique",
""
],
[
"David",
"Julien",
""
],
[
"Sportiello",
"Andrea",
""
]
] |
new_dataset
| 0.999598 |
1109.4683
|
Alper Ayvaci
|
Alper Ayvaci and Stefano Soatto
|
Detachable Object Detection: Segmentation and Depth Ordering From
Short-Baseline Video
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an approach for segmenting an image into regions that correspond
to surfaces in the scene that are partially surrounded by the medium. It
integrates both appearance and motion statistics into a cost functional, that
is seeded with occluded regions and minimized efficiently by solving a linear
programming problem. Where a short observation time is insufficient to
determine whether the object is detachable, the results of the minimization can
be used to seed a more costly optimization based on a longer sequence of video
data. The result is an entirely unsupervised scheme to detect and segment an
arbitrary and unknown number of objects. We test our scheme to highlight the
potential, as well as limitations, of our approach.
|
[
{
"version": "v1",
"created": "Thu, 22 Sep 2011 00:55:32 GMT"
}
] | 2011-09-23T00:00:00 |
[
[
"Ayvaci",
"Alper",
""
],
[
"Soatto",
"Stefano",
""
]
] |
new_dataset
| 0.994683 |
1109.4906
|
Odile Piton
|
Odile Piton (SAMM), Slim Mesfar (RIADI), H\'el\`ene Pignot (SAMM)
|
Automatic transcription of 17th century English text in Contemporary
English with NooJ: Method and Evaluation
| null | null | null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Since 2006 we have undertaken to describe the differences between 17th
century English and contemporary English thanks to NLP software. Studying a
corpus spanning the whole century (tales of English travellers in the Ottoman
Empire in the 17th century, Mary Astell's essay A Serious Proposal to the
Ladies and other literary texts) has enabled us to highlight various lexical,
morphological or grammatical singularities. Thanks to the NooJ linguistic
platform, we created dictionaries indexing the lexical variants and their
transcription in CE. The latter is often the result of the validation of forms
recognized dynamically by morphological graphs. We also built syntactical
graphs aimed at transcribing certain archaic forms in contemporary English. Our
previous research implied a succession of elementary steps alternating textual
analysis and result validation. We managed to provide examples of
transcriptions, but we have not created a global tool for automatic
transcription. Therefore we need to focus on the results we have obtained so
far, study the conditions for creating such a tool, and analyze possible
difficulties. In this paper, we will be discussing the technical and linguistic
aspects we have not yet covered in our previous work. We are using the results
of previous research and proposing a transcription method for words or
sequences identified as archaic.
|
[
{
"version": "v1",
"created": "Thu, 22 Sep 2011 18:37:17 GMT"
}
] | 2011-09-23T00:00:00 |
[
[
"Piton",
"Odile",
"",
"SAMM"
],
[
"Mesfar",
"Slim",
"",
"RIADI"
],
[
"Pignot",
"Hélène",
"",
"SAMM"
]
] |
new_dataset
| 0.993888 |
1109.4433
|
Johanne Cohen
|
Olivier Bournez, J\'er\'emie Chalopin, Johanne Cohen, Xavier Koegler,
Mikael Rabie
|
Asymetric Pavlovian Populations
| null | null | null | null |
cs.DC cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Population protocols have been introduced by Angluin et al. as a model of
networks consisting of very limited mobile agents that interact in pairs but
with no control over their own movement. A collection of anonymous agents,
modeled by finite automata, interact pairwise according to some rules that
update their states. Predicates on the initial configurations that can be
computed by such protocols have been characterized as semi-linear predicates.
In an orthogonal way, several distributed systems have been termed in
literature as being realizations of games in the sense of game theory. We
investigate under which conditions population protocols, or more generally
pairwise interaction rules, correspond to games. We show that restricting to
asymetric games is not really a restric- tion: all predicates computable by
protocols can actually be computed by protocols corresponding to games, i.e.
any semi-linear predicate can be computed by a Pavlovian population
multi-protocol.
|
[
{
"version": "v1",
"created": "Tue, 20 Sep 2011 21:17:02 GMT"
}
] | 2011-09-22T00:00:00 |
[
[
"Bournez",
"Olivier",
""
],
[
"Chalopin",
"Jérémie",
""
],
[
"Cohen",
"Johanne",
""
],
[
"Koegler",
"Xavier",
""
],
[
"Rabie",
"Mikael",
""
]
] |
new_dataset
| 0.99937 |
1109.4455
|
Jianqin Zhou
|
Jianqin Zhou
|
Periodic sequences with stable $k$-error linear complexity
| null | null | null | null |
cs.CR
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
The linear complexity of a sequence has been used as an important measure of
keystream strength, hence designing a sequence which possesses high linear
complexity and $k$-error linear complexity is a hot topic in cryptography and
communication. Niederreiter first noticed many periodic sequences with high
$k$-error linear complexity over GF(q). In this paper, the concept of stable
$k$-error linear complexity is presented to study sequences with high $k$-error
linear complexity. By studying linear complexity of binary sequences with
period $2^n$, the method using cube theory to construct sequences with maximum
stable $k$-error linear complexity is presented. It is proved that a binary
sequence with period $2^n$ can be decomposed into some disjoint cubes. The cube
theory is a new tool to study $k$-error linear complexity. Finally, it is
proved that the maximum $k$-error linear complexity is $2^n-(2^l-1)$ over all
$2^n$-periodic binary sequences, where $2^{l-1}\le k<2^{l}$.
|
[
{
"version": "v1",
"created": "Wed, 21 Sep 2011 01:48:36 GMT"
}
] | 2011-09-22T00:00:00 |
[
[
"Zhou",
"Jianqin",
""
]
] |
new_dataset
| 0.955589 |
1109.4552
|
Alexander Kornyushkin
|
A. Kornyushkin
|
About a Discrete Cellular Soliton (computer simulation)
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For the first time a mathematical object is presented - a reversible cellular
Automaton - with many paradoxical qualities, the main ones among them are: a
frequent quickly return to its original state, the presence of a large number
of conservation laws and paradoxical "fuzzy" symmetries, which connects the
current position of the automaton with its signature Main Integral.
|
[
{
"version": "v1",
"created": "Fri, 26 Aug 2011 20:15:18 GMT"
}
] | 2011-09-22T00:00:00 |
[
[
"Kornyushkin",
"A.",
""
]
] |
new_dataset
| 0.983473 |
0902.0261
|
Tomoyuki Yamakami
|
Tomoyuki Yamakami
|
Immunity and Pseudorandomness of Context-Free Languages
|
A4, 23 pages, 10 pt. A complete revision of the initial version that
was posted in February 2009
|
Theoretical Computer Science, vol. 412, pp.6432-6450, 2011
|
10.1016/j.tcs.2011.07.013
| null |
cs.CC cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss the computational complexity of context-free languages,
concentrating on two well-known structural properties---immunity and
pseudorandomness. An infinite language is REG-immune (resp., CFL-immune) if it
contains no infinite subset that is a regular (resp., context-free) language.
We prove that (i) there is a context-free REG-immune language outside REG/n and
(ii) there is a REG-bi-immune language that can be computed deterministically
using logarithmic space. We also show that (iii) there is a CFL-simple set,
where a CFL-simple language is an infinite context-free language whose
complement is CFL-immune. Similar to the REG-immunity, a REG-primeimmune
language has no polynomially dense subsets that are also regular. We further
prove that (iv) there is a context-free language that is REG/n-bi-primeimmune.
Concerning pseudorandomness of context-free languages, we show that (v) CFL
contains REG/n-pseudorandom languages. Finally, we prove that (vi) against
REG/n, there exists an almost 1-1 pseudorandom generator computable in
nondeterministic pushdown automata equipped with a write-only output tape and
(vii) against REG, there is no almost 1-1 weakly pseudorandom generator
computable deterministically in linear time by a single-tape Turing machine.
|
[
{
"version": "v1",
"created": "Mon, 2 Feb 2009 12:21:23 GMT"
},
{
"version": "v2",
"created": "Wed, 20 Jul 2011 13:18:33 GMT"
}
] | 2011-09-20T00:00:00 |
[
[
"Yamakami",
"Tomoyuki",
""
]
] |
new_dataset
| 0.989917 |
1107.4721
|
Jesse Alama
|
Jesse Alama
|
mizar-items: Exploring fine-grained dependencies in the Mizar
Mathematical Library
|
Accepted at CICM 2011: Conferences in Intelligent Computer
Mathematics, Track C: Systems and Projects
|
Intelligent Computer Mathematics, Lecture Notes in Computer
Science 6824, pp. 276-7, 2011
|
10.1007/978-3-642-22673-1_19
| null |
cs.DL math.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Mizar Mathematical Library (MML) is a rich database of formalized
mathematical proofs (see http://mizar.org). Owing to its large size (it
contains more than 1100 "articles" summing to nearly 2.5 million lines of text,
expressing more than 50000 theorems and 10000 definitions using more than 7000
symbols), the nature of its contents (the MML is slanted toward pure
mathematics), and its classical foundations (first-order logic, set theory,
natural deduction), the MML is an especially attractive target for research on
foundations of mathematics. We have implemented a system, mizar-items, on which
a variety of such foundational experiements can be based. The heart of
mizar-items is a method for decomposing the contents of the MML into
fine-grained "items" (e.g., theorem, definition, notation, etc.) and computing
dependency relations among these items. mizar-items also comes equipped with a
website for exploring these dependencies and interacting with them.
|
[
{
"version": "v1",
"created": "Sun, 24 Jul 2011 04:25:44 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Sep 2011 15:50:13 GMT"
}
] | 2011-09-20T00:00:00 |
[
[
"Alama",
"Jesse",
""
]
] |
new_dataset
| 0.991889 |
1102.3504
|
Anh Le
|
Anh Le and Athina Markopoulou
|
Cooperative Defense against Pollution Attacks in Network Coding Using
SpaceMac
|
This is an extended version of a short version to appear in IEEE JSAC
on Cooperative Networking - Challenges and Applications 2011
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Intra-session network coding is known to be vulnerable to pollution attacks.
In this work, first, we introduce a novel homomorphic MAC scheme called
SpaceMac, which allows an intermediate node to verify if its received packets
belong to a specific subspace, even if the subspace is expanding over time.
Then, we use SpaceMac as a building block to design a cooperative scheme that
provides complete defense against pollution attacks: (i) it can detect polluted
packets early at intermediate nodes and (ii) it can identify the exact location
of all, even colluding, attackers, thus making it possible to eliminate them.
Our scheme is cooperative: parents and children of any node cooperate to detect
any corrupted packets sent by the node, and nodes in the network cooperate with
a central controller to identify the exact location of all attackers. We
implement SpaceMac in both C/C++ and Java as a library, and we make the library
available online. Our evaluation on both a PC and an Android device shows that
(i) SpaceMac's algorithms can be computed quickly and efficiently, and (ii) our
cooperative defense scheme has low computation and significantly lower
communication overhead than other comparable state-of-the-art schemes.
|
[
{
"version": "v1",
"created": "Thu, 17 Feb 2011 06:23:30 GMT"
},
{
"version": "v2",
"created": "Fri, 18 Feb 2011 01:24:53 GMT"
},
{
"version": "v3",
"created": "Tue, 13 Sep 2011 17:58:21 GMT"
},
{
"version": "v4",
"created": "Thu, 15 Sep 2011 19:22:12 GMT"
},
{
"version": "v5",
"created": "Fri, 16 Sep 2011 00:06:22 GMT"
}
] | 2011-09-19T00:00:00 |
[
[
"Le",
"Anh",
""
],
[
"Markopoulou",
"Athina",
""
]
] |
new_dataset
| 0.997173 |
1109.2696
|
Quentin Godfroy
|
Cyril Gavoille (LaBRI, INRIA Bordeaux - Sud-Ouest, IUF), Quentin
Godfroy (LaBRI), Laurent Viennot (INRIA Rocquencourt)
|
Node-Disjoint Multipath Spanners and their Relationship with
Fault-Tolerant Spanners
| null | null | null | null |
cs.NI cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by multipath routing, we introduce a multi-connected variant of
spanners. For that purpose we introduce the $p$-multipath cost between two
nodes $u$ and $v$ as the minimum weight of a collection of $p$ internally
vertex-disjoint paths between $u$ and $v$. Given a weighted graph $G$, a
subgraph $H$ is a $p$-multipath $s$-spanner if for all $u,v$, the $p$-multipath
cost between $u$ and $v$ in $H$ is at most $s$ times the $p$-multipath cost in
$G$. The $s$ factor is called the stretch. Building upon recent results on
fault-tolerant spanners, we show how to build $p$-multipath spanners of
constant stretch and of $\tO(n^{1+1/k})$ edges, for fixed parameters $p$ and
$k$, $n$ being the number of nodes of the graph. Such spanners can be
constructed by a distributed algorithm running in $O(k)$ rounds. Additionally,
we give an improved construction for the case $p=k=2$. Our spanner $H$ has
$O(n^{3/2})$ edges and the $p$-multipath cost in $H$ between any two node is at
most twice the corresponding one in $G$ plus $O(W)$, $W$ being the maximum edge
weight.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2011 07:43:17 GMT"
},
{
"version": "v2",
"created": "Fri, 16 Sep 2011 19:30:51 GMT"
}
] | 2011-09-19T00:00:00 |
[
[
"Gavoille",
"Cyril",
"",
"LaBRI, INRIA Bordeaux - Sud-Ouest, IUF"
],
[
"Godfroy",
"Quentin",
"",
"LaBRI"
],
[
"Viennot",
"Laurent",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.999111 |
1109.3650
|
Rohan Agrawal
|
Rohan Agrawal
|
Bi-Objective Community Detection (BOCD) in Networks using Genetic
Algorithm
|
11 pages, 3 Figures, 3 Tables. arXiv admin note: substantial text
overlap with arXiv:0906.0612
| null |
10.1007/978-3-642-22606-9_5
| null |
cs.SI cs.AI cs.NE physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A lot of research effort has been put into community detection from all
corners of academic interest such as physics, mathematics and computer science.
In this paper I have proposed a Bi-Objective Genetic Algorithm for community
detection which maximizes modularity and community score. Then the results
obtained for both benchmark and real life data sets are compared with other
algorithms using the modularity and MNI performance metrics. The results show
that the BOCD algorithm is capable of successfully detecting community
structure in both real life and synthetic datasets, as well as improving upon
the performance of previous techniques.
|
[
{
"version": "v1",
"created": "Fri, 16 Sep 2011 15:48:29 GMT"
}
] | 2011-09-19T00:00:00 |
[
[
"Agrawal",
"Rohan",
""
]
] |
new_dataset
| 0.991226 |
1109.3317
|
Ayatullah Faruk Mollah
|
Ayatullah Faruk Mollah, Nabamita Majumder, Subhadip Basu, Mita
Nasipuri
|
Design of an Optical Character Recognition System for Camera-based
Handheld Devices
| null |
Int'l J. of Computer Science Issues, Vol. 8, Issue 4, pp. 283-289,
July 2011
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a complete Optical Character Recognition (OCR) system for
camera captured image/graphics embedded textual documents for handheld devices.
At first, text regions are extracted and skew corrected. Then, these regions
are binarized and segmented into lines and characters. Characters are passed
into the recognition module. Experimenting with a set of 100 business card
images, captured by cell phone camera, we have achieved a maximum recognition
accuracy of 92.74%. Compared to Tesseract, an open source desktop-based
powerful OCR engine, present recognition accuracy is worth contributing.
Moreover, the developed technique is computationally efficient and consumes low
memory so as to be applicable on handheld devices.
|
[
{
"version": "v1",
"created": "Thu, 15 Sep 2011 11:24:41 GMT"
}
] | 2011-09-16T00:00:00 |
[
[
"Mollah",
"Ayatullah Faruk",
""
],
[
"Majumder",
"Nabamita",
""
],
[
"Basu",
"Subhadip",
""
],
[
"Nasipuri",
"Mita",
""
]
] |
new_dataset
| 0.985827 |
1109.2489
|
Geo Taglioni
|
Anina Weber, Geo Taglioni
|
Swiss Elections to the National Council: First trials with e-voting in
elections at federal level
| null | null | null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
On October 23rd 2011, around 22'000 voters will be authorized to cast their
votes electronically in occasion of the elections to the National Council.
These are the first trials ever with e-voting in elections at federal level in
Switzerland. Four cantons are going to conduct trials with this new channel.
Only Swiss voters living abroad will be authorized to participate. The Swiss
Confederation pursues the long term goal of the introduction of e-voting as a
third, complementary voting method - in addition to voting in person at the
polling station and postal voting.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2011 15:03:01 GMT"
},
{
"version": "v2",
"created": "Wed, 14 Sep 2011 12:59:54 GMT"
}
] | 2011-09-15T00:00:00 |
[
[
"Weber",
"Anina",
""
],
[
"Taglioni",
"Geo",
""
]
] |
new_dataset
| 0.990379 |
1109.3150
|
Abhishek Sinha
|
Abhishek Sinha, Swagatam Das, Athanasios V. Vasilakos
|
On Periodic Node Deployment in Wireless Sensor Networks: A Statistical
Analysis
|
Submitted for review in Journal of Network and Systems Management
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Rapid progress made in the field of sensor technology, wireless
communication, and computer networks in recent past, led to the development of
wireless Ad-hoc sensor networks, consisting of small, low-cost sensors, which
can monitor wide and remote areas with precision and liveliness unseen to the
date without the intervention of a human operator. This work comes up with a
stochastic model for periodic sensor-deployment (in face of their limited
amount of battery-life) to maintain a minimal node-connectivity in wireless
sensor networks. The node deployment cannot be modeled by using results from
conventional continuous birth-death process, since new nodes are added to the
network in bursts, i.e. the birth process is not continuous in practical
situations. We analyze the periodic node deployment process using discrete
birth-continuous death process and obtain two important statistical measures of
the existing number of nodes in the network, namely the mean and variance. We
show that the above mentioned sequences of mean and variances always converge
to finite steady state values, thus ensuring the stability of the system. We
also develop a cost function for the process of periodic deployment of sensor
nodes and minimize it to find the optimal time ({\tau}) and optimum number of
re-deployment (q) for maintaining minimum connectivity in the network.
|
[
{
"version": "v1",
"created": "Wed, 14 Sep 2011 17:51:36 GMT"
}
] | 2011-09-15T00:00:00 |
[
[
"Sinha",
"Abhishek",
""
],
[
"Das",
"Swagatam",
""
],
[
"Vasilakos",
"Athanasios V.",
""
]
] |
new_dataset
| 0.999354 |
1107.4530
|
John B. Little
|
John B. Little
|
Remarks on generalized toric codes
|
14 pages, 4 figures Version 2 corrects some typos, adds a new
reference
| null | null | null |
cs.IT math.AG math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This note presents some new information on how the minimum distance of the
generalized toric code corresponding to a fixed set of integer lattice points S
in R^2 varies with the base field. The main results show that in some cases,
over sufficiently large fields, the minimum distance of the code corresponding
to a set S will be the same as that of the code corresponding to the convex
hull of S. In an example, we will also discuss a [49,12,28] generalized toric
code over GF(8), better than any previously known code according to M. Grassl's
online tables, as of July 2011.
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2011 14:35:02 GMT"
},
{
"version": "v2",
"created": "Mon, 12 Sep 2011 21:35:17 GMT"
}
] | 2011-09-14T00:00:00 |
[
[
"Little",
"John B.",
""
]
] |
new_dataset
| 0.997842 |
1108.2700
|
Paul Ginsparg
|
Paul Ginsparg (Cornell University)
|
It was twenty years ago today ...
|
9 pages. v2: additional edifying comments interspersed throughout
| null | null | null |
cs.DL astro-ph.IM cond-mat.other gr-qc hep-ph hep-th math.HO physics.soc-ph quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To mark the 20th anniversary of the (14 Aug 1991) commencement of
[email protected] (now arXiv.org), I've adapted this article from one that
first appeared in Physics World (2008), was later reprinted (with permission)
in Learned Publishing (2009), but never appeared in arXiv. I trace some
historical context and early development of the resource, its later trajectory,
and close with some thoughts about the future.
This version is closer to my original draft, with some updates for this
occasion, plus an astounding $2^5$ added footnotes.
|
[
{
"version": "v1",
"created": "Sun, 14 Aug 2011 22:34:32 GMT"
},
{
"version": "v2",
"created": "Tue, 13 Sep 2011 02:40:53 GMT"
}
] | 2011-09-14T00:00:00 |
[
[
"Ginsparg",
"Paul",
"",
"Cornell University"
]
] |
new_dataset
| 0.979617 |
1109.2654
|
EPTCS
|
Enrique Mart\'inez (University of Castilla-La Mancha), M. Emilia
Cambronero (University of Castilla-La Mancha), Gregorio D\'iaz (University of
Castilla-La Mancha), Gerardo Schneider (Chalmers | University of Gothenburg)
|
Timed Automata Semantics for Visual e-Contracts
|
In Proceedings FLACOS 2011, arXiv:1109.2399
|
EPTCS 68, 2011, pp. 7-21
|
10.4204/EPTCS.68.3
| null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
C-O Diagrams have been introduced as a means to have a more visual
representation of electronic contracts, where it is possible to represent the
obligations, permissions and prohibitions of the different signatories, as well
as what are the penalties in case of not fulfillment of their obligations and
prohibitions. In such diagrams we are also able to represent absolute and
relative timing constraints. In this paper we present a formal semantics for
C-O Diagrams based on timed automata extended with an ordering of states and
edges in order to represent different deontic modalities.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2011 01:25:23 GMT"
}
] | 2011-09-14T00:00:00 |
[
[
"Martínez",
"Enrique",
"",
"University of Castilla-La Mancha"
],
[
"Cambronero",
"M. Emilia",
"",
"University of Castilla-La Mancha"
],
[
"Díaz",
"Gregorio",
"",
"University of\n Castilla-La Mancha"
],
[
"Schneider",
"Gerardo",
"",
"Chalmers | University of Gothenburg"
]
] |
new_dataset
| 0.995993 |
1109.2655
|
EPTCS
|
Adrian Francalanza Ph.D (University of Malta), Andrew Gauci M.Sc
(University of Malta), Gordon Pace Ph.D (University of Malta)
|
Distributed System Contract Monitoring
|
In Proceedings FLACOS 2011, arXiv:1109.2399
|
EPTCS 68, 2011, pp. 23-37
|
10.4204/EPTCS.68.4
| null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The use of behavioural contracts, to specify, regulate and verify systems, is
particularly relevant to runtime monitoring of distributed systems. System
distribution poses major challenges to contract monitoring, from
monitoring-induced information leaks to computation load balancing,
communication overheads and fault-tolerance. We present mDPi, a location-aware
process calculus, for reasoning about monitoring of distributed systems. We
define a family of Labelled Transition Systems for this calculus, which allow
formal reasoning about different monitoring strategies at different levels of
abstractions. We also illustrate the expressivity of the calculus by showing
how contracts in a simple contract language can be synthesised into different
mDPi monitors.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2011 01:25:29 GMT"
}
] | 2011-09-14T00:00:00 |
[
[
"D",
"Adrian Francalanza Ph.",
"",
"University of Malta"
],
[
"Sc",
"Andrew Gauci M.",
"",
"University of Malta"
],
[
"D",
"Gordon Pace Ph.",
"",
"University of Malta"
]
] |
new_dataset
| 0.97779 |
1109.2684
|
Sali Emruli
|
Sali Emruli, Tahir Zejneli and Florin Agai
|
YouTube and political communication -- Macedonian case
|
IJCSI International Journal of Computer Science Issues, Vol. 8, Issue
4, No 1, July 2011 ISSN (Online): 1694-0814 http://www.IJCSI.org
| null | null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analysis how to use Internet influence to the process of political
communication, marketing and the management of public relations, what kind of
online communication methods are used by political parties, and to assess
satisfaction, means of communication and the services they provide to their
party's voters (people) and other interest groups and whether social networks
can affect the political and economic changes in the state, and the political
power of one party.
|
[
{
"version": "v1",
"created": "Tue, 13 Sep 2011 07:03:56 GMT"
}
] | 2011-09-14T00:00:00 |
[
[
"Emruli",
"Sali",
""
],
[
"Zejneli",
"Tahir",
""
],
[
"Agai",
"Florin",
""
]
] |
new_dataset
| 0.996302 |
0909.3976
|
Vadim Madgazin
|
Vadim R. Madgazin
|
The Information Theory of Emotions of Musical Chords
|
18 pages, 2 figures, in English, and copy in Russian
| null | null | null |
cs.SD q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper offers a solution to the centuries-old puzzle - why the major
chords are perceived as happy and the minor chords as sad - based on the
information theory of emotions. A theory and a formula of musical emotions were
created. They define the sign and the amplitude of the utilitarian emotional
coloration of separate major and minor chords through relative pitches of
constituent sounds. Keywords: chord, major, minor, the formula of musical
emotions, the information theory of emotions.
|
[
{
"version": "v1",
"created": "Tue, 22 Sep 2009 12:24:19 GMT"
},
{
"version": "v2",
"created": "Sat, 10 Sep 2011 12:02:21 GMT"
}
] | 2011-09-13T00:00:00 |
[
[
"Madgazin",
"Vadim R.",
""
]
] |
new_dataset
| 0.992192 |
1104.4656
|
Deniz Sarioz
|
Radoslav Fulek, Noushin Saeedi and Deniz Sarioz
|
Convex obstacle numbers of outerplanar graphs and bipartite permutation
graphs
|
11 pages, 6 figures
| null | null | null |
cs.DM cs.CG math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The disjoint convex obstacle number of a graph G is the smallest number h
such that there is a set of h pairwise disjoint convex polygons (obstacles) and
a set of n points in the plane (corresponding to V(G)) so that a vertex pair uv
is an edge if and only if the corresponding segment uv does not meet any
obstacle.
We show that the disjoint convex obstacle number of an outerplanar graph is
always at most 5, and of a bipartite permutation graph at most 4. The former
answers a question raised by Alpert, Koch, and Laison. We complement the upper
bound for outerplanar graphs with the lower bound of 4.
|
[
{
"version": "v1",
"created": "Sun, 24 Apr 2011 21:45:28 GMT"
},
{
"version": "v2",
"created": "Tue, 26 Apr 2011 00:34:43 GMT"
},
{
"version": "v3",
"created": "Mon, 12 Sep 2011 19:22:18 GMT"
}
] | 2011-09-13T00:00:00 |
[
[
"Fulek",
"Radoslav",
""
],
[
"Saeedi",
"Noushin",
""
],
[
"Sarioz",
"Deniz",
""
]
] |
new_dataset
| 0.999784 |
1109.2155
|
S. Kambhampati
|
S. Kambhampati, M.H.L. van den Briel
|
Optiplan: Unifying IP-based and Graph-based Planning
| null |
Journal Of Artificial Intelligence Research, Volume 24, pages
919-931, 2005
|
10.1613/jair.1698
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Optiplan planning system is the first integer programming-based planner
that successfully participated in the international planning competition. This
engineering note describes the architecture of Optiplan and provides the
integer programming formulation that enabled it to perform reasonably well in
the competition. We also touch upon some recent developments that make integer
programming encodings significantly more competitive.
|
[
{
"version": "v1",
"created": "Fri, 9 Sep 2011 20:43:37 GMT"
}
] | 2011-09-13T00:00:00 |
[
[
"Kambhampati",
"S.",
""
],
[
"Briel",
"M. H. L. van den",
""
]
] |
new_dataset
| 0.976455 |
1109.2247
|
Robert Kent
|
Robert E. Kent
|
The Standard Aspect of Dialectical Logic
|
An abstracted version of this paper, entitled "Dialectical Program
Semantics", was accepted for presentation at the 1st International Conference
on Algebraic Methodology and Software Technology (AMAST'89), University of
Iowa, Iowa City, Iowa, 1989
| null | null | null |
cs.LO cs.PL math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Dialectical logic is the logic of dialectical processes. The goal of
dialectical logic is to introduce dynamic notions into logical computational
systems. The fundamental notions of proposition and truth-value in standard
logic are subsumed by the notions of process and flow in dialectical logic.
Dialectical logic has a standard aspect, which can be defined in terms of the
"local cartesian closure" of subtypes. The standard aspect of dialectical logic
provides a natural program semantics which incorporates Hoare's
precondition/postcondition semantics and extends the standard Kripke semantics
of dynamic logic. The goal of the standard aspect of dialectical logic is to
unify the logic of small-scale and large-scale programming.
|
[
{
"version": "v1",
"created": "Sat, 10 Sep 2011 18:23:07 GMT"
}
] | 2011-09-13T00:00:00 |
[
[
"Kent",
"Robert E.",
""
]
] |
new_dataset
| 0.982696 |
1109.2417
|
Sali Emruli
|
Sali Emruli and Miroslav Baca
|
Internet and political communication - Macedonian case
| null |
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 3, No. 1, May 2011
| null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analysis how to use Internet influence to the process of political
communication, marketing and the management of public relations, what kind of
online communication methods are used by political parties, and to assess
satisfaction, means of communication and the services they provide to their
partys voters (people) and other interest groups and whether social networks
can affect the political and economic changes in the state, and the political
power of one party.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2011 09:48:41 GMT"
}
] | 2011-09-13T00:00:00 |
[
[
"Emruli",
"Sali",
""
],
[
"Baca",
"Miroslav",
""
]
] |
new_dataset
| 0.992144 |
1109.2418
|
Sali Emruli
|
Sali Emruli, Tahir Zejneli and Florin Agai
|
Facebook and political communication -- Macedonian case
| null |
IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 4, No 1, July 2011, 451-459
| null | null |
cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Analysis how to use Internet influence to the process of political
communication, marketing and the management of public relations, what kind of
online communication methods are used by political parties, and to assess
satisfaction, means of communication and the services they provide to their
partys voters (people) and other interest groups and whether social networks
can affect the political and economic changes in the state, and the political
power of one party.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2011 09:53:18 GMT"
}
] | 2011-09-13T00:00:00 |
[
[
"Emruli",
"Sali",
""
],
[
"Zejneli",
"Tahir",
""
],
[
"Agai",
"Florin",
""
]
] |
new_dataset
| 0.997591 |
1109.2430
|
Prasenjit Chanak
|
Indrajit Banerjee, Prasenjit Chanak, Hafizur Rahaman
|
CCABC: Cyclic Cellular Automata Based Clustering For Energy Conservation
in Sensor Networks
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Sensor network has been recognized as the most significant technology for
next century. Despites of its potential application, wireless sensor network
encounters resource restriction such as low power, reduced bandwidth and
specially limited power sources. This work proposes an efficient technique for
the conservation of energy in a wireless sensor network (WSN) by forming an
effective cluster of the network nodes distributed over a wide range of
geographical area. The clustering scheme is developed around a specified class
of cellular automata (CA) referred to as the modified cyclic cellular automata
(mCCA). It sets a number of nodes in stand-by mode at an instance of time
without compromising the area of network coverage and thereby conserves the
battery power. The proposed scheme also determines an effective cluster size
where the inter-cluster and intra-cluster communication cost is minimum. The
simulation results establish that the cyclic cellular automata based clustering
for energy conservation in sensor networks (CCABC) is more reliable than the
existing schemes where clustering and CA based energy saving technique is used.
|
[
{
"version": "v1",
"created": "Mon, 12 Sep 2011 11:05:21 GMT"
}
] | 2011-09-13T00:00:00 |
[
[
"Banerjee",
"Indrajit",
""
],
[
"Chanak",
"Prasenjit",
""
],
[
"Rahaman",
"Hafizur",
""
]
] |
new_dataset
| 0.997184 |
1109.1681
|
Gabriele Nebe
|
Gabriele Nebe
|
On extremal self-dual ternary codes of length 48
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
All extremal ternary codes of length 48 that have some automorphism of prime
order $p\geq 5$ are equivalent to one of the two known codes, the Pless code or
the extended quadratic residue code.
|
[
{
"version": "v1",
"created": "Thu, 8 Sep 2011 10:22:02 GMT"
}
] | 2011-09-09T00:00:00 |
[
[
"Nebe",
"Gabriele",
""
]
] |
new_dataset
| 0.999023 |
1109.1525
|
Robert Kent
|
Robert E. Kent
|
Conceptual Knowledge Markup Language: The central core
|
Presented at the Twelfth Workshop on Knowledge Acquisition, Modeling
and Management (KAW'99), 1999
| null | null | null |
cs.DL cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The conceptual knowledge framework OML/CKML needs several components for a
successful design. One important, but previously overlooked, component is the
central core of OML/CKML. The central core provides a theoretical link between
the ontological specification in OML and the conceptual knowledge
representation in CKML. This paper discusses the formal semantics and syntactic
styles of the central core, and also the important role it plays in defining
interoperability between OML/CKML, RDF/S and Ontolingua.
|
[
{
"version": "v1",
"created": "Wed, 7 Sep 2011 18:09:49 GMT"
}
] | 2011-09-08T00:00:00 |
[
[
"Kent",
"Robert E.",
""
]
] |
new_dataset
| 0.99243 |
1106.2530
|
Marats Golovkins
|
Marats Golovkins, Maksim Kravtsev, and Vasilijs Kravcevs
|
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial
Idempotent Languages
|
30 pages, 3 figures
|
MFCS 2011, Lecture Notes in Computer Science, Vol. 6907, pp.
351-363, 2011
| null | null |
cs.FL quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the recognition of R-trivial idempotent (R1) languages by various
models of "decide-and-halt" quantum finite automata (QFA) and probabilistic
reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model
which generalizes both Nayak's enhanced QFA and DH-PRA. We apply tools from
algebraic automata theory and systems of linear inequalities to give a complete
characterization of R1 languages recognized by all these models. We also find
that "forbidden constructions" known so far do not include all of the languages
that cannot be recognized by measure-many QFA.
|
[
{
"version": "v1",
"created": "Mon, 13 Jun 2011 19:37:22 GMT"
}
] | 2011-09-07T00:00:00 |
[
[
"Golovkins",
"Marats",
""
],
[
"Kravtsev",
"Maksim",
""
],
[
"Kravcevs",
"Vasilijs",
""
]
] |
new_dataset
| 0.998829 |
1109.1247
|
Vikas Dongre
|
Vikas J Dongre, Vijay H Mankar
|
Devnagari document segmentation using histogram approach
|
8 pages; 4 figures; 8 tables; journal paper: International Journal of
Computer Science, Engineering and Information Technology (IJCSEIT), Vol.1,
No.3, August 2011
|
International Journal of Computer Science, Engineering and
Information Technology (IJCSEIT), Vol.1, No.3, 2011, 46-53
|
10.5121/ijcseit.2011.1305
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Document segmentation is one of the critical phases in machine recognition of
any language. Correct segmentation of individual symbols decides the accuracy
of character recognition technique. It is used to decompose image of a sequence
of characters into sub images of individual symbols by segmenting lines and
words. Devnagari is the most popular script in India. It is used for writing
Hindi, Marathi, Sanskrit and Nepali languages. Moreover, Hindi is the third
most popular language in the world. Devnagari documents consist of vowels,
consonants and various modifiers. Hence proper segmentation of Devnagari word
is challenging. A simple histogram based approach to segment Devnagari
documents is proposed in this paper. Various challenges in segmentation of
Devnagari script are also discussed.
|
[
{
"version": "v1",
"created": "Tue, 6 Sep 2011 17:56:58 GMT"
}
] | 2011-09-07T00:00:00 |
[
[
"Dongre",
"Vikas J",
""
],
[
"Mankar",
"Vijay H",
""
]
] |
new_dataset
| 0.999587 |
1104.3152
|
Christopher Marriott
|
Chris Marriott and Carlos Gershenson
|
Polyethism in a colony of artificial ants
|
8 pages, 4 figures, submitted to ECAL 11
|
Advances in Artificial Life, ECAL 2011: Proceedings of the
Eleventh European Conference on the Synthesis and Simulation of Living
Systems, pp. 498-505, 2011
| null |
C3 Report 2011.03
|
cs.AI nlin.AO q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore self-organizing strategies for role assignment in a foraging task
carried out by a colony of artificial agents. Our strategies are inspired by
various mechanisms of division of labor (polyethism) observed in eusocial
insects like ants, termites, or bees. Specifically we instantiate models of
caste polyethism and age or temporal polyethism to evaluated the benefits to
foraging in a dynamic environment. Our experiment is directly related to the
exploration/exploitation trade of in machine learning.
|
[
{
"version": "v1",
"created": "Fri, 15 Apr 2011 20:24:54 GMT"
}
] | 2011-09-06T00:00:00 |
[
[
"Marriott",
"Chris",
""
],
[
"Gershenson",
"Carlos",
""
]
] |
new_dataset
| 0.999245 |
1109.0827
|
Vijayvaradharaj Muralidharan
|
Vijayvaradharaj T Muralidharan, B. Sundar Rajan
|
A Trellis Coded Modulation Scheme for the Fading Relay Channel
|
18 pages, 17 figures, 2 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A decode and forward protocol based Trellis Coded Modulation (TCM) scheme for
the half-duplex relay channel, in a Rayleigh fading environment, is presented.
The proposed scheme can achieve any spectral efficiency greater than or equal
to one bit per channel use (bpcu). A near-ML decoder for the suggested TCM
scheme is proposed. It is shown that the high SNR performance of this near-ML
decoder approaches the performance of the optimal ML decoder. The high SNR
performance of this near-ML decoder is independent of the strength of the
Source-Relay link and approaches the performance of the optimal ML decoder with
an ideal Source-Relay link. Based on the derived Pair-wise Error Probability
(PEP) bounds, design criteria to maximize the diversity and coding gains are
obtained. Simulation results show a large gain in SNR for the proposed TCM
scheme over uncoded communication as well as the direct transmission without
the relay. Also, it is shown that even for the uncoded transmission scheme, the
choice of the labelling scheme (mapping from bits to complex symbols) used at
the source and the relay significantly impacts the BER vs SNR performance. We
provide a good labelling scheme for $2^l$-PSK signal set, where $l\geq 2$ is an
integer.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2011 08:23:06 GMT"
}
] | 2011-09-06T00:00:00 |
[
[
"Muralidharan",
"Vijayvaradharaj T",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.979639 |
1109.0971
|
Prateek Mittal
|
Prateek Mittal, Matthew Caesar, Nikita Borisov
|
X-Vine: Secure and Pseudonymous Routing Using Social Networks
|
15 pages
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed hash tables suffer from several security and privacy
vulnerabilities, including the problem of Sybil attacks. Existing social
network-based solutions to mitigate the Sybil attacks in DHT routing have a
high state requirement and do not provide an adequate level of privacy. For
instance, such techniques require a user to reveal their social network
contacts. We design X-Vine, a protection mechanism for distributed hash tables
that operates entirely by communicating over social network links. As with
traditional peer-to-peer systems, X-Vine provides robustness, scalability, and
a platform for innovation. The use of social network links for communication
helps protect participant privacy and adds a new dimension of trust absent from
previous designs. X-Vine is resilient to denial of service via Sybil attacks,
and in fact is the first Sybil defense that requires only a logarithmic amount
of state per node, making it suitable for large-scale and dynamic settings.
X-Vine also helps protect the privacy of users social network contacts and
keeps their IP addresses hidden from those outside of their social circle,
providing a basis for pseudonymous communication. We first evaluate our design
with analysis and simulations, using several real world large-scale social
networking topologies. We show that the constraints of X-Vine allow the
insertion of only a logarithmic number of Sybil identities per attack edge; we
show this mitigates the impact of malicious attacks while not affecting the
performance of honest nodes. Moreover, our algorithms are efficient, maintain
low stretch, and avoid hot spots in the network. We validate our design with a
PlanetLab implementation and a Facebook plugin.
|
[
{
"version": "v1",
"created": "Mon, 5 Sep 2011 18:05:25 GMT"
}
] | 2011-09-06T00:00:00 |
[
[
"Mittal",
"Prateek",
""
],
[
"Caesar",
"Matthew",
""
],
[
"Borisov",
"Nikita",
""
]
] |
new_dataset
| 0.977167 |
1109.0456
|
EPTCS
|
Roberto Di Cosmo (Univ Paris Diderot, Sorbonne Paris Cite, and INRIA
Rocquencourt, Paris, France), Olivier Lhomme (IBM France, Sophia Antipolis,
France), Claude Michel (I3S (UNS-CNRS), Sophia Antipolis Cedex, France)
|
Aligning component upgrades
|
In Proceedings LoCoCo 2011, arXiv:1108.6097
|
EPTCS 65, 2011, pp. 1-11
|
10.4204/EPTCS.65.1
| null |
cs.SE cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Modern software systems, like GNU/Linux distributions or Eclipse-based
development environment, are often deployed by selecting components out of
large component repositories. Maintaining such software systems by performing
component upgrades is a complex task, and the users need to have an expressive
preferences language at their disposal to specify the kind of upgrades they are
interested in. Recent research has shown that it is possible to develop solvers
that handle preferences expressed as a combination of a few basic criteria used
in the MISC competition, ranging from the number of new components to the
freshness of the final configuration. In this work we introduce a set of new
criteria that allow the users to specify their preferences for solutions with
components aligned to the same upstream sources, provide an efficient encoding
and report on the experimental results that prove that optimising these
alignment criteria is a tractable problem in practice.
|
[
{
"version": "v1",
"created": "Thu, 1 Sep 2011 07:34:01 GMT"
}
] | 2011-09-05T00:00:00 |
[
[
"Di Cosmo",
"Roberto",
"",
"Univ Paris Diderot, Sorbonne Paris Cite, and INRIA\n Rocquencourt, Paris, France"
],
[
"Lhomme",
"Olivier",
"",
"IBM France, Sophia Antipolis,\n France"
],
[
"Michel",
"Claude",
"",
"I3S"
]
] |
new_dataset
| 0.971645 |
1101.1895
|
Jean-Claude Belfiore
|
Patrick Sol\'e and Jean-Claude Belfiore
|
Constructive spherical codes near the Shannon bound
|
11 pages, 2 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Shannon gave a lower bound in 1959 on the binary rate of spherical codes of
given minimum Euclidean distance $\rho$. Using nonconstructive codes over a
finite alphabet, we give a lower bound that is weaker but very close for small
values of $\rho$. The construction is based on the Yaglom map combined with
some finite sphere packings obtained from nonconstructive codes for the
Euclidean metric. Concatenating geometric codes meeting the TVZ bound with a
Lee metric BCH code over $GF(p),$ we obtain spherical codes that are polynomial
time constructible. Their parameters outperform those obtained by Lachaud and
Stern in 1994. At very high rate they are above 98 per cent of the Shannon
bound.
|
[
{
"version": "v1",
"created": "Mon, 10 Jan 2011 17:26:33 GMT"
},
{
"version": "v2",
"created": "Thu, 1 Sep 2011 08:56:14 GMT"
}
] | 2011-09-02T00:00:00 |
[
[
"Solé",
"Patrick",
""
],
[
"Belfiore",
"Jean-Claude",
""
]
] |
new_dataset
| 0.9864 |
1108.5148
|
Mohammad Iftekhar Husain
|
Mohammad Iftekhar Husain, Suyash Mahant, Ramalingam Sridhar
|
CD-PHY: Physical Layer Security in Wireless Networks through
Constellation Diversity
|
9 pages, 15 figures
| null | null | null |
cs.CR cs.CC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A common approach for introducing security at the physical layer is to rely
on the channel variations of the wireless environment. This type of approach is
not always suitable for wireless networks where the channel remains static for
most of the network lifetime. For these scenarios, a channel independent
physical layer security measure is more appropriate which will rely on a secret
known to the sender and the receiver but not to the eavesdropper. In this
paper, we propose CD-PHY, a physical layer security technique that exploits the
constellation diversity of wireless networks which is independent of the
channel variations. The sender and the receiver use a custom bit sequence to
constellation symbol mapping to secure the physical layer communication which
is not known a priori to the eavesdropper. Through theoretical modeling and
experimental simulation, we show that this information theoretic construct can
achieve Shannon secrecy and any brute force attack from the eavesdropper incurs
high overhead and minuscule probability of success. Our results also show that
the high bit error rate also makes decoding practically infeasible for the
eavesdropper, thus securing the communication between the sender and receiver.
|
[
{
"version": "v1",
"created": "Thu, 25 Aug 2011 18:26:44 GMT"
}
] | 2011-09-02T00:00:00 |
[
[
"Husain",
"Mohammad Iftekhar",
""
],
[
"Mahant",
"Suyash",
""
],
[
"Sridhar",
"Ramalingam",
""
]
] |
new_dataset
| 0.999685 |
1109.0077
|
Sheikh Shanawaz Mostafa
|
Sheikh Shanawaz Mostafa, Md. Mahbub Hossian, Khondker Jahid Reza and
Gazi Maniur Rashid
|
A Radio Based Intelligent Railway Grade Crossing System to Avoid
Collision
|
5 pages,4 figures, International Journal of Computer Science Issues,
Vol. 7, Issue 6, November 2010
| null | null | null |
cs.SY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Railway grade crossing is become the major headache for the transportation
system. This paper describes an intelligent railway crossing control system for
multiple tracks that features a controller which receives messages from
incoming and outgoing trains by sensors. These messages contain detail
information including the direction and identity of a train. Depending on those
messages the controller device decides whenever the railroad crossing gate will
close or open.
|
[
{
"version": "v1",
"created": "Thu, 1 Sep 2011 03:18:32 GMT"
}
] | 2011-09-02T00:00:00 |
[
[
"Mostafa",
"Sheikh Shanawaz",
""
],
[
"Hossian",
"Md. Mahbub",
""
],
[
"Reza",
"Khondker Jahid",
""
],
[
"Rashid",
"Gazi Maniur",
""
]
] |
new_dataset
| 0.998253 |
1109.0264
|
Dimitris S. Papailiopoulos
|
Dimitris S. Papailiopoulos, Jianqiang Luo, Alexandros G. Dimakis,
Cheng Huang, and Jin Li
|
Simple Regenerating Codes: Network Coding for Cloud Storage
|
9 pages, 10 figures, submitted for publication
| null | null | null |
cs.IT cs.DC cs.NI math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network codes designed specifically for distributed storage systems have the
potential to provide dramatically higher storage efficiency for the same
availability. One main challenge in the design of such codes is the exact
repair problem: if a node storing encoded information fails, in order to
maintain the same level of reliability we need to create encoded information at
a new node. One of the main open problems in this emerging area has been the
design of simple coding schemes that allow exact and low cost repair of failed
nodes and have high data rates. In particular, all prior known explicit
constructions have data rates bounded by 1/2.
In this paper we introduce the first family of distributed storage codes that
have simple look-up repair and can achieve arbitrarily high rates. Our
constructions are very simple to implement and perform exact repair by simple
XORing of packets. We experimentally evaluate the proposed codes in a realistic
cloud storage simulator and show significant benefits in both performance and
reliability compared to replication and standard Reed-Solomon codes.
|
[
{
"version": "v1",
"created": "Thu, 1 Sep 2011 19:10:38 GMT"
}
] | 2011-09-02T00:00:00 |
[
[
"Papailiopoulos",
"Dimitris S.",
""
],
[
"Luo",
"Jianqiang",
""
],
[
"Dimakis",
"Alexandros G.",
""
],
[
"Huang",
"Cheng",
""
],
[
"Li",
"Jin",
""
]
] |
new_dataset
| 0.9936 |
1011.5534
|
Dhananjoy Dey
|
Dhananjoy Dey, Prasanna Raghaw Mishra1, Indranath Sengupta
|
GB-hash : Hash Functions Using Groebner Basis
|
The paper has been withdrawn. The authors have found some weaknesses
in this design
| null | null | null |
cs.CR math.AC
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper we present an improved version of HF-hash, viz., GB-hash : Hash
Functions Using Groebner Basis. In case of HF-hash, the compression function
consists of 32 polynomials with 64 variables which were taken from the first 32
polynomials of hidden field equations challenge-1 by forcing last 16 variables
as 0. In GB-hash we have designed the compression function in such way that
these 32 polynomials with 64 variables form a minimal Groebner basis of the
ideal generated by them with respect to graded lexicographical (grlex) ordering
as well as with respect to graded reverse lexicographical (grevlex) ordering.
In this paper we will prove that GB-hash is more secure than HF-hash as well as
more secure than SHA-256. We have also compared the efficiency of our GB-hash
with SHA-256 and HF-hash.
|
[
{
"version": "v1",
"created": "Thu, 25 Nov 2010 00:14:19 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Aug 2011 05:04:51 GMT"
}
] | 2011-08-31T00:00:00 |
[
[
"Dey",
"Dhananjoy",
""
],
[
"Mishra1",
"Prasanna Raghaw",
""
],
[
"Sengupta",
"Indranath",
""
]
] |
new_dataset
| 0.998302 |
1108.5667
|
Stef De Pooter
|
Stef De Pooter, Johan Wittocx and Marc Denecker
|
A prototype of a knowledge-based programming environment
|
6 pages, appears in the Proceedings of the 19th International
Conference on Applications of Declarative Programming and Knowledge
Management (INAP 2011)
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a proposal for a knowledge-based programming
environment. In such an environment, declarative background knowledge,
procedures, and concrete data are represented in suitable languages and
combined in a flexible manner. This leads to a highly declarative programming
style. We illustrate our approach on an example and report about our prototype
implementation.
|
[
{
"version": "v1",
"created": "Mon, 29 Aug 2011 17:38:33 GMT"
}
] | 2011-08-31T00:00:00 |
[
[
"De Pooter",
"Stef",
""
],
[
"Wittocx",
"Johan",
""
],
[
"Denecker",
"Marc",
""
]
] |
new_dataset
| 0.998795 |
1108.5720
|
Michael Noelle
|
Michael N\"olle and Martin Suda
|
Conjugate Variables as a Resource in Signal and Image Processing
|
22 pages, 2 tables, 6 figures
| null | null | null |
cs.CV physics.data-an quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we develop a new technique to model joint distributions of
signals. Our technique is based on quantum mechanical conjugate variables. We
show that the transition probability of quantum states leads to a distance
function on the signals. This distance function obeys the triangle inequality
on all quantum states and becomes a metric on pure quantum states. Treating
signals as conjugate variables allows us to create a new approach to segment
them.
Keywords: Quantum information, transition probability, Euclidean distance,
Fubini-study metric, Bhattacharyya coefficients, conjugate variable,
signal/sensor fusion, signal and image segmentation.
|
[
{
"version": "v1",
"created": "Mon, 29 Aug 2011 19:28:13 GMT"
}
] | 2011-08-30T00:00:00 |
[
[
"Nölle",
"Michael",
""
],
[
"Suda",
"Martin",
""
]
] |
new_dataset
| 0.993058 |
1101.4564
|
Vadim E. Levit
|
Vadim E. Levit and Eugen Mandrescu
|
A Set and Collection Lemma
|
7 pages, 3 figures
| null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set S is independent if no two vertices from S are adjacent. In this paper
we prove that if F is a collection of maximum independent sets of a graph, then
there is a matching from S-{intersection of all members of F} into {union of
all members of F}-S, for every independent set S. Based on this finding we give
alternative proofs for a number of well-known lemmata, as the "Maximum Stable
Set Lemma" due to Claude Berge and the "Clique Collection Lemma" due to
Andr\'as Hajnal.
|
[
{
"version": "v1",
"created": "Mon, 24 Jan 2011 15:20:24 GMT"
},
{
"version": "v2",
"created": "Mon, 7 Feb 2011 15:47:14 GMT"
},
{
"version": "v3",
"created": "Thu, 28 Apr 2011 16:51:14 GMT"
},
{
"version": "v4",
"created": "Thu, 18 Aug 2011 11:28:40 GMT"
},
{
"version": "v5",
"created": "Thu, 25 Aug 2011 13:50:06 GMT"
}
] | 2011-08-26T00:00:00 |
[
[
"Levit",
"Vadim E.",
""
],
[
"Mandrescu",
"Eugen",
""
]
] |
new_dataset
| 0.957283 |
1108.5095
|
Marcin Kik
|
Marcin Kik
|
RBO Protocol: Broadcasting Huge Databases for Tiny Receivers
| null | null | null | null |
cs.DS cs.DB cs.DC cs.DM cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a protocol (called RBO) for broadcasting long streams of
single-packet messages over radio channel for tiny, battery powered, receivers.
The messages are labeled by the keys from some linearly ordered set. The sender
repeatedly broadcasts a sequence of many (possibly millions) of messages, while
each receiver is interested in reception of a message with a specified key
within this sequence. The transmission is arranged so that the receiver can
wake up in arbitrary moment and find the nearest transmission of its searched
message. Even if it does not know the position of the message in the sequence,
it needs only to receive a small number of (the headers of) other messages to
locate it properly. Thus it can save energy by keeping the radio switched off
most of the time. We show that bit-reversal permutation has "recursive
bisection properties" and, as a consequence, RBO can be implemented very
efficiently with only constant number of $\log_2 n$-bit variables, where $n$ is
the total number of messages in the sequence. The total number of the required
receptions is at most $2\log_2 n +2$ in the model with perfect synchronization.
The basic procedure of RBO (computation of the time slot for the next required
reception) requires only $O(\log^3 n)$ bit-wise operations. We propose
implementation mechanisms for realistic model (with imperfect synchronization),
for operating systems (such as e.g. TinyOS).
|
[
{
"version": "v1",
"created": "Thu, 25 Aug 2011 14:05:30 GMT"
}
] | 2011-08-26T00:00:00 |
[
[
"Kik",
"Marcin",
""
]
] |
new_dataset
| 0.998418 |
1003.4719
|
Giorgi Japaridze
|
Giorgi Japaridze
|
Introduction to clarithmetic I
| null |
Information and Computation 209 (2011), pp. 1312-1354
|
10.1016/j.ic.2011.07.002
| null |
cs.LO cs.CC math.LO math.NT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
"Clarithmetic" is a generic name for formal number theories similar to Peano
arithmetic, but based on computability logic (see
http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional
classical or intuitionistic logics. Formulas of clarithmetical theories
represent interactive computational problems, and their "truth" is understood
as existence of an algorithmic solution. Imposing various complexity
constraints on such solutions yields various versions of clarithmetic. The
present paper introduces a system of clarithmetic for polynomial time
computability, which is shown to be sound and complete. Sound in the sense that
every theorem T of the system represents an interactive number-theoretic
computational problem with a polynomial time solution and, furthermore, such a
solution can be efficiently extracted from a proof of T. And complete in the
sense that every interactive number-theoretic problem with a polynomial time
solution is represented by some theorem T of the system. The paper is written
in a semitutorial style and targets readers with no prior familiarity with
computability logic.
|
[
{
"version": "v1",
"created": "Wed, 24 Mar 2010 19:33:44 GMT"
},
{
"version": "v2",
"created": "Mon, 5 Apr 2010 06:29:45 GMT"
},
{
"version": "v3",
"created": "Mon, 19 Apr 2010 15:45:55 GMT"
},
{
"version": "v4",
"created": "Tue, 12 Jul 2011 13:58:06 GMT"
},
{
"version": "v5",
"created": "Sun, 24 Jul 2011 11:50:45 GMT"
},
{
"version": "v6",
"created": "Tue, 23 Aug 2011 12:10:10 GMT"
}
] | 2011-08-24T00:00:00 |
[
[
"Japaridze",
"Giorgi",
""
]
] |
new_dataset
| 0.993867 |
1008.4177
|
Dung Nguyen
|
Dung Viet Nguyen, Shashi Kiran Chilappagari, Michael W. Marcellin,
Bane Vasic
|
LDPC Codes from Latin Squares Free of Small Trapping Sets
|
This is a 21 page paper. It contains 18 figures and 4 tables. This
paper was submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is concerned with the construction of low-density parity-check
(LDPC) codes with low error floors. Two main contributions are made. First, a
new class of structured LDPC codes is introduced. The parity check matrices of
these codes are arrays of permutation matrices which are obtained from Latin
squares and form a finite field under some matrix operations. Second, a method
to construct LDPC codes with low error floors on the binary symmetric channel
(BSC) is presented. Codes are constructed so that their Tanner graphs are free
of certain small trapping sets. These trapping sets are selected from the
Trapping Set Ontology for the Gallager A/B decoder. They are selected based on
their relative harmfulness for a given decoding algorithm. We evaluate the
relative harmfulness of different trapping sets for the sum product algorithm
(SPA) by using the topological relations among them and by analyzing the
decoding failures on one trapping set in the presence or absence of other
trapping sets.
|
[
{
"version": "v1",
"created": "Tue, 24 Aug 2010 23:42:09 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Aug 2011 17:15:09 GMT"
}
] | 2011-08-24T00:00:00 |
[
[
"Nguyen",
"Dung Viet",
""
],
[
"Chilappagari",
"Shashi Kiran",
""
],
[
"Marcellin",
"Michael W.",
""
],
[
"Vasic",
"Bane",
""
]
] |
new_dataset
| 0.999831 |
1108.3540
|
Elaine Render
|
Rupak Majumdar, Elaine Render and Paulo Tabuada
|
A theory of robust software synthesis
| null | null | null | null |
cs.SY cs.FL math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A key property for systems subject to uncertainty in their operating
environment is robustness, ensuring that unmodelled, but bounded, disturbances
have only a proportionally bounded effect upon the behaviours of the system.
Inspired by ideas from robust control and dissipative systems theory, we
present a formal definition of robustness and algorithmic tools for the design
of optimally robust controllers for omega-regular properties on discrete
transition systems. Formally, we define metric automata - automata equipped
with a metric on states - and strategies on metric automata which guarantee
robustness for omega-regular properties. We present fixed point algorithms to
construct optimally robust strategies in polynomial time. In contrast to
strategies computed by classical graph theoretic approaches, the strategies
computed by our algorithm ensure that the behaviours of the controlled system
gracefully degrade under the action of disturbances; the degree of degradation
is parameterized by the magnitude of the disturbance. We show an application of
our theory to the design of controllers that tolerate infinitely many transient
errors provided they occur infrequently enough.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2011 18:30:58 GMT"
}
] | 2011-08-24T00:00:00 |
[
[
"Majumdar",
"Rupak",
""
],
[
"Render",
"Elaine",
""
],
[
"Tabuada",
"Paulo",
""
]
] |
new_dataset
| 0.985485 |
1108.4224
|
Graham Norton
|
Graham H. Norton
|
On Sequences with a Perfect Linear Complexity Profile
|
19 pages, 3 tables
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We derive B\'ezout identities for the minimal polynomials of a finite
sequence and use them to prove a theorem of Wang and Massey on binary sequences
with a perfect linear complexity profile. We give a new proof of Rueppel's
conjecture and simplify Dai's original proof. We obtain short proofs of results
of Niederreiter relating the linear complexity of a sequence s and K(s), which
was defined using continued fractions. We give an upper bound for the sum of
the linear complexities of any sequence. This bound is tight for sequences with
a perfect linear complexity profile and we apply it to characterise these
sequences in two new ways.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2011 00:57:13 GMT"
},
{
"version": "v2",
"created": "Tue, 23 Aug 2011 00:19:46 GMT"
}
] | 2011-08-24T00:00:00 |
[
[
"Norton",
"Graham H.",
""
]
] |
new_dataset
| 0.978245 |
0907.4573
|
Gregory Gutin
|
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, and Anders Yeo
|
Solving MAX-r-SAT Above a Tight Lower Bound
| null | null | null | null |
cs.DS cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present an exact algorithm that decides, for every fixed $r \geq 2$ in
time $O(m) + 2^{O(k^2)}$ whether a given multiset of $m$ clauses of size $r$
admits a truth assignment that satisfies at least $((2^r-1)m+k)/2^r$ clauses.
Thus \textsc{Max-$r$-Sat} is fixed-parameter tractable when parameterized by
the number of satisfied clauses above the tight lower bound $(1-2^{-r})m$. This
solves an open problem of Mahajan et al. (J. Comput. System Sci., 75, 2009).
Our algorithm is based on a polynomial-time data reduction procedure that
reduces a problem instance to an equivalent algebraically represented problem
with $O(k^2)$ variables. This is done by representing the instance as an
appropriate polynomial, and by applying a probabilistic argument combined with
some simple tools from Harmonic analysis to show that if the polynomial cannot
be reduced to one of size $O(k^2)$, then there is a truth assignment satisfying
the required number of clauses.
We introduce a new notion of bikernelization from a parameterized problem to
another one and apply it to prove that the above-mentioned parameterized
\textsc{Max-$r$-Sat} admits a polynomial-size kernel.
Combining another probabilistic argument with tools from graph matching
theory and signed graphs, we show that if an instance of \textsc{Max-2-Sat}
with $m$ clauses has at least $3k$ variables after application of certain
polynomial time reduction rules to it, then there is a truth assignment that
satisfies at least $(3m+k)/4$ clauses.
We also outline how the fixed-parameter tractability and polynomial-size
kernel results on \textsc{Max-$r$-Sat} can be extended to more general families
of Boolean Constraint Satisfaction Problems.
|
[
{
"version": "v1",
"created": "Mon, 27 Jul 2009 09:10:25 GMT"
},
{
"version": "v2",
"created": "Tue, 28 Jul 2009 07:45:35 GMT"
},
{
"version": "v3",
"created": "Thu, 5 Nov 2009 14:48:23 GMT"
},
{
"version": "v4",
"created": "Mon, 22 Aug 2011 13:26:56 GMT"
}
] | 2011-08-23T00:00:00 |
[
[
"Alon",
"Noga",
""
],
[
"Gutin",
"Gregory",
""
],
[
"Kim",
"Eun Jung",
""
],
[
"Szeider",
"Stefan",
""
],
[
"Yeo",
"Anders",
""
]
] |
new_dataset
| 0.991122 |
1108.4048
|
Timothy Wang
|
Timothy Wang, Romain Jobredeaux, E. Feron
|
A graphical environment to express the semantics of control systems
| null | null | null | null |
cs.SY cs.PL math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the concept of a unified graphical environment for expressing the
semantics of control systems. The graphical control system design environment
in Simulink already allows engineers to insert a variety of assertions aimed
the verification and validation of the control software. We propose extensions
to a Simulink-like environment's annotation capabilities to include formal
control system stability, performance properties and their proofs. We provide a
conceptual description of a tool, that takes in a Simulink-like diagram of the
control system as the input, and generates a graphically annotated control
system diagram as the output. The annotations can either be inserted by the
user or generated automatically by a third party control analysis software such
as IQC$\beta$ or $\mu$-tool. We finally describe how the graphical
representation of the system and its properties can be translated to annotated
programs in a programming language used in verification and validation such as
Lustre or C.
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2011 20:49:52 GMT"
}
] | 2011-08-23T00:00:00 |
[
[
"Wang",
"Timothy",
""
],
[
"Jobredeaux",
"Romain",
""
],
[
"Feron",
"E.",
""
]
] |
new_dataset
| 0.996453 |
1108.4138
|
Sugata Sanyal
|
Suman Banik, Bibhash Roy, Parthi Dey, Nabendu Chaki, Sugata Sanyal
|
QoS Routing using OLSR with Optimization for Flooding
|
4 Pages, 3 Figures
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile Ad-hoc Network (MANET) is the self organizing collection of mobile
nodes. The communication in MANET is done via a wireless media. Ad hoc wireless
networks have massive commercial and military potential because of their
mobility support. Due to demanding real time multimedia applications, Quality
of Services (QoS) support in such infrastructure less networks have become
essential. QoS routing in mobile Ad-Hoc networks is challenging due to rapid
change in network topology. Consequently, the available state information for
routing is inherently imprecise. QoS routing may suffer badly due to several
factors including radio interference on available bandwidth, and inefficient
flooding of information to the adjacent nodes. As a result the performance of
the network degrades substantially. This paper aims at the solution for energy
efficient QoS routing by best utilization of network resources such as energy
and bandwidth. A comparative study shows that despite the overhead due to QoS
management, this solution performs better than classical OLSR protocol in terms
of QoS and efficient utilization of energy.
|
[
{
"version": "v1",
"created": "Sat, 20 Aug 2011 18:52:02 GMT"
}
] | 2011-08-23T00:00:00 |
[
[
"Banik",
"Suman",
""
],
[
"Roy",
"Bibhash",
""
],
[
"Dey",
"Parthi",
""
],
[
"Chaki",
"Nabendu",
""
],
[
"Sanyal",
"Sugata",
""
]
] |
new_dataset
| 0.992815 |
1108.4253
|
Thomas Braibant
|
Thomas Braibant (LIG)
|
Coquet: a Coq library for verifying hardware
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new library to model and verify hardware circuits in the Coq
proof assistant. This library allows one to easily build circuits by following
the usual pen-and-paper diagrams. We define a deep-embedding: we use a
(dependently typed) data-type that models the architecture of circuits, and a
meaning function. We propose tactics that ease the reasoning about the behavior
of the circuits, and we demonstrate that our approach is practicable by proving
the correctness of various circuits: a text-book divide and conquer adder of
parametric size, some higher-order combinators of circuits, and some sequential
circuits: a buffer, and a register.
|
[
{
"version": "v1",
"created": "Mon, 22 Aug 2011 08:14:38 GMT"
}
] | 2011-08-23T00:00:00 |
[
[
"Braibant",
"Thomas",
"",
"LIG"
]
] |
new_dataset
| 0.999645 |
1108.3850
|
Juraj Dzifcak
|
Chitta Baral and Juraj Dzifcak
|
Solving puzzles described in English by automated translation to answer
set programming and learning how to do that translation
| null | null | null | null |
cs.CL cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a system capable of automatically solving combinatorial logic
puzzles given in (simplified) English. It involves translating the English
descriptions of the puzzles into answer set programming(ASP) and using ASP
solvers to provide solutions of the puzzles. To translate the descriptions, we
use a lambda-calculus based approach using Probabilistic Combinatorial
Categorial Grammars (PCCG) where the meanings of words are associated with
parameters to be able to distinguish between multiple meanings of the same
word. Meaning of many words and the parameters are learned. The puzzles are
represented in ASP using an ontology which is applicable to a large set of
logic puzzles.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2011 20:17:58 GMT"
}
] | 2011-08-22T00:00:00 |
[
[
"Baral",
"Chitta",
""
],
[
"Dzifcak",
"Juraj",
""
]
] |
new_dataset
| 0.990631 |
1108.3883
|
Wai Ho Mow
|
Yunghsiang S. Han, Rong Zheng and Wai Ho Mow
|
Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed
Storage
|
Submitted to INFOCOM 2012 on 28 July 2011
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the use of commodity software and hardware, crash-stop and Byzantine
failures are likely to be more prevalent in today's large-scale distributed
storage systems. Regenerating codes have been shown to be a more efficient way
to disperse information across multiple nodes and recover crash-stop failures
in the literature. In this paper, we present the design of regeneration codes
in conjunction with integrity check that allows exact regeneration of failed
nodes and data reconstruction in presence of Byzantine failures. A progressive
decoding mechanism is incorporated in both procedures to leverage computation
performed thus far. The fault-tolerance and security properties of the schemes
are also analyzed.
|
[
{
"version": "v1",
"created": "Fri, 19 Aug 2011 03:40:01 GMT"
}
] | 2011-08-22T00:00:00 |
[
[
"Han",
"Yunghsiang S.",
""
],
[
"Zheng",
"Rong",
""
],
[
"Mow",
"Wai Ho",
""
]
] |
new_dataset
| 0.998089 |
1108.3619
|
EPTCS
|
Golnaz Badkobeh (King's College London), Maxime Crochemore (King's
College London)
|
Finite-Repetition threshold for infinite ternary words
|
In Proceedings WORDS 2011, arXiv:1108.3412
|
EPTCS 63, 2011, pp. 37-43
|
10.4204/EPTCS.63.7
| null |
cs.FL cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The exponent of a word is the ratio of its length over its smallest period.
The repetitive threshold r(a) of an a-letter alphabet is the smallest rational
number for which there exists an infinite word whose finite factors have
exponent at most r(a). This notion was introduced in 1972 by Dejean who gave
the exact values of r(a) for every alphabet size a as it has been eventually
proved in 2009.
The finite-repetition threshold for an a-letter alphabet refines the above
notion. It is the smallest rational number FRt(a) for which there exists an
infinite word whose finite factors have exponent at most FRt(a) and that
contains a finite number of factors with exponent r(a). It is known from
Shallit (2008) that FRt(2)=7/3.
With each finite-repetition threshold is associated the smallest number of
r(a)-exponent factors that can be found in the corresponding infinite word. It
has been proved by Badkobeh and Crochemore (2010) that this number is 12 for
infinite binary words whose maximal exponent is 7/3.
We show that FRt(3)=r(3)=7/4 and that the bound is achieved with an infinite
word containing only two 7/4-exponent words, the smallest number.
Based on deep experiments we conjecture that FRt(4)=r(4)=7/5. The question
remains open for alphabets with more than four letters.
Keywords: combinatorics on words, repetition, repeat, word powers, word
exponent, repetition threshold, pattern avoidability, word morphisms.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2011 03:52:20 GMT"
}
] | 2011-08-19T00:00:00 |
[
[
"Badkobeh",
"Golnaz",
"",
"King's College London"
],
[
"Crochemore",
"Maxime",
"",
"King's\n College London"
]
] |
new_dataset
| 0.994827 |
1108.3623
|
EPTCS
|
Francine Blanchet-Sadri (University of North Carolina at Greensboro),
Aleksandar Chakarov (University of Colorado at Boulder), Lucas Manuelli
(Princeton University), Jarett Schwartz (Princeton University), Slater Stich
(Princeton University)
|
Recurrent Partial Words
|
In Proceedings WORDS 2011, arXiv:1108.3412
|
EPTCS 63, 2011, pp. 71-82
|
10.4204/EPTCS.63.11
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Partial words are sequences over a finite alphabet that may contain wildcard
symbols, called holes, which match or are compatible with all letters; partial
words without holes are said to be full words (or simply words). Given an
infinite partial word w, the number of distinct full words over the alphabet
that are compatible with factors of w of length n, called subwords of w, refers
to a measure of complexity of infinite partial words so-called subword
complexity. This measure is of particular interest because we can construct
partial words with subword complexities not achievable by full words. In this
paper, we consider the notion of recurrence over infinite partial words, that
is, we study whether all of the finite subwords of a given infinite partial
word appear infinitely often, and we establish connections between subword
complexity and recurrence in this more general framework.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2011 03:52:57 GMT"
}
] | 2011-08-19T00:00:00 |
[
[
"Blanchet-Sadri",
"Francine",
"",
"University of North Carolina at Greensboro"
],
[
"Chakarov",
"Aleksandar",
"",
"University of Colorado at Boulder"
],
[
"Manuelli",
"Lucas",
"",
"Princeton University"
],
[
"Schwartz",
"Jarett",
"",
"Princeton University"
],
[
"Stich",
"Slater",
"",
"Princeton University"
]
] |
new_dataset
| 0.99684 |
1108.3624
|
EPTCS
|
Fabio Burderi (Dipartimento di Matematica ed Applicazioni,
Universit\`a Degli Studi di Palermo)
|
Monoids and Maximal Codes
|
In Proceedings WORDS 2011, arXiv:1108.3412
|
EPTCS 63, 2011, pp. 83-92
|
10.4204/EPTCS.63.12
| null |
cs.FL math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years codes that are not Uniquely Decipherable (UD) are been
studied partitioning them in classes that localize the ambiguities of the code.
A natural question is how we can extend the notion of maximality to codes that
are not UD. In this paper we give an answer to this question. To do this we
introduce a partial order in the set of submonoids of a monoid showing the
existence, in this poset, of maximal elements that we call full monoids. Then a
set of generators of a full monoid is, by definition, a maximal code. We show
how this definition extends, in a natural way, the existing definition
concerning UD codes and we find a characteristic property of a monoid generated
by a maximal UD code.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2011 03:53:08 GMT"
}
] | 2011-08-19T00:00:00 |
[
[
"Burderi",
"Fabio",
"",
"Dipartimento di Matematica ed Applicazioni,\n Università Degli Studi di Palermo"
]
] |
new_dataset
| 0.995632 |
1108.3626
|
EPTCS
|
Stefano Crespi Reghizzi (Dipartimento di Elettronica e Informazione,
Politecnico di Milano), Pierluigi San Pietro (Dipartimento di Elettronica e
Informazione, Politecnico di Milano)
|
From Regular to Strictly Locally Testable Languages
|
In Proceedings WORDS 2011, arXiv:1108.3412
|
EPTCS 63, 2011, pp. 103-111
|
10.4204/EPTCS.63.14
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A classical result (often credited to Y. Medvedev) states that every language
recognized by a finite automaton is the homomorphic image of a local language,
over a much larger so-called local alphabet, namely the alphabet of the edges
of the transition graph. Local languages are characterized by the value k=2 of
the sliding window width in the McNaughton and Papert's infinite hierarchy of
strictly locally testable languages (k-slt). We generalize Medvedev's result in
a new direction, studying the relationship between the width and the alphabetic
ratio telling how much larger the local alphabet is. We prove that every
regular language is the image of a k-slt language on an alphabet of doubled
size, where the width logarithmically depends on the automaton size, and we
exhibit regular languages for which any smaller alphabetic ratio is
insufficient. More generally, we express the trade-off between alphabetic ratio
and width as a mathematical relation derived from a careful encoding of the
states. At last we mention some directions for theoretical development and
application.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2011 03:53:24 GMT"
}
] | 2011-08-19T00:00:00 |
[
[
"Reghizzi",
"Stefano Crespi",
"",
"Dipartimento di Elettronica e Informazione,\n Politecnico di Milano"
],
[
"Pietro",
"Pierluigi San",
"",
"Dipartimento di Elettronica e\n Informazione, Politecnico di Milano"
]
] |
new_dataset
| 0.995943 |
1108.3630
|
EPTCS
|
Irina A. Gorbunova (Ural Federal University), Arseny M. Shur (Ural
Federal University)
|
On Pansiot Words Avoiding 3-Repetitions
|
In Proceedings WORDS 2011, arXiv:1108.3412
|
EPTCS 63, 2011, pp. 138-146
|
10.4204/EPTCS.63.19
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The recently confirmed Dejean's conjecture about the threshold between
avoidable and unavoidable powers of words gave rise to interesting and
challenging problems on the structure and growth of threshold words. Over any
finite alphabet with k >= 5 letters, Pansiot words avoiding 3-repetitions form
a regular language, which is a rather small superset of the set of all
threshold words. Using cylindric and 2-dimensional words, we prove that, as k
approaches infinity, the growth rates of complexity for these regular languages
tend to the growth rate of complexity of some ternary 2-dimensional language.
The numerical estimate of this growth rate is about 1.2421.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2011 03:53:54 GMT"
}
] | 2011-08-19T00:00:00 |
[
[
"Gorbunova",
"Irina A.",
"",
"Ural Federal University"
],
[
"Shur",
"Arseny M.",
"",
"Ural\n Federal University"
]
] |
new_dataset
| 0.974249 |
1108.3638
|
EPTCS
|
Matthew J. Samuel (Rutgers, the State University of New Jersey)
|
Word posets, with applications to Coxeter groups
|
In Proceedings WORDS 2011, arXiv:1108.3412
|
EPTCS 63, 2011, pp. 226-230
|
10.4204/EPTCS.63.28
| null |
cs.DM cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We discuss the theory of certain partially ordered sets that capture the
structure of commutation classes of words in monoids. As a first application,
it follows readily that counting words in commutation classes is #P-complete.
We then apply the partially ordered sets to Coxeter groups. Some results are a
proof that enumerating the reduced words of elements of Coxeter groups is
#P-complete, a recursive formula for computing the number of commutation
classes of reduced words, as well as stronger bounds on the maximum number of
commutation classes than were previously known. This also allows us to improve
the known bounds on the number of primitive sorting networks.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2011 03:55:01 GMT"
}
] | 2011-08-19T00:00:00 |
[
[
"Samuel",
"Matthew J.",
"",
"Rutgers, the State University of New Jersey"
]
] |
new_dataset
| 0.99445 |
1108.3703
|
Nadeem Javaid
|
Nadeem Javaid, Ayesha Bibi, Akmal Javaid, Shahzad A. Malik
|
Modeling Routing Overhead Generated by Wireless Reactive Routing
Protocols
| null |
17th Asia-Pacific Conference on Communications (APCC2011)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we have modeled the routing over- head generated by three
reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic
Source Routing (DSR) and DYnamic MANET On-deman (DYMO). Routing performed by
reactive protocols consists of two phases; route discovery and route
maintenance. Total cost paid by a protocol for efficient routing is sum of the
cost paid in the form of energy consumed and time spent. These protocols
majorly focus on the optimization performed by expanding ring search algorithm
to control the flooding generated by the mechanism of blind flooding. So, we
have modeled the energy consumed and time spent per packet both for route
discovery and route maintenance. The proposed framework is evaluated in NS-2 to
compare performance of the chosen routing protocols.
|
[
{
"version": "v1",
"created": "Thu, 18 Aug 2011 10:06:36 GMT"
}
] | 2011-08-19T00:00:00 |
[
[
"Javaid",
"Nadeem",
""
],
[
"Bibi",
"Ayesha",
""
],
[
"Javaid",
"Akmal",
""
],
[
"Malik",
"Shahzad A.",
""
]
] |
new_dataset
| 0.953134 |
1108.3412
|
EPTCS
|
Petr Ambro\v{z} (FNSPE, Czech Technical University in Prague),
\v{S}t\v{e}p\'an Holub (FMP, Charles University in Prague), Zuzana
Mas\'akov\'a (FNSPE, Czech Technical University in Prague)
|
Proceedings 8th International Conference Words 2011
|
EPTCS 63, 2011
| null |
10.4204/EPTCS.63
| null |
cs.FL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
WORDS is the main international event in Combinatorics on Words. It is a
biannual conference devoted to research of words (i.e., finite or infinite
sequences of symbols over a finite alphabet) from combinatorial, algebraic and
algorithmic points of view. The emphasis of the conference is on mathematical
theory of words but the conference is also open to applications, mainly in
computer science, biology, linguistics and physics, gaining from the fact that
words arise as a natural object in many areas.
The eighth edition of the conference was organized in Prague from 12th to
16th September 2011 as a joint undertaking of the Czech Technical University
and the Charles University. This volume consists of contributed papers accepted
for presentation at the conference and summaries of invited lectures.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2011 07:30:14 GMT"
}
] | 2011-08-18T00:00:00 |
[
[
"Ambrož",
"Petr",
"",
"FNSPE, Czech Technical University in Prague"
],
[
"Holub",
"Štěpán",
"",
"FMP, Charles University in Prague"
],
[
"Masáková",
"Zuzana",
"",
"FNSPE, Czech Technical University in Prague"
]
] |
new_dataset
| 0.992816 |
1108.3429
|
Bogdan Aman
|
Chiara Bodei, Linda Brodo
|
Brane Calculi Systems: A Static Preview of their Possible Behaviour
|
Presented at MeCBIC 2011
| null | null |
MeCBIC/2011/06
|
cs.LO cs.ET
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We improve the precision of a previous Control Flow Analysis for Brane
Calculi, by adding information on the context and introducing causality
information on the membranes. This allows us to prove some biological
properties on the behaviour of systems specified in Brane Calculi.
|
[
{
"version": "v1",
"created": "Wed, 17 Aug 2011 09:04:48 GMT"
}
] | 2011-08-18T00:00:00 |
[
[
"Bodei",
"Chiara",
""
],
[
"Brodo",
"Linda",
""
]
] |
new_dataset
| 0.999684 |
1009.6134
|
Shoaib Saleem
|
Muhammad Shoaib Saleem, \'Eric Renault, Djamal Zeghlache
|
NetInf Mobile Node Architecture and Mobility Management based on LISP
Mobile Node
|
Accepted in IEEE Consumer Communications and Networking Conference
2011. Las Vegas, USA
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we propose an architecture for Network of Information mobile
node (NetInf MN). It bears characteristics and features of basic NetInf node
architecture with features introduced in the LISP MN architecture. We also
introduce a virtual node layer for mobility management in the Network of
Information. Therefore, by adopting this architecture no major changes in the
contemporary network topologies is required. Thus, making our approach more
practical.
|
[
{
"version": "v1",
"created": "Thu, 30 Sep 2010 13:52:18 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Aug 2011 10:51:02 GMT"
}
] | 2011-08-17T00:00:00 |
[
[
"Saleem",
"Muhammad Shoaib",
""
],
[
"Renault",
"Éric",
""
],
[
"Zeghlache",
"Djamal",
""
]
] |
new_dataset
| 0.997362 |
1108.3268
|
Al-Sakib Khan Pathan
|
Abdelgadir Tageldin Abdelgadir, Al-Sakib Khan Pathan, Mohiuddin Ahmed
|
On the Performance of MPI-OpenMP on a 12 nodes Multi-core Cluster
|
11 pages, to appear in ICA3PP'11 conference
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the increasing number of Quad-Core-based clusters and the introduction
of compute nodes designed with large memory capacity shared by multiple cores,
new problems related to scalability arise. In this paper, we analyze the
overall performance of a cluster built with nodes having a dual Quad-Core
Processor on each node. Some benchmark results are presented and some
observations are mentioned when handling such processors on a benchmark test. A
Quad-Core-based cluster's complexity arises from the fact that both local
communication and network communications between the running processes need to
be addressed. The potentials of an MPI-OpenMP approach are pinpointed because
of its reduced communication overhead. At the end, we come to a conclusion that
an MPI-OpenMP solution should be considered in such clusters since optimizing
network communications between nodes is as important as optimizing local
communications between processors in a multi-core cluster.
|
[
{
"version": "v1",
"created": "Tue, 16 Aug 2011 15:26:44 GMT"
}
] | 2011-08-17T00:00:00 |
[
[
"Abdelgadir",
"Abdelgadir Tageldin",
""
],
[
"Pathan",
"Al-Sakib Khan",
""
],
[
"Ahmed",
"Mohiuddin",
""
]
] |
new_dataset
| 0.997058 |
1108.3285
|
Kenta Kasai
|
Puripong Suthisopapan, Kenta Kasai, Anupap Meesomboon, Virasit
Imtawil, Kohichi Sakaniwa
|
Simple Low-Rate Non-Binary LDPC Coding for Relay Channels
|
submitted to IEEE JSAC
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Binary LDPC coded relay systems have been well studied previously with the
assumption of infinite codeword length. In this paper, we deal with non-binary
LDPC codes which can outperform their binary counterpart especially for
practical codeword length. We utilize non-binary LDPC codes and recently
invented non-binary coding techniques known as multiplicative repetition to
design the low-rate coding strategy for the decode-and-forward half-duplex
relay channel. We claim that the proposed strategy is simple since the
destination and the relay can decode with almost the same computational
complexity by sharing the same structure of decoder. Numerical experiments are
carried out to show that the performances obtained by non-binary LDPC coded
relay systems surpass the capacity of direct transmission and also approach
within less than 1.5 dB from the achievable rate of the relay channels.
|
[
{
"version": "v1",
"created": "Tue, 16 Aug 2011 17:13:31 GMT"
}
] | 2011-08-17T00:00:00 |
[
[
"Suthisopapan",
"Puripong",
""
],
[
"Kasai",
"Kenta",
""
],
[
"Meesomboon",
"Anupap",
""
],
[
"Imtawil",
"Virasit",
""
],
[
"Sakaniwa",
"Kohichi",
""
]
] |
new_dataset
| 0.992953 |
1012.2294
|
Steven Obua
|
Steven Obua
|
Syntax and Semantics of Babel-17
| null | null | null | null |
cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present Babel-17, the first programming language for purely functional
structured programming (PFSP). Earlier work illustrated PFSP in the framework
of a toy research language. Babel-17 takes this earlier work to a new level by
showing how PFSP can be combined with pattern matching, object oriented
programming, and features like concurrency, lazy evaluation, memoization and
support for lenses.
|
[
{
"version": "v1",
"created": "Fri, 10 Dec 2010 15:37:06 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Jun 2011 07:34:05 GMT"
},
{
"version": "v3",
"created": "Thu, 21 Jul 2011 15:38:50 GMT"
},
{
"version": "v4",
"created": "Mon, 15 Aug 2011 09:21:52 GMT"
}
] | 2011-08-16T00:00:00 |
[
[
"Obua",
"Steven",
""
]
] |
new_dataset
| 0.994538 |
1108.2718
|
Seth Nielson
|
Seth James Nielson, Dan S. Wallach
|
The BitTorrent Anonymity Marketplace
|
15 page, 6 figure, technical report
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The very nature of operations in peer-to-peer systems such as BitTorrent
exposes information about participants to their peers. Nodes desiring
anonymity, therefore, often chose to route their peer-to-peer traffic through
anonymity relays, such as Tor. Unfortunately, these relays have little
incentive for contribution and struggle to scale with the high loads that P2P
traffic foists upon them. We propose a novel modification for BitTorrent that
we call the BitTorrent Anonymity Marketplace. Peers in our system trade in k
swarms obscuring the actual intent of the participants. But because peers can
cross-trade torrents, the k-1 cover traffic can actually serve a useful
purpose. This creates a system wherein a neighbor cannot determine if a node
actually wants a given torrent, or if it is only using it as leverage to get
the one it really wants. In this paper, we present our design, explore its
operation in simulation, and analyze its effectiveness. We demonstrate that the
upload and download characteristics of cover traffic and desired torrents are
statistically difficult to distinguish.
|
[
{
"version": "v1",
"created": "Fri, 12 Aug 2011 21:06:04 GMT"
}
] | 2011-08-16T00:00:00 |
[
[
"Nielson",
"Seth James",
""
],
[
"Wallach",
"Dan S.",
""
]
] |
new_dataset
| 0.988001 |
1108.2776
|
Mohammad Jalil Piran
|
Mohammad Jalil Piran, G. Rama Murthy, G. Praveen Babu
|
Vehicular Ad Hoc and Sensor Networks; Principles and Challenges
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rapid increase of vehicular traffic and congestion on the highways began
hampering the safe and efficient movement of traffic. Consequently, year by
year, we see the ascending rate of car accidents and casualties in most of the
countries. Therefore, exploiting the new technologies, e.g. wireless sensor
networks, is required as a solution of reduction of these saddening and
reprehensible statistics. This has motivated us to propose a novel and
comprehensive system to utilize Wireless Sensor Networks for vehicular
networks. We coin the vehicular network employing wireless Sensor networks as
Vehicular Ad Hoc and Sensor Network, or VASNET in short. The proposed VASNET is
particularly for highway traffic .VASNET is a self-organizing Ad Hoc and sensor
network comprised of a large number of sensor nodes. In VASNET there are two
kinds of sensor nodes, some are embedded on the vehicles-vehicular nodes- and
others are deployed in predetermined distances besides the highway road, known
as Road Side Sensor nodes (RSS). The vehicular nodes are used to sense the
velocity of the vehicle for instance. We can have some Base Stations (BS) such
as Police Traffic Station, Firefighting Group and Rescue Team. The base
stations may be stationary or mobile. VASNET provides capability of wireless
communication between vehicular nodes and stationary nodes, to increase safety
and comfort for vehicles on the highway roads. In this paper we explain main
fundamentals and challenges of VASNET.
|
[
{
"version": "v1",
"created": "Sat, 13 Aug 2011 08:30:49 GMT"
}
] | 2011-08-16T00:00:00 |
[
[
"Piran",
"Mohammad Jalil",
""
],
[
"Murthy",
"G. Rama",
""
],
[
"Babu",
"G. Praveen",
""
]
] |
new_dataset
| 0.985689 |
1108.2846
|
Hyunseok Chang
|
Hyunseok Chang and Sae-Young Chung
|
Capacity of Strong and Very Strong Gaussian Interference
Relay-without-delay Channels
|
19 pages, 2 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we study the interference relay-without-delay channel which is
an interference channel with a relay helping the communication. We assume the
relay's transmit symbol depends not only on its past received symbols but also
on its current received symbol, which is an appropriate model for studying
amplify-and-forward type relaying when the overall delay spread is much smaller
than the inverse of the bandwidth. For the discrete memoryless interference
relay-without-delay channel, we show an outer bound using genie-aided outer
bounding. For the Gaussian interference relay-without-delay channel, we define
strong and very strong interference relay-without-delay channels and propose an
achievable scheme based on instantaneous amplify-and-forward (AF) relaying. We
also propose two outer bounds for the strong and very strong cases. Using the
proposed achievable scheme and outer bounds, we show that our scheme can
achieve the capacity exactly when the relay's transmit power is greater than a
certain threshold. This is surprising since the conventional AF relaying is
usually only asymptotically optimal, not exactly optimal. The proposed scheme
can be useful in many practical scenarios due to its optimality as well as its
simplicity.
|
[
{
"version": "v1",
"created": "Sun, 14 Aug 2011 07:31:21 GMT"
}
] | 2011-08-16T00:00:00 |
[
[
"Chang",
"Hyunseok",
""
],
[
"Chung",
"Sae-Young",
""
]
] |
new_dataset
| 0.997235 |
1108.2960
|
Alexander Lubotzky
|
Tali Kaufman, Alexander Lubotzky
|
Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes
| null | null | null | null |
cs.IT math.CO math.GR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a symmetric LDPC code with constant rate and constant distance
(i.e. good LDPC code) that its constraint space is generated by the orbit of
one constant weight constraint under a group action. Our construction provides
the first symmetric LDPC good codes. This solves the main open problem raised
by Kaufman and Wigderson in [4].
|
[
{
"version": "v1",
"created": "Mon, 15 Aug 2011 09:45:53 GMT"
}
] | 2011-08-16T00:00:00 |
[
[
"Kaufman",
"Tali",
""
],
[
"Lubotzky",
"Alexander",
""
]
] |
new_dataset
| 0.999749 |
1107.4624
|
Deniz Sarioz
|
Matthew P. Johnson and Deniz Sarioz
|
Computing the obstacle number of a plane graph
|
7 pages, 3 figures
| null | null | null |
cs.CG cs.DM cs.DS math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An obstacle representation of a plane graph G is V(G) together with a set of
opaque polygonal obstacles such that G is the visibility graph on V(G)
determined by the obstacles. We investigate the problem of computing an
obstacle representation of a plane graph (ORPG) with a minimum number of
obstacles. We call this minimum size the obstacle number of G.
First, we show that ORPG is NP-hard by reduction from planar vertex cover,
resolving a question posed by [8]. Second, we give a reduction from ORPG to
maximum degree 3 planar vertex cover. Since this reduction preserves solution
values, it follows that ORPG is fixed parameter tractable (FPT) and admits a
polynomial-time approximation scheme (PTAS).
|
[
{
"version": "v1",
"created": "Fri, 22 Jul 2011 20:43:21 GMT"
},
{
"version": "v2",
"created": "Fri, 12 Aug 2011 18:43:00 GMT"
}
] | 2011-08-15T00:00:00 |
[
[
"Johnson",
"Matthew P.",
""
],
[
"Sarioz",
"Deniz",
""
]
] |
new_dataset
| 0.970259 |
1108.2358
|
EPTCS
|
Mar\'ia Alpuente (Universidad Polit\'ecnica de Valencia), Demis Ballis
(University of Udine), Javier Espert (Universidad Polit\'ecnica de Valencia),
Francisco Frechina (Universidad Polit\'ecnica de Valencia), Daniel Romero
(Universidad Polit\'ecnica de Valencia)
|
Debugging of Web Applications with Web-TLR
|
In Proceedings WWV 2011, arXiv:1108.2085
|
EPTCS 61, 2011, pp. 66-80
|
10.4204/EPTCS.61.5
| null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Web-TLR is a Web verification engine that is based on the well-established
Rewriting Logic--Maude/LTLR tandem for Web system specification and
model-checking. In Web-TLR, Web applications are expressed as rewrite theories
that can be formally verified by using the Maude built-in LTLR model-checker.
Whenever a property is refuted, a counterexample trace is delivered that
reveals an undesired, erroneous navigation sequence. Unfortunately, the
analysis (or even the simple inspection) of such counterexamples may be
unfeasible because of the size and complexity of the traces under examination.
In this paper, we endow Web-TLR with a new Web debugging facility that supports
the efficient manipulation of counterexample traces. This facility is based on
a backward trace-slicing technique for rewriting logic theories that allows the
pieces of information that we are interested to be traced back through inverse
rewrite sequences. The slicing process drastically simplifies the computation
trace by dropping useless data that do not influence the final result. By using
this facility, the Web engineer can focus on the relevant fragments of the
failing application, which greatly reduces the manual debugging effort and also
decreases the number of iterative verifications.
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2011 09:27:47 GMT"
}
] | 2011-08-12T00:00:00 |
[
[
"Alpuente",
"María",
"",
"Universidad Politécnica de Valencia"
],
[
"Ballis",
"Demis",
"",
"University of Udine"
],
[
"Espert",
"Javier",
"",
"Universidad Politécnica de Valencia"
],
[
"Frechina",
"Francisco",
"",
"Universidad Politécnica de Valencia"
],
[
"Romero",
"Daniel",
"",
"Universidad Politécnica de Valencia"
]
] |
new_dataset
| 0.99886 |
1108.2482
|
Saurabh Shivale Mr
|
Saurabh Anandrao Shivale
|
Cryptovirology: Virus Approach
| null |
International Journal of Network Security & Its Applications
(IJNSA), Vol.3, No.4, July 2011
|
10.5121/ijnsa.2011.3404
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Traditionally, "Cryptography" is a benediction to information processing and
communications, it helps people to store information securely and the private
communications over long distances. Cryptovirology is the study of applications
of cryptography to build the malicious software. It is an investigation, how
modern cryptographic tools and paradigms can be used to strengthen, develop and
improve new malicious software attacks. Cryptovirology attacks have been
categorized as : give malware enhanced privacy and be more robust against
reverse-engineering, secondly give the attacker enhanced anonymity while
communicating with deployed malware. This paper presents the idea of
"Cryptovirology" which introduce a twist on how cryptography can also be used
offensively. Being offensive means, it can be used to mount extortion based
attacks that cause loss of access to information, loss of confidentiality, and
information leakage, tasks which cryptography usually prevents. Also analyze
threats and attacks that misuse of cryptography can cause when combined with
fraudulent software (viruses, Trojans). Public-key cryptography is very
essential for the attacks that based on cryptovirology. This paper also suggest
some of the countermeasures, mechanisms to cope with and prevent such attacks.
Even if the attackers actions on the host machine are being monitored, it still
cannot be proven beyond reasonable doubt that he or she is the attacker; and it
is an "originator-concealing attack". Evidence should be collected from the
"author's own system which was used for the attack". These attacks have
implications on how the use of cryptographic tools and techniques should be
audited and managed in general purpose computing environments, and imply that
access to the cryptographic tools should be in well control of the system(such
as API routines).
|
[
{
"version": "v1",
"created": "Thu, 11 Aug 2011 18:37:05 GMT"
}
] | 2011-08-12T00:00:00 |
[
[
"Shivale",
"Saurabh Anandrao",
""
]
] |
new_dataset
| 0.997492 |
1108.0496
|
Bogdan Aman
|
Bogdan Aman
|
Spatial Dynamic Structures and Mobility in Computation
|
20 pages, 1 figure, PhD Thesis (Extended Abstract)
| null | null |
FML-11-01
|
cs.DC math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Membrane computing is a well-established and successful research field which
belongs to the more general area of molecular computing. Membrane computing
aims at defining parallel and non-deterministic computing models, called
membrane systems or P Systems, which abstract from the functioning and
structure of the cell. A membrane system consists of a spatial structure, a
hierarchy of membranes which do not intersect, with a distinguishable membrane
called skin surrounding all of them. A membrane without any other membranes
inside is elementary, while a non-elementary membrane is a composite membrane.
The membranes define demarcations between regions; for each membrane there is a
unique associated region. Since we have a one-to-one correspondence, we
sometimes use membrane instead of region, and vice-versa. The space outside the
skin membrane is called the environment.
In this thesis we define and investigate variants of systems of mobile
membranes as models for molecular computing and as modelling paradigms for
biological systems. On one hand, we follow the standard approach of research in
membrane computing: defining a notion of computation for systems of mobile
membranes, and investigating the computational power of such computing devices.
Specifically, we address issues concerning the power of operations for
modifying the membrane structure of a system of mobile membranes by mobility:
endocytosis (moving a membrane inside a neighbouring membrane) and endocytosis
(moving a membrane outside the membrane where it is placed). On the other hand,
we relate systems of mobile membranes to process algebra (mobile ambients,
timed mobile ambients, pi-calculus, brane calculus) by providing some encodings
and adding some concepts inspired from process algebra in the framework of
mobile membrane computing.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2011 07:17:06 GMT"
}
] | 2011-08-11T00:00:00 |
[
[
"Aman",
"Bogdan",
""
]
] |
new_dataset
| 0.999121 |
1108.2058
|
Muriel Dulieu
|
Boris Aronov, Muriel Dulieu, and Ferran Hurtado
|
Witness Rectangle Graphs
|
In Proceedings of the 12th International Symposium on Algorithms and
Data Structures (WADS), p.73-85, August 2011, New York, NY, USA
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a witness rectangle graph (WRG) on vertex point set P with respect to
witness points set W in the plane, two points x, y in P are adjacent whenever
the open isothetic rectangle with x and y as opposite corners contains at least
one point in W. WRGs are representative of a a larger family of witness
proximity graphs introduced in two previous papers. We study graph-theoretic
properties of WRGs. We prove that any WRG has at most two non-trivial connected
components. We bound the diameter of the non-trivial connected components of a
WRG in both the one-component and two-component cases. In the latter case, we
prove that a graph is representable as a WRG if and only if each component is a
connected co-interval graph, thereby providing a complete characterization of
WRGs of this type. We also completely characterize trees drawable as WRGs. In
addition, we prove that a WRG with no isolated vertices has domination number
at most four. Moreover, we show that any combinatorial graph can be drawn as a
WRG using a combination of positive and negative witnesses. Finally we conclude
with some related results on the number of points required to stab all the
rectangles defined by a set of n point.
|
[
{
"version": "v1",
"created": "Tue, 9 Aug 2011 22:04:20 GMT"
}
] | 2011-08-11T00:00:00 |
[
[
"Aronov",
"Boris",
""
],
[
"Dulieu",
"Muriel",
""
],
[
"Hurtado",
"Ferran",
""
]
] |
new_dataset
| 0.999738 |
1108.2063
|
Muriel Dulieu
|
Boris Aronov and Muriel Dulieu
|
How to Cover a Point Set with a V-Shape of Minimum Width
|
In Proceedings of the 12th International Symposium on Algorithms and
Data Structures (WADS), p.61-72, August 2011, New York, NY, USA
| null | null | null |
cs.CG cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A balanced V-shape is a polygonal region in the plane contained in the union
of two crossing equal-width strips. It is delimited by two pairs of parallel
rays that emanate from two points x, y, are contained in the strip boundaries,
and are mirror-symmetric with respect to the line xy. The width of a balanced
V-shape is the width of the strips. We first present an O(n^2 log n) time
algorithm to compute, given a set of n points P, a minimum-width balanced
V-shape covering P. We then describe a PTAS for computing a
(1+epsilon)-approximation of this V-shape in time O((n/epsilon)log
n+(n/epsilon^(3/2))log^2(1/epsilon)). A much simpler constant-factor
approximation algorithm is also described.
|
[
{
"version": "v1",
"created": "Tue, 9 Aug 2011 22:29:31 GMT"
}
] | 2011-08-11T00:00:00 |
[
[
"Aronov",
"Boris",
""
],
[
"Dulieu",
"Muriel",
""
]
] |
new_dataset
| 0.999411 |
1108.2149
|
Tolga Mataracioglu
|
Tolga Mataracioglu, Sevgi Ozkan
|
User Awareness Measurement Through Social Engineering
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
TUBITAK National Research Institute of Electronics and Cryptology (UEKAE)
Department of Information Systems Security makes social engineering attacks to
Turkish public agencies within the frame of "Information Security Tests" [19].
This paper will make an analysis of the social engineering tests that have been
carried out in several Turkish public agencies. The tests include phone calling
to sample employees by the social engineer and trying to seize employees'
sensitive information by exploiting their good faith. The aim of this research
is to figure that the employees in Turkish public agencies have a lack of
information security awareness and they compromise the information security
principles which should be necessarily applied for any public agencies. Social
engineering, both with its low cost and ability to take advantage of low
technology, has taken its place in the information security literature as a
very effective form of attack [8].
|
[
{
"version": "v1",
"created": "Wed, 10 Aug 2011 10:59:10 GMT"
}
] | 2011-08-11T00:00:00 |
[
[
"Mataracioglu",
"Tolga",
""
],
[
"Ozkan",
"Sevgi",
""
]
] |
new_dataset
| 0.97298 |
1104.0779
|
Moti Medina
|
Guy Even, Yaniv Fais, Moti Medina, Shimon (Moni) Shahar, Alexander
Zadorojniy
|
Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We deal with the problem of streaming multiple video streams between pairs of
nodes in a multi-hop wireless ad hoc network. The nodes are static, know their
locations, and are synchronized (via GPS). We introduce a new interference
model that uses variable interference radiuses. We present an algorithm for
computing a frequency assignment and a schedule whose goal is to maximize
throughput over all the video streams. In addition, we developed a localized
flow-control mechanism to stabilize the queue lengths.
We simulated traffic scheduled by the algorithm using OMNET++/MixiM (i.e.,
physical SINR interference model with 802.11g) to test whether the computed
throughput is achieved. The results of the simulation show that the computed
solution is \SINR-feasible and achieves predictable stable throughputs.
|
[
{
"version": "v1",
"created": "Tue, 5 Apr 2011 09:08:39 GMT"
},
{
"version": "v2",
"created": "Tue, 31 May 2011 09:28:35 GMT"
},
{
"version": "v3",
"created": "Wed, 1 Jun 2011 17:15:19 GMT"
},
{
"version": "v4",
"created": "Sun, 7 Aug 2011 08:37:09 GMT"
}
] | 2011-08-09T00:00:00 |
[
[
"Even",
"Guy",
"",
"Moni"
],
[
"Fais",
"Yaniv",
"",
"Moni"
],
[
"Medina",
"Moti",
"",
"Moni"
],
[
"Shimon",
"",
"",
"Moni"
],
[
"Shahar",
"",
""
],
[
"Zadorojniy",
"Alexander",
""
]
] |
new_dataset
| 0.99828 |
1108.1421
|
Sheng Yang
|
Sheng Yang, Pablo Piantanida, Mari Kobayashi, Shlomo Shamai (Shitz)
|
On the Secrecy Degrees of Freedom of Multi-Antenna Wiretap Channels with
Delayed CSIT
|
5 pages, 1 figure, 1 table. This work has been presented at ISIT
2011. The current version fixes several bugs in the Proceedings
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The secrecy degrees of freedom (SDoF) of the Gaussian multiple-input and
single-output (MISO) wiretap channel is studied under the assumption that
delayed channel state information (CSI) is available at the transmitter and
each receiver knows its own instantaneous channel. We first show that a
strictly positive SDoF can be guaranteed whenever the transmitter has delayed
CSI (either on the legitimate channel or/and the eavesdropper channel). In
particular, in the case with delayed CSI on both channels, it is shown that the
optimal SDoF is 2/3. We then generalize the result to the two-user Gaussian
MISO broadcast channel with confidential messages and characterize the SDoF
region when the transmitter has delayed CSI of both receivers. Interestingly,
the artificial noise schemes exploiting several time instances are shown to
provide the optimal SDoF region by masking the confidential message to the
unintended receiver while aligning the interference at each receiver.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2011 22:36:32 GMT"
}
] | 2011-08-09T00:00:00 |
[
[
"Yang",
"Sheng",
"",
"Shitz"
],
[
"Piantanida",
"Pablo",
"",
"Shitz"
],
[
"Kobayashi",
"Mari",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.959461 |
1108.1425
|
Radwan Abujassar
|
Radwan abujassar and Mohammed ghanbari
|
A Driven Backup Routing Table to Find Alternative Dijoint Path in Ad Hoc
Wireless
|
10pages
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The performances of the routing protocols are important since they compute
the primary path between source and destination. In addition, routing protocols
need to detect failure within a short period of time when nodes move to start
updating the routing table in order to find a new primary path to the
destination. Meantime, loss of packets and end-to- end delays will increase
thereby reducing throughput and degrading the performance of the network. This
paper proposes a new algorithm, DBRT (Driven Backup Routing Table), to improve
the existing proactive protocols such as DSDV (Destination Sequenced Distance
Vector) protocol by creating a backup routing table to provide multiple
alternative routes. The DBRT algorithm identifies adjacent nodes for each node
in the same range and then selects one of these as a backup next hop according
to the available path to the destination. The results show that loss of data
packets, throughput and end-to-end delay times between source and destination
are improved. The results show that the new protocol does not degrade the
network's performance despite sending extra messages to construct and update
the new backup routing table. Simulations (using an NS2 simulator) are
undertaken to demonstrate the difference between using a DSDV protocol with or
without the proposed schema.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2011 23:24:46 GMT"
}
] | 2011-08-09T00:00:00 |
[
[
"abujassar",
"Radwan",
""
],
[
"ghanbari",
"Mohammed",
""
]
] |
new_dataset
| 0.961633 |
1108.1785
|
Wenji Wu
|
Wenji Wu, Phil DeMar, Don Holmgren, Amitoj Singh, Ruth Pordes
|
G-NetMon: A GPU-accelerated Network Performance Monitoring System for
Large Scale Scientific Collaborations
| null | null | null | null |
cs.NI
|
http://creativecommons.org/licenses/publicdomain/
|
Network traffic is difficult to monitor and analyze, especially in
high-bandwidth networks. Performance analysis, in particular, presents extreme
complexity and scalability challenges. GPU (Graphics Processing Unit)
technology has been utilized recently to accelerate general purpose scientific
and engineering computing. GPUs offer extreme thread-level parallelism with
hundreds of simple cores. Their data-parallel execution model can rapidly solve
large problems with inherent data parallelism. At Fermilab, we have prototyped
a GPU-accelerated network performance monitoring system, called G-NetMon, to
support large-scale scientific collaborations. In this work, we explore new
opportunities in network traffic monitoring and analysis with GPUs. Our system
exploits the data parallelism that exists within network flow data to provide
fast analysis of bulk data movement between Fermilab and collaboration sites.
Experiments demonstrate that our G-NetMon can rapidly detect sub-optimal bulk
data movements.
|
[
{
"version": "v1",
"created": "Mon, 8 Aug 2011 19:25:49 GMT"
}
] | 2011-08-09T00:00:00 |
[
[
"Wu",
"Wenji",
""
],
[
"DeMar",
"Phil",
""
],
[
"Holmgren",
"Don",
""
],
[
"Singh",
"Amitoj",
""
],
[
"Pordes",
"Ruth",
""
]
] |
new_dataset
| 0.986315 |
1108.1152
|
Jenny Blight
|
Oluwaranti Adeniran and Achimugu Philip
|
Development and Deployment of Fixed Wireless Access in South West
Nigeria: Performance and Evaluation
|
Submitted to Journal of Computer Science and Engineering, see
http://sites.google.com/site/jcseuk/volume-7-issue-2-june-2011
|
Journal of Computer Science and Engineering, Volume 7, Issue 2,
p51-57, June 2011
| null | null |
cs.CY
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Fixed Wireless Access (FWA) involves the use of wireless technology to
replace copper to connect subscribers to the telephone network. It is a variant
of wireless broadband which provides an alternative in the so-called 'last
mile' connectivity between the subscriber and the fixed telecommunications
network. FWA could either be narrowband or broadband and it is predominantly
deployed using the Code Division Multiple Access (CDMA) technology. In
assessing the extent of development and deployment of FWA, the perspective of
the operators and users was elicited primarily through the use of
questionnaires. Issues like setup cost, tax, Government incentive, availability
of infrastructure and manpower applied to the operators while on the users'
part factors like quality of service, signal strength as well as call rate were
considered. The South western zone of Nigeria is regarded as one of the most
urbanized regions in the south of Sahara, this is not out of place considering
the fact that Lagos which is the nation's commercial nerve centre and a
mega-city is located within this region. The scope of this research covered
this very lively part of the country. The relationship between the parameters
or variables considered was established using an appropriate statistical
method: The Regression analysis. In terms of users' preference, Global System
of Mobile communication (GSM) was compared with FWA. Results were interpreted
and suitable conclusions were drawn to wrap up a quite revealing work.
|
[
{
"version": "v1",
"created": "Thu, 4 Aug 2011 18:02:03 GMT"
}
] | 2011-08-08T00:00:00 |
[
[
"Adeniran",
"Oluwaranti",
""
],
[
"Philip",
"Achimugu",
""
]
] |
new_dataset
| 0.998506 |
1108.1302
|
Ashok Kumar Das
|
Ashok Kumar Das
|
A Key Establishment Scheme for Mobile Wireless Sensor Networks Using
Post-Deployment Knowledge
|
Published in International Journal of Computer Networks &
Communications (IJCNC) Vol.3, No.4, July 2011
| null |
10.5121/ijcnc.2011.3405
| null |
cs.CR
|
http://creativecommons.org/licenses/by/3.0/
|
Establishment of pairwise keys between sensor nodes in a sensor network is a
difficult problem due to resource limitations of sensor nodes as well as
vulnerability to physical captures of sensor nodes by the enemy. Public-key
cryptosystems are not much suited for most resource-constrained sensor
networks. Recently, elliptic curve cryptographic techniques show that public
key cryptosystem is also feasible for resource-constrained sensor networks.
However, most researchers accept that the symmetric key cryptosystems are
viable options for resource-constrained sensor networks. In this paper, we
first develop a basic principle to address the key pre-distribution problem in
mobile sensor networks. Then, using this developed basic principle, we propose
a scheme which takes the advantage of the post-deployment knowledge. Our scheme
is a modified version of the key prioritization technique proposed by Liu and
Ning. Our improved scheme provides reasonable network connectivity and
security. Moreover, the proposed scheme works for any deployment topology.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2011 11:25:28 GMT"
}
] | 2011-08-08T00:00:00 |
[
[
"Das",
"Ashok Kumar",
""
]
] |
new_dataset
| 0.984753 |
1108.1341
|
Bingxuan Zhao
|
Bingxuan Zhao and Shigeru Shimamoto
|
Two-stage coordination multi-radio multi-channel mac protocol for
wireless mesh networks
|
18 pages 9 figures
|
International Journal of Computer Networks & Communications
(IJCNC), Vol.3, No.4, July 2011, pp.99-116
| null | null |
cs.NI
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Within the wireless mesh network, a bottleneck problem arises as the number
of concurrent traffic flows (NCTF) increases over a single common control
channel, as it is for most conventional networks. To alleviate this problem,
this paper proposes a two-stage coordination multi-radio multi-channel MAC
(TSC-M2MAC) protocol that designates all available channels as both control
channels and data channels in a time division manner through a two-stage
coordination. At the first stage, a load balancing breadth-first-search-based
vertex coloring algorithm for multi-radio conflict graph is proposed to
intelligently allocate multiple control channels. At the second stage, a
REQ/ACK/RES mechanism is proposed to realize dynamical channel allocation for
data transmission. At this stage, the Channel-and-Radio Utilization Structure
(CRUS) maintained by each node is able to alleviate the hidden nodes problem;
also, the proposed adaptive adjustment algorithm for the Channel Negotiation
and Allocation (CNA) sub-interval is able to cope with the variation of NCTF.
In addition, we design a power saving mechanism for the TSC-M2MAC to decrease
its energy consumption. Simulation results show that the proposed protocol is
able to achieve higher throughput and lower end-to-end packet delay than
conventional schemes. They also show that the TSC-M2MAC can achieve load
balancing, save energy, and remain stable when the network becomes saturated.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2011 14:49:26 GMT"
}
] | 2011-08-08T00:00:00 |
[
[
"Zhao",
"Bingxuan",
""
],
[
"Shimamoto",
"Shigeru",
""
]
] |
new_dataset
| 0.989 |
1108.1344
|
Nenad Stojanovski
|
Nenad Stojanovski, Marjan Gusev
|
Architecture Of A Identity Based Firewall System
|
9 pages, 3 figures, 1 table; (ISSN: 0975- 2307); International
Journal of Network Security & Its Applications July 2011, Volume 3, Number 4
| null |
10.5121/ijnsa
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Classic firewall systems are built to filter traffic based on IP addresses,
source and destination ports and protocol types. The modern networks have grown
to a level where the possibility for users' mobility is a must. In such
networks, modern firewalls may introduce such complexity where administration
can become very frustrating since it needs the intervention of a firewall
administrator. The solution for this problem is an identity based firewall
system. In this paper we will present a new design of a firewall system that
uses the user's identity to filter the traffic. In the design phase we will
define key points which have to be satisfied as a crucial milestone for the
functioning of the whole Identity based firewall system.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2011 14:54:25 GMT"
}
] | 2011-08-08T00:00:00 |
[
[
"Stojanovski",
"Nenad",
""
],
[
"Gusev",
"Marjan",
""
]
] |
new_dataset
| 0.981539 |
1108.1350
|
Ruichuan Chen
|
Ruichuan Chen, Eng Keong Lua, Jon Crowcroft, Liyong Tang, Zhong Chen
|
Phagocytes: A Holistic Defense and Protection Against Active P2P Worms
| null | null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Active Peer-to-Peer (P2P) worms present serious threats to the global
Internet by exploiting popular P2P applications to perform rapid topological
self-propagation. Active P2P worms pose more deadly threats than normal
scanning worms because they do not exhibit easily detectable anomalies, thus
many existing defenses are no longer effective.
We propose an immunity system with Phagocytes --- a small subset of elected
P2P hosts that are immune with high probability and specialized in finding and
"eating" worms in the P2P overlay. The Phagocytes will monitor their managed
P2P hosts' connection patterns and traffic volume in an attempt to detect
active P2P worm attacks. Once detected, local isolation, alert propagation and
software patching will take place for containment. The Phagocytes further
provide the access control and filtering mechanisms for communication
establishment between the internal P2P overlay and the external hosts. We
design a novel adaptive and interaction-based computational puzzle scheme at
the Phagocytes to restrain external worms attacking the P2P overlay, without
influencing legitimate hosts' experiences significantly. We implement a
prototype system, and evaluate its performance based on realistic massive-scale
P2P network traces. The evaluation results illustrate that our Phagocytes are
capable of achieving a total defense against active P2P worms.
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2011 15:24:38 GMT"
}
] | 2011-08-08T00:00:00 |
[
[
"Chen",
"Ruichuan",
""
],
[
"Lua",
"Eng Keong",
""
],
[
"Crowcroft",
"Jon",
""
],
[
"Tang",
"Liyong",
""
],
[
"Chen",
"Zhong",
""
]
] |
new_dataset
| 0.999636 |
1108.1353
|
Susheel Kumar k
|
K.Susheel Kumar, Vijay Bhaskar Semwal, R C Tripathi
|
Real time face recognition using adaboost improved fast PCA algorithm
|
14 pages; ISSN : 0975-900X (Online), 0976-2191 (Print)
|
International Journal of Artificial Intelligence & Applications
(IJAIA), Vol.2, No.3, July 2011, 45-58
| null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an automated system for human face recognition in a real
time background world for a large homemade dataset of persons face. The task is
very difficult as the real time background subtraction in an image is still a
challenge. Addition to this there is a huge variation in human face image in
terms of size, pose and expression. The system proposed collapses most of this
variance. To detect real time human face AdaBoost with Haar cascade is used and
a simple fast PCA and LDA is used to recognize the faces detected. The matched
face is then used to mark attendance in the laboratory, in our case. This
biometric system is a real time attendance system based on the human face
recognition with a simple and fast algorithms and gaining a high accuracy
rate..
|
[
{
"version": "v1",
"created": "Fri, 5 Aug 2011 15:41:31 GMT"
}
] | 2011-08-08T00:00:00 |
[
[
"Kumar",
"K. Susheel",
""
],
[
"Semwal",
"Vijay Bhaskar",
""
],
[
"Tripathi",
"R C",
""
]
] |
new_dataset
| 0.980368 |
1108.1060
|
Antonio Fern\'andez Anta
|
Jos\'e Luis L\'opez-Presa and Antonio Fern\'andez Anta and Luis
N\'u\~nez Chiroque
|
Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation
| null | null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present an algorithm, called conauto-2.0, that can
efficiently compute a set of generators of the automorphism group of a graph,
and test whether two graphs are isomorphic, finding an isomorphism if they are.
This algorithm uses the basic individualization/refinement technique, and is an
improved version of the algorithm conauto, which has been shown to be very fast
for random graphs and several families of hard graphs. In this paper, it is
proved that, under some circumstances, it is not only possible to prune the
search space (using already found generators of the automorphism group), but
also to infer new generators without the need of explicitly finding an
automorphism of the graph. This result is especially suited for graphs with
regularly connected components, and can be applied in any isomorphism testing
and canonical labeling algorithm (that use the individualization/refinement
technique) to significantly improve its performance. Additionally, a dynamic
target cell selection function is used to adapt to different graphs. The
resulting algorithm preserves all the nice features of conauto, but reduces the
time for testing graphs with regularly connected components and other hard
graph families. We run extensive experiments, which show that the most popular
algorithms (namely, nauty, bliss, Traces, and saucy) are slower than
conauto-2.0, among others, for the graph families based on components.
|
[
{
"version": "v1",
"created": "Thu, 4 Aug 2011 12:16:27 GMT"
}
] | 2011-08-05T00:00:00 |
[
[
"López-Presa",
"José Luis",
""
],
[
"Anta",
"Antonio Fernández",
""
],
[
"Chiroque",
"Luis Núñez",
""
]
] |
new_dataset
| 0.990006 |
1107.2451
|
Shigeki Matsutani
|
Shigeki Matsutani, Kota Nakano, and Katsuhiko Shinjo
|
Surface tension of multi-phase flow with multiple junctions governed by
the variational principle
|
54 pages, 3 figures
| null |
10.1007/s11040-011-9096-0
| null |
cs.NA math-ph math.DG math.MP math.NA physics.comp-ph physics.flu-dyn
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We explore a computational model of an incompressible fluid with a
multi-phase field in three-dimensional Euclidean space. By investigating an
incompressible fluid with a two-phase field geometrically, we reformulate the
expression of the surface tension for the two-phase field found by Lafaurie,
Nardone, Scardovelli, Zaleski and Zanetti (J. Comp. Phys. \vol{113} \yr{1994}
\pages{134-147}) as a variational problem related to an infinite dimensional
Lie group, the volume-preserving diffeomorphism. The variational principle to
the action integral with the surface energy reproduces their Euler equation of
the two-phase field with the surface tension. Since the surface energy of
multiple interfaces even with singularities is not difficult to be evaluated in
general and the variational formulation works for every action integral, the
new formulation enables us to extend their expression to that of a multi-phase
($N$-phase, $N\ge2$) flow and to obtain a novel Euler equation with the surface
tension of the multi-phase field. The obtained Euler equation governs the
equation of motion of the multi-phase field with different surface tension
coefficients without any difficulties for the singularities at multiple
junctions. In other words, we unify the theory of multi-phase fields which
express low dimensional interface geometry and the theory of the incompressible
fluid dynamics on the infinite dimensional geometry as a variational problem.
We apply the equation to the contact angle problems at triple junctions. We
computed the fluid dynamics for a two-phase field with a wall numerically and
show the numerical computational results that for given surface tension
coefficients, the contact angles are generated by the surface tension as
results of balances of the kinematic energy and the surface energy.
|
[
{
"version": "v1",
"created": "Wed, 13 Jul 2011 02:11:11 GMT"
},
{
"version": "v2",
"created": "Fri, 29 Jul 2011 02:27:51 GMT"
},
{
"version": "v3",
"created": "Tue, 2 Aug 2011 22:02:10 GMT"
}
] | 2011-08-04T00:00:00 |
[
[
"Matsutani",
"Shigeki",
""
],
[
"Nakano",
"Kota",
""
],
[
"Shinjo",
"Katsuhiko",
""
]
] |
new_dataset
| 0.983656 |
1108.0466
|
EPTCS
|
Viviana Bono (Torino, Italy), Luca Padovani (Torino, Italy)
|
Polymorphic Endpoint Types for Copyless Message Passing
|
In Proceedings ICE 2011, arXiv:1108.0144
|
EPTCS 59, 2011, pp. 52-67
|
10.4204/EPTCS.59.5
| null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present PolySing#, a calculus that models process interaction based on
copyless message passing, in the style of Singularity OS. We equip the calculus
with a type system that accommodates polymorphic endpoint types, which are a
variant of polymorphic session types, and we show that well-typed processes are
free from faults, leaks, and communication errors. The type system is
essentially linear, although linearity alone may leave room for scenarios where
well-typed processes leak memory. We identify a condition on endpoint types
that prevents these leaks from occurring.
|
[
{
"version": "v1",
"created": "Tue, 2 Aug 2011 02:27:18 GMT"
}
] | 2011-08-03T00:00:00 |
[
[
"Bono",
"Viviana",
"",
"Torino, Italy"
],
[
"Padovani",
"Luca",
"",
"Torino, Italy"
]
] |
new_dataset
| 0.989859 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.