id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0511086 | Energy-Efficient Resource Allocation in Time Division Multiple-Access
over Fading Channels | cs.IT math.IT | We investigate energy-efficiency issues and resource allocation policies for
time division multi-access (TDMA) over fading channels in the power-limited
regime. Supposing that the channels are frequency-flat block-fading and
transmitters have full or quantized channel state information (CSI), we first
minimize power ... |
cs/0511087 | Robust Inference of Trees | cs.LG cs.AI cs.IT math.IT | This paper is concerned with the reliable inference of optimal
tree-approximations to the dependency structure of an unknown distribution
generating data. The traditional approach to the problem measures the
dependency strength between random variables by the index called mutual
information. In this paper reliability... |
cs/0511088 | Bounds on Query Convergence | cs.LG | The problem of finding an optimum using noisy evaluations of a smooth cost
function arises in many contexts, including economics, business, medicine,
experiment design, and foraging theory. We derive an asymptotic bound E[ (x_t -
x*)^2 ] >= O(1/sqrt(t)) on the rate of convergence of a sequence (x_0, x_1,
>...) genera... |
cs/0511089 | Continued Fraction Expansion as Isometry: The Law of the Iterated
Logarithm for Linear, Jump, and 2--Adic Complexity | cs.IT math.IT | In the cryptanalysis of stream ciphers and pseudorandom sequences, the
notions of linear, jump, and 2-adic complexity arise naturally to measure the
(non)randomness of a given string. We define an isometry K on F_q^\infty that
is the precise equivalent to Euclid's algorithm over the reals to calculate the
continued f... |
cs/0511090 | Integration of Declarative and Constraint Programming | cs.PL cs.AI | Combining a set of existing constraint solvers into an integrated system of
cooperating solvers is a useful and economic principle to solve hybrid
constraint problems. In this paper we show that this approach can also be used
to integrate different language paradigms into a unified framework.
Furthermore, we study th... |
cs/0511091 | Evolution of Voronoi based Fuzzy Recurrent Controllers | cs.AI | A fuzzy controller is usually designed by formulating the knowledge of a
human expert into a set of linguistic variables and fuzzy rules. Among the most
successful methods to automate the fuzzy controllers development process are
evolutionary algorithms. In this work, we propose the Recurrent Fuzzy Voronoi
(RFV) mode... |
cs/0511093 | Artificial Agents and Speculative Bubbles | cs.GT cs.AI | Pertaining to Agent-based Computational Economics (ACE), this work presents
two models for the rise and downfall of speculative bubbles through an exchange
price fixing based on double auction mechanisms. The first model is based on a
finite time horizon context, where the expected dividends decrease along time.
The ... |
cs/0511095 | Carbon Copying Onto Dirty Paper | cs.IT math.IT | A generalization of the problem of writing on dirty paper is considered in
which one transmitter sends a common message to multiple receivers. Each
receiver experiences on its link an additive interference (in addition to the
additive noise), which is known noncausally to the transmitter but not to any
of the receive... |
cs/0511096 | A Single-letter Upper Bound for the Sum Rate of Multiple Access Channels
with Correlated Sources | cs.IT math.IT | The capacity region of the multiple access channel with arbitrarily
correlated sources remains an open problem. Cover, El Gamal and Salehi gave an
achievable region in the form of single-letter entropy and mutual information
expressions, without a single-letter converse. Cover, El Gamal and Salehi also
gave a convers... |
cs/0511098 | Information and Stock Prices: A Simple Introduction | cs.CY cs.IT math.IT nlin.AO physics.soc-ph | This article summarizes recent research in financial economics about why
information, such as earnings announcements, moves stock prices. The article
does not presume any prior exposure to finance beyond what you might read in
newspapers.
|
cs/0511100 | Density Evolution, Thresholds and the Stability Condition for Non-binary
LDPC Codes | cs.IT math.IT | We derive the density evolution equations for non-binary low-density
parity-check (LDPC) ensembles when transmission takes place over the binary
erasure channel. We introduce ensembles defined with respect to the general
linear group over the binary field. For these ensembles the density evolution
equations can be wr... |
cs/0511103 | An Infeasibility Result for the Multiterminal Source-Coding Problem | cs.IT math.IT | We prove a new outer bound on the rate-distortion region for the
multiterminal source-coding problem. This bound subsumes the best outer bound
in the literature and improves upon it strictly in some cases. The improved
bound enables us to obtain a new, conclusive result for the binary erasure
version of the "CEO prob... |
cs/0511104 | Channel Model and Upper Bound on the Information Capacity of the Fiber
Optical Communication Channel Based on the Effects of XPM Induced
Nonlinearity | cs.IT math.IT | An upper bound to the information capacity of a wavelength-division multi-
plexed optical fiber communication system is derived in a model incorporating
the nonlinear propagation effects of cross-phase modulation (XPM). This work is
based on the paper by Mitra et al., finding lower bounds to the channel
capacity, in ... |
cs/0511105 | The Signed Distance Function: A New Tool for Binary Classification | cs.LG cs.CG | From a geometric perspective most nonlinear binary classification algorithms,
including state of the art versions of Support Vector Machine (SVM) and Radial
Basis Function Network (RBFN) classifiers, and are based on the idea of
reconstructing indicator functions. We propose instead to use reconstruction of
the signe... |
cs/0511106 | Benefits of InterSite Pre-Processing and Clustering Methods in
E-Commerce Domain | cs.DB | This paper presents our preprocessing and clustering analysis on the
clickstream dataset proposed for the ECMLPKDD 2005 Discovery Challenge. The
main contributions of this article are double. First, after presenting the
clickstream dataset, we show how we build a rich data warehouse based an
advanced preprocesing. We... |
cs/0511108 | Parameter Estimation of Hidden Diffusion Processes: Particle Filter vs.
Modified Baum-Welch Algorithm | cs.DS cs.LG | We propose a new method for the estimation of parameters of hidden diffusion
processes. Based on parametrization of the transition matrix, the Baum-Welch
algorithm is improved. The algorithm is compared to the particle filter in
application to the noisy periodic systems. It is shown that the modified
Baum-Welch algor... |
cs/0512002 | On Self-Regulated Swarms, Societal Memory, Speed and Dynamics | cs.NE cs.AI | We propose a Self-Regulated Swarm (SRS) algorithm which hybridizes the
advantageous characteristics of Swarm Intelligence as the emergence of a
societal environmental memory or cognitive map via collective pheromone laying
in the landscape (properly balancing the exploration/exploitation nature of our
dynamic search ... |
cs/0512003 | Societal Implicit Memory and his Speed on Tracking Extrema over Dynamic
Environments using Self-Regulatory Swarms | cs.MA cs.AI | In order to overcome difficult dynamic optimization and environment extrema
tracking problems, We propose a Self-Regulated Swarm (SRS) algorithm which
hybridizes the advantageous characteristics of Swarm Intelligence as the
emergence of a societal environmental memory or cognitive map via collective
pheromone laying ... |
cs/0512004 | Self-Regulated Artificial Ant Colonies on Digital Image Habitats | cs.MA cs.AI | Artificial life models, swarm intelligent and evolutionary computation
algorithms are usually built on fixed size populations. Some studies indicate
however that varying the population size can increase the adaptability of these
systems and their capability to react to changing environments. In this paper
we present ... |
cs/0512006 | Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for
the Erasure Channel with Bounded Complexity | cs.IT math.IT | The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes
which asymptotically achieve capacity on the binary erasure channel (BEC) with
{\em bounded complexity}, per information bit, of encoding and decoding. It
also introduces symmetry properties which play a central role in the
construction of cap... |
cs/0512007 | Entangled messages | cs.CR cs.IR | It is sometimes necessary to send copies of the same email to different
parties, but it is impossible to ensure that if one party reads the message the
other parties will bound to read it. We propose an entanglement based scheme
where if one party reads the message the other party will bound to read it
simultaneously... |
cs/0512010 | A geometry of information, I: Nerves, posets and differential forms | cs.AI cs.GR | The main theme of this workshop (Dagstuhl seminar 04351) is `Spatial
Representation: Continuous vs. Discrete'. Spatial representation has two
contrasting but interacting aspects (i) representation of spaces' and (ii)
representation by spaces. In this paper, we will examine two aspects that are
common to both interpre... |
cs/0512013 | The Water-Filling Game in Fading Multiple Access Channels | cs.IT math.IT | We adopt a game theoretic approach for the design and analysis of distributed
resource allocation algorithms in fading multiple access channels. The users
are assumed to be selfish, rational, and limited by average power constraints.
We show that the sum-rate optimal point on the boundary of the multipleaccess
channe... |
cs/0512014 | A Game-Theoretic Approach to Energy-Efficient Power Control in
Multi-Carrier CDMA Systems | cs.IT math.IT | A game-theoretic model for studying power control in multi-carrier CDMA
systems is proposed. Power control is modeled as a non-cooperative game in
which each user decides how much power to transmit over each carrier to
maximize its own utility. The utility function considered here measures the
number of reliable bits... |
cs/0512015 | Joint fixed-rate universal lossy coding and identification of
continuous-alphabet memoryless sources | cs.IT cs.LG math.IT | The problem of joint universal source coding and identification is considered
in the setting of fixed-rate lossy coding of continuous-alphabet memoryless
sources. For a wide class of bounded distortion measures, it is shown that any
compactly parametrized family of $\R^d$-valued i.i.d. sources with absolutely
continu... |
cs/0512016 | A linear-time algorithm for finding the longest segment which scores
above a given threshold | cs.DS cs.CE | This paper describes a linear-time algorithm that finds the longest stretch
in a sequence of real numbers (``scores'') in which the sum exceeds an input
parameter. The algorithm also solves the problem of finding the longest
interval in which the average of the scores is above a fixed threshold. The
problem originate... |
cs/0512017 | Approximately Universal Codes over Slow Fading Channels | cs.IT math.IT | Performance of reliable communication over a coherent slow fading channel at
high SNR is succinctly captured as a fundamental tradeoff between diversity and
multiplexing gains. We study the problem of designing codes that optimally
tradeoff the diversity and multiplexing gains. Our main contribution is a
precise char... |
cs/0512018 | DAMNED: A Distributed and Multithreaded Neural Event-Driven simulation
framework | cs.NE cs.LG | In a Spiking Neural Networks (SNN), spike emissions are sparsely and
irregularly distributed both in time and in the network architecture. Since a
current feature of SNNs is a low average activity, efficient implementations of
SNNs are usually based on an Event-Driven Simulation (EDS). On the other hand,
simulations ... |
cs/0512019 | Amazing geometry of genetic space or are genetic algorithms convergent? | cs.NE cs.DM cs.SE | There is no proof yet of convergence of Genetic Algorithms. We do not supply
it too. Instead, we present some thoughts and arguments to convince the Reader,
that Genetic Algorithms are essentially bound for success. For this purpose, we
consider only the crossover operators, single- or multiple-point, together with
s... |
cs/0512020 | A Practical Approach to Joint Network-Source Coding | cs.IT math.IT | We are interested in how to best communicate a real valued source to a number
of destinations (sinks) over a network with capacity constraints in a
collective fidelity metric over all the sinks, a problem which we call joint
network-source coding. It is demonstrated that multiple description codes along
with proper d... |
cs/0512023 | Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any
Number of Antennas | cs.IT math.IT | Perfect space-time codes were first introduced by Oggier et. al. to be the
space-time codes that have full rate, full diversity-gain, non-vanishing
determinant for increasing spectral efficiency, uniform average transmitted
energy per antenna and good shaping of the constellation. These defining
conditions jointly co... |
cs/0512024 | A bound on Grassmannian codes | cs.IT math.IT math.MG | We give a new asymptotic upper bound on the size of a code in the
Grassmannian space. The bound is better than the upper bounds known previously
in the entire range of distances except very large values.
|
cs/0512025 | Spectral approach to linear programming bounds on codes | cs.IT math.CO math.IT | We give new proofs of asymptotic upper bounds of coding theory obtained
within the frame of Delsarte's linear programming method. The proofs rely on
the analysis of eigenvectors of some finite-dimensional operators related to
orthogonal polynomials. The examples of the method considered in the paper
include binary co... |
cs/0512027 | The Physical Foundation of Human Mind and a New Theory of Investment | cs.IT math.IT | This paper consists of two parts. In the first part, we develop a new
information theory, in which it is not a coincidence that information and
physical entropy share the same mathematical formula. It is an adaptation of
mind to help search for resources. We then show that psychological patterns
either reflect the co... |
cs/0512028 | Approximately universal optimality over several dynamic and non-dynamic
cooperative diversity schemes for wireless networks | cs.IT math.IT | In this work we explicitly provide the first ever optimal, with respect to
the Zheng-Tse diversity multiplexing gain (D-MG) tradeoff, cooperative
diversity schemes for wireless relay networks. The schemes are based on
variants of perfect space-time codes and are optimal for any number of users
and all statistically s... |
cs/0512029 | New model for rigorous analysis of LT-codes | cs.IT math.IT | We present a new model for LT codes which simplifies the analysis of the
error probability of decoding by belief propagation. For any given degree
distribution, we provide the first rigorous expression for the limiting error
probability as the length of the code goes to infinity via recent results in
random hypergrap... |
cs/0512030 | Uncertainty Principles for Signal Concentrations | cs.IT math.IT | Uncertainty principles for concentration of signals into truncated subspaces
are considered. The ``classic'' uncertainty principle is explored as a special
case of a more general operator framework. The time-bandwidth concentration
problem is shown as a similar special case. A spatial concentration of radio
signals e... |
cs/0512032 | A Software Framework for Vehicle-Infrastructure Cooperative Applications | cs.IR | A growing category of vehicle-infrastructure cooperative (VIC) applications
requires telematics software components distributed between an
infrastructure-based management center and a number of vehicles. This article
presents an approach based on a software framework, focusing on a Telematic
Management System (TMS), ... |
cs/0512037 | Evolving Stochastic Learning Algorithm Based on Tsallis Entropic Index | cs.NE cs.AI | In this paper, inspired from our previous algorithm, which was based on the
theory of Tsallis statistical mechanics, we develop a new evolving stochastic
learning algorithm for neural networks. The new algorithm combines
deterministic and stochastic search steps by employing a different adaptive
stepsize for each net... |
cs/0512038 | Capacity of Differential versus Non-Differential Unitary Space-Time
Modulation for MIMO channels | cs.IT cond-mat.stat-mech math-ph math.IT math.MP | Differential Unitary Space-Time Modulation (DUSTM) and its earlier
nondifferential counterpart, USTM, permit high-throughput MIMO communication
entirely without the possession of channel state information (CSI) by either
the transmitter or the receiver. For an isotropically random unitary input we
obtain the exact cl... |
cs/0512045 | Branch-and-Prune Search Strategies for Numerical Constraint Solving | cs.AI | When solving numerical constraints such as nonlinear equations and
inequalities, solvers often exploit pruning techniques, which remove redundant
value combinations from the domains of variables, at pruning steps. To find the
complete solution set, most of these solvers alternate the pruning steps with
branching step... |
cs/0512047 | Processing Uncertainty and Indeterminacy in Information Systems success
mapping | cs.AI | IS success is a complex concept, and its evaluation is complicated,
unstructured and not readily quantifiable. Numerous scientific publications
address the issue of success in the IS field as well as in other fields. But,
little efforts have been done for processing indeterminacy and uncertainty in
success research. ... |
cs/0512048 | Spatial Precoder Design for Space-Time Coded MIMO Systems: Based on
Fixed Parameters of MIMO Channels | cs.IT math.IT | In this paper, we introduce the novel use of linear spatial precoding based
on fixed and known parameters of multiple-input multiple-output (MIMO) channels
to improve the performance of space-time coded MIMO systems. We derive linear
spatial precoding schemes for both coherent (channel is known at the receiver)
and n... |
cs/0512050 | Preference Learning in Terminology Extraction: A ROC-based approach | cs.LG | A key data preparation step in Text Mining, Term Extraction selects the
terms, or collocation of words, attached to specific concepts. In this paper,
the task of extracting relevant collocations is achieved through a supervised
learning algorithm, exploiting a few collocations manually labelled as
relevant/irrelevant... |
cs/0512053 | Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower
Bounds for Hard Sets | cs.CC cs.LG | We establish a relationship between the online mistake-bound model of
learning and resource-bounded dimension. This connection is combined with the
Winnow algorithm to obtain new results about the density of hard sets under
adaptive reductions. This improves previous work of Fu (1995) and Lutz and Zhao
(2000), and so... |
cs/0512054 | Irreducible Frequent Patterns in Transactional Databases | cs.DS cs.DB | Irreducible frequent patters (IFPs) are introduced for transactional
databases. An IFP is such a frequent pattern (FP),(x1,x2,...xn), the
probability of which, P(x1,x2,...xn), cannot be represented as a product of the
probabilities of two (or more) other FPs of the smaller lengths. We have
developed an algorithm for ... |
cs/0512059 | Competing with wild prediction rules | cs.LG | We consider the problem of on-line prediction competitive with a benchmark
class of continuous but highly irregular prediction rules. It is known that if
the benchmark class is a reproducing kernel Hilbert space, there exists a
prediction algorithm whose average loss over the first N examples does not
exceed the aver... |
cs/0512062 | Evolino for recurrent support vector machines | cs.NE | Traditional Support Vector Machines (SVMs) need pre-wired finite time windows
to predict and classify time series. They do not have an internal state
necessary to deal with sequences involving arbitrary long-term dependencies.
Here we introduce a new class of recurrent, truly sequential SVM-like devices
with internal... |
cs/0512063 | Complex Random Vectors and ICA Models: Identifiability, Uniqueness and
Separability | cs.IT cs.CE cs.IR cs.LG math.IT | In this paper the conditions for identifiability, separability and uniqueness
of linear complex valued independent component analysis (ICA) models are
established. These results extend the well-known conditions for solving
real-valued ICA problems to complex-valued models. Relevant properties of
complex random vector... |
cs/0512066 | On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC
Ensembles | cs.IT math.IT | We estimate the variance of weight and stopping set distribution of regular
LDPC ensembles. Using this estimate and the second moment method we obtain
bounds on the probability that a randomly chosen code from regular LDPC
ensemble has its weight distribution and stopping set distribution close to
respective ensemble... |
cs/0512069 | Reconstructing Websites for the Lazy Webmaster | cs.IR cs.CY | Backup or preservation of websites is often not considered until after a
catastrophic event has occurred. In the face of complete website loss, "lazy"
webmasters or concerned third parties may be able to recover some of their
website from the Internet Archive. Other pages may also be salvaged from
commercial search e... |
cs/0512071 | "Going back to our roots": second generation biocomputing | cs.AI cs.NE | Researchers in the field of biocomputing have, for many years, successfully
"harvested and exploited" the natural world for inspiration in developing
systems that are robust, adaptable and capable of generating novel and even
"creative" solutions to human-defined problems. However, in this position paper
we argue tha... |
cs/0512074 | Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with
Applications to Turbo-Like Codes: An Overview | cs.IT math.IT | Upper and lower bounds on the error probability of linear codes under
maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles
of codes on graphs. For upper bounds, focus is put on Gallager bounding
techniques and their relation to a variety of other reported bounds. Within the
class of lower bo... |
cs/0512075 | Performance versus Complexity Per Iteration for Low-Density Parity-Check
Codes: An Information-Theoretic Approach | cs.IT math.IT | The paper is focused on the tradeoff between performance and decoding
complexity per iteration for LDPC codes in terms of their gap (in rate) to
capacity. The study of this tradeoff is done via information-theoretic bounds
which also enable to get an indication on the sub-optimality of message-passing
iterative decod... |
cs/0512076 | On Achievable Rates and Complexity of LDPC Codes for Parallel Channels:
Information-Theoretic Bounds and Applications | cs.IT math.IT | The paper presents bounds on the achievable rates and the decoding complexity
of low-density parity-check (LDPC) codes. It is assumed that the communication
of these codes takes place over statistically independent parallel channels
where these channels are memoryless, binary-input and output-symmetric (MBIOS).
The b... |
cs/0512078 | Graph-Cover Decoding and Finite-Length Analysis of Message-Passing
Iterative Decoding of LDPC Codes | cs.IT math.IT | The goal of the present paper is the derivation of a framework for the
finite-length analysis of message-passing iterative decoding of low-density
parity-check codes. To this end we introduce the concept of graph-cover
decoding. Whereas in maximum-likelihood decoding all codewords in a code are
competing to be the be... |
cs/0512079 | An invariant bayesian model selection principle for gaussian data in a
sparse representation | cs.IT math.IT | We develop a code length principle which is invariant to the choice of
parameterization on the model distributions. An invariant approximation formula
for easy computation of the marginal distribution is provided for gaussian
likelihood models. We provide invariant estimators of the model parameters and
formulate con... |
cs/0512084 | Understanding physics from interconnected data | cs.CV | Metal melting on release after explosion is a physical system far from
quilibrium. A complete physical model of this system does not exist, because
many interrelated effects have to be considered. General methodology needs to
be developed so as to describe and understand physical phenomena involved.
The high noise ... |
cs/0512085 | Analyzing and Visualizing the Semantic Coverage of Wikipedia and Its
Authors | cs.IR | This paper presents a novel analysis and visualization of English Wikipedia
data. Our specific interest is the analysis of basic statistics, the
identification of the semantic structure and age of the categories in this free
online encyclopedia, and the content coverage of its highly productive authors.
The paper sta... |
cs/0512087 | Fundamental Limits and Scaling Behavior of Cooperative Multicasting in
Wireless Networks | cs.IT cs.NI math.IT | A framework is developed for analyzing capacity gains from user cooperation
in slow fading wireless networks when the number of nodes (network size) is
large. The framework is illustrated for the case of a simple multipath-rich
Rayleigh fading channel model. Both unicasting (one source and one destination)
and multic... |
cs/0512093 | Construction of Turbo Code Interleavers from 3-Regular Hamiltonian
Graphs | cs.IT math.IT | In this letter we present a new construction of interleavers for turbo codes
from 3-regular Hamiltonian graphs. The interleavers can be generated using a
few parameters, which can be selected in such a way that the girth of the
interleaver graph (IG) becomes large, inducing a high summary distance. The
size of the se... |
cs/0512097 | Gaussian Channels with Feedback: Optimality, Fundamental Limitations,
and Connections of Communication, Estimation, and Control | cs.IT math.IT | Gaussian channels with memory and with noiseless feedback have been widely
studied in the information theory literature. However, a coding scheme to
achieve the feedback capacity is not available. In this paper, a coding scheme
is proposed to achieve the feedback capacity for Gaussian channels. The coding
scheme esse... |
cs/0512099 | Mathematical Models in Schema Theory | cs.AI | In this paper, a mathematical schema theory is developed. This theory has
three roots: brain theory schemas, grid automata, and block-shemas. In Section
2 of this paper, elements of the theory of grid automata necessary for the
mathematical schema theory are presented. In Section 3, elements of brain
theory necessary... |
cs/0512100 | The logic of interactive Turing reduction | cs.LO cs.AI math.LO | The paper gives a soundness and completeness proof for the implicative
fragment of intuitionistic calculus with respect to the semantics of
computability logic, which understands intuitionistic implication as
interactive algorithmic reduction. This concept -- more precisely, the
associated concept of reducibility -- ... |
cs/0512101 | On the Complexity of finding Stopping Distance in Tanner Graphs | cs.IT cs.CC math.IT | Two decision problems related to the computation of stopping sets in Tanner
graphs are shown to be NP-complete. NP-hardness of the problem of computing the
stopping distance of a Tanner graph follows as a consequence
|
cs/0512102 | Statistical Parameters of the Novel "Perekhresni stezhky" ("The
Cross-Paths") by Ivan Franko | cs.CL | In the paper, a complex statistical characteristics of a Ukrainian novel is
given for the first time. The distribution of word-forms with respect to their
size is studied. The linguistic laws by Zipf-Mandelbrot and Altmann-Menzerath
are analyzed.
|
cs/0601001 | Truecluster: robust scalable clustering with model selection | cs.AI | Data-based classification is fundamental to most branches of science. While
recent years have brought enormous progress in various areas of statistical
computing and clustering, some general challenges in clustering remain: model
selection, robustness, and scalability to large datasets. We consider the
important prob... |
cs/0601004 | Integration of navigation and action selection functionalities in a
computational model of cortico-basal ganglia-thalamo-cortical loops | cs.AI cs.RO | This article describes a biomimetic control architecture affording an animat
both action selection and navigation functionalities. It satisfies the survival
constraint of an artificial metabolism and supports several complementary
navigation strategies. It builds upon an action selection model based on the
basal gang... |
cs/0601005 | Analyzing language development from a network approach | cs.CL | In this paper we propose some new measures of language development using
network analyses, which is inspired by the recent surge of interests in network
studies of many real-world systems. Children's and care-takers' speech data
from a longitudinal study are represented as a series of networks, word forms
being taken... |
cs/0601006 | On the Joint Source-Channel Coding Error Exponent for Discrete
Memoryless Systems: Computation and Comparison with Separate Coding | cs.IT math.IT | We investigate the computation of Csiszar's bounds for the joint
source-channel coding (JSCC) error exponent, E_J, of a communication system
consisting of a discrete memoryless source and a discrete memoryless channel.
We provide equivalent expressions for these bounds and derive explicit formulas
for the rates where... |
cs/0601007 | The necessity and sufficiency of anytime capacity for stabilization of a
linear system over a noisy communication link Part I: scalar systems | cs.IT math.IT | We review how Shannon's classical notion of capacity is not enough to
characterize a noisy communication channel if the channel is intended to be
used as part of a feedback loop to stabilize an unstable scalar linear system.
While classical capacity is not enough, another sense of capacity (parametrized
by reliabilit... |
cs/0601009 | Gaussian Fading is the Worst Fading | cs.IT math.IT | The capacity of peak-power limited, single-antenna, non-coherent, flat-fading
channels with memory is considered. The emphasis is on the capacity pre-log,
i.e., on the limiting ratio of channel capacity to the logarithm of the
signal-to-noise ratio (SNR), as the SNR tends to infinity. It is shown that,
among all stat... |
cs/0601012 | Product Multicommodity Flow in Wireless Networks | cs.IT math.IT | We provide a tight approximate characterization of the $n$-dimensional
product multicommodity flow (PMF) region for a wireless network of $n$ nodes.
Separate characterizations in terms of the spectral properties of appropriate
network graphs are obtained in both an information theoretic sense and for a
combinatorial ... |
cs/0601017 | Weighted Norms of Ambiguity Functions and Wigner Distributions | cs.IT math.IT quant-ph | In this article new bounds on weighted p-norms of ambiguity functions and
Wigner functions are derived. Such norms occur frequently in several areas of
physics and engineering. In pulse optimization for Weyl--Heisenberg signaling
in wide-sense stationary uncorrelated scattering channels for example it is a
key step t... |
cs/0601022 | On the Fading Number of Multiple-Input Single-Output Fading Channels
with Memory | cs.IT math.IT | We derive new upper and lower bounds on the fading number of multiple-input
single-output (MISO) fading channels of general (not necessarily Gaussian)
regular law with spatial and temporal memory. The fading number is the second
term, after the double-logarithmic term, of the high signal-to-noise ratio
(SNR) expansio... |
cs/0601023 | Efficient Convergent Maximum Likelihood Decoding on Tail-Biting
Trellises | cs.IT math.IT | An algorithm for exact maximum likelihood(ML) decoding on tail-biting
trellises is presented, which exhibits very good average case behavior. An
approximate variant is proposed, whose simulated performance is observed to be
virtually indistinguishable from the exact one at all values of signal to noise
ratio, and whi... |
cs/0601028 | Superimposed Coded and Uncoded Transmissions of a Gaussian Source over
the Gaussian Channel | cs.IT math.IT | We propose to send a Gaussian source over an average-power limited additive
white Gaussian noise channel by transmitting a linear combination of the source
sequence and the result of its quantization using a high dimensional Gaussian
vector quantizer. We show that, irrespective of the rate of the vector
quantizer (as... |
cs/0601029 | Sending a Bi-Variate Gaussian Source over a Gaussian MAC | cs.IT math.IT | We consider a problem where a memoryless bi-variate Gaussian source is to be
transmitted over an additive white Gaussian multiple-access channel with two
transmitting terminals and one receiving terminal. The first transmitter only
sees the first source component and the second transmitter only sees the second
source... |
cs/0601031 | Divide-and-Evolve: a New Memetic Scheme for Domain-Independent Temporal
Planning | cs.AI | An original approach, termed Divide-and-Evolve is proposed to hybridize
Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the
domain of Temporal Planning Problems (TPPs). Whereas standard Memetic
Algorithms use local search methods to improve the evolutionary solutions, and
thus fail when the lo... |
cs/0601032 | Efficient Open World Reasoning for Planning | cs.AI cs.LO | We consider the problem of reasoning and planning with incomplete knowledge
and deterministic actions. We introduce a knowledge representation scheme
called PSIPLAN that can effectively represent incompleteness of an agent's
knowledge while allowing for sound, complete and tractable entailment in
domains where the se... |
cs/0601036 | On the complexity of computing the capacity of codes that avoid
forbidden difference patterns | cs.IT math.IT | We consider questions related to the computation of the capacity of codes
that avoid forbidden difference patterns. The maximal number of $n$-bit
sequences whose pairwise differences do not contain some given forbidden
difference patterns increases exponentially with $n$. The exponent is the
capacity of the forbidden... |
cs/0601037 | Constraint-based verification of abstract models of multitreaded
programs | cs.CL cs.PL | We present a technique for the automated verification of abstract models of
multithreaded programs providing fresh name generation, name mobility, and
unbounded control.
As high level specification language we adopt here an extension of
communication finite-state machines with local variables ranging over an
infini... |
cs/0601040 | New Technologies for Sustainable Urban Transport in Europe | cs.RO | 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... |
cs/0601041 | Oblivious channels | cs.IT math.IT | Let C = {x_1,...,x_N} \subset {0,1}^n be an [n,N] binary error correcting
code (not necessarily linear). Let e \in {0,1}^n be an error vector. A codeword
x in C is said to be "disturbed" by the error e if the closest codeword to x +
e is no longer x. Let A_e be the subset of codewords in C that are disturbed by
e. In... |
cs/0601042 | LPAR-05 Workshop: Empirically Successfull Automated Reasoning in
Higher-Order Logic (ESHOL) | cs.AI cs.LO | This workshop brings together practioners and researchers who are involved in
the everyday aspects of logical systems based on higher-order logic. We hope to
create a friendly and highly interactive setting for discussions around the
following four topics. Implementation and development of proof assistants based
on a... |
cs/0601043 | Combining Relational Algebra, SQL, Constraint Modelling, and Local
Search | cs.AI cs.LO | The goal of this paper is to provide a strong integration between constraint
modelling and relational DBMSs. To this end we propose extensions of standard
query languages such as relational algebra and SQL, by adding constraint
modelling capabilities to them. In particular, we propose non-deterministic
extensions of ... |
cs/0601044 | Genetic Programming, Validation Sets, and Parsimony Pressure | cs.LG | Fitness functions based on test cases are very common in Genetic Programming
(GP). This process can be assimilated to a learning task, with the inference of
models from a limited number of samples. This paper is an investigation on two
methods to improve generalization in GP-based learning: 1) the selection of the
be... |
cs/0601045 | PageRank without hyperlinks: Structural re-ranking using links induced
by language models | cs.IR cs.CL | Inspired by the PageRank and HITS (hubs and authorities) algorithms for Web
search, we propose a structural re-ranking approach to ad hoc information
retrieval: we reorder the documents in an initially retrieved set by exploiting
asymmetric relationships between them. Specifically, we consider generation
links, which... |
cs/0601046 | Better than the real thing? Iterative pseudo-query processing using
cluster-based language models | cs.IR cs.CL | We present a novel approach to pseudo-feedback-based ad hoc retrieval that
uses language models induced from both documents and clusters. First, we treat
the pseudo-feedback documents produced in response to the original query as a
set of pseudo-queries that themselves can serve as input to the retrieval
process. Obs... |
cs/0601047 | Automatic Detection of Trends in Dynamical Text: An Evolutionary
Approach | cs.IR cs.NE | This paper presents an evolutionary algorithm for modeling the arrival dates
of document streams, which is any time-stamped collection of documents, such as
newscasts, e-mails, IRC conversations, scientific journals archives and weblog
postings. This algorithm assigns frequencies (number of document arrivals per
time... |
cs/0601048 | Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective | cs.IT cs.DM math.IT | An interleaver is a critical component for the channel coding
performance of turbo codes. Algebraic constructions are
important because they admit analytical designs and
simple, practical hardware implementation. The spread factor of an
interleaver is a common measure for turbo coding
applications. Maximum-... |
cs/0601051 | A Constructive Semantic Characterization of Aggregates in ASP | cs.AI cs.LO cs.PL cs.SC | This technical note describes a monotone and continuous fixpoint operator to
compute the answer sets of programs with aggregates. The fixpoint operator
relies on the notion of aggregate solution. Under certain conditions, this
operator behaves identically to the three-valued immediate consequence operator
$\Phi^{aggr... |
cs/0601052 | Artificial and Biological Intelligence | cs.AI | This article considers evidence from physical and biological sciences to show
machines are deficient compared to biological systems at incorporating
intelligence. Machines fall short on two counts: firstly, unlike brains,
machines do not self-organize in a recursive manner; secondly, machines are
based on classical l... |
cs/0601053 | Wavefront Propagation and Fuzzy Based Autonomous Navigation | cs.RO | Path planning and obstacle avoidance are the two major issues in any
navigation system. Wavefront propagation algorithm, as a good path planner, can
be used to determine an optimal path. Obstacle avoidance can be achieved using
possibility theory. Combining these two functions enable a robot to
autonomously navigate ... |
cs/0601054 | Control of a Lightweight Flexible Robotic Arm Using Sliding Modes | cs.RO | This paper presents a robust control scheme for flexible link robotic
manipulators, which is based on considering the flexible mechanical structure
as a system with slow (rigid) and fast (flexible) modes that can be controlled
separately. The rigid dynamics is controlled by means of a robust sliding-mode
approach wit... |
cs/0601055 | A Hybrid Three Layer Architecture for Fire Agent Management in Rescue
Simulation Environment | cs.RO | This paper presents a new architecture called FAIS for imple- menting
intelligent agents cooperating in a special Multi Agent environ- ment, namely
the RoboCup Rescue Simulation System. This is a layered architecture which is
customized for solving fire extinguishing problem. Structural decision making
algorithms are... |
cs/0601056 | Dynamic Balance Control of Multi-arm Free-Floating Space Robots | cs.RO | This paper investigates the problem of the dynamic balance control of
multi-arm free-floating space robot during capturing an active object in close
proximity. The position and orientation of space base will be affected during
the operation of space manipulator because of the dynamics coupling between the
manipulator... |
cs/0601057 | Robust Motion Control for Mobile Manipulator Using Resolved Acceleration
and Proportional-Integral Active Force Control | cs.RO | A resolved acceleration control (RAC) and proportional-integral active force
control (PIAFC) is proposed as an approach for the robust motion control of a
mobile manipulator (MM) comprising a differentially driven wheeled mobile
platform with a two-link planar arm mounted on top of the platform. The study
emphasizes ... |
cs/0601058 | CAGD - Computer Aided Gripper Design for a Flexible Gripping System | cs.RO | This paper is a summary of the recently accomplished research work on
flexible gripping systems. The goal is to develop a gripper which can be used
for a great amount of geometrically variant workpieces. The economic aspect is
of particular importance during the whole development. The high flexibility of
the gripper ... |
cs/0601059 | A Descriptive Model of Robot Team and the Dynamic Evolution of Robot
Team Cooperation | cs.RO | At present, the research on robot team cooperation is still in qualitative
analysis phase and lacks the description model that can quantitatively describe
the dynamical evolution of team cooperative relationships with constantly
changeable task demand in Multi-robot field. First this paper whole and static
describes ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.