id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0811.0139 | Entropy, Perception, and Relativity | cs.LG | In this paper, I expand Shannon's definition of entropy into a new form of
entropy that allows integration of information from different random events.
Shannon's notion of entropy is a special case of my more general definition of
entropy. I define probability using a so-called performance function, which is
de facto... |
0811.0146 | Effect of Tuned Parameters on a LSA MCQ Answering Model | cs.LG cs.AI stat.ML | This paper presents the current state of a work in progress, whose objective
is to better understand the effects of factors that significantly influence the
performance of Latent Semantic Analysis (LSA). A difficult task, which consists
in answering (French) biology Multiple Choice Questions, is used to test the
sema... |
0811.0152 | Theoretical Analysis of Compressive Sensing via Random Filter | cs.IT math.IT | In this paper, the theoretical analysis of compressive sensing via random
filter, firstly outlined by J. Romberg [compressive sensing by random
convolution, submitted to SIAM Journal on Imaging Science on July 9, 2008], has
been refined or generalized to the design of general random filter used for
compressive sensin... |
0811.0174 | A Bit of Information Theory, and the Data Augmentation Algorithm
Converges | cs.IT math.IT stat.CO | The data augmentation (DA) algorithm is a simple and powerful tool in
statistical computing. In this note basic information theory is used to prove a
nontrivial convergence theorem for the DA algorithm.
|
0811.0196 | Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs | cs.IT math.IT | In this paper, we reduce the computational complexities of partial and dual
partial cyclotomic FFTs (CFFTs), which are discrete Fourier transforms where
spectral and temporal components are constrained, based on their properties as
well as a common subexpression elimination algorithm. Our partial CFFTs achieve
smalle... |
0811.0210 | Novel Blind Signal Classification Method Based on Data Compression | cs.IT math.IT | This paper proposes a novel algorithm for signal classification problems. We
consider a non-stationary random signal, where samples can be classified into
several different classes, and samples in each class are identically
independently distributed with an unknown probability distribution. The problem
to be solved i... |
0811.0241 | Joint Transmitter-Receiver Design for the Downlink Multiuser Spatial
Multiplexing MIMO System | cs.IT math.IT | This paper proposes a joint transmitter-receiver design to minimize the
weighted sum power under the post-processing signal-to-interference-and-noise
ratio (post-SINR) constraints for all subchannels. Simulation results
demonstrate that the algorithm can not only satisfy the post-SINR constraints
but also easily adju... |
0811.0285 | Some results on communicating the sum of sources over a network | cs.IT math.IT | We consider the problem of communicating the sum of $m$ sources to $n$
terminals in a directed acyclic network. Recently, it was shown that for a
network of unit capacity links with either $m=2$ or $n=2$, the sum of the
sources can be communicated to the terminals if and only if every
source-terminal pair is connecte... |
0811.0310 | Edhibou: a Customizable Interface for Decision Support in a Semantic
Portal | cs.AI cs.HC | The Semantic Web is becoming more and more a reality, as the required
technologies have reached an appropriate level of maturity. However, at this
stage, it is important to provide tools facilitating the use and deployment of
these technologies by end-users. In this paper, we describe EdHibou, an
automatically genera... |
0811.0325 | Energy Benefit of Network Coding for Multiple Unicast in Wireless
Networks | cs.IT math.IT | We show that the maximum possible energy benefit of network coding for
multiple unicast on wireless networks is at least 3. This improves the
previously known lower bound of 2.4 from [1].
|
0811.0335 | Cooperative interface of a swarm of UAVs | cs.AI cs.HC cs.MA | After presenting the broad context of authority sharing, we outline how
introducing more natural interaction in the design of the ground operator
interface of UV systems should help in allowing a single operator to manage the
complexity of his/her task. Introducing new modalities is one one of the means
in the realiz... |
0811.0340 | Document stream clustering: experimenting an incremental algorithm and
AR-based tools for highlighting dynamic trends | cs.AI | We address here two major challenges presented by dynamic data mining: 1) the
stability challenge: we have implemented a rigorous incremental density-based
clustering algorithm, independent from any initial conditions and ordering of
the data-vectors stream, 2) the cognitive challenge: we have implemented a
stringent... |
0811.0359 | Embedding Non-Ground Logic Programs into Autoepistemic Logic for
Knowledge Base Combination | cs.LO cs.AI | In the context of the Semantic Web, several approaches to the combination of
ontologies, given in terms of theories of classical first-order logic and rule
bases, have been proposed. They either cast rules into classical logic or limit
the interaction between rules and ontologies. Autoepistemic logic (AEL) is an
attr... |
0811.0405 | Predicting the popularity of online content | cs.CY cs.IR physics.soc-ph | We present a method for accurately predicting the long time popularity of
online content from early measurements of user access. Using two content
sharing portals, Youtube and Digg, we show that by modeling the accrual of
views and votes on content offered by these services we can predict the
long-term dynamics of in... |
0811.0413 | Robust Linear Processing for Downlink Multiuser MIMO System With
Imperfectly Known Channel | cs.IT math.IT | This paper proposes a roust downlink multiuser MIMO scheme that exploits the
channel mean and antenna correlations to alleviate the performance penalty due
to the mismatch between the true and estimated CSI.
|
0811.0417 | Parametric Channel Estimation by Exploiting Hopping Pilots in Uplink
OFDMA | cs.IT math.IT | This paper proposes a parametric channel estimation algorithm applicable to
uplink of OFDMA systems with pseudo-random subchannelization. It exploits the
hopping pilots to facilitate ESPRIT to estimate the delay subspace of the
multipath fading channel, and utilizes the global pilot tones to interpolate on
data subca... |
0811.0419 | Doppler Spread Estimation by Subspace Tracking for OFDM Systems | cs.IT math.IT | This paper proposes a novel maximum Doppler spread estimation algorithm for
OFDM systems with the comb-type pilot pattern. By tracking the drifting delay
subspace of the multipath channel, the time correlation function is measured at
a high accuracy, which accordingly improves the estimation accuracy of the
maximum D... |
0811.0430 | An Analysis of the Bias-Property of the Sample Auto-Correlation Matrices
of Doubly Selective Fading Channels for OFDM Systems | cs.IT math.IT | This paper derives the analytic expression of the sample auto-correlation
matrix from the least-squared channel estimation of doubly selective fading
channels for OFDM systems. According to the expression, the sample
auto-correlation matrix reveals the bias property which would cause the model
mismatch and therefore ... |
0811.0431 | On the Cramer-Rao Lower Bound for Frequency Correlation Matrices of
Doubly Selective Fading Channels for OFDM Systems | cs.IT math.IT | The analytic expression of CRLB and the maximum likelihood estimator for the
sample frequency correlation matrices in doubly selective fading channels for
OFDM systems are reported in this paper. According to the analytical and
numerical results, the amount of samples affects the average mean square error
dominantly ... |
0811.0433 | On the Cramer-Rao Lower Bound for Spatial Correlation Matrices of Doubly
Selective Fading Channels for MIMO OFDM Systems | cs.IT math.IT | The analytic expression of CRLB and the maximum likelihood estimator for
spatial correlation matrices in time-varying multipath fading channels for MIMO
OFDM systems are reported in this paper. The analytical and numerical results
reveal that the amount of samples and the order of frequency selectivity have
dominant ... |
0811.0452 | Doppler Spread Estimation by Tracking the Delay-Subspace for OFDM
Systems in Doubly Selective Fading Channels | cs.IT math.IT | A novel maximum Doppler spread estimation algorithm for OFDM systems with
comb-type pilot pattern is presented in this paper. By tracking the drifting
delay subspace of time-varying multipath channels, a Doppler dependent
parameter can be accurately measured and further expanded and transformed into
a non-linear high... |
0811.0453 | CoZo+ - A Content Zoning Engine for textual documents | cs.CL cs.IR | Content zoning can be understood as a segmentation of textual documents into
zones. This is inspired by [6] who initially proposed an approach for the
argumentative zoning of textual documents. With the prototypical CoZo+ engine,
we focus on content zoning towards an automatic processing of textual streams
while cons... |
0811.0543 | Incomplete decode-and-forward protocol using distributed space-time
block codes | cs.IT math.IT | In this work, we explore the introduction of distributed space-time codes in
decode-and-forward (DF) protocols. A first protocol named the Asymmetric DF is
presented. It is based on two phases of different lengths, defined so that
signals can be fully decoded at relays. This strategy brings full diversity but
the sym... |
0811.0579 | UNL-French deconversion as transfer & generation from an interlingua
with possible quality enhancement through offline human interaction | cs.CL | We present the architecture of the UNL-French deconverter, which "generates"
from the UNL interlingua by first"localizing" the UNL form for French, within
UNL, and then applying slightly adapted but classical transfer and generation
techniques, implemented in GETA's Ariane-G5 environment, supplemented by some
UNL-spe... |
0811.0602 | Classification dynamique d'un flux documentaire : une \'evaluation
statique pr\'ealable de l'algorithme GERMEN | cs.AI | Data-stream clustering is an ever-expanding subdomain of knowledge
extraction. Most of the past and present research effort aims at efficient
scaling up for the huge data repositories. Our approach focuses on qualitative
improvement, mainly for "weak signals" detection and precise tracking of
topical evolutions in th... |
0811.0603 | Query Refinement by Multi Word Term expansions and semantic synonymy | cs.IR | We developed a system, TermWatch
(https://stid-bdd.iut.univ-metz.fr/TermWatch/index.pl), which combines a
linguistic extraction of terms, their structuring into a terminological network
with a clustering algorithm. In this paper we explore its ability in
integrating the most promising aspects of the studies on query ... |
0811.0623 | Algorithmic complexity and randomness in elastic solids | cs.CC cs.IT math.IT | A system comprised of an elastic solid and its response to an external random
force sequence is shown to behave based on the principles of the theory of
algorithmic complexity and randomness. The solid distorts the randomness of an
input force sequence in a way proportional to its algorithmic complexity. We
demonstra... |
0811.0637 | Optimality of Myopic Sensing in Multi-Channel Opportunistic Access | cs.NI cs.IT math.IT | We consider opportunistic communications over multiple channels where the
state ("good" or "bad") of each channel evolves as independent and identically
distributed Markov processes. A user, with limited sensing and access
capability, chooses one channel to sense and subsequently access (based on the
sensed channel s... |
0811.0705 | The Design of Sparse Antenna Array | cs.IT math.IT | The aim of antenna array synthesis is to achieve a desired radiation pattern
with the minimum number of antenna elements. In this paper the antenna
synthesis problem is studied from a totally new perspective. One of the key
principles of compressive sensing is that the signal to be sensed should be
sparse or compress... |
0811.0717 | Visualization of association graphs for assisting the interpretation of
classifications | stat.AP cs.DL cs.IR | Given a query on the PASCAL database maintained by the INIST, we design user
interfaces to visualize and browse two types of graphs extracted from
abstracts: 1) the graph of all associations between authors (co-author graph),
2) the graph of strong associations between authors and terms automatically
extracted from a... |
0811.0719 | Web Usage Analysis: New Science Indicators and Co-usage | cs.IR stat.AP | A new type of statistical analysis of the science and technical information
(STI) in the Web context is produced. We propose a set of indicators about Web
users, visualized bibliographic records, and e-commercial transactions. In
addition, we introduce two Web usage factors. Finally, we give an overview of
the co-usa... |
0811.0726 | Improved Capacity Scaling in Wireless Networks With Infrastructure | cs.IT math.IT | This paper analyzes the impact and benefits of infrastructure support in
improving the throughput scaling in networks of $n$ randomly located wireless
nodes. The infrastructure uses multi-antenna base stations (BSs), in which the
number of BSs and the number of antennas at each BS can scale at arbitrary
rates relativ... |
0811.0731 | Cognitive OFDM network sensing: a free probability approach | cs.IT cs.AI math.IT math.PR | In this paper, a practical power detection scheme for OFDM terminals, based
on recent free probability tools, is proposed. The objective is for the
receiving terminal to determine the transmission power and the number of the
surrounding base stations in the network. However, thesystem dimensions of the
network model ... |
0811.0741 | Data Mining-based Fragmentation of XML Data Warehouses | cs.DB | With the multiplication of XML data sources, many XML data warehouse models
have been proposed to handle data heterogeneity and complexity in a way
relational data warehouses fail to achieve. However, XML-native database
systems currently suffer from limited performances, both in terms of manageable
data volume and r... |
0811.0764 | A Bayesian Framework for Collaborative Multi-Source Signal Detection | cs.IT cs.AI math.IT math.PR | This paper introduces a Bayesian framework to detect multiple signals
embedded in noisy observations from a sensor array. For various states of
knowledge on the communication channel and the noise at the receiving sensors,
a marginalization procedure based on recent tools of finite random matrix
theory, in conjunctio... |
0811.0777 | A random coding theorem for "modulo-two adder" source network | cs.IT math.IT | This paper has been withdrawn by the author, due a crucial error in the proof
of the main Theorem (Sec. 3). In particular, in deriving the bound on the
probability of error (Eq. 10) the contribution of those pairs (x', y') that are
not equal to (x, y) has not been considered. By adding the contribution of
these pairs... |
0811.0778 | A maximum entropy approach to OFDM channel estimation | cs.IT math.IT math.PR | In this work, a new Bayesian framework for OFDM channel estimation is
proposed. Using Jaynes' maximum entropy principle to derive prior information,
we successively tackle the situations when only the channel delay spread is a
priori known, then when it is not known. Exploitation of the time-frequency
dimensions are ... |
0811.0823 | Distributed Constrained Optimization with Semicoordinate Transformations | cs.NE cs.AI | Recent work has shown how information theory extends conventional
full-rationality game theory to allow bounded rational agents. The associated
mathematical framework can be used to solve constrained optimization problems.
This is done by translating the problem into an iterated game, where each agent
controls a diff... |
0811.0935 | A New Training Protocol for Channel State Estimation in Wireless Relay
Networks | cs.IT math.IT | The accuracy of channel state information (CSI) is critical for improving the
capacity of wireless networks. In this paper, we introduce a training protocol
for wireless relay networks that uses channel estimation and feedforwarding
methods. The feedforwarding method is the distinctive feature of the proposed
protoco... |
0811.0942 | \'Etude longitudinale d'une proc\'edure de mod\'elisation de
connaissances en mati\`ere de gestion du territoire agricole | cs.AI | This paper gives an introduction to this issue, and presents the framework
and the main steps of the Rosa project. Four teams of researchers, agronomists,
computer scientists, psychologists and linguists were involved during five
years within this project that aimed at the development of a knowledge based
system. The... |
0811.0952 | Raptor Codes and Cryptographic Issues | cs.IT math.IT | In this paper two cryptographic methods are introduced. In the first method
the presence of a certain size subgroup of persons can be checked for an action
to take place. For this we use fragments of Raptor codes delivered to the group
members. In the other method a selection of a subset of objects can be made
secret... |
0811.0971 | Mining Complex Hydrobiological Data with Galois Lattices | cs.AI q-bio.QM | We have used Galois lattices for mining hydrobiological data. These data are
about macrophytes, that are macroscopic plants living in water bodies. These
plants are characterized by several biological traits, that own several
modalities. Our aim is to cluster the plants according to their common traits
and modalities... |
0811.0980 | Self-organized criticality and adaptation in discrete dynamical networks | nlin.AO cond-mat.dis-nn cs.NE | It has been proposed that adaptation in complex systems is optimized at the
critical boundary between ordered and disordered dynamical regimes. Here, we
review models of evolving dynamical networks that lead to self-organization of
network topology based on a local coupling between a dynamical order parameter
and rew... |
0811.1000 | Hard and Soft Spherical-Bound Stack decoder for MIMO systems | cs.IT math.IT | Classical ML decoders of MIMO systems like the sphere decoder, the
Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high
complexity for high number of antennas and large constellation sizes. We
propose in this paper a novel sequential algorithm which combines the stack
algorithm search strategy an... |
0811.1083 | A role-free approach to indexing large RDF data sets in secondary memory
for efficient SPARQL evaluation | cs.DB cs.DS | Massive RDF data sets are becoming commonplace. RDF data is typically
generated in social semantic domains (such as personal information management)
wherein a fixed schema is often not available a priori. We propose a simple
Three-way Triple Tree (TripleT) secondary-memory indexing technique to
facilitate efficient S... |
0811.1108 | Resource Allocation for Downlink Cellular OFDMA Systems: Part I -
Optimal Allocation | cs.IT math.IT | In this pair of papers (Part I and Part II in this issue), we investigate the
issue of power control and subcarrier assignment in a sectorized two-cell
downlink OFDMA system impaired by multicell interference. As recommended for
WiMAX, we assume that the first part of the available bandwidth is likely to be
reused by... |
0811.1112 | Resource Allocation for Downlink Cellular OFDMA Systems: Part II -
Practical Algorithms and Optimal Reuse Factor | cs.IT math.IT | In a companion paper, we characterized the optimal resource allocation in
terms of power control and subcarrier assignment, for a downlink sectorized
OFDMA system. In our model, the network is assumed to be one dimensional for
the sake of analysis. We also assume that a certain part of the available
bandwidth is like... |
0811.1250 | Adaptive Base Class Boost for Multi-class Classification | cs.LG cs.IR | We develop the concept of ABC-Boost (Adaptive Base Class Boost) for
multi-class classification and present ABC-MART, a concrete implementation of
ABC-Boost. The original MART (Multiple Additive Regression Trees) algorithm has
been very successful in large-scale applications. For binary classification,
ABC-MART recove... |
0811.1254 | Coding Theory and Algebraic Combinatorics | math.CO cs.IT math.IT | This chapter introduces and elaborates on the fruitful interplay of coding
theory and algebraic combinatorics, with most of the focus on the interaction
of codes with combinatorial designs, finite geometries, simple groups, sphere
packings, kissing numbers, lattices, and association schemes. In particular,
special in... |
0811.1260 | The Application of Fuzzy Logic to Collocation Extraction | cs.CL | Collocations are important for many tasks of Natural language processing such
as information retrieval, machine translation, computational lexicography etc.
So far many statistical methods have been used for collocation extraction.
Almost all the methods form a classical crisp set of collocation. We propose a
fuzzy l... |
0811.1317 | Secrecy in Cooperative Relay Broadcast Channels | cs.IT math.IT | We investigate the effects of user cooperation on the secrecy of broadcast
channels by considering a cooperative relay broadcast channel. We show that
user cooperation can increase the achievable secrecy region. We propose an
achievable scheme that combines Marton's coding scheme for broadcast channels
and Cover and ... |
0811.1319 | Modeling Social Annotation: a Bayesian Approach | cs.AI | Collaborative tagging systems, such as Delicious, CiteULike, and others,
allow users to annotate resources, e.g., Web pages or scientific papers, with
descriptive labels called tags. The social annotations contributed by thousands
of users, can potentially be used to infer categorical knowledge, classify
documents or... |
0811.1500 | Linear Processing and Sum Throughput in the Multiuser MIMO Downlink | cs.IT math.IT | We consider linear precoding and decoding in the downlink of a multiuser
multiple-input, multiple-output (MIMO) system, wherein each user may receive
more than one data stream. We propose several mean squared error (MSE) based
criteria for joint transmit-receive optimization and establish a series of
relationships li... |
0811.1520 | Modeling Microscopic Chemical Sensors in Capillaries | cs.RO physics.bio-ph q-bio.TO | Nanotechnology-based microscopic robots could provide accurate in vivo
measurement of chemicals in the bloodstream for detailed biological research
and as an aid to medical treatment. Quantitative performance estimates of such
devices require models of how chemicals in the blood diffuse to the devices.
This paper mod... |
0811.1570 | Constructions of Subsystem Codes over Finite Fields | quant-ph cs.IT math.IT | Subsystem codes protect quantum information by encoding it in a tensor factor
of a subspace of the physical state space. Subsystem codes generalize all major
quantum error protection schemes, and therefore are especially versatile. This
paper introduces numerous constructions of subsystem codes. It is shown how one
c... |
0811.1618 | Airport Gate Assignment: New Model and Implementation | cs.AI | Airport gate assignment is of great importance in airport operations. In this
paper, we study the Airport Gate Assignment Problem (AGAP), propose a new model
and implement the model with Optimization Programming language (OPL). With the
objective to minimize the number of conflicts of any two adjacent aircrafts
assig... |
0811.1629 | Stability Bound for Stationary Phi-mixing and Beta-mixing Processes | cs.LG | Most generalization bounds in learning theory are based on some measure of
the complexity of the hypothesis class used, independently of any algorithm. In
contrast, the notion of algorithmic stability can be used to derive tight
generalization bounds that are tailored to specific learning algorithms by
exploiting the... |
0811.1693 | Protection Schemes for Two Link Failures in Optical Networks | cs.IT cs.NI math.IT | In this paper we develop network protection schemes against two link failures
in optical networks. The motivation behind this work is the fact that the
majority of all available links in an optical network suffer from single and
double link failures. In the proposed network protection schemes, NPS2-I and
NPS2-II, we ... |
0811.1711 | Artificial Intelligence Techniques for Steam Generator Modelling | cs.AI | This paper investigates the use of different Artificial Intelligence methods
to predict the values of several continuous variables from a Steam Generator.
The objective was to determine how the different artificial intelligence
methods performed in making predictions on the given dataset. The artificial
intelligence ... |
0811.1770 | A Class of Transformations that Polarize Symmetric Binary-Input
Memoryless Channels | cs.IT math.IT | A generalization of Ar\i kan's polar code construction using transformations
of the form $G^{\otimes n}$ where $G$ is an $\ell \times \ell$ matrix is
considered. Necessary and sufficient conditions are given for these
transformations to ensure channel polarization. It is shown that a large class
of such transformatio... |
0811.1790 | Robust Regression and Lasso | cs.IT cs.LG math.IT | Lasso, or $\ell^1$ regularized least squares, has been explored extensively
for its remarkable sparsity properties. It is shown in this paper that the
solution to Lasso, in addition to its sparsity, has robustness properties: it
is the solution to a robust optimization problem. This has two important
consequences. Fi... |
0811.1825 | A Divergence Formula for Randomness and Dimension | cs.CC cs.IT math.IT | If $S$ is an infinite sequence over a finite alphabet $\Sigma$ and $\beta$ is
a probability measure on $\Sigma$, then the {\it dimension} of $ S$ with
respect to $\beta$, written $\dim^\beta(S)$, is a constructive version of
Billingsley dimension that coincides with the (constructive Hausdorff)
dimension $\dim(S)$ wh... |
0811.1868 | Necessary Conditions for Discontinuities of Multidimensional Size
Functions | cs.CG cs.CV math.AT | Some new results about multidimensional Topological Persistence are
presented, proving that the discontinuity points of a k-dimensional size
function are necessarily related to the pseudocritical or special values of the
associated measuring function.
|
0811.1878 | Action Theory Evolution | cs.AI cs.LO | Like any other logical theory, domain descriptions in reasoning about actions
may evolve, and thus need revision methods to adequately accommodate new
information about the behavior of actions. The present work is about changing
action domain descriptions in propositional dynamic logic. Its contribution is
threefold:... |
0811.1885 | The Expressive Power of Binary Submodular Functions | cs.DM cs.AI cs.CV | It has previously been an open problem whether all Boolean submodular
functions can be decomposed into a sum of binary submodular functions over a
possibly larger set of variables. This problem has been considered within
several different contexts in computer science, including computer vision,
artificial intelligenc... |
0811.2016 | Land Cover Mapping Using Ensemble Feature Selection Methods | cs.LG | Ensemble classification is an emerging approach to land cover mapping whereby
the final classification output is a result of a consensus of classifiers.
Intuitively, an ensemble system should consist of base classifiers which are
diverse i.e. classifiers whose decision boundaries err differently. In this
paper ensemb... |
0811.2117 | Disjunctive Databases for Representing Repairs | cs.DB | This paper addresses the problem of representing the set of repairs of a
possibly inconsistent database by means of a disjunctive database.
Specifically, the class of denial constraints is considered. We show that,
given a database and a set of denial constraints, there exists a (unique)
disjunctive database, called ... |
0811.2201 | Fast Maximum-Likelihood Decoding of the Golden Code | cs.IT math.IT | The golden code is a full-rate full-diversity space-time code for two
transmit antennas that has a maximal coding gain. Because each codeword conveys
four information symbols from an M-ary quadrature-amplitude modulation
alphabet, the complexity of an exhaustive search decoder is proportional to
M^2. In this paper we... |
0811.2250 | Semantics and Evaluation of Top-k Queries in Probabilistic Databases | cs.DB | We study here fundamental issues involved in top-k query evaluation in
probabilistic databases. We consider simple probabilistic databases in which
probabilities are associated with individual tuples, and general probabilistic
databases in which, additionally, exclusivity relationships between tuples can
be represent... |
0811.2356 | The List-Decoding Size of Reed-Muller Codes | cs.IT cs.DM math.IT | In this work we study the list-decoding size of Reed-Muller codes. Given a
received word and a distance parameter, we are interested in bounding the size
of the list of Reed-Muller codewords that are within that distance from the
received word. Previous bounds of Gopalan, Klivans and Zuckerman \cite{GKZ08}
on the lis... |
0811.2403 | Composite CDMA - A statistical mechanics analysis | cond-mat.dis-nn cond-mat.stat-mech cs.IT math.IT | Code Division Multiple Access (CDMA) in which the spreading code assignment
to users contains a random element has recently become a cornerstone of CDMA
research. The random element in the construction is particular attractive as it
provides robustness and flexibility in utilising multi-access channels, whilst
not ma... |
0811.2518 | Gaussian Belief Propagation: Theory and Aplication | cs.IT math.IT | The canonical problem of solving a system of linear equations arises in
numerous contexts in information theory, communication theory, and related
fields. In this contribution, we develop a solution based upon Gaussian belief
propagation (GaBP) that does not involve direct matrix inversion. The iterative
nature of ou... |
0811.2525 | Amendment to "Performance Analysis of the V-BLAST Algorithm: An
Analytical Approach." [1] | cs.IT math.IT | An analytical technique for the outage and BER analysis of the nx2 V-BLAST
algorithm with the optimal ordering has been presented in [1], including
closed-form exact expressions for average BER and outage probabilities, and
simple high-SNR approximations. The analysis in [1] is based on the following
essential approx... |
0811.2551 | Modeling Cultural Dynamics | cs.MA cs.AI q-bio.NC | EVOC (for EVOlution of Culture) is a computer model of culture that enables
us to investigate how various factors such as barriers to cultural diffusion,
the presence and choice of leaders, or changes in the ratio of innovation to
imitation affect the diversity and effectiveness of ideas. It consists of
neural networ... |
0811.2609 | Noise-Resilient Group Testing: Limitations and Constructions | cs.DM cs.IT math.CO math.IT | We study combinatorial group testing schemes for learning $d$-sparse Boolean
vectors using highly unreliable disjunctive measurements. We consider an
adversarial noise model that only limits the number of false observations, and
show that any noise-resilient scheme in this model can only approximately
reconstruct the... |
0811.2637 | The Design of Compressive Sensing Filter | cs.CE cs.IT math.IT | In this paper, the design of universal compressive sensing filter based on
normal filters including the lowpass, highpass, bandpass, and bandstop filters
with different cutoff frequencies (or bandwidth) has been developed to enable
signal acquisition with sub-Nyquist sampling. Moreover, to control flexibly the
size a... |
0811.2690 | A framework for the local information dynamics of distributed
computation in complex systems | nlin.CG cs.IT math.IT nlin.AO nlin.PS physics.data-an | The nature of distributed computation has often been described in terms of
the component operations of universal computation: information storage,
transfer and modification. We review the first complete framework that
quantifies each of these individual information dynamics on a local scale
within a system, and descr... |
0811.2696 | AG Codes from Polyhedral Divisors | math.AG cs.IT math.IT | A description of complete normal varieties with lower dimensional torus
action has been given by Altmann, Hausen, and Suess, generalizing the theory of
toric varieties. Considering the case where the acting torus T has codimension
one, we describe T-invariant Weil and Cartier divisors and provide formulae for
calcula... |
0811.2841 | Universally Utility-Maximizing Privacy Mechanisms | cs.DB cs.GT | A mechanism for releasing information about a statistical database with
sensitive data must resolve a trade-off between utility and privacy. Privacy
can be rigorously quantified using the framework of {\em differential privacy},
which requires that a mechanism's output distribution is nearly the same
whether or not a... |
0811.2850 | Codes against Online Adversaries | cs.IT math.IT | In this work we consider the communication of information in the presence of
an online adversarial jammer. In the setting under study, a sender wishes to
communicate a message to a receiver by transmitting a codeword x=x_1,...,x_n
symbol-by-symbol over a communication channel. The adversarial jammer can view
the tran... |
0811.2853 | Generating Random Networks Without Short Cycles | cs.DS cs.IT math.IT | Random graph generation is an important tool for studying large complex
networks. Despite abundance of random graph models, constructing models with
application-driven constraints is poorly understood. In order to advance
state-of-the-art in this area, we focus on random graphs without short cycles
as a stylized fami... |
0811.2868 | Approximate Sparse Decomposition Based on Smoothed L0-Norm | cs.MM cs.IT math.IT | In this paper, we propose a method to address the problem of source
estimation for Sparse Component Analysis (SCA) in the presence of additive
noise. Our method is a generalization of a recently proposed method (SL0),
which has the advantage of directly minimizing the L0-norm instead of L1-norm,
while being very fast... |
0811.2904 | Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes | cs.DB cs.DS | Let S be a finite, ordered alphabet, and let x = x_1 x_2 ... x_n be a string
over S. A "secondary index" for x answers alphabet range queries of the form:
Given a range [a_l,a_r] over S, return the set I_{[a_l;a_r]} = {i |x_i \in
[a_l; a_r]}. Secondary indexes are heavily used in relational databases and
scientific d... |
0811.3055 | Exact phase transition of backtrack-free search with implications on the
power of greedy algorithms | cs.AI cs.DM cs.DS | Backtracking is a basic strategy to solve constraint satisfaction problems
(CSPs). A satisfiable CSP instance is backtrack-free if a solution can be found
without encountering any dead-end during a backtracking search, implying that
the instance is easy to solve. We prove an exact phase transition of
backtrack-free s... |
0811.3301 | Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound | cs.DB cs.CV | The Dynamic Time Warping (DTW) is a popular similarity measure between time
series. The DTW fails to satisfy the triangle inequality and its computation
requires quadratic time. Hence, to find closest neighbors quickly, we use
bounding techniques. We can avoid most DTW computations with an inexpensive
lower bound (LB... |
0811.3328 | chi2TeX Semi-automatic translation from chiwriter to LaTeX | cs.SE cs.CV | Semi-automatic translation of math-filled book from obsolete ChiWriter format
to LaTeX. Is it possible? Idea of criterion whether to use automatic or hand
mode for translation. Illustrations.
|
0811.3475 | Robust Network Coding in the Presence of Untrusted Nodes | cs.IT cs.NI math.IT | While network coding can be an efficient means of information dissemination
in networks, it is highly susceptible to "pollution attacks," as the injection
of even a single erroneous packet has the potential to corrupt each and every
packet received by a given destination. Even when suitable error-control coding
is ap... |
0811.3476 | Error correcting code using tree-like multilayer perceptron | cond-mat.stat-mech cond-mat.dis-nn cs.IT math.IT | An error correcting code using a tree-like multilayer perceptron is proposed.
An original message $\mbi{s}^0$ is encoded into a codeword $\boldmath{y}_0$
using a tree-like committee machine (committee tree) or a tree-like parity
machine (parity tree). Based on these architectures, several schemes featuring
monotonic ... |
0811.3536 | Analyse de la rigidit\'e des machines outils 3 axes d'architecture
parall\`ele hyperstatique | cs.RO | The paper presents a new stiffness modelling method for overconstrained
parallel manipulators, which is applied to 3-d.o.f. translational mechanisms.
It is based on a multidimensional lumped-parameter model that replaces the link
flexibility by localized 6-d.o.f. virtual springs. In contrast to other works,
the metho... |
0811.3585 | The Capacity of Ad hoc Networks under Random Packet Losses | cs.IT cs.NI math.IT | We consider the problem of determining asymptotic bounds on the capacity of a
random ad hoc network. Previous approaches assumed a link layer model in which
if a transmitter-receiver pair can communicate with each other, i.e., the
Signal to Interference and Noise Ratio (SINR) is above a certain threshold,
then every ... |
0811.3617 | Distributed Scalar Quantization for Computing: High-Resolution Analysis
and Extensions | cs.IT math.IT | Communication of quantized information is frequently followed by a
computation. We consider situations of \emph{distributed functional scalar
quantization}: distributed scalar quantization of (possibly correlated) sources
followed by centralized computation of a function. Under smoothness conditions
on the sources an... |
0811.3691 | Temporal Support of Regular Expressions in Sequential Pattern Mining | cs.DB | Classic algorithms for sequential pattern discovery, return all frequent
sequences present in a database, but, in general, only a few ones are
interesting for the user. Languages based on regular expressions (RE) have been
proposed to restrict frequent sequences to the ones that satisfy user-specified
constraints. Al... |
0811.3777 | The Relationship between Tsallis Statistics, the Fourier Transform, and
Nonlinear Coupling | cs.IT math.IT math.PR | Tsallis statistics (or q-statistics) in nonextensive statistical mechanics is
a one-parameter description of correlated states. In this paper we use a
translated entropic index: $1 - q \to q$ . The essence of this translation is
to improve the mathematical symmetry of the q-algebra and make q directly
proportional to... |
0811.3887 | Transmit Diversity v. Spatial Multiplexing in Modern MIMO Systems | cs.IT math.IT | A contemporary perspective on the tradeoff between transmit antenna diversity
and spatial multiplexing is provided. It is argued that, in the context of most
modern wireless systems and for the operating points of interest, transmission
techniques that utilize all available spatial degrees of freedom for
multiplexing... |
0811.4033 | Computation of Grobner basis for systematic encoding of generalized
quasi-cyclic codes | cs.IT cs.DM math.AC math.IT | Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear
codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low
density parity check (LDPC) codes, and Hermitian codes. Although it is known
that the systematic encoding of GQC codes is equivalent to the division
algorithm in the ... |
0811.4139 | Artin automorphisms, Cyclotomic function fields, and Folded
list-decodable codes | math.NT cs.IT math.IT | Algebraic codes that achieve list decoding capacity were recently constructed
by a careful ``folding'' of the Reed-Solomon code. The ``low-degree'' nature of
this folding operation was crucial to the list decoding algorithm. We show how
such folding schemes conducive to list decoding arise out of the
Artin-Frobenius ... |
0811.4162 | Optimal Encoding Schemes for Several Classes of Discrete Degraded
Broadcast Channels | cs.IT math.IT | Consider a memoryless degraded broadcast channel (DBC) in which the channel
output is a single-letter function of the channel input and the channel noise.
As examples, for the Gaussian broadcast channel (BC) this single-letter
function is regular Euclidian addition and for the binary-symmetric BC this
single-letter f... |
0811.4163 | Packing and Covering Properties of Subspace Codes for Error Control in
Random Linear Network Coding | cs.IT math.IT | Codes in the projective space and codes in the Grassmannian over a finite
field - referred to as subspace codes and constant-dimension codes (CDCs),
respectively - have been proposed for error control in random linear network
coding. For subspace codes and CDCs, a subspace metric was introduced to
correct both errors... |
0811.4186 | Search Result Clustering via Randomized Partitioning of Query-Induced
Subgraphs | cs.IR cs.DS | In this paper, we present an approach to search result clustering, using
partitioning of underlying link graph. We define the notion of "query-induced
subgraph" and formulate the problem of search result clustering as a problem of
efficient partitioning of given subgraph into topic-related clusters. Also, we
propose ... |
0811.4191 | Performance of Hybrid-ARQ in Block-Fading Channels: A Fixed Outage
Probability Analysis | cs.IT math.IT | This paper studies the performance of hybrid-ARQ (automatic repeat request)
in Rayleigh block fading channels. The long-term average transmitted rate is
analyzed in a fast-fading scenario where the transmitter only has knowledge of
channel statistics, and, consistent with contemporary wireless systems, rate
adaptatio... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.