id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0902.3513 | A Systematic Approach to Artificial Agents | cs.AI cs.MA | Agents and agent systems are becoming more and more important in the
development of a variety of fields such as ubiquitous computing, ambient
intelligence, autonomous computing, intelligent systems and intelligent
robotics. The need for improvement of our basic knowledge on agents is very
essential. We take a systema... |
0902.3526 | Online Multi-task Learning with Hard Constraints | stat.ML cs.LG math.ST stat.TH | We discuss multi-task online learning when a decision maker has to deal
simultaneously with M tasks. The tasks are related, which is modeled by
imposing that the M-tuple of actions taken by the decision maker needs to
satisfy certain constraints. We give natural examples of such restrictions and
then discuss a genera... |
0902.3532 | Relational Lattice Foundation for Algebraic Logic | cs.DB cs.LO | Relational Lattice is a succinct mathematical model for Relational Algebra.
It reduces the set of six classic relational algebra operators to two: natural
join and inner union. In this paper we push relational lattice theory in two
directions. First, we uncover a pair of complementary lattice operators, and
organize ... |
0902.3541 | System approach to synthesis, modeling and control of complex dynamical
systems | cs.CE | We consider the basic features of complex dynamical and control systems.
Special attention is paid to the problems of synthesis of dynamical models of
complex systems, construction of efficient control models, and to the
development of simulation techniques. We propose an approach to the synthesis
of dynamic models o... |
0902.3549 | Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and
Fault-Tolerance Among Stigmergic Robot | cs.MA nlin.AO | We investigate ways for the exchange of information (explicit communication)
among deaf and dumb mobile robots scattered in the plane. We introduce the use
of movement-signals (analogously to flight signals and bees waggle) as a mean
to transfer messages, enabling the use of distributed algorithms among the
robots. W... |
0902.3593 | Performance of MMSE MIMO Receivers: A Large N Analysis for Correlated
Channels | cs.IT math.IT | Linear receivers are considered as an attractive low-complexity alternative
to optimal processing for multi-antenna MIMO communications. In this paper we
characterize the performance of MMSE MIMO receivers in the limit of large
antenna numbers in the presence of channel correlations. Using the replica
method, we gene... |
0902.3595 | On Optimum End-to-End Distortion in MIMO Systems | cs.IT math.IT | This paper presents the joint impact of the numbers of antennas,
source-to-channel bandwidth ratio and spatial correlation on the optimum
expected end-to-end distortion in an outage-free MIMO system. In particular,
based on an analytical expression valid for any SNR, a closed-form expression
of the optimum asymptotic... |
0902.3614 | Syntactic Confluence Criteria for Positive/Negative-Conditional Term
Rewriting Systems | cs.AI cs.LO | We study the combination of the following already known ideas for showing
confluence of unconditional or conditional term rewriting systems into
practically more useful confluence criteria for conditional systems: Our
syntactical separation into constructor and non-constructor symbols, Huet's
introduction and Toyama'... |
0902.3623 | A Self-Contained and Easily Accessible Discussion of the Method of
Descente Infinie and Fermat's Only Explicitly Known Proof by Descente Infinie | cs.AI cs.LO | We present the only proof of Pierre Fermat by descente infinie that is known
to exist today. As the text of its Latin original requires active mathematical
interpretation, it is more a proof sketch than a proper mathematical proof. We
discuss descente infinie from the mathematical, logical, historical,
linguistic, an... |
0902.3631 | Distributed Agreement in Tile Self-Assembly | cs.DC cs.NE | Laboratory investigations have shown that a formal theory of fault-tolerance
will be essential to harness nanoscale self-assembly as a medium of
computation. Several researchers have voiced an intuition that self-assembly
phenomena are related to the field of distributed computing. This paper
formalizes some of that ... |
0902.3635 | lim+, delta+, and Non-Permutability of beta-Steps | cs.AI cs.LO | Using a human-oriented formal example proof of the (lim+) theorem, i.e. that
the sum of limits is the limit of the sum, which is of value for reference on
its own, we exhibit a non-permutability of beta-steps and delta+-steps
(according to Smullyan's classification), which is not visible with
non-liberalized delta-ru... |
0902.3648 | An Algebraic Dexter-Based Hypertext Reference Model | cs.AI cs.LO | We present the first formal algebraic specification of a hypertext reference
model. It is based on the well-known Dexter Hypertext Reference Model and
includes modifications with respect to the development of hypertext since the
WWW came up. Our hypertext model was developed as a product model with the aim
to automat... |
0902.3725 | Statistical Inference of Functional Connectivity in Neuronal Networks
using Frequent Episodes | q-bio.NC cond-mat.dis-nn cs.DB q-bio.QM stat.ME | Identifying the spatio-temporal network structure of brain activity from
multi-neuronal data streams is one of the biggest challenges in neuroscience.
Repeating patterns of precisely timed activity across a group of neurons is
potentially indicative of a microcircuit in the underlying neural tissue.
Frequent episode ... |
0902.3730 | Full First-Order Sequent and Tableau Calculi With Preservation of
Solutions and the Liberalized delta-Rule but Without Skolemization | cs.AI cs.LO | We present a combination of raising, explicit variable dependency
representation, the liberalized delta-rule, and preservation of solutions for
first-order deductive theorem proving. Our main motivation is to provide the
foundation for our work on inductive theorem proving, where the preservation of
solutions is indi... |
0902.3749 | Hilbert's epsilon as an Operator of Indefinite Committed Choice | cs.AI cs.LO | Paul Bernays and David Hilbert carefully avoided overspecification of
Hilbert's epsilon-operator and axiomatized only what was relevant for their
proof-theoretic investigations. Semantically, this left the epsilon-operator
underspecified. In the meanwhile, there have been several suggestions for
semantics of the epsi... |
0902.3846 | Uniqueness of Low-Rank Matrix Completion by Rigidity Theory | cs.LG | The problem of completing a low-rank matrix from a subset of its entries is
often encountered in the analysis of incomplete data sets exhibiting an
underlying factor model with applications in collaborative filtering, computer
vision and control. Most recent work had been focused on constructing efficient
algorithms ... |
0902.3883 | Directed Graph Representation of Half-Rate Additive Codes over GF(4) | math.CO cs.IT math.IT | We show that (n,2^n) additive codes over GF(4) can be represented as directed
graphs. This generalizes earlier results on self-dual additive codes over
GF(4), which correspond to undirected graphs. Graph representation reduces the
complexity of code classification, and enables us to classify additive (n,2^n)
codes ov... |
0902.4042 | Algebraic operators for querying pattern bases | cs.DB cs.IR | The objectives of this research work which is intimately related to pattern
discovery and management are threefold: (i) handle the problem of pattern
manipulation by defining operations on patterns, (ii) study the problem of
enriching and updating a pattern set (e.g., concepts, rules) when changes occur
in the user's... |
0902.4045 | Sparse Recovery of Positive Signals with Minimal Expansion | cs.IT math.IT | We investigate the sparse recovery problem of reconstructing a
high-dimensional non-negative sparse vector from lower dimensional linear
measurements. While much work has focused on dense measurement matrices, sparse
measurement schemes are crucial in applications, such as DNA microarrays and
sensor networks, where d... |
0902.4060 | Network of two-Chinese-character compound words in Japanese language | cs.CL physics.soc-ph | Some statistical properties of a network of two-Chinese-character compound
words in Japanese language are reported. In this network, a node represents a
Chinese character and an edge represents a two-Chinese-character compound word.
It is found that this network has properties of "small-world" and "scale-free."
A net... |
0902.4073 | Dipole and Quadrupole Moments in Image Processing | cs.CV | This paper proposes an algorithm for image processing, obtained by adapting
to image maps the definitions of two well-known physical quantities. These
quantities are the dipole and quadrupole moments of a charge distribution. We
will see how it is possible to define dipole and quadrupole moments for the
gray-tone map... |
0902.4098 | Coordination in multiagent systems and Laplacian spectra of digraphs | cs.MA cs.DM math.CO math.OC | Constructing and studying distributed control systems requires the analysis
of the Laplacian spectra and the forest structure of directed graphs. In this
paper, we present some basic results of this analysis partially obtained by the
present authors. We also discuss the application of these results to
decentralized c... |
0902.4106 | Filter and nested-lattice code design for fading MIMO channels with
side-information | cs.IT math.IT | Linear-assignment Gel'fand-Pinsker coding (LA-GPC) is a coding technique for
channels with interference known only at the transmitter, where the known
interference is treated as side-information (SI). As a special case of LA-GPC,
dirty paper coding has been shown to be able to achieve the optimal
interference-free ra... |
0902.4127 | Prediction with expert evaluators' advice | cs.LG | We introduce a new protocol for prediction with expert advice in which each
expert evaluates the learner's and his own performance using a loss function
that may change over time and may be different from the loss functions used by
the other experts. The learner's goal is to perform better or not much worse
than each... |
0902.4177 | Convolutional Codes for Network-Error Correction | cs.IT math.IT | In this work, we introduce convolutional codes for network-error correction
in the context of coherent network coding. We give a construction of
convolutional codes that correct a given set of error patterns, as long as
consecutive errors are separated by a certain interval. We also give some
bounds on the field size... |
0902.4218 | On graph theoretic results underlying the analysis of consensus in
multi-agent systems | cs.MA cs.DM math.CO math.OC | This note corrects a pretty serious mistake and some inaccuracies in
"Consensus and cooperation in networked multi-agent systems" by R.
Olfati-Saber, J.A. Fax, and R.M. Murray, published in Vol. 95 of the
Proceedings of the IEEE (2007, No. 1, P. 215-233). It also mentions several
stronger results applicable to the cl... |
0902.4228 | Multiplicative updates For Non-Negative Kernel SVM | cs.LG | We present multiplicative updates for solving hard and soft margin support
vector machines (SVM) with non-negative kernels. They follow as a natural
extension of the updates for non-negative matrix factorization. No additional
param- eter setting, such as choosing learning, rate is required. Ex- periments
demonstrate... |
0902.4246 | Constant-Weight and Constant-Charge Binary Run-Length Limited Codes | cs.IT math.IT | Constant-weight and constant-charge binary sequences with constrained run
length of zeros are introduced. For these sequences, the weight and the charge
distribution are found. Then, recurrent and direct formulas for calculating the
number of these sequences are obtained. With considering these numbers of
constant-we... |
0902.4250 | Fundamental limit of sample generalized eigenvalue based detection of
signals in noise using relatively few signal-bearing and noise-only samples | cs.IT math.IT | The detection problem in statistical signal processing can be succinctly
formulated: Given m (possibly) signal bearing, n-dimensional signal-plus-noise
snapshot vectors (samples) and N statistically independent n-dimensional
noise-only snapshot vectors, can one reliably infer the presence of a signal?
This problem ar... |
0902.4291 | From Theory to Practice: Sub-Nyquist Sampling of Sparse Wideband Analog
Signals | cs.IT math.IT | Conventional sub-Nyquist sampling methods for analog signals exploit prior
information about the spectral support. In this paper, we consider the
challenging problem of blind sub-Nyquist sampling of multiband signals, whose
unknown frequency support occupies only a small portion of a wide spectrum. Our
primary design... |
0902.4394 | Circulant and Toeplitz matrices in compressed sensing | cs.IT math.IT | Compressed sensing seeks to recover a sparse vector from a small number of
linear and non-adaptive measurements. While most work so far focuses on
Gaussian or Bernoulli random measurements we investigate the use of partial
random circulant and Toeplitz matrices in connection with recovery by
$\ell_1$-minization. In c... |
0902.4447 | Percolation Processes and Wireless Network Resilience to
Degree-Dependent and Cascading Node Failures | cs.NI cs.IT math.IT | We study the problem of wireless network resilience to node failures from a
percolation-based perspective. In practical wireless networks, it is often the
case that the failure probability of a node depends on its degree (number of
neighbors). We model this phenomenon as a degree-dependent site percolation
process on... |
0902.4449 | Connectivity, Percolation, and Information Dissemination in Large-Scale
Wireless Networks with Dynamic Links | cs.IT cs.NI math.IT math.PR | We investigate the problem of disseminating broadcast messages in wireless
networks with time-varying links from a percolation-based perspective. Using a
model of wireless networks based on random geometric graphs with dynamic on-off
links, we show that the delay for disseminating broadcast information exhibits
two b... |
0902.4460 | Strategies of Voting in Stochastic Environment: Egoism and Collectivism | math.OC cs.MA math.PR | Consideration was given to a model of social dynamics controlled by
successive collective decisions based on the threshold majority procedures. The
current system state is characterized by the vector of participants' capitals
(utilities). At each step, the voters can either retain their status quo or
accept the propo... |
0902.4481 | Stability of Finite Population ALOHA with Variable Packets | cs.PF cs.IT math.IT | ALOHA is one of the most basic Medium Access Control (MAC) protocols and
represents a foundation for other more sophisticated distributed and
asynchronous MAC protocols, e.g., CSMA. In this paper, unlike in the
traditional work that focused on mean value analysis, we study the
distributional properties of packet tran... |
0902.4508 | Exponential Sums, Cyclic Codes and Sequences: the Odd Characteristic
Kasami Case | cs.IT cs.DM math.CO math.IT | Let $q=p^n$ with $n=2m$ and $p$ be an odd prime. Let $0\leq k\leq n-1$ and
$k\neq m$. In this paper we determine the value distribution of following
exponential(character) sums \[\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^m (\alpha
x^{p^{m}+1})+\Tra_1^n(\beta x^{p^k+1})}\quad(\alpha\in \bF_{p^m},\beta\in
\bF_{q})\] and ... |
0902.4509 | Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions | cs.IT cs.DM math.CO math.IT | Let $q=p^n$ with $p$ be an odd prime. Let $0\leq k\leq n-1$ and $k\neq n/2$.
In this paper we determine the value distribution of following
exponential(character) sums \[\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^n(\alpha
x^{p^{3k}+1}+\beta x^{p^k+1})}\quad(\alpha\in \bF_{p^m},\beta\in \bF_{q})\] and
\[\sum\limits_{x\in... |
0902.4510 | Cyclic Codes and Sequences: the Generalized Kasami Case | cs.IT cs.DM math.CO math.IT | Let $q=2^n$ with $n=2m$ . Let $1\leq k\leq n-1$ and $k\neq m$. In this paper
we determine the value distribution of following exponential sums
\[\sum\limits_{x\in \bF_q}(-1)^{\Tra_1^m (\alpha x^{2^{m}+1})+\Tra_1^n(\beta
x^{2^k+1})}\quad(\alpha\in \bF_{2^m},\beta\in \bF_{q})\] and
\[\sum\limits_{x\in \bF_q}(-1)^{\Tra_... |
0902.4511 | Cyclic Codes and Sequences from Kasami-Welch Functions | cs.IT cs.DM math.CO math.IT | Let $q=2^n$, $0\leq k\leq n-1$ and $k\neq n/2$. In this paper we determine
the value distribution of following exponential sums \[\sum\limits_{x\in
\bF_q}(-1)^{\Tra_1^n(\alpha x^{2^{3k}+1}+\beta x^{2^k+1})}\quad(\alpha,\beta\in
\bF_{q})\] and \[\sum\limits_{x\in \bF_q}(-1)^{\Tra_1^n(\alpha
x^{2^{3k}+1}+\beta x^{2^k+1... |
0902.4514 | Analytical Expression of the Expected Values of Capital at Voting in the
Stochastic Environment | math.OC cs.MA cs.SI cs.SY math.PR | In the simplest version of the model of group decision making in the
stochastic environment, the participants are segregated into egoists and a
group of collectivists. A "proposal of the environment" is a stochastically
generated vector of algebraic increments of participants' capitals. The social
dynamics is determi... |
0902.4521 | Are Tensor Decomposition Solutions Unique? On the global convergence of
HOSVD and ParaFac algorithms | cs.CV cs.AI | For tensor decompositions such as HOSVD and ParaFac, the objective functions
are nonconvex. This implies, theoretically, there exists a large number of
local optimas: starting from different starting point, the iteratively improved
solution will converge to different local solutions. This non-uniqueness
present a sta... |
0902.4535 | Electronical Health Record's Systems. Interoperability | cs.DB | Understanding the importance that the electronic medical health records
system has, with its various structural types and grades, has led to the
elaboration of a series of standards and quality control methods, meant to
control its functioning. In time, the electronic health records system has
evolved along with the ... |
0902.4577 | Using Distributed Rate-Splitting Game to Approach Rate Region Boundary
of the Gaussian Interference Channel | cs.IT math.IT | Determining how to approach the rate boundary of the Gaussian interference
channel in practical system is a big concern. In this paper, a distributed
rate-splitting (DRS) scheme is proposed to approach the rate region boundary of
the Gaussian interference channel. It is shown that the DRS scheme can be
formulated as ... |
0902.4647 | Source-Channel Coding and Separation for Generalized Communication
Systems | cs.IT math.IT | We consider transmission of stationary and ergodic sources over non-ergodic
composite channels with channel state information at the receiver (CSIR).
Previously we introduced alternate capacity definitions to Shannon capacity,
including the capacity versus outage and the expected capacity. These
generalized definitio... |
0902.4663 | Dipole Vectors in Images Processing | cs.CV | Instead of evaluating the gradient field of the brightness map of an image,
we propose the use of dipole vectors. This approach is obtained by adapting to
the image gray-tone distribution the definition of the dipole moment of charge
distributions. We will show how to evaluate the dipoles and obtain a vector
field, w... |
0902.4682 | Lectures on Jacques Herbrand as a Logician | cs.LO cs.AI | We give some lectures on the work on formal logic of Jacques Herbrand, and
sketch his life and his influence on automated theorem proving. The intended
audience ranges from students interested in logic over historians to logicians.
Besides the well-known correction of Herbrand's False Lemma by Goedel and
Dreben, we a... |
0902.4881 | Controllability and observabiliy of an artificial advection-diffusion
problem | math.OC cs.SY math.AP | In this paper we study the controllability of an artificial
advection-diffusion system through the boundary. Suitable Carleman estimates
give us the observability on the adjoint system in the one dimensional case. We
also study some basic properties of our problem such as backward uniqueness and
we get an intuitive r... |
0903.0034 | Measuring Independence of Datasets | cs.DS cs.DB cs.IR cs.PF | A data stream model represents setting where approximating pairwise, or
$k$-wise, independence with sublinear memory is of considerable importance. In
the streaming model the joint distribution is given by a stream of $k$-tuples,
with the goal of testing correlations among the components measured over the
entire stre... |
0903.0041 | Learning DTW Global Constraint for Time Series Classification | cs.AI | 1-Nearest Neighbor with the Dynamic Time Warping (DTW) distance is one of the
most effective classifiers on time series domain. Since the global constraint
has been introduced in speech community, many global constraint models have
been proposed including Sakoe-Chiba (S-C) band, Itakura Parallelogram, and
Ratanamahat... |
0903.0061 | Separable Implementation of L2-Orthogonal STC CPM with Fast Decoding | cs.IT math.IT | In this paper we present an alternative separable implementation of
L2-orthogonal space-time codes (STC) for continuous phase modulation (CPM). In
this approach, we split the STC CPM transmitter into a single conventional CPM
modulator and a correction filter bank. While the CPM modulator is common to
all transmit an... |
0903.0064 | Manipulation Robustness of Collaborative Filtering Systems | cs.LG cs.IT math.IT | A collaborative filtering system recommends to users products that similar
users like. Collaborative filtering systems influence purchase decisions, and
hence have become targets of manipulation by unscrupulous vendors. We provide
theoretical and empirical results demonstrating that while common nearest
neighbor algo... |
0903.0099 | Spectral Efficiency Optimized Adaptive Transmission for Cognitive Radios
in an Interference Channel | cs.IT math.IT | In this paper, we consider a primary and a cognitive user transmitting over a
wireless fading interference channel. The primary user transmits with a
constant power and utilizes an adaptive modulation and coding (AMC) scheme
satisfying a bit error rate requirement. We propose a link adaptation scheme to
maximize the ... |
0903.0134 | Recognition of Regular Shapes in Satelite Images | cs.CV | This paper has been withdrawn by the author ali pourmohammad.
|
0903.0153 | Document Relevance Evaluation via Term Distribution Analysis Using
Fourier Series Expansion | cs.IR | In addition to the frequency of terms in a document collection, the
distribution of terms plays an important role in determining the relevance of
documents for a given search query. In this paper, term distribution analysis
using Fourier series expansion as a novel approach for calculating an abstract
representation ... |
0903.0174 | Accelerating and Evaluation of Syntactic Parsing in Natural Language
Question Answering Systems | cs.AI cs.HC | With the development of Natural Language Processing (NLP), more and more
systems want to adopt NLP in User Interface Module to process user input, in
order to communicate with user in a natural way. However, this raises a speed
problem. That is, if NLP module can not process sentences in durable time
delay, users wil... |
0903.0194 | A Graph Analysis of the Linked Data Cloud | cs.CY cs.AI cs.SC | The Linked Data community is focused on integrating Resource Description
Framework (RDF) data sets into a single unified representation known as the Web
of Data. The Web of Data can be traversed by both man and machine and shows
promise as the \textit{de facto} standard for integrating data world wide much
like the W... |
0903.0200 | Faith in the Algorithm, Part 1: Beyond the Turing Test | cs.CY cs.AI | Since the Turing test was first proposed by Alan Turing in 1950, the primary
goal of artificial intelligence has been predicated on the ability for
computers to imitate human behavior. However, the majority of uses for the
computer can be said to fall outside the domain of human abilities and it is
exactly outside of... |
0903.0211 | Range and Roots: Two Common Patterns for Specifying and Propagating
Counting and Occurrence Constraints | cs.AI | We propose Range and Roots which are two common patterns useful for
specifying a wide range of counting and occurrence constraints. We design
specialised propagation algorithms for these two patterns. Counting and
occurrence constraints specified using these patterns thus directly inherit a
propagation algorithm. To ... |
0903.0276 | Impact of Cognitive Radio on Future Management of Spectrum | cs.AI cs.GT | Cognitive radio is a breakthrough technology which is expected to have a
profound impact on the way radio spectrum will be accessed, managed and shared
in the future. In this paper I examine some of the implications of cognitive
radio for future management of spectrum. Both a near-term view involving the
opportunisti... |
0903.0279 | An introduction to DSmT | cs.AI | The management and combination of uncertain, imprecise, fuzzy and even
paradoxical or high conflicting sources of information has always been, and
still remains today, of primal importance for the development of reliable
modern information systems involving artificial reasoning. In this
introduction, we present a sur... |
0903.0302 | Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code
Rate | cs.IT math.IT | We compute the code parameters for binary linear codes obtained by greedy
constructing the parity check matrix. Then we show that these codes improve the
Gilbert-Varshamov (GV) bound on the code size and rate. This result counter
proves the conjecture on the asymptotical exactness of the binary GV bound.
|
0903.0307 | Polar Codes are Optimal for Lossy Source Coding | cs.IT math.IT | We consider lossy source compression of a binary symmetric source using polar
codes and the low-complexity successive encoding algorithm. It was recently
shown by Arikan that polar codes achieve the capacity of arbitrary symmetric
binary-input discrete memoryless channels under a successive decoding strategy.
We show... |
0903.0314 | Granularity-Adaptive Proof Presentation | cs.AI | When mathematicians present proofs they usually adapt their explanations to
their didactic goals and to the (assumed) knowledge of their addressees. Modern
automated theorem provers, in contrast, present proofs usually at a fixed level
of detail (also called granularity). Often these presentations are neither
intende... |
0903.0353 | General Game Management Agent | cs.GT cs.MA | The task of managing general game playing in a multi-agent system is the
problem addressed in this paper. It is considered to be done by an agent. There
are many reasons for constructing such an agent, called general game management
agent. This agent manages strategic interactions between other agents -
players, natu... |
0903.0422 | Deductive Inference for the Interiors and Exteriors of Horn Theories | cs.AI cs.CC cs.DS cs.LO | In this paper, we investigate the deductive inference for the interiors and
exteriors of Horn knowledge bases, where the interiors and exteriors were
introduced by Makino and Ibaraki to study stability properties of knowledge
bases. We present a linear time algorithm for the deduction for the interiors
and show that ... |
0903.0443 | Design Guidelines for Training-based MIMO Systems with Feedback | cs.IT math.IT | In this paper, we study the optimal training and data transmission strategies
for block fading multiple-input multiple-output (MIMO) systems with feedback.
We consider both the channel gain feedback (CGF) system and the channel
covariance feedback (CCF) system. Using an accurate capacity lower bound as a
figure of me... |
0903.0445 | Raptor Codes Based Distributed Storage Algorithms for Wireless Sensor
Networks | cs.IT cs.DS cs.NI math.IT | We consider a distributed storage problem in a large-scale wireless sensor
network with $n$ nodes among which $k$ acquire (sense) independent data. The
goal is to disseminate the acquired information throughout the network so that
each of the $n$ sensors stores one possibly coded packet and the original $k$
data pack... |
0903.0460 | Filtering Algorithms for the Multiset Ordering Constraint | cs.AI cs.DS | Constraint programming (CP) has been used with great success to tackle a wide
variety of constraint satisfaction problems which are computationally
intractable in general. Global constraints are one of the important factors
behind the success of CP. In this paper, we study a new global constraint, the
multiset orderi... |
0903.0465 | Breaking Value Symmetry | cs.AI | Symmetry is an important factor in solving many constraint satisfaction
problems. One common type of symmetry is when we have symmetric values. In a
recent series of papers, we have studied methods to break value symmetries. Our
results identify computational limits on eliminating value symmetry. For
instance, we pro... |
0903.0467 | The Parameterized Complexity of Global Constraints | cs.AI cs.CC | We argue that parameterized complexity is a useful tool with which to study
global constraints. In particular, we show that many global constraints which
are intractable to propagate completely have natural parameters which make them
fixed-parameter tractable and which are easy to compute. This tractability
tends eit... |
0903.0470 | Decompositions of Grammar Constraints | cs.AI cs.FL | A wide range of constraints can be compactly specified using automata or
formal languages. In a sequence of recent papers, we have shown that an
effective means to reason with such specifications is to decompose them into
primitive constraints. We can then, for instance, use state of the art SAT
solvers and profit fr... |
0903.0471 | SLIDE: A Useful Special Case of the CARDPATH Constraint | cs.AI cs.CC | We study the CardPath constraint. This ensures a given constraint holds a
number of times down a sequence of variables. We show that SLIDE, a special
case of CardPath where the slid constraint must hold always, can be used to
encode a wide range of sliding sequence constraints including CardPath itself.
We consider h... |
0903.0475 | Reformulating Global Grammar Constraints | cs.AI | An attractive mechanism to specify global constraints in rostering and other
domains is via formal languages. For instance, the Regular and Grammar
constraints specify constraints in terms of the languages accepted by an
automaton and a context-free grammar respectively. Taking advantage of the
fixed length of the co... |
0903.0479 | Combining Symmetry Breaking and Global Constraints | cs.AI | We propose a new family of constraints which combine together lexicographical
ordering constraints for symmetry breaking with other common global
constraints. We give a general purpose propagator for this family of
constraints, and show how to improve its complexity by exploiting properties of
the included global con... |
0903.0538 | Real-time Texture Error Detection | cs.CV | This paper advocates an improved solution for real-time error detection of
texture errors that occurs in the production process in textile industry. The
research is focused on the mono-color products with 3D texture model (Jaquard
fabrics). This is a more difficult task than, for example, 2D multicolor
textures.
|
0903.0548 | On the 3-Receiver Broadcast Channel with Degraded Message Sets and
Confidential Messages | cs.IT math.IT | In this paper, bounds to the rate-equivocation region for the general
3-receiver broadcast channel (BC) with degraded message sets, are presented for
confidential messages to be kept secret from one of the receivers. This model
is more general than the 2-receiver BCs with confidential messages with an
external wireta... |
0903.0566 | Quantum LDPC codes with positive rate and minimum distance proportional
to n^{1/2} | cs.IT math.IT quant-ph | The current best asymptotic lower bound on the minimum distance of quantum
LDPC codes with fixed non-zero rate is logarithmic in the blocklength. We
propose a construction of quantum LDPC codes with fixed non-zero rate and prove
that the minimum distance grows proportionally to the square root of the
blocklength.
|
0903.0595 | Noisy-interference Sum-rate Capacity of Parallel Gaussian Interference
Channels | cs.IT math.IT | The sum-rate capacity of the parallel Gaussian interference channel is shown
to be achieved by independent transmission across sub-channels and treating
interference as noise in each sub-channel if the channel coefficients and power
constraints satisfy a certain condition. The condition requires the
interference to b... |
0903.0604 | On Stability Region and Delay Performance of Linear-Memory Randomized
Scheduling for Time-Varying Networks | cs.NI cs.IT math.IT | Throughput optimal scheduling policies in general require the solution of a
complex and often NP-hard optimization problem. Related literature has shown
that in the context of time-varying channels, randomized scheduling policies
can be employed to reduce the complexity of the optimization problem but at the
expense ... |
0903.0625 | Leveraging Discarded Samples for Tighter Estimation of Multiple-Set
Aggregates | cs.DB cs.IR | Many datasets such as market basket data, text or hypertext documents, and
sensor observations recorded in different locations or time periods, are
modeled as a collection of sets over a ground set of keys. We are interested in
basic aggregates such as the weight or selectivity of keys that satisfy some
selection pre... |
0903.0650 | Compressive Sensing Using Low Density Frames | cs.IT math.IT stat.CO | We consider the compressive sensing of a sparse or compressible signal ${\bf
x} \in {\mathbb R}^M$. We explicitly construct a class of measurement matrices,
referred to as the low density frames, and develop decoding algorithms that
produce an accurate estimate $\hat{\bf x}$ even in the presence of additive
noise. Lo... |
0903.0666 | Achievable Sum Rate of MIMO MMSE Recievers: A General Analytic Framework | cs.IT math.IT | This paper investigates the achievable sum rate of multiple-input
multiple-output (MIMO) wireless systems employing linear minimum mean-squared
error (MMSE) receivers. We present a new analytic framework which unveils an
interesting connection between the achievable sum rate with MMSE receivers and
the ergodic mutual... |
0903.0673 | Linear-time nearest point algorithms for Coxeter lattices | cs.IT math.IT math.NT | The Coxeter lattices, which we denote $A_{n/m}$, are a family of lattices
containing many of the important lattices in low dimensions. This includes
$A_n$, $E_7$, $E_8$ and their duals $A_n^*$, $E_7^*$ and $E_8^*$. We consider
the problem of finding a nearest point in a Coxeter lattice. We describe two
new algorithms... |
0903.0682 | Preserving Individual Privacy in Serial Data Publishing | cs.DB cs.CR | While previous works on privacy-preserving serial data publishing consider
the scenario where sensitive values may persist over multiple data releases, we
find that no previous work has sufficient protection provided for sensitive
values that can change over time, which should be the more common case. In this
work we... |
0903.0695 | Online Estimation of SAT Solving Runtime | cs.AI | We present an online method for estimating the cost of solving SAT problems.
Modern SAT solvers present several challenges to estimate search cost including
non-chronological backtracking, learning and restarts. Our method uses a linear
model trained on data gathered at the start of search. We show the
effectiveness ... |
0903.0735 | Modeling the Experience of Emotion | cs.AI cs.HC cs.RO | Affective computing has proven to be a viable field of research comprised of
a large number of multidisciplinary researchers resulting in work that is
widely published. The majority of this work consists of computational models of
emotion recognition, computational modeling of causal factors of emotion and
emotion ex... |
0903.0786 | On Requirements for Programming Exercises from an E-learning Perspective | cs.AI | In this work, we deal with the question of modeling programming exercises for
novices pointing to an e-learning scenario. Our purpose is to identify basic
requirements, raise some key questions and propose potential answers from a
conceptual perspective. Presented as a general picture, we hypothetically
situate our w... |
0903.0829 | Tagging multimedia stimuli with ontologies | cs.AI | Successful management of emotional stimuli is a pivotal issue concerning
Affective Computing (AC) and the related research. As a subfield of Artificial
Intelligence, AC is concerned not only with the design of computer systems and
the accompanying hardware that can recognize, interpret, and process human
emotions, bu... |
0903.0843 | Algorithms for Weighted Boolean Optimization | cs.AI cs.LO | The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT)
problems are natural optimization extensions of Boolean Satisfiability (SAT).
In the recent past, different algorithms have been proposed for PBO and for
MaxSAT, despite the existence of straightforward mappings from PBO to MaxSAT
and vice-ve... |
0903.0952 | Definition of Strange Attractor in Benard problem for Generalized
Couette Cell | nlin.CD cs.CE | For movements of the viscous continuous flow in generalized Couette cell the
dynamic system describing the central limiting variety is received.
|
0903.1022 | On-Off Random Access Channels: A Compressed Sensing Framework | cs.IT math.IT | This paper considers a simple on-off random multiple access channel, where n
users communicate simultaneously to a single receiver over m degrees of
freedom. Each user transmits with probability lambda, where typically lambda n
< m << n, and the receiver must detect which users transmitted. We show that
when the code... |
0903.1033 | Group code structures on affine-invariant codes | cs.IT math.GR math.IT | A group code structure of a linear code is a description of the code as
one-sided or two-sided ideal of a group algebra of a finite group. In these
realizations, the group algebra is identified with the ambient space, and the
group elements with the coordinates of the ambient space. It is well known that
every affine... |
0903.1059 | Home Heating Systems Design using PHP and MySQL Databases | cs.DB | This paper presents the use of a computer application based on a MySQL
database, managed by PHP programs, allowing the selection of a heating device
using coefficient-based calculus.
|
0903.1095 | Decomposition, Reformulation, and Diving in University Course
Timetabling | cs.DS cs.AI | In many real-life optimisation problems, there are multiple interacting
components in a solution. For example, different components might specify
assignments to different kinds of resource. Often, each component is associated
with different sets of soft constraints, and so with different measures of soft
constraint v... |
0903.1125 | Efficient Human Computation | cs.LG | Collecting large labeled data sets is a laborious and expensive task, whose
scaling up requires division of the labeling workload between many teachers.
When the number of classes is large, miscorrespondences between the labels
given by the different teachers are likely to occur, which, in the extreme
case, may reach... |
0903.1136 | Symmetry Breaking Using Value Precedence | cs.AI cs.CC | We present a comprehensive study of the use of value precedence constraints
to break value symmetry. We first give a simple encoding of value precedence
into ternary constraints that is both efficient and effective at breaking
symmetry. We then extend value precedence to deal with a number of
generalizations like wre... |
0903.1137 | Complexity of Terminating Preference Elicitation | cs.AI cs.CC cs.MA | Complexity theory is a useful tool to study computational issues surrounding
the elicitation of preferences, as well as the strategic manipulation of
elections aggregating together preferences of multiple agents. We study here
the complexity of determining when we can terminate eliciting preferences, and
prove that t... |
0903.1139 | The Complexity of Reasoning with Global Constraints | cs.AI cs.CC | Constraint propagation is one of the techniques central to the success of
constraint programming. To reduce search, fast algorithms associated with each
constraint prune the domains of variables. With global (or non-binary)
constraints, the cost of such propagation may be much greater than the
quadratic cost for bina... |
0903.1146 | Breaking Value Symmetry | cs.AI cs.CC | One common type of symmetry is when values are symmetric. For example, if we
are assigning colours (values) to nodes (variables) in a graph colouring
problem then we can uniformly interchange the colours throughout a colouring.
For a problem with value symmetries, all symmetric solutions can be eliminated
in polynomi... |
0903.1147 | Tetravex is NP-complete | cs.CC cs.AI | Tetravex is a widely played one person computer game in which you are given
$n^2$ unit tiles, each edge of which is labelled with a number. The objective
is to place each tile within a $n$ by $n$ square such that all neighbouring
edges are labelled with an identical number. Unfortunately, playing Tetravex is
computat... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.