id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0505003 | A New Kind of Hopfield Networks for Finding Global Optimum | cs.NE | The Hopfield network has been applied to solve optimization problems over
decades. However, it still has many limitations in accomplishing this task.
Most of them are inherited from the optimization algorithms it implements. The
computation of a Hopfield network, defined by a set of difference equations,
can easily b... |
cs/0505006 | Searching for image information content, its discovery, extraction, and
representation | cs.CV | Image information content is known to be a complicated and controvercial
problem. This paper posits a new image information content definition.
Following the theory of Solomonoff-Kolmogorov-Chaitin's complexity, we define
image information content as a set of descriptions of imafe data structures.
Three levels of suc... |
cs/0505008 | Data Mining on Crash Simulation Data | cs.IR cs.CE | The work presented in this paper is part of the cooperative research project
AUTO-OPT carried out by twelve partners from the automotive industries. One
major work package concerns the application of data mining methods in the area
of automotive design. Suitable methods for data preparation and data analysis
are deve... |
cs/0505010 | On the Wyner-Ziv problem for individual sequences | cs.IT math.IT | We consider a variation of the Wyner-Ziv problem pertaining to lossy
compression of individual sequences using finite-state encoders and decoders.
There are two main results in this paper. The first characterizes the
relationship between the performance of the best $M$-state encoder-decoder pair
to that of the best b... |
cs/0505012 | On the Shannon cipher system with a capacity-limited key-distribution
channel | cs.IT math.IT | We consider the Shannon cipher system in a setting where the secret key is
delivered to the legitimate receiver via a channel with limited capacity. For
this setting, we characterize the achievable region in the space of three
figures of merit: the security (measured in terms of the equivocation), the
compressibility... |
cs/0505016 | Visual Character Recognition using Artificial Neural Networks | cs.NE | The recognition of optical characters is known to be one of the earliest
applications of Artificial Neural Networks, which partially emulate human
thinking in the domain of artificial intelligence. In this paper, a simplified
neural approach to recognition of optical or visual characters is portrayed and
discussed. T... |
cs/0505018 | Temporal and Spatial Data Mining with Second-Order Hidden Models | cs.AI | In the frame of designing a knowledge discovery system, we have developed
stochastic models based on high-order hidden Markov models. These models are
capable to map sequences of data into a Markov chain in which the transitions
between the states depend on the \texttt{n} previous states according to the
order of the... |
cs/0505019 | Artificial Neural Networks and their Applications | cs.NE | The Artificial Neural network is a functional imitation of simplified model
of the biological neurons and their goal is to construct useful computers for
real world problems. The ANN applications have increased dramatically in the
last few years fired by both theoretical and practical applications in a wide
variety o... |
cs/0505020 | Asymptotic Capacity Results for Non-Stationary Time-Variant Channels
Using Subspace Projections | cs.IT math.IT | In this paper we deal with a single-antenna discrete-time flat-fading
channel. The fading process is assumed to be stationary for the duration of a
single data block. From block to block the fading process is allowed to be
non-stationary. The number of scatterers bounds the rank of the channels
covariance matrix. The... |
cs/0505021 | Distant generalization by feedforward neural networks | cs.NE | This paper discusses the notion of generalization of training samples over
long distances in the input space of a feedforward neural network. Such a
generalization might occur in various ways, that differ in how great the
contribution of different training features should be.
The structure of a neuron in a feedforw... |
cs/0505022 | Collaborative Beamforming for Distributed Wireless Ad Hoc Sensor
Networks | cs.IT cs.NI math.IT | The performance of collaborative beamforming is analyzed using the theory of
random arrays. The statistical average and distribution of the beampattern of
randomly generated phased arrays is derived in the framework of wireless ad hoc
sensor networks. Each sensor node is assumed to have a single isotropic antenna
and... |
cs/0505028 | A linear memory algorithm for Baum-Welch training | cs.LG cs.DS q-bio.QM | Background: Baum-Welch training is an expectation-maximisation algorithm for
training the emission and transition probabilities of hidden Markov models in a
fully automated way.
Methods and results: We introduce a linear space algorithm for Baum-Welch
training. For a hidden Markov model with M states, T free transi... |
cs/0505032 | Broadcast Channels with Cooperating Decoders | cs.IT math.IT | We consider the problem of communicating over the general discrete memoryless
broadcast channel (BC) with partially cooperating receivers. In our setup,
receivers are able to exchange messages over noiseless conference links of
finite capacities, prior to decoding the messages sent from the transmitter. In
this paper... |
cs/0505035 | Beyond Hypertree Width: Decomposition Methods Without Decompositions | cs.CC cs.AI | The general intractability of the constraint satisfaction problem has
motivated the study of restrictions on this problem that permit polynomial-time
solvability. One major line of work has focused on structural restrictions,
which arise from restricting the interaction among constraint scopes. In this
paper, we enga... |
cs/0505038 | Efficient Management of Short-Lived Data | cs.DB | Motivated by the increasing prominence of loosely-coupled systems, such as
mobile and sensor networks, which are characterised by intermittent
connectivity and volatile data, we study the tagging of data with so-called
expiration times. More specifically, when data are inserted into a database,
they may be tagged wit... |
cs/0505039 | Methods for comparing rankings of search engine results | cs.IR | In this paper we present a number of measures that compare rankings of search
engine results. We apply these measures to five queries that were monitored
daily for two periods of about 21 days each. Rankings of the different search
engines (Google, Yahoo and Teoma for text searches and Google, Yahoo and
Picsearch for... |
cs/0505041 | Relational reasoning in the region connection calculus | cs.AI cs.LO | This paper is mainly concerned with the relation-algebraical aspects of the
well-known Region Connection Calculus (RCC). We show that the contact relation
algebra (CRA) of certain RCC model is not atomic complete and hence infinite.
So in general an extensional composition table for the RCC cannot be obtained
by simp... |
cs/0505042 | Iterative MILP Methods for Vehicle Control Problems | cs.RO | Mixed integer linear programming (MILP) is a powerful tool for planning and
control problems because of its modeling capability and the availability of
good solvers. However, for large models, MILP methods suffer computationally.
In this paper, we present iterative MILP algorithms that address this issue. We
consider... |
cs/0505044 | Separating a Real-Life Nonlinear Image Mixture | cs.NE cs.AI cs.IT math.IT | When acquiring an image of a paper document, the image printed on the back
page sometimes shows through. The mixture of the front- and back-page images
thus obtained is markedly nonlinear, and thus constitutes a good real-life test
case for nonlinear blind source separation.
This paper addresses a difficult version... |
cs/0505045 | A T Step Ahead Optimal Target Detection Algorithm for a Multi Sensor
Surveillance System | cs.MA cs.RO | This paper presents a methodology for optimal target detection in a multi
sensor surveillance system. The system consists of mobile sensors that guard a
rectangular surveillance zone crisscrossed by moving targets. Targets percolate
the surveillance zone in a poisson fashion with uniform velocities. Under these
stati... |
cs/0505046 | Optimum Signal Linear Detector in the Discrete Wavelet Transform-Domain | cs.IT cs.IR math.IT | The problem of known signal detection in Additive White Gaussian Noise is
considered. In this paper a new detection algorithm based on Discrete Wavelet
Transform pre-processing and threshold comparison is introduced. Current
approaches described in [7] use the maximum value obtained in the wavelet
domain for decision... |
cs/0505049 | Fading-Resilient Super-Orthogonal Space-Time Signal Sets: Can Good
Constellations Survive in Fading? | cs.IT math.IT | In this correspondence, first-tier indirect (direct) discernible
constellation expansions are defined for generalized orthogonal designs. The
expanded signal constellation, leading to so-called super-orthogonal codes,
allows the achievement of coding gains in addition to diversity gains enabled
by orthogonal designs.... |
cs/0505051 | Sub-Optimum Signal Linear Detector Using Wavelets and Support Vector
Machines | cs.IR cs.NE | The problem of known signal detection in Additive White Gaussian Noise is
considered. In previous work, a new detection scheme was introduced by the
authors, and it was demonstrated that optimum performance cannot be reached in
a real implementation. In this paper we analyse Support Vector Machines (SVM)
as an altern... |
cs/0505052 | Upgrading Pulse Detection with Time Shift Properties Using Wavelets and
Support Vector Machines | cs.IR cs.NE | Current approaches in pulse detection use domain transformations so as to
concentrate frequency related information that can be distinguishable from
noise. In real cases we do not know when the pulse will begin, so we need a
time search process in which time windows are scheduled and analysed. Each
window can contain... |
cs/0505053 | Wavelet Time Shift Properties Integration with Support Vector Machines | cs.IR cs.NE | This paper presents a short evaluation about the integration of information
derived from wavelet non-linear-time-invariant (non-LTI) projection properties
using Support Vector Machines (SVM). These properties may give additional
information for a classifier trying to detect known patterns hidden by noise.
In the expe... |
cs/0505054 | The Partition Weight Enumerator of MDS Codes and its Applications | cs.IT math.IT | A closed form formula of the partition weight enumerator of maximum distance
separable (MDS) codes is derived for an arbitrary number of partitions. Using
this result, some properties of MDS codes are discussed. The results are
extended for the average binary image of MDS codes in finite fields of
characteristic two.... |
cs/0505056 | Text Compression and Superfast Searching | cs.IR cs.IT math.IT | In this paper, a new compression scheme for text is presented. The same is
efficient in giving high compression ratios and enables super fast searching
within the compressed text. Typical compression ratios of 70-80% and reducing
the search time by 80-85% are the features of this paper. Till now, a trade-off
between ... |
cs/0505057 | Improved Bounds on the Parity-Check Density and Achievable Rates of
Binary Linear Block Codes with Applications to LDPC Codes | cs.IT math.IT | We derive bounds on the asymptotic density of parity-check matrices and the
achievable rates of binary linear block codes transmitted over memoryless
binary-input output-symmetric (MBIOS) channels. The lower bounds on the density
of arbitrary parity-check matrices are expressed in terms of the gap between
the rate of... |
cs/0505058 | The Cyborg Astrobiologist: Scouting Red Beds for Uncommon Features with
Geological Significance | cs.CV astro-ph cs.AI cs.CE cs.HC cs.RO cs.SE physics.ins-det q-bio.NC | The `Cyborg Astrobiologist' (CA) has undergone a second geological field
trial, at a red sandstone site in northern Guadalajara, Spain, near Riba de
Santiuste. The Cyborg Astrobiologist is a wearable computer and video camera
system that has demonstrated a capability to find uncommon interest points in
geological ima... |
cs/0505059 | Consistent query answers on numerical databases under aggregate
constraints | cs.DB | The problem of extracting consistent information from relational databases
violating integrity constraints on numerical data is addressed. In particular,
aggregate constraints defined as linear inequalities on aggregate-sum queries
on input data are considered. The notion of repair as consistent set of updates
at att... |
cs/0505060 | A Unified Subspace Outlier Ensemble Framework for Outlier Detection in
High Dimensional Spaces | cs.DB cs.AI | The task of outlier detection is to find small groups of data objects that
are exceptional when compared with rest large amount of data. Detection of such
outliers is important for many applications such as fraud detection and
customer migration. Most such applications are high dimensional domains in
which the data m... |
cs/0505064 | Multi-Modal Human-Machine Communication for Instructing Robot Grasping
Tasks | cs.HC cs.AI cs.CV cs.LG cs.RO | A major challenge for the realization of intelligent robots is to supply them
with cognitive abilities in order to allow ordinary users to program them
easily and intuitively. One way of such programming is teaching work tasks by
interactive demonstration. To make this effective and convenient for the user,
the machi... |
cs/0505065 | A dissipative particle swarm optimization | cs.NE | A dissipative particle swarm optimization is developed according to the
self-organization of dissipative structure. The negative entropy is introduced
to construct an opening dissipative system that is far-from-equilibrium so as
to driving the irreversible evolution process with better fitness. The testing
of two mul... |
cs/0505067 | Optimizing semiconductor devices by self-organizing particle swarm | cs.NE | A self-organizing particle swarm is presented. It works in dissipative state
by employing the small inertia weight, according to experimental analysis on a
simplified model, which with fast convergence. Then by recognizing and
replacing inactive particles according to the process deviation information of
device param... |
cs/0505068 | Handling equality constraints by adaptive relaxing rule for swarm
algorithms | cs.NE | The adaptive constraints relaxing rule for swarm algorithms to handle with
the problems with equality constraints is presented. The feasible space of such
problems may be similiar to ridge function class, which is hard for applying
swarm algorithms. To enter the solution space more easily, the relaxed quasi
feasible ... |
cs/0505069 | Handling boundary constraints for numerical optimization by particle
swarm flying in periodic search space | cs.NE | The periodic mode is analyzed together with two conventional boundary
handling modes for particle swarm. By providing an infinite space that
comprises periodic copies of original search space, it avoids possible
disorganizing of particle swarm that is induced by the undesired mutations at
the boundary. The results on... |
cs/0505070 | SWAF: Swarm Algorithm Framework for Numerical Optimization | cs.NE | A swarm algorithm framework (SWAF), realized by agent-based modeling, is
presented to solve numerical optimization problems. Each agent is a bare bones
cognitive architecture, which learns knowledge by appropriately deploying a set
of simple rules in fast and frugal heuristics. Two essential categories of
rules, the ... |
cs/0505071 | Summarization Techniques for Pattern Collections in Data Mining | cs.DB cs.AI cs.DS | Discovering patterns from data is an important task in data mining. There
exist techniques to find large collections of many kinds of patterns from data
very efficiently. A collection of patterns can be regarded as a summary of the
data. A major difficulty with patterns is that pattern collections summarizing
the dat... |
cs/0505074 | Instance-Independent View Serializability for Semistructured Databases | cs.DB | Semistructured databases require tailor-made concurrency control mechanisms
since traditional solutions for the relational model have been shown to be
inadequate. Such mechanisms need to take full advantage of the hierarchical
structure of semistructured data, for instance allowing concurrent updates of
subtrees of, ... |
cs/0505078 | On the Parity-Check Density and Achievable Rates of LDPC Codes | cs.IT math.IT | The paper introduces new bounds on the asymptotic density of parity-check
matrices and the achievable rates under ML decoding of binary linear block
codes transmitted over memoryless binary-input output-symmetric channels. The
lower bounds on the parity-check density are expressed in terms of the gap
between the chan... |
cs/0505080 | Dominance Based Crossover Operator for Evolutionary Multi-objective
Algorithms | cs.AI cs.NA | In spite of the recent quick growth of the Evolutionary Multi-objective
Optimization (EMO) research field, there has been few trials to adapt the
general variation operators to the particular context of the quest for the
Pareto-optimal set. The only exceptions are some mating restrictions that take
in account the dis... |
cs/0505081 | An ontological approach to the construction of problem-solving models | cs.AI | Our ongoing work aims at defining an ontology-centered approach for building
expertise models for the CommonKADS methodology. This approach (which we have
named "OntoKADS") is founded on a core problem-solving ontology which
distinguishes between two conceptualization levels: at an object level, a set
of concepts ena... |
cs/0505083 | Defensive forecasting | cs.LG cs.AI | We consider how to make probability forecasts of binary labels. Our main
mathematical result is that for any continuous gambling strategy used for
detecting disagreement between the forecasts and the actual labels, there
exists a forecasting strategy whose forecasts are ideal as far as this gambling
strategy is conce... |
cs/0505084 | An explicit formula for the number of tunnels in digital objects | cs.DM cs.CG cs.CV | An important concept in digital geometry for computer imagery is that of
tunnel. In this paper we obtain a formula for the number of tunnels as a
function of the number of the object vertices, pixels, holes, connected
components, and 2x2 grid squares. It can be used to test for tunnel-freedom a
digital object, in par... |
cs/0506002 | HepToX: Heterogeneous Peer to Peer XML Databases | cs.DB | We study a collection of heterogeneous XML databases maintaining similar and
related information, exchanging data via a peer to peer overlay network. In
this setting, a mediated global schema is unrealistic. Yet, users/applications
wish to query the databases via one peer using its schema. We have recently
developed ... |
cs/0506004 | Non-asymptotic calibration and resolution | cs.LG | We analyze a new algorithm for probability forecasting of binary observations
on the basis of the available data, without making any assumptions about the
way the observations are generated. The algorithm is shown to be well
calibrated and to have good resolution for long enough sequences of
observations and for a su... |
cs/0506007 | Defensive forecasting for linear protocols | cs.LG | We consider a general class of forecasting protocols, called "linear
protocols", and discuss several important special cases, including multi-class
forecasting. Forecasting is formalized as a game between three players:
Reality, whose role is to generate observations; Forecaster, whose goal is to
predict the observat... |
cs/0506009 | Approximate MAP Decoding on Tail-Biting Trellises | cs.IT math.IT | We propose two approximate algorithms for MAP decoding on tail-biting
trellises. The algorithms work on a subset of nodes of the tail-biting trellis,
judiciously selected. We report the results of simulations on an AWGN channel
using the approximate algorithms on tail-biting trellises for the $(24,12)$
Extended Golay... |
cs/0506011 | On the dimensions of certain LDPC codes based on q-regular bipartite
graphs | cs.IT cs.DM math.IT | An explicit construction of a family of binary LDPC codes called LU(3,q),
where q is a power of a prime, was recently given. A conjecture was made for
the dimensions of these codes when q is odd. The conjecture is proved in this
note. The proof involves the geometry of a 4-dimensional symplectic vector
space and the ... |
cs/0506012 | A Non-Cooperative Power Control Game in Delay-Constrained
Multiple-Access Networks | cs.IT math.IT | A game-theoretic approach for studying power control in multiple-access
networks with transmission delay constraints is proposed. A non-cooperative
power control game is considered in which each user seeks to choose a transmit
power that maximizes its own utility while satisfying the user's delay
requirements. The ut... |
cs/0506013 | On the existence and characterization of the maxent distribution under
general moment inequality constraints | cs.IT math.IT | A broad set of sufficient conditions that guarantees the existence of the
maximum entropy (maxent) distribution consistent with specified bounds on
certain generalized moments is derived. Most results in the literature are
either focused on the minimum cross-entropy distribution or apply only to
distributions with a ... |
cs/0506016 | Compressing Probability Distributions | cs.IT math.IT | We show how to store good approximations of probability distributions in
small space.
|
cs/0506017 | Treillis de concepts et ontologies pour l'interrogation d'un annuaire de
sources de donn\'{e}es biologiques (BioRegistry) | cs.DB cs.IR | Bioinformatic data sources available on the web are multiple and
heterogenous. The lack of documentation and the difficulty of interaction with
these data sources require users competence in both informatics and biological
fields for an optimal use of sources contents that remain rather under
exploited. In this paper... |
cs/0506018 | On the Achievable Diversity-Multiplexing Tradeoffs in Half-Duplex
Cooperative Channels | cs.IT math.IT | In this paper, we propose novel cooperative transmission protocols for delay
limited coherent fading channels consisting of N (half-duplex and
single-antenna) partners and one cell site. In our work, we differentiate
between the relay, cooperative broadcast (down-link), and cooperative
multiple-access (up-link) chann... |
cs/0506019 | An Efficient Approximation Algorithm for Point Pattern Matching Under
Noise | cs.CV cs.CG | Point pattern matching problems are of fundamental importance in various
areas including computer vision and structural bioinformatics. In this paper,
we study one of the more general problems, known as LCP (largest common point
set problem): Let $\PP$ and $\QQ$ be two point sets in $\mathbb{R}^3$, and let
$\epsilon ... |
cs/0506020 | On the Throughput-Delay Tradeoff in Cellular Multicast | cs.IT math.IT | In this paper, we adopt a cross layer design approach for analyzing the
throughput-delay tradeoff of the multicast channel in a single cell system. To
illustrate the main ideas, we start with the single group case, i.e., pure
multicast, where a common information stream is requested by all the users. We
consider thre... |
cs/0506022 | Asymptotics of Discrete MDL for Online Prediction | cs.IT cs.LG math.IT math.ST stat.TH | Minimum Description Length (MDL) is an important principle for induction and
prediction, with strong relations to optimal Bayesian learning. This paper
deals with learning non-i.i.d. processes by means of two-part MDL, where the
underlying model class is countable. We consider the online learning framework,
i.e. obse... |
cs/0506023 | Sparse Covariance Selection via Robust Maximum Likelihood Estimation | cs.CE cs.AI | We address a problem of covariance selection, where we seek a trade-off
between a high likelihood against the number of non-zero elements in the
inverse covariance matrix. We solve a maximum likelihood problem with a penalty
term given by the sum of absolute values of the elements of the inverse
covariance matrix, an... |
cs/0506024 | The Hyper-Cortex of Human Collective-Intelligence Systems | cs.CY cs.AI cs.DL cs.NE | Individual-intelligence research, from a neurological perspective, discusses
the hierarchical layers of the cortex as a structure that performs conceptual
abstraction and specification. This theory has been used to explain how
motor-cortex regions responsible for different behavioral modalities such as
writing and sp... |
cs/0506025 | Dynamic Asymmetric Communication | cs.IT math.IT | We show how any dynamic instantaneous compression algorithm can be converted
to an asymmetric communication protocol, with which a server with high
bandwidth can help clients with low bandwidth send it messages. Unlike previous
authors, we do not assume the server knows the messages' distribution, and our
protocols a... |
cs/0506026 | Database Reformulation with Integrity Constraints (extended abstract) | cs.DB | In this paper we study the problem of reducing the evaluation costs of
queries on finite databases in presence of integrity constraints, by designing
and materializing views. Given a database schema, a set of queries defined on
the schema, a set of integrity constraints, and a storage limit, to find a
solution to thi... |
cs/0506028 | Neyman-Pearson Detection of Gauss-Markov Signals in Noise: Closed-Form
Error Exponent and Properties | cs.IT math.IT | The performance of Neyman-Pearson detection of correlated stochastic signals
using noisy observations is investigated via the error exponent for the miss
probability with a fixed level. Using the state-space structure of the signal
and observation model, a closed-form expression for the error exponent is
derived, and... |
cs/0506029 | A Unified Framework for Tree Search Decoding : Rediscovering the
Sequential Decoder | cs.IT math.IT | We consider receiver design for coded transmission over linear Gaussian
channels. We restrict ourselves to the class of lattice codes and formulate the
joint detection and decoding problem as a closest lattice point search (CLPS).
Here, a tree search framework for solving the CLPS is adopted. In our
framework, the CL... |
cs/0506030 | Preferential and Preferential-discriminative Consequence relations | cs.AI cs.LO | The present paper investigates consequence relations that are both
non-monotonic and paraconsistent. More precisely, we put the focus on
preferential consequence relations, i.e. those relations that can be defined by
a binary preference relation on states labelled by valuations. We worked with a
general notion of val... |
cs/0506031 | A Constrained Object Model for Configuration Based Workflow Composition | cs.AI | Automatic or assisted workflow composition is a field of intense research for
applications to the world wide web or to business process modeling. Workflow
composition is traditionally addressed in various ways, generally via theorem
proving techniques. Recent research observed that building a composite workflow
bears... |
cs/0506032 | Framework for Hopfield Network based Adaptive routing - A design level
approach for adaptive routing phenomena with Artificial Neural Network | cs.NE | Routing, as a basic phenomena, by itself, has got umpteen scopes to analyse,
discuss and arrive at an optimal solution for the technocrats over years.
Routing is analysed based on many factors; few key constraints that decide the
factors are communication medium, time dependency, information source nature.
Parametric... |
cs/0506033 | An Event-driven Operator Model for Dynamic Simulation of Construction
Machinery | cs.CE | Prediction and optimisation of a wheel loader's dynamic behaviour is a
challenge due to tightly coupled, non-linear subsystems of different technical
domains. Furthermore, a simulation regarding performance, efficiency, and
operability cannot be limited to the machine itself, but has to include
operator, environment,... |
cs/0506034 | A Taxonomy of Data Grids for Distributed Data Sharing, Management and
Processing | cs.DC cs.CE | Data Grids have been adopted as the platform for scientific communities that
need to share, access, transport, process and manage large data collections
distributed worldwide. They combine high-end computing technologies with
high-performance networking and wide-area storage management techniques. In
this paper, we d... |
cs/0506036 | Non prefix-free codes for constrained sequences | cs.IT math.IT | In this paper we consider the use of variable length non prefix-free codes
for coding constrained sequences of symbols. We suppose to have a Markov source
where some state transitions are impossible, i.e. the stochastic matrix
associated with the Markov chain has some null entries. We show that classic
Kraft inequali... |
cs/0506037 | Tradeoff Between Source and Channel Coding for Erasure Channels | cs.IT math.IT | In this paper, we investigate the optimal tradeoff between source and channel
coding for channels with bit or packet erasure. Upper and Lower bounds on the
optimal channel coding rate are computed to achieve minimal end-to-end
distortion. The bounds are calculated based on a combination of sphere packing,
straight li... |
cs/0506039 | Antenna array geometry and coding performance | cs.IT math.IT | This paper provides details about experiments in realistic, urban, and
frequency flat channels with space-time coding that specifically examines the
impact of the number of receive antennas and the design criteria for code
selection on the performance. Also the performance characteristics are examined
of the coded mo... |
cs/0506040 | A Fixed-Length Coding Algorithm for DNA Sequence Compression | cs.IT math.IT | While achieving a compression ratio of 2.0 bits/base, the new algorithm codes
non-N bases in fixed length. It dramatically reduces the time of coding and
decoding than previous DNA compression algorithms and some universal
compression programs.
|
cs/0506041 | Competitive on-line learning with a convex loss function | cs.LG cs.AI | We consider the problem of sequential decision making under uncertainty in
which the loss caused by a decision depends on the following binary
observation. In competitive on-line learning, the goal is to design decision
algorithms that are almost as good as the best decision rules in a wide
benchmark class, without m... |
cs/0506042 | Tree-Based Construction of LDPC Codes | cs.IT math.IT | We present a construction of LDPC codes that have minimum pseudocodeword
weight equal to the minimum distance, and perform well with iterative decoding.
The construction involves enumerating a d-regular tree for a fixed number of
layers and employing a connection algorithm based on mutually orthogonal Latin
squares t... |
cs/0506043 | A Decision Feedback Based Scheme for Slepian-Wolf Coding of sources with
Hidden Markov Correlation | cs.IT math.IT | We consider the problem of compression of two memoryless binary sources, the
correlation between which is defined by a Hidden Markov Model (HMM). We propose
a Decision Feedback (DF) based scheme which when used with low density parity
check codes results in compression close to the Slepian Wolf limits.
|
cs/0506044 | Minimal Network Coding for Multicast | cs.IT math.IT | We give an information flow interpretation for multicasting using network
coding. This generalizes the fluid model used to represent flows to a single
receiver. Using the generalized model, we present a decentralized algorithm to
minimize the number of packets that undergo network coding. We also propose a
decentrali... |
cs/0506045 | Decision Feedback Based Scheme for Slepian-Wolf Coding of sources with
Hidden Markov Correlation | cs.IT math.IT | We consider the problem of compression of two memoryless binary sources, the
correlation between which is defined by a Hidden Markov Model (HMM). We propose
a Decision Feedback (DF) based scheme which when used with low density parity
check codes results in compression close to the Slepian Wolf limits.
|
cs/0506047 | Analyse et expansion des textes en question-r\'{e}ponse | cs.IR | This paper presents an original methodology to consider question answering.
We noticed that query expansion is often incorrect because of a bad
understanding of the question. But the automatic good understanding of an
utterance is linked to the context length, and the question are often short.
This methodology propos... |
cs/0506048 | Enriching a Text by Semantic Disambiguation for Information Extraction | cs.IR | External linguistic resources have been used for a very long time in
information extraction. These methods enrich a document with data that are
semantically equivalent, in order to improve recall. For instance, some of
these methods use synonym dictionaries. These dictionaries enrich a sentence
with words that have a... |
cs/0506051 | Comparison of two different implementations of a
finite-difference-method for first-order pde in mathematica and matlab | cs.CE cs.DM | In this article two implementations of a symmetric finite difference
algorithm for a first-order partial differential equation are discussed. The
considered partial differential equation discribes the time evolution of the
crack length distribution of microcracks in brittle materia.
|
cs/0506052 | Comments on `Bit Interleaved Coded Modulation' | cs.IT math.IT | Caire, Taricco and Biglieri presented a detailed analysis of bit interleaved
coded modulation, a simple and popular technique used to improve system
performance, especially in the context of fading channels. They derived an
upper bound to the probability of error, called the expurgated bound. In this
correspondence, ... |
cs/0506053 | Analysis on Transmit Antenna Selection for Spatial Multiplexing Systems:
A Geometrical Approach | cs.IT math.IT | Recently, the remarkable potential of a multiple-input multiple-output (MIMO)
wireless communication system was unveiled for its ability to provide spatial
diversity or multiplexing gains. For MIMO diversity schemes, it is already
known that. by the optimal antenna selection maximizing the post-processing
signal-to-n... |
cs/0506056 | Large Alphabets and Incompressibility | cs.IT math.IT | We briefly survey some concepts related to empirical entropy -- normal
numbers, de Bruijn sequences and Markov processes -- and investigate how well
it approximates Kolmogorov complexity. Our results suggest $\ell$th-order
empirical entropy stops being a reasonable complexity metric for almost all
strings of length $... |
cs/0506057 | About one 3-parameter Model of Testing | cs.LG | This article offers a 3-parameter model of testing, with 1) the difference
between the ability level of the examinee and item difficulty; 2) the examinee
discrimination and 3) the item discrimination as model parameters.
|
cs/0506058 | An MSE Based Ttransfer Chart to Analyze Iterative Decoding Schemes | cs.IT math.IT | An alternative to extrinsic information transfer (EXIT) charts called mean
squared error (MSE) charts that use a measure related to the MSE instead of
mutual information is proposed. Using the relationship between mutual
information and minimum mean squared error (MMSE), a relationship between the
rate of any code an... |
cs/0506062 | A CDMA multiuser detection algorithm based on survey propagation | cs.IT math.IT | A computationally tractable CDMA multiuser detection algorithm is developed
based on survey propagation.
|
cs/0506063 | Priority-Based Conflict Resolution in Inconsistent Relational Databases | cs.DB | We study here the impact of priorities on conflict resolution in inconsistent
relational databases. We extend the framework of repairs and consistent query
answers. We propose a set of postulates that an extended framework should
satisfy and consider two instantiations of the framework: (locally preferred)
l-repairs ... |
cs/0506064 | Optimal multiple assignments based on integer programming in secret
sharing schemes with general access structures | cs.CR cs.IT math.IT | It is known that for any general access structure, a secret sharing scheme
(SSS) can be constructed from an (m,m)-threshold scheme by using the so-called
cumulative map or from a (t,m)-threshold SSS by a modified cumulative map.
However, such constructed SSSs are not efficient generally. In this paper, we
propose a n... |
cs/0506065 | Strongly secure ramp secret sharing schemes for general access
structures | cs.CR cs.IT math.IT | Ramp secret sharing (SS) schemes can be classified into strong ramp SS
schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out
any part of a secret explicitly even in the case where some information about
the secret leaks from a non-qualified set of shares, and hence, they are more
desirable than... |
cs/0506072 | Performance Analysis of Algebraic Soft Decoding of Reed-Solomon Codes
over Binary Symmetric and Erasure Channels | cs.IT math.IT | In this paper, we characterize the decoding region of algebraic soft decoding
(ASD) of Reed-Solomon (RS) codes over erasure channels and binary symmetric
channel (BSC). Optimal multiplicity assignment strategies (MAS) are
investigated and tight bounds are derived to show the ASD can significantly
outperform conventio... |
cs/0506073 | Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by
Adapting the Parity Check Matrix | cs.IT math.IT | An iterative algorithm is presented for soft-input-soft-output (SISO)
decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the
sum product algorithm (SPA) in conjunction with a binary parity check matrix of
the RS code. The novelty is in reducing a submatrix of the binary parity check
matrix tha... |
cs/0506074 | Redundancy in Logic II: 2CNF and Horn Propositional Formulae | cs.AI cs.LO | We report complexity results about redundancy of formulae in 2CNF form. We
first consider the problem of checking redundancy and show some algorithms that
are slightly better than the trivial one. We then analyze problems related to
finding irredundant equivalent subsets (I.E.S.) of a given set. The concept of
cyclic... |
cs/0506075 | Seeing stars: Exploiting class relationships for sentiment
categorization with respect to rating scales | cs.CL cs.LG | We address the rating-inference problem, wherein rather than simply decide
whether a review is "thumbs up" or "thumbs down", as in previous sentiment
analysis work, one must determine an author's evaluation with respect to a
multi-point scale (e.g., one to five "stars"). This task represents an
interesting twist on s... |
cs/0506077 | Stability of Scheduled Multi-access Communication over Quasi-static Flat
Fading Channels with Random Coding and Independent Decoding | cs.IT math.IT | The stability of scheduled multiaccess communication with random coding and
independent decoding of messages is investigated. The number of messages that
may be scheduled for simultaneous transmission is limited to a given maximum
value, and the channels from transmitters to receiver are quasi-static, flat,
and have ... |
cs/0506078 | Dynamical Neural Network: Information and Topology | cs.IR cs.NE | A neural network works as an associative memory device if it has large
storage capacity and the quality of the retrieval is good enough. The learning
and attractor abilities of the network both can be measured by the mutual
information (MI), between patterns and retrieval states. This paper deals with
a search for an... |
cs/0506083 | Maxwell Construction: The Hidden Bridge between Iterative and Maximum a
Posteriori Decoding | cs.IT cond-mat.dis-nn math.IT | There is a fundamental relationship between belief propagation and maximum a
posteriori decoding. A decoding algorithm, which we call the Maxwell decoder,
is introduced and provides a constructive description of this relationship.
Both, the algorithm itself and the analysis of the new decoder are reminiscent
of the M... |
cs/0506085 | On the Job Training | cs.LG | We propose a new framework for building and evaluating machine learning
algorithms. We argue that many real-world problems require an agent which must
quickly learn to respond to demands, yet can continue to perform and respond to
new training throughout its useful life. We give a framework for how such
agents can be... |
cs/0506086 | Large System Decentralized Detection Performance Under Communication
Constraints | cs.IT math.IT | The problem of decentralized detection in a sensor network subjected to a
total average power constraint and all nodes sharing a common bandwidth is
investigated. The bandwidth constraint is taken into account by assuming
non-orthogonal communication between sensors and the data fusion center via
direct-sequence code... |
cs/0506087 | Primal-dual distance bounds of linear codes with application to
cryptography | cs.IT cs.CR math.IT | Let $N(d,d^\perp)$ denote the minimum length $n$ of a linear code $C$ with
$d$ and $d^{\bot}$, where $d$ is the minimum Hamming distance of $C$ and
$d^{\bot}$ is the minimum Hamming distance of $C^{\bot}$. In this paper, we
show a lower bound and an upper bound on $N(d,d^\perp)$. Further, for small
values of $d$ and ... |
cs/0506088 | An Alternative to Huffman's Algorithm for Constructing Variable-Length
Codes | cs.IT math.IT | This paper has been withdrawn by the author.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.