id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0708.3699 | Convolutional Entanglement Distillation | quant-ph cs.IT math.IT | We develop a theory of entanglement distillation that exploits a
convolutional coding structure. We provide a method for converting an arbitrary
classical binary or quaternary convolutional code into a convolutional
entanglement distillation protocol. The imported classical convolutional code
does not have to be dual... |
0708.3723 | Parametric Stiffness Analysis of the Orthoglide | cs.RO | This paper presents a parametric stiffness analysis of the Orthoglide, a
3-DOF translational Parallel Kinematic Machine. First, a compliant modeling of
the Orthoglide is conducted based on an existing method. Then stiffness matrix
is symbolically computed. This allows one to easily study the influence of the
geometri... |
0708.3761 | Multi-agent systems, Equiprobability, Gamma distributions and other
Geometrical questions | nlin.CD cond-mat.stat-mech cs.MA physics.soc-ph | A set of many identical interacting agents obeying a global additive
constraint is considered. Under the hypothesis of equiprobability in the
high-dimensional volume delimited in phase space by the constraint, the
statistical behavior of a generic agent over the ensemble is worked out. The
asymptotic distribution of ... |
0708.3764 | A Radio Resource Management strategy for downlink cooperation in
distributed networks | cs.IT math.IT | This paper has been withdrawn by the author
|
0708.3809 | Design Strategies for the Geometric Synthesis of Orthoglide-type
Mechanisms | cs.RO | The paper addresses the geometric synthesis of Orthoglide-type mechanism, a
family of 3-DOF parallel manipulators for rapid machining applications, which
combine advantages of both serial mechanisms and parallel kinematic
architectures. These manipulators possess quasi-isotropic kinematic
performances and are made up... |
0708.3811 | An Exhaustive Study of the Workspaces Tolopogies of all 3R Orthogonal
Manipulators with Geometric Simplifications | cs.RO | This paper proposes a classification of three-revolute orthogonal
manipulators that have at least one of their DH parameters equal to zero. This
classification is based on the topology of their workspace. The workspace is
characterized in a half-cross section by the singular curves. The workspace
topology is defined ... |
0708.3829 | A Non Parametric Model for the Forecasting of the Venezuelan Oil Prices | cs.CE cs.NE | A neural net model for forecasting the prices of Venezuelan crude oil is
proposed. The inputs of the neural net are selected by reference to a dynamic
system model of oil prices by Mashayekhi (1995, 2001) and its performance is
evaluated using two criteria: the Excess Profitability test by Anatoliev and
Gerko (2005) ... |
0708.3896 | The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators | cs.RO | The subject of this paper is a special class of three-degree-of-freedom
parallel manipulators. The singular configurations of the two Jacobian matrices
are first studied. The isotropic configurations are then found based on the
characteristic length of this manipulator. The isoconditioning loci for the
Jacobian matri... |
0708.3900 | Inference from correlated patterns: a unified theory for perceptron
learning and linear vector channels | cs.IT cond-mat.dis-nn math.IT | A framework to analyze inference performance in densely connected
single-layer feed-forward networks is developed for situations where a given
data set is composed of correlated patterns. The framework is based on the
assumption that the left and right singular value bases of the given pattern
matrix are generated in... |
0708.3920 | Kinematic analysis of the 3-RPR parallel manipulator | cs.RO | The aim of this paper is the kinematic study of a 3-RPR planar parallel
manipulator where the three fixed revolute joints are actuated. The direct and
inverse kinematic problem as well as the singular configuration is
characterized. On parallel singular configurations, the motion produce by the
mobile platform can be... |
0708.3936 | Working and Assembly Modes of the Agile Eye | cs.RO | This paper deals with the in-depth kinematic analysis of a special spherical
parallel wrist, called the Agile Eye. The Agile Eye is a three-legged spherical
parallel robot with revolute joints in which all pairs of adjacent joint axes
are orthogonal. Its most peculiar feature, demonstrated in this paper for the
first... |
0708.4149 | On the complexity of nonnegative matrix factorization | cs.NA cs.IR | Nonnegative matrix factorization (NMF) has become a prominent technique for
the analysis of image databases, text databases and other information retrieval
and clustering applications. In this report, we define an exact version of NMF.
Then we establish several results about exact NMF: (1) that it is equivalent to
a ... |
0708.4155 | Coexistence of Social Norms based on In- and Out-group Interactions | nlin.AO cs.MA physics.soc-ph | The question how social norms can emerge from microscopic interactions
between individuals is a key problem in social sciences to explain collective
behavior. In this paper we propose an agent-based model to show that randomly
distributed social behavior by way of local interaction converges to a state
with a multimo... |
0708.4164 | Asymptotic improvement of the Gilbert-Varshamov bound for linear codes | cs.IT math.IT | The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary
code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1)
where V(n,d) stands for the volume of a Hamming ball of radius d. Recently
Jiang and Vardy showed that for binary non-linear codes this bound can be
improved to A_2(... |
0708.4170 | Raising a Hardness Result | cs.AI cs.CC cs.LO | This article presents a technique for proving problems hard for classes of
the polynomial hierarchy or for PSPACE. The rationale of this technique is that
some problem restrictions are able to simulate existential or universal
quantifiers. If this is the case, reductions from Quantified Boolean Formulae
(QBF) to thes... |
0708.4214 | High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative
Networks | cs.IT math.IT | Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full
diversity order and single-symbol ML decodability have been introduced recently
for cooperative networks and an upper-bound on the maximal rate of such codes
along with code constructions has been presented. In this report, we introduce
a new clas... |
0708.4219 | Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel | cs.IT math.IT | The role of multiple antennas for secure communication is investigated within
the framework of Wyner's wiretap channel. We characterize the secrecy capacity
in terms of generalized eigenvalues when the sender and eavesdropper have
multiple antennas, the intended receiver has a single antenna, and the channel
matrices... |
0708.4311 | 2006: Celebrating 75 years of AI - History and Outlook: the Next 25
Years | cs.AI | When Kurt Goedel layed the foundations of theoretical computer science in
1931, he also introduced essential concepts of the theory of Artificial
Intelligence (AI). Although much of subsequent AI research has focused on
heuristics, which still play a major role in many practical AI applications, in
the new millennium... |
0708.4324 | Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel
Kinematic Machine | cs.RO | This paper presents a sensitivity analysis of the Orthoglide, a 3-DOF
translational Parallel Kinematic Machine. Two complementary methods are
developed to analyze its sensitivity to its dimensional and angular variations.
First, a linkage kinematic analysis method is used to have a rough idea of the
influence of the ... |
0708.4328 | Dualities Between Entropy Functions and Network Codes | cs.IT math.IT | This paper provides a new duality between entropy functions and network
codes. Given a function $g\geq 0$ defined on all proper subsets of $N$ random
variables, we provide a construction for a network multicast problem which is
solvable if and only if $g$ is entropic. The underlying network topology is
fixed and the ... |
0708.4407 | Algebraic Distributed Differential Space-Time Codes with Low Decoding
Complexity | cs.IT cs.DM math.IT math.RA | The differential encoding/decoding setup introduced by Kiran et al,
Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use
codebooks consisting of unitary matrices is extended to allow codebooks
consisting of scaled unitary matrices. For such codebooks to be usable in the
Jing-Hassibi protocol for co... |
0709.0035 | On The Limitations of The Naive Lattice Decoding | cs.IT math.IT | In this paper, the inherent drawbacks of the naive lattice decoding for MIMO
fading systems is investigated. We show that using the naive lattice decoding
for MIMO systems has considerable deficiencies in terms of the rate-diversity
trade-off. Unlike the case of maximum-likelihood decoding, in this case, even
the per... |
0709.0116 | On Ultrametric Algorithmic Information | cs.AI cs.CL | How best to quantify the information of an object, whether natural or
artifact, is a problem of wide interest. A related problem is the computability
of an object. We present practical examples of a new way to address this
problem. By giving an appropriate representation to our objects, based on a
hierarchical coding... |
0709.0124 | High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative
Networks | cs.IT math.IT | Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full
diversity order and single-symbol ML decodability have been introduced recently
by Yi and Kim for cooperative networks and an upperbound on the maximal rate of
such codes along with code constructions has been presented. In this paper, we
introduc... |
0709.0145 | Estimating Random Variables from Random Sparse Observations | cs.IT math.IT math.PR | Let X_1,...., X_n be a collection of iid discrete random variables, and
Y_1,..., Y_m a set of noisy observations of such variables. Assume each
observation Y_a to be a random function of some a random subset of the X_i's,
and consider the conditional distribution of X_i given the observations, namely
\mu_i(x_i)\equiv... |
0709.0178 | Effective Generation of Subjectively Random Binary Sequences | cs.HC cs.AI | We present an algorithm for effectively generating binary sequences which
would be rated by people as highly likely to have been generated by a random
process, such as flipping a fair coin.
|
0709.0218 | Inferring Neuronal Network Connectivity using Time-constrained Episodes | cs.DB q-bio.NC | Discovering frequent episodes in event sequences is an interesting data
mining task. In this paper, we argue that this framework is very effective for
analyzing multi-neuronal spike train data. Analyzing spike train data is an
important problem in neuroscience though there are no data mining approaches
reported for t... |
0709.0259 | Spectrum Sensing in Wideband OFDM Cognitive Radios | cs.IT math.IT | In this paper, detection of the primary user (PU) signal in an orthogonal
frequency division multiplexing (OFDM) based cognitive radio (CR) system is
addressed. According to the prior knowledge of the PU signal known to the
detector, three detection algorithms based on the Neyman-Pearson philosophy are
proposed. In t... |
0709.0355 | Solution of moving-boundary problems by the spectral element method | cs.CE cs.NA | This paper describes a novel numerical model aiming at solving
moving-boundary problems such as free-surface flows or fluid-structure
interaction. This model uses a moving-grid technique to solve the
Navier--Stokes equations expressed in the arbitrary Lagrangian--Eulerian
kinematics. The discretization in space is ba... |
0709.0409 | A DH-parameter based condition for 3R orthogonal manipulators to have 4
distinct inverse kinematic solutions | cs.RO | Positioning 3R manipulators may have two or four inverse kinematic solutions
(IKS). This paper derives a necessary and sufficient condition for 3R
positioning manipulators with orthogonal joint axes to have four distinct IKS.
We show that the transition between manipulators with 2 and 4 IKS is defined by
the set of m... |
0709.0509 | Filtering Additive Measurement Noise with Maximum Entropy in the Mean | cs.LG | The purpose of this note is to show how the method of maximum entropy in the
mean (MEM) may be used to improve parametric estimation when the measurements
are corrupted by large level of noise. The method is developed in the context
on a concrete example: that of estimation of the parameter in an exponential
distribu... |
0709.0518 | Rate Regions for the Partially-Cooperative Relay Broadcast Channel with
Non-causal Side Information | cs.IT math.IT | In this work, we consider a partially cooperative relay broadcast channel
(PC-RBC) controlled by random parameters. We provide rate regions for two
different situations: 1) when side information (SI) S^n on the random
parameters is non-causally known at both the source and the relay and, 2) when
side information S^n ... |
0709.0522 | Qualitative Belief Conditioning Rules (QBCR) | cs.AI | In this paper we extend the new family of (quantitative) Belief Conditioning
Rules (BCR) recently developed in the Dezert-Smarandache Theory (DSmT) to their
qualitative counterpart for belief revision. Since the revision of quantitative
as well as qualitative belief assignment given the occurrence of a new event
(the... |
0709.0566 | Discovering Patterns in Multi-neuronal Spike Trains using the Frequent
Episode Method | cs.DB q-bio.NC | Discovering the 'Neural Code' from multi-neuronal spike trains is an
important task in neuroscience. For such an analysis, it is important to
unearth interesting regularities in the spiking patterns. In this report, we
present an efficient method for automatically discovering synchrony, synfire
chains, and more gener... |
0709.0599 | On Universal Properties of Capacity-Approaching LDPC Ensembles | cs.IT math.IT | This paper is focused on the derivation of some universal properties of
capacity-approaching low-density parity-check (LDPC) code ensembles whose
transmission takes place over memoryless binary-input output-symmetric (MBIOS)
channels. Properties of the degree distributions, graphical complexity and the
number of fund... |
0709.0670 | Using Data Compressors to Construct Rank Tests | cs.DS cs.IT math.IT | Nonparametric rank tests for homogeneity and component independence are
proposed, which are based on data compressors. For homogeneity testing the idea
is to compress the binary string obtained by ordering the two joint samples and
writing 0 if the element is from the first sample and 1 if it is from the
second sampl... |
0709.0674 | Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective
Attention, Curiosity & Creativity | cs.AI cs.GR | I postulate that human or other intelligent agents function or should
function as follows. They store all sensory observations as they come - the
data is holy. At any time, given some agent's current coding capabilities, part
of the data is compressible by a short and hopefully fast program / description
/ explanatio... |
0709.0680 | Designing a Virtual Manikin Animation Framework Aimed at Virtual
Prototyping | cs.RO | In the industry, numerous commercial packages provide tools to introduce, and
analyse human behaviour in the product's environment (for maintenance,
ergonomics...), thanks to Virtual Humans. We will focus on control. Thanks to
algorithms newly introduced in recent research papers, we think we can provide
an implement... |
0709.0787 | Sound Generation by a Turbulent Flow in Musical Instruments -
Multiphysics Simulation Approach - | physics.comp-ph cs.CE physics.flu-dyn | Total computational costs of scientific simulations are analyzed between
direct numerical simulations (DNS) and multiphysics simulations (MPS) for sound
generation in musical instruments. In order to produce acoustic sound by a
turbulent flow in a simple recorder-like instrument, compressible fluid dynamic
calculatio... |
0709.0883 | Liquid State Machines in Adbiatic Quantum Computers for General
Computation | cs.CC cs.NE | Major mistakes do not read
|
0709.0907 | Computability of probability measures and Martin-Lof randomness over
metric spaces | cs.IT math.IT | In this paper we investigate algorithmic randomness on more general spaces
than the Cantor space, namely computable metric spaces. To do this, we first
develop a unified framework allowing computations with probability measures. We
show that any computable metric space with a computable probability measure is
isomorp... |
0709.0993 | The Description of Information in 4-Dimensional Pseudo-Euclidean
Information Space | cs.IT math.IT nlin.AO physics.soc-ph | This article is presented new method of description information systems in
abstract 4-dimensional pseudo-Euclidean information space (4-DPIES) with using
special relativity (SR) methods. This purpose core postulates of existence
4-DPIES are formulated. The theorem setting existence criteria of the invariant
velocity ... |
0709.1074 | Johnson Type Bounds on Constant Dimension Codes | cs.IT math.IT | Very recently, an operator channel was defined by Koetter and Kschischang
when they studied random network coding. They also introduced constant
dimension codes and demonstrated that these codes can be employed to correct
errors and/or erasures over the operator channel. Constant dimension codes are
equivalent to the... |
0709.1099 | Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise
Vehicle Localization and Road Matching | cs.AI cs.RO | This paper presents a multi-sensor fusion strategy for a novel road-matching
method designed to support real-time navigational features within advanced
driving-assistance systems. Managing multihypotheses is a useful strategy for
the road-matching problem. The multi-sensor fusion and multi-modal estimation
are realiz... |
0709.1166 | An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation | cs.DB | Monotonicity is a simple yet significant qualitative characteristic. We
consider the problem of segmenting a sequence in up to K segments. We want
segments to be as monotonic as possible and to alternate signs. We propose a
quality metric for this problem using the l_inf norm, and we present an optimal
linear time al... |
0709.1167 | Using RDF to Model the Structure and Process of Systems | cs.AI | Many systems can be described in terms of networks of discrete elements and
their various relationships to one another. A semantic network, or
multi-relational network, is a directed labeled graph consisting of a
heterogeneous set of entities connected by a heterogeneous set of
relationships. Semantic networks serve ... |
0709.1190 | Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its
Relation to Linear Programs with Integer Solutions | cs.IT cs.AI math.IT | We consider the general problem of finding the minimum weight $\bm$-matching
on arbitrary graphs. We prove that, whenever the linear programming (LP)
relaxation of the problem has no fractional solutions, then the belief
propagation (BP) algorithm converges to the correct solution. We also show that
when the LP relax... |
0709.1211 | Likelihood ratios and Bayesian inference for Poisson channels | cs.IT math.IT math.ST stat.TH | In recent years, infinite-dimensional methods have been introduced for the
Gaussian channels estimation. The aim of this paper is to study the application
of similar methods to Poisson channels. In particular we compute the Bayesian
estimator of a Poisson channel using the likelihood ratio and the discrete
Malliavin ... |
0709.1227 | Efficient Algorithms for Node Disjoint Subgraph Homeomorphism
Determination | cs.DS cs.DB | Recently, great efforts have been dedicated to researches on the management
of large scale graph based data such as WWW, social networks, biological
networks. In the study of graph based data management, node disjoint subgraph
homeomorphism relation between graphs is more suitable than (sub)graph
isomorphism in many ... |
0709.1441 | Information-theoretic analysis of MIMO channel sounding | cs.IT math.IT | The large majority of commercially available multiple-input multiple-output
(MIMO) radio channel measurement devices (sounders) is based on time-division
multiplexed switching (TDMS) of a single transmit/receive radio-frequency chain
into the elements of a transmit/receive antenna array. While being
cost-effective, s... |
0709.1516 | On Universal Prediction and Bayesian Confirmation | math.ST cs.IT cs.LG math.IT stat.ML stat.TH | The Bayesian framework is a well-studied and successful framework for
inductive reasoning, which includes hypothesis testing and confirmation,
parameter estimation, sequence prediction, classification, and regression. But
standard statistical guidelines for choosing the model class and prior are not
always available ... |
0709.1667 | Solving Constraint Satisfaction Problems through Belief
Propagation-guided decimation | cs.AI cond-mat.dis-nn cond-mat.stat-mech cs.CC | Message passing algorithms have proved surprisingly successful in solving
hard constraint satisfaction problems on sparse random graphs. In such
applications, variables are fixed sequentially to satisfy the constraints.
Message passing is run after each step. Its outcome provides an heuristic to
make choices at next ... |
0709.1674 | Matrix-Lifting Semi-Definite Programming for Decoding in Multiple
Antenna Systems | cs.IT math.IT | This paper presents a computationally efficient decoder for multiple antenna
systems. The proposed algorithm can be used for any constellation (QAM or PSK)
and any labeling method. The decoder is based on matrix-lifting Semi-Definite
Programming (SDP). The strength of the proposed method lies in a new relaxation
algo... |
0709.1699 | Efficient Tabling Mechanisms for Transaction Logic Programs | cs.LO cs.AI | In this paper we present efficient evaluation algorithms for the Horn
Transaction Logic (a generalization of the regular Horn logic programs with
state updates). We present two complementary methods for optimizing the
implementation of Transaction Logic. The first method is based on tabling and
we modified the proof ... |
0709.1701 | Enrichment of Qualitative Beliefs for Reasoning under Uncertainty | cs.AI | This paper deals with enriched qualitative belief functions for reasoning
under uncertainty and for combining information expressed in natural language
through linguistic labels. In this work, two possible enrichments (quantitative
and/or qualitative) of linguistic labels are considered and operators
(addition, multi... |
0709.1744 | Experiments with small helicopter automated landings at unusual
attitudes | cs.RO | This paper describes a set of experiments involving small helicopters landing
automated landing at unusual attitudes. By leveraging the increased agility of
small air vehicles, we show that it is possible to automatically land a small
helicopter on surfaces pitched at angles up to 60 degrees. Such maneuvers
require c... |
0709.1771 | Variational local structure estimation for image super-resolution | cs.CV | Super-resolution is an important but difficult problem in image/video
processing. If a video sequence or some training set other than the given
low-resolution image is available, this kind of extra information can greatly
aid in the reconstruction of the high-resolution image. The problem is
substantially more diffic... |
0709.1920 | Bandwidth selection for kernel estimation in mixed multi-dimensional
spaces | cs.CV | Kernel estimation techniques, such as mean shift, suffer from one major
drawback: the kernel bandwidth selection. The bandwidth can be fixed for all
the data set or can vary at each points. Automatic bandwidth selection becomes
a real challenge in case of multidimensional heterogeneous features. This paper
presents a... |
0709.2065 | Toward Psycho-robots | cs.AI | We try to perform geometrization of psychology by representing mental states,
<<ideas>>, by points of a metric space, <<mental space>>. Evolution of ideas is
described by dynamical systems in metric mental space. We apply the mental
space approach for modeling of flows of unconscious and conscious information
in the ... |
0709.2225 | Improved Linear Parallel Interference Cancellers | cs.IT cs.SC cs.SD cs.SE math.IT | In this paper, taking the view that a linear parallel interference canceller
(LPIC) can be seen as a linear matrix filter, we propose new linear matrix
filters that can result in improved bit error performance compared to other
LPICs in the literature. The motivation for the proposed filters arises from
the possibili... |
0709.2330 | Queueing for ergodic arrivals and services | math.PR cs.IT math.IT | In this paper we revisit the results of Loynes (1962) on stability of queues
for ergodic arrivals and services, and show examples when the arrivals are
bounded and ergodic, the service rate is constant, and under stability the
limit distribution has larger than exponential tail.
|
0709.2346 | Pushdown Compression | cs.IT cs.CC math.IT | The pressing need for eficient compression schemes for XML documents has
recently been focused on stack computation [6, 9], and in particular calls for
a formulation of information-lossless stack or pushdown compressors that allows
a formal analysis of their performance and a more ambitious use of the stack in
XML co... |
0709.2401 | Bootstrapping Deep Lexical Resources: Resources for Courses | cs.CL | We propose a range of deep lexical acquisition methods which make use of
morphological, syntactic and ontological language resources to model word
similarity and bootstrap from a seed lexicon. The different methods are
deployed in learning lexical items for a precision grammar, and shown to each
have strengths and we... |
0709.2410 | Distributed Decision Through Self-Synchronizing Sensor Networks in the
Presence of Propagation Delays and Asymmetric Channels | cs.MA cs.DC | In this paper we propose and analyze a distributed algorithm for achieving
globally optimal decisions, either estimation or detection, through a
self-synchronization mechanism among linearly coupled integrators initialized
with local measurements. We model the interaction among the nodes as a directed
graph with weig... |
0709.2445 | A Simple Characterization of Strategic Behaviors in Broadcast Channels | cs.IT cs.GT math.IT | In this paper, we consider the problem of resource allocation among two
competing users sharing a binary symmetric broadcast channel. We model the
interaction between autonomous selfish users in the resource allocation and
analyze their strategic behavior in manipulating the allocation outcome. We
analytically show t... |
0709.2446 | Learning for Dynamic Bidding in Cognitive Radio Resources | cs.LG cs.GT | In this paper, we model the various wireless users in a cognitive radio
network as a collection of selfish, autonomous agents that strategically
interact in order to acquire the dynamically available spectrum opportunities.
Our main focus is on developing solutions for wireless users to successfully
compete with each... |
0709.2506 | Autoencoder, Principal Component Analysis and Support Vector Regression
for Data Imputation | cs.AI cs.DB | Data collection often results in records that have missing values or
variables. This investigation compares 3 different data imputation models and
identifies their merits by using accuracy measures. Autoencoder Neural
Networks, Principal components and Support Vector regression are used for
prediction and combined wi... |
0709.2562 | When are recommender systems useful? | cs.IR cs.CY cs.DL cs.DS physics.data-an physics.soc-ph | Recommender systems are crucial tools to overcome the information overload
brought about by the Internet. Rigorous tests are needed to establish to what
extent sophisticated methods can improve the quality of the predictions. Here
we analyse a refined correlation-based collaborative filtering algorithm and
compare it... |
0709.2598 | On the 3/4-Conjecture for Fix-Free Codes -- A Survey | cs.IT math.CO math.IT | In this survey we concern ourself with the question, wether there exists a
fix-free code for a given sequence of codeword lengths. For a given alphabet,
we obtain the {\em Kraftsum} of a code, if we divide for every length the
number of codewords of this length in the code by the total number of all
possible words of... |
0709.2813 | LDPC codes from Singer cycles | cs.IT math.IT | The main goal of coding theory is to devise efficient systems to exploit the
full capacity of a communication channel, thus achieving an arbitrarily small
error probability. Low Density Parity Check (LDPC) codes are a family of block
codes--characterised by admitting a sparse parity check matrix--with good
correction... |
0709.2833 | Distributed Space Time Codes with Low Decoding Complexity for
Asynchronous Relay Networks | cs.IT math.IT | Recently Li and Xia have proposed a transmission scheme for wireless relay
networks based on the Alamouti space time code and orthogonal frequency
division multiplexing to combat the effect of timing errors at the relay nodes.
This transmission scheme is amazingly simple and achieves a diversity order of
two for any ... |
0709.2851 | Joint power control and user scheduling in multicell wireless networks:
Capacity scaling laws | cs.IT math.IT | We address the optimization of the sum rate performance in multicell
interference-limited singlehop networks where access points are allowed to
cooperate in terms of joint resource allocation. The resource allocation
policies considered here combine power control and user scheduling. Although
very promising from a co... |
0709.3013 | Supervised learning on graphs of spatio-temporal similarity in satellite
image sequences | cs.CV | High resolution satellite image sequences are multidimensional signals
composed of spatio-temporal patterns associated to numerous and various
phenomena. Bayesian methods have been previously proposed in (Heas and Datcu,
2005) to code the information contained in satellite image sequences in a graph
representation us... |
0709.3034 | Query Evaluation in P2P Systems of Taxonomy-based Sources: Algorithms,
Complexity, and Optimizations | cs.DB cs.DC cs.DS cs.LO | In this study, we address the problem of answering queries over a
peer-to-peer system of taxonomy-based sources. A taxonomy states subsumption
relationships between negation-free DNF formulas on terms and negation-free
conjunctions of terms. To the end of laying the foundations of our study, we
first consider the cen... |
0709.3262 | A software for learning Information Theory basics with emphasis on
Entropy of Spanish | cs.IT math.IT | In this paper, a tutorial software to learn Information Theory basics in a
practical way is reported. The software, called IT-tutor-UV, makes use of a
modern existing Spanish corpus for the modeling of the source. Both the source
and the channel coding are also included in this educational tool as part of
the learnin... |
0709.3427 | Mutual information for the selection of relevant variables in
spectrometric nonlinear modelling | cs.LG cs.NE stat.AP | Data from spectrophotometers form vectors of a large number of exploitable
variables. Building quantitative models using these variables most often
requires using a smaller set of variables than the initial one. Indeed, a too
large number of input variables to a model results in a too large number of
parameters, lead... |
0709.3461 | Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps | cs.NE cs.LG | In many real world applications, data cannot be accurately represented by
vectors. In those situations, one possible solution is to rely on dissimilarity
measures that enable sensible comparison between observations. Kohonen's
Self-Organizing Map (SOM) has been adapted to data described only through their
dissimilari... |
0709.3541 | Towards the Secrecy Capacity of the Gaussian MIMO Wire-tap Channel: The
2-2-1 Channel | cs.IT math.IT | We find the secrecy capacity of the 2-2-1 Gaussian MIMO wire-tap channel,
which consists of a transmitter and a receiver with two antennas each, and an
eavesdropper with a single antenna. We determine the secrecy capacity of this
channel by proposing an achievable scheme and then developing a tight upper
bound that m... |
0709.3586 | Une adaptation des cartes auto-organisatrices pour des donn\'ees
d\'ecrites par un tableau de dissimilarit\'es | cs.NE cs.LG | Many data analysis methods cannot be applied to data that are not represented
by a fixed number of real values, whereas most of real world observations are
not readily available in such a format. Vector based data analysis methods have
therefore to be adapted in order to be used with non standard complex data. A
flex... |
0709.3587 | Self-organizing maps and symbolic data | cs.NE cs.LG | In data analysis new forms of complex data have to be considered like for
example (symbolic data, functional data, web data, trees, SQL query and
multimedia data, ...). In this context classical data analysis for knowledge
discovery based on calculating the center of gravity can not be used because
input are not $\ma... |
0709.3600 | Cooperative Multiplexing in a Half Duplex Relay Network: Performance and
Constraints | cs.IT math.IT | Previous work on relay networks has concentrated primarily on the diversity
benefits of such techniques. This paper explores the possibility of also
obtaining multiplexing gain in a relay network, while retaining diversity gain.
Specifically, consider a network in which a single source node is equipped with
one anten... |
0709.3639 | Fast Selection of Spectral Variables with B-Spline Compression | cs.LG stat.AP | The large number of spectral variables in most data sets encountered in
spectral chemometrics often renders the prediction of a dependent variable
uneasy. The number of variables hopefully can be reduced, by using either
projection techniques or selection methods; the latter allow for the
interpretation of the select... |
0709.3640 | Resampling methods for parameter-free and robust feature selection with
mutual information | cs.LG stat.AP | Combining the mutual information criterion with a forward feature selection
strategy offers a good trade-off between optimality of the selected feature
subset and computation time. However, it requires to set the parameter(s) of
the mutual information estimator and to determine when to halt the forward
procedure. The... |
0709.3641 | Representation of Functional Data in Neural Networks | cs.NE | Functional Data Analysis (FDA) is an extension of traditional data analysis
to functional data, for example spectra, temporal series, spatio-temporal
images, gesture recognition data, etc. Functional data are rarely known in
practice; usually a regular or irregular sampling is known. For this reason,
some processing ... |
0709.3642 | Functional Multi-Layer Perceptron: a Nonlinear Tool for Functional Data
Analysis | cs.NE | In this paper, we study a natural extension of Multi-Layer Perceptrons (MLP)
to functional inputs. We show that fundamental results for classical MLP can be
extended to functional MLP. We obtain universal approximation results that show
the expressive power of functional MLP is comparable to that of numerical MLP.
We... |
0709.3753 | On Real-Time Communication Systems with Noisy Feedback | cs.IT cs.MA math.IT math.OC math.PR | We consider a real-time communication system with noisy feedback consisting
of a Markov source, a forward and a backward discrete memoryless channels, and
a receiver with finite memory. The objective is to design an optimal
communication strategy (that is, encoding, decoding, and memory update
strategies) to minimize... |
0709.3827 | On Successive Refinement of Diversity for Fading ISI Channels | cs.IT math.IT | Rate and diversity impose a fundamental tradeoff in communications. This
tradeoff was investigated for Intersymbol Interference (ISI) channels in [4]. A
different point of view was explored in [1] where high-rate codes were designed
so that they have a high-diversity code embedded within them. Such diversity
embedded... |
0709.3915 | Guessing Facets: Polytope Structure and Improved LP Decoding | cs.IT math.IT | In this paper we investigate the structure of the fundamental polytope used
in the Linear Programming decoding introduced by Feldman, Karger and
Wainwright. We begin by showing that for expander codes, every fractional
pseudocodeword always has at least a constant fraction of non-integral bits. We
then prove that for... |
0709.3921 | Geographic Gossip: Efficient Averaging for Sensor Networks | cs.IT cs.NI math.IT math.PR | Gossip algorithms for distributed computation are attractive due to their
simplicity, distributed nature, and robustness in noisy and uncertain
environments. However, using standard gossip algorithms can lead to a
significant waste in energy by repeatedly recirculating redundant information.
For realistic sensor netw... |
0709.3965 | Evolving Classifiers: Methods for Incremental Learning | cs.LG cs.AI cs.NE | The ability of a classifier to take on new information and classes by
evolving the classifier without it having to be fully retrained is known as
incremental learning. Incremental learning has been successfully applied to
many classification problems, where the data is changing and is not all
available at once. In th... |
0709.3967 | Classification of Images Using Support Vector Machines | cs.LG cs.AI | Support Vector Machines (SVMs) are a relatively new supervised classification
technique to the land cover mapping community. They have their roots in
Statistical Learning Theory and have gained prominence because they are robust,
accurate and are effective even when using a small training sample. By their
nature SVMs... |
0709.3974 | Fitness landscape of the cellular automata majority problem: View from
the Olympus | cs.AI | In this paper we study cellular automata (CAs) that perform the computational
Majority task. This task is a good example of what the phenomenon of emergence
in complex systems is. We take an interest in the reasons that make this
particular fitness landscape a difficult one. The first goal is to study the
landscape a... |
0709.4010 | Local search heuristics: Fitness Cloud versus Fitness Landscape | cs.AI | This paper introduces the concept of fitness cloud as an alternative way to
visualize and analyze search spaces than given by the geographic notion of
fitness landscape. It is argued that the fitness cloud concept overcomes
several deficiencies of the landscape representation. Our analysis is based on
the correlation... |
0709.4011 | Measuring the Evolvability Landscape to study Neutrality | cs.AI | This theoretical work defines the measure of autocorrelation of evolvability
in the context of neutral fitness landscape. This measure has been studied on
the classical MAX-SAT problem. This work highlight a new characteristic of
neutral fitness landscapes which allows to design new adapted metaheuristic.
|
0709.4015 | From Texts to Structured Documents: The Case of Health Practice
Guidelines | cs.AI | This paper describes a system capable of semi-automatically filling an XML
template from free texts in the clinical domain (practice guidelines). The XML
template includes semantic information not explicitly encoded in the text
(pairs of conditions and actions/recommendations). Therefore, there is a need
to compute t... |
0709.4035 | Energy Efficient Estimation of Gaussian Sources Over Inhomogeneous
Gaussian MAC Channels | cs.IT math.IT | It has been shown lately the optimality of uncoded transmission in estimating
Gaussian sources over homogeneous/symmetric Gaussian multiple access channels
(MAC) using multiple sensors. It remains, however, unclear whether it still
holds for any arbitrary networks and/or with high channel signal-to-noise ratio
(SNR) ... |
0709.4280 | A converse to Moore's theorem on cellular automata | math.CO cs.IT math.DS math.GR math.IT | We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is
amenable if and only if all cellular automata living on G that admit mutually
erasable patterns also admit gardens of Eden.
It had already been conjectured in that amenability could be characterized by
cellular automata. We prove the first part... |
0709.4397 | The Parallel-Sequential Duality : Matrices and Graphs | math.CO cs.IT math.IT | Usually, mathematical objects have highly parallel interpretations. In this
paper, we consider them as sequential constructors of other objects. In
particular, we prove that every reflexive directed graph can be interpreted as
a program that builds another and is itself builded by another. That leads to
some optimal ... |
0709.4464 | Adaptive Investment Strategies For Periodic Environments | cs.CE cs.NE | In this paper, we present an adaptive investment strategy for environments
with periodic returns on investment. In our approach, we consider an investment
model where the agent decides at every time step the proportion of wealth to
invest in a risky asset, keeping the rest of the budget in a risk-free asset.
Every in... |
0709.4466 | Serially Concatenated IRA Codes | cs.IT math.IT | We address the error floor problem of low-density parity check (LDPC) codes
on the binary-input additive white Gaussian noise (AWGN) channel, by
constructing a serially concatenated code consisting of two systematic
irregular repeat accumulate (IRA) component codes connected by an interleaver.
The interleaver is desi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.