id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0601060 | Robot Swarms in an Uncertain World: Controllable Adaptability | cs.RO | There is a belief that complexity and chaos are essential for adaptability.
But life deals with complexity every moment, without the chaos that engineers
fear so, by invoking goal-directed behaviour. Goals can be programmed. That is
why living organisms give us hope to achieve adaptability in robots. In this
paper a ... |
cs/0601061 | Modular Adaptive System Based on a Multi-Stage Neural Structure for
Recognition of 2D Objects of Discontinuous Production | cs.RO | This is a presentation of a new system for invariant recognition of 2D
objects with overlapping classes, that can not be effectively recognized with
the traditional methods. The translation, scale and partial rotation invariant
contour object description is transformed in a DCT spectrum space. The obtained
frequency ... |
cs/0601062 | Study of Self-Organization Model of Multiple Mobile Robot | cs.RO | A good organization model of multiple mobile robot should be able to improve
the efficiency of the system, reduce the complication of robot interactions,
and detract the difficulty of computation. From the sociology aspect of
topology, structure and organization, this paper studies the multiple mobile
robot organizat... |
cs/0601063 | Optimal Point-to-Point Trajectory Tracking of Redundant Manipulators
using Generalized Pattern Search | cs.RO | Optimal point-to-point trajectory planning for planar redundant manipulator
is considered in this study. The main objective is to minimize the sum of the
position error of the end-effector at each intermediate point along the
trajectory so that the end-effector can track the prescribed trajectory
accurately. An algor... |
cs/0601064 | Robotics Vision-based Heuristic Reasoning for Underwater Target Tracking
and Navigation | cs.RO | This paper presents a robotics vision-based heuristic reasoning system for
underwater target tracking and navigation. This system is introduced to improve
the level of automation of underwater Remote Operated Vehicles (ROVs)
operations. A prototype which combines computer vision with an underwater
robotics system is ... |
cs/0601065 | New Intelligent Transmission Concept for Hybrid Mobile Robot Speed
Control | cs.RO | This paper presents a new concept of a mobile robot speed control by using
two degree of freedom gear transmission. The developed intelligent speed
controller utilizes a gear box which comprises of epicyclic gear train with two
inputs, one coupled with the engine shaft and another with the shaft of a
variable speed d... |
cs/0601066 | On the Existence of Universally Decodable Matrices | cs.IT cs.DM math.IT | Universally decodable matrices (UDMs) can be used for coding purposes when
transmitting over slow fading channels. These matrices are parameterized by
positive integers $L$ and $N$ and a prime power $q$. The main result of this
paper is that the simple condition $L \leq q+1$ is both necessary and
sufficient for $(L,N... |
cs/0601067 | Design of Rate-Compatible Serially Concatenated Convolutional Codes | cs.IT math.IT | Recently a powerful class of rate-compatible serially concatenated
convolutional codes (SCCCs) have been proposed based on minimizing analytical
upper bounds on the error probability in the error floor region. Here this
class of codes is further investigated by combining analytical upper bounds
with extrinsic informa... |
cs/0601070 | Instanton analysis of Low-Density-Parity-Check codes in the error-floor
regime | cs.IT cond-mat.dis-nn math.IT | In this paper we develop instanton method introduced in [1], [2], [3] to
analyze quantitatively performance of Low-Density-Parity-Check (LDPC) codes
decoded iteratively in the so-called error-floor regime. We discuss statistical
properties of the numerical instanton-amoeba scheme focusing on detailed
analysis and com... |
cs/0601072 | Fast Frequent Querying with Lazy Control Flow Compilation | cs.PL cs.AI cs.SE | Control flow compilation is a hybrid between classical WAM compilation and
meta-call, limited to the compilation of non-recursive clause bodies. This
approach is used successfully for the execution of dynamically generated
queries in an inductive logic programming setting (ILP). Control flow
compilation reduces compi... |
cs/0601073 | A Theory of Routing for Large-Scale Wireless Ad-Hoc Networks | cs.IT cs.NI math.IT | In this work we develop a new theory to analyse the process of routing in
large-scale ad-hoc wireless networks. We use a path integral formulation to
examine the properties of the paths generated by different routing strategies
in these kinds of networks. Using this theoretical framework, we calculate the
statistical... |
cs/0601074 | Joint universal lossy coding and identification of i.i.d. vector sources | cs.IT cs.LG math.IT | The problem of joint universal source coding and modeling, addressed by
Rissanen in the context of lossless codes, is generalized to fixed-rate lossy
coding of continuous-alphabet memoryless sources. We show that, for bounded
distortion measures, any compactly parametrized family of i.i.d. real vector
sources with ab... |
cs/0601075 | On Universally Decodable Matrices for Space-Time Coding | cs.IT cs.DM math.IT | The notion of universally decodable matrices (UDMs) was recently introduced
by Tavildar and Viswanath while studying slow fading channels. It turns out
that the problem of constructing UDMs is tightly connected to the problem of
constructing maximum distance separable (MDS) codes. In this paper, we first
study the pr... |
cs/0601077 | IDBE - An Intelligent Dictionary Based Encoding Algorithm for Text Data
Compression for High Speed Data Transmission Over Internet | cs.IT math.IT | Compression algorithms reduce the redundancy in data representation to
decrease the storage required for that data. Data compression offers an
attractive approach to reducing communication costs by using available
bandwidth effectively. Over the last decade there has been an unprecedented
explosion in the amount of d... |
cs/0601080 | On Measure Theoretic definitions of Generalized Information Measures and
Maximum Entropy Prescriptions | cs.IT math.IT | Though Shannon entropy of a probability measure $P$, defined as $- \int_{X}
\frac{\ud P}{\ud \mu} \ln \frac{\ud P}{\ud\mu} \ud \mu$ on a measure space $(X,
\mathfrak{M},\mu)$, does not qualify itself as an information measure (it is
not a natural extension of the discrete case), maximum entropy (ME)
prescriptions in ... |
cs/0601081 | An O(1) Solution to the Prefix Sum Problem on a Specialized Memory
Architecture | cs.DS cs.CC cs.IR | In this paper we study the Prefix Sum problem introduced by Fredman.
We show that it is possible to perform both update and retrieval in O(1) time
simultaneously under a memory model in which individual bits may be shared by
several words.
We also show that two variants (generalizations) of the problem can be sol... |
cs/0601083 | Multilevel Coding for Channels with Non-uniform Inputs and Rateless
Transmission over the BSC | cs.IT math.IT | We consider coding schemes for channels with non-uniform inputs (NUI), where
standard linear block codes can not be applied directly. We show that
multilevel coding (MLC) with a set of linear codes and a deterministic mapper
can achieve the information rate of the channel with NUI. The mapper, however,
does not have ... |
cs/0601087 | Processing of Test Matrices with Guessing Correction | cs.LG | It is suggested to insert into test matrix 1s for correct responses, 0s for
response refusals, and negative corrective elements for incorrect responses.
With the classical test theory approach test scores of examinees and items are
calculated traditionally as sums of matrix elements, organized in rows and
columns. Co... |
cs/0601088 | An Algorithm for Constructing All Families of Codes of Arbitrary
Requirement in an OCDMA System | cs.IT math.IT | A novel code construction algorithm is presented to find all the possible
code families for code reconfiguration in an OCDMA system. The algorithm is
developed through searching all the complete subgraphs of a constructed graph.
The proposed algorithm is flexible and practical for constructing optical
orthogonal code... |
cs/0601089 | Distributed Kernel Regression: An Algorithm for Training Collaboratively | cs.LG cs.AI cs.DC cs.IT math.IT | This paper addresses the problem of distributed learning under communication
constraints, motivated by distributed signal processing in wireless sensor
networks and data mining with distributed databases. After formalizing a
general model for distributed learning, an algorithm for collaboratively
training regularized... |
cs/0601090 | Improved Nearly-MDS Expander Codes | cs.IT math.IT | A construction of expander codes is presented with the following three
properties:
(i) the codes lie close to the Singleton bound, (ii) they can be encoded in
time complexity that is linear in their code length, and (iii) they have a
linear-time bounded-distance decoder.
By using a version of the decoder that cor... |
cs/0601091 | Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction | cs.IT math.IT | A simple scheme for communication over MIMO broadcast channels is introduced
which adopts the lattice reduction technique to improve the naive channel
inversion method. Lattice basis reduction helps us to reduce the average
transmitted energy by modifying the region which includes the constellation
points. Simulation... |
cs/0601092 | LLL Reduction Achieves the Receive Diversity in MIMO Decoding | cs.IT math.IT | Diversity order is an important measure for the performance of communication
systems over MIMO fading channels. In this paper, we prove that in MIMO
multiple access systems (or MIMO point-to-point systems with V-BLAST
transmission), lattice-reduction-aided decoding achieves the maximum receive
diversity (which is equ... |
cs/0601093 | Stability of Scheduled Multi-access Communication over Quasi-static Flat
Fading Channels with Random Coding and Joint Maximum Likelihood Decoding | cs.IT math.IT | We consider stability of scheduled multiaccess message communication with
random coding and joint maximum-likehood decoding of messages. The framework we
consider here models both the random message arrivals and the subsequent
reliable communication by suitably combining techniques from queueing theory
and informatio... |
cs/0601094 | Stability of Scheduled Message Communication over Degraded Broadcast
Channels | cs.IT math.IT | We consider scheduled message communication over a discrete memoryless
degraded broadcast channel. The framework we consider here models both the
random message arrivals and the subsequent reliable communication by suitably
combining techniques from queueing theory and information theory. The channel
from the transmi... |
cs/0601095 | On the Weight Enumerator and the Maximum Likelihood Performance of
Linear Product Codes | cs.IT math.IT | Product codes are widely used in data-storage, optical and wireless
applications. Their analytical performance evaluation usually relies on the
truncated union bound, which provides a low error rate approximation based on
the minimum distance term only. In fact, the complete weight enumerator of most
product codes re... |
cs/0601098 | Energy Efficiency and Delay Quality-of-Service in Wireless Networks | cs.IT math.IT | The energy-delay tradeoffs in wireless networks are studied using a
game-theoretic framework. A multi-class multiple-access network is considered
in which users choose their transmit powers, and possibly transmission rates,
in a distributed manner to maximize their own utilities while satisfying their
delay quality-o... |
cs/0601099 | Adaptive Linear Programming Decoding | cs.IT math.IT | Detectability of failures of linear programming (LP) decoding and its
potential for improvement by adding new constraints motivate the use of an
adaptive approach in selecting the constraints for the LP problem. In this
paper, we make a first step in studying this method, and show that it can
significantly reduce the... |
cs/0601102 | Geometric symmetry in the quadratic Fisher discriminant operating on
image pixels | cs.IT cs.CV math.IT | This article examines the design of Quadratic Fisher Discriminants (QFDs)
that operate directly on image pixels, when image ensembles are taken to
comprise all rotated and reflected versions of distinct sample images. A
procedure based on group theory is devised to identify and discard QFD
coefficients made redundant... |
cs/0601103 | Google Web APIs - an Instrument for Webometric Analyses? | cs.IR | This paper introduces Google Web APIs (Google APIs) as an instrument and
playground for webometric studies. Several examples of Google APIs
implementations are given. Our examples show that this Google Web Service can
be used successfully for informetric Internet based studies albeit with some
restrictions.
|
cs/0601105 | The Perceptron Algorithm: Image and Signal Decomposition, Compression,
and Analysis by Iterative Gaussian Blurring | cs.CV | A novel algorithm for tunable compression to within the precision of
reproduction targets, or storage, is proposed. The new algorithm is termed the
`Perceptron Algorithm', which utilises simple existing concepts in a novel way,
has multiple immediate commercial application aspects as well as it opens up a
multitude o... |
cs/0601106 | The `Face on Mars': a photographic approach for the search of signs of
past civilizations from a macroscopic point of view, factoring long-term
erosion in image reconstruction | cs.CV | This short article presents an alternative view of high resolution imaging
from various sources with the aim of the discovery of potential sites of
archaeological importance, or sites that exhibit `anomalies' such that they may
merit closer inspection and analysis. It is conjectured, and to a certain
extent demonstra... |
cs/0601107 | Structure of Optimal Input Covariance Matrices for MIMO Systems with
Covariance Feedback under General Correlated Fading | cs.IT math.IT | We describe the structure of optimal Input covariance matrices for single
user multiple-input/multiple-output (MIMO) communication system with covariance
feedback and for general correlated fading. Our approach is based on the novel
concept of right commutant and recovers previously derived results for the
Kronecker ... |
cs/0601108 | Fast Lexically Constrained Viterbi Algorithm (FLCVA): Simultaneous
Optimization of Speed and Memory | cs.CV cs.AI cs.DS | Lexical constraints on the input of speech and on-line handwriting systems
improve the performance of such systems. A significant gain in speed can be
achieved by integrating in a digraph structure the different Hidden Markov
Models (HMM) corresponding to the words of the relevant lexicon. This
integration avoids red... |
cs/0601109 | Certainty Closure: Reliable Constraint Reasoning with Incomplete or
Erroneous Data | cs.AI | Constraint Programming (CP) has proved an effective paradigm to model and
solve difficult combinatorial satisfaction and optimisation problems from
disparate domains. Many such problems arising from the commercial world are
permeated by data uncertainty. Existing CP approaches that accommodate
uncertainty are less su... |
cs/0601110 | Mutual Information Games in Multi-user Channels with Correlated Jamming | cs.IT math.IT | We investigate the behavior of two users and one jammer in an AWGN channel
with and without fading when they participate in a non-cooperative zero-sum
game, with the channel's input/output mutual information as the objective
function. We assume that the jammer can eavesdrop the channel and can use the
information obt... |
cs/0601113 | An Efficient Pseudo-Codeword Search Algorithm for Linear Programming
Decoding of LDPC Codes | cs.IT cond-mat.dis-nn math.IT | In Linear Programming (LP) decoding of a Low-Density-Parity-Check (LDPC) code
one minimizes a linear functional, with coefficients related to log-likelihood
ratios, over a relaxation of the polytope spanned by the codewords
\cite{03FWK}. In order to quantify LP decoding, and thus to describe
performance of the error-... |
cs/0601114 | Efficient Query Answering over Conceptual Schemas of Relational
Databases : Technical Report | cs.DB cs.LO | We develop a query answering system, where at the core of the work there is
an idea of query answering by rewriting. For this purpose we extend the DL
DL-Lite with the ability to support n-ary relations, obtaining the DL DLR-Lite,
which is still polynomial in the size of the data. We devise a flexible way of
mapping ... |
cs/0601115 | Decision Making with Side Information and Unbounded Loss Functions | cs.LG cs.IT math.IT | We consider the problem of decision-making with side information and
unbounded loss functions. Inspired by probably approximately correct learning
model, we use a slightly different model that incorporates the notion of side
information in a more generic form to make it applicable to a broader class of
applications i... |
cs/0601120 | On The Minimum Mean-Square Estimation Error of the Normalized Sum of
Independent Narrowband Waves in the Gaussian Channel | cs.IT math.IT | The minimum mean-square error of the estimation of a signal where observed
from the additive white Gaussian noise (WGN) channel's output, is analyzed. It
is assumed that the channel input's signal is composed of a (normalized) sum of
N narrowband, mutually independent waves. It is shown that if N goes to
infinity, th... |
cs/0601121 | A Multi-Relational Network to Support the Scholarly Communication
Process | cs.DL cs.AI cs.IR | The general pupose of the scholarly communication process is to support the
creation and dissemination of ideas within the scientific community. At a finer
granularity, there exists multiple stages which, when confronted by a member of
the community, have different requirements and therefore different solutions.
In o... |
cs/0601123 | Low density codes achieve the rate-distortion bound | cs.IT math.IT | We propose a new construction for low-density source codes with multiple
parameters that can be tuned to optimize the performance of the code. In
addition, we introduce a set of analysis techniques for deriving upper bounds
for the expected distortion of our construction, as well as more general
low-density construct... |
cs/0601124 | Power Control for User Cooperation | cs.IT math.IT | For a fading Gaussian multiple access channel with user cooperation, we
obtain the optimal power allocation policies that maximize the rates achievable
by block Markov superposition coding. The optimal policies result in a coding
scheme that is simpler than the one for a general multiple access channel with
generaliz... |
cs/0601126 | Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two
Rounds | cs.IT math.IT | A linear time approximate maximum likelihood decoding algorithm on
tail-biting trellises is prsented, that requires exactly two rounds on the
trellis. This is an adaptation of an algorithm proposed earlier with the
advantage that it reduces the time complexity from O(mlogm) to O(m) where m is
the number of nodes in t... |
cs/0601129 | Instantaneously Trained Neural Networks | cs.NE cs.AI | This paper presents a review of instantaneously trained neural networks
(ITNNs). These networks trade learning time for size and, in the basic model, a
new hidden node is created for each training sample. Various versions of the
corner-classification family of ITNNs, which have found applications in
artificial intell... |
cs/0601130 | From Dumb Wireless Sensors to Smart Networks using Network Coding | cs.IT cs.NI math.IT | The vision of wireless sensor networks is one of a smart collection of tiny,
dumb devices. These motes may be individually cheap, unintelligent, imprecise,
and unreliable. Yet they are able to derive strength from numbers, rendering
the whole to be strong, reliable and robust. Our approach is to adopt a
distributed a... |
cs/0601131 | Scalable Algorithms for Aggregating Disparate Forecasts of Probability | cs.AI cs.DC cs.IT math.IT | In this paper, computational aspects of the panel aggregation problem are
addressed. Motivated primarily by applications of risk assessment, an algorithm
is developed for aggregating large corpora of internally incoherent probability
assessments. The algorithm is characterized by a provable performance
guarantee, and... |
cs/0601132 | A Study on the Global Convergence Time Complexity of Estimation of
Distribution Algorithms | cs.AI cs.NE | The Estimation of Distribution Algorithm is a new class of population based
search methods in that a probabilistic model of individuals is estimated based
on the high quality individuals and used to generate the new individuals. In
this paper we compute 1) some upper bounds on the number of iterations required
for gl... |
cs/0602004 | Conjunctive Queries over Trees | cs.DB cs.AI cs.CC cs.LO | We study the complexity and expressive power of conjunctive queries over
unranked labeled trees represented using a variety of structure relations such
as ``child'', ``descendant'', and ``following'' as well as unary relations for
node labels. We establish a framework for characterizing structures
representing trees ... |
cs/0602006 | A Visual Query Language for Complex-Value Databases | cs.DB cs.HC | In this paper, a visual language, VCP, for queries on complex-value databases
is proposed. The main strength of the new language is that it is purely visual:
(i) It has no notion of variable, quantification, partiality, join, pattern
matching, regular expression, recursion, or any other construct proper to
logical, f... |
cs/0602007 | Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other
Noisy Data | cs.CR cs.IT math.IT | We provide formal definitions and efficient secure techniques for
- turning noisy information into keys usable for any cryptographic
application, and, in particular,
- reliably and securely authenticating biometric data.
Our techniques apply not just to biometric information, but to any keying
material that, un... |
cs/0602011 | The intuitionistic fragment of computability logic at the propositional
level | cs.LO cs.AI math.LO | This paper presents a soundness and completeness proof for propositional
intuitionistic calculus with respect to the semantics of computability logic.
The latter interprets formulas as interactive computational problems,
formalized as games between a machine and its environment. Intuitionistic
implication is understo... |
cs/0602014 | Game theoretic aspects of distributed spectral coordination with
application to DSL networks | cs.IT math.IT | In this paper we use game theoretic techniques to study the value of
cooperation in distributed spectrum management problems. We show that the
celebrated iterative water-filling algorithm is subject to the prisoner's
dilemma and therefore can lead to severe degradation of the achievable rate
region in an interference... |
cs/0602015 | On the Asymptotic Performance of Multiple Antenna Channels with Fast
Channel Feedback | cs.IT math.IT | In this paper, we analyze the asymptotic performance of multiple antenna
channels where the transmitter has either perfect or finite bit channel state
information. Using the diversity-multiplexing tradeoff to characterize the
system performance, we demonstrate that channel feedback can fundamentally
change the system... |
cs/0602018 | Improving the CSIEC Project and Adapting It to the English Teaching and
Learning in China | cs.CY cs.AI cs.CL cs.HC cs.MA | In this paper after short review of the CSIEC project initialized by us in
2003 we present the continuing development and improvement of the CSIEC project
in details, including the design of five new Microsoft agent characters
representing different virtual chatting partners and the limitation of
simulated dialogs in... |
cs/0602020 | Inter-Block Permuted Turbo Codes | cs.IT math.IT | The structure and size of the interleaver used in a turbo code critically
affect the distance spectrum and the covariance property of a component
decoder's information input and soft output. This paper introduces a new class
of interleavers, the inter-block permutation (IBP) interleavers, that can be
build on any exi... |
cs/0602021 | Using Domain Knowledge in Evolutionary System Identification | cs.AI math.AP | Two example of Evolutionary System Identification are presented to highlight
the importance of incorporating Domain Knowledge: the discovery of an
analytical indentation law in Structural Mechanics using constrained Genetic
Programming, and the identification of the repartition of underground
velocities in Seismic Pr... |
cs/0602022 | Avoiding the Bloat with Stochastic Grammar-based Genetic Programming | cs.AI | The application of Genetic Programming to the discovery of empirical laws is
often impaired by the huge size of the search space, and consequently by the
computer resources needed. In many cases, the extreme demand for memory and CPU
is due to the massive growth of non-coding segments, the introns. The paper
presents... |
cs/0602023 | Information theory and Thermodynamics | cs.IT math.IT | A communication theory for a transmitter broadcasting to many receivers is
presented. In this case energetic considerations cannot be neglected as in
Shannon theory. It is shown that, when energy is assigned to the information
bit, information theory complies with classical thermodynamic and is part of
it. To provide... |
cs/0602027 | Explaining Constraint Programming | cs.PL cs.AI | We discuss here constraint programming (CP) by using a proof-theoretic
perspective. To this end we identify three levels of abstraction. Each level
sheds light on the essence of CP.
In particular, the highest level allows us to bring CP closer to the
computation as deduction paradigm. At the middle level we can exp... |
cs/0602028 | Analysis of Belief Propagation for Non-Linear Problems: The Example of
CDMA (or: How to Prove Tanaka's Formula) | cs.IT math.IT | We consider the CDMA (code-division multiple-access) multi-user detection
problem for binary signals and additive white gaussian noise. We propose a
spreading sequences scheme based on random sparse signatures, and a detection
algorithm based on belief propagation (BP) with linear time complexity. In the
new scheme, ... |
cs/0602030 | Single-Symbol Maximum Likelihood Decodable Linear STBCs | cs.IT math.IT | Space-Time block codes (STBC) from Orthogonal Designs (OD) and Co-ordinate
Interleaved Orthogonal Designs (CIOD) have been attracting wider attention due
to their amenability for fast (single-symbol) ML decoding, and full-rate with
full-rank over quasi-static fading channels. However, these codes are instances
of sin... |
cs/0602031 | Classifying Signals with Local Classifiers | cs.AI | This paper deals with the problem of classifying signals. The new method for
building so called local classifiers and local features is presented. The
method is a combination of the lifting scheme and the support vector machines.
Its main aim is to produce effective and yet comprehensible classifiers that
would help ... |
cs/0602032 | Finite-State Dimension and Real Arithmetic | cs.CC cs.IT math.IT | We use entropy rates and Schur concavity to prove that, for every integer k
>= 2, every nonzero rational number q, and every real number alpha, the base-k
expansions of alpha, q+alpha, and q*alpha all have the same finite-state
dimension and the same finite-state strong dimension. This extends, and gives a
new proof ... |
cs/0602035 | n-Channel Entropy-Constrained Multiple-Description Lattice Vector
Quantization | cs.IT math.IT | In this paper we derive analytical expressions for the central and side
quantizers which, under high-resolutions assumptions, minimize the expected
distortion of a symmetric multiple-description lattice vector quantization
(MD-LVQ) system subject to entropy constraints on the side descriptions for
given packet-loss p... |
cs/0602036 | R\'{e}seaux d'Automates de Caianiello Revisit\'{e} | cs.NE | We exhibit a family of neural networks of McCulloch and Pitts of size $2nk+2$
which can be simulated by a neural networks of Caianiello of size $2n+2$ and
memory length $k$. This simulation allows us to find again one of the result of
the following article: [Cycles exponentiels des r\'{e}seaux de Caianiello et
compte... |
cs/0602038 | Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs | cs.DM cs.AI | For graphs $G$ and $H$, a mapping $f: V(G)\dom V(H)$ is a homomorphism of $G$
to $H$ if $uv\in E(G)$ implies $f(u)f(v)\in E(H).$ If, moreover, each vertex $u
\in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of the
homomorphism $f$ is $\sum_{u\in V(G)}c_{f(u)}(u)$. For each fixed graph $H$, we
ha... |
cs/0602039 | Path Summaries and Path Partitioning in Modern XML Databases | cs.DB | We study the applicability of XML path summaries in the context of
current-day XML databases. We find that summaries provide an excellent basis
for optimizing data access methods, which furthermore mixes very well with
path-partitioned stores. We provide practical algorithms for building and
exploiting summaries, and... |
cs/0602044 | Multilevel Thresholding for Image Segmentation through a Fast
Statistical Recursive Algorithm | cs.CV | A novel algorithm is proposed for segmenting an image into multiple levels
using its mean and variance. Starting from the extreme pixel values at both
ends of the histogram plot, the algorithm is applied recursively on sub-ranges
computed from the previous step, so as to find a threshold level and a new
sub-range for... |
cs/0602045 | Emergence Explained | cs.MA cs.DC cs.GL | Emergence (macro-level effects from micro-level causes) is at the heart of
the conflict between reductionism and functionalism. How can there be
autonomous higher level laws of nature (the functionalist claim) if everything
can be reduced to the fundamental forces of physics (the reductionist
position)? We cut throug... |
cs/0602046 | Analysis of LDGM and compound codes for lossy compression and binning | cs.IT math.IT | Recent work has suggested that low-density generator matrix (LDGM) codes are
likely to be effective for lossy source coding problems. We derive rigorous
upper bounds on the effective rate-distortion function of LDGM codes for the
binary symmetric source, showing that they quickly approach the rate-distortion
function... |
cs/0602048 | On the Optimality of the ARQ-DDF Protocol | cs.IT math.IT | The performance of the automatic repeat request-dynamic decode and forward
(ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first
scenario is the multiple access relay (MAR) channel where a single relay is
dedicated to simultaneously help several multiple access users. For this setup,
it is s... |
cs/0602049 | Cooperative Lattice Coding and Decoding | cs.IT math.IT | A novel lattice coding framework is proposed for outage-limited cooperative
channels. This framework provides practical implementations for the optimal
cooperation protocols proposed by Azarian et al. In particular, for the relay
channel we implement a variant of the dynamic decode and forward protocol,
which uses or... |
cs/0602050 | Outage Capacity of the Fading Relay Channel in the Low SNR Regime | cs.IT math.IT | In slow fading scenarios, cooperation between nodes can increase the amount
of diversity for communication. We study the performance limit in such
scenarios by analyzing the outage capacity of slow fading relay channels. Our
focus is on the low SNR and low outage probability regime, where the adverse
impact of fading... |
cs/0602051 | On the utility of the multimodal problem generator for assessing the
performance of Evolutionary Algorithms | cs.NE | This paper looks in detail at how an evolutionary algorithm attempts to solve
instances from the multimodal problem generator. The paper shows that in order
to consistently reach the global optimum, an evolutionary algorithm requires a
population size that should grow at least linearly with the number of peaks. It
is... |
cs/0602052 | The OverRelational Manifesto | cs.DB cs.DS | The OverRelational Manifesto (below ORM) proposes a possible approach to
creation of data storage systems of the next generation. ORM starts from the
requirement that information in a relational database is represented by a set
of relation values. Accordingly, it is assumed that the information about any
entity of an... |
cs/0602053 | How to Beat the Adaptive Multi-Armed Bandit | cs.DS cs.LG | The multi-armed bandit is a concise model for the problem of iterated
decision-making under uncertainty. In each round, a gambler must pull one of
$K$ arms of a slot machine, without any foreknowledge of their payouts, except
that they are uniformly bounded. A standard objective is to minimize the
gambler's regret, d... |
cs/0602054 | Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain
Tradeoff | cs.IT math.IT | A recent result of Zheng and Tse states that over a quasi-static channel,
there exists a fundamental tradeoff, referred to as the diversity-multiplexing
gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity
gain that can be simultaneously achieved by a space-time (ST) block code. This
tradeoff... |
cs/0602055 | Revisiting Evolutionary Algorithms with On-the-Fly Population Size
Adjustment | cs.NE | In an evolutionary algorithm, the population has a very important role as its
size has direct implications regarding solution quality, speed, and
reliability. Theoretical studies have been done in the past to investigate the
role of population sizing in evolutionary algorithms. In addition to those
studies, several s... |
cs/0602056 | Building Scenarios for Environmental Management and Planning: An
IT-Based Approach | cs.MA | Oftentimes, the need to build multidiscipline knowledge bases, oriented to
policy scenarios, entails the involvement of stakeholders in manifold domains,
with a juxtaposition of different languages whose semantics can hardly allow
inter-domain transfers. A useful support for planning is the building up of
durable IT ... |
cs/0602058 | Incremental Redundancy Cooperative Coding for Wireless Networks:
Cooperative Diversity, Coding, and Transmission Energy Gain | cs.IT math.IT | We study an incremental redundancy (IR) cooperative coding scheme for
wireless networks. To exploit the spatial diversity benefit we propose a
cluster-based collaborating strategy for a quasi-static Rayleigh fading channel
model and based on a network geometric distance profile. Our scheme enhances
the network perfor... |
cs/0602060 | eJournal interface can influence usage statistics: implications for
libraries, publishers, and Project COUNTER | cs.IR cs.DL | The design of a publisher's electronic interface can have a measurable effect
on electronic journal usage statistics. A study of journal usage from six
COUNTER-compliant publishers at thirty-two research institutions in the United
States, the United Kingdom and Sweden indicates that the ratio of PDF to HTML
views is ... |
cs/0602062 | Learning rational stochastic languages | cs.LG | Given a finite set of words w1,...,wn independently drawn according to a
fixed unknown distribution law P called a stochastic language, an usual goal in
Grammatical Inference is to infer an estimate of P in some class of
probabilistic models, such as Probabilistic Automata (PA). Here, we study the
class of rational s... |
cs/0602065 | Similarity of Objects and the Meaning of Words | cs.CV cs.IR | We survey the emerging area of compression-based, parameter-free, similarity
distance measures useful in data-mining, pattern recognition, learning and
automatic semantics extraction. Given a family of distances on a set of
objects, a distance is universal up to a certain precision for that family if
it minorizes eve... |
cs/0602067 | Renyi to Renyi -- Source Coding under Siege | cs.IT cs.DS math.IT | A novel lossless source coding paradigm applies to problems of unreliable
lossless channels with low bit rates, in which a vital message needs to be
transmitted prior to termination of communications. This paradigm can be
applied to Alfred Renyi's secondhand account of an ancient siege in which a spy
was sent to scou... |
cs/0602071 | Geographic Gossip: Efficient Aggregation for Sensor Networks | cs.IT math.IT | Gossip algorithms for aggregation have recently received significant
attention for sensor network applications because of their simplicity and
robustness in noisy and uncertain environments. However, gossip algorithms can
waste significant energy by essentially passing around redundant information
multiple times. For... |
cs/0602072 | Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and
Turbo Stopping Sets | cs.IT math.IT | This paper is devoted to the finite-length analysis of turbo decoding over
the binary erasure channel (BEC). The performance of iterative
belief-propagation (BP) decoding of low-density parity-check (LDPC) codes over
the BEC can be characterized in terms of stopping sets. We describe turbo
decoding on the BEC which i... |
cs/0602074 | The entropy rate of the binary symmetric channel in the rare transitions
regime | cs.IT math.IT | This note has been withdrawn by the author as the more complete result was
recently proved by A.Quas and Y.Peres
|
cs/0602076 | Exploring term-document matrices from matrix models in text mining | cs.IR cs.DB cs.DL | We explore a matrix-space model, that is a natural extension to the vector
space model for Information Retrieval. Each document can be represented by a
matrix that is based on document extracts (e.g. sentences, paragraphs,
sections). We focus on the performance of this model for the specific case in
which documents a... |
cs/0602079 | SISO APP Searches in Lattices with Tanner Graphs | cs.IT cs.DS math.IT | An efficient, low-complexity, soft-output detector for general lattices is
presented, based on their Tanner graph (TG) representations. Closest-point
searches in lattices can be performed as non-binary belief propagation on
associated TGs; soft-information output is naturally generated in the process;
the algorithm r... |
cs/0602081 | Low-Density Parity-Check Code with Fast Decoding Speed | cs.IT math.IT | Low-Density Parity-Check (LDPC) codes received much attention recently due to
their capacity-approaching performance. The iterative message-passing algorithm
is a widely adopted decoding algorithm for LDPC codes \cite{Kschischang01}. An
important design issue for LDPC codes is designing codes with fast decoding
speed... |
cs/0602083 | A third level trigger programmable on FPGA for the gamma/hadron
separation in a Cherenkov telescope using pseudo-Zernike moments and the SVM
classifier | cs.CV cs.AI | We studied the application of the Pseudo-Zernike features as image parameters
(instead of the Hillas parameters) for the discrimination between the images
produced by atmospheric electromagnetic showers caused by gamma-rays and the
ones produced by atmospheric electromagnetic showers caused by hadrons in the
MAGIC Ex... |
cs/0602084 | Universal Codes as a Basis for Time Series Testing | cs.IT math.IT | We suggest a new approach to hypothesis testing for ergodic and stationary
processes. In contrast to standard methods, the suggested approach gives a
possibility to make tests, based on any lossless data compression method even
if the distribution law of the codeword lengths is not known. We apply this
approach to th... |
cs/0602085 | Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding | cs.IT cs.DS math.IT | Efficient optimal prefix coding has long been accomplished via the Huffman
algorithm. However, there is still room for improvement and exploration
regarding variants of the Huffman problem. Length-limited Huffman coding,
useful for many practical applications, is one such variant, for which codes
are restricted to th... |
cs/0602086 | On the Block Error Probability of LP Decoding of LDPC Codes | cs.IT math.IT | In his thesis, Wiberg showed the existence of thresholds for families of
regular low-density parity-check codes under min-sum algorithm decoding. He
also derived analytic bounds on these thresholds. In this paper, we formulate
similar results for linear programming decoding of regular low-density
parity-check codes.
|
cs/0602087 | Bounds on the Threshold of Linear Programming Decoding | cs.IT math.IT | Whereas many results are known about thresholds for ensembles of low-density
parity-check codes under message-passing iterative decoding, this is not the
case for linear programming decoding. Towards closing this knowledge gap, this
paper presents some bounds on the thresholds of low-density parity-check code
ensembl... |
cs/0602088 | Towards Low-Complexity Linear-Programming Decoding | cs.IT math.IT | We consider linear-programming (LP) decoding of low-density parity-check
(LDPC) codes. While it is clear that one can use any general-purpose LP solver
to solve the LP that appears in the decoding problem, we argue in this paper
that the LP at hand is equipped with a lot of structure that one should take
advantage of... |
cs/0602089 | Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean
Planes | cs.IT cs.DM math.IT | In order to understand the performance of a code under maximum-likelihood
(ML) decoding, one studies the codewords, in particular the minimal codewords,
and their Hamming weights. In the context of linear programming (LP) decoding,
one's attention needs to be shifted to the pseudo-codewords, in particular to
the mini... |
cs/0602091 | Feedback Capacity of Stationary Gaussian Channels | cs.IT math.IT | The feedback capacity of additive stationary Gaussian noise channels is
characterized as the solution to a variational problem. Toward this end, it is
proved that the optimal feedback coding scheme is stationary. When specialized
to the first-order autoregressive moving average noise spectrum, this
variational charac... |
cs/0602092 | Inconsistent parameter estimation in Markov random fields: Benefits in
the computation-limited setting | cs.LG cs.IT math.IT math.ST stat.TH | Consider the problem of joint parameter estimation and prediction in a Markov
random field: i.e., the model parameters are estimated on the basis of an
initial set of data, and then the fitted model is used to perform prediction
(e.g., smoothing, denoising, interpolation) on a new noisy observation. Working
under the... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.