id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0506089 | Field geology with a wearable computer: 1st results of the Cyborg
Astrobiologist System | cs.CV astro-ph cs.AI cs.CE cs.HC cs.RO | We present results from the first geological field tests of the `Cyborg
Astrobiologist', which is a wearable computer and video camcorder system that
we are using to test and train a computer-vision system towards having some of
the autonomous decision-making capabilities of a field-geologist. The Cyborg
Astrobiologi... |
cs/0506091 | A New Construction for LDPC Codes using Permutation Polynomials over
Integer Rings | cs.IT math.IT | A new construction is proposed for low density parity check (LDPC) codes
using quadratic permutation polynomials over finite integer rings. The
associated graphs for the new codes have both algebraic and pseudo-random
nature, and the new codes are quasi-cyclic. Graph isomorphisms and
automorphisms are identified and ... |
cs/0506092 | Emergent Statistical Wealth Distributions in Simple Monetary Exchange
Models: A Critical Review | cs.MA | This paper reviews recent attempts at modelling inequality of wealth as an
emergent phenomenon of interacting-agent processes. We point out that recent
models of wealth condensation which draw their inspiration from molecular
dynamics have, in fact, reinvented a process introduced quite some time ago by
Angle (1986) ... |
cs/0506093 | On Maximum Contention-Free Interleavers and Permutation Polynomials over
Integer Rings | cs.IT math.IT | An interleaver is a critical component for the channel coding performance of
turbo codes. Algebraic constructions are of particular interest because they
admit analytical designs and simple, practical hardware implementation.
Contention-free interleavers have been recently shown to be suitable for
parallel decoding o... |
cs/0506094 | Universal Codes as a Basis for Nonparametric Testing of Serial
Independence for Time Series | cs.IT math.IT | We consider a stationary and ergodic source $p$ generated symbols $x_1 ...
x_t$ from some finite set $A$ and a null hypothesis $H_0$ that $p$ is Markovian
source with memory (or connectivity) not larger than $m, (m >= 0).$ The
alternative hypothesis $H_1$ is that the sequence is generated by a stationary
and ergodic ... |
cs/0506095 | Deriving a Stationary Dynamic Bayesian Network from a Logic Program with
Recursive Loops | cs.AI cs.LG cs.LO | Recursive loops in a logic program present a challenging problem to the PLP
framework. On the one hand, they loop forever so that the PLP backward-chaining
inferences would never stop. On the other hand, they generate cyclic
influences, which are disallowed in Bayesian networks. Therefore, in existing
PLP approaches ... |
cs/0506101 | Efficient Multiclass Implementations of L1-Regularized Maximum Entropy | cs.LG cs.CL | This paper discusses the application of L1-regularized maximum entropy
modeling or SL1-Max [9] to multiclass categorization problems. A new
modification to the SL1-Max fast sequential learning algorithm is proposed to
handle conditional distributions. Furthermore, unlike most previous studies,
the present research go... |
cs/0506102 | On $m$-dimensional toric codes | cs.IT math.AC math.AG math.IT | Toric codes are a class of $m$-dimensional cyclic codes introduced recently
by J. Hansen. They may be defined as evaluation codes obtained from monomials
corresponding to integer lattice points in an integral convex polytope $P
\subseteq \R^m$. As such, they are in a sense a natural extension of
Reed-Solomon codes. S... |
cs/0507001 | Asymptotically Optimal Tree-based Group Key Management Schemes | cs.IT cs.CR math.IT | In key management schemes that realize secure multicast communications
encrypted by group keys on a public network, tree structures are often used to
update the group keys efficiently. Selcuk and Sidhu have proposed an efficient
scheme which updates dynamically the tree structures based on the withdrawal
probabilitie... |
cs/0507002 | The Three Node Wireless Network: Achievable Rates and Cooperation
Strategies | cs.IT math.IT | We consider a wireless network composed of three nodes and limited by the
half-duplex and total power constraints. This formulation encompasses many of
the special cases studied in the literature and allows for capturing the common
features shared by them. Here, we focus on three special cases, namely 1) Relay
Channe... |
cs/0507004 | An End-to-End Probabilistic Network Calculus with Moment Generating
Functions | cs.IT cs.PF math.IT | Network calculus is a min-plus system theory for performance evaluation of
queuing networks. Its elegance stems from intuitive convolution formulas for
concatenation of deterministic servers. Recent research dispenses with the
worst-case assumptions of network calculus to develop a probabilistic
equivalent that benef... |
cs/0507005 | A Genetic Algorithm Based Finger Selection Scheme for UWB MMSE Rake
Receivers | cs.IT math.IT | Due to a large number of multipath components in a typical ultra wideband
(UWB) system, selective Rake (SRake) receivers, which combine energy from a
subset of multipath components, are commonly employed. In order to optimize
system performance, an optimal selection of multipath components to be employed
at fingers o... |
cs/0507006 | A Two-Step Time of Arrival Estimation Algorithm for Impulse Radio Ultra
Wideband Systems | cs.IT math.IT | High time resolution of ultra wideband (UWB) signals facilitates very precise
positioning capabilities based on time-of-arrival (TOA) measurements. Although
the theoretical lower bound for TOA estimation can be achieved by the maximum
likelihood principle, it is impractical due to the need for extremely high-rate
sam... |
cs/0507010 | A Study for the Feature Core of Dynamic Reduct | cs.AI | To the reduct problems of decision system, the paper proposes the notion of
dynamic core according to the dynamic reduct model. It describes various formal
definitions of dynamic core, and discusses some properties about dynamic core.
All of these show that dynamic core possesses the essential characters of the
featu... |
cs/0507011 | A Utility-Based Approach to Power Control and Receiver Design in
Wireless Data Networks | cs.IT math.IT | In this work, the cross-layer design problem of joint multiuser detection and
power control is studied using a game-theoretic approach. The uplink of a
direct-sequence code division multiple access (DS-CDMA) data network is
considered and a non-cooperative game is proposed in which users in the network
are allowed to... |
cs/0507015 | Duality between Packings and Coverings of the Hamming Space | cs.IT cs.DM math.IT | We investigate the packing and covering densities of linear and nonlinear
binary codes, and establish a number of duality relationships between the
packing and covering problems. Specifically, we prove that if almost all codes
(in the class of linear or nonlinear codes) are good packings, then only a
vanishing fracti... |
cs/0507018 | Optimal and Suboptimal Detection of Gaussian Signals in Noise:
Asymptotic Relative Efficiency | cs.IT math.IT | The performance of Bayesian detection of Gaussian signals using noisy
observations is investigated via the error exponent for the average error
probability. Under unknown signal correlation structure or limited processing
capability it is reasonable to use the simple quadratic detector that is
optimal in the case of ... |
cs/0507022 | On Hilberg's Law and Its Links with Guiraud's Law | cs.CL cs.IT math.IT | Hilberg (1990) supposed that finite-order excess entropy of a random human
text is proportional to the square root of the text length. Assuming that
Hilberg's hypothesis is true, we derive Guiraud's law, which states that the
number of word types in a text is greater than proportional to the square root
of the text l... |
cs/0507023 | Two-dimensional cellular automata and the analysis of correlated time
series | cs.AI | Correlated time series are time series that, by virtue of the underlying
process to which they refer, are expected to influence each other strongly. We
introduce a novel approach to handle such time series, one that models their
interaction as a two-dimensional cellular automaton and therefore allows them
to be treat... |
cs/0507024 | Experiments in Clustering Homogeneous XML Documents to Validate an
Existing Typology | cs.IR | This paper presents some experiments in clustering homogeneous XMLdocuments
to validate an existing classification or more generally anorganisational
structure. Our approach integrates techniques for extracting knowledge from
documents with unsupervised classification (clustering) of documents. We focus
on the featur... |
cs/0507025 | Comparison of Resampling Schemes for Particle Filtering | cs.CE | This contribution is devoted to the comparison of various resampling
approaches that have been proposed in the literature on particle filtering. It
is first shown using simple arguments that the so-called residual and
stratified methods do yield an improvement over the basic multinomial
resampling approach. A simple ... |
cs/0507026 | Hard Problems of Algebraic Geometry Codes | cs.IT math.IT | The minimum distance is one of the most important combinatorial
characterizations of a code. The maximum likelihood decoding problem is one of
the most important algorithmic problems of a code. While these problems are
known to be hard for general linear codes, the techniques used to prove their
hardness often rely o... |
cs/0507027 | Anyone but Him: The Complexity of Precluding an Alternative | cs.GT cs.CC cs.MA | Preference aggregation in a multiagent setting is a central issue in both
human and computer contexts. In this paper, we study in terms of complexity the
vulnerability of preference aggregation to destructive control. That is, we
study the ability of an election's chair to, through such mechanisms as
voter/candidate ... |
cs/0507029 | ATNoSFERES revisited | cs.AI | ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which
the rules are represented as edges of an Augmented Transition Network.
Genotypes are strings of tokens of a stack-based language, whose execution
builds the labeled graph. The original ATNoSFERES, using a bitstring to
represent the language to... |
cs/0507031 | The error-floor of LDPC codes in the Laplacian channel | cs.IT cond-mat.dis-nn math.IT | We analyze the performance of Low-Density-Parity-Check codes in the
error-floor domain where the Signal-to-Noise-Ratio, s, is large, s >> 1. We
describe how the instanton method of theoretical physics, recently adapted to
coding theory, solves the problem of characterizing the error-floor domain in
the Laplacian chan... |
cs/0507032 | Introduction to Quantum Message Space | cs.IT math.IT math.OA quant-ph | This paper develops the quantum analog of the message ensemble of classical
information theory as developed by Shannon and Khinchin. The principal
mathematical tool is harmonic analysis on the free group with two generators.
|
cs/0507033 | Multiresolution Kernels | cs.LG | We present in this work a new methodology to design kernels on data which is
structured with smaller components, such as text, images or sequences. This
methodology is a template procedure which can be applied on most kernels on
measures and takes advantage of a more detailed "bag of components"
representation of the... |
cs/0507035 | Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms | cs.LO cs.AI | Global SLS-resolution is a well-known procedural semantics for top-down
computation of queries under the well-founded model. It inherits from
SLDNF-resolution the {\em linearity} property of derivations, which makes it
easy and efficient to implement using a simple stack-based memory structure.
However, like SLDNF-re... |
cs/0507039 | Distributed Regression in Sensor Networks: Training Distributively with
Alternating Projections | cs.LG cs.AI cs.CV cs.DC cs.IT math.IT | Wireless sensor networks (WSNs) have attracted considerable attention in
recent years and motivate a host of new challenges for distributed signal
processing. The problem of distributed or decentralized estimation has often
been considered in the context of parametric models. However, the success of
parametric method... |
cs/0507040 | Pattern Recognition for Conditionally Independent Data | cs.LG cs.AI cs.CV | In this work we consider the task of relaxing the i.i.d assumption in pattern
recognition (or classification), aiming to make existing learning algorithms
applicable to a wider range of tasks. Pattern recognition is guessing a
discrete label of some object based on a set of given examples (pairs of
objects and labels... |
cs/0507041 | Monotone Conditional Complexity Bounds on Future Prediction Errors | cs.LG cs.AI cs.IT math.IT | We bound the future loss when predicting any (computably) stochastic sequence
online. Solomonoff finitely bounded the total deviation of his universal
predictor M from the true distribution m by the algorithmic complexity of m.
Here we assume we are at a time t>1 and already observed x=x_1...x_t. We bound
the future ... |
cs/0507042 | The MammoGrid Virtual Organisation - Federating Distributed Mammograms | cs.DC cs.DB | The MammoGrid project aims to deliver a prototype which enables the effective
collaboration between radiologists using grid, service-orientation and database
solutions. The grid technologies and service-based database management solution
provide the platform for integrating diverse and distributed resources,
creating... |
cs/0507044 | Defensive Universal Learning with Experts | cs.LG | This paper shows how universal learning can be achieved with expert advice.
To this aim, we specify an experts algorithm with the following
characteristics: (a) it uses only feedback from the actions actually chosen
(bandit setup), (b) it can be applied with countably infinite expert classes,
and (c) it copes with lo... |
cs/0507045 | In the beginning was game semantics | cs.LO cs.AI math.LO | This article presents an overview of computability logic -- the
game-semantically constructed logic of interactive computational tasks and
resources. There is only one non-overview, technical section in it, devoted to
a proof of the soundness of affine logic with respect to the semantics of
computability logic. A com... |
cs/0507048 | Redundancy in Logic III: Non-Mononotonic Reasoning | cs.LO cs.AI cs.CC | Results about the redundancy of circumscriptive and default theories are
presented. In particular, the complexity of establishing whether a given theory
is redundant is establihsed.
|
cs/0507053 | Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku | cs.DS cs.AI | We provide a simple linear time transformation from a directed or undirected
graph with labeled edges to an unlabeled digraph, such that paths in the input
graph in which no two consecutive edges have the same label correspond to paths
in the transformed graph and vice versa. Using this transformation, we provide
eff... |
cs/0507055 | ReacProc: A Tool to Process Reactions Describing Particle Interactions | cs.CE | ReacProc is a program written in C/C++ programming language which can be used
(1) to check out of reactions describing particles interactions against
conservation laws and (2) to reduce input reaction into some canonical form. A
table with particles properties is available within ReacProc package.
|
cs/0507056 | Explorations in engagement for humans and robots | cs.AI cs.CL cs.RO | This paper explores the concept of engagement, the process by which
individuals in an interaction start, maintain and end their perceived
connection to one another. The paper reports on one aspect of engagement among
human interactors--the effect of tracking faces during an interaction. It also
describes the architec... |
cs/0507058 | Paving the Way for Image Understanding: A New Kind of Image
Decomposition is Desired | cs.CV | In this paper we present an unconventional image segmentation approach which
is devised to meet the requirements of image understanding and pattern
recognition tasks. Generally image understanding assumes interplay of two
sub-processes: image information content discovery and image information
content interpretation.... |
cs/0507059 | Data complexity of answering conjunctive queries over SHIQ knowledge
bases | cs.LO cs.AI cs.CC | An algorithm for answering conjunctive queries over SHIQ knowledge bases that
is coNP in data complexity is given. The algorithm is based on the tableau
algorithm for reasoning with individuals in SHIQ. The blocking conditions of
the tableau are weakened in such a way that the set of models the modified
algorithm yie... |
cs/0507060 | The Entropy of a Binary Hidden Markov Process | cs.IT cond-mat.stat-mech math.IT math.ST stat.TH | The entropy of a binary symmetric Hidden Markov Process is calculated as an
expansion in the noise parameter epsilon. We map the problem onto a
one-dimensional Ising model in a large field of random signs and calculate the
expansion coefficients up to second order in epsilon. Using a conjecture we
extend the calculat... |
cs/0507062 | FPL Analysis for Adaptive Bandits | cs.LG | A main problem of "Follow the Perturbed Leader" strategies for online
decision problems is that regret bounds are typically proven against oblivious
adversary. In partial observation cases, it was not clear how to obtain
performance guarantees against adaptive adversary, without worsening the
bounds. We propose a con... |
cs/0507065 | A Fast Greedy Algorithm for Outlier Mining | cs.DB cs.AI | The task of outlier detection is to find small groups of data objects that
are exceptional when compared with rest large amount of data. In [38], the
problem of outlier detection in categorical data is defined as an optimization
problem and a local-search heuristic based algorithm (LSA) is presented.
However, as is t... |
cs/0507067 | Conjunctive Query Containment and Answering under Description Logics
Constraints | cs.DB cs.AI | Query containment and query answering are two important computational tasks
in databases. While query answering amounts to compute the result of a query
over a database, query containment is the problem of checking whether for every
database, the result of one query is a subset of the result of another query.
In th... |
cs/0507068 | On parity check collections for iterative erasure decoding that correct
all correctable erasure patterns of a given size | cs.IT cs.DM math.IT | Recently there has been interest in the construction of small parity check
sets for iterative decoding of the Hamming code with the property that each
uncorrectable (or stopping) set of size three is the support of a codeword and
hence uncorrectable anyway. Here we reformulate and generalise the problem, and
improve ... |
cs/0507069 | Users and Assessors in the Context of INEX: Are Relevance Dimensions
Relevant? | cs.IR | The main aspects of XML retrieval are identified by analysing and comparing
the following two behaviours: the behaviour of the assessor when judging the
relevance of returned document components; and the behaviour of users when
interacting with components of XML documents. We argue that the two INEX
relevance dimensi... |
cs/0507070 | Hybrid XML Retrieval: Combining Information Retrieval and a Native XML
Database | cs.IR | This paper investigates the impact of three approaches to XML retrieval:
using Zettair, a full-text information retrieval system; using eXist, a native
XML database; and using a hybrid system that takes full article answers from
Zettair and uses eXist to extract elements from those articles. For the
content-only topi... |
cs/0508001 | Dimensions of Copeland-Erdos Sequences | cs.CC cs.IT math.IT | The base-$k$ {\em Copeland-Erd\"os sequence} given by an infinite set $A$ of
positive integers is the infinite sequence $\CE_k(A)$ formed by concatenating
the base-$k$ representations of the elements of $A$ in numerical order. This
paper concerns the following four quantities.
The {\em finite-state dimension} $\dim... |
cs/0508007 | Regularity of Position Sequences | cs.CV cs.AI cs.LG q-bio.NC | A person is given a numbered sequence of positions on a sheet of paper. The
person is asked, "Which will be the next (or the next after that) position?"
Everyone has an opinion as to how he or she would proceed. There are regular
sequences for which there is general agreement on how to continue. However,
there are le... |
cs/0508008 | The accurate optimal-success/error-rate calculations applied to the
realizations of the reliable and short-period integer ambiguity resolution in
carrier-phase GPS/GNSS positioning | cs.IT math.IT | The maximum-marginal-a-posteriori success rate of statistical decision under
multivariate Gaussian error distribution on an integer lattice is almost
rigorously calculated by using union-bound approximation and Monte Carlo
integration. These calculations are applied to the revelation of the various
possible realizati... |
cs/0508012 | n-Channel Asymmetric Multiple-Description Lattice Vector Quantization | cs.IT math.IT | We present analytical expressions for optimal entropy-constrained
multiple-description lattice vector quantizers which, under high-resolutions
assumptions, minimize the expected distortion for given packet-loss
probabilities. We consider the asymmetric case where packet-loss probabilities
and side entropies are allow... |
cs/0508013 | Relations between the Local Weight Distributions of a Linear Block Code,
Its Extended Code, and Its Even Weight Subcode | cs.IT math.IT | Relations between the local weight distributions of a binary linear code, its
extended code, and its even weight subcode are presented. In particular, for a
code of which the extended code is transitive invariant and contains only
codewords with weight multiples of four, the local weight distribution can be
obtained ... |
cs/0508014 | The Benefit of Thresholding in LP Decoding of LDPC Codes | cs.IT math.IT | Consider data transmission over a binary-input additive white Gaussian noise
channel using a binary low-density parity-check code. We ask the following
question: Given a decoder that takes log-likelihood ratios as input, does it
help to modify the log-likelihood ratios before decoding? If we use an optimal
decoder th... |
cs/0508015 | Chosen-ciphertext attack on noncommutative Polly Cracker | cs.IT cs.CR math.IT | We propose a chosen-ciphertext attack on recently presented noncommutative
variant of the well-known Polly Cracker cryptosystem. We show that if one
chooses parameters for this noncommutative Polly Cracker as initially proposed,
than the system should be claimed as insecure.
|
cs/0508017 | Enhancing Content-And-Structure Information Retrieval using a Native XML
Database | cs.IR | Three approaches to content-and-structure XML retrieval are analysed in this
paper: first by using Zettair, a full-text information retrieval system; second
by using eXist, a native XML database, and third by using a hybrid XML
retrieval system that uses eXist to produce the final answers from likely
relevant article... |
cs/0508018 | Spectral Factorization, Whitening- and Estimation Filter -- Stability,
Smoothness Properties and FIR Approximation Behavior | cs.IT math.IT | A Wiener filter can be interpreted as a cascade of a whitening- and an
estimation filter. This paper gives a detailed investigates of the properties
of these two filters. Then the practical consequences for the overall Wiener
filter are ascertained. It is shown that if the given spectral densities are
smooth (Hoelder... |
cs/0508019 | On the Minimal Pseudo-Codewords of Codes from Finite Geometries | cs.IT cs.DM math.IT | In order to understand the performance of a code under maximum-likelihood
(ML) decoding, it is crucial to know the minimal codewords. In the context of
linear programming (LP) decoding, it turns out to be necessary to know the
minimal pseudo-codewords. This paper studies the minimal codewords and minimal
pseudo-codew... |
cs/0508020 | Capacity Gain from Transmitter and Receiver Cooperation | cs.IT math.IT | Capacity gain from transmitter and receiver cooperation are compared in a
relay network where the cooperating nodes are close together. When all nodes
have equal average transmit power along with full channel state information
(CSI), it is proved that transmitter cooperation outperforms receiver
cooperation, whereas ... |
cs/0508022 | Matrix Construction Using Cyclic Shifts of a Column | cs.DM cs.CR cs.IT math.IT | This paper describes the synthesis of matrices with good correlation, from
cyclic shifts of pseudonoise columns. Optimum matrices result whenever the
shift sequence satisfies the constant difference property. Known shift
sequences with the constant (or almost constant) difference property are:
Quadratic (Polynomial) ... |
cs/0508023 | Software Libraries and Their Reuse: Entropy, Kolmogorov Complexity, and
Zipf's Law | cs.SE cs.IT cs.PL math.IT | We analyze software reuse from the perspective of information theory and
Kolmogorov complexity, assessing our ability to ``compress'' programs by
expressing them in terms of software components reused from libraries. A common
theme in the software reuse literature is that if we can only get the right
environment in p... |
cs/0508024 | New Codes for OFDM with Low PMEPR | cs.IT math.IT | In this paper new codes for orthogonal frequency-division multiplexing (OFDM)
with tightly controlled peak-to-mean envelope power ratio (PMEPR) are proposed.
We identify a new family of sequences occuring in complementary sets and show
that such sequences form subsets of a new generalization of the Reed--Muller
codes... |
cs/0508025 | Signature coding for OR channel with asynchronous access | cs.IT math.IT | Signature coding for multiple access OR channel is considered. We prove that
in block asynchronous case the upper bound on the minimum code length
asymptotically is the same as in the case of synchronous access.
|
cs/0508026 | Simple Maximum-Likelihood Decoding of Generalized First-order
Reed-Muller Codes | cs.IT math.IT | An efficient decoder for the generalized first-order Reed-Muller code
RM_q(1,m) is essential for the decoding of various block-coding schemes for
orthogonal frequency-division multiplexing with reduced peak-to-mean power
ratio. We present an efficient and simple maximum-likelihood decoding algorithm
for RM_q(1,m). It... |
cs/0508027 | Expectation maximization as message passing | cs.IT cs.LG math.IT | Based on prior work by Eckford, it is shown how expectation maximization (EM)
may be viewed, and used, as a message passing algorithm in factor graphs.
|
cs/0508028 | Truth-telling Reservations | cs.GT cond-mat.stat-mech cs.MA | We present a mechanism for reservations of bursty resources that is both
truthful and robust. It consists of option contracts whose pricing structure
induces users to reveal the true likelihoods that they will purchase a given
resource. Users are also allowed to adjust their options as their likelihood
changes. This ... |
cs/0508029 | Selfish vs. Unselfish Optimization of Network Creation | cs.NI cs.AR cs.MA | We investigate several variants of a network creation model: a group of
agents builds up a network between them while trying to keep the costs of this
network small. The cost function consists of two addends, namely (i) a constant
amount for each edge an agent buys and (ii) the minimum number of hops it takes
sending... |
cs/0508030 | Terminated LDPC Convolutional Codes with Thresholds Close to Capacity | cs.IT math.IT | An ensemble of LDPC convolutional codes with parity-check matrices composed
of permutation matrices is considered. The convergence of the iterative belief
propagation based decoder for terminated convolutional codes in the ensemble is
analyzed for binary-input output-symmetric memoryless channels using density
evolut... |
cs/0508031 | Capacity Theorems for Quantum Multiple Access Channels | cs.IT math.IT quant-ph | We consider quantum channels with two senders and one receiver. For an
arbitrary such channel, we give multi-letter characterizations of two different
two-dimensional capacity regions. The first region characterizes the rates at
which it is possible for one sender to send classical information while the
other sends q... |
cs/0508032 | Polymorphic Self-* Agents for Stigmergic Fault Mitigation in Large-Scale
Real-Time Embedded Systems | cs.AI cs.MA | Organization and coordination of agents within large-scale, complex,
distributed environments is one of the primary challenges in the field of
multi-agent systems. A lot of interest has surfaced recently around self-*
(self-organizing, self-managing, self-optimizing, self-protecting) agents. This
paper presents polym... |
cs/0508034 | Channel combining and splitting for cutoff rate improvement | cs.IT math.IT | The cutoff rate $R_0(W)$ of a discrete memoryless channel (DMC) $W$ is often
used as a figure of merit, alongside the channel capacity $C(W)$. Given a
channel $W$ consisting of two possibly correlated subchannels $W_1$, $W_2$, the
capacity function always satisfies $C(W_1)+C(W_2) \le C(W)$, while there are
examples f... |
cs/0508035 | Codes for error detection, good or not good | cs.IT math.IT | Linear codes for error detection on a q-ary symmetric channel are studied. It
is shown that for given dimension k and minimum distance d, there exists a
value \mu(d,k) such that if C is a code of length n >= \mu(d,k), then neither C
nor its dual are good for error detection. For d >> k or k << d good
approximations f... |
cs/0508036 | Exp\'{e}riences de classification d'une collection de documents XML de
structure homog\`{e}ne | cs.IR | This paper presents some experiments in clustering homogeneous XMLdocuments
to validate an existing classification or more generally anorganisational
structure. Our approach integrates techniques for extracting knowledge from
documents with unsupervised classification (clustering) of documents. We focus
on the featur... |
cs/0508039 | Tight Bounds on the Redundancy of Huffman Codes | cs.IT math.IT | In this paper we study the redundancy of Huffman codes. In particular, we
consider sources for which the probability of one of the source symbols is
known. We prove a conjecture of Ye and Yeung regarding the upper bound on the
redundancy of such Huffman codes, which yields in a tight upper bound. We also
derive a tig... |
cs/0508040 | Bounds on the Capacity of the Blockwise Noncoherent APSK-AWGN Channels | cs.IT math.IT | Capacity of M-ary Amplitude and Phase-Shift Keying(M-APSK) over an Additive
White Gaussian Noise(AWGN) channel that also introduces an unknown carrier
phase rotation is considered. The phase remains constant over a block of L
symbols and it is independent from block to block. Aiming to design codes with
equally proba... |
cs/0508043 | Sequential Predictions based on Algorithmic Complexity | cs.IT cs.LG math.IT | This paper studies sequence prediction based on the monotone Kolmogorov
complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is
extremely close to Solomonoff's universal prior M, the latter being an
excellent predictor in deterministic as well as probabilistic environments,
where performance is... |
cs/0508046 | Relaxation Bounds on the Minimum Pseudo-Weight of Linear Block Codes | cs.IT math.IT | Just as the Hamming weight spectrum of a linear block code sheds light on the
performance of a maximum likelihood decoder, the pseudo-weight spectrum
provides insight into the performance of a linear programming decoder. Using
properties of polyhedral cones, we find the pseudo-weight spectrum of some
short codes. We ... |
cs/0508047 | Further Results on Coding for Reliable Communication over Packet
Networks | cs.IT cs.NI math.IT | In "On Coding for Reliable Communication over Packet Networks" (Lun, Medard,
and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and
Computing, 2004), a capacity-achieving coding scheme for unicast or multicast
over lossy wireline or wireless packet networks is presented. We extend that
paper's result... |
cs/0508049 | Characterizations of Pseudo-Codewords of LDPC Codes | cs.IT cs.DM math.IT | An important property of high-performance, low complexity codes is the
existence of highly efficient algorithms for their decoding. Many of the most
efficient, recent graph-based algorithms, e.g. message passing algorithms and
decoding based on linear programming, crucially depend on the efficient
representation of a... |
cs/0508050 | Duality between channel capacity and rate distortion with two-sided
state information | cs.IT math.IT | We show that the duality between channel capacity and data compression is
retained when state information is available to the sender, to the receiver, to
both, or to neither. We present a unified theory for eight special cases of
channel capacity and rate distortion with state information, which also extends
existing... |
cs/0508051 | Trellis-Based Equalization for Sparse ISI Channels Revisited | cs.IT math.IT | Sparse intersymbol-interference (ISI) channels are encountered in a variety
of high-data-rate communication systems. Such channels have a large channel
memory length, but only a small number of significant channel coefficients. In
this paper, trellis-based equalization of sparse ISI channels is revisited. Due
to the ... |
cs/0508053 | Measuring Semantic Similarity by Latent Relational Analysis | cs.LG cs.CL cs.IR | This paper introduces Latent Relational Analysis (LRA), a method for
measuring semantic similarity. LRA measures similarity in the semantic
relations between two pairs of words. When two pairs have a high degree of
relational similarity, they are analogous. For example, the pair cat:meow is
analogous to the pair dog:... |
cs/0508054 | Sensing Capacity for Markov Random Fields | cs.IT math.IT | This paper computes the sensing capacity of a sensor network, with sensors of
limited range, sensing a two-dimensional Markov random field, by modeling the
sensing operation as an encoder. Sensor observations are dependent across
sensors, and the sensor network output across different states of the
environment is nei... |
cs/0508055 | DNA Codes that Avoid Secondary Structures | cs.DM cs.IT math.IT | In this paper, we consider the problem of designing DNA sequences (codewords)
for DNA storage systems and DNA computing that are unlikely to fold back onto
themselves to form undesirable secondary structures. The paper addresses both
the issue of enumerating the sequences with such properties and the problem of
pract... |
cs/0508056 | Very Simple Chaitin Machines for Concrete AIT | cs.IT math.IT | In 1975, Chaitin introduced his celebrated Omega number, the halting
probability of a universal Chaitin machine, a universal Turing machine with a
prefix-free domain. The Omega number's bits are {\em algorithmically
random}--there is no reason the bits should be the way they are, if we define
``reason'' to be a compu... |
cs/0508057 | On the Performance of Turbo Codes in Quasi-Static Fading Channels | cs.IT math.IT | In this paper, we investigate in detail the performance of turbo codes in
quasi-static fading channels both with and without antenna diversity. First, we
develop a simple and accurate analytic technique to evaluate the performance of
turbo codes in quasi-static fading channels. The proposed analytic technique
relates... |
cs/0508058 | Entropy coding with Variable Length Re-writing Systems | cs.IT math.IT | This paper describes a new set of block source codes well suited for data
compression. These codes are defined by sets of productions rules of the form
a.l->b, where a in A represents a value from the source alphabet A and l, b are
-small- sequences of bits. These codes naturally encompass other Variable
Length Codes... |
cs/0508060 | Algorithms for Discrete Denoising Under Channel Uncertainty | cs.IT math.IT | The goal of a denoising algorithm is to reconstruct a signal from its
noise-corrupted observations. Perfect reconstruction is seldom possible and
performance is measured under a given fidelity criterion. In a recent work, the
authors addressed the problem of denoising unknown discrete signals corrupted
by a discrete ... |
cs/0508062 | Decoding of Expander Codes at Rates Close to Capacity | cs.IT math.IT | The decoding error probability of codes is studied as a function of their
block length. It is shown that the existence of codes with a polynomially small
decoding error probability implies the existence of codes with an exponentially
small decoding error probability. Specifically, it is assumed that there exists
a fa... |
cs/0508064 | Layered Orthogonal Lattice Detector for Two Transmit Antenna
Communications | cs.IT math.IT | A novel detector for multiple-input multiple-output (MIMO) communications is
presented. The algorithm belongs to the class of the lattice detectors, i.e. it
finds a reduced complexity solution to the problem of finding the closest
vector to the received observations. The algorithm achieves optimal
maximum-likelihood ... |
cs/0508066 | Can Small Museums Develop Compelling, Educational and Accessible Web
Resources? The Case of Accademia Carrara | cs.MM cs.CY cs.DL cs.IR | Due to the lack of budget, competence, personnel and time, small museums are
often unable to develop compelling, educational and accessible web resources
for their permanent collections or temporary exhibitions. In an attempt to
prove that investing in these types of resources can be very fruitful even for
small inst... |
cs/0508068 | Lossy source encoding via message-passing and decimation over
generalized codewords of LDGM codes | cs.IT cs.AI math.IT | We describe message-passing and decimation approaches for lossy source coding
using low-density generator matrix (LDGM) codes. In particular, this paper
addresses the problem of encoding a Bernoulli(0.5) source: for randomly
generated LDGM codes with suitably irregular degree distributions, our methods
yield performa... |
cs/0508070 | MAP estimation via agreement on (hyper)trees: Message-passing and linear
programming | cs.IT cs.AI math.IT | We develop and analyze methods for computing provably optimal {\em maximum a
posteriori} (MAP) configurations for a subclass of Markov random fields defined
on graphs with cycles. By decomposing the original distribution into a convex
combination of tree-structured distributions, we obtain an upper bound on the
optim... |
cs/0508072 | On Achievable Rates and Complexity of LDPC Codes for Parallel Channels
with Application to Puncturing | cs.IT math.IT | This paper considers the achievable rates and decoding complexity of
low-density parity-check (LDPC) codes over statistically independent parallel
channels. The paper starts with the derivation of bounds on the conditional
entropy of the transmitted codeword given the received sequence at the output
of the parallel c... |
cs/0508073 | Universal Learning of Repeated Matrix Games | cs.LG cs.AI | We study and compare the learning dynamics of two universal learning
algorithms, one based on Bayesian learning and the other on prediction with
expert advice. Both approaches have strong asymptotic performance guarantees.
When confronted with the task of finding good long-term strategies in repeated
2x2 matrix games... |
cs/0508074 | Throughput and Delay in Random Wireless Networks with Restricted
Mobility | cs.IT cs.NI math.IT | Grossglauser and Tse (2001) introduced a mobile random network model where
each node moves independently on a unit disk according to a stationary uniform
distribution and showed that a throughput of $\Theta(1)$ is achievable. El
Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay associated with
this throu... |
cs/0508075 | Complexity of Networks | cs.IT math.IT | Network or graph structures are ubiquitous in the study of complex systems.
Often, we are interested in complexity trends of these system as it evolves
under some dynamic. An example might be looking at the complexity of a food web
as species enter an ecosystem via migration or speciation, and leave via
extinction.
... |
cs/0508076 | Myopic Coding in Multiple Relay Channels | cs.IT math.IT | In this paper, we investigate achievable rates for data transmission from
sources to sinks through multiple relay networks. We consider myopic coding, a
constrained communication strategy in which each node has only a local view of
the network, meaning that nodes can only transmit to and decode from
neighboring nodes... |
cs/0508077 | Families of unitary matrices achieving full diversity | cs.IT math.IT | This paper presents an algebraic construction of families of unitary matrices
that achieve full diversity. They are obtained as subsets of cyclic division
algebras.
|
cs/0508083 | A General Framework for Codes Involving Redundancy Minimization | cs.IT cs.DS math.IT | A framework with two scalar parameters is introduced for various problems of
finding a prefix code minimizing a coding penalty function. The framework
encompasses problems previously proposed by Huffman, Campbell, Nath, and Drmota
and Szpankowski, shedding light on the relationships among these problems. In
particula... |
cs/0508084 | Source Coding for Quasiarithmetic Penalties | cs.IT cs.DS math.IT | Huffman coding finds a prefix code that minimizes mean codeword length for a
given probability distribution over a finite number of items. Campbell
generalized the Huffman problem to a family of problems in which the goal is to
minimize not mean codeword length but rather a generalized mean known as a
quasiarithmetic... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.