id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0606011 | Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes | cs.CR cs.IT math.IT | Propagation criterion of degree $l$ and order $k$ ($PC(l)$ of order $k$) and
resiliency of vectorial Boolean functions are important for cryptographic
purpose (see [1, 2, 3,6, 7,8,10,11,16]. Kurosawa, Stoh [8] and Carlet [1] gave
a construction of Boolean functions satisfying $PC(l)$ of order $k$ from binary
linear o... |
cs/0606014 | On the Capacity of Multiple Access Channels with State Information and
Feedback | cs.IT math.IT | In this paper, the multiple access channel (MAC) with channel state is
analyzed in a scenario where a) the channel state is known non-causally to the
transmitters and b) there is perfect causal feedback from the receiver to the
transmitters. An achievable region and an outer bound are found for a discrete
memoryless ... |
cs/0606015 | The Size of Optimal Sequence Sets for Synchronous CDMA Systems | cs.IT math.IT | The sum capacity on a symbol-synchronous CDMA system having processing gain
$N$ and supporting $K$ power constrained users is achieved by employing at most
$2N-1$ sequences. Analogously, the minimum received power (energy-per-chip) on
the symbol-synchronous CDMA system supporting $K$ users that demand specified
data ... |
cs/0606016 | Performance Analysis of Iterative Channel Estimation and Multiuser
Detection in Multipath DS-CDMA Channels | cs.IT math.IT | This paper examines the performance of decision feedback based iterative
channel estimation and multiuser detection in channel coded aperiodic DS-CDMA
systems operating over multipath fading channels. First, explicit expressions
describing the performance of channel estimation and parallel interference
cancellation b... |
cs/0606017 | From semiotics of hypermedia to physics of semiosis: A view from system
theory | cs.HC cs.CL cs.IT math.IT | Given that theoretical analysis and empirical validation is fundamental to
any model, whether conceptual or formal, it is surprising that these two tools
of scientific discovery are so often ignored in the contemporary studies of
communication. In this paper, we pursued the ideas of a) correcting and
expanding the mo... |
cs/0606020 | Imagination as Holographic Processor for Text Animation | cs.AI | Imagination is the critical point in developing of realistic artificial
intelligence (AI) systems. One way to approach imagination would be simulation
of its properties and operations. We developed two models: AI-Brain Network
Hierarchy of Languages and Semantical Holographic Calculus as well as
simulation system Scr... |
cs/0606021 | A simulation engine to support production scheduling using
genetics-based machine learning | cs.CE cs.AI | The ever higher complexity of manufacturing systems, continually shortening
life cycles of products and their increasing variety, as well as the unstable
market situation of the recent years require introducing grater flexibility and
responsiveness to manufacturing processes. From this perspective, one of the
critica... |
cs/0606022 | Limited Feedback Beamforming Over Temporally-Correlated Channels | cs.IT math.IT | Feedback of quantized channel state information (CSI), called limited
feedback, enables transmit beamforming in multiple-input-multiple-output (MIMO)
wireless systems with a small amount of overhead. Due to its efficiency,
beamforming with limited feedback has been adopted in several wireless
communication standards.... |
cs/0606024 | Consecutive Support: Better Be Close! | cs.AI cs.DB | We propose a new measure of support (the number of occur- rences of a
pattern), in which instances are more important if they occur with a certain
frequency and close after each other in the stream of trans- actions. We will
explain this new consecutive support and discuss how patterns can be found
faster by pruning ... |
cs/0606026 | Generating parity check equations for bounded-distance iterative erasure
decoding | cs.IT math.IT | A generic $(r,m)$-erasure correcting set is a collection of vectors in
$\bF_2^r$ which can be used to generate, for each binary linear code of
codimension $r$, a collection of parity check equations that enables iterative
decoding of all correctable erasure patterns of size at most $m$.
That is to say, the only sto... |
cs/0606027 | Building a logical model in the machining domain for CAPP expert systems | cs.AI cs.CE cs.SE | Recently, extensive efforts have been made on the application of expert
system technique to solving the process planning task in the machining domain.
This paper introduces a new formal method to design CAPP expert systems. The
formal method is applied to provide a contour of the CAPP expert system
building technolog... |
cs/0606029 | Belief Calculus | cs.AI | In Dempster-Shafer belief theory, general beliefs are expressed as belief
mass distribution functions over frames of discernment. In Subjective Logic
beliefs are expressed as belief mass distribution functions over binary frames
of discernment. Belief representations in Subjective Logic, which are called
opinions, al... |
cs/0606035 | Finding roots of polynomials over finite fields | cs.IT math.IT | We propose an improved algorithm for finding roots of polynomials over finite
fields. This makes possible significant speedup of the decoding process of
Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting
codes.
|
cs/0606039 | Evolutionary Design: Philosophy, Theory, and Application Tactics | cs.CE cs.AI | Although it has contributed to remarkable improvements in some specific
areas, attempts to develop a universal design theory are generally
characterized by failure. This paper sketches arguments for a new approach to
engineering design based on Semiotics - the science about signs. The approach
is to combine different... |
cs/0606048 | A New Quartet Tree Heuristic for Hierarchical Clustering | cs.DS cs.CV cs.DM math.ST physics.data-an q-bio.QM stat.TH | We consider the problem of constructing an an optimal-weight tree from the
3*(n choose 4) weighted quartet topologies on n objects, where optimality means
that the summed weight of the embedded quartet topologiesis optimal (so it can
be the case that the optimal tree embeds all quartets as non-optimal
topologies). We... |
cs/0606049 | Decentralized Erasure Codes for Distributed Networked Storage | cs.IT cs.NI math.IT | We consider the problem of constructing an erasure code for storage over a
network when the data sources are distributed. Specifically, we assume that
there are n storage nodes with limited memory and k<n sources generating the
data. We want a data collector, who can appear anywhere in the network, to
query any k sto... |
cs/0606051 | Minimum Pseudo-Weight and Minimum Pseudo-Codewords of LDPC Codes | cs.IT math.IT | In this correspondence, we study the minimum pseudo-weight and minimum
pseudo-codewords of low-density parity-check (LDPC) codes under linear
programming (LP) decoding. First, we show that the lower bound of Kelly,
Sridhara, Xu and Rosenthal on the pseudo-weight of a pseudo-codeword of an LDPC
code with girth greater... |
cs/0606052 | Topology for Distributed Inference on Graphs | cs.IT math.IT | Let $N$ local decision makers in a sensor network communicate with their
neighbors to reach a decision \emph{consensus}. Communication is local, among
neighboring sensors only, through noiseless or noisy links. We study the design
of the network topology that optimizes the rate of convergence of the iterative
decisio... |
cs/0606060 | Complex Networks: New Concepts and Tools for Real-Time Imaging and
Vision | cs.CV cs.DC physics.soc-ph | This article discusses how concepts and methods of complex networks can be
applied to real-time imaging and computer vision. After a brief introduction of
complex networks basic concepts, their use as means to represent and
characterize images, as well as for modeling visual saliency, are briefly
described. The possi... |
cs/0606062 | Logics for Unranked Trees: An Overview | cs.LO cs.DB | Labeled unranked trees are used as a model of XML documents, and logical
languages for them have been studied actively over the past several years. Such
logics have different purposes: some are better suited for extracting data,
some for expressing navigational properties, and some make it easy to relate
complex prop... |
cs/0606065 | On the complexity of XPath containment in the presence of disjunction,
DTDs, and variables | cs.DB cs.LO | XPath is a simple language for navigating an XML-tree and returning a set of
answer nodes. The focus in this paper is on the complexity of the containment
problem for various fragments of XPath. We restrict attention to the most
common XPath expressions which navigate along the child and/or descendant axis.
In additi... |
cs/0606066 | The Cumulative Rule for Belief Fusion | cs.AI | The problem of combining beliefs in the Dempster-Shafer belief theory has
attracted considerable attention over the last two decades. The classical
Dempster's Rule has often been criticised, and many alternative rules for
belief combination have been proposed in the literature. The consensus operator
for combining be... |
cs/0606069 | Inference and Evaluation of the Multinomial Mixture Model for Text
Clustering | cs.IR cs.CL | In this article, we investigate the use of a probabilistic model for
unsupervised clustering in text collections. Unsupervised clustering has become
a basic module for many intelligent text processing applications, such as
information retrieval, text classification or information extraction. The model
considered in t... |
cs/0606070 | Is there an Elegant Universal Theory of Prediction? | cs.AI cs.CC | Solomonoff's inductive learning model is a powerful, universal and highly
elegant theory of sequence prediction. Its critical flaw is that it is
incomputable and thus cannot be used in practice. It is sometimes suggested
that it may still be useful to help guide the development of very general and
powerful theories o... |
cs/0606071 | Scheduling and Codeword Length Optimization in Time Varying Wireless
Networks | cs.IT math.IT | In this paper, a downlink scenario in which a single-antenna base station
communicates with K single antenna users, over a time-correlated fading
channel, is considered. It is assumed that channel state information is
perfectly known at each receiver, while the statistical characteristics of the
fading process and th... |
cs/0606073 | Comparison of the estimation of the degree of polarization from four or
two intensity images degraded by speckle noise | cs.IR physics.optics | Active polarimetric imagery is a powerful tool for accessing the information
present in a scene. Indeed, the polarimetric images obtained can reveal
polarizing properties of the objects that are not avalaible using conventional
imaging systems. However, when coherent light is used to illuminate the scene,
the images ... |
cs/0606074 | Rate Regions for Relay Broadcast Channels | cs.IT math.IT | A partially cooperative relay broadcast channel (RBC) is a three-node network
with one source node and two destination nodes (destinations 1 and 2) where
destination 1 can act as a relay to assist destination 2. Inner and outer
bounds on the capacity region of the discrete memoryless partially cooperative
RBC are obt... |
cs/0606075 | 10^(10^6) Worlds and Beyond: Efficient Representation and Processing of
Incomplete Information | cs.DB | Current systems and formalisms for representing incomplete information
generally suffer from at least one of two weaknesses. Either they are not
strong enough for representing results of simple queries, or the handling and
processing of the data, e.g. for query evaluation, is intractable.
In this paper, we present ... |
cs/0606077 | On Sequence Prediction for Arbitrary Measures | cs.LG | Suppose we are given two probability measures on the set of one-way infinite
finite-alphabet sequences and consider the question when one of the measures
predicts the other, that is, when conditional probabilities converge (in a
certain sense) when one of the measures is chosen to generate the sequence.
This question... |
cs/0606078 | Dimension Extractors and Optimal Decompression | cs.CC cs.IT math.IT | A *dimension extractor* is an algorithm designed to increase the effective
dimension -- i.e., the amount of computational randomness -- of an infinite
binary sequence, in order to turn a "partially random" sequence into a "more
random" sequence. Extractors are exhibited for various effective dimensions,
including con... |
cs/0606081 | New Millennium AI and the Convergence of History | cs.AI | Artificial Intelligence (AI) has recently become a real formal science: the
new millennium brought the first mathematically sound, asymptotically optimal,
universal problem solvers, providing a new, rigorous foundation for the
previously largely heuristic field of General AI and embedded agents. At the
same time ther... |
cs/0606083 | The Diversity Order of the Semidefinite Relaxation Detector | cs.IT math.IT | We consider the detection of binary (antipodal) signals transmitted in a
spatially multiplexed fashion over a fading multiple-input multiple-output
(MIMO) channel and where the detection is done by means of semidefinite
relaxation (SDR). The SDR detector is an attractive alternative to maximum
likelihood (ML) detecti... |
cs/0606084 | The Completeness of Propositional Resolution: A Simple and
Constructive<br> Proof | cs.LO cs.AI | It is well known that the resolution method (for propositional logic) is
complete. However, completeness proofs found in the literature use an argument
by contradiction showing that if a set of clauses is unsatisfiable, then it
must have a resolution refutation. As a consequence, none of these proofs
actually gives a... |
cs/0606090 | Error Rate Analysis for Coded Multicarrier Systems over Quasi-Static
Fading Channels | cs.IT math.IT | Several recent standards such as IEEE 802.11a/g, IEEE 802.16, and ECMA
Multiband Orthogonal Frequency Division Multiplexing (MB-OFDM) for high
data-rate Ultra-Wideband (UWB), employ bit-interleaved convolutionally-coded
multicarrier modulation over quasi-static fading channels. Motivated by the
lack of appropriate er... |
cs/0606093 | Predictions as statements and decisions | cs.LG | Prediction is a complex notion, and different predictors (such as people,
computer programs, and probabilistic theories) can pursue very different goals.
In this paper I will review some popular kinds of prediction and argue that the
theory of competitive on-line learning can benefit from the kinds of prediction
that... |
cs/0606094 | On Typechecking Top-Down XML Tranformations: Fixed Input or Output
Schemas | cs.DB cs.PL | Typechecking consists of statically verifying whether the output of an XML
transformation always conforms to an output type for documents satisfying a
given input type. In this general setting, both the input and output schema as
well as the transformation are part of the input for the problem. However,
scenarios whe... |
cs/0606096 | Building a resource for studying translation shifts | cs.CL | This paper describes an interdisciplinary approach which brings together the
fields of corpus linguistics and translation studies. It presents ongoing work
on the creation of a corpus resource in which translation shifts are explicitly
annotated. Translation shifts denote departures from formal correspondence
between... |
cs/0606097 | Synonym search in Wikipedia: Synarcher | cs.IR cs.DM | The program Synarcher for synonym (and related terms) search in the text
corpus of special structure (Wikipedia) was developed. The results of the
search are presented in the form of graph. It is possible to explore the graph
and search for graph elements interactively. Adapted HITS algorithm for synonym
search, prog... |
cs/0606099 | Fairness in Multiuser Systems with Polymatroid Capacity Region | cs.IT math.IT | For a wide class of multi-user systems, a subset of capacity region which
includes the corner points and the sum-capacity facet has a special structure
known as polymatroid. Multiaccess channels with fixed input distributions and
multiple-antenna broadcast channels are examples of such systems. Any interior
point of ... |
cs/0606100 | The generating function of the polytope of transport matrices $U(r,c)$
as a positive semidefinite kernel of the marginals $r$ and $c$ | cs.LG cs.DM | This paper has been withdrawn by the author due to a crucial error in the
proof of Lemma 5.
|
cs/0606104 | An information-spectrum approach to large deviation theorems | cs.IT math.IT | In this paper we show a some new look at large deviation theorems from the
viewpoint of the information-spectrum (IS) methods, which has been first
exploited in information theory, and also demonstrate a new basic formula for
the large deviation rate function in general, which is a pair of the lower and
upper IS rate... |
cs/0606105 | Iso9000 Based Advanced Quality Approach for Continuous Improvement of
Manufacturing Processes | cs.IR | The continuous improvement in TQM is considered as the core value by which
organisation could maintain a competitive edge. Several techniques and tools
are known to support this core value but most of the time these techniques are
informal and without modelling the interdependence between the core value and
tools. Th... |
cs/0606106 | Self-orthogonality of $q$-ary Images of $q^m$-ary Codes and Quantum Code
Construction | cs.IT math.IT | A code over GF$(q^m)$ can be imaged or expanded into a code over GF$(q)$
using a basis for the extension field over the base field. The properties of
such an image depend on the original code and the basis chosen for imaging.
Problems relating the properties of a code and its image with respect to a
basis have been o... |
cs/0606114 | Hidden Markov Process: A New Representation, Entropy Rate and Estimation
Entropy | cs.IT math.IT | We consider a pair of correlated processes {Z_n} and {S_n} (two sided), where
the former is observable and the later is hidden. The uncertainty in the
estimation of Z_n upon its finite past history is H(Z_n|Z_0^{n-1}), and for
estimation of S_n upon this observation is H(S_n|Z_0^{n-1}), which are both
sequences of n.... |
cs/0606115 | Evaluating Variable Length Markov Chain Models for Analysis of User Web
Navigation Sessions | cs.AI cs.IR | Markov models have been widely used to represent and analyse user web
navigation data. In previous work we have proposed a method to dynamically
extend the order of a Markov chain model and a complimentary method for
assessing the predictive power of such a variable length Markov chain. Herein,
we review these two me... |
cs/0606117 | Performance comparison of multi-user detectors for the downlink of a
broadband MC-CDMA system | cs.IT math.IT | In this paper multi-user detection techniques, such as Parallel and Serial
Interference Cancellations (PIC & SIC), General Minimum Mean Square Error
(GMMSE) and polynomial MMSE, for the downlink of a broadband Multi-Carrier Code
Division Multiple Access (MCCDMA) system are investigated. The Bit Error Rate
(BER) and F... |
cs/0606118 | Adapting a general parser to a sublanguage | cs.CL cs.IR | In this paper, we propose a method to adapt a general parser (Link Parser) to
sublanguages, focusing on the parsing of texts in biology. Our main proposal is
the use of terminology (identication and analysis of terms) in order to reduce
the complexity of the text to be parsed. Several other strategies are explored
an... |
cs/0606119 | Lexical Adaptation of Link Grammar to the Biomedical Sublanguage: a
Comparative Evaluation of Three Approaches | cs.CL cs.IR | We study the adaptation of Link Grammar Parser to the biomedical sublanguage
with a focus on domain terms not found in a general parser lexicon. Using two
biomedical corpora, we implement and evaluate three approaches to addressing
unknown words: automatic lexicon expansion, the use of morphological clues, and
disamb... |
cs/0606121 | Performance of Orthogonal Beamforming for SDMA with Limited Feedback | cs.IT math.IT | On the multi-antenna broadcast channel, the spatial degrees of freedom
support simultaneous transmission to multiple users. The optimal multiuser
transmission, known as dirty paper coding, is not directly realizable.
Moreover, close-to-optimal solutions such as Tomlinson-Harashima precoding are
sensitive to CSI inacc... |
cs/0606126 | May We Have Your Attention: Analysis of a Selective Attention Task | cs.NE cs.AI | In this paper we present a deeper analysis than has previously been carried
out of a selective attention problem, and the evolution of continuous-time
recurrent neural networks to solve it. We show that the task has a rich
structure, and agents must solve a variety of subproblems to perform well. We
consider the rela... |
cs/0606128 | Automatic forming lists of semantically related terms based on texts
rating in the corpus with hyperlinks and categories (In Russian) | cs.IR cs.DM | HITS adapted algorithm for synonym search, the program architecture, and the
program work evaluation with test examples are presented in the paper.
Synarcher program for synonym (and related terms) search in the text corpus of
special structure (Wikipedia) was developed. The results of search are
presented in the for... |
cs/0607002 | Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes
with Applications to Repeat-Accumulate Codes and Variations | cs.IT math.IT | This paper is focused on the performance analysis of binary linear block
codes (or ensembles) whose transmission takes place over independent and
memoryless parallel channels. New upper bounds on the maximum-likelihood (ML)
decoding error probability are derived. These bounds are applied to various
ensembles of turbo... |
cs/0607003 | Tightened Upper Bounds on the ML Decoding Error Probability of Binary
Linear Block Codes | cs.IT math.IT | The performance of maximum-likelihood (ML) decoded binary linear block codes
is addressed via the derivation of tightened upper bounds on their decoding
error probability. The upper bounds on the block and bit error probabilities
are valid for any memoryless, binary-input and output-symmetric communication
channel, a... |
cs/0607004 | On the Error Exponents of Some Improved Tangential-Sphere Bounds | cs.IT math.IT | The performance of maximum-likelihood (ML) decoded binary linear block codes
over the AWGN channel is addressed via the tangential-sphere bound (TSB) and
two of its recent improved versions. The paper is focused on the derivation of
the error exponents of these bounds. Although it was exemplified that some
recent imp... |
cs/0607005 | Belief Conditioning Rules (BCRs) | cs.AI | In this paper we propose a new family of Belief Conditioning Rules (BCRs) for
belief revision. These rules are not directly related with the fusion of
several sources of evidence but with the revision of a belief assignment
available at a given time according to the new truth (i.e. conditioning
constraint) one has ab... |
cs/0607007 | Theory of sexes by Geodakian as it is advanced by Iskrin | cs.NE cs.GL | In 1960s V.Geodakian proposed a theory that explains sexes as a mechanism for
evolutionary adaptation of the species to changing environmental conditions. In
2001 V.Iskrin refined and augmented the concepts of Geodakian and gave a new
and interesting explanation to several phenomena which involve sex, and sex
ratio, ... |
cs/0607010 | ITs, a structure sensitive information theory | cs.IT math.IT | Broadly speaking Information theory (IT) assumes no structure of the
underlying states. But what about contexts where states do have a clear
structure - how should IT cope with such situations? And if such coping is at
all possible then - how should structure be expressed so that it can be coped
with? A possible answ... |
cs/0607012 | A Flexible Structured-based Representation for XML Document Mining | cs.IR | This paper reports on the INRIA group's approach to XML mining while
participating in the INEX XML Mining track 2005. We use a flexible
representation of XML documents that allows taking into account the structure
only or both the structure and content. Our approach consists of representing
XML documents by a set of ... |
cs/0607013 | Database Querying under Changing Preferences | cs.DB cs.AI | We present here a formal foundation for an iterative and incremental approach
to constructing and evaluating preference queries. Our main focus is on query
modification: a query transformation approach which works by revising the
preference relation in the query. We provide a detailed analysis of the cases
where the ... |
cs/0607014 | Strong Consistency of the Good-Turing Estimator | cs.IT math.IT | We consider the problem of estimating the total probability of all symbols
that appear with a given frequency in a string of i.i.d. random variables with
unknown distribution. We focus on the regime in which the block length is large
yet no symbol appears frequently in the string. This is accomplished by
allowing the... |
cs/0607015 | The uncovering of hidden structures by Latent Semantic Analysis | cs.IR | Latent Semantic Analysis (LSA) is a well known method for information
retrieval. It has also been applied as a model of cognitive processing and
word-meaning acquisition. This dual importance of LSA derives from its capacity
to modulate the meaning of words by contexts, dealing successfully with
polysemy and synonymy... |
cs/0607016 | An Analysis of Arithmetic Constraints on Integer Intervals | cs.AI cs.PL | Arithmetic constraints on integer intervals are supported in many constraint
programming systems. We study here a number of approaches to implement
constraint propagation for these constraints. To describe them we introduce
integer interval arithmetic. Each approach is explained using appropriate proof
rules that red... |
cs/0607017 | Performance of STBC MC-CDMA systems over outdoor realistic MIMO channels | cs.IT math.IT | The paper deals with orthogonal space-time block coded MC-CDMA systems in
outdoor realistic downlink scenarios with up to two transmit and receive
antennas. Assuming no channel state information at the transmitter, we compare
several linear single-user detection and spreading schemes, with or without
channel coding, ... |
cs/0607018 | Feynman Checkerboard as a Model of Discrete Space-Time | cs.CE | In 1965, Feynman wrote of using a lattice containing one dimension of space
and one dimension of time to derive aspects of quantum mechanics. Instead of
summing the behavior of all possible paths as he did, this paper will consider
the motion of single particles within this discrete Space-Time lattice,
sometimes call... |
cs/0607019 | Modelling the Probability Density of Markov Sources | cs.NE | This paper introduces an objective function that seeks to minimise the
average total number of bits required to encode the joint state of all of the
layers of a Markov source. This type of encoder may be applied to the problem
of optimising the bottom-up (recognition model) and top-down (generative model)
connections... |
cs/0607020 | Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels | cs.IT math.IT | The asymptotic iterative decoding performances of low-density parity-check
(LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on
memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this
paper. For MS decoding, the analysis is done by upper bounding the bit error
probability... |
cs/0607021 | Slepian-Wolf Code Design via Source-Channel Correspondence | cs.IT math.IT | We consider Slepian-Wolf code design based on LDPC (low-density parity-check)
coset codes for memoryless source-side information pairs. A density evolution
formula, equipped with a concentration theorem, is derived for Slepian- Wolf
coding based on LDPC coset codes. As a consequence, an intimate connection
between Sl... |
cs/0607024 | Results on Parity-Check Matrices with Optimal Stopping and/or Dead-End
Set Enumerators | cs.IT math.IT | The performance of iterative decoding techniques for linear block codes
correcting erasures depends very much on the sizes of the stopping sets
associated with the underlying Tanner graph, or, equivalently, the parity-check
matrix representing the code. In this paper, we introduce the notion of
dead-end sets to expli... |
cs/0607027 | A general computation rule for lossy summaries/messages with examples
from equalization | cs.IT math.IT | Elaborating on prior work by Minka, we formulate a general computation rule
for lossy messages. An important special case (with many applications in
communications) is the conversion of "soft-bit" messages to Gaussian messages.
By this method, the performance of a Kalman equalizer is improved, both for
uncoded and co... |
cs/0607029 | A Coding Theorem Characterizing Renyi's Entropy through
Variable-to-Fixed Length Codes | cs.IT math.IT | This paper has been withdrawn
|
cs/0607030 | Towards a General Theory of Simultaneous Diophantine Approximation of
Formal Power Series: Multidimensional Linear Complexity | cs.IT math.IT | We model the development of the linear complexity of multisequences by a
stochastic infinite state machine, the Battery-Discharge-Model, BDM. The states
s in S of the BDM have asymptotic probabilities or mass Pr(s)=1/(P(q,M)
q^K(s)), where K(s) in N_0 is the class of the state s, and P(q,M)=\sum_(K
in\N0) P_M(K)q^(-K... |
cs/0607037 | The Minimal Cost Algorithm for Off-Line Diagnosability of Discrete Event
Systems | cs.AI cs.CC | The failure diagnosis for {\it discrete event systems} (DESs) has been given
considerable attention in recent years. Both on-line and off-line diagnostics
in the framework of DESs was first considered by Lin Feng in 1994, and
particularly an algorithm for diagnosability of DESs was presented. Motivated
by some existi... |
cs/0607039 | Set-Theoretic Preliminaries for Computer Scientists | cs.DM cs.DB | The basics of set theory are usually copied, directly or indirectly, by
computer scientists from introductions to mathematical texts. Often
mathematicians are content with special cases when the general case is of no
mathematical interest. But sometimes what is of no mathematical interest is of
great practical intere... |
cs/0607042 | Towards a classical proof of exponential lower bound for 2-probe smooth
codes | cs.CR cs.IT math.IT | Let C: {0,1}^n -> {0,1}^m be a code encoding an n-bit string into an m-bit
string. Such a code is called a (q, c, e) smooth code if there exists a
decoding algorithm which while decoding any bit of the input, makes at most q
probes on the code word and the probability that it looks at any location is at
most c/m. The... |
cs/0607043 | Analysis of CDMA systems that are characterized by eigenvalue spectrum | cs.IT cond-mat.dis-nn math.IT | An approach by which to analyze the performance of the code division multiple
access (CDMA) scheme, which is a core technology used in modern wireless
communication systems, is provided. The approach characterizes the objective
system by the eigenvalue spectrum of a cross-correlation matrix composed of
signature sequ... |
cs/0607047 | PAC Classification based on PAC Estimates of Label Class Distributions | cs.LG | A standard approach in pattern classification is to estimate the
distributions of the label classes, and then to apply the Bayes classifier to
the estimates of the distributions in order to classify unlabeled examples. As
one might expect, the better our estimates of the label class distributions,
the better the resu... |
cs/0607048 | Evaluation de Techniques de Traitement des Refus\'{e}s pour l'Octroi de
Cr\'{e}dit | cs.NE math.ST stat.TH | We present the problem of "Reject Inference" for credit acceptance. Because
of the current legal framework (Basel II), credit institutions need to
industrialize their processes for credit acceptance, including Reject
Inference. We present here a methodology to compare various techniques of
Reject Inference and show t... |
cs/0607051 | Raisonner avec des diagrammes : perspectives cognitives et
computationnelles | cs.CL | Diagrammatic, analogical or iconic representations are often contrasted with
linguistic or logical representations, in which the shape of the symbols is
arbitrary. The aim of this paper is to make a case for the usefulness of
diagrams in inferential knowledge representation systems. Although commonly
used, diagrams h... |
cs/0607052 | Dealing with Metonymic Readings of Named Entities | cs.AI cs.CL | The aim of this paper is to propose a method for tagging named entities (NE),
using natural language processing techniques. Beyond their literal meaning,
named entities are frequently subject to metonymy. We show the limits of
current NE type hierarchies and detail a new proposal aiming at dynamically
capturing the s... |
cs/0607053 | Linguistically Grounded Models of Language Change | cs.AI cs.CL | Questions related to the evolution of language have recently known an
impressive increase of interest (Briscoe, 2002). This short paper aims at
questioning the scientific status of these models and their relations to
attested data. We show that one cannot directly model non-linguistic factors
(exogenous factors) even... |
cs/0607056 | Reasoning with Intervals on Granules | cs.AI cs.DM | The formalizations of periods of time inside a linear model of Time are
usually based on the notion of intervals, that may contain or may not their
endpoints. This is not enought when the periods are written in terms of coarse
granularities with respect to the event taken into account. For instance, how
to express th... |
cs/0607060 | Circle Formation of Weak Mobile Robots | cs.RO | In this paper we prove the conjecture of D\'{e}fago & Konagaya. Furthermore,
we describe a deterministic protocol for forming a regular n-gon in finite
time.
|
cs/0607062 | Get out the vote: Determining support or opposition from Congressional
floor-debate transcripts | cs.CL cs.SI physics.soc-ph | We investigate whether one can determine from the transcripts of U.S.
Congressional floor debates whether the speeches represent support of or
opposition to proposed legislation. To address this problem, we exploit the
fact that these speeches occur as part of a discussion; this allows us to use
sources of informatio... |
cs/0607064 | How to Find Good Finite-Length Codes: From Art Towards Science | cs.IT math.IT | We explain how to optimize finite-length LDPC codes for transmission over the
binary erasure channel. Our approach relies on an analytic approximation of the
erasure probability. This is in turn based on a finite-length scaling result to
model large scale erasures and a union bound involving minimal stopping sets to
... |
cs/0607065 | Decomposable Theories | cs.LO cs.AI | We present in this paper a general algorithm for solving first-order formulas
in particular theories called "decomposable theories". First of all, using
special quantifiers, we give a formal characterization of decomposable theories
and show some of their properties. Then, we present a general algorithm for
solving f... |
cs/0607067 | Competing with stationary prediction strategies | cs.LG | In this paper we introduce the class of stationary prediction strategies and
construct a prediction algorithm that asymptotically performs as well as the
best continuous stationary strategy. We make mild compactness assumptions but
no stochastic assumptions about the environment. In particular, no assumption
of stati... |
cs/0607068 | Computation of the Weight Distribution of CRC Codes | cs.IT math.AC math.IT | In this article, we illustrate an algorithm for the computation of the weight
distribution of CRC codes. The recursive structure of CRC codes will give us an
iterative way to compute the weight distribution of their dual codes starting
from just some ``representative'' words. Thanks to MacWilliams Theorem, the
comput... |
cs/0607071 | Islands for SAT | cs.AI | In this note we introduce the notion of islands for restricting local search.
We show how we can construct islands for CNF SAT problems, and how much search
space can be eliminated by restricting search to the island.
|
cs/0607074 | On Construction of the (24,12,8) Golay Codes | cs.IT math.IT | Two product array codes are used to construct the (24, 12, 8) binary Golay
code through the direct sum operation. This construction provides a systematic
way to find proper (8, 4, 4) linear block component codes for generating the
Golay code, and it generates and extends previously existing methods that use a
similar... |
cs/0607075 | On entropy for mixtures of discrete and continuous variables | cs.IT math.IT | Let $X$ be a discrete random variable with support $S$ and $f : S \to
S^\prime$ be a bijection. Then it is well-known that the entropy of $X$ is the
same as the entropy of $f(X)$. This entropy preservation property has been
well-utilized to establish non-trivial properties of discrete stochastic
processes, e.g. queui... |
cs/0607076 | Capacity of Cooperative Fusion in the Presence of Byzantine Sensors | cs.IT math.IT | The problem of cooperative fusion in the presence of Byzantine sensors is
considered. An information theoretic formulation is used to characterize the
Shannon capacity of sensor fusion. It is shown that when less than half of the
sensors are Byzantine, the effect of Byzantine attack can be entirely
mitigated, and the... |
cs/0607078 | Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection | cs.DS cs.IT math.IT | Recently, lattice-reduction-aided detectors have been proposed for
multiple-input multiple-output (MIMO) systems to give performance with full
diversity like maximum likelihood receiver, and yet with complexity similar to
linear receivers. However, these lattice-reduction-aided detectors are based on
the traditional ... |
cs/0607081 | Syst\`{e}me de repr\'{e}sentation d'aide au besoin dans le domaine
architectural | cs.OH cs.IR | The image is a very important mean of communication in the field of
architectural who intervenes in the various phases of the design of a project.
It can be regarded as a tool of decision-making aid. The study of our research
aims at to see the contribution of the Economic Intelligence in the resolution
of a decision... |
cs/0607083 | Mathematical Modelling of the Thermal Accumulation in Hot Water Solar
Systems | cs.CE | Mathematical modelling and defining useful recommendations for construction
and regimes of exploitation for hot water solar installation with thermal
stratification is the main purpose of this work. A special experimental solar
module for hot water was build and equipped with sufficient measure apparatus.
The main co... |
cs/0607084 | About Norms and Causes | cs.AI | Knowing the norms of a domain is crucial, but there exist no repository of
norms. We propose a method to extract them from texts: texts generally do not
describe a norm, but rather how a state-of-affairs differs from it. Answers
concerning the cause of the state-of-affairs described often reveal the
implicit norm. We... |
cs/0607085 | Using Pseudo-Stochastic Rational Languages in Probabilistic Grammatical
Inference | cs.LG | In probabilistic grammatical inference, a usual goal is to infer a good
approximation of an unknown distribution P called a stochastic language. The
estimate of P stands in some class of probabilistic models such as
probabilistic automata (PA). In this paper, we focus on probabilistic models
based on multiplicity aut... |
cs/0607086 | Representing Knowledge about Norms | cs.AI | Norms are essential to extend inference: inferences based on norms are far
richer than those based on logical implications. In the recent decades, much
effort has been devoted to reason on a domain, once its norms are represented.
How to extract and express those norms has received far less attention.
Extraction is d... |
cs/0607088 | Using Answer Set Programming in an Inference-Based approach to Natural
Language Semantics | cs.CL cs.AI | Using Answer Set Programming in an Inference-Based approach to Natural
Language Semantics
|
cs/0607089 | Superregular Matrices and the Construction of Convolutional Codes having
a Maximum Distance Profile | cs.IT math.CO math.IT | Superregular matrices are a class of lower triangular Toeplitz matrices that
arise in the context of constructing convolutional codes having a maximum
distance profile. These matrices are characterized by the property that no
submatrix has a zero determinant unless it is trivially zero due to the lower
triangular str... |
cs/0607090 | Neural Networks with Complex and Quaternion Inputs | cs.NE | This article investigates Kak neural networks, which can be instantaneously
trained, for complex and quaternion inputs. The performance of the basic
algorithm has been analyzed and shown how it provides a plausible model of
human perception and understanding of images. The motivation for studying
quaternion inputs is... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.