id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0610107 | Interference Channels with Common Information | cs.IT math.IT | In this paper, we consider the discrete memoryless interference channel with
common information, in which two senders need deliver not only private messages
but also certain common messages to their corresponding receivers. We derive an
achievable rate region for such a channel by exploiting a random coding
strategy,... |
cs/0610108 | Doppler Spectrum Estimation by Ramanujan Fourier Transforms | cs.NA cs.CE | The Doppler spectrum estimation of a weather radar signal in a classic way
can be made by two methods, temporal one based in the autocorrelation of the
successful signals, whereas the other one uses the estimation of the power
spectral density PSD by using Fourier transforms. We introduces a new tool of
signal proces... |
cs/0610111 | Local approximate inference algorithms | cs.AI | We present a new local approximation algorithm for computing Maximum a
Posteriori (MAP) and log-partition function for arbitrary exponential family
distribution represented by a finite-valued pair-wise Markov random field
(MRF), say $G$. Our algorithm is based on decomposition of $G$ into {\em
appropriately} chosen s... |
cs/0610112 | On the Performance of Lossless Joint Source-Channel Coding Based on
Linear Codes | cs.IT math.IT | A general lossless joint source-channel coding scheme based on linear codes
is proposed and then analyzed in this paper. It is shown that a linear code
with good joint spectrum can be used to establish limit-approaching joint
source-channel coding schemes for arbitrary sources and channels, where the
joint spectrum o... |
cs/0610113 | CHAC. A MOACO Algorithm for Computation of Bi-Criteria Military Unit
Path in the Battlefield | cs.MA cs.CC | In this paper we propose a Multi-Objective Ant Colony Optimization (MOACO)
algorithm called CHAC, which has been designed to solve the problem of finding
the path on a map (corresponding to a simulated battlefield) that minimizes
resources while maximizing safety. CHAC has been tested with two different
state transit... |
cs/0610115 | An Achievable Rate Region for the Gaussian Interference Channel | cs.IT math.IT | An achievable rate region for the Gaussian interference channel is derived
using Sato's modified frequency division multiplexing idea and a special case
of Han and Kobayashi's rate region (denoted by $\Gmat^\prime$). We show that
the new inner bound includes $\Gmat^\prime$, Sason's rate region $\Dmat$, as
well as the... |
cs/0610116 | DepAnn - An Annotation Tool for Dependency Treebanks | cs.CL | DepAnn is an interactive annotation tool for dependency treebanks, providing
both graphical and text-based annotation interfaces. The tool is aimed for
semi-automatic creation of treebanks. It aids the manual inspection and
correction of automatically created parses, making the annotation process
faster and less erro... |
cs/0610118 | Applying Part-of-Seech Enhanced LSA to Automatic Essay Grading | cs.IR cs.CL | Latent Semantic Analysis (LSA) is a widely used Information Retrieval method
based on "bag-of-words" assumption. However, according to general conception,
syntax plays a role in representing meaning of sentences. Thus, enhancing LSA
with part-of-speech (POS) information to capture the context of word
occurrences appe... |
cs/0610120 | Classdesc and Graphcode: support for scientific programming in C++ | cs.MS cs.CE cs.DC | Object-oriented programming languages such as Java and Objective C have
become popular for implementing agent-based and other object-based simulations
since objects in those languages can {\em reflect} (i.e. make runtime queries
of an object's structure). This allows, for example, a fairly trivial {\em
serialisation}... |
cs/0610121 | Construction algorithm for network error-correcting codes attaining the
Singleton bound | cs.IT cs.DM cs.NI math.IT | We give a centralized deterministic algorithm for constructing linear network
error-correcting codes that attain the Singleton bound of network
error-correcting codes. The proposed algorithm is based on the algorithm by
Jaggi et al. We give estimates on the time complexity and the required symbol
size of the proposed... |
cs/0610124 | Dependency Treebanks: Methods, Annotation Schemes and Tools | cs.CL | In this paper, current dependencybased treebanks are introduced and analyzed.
The methods used for building the resources, the annotation schemes applied,
and the tools used (such as POS taggers, parsers and annotation software) are
discussed.
|
cs/0610126 | Fitness Uniform Optimization | cs.NE cs.LG | In evolutionary algorithms, the fitness of a population increases with time
by mutating and recombining individuals and by a biased selection of more fit
individuals. The right selection pressure is critical in ensuring sufficient
optimization progress on the one hand and in preserving genetic diversity to be
able to... |
cs/0610128 | Hierarchical Bin Buffering: Online Local Moments for Dynamic External
Memory Arrays | cs.DS cs.DB | Local moments are used for local regression, to compute statistical measures
such as sums, averages, and standard deviations, and to approximate probability
distributions. We consider the case where the data source is a very large I/O
array of size n and we want to compute the first N local moments, for some
constant... |
cs/0610129 | Community Detection in Complex Networks Using Agents | cs.MA cs.CY | Community structure identification has been one of the most popular research
areas in recent years due to its applicability to the wide scale of
disciplines. To detect communities in varied topics, there have been many
algorithms proposed so far. However, most of them still have some drawbacks to
be addressed. In thi... |
cs/0610130 | On Bounds for $E$-capacity of DMC | cs.IT math.IT | Random coding, expurgated and sphere packing bounds are derived by method of
types and method of graph decomposition for $E$-capacity of discrete memoryless
channel (DMC). Three decoding rules are considered, the random coding bound is
attainable by each of the three rules, but the expurgated bound is achievable
only... |
cs/0610132 | List Decoding of Hermitian Codes using Groebner Bases | cs.IT cs.SC math.IT | List decoding of Hermitian codes is reformulated to allow an efficient and
simple algorithm for the interpolation step. The algorithm is developed using
the theory of Groebner bases of modules. The computational complexity of the
algorithm seems comparable to previously known algorithms achieving the same
task, and t... |
cs/0610138 | Why block length and delay behave differently if feedback is present | cs.IT math.IT | For output-symmetric DMCs at even moderately high rates, fixed-block-length
communication systems show no improvements in their error exponents with
feedback. In this paper, we study systems with fixed end-to-end delay and show
that feedback generally provides dramatic gains in the error exponents.
A new upper boun... |
cs/0610139 | How to beat the sphere-packing bound with feedback | cs.IT math.IT | The sphere-packing bound $E_{sp}(R)$ bounds the reliability function for
fixed-length block-codes. For symmetric channels, it remains a valid bound even
when strictly causal noiseless feedback is allowed from the decoder to the
encoder. To beat the bound, the problem must be changed. While it has long been
known that... |
cs/0610140 | Constant for associative patterns ensemble | cs.AI | Creation procedure of associative patterns ensemble in terms of formal logic
with using neural net-work (NN) model is formulated. It is shown that the
associative patterns set is created by means of unique procedure of NN work
which having individual parameters of entrance stimulus transformation. It is
ascer-tained ... |
cs/0610141 | Stabilization using both noisy and noiseless feedback | cs.IT math.IT | When designing a distributed control system, the system designer has a choice
in how to connect the different units through communication channels. In
practice, noiseless and noisy channels may coexist. Using the standard toy
example of scalar stabilization, this paper shows how a small amount of
noiseless feedback c... |
cs/0610142 | Coding into a source: a direct inverse Rate-Distortion theorem | cs.IT math.IT | Shannon proved that if we can transmit bits reliably at rates larger than the
rate distortion function $R(D)$, then we can transmit this source to within a
distortion $D$. We answer the converse question ``If we can transmit a source
to within a distortion $D$, can we transmit bits reliably at rates less than
the rat... |
cs/0610143 | Source coding and channel requirements for unstable processes | cs.IT math.IT | Our understanding of information in systems has been based on the foundation
of memoryless processes. Extensions to stable Markov and auto-regressive
processes are classical. Berger proved a source coding theorem for the
marginally unstable Wiener process, but the infinite-horizon exponentially
unstable case has been... |
cs/0610144 | Lossless coding for distributed streaming sources | cs.IT math.IT | Distributed source coding is traditionally viewed in the block coding context
-- all the source symbols are known in advance at the encoders. This paper
instead considers a streaming setting in which iid source symbol pairs are
revealed to the separate encoders in real time and need to be reconstructed at
the decoder... |
cs/0610145 | A Simple Converse of Burnashev's Reliability | cs.IT math.IT | In a remarkable paper published in 1976, Burnashev determined the reliability
function of variable-length block codes over discrete memoryless channels with
feedback. Subsequently, an alternative achievability proof was obtained by
Yamamoto and Itoh via a particularly simple and instructive scheme. Their idea
is to a... |
cs/0610146 | The necessity and sufficiency of anytime capacity for stabilization of a
linear system over a noisy communication link, Part II: vector systems | cs.IT math.IT | In part I, we reviewed how Shannon's classical notion of capacity is not
sufficient to characterize a noisy communication channel if the channel is
intended to be used as part of a feedback loop to stabilize an unstable scalar
linear system. While classical capacity is not enough, a sense of capacity
(parametrized by... |
cs/0610148 | Decoder Error Probability of MRD Codes | cs.IT math.IT | In this paper, we first introduce the concept of elementary linear subspace,
which has similar properties to those of a set of coordinates. Using this new
concept, we derive properties of maximum rank distance (MRD) codes that
parallel those of maximum distance separable (MDS) codes. Using these
properties, we show t... |
cs/0610150 | On LAO Testing of Multiple Hypotheses for Many Independent Objects | cs.IT math.IT | The problem of many hypotheses logarithmically asymptotically optimal (LAO)
testing for a model consisting of three or more independent objects is solved.
It is supposed that $M$ probability distributions are known and each object
independently of others follows to one of them. The matrix of asymptotic
interdependenc... |
cs/0610151 | Anytime coding on the infinite bandwidth AWGN channel: A sequential
semi-orthogonal optimal code | cs.IT math.IT | It is well known that orthogonal coding can be used to approach the Shannon
capacity of the power-constrained AWGN channel without a bandwidth constraint.
This correspondence describes a semi-orthogonal variation of pulse position
modulation that is sequential in nature -- bits can be ``streamed across''
without havi... |
cs/0610153 | Most Programs Stop Quickly or Never Halt | cs.IT math.IT | Since many real-world problems arising in the fields of compiler
optimisation, automated software engineering, formal proof systems, and so
forth are equivalent to the Halting Problem--the most notorious undecidable
problem--there is a growing interest, not only academically, in understanding
the problem better and i... |
cs/0610155 | Nonlinear Estimators and Tail Bounds for Dimension Reduction in $l_1$
Using Cauchy Random Projections | cs.DS cs.IR cs.LG | For dimension reduction in $l_1$, the method of {\em Cauchy random
projections} multiplies the original data matrix $\mathbf{A}
\in\mathbb{R}^{n\times D}$ with a random matrix $\mathbf{R} \in
\mathbb{R}^{D\times k}$ ($k\ll\min(n,D)$) whose entries are i.i.d. samples of
the standard Cauchy C(0,1). Because of the impos... |
cs/0610156 | Adaptation Knowledge Discovery from a Case Base | cs.AI | In case-based reasoning, the adaptation step depends in general on
domain-dependent knowledge, which motivates studies on adaptation knowledge
acquisition (AKA). CABAMAKA is an AKA system based on principles of knowledge
discovery from databases. This system explores the variations within the case
base to elicit adap... |
cs/0610158 | Considering users' behaviours in improving the responses of an
information base | cs.LG cs.IR | In this paper, our aim is to propose a model that helps in the efficient use
of an information system by users, within the organization represented by the
IS, in order to resolve their decisional problems. In other words we want to
aid the user within an organization in obtaining the information that
corresponds to h... |
cs/0610159 | Boolean Functions, Projection Operators and Quantum Error Correcting
Codes | cs.IT math.IT quant-ph | This paper describes a fundamental correspondence between Boolean functions
and projection operators in Hilbert space. The correspondence is widely
applicable, and it is used in this paper to provide a common mathematical
framework for the design of both additive and non-additive quantum error
correcting codes. The n... |
cs/0610160 | A Non-Orthogonal Distributed Space-Time Coded Protocol Part II-Code
Construction and DM-G Tradeoff | cs.IT math.IT | This is the second part of a two-part series of papers. In this paper, for
the generalized non-orthogonal amplify and forward (GNAF) protocol presented in
Part-I, a construction of a new family of distributed space-time codes based on
Co-ordinate Interleaved Orthogonal Designs (CIOD) which result in reduced
Maximum L... |
cs/0610161 | A Non-Orthogonal Distributed Space-Time Coded Protocol Part I: Signal
Model and Design Criteria | cs.IT math.IT | In this two-part series of papers, a generalized non-orthogonal amplify and
forward (GNAF) protocol which generalizes several known cooperative diversity
protocols is proposed. Transmission in the GNAF protocol comprises of two
phases - the broadcast phase and the cooperation phase. In the broadcast phase,
the source... |
cs/0610162 | Multigroup-Decodable STBCs from Clifford Algebras | cs.IT math.IT | A Space-Time Block Code (STBC) in $K$ symbols (variables) is called $g$-group
decodable STBC if its maximum-likelihood decoding metric can be written as a
sum of $g$ terms such that each term is a function of a subset of the $K$
variables and each variable appears in only one term. In this paper we provide
a general ... |
cs/0610165 | Decentralized Failure Diagnosis of Stochastic Discrete Event Systems | cs.AI | Recently, the diagnosability of {\it stochastic discrete event systems}
(SDESs) was investigated in the literature, and, the failure diagnosis
considered was {\it centralized}. In this paper, we propose an approach to {\it
decentralized} failure diagnosis of SDESs, where the stochastic system uses
multiple local diag... |
cs/0610167 | ECA-RuleML: An Approach combining ECA Rules with temporal interval-based
KR Event/Action Logics and Transactional Update Logics | cs.AI cs.LO cs.MA cs.SE | An important problem to be addressed within Event-Driven Architecture (EDA)
is how to correctly and efficiently capture and process the event/action-based
logic. This paper endeavors to bridge the gap between the Knowledge
Representation (KR) approaches based on durable events/actions and such
formalisms as event cal... |
cs/0610169 | On the User Selection for MIMO Broadcast Channels | cs.IT math.IT | In this paper, a downlink communication system, in which a Base Station (BS)
equipped with $M$ antennas communicates with $N$ users each equipped with $K$
receive antennas, is considered. An efficient suboptimum algorithm is proposed
for selecting a set of users in order to maximize the sum-rate throughput of
the sys... |
cs/0610170 | Low-complexity modular policies: learning to play Pac-Man and a new
framework beyond MDPs | cs.LG cs.AI | In this paper we propose a method that learns to play Pac-Man. We define a
set of high-level observation and action modules. Actions are temporally
extended, and multiple action modules may be in effect concurrently. A decision
of the agent is represented as a rule-based policy. For learning, we apply the
cross-entro... |
cs/0610175 | DSmT: A new paradigm shift for information fusion | 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 of primal importance for the development of reliable information
fusion systems. In this short survey paper, we present the theory of plausible
and paradoxica... |
cs/0611002 | Lattice Quantization with Side Information: Codes, Asymptotics, and
Applications in Sensor Networks | cs.IT math.IT | We consider the problem of rate/distortion with side information available
only at the decoder. For the case of jointly-Gaussian source X and side
information Y, and mean-squared error distortion, Wyner proved in 1976 that the
rate/distortion function for this problem is identical to the conditional
rate/distortion f... |
cs/0611003 | A Scalable Protocol for Cooperative Time Synchronization Using Spatial
Averaging | cs.NI cs.IT math.IT | Time synchronization is an important aspect of sensor network operation.
However, it is well known that synchronization error accumulates over multiple
hops. This presents a challenge for large-scale, multi-hop sensor networks with
a large number of nodes distributed over wide areas. In this work, we present a
protoc... |
cs/0611006 | Evolving controllers for simulated car racing | cs.NE cs.LG cs.RO | This paper describes the evolution of controllers for racing a simulated
radio-controlled car around a track, modelled on a real physical track. Five
different controller architectures were compared, based on neural networks,
force fields and action sequences. The controllers use either egocentric (first
person), New... |
cs/0611007 | MIMO Multichannel Beamforming: SER and Outage Using New Eigenvalue
Distributions of Complex Noncentral Wishart Matrices | cs.IT math.IT | This paper analyzes MIMO systems with multichannel beamforming in Ricean
fading. Our results apply to a wide class of multichannel systems which
transmit on the eigenmodes of the MIMO channel. We first present new
closed-form expressions for the marginal ordered eigenvalue distributions of
complex noncentral Wishart ... |
cs/0611009 | Efficient constraint propagation engines | cs.AI cs.PL | This paper presents a model and implementation techniques for speeding up
constraint propagation. Three fundamental approaches to improving constraint
propagation based on propagators as implementations of constraints are
explored: keeping track of which propagators are at fixpoint, choosing which
propagator to apply... |
cs/0611010 | On the structure of generalized toric codes | cs.IT math.IT | Toric codes are obtained by evaluating rational functions of a nonsingular
toric variety at the algebraic torus. One can extend toric codes to the so
called generalized toric codes. This extension consists on evaluating elements
of an arbitrary polynomial algebra at the algebraic torus instead of a linear
combination... |
cs/0611011 | Hedging predictions in machine learning | cs.LG | Recent advances in machine learning make it possible to design efficient
prediction algorithms for data sets with huge numbers of parameters. This paper
describes a new technique for "hedging" the predictions output by many such
algorithms, including support vector machines, kernel ridge regression, kernel
nearest ne... |
cs/0611012 | Asymptotic SER and Outage Probability of MIMO MRC in Correlated Fading | cs.IT math.IT | This letter derives the asymptotic symbol error rate (SER) and outage
probability of multiple-input multiple-output (MIMO) maximum ratio combining
(MRC) systems. We consider Rayleigh fading channels with both transmit and
receive spatial correlation. Our results are based on new asymptotic
expressions which we derive... |
cs/0611015 | On the Fairness of Rate Allocation in Gaussian Multiple Access Channel
and Broadcast Channel | cs.IT math.IT | The capacity region of a channel consists of all achievable rate vectors.
Picking a particular point in the capacity region is synonymous with rate
allocation. The issue of fairness in rate allocation is addressed in this
paper. We review several notions of fairness, including max-min fairness,
proportional fairness ... |
cs/0611017 | A New Data Processing Inequality and Its Applications in Distributed
Source and Channel Coding | cs.IT math.IT | In the distributed coding of correlated sources, the problem of
characterizing the joint probability distribution of a pair of random variables
satisfying an n-letter Markov chain arises. The exact solution of this problem
is intractable. In this paper, we seek a single-letter necessary condition for
this n-letter Ma... |
cs/0611020 | An associative memory for the on-line recognition and prediction of
temporal sequences | cs.NE cs.AI | This paper presents the design of an associative memory with feedback that is
capable of on-line temporal sequence learning. A framework for on-line sequence
learning has been proposed, and different sequence learning models have been
analysed according to this framework. The network model is an associative
memory wi... |
cs/0611022 | Multirobot rendezvous with visibility sensors in nonconvex environments | cs.RO | This paper presents a coordination algorithm for mobile autonomous robots.
Relying upon distributed sensing the robots achieve rendezvous, that is, they
move to a common location. Each robot is a point mass moving in a nonconvex
environment according to an omnidirectional kinematic model. Each robot is
equipped with ... |
cs/0611024 | A Relational Approach to Functional Decomposition of Logic Circuits | cs.DM cs.LG | Functional decomposition of logic circuits has profound influence on all
quality aspects of the cost-effective implementation of modern digital systems.
In this paper, a relational approach to the decomposition of logic circuits is
proposed. This approach is parallel to the normalization of relational
databases, they... |
cs/0611025 | A Logical Approach to Efficient Max-SAT solving | cs.AI cs.LO | Weighted Max-SAT is the optimization version of SAT and many important
problems can be naturally encoded as such. Solving weighted Max-SAT is an
important problem from both a theoretical and a practical point of view. In
recent years, there has been considerable interest in finding efficient solving
techniques. Most ... |
cs/0611026 | Un mod\`ele g\'en\'erique d'organisation de corpus en ligne: application
\`a la FReeBank | cs.CL | The few available French resources for evaluating linguistic models or
algorithms on other linguistic levels than morpho-syntax are either
insufficient from quantitative as well as qualitative point of view or not
freely accessible. Based on this fact, the FREEBANK project intends to create
French corpora constructed... |
cs/0611028 | A Decomposition Theory for Binary Linear Codes | cs.DM cs.IT math.IT | The decomposition theory of matroids initiated by Paul Seymour in the 1980's
has had an enormous impact on research in matroid theory. This theory, when
applied to matrices over the binary field, yields a powerful decomposition
theory for binary linear codes. In this paper, we give an overview of this code
decomposit... |
cs/0611030 | Nonextensive Pythagoras' Theorem | cs.IT math.IT | Kullback-Leibler relative-entropy, in cases involving distributions resulting
from relative-entropy minimization, has a celebrated property reminiscent of
squared Euclidean distance: it satisfies an analogue of the Pythagoras'
theorem. And hence, this property is referred to as Pythagoras' theorem of
relative-entropy... |
cs/0611031 | Efficient Threshold Aggregation of Moving Objects | cs.DB | Calculating aggregation operators of moving point objects, using time as a
continuous variable, presents unique problems when querying for congestion in a
moving and changing (or dynamic) query space. We present a set of congestion
query operators, based on a threshold value, that estimate the following 5
aggregation... |
cs/0611032 | V-like formations in flocks of artificial birds | cs.NE | We consider flocks of artificial birds and study the emergence of V-like
formations during flight. We introduce a small set of fully distributed
positioning rules to guide the birds' movements and demonstrate, by means of
simulations, that they tend to lead to stabilization into several of the
well-known V-like forma... |
cs/0611035 | The Role of Quasi-identifiers in k-Anonymity Revisited | cs.DB cs.CR | The concept of k-anonymity, used in the recent literature to formally
evaluate the privacy preservation of published tables, was introduced based on
the notion of quasi-identifiers (or QI for short). The process of obtaining
k-anonymity for a given private table is first to recognize the QIs in the
table, and then to... |
cs/0611037 | On Conditional Branches in Optimal Decision Trees | cs.PF cs.IT math.IT | The decision tree is one of the most fundamental programming abstractions. A
commonly used type of decision tree is the alphabetic binary tree, which uses
(without loss of generality) ``less than'' versus ''greater than or equal to''
tests in order to determine one of $n$ outcome events. The process of finding
an opt... |
cs/0611038 | Nonsymmetric entropy I: basic concepts and results | cs.IT math.IT | A new concept named nonsymmetric entropy which generalizes the concepts of
Boltzman's entropy and shannon's entropy, was introduced. Maximal nonsymmetric
entropy principle was proven. Some important distribution laws were derived
naturally from maximal nonsymmetric entropy principle.
|
cs/0611042 | CSCR:Computer Supported Collaborative Research | cs.HC cs.LG | It is suggested that a new area of CSCR (Computer Supported Collaborative
Research) is distinguished from CSCW and CSCL and that the demarcation between
the three areas could do with greater clarification and prescription.
|
cs/0611043 | On the Convexity of log det (I + K X^{-1}) | cs.IT math.IT | A simple proof is given for the convexity of log det (I+K X^{-1}) in the
positive definite matrix variable X with a given positive semidefinite K.
|
cs/0611044 | Protection of the information in a complex CAD system of renovation of
industrial firms | cs.CE | The threats to security of the information originating owing to involuntary
operations of the users of a CAD, and methods of its protection implemented in
a complex CAD system of renovation of firms are considered: rollback, autosave,
automatic backup copying and electronic subscript. The specificity of a complex
CAD... |
cs/0611045 | The evolution of the parametric models of drawings (modules) in the
enterprises reconstruction CAD system | cs.CE | Progressing methods of drawings creating automation is discussed on the basis
of so-called modules containing parametric representation of a part of the
drawing and the geometrical elements. The stages of evolution of modular
technology of automation of engineering are describing alternatives of applying
of moduluss ... |
cs/0611046 | Analytic Tableaux Calculi for KLM Logics of Nonmonotonic Reasoning | cs.LO cs.AI | We present tableau calculi for some logics of nonmonotonic reasoning, as
defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for
all KLM logics, namely preferential, loop-cumulative, cumulative and rational
logics. Our calculi are obtained by introducing suitable modalities to
interpret condition... |
cs/0611047 | The Reaction RuleML Classification of the Event / Action / State
Processing and Reasoning Space | cs.AI | Reaction RuleML is a general, practical, compact and user-friendly
XML-serialized language for the family of reaction rules. In this white paper
we give a review of the history of event / action /state processing and
reaction rule approaches and systems in different domains, define basic
concepts and give a classific... |
cs/0611049 | On numerical stability of recursive present value computation method | cs.CE cs.NA | We analyze numerical stability of a recursive computation scheme of present
value (PV) amd show that the absolute error increases exponentially for
positive discount rates. We show that reversing the direction of calculations
in the recurrence equation yields a robust PV computation routine.
|
cs/0611053 | Capacity of a Class of Deterministic Relay Channels | cs.IT math.IT | The capacity of a class of deterministic relay channels with the transmitter
input X, the receiver output Y, the relay output Y_1 = f(X, Y), and a separate
communication link from the relay to the receiver with capacity R_0, is shown
to be
C(R_0) = \max_{p(x)} \min \{I(X;Y)+R_0, I(X;Y, Y_1) \}.
Thus every bit fro... |
cs/0611054 | How Random is a Coin Toss? Bayesian Inference and the Symbolic Dynamics
of Deterministic Chaos | cs.LG cs.IT math.IT nlin.CD | Symbolic dynamics has proven to be an invaluable tool in analyzing the
mechanisms that lead to unpredictability and random behavior in nonlinear
dynamical systems. Surprisingly, a discrete partition of continuous state space
can produce a coarse-grained description of the behavior that accurately
describes the invari... |
cs/0611058 | Advances in Self Organising Maps | cs.NE math.ST nlin.AO stat.TH | The Self-Organizing Map (SOM) with its related extensions is the most popular
artificial neural algorithm for use in unsupervised learning, clustering,
classification and data visualization. Over 5,000 publications have been
reported in the open literature, and many commercial projects employ the SOM as
a tool for so... |
cs/0611059 | Is the cyclic prefix necessary? | cs.IT math.IT | We show that one can do away with the cyclic prefix (CP) for SC-FDE and OFDM
at the cost of a moderate increase in the complexity of a DFT-based receiver.
Such an approach effectively deals with the decrease in the number of channel
uses due to the introduction of the CP. It is shown that the SINR for SC-FDE
remains ... |
cs/0611060 | The effect of 'Open Access' upon citation impact: An analysis of ArXiv's
Condensed Matter Section | cs.DL cs.IR physics.soc-ph | This article statistically analyses how the citation impact of articles
deposited in the Condensed Matter section of the preprint server ArXiv (hosted
by Cornell University), and subsequently published in a scientific journal,
compares to that of articles in the same journal that were not deposited in
that archive. I... |
cs/0611061 | Multivariate Integral Perturbation Techniques - I (Theory) | cs.CE cs.NA | We present a quasi-analytic perturbation expansion for multivariate
N-dimensional Gaussian integrals. The perturbation expansion is an infinite
series of lower-dimensional integrals (one-dimensional in the simplest
approximation). This perturbative idea can also be applied to multivariate
Student-t integrals. We eval... |
cs/0611069 | Scaling Construction Grammar up to Production Systems: the SCIM | cs.CL | While a great effort has concerned the development of fully integrated
modular understanding systems, few researches have focused on the problem of
unifying existing linguistic formalisms with cognitive processing models. The
Situated Constructional Interpretation Model is one of these attempts. In this
model, the no... |
cs/0611070 | Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc
Networks | cs.IT math.IT | n source and destination pairs randomly located in an area want to
communicate with each other. Signals transmitted from one user to another at
distance r apart are subject to a power loss of r^{-alpha}, as well as a random
phase. We identify the scaling laws of the information theoretic capacity of
the network. In t... |
cs/0611073 | Prefix Codes for Power Laws with Countable Support | cs.IT math.IT | In prefix coding over an infinite alphabet, methods that consider specific
distributions generally consider those that decline more quickly than a power
law (e.g., Golomb coding). Particular power-law distributions, however, model
many random variables encountered in practice. For such random variables,
compression p... |
cs/0611075 | Proportional Fairness in Multi-channel Multi-rate Wireless Networks-Part
I: The Case of Deterministic Channels | cs.NI cs.IT cs.PF math.IT | This is Part I of a two-part paper series that studies the use of the
proportional fairness (PF) utility function as the basis for capacity
allocation and scheduling in multi-channel multi-rate wireless networks. The
contributions of Part I are threefold. (i) First, we lay down the theoretical
foundation for PF. Spec... |
cs/0611076 | Proportional Fairness in Multi-channel Multi-rate Wireless Networks-Part
II: The Case of Time-Varying Channels | cs.PF cs.IT cs.NI math.IT | This is Part II of a two-part paper series that studies the use of the
proportional fairness (PF) utility function as the basis for capacity
allocation and scheduling in multi-channel multi-rate wireless networks. The
contributions of Part II are twofold. (i) First, we extend the problem
formulation, theoretical resu... |
cs/0611077 | Evolutionary Optimization in an Algorithmic Setting | cs.NE cs.AI | Evolutionary processes proved very useful for solving optimization problems.
In this work, we build a formalization of the notion of cooperation and
competition of multiple systems working toward a common optimization goal of
the population using evolutionary computation techniques. It is justified that
evolutionary ... |
cs/0611079 | Managing network congestion with a Kohonen-based RED queue | cs.NI cs.NE | The behaviour of the TCP AIMD algorithm is known to cause queue length
oscillations when congestion occurs at a router output link. Indeed, due to
these queueing variations, end-to-end applications experience large delay
jitter. Many studies have proposed efficient Active Queue Management (AQM)
mechanisms in order to... |
cs/0611080 | A Multi-server Scheduling Framework for Resource Allocation in Wireless
Multi-carrier Networks | cs.NA cs.CE cs.NI cs.PF | Multiuser resource allocation has recently been recognized as an effective
methodology for enhancing the power and spectrum efficiency in OFDM (orthogonal
frequency division multiplexing) systems. It is, however, not directly
applicable to current packet-switched networks, because (i) most existing
packet-scheduling ... |
cs/0611081 | The Importance of the Algorithmic Information Theory to Construct a
Possible Example Where NP # P - II: An Irreducible Sentence | cs.CC cs.IT math.IT | In this short communication it is discussed the relation between disentangled
states and algorithmic information theory aiming to construct an irreducible
sentence whose length increases in a non-polynomial way when the number of
qubits increases.
|
cs/0611083 | Environment of development of the programs of parametric creating of the
drawings in CAD-system of renovation of the enterprises | cs.CE | The main ideas, data structures, structure and realization of operations with
them in environment of development of the programs of parametric creating of
the drawings are considered for the needs of the automated design engineering
system of renovation of the enterprises. The example of such program and
example of a... |
cs/0611085 | Fuzzy Logic Classification of Imaging Laser Desorption Fourier Transform
Mass Spectrometry Data | cs.AI | A fuzzy logic based classification engine has been developed for classifying
mass spectra obtained with an imaging internal source Fourier transform mass
spectrometer (I^2LD-FTMS). Traditionally, an operator uses the relative
abundance of ions with specific mass-to-charge (m/z) ratios to categorize
spectra. An operat... |
cs/0611086 | Reliable Multi-Path Routing Schemes for Real-Time Streaming | cs.NI cs.IT math.IT | In off-line streaming, packet level erasure resilient Forward Error
Correction (FEC) codes rely on the unrestricted buffering time at the receiver.
In real-time streaming, the extremely short playback buffering time makes FEC
inefficient for protecting a single path communication against long link
failures. It has be... |
cs/0611089 | The Extraction and Complexity Limits of Graphical Models for Linear
Codes | cs.IT math.IT | Two broad classes of graphical modeling problems for codes can be identified
in the literature: constructive and extractive problems. The former class of
problems concern the construction of a graphical model in order to define a new
code. The latter class of problems concern the extraction of a graphical model
for a... |
cs/0611090 | Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level
Soft Information | cs.IT math.IT | The performance of algebraic soft-decision decoding of Reed-Solomon codes
using bit-level soft information is investigated. Optimal multiplicity
assignment strategies of algebraic soft-decision decoding with infinite cost
are first studied over erasure channels and the binary symmetric channel. The
corresponding deco... |
cs/0611094 | Reducing Order Enforcement Cost in Complex Query Plans | cs.DB | Algorithms that exploit sort orders are widely used to implement joins,
grouping, duplicate elimination and other set operations. Query optimizers
traditionally deal with sort orders by using the notion of interesting orders.
The number of interesting orders is unfortunately factorial in the number of
participating a... |
cs/0611095 | Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the
Order Optimality of Separation | cs.IT math.IT | We investigate the optimal performance of dense sensor networks by studying
the joint source-channel coding problem. The overall goal of the sensor network
is to take measurements from an underlying random process, code and transmit
those measurement samples to a collector node in a cooperative multiple access
channe... |
cs/0611096 | On the Rate Distortion Function of Certain Sources with a Proportional
Mean-Square Error Distortion Measure | cs.IT math.IT | New bounds on the rate distortion function of certain non-Gaussian sources,
with a proportional-weighted mean-square error (MSE) distortion measure, are
given. The growth, g, of the rate distortion function, as a result of changing
from a non-weighted MSE distortion measure to a proportional-weighted
distortion crite... |
cs/0611097 | Conditionally Cycle-Free Generalized Tanner Graphs: Theory and
Application to High-Rate Serially Concatenated Codes | cs.IT math.IT | Generalized Tanner graphs have been implicitly studied by a number of authors
under the rubric of generalized parity-check matrices. This work considers the
conditioning of binary hidden variables in such models in order to break all
cycles and thus derive optimal soft-in soft-out (SISO) decoding algorithms.
Conditio... |
cs/0611099 | On the space complexity of one-pass compression | cs.IT math.IT | We study how much memory one-pass compression algorithms need to compete with
the best multi-pass algorithms. We call a one-pass algorithm an (f (n,
\ell))-footprint compressor if, given $n$, $\ell$ and an $n$-ary string $S$, it
stores $S$ in ((\rule{0ex}{2ex} O (H_\ell (S)) + o (\log n)) |S| + O (n^{\ell +
1} \log n... |
cs/0611104 | Learning and discrimination through STDP in a top-down modulated
associative memory | cs.NE cs.AI | This article underlines the learning and discrimination capabilities of a
model of associative memory based on artificial networks of spiking neurons.
Inspired from neuropsychology and neurobiology, the model implements top-down
modulations, as in neocortical layer V pyramidal neurons, with a learning rule
based on s... |
cs/0611106 | Mixing and non-mixing local minima of the entropy contrast for blind
source separation | cs.IT math.IT | In this paper, both non-mixing and mixing local minima of the entropy are
analyzed from the viewpoint of blind source separation (BSS); they correspond
respectively to acceptable and spurious solutions of the BSS problem. The
contribution of this work is twofold. First, a Taylor development is used to
show that the \... |
cs/0611109 | An approach to RAID-6 based on cyclic groups of a prime order | cs.IT math.IT math.NT | As the size of data storing arrays of disks grows, it becomes vital to
protect data against double disk failures. A popular method of protection is
via the Reed-Solomon (RS) code with two parity words. In the present paper we
construct alternative examples of linear block codes protecting against two
erasures. Our co... |
cs/0611111 | Distributed Control of Microscopic Robots in Biomedical Applications | cs.RO cs.MA | Current developments in molecular electronics, motors and chemical sensors
could enable constructing large numbers of devices able to sense, compute and
act in micron-scale environments. Such microscopic machines, of sizes
comparable to bacteria, could simultaneously monitor entire populations of
cells individually i... |
cs/0611112 | Channel Coding: The Road to Channel Capacity | cs.IT math.IT | Starting from Shannon's celebrated 1948 channel coding theorem, we trace the
evolution of channel coding from Hamming codes to capacity-approaching codes.
We focus on the contributions that have led to the most significant
improvements in performance vs. complexity for practical applications,
particularly on the addi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.