id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0803.3946 | On the `Semantics' of Differential Privacy: A Bayesian Formulation | cs.CR cs.DB | Differential privacy is a definition of "privacy'" for algorithms that
analyze and publish information about statistical databases. It is often
claimed that differential privacy provides guarantees against adversaries with
arbitrary side information. In this paper, we provide a precise formulation of
these guarantees... |
0803.4026 | High-dimensional analysis of semidefinite relaxations for sparse
principal components | math.ST cs.IT math.IT stat.TH | Principal component analysis (PCA) is a classical method for dimensionality
reduction based on extracting the dominant eigenvectors of the sample
covariance matrix. However, PCA is well known to behave poorly in the ``large
$p$, small $n$'' setting, in which the problem dimension $p$ is comparable to
or larger than t... |
0803.4074 | Reflective visualization and verbalization of unconscious preference | cs.AI | A new method is presented, that can help a person become aware of his or her
unconscious preferences, and convey them to others in the form of verbal
explanation. The method combines the concepts of reflection, visualization, and
verbalization. The method was tested in an experiment where the unconscious
preferences ... |
0803.4240 | Neutral Fitness Landscape in the Cellular Automata Majority Problem | cs.NE | We study in detail the fitness landscape of a difficult cellular automata
computational task: the majority problem. Our results show why this problem
landscape is so hard to search, and we quantify the large degree of neutrality
found in various ways. We show that a particular subspace of the solution
space, called t... |
0803.4241 | Evolving Dynamic Change and Exchange of Genotype Encoding in Genetic
Algorithms for Difficult Optimization Problems | cs.NE | The application of genetic algorithms (GAs) to many optimization problems in
organizations often results in good performance and high quality solutions. For
successful and efficient use of GAs, it is not enough to simply apply simple
GAs (SGAs). In addition, it is necessary to find a proper representation for
the pro... |
0803.4248 | From Cells to Islands: An unified Model of Cellular Parallel Genetic
Algorithms | cs.NE | This paper presents the Anisotropic selection scheme for cellular Genetic
Algorithms (cGA). This new scheme allows to enhance diversity and to control
the selective pressure which are two important issues in Genetic Algorithms,
especially when trying to solve difficult optimization problems. Varying the
anisotropic d... |
0803.4253 | Combinatorial Explorations in Su-Doku | cs.AI cs.CC | Su-Doku, a popular combinatorial puzzle, provides an excellent testbench for
heuristic explorations. Several interesting questions arise from its
deceptively simple set of rules. How many distinct Su-Doku grids are there? How
to find a solution to a Su-Doku puzzle? Is there a unique solution to a given
Su-Doku puzzle... |
0803.4332 | On Sequential Estimation and Prediction for Discrete Time Series | math.PR cs.IT math.IT | The problem of extracting as much information as possible from a sequence of
observations of a stationary stochastic process $X_0,X_1,...X_n$ has been
considered by many authors from different points of view. It has long been
known through the work of D. Bailey that no universal estimator for
$\textbf{P}(X_{n+1}|X_0,... |
0803.4355 | Grammar-Based Random Walkers in Semantic Networks | cs.AI cs.DS | Semantic networks qualify the meaning of an edge relating any two vertices.
Determining which vertices are most "central" in a semantic network is
difficult because one relationship type may be deemed subjectively more
important than another. For this reason, research into semantic network metrics
has focused primari... |
0804.0006 | Embedding in a perfect code | math.CO cs.IT math.IT | A binary 1-error-correcting code can always be embedded in a 1-perfect code
of some larger length
|
0804.0036 | Complexity and algorithms for computing Voronoi cells of lattices | math.MG cs.CG cs.IT math.IT math.NT | In this paper we are concerned with finding the vertices of the Voronoi cell
of a Euclidean lattice. Given a basis of a lattice, we prove that computing the
number of vertices is a #P-hard problem. On the other hand we describe an
algorithm for this problem which is especially suited for low dimensional (say
dimensio... |
0804.0041 | On the reconstruction of block-sparse signals with an optimal number of
measurements | cs.IT cs.NA math.IT | Let A be an M by N matrix (M < N) which is an instance of a real random
Gaussian ensemble. In compressed sensing we are interested in finding the
sparsest solution to the system of equations A x = y for a given y. In general,
whenever the sparsity of x is smaller than half the dimension of y then with
overwhelming pr... |
0804.0050 | Outage Probability of the Gaussian MIMO Free-Space Optical Channel with
PPM | cs.IT math.IT | The free-space optical channel has the potential to facilitate inexpensive,
wireless communication with fiber-like bandwidth under short deployment
timelines. However, atmospheric effects can significantly degrade the
reliability of a free-space optical link. In particular, atmospheric turbulence
causes random fluctu... |
0804.0066 | Binary Decision Diagrams for Affine Approximation | cs.LO cs.AI | Selman and Kautz's work on ``knowledge compilation'' established how
approximation (strengthening and/or weakening) of a propositional
knowledge-base can be used to speed up query processing, at the expense of
completeness. In this classical approach, querying uses Horn over- and
under-approximations of a given knowl... |
0804.0143 | Effects of High-Order Co-occurrences on Word Semantic Similarities | cs.CL | A computational model of the construction of word meaning through exposure to
texts is built in order to simulate the effects of co-occurrence values on word
semantic similarities, paragraph by paragraph. Semantic similarity is here
viewed as association. It turns out that the similarity between two words W1
and W2 s... |
0804.0188 | Support Vector Machine Classification with Indefinite Kernels | cs.LG cs.AI | We propose a method for support vector machine classification using
indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex
loss function, our algorithm simultaneously computes support vectors and a
proxy kernel matrix used in forming the loss. This can be interpreted as a
penalized kernel learn... |
0804.0317 | Parts-of-Speech Tagger Errors Do Not Necessarily Degrade Accuracy in
Extracting Information from Biomedical Text | cs.CL cs.IR | A recent study reported development of Muscorian, a generic text processing
tool for extracting protein-protein interactions from text that achieved
comparable performance to biomedical-specific text processing tools. This
result was unexpected since potential errors from a series of text analysis
processes is likely... |
0804.0318 | Moore and more and symmetry | cs.MA physics.comp-ph | In any spatially discrete model of pedestrian motion which uses a regular
lattice as basis, there is the question of how the symmetry between the
different directions of motion can be restored as far as possible but with
limited computational effort. This question is equivalent to the question ''How
important is the ... |
0804.0337 | On the Convexity of the MSE Region of Single-Antenna Users | cs.IT math.IT | We prove convexity of the sum-power constrained mean square error (MSE)
region in case of two single-antenna users communicating with a multi-antenna
base station. Due to the MSE duality this holds both for the vector broadcast
channel and the dual multiple access channel. Increasing the number of users to
more than ... |
0804.0352 | Permeability Analysis based on information granulation theory | cs.NE cs.AI | This paper describes application of information granulation theory, on the
analysis of "lugeon data". In this manner, using a combining of Self Organizing
Map (SOM) and Neuro-Fuzzy Inference System (NFIS), crisp and fuzzy granules are
obtained. Balancing of crisp granules and sub- fuzzy granules, within non fuzzy
inf... |
0804.0353 | Graphical Estimation of Permeability Using RST&NFIS | cs.NE cs.AI | This paper pursues some applications of Rough Set Theory (RST) and
neural-fuzzy model to analysis of "lugeon data". In the manner, using Self
Organizing Map (SOM) as a pre-processing the data are scaled and then the
dominant rules by RST, are elicited. Based on these rules variations of
permeability in the different ... |
0804.0385 | On the Sum-Capacity of Degraded Gaussian Multiaccess Relay Channels | cs.IT math.IT | The sum-capacity is studied for a K-user degraded Gaussian multiaccess relay
channel (MARC) where the multiaccess signal received at the destination from
the K sources and relay is a degraded version of the signal received at the
relay from all sources, given the transmit signal at the relay. An outer bound
on the ca... |
0804.0441 | Joint Beamforming for Multiaccess MIMO Systems with Finite Rate Feedback | cs.IT math.IT | This paper considers multiaccess multiple-input multiple-output (MIMO)
systems with finite rate feedback. The goal is to understand how to efficiently
employ the given finite feedback resource to maximize the sum rate by
characterizing the performance analytically. Towards this, we propose a joint
quantization and fe... |
0804.0506 | Distributed Consensus over Wireless Sensor Networks Affected by
Multipath Fading | cs.DC cs.MA | The design of sensor networks capable of reaching a consensus on a globally
optimal decision test, without the need for a fusion center, is a problem that
has received considerable attention in the last years. Many consensus
algorithms have been proposed, with convergence conditions depending on the
graph describing ... |
0804.0510 | Nonparametric Statistical Inference for Ergodic Processes | cs.IT math.IT math.ST stat.TH | In this work a method for statistical analysis of time series is proposed,
which is used to obtain solutions to some classical problems of mathematical
statistics under the only assumption that the process generating the data is
stationary ergodic. Namely, three problems are considered: goodness-of-fit (or
identity) ... |
0804.0524 | Bayesian Optimisation Algorithm for Nurse Scheduling | cs.NE cs.CE | Our research has shown that schedules can be built mimicking a human
scheduler by using a set of rules that involve domain knowledge. This chapter
presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling
problem that chooses such suitable scheduling rules from a set for each nurses
assignment. Based ... |
0804.0528 | Application of Rough Set Theory to Analysis of Hydrocyclone Operation | cs.AI | This paper describes application of rough set theory, on the analysis of
hydrocyclone operation. In this manner, using Self Organizing Map (SOM) as
preprocessing step, best crisp granules of data are obtained. Then, using a
combining of SOM and rough set theory (RST)-called SORST-, the dominant rules
on the informati... |
0804.0539 | Irregular turbo code design for the binary erasure channel | cs.IT math.IT | In this paper, the design of irregular turbo codes for the binary erasure
channel is investigated. An analytic expression of the erasure probability of
punctured recursive systematic convolutional codes is derived. This exact
expression will be used to track the density evolution of turbo codes over the
erasure chann... |
0804.0558 | Agent-Based Perception of an Environment in an Emergency Situation | cs.AI | We are interested in the problem of multiagent systems development for risk
detecting and emergency response in an uncertain and partially perceived
environment. The evaluation of the current situation passes by three stages
inside the multiagent system. In a first time, the situation is represented in
a dynamic way.... |
0804.0573 | An Artificial Immune System as a Recommender System for Web Sites | cs.NE cs.AI | Artificial Immune Systems have been used successfully to build recommender
systems for film databases. In this research, an attempt is made to extend this
idea to web site recommendation. A collection of more than 1000 individuals web
profiles (alternatively called preferences / favourites / bookmarks file) will
be u... |
0804.0580 | Explicit Learning: an Effort towards Human Scheduling Algorithms | cs.NE cs.AI | Scheduling problems are generally NP-hard combinatorial problems, and a lot
of research has been done to solve these problems heuristically. However, most
of the previous approaches are problem-specific and research into the
development of a general scheduling algorithm is still in its infancy.
Mimicking the natura... |
0804.0599 | Symmetry Breaking for Maximum Satisfiability | cs.AI cs.LO | Symmetries are intrinsic to many combinatorial problems including Boolean
Satisfiability (SAT) and Constraint Programming (CP). In SAT, the
identification of symmetry breaking predicates (SBPs) is a well-known, often
effective, technique for solving hard problems. The identification of SBPs in
SAT has been the subjec... |
0804.0611 | Channel State Feedback Schemes for Multiuser MIMO-OFDM Downlink | cs.IT math.IT | Channel state feedback schemes for the MIMO broadcast downlink have been
widely studied in the frequency-flat case. This work focuses on the more
relevant frequency selective case, where some important new aspects emerge. We
consider a MIMO-OFDM broadcast channel and compare achievable ergodic rates
under three chann... |
0804.0635 | Source Coding with Mismatched Distortion Measures | cs.IT math.IT | We consider the problem of lossy source coding with a mismatched distortion
measure. That is, we investigate what distortion guarantees can be made with
respect to distortion measure $\tilde{\rho}$, for a source code designed such
that it achieves distortion less than $D$ with respect to distortion measure
$\rho$. We... |
0804.0686 | Discrimination of two channels by adaptive methods and its application
to quantum system | quant-ph cs.IT math.IT math.ST stat.TH | The optimal exponential error rate for adaptive discrimination of two
channels is discussed. In this problem, adaptive choice of input signal is
allowed. This problem is discussed in various settings. It is proved that
adaptive choice does not improve the exponential error rate in these settings.
These results are ap... |
0804.0790 | Outage behavior of slow fading channels with power control using noisy
quantized CSIT | cs.IT math.IT | The topic of this study is the outage behavior of multiple-antenna slow
fading channels with quantized feedback and partial power control. A fixed-rate
communication system is considered. It is known from the literature that with
error-free feedback, the outage-optimal quantizer for power control has a
circular struc... |
0804.0813 | Spatial Interference Cancelation for Mobile Ad Hoc Networks: Perfect CSI | cs.IT cs.NI math.IT | Interference between nodes directly limits the capacity of mobile ad hoc
networks. This paper focuses on spatial interference cancelation with perfect
channel state information (CSI), and analyzes the corresponding network
capacity. Specifically, by using multiple antennas, zero-forcing beamforming is
applied at each... |
0804.0819 | Kalman Filtered Compressed Sensing | cs.IT math.IT math.ST stat.TH | We consider the problem of reconstructing time sequences of spatially sparse
signals (with unknown and time-varying sparsity patterns) from a limited number
of linear "incoherent" measurements, in real-time. The signals are sparse in
some transform domain referred to as the sparsity basis. For a single spatial
signal... |
0804.0852 | On the Influence of Selection Operators on Performances in Cellular
Genetic Algorithms | cs.AI | In this paper, we study the influence of the selective pressure on the
performance of cellular genetic algorithms. Cellular genetic algorithms are
genetic algorithms where the population is embedded on a toroidal grid. This
structure makes the propagation of the best so far individual slow down, and
allows to keep in... |
0804.0924 | A Unified Semi-Supervised Dimensionality Reduction Framework for
Manifold Learning | cs.LG cs.AI | We present a general framework of semi-supervised dimensionality reduction
for manifold learning which naturally generalizes existing supervised and
unsupervised learning frameworks which apply the spectral decomposition.
Algorithms derived under our framework are able to employ both labeled and
unlabeled examples an... |
0804.0980 | Large MIMO Detection: A Low-Complexity Detector at High Spectral
Efficiencies | cs.IT math.IT | We consider large MIMO systems, where by `{\em large}' we mean number of
transmit and receive antennas of the order of tens to hundreds. Such large MIMO
systems will be of immense interest because of the very high spectral
efficiencies possible in such systems. We present a low-complexity detector
which achieves unco... |
0804.0996 | Woven Graph Codes: Asymptotic Performances and Examples | cs.IT math.IT | Constructions of woven graph codes based on constituent block and
convolutional codes are studied. It is shown that within the random ensemble of
such codes based on $s$-partite, $s$-uniform hypergraphs, where $s$ depends
only on the code rate, there exist codes satisfying the Varshamov-Gilbert (VG)
and the Costello ... |
0804.1033 | A Semi-Automatic Framework to Discover Epistemic Modalities in
Scientific Articles | cs.CL cs.LO | Documents in scientific newspapers are often marked by attitudes and opinions
of the author and/or other persons, who contribute with objective and
subjective statements and arguments as well. In this respect, the attitude is
often accomplished by a linguistic modality. As in languages like english,
french and german... |
0804.1046 | Discrete schemes for Gaussian curvature and their convergence | cs.CV cs.CG cs.GR cs.NA | In this paper, several discrete schemes for Gaussian curvature are surveyed.
The convergence property of a modified discrete scheme for the Gaussian
curvature is considered. Furthermore, a new discrete scheme for Gaussian
curvature is resented. We prove that the new scheme converges at the regular
vertex with valence... |
0804.1083 | Towards algebraic methods for maximum entropy estimation | cs.IT math.IT | We show that various formulations (e.g., dual and Kullback-Csiszar
iterations) of estimation of maximum entropy (ME) models can be transformed to
solving systems of polynomial equations in several variables for which one can
use celebrated Grobner bases methods. Posing of ME estimation as solving
polynomial equations... |
0804.1117 | Network Beamforming Using Relays with Perfect Channel Information | cs.IT math.IT | This paper is on beamforming in wireless relay networks with perfect channel
information at relays, the receiver, and the transmitter if there is a direct
link between the transmitter and receiver. It is assumed that every node in the
network has its own power constraint. A two-step amplify-and-forward protocol
is us... |
0804.1133 | Prospective Algorithms for Quantum Evolutionary Computation | cs.NE | This effort examines the intersection of the emerging field of quantum
computing and the more established field of evolutionary computation. The goal
is to understand what benefits quantum computing might offer to computational
intelligence and how computational intelligence paradigms might be implemented
as quantum ... |
0804.1172 | Transceiver Design with Low-Precision Analog-to-Digital Conversion : An
Information-Theoretic Perspective | cs.IT math.IT | Modern communication receiver architectures center around digital signal
processing (DSP), with the bulk of the receiver processing being performed on
digital signals obtained after analog-to-digital conversion (ADC). In this
paper, we explore Shannon-theoretic performance limits when ADC precision is
drastically red... |
0804.1183 | Hash Property and Fixed-rate Universal Coding Theorems | cs.IT math.IT | The aim of this paper is to prove the achievability of fixed-rate universal
coding problems by using our previously introduced notion of hash property.
These problems are the fixed-rate lossless universal source coding problem and
the fixed-rate universal channel coding problem. Since an ensemble of sparse
matrices s... |
0804.1187 | M\'ethode de calcul du rayonnement acoustique de structures complexes | cs.CE | In the automotive industry, predicting noise during design cycle is a
necessary step. Well-known methods exist to answer this issue in low frequency
domain. Among these, Finite Element Methods, adapted to closed domains, are
quite easy to implement whereas Boundary Element Methods are more adapted to
infinite domains... |
0804.1193 | Spreading Signals in the Wideband Limit | cs.IT math.IT | Wideband communications are impossible with signals that are spread over a
very large band and are transmitted over multipath channels unknown ahead of
time. This work exploits the I-mmse connection to bound the achievable
data-rate of spreading signals in wideband settings, and to conclude that the
achievable data-r... |
0804.1244 | Geometric Data Analysis, From Correspondence Analysis to Structured Data
Analysis (book review) | cs.AI | Review of: Brigitte Le Roux and Henry Rouanet, Geometric Data Analysis, From
Correspondence Analysis to Structured Data Analysis, Kluwer, Dordrecht, 2004,
xi+475 pp.
|
0804.1266 | Immune System Approaches to Intrusion Detection - A Review | cs.NE cs.CR | The use of artificial immune systems in intrusion detection is an appealing
concept for two reasons. Firstly, the human immune system provides the human
body with a high level of protection from invading pathogens, in a robust,
self-organised and distributed manner. Secondly, current techniques used in
computer secur... |
0804.1281 | Data Reduction in Intrusion Alert Correlation | cs.CR cs.NE | Network intrusion detection sensors are usually built around low level models
of network traffic. This means that their output is of a similarly low level
and as a consequence, is difficult to analyze. Intrusion alert correlation is
the task of automating some of this analysis by grouping related alerts
together. Att... |
0804.1302 | Bolasso: model consistent Lasso estimation through the bootstrap | cs.LG math.ST stat.ML stat.TH | We consider the least-square linear regression problem with regularization by
the l1-norm, a problem usually referred to as the Lasso. In this paper, we
present a detailed asymptotic analysis of model consistency of the Lasso. For
various decays of the regularization parameter, we compute asymptotic
equivalents of th... |
0804.1382 | Interference-Assisted Secret Communication | cs.IT cs.CR math.IT | Wireless communication is susceptible to adversarial eavesdropping due to the
broadcast nature of the wireless medium. In this paper it is shown how
eavesdropping can be alleviated by exploiting the superposition property of the
wireless medium. A wiretap channel with a helping interferer (WT-HI), in which
a transmit... |
0804.1409 | Discovering More Accurate Frequent Web Usage Patterns | cs.DB cs.DS | Web usage mining is a type of web mining, which exploits data mining
techniques to discover valuable information from navigation behavior of World
Wide Web users. As in classical data mining, data preparation and pattern
discovery are the main issues in web usage mining. The first phase of web usage
mining is the dat... |
0804.1421 | A $O(\log m)$, deterministic, polynomial-time computable approximation
of Lewis Carroll's scoring rule | cs.GT cs.AI cs.MA | We provide deterministic, polynomial-time computable voting rules that
approximate Dodgson's and (the ``minimization version'' of) Young's scoring
rules to within a logarithmic factor. Our approximation of Dodgson's rule is
tight up to a constant factor, as Dodgson's rule is $\NP$-hard to approximate
to within some l... |
0804.1441 | On Kernelization of Supervised Mahalanobis Distance Learners | cs.LG cs.AI | This paper focuses on the problem of kernelizing an existing supervised
Mahalanobis distance learner. The following features are included in the paper.
Firstly, three popular learners, namely, "neighborhood component analysis",
"large margin nearest neighbors" and "discriminant neighborhood embedding",
which do not h... |
0804.1448 | Fast k Nearest Neighbor Search using GPU | cs.CV cs.DC | The recent improvements of graphics processing units (GPU) offer to the
computer vision community a powerful processing platform. Indeed, a lot of
highly-parallelizable computer vision problems can be significantly accelerated
using GPU architecture. Among these algorithms, the k nearest neighbor search
(KNN) is a we... |
0804.1490 | Distributed Space-Time Block Codes for the MIMO Multiple Access Channel | cs.IT math.IT | In this work, the Multiple transmit antennas Multiple Access Channel is
considered. A construction of a family of distributed space-time codes for this
channel is proposed. No Channel Side Information at the transmitters is assumed
and users are not allowed to cooperate together. It is shown that the proposed
code ac... |
0804.1493 | Distributed Space Time Codes for the Amplify-and-Forward Multiple-Access
Relay Channel | cs.IT math.IT | In this work, we present a construction of a family of space-time block codes
for a Multi-Access Amplify-and- Forward Relay channel with two users and a
single half-duplex relay. It is assumed that there is no Channel Side
Information at the transmitters and that they are not allowed to cooperate
together. Using the ... |
0804.1602 | Multiterminal source coding with complementary delivery | cs.IT math.IT | A coding problem for correlated information sources is investigated. Messages
emitted from two correlated sources are jointly encoded, and delivered to two
decoders. Each decoder has access to one of the two messages to enable it to
reproduce the other message. The rate-distortion function for the coding
problem and ... |
0804.1617 | Optimal Power Control over Fading Cognitive Radio Channels by Exploiting
Primary User CSI | cs.IT math.IT | This paper is concerned with spectrum sharing cognitive radio networks, where
a secondary user (SU) or cognitive radio link communicates simultaneously over
the same frequency band with an existing primary user (PU) link. It is assumed
that the SU transmitter has the perfect channel state information (CSI) on the
fad... |
0804.1653 | Nonextensive Generalizations of the Jensen-Shannon Divergence | cs.IT math.IT math.ST stat.TH | Convexity is a key concept in information theory, namely via the many
implications of Jensen's inequality, such as the non-negativity of the
Kullback-Leibler divergence (KLD). Jensen's inequality also underlies the
concept of Jensen-Shannon divergence (JSD), which is a symmetrized and smoothed
version of the KLD. Thi... |
0804.1669 | Subclose Families, Threshold Graphs, and the Weight Hierarchy of
Grassmann and Schubert Codes | math.CO cs.IT math.IT | We discuss the problem of determining the complete weight hierarchy of linear
error correcting codes associated to Grassmann varieties and, more generally,
to Schubert varieties in Grassmannians. The problem is partially solved in the
case of Grassmann codes, and one of the solutions uses the combinatorial notion
of ... |
0804.1697 | Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes | cs.IT math.IT | We consider lossy compression of a binary symmetric source by means of a
low-density generator-matrix code. We derive two lower bounds on the rate
distortion function which are valid for any low-density generator-matrix code
with a given node degree distribution L(x) on the set of generators and for any
encoding algo... |
0804.1740 | Pseudo Quasi-3 Designs and their Applications to Coding Theory | math.CO cs.IT math.IT | We define a pseudo quasi-3 design as a symmetric design with the property
that the derived and residual designs with respect to at least one block are
quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self
complementary codes. In this article we give a construction of an infinite
family of pse... |
0804.1748 | Noncoherent Capacity of Underspread Fading Channels | cs.IT math.IT | We derive bounds on the noncoherent capacity of wide-sense stationary
uncorrelated scattering (WSSUS) channels that are selective both in time and
frequency, and are underspread, i.e., the product of the channel's delay spread
and Doppler spread is small. For input signals that are peak constrained in
time and freque... |
0804.1762 | The Choquet integral for the aggregation of interval scales in
multicriteria decision making | cs.DM cs.AI | This paper addresses the question of which models fit with information
concerning the preferences of the decision maker over each attribute, and his
preferences about aggregation of criteria (interacting criteria). We show that
the conditions induced by these information plus some intuitive conditions lead
to a uniqu... |
0804.1811 | Space-Time Codes from Structured Lattices | cs.IT math.IT | We present constructions of Space-Time (ST) codes based on lattice coset
coding. First, we focus on ST code constructions for the short block-length
case, i.e., when the block-length is equal to or slightly larger than the
number of transmit antennas. We present constructions based on dense lattice
packings and neste... |
0804.1839 | Necessary and Sufficient Conditions on Sparsity Pattern Recovery | cs.IT math.IT | The problem of detecting the sparsity pattern of a k-sparse vector in R^n
from m random noisy measurements is of interest in many areas such as system
identification, denoising, pattern recognition, and compressed sensing. This
paper addresses the scaling of the number of measurements m, with signal
dimension n and s... |
0804.1840 | Selfish Distributed Compression over Networks: Correlation Induces
Anarchy | cs.GT cs.IT math.IT | We consider the min-cost multicast problem (under network coding) with
multiple correlated sources where each terminal wants to losslessly reconstruct
all the sources. We study the inefficiency brought forth by the selfish
behavior of the terminals in this scenario by modeling it as a noncooperative
game among the te... |
0804.1845 | An Optimal Bloom Filter Replacement Based on Matrix Solving | cs.DS cs.DB | We suggest a method for holding a dictionary data structure, which maps keys
to values, in the spirit of Bloom Filters. The space requirements of the
dictionary we suggest are much smaller than those of a hashtable. We allow
storing n keys, each mapped to value which is a string of k bits. Our suggested
method requir... |
0804.1893 | The F.A.S.T.-Model | cs.MA physics.soc-ph | A discrete model of pedestrian motion is presented that is implemented in the
Floor field- and Agentbased Simulation Tool (F.A.S.T.) which has already been
applicated to a variety of real life scenarios.
|
0804.1982 | Linear Time Recognition Algorithms for Topological Invariants in 3D | cs.CV | In this paper, we design linear time algorithms to recognize and determine
topological invariants such as the genus and homology groups in 3D. These
properties can be used to identify patterns in 3D image recognition. This has
tremendous amount of applications in 3D medical image analysis. Our method is
based on cubi... |
0804.2036 | Towards Physarum robots: computing and manipulating on water surface | cs.RO cs.AI | Plasmodium of Physarym polycephalum is an ideal biological substrate for
implementing concurrent and parallel computation, including combinatorial
geometry and optimization on graphs. We report results of scoping experiments
on Physarum computing in conditions of minimal friction, on the water surface.
We show that p... |
0804.2057 | Comparing and Combining Methods for Automatic Query Expansion | cs.IR | Query expansion is a well known method to improve the performance of
information retrieval systems. In this work we have tested different approaches
to extract the candidate query terms from the top ranked documents returned by
the first-pass retrieval.
One of them is the cooccurrence approach, based on measures of... |
0804.2095 | A Logic Programming Framework for Combinational Circuit Synthesis | cs.LO cs.CE cs.DM cs.PL | Logic Programming languages and combinational circuit synthesis tools share a
common "combinatorial search over logic formulae" background. This paper
attempts to reconnect the two fields with a fresh look at Prolog encodings for
the combinatorial objects involved in circuit synthesis. While benefiting from
Prolog's ... |
0804.2138 | A constructive proof of the existence of Viterbi processes | math.ST cs.IT math.IT math.PR stat.CO stat.ML stat.TH | Since the early days of digital communication, hidden Markov models (HMMs)
have now been also routinely used in speech recognition, processing of natural
languages, images, and in bioinformatics. In an HMM $(X_i,Y_i)_{i\ge 1}$,
observations $X_1,X_2,...$ are assumed to be conditionally independent given an
``explanat... |
0804.2155 | From Qualitative to Quantitative Proofs of Security Properties Using
First-Order Conditional Logic | cs.CR cs.AI cs.LO | A first-order conditional logic is considered, with semantics given by a
variant of epsilon-semantics, where p -> q means that Pr(q | p) approaches 1
super-polynomially --faster than any inverse polynomial. This type of
convergence is needed for reasoning about security protocols. A complete
axiomatization is provide... |
0804.2189 | Impact of Spatial Correlation on the Finite-SNR Diversity-Multiplexing
Tradeoff | cs.IT math.IT | The impact of spatial correlation on the performance limits of multielement
antenna (MEA) channels is analyzed in terms of the diversity-multiplexing
tradeoff (DMT) at finite signal-to-noise ratio (SNR) values. A lower bound on
the outage probability is first derived. Using this bound accurate finite-SNR
estimate of ... |
0804.2249 | The Secrecy Graph and Some of its Properties | cs.IT cs.DM math.IT math.PR | A new random geometric graph model, the so-called secrecy graph, is
introduced and studied. The graph represents a wireless network and includes
only edges over which secure communication in the presence of eavesdroppers is
possible. The underlying point process models considered are lattices and
Poisson point proces... |
0804.2288 | Parimutuel Betting on Permutations | cs.GT cs.CC cs.DS cs.MA | We focus on a permutation betting market under parimutuel call auction model
where traders bet on the final ranking of n candidates. We present a
Proportional Betting mechanism for this market. Our mechanism allows the
traders to bet on any subset of the n x n 'candidate-rank' pairs, and rewards
them proportionally t... |
0804.2346 | Theory and Applications of Two-dimensional, Null-boundary,
Nine-Neighborhood, Cellular Automata Linear rules | cs.DM cs.CC cs.CV | This paper deals with the theory and application of 2-Dimensional,
nine-neighborhood, null- boundary, uniform as well as hybrid Cellular Automata
(2D CA) linear rules in image processing. These rules are classified into nine
groups depending upon the number of neighboring cells influences the cell under
consideration... |
0804.2354 | Information filtering based on wiki index database | cs.IR cs.CL | In this paper we present a profile-based approach to information filtering by
an analysis of the content of text documents. The Wikipedia index database is
created and used to automatically generate the user profile from the user
document collection. The problem-oriented Wikipedia subcorpora are created
(using knowle... |
0804.2401 | Causal models have no complete axiomatic characterization | cs.AI cs.LO | Markov networks and Bayesian networks are effective graphic representations
of the dependencies embedded in probabilistic models. It is well known that
independencies captured by Markov networks (called graph-isomorphs) have a
finite axiomatic characterization. This paper, however, shows that
independencies captured ... |
0804.2435 | On the Expressiveness and Complexity of ATL | cs.LO cs.GT cs.MA | ATL is a temporal logic geared towards the specification and verification of
properties in multi-agents systems. It allows to reason on the existence of
strategies for coalitions of agents in order to enforce a given property. In
this paper, we first precisely characterize the complexity of ATL
model-checking over Al... |
0804.2469 | On analytic properties of entropy rate | cs.IT math.IT | Entropy rate is a real valued functional on the space of discrete random
sources which lacks a closed formula even for subclasses of sources which have
intuitive parameterizations. A good way to overcome this problem is to examine
its analytic properties relative to some reasonable topology. A canonical
choice of a t... |
0804.2473 | A Design Framework for Limited Feedback MIMO Systems with Zero-Forcing
DFE | cs.IT math.IT | We consider the design of multiple-input multiple-output communication
systems with a linear precoder at the transmitter, zero-forcing decision
feedback equalization (ZF-DFE) at the receiver, and a low-rate feedback channel
that enables communication from the receiver to the transmitter. The channel
state information... |
0804.2487 | The ergodic decomposition of asymptotically mean stationary random
sources | cs.IT math.IT math.PR | It is demonstrated how to represent asymptotically mean stationary (AMS)
random sources with values in standard spaces as mixtures of ergodic AMS
sources. This an extension of the well known decomposition of stationary
sources which has facilitated the generalization of prominent source coding
theorems to arbitrary, ... |
0804.2576 | Interlace Polynomials: Enumeration, Unimodality, and Connections to
Codes | math.CO cs.IT math.IT | The interlace polynomial q was introduced by Arratia, Bollobas, and Sorkin.
It encodes many properties of the orbit of a graph under edge local
complementation (ELC). The interlace polynomial Q, introduced by Aigner and van
der Holst, similarly contains information about the orbit of a graph under
local complementati... |
0804.2808 | Robust Precoder for Multiuser MISO Downlink with SINR Constraints | cs.IT math.IT | In this paper, we consider linear precoding with SINR constraints for the
downlink of a multiuser MISO (multiple-input single-output) communication
system in the presence of imperfect channel state information (CSI). The base
station is equipped with multiple transmit antennas and each user terminal is
equipped with ... |
0804.2844 | An Analysis of Key Factors for the Success of the Communal Management of
Knowledge | cs.HC cs.AI | This paper explores the links between Knowledge Management and new
community-based models of the organization from both a theoretical and an
empirical perspective. From a theoretical standpoint, we look at Communities of
Practice (CoPs) and Knowledge Management (KM) and explore the links between the
two as they relat... |
0804.2940 | Secret Key Agreement by Soft-decision of Signals in Gaussian Maurer's
Model | cs.IT cs.CR math.IT | We consider the problem of secret key agreement in Gaussian Maurer's Model.
In Gaussian Maurer's model, legitimate receivers, Alice and Bob, and a
wire-tapper, Eve, receive signals randomly generated by a satellite through
three independent memoryless Gaussian channels respectively. Then Alice and Bob
generate a comm... |
0804.2950 | An Adaptive-Parity Error-Resilient LZ'77 Compression Algorithm | cs.IT math.IT | The paper proposes an improved error-resilient Lempel-Ziv'77 (LZ'77)
algorithm employing an adaptive amount of parity bits for error protection. It
is a modified version of error resilient algorithm LZRS'77, proposed recently,
which uses a constant amount of parity over all of the encoded blocks of data.
The constant... |
0804.2960 | Eigenvalue based Spectrum Sensing Algorithms for Cognitive Radio | cs.IT math.IT | Spectrum sensing is a fundamental component is a cognitive radio. In this
paper, we propose new sensing methods based on the eigenvalues of the
covariance matrix of signals received at the secondary users. In particular,
two sensing algorithms are suggested, one is based on the ratio of the maximum
eigenvalue to mini... |
0804.2991 | Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC | cs.IT math.IT | Recent works showed how low-density parity-check (LDPC) erasure correcting
codes, under maximum likelihood (ML) decoding, are capable of tightly
approaching the performance of an ideal maximum-distance-separable code on the
binary erasure channel. Such result is achievable down to low error rates, even
for small and ... |
0804.2998 | OFDM based Distributed Space Time Coding for Asynchronous Relay Networks | cs.IT math.IT | Recently Li and Xia have proposed a transmission scheme for wireless relay
networks based on the Alamouti space time code and orthogonal frequency
division multiplexing to combat the effect of timing errors at the relay nodes.
This transmission scheme is amazingly simple and achieves a diversity order of
two for any ... |
0804.3109 | Partial Cross-Correlation of D-Sequences based CDMA System | cs.IT math.IT | Like other pseudorandom sequences, decimal sequences may be used in designing
a Code Division Multiple Access (CDMA) system. They appear to be ideally suited
for this since the cross-correlation of d-sequences taken over the LCM of their
periods is zero. But a practical system will not, in most likelihood, satisfy
th... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.