id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0908.2676 | Deterministic Construction of Binary, Bipolar and Ternary Compressed
Sensing Matrices | cs.IT math.IT | In this paper we establish the connection between the Orthogonal Optical
Codes (OOC) and binary compressed sensing matrices. We also introduce
deterministic bipolar $m\times n$ RIP fulfilling $\pm 1$ matrices of order $k$
such that $m\leq\mathcal{O}\big(k (\log_2 n)^{\frac{\log_2 k}{\ln \log_2
k}}\big)$. The columns ... |
0908.2741 | B-Rank: A top N Recommendation Algorithm | physics.data-an cs.IR | In this paper B-Rank, an efficient ranking algorithm for recommender systems,
is proposed. B-Rank is based on a random walk model on hypergraphs. Depending
on the setup, B-Rank outperforms other state of the art algorithms in terms of
precision, recall (19% - 50%), and inter list diversity (20% - 60%). B-Rank
capture... |
0908.2744 | XTile: An Error-Correction Package for DNA Self-Assembly | cs.IT math.IT | Self assembly is a process by which supramolecular species form spontaneously
from their components. This process is ubiquitous throughout the life chemistry
and is central to biological information processing. It has been predicted that
in future self assembly will become an important engineering discipline by
combi... |
0908.2828 | A Rate-Distortion Perspective on Multiple Decoding Attempts for
Reed-Solomon Codes | cs.IT math.IT | Recently, a number of authors have proposed decoding schemes for Reed-Solomon
(RS) codes based on multiple trials of a simple RS decoding algorithm. In this
paper, we present a rate-distortion (R-D) approach to analyze these
multiple-decoding algorithms for RS codes. This approach is first used to
understand the asym... |
0908.2847 | The Single Source Two Terminal Network with Network Coding | cs.IT cs.NI math.IT | We consider a communication network with a single source that has a set of
messages and two terminals where each terminal is interested in an arbitrary
subset of messages at the source. A tight capacity region for this problem is
demonstrated. We show by a simple graph-theoretic procedure that any such
problem can be... |
0908.2941 | Delay-Sensitive Distributed Power and Transmission Threshold Control for
S-ALOHA Network with Finite State Markov Fading Channels | cs.IT math.IT | In this paper, we consider the delay-sensitive power and transmission
threshold control design in S-ALOHA network with FSMC fading channels. The
random access system consists of an access point with K competing users, each
has access to the local channel state information (CSI) and queue state
information (QSI) as we... |
0908.2984 | Explicit Codes Minimizing Repair Bandwidth for Distributed Storage | cs.IT math.IT | We consider the setting of data storage across n nodes in a distributed
manner. A data collector (DC) should be able to reconstruct the entire data by
connecting to any k out of the n nodes and downloading all the data stored in
them. When a node fails, it has to be regenerated back using the existing
nodes. In a rec... |
0908.3025 | Techniques for Highly Multiobjective Optimisation: Some Nondominated
Points are Better than Others | cs.NE | The research area of evolutionary multiobjective optimization (EMO) is
reaching better understandings of the properties and capabilities of EMO
algorithms, and accumulating much evidence of their worth in practical
scenarios. An urgent emerging issue is that the favoured EMO algorithms scale
poorly when problems have... |
0908.3091 | Computational Understanding and Manipulation of Symmetries | cs.AI cs.MS | For natural and artificial systems with some symmetry structure,
computational understanding and manipulation can be achieved without learning
by exploiting the algebraic structure. Here we describe this algebraic
coordinatization method and apply it to permutation puzzles. Coordinatization
yields a structural unders... |
0908.3098 | Throughput of Cellular Uplink with Dynamic User Activity and Cooperative
Base-Stations | cs.IT math.IT | The throughput of a linear cellular uplink with a random number of users,
different power control schemes, and cooperative base stations is considered in
the large system limit where the number of cells is large for non fading
Gaussian channels. The analysis is facilitated by establishing an analogy
between the cellu... |
0908.3148 | Another Look at Quantum Neural Computing | cs.NE cs.AI | The term quantum neural computing indicates a unity in the functioning of the
brain. It assumes that the neural structures perform classical processing and
that the virtual particles associated with the dynamical states of the
structures define the underlying quantum state. We revisit the concept and also
summarize n... |
0908.3162 | Practical approach to programmable analog circuits with memristors | physics.ins-det cond-mat.mes-hall cs.AI | We suggest an approach to use memristors (resistors with memory) in
programmable analog circuits. Our idea consists in a circuit design in which
low voltages are applied to memristors during their operation as analog circuit
elements and high voltages are used to program the memristor's states. This
way, as it was de... |
0908.3166 | Remarks on the Criteria of Constructing MIMO-MAC DMT Optimal Codes | cs.IT math.IT | In this paper we investigate the criteria proposed by Coronel et al. for
constructing MIMO MAC-DMT optimal codes over several classes of fading
channels. We first give a counterexample showing their DMT result is not
correct when the channel is frequency-selective. For the case of symmetric
MIMO-MAC flat fading chann... |
0908.3171 | On the Optimality of Beamforming for Multi-User MISO Interference
Channels with Single-User Detection | cs.IT math.IT | For a multi-user interference channel with multi-antenna transmitters and
single-antenna receivers, by restricting each receiver to a single-user
detector, computing the largest achievable rate region amounts to solving a
family of non-convex optimization problems. Recognizing the intrinsic
connection between the sig... |
0908.3184 | Location of Single Neuron Memories in a Hebbian Network | cs.NE | This paper reports the results of an experiment on the use of Kak's B-Matrix
approach to spreading activity in a Hebbian neural network. Specifically, it
concentrates on the memory retrieval from single neurons and compares the
performance of the B-Matrix approach to that of the traditional approach.
|
0908.3212 | Quantifying Rational Belief | physics.data-an cs.AI | Some criticisms that have been raised against the Cox approach to probability
theory are addressed. Should we use a single real number to measure a degree of
rational belief? Can beliefs be compared? Are the Cox axioms obvious? Are there
counterexamples to Cox? Rather than justifying Cox's choice of axioms we follow
... |
0908.3234 | Overlapped Chunked Network Coding | cs.IT math.IT | Network coding is known to improve the throughput and the resilience to
losses in most network scenarios. In a practical network scenario, however, the
accurate modeling of the traffic is often too complex and/or infeasible. The
goal is thus to design codes that perform close to the capacity of any network
(with arbi... |
0908.3252 | Non-quadratic convex regularized reconstruction of MR images from spiral
acquisitions | cs.CV cs.CE | Combining fast MR acquisition sequences and high resolution imaging is a
major issue in dynamic imaging. Reducing the acquisition time can be achieved
by using non-Cartesian and sparse acquisitions. The reconstruction of MR images
from these measurements is generally carried out using gridding that
interpolates the m... |
0908.3265 | Rate Constrained Random Access over a Fading Channel | cs.GT cs.LG cs.NI | In this paper, we consider uplink transmissions involving multiple users
communicating with a base station over a fading channel. We assume that the
base station does not coordinate the transmissions of the users and hence the
users employ random access communication. The situation is modeled as a
non-cooperative rep... |
0908.3280 | On the Relationship between Trading Network and WWW Network: A
Preferential Attachment Perspective | cs.IR cs.CE | This paper describes the relationship between trading network and WWW network
from preferential attachment mechanism perspective. This mechanism is known to
be the underlying principle in the network evolution and has been incorporated
to formulate two famous web pages ranking algorithms, PageRank and HITS. We
point ... |
0908.3359 | Geometric Analysis of the Conformal Camera for Intermediate-Level Vision
and Perisaccadic Perception | cs.CV cs.RO | A binocular system developed by the author in terms of projective Fourier
transform (PFT) of the conformal camera, which numerically integrates the head,
eyes, and visual cortex, is used to process visual information during saccadic
eye movements. Although we make three saccades per second at the eyeball's
maximum sp... |
0908.3380 | Construction of Hilbert Transform Pairs of Wavelet Bases and Gabor-like
Transforms | cs.IT cs.CV math.IT | We propose a novel method for constructing Hilbert transform (HT) pairs of
wavelet bases based on a fundamental approximation-theoretic characterization
of scaling functions--the B-spline factorization theorem. In particular,
starting from well-localized scaling functions, we construct HT pairs of
biorthogonal wavele... |
0908.3383 | On the Shiftability of Dual-Tree Complex Wavelet Transforms | cs.IT cs.CV math.IT | The dual-tree complex wavelet transform (DT-CWT) is known to exhibit better
shift-invariance than the conventional discrete wavelet transform. We propose
an amplitude-phase representation of the DT-CWT which, among other things,
offers a direct explanation for the improvement in the shift-invariance. The
representati... |
0908.3394 | A Cognitive Mind-map Framework to Foster Trust | cs.AI | The explorative mind-map is a dynamic framework, that emerges automatically
from the input, it gets. It is unlike a verificative modeling system where
existing (human) thoughts are placed and connected together. In this regard,
explorative mind-maps change their size continuously, being adaptive with
connectionist ce... |
0908.3463 | Interpolation-Based QR Decomposition in MIMO-OFDM Systems | cs.IT math.IT | Detection algorithms for multiple-input multiple-output (MIMO) wireless
systems based on orthogonal frequency-division multiplexing (OFDM) typically
require the computation of a QR decomposition for each of the data-carrying
OFDM tones. The resulting computational complexity will, in general, be
significant, as the n... |
0908.3512 | The Infinite-message Limit of Two-terminal Interactive Source Coding | cs.IT math.IT | A two-terminal interactive function computation problem with alternating
messages is studied within the framework of distributed block source coding
theory. For any finite number of messages, a single-letter characterization of
the sum-rate-distortion function was established in previous works using
standard informat... |
0908.3523 | Cognitive Dimensions Analysis of Interfaces for Information Seeking | cs.HC cs.IR | Cognitive Dimensions is a framework for analyzing human-computer interaction.
It is used for meta-analysis, that is, for talking about characteristics of
systems without getting bogged down in details of a particular implementation.
In this paper, I discuss some of the dimensions of this theory and how they can
be ap... |
0908.3539 | An Accurate Approximation to the Distribution of the Sum of Equally
Correlated Nakagami-m Envelopes and its Application in Equal Gain Diversity
Receivers | cs.IT math.IT | We present a novel and accurate approximation for the distribution of the sum
of equally correlated Nakagami-m variates. Ascertaining on this result we study
the performance of Equal Gain Combining (EGC) receivers, operating over equally
correlating fading channels. Numerical results and simulations show the
accuracy... |
0908.3541 | Level Crossing Rate and Average Fade Duration of the Double Nakagami-m
Random Process and Application in MIMO Keyhole Fading Channels | cs.IT math.IT | We present novel exact expressions and accurate closed-form approximations
for the level crossing rate (LCR) and the average fade duration (AFD) of the
double Nakagami-m random process. These results are then used to study the
second order statistics of multiple input multiple output (MIMO) keyhole fading
channels wi... |
0908.3544 | On the Second Order Statistics of the Multihop Rayleigh Fading Channel | cs.IT math.IT | Second order statistics provides a dynamic representation of a fading channel
and plays an important role in the evaluation and design of the wireless
communication systems. In this paper, we present a novel analytical framework
for the evaluation of important second order statistical parameters, as the
level crossin... |
0908.3549 | Level Crossing Rate and Average Fade Duration of the Multihop Rayleigh
Fading Channel | cs.IT math.IT | We present a novel analytical framework for the evaluation of important
second order statistical parameters, as the level crossing rate (LCR) and the
average fade duration (AFD) of the amplify-and-forward multihop Rayleigh fading
channel. More specifically, motivated by the fact that this channel is a
cascaded one, w... |
0908.3551 | Level Crossing Rate and Average Fade Duration of EGC Systems with
Cochannel Interference in Rayleigh Fading | cs.IT math.IT | Both the first-order signal statistics (e.g. the outage probability) and the
second-order signal statistics (e.g. the average level crossing rate, LCR, and
the average fade duration, AFD) are important design criteria and performance
measures for the wireless communication systems, including the equal gain
combining ... |
0908.3552 | Level Crossing Rate and Average Fade Duration of Dual Selection
Combining with Cochannel Interference and Nakagami Fading | cs.IT math.IT | This letter provides closed-form expressions for the outage probability, the
average level crossing rate (LCR) and the average fade duration (AFD) of a dual
diversity selection combining (SC) system exposed to the combined influence of
the cochannel interference (CCI) and the thermal noise (AWGN) in Nakagami
fading c... |
0908.3562 | Another Look at the Physics of Large Deviations With Application to
Rate-Distortion Theory | cs.IT math.IT | We revisit and extend the physical interpretation recently given to a certain
identity between large--deviations rate--functions (as well as applications of
this identity to Information Theory), as an instance of thermal equilibrium
between several physical systems that are brought into contact. Our new
interpretatio... |
0908.3565 | Coverage Optimization using Generalized Voronoi Partition | math.OC cs.SY math.DS | In this paper a generalization of the Voronoi partition is used for optimal
deployment of autonomous agents carrying sensors with heterogeneous
capabilities, to maximize the sensor coverage. The generalized centroidal
Voronoi configuration, in which the agents are located at the centroids of the
corresponding general... |
0908.3574 | In-packet Bloom filters: Design and networking applications | cs.DS cs.IT cs.NI cs.PF math.IT | The Bloom filter (BF) is a well-known space-efficient data structure that
answers set membership queries with some probability of false positives. In an
attempt to solve many of the limitations of current inter-networking
architectures, some recent proposals rely on including small BFs in packet
headers for routing, ... |
0908.3610 | Emergent Network Structure, evolvable Robustness and non-linear Effects
of Point Mutations in an Artificial Genome Model | q-bio.MN cond-mat.dis-nn cs.NE q-bio.GN q-bio.SC | Genetic regulation is a key component in development, but a clear
understanding of the structure and dynamics of genetic networks is not yet at
hand. In this paper we investigate these properties within an artificial genome
model originally introduced by Reil (1999). We analyze statistical properties
of randomly gene... |
0908.3633 | Maximizing profit using recommender systems | cs.CY cs.AI cs.IR | Traditional recommendation systems make recommendations based solely on the
customer's past purchases, product ratings and demographic data without
considering the profitability the items being recommended. In this work we
study the question of how a vendor can directly incorporate the profitability
of items into its... |
0908.3653 | Chaotic Transitions in Wall Following Robots | nlin.CD cs.RO nlin.AO | In this paper we examine how simple agents similar to Braitenberg vehicles
can exhibit chaotic movement patterns. The agents are wall following robots as
described by Steve Mesburger and Alfred Hubler in their paper "Chaos in Wall
Following Robots". These agents uses a simple forward facing distance sensor,
with a li... |
0908.3666 | On the minimal penalty for Markov order estimation | math.PR cs.IT math.IT math.ST stat.TH | We show that large-scale typicality of Markov sample paths implies that the
likelihood ratio statistic satisfies a law of iterated logarithm uniformly to
the same scale. As a consequence, the penalized likelihood Markov order
estimator is strongly consistent for penalties growing as slowly as log log n
when an upper ... |
0908.3670 | Randomized Scheduling Algorithm for Queueing Networks | cs.IT cs.NI math.IT math.PR | There has recently been considerable interest in design of low-complexity,
myopic, distributed and stable scheduling policies for constrained queueing
network models that arise in the context of emerging communication networks.
Here, we consider two representative models. One, a model for the collection of
wireless n... |
0908.3702 | Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding | cs.IT math.IT | In this paper, we present the diversity order analysis of bit-interleaved
coded multiple beamforming (BICMB) combined with the constellation precoding
scheme. Multiple beamforming is realized by singular value decomposition of the
channel matrix which is assumed to be perfectly known to the transmitter as
well as the... |
0908.3706 | Uncovering delayed patterns in noisy and irregularly sampled time
series: an astronomy application | astro-ph.CO astro-ph.IM cs.LG cs.NE | We study the problem of estimating the time delay between two signals
representing delayed, irregularly sampled and noisy versions of the same
underlying pattern. We propose and demonstrate an evolutionary algorithm for
the (hyper)parameter estimation of a kernel-based technique in the context of
an astronomical prob... |
0908.3710 | Randomization for Security in Half-Duplex Two-Way Gaussian Channels | cs.IT cs.CR math.IT | This paper develops a new physical layer framework for secure two-way
wireless communication in the presence of a passive eavesdropper, i.e., Eve.
Our approach achieves perfect information theoretic secrecy via a novel
randomized scheduling and power allocation scheme. The key idea is to allow
Alice and Bob to send s... |
0908.3855 | Gabor wavelet analysis and the fractional Hilbert transform | cs.IT cs.CV math.IT | We propose an amplitude-phase representation of the dual-tree complex wavelet
transform (DT-CWT) which provides an intuitive interpretation of the associated
complex wavelet coefficients. The representation, in particular, is based on
the shifting action of the group of fractional Hilbert transforms (fHT) which
allow... |
0908.3861 | Fast adaptive elliptical filtering using box splines | cs.IT cs.CV math.IT | We demonstrate that it is possible to filter an image with an elliptic window
of varying size, elongation and orientation with a fixed computational cost per
pixel. Our method involves the application of a suitable global pre-integrator
followed by a pointwise-adaptive localization mesh. We present the basic theory
f... |
0908.3886 | Cooperative Routing for Wireless Networks using Mutual-Information
Accumulation | cs.IT math.IT | Cooperation between the nodes of wireless multihop networks can increase
communication reliability, reduce energy consumption, and decrease latency. The
possible improvements are even greater when nodes perform mutual information
accumulation using rateless codes. In this paper, we investigate routing
problems in suc... |
0908.3902 | On the Expressiveness of Line Drawings | cs.OH cs.NE | Can expressiveness of a drawing be traced with a computer? In this study a
neural network (perceptron) and a support vector machine are used to classify
line drawings. To do this the line drawings are attributed values according to
a kinematic model and a diffusion model for the lines they consist of. The
values for ... |
0908.3929 | A Dynamic Boundary Guarding Problem with Translating Targets | cs.RO | We introduce a problem in which a service vehicle seeks to guard a deadline
(boundary) from dynamically arriving mobile targets. The environment is a
rectangle and the deadline is one of its edges. Targets arrive continuously
over time on the edge opposite the deadline, and move towards the deadline at a
fixed speed.... |
0908.3957 | Enhancing XML Data Warehouse Query Performance by Fragmentation | cs.DB | XML data warehouses form an interesting basis for decision-support
applications that exploit heterogeneous data from multiple sources. However,
XML-native database systems currently suffer from limited performances in terms
of manageable data volume and response time for complex analytical queries.
Fragmenting and di... |
0908.3982 | Distributed Source Coding for Correlated Memoryless Gaussian Sources | cs.IT math.IT | We consider a distributed source coding problem of $L$ correlated Gaussian
observations $Y_i, i=1,2,...,L$. We assume that the random vector
$Y^{L}={}^{\rm t} (Y_1,Y_2,$ $...,Y_L)$ is an observation of the Gaussian
random vector $X^K={}^{\rm t}(X_1,X_2,...,X_K)$, having the form $Y^L=AX^K+N^L
,$ where $A$ is a $L\tim... |
0908.3999 | An improved axiomatic definition of information granulation | cs.AI | To capture the uncertainty of information or knowledge in information
systems, various information granulations, also known as knowledge
granulations, have been proposed. Recently, several axiomatic definitions of
information granulation have been introduced. In this paper, we try to improve
these axiomatic definitio... |
0908.4051 | Training-Based Schemes are Suboptimal for High Rate Asynchronous
Communication | cs.IT math.IT | We consider asynchronous point-to-point communication. Building on a recently
developed model, we show that training based schemes, i.e., communication
strategies that separate synchronization from information transmission, perform
suboptimally at high rate.
|
0908.4073 | Distributed Averaging via Lifted Markov Chains | cs.IT cs.DC math.IT math.PR | Motivated by applications of distributed linear estimation, distributed
control and distributed optimization, we consider the question of designing
linear iterative algorithms for computing the average of numbers in a network.
Specifically, our interest is in designing such an algorithm with the fastest
rate of conve... |
0908.4074 | Retrieval of Remote Sensing Images Using Colour and Texture Attribute | cs.IR cs.MM | Grouping images into semantically meaningful categories using low-level
visual feature is a challenging and important problem in content-based image
retrieval. The groupings can be used to build effective indices for an image
database. Digital image analysis techniques are being used widely in remote
sensing assuming... |
0908.4094 | Codes in Permutations and Error Correction for Rank Modulation | cs.IT math.IT | Codes for rank modulation have been recently proposed as a means of
protecting flash memory devices from errors. We study basic coding theoretic
problems for such codes, representing them as subsets of the set of
permutations of $n$ elements equipped with the Kendall tau distance. We derive
several lower and upper bo... |
0908.4144 | ABC-LogitBoost for Multi-class Classification | cs.LG cs.AI | We develop abc-logitboost, based on the prior work on abc-boost and robust
logitboost. Our extensive experiments on a variety of datasets demonstrate the
considerable improvement of abc-logitboost over logitboost and abc-mart.
|
0908.4208 | Performance Analysis over Slow Fading Channels of a Half-Duplex
Single-Relay Protocol: Decode or Quantize and Forward | cs.IT math.IT | In this work, a new static relaying protocol is introduced for half duplex
single-relay networks, and its performance is studied in the context of
communications over slow fading wireless channels. The proposed protocol is
based on a Decode or Quantize and Forward (DoQF) approach. In slow fading
scenarios, two perfor... |
0908.4211 | Coding Improves the Throughput-Delay Trade-off in Mobile Wireless
Networks | cs.IT math.IT | We study the throughput-delay performance tradeoff in large-scale wireless ad
hoc networks. It has been shown that the per source-destination pair throughput
can be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed to
move and a 2-hop relay scheme is employed. The price paid for such an
improvemen... |
0908.4265 | Channel Protection: Random Coding Meets Sparse Channels | cs.IT math.IT math.OC | Multipath interference is an ubiquitous phenomenon in modern communication
systems. The conventional way to compensate for this effect is to equalize the
channel by estimating its impulse response by transmitting a set of training
symbols. The primary drawback to this type of approach is that it can be
unreliable if ... |
0908.4290 | Bridging the Gap between Crisis Response Operations and Systems | cs.CY cs.MA | There exist huge problems in the current practice of crisis response
operations. Response problems are projected as a combination of failure in
communication, failure in technology, failure in methodology, failure of
management, and finally failure of observation. In this paper we compare eight
crisis response system... |
0908.4310 | Co-occurrence Matrix and Fractal Dimension for Image Segmentation | stat.AP cs.CV | One of the most important tasks in image processing problem and machine
vision is object recognition, and the success of many proposed methods relies
on a suitable choice of algorithm for the segmentation of an image. This paper
focuses on how to apply texture operators based on the concept of fractal
dimension and c... |
0908.4386 | Handwritten Farsi Character Recognition using Artificial Neural Network | cs.CV | Neural Networks are being used for character recognition from last many years
but most of the work was confined to English character recognition. Till date,
a very little work has been reported for Handwritten Farsi Character
recognition. In this paper, we have made an attempt to recognize handwritten
Farsi character... |
0908.4413 | Multiple Retrieval Models and Regression Models for Prior Art Search | cs.CL | This paper presents the system called PATATRAS (PATent and Article Tracking,
Retrieval and AnalysiS) realized for the IP track of CLEF 2009. Our approach
presents three main characteristics: 1. The usage of multiple retrieval models
(KL, Okapi) and term index definitions (lemma, phrase, concept) for the three
languag... |
0908.4419 | Distributed Flooding-based Storage Algorithms for Large-scale Sensor
Networks | cs.IT cs.NI math.IT | In this paper we propose distributed flooding-based storage algorithms for
large-scale wireless sensor networks. Assume a wireless sensor network with $n$
nodes that have limited power, memory, and bandwidth. Each node is capable of
both sensing and storing data. Such sensor nodes might disappear from the
network due... |
0908.4427 | Mesh Algorithms for PDE with Sieve I: Mesh Distribution | cs.CE cs.MS | We have developed a new programming framework, called Sieve, to support
parallel numerical PDE algorithms operating over distributed meshes. We have
also developed a reference implementation of Sieve in C++ as a library of
generic algorithms operating on distributed containers conforming to the Sieve
interface. Sieve... |
0908.4431 | An OLAC Extension for Dravidian Languages | cs.CL | OLAC was founded in 2000 for creating online databases of language resources.
This paper intends to review the bottom-up distributed character of the project
and proposes an extension of the architecture for Dravidian languages. An
ontological structure is considered for effective natural language processing
(NLP) an... |
0908.4445 | Asymptotic Equipartition Property of Output when Rate is above Capacity | cs.IT math.IT | The output distribution, when rate is above capacity, is investigated. It is
shown that there is an asymptotic equipartition property (AEP) of the typical
output sequences, independently of the specific codebook used, as long as the
codebook is typical according to the standard random codebook generation. This
equipa... |
0908.4457 | Additivity of on-line decision complexity is violated by a linear term
in the length of a binary string | cs.IT math.IT | We show that there are infinitely many binary strings z, such that the sum of
the on-line decision complexity of predicting the even bits of z given the
previous uneven bits, and the decision complexity of predicting the uneven bits
given the previous event bits, exceeds the Kolmogorov complexity of z by a
linear ter... |
0908.4464 | The eel-like robot | cs.RO physics.class-ph | The aim of this project is to design, study and build an "eel-like robot"
prototype able to swim in three dimensions. The study is based on the analysis
of eel swimming and results in the realization of a prototype with 12
vertebrae, a skin and a head with two fins. To reach these objectives, a
multidisciplinary grou... |
0908.4494 | Learning, complexity and information density | cs.IT cs.CC math.IT math.PR | What is the relationship between the complexity of a learner and the
randomness of his mistakes? This question was posed in \cite{rat0903} who
showed that the more complex the learner the higher the possibility that his
mistakes deviate from a true random sequence. In the current paper we report on
an empirical inves... |
0908.4580 | A Computational View of Market Efficiency | cs.CE cs.CC q-fin.TR | We propose to study market efficiency from a computational viewpoint.
Borrowing from theoretical computer science, we define a market to be
\emph{efficient with respect to resources $S$} (e.g., time, memory) if no
strategy using resources $S$ can make a profit. As a first step, we consider
memory-$m$ strategies whose... |
0909.0067 | Bilinear biorthogonal expansions and the Dunkl kernel on the real line | math.FA cs.IT math.IT | We study an extension of the classical Paley-Wiener space structure, which is
based on bilinear expansions of integral kernels into biorthogonal sequences of
functions. The structure includes both sampling expansions and Fourier-Neumann
type series as special cases, and it also provides a bilinear expansion for the
D... |
0909.0105 | Concatenated Coding for the AWGN Channel with Noisy Feedback | cs.IT math.IT | The use of open-loop coding can be easily extended to a closed-loop
concatenated code if the channel has access to feedback. This can be done by
introducing a feedback transmission scheme as an inner code. In this paper,
this process is investigated for the case when a linear feedback scheme is
implemented as an inne... |
0909.0108 | On the optimal design of parallel robots taking into account their
deformations and natural frequencies | cs.RO | This paper discusses the utility of using simple stiffness and vibrations
models, based on the Jacobian matrix of a manipulator and only the rigidity of
the actuators, whenever its geometry is optimised. In many works, these
simplified models are used to propose optimal design of robots. However, the
elasticity of th... |
0909.0109 | On the Internal Topological Structure of Plane Regions | cs.AI cs.CG | The study of topological information of spatial objects has for a long time
been a focus of research in disciplines like computational geometry, spatial
reasoning, cognitive science, and robotics. While the majority of these
researches emphasised the topological relations between spatial objects, this
work studies th... |
0909.0118 | Dynamic Multimedia Content Retrieval System in Distributed Environment | cs.MM cs.IR | WiCoM enables remote management of web resources. Our application Mobile
reporter is aimed at Journalist, who will be able to capture the events in
real-time using their mobile phones and update their web server on the latest
event. WiCoM has been developed using J2ME technology on the client side and
PHP on the serv... |
0909.0122 | Reasoning with Topological and Directional Spatial Information | cs.AI | Current research on qualitative spatial representation and reasoning mainly
focuses on one single aspect of space. In real world applications, however,
multiple spatial aspects are often involved simultaneously.
This paper investigates problems arising in reasoning with combined
topological and directional informat... |
0909.0138 | Reasoning about Cardinal Directions between Extended Objects | cs.AI | Direction relations between extended spatial objects are important
commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model,
known as Cardinal Direction Calculus (CDC), for representing direction
relations between connected plane regions. CDC is perhaps the most expressive
qualitative calculus for... |
0909.0173 | A theory of intelligence: networked problem solving in animal societies | cs.AI nlin.AO | A society's single emergent, increasing intelligence arises partly from the
thermodynamic advantages of networking the innate intelligence of different
individuals, and partly from the accumulation of solved problems. Economic
growth is proportional to the square of the network entropy of a society's
population times... |
0909.0206 | Geometry of the Welch Bounds | cs.IT math.IT | A geometric perspective involving Grammian and frame operators is used to
derive the entire family of Welch bounds. This perspective unifies a number of
observations that have been made regarding tightness of the bounds and their
connections to symmetric k-tensors, tight frames, homogeneous polynomials, and
t-designs... |
0909.0247 | An Enhanced Static Data Compression Scheme Of Bengali Short Message | cs.IT math.IT | This paper concerns a modified approach of compressing Short Bengali Text
Message for small devices. The prime objective of this research technique is to
establish a low complexity compression scheme suitable for small devices having
small memory and relatively lower processing speed. The basic aim is not to
compress... |
0909.0251 | Channel Equalization in Digital Transmission | cs.IT math.IT | Channel equalization is the process of reducing amplitude, frequency and
phase distortion in a radio channel with the intent of improving transmission
performance. Different types of equalizers, their applications and some
practical example is given. Especially, in the digital communication scenario
how equalization ... |
0909.0400 | Rare-Allele Detection Using Compressed Se(que)nsing | q-bio.GN cs.IT cs.LG math.IT q-bio.QM stat.AP stat.ML | Detection of rare variants by resequencing is important for the
identification of individuals carrying disease variants. Rapid sequencing by
new technologies enables low-cost resequencing of target regions, although it
is still prohibitive to test more than a few individuals. In order to improve
cost trade-offs, it h... |
0909.0442 | Kinematic analysis of a class of analytic planar 3-RPR parallel
manipulators | cs.RO | A class of analytic planar 3-RPR manipulators is analyzed in this paper.
These manipulators have congruent base and moving platforms and the moving
platform is rotated of 180 deg about an axis in the plane. The forward
kinematics is reduced to the solution of a 3rd-degree polynomial and a
quadratic equation in sequen... |
0909.0481 | Scale-Based Gaussian Coverings: Combining Intra and Inter Mixture Models
in Image Segmentation | cs.CV | By a "covering" we mean a Gaussian mixture model fit to observed data.
Approximations of the Bayes factor can be availed of to judge model fit to the
data within a given Gaussian mixture model. Between families of Gaussian
mixture models, we propose the R\'enyi quadratic entropy as an excellent and
tractable model co... |
0909.0553 | A New Approach to Random Access: Reliable Communication and Reliable
Collision Detection | cs.IT math.IT | This paper applies Information Theoretic analysis to packet-based random
multiple access communication systems. A new channel coding approach is
proposed for coding within each data packet with built-in support for bursty
traffic properties, such as message underflow, and for random access
properties, such as packet ... |
0909.0555 | Reduced Complexity Sphere Decoding | cs.IT math.IT | In Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can
achieve performance equivalent to full search Maximum Likelihood (ML) decoding,
with reduced complexity. Several researchers reported techniques that reduce
the complexity of SD further. In this paper, a new technique is introduced
which decre... |
0909.0572 | A Method for Accelerating the HITS Algorithm | cs.IR | We present a new method to accelerate the HITS algorithm by exploiting
hyperlink structure of the web graph. The proposed algorithm extends the idea
of authority and hub scores from HITS by introducing two diagonal matrices
which contain constants that act as weights to make authority pages more
authoritative and hub... |
0909.0588 | Receding horizon decoding of convolutional codes | cs.IT math.IT math.OC | Decoding of convolutional codes poses a significant challenge for coding
theory. Classical methods, based on e.g. Viterbi decoding, suffer from being
computationally expensive and are restricted therefore to codes of small
complexity. Based on analogies with model predictive optimal control, we
propose a new iterativ... |
0909.0599 | Codebook Design Method for Noise Robust Speaker Identification based on
Genetic Algorithm | cs.SD cs.NE | In this paper, a novel method of designing a codebook for noise robust
speaker identification purpose utilizing Genetic Algorithm has been proposed.
Wiener filter has been used to remove the background noises from the source
speech utterances. Speech features have been extracted using standard speech
parameterization... |
0909.0611 | Effects of Mechanical Coupling on the Dynamics of Balancing Tasks | cs.CE | Coupled human balancing tasks are investigated based on both pseudo-neural
controllers characterized by time-delayed feedback with random gain and natural
human balancing tasks. It is shown numerically that, compared to single
balancing tasks, balancing tasks coupled by mechanical structures exhibit
enhanced stabilit... |
0909.0635 | Advances in Feature Selection with Mutual Information | cs.LG cs.IT math.IT | The selection of features that are relevant for a prediction or
classification problem is an important problem in many domains involving
high-dimensional data. Selecting features helps fighting the curse of
dimensionality, improving the performances of prediction or classification
methods, and interpreting the applic... |
0909.0638 | Median topographic maps for biomedical data sets | cs.LG q-bio.QM | Median clustering extends popular neural data analysis methods such as the
self-organizing map or neural gas to general data structures given by a
dissimilarity matrix only. This offers flexible and robust global data
inspection methods which are particularly suited for a variety of data as
occurs in biomedical domai... |
0909.0641 | Monotonicity, thinning and discrete versions of the Entropy Power
Inequality | cs.IT math.IT | We consider the entropy of sums of independent discrete random variables, in
analogy with Shannon's Entropy Power Inequality, where equality holds for
normals. In our case, infinite divisibility suggests that equality should hold
for Poisson variables. We show that some natural analogues of the Entropy Power
Inequali... |
0909.0682 | On Planning with Preferences in HTN | cs.AI | In this paper, we address the problem of generating preferred plans by
combining the procedural control knowledge specified by Hierarchical Task
Networks (HTNs) with rich qualitative user preferences. The outcome of our work
is a language for specifyin user preferences, tailored to HTN planning,
together with a prova... |
0909.0685 | In-Network Outlier Detection in Wireless Sensor Networks | cs.DB cs.NI | To address the problem of unsupervised outlier detection in wireless sensor
networks, we develop an approach that (1) is flexible with respect to the
outlier definition, (2) computes the result in-network to reduce both bandwidth
and energy usage,(3) only uses single hop communication thus permitting very
simple node... |
0909.0704 | Concentric Permutation Source Codes | cs.IT math.IT | Permutation codes are a class of structured vector quantizers with a
computationally-simple encoding procedure based on sorting the scalar
components. Using a codebook comprising several permutation codes as subcodes
preserves the simplicity of encoding while increasing the number of
rate-distortion operating points,... |
0909.0737 | Efficient algorithms for training the parameters of hidden Markov models
using stochastic expectation maximization EM training and Viterbi training | q-bio.QM cs.LG q-bio.GN | Background: Hidden Markov models are widely employed by numerous
bioinformatics programs used today. Applications range widely from comparative
gene prediction to time-series analyses of micro-array data. The parameters of
the underlying models need to be adjusted for specific data sets, for example
the genome of a p... |
0909.0760 | Optimizing Orthogonal Multiple Access based on Quantized Channel State
Information | cs.IT math.IT | The performance of systems where multiple users communicate over wireless
fading links benefits from channel-adaptive allocation of the available
resources. Different from most existing approaches that allocate resources
based on perfect channel state information, this work optimizes channel
scheduling along with per... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.