id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0903.2791
|
Steve Szabo
|
Sergio Lopez-Permouth and Steve Szabo
|
On the Hamming weight of Repeated Root Cyclic and Negacyclic Codes over
Galois Rings
|
Submitted
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Repeated root Cyclic and Negacyclic codes over Galois rings have been studied
much less than their simple root counterparts. This situation is beginning to
change. For example, repeated root codes of length $p^s$, where $p$ is the
characteristic of the alphabet ring, have been studied under some additional
hypotheses. In each one of those cases, the ambient space for the codes has
turned out to be a chain ring. In this paper, all remaining cases of cyclic and
negacyclic codes of length $p^s$ over a Galois ring alphabet are considered. In
these cases the ambient space is a local ring with simple socle but not a chain
ring. Nonetheless, by reducing the problem to one dealing with uniserial
subambients, a method for computing the Hamming distance of these codes is
provided.
|
[
{
"version": "v1",
"created": "Mon, 16 Mar 2009 16:25:32 GMT"
}
] | 2009-03-17T00:00:00 |
[
[
"Lopez-Permouth",
"Sergio",
""
],
[
"Szabo",
"Steve",
""
]
] |
new_dataset
| 0.998806 |
0903.2382
|
Olivier Carton
|
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
|
Infinite words without palindrome
|
3 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We show that there exists an uniformly recurrent infinite word whose set of
factors is closed under reversal and which has only finitely many palindromic
factors.
|
[
{
"version": "v1",
"created": "Fri, 13 Mar 2009 13:20:44 GMT"
}
] | 2009-03-16T00:00:00 |
[
[
"Berstel",
"Jean",
""
],
[
"Boasson",
"Luc",
""
],
[
"Carton",
"Olivier",
""
],
[
"Fagnot",
"Isabelle",
""
]
] |
new_dataset
| 0.997436 |
0807.4846
|
Natalia Silberstein
|
Tuvi Etzion and Natalia Silberstein
|
Error-Correcting Codes in Projective Spaces via Rank-Metric Codes and
Ferrers Diagrams
|
Revised for IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Coding in the projective space has received recently a lot of attention due
to its application in network coding. Reduced row echelon form of the linear
subspaces and Ferrers diagram can play a key role for solving coding problems
in the projective space. In this paper we propose a method to design
error-correcting codes in the projective space. We use a multilevel approach to
design our codes. First, we select a constant weight code. Each codeword
defines a skeleton of a basis for a subspace in reduced row echelon form. This
skeleton contains a Ferrers diagram on which we design a rank-metric code. Each
such rank-metric code is lifted to a constant dimension code. The union of
these codes is our final constant dimension code. In particular the codes
constructed recently by Koetter and Kschischang are a subset of our codes. The
rank-metric codes used for this construction form a new class of rank-metric
codes. We present a decoding algorithm to the constructed codes in the
projective space. The efficiency of the decoding depends on the efficiency of
the decoding for the constant weight codes and the rank-metric codes. Finally,
we use puncturing on our final constant dimension codes to obtain large codes
in the projective space which are not constant dimension.
|
[
{
"version": "v1",
"created": "Wed, 30 Jul 2008 12:18:22 GMT"
},
{
"version": "v2",
"created": "Thu, 30 Oct 2008 06:45:43 GMT"
},
{
"version": "v3",
"created": "Sun, 8 Feb 2009 10:16:42 GMT"
},
{
"version": "v4",
"created": "Sat, 14 Mar 2009 20:04:58 GMT"
}
] | 2009-03-14T00:00:00 |
[
[
"Etzion",
"Tuvi",
""
],
[
"Silberstein",
"Natalia",
""
]
] |
new_dataset
| 0.966362 |
0903.2108
|
Maurice Margenstern
|
Maurice Margenstern
|
A new universal cellular automaton on the ternary heptagrid
|
35 pages, 33 figures
| null | null | null |
cs.FL cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we construct a new weakly universal cellular automaton on the
ternary heptagrid. The previous result, obtained by the same author and Y. Song
required six states only. This time, the number of states is four. This is the
best result up to date for cellular automata in the hyperbolic plane.
|
[
{
"version": "v1",
"created": "Thu, 12 Mar 2009 15:15:39 GMT"
}
] | 2009-03-13T00:00:00 |
[
[
"Margenstern",
"Maurice",
""
]
] |
new_dataset
| 0.967921 |
0903.1953
|
Balder ten Cate
|
Balder ten Cate, Laura Chiticariu, Phokion Kolaitis and Wang-Chiew Tan
|
Laconic schema mappings: computing core universal solutions by means of
SQL queries
| null | null | null | null |
cs.DB
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a new method for computing core universal solutions in data
exchange settings specified by source-to-target dependencies, by means of SQL
queries. Unlike previously known algorithms, which are recursive in nature, our
method can be implemented directly on top of any DBMS. Our method is based on
the new notion of a laconic schema mapping. A laconic schema mapping is a
schema mapping for which the canonical universal solution is the core universal
solution. We give a procedure by which every schema mapping specified by FO s-t
tgds can be turned into a laconic schema mapping specified by FO s-t tgds that
may refer to a linear order on the domain of the source instance. We show that
our results are optimal, in the sense that the linear order is necessary and
the method cannot be extended to schema mapping involving target constraints.
|
[
{
"version": "v1",
"created": "Wed, 11 Mar 2009 11:34:20 GMT"
}
] | 2009-03-12T00:00:00 |
[
[
"Cate",
"Balder ten",
""
],
[
"Chiticariu",
"Laura",
""
],
[
"Kolaitis",
"Phokion",
""
],
[
"Tan",
"Wang-Chiew",
""
]
] |
new_dataset
| 0.968183 |
cs/0305059
|
Emanuele Leonardi
|
E. Leonardi and M.W. Schulz
|
EU DataGRID testbed management and support at CERN
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 7 pages, LaTeX. PSN THCT007
|
ECONF C0303241:THCT007,2003
| null | null |
cs.DC
| null |
In this paper we report on the first two years of running the CERN testbed
site for the EU DataGRID project. The site consists of about 120 dual-processor
PCs distributed over several testbeds used for different purposes: software
development, system integration, and application tests. Activities at the site
included test productions of MonteCarlo data for LHC experiments, tutorials and
demonstrations of GRID technologies, and support for individual users analysis.
This paper focuses on node installation and configuration techniques, service
management, user support in a gridified environment, and includes
considerations on scalability and security issues and comparisons with
"traditional" production systems, as seen from the administrator point of view.
|
[
{
"version": "v1",
"created": "Fri, 30 May 2003 10:07:12 GMT"
}
] | 2009-03-12T00:00:00 |
[
[
"Leonardi",
"E.",
""
],
[
"Schulz",
"M. W.",
""
]
] |
new_dataset
| 0.990076 |
cs/0601040
|
Michel Parent
|
Michel Parent (INRIA Rocquencourt)
|
New Technologies for Sustainable Urban Transport in Europe
| null |
Transportation Research Board 85th Annual Meeting (2006)
| null | null |
cs.RO
| null |
In the past few years, the European Commission has financed several projects
to examine how new technologies could improve the sustainability of European
cities. These technologies concern new public transportation modes such as
guided buses to form high capacity networks similar to light rail but at a
lower cost and better flexibility, PRT (Personal Rapid Transit) and cybercars
(small urban vehicles with fully automatic driving capabilities to be used in
carsharing mode, mostly as a complement to mass transport). They also concern
private vehicles with technologies which could improve the efficiency of the
vehicles as well as their safety (Intelligent Speed Adaptation, Adaptive Cruise
>.Control, Stop&Go, Lane Keeping,...) and how these new vehicles can complement
mass transport in the form of car-sharing services.
|
[
{
"version": "v1",
"created": "Tue, 10 Jan 2006 13:57:28 GMT"
}
] | 2009-03-12T00:00:00 |
[
[
"Parent",
"Michel",
"",
"INRIA Rocquencourt"
]
] |
new_dataset
| 0.999178 |
0903.1659
|
Zhe Chen
|
Zhe Chen
|
Heuristic Reasoning on Graph and Game Complexity of Sudoku
|
6 pages, 2 figures
| null | null | null |
cs.AI cs.GT cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Sudoku puzzle has achieved worldwide popularity recently, and attracted
great attention of the computational intelligence community. Sudoku is always
considered as Satisfiability Problem or Constraint Satisfaction Problem. In
this paper, we propose to focus on the essential graph structure underlying the
Sudoku puzzle. First, we formalize Sudoku as a graph. Then a solving algorithm
based on heuristic reasoning on the graph is proposed. The related r-Reduction
theorem, inference theorem and their properties are proved, providing the
formal basis for developments of Sudoku solving systems. In order to evaluate
the difficulty levels of puzzles, a quantitative measurement of the complexity
level of Sudoku puzzles based on the graph structure and information theory is
proposed. Experimental results show that all the puzzles can be solved fast
using the proposed heuristic reasoning, and that the proposed game complexity
metrics can discriminate difficulty levels of puzzles perfectly.
|
[
{
"version": "v1",
"created": "Mon, 9 Mar 2009 22:35:14 GMT"
}
] | 2009-03-11T00:00:00 |
[
[
"Chen",
"Zhe",
""
]
] |
new_dataset
| 0.977023 |
0903.1820
|
Michele Wigger
|
Amos Lapidoth, Stefan M. Moser, Michele A. Wigger
|
On the Capacity of Free-Space Optical Intensity Channels
|
Transmitted to IEEE Transactions on Information Theory. Presented at
ISIT 2008 in Toronto
| null | null |
13454533334
|
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": "Tue, 10 Mar 2009 17:46:32 GMT"
}
] | 2009-03-11T00:00:00 |
[
[
"Lapidoth",
"Amos",
""
],
[
"Moser",
"Stefan M.",
""
],
[
"Wigger",
"Michele A.",
""
]
] |
new_dataset
| 0.980034 |
0903.1509
|
Sourav Dhar
|
Rabindranath Bera, Sourav Dhar, Debdatta Kandar
|
Digital Radar for Collision Avoidance and Automatic Cruise Control in
Transportation
|
5 pages, 12 figs.,published in ISM-08, Bangalore, India, 3-6 December
2008
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A proper remote sensing device is required for automatic cruise control (ACC)
to avoid collision in transportation system. In this paper we proposed a direct
sequence spread spectrum (DSSS) radar for remote sensing in intelligent
transporation system(ITS). We have successfully detected single target and
through 1D radar imaging we are capable to separate multiple targets. We have
also implemented DSSS radar using software defined radio (SDR) and successfully
detected a single target.
|
[
{
"version": "v1",
"created": "Mon, 9 Mar 2009 10:09:40 GMT"
}
] | 2009-03-10T00:00:00 |
[
[
"Bera",
"Rabindranath",
""
],
[
"Dhar",
"Sourav",
""
],
[
"Kandar",
"Debdatta",
""
]
] |
new_dataset
| 0.979694 |
0903.1196
|
Inge Bethke
|
Inge Bethke, Piet Rodenburg and Arjen Sevenster
|
The structure of finite meadows
|
12 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A meadow is a commutative ring with a total inverse operator satisfying
0^{-1}=0. We show that the class of finite meadows is the closure of the class
of Galois fields under finite products. As a corollary, we obtain a unique
representation of minimal finite meadows in terms of finite prime fields.
|
[
{
"version": "v1",
"created": "Fri, 6 Mar 2009 12:08:55 GMT"
}
] | 2009-03-09T00:00:00 |
[
[
"Bethke",
"Inge",
""
],
[
"Rodenburg",
"Piet",
""
],
[
"Sevenster",
"Arjen",
""
]
] |
new_dataset
| 0.999116 |
0810.2659
|
Pannir Selvam Elamvazhuthi
|
P.S. Elamvazhuthi (1 and 2), P.S. Kulkarni (1 and 3), and B.K. Dey (1)
((1) Indian Institute of Technology Bombay, Mumbai, India, (2) Cognizant
Technology Solutions India Pvt. Ltd., Chennai, India, (3) Juniper Networks
Inc., Bengaluru, India)
|
DSTC Layering Protocols in Wireless Cooperative Networks
|
39 pages, 20 figures. Part of this paper is submitted to IEEE 70th
Vehicular Technology Conference: VTC2009-Fall for publication
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a radio network with single source-destination pair and some relays, a
link between any two nodes is considered to have same or zero path loss.
However in practice some links may have considerably high path loss than others
but still being useful. In this report, we take into account signals received
from these links also. \indent Our system model consists of a
source-destination pair with two layers of relays in which weaker links between
source and second layer and between the first layer and destination are also
considered. We propose some protocols in this system model, run simulations
under optimum power allocation, and compare these protocols. We show that under
reasonable channel strength of these weaker links, the proposed protocols
perform ($ \approx 2$ dB) better than the existing basic protocol. As expected,
the degree of improvement increases with the strength of the weaker links. We
also show that with the receive channel knowledge in relays, the reliability
and data rate are improved.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2008 10:57:55 GMT"
},
{
"version": "v2",
"created": "Fri, 6 Mar 2009 09:29:59 GMT"
},
{
"version": "v3",
"created": "Sat, 7 Mar 2009 17:02:26 GMT"
}
] | 2009-03-07T00:00:00 |
[
[
"Elamvazhuthi",
"P. S.",
"",
"1 and 2"
],
[
"Kulkarni",
"P. S.",
"",
"1 and 3"
],
[
"Dey",
"B. K.",
""
]
] |
new_dataset
| 0.98759 |
0903.0889
|
David Doty
|
David Doty, Matthew J. Patitz
|
A Domain-Specific Language for Programming in the Tile Assembly Model
| null | null | null | null |
cs.SE cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a domain-specific language (DSL) for creating sets of tile types
for simulations of the abstract Tile Assembly Model. The language defines
objects known as tile templates, which represent related groups of tiles, and a
small number of basic operations on tile templates that help to eliminate the
error-prone drudgery of enumerating such tile types manually or with low-level
constructs of general-purpose programming languages. The language is
implemented as a class library in Python (a so-called internal DSL), but is
presented independently of Python or object-oriented programming, with emphasis
on supporting the creation of visual editing tools for programmatically
creating large sets of complex tile types without needing to write a program.
|
[
{
"version": "v1",
"created": "Thu, 5 Mar 2009 01:19:35 GMT"
}
] | 2009-03-06T00:00:00 |
[
[
"Doty",
"David",
""
],
[
"Patitz",
"Matthew J.",
""
]
] |
new_dataset
| 0.999328 |
0903.1033
|
\'Angel del R\'io
|
Jose Joaquin Bernal, Angel del Rio, Juan Jacobo Simon
|
Group code structures on affine-invariant codes
|
7 pages
| null | null | null |
cs.IT math.GR math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A group code structure of a linear code is a description of the code as
one-sided or two-sided ideal of a group algebra of a finite group. In these
realizations, the group algebra is identified with the ambient space, and the
group elements with the coordinates of the ambient space. It is well known that
every affine-invariant code of length $p^m$, with $p$ prime, can be realized as
an ideal of the group algebra $\F\I$, where $\I$ is the underlying additive
group of the field with $p^m$ elements. In this paper we describe all the group
code structures of an affine-invariant code of length $p^m$ in terms of a
family of maps from $\I$ to the group of automorphisms of $\I$.
|
[
{
"version": "v1",
"created": "Thu, 5 Mar 2009 17:08:01 GMT"
}
] | 2009-03-06T00:00:00 |
[
[
"Bernal",
"Jose Joaquin",
""
],
[
"del Rio",
"Angel",
""
],
[
"Simon",
"Juan Jacobo",
""
]
] |
new_dataset
| 0.988966 |
cs/0611073
|
Michael Baer
|
Michael B. Baer
|
Prefix Codes for Power Laws with Countable Support
|
5 pages, 2 tables, submitted to Transactions on Information Theory
|
Information Theory, 2008. ISIT 2008. IEEE International Symposium
on
|
10.1109/ISIT.2008.4595434
| null |
cs.IT math.IT
| null |
In prefix coding over an infinite alphabet, methods that consider specific
distributions generally consider those that decline more quickly than a power
law (e.g., Golomb coding). Particular power-law distributions, however, model
many random variables encountered in practice. For such random variables,
compression performance is judged via estimates of expected bits per input
symbol. This correspondence introduces a family of prefix codes with an eye
towards near-optimal coding of known distributions. Compression performance is
precisely estimated for well-known probability distributions using these codes
and using previously known prefix codes. One application of these near-optimal
codes is an improved representation of rational numbers.
|
[
{
"version": "v1",
"created": "Wed, 15 Nov 2006 22:07:24 GMT"
},
{
"version": "v2",
"created": "Thu, 21 Jun 2007 22:28:07 GMT"
}
] | 2009-03-06T00:00:00 |
[
[
"Baer",
"Michael B.",
""
]
] |
new_dataset
| 0.998615 |
0706.4170
|
Alessandro Mirone
|
Alessandro Mirone
|
Hilbert++ Manual
| null | null | null | null |
cs.OH cond-mat.str-el
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present here an installation guide, a hand-on mini-tutorial through
examples, and the theoretical foundations of the Hilbert++ code.
|
[
{
"version": "v1",
"created": "Thu, 28 Jun 2007 09:09:55 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Mar 2009 09:03:37 GMT"
}
] | 2009-03-03T00:00:00 |
[
[
"Mirone",
"Alessandro",
""
]
] |
new_dataset
| 0.986026 |
0712.3423
|
Alban Ponse
|
J.A. Bergstra, A. Ponse, M.B. van der Zwaag
|
Tuplix Calculus
|
22 pages
|
Scientific Annals of Computer Science, 18:35--61, 2008
| null |
PRG0713
|
cs.LO cs.CE
| null |
We introduce a calculus for tuplices, which are expressions that generalize
matrices and vectors. Tuplices have an underlying data type for quantities that
are taken from a zero-totalized field. We start with the core tuplix calculus
CTC for entries and tests, which are combined using conjunctive composition. We
define a standard model and prove that CTC is relatively complete with respect
to it. The core calculus is extended with operators for choice, information
hiding, scalar multiplication, clearing and encapsulation. We provide two
examples of applications; one on incremental financial budgeting, and one on
modular financial budget design.
|
[
{
"version": "v1",
"created": "Thu, 20 Dec 2007 13:58:14 GMT"
}
] | 2009-03-03T00:00:00 |
[
[
"Bergstra",
"J. A.",
""
],
[
"Ponse",
"A.",
""
],
[
"van der Zwaag",
"M. B.",
""
]
] |
new_dataset
| 0.991797 |
0903.0034
|
Vladimir Braverman
|
Vladimir Braverman, Rafail Ostrovsky
|
Measuring Independence of Datasets
| null | null | null | null |
cs.DS cs.DB cs.IR cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A data stream model represents setting where approximating pairwise, or
$k$-wise, independence with sublinear memory is of considerable importance. In
the streaming model the joint distribution is given by a stream of $k$-tuples,
with the goal of testing correlations among the components measured over the
entire stream. In the streaming model, Indyk and McGregor (SODA 08) recently
gave exciting new results for measuring pairwise independence. The Indyk and
McGregor methods provide $\log{n}$-approximation under statistical distance
between the joint and product distributions in the streaming model. Indyk and
McGregor leave, as their main open question, the problem of improving their
$\log n$-approximation for the statistical distance metric.
In this paper we solve the main open problem posed by of Indyk and McGregor
for the statistical distance for pairwise independence and extend this result
to any constant $k$. In particular, we present an algorithm that computes an
$(\epsilon, \delta)$-approximation of the statistical distance between the
joint and product distributions defined by a stream of $k$-tuples. Our
algorithm requires $O(({1\over \epsilon}\log({nm\over \delta}))^{(30+k)^k})$
memory and a single pass over the data stream.
|
[
{
"version": "v1",
"created": "Sun, 1 Mar 2009 01:29:54 GMT"
}
] | 2009-03-03T00:00:00 |
[
[
"Braverman",
"Vladimir",
""
],
[
"Ostrovsky",
"Rafail",
""
]
] |
new_dataset
| 0.986573 |
0902.4481
|
Jian Tan
|
Predrag R. Jelenkovic and Jian Tan
|
Stability of Finite Population ALOHA with Variable Packets
|
14 pages, 5 figures
| null | null |
EE2009-02-20
|
cs.PF cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
ALOHA is one of the most basic Medium Access Control (MAC) protocols and
represents a foundation for other more sophisticated distributed and
asynchronous MAC protocols, e.g., CSMA. In this paper, unlike in the
traditional work that focused on mean value analysis, we study the
distributional properties of packet transmission delays over an ALOHA channel.
We discover a new phenomenon showing that a basic finite population ALOHA model
with variable size (exponential) packets is characterized by power law
transmission delays, possibly even resulting in zero throughput. These results
are in contrast to the classical work that shows exponential delays and
positive throughput for finite population ALOHA with fixed packets.
Furthermore, we characterize a new stability condition that is entirely derived
from the tail behavior of the packet and backoff distributions that may not be
determined by mean values. The power law effects and the possible instability
might be diminished, or perhaps eliminated, by reducing the variability of
packets. However, we show that even a slotted (synchronized) ALOHA with packets
of constant size can exhibit power law delays when the number of active users
is random. From an engineering perspective, our results imply that the
variability of packet sizes and number of active users need to be taken into
consideration when designing robust MAC protocols, especially for ad-hoc/sensor
networks where other factors, such as link failures and mobility, might further
compound the problem.
|
[
{
"version": "v1",
"created": "Wed, 25 Feb 2009 22:59:58 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Feb 2009 22:34:03 GMT"
}
] | 2009-02-27T00:00:00 |
[
[
"Jelenkovic",
"Predrag R.",
""
],
[
"Tan",
"Jian",
""
]
] |
new_dataset
| 0.993114 |
0902.4572
|
Saloua Chettibi
|
Saloua Chettibi, M. Benmohamed
|
A Multipath Energy-Aware On demand Source Routing Protocol for Mobile
Ad-Hoc Networks
| null |
1st Workshop on Next Generation Networks: Mobility, WNGN,, Maroc
(2009)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Energy consumption is the most challenging issue in routing protocol design
for mobile ad-hoc networks (MANETs), since mobile nodes are battery powered.
Furthermore, replacing or recharging batteries is often impossible in critical
environments such as in military or rescue missions. In a MANET, the energy
depletion of a node does not affect the node itself only, but the overall
network lifetime. In this paper, we present multipath and energy-aware on
demand source routing (MEA-DSR) protocol, which exploits route diversity and
information about batteries-energy levels for balancing energy consumption
between mobile nodes. Simulation results, have shown that MEA-DSR protocol is
more energy efficient than DSR in almost mobility scenarios.
|
[
{
"version": "v1",
"created": "Thu, 26 Feb 2009 12:47:12 GMT"
}
] | 2009-02-27T00:00:00 |
[
[
"Chettibi",
"Saloua",
""
],
[
"Benmohamed",
"M.",
""
]
] |
new_dataset
| 0.99737 |
cs/0701037
|
Gene Cooperman
|
Jason Ansel, Kapil Arya, Gene Cooperman
|
DMTCP: Transparent Checkpointing for Cluster Computations and the
Desktop
|
17 pages; 2 figures, 8 plots, and 2 tables; description of DMTCP;
Version 3: describing checkpointing both for distributed multi-threaded
applications (including MPI), and interactive shell-like languages on
desktop; Revised to reflect version published in IPDPS-09; Software at:
http://dmtcp.sourceforge.net/
| null | null | null |
cs.DC cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level
checkpointing package for distributed applications. Checkpointing and restart
is demonstrated for a wide range of over 20 well known applications, including
MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB
image in memory that includes 540 dynamic libraries, and is used for the CMS
experiment of the Large Hadron Collider at CERN. DMTCP transparently
checkpoints general cluster computations consisting of many nodes, processes,
and threads; as well as typical desktop applications. On 128 distributed cores
(32 nodes), checkpoint and restart times are typically 2 seconds, with
negligible run-time overhead. Typical checkpoint times are reduced to 0.2
seconds when using forked checkpointing. Experimental results show that
checkpoint time remains nearly constant as the number of nodes increases on a
medium-size cluster.
DMTCP automatically accounts for fork, exec, ssh, mutexes/semaphores, TCP/IP
sockets, UNIX domain sockets, pipes, ptys (pseudo-terminals), terminal modes,
ownership of controlling terminals, signal handlers, open file descriptors,
shared open file descriptors, I/O (including the readline library), shared
memory (via mmap), parent-child process relationships, pid virtualization, and
other operating system artifacts. By emphasizing an unprivileged, user-space
approach, compatibility is maintained across Linux kernels from 2.6.9 through
the current 2.6.28. Since DMTCP is unprivileged and does not require special
kernel modules or kernel patches, DMTCP can be incorporated and distributed as
a checkpoint-restart module within some larger package.
|
[
{
"version": "v1",
"created": "Sat, 6 Jan 2007 11:36:50 GMT"
},
{
"version": "v2",
"created": "Sun, 20 Apr 2008 08:42:29 GMT"
},
{
"version": "v3",
"created": "Tue, 24 Feb 2009 18:13:25 GMT"
}
] | 2009-02-24T00:00:00 |
[
[
"Ansel",
"Jason",
""
],
[
"Arya",
"Kapil",
""
],
[
"Cooperman",
"Gene",
""
]
] |
new_dataset
| 0.996532 |
0902.3648
|
Claus-Peter Wirth
|
Volker Mattick, Claus-Peter Wirth
|
An Algebraic Dexter-Based Hypertext Reference Model
|
ii + 48 pages
| null | null |
Research Report 719/1999 (green/grey series), Fachbereich
Informatik, University of Dortmund
|
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the first formal algebraic specification of a hypertext reference
model. It is based on the well-known Dexter Hypertext Reference Model and
includes modifications with respect to the development of hypertext since the
WWW came up. Our hypertext model was developed as a product model with the aim
to automatically support the design process and is extended to a model of
hypertext-systems in order to be able to describe the state transitions in this
process. While the specification should be easy to read for non-experts in
algebraic specification, it guarantees a unique understanding and enables a
close connection to logic-based development and verification.
|
[
{
"version": "v1",
"created": "Fri, 20 Feb 2009 19:57:30 GMT"
}
] | 2009-02-23T00:00:00 |
[
[
"Mattick",
"Volker",
""
],
[
"Wirth",
"Claus-Peter",
""
]
] |
new_dataset
| 0.998845 |
0902.3178
|
Deniz Gunduz
|
Deniz Gunduz, Osvaldo Simeone, Andrea J. Goldsmith, H. Vincent Poor
and Shlomo Shamai (Shitz)
|
Multiple Multicasts with the Help of a Relay
|
Submitted to Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of simultaneous multicasting of multiple messages with the help
of a relay terminal is considered. In particular, a model is studied in which a
relay station simultaneously assists two transmitters in multicasting their
independent messages to two receivers. The relay may also have an independent
message of its own to multicast. As a first step to address this general model,
referred to as the compound multiple access channel with a relay (cMACr), the
capacity region of the multiple access channel with a "cognitive" relay is
characterized, including the cases of partial and rate-limited cognition. Then,
achievable rate regions for the cMACr model are presented based on
decode-and-forward (DF) and compress-and-forward (CF) relaying strategies.
Moreover, an outer bound is derived for the special case, called the cMACr
without cross-reception, in which each transmitter has a direct link to one of
the receivers while the connection to the other receiver is enabled only
through the relay terminal. The capacity region is characterized for a binary
modulo additive cMACr without cross-reception, showing the optimality of binary
linear block codes, thus highlighting the benefits of physical layer network
coding and structured codes. Results are extended to the Gaussian channel model
as well, providing achievable rate regions for DF and CF, as well as for a
structured code design based on lattice codes. It is shown that the performance
with lattice codes approaches the upper bound for increasing power, surpassing
the rates achieved by the considered random coding-based techniques.
|
[
{
"version": "v1",
"created": "Wed, 18 Feb 2009 16:04:03 GMT"
}
] | 2009-02-19T00:00:00 |
[
[
"Gunduz",
"Deniz",
"",
"Shitz"
],
[
"Simeone",
"Osvaldo",
"",
"Shitz"
],
[
"Goldsmith",
"Andrea J.",
"",
"Shitz"
],
[
"Poor",
"H. Vincent",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.952296 |
0902.2917
|
Matthias Hesse
|
Matthias Hesse (I3S), Jerome Lebrun (I3S), Luc Deneire (I3S)
|
Full Rate L2-Orthogonal Space-Time CPM for Three Antennas
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To combine the power efficiency of Continuous Phase Modulation (CPM) with
enhanced performance in fading environments, some authors have suggested to use
CPM in combination with Space-Time Codes (STC). Recently, we have proposed a
CPM ST-coding scheme based on L2-orthogonality for two transmitting antennas.
In this paper we extend this approach to the three antennas case. We
analytically derive a family of coding schemes which we call Parallel Code
(PC). This code family has full rate and we prove that the proposed coding
scheme achieves full diversity as confirmed by accompanying simulations. We
detail an example of the proposed ST codes that can be interpreted as a
conventional CPM scheme with different alphabet sets for the different transmit
antennas which results in a simplified implementation. Thanks to
L2-orthogonality, the decoding complexity, usually exponentially proportional
to the number of transmitting antennas, is reduced to linear complexity.
|
[
{
"version": "v1",
"created": "Tue, 17 Feb 2009 13:01:16 GMT"
}
] | 2009-02-18T00:00:00 |
[
[
"Hesse",
"Matthias",
"",
"I3S"
],
[
"Lebrun",
"Jerome",
"",
"I3S"
],
[
"Deneire",
"Luc",
"",
"I3S"
]
] |
new_dataset
| 0.969517 |
0902.2953
|
Artem Chebotko
|
Shiyong Lu, Rong Huang, Artem Chebotko, Yu Deng, Farshad Fotouhi
|
ImageSpace: An Environment for Image Ontology Management
|
Appeared in the International Journal of Information Theories and
Applications (IJITA), 11(2), pp. 127-134, 2004
|
International Journal of Information Theories and Applications
(IJITA), 11(2), pp. 127-134, 2004
| null | null |
cs.DL cs.DB cs.MM cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
More and more researchers have realized that ontologies will play a critical
role in the development of the Semantic Web, the next generation Web in which
content is not only consumable by humans, but also by software agents. The
development of tools to support ontology management including creation,
visualization, annotation, database storage, and retrieval is thus extremely
important. We have developed ImageSpace, an image ontology creation and
annotation tool that features (1) full support for the standard web ontology
language DAML+OIL; (2) image ontology creation, visualization, image annotation
and display in one integrated framework; (3) ontology consistency assurance;
and (4) storing ontologies and annotations in relational databases. It is
expected that the availability of such a tool will greatly facilitate the
creation of image repositories as islands of the Semantic Web.
|
[
{
"version": "v1",
"created": "Tue, 17 Feb 2009 17:28:25 GMT"
}
] | 2009-02-18T00:00:00 |
[
[
"Lu",
"Shiyong",
""
],
[
"Huang",
"Rong",
""
],
[
"Chebotko",
"Artem",
""
],
[
"Deng",
"Yu",
""
],
[
"Fotouhi",
"Farshad",
""
]
] |
new_dataset
| 0.980962 |
0902.2975
|
Claus-Peter Wirth
|
Claus-Peter Wirth, Ruediger Lunde
|
Writing Positive/Negative-Conditional Equations Conveniently
|
ii + 21 pages
| null | null |
SEKI Working-Paper SWP-94-04
|
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a convenient notation for positive/negative-conditional equations.
The idea is to merge rules specifying the same function by using case-, if-,
match-, and let-expressions. Based on the presented macro-rule-construct,
positive/negative-conditional equational specifications can be written on a
higher level. A rewrite system translates the macro-rule-constructs into
positive/negative-conditional equations.
|
[
{
"version": "v1",
"created": "Tue, 17 Feb 2009 19:13:32 GMT"
}
] | 2009-02-18T00:00:00 |
[
[
"Wirth",
"Claus-Peter",
""
],
[
"Lunde",
"Ruediger",
""
]
] |
new_dataset
| 0.976067 |
0902.2230
|
Ama\c{c} Herda\u{g}delen
|
Ama\c{c} Herda\u{g}delen and Marco Baroni
|
BagPack: A general framework to represent semantic relations
|
Long paper presented at GEMS - Geometric Models of Natural Language
Semantics, workshop held in conjunction with the 12th Conference of the
European Chapter of the Association for Computational Linguistics (EACL-09),
Athens, Greece
| null | null | null |
cs.CL cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a way to represent word pairs instantiating arbitrary semantic
relations that keeps track of the contexts in which the words in the pair occur
both together and independently. The resulting features are of sufficient
generality to allow us, with the help of a standard supervised machine learning
algorithm, to tackle a variety of unrelated semantic tasks with good results
and almost no task-specific tailoring.
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2009 23:02:06 GMT"
}
] | 2009-02-16T00:00:00 |
[
[
"Herdağdelen",
"Amaç",
""
],
[
"Baroni",
"Marco",
""
]
] |
new_dataset
| 0.995381 |
0902.2370
|
Gerhard Kramer
|
Gerhard Kramer, Yingbin Liang, Shlomo Shamai (Shitz)
|
Outer Bounds on the Admissible Source Region for Broadcast Channels with
Dependent Sources
|
4 pages, presented at the Information Theory and Applications
Workshop, UCSD, San Diego, Feb. 8-13, 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Outer bounds on the admissible source region for broadcast channels with
dependent sources are developed and used to prove capacity results for several
classes of sources and channels.
|
[
{
"version": "v1",
"created": "Fri, 13 Feb 2009 18:40:13 GMT"
}
] | 2009-02-16T00:00:00 |
[
[
"Kramer",
"Gerhard",
"",
"Shitz"
],
[
"Liang",
"Yingbin",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] |
new_dataset
| 0.978116 |
0902.2187
|
Joao Lima
|
Joao Paulo Lima, Veronica Teichrieb, Judith Kelner
|
A Standalone Markerless 3D Tracker for Handheld Augmented Reality
| null | null | null | null |
cs.CV cs.GR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an implementation of a markerless tracking technique
targeted to the Windows Mobile Pocket PC platform. The primary aim of this work
is to allow the development of standalone augmented reality applications for
handheld devices based on natural feature tracking. In order to achieve this
goal, a subset of two computer vision libraries was ported to the Pocket PC
platform. They were also adapted to use fixed point math, with the purpose of
improving the overall performance of the routines. The port of these libraries
opens up the possibility of having other computer vision tasks being executed
on mobile platforms. A model based tracking approach that relies on edge
information was adopted. Since it does not require a high processing power, it
is suitable for constrained devices such as handhelds. The OpenGL ES graphics
library was used to perform computer vision tasks, taking advantage of existing
graphics hardware acceleration. An augmented reality application was created
using the implemented technique and evaluations were done regarding tracking
performance and accuracy
|
[
{
"version": "v1",
"created": "Thu, 12 Feb 2009 18:25:13 GMT"
}
] | 2009-02-13T00:00:00 |
[
[
"Lima",
"Joao Paulo",
""
],
[
"Teichrieb",
"Veronica",
""
],
[
"Kelner",
"Judith",
""
]
] |
new_dataset
| 0.996527 |
0902.1868
|
Publications Loria
|
Fabian Kuhn (CSAIL)
|
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule
in Constant Time
| null |
26th International Symposium on Theoretical Aspects of Computer
Science STACS 2009 (2009) 613-624
| null | null |
cs.DM cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The described multicoloring problem has direct applications in the context of
wireless ad hoc and sensor networks. In order to coordinate the access to the
shared wireless medium, the nodes of such a network need to employ some medium
access control (MAC) protocol. Typical MAC protocols control the access to the
shared channel by time (TDMA), frequency (FDMA), or code division multiple
access (CDMA) schemes. Many channel access schemes assign a fixed set of time
slots, frequencies, or (orthogonal) codes to the nodes of a network such that
nodes that interfere with each other receive disjoint sets of time slots,
frequencies, or code sets. Finding a valid assignment of time slots,
frequencies, or codes hence directly corresponds to computing a multicoloring
of a graph $G$. The scarcity of bandwidth, energy, and computing resources in
ad hoc and sensor networks, as well as the often highly dynamic nature of these
networks require that the multicoloring can be computed based on as little and
as local information as possible.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2009 12:42:21 GMT"
}
] | 2009-02-12T00:00:00 |
[
[
"Kuhn",
"Fabian",
"",
"CSAIL"
]
] |
new_dataset
| 0.999175 |
0902.1891
|
Nitin Vats
|
Nitin Vats
|
NNRU, a noncommutative analogue of NTRU
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
NTRU public key cryptosystem is well studied lattice-based Cryptosystem along
with Ajtai-Dwork and GGH systems. Underlying
NTRU is a hard mathematical problem of finding short vectors in a certain
lattice. (Shamir 1997) presented a lattice-based attack by which he could find
the original secret key or alternate key. Shamir concluded if one designs a
variant of NTRU where the calculations involved during encryption and
decryption are non-commutative then the system will be secure against Lattice
based attack.This paper presents a new cryptosystem with above property and we
have proved that it is completely secure against Lattice based attack. It
operates in the non-commutative ring M=M_k Z[X]/(X^n - I_{k*k}, where M is a
matrix ring of k*k matrices of polynomials in R={Z}[X]/(X^n-1). Moreover We
have got speed improvement by a factor of O(k^{1.624) over NTRU for the same
bit of information.
|
[
{
"version": "v1",
"created": "Wed, 11 Feb 2009 13:48:04 GMT"
}
] | 2009-02-12T00:00:00 |
[
[
"Vats",
"Nitin",
""
]
] |
new_dataset
| 0.997698 |
0902.1220
|
Lalitha Sankar
|
Lalitha Sankar, Yingbin Liang, Narayan Mandayam, H. Vincent Poor
|
Opportunistic Communications in Fading Multiaccess Relay Channels
|
Submitted to the IEEE Trans. on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of optimal resource allocation is studied for ergodic fading
orthogonal multiaccess relay channels (MARCs) in which the users (sources)
communicate with a destination with the aid of a half-duplex relay that
transmits on a channel orthogonal to that used by the transmitting sources.
Under the assumption that the instantaneous fading state information is
available at all nodes, the maximum sum-rate and the optimal user and relay
power allocations (policies) are developed for a decode-and-forward (DF) relay.
With the observation that a DF relay results in two multiaccess channels, one
at the relay and the other at the destination, a single known lemma on the
sum-rate of two intersecting polymatroids is used to determine the DF sum-rate
and the optimal user and relay policies. The lemma also enables a broad
topological classification of fading MARCs into one of three types. The first
type is the set of partially clustered MARCs where a user is clustered either
with the relay or with the destination such that the users waterfill on their
bottle-neck links to the distant receiver. The second type is the set of
clustered MARCs where all users are either proximal to the relay or to the
destination such that opportunistic multiuser scheduling to one of the
receivers is optimal. The third type consists of arbitrarily clustered MARCs
which are a combination of the first two types, and for this type it is shown
that the optimal policies are opportunistic non-waterfilling solutions. The
analysis is extended to develop the rate region of a K-user orthogonal
half-duplex MARC. Finally, cutset outer bounds are used to show that DF
achieves the capacity region for a class of clustered orthogonal half-duplex
MARCs.
|
[
{
"version": "v1",
"created": "Sat, 7 Feb 2009 04:37:04 GMT"
}
] | 2009-02-10T00:00:00 |
[
[
"Sankar",
"Lalitha",
""
],
[
"Liang",
"Yingbin",
""
],
[
"Mandayam",
"Narayan",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.956517 |
0902.1253
|
Wadie Guizani
|
Laurent Boyer, Guillaume Theyssier (LM-Savoie)
|
On Local Symmetries And Universality In Cellular Autmata
| null |
26th International Symposium on Theoretical Aspects of Computer
Science STACS 2009 (2009) 195-206
| null | null |
cs.DM math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cellular automata (CA) are dynamical systems defined by a finite local rule
but they are studied for their global dynamics. They can exhibit a wide range
of complex behaviours and a celebrated result is the existence of
(intrinsically) universal CA, that is CA able to fully simulate any other CA.
In this paper, we show that the asymptotic density of universal cellular
automata is 1 in several families of CA defined by local symmetries. We extend
results previously established for captive cellular automata in two significant
ways. First, our results apply to well-known families of CA (e.g. the family of
outer-totalistic CA containing the Game of Life) and, second, we obtain such
density results with both increasing number of states and increasing
neighbourhood. Moreover, thanks to universality-preserving encodings, we show
that the universality problem remains undecidable in some of those families.
|
[
{
"version": "v1",
"created": "Sat, 7 Feb 2009 17:54:02 GMT"
}
] | 2009-02-10T00:00:00 |
[
[
"Boyer",
"Laurent",
"",
"LM-Savoie"
],
[
"Theyssier",
"Guillaume",
"",
"LM-Savoie"
]
] |
new_dataset
| 0.998143 |
0902.1351
|
Cristina Fernandez-Cordoba
|
C. Fern\'andez-C\'ordoba and K. T. Phelps
|
On the minimum distance graph of an extended Preparata code
| null | null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The minimum distance graph of an extended Preparata code P(m) has vertices
corresponding to codewords and edges corresponding to pairs of codewords that
are distance 6 apart. The clique structure of this graph is investigated and it
is established that the minimum distance graphs of two extended Preparata codes
are isomorphic if and only if the codes are equivalent.
|
[
{
"version": "v1",
"created": "Mon, 9 Feb 2009 01:03:29 GMT"
}
] | 2009-02-10T00:00:00 |
[
[
"Fernández-Córdoba",
"C.",
""
],
[
"Phelps",
"K. T.",
""
]
] |
new_dataset
| 0.992589 |
0902.1364
|
Sadagopan Narasimhan
|
N.S.Narayanaswamy, N.Sadagopan and Apoorve Dubey
|
A Note on Contractible Edges in Chordal Graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Contraction of an edge merges its end points into a new vertex which is
adjacent to each neighbor of the end points of the edge. An edge in a
$k$-connected graph is {\em contractible} if its contraction does not result in
a graph of lower connectivity. We characterize contractible edges in chordal
graphs using properties of tree decompositions with respect to minimal vertex
separators.
|
[
{
"version": "v1",
"created": "Mon, 9 Feb 2009 05:07:07 GMT"
}
] | 2009-02-10T00:00:00 |
[
[
"Narayanaswamy",
"N. S.",
""
],
[
"Sadagopan",
"N.",
""
],
[
"Dubey",
"Apoorve",
""
]
] |
new_dataset
| 0.989869 |
0901.0168
|
Harshan Jagadeesh
|
J. Harshan, B. Sundar Rajan
|
Coding for Two-User SISO and MIMO Multiple Access Channels
|
18 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Constellation Constrained (CC) capacity regions of a two-user SISO Gaussian
Multiple Access Channel (GMAC) with finite complex input alphabets and
continuous output are computed in this paper. When both the users employ the
same code alphabet, it is well known that an appropriate rotation between the
alphabets provides unique decodability to the receiver. For such a set-up, a
metric is proposed to compute the angle(s) of rotation between the alphabets
such that the CC capacity region is maximally enlarged. Subsequently, code
pairs based on Trellis Coded Modulation (TCM) are designed for the two-user
GMAC with $M$-PSK and $M$-PAM alphabet pairs for arbitrary values of $M$ and it
is proved that, for certain angles of rotation, Ungerboeck labelling on the
trellis of each user maximizes the guaranteed squared Euclidean distance of the
\textit{sum trellis}. Hence, such a labelling scheme can be used systematically
to construct trellis code pairs for a two-user GMAC to achieve sum rates close
to the sum capacity of the channel. More importantly, it is shown for the first
time that ML decoding complexity at the destination is significantly reduced
when $M$-PAM alphabet pairs are employed with \textit{almost} no loss in the
sum capacity. \indent A two-user Multiple Input Multiple Output (MIMO) fading
MAC with $N_{t}$ antennas at both the users and a single antenna at the
destination has also been considered with the assumption that the destination
has the perfect knowledge of channel state information and the two users have
the perfect knowledge of only the phase components of their channels. For such
a set-up, two distinct classes of Space Time Block Code (STBC) pairs derived
from the well known class of real orthogonal designs are proposed such that the
STBC pairs are information lossless and have low ML decoding complexity.
|
[
{
"version": "v1",
"created": "Thu, 1 Jan 2009 18:05:39 GMT"
},
{
"version": "v2",
"created": "Tue, 6 Jan 2009 06:52:00 GMT"
},
{
"version": "v3",
"created": "Mon, 9 Feb 2009 16:11:13 GMT"
}
] | 2009-02-09T00:00:00 |
[
[
"Harshan",
"J.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.993418 |
0902.1047
|
Wadie Guizani
|
Nicolas Bousquet (ENS Cachan), Jean Daligault (LIRMM), Stephan
Thomasse (LIRMM), Anders Yeo
|
A Polynomial Kernel For Multicut In Trees
| null |
26th International Symposium on Theoretical Aspects of Computer
Science STACS 2009 (2009) 183-194
| null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The MULTICUT IN TREES problem consists in deciding, given a tree, a set of
requests (i.e. paths in the tree) and an integer k, whether there exists a set
of k edges cutting all the requests. This problem was shown to be FPT by Guo
and Niedermeyer. They also provided an exponential kernel. They asked whether
this problem has a polynomial kernel. This question was also raised by Fellows.
We show that MULTICUT IN TREES has a polynomial kernel.
|
[
{
"version": "v1",
"created": "Fri, 6 Feb 2009 10:11:09 GMT"
}
] | 2009-02-09T00:00:00 |
[
[
"Bousquet",
"Nicolas",
"",
"ENS Cachan"
],
[
"Daligault",
"Jean",
"",
"LIRMM"
],
[
"Thomasse",
"Stephan",
"",
"LIRMM"
],
[
"Yeo",
"Anders",
""
]
] |
new_dataset
| 0.955318 |
0902.0514
|
Ross Duncan
|
Lucas Dixon and Ross Duncan
|
Graphical Reasoning in Compact Closed Categories for Quantum Computation
|
21 pages, 9 figures. This is the journal version of the paper
published at AISC
| null | null | null |
cs.SC cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Compact closed categories provide a foundational formalism for a variety of
important domains, including quantum computation. These categories have a
natural visualisation as a form of graphs. We present a formalism for
equational reasoning about such graphs and develop this into a generic proof
system with a fixed logical kernel for equational reasoning about compact
closed categories. Automating this reasoning process is motivated by the slow
and error prone nature of manual graph manipulation. A salient feature of our
system is that it provides a formal and declarative account of derived results
that can include `ellipses'-style notation. We illustrate the framework by
instantiating it for a graphical language of quantum computation and show how
this can be used to perform symbolic computation.
|
[
{
"version": "v1",
"created": "Tue, 3 Feb 2009 14:21:01 GMT"
}
] | 2009-02-04T00:00:00 |
[
[
"Dixon",
"Lucas",
""
],
[
"Duncan",
"Ross",
""
]
] |
new_dataset
| 0.996646 |
0902.0322
|
Gregoire Jacob M.
|
Gregoire Jacob, Herve Debar and Eric Filiol
|
Malware Detection using Attribute-Automata to parse Abstract Behavioral
Descriptions
| null | null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most behavioral detectors of malware remain specific to a given language and
platform, mostly PE executables for Windows. The objective of this paper is to
define a generic approach for behavioral detection based on two layers
respectively responsible for abstraction and detection. The first abstraction
layer remains specific to a platform and a language. This first layer
interprets the collected instructions, API calls and arguments and classifies
these operations as well as the involved objects according to their purpose in
the malware lifecycle. The second detection layer remains generic and is
totally interoperable between the different abstraction components. This layer
relies on parallel automata parsing attribute-grammars where semantic rules are
used for object typing (object classification) and object binding (data-flow).
To feed detection and to experiment with our approach we have developed two
different abstraction components: one processing system call traces from native
code and one processing the VBScript interpreted language. The different
experimentations have provided promising detection rates, in particular for
script files (89%), with almost none false positives. In the case of process
traces, the detection rate remains significant (51%) but could be increased by
more sophisticated collection tools.
|
[
{
"version": "v1",
"created": "Mon, 2 Feb 2009 17:36:48 GMT"
}
] | 2009-02-03T00:00:00 |
[
[
"Jacob",
"Gregoire",
""
],
[
"Debar",
"Herve",
""
],
[
"Filiol",
"Eric",
""
]
] |
new_dataset
| 0.998837 |
0902.0337
|
Kaibin Huang
|
Kaibin Huang and Vincent K. N. Lau
|
Stability and Delay of Zero-Forcing SDMA with Limited Feedback
|
26 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper addresses the stability and queueing delay of Space Division
Multiple Access (SDMA) systems with bursty traffic, where zero-forcing
beamforming enables simultaneous transmission to multiple mobiles. Computing
beamforming vectors relies on quantized channel state information (CSI)
feedback (limited feedback) from mobiles. Define the stability region for SDMA
as the set of multiuser packet-arrival rates for which the steady-state queue
lengths are finite. Given perfect CSI feedback and equal power allocation over
scheduled queues, the stability region is proved to be a convex polytope having
the derived vertices. For any set of arrival rates in the stability region,
multiuser queues are shown to be stabilized by a joint queue-and-beamforming
control policy that maximizes the departure-rate-weighted sum of queue lengths.
The stability region for limited feedback is found to be the perfect-CSI region
multiplied by one minus a small factor. The required number of feedback bits
per mobile is proved to scale logarithmically with the inverse of the above
factor as well as linearly with the number of transmit antennas minus one. The
effects of limited feedback on queueing delay are also quantified. For Poisson
arrival processes, CSI quantization errors are shown to multiply average
queueing delay by a factor larger than one. This factor can be controlled by
adjusting the number of feedback bits per mobile following the derived
relationship. For general arrival processes, CSI errors are found to increase
Kingman's bound on the tail probability of the instantaneous delay by one plus
a small factor. The required number of feedback bits per mobile is shown to
scale logarithmically with this factor.
|
[
{
"version": "v1",
"created": "Mon, 2 Feb 2009 19:05:59 GMT"
}
] | 2009-02-03T00:00:00 |
[
[
"Huang",
"Kaibin",
""
],
[
"Lau",
"Vincent K. N.",
""
]
] |
new_dataset
| 0.977192 |
0901.4876
|
Robert Brijder
|
Hendrik Blockeel, Robert Brijder
|
Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint
Subgraphs
|
12 pages, 1 figure
| null | null | null |
cs.LG cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Grammar inference deals with determining (preferable simple) models/grammars
consistent with a set of observations. There is a large body of research on
grammar inference within the theory of formal languages. However, there is
surprisingly little known on grammar inference for graph grammars. In this
paper we take a further step in this direction and work within the framework of
node label controlled (NLC) graph grammars. Specifically, we characterize,
given a set of disjoint and isomorphic subgraphs of a graph $G$, whether or not
there is a NLC graph grammar rule which can generate these subgraphs to obtain
$G$. This generalizes previous results by assuming that the set of isomorphic
subgraphs is disjoint instead of non-touching. This leads naturally to consider
the more involved ``non-confluent'' graph grammar rules.
|
[
{
"version": "v1",
"created": "Fri, 30 Jan 2009 12:44:29 GMT"
}
] | 2009-02-02T00:00:00 |
[
[
"Blockeel",
"Hendrik",
""
],
[
"Brijder",
"Robert",
""
]
] |
new_dataset
| 0.967736 |
cs/0610108
|
Mohand Lagha
|
Mohand Lagha (AERONAUTIC Department of Blida University, Femto-ST),
Messaoud Bensebti (AERONAUTIC Department of Blida University)
|
Doppler Spectrum Estimation by Ramanujan Fourier Transforms
| null | null | null | null |
cs.NA cs.CE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Doppler spectrum estimation of a weather radar signal in a classic way
can be made by two methods, temporal one based in the autocorrelation of the
successful signals, whereas the other one uses the estimation of the power
spectral density PSD by using Fourier transforms. We introduces a new tool of
signal processing based on Ramanujan sums cq(n), adapted to the analysis of
arithmetical sequences with several resonances p/q. These sums are almost
periodic according to time n of resonances and aperiodic according to the order
q of resonances. New results will be supplied by the use of Ramanujan Fourier
Transform (RFT) for the estimation of the Doppler spectrum for the weather
radar signal.
|
[
{
"version": "v1",
"created": "Wed, 18 Oct 2006 14:43:45 GMT"
},
{
"version": "v2",
"created": "Sun, 1 Feb 2009 19:24:25 GMT"
}
] | 2009-02-01T00:00:00 |
[
[
"Lagha",
"Mohand",
"",
"AERONAUTIC Department of Blida University, Femto-ST"
],
[
"Bensebti",
"Messaoud",
"",
"AERONAUTIC Department of Blida University"
]
] |
new_dataset
| 0.999195 |
0901.4646
|
Muhammad Mubashir Khan
|
Muhammad Mubashir Khan, Salahuddin Hyder, Mahmood K Pathan, Kashif H
Sheikh
|
A Quantum Key Distribution Network Through Single Mode Optical Fiber
|
This paper has been submitted to the 2006 International Symposium on
Collaborative Technologies and Systems (CTS 2006)May 14-17, 2006, Las Vegas,
Nevada, USA
|
Khan, M.M., et al., A Quantum Key Distribution Network through
Single Mode Optical Fiber. Proceedings of the International Symposium on
Collaborative Technologies and Systems, 2006: p. 386-391
|
10.1109/CTS.2006.10
| null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Quantum key distribution (QKD) has been developed within the last decade that
is provably secure against arbitrary computing power, and even against quantum
computer attacks. Now there is a strong need of research to exploit this
technology in the existing communication networks. In this paper we have
presented various experimental results pertaining to QKD like Raw key rate and
Quantum bit error rate (QBER). We found these results over 25 km single mode
optical fiber. The experimental setup implemented the enhanced version of BB84
QKD protocol. Based upon the results obtained, we have presented a network
design which can be implemented for the realization of large scale QKD
networks. Furthermore, several new ideas are presented and discussed to
integrate the QKD technique in the classical communication networks.
|
[
{
"version": "v1",
"created": "Thu, 29 Jan 2009 10:48:28 GMT"
}
] | 2009-01-30T00:00:00 |
[
[
"Khan",
"Muhammad Mubashir",
""
],
[
"Hyder",
"Salahuddin",
""
],
[
"Pathan",
"Mahmood K",
""
],
[
"Sheikh",
"Kashif H",
""
]
] |
new_dataset
| 0.965953 |
0901.4664
|
Inge Bethke
|
Jan A. Bergstra and I. Bethke
|
Square root meadows
|
9 pages
| null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let Q_0 denote the rational numbers expanded to a meadow by totalizing
inversion such that 0^{-1}=0. Q_0 can be expanded by a total sign function s
that extracts the sign of a rational number. In this paper we discuss an
extension Q_0(s ,\sqrt) of the signed rationals in which every number has a
unique square root.
|
[
{
"version": "v1",
"created": "Thu, 29 Jan 2009 12:42:46 GMT"
}
] | 2009-01-30T00:00:00 |
[
[
"Bergstra",
"Jan A.",
""
],
[
"Bethke",
"I.",
""
]
] |
new_dataset
| 0.996073 |
0901.4728
|
Krishnendu Chatterjee
|
Dietmar Berwanger and Krishnendu Chatterjee and Martin De Wulf and
Laurent Doyen and Thomas A. Henzinger
|
Alpaga: A Tool for Solving Parity Games with Imperfect Information
|
11 pages, a shorter version to appear in TACAS 2009
| null | null | null |
cs.GT cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Alpaga is a solver for two-player parity games with imperfect information.
Given the description of a game, it determines whether the first player can
ensure to win and, if so, it constructs a winning strategy. The tool provides a
symbolic implementation of a recent algorithm based on antichains.
|
[
{
"version": "v1",
"created": "Thu, 29 Jan 2009 17:34:36 GMT"
}
] | 2009-01-30T00:00:00 |
[
[
"Berwanger",
"Dietmar",
""
],
[
"Chatterjee",
"Krishnendu",
""
],
[
"De Wulf",
"Martin",
""
],
[
"Doyen",
"Laurent",
""
],
[
"Henzinger",
"Thomas A.",
""
]
] |
new_dataset
| 0.983817 |
0901.4754
|
Robert Frank Carslaw Walters
|
L. de Francesco Albasini, N. Sabadini, R.F.C. Walters
|
An algebra of automata which includes both classical and quantum
entities
| null | null | null | null |
cs.LO math.CT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an algebra for composing automata which includes both classical
and quantum entities and their communications. We illustrate by describing in
detail a quantum protocol.
|
[
{
"version": "v1",
"created": "Thu, 29 Jan 2009 19:28:13 GMT"
}
] | 2009-01-30T00:00:00 |
[
[
"Albasini",
"L. de Francesco",
""
],
[
"Sabadini",
"N.",
""
],
[
"Walters",
"R. F. C.",
""
]
] |
new_dataset
| 0.999533 |
0804.2191
|
Novella Bartolini
|
N. Bartolini, T. Calamoneri, E. G. Fusco, A. Massini, S. Silvestri
|
Push & Pull: autonomous deployment of mobile sensors for a complete
coverage
|
Technical Report. This paper has been published on Wireless Networks,
Springer. Animations and the complete code of the proposed algorithm are
available for download at the address:
http://www.dsi.uniroma1.it/~novella/mobile_sensors/
| null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mobile sensor networks are important for several strategic applications
devoted to monitoring critical areas. In such hostile scenarios, sensors cannot
be deployed manually and are either sent from a safe location or dropped from
an aircraft. Mobile devices permit a dynamic deployment reconfiguration that
improves the coverage in terms of completeness and uniformity.
In this paper we propose a distributed algorithm for the autonomous
deployment of mobile sensors called Push&Pull. According to our proposal,
movement decisions are made by each sensor on the basis of locally available
information and do not require any prior knowledge of the operating conditions
or any manual tuning of key parameters.
We formally prove that, when a sufficient number of sensors are available,
our approach guarantees a complete and uniform coverage. Furthermore, we
demonstrate that the algorithm execution always terminates preventing movement
oscillations.
Numerous simulations show that our algorithm reaches a complete coverage
within reasonable time with moderate energy consumption, even when the target
area has irregular shapes. Performance comparisons between Push&Pull and one of
the most acknowledged algorithms show how the former one can efficiently reach
a more uniform and complete coverage under a wide range of working scenarios.
|
[
{
"version": "v1",
"created": "Mon, 14 Apr 2008 14:38:52 GMT"
},
{
"version": "v2",
"created": "Thu, 26 Jun 2008 15:23:54 GMT"
},
{
"version": "v3",
"created": "Tue, 29 Jul 2008 13:43:10 GMT"
},
{
"version": "v4",
"created": "Thu, 29 Jan 2009 14:58:50 GMT"
}
] | 2009-01-29T00:00:00 |
[
[
"Bartolini",
"N.",
""
],
[
"Calamoneri",
"T.",
""
],
[
"Fusco",
"E. G.",
""
],
[
"Massini",
"A.",
""
],
[
"Silvestri",
"S.",
""
]
] |
new_dataset
| 0.998636 |
0803.1030
|
David Soloveichik
|
David Soloveichik
|
Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping
|
Tightened up section 5
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The behavior of some stochastic chemical reaction networks is largely
unaffected by slight inaccuracies in reaction rates. We formalize the
robustness of state probabilities to reaction rate deviations, and describe a
formal connection between robustness and efficiency of simulation. Without
robustness guarantees, stochastic simulation seems to require computational
time proportional to the total number of reaction events. Even if the
concentration (molecular count per volume) stays bounded, the number of
reaction events can be linear in the duration of simulated time and total
molecular count. We show that the behavior of robust systems can be predicted
such that the computational work scales linearly with the duration of simulated
time and concentration, and only polylogarithmically in the total molecular
count. Thus our asymptotic analysis captures the dramatic speedup when
molecular counts are large, and shows that for bounded concentrations the
computation time is essentially invariant with molecular count. Finally, by
noticing that even robust stochastic chemical reaction networks are capable of
embedding complex computational problems, we argue that the linear dependence
on simulated time and concentration is likely optimal.
|
[
{
"version": "v1",
"created": "Fri, 7 Mar 2008 17:36:54 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Nov 2008 02:10:39 GMT"
},
{
"version": "v3",
"created": "Wed, 28 Jan 2009 09:58:41 GMT"
}
] | 2009-01-28T00:00:00 |
[
[
"Soloveichik",
"David",
""
]
] |
new_dataset
| 0.972878 |
0901.3902
|
Sylvain Marchand
|
Fabien Gallot, Owen Lagadec, Myriam Desainte-Catherine (LaBRI),
Sylvain Marchand (LaBRI)
|
iKlax: a New Musical Audio Format for Active Listening
| null |
International Computer Music Conference (ICMC), Belfast : Irlande
(2008)
| null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we are presenting a new model for interactive music. Unlike
most interactive systems, our model is based on file organization, but does not
require digital audio treatments. This model includes a definition of a
constraints system and its solver. The products of this project are intended
for the general public, inexperienced users, as well as professional musicians,
and will be distributed commercially. We are here presenting three products of
this project. The difficulty of this project is to design a technology and
software products for interactive music which must be easy to use by the
general public and by professional composers.
|
[
{
"version": "v1",
"created": "Sun, 25 Jan 2009 14:57:55 GMT"
}
] | 2009-01-27T00:00:00 |
[
[
"Gallot",
"Fabien",
"",
"LaBRI"
],
[
"Lagadec",
"Owen",
"",
"LaBRI"
],
[
"Desainte-Catherine",
"Myriam",
"",
"LaBRI"
],
[
"Marchand",
"Sylvain",
"",
"LaBRI"
]
] |
new_dataset
| 0.984996 |
0901.3924
|
David Eppstein
|
David Eppstein, Elena Mumford, Bettina Speckmann, and Kevin Verbeek
|
Area-Universal Rectangular Layouts
|
19 pages, 16 figures
| null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A rectangular layout is a partition of a rectangle into a finite set of
interior-disjoint rectangles. Rectangular layouts appear in various
applications: as rectangular cartograms in cartography, as floorplans in
building architecture and VLSI design, and as graph drawings. Often areas are
associated with the rectangles of a rectangular layout and it might hence be
desirable if one rectangular layout can represent several area assignments. A
layout is area-universal if any assignment of areas to rectangles can be
realized by a combinatorially equivalent rectangular layout. We identify a
simple necessary and sufficient condition for a rectangular layout to be
area-universal: a rectangular layout is area-universal if and only if it is
one-sided. More generally, given any rectangular layout L and any assignment of
areas to its regions, we show that there can be at most one layout (up to
horizontal and vertical scaling) which is combinatorially equivalent to L and
achieves a given area assignment. We also investigate similar questions for
perimeter assignments. The adjacency requirements for the rectangles of a
rectangular layout can be specified in various ways, most commonly via the dual
graph of the layout. We show how to find an area-universal layout for a given
set of adjacency requirements whenever such a layout exists.
|
[
{
"version": "v1",
"created": "Sun, 25 Jan 2009 22:07:47 GMT"
}
] | 2009-01-27T00:00:00 |
[
[
"Eppstein",
"David",
""
],
[
"Mumford",
"Elena",
""
],
[
"Speckmann",
"Bettina",
""
],
[
"Verbeek",
"Kevin",
""
]
] |
new_dataset
| 0.998795 |
0812.3563
|
Laurent Romary
|
Laurent Romary (LORIA)
|
Questions & Answers for TEI Newcomers
| null |
Jahrbuch f\"ur Computerphilologie 10 (2009)
| null | null |
cs.DL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper provides an introduction to the Text Encoding Initia-tive (TEI),
focused at bringing in newcomers who have to deal with a digital document
project and are looking at the capacity that the TEI environment may have to
fulfil his needs. To this end, we avoid a strictly technical presentation of
the TEI and concentrate on the actual issues that such projects face, with
parallel made on the situation within two institutions. While a quick
walkthrough the TEI technical framework is provided, the papers ends up by
showing the essential role of the community in the actual technical
contributions that are being brought to the TEI.
|
[
{
"version": "v1",
"created": "Thu, 18 Dec 2008 15:51:17 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Jan 2009 09:51:37 GMT"
}
] | 2009-01-26T00:00:00 |
[
[
"Romary",
"Laurent",
"",
"LORIA"
]
] |
new_dataset
| 0.986578 |
0901.0536
|
Eren Sasoglu
|
Satish Babu Korada, Eren Sasoglu, Rudiger Urbanke
|
Polar Codes: Characterization of Exponent, Bounds, and Constructions
|
Submitted to IEEE Transactions on Information Theory, minor updates
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Polar codes were recently introduced by Ar\i kan. They achieve the capacity
of arbitrary symmetric binary-input discrete memoryless channels under a low
complexity successive cancellation decoding strategy. The original polar code
construction is closely related to the recursive construction of Reed-Muller
codes and is based on the $2 \times 2$ matrix $\bigl[ 1 &0 1& 1 \bigr]$. It was
shown by Ar\i kan and Telatar that this construction achieves an error exponent
of $\frac12$, i.e., that for sufficiently large blocklengths the error
probability decays exponentially in the square root of the length. It was
already mentioned by Ar\i kan that in principle larger matrices can be used to
construct polar codes. A fundamental question then is to see whether there
exist matrices with exponent exceeding $\frac12$. We first show that any $\ell
\times \ell$ matrix none of whose column permutations is upper triangular
polarizes symmetric channels. We then characterize the exponent of a given
square matrix and derive upper and lower bounds on achievable exponents. Using
these bounds we show that there are no matrices of size less than 15 with
exponents exceeding $\frac12$. Further, we give a general construction based on
BCH codes which for large $n$ achieves exponents arbitrarily close to 1 and
which exceeds $\frac12$ for size 16.
|
[
{
"version": "v1",
"created": "Mon, 5 Jan 2009 19:39:05 GMT"
},
{
"version": "v2",
"created": "Mon, 26 Jan 2009 18:17:45 GMT"
}
] | 2009-01-26T00:00:00 |
[
[
"Korada",
"Satish Babu",
""
],
[
"Sasoglu",
"Eren",
""
],
[
"Urbanke",
"Rudiger",
""
]
] |
new_dataset
| 0.99898 |
0901.3769
|
Sebastien Verel
|
William Beaudoin (I3S), S\'ebastien Verel (I3S), Philippe Collard
(I3S), Cathy Escazut (I3S)
|
Deceptiveness and Neutrality - the ND family of fitness landscapes
|
Genetic And Evolutionary Computation Conference, Seatle :
\'Etats-Unis d'Am\'erique (2006)
| null |
10.1145/1143997.1144091
| null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
When a considerable number of mutations have no effects on fitness values,
the fitness landscape is said neutral. In order to study the interplay between
neutrality, which exists in many real-world applications, and performances of
metaheuristics, it is useful to design landscapes which make it possible to
tune precisely neutral degree distribution. Even though many neutral landscape
models have already been designed, none of them are general enough to create
landscapes with specific neutral degree distributions. We propose three steps
to design such landscapes: first using an algorithm we construct a landscape
whose distribution roughly fits the target one, then we use a simulated
annealing heuristic to bring closer the two distributions and finally we affect
fitness values to each neutral network. Then using this new family of fitness
landscapes we are able to highlight the interplay between deceptiveness and
neutrality.
|
[
{
"version": "v1",
"created": "Fri, 23 Jan 2009 20:15:22 GMT"
}
] | 2009-01-26T00:00:00 |
[
[
"Beaudoin",
"William",
"",
"I3S"
],
[
"Verel",
"Sébastien",
"",
"I3S"
],
[
"Collard",
"Philippe",
"",
"I3S"
],
[
"Escazut",
"Cathy",
"",
"I3S"
]
] |
new_dataset
| 0.962732 |
0710.0105
|
Dmitrii Manin
|
Dmitrii Manin
|
Zipf's Law and Avoidance of Excessive Synonymy
|
47 pages; fixed reference list missing in v.1
|
Main text in Cognitive Science, 32 (7) 2008, pp. 1075 - 1098;
Appendix A TBP separately in J. Quant. Ling.
|
10.1080/03640210802020003
| null |
cs.CL physics.soc-ph
| null |
Zipf's law states that if words of language are ranked in the order of
decreasing frequency in texts, the frequency of a word is inversely
proportional to its rank. It is very robust as an experimental observation, but
to date it escaped satisfactory theoretical explanation. We suggest that Zipf's
law may arise from the evolution of word semantics dominated by expansion of
meanings and competition of synonyms.
|
[
{
"version": "v1",
"created": "Sun, 30 Sep 2007 03:21:54 GMT"
},
{
"version": "v2",
"created": "Wed, 3 Oct 2007 03:36:45 GMT"
}
] | 2009-01-22T00:00:00 |
[
[
"Manin",
"Dmitrii",
""
]
] |
new_dataset
| 0.986281 |
0901.3189
|
James Lathrop
|
Steven M. Kautz, James I. Lathrop
|
Self-assembly of the discrete Sierpinski carpet and related fractals
| null | null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
It is well known that the discrete Sierpinski triangle can be defined as the
nonzero residues modulo 2 of Pascal's triangle, and that from this definition
one can easily construct a tileset with which the discrete Sierpinski triangle
self-assembles in Winfree's tile assembly model. In this paper we introduce an
infinite class of discrete self-similar fractals that are defined by the
residues modulo a prime p of the entries in a two-dimensional matrix obtained
from a simple recursive equation. We prove that every fractal in this class
self-assembles using a uniformly constructed tileset. As a special case we show
that the discrete Sierpinski carpet self-assembles using a set of 30 tiles.
|
[
{
"version": "v1",
"created": "Wed, 21 Jan 2009 04:58:13 GMT"
}
] | 2009-01-22T00:00:00 |
[
[
"Kautz",
"Steven M.",
""
],
[
"Lathrop",
"James I.",
""
]
] |
new_dataset
| 0.997988 |
0901.2751
|
Fahad Saeed
|
Fahad Saeed
|
Pyro-Align: Sample-Align based Multiple Alignment system for
Pyrosequencing Reads of Large Number
|
6 pages, 1 figure, Technical Report, Department of Biosystems Science
and Engineering, ETH Zurich Switzerland
| null | null |
DBSSE-08-2008
|
cs.DS cs.DC q-bio.GN q-bio.QM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Pyro-Align is a multiple alignment program specifically designed for
pyrosequencing reads of huge number. Multiple sequence alignment is shown to be
NP-hard and heuristics are designed for approximate solutions. Multiple
sequence alignment of pyrosequenceing reads is complex mainly because of 2
factors. One being the huge number of reads, making the use of traditional
heuristics,that scale very poorly for large number, unsuitable. The second
reason is that the alignment cannot be performed arbitrarily, because the
position of the reads with respect to the original genome is important and has
to be taken into account.In this report we present a short description of the
multiple alignment system for pyrosequencing reads.
|
[
{
"version": "v1",
"created": "Mon, 19 Jan 2009 00:26:18 GMT"
}
] | 2009-01-20T00:00:00 |
[
[
"Saeed",
"Fahad",
""
]
] |
new_dataset
| 0.977323 |
0901.2768
|
Ananthanarayanan Chockalingam
|
S. Barik, Saif K. Mohammed, A. Chockalingam, and B. Sundar Rajan
|
FRFD MIMO Systems: Precoded V-BLAST with Limited Feedback Versus
Non-orthogonal STBC MIMO
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Full-rate (FR) and full-diversity (FD) are attractive features in MIMO
systems. We refer to systems which achieve both FR and FD simultaneously as
FRFD systems. Non-orthogonal STBCs can achieve FRFD without feedback, but their
ML decoding complexities are high. V-BLAST without precoding achieves FR but
not FD. FRFD can be achieved in V-BLAST through precoding given full channel
state information at the transmitter (CSIT). However, with limited feedback
precoding, V-BLAST achieves FD, but with some rate loss. Our contribution in
this paper is two-fold: $i)$ we propose a limited feedback (LFB) precoding
scheme which achieves FRFD in $2\times 2$, $3\times 3$ and $4\times 4$ V-BLAST
systems (we refer to this scheme as FRFD-VBLAST-LFB scheme), and $ii)$
comparing the performances of the FRFD-VBLAST-LFB scheme and non-orthogonal
STBCs without feedback (e.g., Golden code, perfect codes) under ML decoding, we
show that in $2\times 2$ MIMO system with 4-QAM/16-QAM, FRFD-VBLAST-LFB scheme
outperforms the Golden code by about 0.6 dB; in $3\times 3$ and $4\times 4$
MIMO systems, the performance of FRFD-VBLAST-LFB scheme is comparable to the
performance of perfect codes. The FRFD-VBLAST-LFB scheme is attractive because
1) ML decoding becomes less complex compared to that of non-orthogonal STBCs,
2) the number of feedback bits required to achieve the above performance is
small, 3) in slow-fading, it is adequate to send feedback bits only
occasionally, and 4) in most practical wireless systems feedback channel is
often available (e.g., for adaptive modulation, rate/power control).
|
[
{
"version": "v1",
"created": "Mon, 19 Jan 2009 05:35:35 GMT"
}
] | 2009-01-20T00:00:00 |
[
[
"Barik",
"S.",
""
],
[
"Mohammed",
"Saif K.",
""
],
[
"Chockalingam",
"A.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.981184 |
0901.2270
|
Robert Morelos-Zaragoza
|
Robert Morelos-Zaragoza
|
A Plotkin-Alamouti Superposition Coding Scheme for Cooperative
Broadcasting in Wireless Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper deals with superposition coding for cooperative broadcasting in
the case of two coordinated source nodes, as introduced in the seminal work of
Bergmans and Cover in 1974. A scheme is introduced for two classes of
destination (or relay) nodes: Close nodes and far nodes, as ranked by their
spatial distances to the pair of transmitting nodes. Two linear codes are
combined using the (u,u+v)-construction devised by Plotkin to construct
two-level linear unequal error protection (LUEP) codes. However, instead of
binary addition of subcode codewords in the source encoder, here modulated
subcode sequences are combined at the destination (or relay) nodes antennae.
Bergmans and Cover referred to this as over-the-air mixing. In the case of
Rayleigh fading, additional diversity order as well as robustness to channel
estimation errors are obtained when source nodes transmit pairs of coded
sequences in accordance to Alamouti's transmit diversity scheme. We refer to
this combination as a Plotkin-Alamouti scheme and study its performance over
AWGN and Rayleigh fading channels with a properly partitioned QPSK
constellation.
|
[
{
"version": "v1",
"created": "Thu, 15 Jan 2009 14:17:34 GMT"
}
] | 2009-01-16T00:00:00 |
[
[
"Morelos-Zaragoza",
"Robert",
""
]
] |
new_dataset
| 0.999163 |
0901.1696
|
Julien Langou
|
Fred G. Gustavson, Jerzy Wasniewski, Jack J. Dongarra and Julien
Langou
|
Rectangular Full Packed Format for Cholesky's Algorithm: Factorization,
Solution and Inversion
| null | null | null | null |
cs.MS cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a new data format for storing triangular, symmetric, and
Hermitian matrices called RFPF (Rectangular Full Packed Format). The standard
two dimensional arrays of Fortran and C (also known as full format) that are
used to represent triangular and symmetric matrices waste nearly half of the
storage space but provide high performance via the use of Level 3 BLAS.
Standard packed format arrays fully utilize storage (array space) but provide
low performance as there is no Level 3 packed BLAS. We combine the good
features of packed and full storage using RFPF to obtain high performance via
using Level 3 BLAS as RFPF is a standard full format representation. Also, RFPF
requires exactly the same minimal storage as packed format. Each LAPACK full
and/or packed triangular, symmetric, and Hermitian routine becomes a single new
RFPF routine based on eight possible data layouts of RFPF. This new RFPF
routine usually consists of two calls to the corresponding LAPACK full format
routine and two calls to Level 3 BLAS routines. This means {\it no} new
software is required. As examples, we present LAPACK routines for Cholesky
factorization, Cholesky solution and Cholesky inverse computation in RFPF to
illustrate this new work and to describe its performance on several commonly
used computer platforms. Performance of LAPACK full routines using RFPF versus
LAPACK full routines using standard format for both serial and SMP parallel
processing is about the same while using half the storage. Performance gains
are roughly one to a factor of 43 for serial and one to a factor of 97 for SMP
parallel times faster using vendor LAPACK full routines with RFPF than with
using vendor and/or reference packed routines.
|
[
{
"version": "v1",
"created": "Tue, 13 Jan 2009 01:08:27 GMT"
}
] | 2009-01-14T00:00:00 |
[
[
"Gustavson",
"Fred G.",
""
],
[
"Wasniewski",
"Jerzy",
""
],
[
"Dongarra",
"Jack J.",
""
],
[
"Langou",
"Julien",
""
]
] |
new_dataset
| 0.999325 |
0901.1827
|
Carl Bracken
|
Carl Bracken, Tor Helleseth
|
Triple-Error-Correcting BCH-Like Codes
|
7 pages, submitted to ISIT 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The binary primitive triple-error-correcting BCH code is a cyclic code of
minimum distance 7 with generator polynomial having zeros $\alpha$, $\alpha^3$
and $\alpha^5$ where $\alpha$ is a primitive root of unity. The zero set of the
code is said to be {1,3,5}. In the 1970's Kasami showed that one can construct
similar triple-error-correcting codes using zero sets consisting of different
triples than the BCH codes. Furthermore, in 2000 Chang et. al. found new
triples leading to triple-error-correcting codes. In this paper a new such
triple is presented. In addition a new method is presented that may be of
interest in finding further such triples.
|
[
{
"version": "v1",
"created": "Tue, 13 Jan 2009 16:51:51 GMT"
}
] | 2009-01-14T00:00:00 |
[
[
"Bracken",
"Carl",
""
],
[
"Helleseth",
"Tor",
""
]
] |
new_dataset
| 0.99848 |
0807.3212
|
Axel Kohnert
|
Axel Kohnert, Sascha Kurz
|
Construction of Large Constant Dimension Codes With a Prescribed Minimum
Distance
|
13 pages, 1 figure, 1 table, submitted
|
Lecture Notes Computer Science Vol. 5393, 2008, p. 31 - 42
|
10.1007/978-3-540-89994-5_4
| null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we construct constant dimension space codes with prescribed
minimum distance. There is an increased interest in space codes since a paper
by Koetter and Kschischang were they gave an application in network coding.
There is also a connection to the theory of designs over finite fields. We will
modify a method of Braun, Kerber and Laue which they used for the construction
of designs over finite fields to do the construction of space codes. Using this
approach we found many new constant dimension spaces codes with a larger number
of codewords than previously known codes. We will finally give a table of the
best found constant dimension space codes.
|
[
{
"version": "v1",
"created": "Mon, 21 Jul 2008 06:59:59 GMT"
}
] | 2009-01-13T00:00:00 |
[
[
"Kohnert",
"Axel",
""
],
[
"Kurz",
"Sascha",
""
]
] |
new_dataset
| 0.999058 |
0901.1462
|
Jerome Jaffre
|
Guy Chavent (INRIA Rocquencourt, Ceremade)
|
A Fully Equivalent Global Pressure Formulation for Three-Phase
Compressible Flow
| null | null | null |
RR-6788
|
cs.NA math.AP physics.class-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce a new global pressure formulation for immiscible three-phase
compressible flows in porous media which is fully equivalent to the original
equations, unlike the one introduced in \cite{CJ86}. In this formulation, the
total volumetric flow of the three fluids and the global pressure follow a
classical Darcy law, which simplifies the resolution of the pressure equation.
However, this global pressure formulation exists only for Total Differential
(TD) three-phase data, which depend only on two functions of saturations and
global pressure: the global capillary pressure and the global mobility. Hence
we introduce a class of interpolation which constructs such TD-three-phase data
from any set of three two-phase data (for each pair of fluids) which satisfy a
TD-compatibility condition.
|
[
{
"version": "v1",
"created": "Sun, 11 Jan 2009 20:02:58 GMT"
}
] | 2009-01-13T00:00:00 |
[
[
"Chavent",
"Guy",
"",
"INRIA Rocquencourt, Ceremade"
]
] |
new_dataset
| 0.998437 |
0901.1162
|
Anand Kumar Narayanan
|
Ming-Deh Huang and Anand Kumar Narayanan
|
Folded Algebraic Geometric Codes From Galois Extensions
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a new class of list decodable codes based on Galois extensions of
function fields and present a list decoding algorithm. These codes are obtained
as a result of folding the set of rational places of a function field using
certain elements (automorphisms) from the Galois group of the extension. This
work is an extension of Folded Reed Solomon codes to the setting of Algebraic
Geometric codes. We describe two constructions based on this framework
depending on if the order of the automorphism used to fold the code is large or
small compared to the block length. When the automorphism is of large order,
the codes have polynomially bounded list size in the worst case. This
construction gives codes of rate $R$ over an alphabet of size independent of
block length that can correct a fraction of $1-R-\epsilon$ errors subject to
the existence of asymptotically good towers of function fields with large
automorphisms. The second construction addresses the case when the order of the
element used to fold is small compared to the block length. In this case a
heuristic analysis shows that for a random received word, the expected list
size and the running time of the decoding algorithm are bounded by a polynomial
in the block length. When applied to the Garcia-Stichtenoth tower, this yields
codes of rate $R$ over an alphabet of size
$(\frac{1}{\epsilon^2})^{O(\frac{1}{\epsilon})}$, that can correct a fraction
of $1-R-\epsilon$ errors.
|
[
{
"version": "v1",
"created": "Fri, 9 Jan 2009 02:46:04 GMT"
}
] | 2009-01-12T00:00:00 |
[
[
"Huang",
"Ming-Deh",
""
],
[
"Narayanan",
"Anand Kumar",
""
]
] |
new_dataset
| 0.965855 |
0901.1244
|
Eric Chen
|
Eric Z. Chen
|
Constructions of Quasi-Twisted Two-Weight Codes
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A code is said to be two-weight if the non-zero codewords have only two
different a weight w1 and w2. Two-weight codes are closely related to strongly
regular graphs. In this paper. It is shown that a consta-cyclic code of
composite length can be put in the quasi-twisted form. Based on this
transformation, a new construction method of quasi-twisted (QT) two-weight
codes is presented. A large amount of QT two-weight codes are found, and some
new codes are also constructed.
|
[
{
"version": "v1",
"created": "Fri, 9 Jan 2009 13:31:11 GMT"
}
] | 2009-01-12T00:00:00 |
[
[
"Chen",
"Eric Z.",
""
]
] |
new_dataset
| 0.996705 |
0712.0541
|
Eric Chen
|
Eric Z. Chen
|
New Construction of A Family of Quasi-Twisted Two-Weight Codes
|
4 pages, submitted to IEEE Trans. Information Theory
|
IEEE Trans. Inform. Theory, December 2008
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Based on cyclic and consta-cyclic simplex codes, a new explicit construction
of a family of two-weight codes is presented. These two-weight codes obtained
are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based
on this construction, new optimal binary quasi-cyclic [195, 8, 96], [210, 8,
104] and [240, 8, 120] codes, and good QC ternary [208, 6, 135] and [221, 6,
144] codes are thus obtained. It is also shown that many codes among the family
meet the Griesmer bound and thereful are optimal.
|
[
{
"version": "v1",
"created": "Tue, 4 Dec 2007 15:03:44 GMT"
},
{
"version": "v2",
"created": "Fri, 9 Jan 2009 13:22:50 GMT"
}
] | 2009-01-09T00:00:00 |
[
[
"Chen",
"Eric Z.",
""
]
] |
new_dataset
| 0.999645 |
0901.1123
|
Reza Rastegar
|
Arash Hariri, K. Navi, Reza Rastegar
|
A High Dynamic Range 3-Moduli-Set with Efficient Reverse Converter
| null |
Computers & Mathematics with Applications (2008), Vol 55, No 4,
660-668
| null | null |
cs.AR cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
-Residue Number System (RNS) is a valuable tool for fast and parallel
arithmetic. It has a wide application in digital signal processing, fault
tolerant systems, etc. In this work, we introduce the 3-moduli set {2^n,
2^{2n}-1, 2^{2n}+1} and propose its residue to binary converter using the
Chinese Remainder Theorem. We present its simple hardware implementation that
mainly includes one Carry Save Adder (CSA) and a Modular Adder (MA). We compare
the performance and area utilization of our reverse converter to the reverse
converters of the moduli sets {2^n-1, 2^n, 2^n+1, 2^{2n}+1} and {2^n-1, 2^n,
2^n+1, 2^n-2^{(n+1)/2}+1, 2^n+2^{(n+1)/2}+1} that have the same dynamic range
and we demonstrate that our architecture is better in terms of performance and
area utilization. Also, we show that our reverse converter is faster than the
reverse converter of {2^n-1, 2^n, 2^n+1} for dynamic ranges like 8-bit, 16-bit,
32-bit and 64-bit however it requires more area.
|
[
{
"version": "v1",
"created": "Thu, 8 Jan 2009 20:14:00 GMT"
}
] | 2009-01-09T00:00:00 |
[
[
"Hariri",
"Arash",
""
],
[
"Navi",
"K.",
""
],
[
"Rastegar",
"Reza",
""
]
] |
new_dataset
| 0.99838 |
0901.0825
|
Damien Chablat
|
Liang Ma (IRCCyN), Damien Chablat (IRCCyN), Fouad Bennis (IRCCyN), Wei
Zhang (DIE), Fran\c{c}ois Guillaume (EADS)
|
A new muscle fatigue and recovery model and its ergonomics application
in human simulation
|
IDMME - Virtual Concept, Beijing : Chine (2008)
| null | null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Although automatic techniques have been employed in manufacturing industries
to increase productivity and efficiency, there are still lots of manual
handling jobs, especially for assembly and maintenance jobs. In these jobs,
musculoskeletal disorders (MSDs) are one of the major health problems due to
overload and cumulative physical fatigue. With combination of conventional
posture analysis techniques, digital human modelling and simulation (DHM)
techniques have been developed and commercialized to evaluate the potential
physical exposures. However, those ergonomics analysis tools are mainly based
on posture analysis techniques, and until now there is still no fatigue index
available in the commercial software to evaluate the physical fatigue easily
and quickly. In this paper, a new muscle fatigue and recovery model is proposed
and extended to evaluate joint fatigue level in manual handling jobs. A special
application case is described and analyzed by digital human simulation
technique.
|
[
{
"version": "v1",
"created": "Wed, 7 Jan 2009 13:39:33 GMT"
}
] | 2009-01-08T00:00:00 |
[
[
"Ma",
"Liang",
"",
"IRCCyN"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Bennis",
"Fouad",
"",
"IRCCyN"
],
[
"Zhang",
"Wei",
"",
"DIE"
],
[
"Guillaume",
"François",
"",
"EADS"
]
] |
new_dataset
| 0.994743 |
0807.2466
|
Marko A. Rodriguez
|
Marko A. Rodriguez and Vadas Gintautas and Alberto Pepe
|
A Grateful Dead Analysis: The Relationship Between Concert and Listening
Behavior
| null |
First Monday, volume 14, number 1, ISSN:1396-0466, University of
Illinois at Chicago Library, January 2009.
| null |
LA-UR-08-04421
|
cs.CY cs.GL
|
http://creativecommons.org/licenses/publicdomain/
|
The Grateful Dead were an American band that was born out of the San
Francisco, California psychedelic movement of the 1960s. The band played music
together from 1965 to 1995 and is well known for concert performances
containing extended improvisations and long and unique set lists. This article
presents a comparative analysis between 1,590 of the Grateful Dead's concert
set lists from 1972 to 1995 and 2,616,990 last.fm Grateful Dead listening
events from August 2005 to October 2007. While there is a strong correlation
between how songs were played in concert and how they are listened to by
last.fm members, the outlying songs in this trend identify interesting aspects
of the band and their fans 10 years after the band's dissolution.
|
[
{
"version": "v1",
"created": "Tue, 15 Jul 2008 21:31:36 GMT"
}
] | 2009-01-07T00:00:00 |
[
[
"Rodriguez",
"Marko A.",
""
],
[
"Gintautas",
"Vadas",
""
],
[
"Pepe",
"Alberto",
""
]
] |
new_dataset
| 0.984884 |
0901.0573
|
Virgilio Rodriguez
|
Virgilio Rodriguez and Rudolf Mathar and Anke Schmeink
|
Asymptotic stability and capacity results for a broad family of power
adjustment rules: Expanded discussion
|
9 pages; 3 figures
| null | null | null |
cs.IT math.FA math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In any wireless communication environment in which a transmitter creates
interference to the others, a system of non-linear equations arises. Its form
(for 2 terminals) is p1=g1(p2;a1) and p2=g2(p1;a2), with p1, p2 power levels;
a1, a2 quality-of-service (QoS) targets; and g1, g2 functions akin to
"interference functions" in Yates (JSAC, 13(7):1341-1348, 1995). Two
fundamental questions are: (1) does the system have a solution?; and if so, (2)
what is it?. (Yates, 1995) shows that IF the system has a solution, AND the
"interference functions" satisfy some simple properties, a "greedy" power
adjustment process will always converge to a solution. We show that, if the
power-adjustment functions have similar properties to those of (Yates, 1995),
and satisfy a condition of the simple form gi(1,1,...,1)<1, then the system has
a unique solution that can be found iteratively. As examples, feasibility
conditions for macro-diversity and multiple-connection receptions are given.
Informally speaking, we complement (Yates, 1995) by adding the feasibility
condition it lacked. Our analysis is based on norm concepts, and the Banach's
contraction-mapping principle.
|
[
{
"version": "v1",
"created": "Mon, 5 Jan 2009 22:26:53 GMT"
}
] | 2009-01-07T00:00:00 |
[
[
"Rodriguez",
"Virgilio",
""
],
[
"Mathar",
"Rudolf",
""
],
[
"Schmeink",
"Anke",
""
]
] |
new_dataset
| 0.999164 |
0901.0521
|
Tobias Koch
|
Tobias Koch and Amos Lapidoth
|
On Multipath Fading Channels at High SNR
|
Submitted to the IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work studies the capacity of multipath fading channels. A noncoherent
channel model is considered, where neither the transmitter nor the receiver is
cognizant of the realization of the path gains, but both are cognizant of their
statistics. It is shown that if the delay spread is large in the sense that the
variances of the path gains decay exponentially or slower, then capacity is
bounded in the signal-to-noise ratio (SNR). For such channels, capacity does
not tend to infinity as the SNR tends to infinity. In contrast, if the
variances of the path gains decay faster than exponentially, then capacity is
unbounded in the SNR. It is further demonstrated that if the number of paths is
finite, then at high SNR capacity grows double-logarithmically with the SNR,
and the capacity pre-loglog, defined as the limiting ratio of capacity to
log(log(SNR)) as SNR tends to infinity, is 1 irrespective of the number of
paths.
|
[
{
"version": "v1",
"created": "Mon, 5 Jan 2009 20:59:56 GMT"
}
] | 2009-01-06T00:00:00 |
[
[
"Koch",
"Tobias",
""
],
[
"Lapidoth",
"Amos",
""
]
] |
new_dataset
| 0.993524 |
0901.0062
|
Mokshay Madiman
|
Mokshay Madiman
|
Cores of Cooperative Games in Information Theory
|
12 pages, published at
http://www.hindawi.com/GetArticle.aspx?doi=10.1155/2008/318704 in EURASIP
Journal on Wireless Communications and Networking, Special Issue on "Theory
and Applications in Multiuser/Multiterminal Communications", April 2008
|
EURASIP Journal on Wireless Communications and Networking, Volume
2008, Article ID 318704
|
10.1155/2008/318704
| null |
cs.IT cs.GT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Cores of cooperative games are ubiquitous in information theory, and arise
most frequently in the characterization of fundamental limits in various
scenarios involving multiple users. Examples include classical settings in
network information theory such as Slepian-Wolf source coding and multiple
access channels, classical settings in statistics such as robust hypothesis
testing, and new settings at the intersection of networking and statistics such
as distributed estimation problems for sensor networks. Cooperative game theory
allows one to understand aspects of all of these problems from a fresh and
unifying perspective that treats users as players in a game, sometimes leading
to new insights. At the heart of these analyses are fundamental dualities that
have been long studied in the context of cooperative games; for information
theoretic purposes, these are dualities between information inequalities on the
one hand and properties of rate, capacity or other resource allocation regions
on the other.
|
[
{
"version": "v1",
"created": "Wed, 31 Dec 2008 05:26:59 GMT"
}
] | 2009-01-05T00:00:00 |
[
[
"Madiman",
"Mokshay",
""
]
] |
new_dataset
| 0.992626 |
0808.0156
|
Paul Bunn
|
Yair Amir, Paul Bunn, Rafail Ostrovksy
|
Authenticated Adversarial Routing
|
Corrected typos. TCC '09 (to appear)
| null | null | null |
cs.CR cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of this paper is to demonstrate the feasibility of authenticated
throughput-efficient routing in an unreliable and dynamically changing
synchronous network in which the majority of malicious insiders try to destroy
and alter messages or disrupt communication in any way. More specifically, in
this paper we seek to answer the following question: Given a network in which
the majority of nodes are controlled by a malicious adversary and whose
topology is changing every round, is it possible to develop a protocol with
polynomially-bounded memory per processor that guarantees throughput-efficient
and correct end-to-end communication? We answer the question affirmatively for
extremely general corruption patterns: we only request that the topology of the
network and the corruption pattern of the adversary leaves at least one path
each round connecting the sender and receiver through honest nodes (though this
path may change at every round). Out construction works in the public-key
setting and enjoys bounded memory per processor (that does not depend on the
amount of traffic and is polynomial in the network size.) Our protocol achieves
optimal transfer rate with negligible decoding error. We stress that our
protocol assumes no knowledge of which nodes are corrupted nor which path is
reliable at any round, and is also fully distributed with nodes making
decisions locally, so that they need not know the topology of the network at
any time.
|
[
{
"version": "v1",
"created": "Fri, 1 Aug 2008 19:11:37 GMT"
},
{
"version": "v2",
"created": "Wed, 22 Oct 2008 15:27:06 GMT"
},
{
"version": "v3",
"created": "Sat, 3 Jan 2009 23:25:43 GMT"
}
] | 2009-01-04T00:00:00 |
[
[
"Amir",
"Yair",
""
],
[
"Bunn",
"Paul",
""
],
[
"Ostrovksy",
"Rafail",
""
]
] |
new_dataset
| 0.99663 |
0812.3214
|
Malay Dutta
|
Malay Dutta (Tezpur University India)
|
Two conjectures such that the proof of any one of them will lead to the
proof that P = NP
|
Some minor corrections
| null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we define a construct called a time-graph. A complete
time-graph of order n is the cartesian product of a complete graph with n
vertices and a linear graph with n vertices. A time-graph of order n is given
by a subset of the set of edges E(n) of such a graph. The notion of a
hamiltonian time-graph is defined in a natural way and we define the
Hamiltonian time-graph problem (HAMTG) as : Given a time-graph is it
hamiltonian ? We show that the Hamiltonian path problem (HAMP) can be
transformed to HAMTG in polynomial time. We then define certain vector spaces
of functions from E(n) and E(n)xE(n) to B = {0,1}, the field of two elements
and derive certain properties of these spaces. We give two conjectures about
these spaces and prove that if any one of these conjectures is true, we get a
polynomial time algorithm for the Hamiltonian path problem. Since the
Hamiltonian path problem is NP-complete we obtain the proof of P = NP provided
any one of the two conjectures is true.
|
[
{
"version": "v1",
"created": "Wed, 17 Dec 2008 07:03:53 GMT"
},
{
"version": "v2",
"created": "Wed, 31 Dec 2008 03:53:16 GMT"
}
] | 2008-12-31T00:00:00 |
[
[
"Dutta",
"Malay",
"",
"Tezpur University India"
]
] |
new_dataset
| 0.978424 |
0812.2734
|
Benjamin Leveque
|
Kathie Cameron, Chinh Ho\`ang, Benjamin L\'ev\^eque
|
Asteroids in rooted and directed path graphs
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An asteroidal triple is a stable set of three vertices such that each pair is
connected by a path avoiding the neighborhood of the third vertex. Asteroidal
triples play a central role in a classical characterization of interval graphs
by Lekkerkerker and Boland. Their result says that a chordal graph is an
interval graph if and only if it contains no asteroidal triple. In this paper,
we prove an analogous theorem for directed path graphs which are the
intersection graphs of directed paths in a directed tree. For this purpose, we
introduce the notion of a strong path. Two non-adjacent vertices are linked by
a strong path if either they have a common neighbor or they are the endpoints
of two vertex-disjoint chordless paths satisfying certain conditions. A strong
asteroidal triple is an asteroidal triple such that each pair is linked by a
strong path. We prove that a chordal graph is a directed path graph if and only
if it contains no strong asteroidal triple. We also introduce a related notion
of asteroidal quadruple, and conjecture a characterization of rooted path
graphs which are the intersection graphs of directed paths in a rooted tree.
|
[
{
"version": "v1",
"created": "Mon, 15 Dec 2008 07:50:42 GMT"
},
{
"version": "v2",
"created": "Tue, 30 Dec 2008 14:15:25 GMT"
}
] | 2008-12-30T00:00:00 |
[
[
"Cameron",
"Kathie",
""
],
[
"Hoàng",
"Chinh",
""
],
[
"Lévêque",
"Benjamin",
""
]
] |
new_dataset
| 0.999754 |
cs/0412099
|
Arindam Mitra
|
Arindam Mitra
|
An unbreakable cryptosystem
|
Acknowledgement is due
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The remarkably long-standing problem of cryptography is to generate
completely secure key. It is widely believed that the task cannot be achieved
within classical cryptography. However, there is no proof in support of this
belief. We present an incredibly simple classical cryptosystem which can
generate completely secure key.
|
[
{
"version": "v1",
"created": "Wed, 22 Dec 2004 06:26:57 GMT"
},
{
"version": "v10",
"created": "Fri, 13 Jun 2008 15:43:55 GMT"
},
{
"version": "v11",
"created": "Fri, 4 Jul 2008 15:14:20 GMT"
},
{
"version": "v12",
"created": "Sat, 2 Aug 2008 14:23:51 GMT"
},
{
"version": "v13",
"created": "Sat, 27 Dec 2008 15:53:49 GMT"
},
{
"version": "v2",
"created": "Sat, 5 Mar 2005 14:10:55 GMT"
},
{
"version": "v3",
"created": "Thu, 5 May 2005 13:29:58 GMT"
},
{
"version": "v4",
"created": "Thu, 26 Oct 2006 14:42:42 GMT"
},
{
"version": "v5",
"created": "Wed, 31 Jan 2007 14:01:40 GMT"
},
{
"version": "v6",
"created": "Wed, 14 Mar 2007 13:12:39 GMT"
},
{
"version": "v7",
"created": "Mon, 28 May 2007 14:41:12 GMT"
},
{
"version": "v8",
"created": "Wed, 14 Nov 2007 16:06:26 GMT"
},
{
"version": "v9",
"created": "Thu, 20 Mar 2008 15:57:58 GMT"
}
] | 2008-12-27T00:00:00 |
[
[
"Mitra",
"Arindam",
""
]
] |
new_dataset
| 0.982564 |
0812.1379
|
Leonid Barenboim
|
Leonid Barenboim and Michael Elkin
|
Distributed (Delta + 1)-coloring in linear (in Delta) time
|
12 pages, 2 figures. Contents added: pages 11-12
| null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The distributed (Delta + 1)-coloring problem is one of most fundamental and
well-studied problems of Distributed Algorithms. Starting with the work of Cole
and Vishkin in 86, there was a long line of gradually improving algorithms
published. The current state-of-the-art running time is O(Delta log Delta +
log^* n), due to Kuhn and Wattenhofer, PODC'06. Linial (FOCS'87) has proved a
lower bound of 1/2 \log^* n for the problem, and Szegedy and Vishwanathan
(STOC'93) provided a heuristic argument that shows that algorithms from a wide
family of locally iterative algorithms are unlikely to achieve running time
smaller than \Theta(Delta log Delta).
We present a deterministic (Delta + 1)-coloring distributed algorithm with
running time O(Delta) + 1/2 log^* n. We also present a tradeoff between the
running time and the number of colors, and devise an O(Delta * t)-coloring
algorithm with running time O(Delta / t + \log^* n), for any parameter t, 1 < t
< Delta^{1-epsilon}, for an arbitrarily small constant epsilon, 0 < epsilon <
1.
On the way to this result we study a generalization of the notion of graph
coloring, which is called defective coloring. In an m-defective p-coloring the
vertices are colored with p colors so that each vertex has up to m neighbors
with the same color. We show that an m-defective p-coloring with reasonably
small m and p can be computed very efficiently. We also develop a technique to
employ multiple defect colorings of various subgraphs of the original graph G
for computing a (Delta+1)-coloring of G. We believe that these techniques are
of independent interest.
|
[
{
"version": "v1",
"created": "Sun, 7 Dec 2008 20:44:28 GMT"
},
{
"version": "v2",
"created": "Fri, 26 Dec 2008 10:45:09 GMT"
}
] | 2008-12-26T00:00:00 |
[
[
"Barenboim",
"Leonid",
""
],
[
"Elkin",
"Michael",
""
]
] |
new_dataset
| 0.983048 |
0812.3873
|
Li Chia Choo
|
Li-Chia Choo, Kai-Kit Wong
|
The K-Receiver Broadcast Channel with Confidential Messages
|
19 pages, 1 figure, submitted to IEEE Transactions on Information
Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The secrecy capacity region for the K-receiver degraded broadcast channel
(BC) is given for confidential messages sent to the receivers and to be kept
secret from an external wiretapper. Superposition coding and Wyner's random
code partitioning are used to show the achievable rate tuples. Error
probability analysis and equivocation calculation are also provided. In the
converse proof, a new definition for the auxiliary random variables is used,
which is different from either the case of the 2-receiver BC without common
message or the K-receiver BC with common message, both with an external
wiretapper; or the K-receiver BC without a wiretapper.
|
[
{
"version": "v1",
"created": "Fri, 19 Dec 2008 18:15:52 GMT"
}
] | 2008-12-22T00:00:00 |
[
[
"Choo",
"Li-Chia",
""
],
[
"Wong",
"Kai-Kit",
""
]
] |
new_dataset
| 0.996915 |
0812.3550
|
Pierre Genev\`es
|
Pierre Geneves and Nabil Layaida
|
XML Static Analyzer User Manual
| null | null | null |
RR-6726
|
cs.PL cs.DB cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document describes how to use the XML static analyzer in practice. It
provides informal documentation for using the XML reasoning solver
implementation. The solver allows automated verification of properties that are
expressed as logical formulas over trees. A logical formula may for instance
express structural constraints or navigation properties (like e.g. path
existence and node selection) in finite trees. Logical formulas can be
expressed using the syntax of XPath expressions, DTD, XML Schemas, and Relax NG
definitions.
|
[
{
"version": "v1",
"created": "Thu, 18 Dec 2008 15:22:46 GMT"
}
] | 2008-12-19T00:00:00 |
[
[
"Geneves",
"Pierre",
""
],
[
"Layaida",
"Nabil",
""
]
] |
new_dataset
| 0.999021 |
0812.3642
|
Deniz Gunduz
|
Deniz Gunduz, Andrea Goldsmith, H. Vincent Poor
|
MIMO Two-way Relay Channel: Diversity-Multiplexing Tradeoff Analysis
|
Presented at the Asilomar Conference on Signals, Systems and
Computers, Pacific Grove, CA, Oct. 2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A multi-hop two-way relay channel is considered in which all the terminals
are equipped with multiple antennas. Assuming independent quasi-static Rayleigh
fading channels and channel state information available at the receivers, we
characterize the optimal diversity-multiplexing gain tradeoff (DMT) curve for a
full-duplex relay terminal. It is shown that the optimal DMT can be achieved by
a compress-and-forward type relaying strategy in which the relay quantizes its
received signal and transmits the corresponding channel codeword. It is
noteworthy that, with this transmission protocol, the two transmissions in
opposite directions can achieve their respective single user optimal DMT
performances simultaneously, despite the interference they cause to each other.
Motivated by the optimality of this scheme in the case of the two-way relay
channel, a novel dynamic compress-and-forward (DCF) protocol is proposed for
the one-way multi-hop MIMO relay channel for a half-duplex relay terminal, and
this scheme is shown to achieve the optimal DMT performance.
|
[
{
"version": "v1",
"created": "Thu, 18 Dec 2008 20:25:14 GMT"
}
] | 2008-12-19T00:00:00 |
[
[
"Gunduz",
"Deniz",
""
],
[
"Goldsmith",
"Andrea",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.999634 |
0803.0055
|
Benoit Masson
|
Alberto Dennunzio (DISCo), Pierre Guillon (IGM), Beno\^it Masson (LIF)
|
A compact topology for sand automata
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we exhibit a strong relation between the sand automata
configuration space and the cellular automata configuration space. This
relation induces a compact topology for sand automata, and a new context in
which sand automata are homeomorphic to cellular automata acting on a specific
subshift. We show that the existing topological results for sand automata,
including the Hedlund-like representation theorem, still hold. In this context,
we give a characterization of the cellular automata which are sand automata,
and study some dynamical behaviors such as equicontinuity. Furthermore, we deal
with the nilpotency. We show that the classical definition is not meaningful
for sand automata. Then, we introduce a suitable new notion of nilpotency for
sand automata. Finally, we prove that this simple dynamical behavior is
undecidable.
|
[
{
"version": "v1",
"created": "Sat, 1 Mar 2008 08:36:39 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Dennunzio",
"Alberto",
"",
"DISCo"
],
[
"Guillon",
"Pierre",
"",
"IGM"
],
[
"Masson",
"Benoît",
"",
"LIF"
]
] |
new_dataset
| 0.998843 |
0803.0528
|
Abdelhamid Mellouk
|
Said Hoceini (LISSI - Ea 3956), Abdelhamid Mellouk (LISSI - Ea 3956),
Hayet Hafi (LISSI - Ea 3956)
|
Une approche modulaire probabiliste pour le routage \`a Qualit\'e de
Service int\'egr\'ee
| null |
Colloque Francophone sur l'Ing\'enierie des Protocoles (CFIP), Les
Arcs : France (2008)
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to emerging real-time and multimedia applications, efficient routing of
information packets in dynamically changing communication network requires that
as the load levels, traffic patterns and topology of the network change, the
routing policy also adapts. We focused in this paper on QoS based routing by
developing a neuro-dynamic programming to construct dynamic state dependent
routing policies. We propose an approach based on adaptive algorithm for packet
routing using reinforcement learning which optimizes two criteria: cumulative
cost path and end-to-end delay. Numerical results obtained with OPNET simulator
for different packet interarrival times statistical distributions with
different levels of traffic's load show that the proposed approach gives better
results compared to standard optimal path routing algorithms.
|
[
{
"version": "v1",
"created": "Tue, 4 Mar 2008 19:43:55 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Hoceini",
"Said",
"",
"LISSI - Ea 3956"
],
[
"Mellouk",
"Abdelhamid",
"",
"LISSI - Ea 3956"
],
[
"Hafi",
"Hayet",
"",
"LISSI - Ea 3956"
]
] |
new_dataset
| 0.997404 |
0803.1586
|
Jeroen Vendrig
|
Jarrad Springett, Jeroen Vendrig
|
Spatio-activity based object detection
|
To be submitted to: AVSS 2008 conference
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present the SAMMI lightweight object detection method which has a high
level of accuracy and robustness, and which is able to operate in an
environment with a large number of cameras. Background modeling is based on DCT
coefficients provided by cameras. Foreground detection uses similarity in
temporal characteristics of adjacent blocks of pixels, which is a
computationally inexpensive way to make use of object coherence. Scene model
updating uses the approximated median method for improved performance.
Evaluation at pixel level and application level shows that SAMMI object
detection performs better and faster than the conventional Mixture of Gaussians
method.
|
[
{
"version": "v1",
"created": "Tue, 11 Mar 2008 13:40:42 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Springett",
"Jarrad",
""
],
[
"Vendrig",
"Jeroen",
""
]
] |
new_dataset
| 0.970431 |
0803.1764
|
Thomas Watteyne
|
Thomas Watteyne (INRIA Rh\^one-Alpes, FT R&D), Dominique Barthel (FT
R&D), Mischa Dohler (CTTC), Isabelle Aug\'e-Blum (INRIA Rh\^one-Alpes)
|
WiFly: experimenting with Wireless Sensor Networks and Virtual
coordinates
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Experimentation is important when designing communication protocols for
Wireless Sensor Networks. Lower-layers have a major impact on upper-layer
performance, and the complexity of the phenomena can not be entirely captured
by analysis or simulation. In this report, we go through the complete process,
from designing an energy-efficient self-organizing communication architecture
(MAC, routing and application layers) to real-life experimentation roll-outs.
The presented communication architecture includes a MAC protocol which avoids
building and maintaining neighborhood tables, and a geographically-inspired
routing protocol over virtual coordinates. The application consists of a mobile
sink interrogating a wireless sensor network based on the requests issued by a
disconnected base station. After the design process of this architecture, we
verify it functions correctly by simulation, and we perform a temporal
verification. This study is needed to calculate the maximum speed the mobile
sink can take. We detail the implementation, and the results of the off-site
experimentation (energy consumption at PHY layer, collision probability at MAC
layer, and routing). Finally, we report on the real-world deployment where we
have mounted the mobile sink node on a radio-controlled airplane.
|
[
{
"version": "v1",
"created": "Wed, 12 Mar 2008 13:02:15 GMT"
},
{
"version": "v2",
"created": "Fri, 14 Mar 2008 09:11:57 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Watteyne",
"Thomas",
"",
"INRIA Rhône-Alpes, FT R&D"
],
[
"Barthel",
"Dominique",
"",
"FT\n R&D"
],
[
"Dohler",
"Mischa",
"",
"CTTC"
],
[
"Augé-Blum",
"Isabelle",
"",
"INRIA Rhône-Alpes"
]
] |
new_dataset
| 0.997792 |
0803.1975
|
Jean-Guillaume Dumas
|
Jean-Guillaume Dumas (LJK), Laurent Fousse (LJK), Bruno Salvy (INRIA
Rocquencourt)
|
Compressed Modular Matrix Multiplication
|
Published in: MICA'2008 : Milestones in Computer Algebra, Tobago :
Trinit\'e-et-Tobago (2008)
| null | null | null |
cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose to store several integers modulo a small prime into a single
machine word. Modular addition is performed by addition and possibly
subtraction of a word containing several times the modulo. Modular
Multiplication is not directly accessible but modular dot product can be
performed by an integer multiplication by the reverse integer. Modular
multiplication by a word containing a single residue is a also possible.
Therefore matrix multiplication can be performed on such a compressed storage.
We here give bounds on the sizes of primes and matrices for which such a
compression is possible. We also explicit the details of the required
compressed arithmetic routines.
|
[
{
"version": "v1",
"created": "Thu, 13 Mar 2008 19:15:42 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Dumas",
"Jean-Guillaume",
"",
"LJK"
],
[
"Fousse",
"Laurent",
"",
"LJK"
],
[
"Salvy",
"Bruno",
"",
"INRIA\n Rocquencourt"
]
] |
new_dataset
| 0.998533 |
0803.2220
|
Panagiotis Papadakos
|
Panagiotis Papadakos, Giorgos Vasiliadis, Yannis Theoharis, Nikos
Armenatzoglou, Stella Kopidaki, Yannis Marketakis, Manos Daskalakis, Kostas
Karamaroudis, Giorgos Linardakis, Giannis Makrydakis, Vangelis Papathanasiou,
Lefteris Sardis, Petros Tsialiamanis, Georgia Troullinou, Kostas Vandikas,
Dimitris Velegrakis and Yannis Tzitzikas
|
The Anatomy of Mitos Web Search Engine
| null | null | null | null |
cs.IR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Engineering a Web search engine offering effective and efficient information
retrieval is a challenging task. This document presents our experiences from
designing and developing a Web search engine offering a wide spectrum of
functionalities and we report some interesting experimental results. A rather
peculiar design choice of the engine is that its index is based on a DBMS,
while some of the distinctive functionalities that are offered include advanced
Greek language stemming, real time result clustering, and advanced link
analysis techniques (also for spam page detection).
|
[
{
"version": "v1",
"created": "Fri, 14 Mar 2008 19:18:15 GMT"
},
{
"version": "v2",
"created": "Sun, 16 Mar 2008 17:25:19 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Papadakos",
"Panagiotis",
""
],
[
"Vasiliadis",
"Giorgos",
""
],
[
"Theoharis",
"Yannis",
""
],
[
"Armenatzoglou",
"Nikos",
""
],
[
"Kopidaki",
"Stella",
""
],
[
"Marketakis",
"Yannis",
""
],
[
"Daskalakis",
"Manos",
""
],
[
"Karamaroudis",
"Kostas",
""
],
[
"Linardakis",
"Giorgos",
""
],
[
"Makrydakis",
"Giannis",
""
],
[
"Papathanasiou",
"Vangelis",
""
],
[
"Sardis",
"Lefteris",
""
],
[
"Tsialiamanis",
"Petros",
""
],
[
"Troullinou",
"Georgia",
""
],
[
"Vandikas",
"Kostas",
""
],
[
"Velegrakis",
"Dimitris",
""
],
[
"Tzitzikas",
"Yannis",
""
]
] |
new_dataset
| 0.995867 |
0803.2305
|
Andrew Gacek
|
Andrew Gacek
|
The Abella Interactive Theorem Prover (System Description)
|
7 pages, to appear in IJCAR'08
| null | null | null |
cs.LO cs.PL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Abella is an interactive system for reasoning about aspects of object
languages that have been formally presented through recursive rules based on
syntactic structure. Abella utilizes a two-level logic approach to
specification and reasoning. One level is defined by a specification logic
which supports a transparent encoding of structural semantics rules and also
enables their execution. The second level, called the reasoning logic, embeds
the specification logic and allows the development of proofs of properties
about specifications. An important characteristic of both logics is that they
exploit the lambda tree syntax approach to treating binding in object
languages. Amongst other things, Abella has been used to prove normalizability
properties of the lambda calculus, cut admissibility for a sequent calculus and
type uniqueness and subject reduction properties. This paper discusses the
logical foundations of Abella, outlines the style of theorem proving that it
supports and finally describes some of its recent applications.
|
[
{
"version": "v1",
"created": "Sat, 15 Mar 2008 16:15:10 GMT"
},
{
"version": "v2",
"created": "Fri, 23 May 2008 15:28:08 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Gacek",
"Andrew",
""
]
] |
new_dataset
| 0.99709 |
0803.2317
|
Jorge Sousa Pinto
|
Joao Gomes and Daniel Martins and Simao Melo de Sousa and Jorge Sousa
Pinto
|
Lissom, a Source Level Proof Carrying Code Platform
|
Poster presented at the International Workshop on Proof-Carrying Code
(PCC 06), 2006
| null | null | null |
cs.LO cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper introduces a proposal for a Proof Carrying Code (PCC) architecture
called Lissom. Started as a challenge for final year Computing students, Lissom
was thought as a mean to prove to a sceptic community, and in particular to
students, that formal verification tools can be put to practice in a realistic
environment, and be used to solve complex and concrete problems. The
attractiveness of the problems that PCC addresses has already brought students
to show interest in this project.
|
[
{
"version": "v1",
"created": "Sat, 15 Mar 2008 18:53:06 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Gomes",
"Joao",
""
],
[
"Martins",
"Daniel",
""
],
[
"de Sousa",
"Simao Melo",
""
],
[
"Pinto",
"Jorge Sousa",
""
]
] |
new_dataset
| 0.999335 |
0803.3553
|
Carl Bracken
|
Carl Bracken
|
New Families of Triple Error Correcting Codes with BCH Parameters
|
11 pages. Submitted to IEEE Transactions on information Theory
| null | null | null |
cs.IT cs.DM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Discovered by Bose, Chaudhuri and Hocquenghem, the BCH family of error
correcting codes are one of the most studied families in coding theory. They
are also among the best performing codes, particularly when the number of
errors being corrected is small relative to the code length. In this article we
consider binary codes with minimum distance of 7. We construct new families of
codes with these BCH parameters via a generalisation of the Kasami-Welch
Theorem.
|
[
{
"version": "v1",
"created": "Tue, 25 Mar 2008 13:08:19 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Bracken",
"Carl",
""
]
] |
new_dataset
| 0.979238 |
0803.4049
|
Ke Liu
|
Ke Liu and Nael Abu-Ghazaleh
|
Stateless and Delivery Guaranteed Geometric Routing on Virtual
Coordinate System
| null | null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Stateless geographic routing provides relatively good performance at a fixed
overhead, which is typically much lower than conventional routing protocols
such as AODV. However, the performance of geographic routing is impacted by
physical voids, and localization errors. Accordingly, virtual coordinate
systems (VCS) were proposed as an alternative approach that is resilient to
localization errors and that naturally routes around physical voids. However,
VCS also faces virtual anomalies, causing their performance to trail geographic
routing. In existing VCS routing protocols, there is a lack of an effective
stateless and delivery guaranteed complementary routing algorithm that can be
used to traverse voids. Most proposed solutions use variants of flooding or
blind searching when a void is encountered. In this paper, we propose a
spanning-path virtual coordinate system which can be used as a complete routing
algorithm or as the complementary algorithm to greedy forwarding that is
invoked when voids are encountered. With this approach, and for the first time,
we demonstrate a stateless and delivery guaranteed geometric routing algorithm
on VCS. When used in conjunction with our previously proposed aligned virtual
coordinate system (AVCS), it out-performs not only all geometric routing
protocols on VCS, but also geographic routing with accurate location
information.
|
[
{
"version": "v1",
"created": "Fri, 28 Mar 2008 05:58:51 GMT"
},
{
"version": "v2",
"created": "Sat, 29 Mar 2008 02:53:24 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Liu",
"Ke",
""
],
[
"Abu-Ghazaleh",
"Nael",
""
]
] |
new_dataset
| 0.997834 |
0804.0561
|
Christian Duriez
|
Christian Duriez (INRIA Lille - Nord Europe), Fr\'ed\'eric Dubois
(LMGC), Abderrahmane Kheddar (JRL), Claude Andriot (LIST)
|
Realistic Haptic Rendering of Interacting Deformable Objects in Virtual
Environments
| null |
IEEE Transactions on Visualization and Computer Graphics 12, 1
(2006) 36-47
| null | null |
cs.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new computer haptics algorithm to be used in general interactive
manipulations of deformable virtual objects is presented. In multimodal
interactive simulations, haptic feedback computation often comes from contact
forces. Subsequently, the fidelity of haptic rendering depends significantly on
contact space modeling. Contact and friction laws between deformable models are
often simplified in up to date methods. They do not allow a "realistic"
rendering of the subtleties of contact space physical phenomena (such as slip
and stick effects due to friction or mechanical coupling between contacts). In
this paper, we use Signorini's contact law and Coulomb's friction law as a
computer haptics basis. Real-time performance is made possible thanks to a
linearization of the behavior in the contact space, formulated as the so-called
Delassus operator, and iteratively solved by a Gauss-Seidel type algorithm.
Dynamic deformation uses corotational global formulation to obtain the Delassus
operator in which the mass and stiffness ratio are dissociated from the
simulation time step. This last point is crucial to keep stable haptic
feedback. This global approach has been packaged, implemented, and tested.
Stable and realistic 6D haptic feedback is demonstrated through a clipping task
experiment.
|
[
{
"version": "v1",
"created": "Thu, 3 Apr 2008 13:49:51 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Duriez",
"Christian",
"",
"INRIA Lille - Nord Europe"
],
[
"Dubois",
"Frédéric",
"",
"LMGC"
],
[
"Kheddar",
"Abderrahmane",
"",
"JRL"
],
[
"Andriot",
"Claude",
"",
"LIST"
]
] |
new_dataset
| 0.994593 |
0804.1185
|
Al-Sakib Khan Pathan
|
Al-Sakib Khan Pathan and Choong Seon Hong
|
Cryptanalysis of Yang-Wang-Chang's Password Authentication Scheme with
Smart Cards
|
3 Pages
|
10th IEEE International Conference on Advanced Communication
Technology (IEEE ICACT 2008), Volume III, February 17-20, 2008, Phoenix Park,
Korea, pp. 1618-1620
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In 2005, Yang, Wang, and Chang proposed an improved timestamp-based password
authentication scheme in an attempt to overcome the flaws of Yang-Shieh_s
legendary timestamp-based remote authentication scheme using smart cards. After
analyzing the improved scheme proposed by Yang-Wang-Chang, we have found that
their scheme is still insecure and vulnerable to four types of forgery attacks.
Hence, in this paper, we prove that, their claim that their scheme is
intractable is incorrect. Also, we show that even an attack based on Sun et
al._s attack could be launched against their scheme which they claimed to
resolve with their proposal.
|
[
{
"version": "v1",
"created": "Tue, 8 Apr 2008 05:22:27 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Pathan",
"Al-Sakib Khan",
""
],
[
"Hong",
"Choong Seon",
""
]
] |
new_dataset
| 0.996919 |
0804.1760
|
Michel Grabisch
|
Michel Grabisch (LIP6)
|
The Symmetric Sugeno Integral
| null |
Fuzzy Sets and Systems 139 (2003) 473-490
| null | null |
cs.DM math.PR math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose an extension of the Sugeno integral for negative numbers, in the
spirit of the symmetric extension of Choquet integral, also called \Sipos\
integral. Our framework is purely ordinal, since the Sugeno integral has its
interest when the underlying structure is ordinal. We begin by defining
negative numbers on a linearly ordered set, and we endow this new structure
with a suitable algebra, very close to the ring of real numbers. In a second
step, we introduce the M\"obius transform on this new structure. Lastly, we
define the symmetric Sugeno integral, and show its similarity with the
symmetric Choquet integral.
|
[
{
"version": "v1",
"created": "Thu, 10 Apr 2008 17:00:36 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Grabisch",
"Michel",
"",
"LIP6"
]
] |
new_dataset
| 0.998779 |
0804.2992
|
Eberhard H.-A. Gerbracht
|
Eberhard H.-A. Gerbracht
|
"E pluribus unum" or How to Derive Single-equation Descriptions for
Output-quantities in Nonlinear Circuits using Differential Algebra
|
V1: documentclass IEEEtran, 7 pages, 10 figures. Re-release of the
printed version, with some minor typographical errors corrected
|
Proceedings of the 7th International Workshop on Symbolic Methods
and Applications to Circuit Design, SMACD 2002, Sinaia, Romania, October
10-11, 2002; pp. 65-70; ISBN 973-85072-5-1
| null | null |
cs.SC math.CA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe by a number of examples how to deduce one single
characterizing higher order differential equation for output quantities of an
analog circuit.
In the linear case, we apply basic "symbolic" methods from linear algebra to
the system of differential equations which is used to model the analog circuit.
For nonlinear circuits and their corresponding nonlinear differential
equations, we show how to employ computer algebra tools implemented in Maple,
which are based on differential algebra.
|
[
{
"version": "v1",
"created": "Fri, 18 Apr 2008 19:55:58 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Gerbracht",
"Eberhard H. -A.",
""
]
] |
new_dataset
| 0.998976 |
0805.0231
|
Nikolaus Hansen
|
Nikolaus Hansen (INRIA Futurs)
|
CMA-ES with Two-Point Step-Size Adaptation
| null | null | null |
RR-6527
|
cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We combine a refined version of two-point step-size adaptation with the
covariance matrix adaptation evolution strategy (CMA-ES). Additionally, we
suggest polished formulae for the learning rate of the covariance matrix and
the recombination weights. In contrast to cumulative step-size adaptation or to
the 1/5-th success rule, the refined two-point adaptation (TPA) does not rely
on any internal model of optimality. In contrast to conventional
self-adaptation, the TPA will achieve a better target step-size in particular
with large populations. The disadvantage of TPA is that it relies on two
additional objective function
|
[
{
"version": "v1",
"created": "Fri, 2 May 2008 13:55:37 GMT"
},
{
"version": "v2",
"created": "Sat, 3 May 2008 06:16:04 GMT"
},
{
"version": "v3",
"created": "Tue, 13 May 2008 08:17:14 GMT"
},
{
"version": "v4",
"created": "Sun, 18 May 2008 06:38:04 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Hansen",
"Nikolaus",
"",
"INRIA Futurs"
]
] |
new_dataset
| 0.984346 |
0805.0857
|
EDA Publishing Association
|
L. Juhasz, A. Vass-Varnai, Veronika Timar-Horvath, Marc Desmulliez,
Resh Dhariwal
|
Porous Alumina Based Capacitive MEMS RH Sensor
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The aim of a joint research and development project at the BME and HWU is to
produce a cheap, reliable, low-power and CMOS-MEMS process compatible
capacitive type relative humidity (RH) sensor that can be incorporated into a
state-of-the-art, wireless sensor network. In this paper we discuss the
preparation of our new capacitive structure based on post-CMOS MEMS processes
and the methods which were used to characterize the thin film porous alumina
sensing layer. The average sensitivity is approx. 15 pF/RH% which is more than
a magnitude higher than the values found in the literature. The sensor is
equipped with integrated resistive heating, which can be used for maintenance
to reduce drift, or for keeping the sensing layer at elevated temperature, as
an alternative method for temperature-dependence cancellation.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 08:41:41 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Juhasz",
"L.",
""
],
[
"Vass-Varnai",
"A.",
""
],
[
"Timar-Horvath",
"Veronika",
""
],
[
"Desmulliez",
"Marc",
""
],
[
"Dhariwal",
"Resh",
""
]
] |
new_dataset
| 0.985347 |
0805.0858
|
EDA Publishing Association
|
R. R. Mansour, S. Fouladi, M. Bakeri-Kassem
|
Integrated RF MEMS/CMOS Devices
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A maskless post-processing technique for CMOS chips is developed that enables
the fabrication of RF MEMS parallel-plate capacitors with a high quality factor
and a very compact size. Simulations and measured results are presented for
several MEMS/CMOS capacitors. A 2-pole coupled line tunable bandpass filter
with a center frequency of 9.5 GHz is designed, fabricated and tested. A tuning
range of 17% is achieved using integrated variable MEMS/CMOS capacitors with a
quality factor exceeding 20. The tunable filter occupies a chip area of 1.2 x
2.1 mm2.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 08:42:40 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Mansour",
"R. R.",
""
],
[
"Fouladi",
"S.",
""
],
[
"Bakeri-Kassem",
"M.",
""
]
] |
new_dataset
| 0.994763 |
0805.0861
|
EDA Publishing Association
|
Jack Hoyd-Gigg Ng, Marc Desmulliez, Aongus Mccarthy, Himanshu Suyal,
Kevin Prior, Duncan P. Hand
|
UV Direct-Writing of Metals on Polyimide
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Conductive micro-patterned copper tracks were fabricated by UV direct-writing
of a nanoparticle silver seed layer followed by selective electroless copper
deposition. Silver ions were first incorporated into a hydrolyzed polyimide
surface layer by wet chemical treatment. A photoreactive polymer coating,
methoxy poly(ethylene glycol) (MPEG) was coated on top of the substrate prior
to UV irradiation. Electrons released through the interaction between the MPEG
molecules and UV photons allowed the reduction of the silver ions across the
MPEG/doped polyimide interface. The resultant silver seed layer has a cluster
morphology which is suitable for the initiation of electroless plating. Initial
results showed that the deposited copper tracks were in good agreement with the
track width on the photomask and laser direct-writing can also fabricate
smaller line width metal tracks with good accuracy. The facile fabrication
presented here can be carried out in air, at atmospheric pressure, and on
contoured surfaces.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 08:44:24 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Ng",
"Jack Hoyd-Gigg",
""
],
[
"Desmulliez",
"Marc",
""
],
[
"Mccarthy",
"Aongus",
""
],
[
"Suyal",
"Himanshu",
""
],
[
"Prior",
"Kevin",
""
],
[
"Hand",
"Duncan P.",
""
]
] |
new_dataset
| 0.959657 |
0805.0871
|
EDA Publishing Association
|
X. Shan, Y. C. Soh, C. W. P. Shi, C. K. Tay, C. W. Lu
|
Large Area Roller Embossing of Multilayered Ceramic Green Composites
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we will report our achievements in developing large area
patterning of multilayered ceramic green composites using roller embossing. The
aim of our research is to pattern large area ceramic green composites using a
modified roller laminating apparatus, which is compatible with screen printing
machines, for integration of embossing and screen printing. The instrumentation
of our roller embossing apparatus, as shown in Figure1, consists of roller 1
and rollers 2. Roller 1 is heated up to the desired embossing temperature ;
roller 2 is, however, kept at room temperature. The mould is a nickel template
manufactured by plating nickel-based micro patterns (height : 50 $\mu$m) on a
nickel film (thickness : 70 $\mu$m) ; the substrate for the roller embossing is
a multilayered Heraeus Heralock HL 2000 ceramic green composite. Comparing with
the conventional simultaneous embossing, the advantages of roller embossing
include : (1) low embossing force ; (2) easiness of demoulding ; (3) localized
area in contact with heater ; and etc. We have demonstrated the capability of
large area roller embossing with a panel size of 150mmx 150mm on the mentioned
substrate. We have explored and confirmed the impact of parameters (feed speed,
temperature of roller and applied pressure) to the pattern quality of roller
embossing. Furthermore, under the optimized process parameters, we
characterized the variations of pattern dimension over the panel area, and
calculated a scaling factor in order to make the panel compatible with other
processes. Figure 2 shows the embossed patterns on a 150mmx 150mm green ceramic
panel.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 08:58:21 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Shan",
"X.",
""
],
[
"Soh",
"Y. C.",
""
],
[
"Shi",
"C. W. P.",
""
],
[
"Tay",
"C. K.",
""
],
[
"Lu",
"C. W.",
""
]
] |
new_dataset
| 0.995526 |
0805.0879
|
EDA Publishing Association
|
Cheng-Chih Hsueh, Gou-Jen Wang, Shan-Hui Hsu, Huey-Shan Hung
|
Fabrication of Nanostructured PLGA Scaffolds Using Anodic Aluminum Oxide
Templates
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
PLGA (poly(lactic-co-glycolic acid)) is one of the most used biodegradable
and biocompatible materials. Nanostructured PLGA even has great application
potentials in tissue engineering. In this research, a fabrication technique for
nanostructured PLGA membrane was investigated and developed. In this novel
fabrication approach, an anodic aluminum oxide (AAO) film was use as the
template ; the PLGA solution was then cast on it ; the vacuum air-extraction
process was applied to transfer the nano porous pattern from the AAO membrane
to the PLGA membrane and form nanostures on it. The cell culture experiments of
the bovine endothelial cells demonstrated that the nanostructured PLGA membrane
can double the cell growing rate. Compared to the conventional chemical-etching
process, the physical fabrication method proposed in this research not only is
simpler but also does not alter the characteristics of the PLGA. The
nanostructure of the PLGA membrane can be well controlled by the AAO temperate.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:04:13 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Hsueh",
"Cheng-Chih",
""
],
[
"Wang",
"Gou-Jen",
""
],
[
"Hsu",
"Shan-Hui",
""
],
[
"Hung",
"Huey-Shan",
""
]
] |
new_dataset
| 0.995575 |
0805.0883
|
EDA Publishing Association
|
H. Yang, T.-H. Tsai, C.-C. Hu
|
Portable Valve-less Peristaltic Micro-pump Design and Fabrication
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper is to describe a design and fabrication method for a valve-less
peristaltic micro-pump. The valve-less peristaltic micro-pump with three
membrane chambers in a serial is actuated by three piezoelectric (PZT)
actuators. With the fluidic flow design, liquid in the flow channel is pumped
to a constant flow speed ranged from 0.4 to 0.48 mm/s. In term of the maximum
flow rate of the micro-pump is about 365 mircoliters/min, when the applied
voltage is 24V and frequency 50 Hz. Photolithography process was used to
fabricate the micro-pump mold. PDMS molding and PDMS bonding method were used
to fabricate the micro-channel and actuator chambers. A portable drive
controller was designed to control three PZT actuators in a proper sequence to
drive the chamber membrane. Then, all parts were integrated into the portable
valve-less peristaltic micro-pump system.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:07:22 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Yang",
"H.",
""
],
[
"Tsai",
"T. -H.",
""
],
[
"Hu",
"C. -C.",
""
]
] |
new_dataset
| 0.993392 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.