id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0705.4676 | Recursive n-gram hashing is pairwise independent, at best | cs.DB cs.CL | Many applications use sequences of n consecutive symbols (n-grams). Hashing
these n-grams can be a performance bottleneck. For more speed, recursive hash
families compute hash values by updating previous values. We prove that
recursive hash families cannot be more than pairwise independent. While hashing
by irreducib... |
0706.0022 | Modeling Computations in a Semantic Network | cs.AI | Semantic network research has seen a resurgence from its early history in the
cognitive sciences with the inception of the Semantic Web initiative. The
Semantic Web effort has brought forth an array of technologies that support the
encoding, storage, and querying of the semantic network data structure at the
world st... |
0706.0225 | On the End-to-End Distortion for a Buffered Transmission over Fading
Channel | cs.IT math.IT | In this paper, we study the end-to-end distortion/delay tradeoff for a
analogue source transmitted over a fading channel. The analogue source is
quantized and stored in a buffer until it is transmitted. There are two extreme
cases as far as buffer delay is concerned: no delay and infinite delay. We
observe that there... |
0706.0280 | Multi-Agent Modeling Using Intelligent Agents in the Game of Lerpa | cs.MA cs.GT | Game theory has many limitations implicit in its application. By utilizing
multiagent modeling, it is possible to solve a number of problems that are
unsolvable using traditional game theory. In this paper reinforcement learning
is applied to neural networks to create intelligent agents
|
0706.0300 | Automatic Detection of Pulmonary Embolism using Computational
Intelligence | cs.CV | This article describes the implementation of a system designed to
automatically detect the presence of pulmonary embolism in lung scans. These
images are firstly segmented, before alignment and feature extraction using
PCA. The neural network was trained using the Hybrid Monte Carlo method,
resulting in a committee o... |
0706.0323 | Multiplication of free random variables and the S-transform: the case of
vanishing mean | math.OA cs.IT math.IT math.PR | This note extends Voiculescu's S-transform based analytical machinery for
free multiplicative convolution to the case where the mean of the probability
measures vanishes. We show that with the right interpretation of the
S-transform in the case of vanishing mean, the usual formula makes perfectly
good sense.
|
0706.0457 | Challenges and Opportunities of Evolutionary Robotics | cs.NE cs.RO | Robotic hardware designs are becoming more complex as the variety and number
of on-board sensors increase and as greater computational power is provided in
ever-smaller packages on-board robots. These advances in hardware, however, do
not automatically translate into better software for controlling complex
robots. Ev... |
0706.0465 | Virtual Sensor Based Fault Detection and Classification on a Plasma Etch
Reactor | cs.AI cs.CV | The SEMATECH sponsored J-88-E project teaming Texas Instruments with
NeuroDyne (et al.) focused on Fault Detection and Classification (FDC) on a Lam
9600 aluminum plasma etch reactor, used in the process of semiconductor
fabrication. Fault classification was accomplished by implementing a series of
virtual sensor mod... |
0706.0534 | Compressed Regression | stat.ML cs.IT math.IT | Recent research has studied the role of sparsity in high dimensional
regression and signal reconstruction, establishing theoretical limits for
recovering sparse models from sparse data. This line of work shows that
$\ell_1$-regularized least squares regression can accurately estimate a sparse
linear model from $n$ no... |
0706.0585 | A Novel Model of Working Set Selection for SMO Decomposition Methods | cs.LG cs.AI | In the process of training Support Vector Machines (SVMs) by decomposition
methods, working set selection is an important technique, and some exciting
schemes were employed into this field. To improve working set selection, we
propose a new model for working set selection in sequential minimal
optimization (SMO) deco... |
0706.0682 | Code spectrum and reliability function: Gaussian channel | cs.IT math.IT | A new approach for upper bounding the channel reliability function using the
code spectrum is described. It allows to treat both low and high rate cases in
a unified way. In particular, the earlier known upper bounds are improved, and
a new derivation of the sphere-packing bound is presented.
|
0706.0685 | Non-Parametric Field Estimation using Randomly Deployed, Noisy, Binary
Sensors | cs.IT math.IT | The reconstruction of a deterministic data field from binary-quantized noisy
observations of sensors which are randomly deployed over the field domain is
studied. The study focuses on the extremes of lack of deterministic control in
the sensor deployment, lack of knowledge of the noise distribution, and lack of
sensi... |
0706.0720 | Universal Quantile Estimation with Feedback in the
Communication-Constrained Setting | cs.IT math.IT | We consider the following problem of decentralized statistical inference:
given i.i.d. samples from an unknown distribution, estimate an arbitrary
quantile subject to limits on the number of bits exchanged. We analyze a
standard fusion-based architecture, in which each of $m$ sensors transmits a
single bit to the fus... |
0706.0869 | Position Coding | cs.IT math.CO math.IT | A position coding pattern is an array of symbols in which subarrays of a
certain fixed size appear at most once. So, each subarray uniquely identifies a
location in the larger array, which means there is a bijection of some sort
from this set of subarrays to a set of coordinates. The key to Fly Pentop
Computer paper ... |
0706.0870 | Inferring the Composition of a Trader Population in a Financial Market | cs.CE nlin.AO | We discuss a method for predicting financial movements and finding pockets of
predictability in the price-series, which is built around inferring the
heterogeneity of trading strategies in a multi-agent trader population. This
work explores extensions to our previous framework (arXiv:physics/0506134).
Here we allow f... |
0706.1001 | Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets | cs.GT cs.AI | We provide here an epistemic analysis of arbitrary strategic games based on
the possibility correspondences. Such an analysis calls for the use of
transfinite iterations of the corresponding operators. Our approach is based on
Tarski's Fixpoint Theorem and applies both to the notions of rationalizability
and the iter... |
0706.1051 | Improved Neural Modeling of Real-World Systems Using Genetic Algorithm
Based Variable Selection | cs.NE | Neural network models of real-world systems, such as industrial processes,
made from sensor data must often rely on incomplete data. System states may not
all be known, sensor data may be biased or noisy, and it is not often known
which sensor data may be useful for predictive modelling. Genetic algorithms
may be use... |
0706.1061 | Design, Implementation, and Cooperative Coevolution of an Autonomous/
Teleoperated Control System for a Serpentine Robotic Manipulator | cs.NE cs.RO | Design, implementation, and machine learning issues associated with
developing a control system for a serpentine robotic manipulator are explored.
The controller developed provides autonomous control of the serpentine robotic
manipulatorduring operation of the manipulator within an enclosed environment
such as an und... |
0706.1119 | Cointegration of the Daily Electric Power System Load and the Weather | cs.CE | The paper makes a thermal predictive analysis of the electric power system
security for a day ahead. This predictive analysis is set as a thermal
computation of the expected security. This computation is obtained by
cointegrating the daily electric power systen load and the weather, by finding
the daily electric powe... |
0706.1137 | Automatically Restructuring Practice Guidelines using the GEM DTD | 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... |
0706.1169 | Vector Precoding for Wireless MIMO Systems: A Replica Analysis | cs.IT cond-mat.stat-mech math.IT | We apply the replica method to analyze vector precoding, a method to reduce
transmit power in antenna array communications. The analysis applies to a very
general class of channel matrices. The statistics of the channel matrix enter
the transmitted energy per symbol via its R-transform. We find that vector
precoding ... |
0706.1179 | Collaborative product and process model: Multiple Viewpoints approach | cs.OH cs.IR | The design and development of complex products invariably involves many
actors who have different points of view on the problem they are addressing,
the product being developed, and the process by which it is being developed.
The actors' viewpoints approach was designed to provide an organisational
framework in which... |
0706.1290 | Temporal Reasoning without Transitive Tables | cs.AI | Representing and reasoning about qualitative temporal information is an
essential part of many artificial intelligence tasks. Lots of models have been
proposed in the litterature for representing such temporal information. All
derive from a point-based or an interval-based framework. One fundamental
reasoning task th... |
0706.1399 | Duality and Stability Regions of Multi-rate Broadcast and Multiple
Access Networks | cs.IT math.IT | We characterize stability regions of two-user fading Gaussian multiple access
(MAC) and broadcast (BC) networks with centralized scheduling. The data to be
transmitted to the users is encoded into codewords of fixed length. The rates
of the codewords used are restricted to a fixed set of finite cardinality. With
succ... |
0706.1410 | Evolutionary Mesh Numbering: Preliminary Results | cs.NA cs.NE math.NA math.OC | Mesh numbering is a critical issue in Finite Element Methods, as the
computational cost of one analysis is highly dependent on the order of the
nodes of the mesh. This paper presents some preliminary investigations on the
problem of mesh numbering using Evolutionary Algorithms. Three conclusions can
be drawn from the... |
0706.1588 | Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency | cs.IT math.IT | The problem of hypothesis testing against independence for a Gauss-Markov
random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an
expression for the log-likelihood ratio of detection is derived. Assuming
random placement of nodes over a large region according to the Poisson or
uniform distribution a... |
0706.1700 | Information Criteria and Arithmetic Codings : An Illustration on Raw
Images | cs.IT math.IT | In this paper we give a short theoretical description of the general
predictive adaptive arithmetic coding technique. The links between this
technique and the works of J. Rissanen in the 80's, in particular the BIC
information criterion used in parametrical model selection problems, are
established. We also design lo... |
0706.1716 | Modeling and analysis using hybrid Petri nets | cs.IT math.IT | This paper is devoted to the use of hybrid Petri nets (PNs) for modeling and
control of hybrid dynamic systems (HDS). Modeling, analysis and control of HDS
attract ever more of researchers' attention and several works have been devoted
to these topics. We consider in this paper the extensions of the PN formalism
(ini... |
0706.1751 | MacWilliams Identity for Codes with the Rank Metric | cs.IT math.IT | The MacWilliams identity, which relates the weight distribution of a code to
the weight distribution of its dual code, is useful in determining the weight
distribution of codes. In this paper, we derive the MacWilliams identity for
linear codes with the rank metric, and our identity has a different form than
that by ... |
0706.1860 | FIPA-based Interoperable Agent Mobility Proposal | cs.MA cs.NI | This paper presents a proposal for a flexible agent mobility architecture
based on IEEE-FIPA standards and intended to be one of them. This proposal is a
first step towards interoperable mobility mechanisms, which are needed for
future agent migration between different kinds of platforms. Our proposal is
presented as... |
0706.1926 | Towards understanding and modelling office daily life | cs.CV cs.CY | Measuring and modeling human behavior is a very complex task. In this paper
we present our initial thoughts on modeling and automatic recognition of some
human activities in an office. We argue that to successfully model human
activities, we need to consider both individual behavior and group dynamics. To
demonstrate... |
0706.2033 | Power Allocation for Discrete-Input Delay-Limited Fading Channels | cs.IT math.IT | We consider power allocation algorithms for fixed-rate transmission over
Nakagami-m non-ergodic block-fading channels with perfect transmitter and
receiver channel state information and discrete input signal constellations,
under both short- and long-term power constraints. Optimal power allocation
schemes are shown ... |
0706.2040 | Getting started in probabilistic graphical models | q-bio.QM cs.LG physics.soc-ph stat.ME stat.ML | Probabilistic graphical models (PGMs) have become a popular tool for
computational analysis of biological data in a variety of domains. But, what
exactly are they and how do they work? How can we use PGMs to discover patterns
that are biologically relevant? And to what extent can PGMs help us formulate
new hypotheses... |
0706.2310 | Space-time coding techniques with bit-interleaved coded modulations for
MIMO block-fading channels | cs.IT math.IT | The space-time bit-interleaved coded modulation (ST-BICM) is an efficient
technique to obtain high diversity and coding gain on a block-fading MIMO
channel. Its maximum-likelihood (ML) performance is computed under ideal
interleaving conditions, which enables a global optimization taking into
account channel coding. ... |
0706.2331 | Pricing American Options for Jump Diffusions by Iterating Optimal
Stopping Problems for Diffusions | cs.CE | We approximate the price of the American put for jump diffusions by a
sequence of functions, which are computed iteratively. This sequence converges
to the price function uniformly and exponentially fast. Each element of the
approximating sequence solves an optimal stopping problem for geometric
Brownian motion, and ... |
0706.2434 | Interference and Outage in Clustered Wireless Ad Hoc Networks | cs.IT math.IT | In the analysis of large random wireless networks, the underlying node
distribution is almost ubiquitously assumed to be the homogeneous Poisson point
process. In this paper, the node locations are assumed to form a Poisson
clustered process on the plane. We derive the distributional properties of the
interference an... |
0706.2746 | Abstract Storage Devices | cs.DM cs.CC cs.IT math.IT | A quantum storage device differs radically from a conventional physical
storage device. Its state can be set to any value in a certain (infinite) state
space, but in general every possible read operation yields only partial
information about the stored state.
The purpose of this paper is to initiate the study of a ... |
0706.2795 | Dirty-paper Coding without Channel Information at the Transmitter and
Imperfect Estimation at the Receiver | cs.IT math.IT | In this paper, we examine the effects of imperfect channel estimation at the
receiver and no channel knowledge at the transmitter on the capacity of the
fading Costa's channel with channel state information non-causally known at the
transmitter. We derive the optimal Dirty-paper coding (DPC) scheme and its
correspond... |
0706.2797 | Extraction d'entit\'es dans des collections \'evolutives | cs.IR | The goal of our work is to use a set of reports and extract named entities,
in our case the names of Industrial or Academic partners. Starting with an
initial list of entities, we use a first set of documents to identify syntactic
patterns that are then validated in a supervised learning phase on a set of
annotated d... |
0706.2809 | On the Outage Capacity of a Practical Decoder Using Channel Estimation
Accuracy | cs.IT math.IT | The optimal decoder achieving the outage capacity under imperfect channel
estimation is investigated. First, by searching into the family of nearest
neighbor decoders, which can be easily implemented on most practical coded
modulation systems, we derive a decoding metric that minimizes the average of
the transmission... |
0706.2906 | Capacity Scaling for MIMO Two-Way Relaying | cs.IT math.IT | A multiple input multiple output (MIMO) two-way relay channel is considered,
where two sources want to exchange messages with each other using multiple
relay nodes, and both the sources and relay nodes are equipped with multiple
antennas. Both the sources are assumed to have equal number of antennas and
have perfect ... |
0706.2926 | Reducing the Error Floor | cs.IT math.IT | We discuss how the loop calculus approach of [Chertkov, Chernyak '06],
enhanced by the pseudo-codeword search algorithm of [Chertkov, Stepanov '06]
and the facet-guessing idea from [Dimakis, Wainwright '06], improves decoding
of graph based codes in the error-floor domain. The utility of the new, Linear
Programming b... |
0706.2963 | Outage Behavior of Discrete Memoryless Channels Under Channel Estimation
Errors | cs.IT math.IT | Classically, communication systems are designed assuming perfect channel
state information at the receiver and/or transmitter. However, in many
practical situations, only an estimate of the channel is available that differs
from the true channel. We address this channel mismatch scenario by using the
notion of estima... |
0706.3009 | Application of a design space exploration tool to enhance interleaver
generation | cs.AR cs.IT math.IT | This paper presents a methodology to efficiently explore the design space of
communication adapters. In most digital signal processing (DSP) applications,
the overall performance of the system is significantly affected by
communication architectures, as a consequence the designers need specifically
optimized adapters... |
0706.3060 | N-Body Simulations on GPUs | cs.CE cs.DC | Commercial graphics processors (GPUs) have high compute capacity at very low
cost, which makes them attractive for general purpose scientific computing. In
this paper we show how graphics processors can be used for N-body simulations
to obtain improvements in performance over current generation CPUs. We have
develope... |
0706.3104 | Group Testing with Random Pools: optimal two-stage algorithms | cs.DS cond-mat.dis-nn cond-mat.stat-mech cs.IT math.IT | We study Probabilistic Group Testing of a set of N items each of which is
defective with probability p. We focus on the double limit of small defect
probability, p<<1, and large number of variables, N>>1, taking either p->0
after $N\to\infty$ or $p=1/N^{\beta}$ with $\beta\in(0,1/2)$. In both settings
the optimal num... |
0706.3129 | Closed-Form Density of States and Localization Length for a
Non-Hermitian Disordered System | cond-mat.dis-nn cond-mat.stat-mech cs.IT math.IT nlin.SI | We calculate the Lyapunov exponent for the non-Hermitian Zakharov-Shabat
eigenvalue problem corresponding to the attractive non-linear Schroedinger
equation with a Gaussian random pulse as initial value function. Using an
extension of the Thouless formula to non-Hermitian random operators, we
calculate the correspond... |
0706.3170 | Asymptotic Analysis of General Multiuser Detectors in MIMO DS-CDMA
Channels | cs.IT math.IT | We analyze a MIMO DS-CDMA channel with a general multiuser detector including
a nonlinear multiuser detector, using the replica method. In the many-user,
limit the MIMO DS-CDMA channel with the multiuser detector is decoupled into a
bank of single-user SIMO Gaussian channels if a spatial spreading scheme is
employed.... |
0706.3188 | A tutorial on conformal prediction | cs.LG stat.ML | Conformal prediction uses past experience to determine precise levels of
confidence in new predictions. Given an error probability $\epsilon$, together
with a method that makes a prediction $\hat{y}$ of a label $y$, it produces a
set of labels, typically containing $\hat{y}$, that also contains $y$ with
probability $... |
0706.3295 | Lower bounds on the minimum average distance of binary codes | cs.IT math.CO math.IT | New lower bounds on the minimum average Hamming distance of binary codes are
derived. The bounds are obtained using linear programming approach.
|
0706.3430 | The Impact of Channel Feedback on Opportunistic Relay Selection for
Hybrid-ARQ in Wireless Networks | cs.IT math.IT | This paper presents a decentralized relay selection protocol for a dense
wireless network and describes channel feedback strategies that improve its
performance. The proposed selection protocol supports hybrid
automatic-repeat-request transmission where relays forward parity information
to the destination in the even... |
0706.3480 | Tight Bounds on the Average Length, Entropy, and Redundancy of
Anti-Uniform Huffman Codes | cs.IT math.IT | In this paper we consider the class of anti-uniform Huffman codes and derive
tight lower and upper bounds on the average length, entropy, and redundancy of
such codes in terms of the alphabet size of the source. The Fibonacci
distributions are introduced which play a fundamental role in AUH codes. It is
shown that su... |
0706.3502 | Approximately-Universal Space-Time Codes for the Parallel, Multi-Block
and Cooperative-Dynamic-Decode-and-Forward Channels | cs.IT cs.DM cs.NI math.IT | Explicit codes are constructed that achieve the diversity-multiplexing gain
tradeoff of the cooperative-relay channel under the dynamic decode-and-forward
protocol for any network size and for all numbers of transmit and receive
antennas at the relays.
A particularly simple code construction that makes use of the A... |
0706.3639 | A Collection of Definitions of Intelligence | cs.AI | This paper is a survey of a large number of informal definitions of
``intelligence'' that the authors have collected over the years. Naturally,
compiling a complete list would be impossible as many definitions of
intelligence are buried deep inside articles and books. Nevertheless, the
70-odd definitions presented he... |
0706.3679 | Scale-sensitive Psi-dimensions: the Capacity Measures for Classifiers
Taking Values in R^Q | cs.LG | Bounds on the risk play a crucial role in statistical learning theory. They
usually involve as capacity measure of the model studied the VC dimension or
one of its extensions. In classification, such "VC dimensions" exist for models
taking values in {0, 1}, {1,..., Q} and R. We introduce the generalizations
appropria... |
0706.3710 | Optimal Constellations for the Low SNR Noncoherent MIMO Block Rayleigh
Fading Channel | cs.IT math.IT | Reliable communication over the discrete-input/continuous-output noncoherent
multiple-input multiple-output (MIMO) Rayleigh block fading channel is
considered when the signal-to-noise ratio (SNR) per degree of freedom is low.
Two key problems are posed and solved to obtain the optimum discrete input. In
both problems... |
0706.3752 | Secure Nested Codes for Type II Wiretap Channels | cs.IT cs.CR math.IT | This paper considers the problem of secure coding design for a type II
wiretap channel, where the main channel is noiseless and the eavesdropper
channel is a general binary-input symmetric-output memoryless channel. The
proposed secure error-correcting code has a nested code structure. Two secure
nested coding scheme... |
0706.3753 | Multiple Access Channels with Generalized Feedback and Confidential
Messages | cs.IT math.IT | This paper considers the problem of secret communication over a multiple
access channel with generalized feedback. Two trusted users send independent
confidential messages to an intended receiver, in the presence of a passive
eavesdropper. In this setting, an active cooperation between two trusted users
is enabled th... |
0706.3834 | Design of optimal convolutional codes for joint decoding of correlated
sources in wireless sensor networks | cs.IT math.IT | We consider a wireless sensors network scenario where two nodes detect
correlated sources and deliver them to a central collector via a wireless link.
Differently from the Slepian-Wolf approach to distributed source coding, in the
proposed scenario the sensing nodes do not perform any pre-compression of the
sensed da... |
0706.3846 | Opportunistic Scheduling and Beamforming for MIMO-SDMA Downlink Systems
with Linear Combining | cs.IT math.IT | Opportunistic scheduling and beamforming schemes are proposed for multiuser
MIMO-SDMA downlink systems with linear combining in this work. Signals received
from all antennas of each mobile terminal (MT) are linearly combined to improve
the {\em effective} signal-to-noise-interference ratios (SINRs). By exploiting
lim... |
0706.4323 | Theory of Finite or Infinite Trees Revisited | cs.LO cs.AI | We present in this paper a first-order axiomatization of an extended theory
$T$ of finite or infinite trees, built on a signature containing an infinite
set of function symbols and a relation $\fini(t)$ which enables to distinguish
between finite or infinite trees. We show that $T$ has at least one model and
prove it... |
0706.4375 | A Robust Linguistic Platform for Efficient and Domain specific Web
Content Analysis | cs.AI | Web semantic access in specific domains calls for specialized search engines
with enhanced semantic querying and indexing capacities, which pertain both to
information retrieval (IR) and to information extraction (IE). A rich
linguistic analysis is required either to identify the relevant semantic units
to index and ... |
0707.0050 | Non-atomic Games for Multi-User Systems | cs.IT cs.GT math.IT | In this contribution, the performance of a multi-user system is analyzed in
the context of frequency selective fading channels. Using game theoretic tools,
a useful framework is provided in order to determine the optimal power
allocation when users know only their own channel (while perfect channel state
information ... |
0707.0181 | Location and Spectral Estimation of Weak Wave Packets on Noise
Background | cs.CE | The method of location and spectral estimation of weak signals on a noise
background is being considered. The method is based on the optimized on order
and noise dispersion autoregressive model of a sought signal. A new approach of
model order determination is being offered. Available estimation of the noise
dispersi... |
0707.0234 | Selection Relaying at Low Signal to Noise Ratios | cs.IT math.IT | Performance of cooperative diversity schemes at Low Signal to Noise Ratios
(LSNR) was recently studied by Avestimehr et. al. [1] who emphasized the
importance of diversity gain over multiplexing gain at low SNRs. It has also
been pointed out that continuous energy transfer to the channel is necessary
for achieving th... |
0707.0285 | A Generalized Sampling Theorem for Frequency Localized Signals | cs.IT math.IT | A generalized sampling theorem for frequency localized signals is presented.
The generalization in the proposed model of sampling is twofold: (1) It applies
to various prefilters effecting a "soft" bandlimitation, (2) an approximate
reconstruction from sample values rather than a perfect one is obtained (though
the f... |
0707.0323 | Interference Alignment and the Degrees of Freedom for the K User
Interference Channel | cs.IT math.IT | While the best known outerbound for the K user interference channel states
that there cannot be more than K/2 degrees of freedom, it has been conjectured
that in general the constant interference channel with any number of users has
only one degree of freedom. In this paper, we explore the spatial degrees of
freedom ... |
0707.0336 | Pricing Options on Defaultable Stocks | cs.CE | In this note, we develop stock option price approximations for a model which
takes both the risk o default and the stochastic volatility into account. We
also let the intensity of defaults be influenced by the volatility. We show
that it might be possible to infer the risk neutral default intensity from the
stock opt... |
0707.0421 | The $k$-anonymity Problem is Hard | cs.DB cs.CC cs.DS | The problem of publishing personal data without giving up privacy is becoming
increasingly important. An interesting formalization recently proposed is the
k-anonymity. This approach requires that the rows in a table are clustered in
sets of size at least k and that all the rows in a cluster become the same
tuple, af... |
0707.0454 | Optimal Strategies for Gaussian Jamming in Block-Fading Channels under
Delay and Power Constraints | cs.IT math.IT | Without assuming any knowledge on source's codebook and its output signals,
we formulate a Gaussian jamming problem in block fading channels as a
two-player zero sum game. The outage probability is adopted as an objective
function, over which transmitter aims at minimization and jammer aims at
maximization by selecti... |
0707.0459 | Physical Network Coding in Two-Way Wireless Relay Channels | cs.IT cs.NI math.IT | It has recently been recognized that the wireless networks represent a
fertile ground for devising communication modes based on network coding. A
particularly suitable application of the network coding arises for the two--way
relay channels, where two nodes communicate with each other assisted by using a
third, relay... |
0707.0463 | Blind Estimation of Multiple Carrier Frequency Offsets | cs.IT math.IT | Multiple carrier-frequency offsets (CFO) arise in a distributed antenna
system, where data are transmitted simultaneously from multiple antennas. In
such systems the received signal contains multiple CFOs due to mismatch between
the local oscillators of transmitters and receiver. This results in a
time-varying rotati... |
0707.0476 | Fractional Power Control for Decentralized Wireless Networks | cs.IT math.IT | We consider a new approach to power control in decentralized wireless
networks, termed fractional power control (FPC). Transmission power is chosen
as the current channel quality raised to an exponent -s, where s is a constant
between 0 and 1. The choices s = 1 and s = 0 correspond to the familiar cases
of channel in... |
0707.0479 | Precoding for the AWGN Channel with Discrete Interference | cs.IT math.IT | For a state-dependent DMC with input alphabet $\mathcal{X}$ and state
alphabet $\mathcal{S}$ where the i.i.d. state sequence is known causally at the
transmitter, it is shown that by using at most
$|\mathcal{X}||\mathcal{S}|-|\mathcal{S}|+1$ out of
$|\mathcal{X}|^{|\mathcal{S}|}$ input symbols of the Shannon's
\emph{... |
0707.0498 | The Role of Time in the Creation of Knowledge | cs.LG cs.AI cs.IT math.IT | This paper I assume that in humans the creation of knowledge depends on a
discrete time, or stage, sequential decision-making process subjected to a
stochastic, information transmitting environment. For each time-stage, this
environment randomly transmits Shannon type information-packets to the
decision-maker, who ex... |
0707.0500 | Location-Aided Fast Distributed Consensus in Wireless Networks | cs.IT math.IT | Existing works on distributed consensus explore linear iterations based on
reversible Markov chains, which contribute to the slow convergence of the
algorithms. It has been observed that by overcoming the diffusive behavior of
reversible chains, certain nonreversible chains lifted from reversible ones mix
substantial... |
0707.0514 | Phase space methods and psychoacoustic models in lossy transform coding | cs.IT cs.SD math.IT | I present a method for lossy transform coding of digital audio that uses the
Weyl symbol calculus for constructing the encoding and decoding transformation.
The method establishes a direct connection between a time-frequency
representation of the signal dependent threshold of masked noise and the
encode/decode pair. ... |
0707.0548 | From Royal Road to Epistatic Road for Variable Length Evolution
Algorithm | cs.NE | Although there are some real world applications where the use of variable
length representation (VLR) in Evolutionary Algorithm is natural and suitable,
an academic framework is lacking for such representations. In this work we
propose a family of tunable fitness landscapes based on VLR of genotypes. The
fitness land... |
0707.0568 | Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems
based on Game Theory-Part I: Nash Equilibria | cs.IT cs.GT math.IT | In this two-parts paper we propose a decentralized strategy, based on a
game-theoretic formulation, to find out the optimal precoding/multiplexing
matrices for a multipoint-to-multipoint communication system composed of a set
of wideband links sharing the same physical resources, i.e., time and
bandwidth. We assume, ... |
0707.0641 | Where are Bottlenecks in NK Fitness Landscapes? | cs.NE | Usually the offspring-parent fitness correlation is used to visualize and
analyze some caracteristics of fitness landscapes such as evolvability. In this
paper, we introduce a more general representation of this correlation, the
Fitness Cloud (FC). We use the bottleneck metaphor to emphasise fitness levels
in landsca... |
0707.0643 | Scuba Search : when selection meets innovation | cs.NE | We proposed a new search heuristic using the scuba diving metaphor. This
approach is based on the concept of evolvability and tends to exploit
neutrality in fitness landscape. Despite the fact that natural evolution does
not directly select for evolvability, the basic idea behind the scuba search
heuristic is to expl... |
0707.0649 | Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels | cs.IT math.IT | We study the error probability performance of rotated lattice constellations
in frequency-flat Nakagami-$m$ block-fading channels. In particular, we use the
sphere lower bound on the underlying infinite lattice as a performance
benchmark. We show that the sphere lower bound has full diversity. We observe
that optimal... |
0707.0652 | How to use the Scuba Diving metaphor to solve problem with neutrality ? | cs.NE | We proposed a new search heuristic using the scuba diving metaphor. This
approach is based on the concept of evolvability and tends to exploit
neutrality which exists in many real-world problems. Despite the fact that
natural evolution does not directly select for evolvability, the basic idea
behind the scuba search ... |
0707.0701 | Clustering and Feature Selection using Sparse Principal Component
Analysis | cs.AI cs.LG cs.MS | In this paper, we study the application of sparse principal component
analysis (PCA) to clustering and feature selection problems. Sparse PCA seeks
sparse factors, or linear combinations of the data variables, explaining a
maximum amount of variance in the data while having only a limited number of
nonzero coefficien... |
0707.0704 | Model Selection Through Sparse Maximum Likelihood Estimation | cs.AI cs.LG | We consider the problem of estimating the parameters of a Gaussian or binary
distribution in such a way that the resulting undirected graphical model is
sparse. Our approach is to solve a maximum likelihood problem with an added
l_1-norm penalty term. The problem as formulated is convex but the memory
requirements an... |
0707.0705 | Optimal Solutions for Sparse Principal Component Analysis | cs.AI cs.LG | Given a sample covariance matrix, we examine the problem of maximizing the
variance explained by a linear combination of the input variables while
constraining the number of nonzero coefficients in this combination. This is
known as sparse principal component analysis and has a wide array of
applications in machine l... |
0707.0724 | Workspace Analysis of the Parallel Module of the VERNE Machine | cs.RO physics.class-ph | The paper addresses geometric aspects of a spatial three-degree-of-freedom
parallel module, which is the parallel module of a hybrid serial-parallel
5-axis machine tool. This parallel module consists of a moving platform that is
connected to a fixed base by three non-identical legs. Each leg is made up of
one prismat... |
0707.0745 | Semantic Information Retrieval from Distributed Heterogeneous Data
Sources | cs.DB | Information retrieval from distributed heterogeneous data sources remains a
challenging issue. As the number of data sources increases more intelligent
retrieval techniques, focusing on information content and semantics, are
required. Currently ontologies are being widely used for managing semantic
knowledge, especia... |
0707.0763 | The Requirements for Ontologies in Medical Data Integration: A Case
Study | cs.DB | Evidence-based medicine is critically dependent on three sources of
information: a medical knowledge base, the patients medical record and
knowledge of available resources, including where appropriate, clinical
protocols. Patient data is often scattered in a variety of databases and may,
in a distributed model, be he... |
0707.0764 | p-Adic Degeneracy of the Genetic Code | q-bio.GN cs.IT math.IT physics.bio-ph | Degeneracy of the genetic code is a biological way to minimize effects of the
undesirable mutation changes. Degeneration has a natural description on the
5-adic space of 64 codons $\mathcal{C}_5 (64) = \{n_0 + n_1 5 + n_2 5^2
: n_i = 1, 2, 3, 4 \} ,$ where $n_i$ are digits related to nucleotides as
follows: C = 1, ... |
0707.0799 | A New Family of Unitary Space-Time Codes with a Fast Parallel Sphere
Decoder Algorithm | cs.IT math.IT | In this paper we propose a new design criterion and a new class of unitary
signal constellations for differential space-time modulation for
multiple-antenna systems over Rayleigh flat-fading channels with unknown fading
coefficients. Extensive simulations show that the new codes have significantly
better performance ... |
0707.0802 | Very fast watermarking by reversible contrast mapping | cs.MM cs.CR cs.CV cs.IT math.IT | Reversible contrast mapping (RCM) is a simple integer transform that applies
to pairs of pixels. For some pairs of pixels, RCM is invertible, even if the
least significant bits (LSBs) of the transformed pixels are lost. The data
space occupied by the LSBs is suitable for data hiding. The embedded
information bit-rate... |
0707.0805 | A New Generalization of Chebyshev Inequality for Random Vectors | math.ST cs.LG math.PR stat.AP stat.TH | In this article, we derive a new generalization of Chebyshev inequality for
random vectors. We demonstrate that the new generalization is much less
conservative than the classical generalization.
|
0707.0808 | The Cyborg Astrobiologist: Porting from a wearable computer to the
Astrobiology Phone-cam | cs.CV astro-ph cs.AI cs.CE cs.HC cs.NI cs.RO cs.SE | We have used a simple camera phone to significantly improve an `exploration
system' for astrobiology and geology. This camera phone will make it much
easier to develop and test computer-vision algorithms for future planetary
exploration. We envision that the `Astrobiology Phone-cam' exploration system
can be fruitful... |
0707.0860 | On the Minimum Number of Transmissions in Single-Hop Wireless Coding
Networks | cs.IT cs.NI math.IT | The advent of network coding presents promising opportunities in many areas
of communication and networking. It has been recently shown that network coding
technique can significantly increase the overall throughput of wireless
networks by taking advantage of their broadcast nature. In wireless networks,
each transmi... |
0707.0871 | Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems
based on Game Theory-Part II: Algorithms | cs.IT cs.GT math.IT | In this two-part paper, we address the problem of finding the optimal
precoding/multiplexing scheme for a set of non-cooperative links sharing the
same physical resources, e.g., time and bandwidth. We consider two alternative
optimization problems: P.1) the maximization of mutual information on each
link, given const... |
0707.0878 | Risk Analysis in Robust Control -- Making the Case for Probabilistic
Robust Control | math.OC cs.SY math.ST stat.TH | This paper offers a critical view of the "worst-case" approach that is the
cornerstone of robust control design. It is our contention that a blind
acceptance of worst-case scenarios may lead to designs that are actually more
dangerous than designs based on probabilistic techniques with a built-in risk
factor. The rea... |
0707.0895 | Segmentation and Context of Literary and Musical Sequences | cs.CL physics.data-an | We test a segmentation algorithm, based on the calculation of the
Jensen-Shannon divergence between probability distributions, to two symbolic
sequences of literary and musical origin. The first sequence represents the
successive appearance of characters in a theatrical play, and the second
represents the succession ... |
0707.0909 | Spectrum Sensing in Cognitive Radios Based on Multiple Cyclic
Frequencies | cs.IT math.IT | Cognitive radios sense the radio spectrum in order to find unused frequency
bands and use them in an agile manner. Transmission by the primary user must be
detected reliably even in the low signal-to-noise ratio (SNR) regime and in the
face of shadowing and fading. Communication signals are typically
cyclostationary,... |
0707.0969 | Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution | cs.IT math.IT | As a basic information-theoretic model for fading relay channels, the
parallel relay channel is first studied, for which lower and upper bounds on
the capacity are derived. For the parallel relay channel with degraded
subchannels, the capacity is established, and is further demonstrated via the
Gaussian case, for whi... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.