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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0809.4183
|
Aslan Tchamkerten
|
Gildas Avoine and Aslan Tchamkerten
|
An Asymptotically Optimal RFID Authentication Protocol Against Relay
Attacks
|
10 pages
| null | null | null |
cs.CR cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Relay attacks are a major concern for RFID systems: during an authentication
process an adversary transparently relays messages between a verifier and a
remote legitimate prover.
We present an authentication protocol suited for RFID systems. Our solution
is the first that prevents relay attacks without degrading the authentication
security level: it minimizes the probability that the verifier accepts a fake
proof of identity, whether or not a relay attack occurs.
|
[
{
"version": "v1",
"created": "Wed, 24 Sep 2008 13:27:43 GMT"
}
] | 2008-09-25T00:00:00 |
[
[
"Avoine",
"Gildas",
""
],
[
"Tchamkerten",
"Aslan",
""
]
] |
new_dataset
| 0.999611 |
0809.3942
|
Philippe Hoogvorst
|
Philippe Hoogvorst, Sylvain Guilley, Sumanta Chaudhuri, Jean-Luc
Danger, Taha Beyrouthy and Laurent Fesquet
|
A Reconfigurable Programmable Logic Block for a Multi-Style Asynchronous
FPGA resistant to Side-Channel Attacks
|
29 pages
| null | null | null |
cs.CR cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Side-channel attacks are efficient attacks against cryptographic devices.
They use only quantities observable from outside, such as the duration and the
power consumption. Attacks against synchronous devices using electric
observations are facilitated by the fact that all transitions occur
simultaneously with some global clock signal. Asynchronous control remove this
synchronization and therefore makes it more difficult for the attacker to
insulate \emph{interesting intervals}. In addition the coding of data in an
asynchronous circuit is inherently more difficult to attack. This article
describes the Programmable Logic Block of an asynchronous FPGA resistant
against \emph{side-channel attacks}. Additionally it can implement different
styles of asynchronous control and of data representation.
|
[
{
"version": "v1",
"created": "Tue, 23 Sep 2008 15:27:06 GMT"
}
] | 2008-09-24T00:00:00 |
[
[
"Hoogvorst",
"Philippe",
""
],
[
"Guilley",
"Sylvain",
""
],
[
"Chaudhuri",
"Sumanta",
""
],
[
"Danger",
"Jean-Luc",
""
],
[
"Beyrouthy",
"Taha",
""
],
[
"Fesquet",
"Laurent",
""
]
] |
new_dataset
| 0.99921 |
0809.3503
|
Praveen Sivadasan
|
Praveen Sivadasan, P Sojan Lal, Naveen Sivadasan
|
JDATATRANS for Array Obfuscation in Java Source Code to Defeat Reverse
Engineering from Decompiled Codes
|
Manuscript submitted to ACM COMPUTE 2009 Conference,Bangalore
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Software obfuscation or obscuring a software is an approach to defeat the
practice of reverse engineering a software for using its functionality
illegally in the development of another software. Java applications are more
amenable to reverse engineering and re-engineering attacks through methods such
as decompilation because Java class files store the program in a semi complied
form called 'byte' codes. The existing obfuscation systems obfuscate the Java
class files. Obfuscated source code produce obfuscated byte codes and hence two
level obfuscation (source code and byte code level) of the program makes it
more resilient to reverse engineering attacks. But source code obfuscation is
much more difficult due to richer set of programming constructs and the scope
of the different variables used in the program and only very little progress
has been made on this front. Hence programmers resort to adhoc manual ways of
obscuring their program which makes it difficult for its maintenance and
usability. To address this issue partially, we developed a user friendly tool
JDATATRANS to obfuscate Java source code by obscuring the array usages. Using
various array restructuring techniques such as 'array splitting', 'array
folding' and 'array flattening', in addition to constant hiding, our system
obfuscate the input Java source code and produce an obfuscated Java source code
that is functionally equivalent to the input program. We also perform a number
of experiments to measure the potency, resilience and cost incurred by our
tool.
|
[
{
"version": "v1",
"created": "Sat, 20 Sep 2008 13:18:26 GMT"
}
] | 2008-09-23T00:00:00 |
[
[
"Sivadasan",
"Praveen",
""
],
[
"Lal",
"P Sojan",
""
],
[
"Sivadasan",
"Naveen",
""
]
] |
new_dataset
| 0.999717 |
0809.3584
|
Grenville Croll
|
Jocelyn Paine
|
Spreadsheet Components For All
|
19 Pages
|
Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2008 109-127
ISBN 978-905617-69-2
| null | null |
cs.SE cs.HC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have prototyped a "spreadsheet component repository" Web site, from which
users can copy "components" into their own Excel or Google spreadsheets.
Components are collections of cells containing formulae: in real life, they
would do useful calculations that many practitioners find hard to program, and
would be rigorously tested and documented. Crucially, the user can tell the
repository which cells in their spreadsheet to use for a componen's inputs and
outputs. The repository will then reshape the component to fit. A single
component can therefore be used in many different sizes and shapes of
spreadsheet. We hope to set up a spreadsheet equivalent of the high-quality
numerical subroutine libraries that revolutionised scientific computing, but
where instead of subroutines, the library contains such components.
|
[
{
"version": "v1",
"created": "Sun, 21 Sep 2008 13:31:35 GMT"
}
] | 2008-09-23T00:00:00 |
[
[
"Paine",
"Jocelyn",
""
]
] |
new_dataset
| 0.987719 |
0809.3280
|
Zheng Sun
|
Zheng Sun, Zhiqiang He, Ruochen Wang, Kai Niu
|
A Heuristic Scheduling Scheme in Multiuser OFDMA Networks
|
published in VTC Fall '08
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Conventional heterogeneous-traffic scheduling schemes utilize zero-delay
constraint for real-time services, which aims to minimize the average packet
delay among real-time users. However, in light or moderate load networks this
strategy is unnecessary and leads to low data throughput for non-real-time
users. In this paper, we propose a heuristic scheduling scheme to solve this
problem. The scheme measures and assigns scheduling priorities to both
real-time and non-real-time users, and schedules the radio resources for the
two user classes simultaneously. Simulation results show that the proposed
scheme efficiently handles the heterogeneous-traffic scheduling with diverse
QoS requirements and alleviates the unfairness between real-time and
non-real-time services under various traffic loads.
|
[
{
"version": "v1",
"created": "Fri, 19 Sep 2008 01:25:16 GMT"
}
] | 2008-09-22T00:00:00 |
[
[
"Sun",
"Zheng",
""
],
[
"He",
"Zhiqiang",
""
],
[
"Wang",
"Ruochen",
""
],
[
"Niu",
"Kai",
""
]
] |
new_dataset
| 0.968808 |
0809.3415
|
Cl\'emence Magnien
|
Frederic Aidouni, Matthieu Latapy and Clemence Magnien
|
Ten weeks in the life of an eDonkey server
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a capture of the queries managed by an eDonkey server
during almost 10 weeks, leading to the observation of almost 9 billion messages
involving almost 90 million users and more than 275 million distinct files.
Acquisition and management of such data raises several challenges, which we
discuss as well as the solutions we developed. We obtain a very rich dataset,
orders of magnitude larger than previously avalaible ones, which we provide for
public use. We finally present basic analysis of the obtained data, which
already gives evidence of non-trivial features.
|
[
{
"version": "v1",
"created": "Fri, 19 Sep 2008 16:45:26 GMT"
}
] | 2008-09-22T00:00:00 |
[
[
"Aidouni",
"Frederic",
""
],
[
"Latapy",
"Matthieu",
""
],
[
"Magnien",
"Clemence",
""
]
] |
new_dataset
| 0.997924 |
0807.3223
|
Vincent Hugel
|
David Gouaillier, Vincent Hugel, Pierre Blazevic, Chris Kilner, Jerome
Monceaux, Pascal Lafourcade, Brice Marnier, Julien Serre, Bruno Maisonnier
|
The NAO humanoid: a combination of performance and affordability
|
This paper has been withdrawn by the author(s) for revision
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article presents the design of the autonomous humanoid robot called NAO
that is built by the French company Aldebaran-Robotics. With its height of 0.57
m and its weight about 4.5 kg, this innovative robot is lightweight and
compact. It distinguishes itself from its existing Japanese, American, and
other counterparts thanks to its pelvis kinematics design, its proprietary
actuation system based on brush DC motors, its electronic, computer and
distributed software architectures. This robot has been designed to be
affordable without sacrificing quality and performance. It is an open and
easy-to-handle platform where the user can change all the embedded system
software or just add some applications to make the robot adopt specific
behaviours. The robot's head and forearms are modular and can be changed to
promote further evolution. The comprehensive and functional design is one of
the reasons that helped select NAO to replace the AIBO quadrupeds in the 2008
RoboCup standard league.
|
[
{
"version": "v1",
"created": "Mon, 21 Jul 2008 09:28:09 GMT"
},
{
"version": "v2",
"created": "Sun, 21 Sep 2008 18:41:16 GMT"
}
] | 2008-09-21T00:00:00 |
[
[
"Gouaillier",
"David",
""
],
[
"Hugel",
"Vincent",
""
],
[
"Blazevic",
"Pierre",
""
],
[
"Kilner",
"Chris",
""
],
[
"Monceaux",
"Jerome",
""
],
[
"Lafourcade",
"Pascal",
""
],
[
"Marnier",
"Brice",
""
],
[
"Serre",
"Julien",
""
],
[
"Maisonnier",
"Bruno",
""
]
] |
new_dataset
| 0.998542 |
0809.3140
|
Fang Wei
|
Georg Gottlob, Reinhard Pichler, Fang Wei
|
Monadic Datalog over Finite Structures with Bounded Treewidth
| null | null | null | null |
cs.DB cs.CC cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key
concepts in establishing fixed-parameter tractability results. Indeed, by
Courcelle's Theorem we know: Any property of finite structures, which is
expressible by an MSO sentence, can be decided in linear time (data complexity)
if the structures have bounded treewidth.
In principle, Courcelle's Theorem can be applied directly to construct
concrete algorithms by transforming the MSO evaluation problem into a tree
language recognition problem. The latter can then be solved via a finite tree
automaton (FTA). However, this approach has turned out to be problematical,
since even relatively simple MSO formulae may lead to a ``state explosion'' of
the FTA.
In this work we propose monadic datalog (i.e., datalog where all intentional
predicate symbols are unary) as an alternative method to tackle this class of
fixed-parameter tractable problems. We show that if some property of finite
structures is expressible in MSO then this property can also be expressed by
means of a monadic datalog program over the structure plus the tree
decomposition.
Moreover, we show that the resulting fragment of datalog can be evaluated in
linear time (both w.r.t. the program size and w.r.t. the data size). This new
approach is put to work by devising new algorithms for the 3-Colorability
problem of graphs and for the PRIMALITY problem of relational schemas (i.e.,
testing if some attribute in a relational schema is part of a key). We also
report on experimental results with a prototype implementation.
|
[
{
"version": "v1",
"created": "Thu, 18 Sep 2008 12:40:49 GMT"
}
] | 2008-09-19T00:00:00 |
[
[
"Gottlob",
"Georg",
""
],
[
"Pichler",
"Reinhard",
""
],
[
"Wei",
"Fang",
""
]
] |
new_dataset
| 0.998403 |
0809.2691
|
Jerome Darmont
|
Marouane Hachicha (ERIC), Hadj Mahboubi (ERIC), J\'er\^ome Darmont
(ERIC)
|
Expressing OLAP operators with the TAX XML algebra
|
in 3rd International Workshop on Database Technologies for Handling
XML Information on the Web (DataX-EDBT 08), Nantes : France (2008)
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the rise of XML as a standard for representing business data, XML data
warehouses appear as suitable solutions for Web-based decision-support
applications. In this context, it is necessary to allow OLAP analyses over XML
data cubes (XOLAP). Thus, XQuery extensions are needed. To help define a formal
framework and allow much-needed performance optimizations on analytical queries
expressed in XQuery, having an algebra at one's disposal is desirable. However,
XOLAP approaches and algebras from the literature still largely rely on the
relational model and/or only feature a small number of OLAP operators. In
opposition, we propose in this paper to express a broad set of OLAP operators
with the TAX XML algebra.
|
[
{
"version": "v1",
"created": "Tue, 16 Sep 2008 12:12:15 GMT"
}
] | 2008-09-17T00:00:00 |
[
[
"Hachicha",
"Marouane",
"",
"ERIC"
],
[
"Mahboubi",
"Hadj",
"",
"ERIC"
],
[
"Darmont",
"Jérôme",
"",
"ERIC"
]
] |
new_dataset
| 0.998566 |
0706.0431
|
Wolfgang Steiner
|
Emilie Charlier, Michel Rigo, Wolfgang Steiner (LIAFA)
|
Abstract numeration systems on bounded languages and multiplication by a
constant
| null |
Integers: Electronic Journal of Combinatorial Number Theory 8, 1
(2008) #35
| null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A set of integers is $S$-recognizable in an abstract numeration system $S$ if
the language made up of the representations of its elements is accepted by a
finite automaton. For abstract numeration systems built over bounded languages
with at least three letters, we show that multiplication by an integer
$\lambda\ge2$ does not preserve $S$-recognizability, meaning that there always
exists a $S$-recognizable set $X$ such that $\lambda X$ is not
$S$-recognizable. The main tool is a bijection between the representation of an
integer over a bounded language and its decomposition as a sum of binomial
coefficients with certain properties, the so-called combinatorial numeration
system.
|
[
{
"version": "v1",
"created": "Mon, 4 Jun 2007 13:12:37 GMT"
},
{
"version": "v2",
"created": "Tue, 16 Sep 2008 10:13:27 GMT"
}
] | 2008-09-16T00:00:00 |
[
[
"Charlier",
"Emilie",
"",
"LIAFA"
],
[
"Rigo",
"Michel",
"",
"LIAFA"
],
[
"Steiner",
"Wolfgang",
"",
"LIAFA"
]
] |
new_dataset
| 0.994148 |
0809.2315
|
Irfan Siap
|
Taher Abualrub, Ali Ghrayeb, Nuh Aydin, and Irfan Siap
|
On the Construction of Skew Quasi-Cyclic Codes
|
12 pages. submitted
| null | null | null |
cs.IT cs.DM math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we study a special type of quasi-cyclic (QC) codes called skew
QC codes. This set of codes is constructed using a non-commutative ring called
the skew polynomial rings $F[x;\theta ]$. After a brief description of the skew
polynomial ring $F[x;\theta ]$ it is shown that skew QC codes are left
submodules of the ring $R_{s}^{l}=(F[x;\theta ]/(x^{s}-1))^{l}.$ The notions of
generator and parity-check polynomials are given. We also introduce the notion
of similar polynomials in the ring $F[x;\theta ]$ and show that parity-check
polynomials for skew QC codes are unique up to similarity. Our search results
lead to the construction of several new codes with Hamming distances exceeding
the Hamming distances of the previously best known linear codes with comparable
parameters.
|
[
{
"version": "v1",
"created": "Sat, 13 Sep 2008 06:04:49 GMT"
}
] | 2008-09-16T00:00:00 |
[
[
"Abualrub",
"Taher",
""
],
[
"Ghrayeb",
"Ali",
""
],
[
"Aydin",
"Nuh",
""
],
[
"Siap",
"Irfan",
""
]
] |
new_dataset
| 0.990832 |
0809.2525
|
Michel Grabisch
|
Michel Grabisch (CES), Pedro Miranda
|
On the vertices of the k-addiive core
| null |
Discrete Mathematics (2008) 5204-5217
| null | null |
cs.DM cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The core of a game $v$ on $N$, which is the set of additive games $\phi$
dominating $v$ such that $\phi(N)=v(N)$, is a central notion in cooperative
game theory, decision making and in combinatorics, where it is related to
submodular functions, matroids and the greedy algorithm. In many cases however,
the core is empty, and alternative solutions have to be found. We define the
$k$-additive core by replacing additive games by $k$-additive games in the
definition of the core, where $k$-additive games are those games whose M\"obius
transform vanishes for subsets of more than $k$ elements. For a sufficiently
high value of $k$, the $k$-additive core is nonempty, and is a convex closed
polyhedron. Our aim is to establish results similar to the classical results of
Shapley and Ichiishi on the core of convex games (corresponds to Edmonds'
theorem for the greedy algorithm), which characterize the vertices of the core.
|
[
{
"version": "v1",
"created": "Mon, 15 Sep 2008 13:33:53 GMT"
}
] | 2008-09-16T00:00:00 |
[
[
"Grabisch",
"Michel",
"",
"CES"
],
[
"Miranda",
"Pedro",
""
]
] |
new_dataset
| 0.996269 |
cs/0609062
|
James Cheney
|
James Cheney, Christian Urban
|
Nominal Logic Programming
|
46 pages; 19 page appendix; 13 figures. Revised journal submission as
of July 23, 2007
|
ACM Transactions on Programming Languages and Systems 30(5):26,
August 2008
|
10.1145/1387673.1387675
| null |
cs.PL cs.LO
| null |
Nominal logic is an extension of first-order logic which provides a simple
foundation for formalizing and reasoning about abstract syntax modulo
consistent renaming of bound names (that is, alpha-equivalence). This article
investigates logic programming based on nominal logic. We describe some typical
nominal logic programs, and develop the model-theoretic, proof-theoretic, and
operational semantics of such programs. Besides being of interest for ensuring
the correct behavior of implementations, these results provide a rigorous
foundation for techniques for analysis and reasoning about nominal logic
programs, as we illustrate via examples.
|
[
{
"version": "v1",
"created": "Tue, 12 Sep 2006 09:32:23 GMT"
},
{
"version": "v2",
"created": "Mon, 20 Aug 2007 13:36:28 GMT"
}
] | 2008-09-15T00:00:00 |
[
[
"Cheney",
"James",
""
],
[
"Urban",
"Christian",
""
]
] |
new_dataset
| 0.998847 |
0809.1659
|
Robert Paul Morris
|
Scott Bardsley, Theodosios Thomas, and R. Paul Morris
|
A Tiered Security System for Mobile Devices
|
10 pages, 2 figures
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We have designed a tiered security system for mobile devices where each
security tier holds user-defined security triggers and actions. It has a
friendly interface that allows users to easily define and configure the
different circumstances and actions they need according to context. The system
can be set up and activated from any browser or directly on the mobile device
itself. When the security system is operated from a Web site or server, its
configuration can be readily shared across multiple devices. When operated
directly from the mobile device, no server is needed for activation. Many
different types of security circumstances and actions can be set up and
employed from its tiers. Security circumstances can range from temporary
misplacement of a mobile device at home to malicious theft in a hostile region.
Security actions can range from ringing a simple alarm to automatically
erasing, overwriting, and re-erasing drives.
|
[
{
"version": "v1",
"created": "Tue, 9 Sep 2008 20:23:51 GMT"
}
] | 2008-09-11T00:00:00 |
[
[
"Bardsley",
"Scott",
""
],
[
"Thomas",
"Theodosios",
""
],
[
"Morris",
"R. Paul",
""
]
] |
new_dataset
| 0.99753 |
0809.1710
|
Sreyash Kenkre
|
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
|
Circumference, Chromatic Number and Online Coloring
|
12 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Erd\"os conjectured that if $G$ is a triangle free graph of chromatic number
at least $k\geq 3$, then it contains an odd cycle of length at least
$k^{2-o(1)}$ \cite{sudakovverstraete, verstraete}. Nothing better than a linear
bound (\cite{gyarfas}, Problem 5.1.55 in \cite{West}) was so far known. We make
progress on this conjecture by showing that $G$ contains an odd cycle of length
at least $O(k\log\log k)$. Erd\"os' conjecture is known to hold for graphs with
girth at least 5. We show that if a girth 4 graph is $C_5$ free, then Erd\"os'
conjecture holds. When the number of vertices is not too large we can prove
better bounds on $\chi$. We also give bounds on the chromatic number of graphs
with at most $r$ cycles of length $1\bmod k$, or at most $s$ cycles of length
$2\bmod k$, or no cycles of length $3\bmod k$. Our techniques essentially
consist of using a depth first search tree to decompose the graph into ordered
paths, which are then fed to an online coloring algorithm. Using this technique
we give simple proofs of some old results, and also obtain several simpler
results. We also obtain a lower bound on the number of colors an online
coloring algorithm needs to use on triangle free graphs.
|
[
{
"version": "v1",
"created": "Wed, 10 Sep 2008 05:42:17 GMT"
}
] | 2008-09-11T00:00:00 |
[
[
"Diwan",
"Ajit A.",
""
],
[
"Kenkre",
"Sreyash",
""
],
[
"Vishwanathan",
"Sundar",
""
]
] |
new_dataset
| 0.98112 |
0809.1790
|
Carlos Perez-Delgado
|
Donny Cheung, Carlos A. Perez-Delgado
|
Cellular Automata as a Model of Physical Systems
|
To appear in the Proceedings of AUTOMATA 2007
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cellular Automata (CA), as they are presented in the literature, are abstract
mathematical models of computation. In this pa- per we present an alternate
approach: using the CA as a model or theory of physical systems and devices.
While this approach abstracts away all details of the underlying physical
system, it remains faithful to the fact that there is an underlying physical
reality which it describes. This imposes certain restrictions on the types of
computations a CA can physically carry out, and the resources it needs to do
so. In this paper we explore these and other consequences of our
reformalization.
|
[
{
"version": "v1",
"created": "Wed, 10 Sep 2008 13:46:25 GMT"
}
] | 2008-09-11T00:00:00 |
[
[
"Cheung",
"Donny",
""
],
[
"Perez-Delgado",
"Carlos A.",
""
]
] |
new_dataset
| 0.998976 |
0801.1783
|
Olivier Finkel
|
Jacques Duparc (UNIL), Olivier Finkel (LIP)
|
An omega-power of a context-free language which is Borel above
Delta^0_omega
|
To appear in the Proceedings of the International Conference
Foundations of the Formal Sciences V : Infinite Games, November 26th to 29th,
2004, Bonn, Germany, Stefan Bold, Benedikt L\"owe, Thoralf R\"asch, Johan van
Benthem (eds.), College Publications at King's College (Studies in Logic),
2007
|
Dans Proceedings of the International Conference on Foundations of
the Formal Sciences V : Infinite Games - Foundations of the Formal Sciences V
: Infinite Games, November 26-29, 2004, Bonn : Allemagne
| null | null |
cs.CC cs.GT cs.LO math.LO
| null |
We use erasers-like basic operations on words to construct a set that is both
Borel and above Delta^0_omega, built as a set V^\omega where V is a language of
finite words accepted by a pushdown automaton. In particular, this gives a
first example of an omega-power of a context free language which is a Borel set
of infinite rank.
|
[
{
"version": "v1",
"created": "Fri, 11 Jan 2008 14:20:30 GMT"
}
] | 2008-09-10T00:00:00 |
[
[
"Duparc",
"Jacques",
"",
"UNIL"
],
[
"Finkel",
"Olivier",
"",
"LIP"
]
] |
new_dataset
| 0.999025 |
0809.1618
|
Antonio Pereira
|
Antonio Pereira
|
ECOLANG - Communications Language for Ecological Simulations Network
|
16 pages, language specification description
| null | null |
TR-LIACC-FEUP-AMCP 01.1
|
cs.AI cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document describes the communication language used in one multiagent
system environment for ecological simulations, based on EcoDynamo simulator
application linked with several intelligent agents and visualisation
applications, and extends the initial definition of the language. The agents
actions and perceptions are translated into messages exchanged with the
simulator application and other agents. The concepts and definitions used
follow the BNF notation (Backus et al. 1960) and is inspired in the Coach
Unilang language (Reis and Lau 2002).
|
[
{
"version": "v1",
"created": "Tue, 9 Sep 2008 17:46:17 GMT"
}
] | 2008-09-10T00:00:00 |
[
[
"Pereira",
"Antonio",
""
]
] |
new_dataset
| 0.964977 |
0809.1177
|
Andrzej Karbowski
|
Andrzej Karbowski
|
Amdahl's and Gustafson-Barsis laws revisited
| null | null | null | null |
cs.DC cs.GT cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents a simple derivation of the Gustafson-Barsis law from the
Amdahl's law. In the computer literature these two laws describing the speedup
limits of parallel applications are derived separately. It is shown, that
treating the time of the execution of the sequential part of the application as
a constant, in few lines the Gustafson-Barsis law can be obtained from the
Amdahl's law and that the popular claim, that Gustafson-Barsis law overthrows
Amdahl's law is a mistake.
|
[
{
"version": "v1",
"created": "Sat, 6 Sep 2008 15:06:53 GMT"
}
] | 2008-09-09T00:00:00 |
[
[
"Karbowski",
"Andrzej",
""
]
] |
new_dataset
| 0.999621 |
cs/0703096
|
Aleksandar Donev
|
Aleksandar Donev
|
Asynchronous Event-Driven Particle Algorithms
|
To appear in Simulation: Transactions of the Society for Modeling and
Simulation International, 2008
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present, in a unifying way, the main components of three asynchronous
event-driven algorithms for simulating physical systems of interacting
particles. The first example, hard-particle molecular dynamics, is well-known.
We also present a recently-developed diffusion kinetic Monte Carlo algorithm,
as well as a novel stochastic molecular-dynamics algorithm that builds on the
Direct Simulation Monte Carlo. We explain how to effectively combine
asynchronous event-driven with classical time-driven or with synchronous
event-driven handling. Finally, we discuss some promises and challenges for
event-driven simulation of realistic physical systems.
|
[
{
"version": "v1",
"created": "Tue, 20 Mar 2007 16:52:20 GMT"
},
{
"version": "v2",
"created": "Tue, 9 Sep 2008 19:13:32 GMT"
}
] | 2008-09-09T00:00:00 |
[
[
"Donev",
"Aleksandar",
""
]
] |
new_dataset
| 0.962171 |
0809.0833
|
Fabien Mathieu
|
Fabien Mathieu (INRIA Rocquencourt, FT R&D, INRIA Rocquencourt),
Gheorghe Postelnicu, Julien Reynier (INRIA Rocquencourt)
|
The stable configuration in acyclic preference-based systems
| null | null | null |
RR-6628
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Acyclic preferences recently appeared as an elegant way to model many
distributed systems. An acyclic instance admits a unique stable configuration,
which can reveal the performance of the system. In this paper, we give the
statistical properties of the stable configuration for three classes of acyclic
preferences: node-based preferences, distance-based preferences, and random
acyclic systems. Using random overlay graphs, we prove using mean-field and
fluid-limit techniques that these systems have an asymptotically continuous
independent rank distribution for a proper scaling, and the analytical solution
is compared to simulations. These results provide a theoretical ground for
validating the performance of bandwidth-based or proximity-based unstructured
systems.
|
[
{
"version": "v1",
"created": "Thu, 4 Sep 2008 15:12:00 GMT"
}
] | 2008-09-05T00:00:00 |
[
[
"Mathieu",
"Fabien",
"",
"INRIA Rocquencourt, FT R&D, INRIA Rocquencourt"
],
[
"Postelnicu",
"Gheorghe",
"",
"INRIA Rocquencourt"
],
[
"Reynier",
"Julien",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.988092 |
0802.1785
|
Ryutaroh Matsumoto
|
Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu
|
Near ML detection using Dijkstra's algorithm with bounded list size over
MIMO channels
|
8 pages, two column, 14 figures, LaTeX2e
|
Proceedings of 2008 IEEE International Symposium on Information
Theory, pp. 2022-2025, 2008
|
10.1109/ISIT.2008.4595344
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose Dijkstra's algorithm with bounded list size after QR decomposition
for decreasing the computational complexity of near maximum-likelihood (ML)
detection of signals over multiple-input-multiple-output (MIMO) channels. After
that, we compare the performances of proposed algorithm, QR decomposition
M-algorithm (QRD-MLD), and its improvement. When the list size is set to
achieve the almost same symbol error rate (SER) as the QRD-MLD, the proposed
algorithm has smaller average computational complexity.
|
[
{
"version": "v1",
"created": "Wed, 13 Feb 2008 09:43:14 GMT"
}
] | 2008-09-02T00:00:00 |
[
[
"Okawado",
"Atsushi",
""
],
[
"Matsumoto",
"Ryutaroh",
""
],
[
"Uyematsu",
"Tomohiko",
""
]
] |
new_dataset
| 0.98114 |
0709.0749
|
Ketan Mulmuley D
|
Ketan D. Mulmuley
|
Geometric Complexity Theory VII: Nonstandard quantum group for the
plethysm problem
|
59 pages, changed content
| null | null |
TR-2007-14, comp. sci. dept., The University Of Chicago
|
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This article describes a {\em nonstandard} quantum group that may be used to
derive a positive formula for the plethysm problem, just as the standard
(Drinfeld-Jimbo) quantum group can be used to derive the positive
Littlewood-Richardson rule for arbitrary complex semisimple Lie groups. The
sequel \cite{GCT8} gives conjecturally correct algorithms to construct
canonical bases of the coordinate rings of these nonstandard quantum groups and
canonical bases of the dually paired nonstandard deformations of the symmetric
group algebra. A positive $#P$-formula for the plethysm constant follows from
the conjectural properties of these canonical bases and the duality and
reciprocity conjectures herein.
|
[
{
"version": "v1",
"created": "Wed, 5 Sep 2007 22:23:15 GMT"
},
{
"version": "v2",
"created": "Mon, 1 Sep 2008 17:06:03 GMT"
}
] | 2008-09-01T00:00:00 |
[
[
"Mulmuley",
"Ketan D.",
""
]
] |
new_dataset
| 0.980798 |
0808.4060
|
Wojciech Mazurczyk
|
Krzysztof Szczypiorski, Igor Margasinski, Wojciech Mazurczyk,
Krzysztof Cabaj, Pawel Radziszewski
|
TrustMAS: Trusted Communication Platform for Multi-Agent Systems
|
18 pages, 7 figures, accepted to The 3rd International Symposium on
Information Security (IS'08), Monterrey, Mexico, November 10-11, 2008
(Proceedings will be published by Springer LNCS)
| null | null | null |
cs.CR cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper presents TrustMAS - Trusted Communication Platform for Multi-Agent
Systems, which provides trust and anonymity for mobile agents. The platform
includes anonymous technique based on random-walk algorithm for providing
general purpose anonymous communication for agents. All agents, which take part
in the proposed platform, benefit from trust and anonymity that is provided for
their interactions. Moreover, in TrustMAS there are StegAgents (SA) that are
able to perform various steganographic communication. To achieve that goal, SAs
may use methods in different layers of TCP/IP model or specialized middleware
enabling steganography that allows hidden communication through all layers of
mentioned model. In TrustMAS steganographic channels are used to exchange
routing tables between StegAgents. Thus all StegAgents in TrustMAS with their
ability to exchange information by using hidden channels form distributed
steganographic router (Stegrouter).
|
[
{
"version": "v1",
"created": "Fri, 29 Aug 2008 10:02:20 GMT"
}
] | 2008-09-01T00:00:00 |
[
[
"Szczypiorski",
"Krzysztof",
""
],
[
"Margasinski",
"Igor",
""
],
[
"Mazurczyk",
"Wojciech",
""
],
[
"Cabaj",
"Krzysztof",
""
],
[
"Radziszewski",
"Pawel",
""
]
] |
new_dataset
| 0.993067 |
0808.3889
|
Manuel Tomas Carrasco Benitez Mr.
|
M.T. Carrasco Benitez
|
Open architecture for multilingual parallel texts
|
22 pages - for comments to the author and follow-ups go to
http://dragoman.org/par
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
Multilingual parallel texts (abbreviated to parallel texts) are linguistic
versions of the same content ("translations"); e.g., the Maastricht Treaty in
English and Spanish are parallel texts. This document is about creating an open
architecture for the whole Authoring, Translation and Publishing Chain
(ATP-chain) for the processing of parallel texts.
|
[
{
"version": "v1",
"created": "Thu, 28 Aug 2008 11:59:34 GMT"
}
] | 2008-08-29T00:00:00 |
[
[
"Benitez",
"M. T. Carrasco",
""
]
] |
new_dataset
| 0.97639 |
0808.3693
|
Xavier Grehant
|
Xavier Grehant and J.M. Dana
|
Providing Virtual Execution Environments: A Twofold Illustration
|
openlab Technical Documents and Publications
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Platform virtualization helps solving major grid computing challenges: share
resource with flexible, user-controlled and custom execution environments and
in the meanwhile, isolate failures and malicious code. Grid resource management
tools will evolve to embrace support for virtual resource.
We present two open source projects that transparently supply virtual
execution environments. Tycoon has been developed at HP Labs to optimise
resource usage in creating an economy where users bid to access virtual
machines and compete for CPU cycles. SmartDomains provides a peer-to-peer layer
that automates virtual machines deployment using a description language and
deployment engine from HP Labs. These projects demonstrate both client-server
and peer-to-peer approaches to virtual resource management. The first case
makes extensive use of virtual machines features for dynamic resource
allocation. The second translates virtual machines capabilities into a
sophisticated language where resource management components can be plugged in
configurations and architectures defined at deployment time.
We propose to share our experience at CERN openlab developing SmartDomains
and deploying Tycoon to give an illustrative introduction to emerging research
in virtual resource management.
|
[
{
"version": "v1",
"created": "Wed, 27 Aug 2008 12:48:39 GMT"
}
] | 2008-08-28T00:00:00 |
[
[
"Grehant",
"Xavier",
""
],
[
"Dana",
"J. M.",
""
]
] |
new_dataset
| 0.996194 |
0805.2938
|
Wojciech Mazurczyk
|
Wojciech Mazurczyk and Krzysztof Szczypiorski
|
Steganography of VoIP Streams
|
18 pages, 9 figures, content changed, accepted to The 3rd
International Symposium on Information Security (IS'08), Monterrey, Mexico,
November 10-11, 2008 (Proceedings will be published by Springer LNCS)
| null | null | null |
cs.MM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper concerns available steganographic techniques that can be used for
creating covert channels for VoIP (Voice over Internet Protocol) streams. Apart
from characterizing existing steganographic methods we provide new insights by
presenting two new techniques. The first one is network steganography solution
which exploits free/unused protocols' fields and is known for IP, UDP or TCP
protocols but has never been applied to RTP (Real-Time Transport Protocol) and
RTCP (Real-Time Control Protocol) which are characteristic for VoIP. The second
method, called LACK (Lost Audio Packets Steganography), provides hybrid
storage-timing covert channel by utilizing delayed audio packets. The results
of the experiment, that was performed to estimate a total amount of data that
can be covertly transferred during typical VoIP conversation phase, regardless
of steganalysis, are also included in this paper.
|
[
{
"version": "v1",
"created": "Mon, 19 May 2008 20:46:38 GMT"
},
{
"version": "v2",
"created": "Mon, 25 Aug 2008 10:40:57 GMT"
}
] | 2008-08-25T00:00:00 |
[
[
"Mazurczyk",
"Wojciech",
""
],
[
"Szczypiorski",
"Krzysztof",
""
]
] |
new_dataset
| 0.994945 |
0807.1523
|
Philippe Dumas
|
Philippe Dumas (INRIA Rocquencourt)
|
Mean asymptotic behaviour of radix-rational sequences and dilation
equations (Extended version)
| null | null | null | null |
cs.DM math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The generating series of a radix-rational sequence is a rational formal power
series from formal language theory viewed through a fixed radix numeration
system. For each radix-rational sequence with complex values we provide an
asymptotic expansion for the sequence of its Ces\`aro means. The precision of
the asymptotic expansion depends on the joint spectral radius of the linear
representation of the sequence; the coefficients are obtained through some
dilation equations. The proofs are based on elementary linear algebra.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2008 19:15:48 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Aug 2008 19:52:55 GMT"
}
] | 2008-08-21T00:00:00 |
[
[
"Dumas",
"Philippe",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.998459 |
0808.2703
|
Alfonso Martinez
|
Alfonso Martinez
|
Low-Signal-Energy Asymptotics of Capacity and Mutual Information for the
Discrete-Time Poisson Channel
|
Submitted to IEEE Trans. Inf. Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The first terms of the low-signal-energy asymptotics for the mutual
information in the discrete-time Poisson channel are derived and compared to an
asymptotic expression of the capacity. In the presence of non-zero additive
noise (either Poisson or geometric), the mutual information is concave at zero
signal-energy and the minimum energy per bit is not attained at zero capacity.
Fixed signal constellations which scale with the signal energy do not attain
the minimum energy per bit. The minimum energy per bit is zero when additive
Poisson noise is present and $\ew\log 2$ when additive geometric noise of mean
$\ew$ is present.
|
[
{
"version": "v1",
"created": "Wed, 20 Aug 2008 07:43:18 GMT"
}
] | 2008-08-21T00:00:00 |
[
[
"Martinez",
"Alfonso",
""
]
] |
new_dataset
| 0.97458 |
0805.3339
|
Daniel Lemire
|
Kamel Aouiche, Daniel Lemire, Owen Kaser
|
Tri de la table de faits et compression des index bitmaps avec
alignement sur les mots
|
to appear at BDA'08
| null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Bitmap indexes are frequently used to index multidimensional data. They rely
mostly on sequential input/output. Bitmaps can be compressed to reduce
input/output costs and minimize CPU usage. The most efficient compression
techniques are based on run-length encoding (RLE), such as Word-Aligned Hybrid
(WAH) compression. This type of compression accelerates logical operations
(AND, OR) over the bitmaps. However, run-length encoding is sensitive to the
order of the facts. Thus, we propose to sort the fact tables. We review
lexicographic, Gray-code, and block-wise sorting. We found that a lexicographic
sort improves compression--sometimes generating indexes twice as small--and
make indexes several times faster. While sorting takes time, this is partially
offset by the fact that it is faster to index a sorted table. Column order is
significant: it is generally preferable to put the columns having more distinct
values at the beginning. A block-wise sort is much less efficient than a full
sort. Moreover, we found that Gray-code sorting is not better than
lexicographic sorting when using word-aligned compression.
|
[
{
"version": "v1",
"created": "Wed, 21 May 2008 19:50:46 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Jul 2008 23:46:51 GMT"
},
{
"version": "v3",
"created": "Fri, 15 Aug 2008 00:08:42 GMT"
}
] | 2008-08-15T00:00:00 |
[
[
"Aouiche",
"Kamel",
""
],
[
"Lemire",
"Daniel",
""
],
[
"Kaser",
"Owen",
""
]
] |
new_dataset
| 0.99834 |
0808.1470
|
Sudhakar Sahoo
|
Sudhakar Sahoo, Sanjaya Sahoo, Birendra Kumar Nayak and Pabitra Pal
Choudhury
|
Encompression Using Two-dimensional Cellular Automata Rules
|
5 pages, 4 figures
| null | null | null |
cs.DM cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we analyze the algebraic structure of some null boundary as
well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing
a new matrix multiplication operation using only AND, OR instead of most
commonly used AND, EX-OR. This class includes any CA whose rule, when written
as an algebra, is a finite Abelean cyclic group in case of periodic boundary
and a finite commutative cyclic monoid in case of null boundary CA
respectively. The concept of 1-D Multiple Attractor Cellular Automata (MACA) is
extended to 2-D. Using the family of 2-D MACA and the finite Abelian cyclic
group, an efficient encompression algorithm is proposed for binary images.
|
[
{
"version": "v1",
"created": "Mon, 11 Aug 2008 09:11:44 GMT"
}
] | 2008-08-12T00:00:00 |
[
[
"Sahoo",
"Sudhakar",
""
],
[
"Sahoo",
"Sanjaya",
""
],
[
"Nayak",
"Birendra Kumar",
""
],
[
"Choudhury",
"Pabitra Pal",
""
]
] |
new_dataset
| 0.999213 |
0808.1215
|
Joseph Y. Halpern
|
Joseph Y. Halpern and Vicky Weissman
|
A Formal Foundation for XrML
| null | null | null | null |
cs.CR cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
XrML is becoming a popular language in industry for writing software
licenses. The semantics for XrML is implicitly given by an algorithm that
determines if a permission follows from a set of licenses. We focus on a
fragment of the language and use it to highlight some problematic aspects of
the algorithm. We then correct the problems, introduce formal semantics, and
show that our semantics captures the (corrected) algorithm. Next, we consider
the complexity of determining if a permission is implied by a set of XrML
licenses. We prove that the general problem is undecidable, but it is
polynomial-time computable for an expressive fragment of the language. We
extend XrML to capture a wider range of licenses by adding negation to the
language. Finally, we discuss the key differences between XrML and MPEG-21, an
international standard based on XrML.
|
[
{
"version": "v1",
"created": "Fri, 8 Aug 2008 16:25:58 GMT"
}
] | 2008-08-11T00:00:00 |
[
[
"Halpern",
"Joseph Y.",
""
],
[
"Weissman",
"Vicky",
""
]
] |
new_dataset
| 0.976397 |
0808.0920
|
Mahesh Arumugam
|
Mahesh Arumugam
|
A Distributed and Deterministic TDMA Algorithm for
Write-All-With-Collision Model
|
14 pages
| null | null | null |
cs.OS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Several self-stabilizing time division multiple access (TDMA) algorithms are
proposed for sensor networks. In addition to providing a collision-free
communication service, such algorithms enable the transformation of programs
written in abstract models considered in distributed computing literature into
a model consistent with sensor networks, i.e., write all with collision (WAC)
model. Existing TDMA slot assignment algorithms have one or more of the
following properties: (i) compute slots using a randomized algorithm, (ii)
assume that the topology is known upfront, and/or (iii) assign slots
sequentially. If these algorithms are used to transform abstract programs into
programs in WAC model then the transformed programs are probabilistically
correct, do not allow the addition of new nodes, and/or converge in a
sequential fashion. In this paper, we propose a self-stabilizing deterministic
TDMA algorithm where a sensor is aware of only its neighbors. We show that the
slots are assigned to the sensors in a concurrent fashion and starting from
arbitrary initial states, the algorithm converges to states where
collision-free communication among the sensors is restored. Moreover, this
algorithm facilitates the transformation of abstract programs into programs in
WAC model that are deterministically correct.
|
[
{
"version": "v1",
"created": "Wed, 6 Aug 2008 20:33:56 GMT"
}
] | 2008-08-08T00:00:00 |
[
[
"Arumugam",
"Mahesh",
""
]
] |
new_dataset
| 0.994687 |
0808.0556
|
Paul Tarau
|
Paul Tarau
|
Logic Engines as Interactors
|
unpublished draft
| null | null | null |
cs.PL cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new programming language construct, Interactors, supporting
the agent-oriented view that programming is a dialog between simple,
self-contained, autonomous building blocks.
We define Interactors as an abstraction of answer generation and refinement
in Logic Engines resulting in expressive language extension and metaprogramming
patterns, including emulation of Prolog's dynamic database.
A mapping between backtracking based answer generation in the callee and
"forward" recursion in the caller enables interaction between different
branches of the callee's search process and provides simplified design patterns
for algorithms involving combinatorial generation and infinite answer streams.
Interactors extend language constructs like Ruby, Python and C#'s multiple
coroutining block returns through yield statements and they can emulate the
action of monadic constructs and catamorphisms in functional languages.
Keywords: generalized iterators, logic engines, agent oriented programming
language constructs, interoperation with stateful objects, metaprogramming
|
[
{
"version": "v1",
"created": "Tue, 5 Aug 2008 05:48:32 GMT"
}
] | 2008-08-07T00:00:00 |
[
[
"Tarau",
"Paul",
""
]
] |
new_dataset
| 0.997041 |
0808.0754
|
Paul Tarau
|
Paul Tarau
|
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann
Encodings and Pairing Functions
|
unpublished draft
| null | null | null |
cs.MS cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper is organized as a self-contained literate Haskell program that
implements elements of an executable finite set theory with focus on
combinatorial generation and arithmetic encodings. The code, tested under GHC
6.6.1, is available at http://logic.csci.unt.edu/tarau/research/2008/fSET.zip .
We introduce ranking and unranking functions generalizing Ackermann's
encoding to the universe of Hereditarily Finite Sets with Urelements. Then we
build a lazy enumerator for Hereditarily Finite Sets with Urelements that
matches the unranking function provided by the inverse of Ackermann's encoding
and we describe functors between them resulting in arithmetic encodings for
powersets, hypergraphs, ordinals and choice functions. After implementing a
digraph representation of Hereditarily Finite Sets we define {\em decoration
functions} that can recover well-founded sets from encodings of their
associated acyclic digraphs. We conclude with an encoding of arbitrary digraphs
and discuss a concept of duality induced by the set membership relation.
Keywords: hereditarily finite sets, ranking and unranking functions,
executable set theory, arithmetic encodings, Haskell data representations,
functional programming and computational mathematics
|
[
{
"version": "v1",
"created": "Wed, 6 Aug 2008 01:05:09 GMT"
}
] | 2008-08-07T00:00:00 |
[
[
"Tarau",
"Paul",
""
]
] |
new_dataset
| 0.957694 |
0808.0596
|
Ido Tal
|
Ido Tal, Tuvi Etzion, Ron M. Roth
|
On row-by-row coding for 2-D constraints
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A constant-rate encoder--decoder pair is presented for a fairly large family
of two-dimensional (2-D) constraints. Encoding and decoding is done in a
row-by-row manner, and is sliding-block decodable.
Essentially, the 2-D constraint is turned into a set of independent and
relatively simple one-dimensional (1-D) constraints; this is done by dividing
the array into fixed-width vertical strips. Each row in the strip is seen as a
symbol, and a graph presentation of the respective 1-D constraint is
constructed. The maxentropic stationary Markov chain on this graph is next
considered: a perturbed version of the corresponding probability distribution
on the edges of the graph is used in order to build an encoder which operates
in parallel on the strips. This perturbation is found by means of a network
flow, with upper and lower bounds on the flow through the edges.
A key part of the encoder is an enumerative coder for constant-weight binary
words. A fast realization of this coder is shown, using floating-point
arithmetic.
|
[
{
"version": "v1",
"created": "Tue, 5 Aug 2008 10:14:08 GMT"
}
] | 2008-08-06T00:00:00 |
[
[
"Tal",
"Ido",
""
],
[
"Etzion",
"Tuvi",
""
],
[
"Roth",
"Ron M.",
""
]
] |
new_dataset
| 0.991366 |
0808.0235
|
S Birenjith
|
K. Sreeram, S. Birenjith, P. Vijay Kumar
|
DMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks
with Full-Duplex Performance
|
This submission is Part-II of a two-part paper, which is a detailed
version of the previous submission arXiv:0802.1888
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider single-source single-sink (ss-ss) multi-hop relay networks, with
slow-fading links and single-antenna half-duplex relay nodes. In a companion
paper, we established some basic results which laid the foundation for the
results presented here. In the present paper, we consider two families of
networks of half-duplex networks. KPP networks may be viewed as the union of K
node-disjoint parallel relaying paths. Generalizations of these networks
include KPP(I) networks, which permit interference between paths and KPP(D)
networks, which possess a direct link between source and sink. We characterize
the DMT of these families of networks completely and show that they can achieve
the cut-set bound, thus proving that full-duplex performance can be obtained
even in the presence of the half-duplex constraint. We then consider layered
networks, and prove that a linear DMT between maximum diversity and maximum
multiplexing gain is achievable. All protocols in this paper are explicit and
use only amplify-and-forward relaying. We also construct codes that achieve the
optimal DMT for all the proposed schemes. Two key implications of the results
in the paper are that the half-duplex constraint does not entail any rate loss
for a large class of cooperative networks and that AF protocols are often
optimal.
|
[
{
"version": "v1",
"created": "Sat, 2 Aug 2008 07:38:14 GMT"
}
] | 2008-08-05T00:00:00 |
[
[
"Sreeram",
"K.",
""
],
[
"Birenjith",
"S.",
""
],
[
"Kumar",
"P. Vijay",
""
]
] |
new_dataset
| 0.986048 |
0808.0374
|
Eri Prasetyo Wibowo
|
Eri Prasetyo, Hamzah Afandi, Nurul Huda Dominique Ginhac, Michel
Paindavoine
|
A 8 bits Pipeline Analog to Digital Converter Design for High Speed
Camera Application
|
5 pages, 5 authors, conference
|
EEPIS, 2007
| null | null |
cs.RO cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
- This paper describes a pipeline analog-to-digital converter is implemented
for high speed camera. In the pipeline ADC design, prime factor is designing
operational amplifier with high gain so ADC have been high speed. The other
advantage of pipeline is simple on concept, easy to implement in layout and
have flexibility to increase speed. We made design and simulation using Mentor
Graphics Software with 0.6 \mu m CMOS technology with a total power dissipation
of 75.47 mW. Circuit techniques used include a precise comparator, operational
amplifier and clock management. A switched capacitor is used to sample and
multiplying at each stage. Simulation a worst case DNL and INL of 0.75 LSB. The
design operates at 5 V dc. The ADC achieves a SNDR of 44.86 dB. keywords:
pipeline, switched capacitor, clock management
|
[
{
"version": "v1",
"created": "Mon, 4 Aug 2008 03:23:20 GMT"
}
] | 2008-08-05T00:00:00 |
[
[
"Prasetyo",
"Eri",
""
],
[
"Afandi",
"Hamzah",
""
],
[
"Ginhac",
"Nurul Huda Dominique",
""
],
[
"Paindavoine",
"Michel",
""
]
] |
new_dataset
| 0.975159 |
0807.4995
|
Kwankyu Lee
|
Kwankyu Lee and Michael E. O'Sullivan
|
Algebraic Soft-Decision Decoding of Hermitian Codes
|
17 pages, submitted to IEEE Transaction on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An algebraic soft-decision decoder for Hermitian codes is presented. We apply
Koetter and Vardy's soft-decision decoding framework, now well established for
Reed-Solomon codes, to Hermitian codes. First we provide an algebraic
foundation for soft-decision decoding. Then we present an interpolation
algorithm finding the Q-polynomial that plays a key role in the decoding. With
some simulation results, we compare performances of the algebraic soft-decision
decoders for Hermitian codes and Reed-Solomon codes, favorable to the former.
|
[
{
"version": "v1",
"created": "Thu, 31 Jul 2008 07:05:27 GMT"
}
] | 2008-08-01T00:00:00 |
[
[
"Lee",
"Kwankyu",
""
],
[
"O'Sullivan",
"Michael E.",
""
]
] |
new_dataset
| 0.953498 |
0807.4620
|
Christoph Koch
|
Christoph Koch
|
A Compositional Query Algebra for Second-Order Logic and Uncertain
Databases
|
22 pages, 1 figure
| null | null | null |
cs.DB cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
World-set algebra is a variable-free query language for uncertain databases.
It constitutes the core of the query language implemented in MayBMS, an
uncertain database system. This paper shows that world-set algebra captures
exactly second-order logic over finite structures, or equivalently, the
polynomial hierarchy. The proofs also imply that world-set algebra is closed
under composition, a previously open problem.
|
[
{
"version": "v1",
"created": "Tue, 29 Jul 2008 11:22:01 GMT"
}
] | 2008-07-30T00:00:00 |
[
[
"Koch",
"Christoph",
""
]
] |
new_dataset
| 0.995866 |
0807.4309
|
Praveen Sivadasan
|
Praveen Sivadasan, P. Sojan Lal
|
Array Based Java Source Code Obfuscation Using Classes with Restructured
Arrays
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Array restructuring operations obscure arrays. Our work aims on java source
code obfuscation containing arrays. Our main proposal is Classes with
restructured array members and obscured member methods for setting, getting
array elements and to get the length of arrays. The class method definition
codes are obscured through index transformation and constant hiding. The
instantiated objects of these classes are used for source code writing. A tool
named JDATATRANS is developed for generating classes and to the best of our
knowledge this is the first tool available for array restructuring, on java
source codes.
|
[
{
"version": "v1",
"created": "Sun, 27 Jul 2008 16:25:55 GMT"
}
] | 2008-07-29T00:00:00 |
[
[
"Sivadasan",
"Praveen",
""
],
[
"Lal",
"P. Sojan",
""
]
] |
new_dataset
| 0.998885 |
0807.4345
|
Eri Prasetyo Wibowo
|
Eri Prasetyo, Wahyu K.R. and Bumi Prabu Prabowo
|
Avoider robot design to dim the fire with dt basic mini system
|
5 pages, 5 figures, IES Conference
|
9 th IES 2007, EEPIS ITS Surabaya
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Avoider robot is mean robot who is designed to avoid the block in around.
Except that, this robot is also added by an addition application to dim the
fire. This robot is made with ultrasonic sensor PING. This sensor is set on the
front, right and left from robot. This sensor is used robot to look for the
right street, so that robot can walk on. After the robot can look for the right
street, next accomplished the robot is looking for the fire in around. And the
next, dim the fire with fan. This robot is made with basic stamp 2
micro-controller. And that micro-controller can be found in dt-basic mini
system module. This robot is made with servo motor on the right and left side,
which is used to movement.
|
[
{
"version": "v1",
"created": "Mon, 28 Jul 2008 02:46:45 GMT"
}
] | 2008-07-29T00:00:00 |
[
[
"Prasetyo",
"Eri",
""
],
[
"R.",
"Wahyu K.",
""
],
[
"Prabowo",
"Bumi Prabu",
""
]
] |
new_dataset
| 0.998924 |
0807.4478
|
Carlos Miravet
|
Carlos Miravet, Luis Pascual, Eloise Krouch, Juan Manuel del Cura
|
An Image-Based Sensor System for Autonomous Rendez-Vous with
Uncooperative Satellites
|
12 pages, 13 figures. Presented in the 7th International ESA
Conference on Guidance, Navigation & Control Systems, Tralee, Ireland, 2008
| null | null | null |
cs.CV cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper are described the image processing algorithms developed by
SENER, Ingenieria y Sistemas to cope with the problem of image-based,
autonomous rendez-vous (RV) with an orbiting satellite. The methods developed
have a direct application in the OLEV (Orbital Life Extension Extension
Vehicle) mission. OLEV is a commercial mission under development by a
consortium formed by Swedish Space Corporation, Kayser-Threde and SENER, aimed
to extend the operational life of geostationary telecommunication satellites by
supplying them control, navigation and guidance services. OLEV is planned to
use a set of cameras to determine the angular position and distance to the
client satellite during the complete phases of rendez-vous and docking, thus
enabling the operation with satellites not equipped with any specific
navigational aid to provide support during the approach. The ability to operate
with un-equipped client satellites significantly expands the range of
applicability of the system under development, compared to other competing
video technologies already tested in previous spatial missions, such as the
ones described here below.
|
[
{
"version": "v1",
"created": "Mon, 28 Jul 2008 15:46:02 GMT"
}
] | 2008-07-29T00:00:00 |
[
[
"Miravet",
"Carlos",
""
],
[
"Pascual",
"Luis",
""
],
[
"Krouch",
"Eloise",
""
],
[
"del Cura",
"Juan Manuel",
""
]
] |
new_dataset
| 0.995232 |
0807.4128
|
Smarajit Das
|
Smarajit Das and B. Sundar Rajan
|
Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity
|
Accepted for publication in IEEE Transactions on Wireless
Communication. 10 pages, 6 figures
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Space-Time Block Codes from square complex orthogonal designs (SCOD) have
been extensively studied and most of the existing SCODs contain large number of
zero. The zeros in the designs result in high peak-to-average power ratio
(PAPR) and also impose a severe constraint on hardware implementation of the
code when turning off some of the transmitting antennas whenever a zero is
transmitted. Recently, rate 1/2 SCODs with no zero entry have been reported for
8 transmit antennas. In this paper, SCODs with no zero entry for $2^a$ transmit
antennas whenever $a+1$ is a power of 2, are constructed which includes the 8
transmit antennas case as a special case. More generally, for arbitrary values
of $a$, explicit construction of $2^a\times 2^a$ rate $\frac{a+1}{2^a}$ SCODs
with the ratio of number of zero entries to the total number of entries equal
to $1-\frac{a+1}{2^a}2^{\lfloor log_2(\frac{2^a}{a+1}) \rfloor}$ is reported,
whereas for standard known constructions, the ratio is $1-\frac{a+1}{2^a}$. The
codes presented do not result in increased signaling complexity. Simulation
results show that the codes constructed in this paper outperform the codes
using the standard construction under peak power constraint while performing
the same under average power constraint.
|
[
{
"version": "v1",
"created": "Fri, 25 Jul 2008 15:57:23 GMT"
}
] | 2008-07-28T00:00:00 |
[
[
"Das",
"Smarajit",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.996052 |
0807.3593
|
Chandra Nair
|
Chandra Nair
|
An outer bound for 2-receiver discrete memoryless broadcast channels
|
3 pages, a note
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An outer bound to the two-receiver discrete memoryless broadcast channel is
presented. We compare it to the known outer bounds and show that the outer
bound presented is at least as tight as the existing bounds.
|
[
{
"version": "v1",
"created": "Wed, 23 Jul 2008 03:43:30 GMT"
}
] | 2008-07-24T00:00:00 |
[
[
"Nair",
"Chandra",
""
]
] |
new_dataset
| 0.968236 |
0807.3699
|
Francisco Arguello
|
Francisco Arguello
|
Multiplication in Cyclotomic Rings and its Application to Finite Fields
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A representation of finite fields that has proved useful when implementing
finite field arithmetic in hardware is based on an isomorphism between subrings
and fields. In this paper, we present an unified formulation for multiplication
in cyclotomic rings and cyclotomic fields in that most arithmetic operations
are done on vectors. From this formulation we can generate optimized algorithms
for multiplication. For example, one of the proposed algorithms requires
approximately half the number of coordinate-level multiplications at the
expense of extra coordinate-level additions. Our method is then applied to the
finite fields GF(q^m) to further reduce the number of operations. We then
present optimized algorithms for multiplication in finite fields with type-I
and type-II optimal normal bases.
|
[
{
"version": "v1",
"created": "Wed, 23 Jul 2008 15:50:49 GMT"
}
] | 2008-07-24T00:00:00 |
[
[
"Arguello",
"Francisco",
""
]
] |
new_dataset
| 0.980307 |
0807.2997
|
Grenville Croll
|
Bill Bekenn and Ray Hooper
|
Reducing Spreadsheet Risk with FormulaDataSleuth
|
10 pages, 12 colour figures
|
Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2008 33-44
ISBN 978-905617-69-2
| null | null |
cs.HC cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new MS Excel application has been developed which seeks to reduce the risks
associated with the development, operation and auditing of Excel spreadsheets.
FormulaDataSleuth provides a means of checking spreadsheet formulas and data as
they are developed or used, enabling the users to identify actual or potential
errors quickly and thereby halt their propagation. In this paper, we will
describe, with examples, how the application works and how it can be applied to
reduce the risks associated with Excel spreadsheets.
|
[
{
"version": "v1",
"created": "Fri, 18 Jul 2008 16:00:34 GMT"
}
] | 2008-07-21T00:00:00 |
[
[
"Bekenn",
"Bill",
""
],
[
"Hooper",
"Ray",
""
]
] |
new_dataset
| 0.985496 |
0807.2680
|
Yeow Meng Chee
|
Yeow Meng Chee, Gennian Ge, Alan C. H. Ling
|
Group Divisible Codes and Their Application in the Construction of
Optimal Constant-Composition Codes of Weight Three
|
13 pages, 1 figure, 4 tables
|
IEEE Transactions on Information Theory, vol. 54, no. 8, pp.
3552-3564, 2008
|
10.1109/TIT.2008.926349
| null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The concept of group divisible codes, a generalization of group divisible
designs with constant block size, is introduced in this paper. This new class
of codes is shown to be useful in recursive constructions for constant-weight
and constant-composition codes. Large classes of group divisible codes are
constructed which enabled the determination of the sizes of optimal
constant-composition codes of weight three (and specified distance), leaving
only four cases undetermined. Previously, the sizes of constant-composition
codes of weight three were known only for those of sufficiently large length.
|
[
{
"version": "v1",
"created": "Thu, 17 Jul 2008 01:51:27 GMT"
}
] | 2008-07-18T00:00:00 |
[
[
"Chee",
"Yeow Meng",
""
],
[
"Ge",
"Gennian",
""
],
[
"Ling",
"Alan C. H.",
""
]
] |
new_dataset
| 0.999343 |
cs/0501023
|
Arindam Mitra
|
Arindam Mitra
|
No-cloning principal can alone provide security
|
Acknowledgement is due
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing quantum key distribution schemes need the support of classical
authentication scheme to ensure security. This is a conceptual drawback of
quantum cryptography. It is pointed out that quantum cryptosystem does not need
any support of classical cryptosystem to ensure security. No-cloning principal
can alone provide security in communication. Even no-cloning principle itself
can help to authenticate each bit of information. It implies that quantum
password need not to be a secret password.
|
[
{
"version": "v1",
"created": "Wed, 12 Jan 2005 07:28:13 GMT"
},
{
"version": "v10",
"created": "Tue, 20 Nov 2007 15:30:55 GMT"
},
{
"version": "v11",
"created": "Tue, 19 Feb 2008 13:13:19 GMT"
},
{
"version": "v12",
"created": "Fri, 18 Jul 2008 14:02:21 GMT"
},
{
"version": "v2",
"created": "Tue, 22 Mar 2005 15:43:11 GMT"
},
{
"version": "v3",
"created": "Wed, 7 Dec 2005 15:22:55 GMT"
},
{
"version": "v4",
"created": "Fri, 20 Oct 2006 16:07:27 GMT"
},
{
"version": "v5",
"created": "Sat, 4 Nov 2006 15:37:38 GMT"
},
{
"version": "v6",
"created": "Sun, 17 Dec 2006 16:14:06 GMT"
},
{
"version": "v7",
"created": "Thu, 8 Mar 2007 14:45:46 GMT"
},
{
"version": "v8",
"created": "Mon, 2 Apr 2007 15:30:27 GMT"
},
{
"version": "v9",
"created": "Tue, 1 May 2007 14:36:56 GMT"
}
] | 2008-07-18T00:00:00 |
[
[
"Mitra",
"Arindam",
""
]
] |
new_dataset
| 0.995619 |
0807.2383
|
Michel Rueher
|
H\'el\`ene Collavizza (I3S), Michel Rueher (I3S), Pascal Van
Hentenryck (Brown University)
|
CPBVP: A Constraint-Programming Framework for Bounded Program
Verification
| null |
The 14th International Conference on Principles and Practice of
Constraint Programming, Sydney : Australie (2008)
| null | null |
cs.SE cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies how to verify the conformity of a program with its
specification and proposes a novel constraint-programming framework for bounded
program verification (CPBPV). The CPBPV framework uses constraint stores to
represent the specification and the program and explores execution paths
nondeterministically. The input program is partially correct if each constraint
store so produced implies the post-condition. CPBPV does not explore spurious
execution paths as it incrementally prunes execution paths early by detecting
that the constraint store is not consistent. CPBPV uses the rich language of
constraint programming to express the constraint store. Finally, CPBPV is
parametrized with a list of solvers which are tried in sequence, starting with
the least expensive and less general. Experimental results often produce orders
of magnitude improvements over earlier approaches, running times being often
independent of the variable domains. Moreover, CPBPV was able to detect subtle
errors in some programs while other frameworks based on model checking have
failed.
|
[
{
"version": "v1",
"created": "Tue, 15 Jul 2008 14:18:43 GMT"
}
] | 2008-07-16T00:00:00 |
[
[
"Collavizza",
"Hélène",
"",
"I3S"
],
[
"Rueher",
"Michel",
"",
"I3S"
],
[
"Van Hentenryck",
"Pascal",
"",
"Brown University"
]
] |
new_dataset
| 0.969398 |
0807.2440
|
Natalia Silberstein
|
Tuvi Etzion, Natalia Silberstein
|
Construction of Error-Correcting Codes for Random Network Coding
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work we present error-correcting codes for random network coding
based on rank- metric codes, Ferrers diagrams, and puncturing. For most
parameters, the constructed codes are larger than all previously known codes.
|
[
{
"version": "v1",
"created": "Tue, 15 Jul 2008 19:57:23 GMT"
}
] | 2008-07-16T00:00:00 |
[
[
"Etzion",
"Tuvi",
""
],
[
"Silberstein",
"Natalia",
""
]
] |
new_dataset
| 0.998828 |
0807.1524
|
Yves Bertot
|
Yves Bertot (INRIA Sophia Antipolis), Ekaterina Komendantskaya (INRIA
Sophia Antipolis)
|
Inductive and Coinductive Components of Corecursive Functions in Coq
|
Dans Coalgebraic Methods in Computer Science (2008)
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Constructive Type Theory, recursive and corecursive definitions are
subject to syntactic restrictions which guarantee termination for recursive
functions and productivity for corecursive functions. However, many terminating
and productive functions do not pass the syntactic tests. Bove proposed in her
thesis an elegant reformulation of the method of accessibility predicates that
widens the range of terminative recursive functions formalisable in
Constructive Type Theory. In this paper, we pursue the same goal for productive
corecursive functions. Notably, our method of formalisation of coinductive
definitions of productive functions in Coq requires not only the use of ad-hoc
predicates, but also a systematic algorithm that separates the inductive and
coinductive parts of functions.
|
[
{
"version": "v1",
"created": "Wed, 9 Jul 2008 19:16:25 GMT"
}
] | 2008-07-10T00:00:00 |
[
[
"Bertot",
"Yves",
"",
"INRIA Sophia Antipolis"
],
[
"Komendantskaya",
"Ekaterina",
"",
"INRIA\n Sophia Antipolis"
]
] |
new_dataset
| 0.980997 |
0807.1160
|
Charles Shen
|
Charles Shen, Henning Schulzrinne, Erich Nahum
|
Session Initiation Protocol (SIP) Server Overload Control: Design and
Evaluation
|
In Proceedings of IPTComm 2008
| null | null | null |
cs.NI cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A Session Initiation Protocol (SIP) server may be overloaded by
emergency-induced call volume, ``American Idol'' style flash crowd effects or
denial of service attacks. The SIP server overload problem is interesting
especially because the costs of serving or rejecting a SIP session can be
similar. For this reason, the built-in SIP overload control mechanism based on
generating rejection messages cannot prevent the server from entering
congestion collapse under heavy load. The SIP overload problem calls for a
pushback control solution in which the potentially overloaded receiving server
may notify its upstream sending servers to have them send only the amount of
load within the receiving server's processing capacity. The pushback framework
can be achieved by either a rate-based feedback or a window-based feedback. The
centerpiece of the feedback mechanism is the algorithm used to generate load
regulation information. We propose three new window-based feedback algorithms
and evaluate them together with two existing rate-based feedback algorithms. We
compare the different algorithms in terms of the number of tuning parameters
and performance under both steady and variable load. Furthermore, we identify
two categories of fairness requirements for SIP overload control, namely,
user-centric and provider-centric fairness. With the introduction of a new
double-feed SIP overload control architecture, we show how the algorithms can
meet those fairness criteria.
|
[
{
"version": "v1",
"created": "Tue, 8 Jul 2008 03:23:41 GMT"
}
] | 2008-07-09T00:00:00 |
[
[
"Shen",
"Charles",
""
],
[
"Schulzrinne",
"Henning",
""
],
[
"Nahum",
"Erich",
""
]
] |
new_dataset
| 0.994833 |
0805.0615
|
Yingquan Wu
|
Yingquan Wu
|
On Expanded Cyclic Codes
|
23 pages. Submitted for publication in IEEE Trans. Inform. Theory
| null | null | null |
cs.IT cs.CC math.IT math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper has a threefold purpose. The first purpose is to present an
explicit description of expanded cyclic codes defined in $\GF(q^m)$. The
proposed explicit construction of expanded generator matrix and expanded parity
check matrix maintains the symbol-wise algebraic structure and thus keeps many
important original characteristics. The second purpose of this paper is to
identify a class of constant-weight cyclic codes. Specifically, we show that a
well-known class of $q$-ary BCH codes excluding the all-zero codeword are
constant-weight cyclic codes. Moreover, we show this class of codes achieve the
Plotkin bound. The last purpose of the paper is to characterize expanded cyclic
codes utilizing the proposed expanded generator matrix and parity check matrix.
We characterize the properties of component codewords of a codeword and
particularly identify the precise conditions under which a codeword can be
represented by a subbasis. Our developments reveal an alternative while more
general view on the subspace subcodes of Reed-Solomon codes. With the new
insights, we present an improved lower bound on the minimum distance of an
expanded cyclic code by exploiting the generalized concatenated structure. We
also show that the fixed-rate binary expanded Reed-Solomon codes are
asymptotically "bad", in the sense that the ratio of minimum distance over code
length diminishes with code length going to infinity. It overturns the
prevalent conjecture that they are "good" codes and deviates from the ensemble
of generalized Reed-Solomon codes which asymptotically achieves the
Gilbert-Varshamov bound.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2008 22:51:12 GMT"
},
{
"version": "v2",
"created": "Tue, 8 Jul 2008 16:53:04 GMT"
}
] | 2008-07-08T00:00:00 |
[
[
"Wu",
"Yingquan",
""
]
] |
new_dataset
| 0.989677 |
0807.0718
|
Flavio D'Alessandro
|
Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
|
The Parikh functions of sparse context-free languages are
quasi-polynomials
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove that the Parikh map of a bounded context-free language is a box
spline. Moreover we prove that in this case, such a function is rational.
|
[
{
"version": "v1",
"created": "Fri, 4 Jul 2008 11:01:15 GMT"
}
] | 2008-07-08T00:00:00 |
[
[
"D'Alessandro",
"Flavio",
""
],
[
"Intrigila",
"Benedetto",
""
],
[
"Varricchio",
"Stefano",
""
]
] |
new_dataset
| 0.993176 |
0807.0626
|
Christian Tanguy
|
Christian Tanguy
|
Asymptotic Mean Time To Failure and Higher Moments for Large, Recursive
Networks
| null | null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with asymptotic expressions of the Mean Time To Failure
(MTTF) and higher moments for large, recursive, and non-repairable systems in
the context of two-terminal reliability. Our aim is to extend the well-known
results of the series and parallel cases. We first consider several exactly
solvable configurations of identical components with exponential failure-time
distribution functions to illustrate different (logarithmic or power-law)
behaviors as the size of the system, indexed by an integer n, increases. The
general case is then addressed: it provides a simple interpretation of the
origin of the power-law exponent and an efficient asymptotic expression for the
total reliability of large, recursive systems. Finally, we assess the influence
of the non-exponential character of the component reliability on the
n-dependence of the MTTF.
|
[
{
"version": "v1",
"created": "Thu, 3 Jul 2008 19:44:36 GMT"
}
] | 2008-07-04T00:00:00 |
[
[
"Tanguy",
"Christian",
""
]
] |
new_dataset
| 0.988079 |
0806.4858
|
Guangwu Xu
|
Adrian Dumitrescu, Csaba D. T\'oth and Guangwu Xu
|
On stars and Steiner stars. II
|
10 pages, 1 figure
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A {\em Steiner star} for a set $P$ of $n$ points in $\RR^d$ connects an
arbitrary center point to all points of $P$, while a {\em star} connects a
point $p\in P$ to the remaining $n-1$ points of $P$. All connections are
realized by straight line segments. Fekete and Meijer showed that the minimum
star is at most $\sqrt{2}$ times longer than the minimum Steiner star for any
finite point configuration in $\RR^d$. The maximum ratio between them, over all
finite point configurations in $\RR^d$, is called the {\em star Steiner ratio}
in $\RR^d$. It is conjectured that this ratio is $4/\pi = 1.2732...$ in the
plane and $4/3=1.3333...$ in three dimensions. Here we give upper bounds of
1.3631 in the plane, and 1.3833 in 3-space, thereby substantially improving
recent upper bounds of 1.3999, and $\sqrt{2}-10^{-4}$, respectively. Our
results also imply improved bounds on the maximum ratios between the minimum
star and the maximum matching in two and three dimensions.
|
[
{
"version": "v1",
"created": "Mon, 30 Jun 2008 19:46:43 GMT"
}
] | 2008-07-01T00:00:00 |
[
[
"Dumitrescu",
"Adrian",
""
],
[
"Tóth",
"Csaba D.",
""
],
[
"Xu",
"Guangwu",
""
]
] |
new_dataset
| 0.995875 |
0806.4221
|
Mirela Damian
|
Mirela Damian and Sriram V. Pemmaraju
|
Localized Spanners for Wireless Networks
|
21 pages
| null | null | null |
cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new efficient localized algorithm to construct, for any given
quasi-unit disk graph G=(V,E) and any e > 0, a (1+e)-spanner for G of maximum
degree O(1) and total weight O(w(MST)), where w(MST) denotes the weight of a
minimum spanning tree for V. We further show that similar localized techniques
can be used to construct, for a given unit disk graph G = (V, E), a planar
Cdel(1+e)(1+pi/2)-spanner for G of maximum degree O(1) and total weight
O(w(MST)). Here Cdel denotes the stretch factor of the unit Delaunay
triangulation for V. Both constructions can be completed in O(1) communication
rounds, and require each node to know its own coordinates.
|
[
{
"version": "v1",
"created": "Thu, 26 Jun 2008 02:09:17 GMT"
}
] | 2008-06-27T00:00:00 |
[
[
"Damian",
"Mirela",
""
],
[
"Pemmaraju",
"Sriram V.",
""
]
] |
new_dataset
| 0.95185 |
0806.3938
|
Haluk Bingol
|
Ilker Yildirim and Haluk Bingol
|
Cooperation with Complement is Better
|
9 pages
| null | null | null |
cs.MA physics.soc-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a setting where heterogeneous agents interact to accomplish a given set of
goals, cooperation is of utmost importance, especially when agents cannot
achieve their individual goals by exclusive use of their own efforts. Even when
we consider friendly environments and benevolent agents, cooperation involves
several issues: with whom to cooperate, reciprocation, how to address credit
assignment and complex division of gains, etc. We propose a model where
heterogeneous agents cooperate by forming groups and formation of larger groups
is promoted. Benefit of agents is proportional to the performance and the size
of the group. There is a time pressure to form a group. We investigate how
preferring similar or complement agents in group formation affects an agent's
success. Preferring complement in group formation is found to be better, yet
there is no need to push the strategy to the extreme since the effect of
complementing partners is saturated.
|
[
{
"version": "v1",
"created": "Tue, 24 Jun 2008 17:38:05 GMT"
}
] | 2008-06-25T00:00:00 |
[
[
"Yildirim",
"Ilker",
""
],
[
"Bingol",
"Haluk",
""
]
] |
new_dataset
| 0.972676 |
0806.3628
|
Chau Yuen
|
Su Kiang Kuek, Chau Yuen, Woon Hau Chin
|
Four-node Relay Network with Bi-directional Traffic Employing Wireless
Network Coding with Pre-cancellation
| null |
VTC Spring 2008
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Network coding has the potential to improve the overall throughput of a
network by combining different streams of data and forwarding them. In wireless
networks, the wireless channel provide an excellent medium for physical layer
network coding as signals from different transmitters are combined
automatically by the wireless channel. In such scenarios, it would be
interesting to investigate protocols and algorithms which can optimally relay
information. In this paper, we look at a four-node two-way or bidirectional
relay network, and propose a relay protocol which can relay information
efficiently in this network.
|
[
{
"version": "v1",
"created": "Mon, 23 Jun 2008 07:49:29 GMT"
}
] | 2008-06-24T00:00:00 |
[
[
"Kuek",
"Su Kiang",
""
],
[
"Yuen",
"Chau",
""
],
[
"Chin",
"Woon Hau",
""
]
] |
new_dataset
| 0.999102 |
0806.3320
|
Chau Yuen
|
Chau Yuen, Yong Liang Guan, T. T. Tjhung
|
Unitary Differential Space-Time Modulation with Joint Modulation
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We develop two new designs of unitary differential space-time modulation
(DSTM) with low decoding complexity. Their decoder can be separated into a few
parallel decoders, each of which has a decoding search space of less than
sqrt(N) if the DSTM codebook contains N codewords. Both designs are based on
the concept of joint modulation, which means that several information symbols
are jointly modulated, unlike the conventional symbol-by-symbol modulation. The
first design is based on Orthogonal Space-Time Block Code (O-STBC) with joint
constellation constructed from spherical codes. The second design is based on
Quasi-Orthogonal Space-Time Block Code (QO-STBC) with specially designed
pair-wise constellation sets. Both the proposed unitary DSTM schemes have
considerably lower decoding complexity than many prior DSTM schemes, including
those based on Group Codes and Sp(2) which generally have a decoding search
space of N for a codebook size of N codewords, and much better decoding
performance than the existing O-STBC DSTM scheme. Between two designs, the
proposed DSTM based on O-STBC generally has better decoding performance, while
the proposed DSTM based on QO-STBC has lower decoding complexity when 8
transmit antennas.
|
[
{
"version": "v1",
"created": "Fri, 20 Jun 2008 06:26:10 GMT"
}
] | 2008-06-23T00:00:00 |
[
[
"Yuen",
"Chau",
""
],
[
"Guan",
"Yong Liang",
""
],
[
"Tjhung",
"T. T.",
""
]
] |
new_dataset
| 0.987731 |
0803.0225
|
Tsiriniaina Andriamampianina
|
Tsiriniaina Andriamampianina
|
Random hypergraphs and algorithmics
|
103 pages, french
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Hypergraphs are structures that can be decomposed or described; in other
words they are recursively countable. Here, we get exact and asymptotic
enumeration results on hypergraphs by means of exponential generating
functions. The number of hypergraph component is bounded, as a generalisation
of Wright inequalities for graphs: the proof is a combinatorial understanding
of the structure by inclusion exclusion. Asymptotic results are obtained,
thanks to generating functions proofs are at the end very easy to read, through
complex analysis by saddle point method. By this way, we characterized:
- the components with a given number of vertices and of hyperedges by the
expected size of a random hypermatching in these structures.
- the random hypergraphs (evolving hyperedge by hyperedge) according to the
expected number of hyperedges when the first cycle appears in the evolving
structure.
This work is an open road to further works on random hypergraphs such as
threshold phenomenon, tools used here seem to be sufficient at first sight.
|
[
{
"version": "v1",
"created": "Mon, 3 Mar 2008 12:13:17 GMT"
},
{
"version": "v2",
"created": "Fri, 20 Jun 2008 12:59:13 GMT"
}
] | 2008-06-20T00:00:00 |
[
[
"Andriamampianina",
"Tsiriniaina",
""
]
] |
new_dataset
| 0.987976 |
0806.3133
|
Ori Shental
|
Ori Shental and Ido Kanter
|
Shannon Meets Carnot: Mutual Information Via Thermodynamics
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this contribution, the Gaussian channel is represented as an equivalent
thermal system allowing to express its input-output mutual information in terms
of thermodynamic quantities. This thermodynamic description of the mutual
information is based upon a generalization of the $2^{nd}$ thermodynamic law
and provides an alternative proof to the Guo-Shamai-Verd\'{u} theorem, giving
an intriguing connection between this remarkable theorem and the most
fundamental laws of nature - the laws of thermodynamics.
|
[
{
"version": "v1",
"created": "Thu, 19 Jun 2008 06:31:51 GMT"
}
] | 2008-06-20T00:00:00 |
[
[
"Shental",
"Ori",
""
],
[
"Kanter",
"Ido",
""
]
] |
new_dataset
| 0.980828 |
0806.3246
|
Eyal Lubetzky
|
Noga Alon, Avinatan Hasidim, Eyal Lubetzky, Uri Stav, Amit Weinstein
|
Broadcasting with side information
|
19 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A sender holds a word x consisting of n blocks x_i, each of t bits, and
wishes to broadcast a codeword to m receivers, R_1,...,R_m. Each receiver R_i
is interested in one block, and has prior side information consisting of some
subset of the other blocks. Let \beta_t be the minimum number of bits that has
to be transmitted when each block is of length t, and let \beta be the limit
\beta = \lim_{t \to \infty} \beta_t/t. In words, \beta is the average
communication cost per bit in each block (for long blocks). Finding the coding
rate \beta, for such an informed broadcast setting, generalizes several coding
theoretic parameters related to Informed Source Coding on Demand, Index Coding
and Network Coding.
In this work we show that usage of large data blocks may strictly improve
upon the trivial encoding which treats each bit in the block independently. To
this end, we provide general bounds on \beta_t, and prove that for any constant
C there is an explicit broadcast setting in which \beta = 2 but \beta_1 > C.
One of these examples answers a question of Lubetzky and Stav.
In addition, we provide examples with the following counterintuitive
direct-sum phenomena. Consider a union of several mutually independent
broadcast settings. The optimal code for the combined setting may yield a
significant saving in communication over concatenating optimal encodings for
the individual settings. This result also provides new non-linear coding
schemes which improve upon the largest known gap between linear and non-linear
Network Coding, thus improving the results of Dougherty, Freiling, and Zeger.
The proofs use ideas related to Witsenhausen's rate, OR graph products,
colorings of Cayley graphs and the chromatic numbers of Kneser graphs.
|
[
{
"version": "v1",
"created": "Thu, 19 Jun 2008 17:42:34 GMT"
}
] | 2008-06-20T00:00:00 |
[
[
"Alon",
"Noga",
""
],
[
"Hasidim",
"Avinatan",
""
],
[
"Lubetzky",
"Eyal",
""
],
[
"Stav",
"Uri",
""
],
[
"Weinstein",
"Amit",
""
]
] |
new_dataset
| 0.992631 |
cs/0511070
|
Arindam Mitra
|
Arindam Mitra
|
A particle can carry more than one bit of information
|
1301 words
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is believed that a particle cannot carry more than one bit of information.
It is pointed out that particle or single-particle quantum state can carry more
than one bit of information. It implies that minimum energy cost of
transmitting a bit will be less than the accepted limit KTlog2.
|
[
{
"version": "v1",
"created": "Fri, 18 Nov 2005 15:21:56 GMT"
},
{
"version": "v2",
"created": "Wed, 1 Nov 2006 15:04:36 GMT"
},
{
"version": "v3",
"created": "Sat, 4 Nov 2006 15:33:36 GMT"
},
{
"version": "v4",
"created": "Fri, 13 Jun 2008 15:50:00 GMT"
}
] | 2008-06-13T00:00:00 |
[
[
"Mitra",
"Arindam",
""
]
] |
new_dataset
| 0.984669 |
0712.2094
|
Zachary Abel
|
Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine,
Martin L. Demaine, Scott D. Kominers
|
Hinged Dissections Exist
|
22 pages, 14 figures
|
Proceedings of the Twenty-fourth Annual Symposium on Computational
Geometry (2008): 110-119.
|
10.1145/1377676.1377695
| null |
cs.CG
| null |
We prove that any finite collection of polygons of equal area has a common
hinged dissection. That is, for any such collection of polygons there exists a
chain of polygons hinged at vertices that can be folded in the plane
continuously without self-intersection to form any polygon in the collection.
This result settles the open problem about the existence of hinged dissections
between pairs of polygons that goes back implicitly to 1864 and has been
studied extensively in the past ten years. Our result generalizes and indeed
builds upon the result from 1814 that polygons have common dissections (without
hinges). We also extend our common dissection result to edge-hinged dissections
of solid 3D polyhedra that have a common (unhinged) dissection, as determined
by Dehn's 1900 solution to Hilbert's Third Problem. Our proofs are
constructive, giving explicit algorithms in all cases. For a constant number of
planar polygons, both the number of pieces and running time required by our
construction are pseudopolynomial. This bound is the best possible, even for
unhinged dissections. Hinged dissections have possible applications to
reconfigurable robotics, programmable matter, and nanomanufacturing.
|
[
{
"version": "v1",
"created": "Thu, 13 Dec 2007 04:43:10 GMT"
}
] | 2008-06-12T00:00:00 |
[
[
"Abbott",
"Timothy G.",
""
],
[
"Abel",
"Zachary",
""
],
[
"Charlton",
"David",
""
],
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"Kominers",
"Scott D.",
""
]
] |
new_dataset
| 0.998646 |
0806.1727
|
Laura Poplawski
|
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi
Sundaram, Shang-Hua Teng
|
Bounded Budget Connection (BBC) Games or How to make friends and
influence people, on a budget
|
20 pages, 10 figures, shorter version in PODC 2008
| null | null | null |
cs.GT cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Motivated by applications in social networks, peer-to-peer and overlay
networks, we define and study the Bounded Budget Connection (BBC) game - we
have a collection of n players or nodes each of whom has a budget for
purchasing links; each link has a cost as well as a length and each node has a
set of preference weights for each of the remaining nodes; the objective of
each node is to use its budget to buy a set of outgoing links so as to minimize
its sum of preference-weighted distances to the remaining nodes.
We study the structural and complexity-theoretic properties of pure Nash
equilibria in BBC games. We show that determining the existence of a pure Nash
equilibrium in general BBC games is NP-hard. However, in a natural variant,
fractional BBC games - where it is permitted to buy fractions of links - a pure
Nash equilibrium always exists. A major focus is the study of (n,k)-uniform BBC
games - those in which all link costs, link lengths and preference weights are
equal (to 1) and all budgets are equal (to k). We show that a pure Nash
equilibrium or stable graph exists for all (n,k)-uniform BBC games and that all
stable graphs are essentially fair (i.e. all nodes have similar costs). We
provide an explicit construction of a family of stable graphs that spans the
spectrum from minimum total social cost to maximum total social cost. We also
study a special family of regular graphs in which all nodes imitate the "same"
buying pattern, and show that if n is sufficiently large no such regular graph
can be a pure Nash equilibrium. We analyze best-response walks on the
configuration defined by the uniform game. Lastly, we extend our results to the
case where each node seeks to minimize its maximum distance to the other nodes.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2008 19:18:14 GMT"
}
] | 2008-06-11T00:00:00 |
[
[
"Laoutaris",
"Nikolaos",
""
],
[
"Poplawski",
"Laura J.",
""
],
[
"Rajaraman",
"Rajmohan",
""
],
[
"Sundaram",
"Ravi",
""
],
[
"Teng",
"Shang-Hua",
""
]
] |
new_dataset
| 0.999734 |
0711.1827
|
Joerg Rothe
|
Dorothea Baumeister and Joerg Rothe
|
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are
NP-Complete via Parsimonious Reductions
|
30 pages, 25 figures
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved
that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete,
and they showed that the infinite variant of this problem is undecidable. In
this paper, we study the three-color and two-color Tantrix(TM) rotation puzzle
problems (3-TRP and 2-TRP) and their variants. Restricting the number of
allowed colors to three (respectively, to two) reduces the set of available
Tantrix(TM) tiles from 56 to 14 (respectively, to 8). We prove that 3-TRP and
2-TRP are NP-complete, which answers a question raised by Holzer and Holzer in
the affirmative. Since our reductions are parsimonious, it follows that the
problems Unique-3-TRP and Unique-2-TRP are DP-complete under randomized
reductions. We also show that the another-solution problems associated with
4-TRP, 3-TRP, and 2-TRP are NP-complete. Finally, we prove that the infinite
variants of 3-TRP and 2-TRP are undecidable.
|
[
{
"version": "v1",
"created": "Mon, 12 Nov 2007 17:44:45 GMT"
},
{
"version": "v2",
"created": "Mon, 19 Nov 2007 21:22:14 GMT"
},
{
"version": "v3",
"created": "Mon, 9 Jun 2008 12:26:34 GMT"
}
] | 2008-06-09T00:00:00 |
[
[
"Baumeister",
"Dorothea",
""
],
[
"Rothe",
"Joerg",
""
]
] |
new_dataset
| 0.999269 |
0806.1062
|
Hamidreza Farmanbar
|
Hamid Farmanbar and Amir K. Khandani
|
Capacity of Block-Memoryless Channels with Causal Channel Side
Information
|
8 pages, submitted to IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity of a time-varying block-memoryless channel in which the
transmitter and the receiver have access to (possibly different) noisy causal
channel side information (CSI) is obtained. It is shown that the capacity
formula obtained in this correspondence reduces to the capacity formula
reported in \cite{Gold07} for the special case where the transmitter CSI is a
deterministic function of the receiver CSI.
|
[
{
"version": "v1",
"created": "Thu, 5 Jun 2008 21:38:56 GMT"
}
] | 2008-06-09T00:00:00 |
[
[
"Farmanbar",
"Hamid",
""
],
[
"Khandani",
"Amir K.",
""
]
] |
new_dataset
| 0.998072 |
0806.0860
|
Amit K Awasthi
|
Amit K Awasthi
|
On the Security of Liaw et al.'s Scheme
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, Liaw et al. proposed a remote user authentication scheme using
smartcards. They claimed a number of features of their scheme, e.g. a
dictionary of verification tables is not required to authenticate users; users
can choose their password freely; mutual authentication is provided between the
user and the remote system; the communication cost and the computational cost
are very low; users can update their password after the registration phase; a
session key agreed by the user and the remote system is generated in every
session; and the nonce-based scheme which does not require a timestamp (to
solve the serious time synchronization problem) etc.
In this paper We show that Liaw et al.'s scheme does not stand with various
security requirements and is completely insecure.
Keywords: Authentication, Smartcards, Remote system, Attack.
|
[
{
"version": "v1",
"created": "Wed, 4 Jun 2008 20:44:33 GMT"
}
] | 2008-06-06T00:00:00 |
[
[
"Awasthi",
"Amit K",
""
]
] |
new_dataset
| 0.997753 |
0806.0576
|
Wojciech Mazurczyk
|
Krzysztof Szczypiorski, Igor Margasinski, Wojciech Mazurczyk
|
Steganographic Routing in Multi Agent System Environment
|
9 pages, 10 figures,
|
"Secured Information Systems" of Journal of Information Assurance
and Security (JIAS), Dynamic Publishers Inc., Atlanta, GA 30362, USA, Volume
2, Issue 3, September 2007, pp. 235-243, ISSN 1554-1010
| null | null |
cs.CR cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present an idea of trusted communication platform for
Multi-Agent Systems (MAS) called TrustMAS. Based on analysis of routing
protocols suitable for MAS we have designed a new proactive hidden routing.
Proposed steg-agents discovery procedure, as well as further routes updates and
hidden communication, are cryptographically independent. Steganographic
exchange can cover heterogeneous and geographically outlying environments using
available cross-layer covert channels. Finally we have specified rules that
agents have to follow to benefit the TrustMAS distributed router platform.
|
[
{
"version": "v1",
"created": "Tue, 3 Jun 2008 16:15:16 GMT"
}
] | 2008-06-04T00:00:00 |
[
[
"Szczypiorski",
"Krzysztof",
""
],
[
"Margasinski",
"Igor",
""
],
[
"Mazurczyk",
"Wojciech",
""
]
] |
new_dataset
| 0.983692 |
0806.0314
|
Nicholas Manoukis
|
N. C. Manoukis and E. C. Anderson
|
GuiLiner: A Configurable and Extensible Graphical User Interface for
Scientific Analysis and Simulation Software
|
4 pages; for the current version of this software, please visit
http://guiliner.sourceforge.net/
| null | null | null |
cs.HC cs.SE
|
http://creativecommons.org/licenses/publicdomain/
|
The computer programs most users interact with daily are driven by a
graphical user interface (GUI). However, many scientific applications are used
with a command line interface (CLI) for the ease of development and increased
flexibility this mode provides. Scientific application developers would benefit
from being able to provide a GUI easily for their CLI programs, thus retaining
the advantages of both modes of interaction. GuiLiner is a generic, extensible
and flexible front-end designed to ``host'' a wide variety of data analysis or
simulation programs. Scientific application developers who produce a correctly
formatted XML file describing their program's options and some of its
documentation can immediately use GuiLiner to produce a carefully implemented
GUI for their analysis or simulation programs.
|
[
{
"version": "v1",
"created": "Mon, 2 Jun 2008 15:57:55 GMT"
}
] | 2008-06-03T00:00:00 |
[
[
"Manoukis",
"N. C.",
""
],
[
"Anderson",
"E. C.",
""
]
] |
new_dataset
| 0.994737 |
0805.4748
|
Eric Chen
|
Eric Z. Chen
|
New Construction of 2-Generator Quasi-Twisted Codes
|
4 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes.
Based on consta-cyclic simplex codes, a new explicit construction of a family
of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also
shown that many codes in the family meet the Griesmer bound and therefore are
length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and
[240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes
are also obtained by the construction.
|
[
{
"version": "v1",
"created": "Fri, 30 May 2008 13:06:18 GMT"
}
] | 2008-06-02T00:00:00 |
[
[
"Chen",
"Eric Z.",
""
]
] |
new_dataset
| 0.99212 |
0805.3897
|
Harmen L.A. van der Spek
|
H.L.A. van der Spek, E.M. Bakker, H.A.G. Wijshoff
|
SPARK00: A Benchmark Package for the Compiler Evaluation of
Irregular/Sparse Codes
| null | null | null | null |
cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a set of benchmarks that specifically targets a major cause of
performance degradation in high performance computing platforms: irregular
access patterns. These benchmarks are meant to be used to asses the performance
of optimizing compilers on codes with a varying degree of irregular access. The
irregularity caused by the use of pointers and indirection arrays are a major
challenge for optimizing compilers. Codes containing such patterns are
notoriously hard to optimize but they have a huge impact on the performance of
modern architectures, which are under-utilized when encountering irregular
memory accesses. In this paper, a set of benchmarks is described that
explicitly measures the performance of kernels containing a variety of
different access patterns found in real world applications. By offering a
varying degree of complexity, we provide a platform for measuring the
effectiveness of transformations. The difference in complexity stems from a
difference in traversal patterns, the use of multiple indirections and control
flow statements. The kernels used cover a variety of different access patterns,
namely pointer traversals, indirection arrays, dynamic loop bounds and run-time
dependent if-conditions. The kernels are small enough to be fully understood
which makes this benchmark set very suitable for the evaluation of
restructuring transformations.
|
[
{
"version": "v1",
"created": "Mon, 26 May 2008 08:58:16 GMT"
}
] | 2008-05-27T00:00:00 |
[
[
"van der Spek",
"H. L. A.",
""
],
[
"Bakker",
"E. M.",
""
],
[
"Wijshoff",
"H. A. G.",
""
]
] |
new_dataset
| 0.965227 |
0805.3390
|
Agus Budiyono PhD
|
J. Muliadi, S.D. Jenie, A. Budiyono
|
Design of Attitude Stability System for Prolate Dual-spin Satellite in
Its Inclined Elliptical Orbit
|
20 pages, 42 figures
|
Symposium on Aerospace Science and Technology, Jakarta, 2005
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In general, most of communication satellites were designed to be operated in
geostationary orbit. And many of them were designed in prolate dual-spin
configuration. As a prolate dual-spin vehicle, they have to be stabilized
against their internal energy dissipation effect. Several countries that
located in southern hemisphere, has shown interest to use communication
satellite. Because of those countries southern latitude, an idea emerged to
incline the communication satellite (due to its prolate dualspin configuration)
in elliptical orbit. This work is focused on designing Attitude Stability
System for prolate dual-spin satellite in the effect of perturbed field of
gravity due to the inclination of its elliptical orbit. DANDE (De-spin Active
Nutation Damping Electronics) provides primary stabilization method for the
satellite in its orbit. Classical Control Approach is used for the iteration of
DANDE parameters. The control performance is evaluated based on time response
analysis.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2008 06:17:57 GMT"
}
] | 2008-05-23T00:00:00 |
[
[
"Muliadi",
"J.",
""
],
[
"Jenie",
"S. D.",
""
],
[
"Budiyono",
"A.",
""
]
] |
new_dataset
| 0.999546 |
0805.3484
|
Heide Gluesing-Luerssen
|
Heide Gluesing-Luerssen, Gert Schneider
|
A MacWilliams Identity for Convolutional Codes: The General Case
|
20 pages
| null | null | null |
cs.IT math.IT math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A MacWilliams Identity for convolutional codes will be established. It makes
use of the weight adjacency matrices of the code and its dual, based on state
space realizations (the controller canonical form) of the codes in question.
The MacWilliams Identity applies to various notions of duality appearing in the
literature on convolutional coding theory.
|
[
{
"version": "v1",
"created": "Thu, 22 May 2008 15:06:50 GMT"
}
] | 2008-05-23T00:00:00 |
[
[
"Gluesing-Luerssen",
"Heide",
""
],
[
"Schneider",
"Gert",
""
]
] |
new_dataset
| 0.998723 |
0805.3164
|
Rahul Vaze
|
Rahul Vaze and Robert W. Heath Jr
|
To Code or Not To Code in Multi-Hop Relay Channels
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-hop relay channels use multiple relay stages, each with multiple relay
nodes, to facilitate communication between a source and destination.
Previously, distributed space-time coding was used to maximize diversity gain.
Assuming a low-rate feedback link from the destination to each relay stage and
the source, this paper proposes end-to-end antenna selection strategies as an
alternative to distributed space-time coding. One-way (where only the source
has data for destination) and two-way (where the destination also has data for
the source) multi-hop relay channels are considered with both the full-duplex
and half duplex relay nodes. End-to-end antenna selection strategies are
designed and proven to achieve maximum diversity gain by using a single antenna
path (using single antenna of the source, each relay stage and the destination)
with the maximum signal-to-noise ratio at the destination. For the half-duplex
case, two single antenna paths with the two best signal-to-noise ratios in
alternate time slots are used to overcome the rate loss with half-duplex nodes,
with a small diversity gain penalty. Finally to answer the question, whether to
code (distributed space-time code) or not (the proposed end-to-end antenna
selection strategy) in a multi-hop relay channel, end-to-end antenna selection
strategy and distributed space-time coding is compared with respect to several
important performance metrics.
|
[
{
"version": "v1",
"created": "Tue, 20 May 2008 20:23:18 GMT"
}
] | 2008-05-22T00:00:00 |
[
[
"Vaze",
"Rahul",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.99961 |
0802.2846
|
Pascal Weil
|
Atlas F. Cook IV, Carola Wenk
|
Geodesic Fr\'echet Distance Inside a Simple Polygon
| null |
Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)
| null | null |
cs.DS cs.CG
| null |
We unveil an alluring alternative to parametric search that applies to both
the non-geodesic and geodesic Fr\'echet optimization problems. This randomized
approach is based on a variant of red-blue intersections and is appealing due
to its elegance and practical efficiency when compared to parametric search. We
present the first algorithm for the geodesic Fr\'echet distance between two
polygonal curves $A$ and $B$ inside a simple bounding polygon $P$. The geodesic
Fr\'echet decision problem is solved almost as fast as its non-geodesic sibling
and requires $O(N^{2\log k)$ time and $O(k+N)$ space after $O(k)$
preprocessing, where $N$ is the larger of the complexities of $A$ and $B$ and
$k$ is the complexity of $P$. The geodesic Fr\'echet optimization problem is
solved by a randomized approach in $O(k+N^{2\log kN\log N)$ expected time and
$O(k+N^{2)$ space. This runtime is only a logarithmic factor larger than the
standard non-geodesic Fr\'echet algorithm (Alt and Godau 1995). Results are
also presented for the geodesic Fr\'echet distance in a polygonal domain with
obstacles and the geodesic Hausdorff distance for sets of points or sets of
line segments inside a simple polygon $P$.
|
[
{
"version": "v1",
"created": "Wed, 20 Feb 2008 14:21:19 GMT"
}
] | 2008-05-21T00:00:00 |
[
[
"Cook",
"Atlas F.",
"IV"
],
[
"Wenk",
"Carola",
""
]
] |
new_dataset
| 0.996174 |
0805.2641
|
Seyed Abolfazl Motahari
|
Hossein Bagheri, Abolfazl S. Motahari, and Amir K. Khandani
|
On the Capacity of the Diamond Half-Duplex Relay Channel
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a diamond-shaped dual-hop communication system consisting a
source, two parallel half-duplex relays and a destination. In a single antenna
configuration, it has been previously shown that a two-phase node-scheduling
algorithm, along with the decode and forward strategy can achieve the capacity
of the diamond channel for a certain symmetric channel gains [1]. In this
paper, we obtain a more general condition for the optimality of the scheme in
terms of power resources and channel gains. In particular, it is proved that if
the product of the capacity of the simultaneously active links are equal in
both transmission phases, the scheme achieves the capacity of the channel.
|
[
{
"version": "v1",
"created": "Sat, 17 May 2008 01:01:31 GMT"
}
] | 2008-05-20T00:00:00 |
[
[
"Bagheri",
"Hossein",
""
],
[
"Motahari",
"Abolfazl S.",
""
],
[
"Khandani",
"Amir K.",
""
]
] |
new_dataset
| 0.996598 |
0805.1886
|
Vadim Zaliva
|
Vadim Zaliva
|
Platform-Independent Firewall Policy Representation
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we will discuss the design of abstract firewall model along
with platform-independent policy definition language. We will also discuss the
main design challenges and solutions to these challenges, as well as examine
several differences in policy semantics between vendors and how it could be
mapped to our platform-independent language. We will also touch upon a
processing model, describing the mechanism by which an abstract policy could be
compiled into a concrete firewall policy syntax. We will discuss briefly some
future research directions, such as policy optimization and validation
|
[
{
"version": "v1",
"created": "Tue, 13 May 2008 17:14:16 GMT"
}
] | 2008-05-14T00:00:00 |
[
[
"Zaliva",
"Vadim",
""
]
] |
new_dataset
| 0.980302 |
0707.0799
|
Xinjia Chen
|
Xinjia Chen, Kemin Zhou and Jorge Aravena
|
A New Family of Unitary Space-Time Codes with a Fast Parallel Sphere
Decoder Algorithm
|
66 pages, 7 figures
|
IEEE Transactions on Information Theory, vol. 52, pp. 115-140,
January 2006
| null | null |
cs.IT math.IT
| null |
In this paper we propose a new design criterion and a new class of unitary
signal constellations for differential space-time modulation for
multiple-antenna systems over Rayleigh flat-fading channels with unknown fading
coefficients. Extensive simulations show that the new codes have significantly
better performance than existing codes. We have compared the performance of our
codes with differential detection schemes using orthogonal design, Cayley
differential codes, fixed-point-free group codes and product of groups and for
the same bit error rate, our codes allow smaller signal to noise ratio by as
much as 10 dB. The design of the new codes is accomplished in a systematic way
through the optimization of a performance index that closely describes the bit
error rate as a function of the signal to noise ratio. The new performance
index is computationally simple and we have derived analytical expressions for
its gradient with respect to constellation parameters. Decoding of the proposed
constellations is reduced to a set of one-dimensional closest point problems
that we solve using parallel sphere decoder algorithms. This decoding strategy
can also improve efficiency of existing codes.
|
[
{
"version": "v1",
"created": "Thu, 5 Jul 2007 19:01:53 GMT"
}
] | 2008-05-12T00:00:00 |
[
[
"Chen",
"Xinjia",
""
],
[
"Zhou",
"Kemin",
""
],
[
"Aravena",
"Jorge",
""
]
] |
new_dataset
| 0.998873 |
0710.0198
|
Denis Krotov
|
Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia)
|
Z4-Linear Perfect Codes
|
15p. Bibliography updated
|
transl. from: Diskretn. Anal. Issled. Oper. Ser.1., 7(4) 2000,
78-90 [Russian]
| null | null |
cs.IT math.IT
| null |
For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually
nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these
codes have different ranks.
|
[
{
"version": "v1",
"created": "Mon, 1 Oct 2007 05:58:04 GMT"
}
] | 2008-05-10T00:00:00 |
[
[
"Krotov",
"Denis",
"",
"Sobolev Institute of Mathematics, Novosibirsk, Russia"
]
] |
new_dataset
| 0.98628 |
0710.0199
|
Denis Krotov
|
Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia)
|
Z4-linear Hadamard and extended perfect codes
|
7p. WCC-2001
|
Electron. Notes Discrete Math. 6 (2001) 107-112
|
10.1016/S1571-0653(04)00161-1
| null |
cs.IT math.IT
| null |
If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent
$Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent
$Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of
$Z_4$-linear Hadamard codes is given.
|
[
{
"version": "v1",
"created": "Mon, 1 Oct 2007 07:33:13 GMT"
}
] | 2008-05-10T00:00:00 |
[
[
"Krotov",
"Denis",
"",
"Sobolev Institute of Mathematics, Novosibirsk, Russia"
]
] |
new_dataset
| 0.991349 |
0805.0909
|
Michael Hilker
|
Michael Hilker and Christoph Schommer
|
SANA - Security Analysis in Internet Traffic through Artificial Immune
Systems
|
9 pages,
|
Proceedings of the Trustworthy Software Workshop 2006, IBFI,
Schloss Dagstuhl, May 2006, Saarbruecken, Germany
| null | null |
cs.CR cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Attacks done by Viruses, Worms, Hackers, etc. are a Network
Security-Problem in many Organisations. Current Intrusion Detection Systems
have significant Disadvantages, e.g. the need of plenty of Computational Power
or the Local Installation. Therefore, we introduce a novel Framework for
Network Security which is called SANA. SANA contains an artificial Immune
System with artificial Cells which perform certain Tasks in order to to support
existing systems to better secure the Network against Intrusions. The
Advantages of SANA are that it is efficient, adaptive, autonomous, and
massively-distributed. In this Article, we describe the Architecture of the
artificial Immune System and the Functionality of the Components. We explain
briefly the Implementation and discuss Results.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:31:18 GMT"
}
] | 2008-05-08T00:00:00 |
[
[
"Hilker",
"Michael",
""
],
[
"Schommer",
"Christoph",
""
]
] |
new_dataset
| 0.976671 |
0803.0778
|
Maximilien Gadouleau
|
Maximilien Gadouleau and Zhiyuan Yan
|
Constant-Rank Codes
|
5 pages, to appear in Proc. IEEE ISIT 2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constant-dimension codes have recently received attention due to their
significance to error control in noncoherent random network coding. In this
paper, we show that constant-rank codes are closely related to
constant-dimension codes and we study the properties of constant-rank codes. We
first introduce a relation between vectors in $\mathrm{GF}(q^m)^n$ and
subspaces of $\mathrm{GF}(q)^m$ or $\mathrm{GF}(q)^n$, and use it to establish
a relation between constant-rank codes and constant-dimension codes. We then
derive bounds on the maximum cardinality of constant-rank codes with given rank
weight and minimum rank distance. Finally, we investigate the asymptotic
behavior of the maximal cardinality of constant-rank codes with given rank
weight and minimum rank distance.
|
[
{
"version": "v1",
"created": "Thu, 6 Mar 2008 02:17:36 GMT"
},
{
"version": "v2",
"created": "Wed, 7 May 2008 20:35:10 GMT"
}
] | 2008-05-07T00:00:00 |
[
[
"Gadouleau",
"Maximilien",
""
],
[
"Yan",
"Zhiyuan",
""
]
] |
new_dataset
| 0.951351 |
0805.0785
|
Michael Hilker
|
Michael Hilker and Christoph Schommer
|
AGNOSCO - Identification of Infected Nodes with artificial Ant Colonies
|
5 pages, 2 figures
|
Proceedings of the 6th International Conference on Recent Advances
in Soft Computing (RASC2006), July 2006, Canterbury, United Kingdom
| null | null |
cs.AI cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
If a computer node is infected by a virus, worm or a backdoor, then this is a
security risk for the complete network structure where the node is associated.
Existing Network Intrusion Detection Systems (NIDS) provide a certain amount of
support for the identification of such infected nodes but suffer from the need
of plenty of communication and computational power. In this article, we present
a novel approach called AGNOSCO to support the identification of infected nodes
through the usage of artificial ant colonies. It is shown that AGNOSCO
overcomes the communication and computational power problem while identifying
infected nodes properly.
|
[
{
"version": "v1",
"created": "Tue, 6 May 2008 19:47:11 GMT"
},
{
"version": "v2",
"created": "Wed, 7 May 2008 15:33:35 GMT"
}
] | 2008-05-07T00:00:00 |
[
[
"Hilker",
"Michael",
""
],
[
"Schommer",
"Christoph",
""
]
] |
new_dataset
| 0.999554 |
0805.0521
|
Mich\`ele Wigger
|
Amos Lapidoth, Stefan M. Moser, Michele A. Wigger
|
On the Capacity of Free-Space Optical Intensity Channels
|
To be presented at ISIT 2008 in Toronto
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
New upper and lower bounds are presented on the capacity of the free-space
optical intensity channel. This channel is characterized by inputs that are
nonnegative (representing the transmitted optical intensity) and by outputs
that are corrupted by additive white Gaussian noise (because in free space the
disturbances arise from many independent sources). Due to battery and safety
reasons the inputs are simultaneously constrained in both their average and
peak power. For a fixed ratio of the average power to the peak power the
difference between the upper and the lower bounds tends to zero as the average
power tends to infinity, and the ratio of the upper and lower bounds tends to
one as the average power tends to zero. The case where only an average-power
constraint is imposed on the input is treated separately. In this case, the
difference of the upper and lower bound tends to 0 as the average power tends
to infinity, and their ratio tends to a constant as the power tends to zero.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2008 13:04:23 GMT"
}
] | 2008-05-06T00:00:00 |
[
[
"Lapidoth",
"Amos",
""
],
[
"Moser",
"Stefan M.",
""
],
[
"Wigger",
"Michele A.",
""
]
] |
new_dataset
| 0.980034 |
0805.0585
|
Jean Gallier
|
Jean Gallier
|
Discrete Mathematics for Computer Science, Some Notes
|
255 pages
| null | null | null |
cs.DM cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
These are notes on discrete mathematics for computer scientists. The
presentation is somewhat unconventional. Indeed I begin with a discussion of
the basic rules of mathematical reasoning and of the notion of proof formalized
in a natural deduction system ``a la Prawitz''. The rest of the material is
more or less traditional but I emphasize partial functions more than usual
(after all, programs may not terminate for all input) and I provide a fairly
complete account of the basic concepts of graph theory.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2008 18:52:00 GMT"
}
] | 2008-05-06T00:00:00 |
[
[
"Gallier",
"Jean",
""
]
] |
new_dataset
| 0.99523 |
0805.0589
|
Rahul Vaze
|
Rahul Vaze and Robert W. Heath Jr
|
Cascaded Orthogonal Space-Time Block Codes for Wireless Multi-Hop Relay
Networks
|
A part of this paper appears in the proceedings of the IEEE
International Symposium on Information Theory 2008, Toronto, Canada 6-11 July
2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Distributed space-time block coding is a diversity technique to mitigate the
effects of fading in multi-hop wireless networks, where multiple relay stages
are used by a source to communicate with its destination. This paper proposes a
new distributed space-time block code called the cascaded orthogonal space-time
block code (COSTBC) for the case where the source and destination are equipped
with multiple antennas and each relay stage has one or more single antenna
relays. Each relay stage is assumed to have receive channel state information
(CSI) for all the channels from the source to itself, while the destination is
assumed to have receive CSI for all the channels. To construct the COSTBC,
multiple orthogonal space-time block codes are used in cascade by the source
and each relay stage. In the COSTBC, each relay stage separates the
constellation symbols of the orthogonal space-time block code sent by the
preceding relay stage using its CSI, and then transmits another orthogonal
space-time block code to the next relay stage. COSTBCs are shown to achieve the
maximum diversity gain in a multi-hop wireless network with flat Rayleigh
fading channels. Several explicit constructions of COSTBCs are also provided
for two-hop wireless networks with two and four source antennas and relay
nodes. It is also shown that COSTBCs require minimum decoding complexity thanks
to the connection to orthogonal space-time block codes.
|
[
{
"version": "v1",
"created": "Mon, 5 May 2008 19:10:21 GMT"
}
] | 2008-05-06T00:00:00 |
[
[
"Vaze",
"Rahul",
""
],
[
"Heath",
"Robert W.",
"Jr"
]
] |
new_dataset
| 0.999412 |
0805.0173
|
Martin Dowd
|
Martin Dowd
|
A Computer Search for N1L-Configurations
|
submitted to IEEE Trans. Information Theory. 5 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an earlier paper the author defined N1L configurations, and stated a
conjecture concerning them which would lead to an improvement by a constant
factor to the sphere-packing bound for linear double error correcting codes.
Here a computer search is presented, in an effort to gather evidence on the
conjecture.
|
[
{
"version": "v1",
"created": "Fri, 2 May 2008 03:27:23 GMT"
}
] | 2008-05-05T00:00:00 |
[
[
"Dowd",
"Martin",
""
]
] |
new_dataset
| 0.989091 |
0805.0022
|
David Eppstein
|
Gill Barequet, David Eppstein, Michael T. Goodrich, and Amir Vaxman
|
Straight Skeletons of Three-Dimensional Polyhedra
|
12 pages, 47 figure files in 8 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper studies the straight skeleton of polyhedra in three dimensions. We
first address voxel-based polyhedra (polycubes), formed as the union of a
collection of cubical (axis-aligned) voxels. We analyze the ways in which the
skeleton may intersect each voxel of the polyhedron, and show that the skeleton
may be constructed by a simple voxel-sweeping algorithm taking constant time
per voxel. In addition, we describe a more complex algorithm for straight
skeletons of voxel-based polyhedra, which takes time proportional to the area
of the surfaces of the straight skeleton rather than the volume of the
polyhedron. We also consider more general polyhedra with axis-parallel edges
and faces, and show that any n-vertex polyhedron of this type has a straight
skeleton with O(n^2) features. We provide algorithms for constructing the
straight skeleton, with running time O(min(n^2 log n, k log^{O(1)} n)) where k
is the output complexity. Next, we discuss the straight skeleton of a general
nonconvex polyhedron. We show that it has an ambiguity issue, and suggest a
consistent method to resolve it. We prove that the straight skeleton of a
general polyhedron has a superquadratic complexity in the worst case. Finally,
we report on an implementation of a simple algorithm for the general case.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2008 22:52:34 GMT"
}
] | 2008-05-02T00:00:00 |
[
[
"Barequet",
"Gill",
""
],
[
"Eppstein",
"David",
""
],
[
"Goodrich",
"Michael T.",
""
],
[
"Vaxman",
"Amir",
""
]
] |
new_dataset
| 0.998734 |
0801.0672
|
Tobias Koch
|
Tobias Koch and Amos Lapidoth
|
On Multipath Fading Channels at High SNR
|
To be presented at the 2008 IEEE Symposium on Information Theory
(ISIT), Toronto, Canada; replaced with version that appears in the
proceedings
| null | null | null |
cs.IT math.IT
| null |
This paper studies the capacity of discrete-time multipath fading channels.
It is assumed that the number of paths is finite, i.e., that the channel output
is influenced by the present and by the L previous channel inputs. A
noncoherent channel model is considered where neither transmitter nor receiver
are cognizant of the fading's realization, but both are aware of its statistic.
The focus is on capacity at high signal-to-noise ratios (SNR). In particular,
the capacity pre-loglog - defined as the limiting ratio of the capacity to
loglog SNR as SNR tends to infinity - is studied. It is shown that,
irrespective of the number paths L, the capacity pre-loglog is 1.
|
[
{
"version": "v1",
"created": "Fri, 4 Jan 2008 12:40:05 GMT"
},
{
"version": "v2",
"created": "Thu, 1 May 2008 14:16:17 GMT"
}
] | 2008-05-01T00:00:00 |
[
[
"Koch",
"Tobias",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.967668 |
0804.4717
|
Icius Committee
|
T. Kubota and T. Yoshimitsu
|
Intelligent Unmanned Explorer for Deep Space Exploration
|
Uploaded by ICIUS2007 Conference Organizer on behalf of the
author(s). 8 pages, 10 figures, 4 tables
|
Proceedings of the International Conference on Intelligent
Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
ICIUS2007-A004-OP
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
asteroids or comets have received remarkable attention in the world. In small
body explorations, especially, detailed in-situ surface exploration by tiny
rover is one of effective and fruitful means and is expected to make strong
contributions towards scientific studies. JAXA ISAS is promoting MUSES C
mission, which is the worlds first sample and return attempt to or from the
near earth asteroid. Hayabusa spacecraft in MUSES C mission took the tiny
rover, which was expected to perform the in-situ surface exploration by
hopping. This paper describes the system design, mobility and intelligence of
the developed unmanned explorer. This paper also presents the ground
experimental results and the flight results.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2008 01:18:37 GMT"
}
] | 2008-05-01T00:00:00 |
[
[
"Kubota",
"T.",
""
],
[
"Yoshimitsu",
"T.",
""
]
] |
new_dataset
| 0.99361 |
0804.4752
|
Icius Committee
|
M.A. Moelyadi, and G. Sachs
|
Simulation of Dynamic Yaw Stability Derivatives of a Bird Using CFD
|
Uploaded by ICIUS2007 Conference Organizer on behalf of the
author(s). 8 pages, 15 figures, tables 3, Proceedings of the International
Conference on Intelligent Unmanned System (ICIUS 2007), Bali, Indonesia,
October 24-25, 2007
| null | null |
ICIUS2007-B012
|
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Simulation results on dynamic yaw stability derivatives of a gull bird by
means of computational fluid dynamics are presented. Two different kinds of
motions are used for determining the dynamic yaw stability derivatives CNr and
CNbeta . Concerning the first one, simple lateral translation and yaw rotary
motions in yaw are considered. The second one consists of combined motions. To
determine dynamic yaw stability derivatives of the bird, the simulation of an
unsteady flow with a bird model showing a harmonic motion is performed. The
unsteady flow solution for each time step is obtained by solving unsteady Euler
equations based on a finite volume approach for a smaller reduced frequency.
Then, an evaluation of unsteady forces and moments for one cycle is conducted
using harmonic Fourier analysis. The results on the dynamic yaw stability
derivatives for both simulations of the model motion show a good agreement.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2008 08:16:33 GMT"
}
] | 2008-05-01T00:00:00 |
[
[
"Moelyadi",
"M. A.",
""
],
[
"Sachs",
"G.",
""
]
] |
new_dataset
| 0.997983 |
0804.4799
|
Carl Bracken
|
Carl Bracken, Eimear Byrne, Nadya Markin and Gary McGuire
|
A Few More Quadratic APN Functions
|
12 pages, submitted to Cryptography and Communications
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present two infinite families of APN functions where the degree of the
field is divisible by 3 but not 9. Our families contain two already known
families as special cases. We also discuss the inequivalence proof (by
computation) which shows that these functions are new.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2008 11:50:58 GMT"
}
] | 2008-05-01T00:00:00 |
[
[
"Bracken",
"Carl",
""
],
[
"Byrne",
"Eimear",
""
],
[
"Markin",
"Nadya",
""
],
[
"McGuire",
"Gary",
""
]
] |
new_dataset
| 0.997314 |
0804.4885
|
Corey Bohil
|
C. Owen, F. Biocca, C. Bohil, J. Conley
|
SimDialog: A visual game dialog editor
| null | null | null | null |
cs.HC cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
SimDialog is a visual editor for dialog in computer games. This paper
presents the design of SimDialog, illustrating how script writers and
non-programmers can easily create dialog for video games with complex branching
structures and dynamic response characteristics. The system creates dialog as a
directed graph. This allows for play using the dialog with a state-based cause
and effect system that controls selection of non-player character responses and
can provide a basic scoring mechanism for games.
|
[
{
"version": "v1",
"created": "Wed, 30 Apr 2008 18:44:52 GMT"
}
] | 2008-05-01T00:00:00 |
[
[
"Owen",
"C.",
""
],
[
"Biocca",
"F.",
""
],
[
"Bohil",
"C.",
""
],
[
"Conley",
"J.",
""
]
] |
new_dataset
| 0.989517 |
0801.1060
|
Navin Kashyap
|
Akiko Manada and Navin Kashyap
|
On the Period of a Periodic-Finite-Type Shift
|
revised version; 5 pages; to appear in the Proceedings of the 2008
IEEE International Symposium on Information Theory (ISIT'08), Toronto, Canada
| null | null | null |
cs.IT math.IT
| null |
Periodic-finite-type shifts (PFT's) form a class of sofic shifts that
strictly contains the class of shifts of finite type (SFT's). In this paper, we
investigate how the notion of "period" inherent in the definition of a PFT
causes it to differ from an SFT, and how the period influences the properties
of a PFT.
|
[
{
"version": "v1",
"created": "Mon, 7 Jan 2008 16:53:32 GMT"
},
{
"version": "v2",
"created": "Wed, 30 Apr 2008 15:19:23 GMT"
}
] | 2008-04-30T00:00:00 |
[
[
"Manada",
"Akiko",
""
],
[
"Kashyap",
"Navin",
""
]
] |
new_dataset
| 0.960503 |
0804.4237
|
Robert Burger PhD
|
John Robert Burger
|
Explaining the Logical Nature of Electrical Solitons in Neural Circuits
|
13 pages, 16 figures
| null | null | null |
cs.NE q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Neurons are modeled electrically based on ferroelectric membranes thin enough
to permit charge transfer, conjectured to be the tunneling result of thermally
energetic ions and random electrons. These membranes can be triggered to
produce electrical solitons, the main signals for brain associative memory and
logical processing. Dendritic circuits are modeled, and electrical solitons are
simulated to demonstrate the nature of soliton propagation, soliton reflection,
the collision of solitons, as well as soliton OR gates, AND gates, XOR gates
and NOT gates.
|
[
{
"version": "v1",
"created": "Sat, 26 Apr 2008 16:55:59 GMT"
}
] | 2008-04-30T00:00:00 |
[
[
"Burger",
"John Robert",
""
]
] |
new_dataset
| 0.996378 |
0804.4662
|
Yijia Fan
|
Yijia Fan, Lifeng Lai, Elza Erkip, H. Vincent Poor
|
Rateless Coding for MIMO Block Fading Channels
|
Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6 - 11, 2008
| null | null | null |
cs.IT math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In this paper the performance limits and design principles of rateless codes
over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is
used to analyze the system performance for all possible transmission rates. It
is revealed from the analysis that the design of such rateless codes follows
the design principle of approximately universal codes for parallel
multiple-input multiple-output (MIMO) channels, in which each sub-channel is a
MIMO channel. More specifically, it is shown that for a single-input
single-output (SISO) channel, the previously developed permutation codes of
unit length for parallel channels having rate LR can be transformed directly
into rateless codes of length L having multiple rate levels (R, 2R, . . ., LR),
to achieve the DMT performance limit.
|
[
{
"version": "v1",
"created": "Tue, 29 Apr 2008 17:45:53 GMT"
}
] | 2008-04-30T00:00:00 |
[
[
"Fan",
"Yijia",
""
],
[
"Lai",
"Lifeng",
""
],
[
"Erkip",
"Elza",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.983082 |
0804.4195
|
Ruoheng Liu
|
Ruoheng Liu and H. Vincent Poor
|
Multi-Antenna Gaussian Broadcast Channels with Confidential Messages
|
Proceedings of the 2008 IEEE International Symposium on Information
Theory, Toronto, ON, Canada, July 6-11, 2008
| null | null | null |
cs.IT cs.CR math.IT
|
http://creativecommons.org/licenses/by/3.0/
|
In wireless data networks, communication is particularly susceptible to
eavesdropping due to its broadcast nature. Security and privacy systems have
become critical for wireless providers and enterprise networks. This paper
considers the problem of secret communication over a Gaussian broadcast
channel, where a multi-antenna transmitter sends independent confidential
messages to two users with \emph{information-theoretic secrecy}. That is, each
user would like to obtain its own confidential message in a reliable and safe
manner. This communication model is referred to as the multi-antenna Gaussian
broadcast channel with confidential messages (MGBC-CM). Under this
communication scenario, a secret dirty-paper coding scheme and the
corresponding achievable secrecy rate region are first developed based on
Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy
capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer
bound proves to be consistent with the boundary of the secret dirty-paper
coding achievable rate region, and hence, the secrecy capacity region of the
MGBC-CM is established. Finally, a numerical example demonstrates that both
users can achieve positive rates simultaneously under the information-theoretic
secrecy requirement.
|
[
{
"version": "v1",
"created": "Sat, 26 Apr 2008 01:52:09 GMT"
}
] | 2008-04-29T00:00:00 |
[
[
"Liu",
"Ruoheng",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.996146 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.