id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0612133 | Tales of Huffman | cs.IT cs.CC math.IT | We study the new problem of Huffman-like codes subject to individual
restrictions on the code-word lengths of a subset of the source words. These
are prefix codes with minimal expected code-word length for a random source
where additionally the code-word lengths of a subset of the source words is
prescribed, possibly... |
cs/0612136 | Experiments on predictability of word in context and information rate in
natural language | cs.IT math.IT | Based on data from a large-scale experiment with human subjects, we conclude
that the logarithm of probability to guess a word in context (unpredictability)
depends linearly on the word length. This result holds both for poetry and
prose, even though with prose, the subjects don't know the length of the
omitted word.... |
cs/0612137 | Turning Cluster Management into Data Management: A System Overview | cs.DB | This paper introduces the CondorJ2 cluster management system. Traditionally,
cluster management systems such as Condor employ a process-oriented approach
with little or no use of modern database system technology. In contrast,
CondorJ2 employs a data-centric, 3-tier web-application architecture for all
system functio... |
cs/0701002 | Relay Assisted F/TDMA Ad Hoc Networks: Node Classification, Power
Allocation and Relaying Strategies | cs.IT math.IT | This paper considers the design of relay assisted F/TDMA ad hoc networks with
multiple relay nodes each of which assists the transmission of a predefined
subset of source nodes to their respective destinations. Considering the sum
capacity as the performance metric, we solve the problem of optimally
allocating the to... |
cs/0701003 | Magnification Laws of Winner-Relaxing and Winner-Enhancing Kohonen
Feature Maps | cs.NE cs.IT math.IT | Self-Organizing Maps are models for unsupervised representation formation of
cortical receptor fields by stimuli-driven self-organization in laterally
coupled winner-take-all feedforward structures. This paper discusses
modifications of the original Kohonen model that were motivated by a potential
function, in their ... |
cs/0701006 | The Trapping Redundancy of Linear Block Codes | cs.IT math.IT | We generalize the notion of the stopping redundancy in order to study the
smallest size of a trapping set in Tanner graphs of linear block codes. In this
context, we introduce the notion of the trapping redundancy of a code, which
quantifies the relationship between the number of redundant rows in any
parity-check ma... |
cs/0701011 | Infinite-Alphabet Prefix Codes Optimal for $\beta$-Exponential Penalties | cs.IT cs.DS math.IT | Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set
of nonnegative integers. Although the countable number of inputs prevents usage
of the Huffman algorithm, there are nontrivial $P$ for which known methods find
a source code that is optimal in the sense of minimizing expected codeword
lengt... |
cs/0701012 | $D$-ary Bounded-Length Huffman 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, in which codes are
restricted to the... |
cs/0701013 | Attribute Value Weighting in K-Modes Clustering | cs.AI | In this paper, the traditional k-modes clustering algorithm is extended by
weighting attribute value matches in dissimilarity computation. The use of
attribute value weighting technique makes it possible to generate clusters with
stronger intra-similarities, and therefore achieve better clustering
performance. Experi... |
cs/0701016 | The Second Law and Informatics | cs.IT math.IT | A unification of thermodynamics and information theory is proposed. It is
argued that similarly to the randomness due to collisions in thermal systems,
the quenched randomness that exists in data files in informatics systems
contributes to entropy. Therefore, it is possible to define equilibrium and to
calculate temp... |
cs/0701017 | Energy-Efficient Power Control in Impulse Radio UWB Wireless Networks | cs.IT math.IT | In this paper, a game-theoretic model for studying power control for wireless
data networks in frequency-selective multipath environments is analyzed. The
uplink of an impulse-radio ultrawideband system is considered. The effects of
self-interference and multiple-access interference on the performance of
generic Rake... |
cs/0701018 | Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon
Codes | cs.IT math.IT | We investigate the decoding region for Algebraic Soft-Decision Decoding (ASD)
of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An
expression is derived for the error correction radius within which the
soft-decision decoder produces a list that contains the transmitted codeword.
The error radiu... |
cs/0701019 | Flow-optimized Cooperative Transmission for the Relay Channel | cs.IT math.IT | This paper describes an approach for half-duplex cooperative transmission in
a classical three-node relay channel. Assuming availability of channel state
information at nodes, the approach makes use of this information to optimize
distinct flows through the direct link from the source to the destination and
the path ... |
cs/0701024 | Secure Communication over Fading Channels | cs.IT cs.CR math.IT | The fading broadcast channel with confidential messages (BCC) is
investigated, where a source node has common information for two receivers
(receivers 1 and 2), and has confidential information intended only for
receiver 1. The confidential information needs to be kept as secret as possible
from receiver 2. The broad... |
cs/0701025 | Free deconvolution for signal processing applications | cs.IT math.IT | Situations in many fields of research, such as digital communications,
nuclear physics and mathematical finance, can be modelled with random matrices.
When the matrices get large, free probability theory is an invaluable tool for
describing the asymptotic behaviour of many systems. It will be shown how free
probabili... |
cs/0701026 | Analysis of Sequential Decoding Complexity Using the Berry-Esseen
Inequality | cs.IT math.IT | his study presents a novel technique to estimate the computational complexity
of sequential decoding using the Berry-Esseen theorem. Unlike the theoretical
bounds determined by the conventional central limit theorem argument, which
often holds only for sufficiently large codeword length, the new bound obtained
from t... |
cs/0701027 | The source coding game with a cheating switcher | cs.IT math.IT | Berger's paper `The Source Coding Game', IEEE Trans. Inform. Theory, 1971,
considers the problem of finding the rate-distortion function for an
adversarial source comprised of multiple known IID sources. The adversary,
called the `switcher', was allowed only causal access to the source
realizations and the rate-disto... |
cs/0701028 | Statistical keyword detection in literary corpora | cs.CL cs.IR physics.soc-ph | Understanding the complexity of human language requires an appropriate
analysis of the statistical distribution of words in texts. We consider the
information retrieval problem of detecting and ranking the relevant words of a
text by means of statistical information referring to the "spatial" use of the
words. Shanno... |
cs/0701030 | New Constructions of a Family of 2-Generator Quasi-Cyclic Two-Weight
Codes and Related Codes | cs.IT math.IT | Based on cyclic simplex codes, a new construction of a family of 2-generator
quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195,
8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126],
[208, 6, 135], [221, 6, 144] codes are thus obtained. Furthermre, binary
quasi-cyclic... |
cs/0701034 | Performance of Rake Receivers in IR-UWB Networks Using Energy-Efficient
Power Control | cs.IT math.IT | This paper studies the performance of partial-Rake (PRake) receivers in
impulse-radio ultrawideband wireless networks when an energy-efficient power
control scheme is adopted. Due to the large bandwidth of the system, the
multipath channel is assumed to be frequency-selective. By making use of
noncooperative game-the... |
cs/0701036 | Compression-based methods for nonparametric density estimation, on-line
prediction, regression and classification for time series | cs.IT math.IT | We address the problem of nonparametric estimation of characteristics for
stationary and ergodic time series. We consider finite-alphabet time series and
real-valued ones and the following four problems: i) estimation of the
(limiting) probability (or estimation of the density for real-valued time
series), ii) on-lin... |
cs/0701038 | Approximate Eigenstructure of LTV Channels with Compactly Supported
Spreading | cs.IT math.IT | In this article we obtain estimates on the approximate eigenstructure of
channels with a spreading function supported only on a set of finite measure
$|U|$.Because in typical application like wireless communication the spreading
function is a random process corresponding to a random Hilbert--Schmidt channel
operator ... |
cs/0701039 | On the Complexity of the Numerically Definite Syllogistic and Related
Fragments | cs.LO cs.AI cs.CC | In this paper, we determine the complexity of the satisfiability problem for
various logics obtained by adding numerical quantifiers, and other
constructions, to the traditional syllogistic. In addition, we demonstrate the
incompleteness of some recently proposed proof-systems for these logics.
|
cs/0701040 | Curve Tracking Control for Legged Locomotion in Horizontal Plane | cs.RO | We derive a hybrid feedback control law for the lateral leg spring (LLS)
model so that the center of mass of a legged runner follows a curved path in
horizontal plane. The control law enables the runner to change the placement
and the elasticity of its legs to move in a desired direction. Stable motion
along a curved... |
cs/0701041 | A Coding Theorem for a Class of Stationary Channels with Feedback | cs.IT math.IT | A coding theorem is proved for a class of stationary channels with feedback
in which the output Y_n = f(X_{n-m}^n, Z_{n-m}^n) is the function of the
current and past m symbols from the channel input X_n and the stationary
ergodic channel noise Z_n. In particular, it is shown that the feedback
capacity is equal to $$ ... |
cs/0701042 | Sending a Bivariate Gaussian Source over a Gaussian MAC with Feedback | cs.IT math.IT | We consider the problem of transmitting a bivariate Gaussian source over a
two-user additive Gaussian multiple-access channel with feedback. Each of the
transmitters observes one of the source components and tries to describe it to
the common receiver. We are interested in the minimal mean squared error at
which the ... |
cs/0701043 | Adaptive Alternating Minimization Algorithms | cs.IT math.IT math.OC | The classical alternating minimization (or projection) algorithm has been
successful in the context of solving optimization problems over two variables.
The iterative nature and simplicity of the algorithm has led to its application
to many areas such as signal processing, information theory, control, and
finance. A ... |
cs/0701047 | On vocabulary size of grammar-based codes | cs.IT cs.CL math.IT | We discuss inequalities holding between the vocabulary size, i.e., the number
of distinct nonterminal symbols in a grammar-based compression for a string,
and the excess length of the respective universal code, i.e., the code-based
analog of algorithmic mutual information. The aim is to strengthen inequalities
which ... |
cs/0701048 | Energy Conscious Interactive Communication for Sensor Networks | cs.IT math.IT | In this work, we are concerned with maximizing the lifetime of a cluster of
sensors engaged in single-hop communication with a base-station. In a
data-gathering network, the spatio-temporal correlation in sensor data induces
data-redundancy. Also, the interaction between two communicating parties is
well-known to red... |
cs/0701050 | A Simple Proof of the Entropy-Power Inequality via Properties of Mutual
Information | cs.IT math.IT | While most useful information theoretic inequalities can be deduced from the
basic properties of entropy or mutual information, Shannon's entropy power
inequality (EPI) seems to be an exception: available information theoretic
proofs of the EPI hinge on integral representations of differential entropy
using either Fi... |
cs/0701051 | Coding, Scheduling, and Cooperation in Wireless Sensor Networks | cs.IT math.IT | We consider a single-hop data gathering sensor cluster consisting of a set of
sensors that need to transmit data periodically to a base-station. We are
interested in maximizing the lifetime of this network. Even though the setting
of our problem is very simple, it turns out that the solution is far from easy.
The com... |
cs/0701052 | Time Series Forecasting: Obtaining Long Term Trends with Self-Organizing
Maps | cs.LG math.ST stat.TH | Kohonen self-organisation maps are a well know classification tool, commonly
used in a wide variety of problems, but with limited applications in time
series forecasting context. In this paper, we propose a forecasting method
specifically designed for multi-dimensional long-term trends prediction, with a
double appli... |
cs/0701053 | A Case For Amplify-Forward Relaying in the Block-Fading Multi-Access
Channel | cs.IT math.IT | This paper demonstrates the significant gains that multi-access users can
achieve from sharing a single amplify-forward relay in slow fading
environments. The proposed protocol, namely the multi-access relay
amplify-forward, allows for a low-complexity relay and achieves the optimal
diversity-multiplexing trade-off a... |
cs/0701055 | Bounds on Space-Time-Frequency Dimensionality | cs.IT math.IT | We bound the number of electromagnetic signals which may be observed over a
frequency range $2W$ for a time $T$ within a region of space enclosed by a
radius $R$. Our result implies that broadband fields in space cannot be
arbitrarily complex: there is a finite amount of information which may be
extracted from a regi... |
cs/0701056 | Space-Time-Frequency Degrees of Freedom: Fundamental Limits for Spatial
Information | cs.IT math.IT | We bound the number of electromagnetic signals which may be observed over a
frequency range $[F-W,F+W]$ a time interval $[0,T]$ within a sphere of radius
$R$. We show that the such constrained signals may be represented by a series
expansion whose terms are bounded exponentially to zero beyond a threshold. Our
result... |
cs/0701057 | Cooperative Optimization for Energy Minimization: A Case Study of Stereo
Matching | cs.CV cs.AI | Often times, individuals working together as a team can solve hard problems
beyond the capability of any individual in the team. Cooperative optimization
is a newly proposed general method for attacking hard optimization problems
inspired by cooperation principles in team playing. It has an established
theoretical fo... |
cs/0701058 | Precoding in Multiple-Antenna Broadcast Systems with a Probabilistic
Viewpoint | cs.IT math.IT | In this paper, we investigate the minimum average transmit energy that can be
obtained in multiple antenna broadcast systems with channel inversion
technique. The achievable gain can be significantly higher than the
conventional gains that are mentioned in methods like perturbation technique of
Peel, et al. In order ... |
cs/0701059 | Enhancing Sensor Network Lifetime Using Interactive Communication | cs.IT math.IT | We are concerned with maximizing the lifetime of a data-gathering wireless
sensor network consisting of set of nodes directly communicating with a
base-station. We model this scenario as the m-message interactive communication
between multiple correlated informants (sensor nodes) and a recipient
(base-station). With ... |
cs/0701060 | Duadic Group Algebra Codes | cs.IT math.IT quant-ph | Duadic group algebra codes are a generalization of quadratic residue codes.
This paper settles an open problem raised by Zhu concerning the existence of
duadic group algebra codes. These codes can be used to construct degenerate
quantum stabilizer codes that have the nice feature that many errors of small
weight do n... |
cs/0701061 | Conjugate Gradient Projection Approach for Multi-Antenna Gaussian
Broadcast Channels | cs.IT math.IT | It has been shown recently that the dirty-paper coding is the optimal
strategy for maximizing the sum rate of multiple-input multiple-output Gaussian
broadcast channels (MIMO BC). Moreover, by the channel duality, the nonconvex
MIMO BC sum rate problem can be transformed to the convex dual MIMO
multiple-access channe... |
cs/0701062 | Network Coding over a Noisy Relay : a Belief Propagation Approach | cs.IT math.IT | In recent years, network coding has been investigated as a method to obtain
improvements in wireless networks. A typical assumption of previous work is
that relay nodes performing network coding can decode the messages from sources
perfectly. On a simple relay network, we design a scheme to obtain network
coding gain... |
cs/0701063 | Hierarchical Decoupling Principle of a MIMO-CDMA Channel in Asymptotic
Limits | cs.IT math.IT | We analyze an uplink of a fast flat fading MIMO-CDMA channel in the case
where the data symbol vector for each user follows an arbitrary distribution.
The spectral efficiency of the channel with CSI at the receiver is evaluated
analytically with the replica method. The main result is that the hierarchical
decoupling ... |
cs/0701065 | Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than
their Rate-1/3 Parent Codes? | cs.IT math.IT | In this paper we concentrate on rate-1/3 systematic parallel concatenated
convolutional codes and their rate-1/2 punctured child codes. Assuming
maximum-likelihood decoding over an additive white Gaussian channel, we
demonstrate that a rate-1/2 non-systematic child code can exhibit a lower error
floor than that of it... |
cs/0701066 | Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization | cs.IT math.IT | In this paper, we propose to study and optimize a very general class of LDPC
codes whose variable nodes belong to finite sets with different orders. We
named this class of codes Hybrid LDPC codes. Although efficient optimization
techniques exist for binary LDPC codes and more recently for non-binary LDPC
codes, they ... |
cs/0701067 | On Four-group ML Decodable Distributed Space Time Codes for Cooperative
Communication | cs.IT math.IT | A construction of a new family of distributed space time codes (DSTCs) having
full diversity and low Maximum Likelihood (ML) decoding complexity is provided
for the two phase based cooperative diversity protocols of Jing-Hassibi and the
recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF)
protocol ... |
cs/0701068 | Distributed Space-Time Codes for Cooperative Networks with Partial CSI | cs.IT math.IT | Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for
the two phase transmission based cooperative diversity protocol of Jing-Hassibi
and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are
reported, when the relay nodes are assumed to have knowledge of the phase
component of t... |
cs/0701070 | On formulas for decoding binary cyclic codes | cs.IT math.IT | We adress the problem of the algebraic decoding of any cyclic code up to the
true minimum distance. For this, we use the classical formulation of the
problem, which is to find the error locator polynomial in terms of the syndroms
of the received word. This is usually done with the Berlekamp-Massey algorithm
in the ca... |
cs/0701072 | Tagging, Folksonomy & Co - Renaissance of Manual Indexing? | cs.IR | This paper gives an overview of current trends in manual indexing on the Web.
Along with a general rise of user generated content there are more and more
tagging systems that allow users to annotate digital resources with tags
(keywords) and share their annotations with other users. Tagging is frequently
seen in cont... |
cs/0701077 | Asynchronous Distributed Searchlight Scheduling | cs.MA cs.RO | This paper develops and compares two simple asynchronous distributed
searchlight scheduling algorithms for multiple robotic agents in nonconvex
polygonal environments. A searchlight is a ray emitted by an agent which cannot
penetrate the boundary of the environment. A point is detected by a searchlight
if and only if... |
cs/0701078 | Low SNR Capacity of Fading Channels -- MIMO and Delay Spread | cs.IT math.IT | Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels
are considered, with no channel state information at the transmitter and
receiver. The fading is assumed to be correlated in time and independent from
antenna to antenna. Peak and average transmit power constraints are imposed,
either on the... |
cs/0701079 | Practical Binary Adaptive Block Coder | cs.IT cs.DS math.IT | This paper describes design of a low-complexity algorithm for adaptive
encoding/ decoding of binary sequences produced by memoryless sources. The
algorithm implements universal block codes constructed for a set of contexts
identified by the numbers of non-zero bits in previous bits in a sequence. We
derive a precise ... |
cs/0701080 | Analysis of the Sufficient Path Elimination Window for the
Maximum-Likelihood Sequential-Search Decoding Algorithm for Binary
Convolutional Codes | cs.IT math.IT | A common problem on sequential-type decoding is that at the signal-to-noise
ratio (SNR) below the one corresponding to the cutoff rate, the average
decoding complexity per information bit and the required stack size grow
rapidly with the information length. In order to alleviate the problem in the
maximum-likelihood ... |
cs/0701083 | A Backtracking-Based Algorithm for Computing Hypertree-Decompositions | cs.DS cs.AI | Hypertree decompositions of hypergraphs are a generalization of tree
decompositions of graphs. The corresponding hypertree-width is a measure for
the cyclicity and therefore tractability of the encoded computation problem.
Many NP-hard decision and computation problems are known to be tractable on
instances whose str... |
cs/0701084 | Pseudo-codeword Landscape | cs.IT cond-mat.stat-mech math.IT | We discuss the performance of Low-Density-Parity-Check (LDPC) codes decoded
by means of Linear Programming (LP) at moderate and large
Signal-to-Noise-Ratios (SNR). Utilizing a combination of the previously
introduced pseudo-codeword-search method and a new "dendro" trick, which allows
us to reduce the complexity of t... |
cs/0701085 | Variations on the Fibonacci Universal Code | cs.IT cs.CR math.IT | This note presents variations on the Fibonacci universal code, that may also
be called the Gopala-Hemachandra code, that can have applications in source
coding as well as in cryptography.
|
cs/0701086 | Loop Calculus and Belief Propagation for q-ary Alphabet: Loop Tower | cs.IT cond-mat.stat-mech math.IT | Loop Calculus introduced in [Chertkov, Chernyak '06] constitutes a new
theoretical tool that explicitly expresses the symbol Maximum-A-Posteriori
(MAP) solution of a general statistical inference problem via a solution of the
Belief Propagation (BP) equations. This finding brought a new significance to
the BP concept... |
cs/0701087 | Artificiality in Social Sciences | cs.MA | This text provides with an introduction to the modern approach of
artificiality and simulation in social sciences. It presents the relationship
between complexity and artificiality, before introducing the field of
artificial societies which greatly benefited from the computer power fast
increase, gifting social scien... |
cs/0701089 | Constructive Dimension and Turing Degrees | cs.CC cs.IT math.IT | This paper examines the constructive Hausdorff and packing dimensions of
Turing degrees. The main result is that every infinite sequence S with
constructive Hausdorff dimension dim_H(S) and constructive packing dimension
dim_P(S) is Turing equivalent to a sequence R with dim_H(R) <= (dim_H(S) /
dim_P(S)) - epsilon, f... |
cs/0701090 | Ergodic Capacity of Discrete- and Continuous-Time, Frequency-Selective
Rayleigh Fading Channels with Correlated Scattering | cs.IT math.IT | We study the ergodic capacity of a frequency-selective Rayleigh fading
channel with correlated scattering, which finds application in the area of UWB.
Under an average power constraint, we consider a single-user, single-antenna
transmission. Coherent reception is assumed with full CSI at the receiver and
no CSI at th... |
cs/0701091 | Iterative LDPC decoding using neighborhood reliabilities | cs.IT math.IT | In this paper we study the impact of the processing order of nodes of a
bipartite graph, on the performance of an iterative message-passing decoding.
To this end, we introduce the concept of neighborhood reliabilities of graph's
nodes. Nodes reliabilities are calculated at each iteration and then are used
to obtain a... |
cs/0701092 | The Multiplexing Gain of MIMO X-Channels with Partial Transmit
Side-Information | cs.IT math.IT | In this paper, we obtain the scaling laws of the sum-rate capacity of a MIMO
X-channel, a 2 independent sender, 2 independent receiver channel with messages
from each transmitter to each receiver, at high signal to noise ratios (SNR).
The X-channel has sparked recent interest in the context of cooperative
networks an... |
cs/0701093 | Throughput Scaling Laws for Wireless Networks with Fading Channels | cs.IT math.IT | A network of $n$ wireless communication links is considered. Fading is
assumed to be the dominant factor affecting the strength of the channels
between nodes. The objective is to analyze the achievable throughput of the
network when power allocation is allowed. By proposing a decentralized on-off
power allocation str... |
cs/0701095 | Propositional theories are strongly equivalent to logic programs | cs.AI cs.LO | This paper presents a property of propositional theories under the answer
sets semantics (called Equilibrium Logic for this general syntax): any theory
can always be reexpressed as a strongly equivalent disjunctive logic program,
possibly with negation in the head. We provide two different proofs for this
result: one... |
cs/0701097 | MacWilliams Identity for the Rank Metric | cs.IT math.IT | This paper investigates the relationship between the rank weight distribution
of a linear code and that of its dual code. The main result of this paper is
that, similar to the MacWilliams identity for the Hamming metric, the rank
weight distribution of any linear code can be expressed as an analytical
expression of t... |
cs/0701098 | Packing and Covering Properties of Rank Metric Codes | cs.IT math.IT | This paper investigates packing and covering properties of codes with the
rank metric. First, we investigate packing properties of rank metric codes.
Then, we study sphere covering properties of rank metric codes, derive bounds
on their parameters, and investigate their asymptotic covering properties.
|
cs/0701099 | On the Feedback Capacity of Power Constrained Gaussian Noise Channels
with Memory | cs.IT math.IT | For a stationary additive Gaussian-noise channel with a rational noise power
spectrum of a finite-order $L$, we derive two new results for the feedback
capacity under an average channel input power constraint. First, we show that a
very simple feedback-dependent Gauss-Markov source achieves the feedback
capacity, and... |
cs/0701100 | Delayed Feedback Capacity of Stationary Sources over Linear Gaussian
Noise Channels | cs.IT math.IT | We consider a linear Gaussian noise channel used with delayed feedback. The
channel noise is assumed to be a ARMA (autoregressive and/or moving average)
process. We reformulate the Gaussian noise channel into an intersymbol
interference channel with white noise, and show that the delayed-feedback of
the original chan... |
cs/0701102 | Coding Solutions for the Secure Biometric Storage Problem | cs.IT cs.CR math.IT | The paper studies the problem of securely storing biometric passwords, such
as fingerprints and irises. With the help of coding theory Juels and Wattenberg
derived in 1999 a scheme where similar input strings will be accepted as the
same biometric. In the same time nothing could be learned from the stored data.
They ... |
cs/0701103 | Analysis and design of raptor codes for joint decoding using Information
Content evolution | cs.IT math.IT | In this paper, we present an analytical analysis of the convergence of raptor
codes under joint decoding over the binary input additive white noise channel
(BIAWGNC), and derive an optimization method. We use Information Content
evolution under Gaussian approximation, and focus on a new decoding scheme that
proves to... |
cs/0701104 | Why is a new Journal of Informetrics needed? | cs.DL cs.DB | In our study we analysed 3.889 records which were indexed in the Library and
Information Science Abstracts (LISA) database in the research field of
informetrics. We can show the core journals of the field via a Bradford (power
law) distribution and corroborate on the basis of the restricted LISA data set
that it was ... |
cs/0701105 | A Delta Debugger for ILP Query Execution | cs.PL cs.LG | Because query execution is the most crucial part of Inductive Logic
Programming (ILP) algorithms, a lot of effort is invested in developing faster
execution mechanisms. These execution mechanisms typically have a low-level
implementation, making them hard to debug. Moreover, other factors such as the
complexity of th... |
cs/0701112 | (l,s)-Extension of Linear Codes | cs.IT math.CO math.IT | We construct new linear codes with high minimum distance d. In at least 12
cases these codes improve the minimum distance of the previously known best
linear codes for fixed parameters n,k. Among these new codes there is an
optimal ternary [88,8,54] code.
We develop an algorithm, which starts with already good code... |
cs/0701114 | The problem determination of Functional Dependencies between attributes
Relation Scheme in the Relational Data Model. El problema de determinar
Dependencias Funcionales entre atributos en los esquemas en el Modelo
Relacional | cs.DB cs.DS | An alternative definition of the concept is given of functional dependence
among the attributes of the relational schema in the Relational Model, this
definition is obtained in terms of the set theory. For that which a theorem is
demonstrated that establishes equivalence and on the basis theorem an algorithm
is built... |
cs/0701115 | Browser-based distributed evolutionary computation: performance and
scaling behavior | cs.DC cs.NE | The challenge of ad-hoc computing is to find the way of taking advantage of
spare cycles in an efficient way that takes into account all capabilities of
the devices and interconnections available to them. In this paper we explore
distributed evolutionary computation based on the Ruby on Rails framework,
which overlay... |
cs/0701116 | The Impact of CSI and Power Allocation on Relay Channel Capacity and
Cooperation Strategies | cs.IT math.IT | Capacity gains from transmitter and receiver cooperation are compared in a
relay network where the cooperating nodes are close together. Under
quasi-static phase fading, when all nodes have equal average transmit power
along with full channel state information (CSI), it is shown that transmitter
cooperation outperfor... |
cs/0701117 | Maximum Entropy in the framework of Algebraic Statistics: A First Step | cs.IT cs.SC math.IT | Algebraic statistics is a recently evolving field, where one would treat
statistical models as algebraic objects and thereby use tools from
computational commutative algebra and algebraic geometry in the analysis and
computation of statistical models. In this approach, calculation of parameters
of statistical models ... |
cs/0701118 | Optimal Order of Decoding for Max-Min Fairness in $K$-User Memoryless
Interference Channels | cs.IT math.IT | A $K$-user memoryless interference channel is considered where each receiver
sequentially decodes the data of a subset of transmitters before it decodes the
data of the designated transmitter. Therefore, the data rate of each
transmitter depends on (i) the subset of receivers which decode the data of
that transmitter... |
cs/0701119 | The framework for simulation of dynamics of mechanical aggregates | cs.CE | A framework for simulation of dynamics of mechanical aggregates has been
developed. This framework enables us to build model of aggregate from models of
its parts. Framework is a part of universal framework for science and
engineering.
|
cs/0701120 | Algorithmic 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 $mu$ by the algorithmic complexity of
$mu$. Here we assume we are at a time $t>1$ and already observed $x=x_1...x_t$.
We bound... |
cs/0701123 | Feasible Depth | cs.CC cs.IT math.IT | This paper introduces two complexity-theoretic formulations of Bennett's
logical depth: finite-state depth and polynomial-time depth. It is shown that
for both formulations, trivial and random infinite sequences are shallow, and a
slow growth law holds, implying that deep sequences cannot be created easily
from shall... |
cs/0701124 | Group Secret Key Generation Algorithms | cs.IT cs.CR math.IT | We consider a pair-wise independent network where every pair of terminals in
the network observes a common pair-wise source that is independent of all the
sources accessible to the other pairs. We propose a method for secret key
agreement in such a network that is based on well-established point-to-point
techniques a... |
cs/0701125 | Universal Algorithmic Intelligence: A mathematical top->down approach | cs.AI cs.LG | Sequential decision theory formally solves the problem of rational agents in
uncertain worlds if the true environmental prior probability distribution is
known. Solomonoff's theory of universal induction formally solves the problem
of sequence prediction for unknown prior distribution. We combine both ideas
and get a... |
cs/0701126 | Optimal Throughput-Diversity-Delay Tradeoff in MIMO ARQ Block-Fading
Channels | cs.IT math.IT | In this paper, we consider an automatic-repeat-request (ARQ) retransmission
protocol signaling over a block-fading multiple-input, multiple-output (MIMO)
channel. Unlike previous work, we allow for multiple fading blocks within each
transmission (ARQ round), and we constrain the transmitter to fixed rate codes
constr... |
cs/0701127 | A novel set of rotationally and translationally invariant features for
images based on the non-commutative bispectrum | cs.CV cs.AI | We propose a new set of rotationally and translationally invariant features
for image or pattern recognition and classification. The new features are cubic
polynomials in the pixel intensities and provide a richer representation of the
original image than most existing systems of invariants. Our construction is
based... |
cs/0701129 | Space-time codes with controllable ML decoding complexity for any number
of transmit antennas | cs.IT math.IT | We construct a class of linear space-time block codes for any number of
transmit antennas that have controllable ML decoding complexity with a maximum
rate of 1 symbol per channel use. The decoding complexity for $M$ transmit
antennas can be varied from ML decoding of $2^{\lceil \log_2M \rceil -1}$
symbols together t... |
cs/0701131 | Effective Beam Width of Directional Antennas in Wireless Ad Hoc Networks | cs.IT math.IT | It is known at a qualitative level that directional antennas can be used to
boost the capacity of wireless ad hoc networks. Lacking is a measure to
quantify this advantage and to compare directional antennas of different
footprint patterns. This paper introduces the concept of the effective beam
width (and the effect... |
cs/0701135 | Complex networks and human language | cs.CL | This paper introduces how human languages can be studied in light of recent
development of network theories. There are two directions of exploration. One
is to study networks existing in the language system. Various lexical networks
can be built based on different relationships between words, being semantic or
syntac... |
cs/0701136 | Citation Advantage For OA Self-Archiving Is Independent of Journal
Impact Factor, Article Age, and Number of Co-Authors | cs.IR cs.DL | Eysenbach has suggested that the OA (Green) self-archiving advantage might
just be an artifact of potential uncontrolled confounding factors such as
article age (older articles may be both more cited and more likely to be
self-archived), number of authors (articles with more authors might be more
cited and more self-... |
cs/0701137 | The Open Access Citation Advantage: Quality Advantage Or Quality Bias? | cs.IR cs.DL | Many studies have now reported the positive correlation between Open Access
(OA) self-archiving and citation counts ("OA Advantage," OAA). But does this
OAA occur because (QB) authors are more likely to self-selectively self-archive
articles that are more likely to be cited (self-selection "Quality Bias": QB)?
or bec... |
cs/0701139 | Time and the Prisoner's Dilemma | cs.GT cs.AI | This paper examines the integration of computational complexity into game
theoretic models. The example focused on is the Prisoner's Dilemma, repeated
for a finite length of time. We show that a minimal bound on the players'
computational ability is sufficient to enable cooperative behavior.
In addition, a variant ... |
cs/0701143 | Dirac Notation, Fock Space and Riemann Metric Tensor in Information
Retrieval Models | cs.IR math-ph math.MP | Using Dirac Notation as a powerful tool, we investigate the three classical
Information Retrieval (IR) models and some their extensions. We show that
almost all such models can be described by vectors in Occupation Number
Representations (ONR) of Fock spaces with various specifications on, e.g.,
occupation number, in... |
cs/0701146 | State constraints and list decoding for the AVC | cs.IT math.IT | List decoding for arbitrarily varying channels (AVCs) under state constraints
is investigated. It is shown that rates within $\epsilon$ of the randomized
coding capacity of AVCs with input-dependent state can be achieved under
maximal error with list decoding using lists of size $O(1/\epsilon)$. Under
average error a... |
cs/0701149 | Power-Bandwidth Tradeoff in Dense Multi-Antenna Relay Networks | cs.IT math.IT | We consider a dense fading multi-user network with multiple active
multi-antenna source-destination pair terminals communicating simultaneously
through a large common set of $K$ multi-antenna relay terminals in the full
spatial multiplexing mode. We use Shannon-theoretic tools to analyze the
tradeoff between energy e... |
cs/0701150 | Contains and Inside relationships within combinatorial Pyramids | cs.CV | Irregular pyramids are made of a stack of successively reduced graphs
embedded in the plane. Such pyramids are used within the segmentation framework
to encode a hierarchy of partitions. The different graph models used within the
irregular pyramid framework encode different types of relationships between
regions. Thi... |
cs/0701152 | Characterization of Rate Region in Interference Channels with
Constrained Power | cs.IT math.IT | In this paper, an $n$-user Gaussian interference channel, where the power of
the transmitters are subject to some upper-bounds is studied. We obtain a
closed-form expression for the rate region of such a channel based on the
Perron-Frobenius theorem. While the boundary of the rate region for the case of
unconstrained... |
cs/0701155 | Data Cube: A Relational Aggregation Operator Generalizing Group-By,
Cross-Tab, and Sub-Totals | cs.DB | Data analysis applications typically aggregate data across many dimensions
looking for anomalies or unusual patterns. The SQL aggregate functions and the
GROUP BY operator produce zero-dimensional or one-dimensional aggregates.
Applications need the N-dimensional generalization of these operators. This
paper defines ... |
cs/0701156 | Data Management: Past, Present, and Future | cs.DB | Soon most information will be available at your fingertips, anytime,
anywhere. Rapid advances in storage, communications, and processing allow us
move all information into Cyberspace. Software to define, search, and visualize
online information is also a key to creating and accessing online information.
This article ... |
cs/0701157 | A Critique of ANSI SQL Isolation Levels | cs.DB | ANSI SQL-92 defines Isolation Levels in terms of phenomena: Dirty Reads,
Non-Repeatable Reads, and Phantoms. This paper shows that these phenomena and
the ANSI SQL definitions fail to characterize several popular isolation levels,
including the standard locking implementations of the levels. Investigating the
ambigui... |
cs/0701158 | Queues Are Databases | cs.DB | Message-oriented-middleware (MOM) has become an small industry. MOM offers
queued transaction processing as an advance over pure client-server transaction
processing. This note makes four points: Queued transaction processing is less
general than direct transaction processing. Queued systems are built on top of
direc... |
cs/0701159 | Supporting Finite Element Analysis with a Relational Database Backend,
Part I: There is Life beyond Files | cs.DB cs.CE | In this paper, we show how to use a Relational Database Management System in
support of Finite Element Analysis. We believe it is a new way of thinking
about data management in well-understood applications to prepare them for two
major challenges, - size and integration (globalization). Neither extreme size
nor integ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.