id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0801.3703 | On minimality of convolutional ring encoders | cs.IT math.IT | Convolutional codes are considered with code sequences modelled as
semi-infinite Laurent series. It is wellknown that a convolutional code C over
a finite group G has a minimal trellis representation that can be derived from
code sequences. It is also wellknown that, for the case that G is a finite
field, any polynom... |
0801.3773 | Graph-Based Classification of Self-Dual Additive Codes over Finite
Fields | cs.IT math.CO math.IT quant-ph | Quantum stabilizer states over GF(m) can be represented as self-dual additive
codes over GF(m^2). These codes can be represented as weighted graphs, and
orbits of graphs under the generalized local complementation operation
correspond to equivalence classes of codes. We have previously used this fact
to classify self... |
0801.3817 | Robustness Evaluation of Two CCG, a PCFG and a Link Grammar Parsers | cs.CL | Robustness in a parser refers to an ability to deal with exceptional
phenomena. A parser is robust if it deals with phenomena outside its normal
range of inputs. This paper reports on a series of robustness evaluations of
state-of-the-art parsers in which we concentrated on one aspect of robustness:
its ability to pa... |
0801.3837 | Universal Fingerprinting: Capacity and Random-Coding Exponents | cs.IT math.IT | This paper studies fingerprinting (traitor tracing) games in which the number
of colluders and the collusion channel are unknown. The fingerprints are
embedded into host sequences representing signals to be protected and provide
the receiver with the capability to trace back pirated copies to the colluders.
The collu... |
0801.3864 | Between conjecture and memento: shaping a collective emotional
perception of the future | cs.CL cs.GL | Large scale surveys of public mood are costly and often impractical to
perform. However, the web is awash with material indicative of public mood such
as blogs, emails, and web queries. Inexpensive content analysis on such
extensive corpora can be used to assess public mood fluctuations. The work
presented here is co... |
0801.3871 | On the Scaling Window of Model RB | cs.CC cond-mat.stat-mech cs.AI | This paper analyzes the scaling window of a random CSP model (i.e. model RB)
for which we can identify the threshold points exactly, denoted by $r_{cr}$ or
$p_{cr}$. For this model, we establish the scaling window
$W(n,\delta)=(r_{-}(n,\delta), r_{+}(n,\delta))$ such that the probability of a
random instance being sa... |
0801.3875 | Towards a Real-Time Data Driven Wildland Fire Model | physics.ao-ph cs.CE | A wildland fire model based on semi-empirical relations for the spread rate
of a surface fire and post-frontal heat release is coupled with the Weather
Research and Forecasting atmospheric model (WRF). The propagation of the fire
front is implemented by a level set method. Data is assimilated by a morphing
ensemble K... |
0801.3878 | Hash Property and Coding Theorems for Sparse Matrices and
Maximum-Likelihood Coding | cs.IT math.IT | The aim of this paper is to prove the achievability of several coding
problems by using sparse matrices (the maximum column weight grows
logarithmically in the block length) and maximal-likelihood (ML) coding. These
problems are the Slepian-Wolf problem, the Gel'fand-Pinsker problem, the
Wyner-Ziv problem, and the On... |
0801.3880 | Spectral efficiency and optimal medium access control of random access
systems over large random spreading CDMA | cs.IT math.IT | This paper analyzes the spectral efficiency as a function of medium access
control (MAC) for large random spreading CDMA random access systems that employ
a linear receiver. It is shown that located at higher than the physical layer,
MAC along with spreading and power allocation can effectively perform spectral
effic... |
0801.3908 | Encoding changing country codes for the Semantic Web with ISO 3166 and
SKOS | cs.IR | This paper shows how authority files can be encoded for the Semantic Web with
the Simple Knowledge Organisation System (SKOS). In particular the application
of SKOS for encoding the structure, management, and utilization of country
codes as defined in ISO 3166 is demonstrated. The proposed encoding gives a use
case f... |
0801.3926 | On the Weight Distribution of the Extended Quadratic Residue Code of
Prime 137 | cs.IT cs.DM math.IT | The Hamming weight enumerator function of the formally self-dual even, binary
extended quadratic residue code of prime p = 8m + 1 is given by Gleason's
theorem for singly-even code. Using this theorem, the Hamming weight
distribution of the extended quadratic residue is completely determined once
the number of codewo... |
0801.3971 | A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem | cs.NE cs.CE | A Bayesian optimization algorithm for the nurse scheduling problem is
presented, which involves choosing a suitable scheduling rule from a set for
each nurses assignment. Unlike our previous work that used Gas to implement
implicit learning, the learning in the proposed algorithm is explicit, ie.
Eventually, we will ... |
0801.3983 | New Upper Bounds on Sizes of Permutation Arrays | cs.IT math.IT | A permutation array(or code) of length $n$ and distance $d$, denoted by
$(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements
such that the Hamming distance between distinct members
$\mathbf{x},\mathbf{y}\in C$ is at least $d$. Let $P(n,d)$ denote the maximum
size of an $(n,d)$ PA. New upper bo... |
0801.3986 | New Lower Bounds on Sizes of Permutation Arrays | cs.IT math.IT | A permutation array(or code) of length $n$ and distance $d$, denoted by
$(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements
such that the Hamming distance between distinct members
$\mathbf{x},\mathbf{y}\in C$ is at least $d$. Let $P(n,d)$ denote the maximum
size of an $(n,d)$ PA. This corresp... |
0801.3987 | New Constructions of Permutation Arrays | cs.IT math.IT | A permutation array(permutation code, PA) of length $n$ and distance $d$,
denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$
elements such that the Hamming distance between distinct members
$\mathbf{x},\mathbf{y}\in C$ is at least $d$. In this correspondence, we
present two constructions o... |
0801.4024 | Set-based complexity and biological information | cs.IT cs.CC math.IT q-bio.QM | It is not obvious what fraction of all the potential information residing in
the molecules and structures of living systems is significant or meaningful to
the system. Sets of random sequences or identically repeated sequences, for
example, would be expected to contribute little or no useful information to a
cell. Th... |
0801.4048 | High Performance Cooperative Transmission Protocols Based on Multiuser
Detection and Network Coding | cs.IT math.IT | Cooperative transmission is an emerging communication technique that takes
advantage of the broadcast nature of wireless channels. However, due to low
spectral efficiency and the requirement of orthogonal channels, its potential
for use in future wireless networks is limited. In this paper, by making use of
multiuser... |
0801.4061 | The optimal assignment kernel is not positive definite | cs.LG | We prove that the optimal assignment kernel, proposed recently as an attempt
to embed labeled graphs and more generally tuples of basic data to a Hilbert
space, is in fact not always positive definite.
|
0801.4119 | Strategic Alert Throttling for Intrusion Detection Systems | cs.NE cs.CR | Network intrusion detection systems are themselves becoming targets of
attackers. Alert flood attacks may be used to conceal malicious activity by
hiding it among a deluge of false alerts sent by the attacker. Although these
types of attacks are very hard to stop completely, our aim is to present
techniques that impr... |
0801.4129 | Scaling Laws and Techniques in Decentralized Processing of Interfered
Gaussian Channels | cs.IT math.IT | The scaling laws of the achievable communication rates and the corresponding
upper bounds of distributed reception in the presence of an interfering signal
are investigated. The scheme includes one transmitter communicating to a remote
destination via two relays, which forward messages to the remote destination
throu... |
0801.4190 | Phylogenies without Branch Bounds: Contracting the Short, Pruning the
Deep | q-bio.PE cs.CE cs.DS math.PR math.ST stat.TH | We introduce a new phylogenetic reconstruction algorithm which, unlike most
previous rigorous inference techniques, does not rely on assumptions regarding
the branch lengths or the depth of the tree. The algorithm returns a forest
which is guaranteed to contain all edges that are: 1) sufficiently long and 2)
sufficie... |
0801.4194 | A statistical mechanical interpretation of algorithmic information
theory | cs.IT cs.CC math.IT math.PR quant-ph | We develop a statistical mechanical interpretation of algorithmic information
theory by introducing the notion of thermodynamic quantities, such as free
energy, energy, statistical mechanical entropy, and specific heat, into
algorithmic information theory. We investigate the properties of these
quantities by means of... |
0801.4198 | Microscopic Analysis for Decoupling Principle of Linear Vector Channel | cs.IT math.IT | This paper studies the decoupling principle of a linear vector channel, which
is an extension of CDMA and MIMO channels. We show that the scalar-channel
characterization obtained via the decoupling principle is valid not only for
collections of a large number of elements of input vector, as discussed in
previous stud... |
0801.4287 | Movie Recommendation Systems Using An Artificial Immune System | cs.NE cs.AI | We apply the Artificial Immune System (AIS) technology to the Collaborative
Filtering (CF) technology when we build the movie recommendation system. Two
different affinity measure algorithms of AIS, Kendall tau and Weighted Kappa,
are used to calculate the correlation coefficients for this movie
recommendation system... |
0801.4305 | Risk-Seeking versus Risk-Avoiding Investments in Noisy Periodic
Environments | q-fin.PM cs.CE physics.soc-ph | We study the performance of various agent strategies in an artificial
investment scenario. Agents are equipped with a budget, $x(t)$, and at each
time step invest a particular fraction, $q(t)$, of their budget. The return on
investment (RoI), $r(t)$, is characterized by a periodic function with
different types and le... |
0801.4307 | On Affinity Measures for Artificial Immune System Movie Recommenders | cs.NE cs.AI cs.CY | We combine Artificial Immune Systems 'AIS', technology with Collaborative
Filtering 'CF' and use it to build a movie recommendation system. We already
know that Artificial Immune Systems work well as movie recommenders from
previous work by Cayzer and Aickelin 3, 4, 5. Here our aim is to investigate
the effect of dif... |
0801.4312 | Investigating Artificial Immune Systems For Job Shop Rescheduling In
Changing Environments | cs.NE cs.CE | Artificial immune system can be used to generate schedules in changing
environments and it has been proven to be more robust than schedules developed
using a genetic algorithm. Good schedules can be produced especially when the
number of the antigens is increased. However, an increase in the range of the
antigens had... |
0801.4314 | Artificial Immune Systems (AIS) - A New Paradigm for Heuristic Decision
Making | cs.NE cs.AI | Over the last few years, more and more heuristic decision making techniques
have been inspired by nature, e.g. evolutionary algorithms, ant colony
optimisation and simulated annealing. More recently, a novel computational
intelligence technique inspired by immunology has emerged, called Artificial
Immune Systems (AIS... |
0801.4355 | TER: A Robot for Remote Ultrasonic Examination: Experimental Evaluations | cs.OH cs.RO | This chapter:
o Motivates the clinical use of robotic tele-echography
o Introduces the TER system
o Describes technical and clinical evaluations performed with TER
|
0801.4544 | A Neyman-Pearson Approach to Universal Erasure and List Decoding | cs.IT math.IT | When information is to be transmitted over an unknown, possibly unreliable
channel, an erasure option at the decoder is desirable. Using
constant-composition random codes, we propose a generalization of Csiszar and
Korner's Maximum Mutual Information decoder with erasure option for discrete
memoryless channels. The n... |
0801.4571 | Is SP BP? | cs.IT math.IT | The Survey Propagation (SP) algorithm for solving $k$-SAT problems has been
shown recently as an instance of the Belief Propagation (BP) algorithm. In this
paper, we show that for general constraint-satisfaction problems, SP may not be
reducible from BP. We also establish the conditions under which such a
reduction i... |
0801.4706 | A Class of Errorless Codes for Over-loaded Synchronous Wireless and
Optical CDMA Systems | cs.IT math.CO math.IT | In this paper we introduce a new class of codes for over-loaded synchronous
wireless and optical CDMA systems which increases the number of users for fixed
number of chips without introducing any errors. Equivalently, the chip rate can
be reduced for a given number of users, which implies bandwidth reduction for
down... |
0801.4716 | Methods to integrate a language model with semantic information for a
word prediction component | cs.CL | Most current word prediction systems make use of n-gram language models (LM)
to estimate the probability of the following word in a phrase. In the past
years there have been many attempts to enrich such language models with further
syntactic or semantic information. We want to explore the predictive powers of
Latent ... |
0801.4746 | Concerning Olga, the Beautiful Little Street Dancer (Adjectives as
Higher-Order Polymorphic Functions) | cs.CL cs.LO | In this paper we suggest a typed compositional seman-tics for nominal
compounds of the form [Adj Noun] that models adjectives as higher-order
polymorphic functions, and where types are assumed to represent concepts in an
ontology that reflects our commonsense view of the world and the way we talk
about it in or-dinar... |
0801.4790 | Information Width | cs.DM cs.IT cs.LG math.IT | Kolmogorov argued that the concept of information exists also in problems
with no underlying stochastic model (as Shannon's information representation)
for instance, the information contained in an algorithm or in the genome. He
introduced a combinatorial notion of entropy and information $I(x:\sy)$
conveyed by a bin... |
0801.4794 | On the Complexity of Binary Samples | cs.DM cs.AI cs.LG | Consider a class $\mH$ of binary functions $h: X\to\{-1, +1\}$ on a finite
interval $X=[0, B]\subset \Real$. Define the {\em sample width} of $h$ on a
finite subset (a sample) $S\subset X$ as $\w_S(h) \equiv \min_{x\in S}
|\w_h(x)|$, where $\w_h(x) = h(x) \max\{a\geq 0: h(z)=h(x), x-a\leq z\leq
x+a\}$. Let $\mathbb{S... |
0801.4807 | Automatic Text Area Segmentation in Natural Images | cs.CV | We present a hierarchical method for segmenting text areas in natural images.
The method assumes that the text is written with a contrasting color on a more
or less uniform background. But no assumption is made regarding the language or
character set used to write the text. In particular, the text can contain
simple ... |
0802.0003 | On mobile sets in the binary hypercube | math.CO cs.IT math.IT | If two distance-3 codes have the same neighborhood, then each of them is
called a mobile set. In the (4k+3)-dimensional binary hypercube, there exists a
mobile set of cardinality 2*6^k that cannot be split into mobile sets of
smaller cardinalities or represented as a natural extension of a mobile set in
a hypercube o... |
0802.0006 | New Perspectives and some Celebrated Quantum Inequalities | math-ph cs.IT math.IT math.MP | Some of the important inequalities associated with quantum entropy are
immediate algebraic consequences of the Hansen-Pedersen-Jensen inequality. A
general argument is given in terms of the matrix perspective of an operator
convex function. A matrix analogue of Mar\'{e}chal's extended perspectives
provides additional... |
0802.0030 | Mission impossible: Computing the network coding capacity region | cs.IT math.IT | One of the main theoretical motivations for the emerging area of network
coding is the achievability of the max-flow/min-cut rate for single source
multicast. This can exceed the rate achievable with routing alone, and is
achievable with linear network codes. The multi-source problem is more
complicated. Computation ... |
0802.0116 | Shallow Models for Non-Iterative Modal Logics | cs.LO cs.AI cs.CC cs.MA | The methods used to establish PSPACE-bounds for modal logics can roughly be
grouped into two classes: syntax driven methods establish that exhaustive proof
search can be performed in polynomial space whereas semantic approaches
directly construct shallow models. In this paper, we follow the latter approach
and establ... |
0802.0130 | About the true type of smoothers | math.OC cs.IT math.IT | We employ the variational formulation and the Euler-Lagrange equations to
study the steady-state error in linear non-causal estimators (smoothers). We
give a complete description of the steady-state error for inputs that are
polynomial in time. We show that the steady-state error regime in a smoother is
similar to th... |
0802.0137 | Fault-Tolerant Partial Replication in Large-Scale Database Systems | cs.DB | We investigate a decentralised approach to committing transactions in a
replicated database, under partial replication. Previous protocols either
re-execute transactions entirely and/or compute a total order of transactions.
In contrast, ours applies update values, and orders only conflicting
transactions. It results... |
0802.0179 | On the Relation Between the Index Coding and the Network Coding Problems | cs.IT math.IT | In this paper we show that the Index Coding problem captures several
important properties of the more general Network Coding problem. An instance of
the Index Coding problem includes a server that holds a set of information
messages $X=\{x_1,...,x_k\}$ and a set of receivers $R$. Each receiver has some
side informati... |
0802.0251 | Multi-Layer Perceptrons and Symbolic Data | cs.NE | In some real world situations, linear models are not sufficient to represent
accurately complex relations between input variables and output variables of a
studied system. Multilayer Perceptrons are one of the most successful
non-linear regression tool but they are unfortunately restricted to inputs and
outputs that ... |
0802.0252 | Acc\'el\'eration des cartes auto-organisatrices sur tableau de
dissimilarit\'es par s\'eparation et \'evaluation | cs.NE | In this paper, a new implementation of the adaptation of Kohonen
self-organising maps (SOM) to dissimilarity matrices is proposed. This
implementation relies on the branch and bound principle to reduce the algorithm
running time. An important property of this new approach is that the obtained
algorithm produces exact... |
0802.0287 | A data-driven functional projection approach for the selection of
feature ranges in spectra with ICA or cluster analysis | cs.NE | Prediction problems from spectra are largely encountered in chemometry. In
addition to accurate predictions, it is often needed to extract information
about which wavelengths in the spectra contribute in an effective way to the
quality of the prediction. This implies to select wavelengths (or wavelength
intervals), a... |
0802.0342 | The Case for Structured Random Codes in Network Capacity Theorems | cs.IT math.IT | Random coding arguments are the backbone of most channel capacity
achievability proofs. In this paper, we show that in their standard form, such
arguments are insufficient for proving some network capacity theorems:
structured coding arguments, such as random linear or lattice codes, attain
higher rates. Historically... |
0802.0351 | Path Loss Exponent Estimation in a Large Field of Interferers | cs.IT math.IT | In wireless channels, the path loss exponent (PLE) has a strong impact on the
quality of links, and hence, it needs to be accurately estimated for the
efficient design and operation of wireless networks. In this paper, we address
the problem of PLE estimation in large wireless networks, which is relevant to
several i... |
0802.0414 | The exit problem in optimal non-causal extimation | math.OC cs.IT math.IT | We study the phenomenon of loss of lock in the optimal non-causal phase
estimation problem, a benchmark problem in nonlinear estimation. Our method is
based on the computation of the asymptotic distribution of the optimal
estimation error in case the number of trajectories in the optimization problem
is finite. The c... |
0802.0487 | Algorithmically independent sequences | cs.IT cs.SE math.AG math.IT | Two objects are independent if they do not affect each other. Independence is
well-understood in classical information theory, but less in algorithmic
information theory. Working in the framework of algorithmic information theory,
the paper proposes two types of independence for arbitrary infinite binary
sequences an... |
0802.0534 | Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays,
Feedback, Cooperation and Full-Duplex Operation | cs.IT math.IT | Recent work has characterized the sum capacity of
time-varying/frequency-selective wireless interference networks and $X$
networks within $o(\log({SNR}))$, i.e., with an accuracy approaching 100% at
high SNR (signal to noise power ratio). In this paper, we seek similar capacity
characterizations for wireless networks... |
0802.0554 | Message-Passing Decoding of Lattices Using Gaussian Mixtures | cs.IT math.IT | A lattice decoder which represents messages explicitly as a mixture of
Gaussians functions is given. In order to prevent the number of functions in a
mixture from growing as the decoder iterations progress, a method for replacing
N Gaussian functions with M Gaussian functions, with M < N, is given. A squared
distance... |
0802.0580 | Rotated and Scaled Alamouti Coding | cs.IT math.IT | Repetition-based retransmission is used in Alamouti-modulation [1998] for
$2\times 2$ MIMO systems. We propose to use instead of ordinary repetition
so-called "scaled repetition" together with rotation. It is shown that the
rotated and scaled Alamouti code has a hard-decision performance which is only
slightly worse ... |
0802.0738 | MIMO Networks: the Effects of Interference | cs.IT math.IT | Multiple-input/multiple-output (MIMO) systems promise enormous capacity
increase and are being considered as one of the key technologies for future
wireless networks. However, the decrease in capacity due to the presence of
interferers in MIMO networks is not well understood. In this paper, we develop
an analytical f... |
0802.0776 | Distributed Compression for the Uplink of a Backhaul-Constrained
Coordinated Cellular Network | cs.IT math.IT | We consider a backhaul-constrained coordinated cellular network. That is, a
single-frequency network with $N+1$ multi-antenna base stations (BSs) that
cooperate in order to decode the users' data, and that are linked by means of a
common lossless backhaul, of limited capacity $\mathrm{R}$. To implement
receive cooper... |
0802.0797 | Central Limit Theorems for Wavelet Packet Decompositions of Stationary
Random Processes | cs.IT math.IT | This paper provides central limit theorems for the wavelet packet
decomposition of stationary band-limited random processes. The asymptotic
analysis is performed for the sequences of the wavelet packet coefficients
returned at the nodes of any given path of the $M$-band wavelet packet
decomposition tree. It is shown ... |
0802.0802 | On Approximating Frequency Moments of Data Streams with Skewed
Projections | cs.DS cs.IT math.IT | We propose skewed stable random projections for approximating the pth
frequency moments of dynamic data streams (0<p<=2), which has been frequently
studied in theoretical computer science and database communities. Our method
significantly (or even infinitely when p->1) improves previous methods based on
(symmetric) s... |
0802.0808 | Turbo Interleaving inside the cdma2000 and W-CDMA Mobile Communication
Systems: A Tutorial | cs.IT math.IT | In this paper a discussion of the detailed operation of the interleavers used
by the turbo codes defined on the telecommunications standards cdma2000 (3GPP2
C.S0024-B V2.0) and W-CDMA (3GPP TS 25.212 V7.4.0) is presented. Differences in
the approach used by each turbo interleaver as well as dispersion analysis and
fr... |
0802.0823 | Doubly-Generalized LDPC Codes: Stability Bound over the BEC | cs.IT math.IT | The iterative decoding threshold of low-density parity-check (LDPC) codes
over the binary erasure channel (BEC) fulfills an upper bound depending only on
the variable and check nodes with minimum distance 2. This bound is a
consequence of the stability condition, and is here referred to as stability
bound. In this pa... |
0802.0835 | Bit-Optimal Lempel-Ziv compression | cs.DS cs.IT math.IT | One of the most famous and investigated lossless data-compression scheme is
the one introduced by Lempel and Ziv about 40 years ago. This compression
scheme is known as "dictionary-based compression" and consists of squeezing an
input string by replacing some of its substrings with (shorter) codewords which
are actua... |
0802.0861 | Using Bayesian Blocks to Partition Self-Organizing Maps | cs.NE | Self organizing maps (SOMs) are widely-used for unsupervised classification.
For this application, they must be combined with some partitioning scheme that
can identify boundaries between distinct regions in the maps they produce. We
discuss a novel partitioning scheme for SOMs based on the Bayesian Blocks
segmentati... |
0802.0914 | Shrinkage Effect in Ancestral Maximum Likelihood | q-bio.PE cs.CE math.PR math.ST stat.TH | Ancestral maximum likelihood (AML) is a method that simultaneously
reconstructs a phylogenetic tree and ancestral sequences from extant data
(sequences at the leaves). The tree and ancestral sequences maximize the
probability of observing the given data under a Markov model of sequence
evolution, in which branch leng... |
0802.1002 | New Estimation Procedures for PLS Path Modelling | cs.LG | Given R groups of numerical variables X1, ... XR, we assume that each group
is the result of one underlying latent variable, and that all latent variables
are bound together through a linear equation system. Moreover, we assume that
some explanatory latent variables may interact pairwise in one or more
equations. We ... |
0802.1220 | Complexity of Decoding Positive-Rate Reed-Solomon Codes | cs.IT math.IT | The complexity of maximal likelihood decoding of the Reed-Solomon codes
$[q-1, k]_q$ is a well known open problem. The only known result in this
direction states that it is at least as hard as the discrete logarithm in some
cases where the information rate unfortunately goes to zero. In this paper, we
remove the rate... |
0802.1244 | Learning Balanced Mixtures of Discrete Distributions with Small Sample | cs.LG stat.ML | We study the problem of partitioning a small sample of $n$ individuals from a
mixture of $k$ product distributions over a Boolean cube $\{0, 1\}^K$ according
to their distributions. Each distribution is described by a vector of allele
frequencies in $\R^K$. Given two distributions, we use $\gamma$ to denote the
avera... |
0802.1258 | Bayesian Nonlinear Principal Component Analysis Using Random Fields | cs.CV cs.LG | We propose a novel model for nonlinear dimension reduction motivated by the
probabilistic formulation of principal component analysis. Nonlinearity is
achieved by specifying different transformation matrices at different locations
of the latent space and smoothing the transformation using a Markov random
field type p... |
0802.1296 | On quantum statistics in data analysis | cs.IR math.CT quant-ph | Originally, quantum probability theory was developed to analyze statistical
phenomena in quantum systems, where classical probability theory does not
apply, because the lattice of measurable sets is not necessarily distributive.
On the other hand, it is well known that the lattices of concepts, that arise
in data ana... |
0802.1306 | Network as a computer: ranking paths to find flows | cs.IR cs.AI math.CT | We explore a simple mathematical model of network computation, based on
Markov chains. Similar models apply to a broad range of computational
phenomena, arising in networks of computers, as well as in genetic, and neural
nets, in social networks, and so on. The main problem of interaction with such
spontaneously evol... |
0802.1327 | Exchange of Limits: Why Iterative Decoding Works | cs.IT math.IT | We consider communication over binary-input memoryless output-symmetric
channels using low-density parity-check codes and message-passing decoding. The
asymptotic (in the length) performance of such a combination for a fixed number
of iterations is given by density evolution. Letting the number of iterations
tend to ... |
0802.1369 | Interior-Point Algorithms for Linear-Programming Decoding | cs.IT math.IT | Interior-point algorithms constitute a very interesting class of algorithms
for solving linear-programming problems. In this paper we study efficient
implementations of such algorithms for solving the linear program that appears
in the linear-programming decoder formulation.
|
0802.1372 | An integral formula for large random rectangular matrices and its
application to analysis of linear vector channels | cs.IT cond-mat.dis-nn math.IT | A statistical mechanical framework for analyzing random linear vector
channels is presented in a large system limit. The framework is based on the
assumptions that the left and right singular value bases of the rectangular
channel matrix $\bH$ are generated independently from uniform distributions
over Haar measures ... |
0802.1380 | New Bounds for the Capacity Region of the Finite-State Multiple Access
Channel | cs.IT math.IT | The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with
feedback that may be an arbitrary time-invariant function of the channel output
samples is considered. We provided a sequence of inner and outer bounds for
this region. These bounds are shown to coincide, and hence yield the capacity
region... |
0802.1383 | On Directed Information and Gambling | cs.IT math.IT | We study the problem of gambling in horse races with causal side information
and show that Massey's directed information characterizes the increment in the
maximum achievable capital growth rate due to the availability of side
information. This result gives a natural interpretation of directed information
$I(Y^n \to ... |
0802.1393 | Les Agents comme des interpr\'eteurs Scheme : Sp\'ecification dynamique
par la communication | cs.MA cs.AI | We proposed in previous papers an extension and an implementation of the
STROBE model, which regards the Agents as Scheme interpreters. These Agents are
able to interpret messages in a dedicated environment including an interpreter
that learns from the current conversation therefore representing evolving
meta-level A... |
0802.1412 | Extreme Learning Machine for land cover classification | cs.NE cs.CV | This paper explores the potential of extreme learning machine based
supervised classification algorithm for land cover classification. In
comparison to a backpropagation neural network, which requires setting of
several user-defined parameters and may produce local minima, extreme learning
machine require setting of ... |
0802.1430 | A New Approach to Collaborative Filtering: Operator Estimation with
Spectral Regularization | cs.LG | We present a general approach for collaborative filtering (CF) using spectral
regularization to learn linear operators from "users" to the "objects" they
rate. Recent low-rank type matrix completion approaches to CF are shown to be
special cases. However, unlike existing regularization based CF methods, our
approach ... |
0802.1555 | Constructing Linear Codes with Good Joint Spectra | cs.IT math.IT | The problem of finding good linear codes for joint source-channel coding
(JSCC) is investigated in this paper. By the code-spectrum approach, it has
been proved in the authors' previous paper that a good linear code for the
authors' JSCC scheme is a code with a good joint spectrum, so the main task in
this paper is t... |
0802.1567 | Universal Coding for Lossless and Lossy Complementary Delivery Problems | cs.IT math.IT | This paper deals with a coding problem called complementary delivery, where
messages from two correlated sources are jointly encoded and each decoder
reproduces one of two messages using the other message as the side information.
Both lossless and lossy universal complementary delivery coding schemes are
investigated... |
0802.1604 | On the Complexity of Nash Equilibria of Action-Graph Games | cs.GT cs.MA | We consider the problem of computing Nash Equilibria of action-graph games
(AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation
of games that encapsulates both "local" dependencies as in graphical games, and
partial indifference to other agents' identities as in anonymous games, which
occur... |
0802.1738 | Characterising through Erasing: A Theoretical Framework for Representing
Documents Inspired by Quantum Theory | cs.IR quant-ph | The problem of representing text documents within an Information Retrieval
system is formulated as an analogy to the problem of representing the quantum
states of a physical system. Lexical measurements of text are proposed as a way
of representing documents which are akin to physical measurements on quantum
states. ... |
0802.1754 | ARQ for Network Coding | cs.IT cs.NI math.IT | A new coding and queue management algorithm is proposed for communication
networks that employ linear network coding. The algorithm has the feature that
the encoding process is truly online, as opposed to a block-by-block approach.
The setup assumes a packet erasure broadcast channel with stochastic arrivals
and full... |
0802.1785 | Near ML detection using Dijkstra's algorithm with bounded list size over
MIMO channels | cs.IT math.IT | We propose Dijkstra's algorithm with bounded list size after QR decomposition
for decreasing the computational complexity of near maximum-likelihood (ML)
detection of signals over multiple-input-multiple-output (MIMO) channels. After
that, we compare the performances of proposed algorithm, QR decomposition
M-algorith... |
0802.1815 | A Construction for Constant-Composition Codes | cs.IT math.IT | By employing the residue polynomials, a construction of constant-composition
codes is given. This construction generalizes the one proposed by Xing[16]. It
turns out that when d=3 this construction gives a lower bound of
constant-composition codes improving the one in [10]. Moreover, for d>3, we
give a lower bound on... |
0802.1888 | Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff
and Optimal Code Design | cs.IT math.IT | We consider single-source single-sink (ss-ss) multi-hop networks, with
slow-fading links and single-antenna half-duplex relays. We identify two
families of networks that are multi-hop generalizations of the well-studied
two-hop network: K-Parallel-Path (KPP) networks and layered networks. KPP
networks can be viewed a... |
0802.1893 | Diversity and Degrees of Freedom of Cooperative Wireless Networks | cs.IT math.IT | Wireless fading networks with multiple antennas are typically studied
information-theoretically from two different perspectives - the outage
characterization and the ergodic capacity characterization. A key parameter in
the outage characterization of a network is the diversity, whereas a
first-order indicator for the... |
0802.2001 | Exploiting problem structure in a genetic algorithm approach to a nurse
rostering problem | cs.NE cs.CE | There is considerable interest in the use of genetic algorithms to solve
problems arising in the areas of scheduling and timetabling. However, the
classical genetic algorithm paradigm is not well equipped to handle the
conflict between objectives and constraints that typically occurs in such
problems. In order to ove... |
0802.2013 | Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc
Wireless Networks | cs.IT math.IT | Hierarchical cooperation has recently been shown to achieve better throughput
scaling than classical multihop schemes under certain assumptions on the
channel model in static wireless networks. However, the end-to-end delay of
this scheme turns out to be significantly larger than those of multihop
schemes. A modifica... |
0802.2015 | Combining Expert Advice Efficiently | cs.LG cs.DS cs.IT math.IT | We show how models for prediction with expert advice can be defined concisely
and clearly using hidden Markov models (HMMs); standard HMM algorithms can then
be used to efficiently calculate, among other things, how the expert
predictions should be weighted according to the model. We cast many existing
models as HMMs... |
0802.2045 | Blocking Sets in the complement of hyperplane arrangements in projective
space | cs.IT math.IT | It is well know that the theory of minimal blocking sets is studied by
several author. Another theory which is also studied by a large number of
researchers is the theory of hyperplane arrangements. We can remark that the
affine space $AG(n,q)$ is the complement of the line at infinity in $PG(n,q)$.
Then $AG(n,q)$ ca... |
0802.2125 | Multiple Access Outerbounds and the Inseparability of Parallel
Interference Channels | cs.IT math.IT | It is known that the capacity of parallel (multi-carrier) Gaussian
point-to-point, multiple access and broadcast channels can be achieved by
separate encoding for each subchannel (carrier) subject to a power allocation
across carriers. In this paper we show that such a separation does not apply to
parallel Gaussian i... |
0802.2127 | New Implementation Framework for Saturation-Based Reasoning | cs.AI cs.LO | The saturation-based reasoning methods are among the most theoretically
developed ones and are used by most of the state-of-the-art first-order logic
reasoners. In the last decade there was a sharp increase in performance of such
systems, which I attribute to the use of advanced calculi and the intensified
research i... |
0802.2138 | Support Vector classifiers for Land Cover Classification | cs.NE cs.CV | Support vector machines represent a promising development in machine learning
research that is not widely used within the remote sensing community. This
paper reports the results of Multispectral(Landsat-7 ETM+) and Hyperspectral
DAIS)data in which multi-class SVMs are compared with maximum likelihood and
artificial ... |
0802.2158 | A Radar-Shaped Statistic for Testing and Visualizing Uniformity
Properties in Computer Experiments | cs.LG math.ST stat.TH | In the study of computer codes, filling space as uniformly as possible is
important to describe the complexity of the investigated phenomenon. However,
this property is not conserved by reducing the dimension. Some numeric
experiment designs are conceived in this sense as Latin hypercubes or
orthogonal arrays, but th... |
0802.2159 | A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless
Networks | cs.IT cs.GT math.IT | This paper introduces a novel concept from coalitional game theory which
allows the dynamic formation of coalitions among wireless nodes. A simple and
distributed merge and split algorithm for coalition formation is constructed.
This algorithm is applied to study the gains resulting from the cooperation
among single ... |
0802.2234 | Textual Fingerprinting with Texts from Parkin, Bassewitz, and Leander | cs.CL cs.CR | Current research in author profiling to discover a legal author's fingerprint
does not only follow examinations based on statistical parameters only but
include more and more dynamic methods that can learn and that react adaptable
to the specific behavior of an author. But the question on how to appropriately
represe... |
0802.2305 | Compressed Counting | cs.IT cs.CC cs.DM cs.DS cs.LG math.IT | Counting is among the most fundamental operations in computing. For example,
counting the pth frequency moment has been a very active area of research, in
theoretical computer science, databases, and data mining. When p=1, the task
(i.e., counting the sum) can be accomplished using a simple counter.
Compressed Coun... |
0802.2345 | On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading
Channels | cs.IT math.IT | It is known that the frame error rate of turbo codes on quasi-static fading
channels can be accurately approximated using the convergence threshold of the
corresponding iterative decoder. This paper considers quasi-static fading
channels and demonstrates that non-iterative schemes can also be characterized
by a simil... |
0802.2349 | Algebraic geometry codes from higher dimensional varieties | cs.IT math.IT | This paper is a general survey of literature on Goppa-type codes from higher
dimensional algebraic varieties. The construction and several techniques for
estimating the minimum distance are described first. Codes from various classes
of varieties, including Hermitian hypersurfaces, Grassmannians, flag varieties,
rule... |
0802.2360 | On Maximizing Coverage in Gaussian Relay Networks | cs.IT math.IT | Results for Gaussian relay channels typically focus on maximizing
transmission rates for given locations of the source, relay and destination. We
introduce an alternative perspective, where the objective is maximizing
coverage for a given rate. The new objective captures the problem of how to
deploy relays to provide... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.