id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0812.2726 | Universal Behavior in Large-scale Aggregation of Independent Noisy
Observations | cs.IT math.IT | Aggregation of noisy observations involves a difficult tradeoff between
observation quality, which can be increased by increasing the number of
observations, and aggregation quality which decreases if the number of
observations is too large. We clarify this behavior for a protypical system in
which arbitrarily large ... |
0812.2785 | Prediction of Platinum Prices Using Dynamically Weighted Mixture of
Experts | cs.AI | Neural networks are powerful tools for classification and regression in
static environments. This paper describes a technique for creating an ensemble
of neural networks that adapts dynamically to changing conditions. The model
separates the input space into four regions and each network is given a weight
in each reg... |
0812.2874 | A Data Model for Integrating Heterogeneous Medical Data in the
Health-e-Child Project | cs.DB | There has been much research activity in recent times about providing the
data infrastructures needed for the provision of personalised healthcare. In
particular the requirement of integrating multiple, potentially distributed,
heterogeneous data sources in the medical domain for the use of clinicians has
set challen... |
0812.2879 | Ontology Assisted Query Reformulation Using Semantic and Assertion
Capabilities of OWL-DL Ontologies | cs.DB | End users of recent biomedical information systems are often unaware of the
storage structure and access mechanisms of the underlying data sources and can
require simplified mechanisms for writing domain specific complex queries. This
research aims to assist users and their applications in formulating queries
without... |
0812.2892 | Sparse Component Analysis (SCA) in Random-valued and Salt and Pepper
Noise Removal | cs.CV | In this paper, we propose a new method for impulse noise removal from images.
It uses the sparsity of images in the Discrete Cosine Transform (DCT) domain.
The zeros in this domain give us the exact mathematical equation to reconstruct
the pixels that are corrupted by random-value impulse noises. The proposed
method ... |
0812.2926 | New parallel programming language design: a bridge between brain models
and multi-core/many-core computers? | cs.PL cs.AI | The recurrent theme of this paper is that sequences of long temporal patterns
as opposed to sequences of simple statements are to be fed into computation
devices, being them (new proposed) models for brain activity or
multi-core/many-core computers. In such models, parts of these long temporal
patterns are already co... |
0812.2969 | A Growing Self-Organizing Network for Reconstructing Curves and Surfaces | cs.NE cs.AI | Self-organizing networks such as Neural Gas, Growing Neural Gas and many
others have been adopted in actual applications for both dimensionality
reduction and manifold learning. Typically, in these applications, the
structure of the adapted network yields a good estimate of the topology of the
unknown subspace from w... |
0812.2971 | Cyclotomic FFT of Length 2047 Based on a Novel 11-point Cyclic
Convolution | cs.IT math.IT | In this manuscript, we propose a novel 11-point cyclic convolution algorithm
based on alternate Fourier transform. With the proposed bilinear form, we
construct a length-2047 cyclotomic FFT.
|
0812.2991 | Analyse et structuration automatique des guides de bonnes pratiques
cliniques : essai d'\'evaluation | cs.AI | Health Practice Guideliens are supposed to unify practices and propose
recommendations to physicians. This paper describes GemFrame, a system capable
of semi-automatically filling an XML template from free texts in the clinical
domain. The XML template includes semantic information not explicitly encoded
in the text ... |
0812.3066 | Beyond Bandlimited Sampling: Nonlinearities, Smoothness and Sparsity | cs.IT math.IT | Sampling theory has benefited from a surge of research in recent years, due
in part to the intense research in wavelet theory and the connections made
between the two fields. In this survey we present several extensions of the
Shannon theorem, that have been developed primarily in the past two decades,
which treat a ... |
0812.3070 | A Computational Model to Disentangle Semantic Information Embedded in
Word Association Norms | cs.CL cs.AI physics.data-an physics.soc-ph | Two well-known databases of semantic relationships between pairs of words
used in psycholinguistics, feature-based and association-based, are studied as
complex networks. We propose an algorithm to disentangle feature based
relationships from free association semantic networks. The algorithm uses the
rich topology of... |
0812.3120 | Mode Switching for MIMO Broadcast Channel Based on Delay and Channel
Quantization | cs.IT math.IT | Imperfect channel state information degrades the performance of
multiple-input multiple-output (MIMO) communications; its effect on single-user
(SU) and multi-user (MU) MIMO transmissions are quite different. In particular,
MU-MIMO suffers from residual inter-user interference due to imperfect channel
state informati... |
0812.3124 | Achievable Throughput of Multi-mode Multiuser MIMO with Imperfect CSI
Constraints | cs.IT math.IT | For the multiple-input multiple-output (MIMO) broadcast channel with
imperfect channel state information (CSI), neither the capacity nor the optimal
transmission technique have been fully discovered. In this paper, we derive
achievable ergodic rates for a MIMO fading broadcast channel when CSI is
delayed and quantize... |
0812.3145 | Binary Classification Based on Potentials | cs.LG | We introduce a simple and computationally trivial method for binary
classification based on the evaluation of potential functions. We demonstrate
that despite the conceptual and computational simplicity of the method its
performance can match or exceed that of standard Support Vector Machine
methods.
|
0812.3147 | Comparison of Binary Classification Based on Signed Distance Functions
with Support Vector Machines | cs.LG cs.CG | We investigate the performance of a simple signed distance function (SDF)
based method by direct comparison with standard SVM packages, as well as
K-nearest neighbor and RBFN methods. We present experimental results comparing
the SDF approach with other classifiers on both synthetic geometric problems
and five benchm... |
0812.3226 | BiopSym: a simulator for enhanced learning of ultrasound-guided prostate
biopsy | cs.RO | This paper describes a simulator of ultrasound-guided prostate biopsies for
cancer diagnosis. When performing biopsy series, the clinician has to move the
ultrasound probe and to mentally integrate the real-time bi-dimensional images
into a three-dimensional (3D) representation of the anatomical environment.
Such a 3... |
0812.3232 | Maximum Sum-Rate of MIMO Multiuser Scheduling with Linear Receivers | cs.IT math.IT | We analyze scheduling algorithms for multiuser communication systems with
users having multiple antennas and linear receivers. When there is no feedback
of channel information, we consider a common round robin scheduling algorithm,
and derive new exact and high signal-to-noise ratio (SNR) maximum sum-rate
results for... |
0812.3285 | On Successive Refinement for the Kaspi/Heegard-Berger Problem | cs.IT math.IT | Consider a source that produces independent copies of a triplet of jointly
distributed random variables, $\{X_{i},Y_{i},Z_{i}\}_{i=1}^{\infty}$. The
process $\{X_{i}\}$ is observed at the encoder, and is supposed to be
reproduced at two decoders, where $\{Y_{i}\}$ and $\{Z_{i}\}$ are observed, in
either a causal or n... |
0812.3306 | Worst-Case Optimal Adaptive Prefix Coding | cs.IT math.IT | A common complaint about adaptive prefix coding is that it is much slower
than static prefix coding. Karpinski and Nekrich recently took an important
step towards resolving this: they gave an adaptive Shannon coding algorithm
that encodes each character in (O (1)) amortized time and decodes it in (O
(\log H)) amortiz... |
0812.3404 | Diversity-Multiplexing Tradeoff for the MIMO Static Half-Duplex Relay | cs.IT math.IT | In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the
multiple-antenna (MIMO) static half-duplex relay channel. A general expression
is derived for the DMT upper bound, which can be achieved by a
compress-and-forward protocol at the relay, under certain assumptions. The DMT
expression is given... |
0812.3429 | Quantum Predictive Learning and Communication Complexity with Single
Input | quant-ph cs.LG | We define a new model of quantum learning that we call Predictive Quantum
(PQ). This is a quantum analogue of PAC, where during the testing phase the
student is only required to answer a polynomial number of testing queries.
We demonstrate a relational concept class that is efficiently learnable in
PQ, while in any... |
0812.3447 | Completion Time Minimization and Robust Power Control in Wireless Packet
Networks | cs.IT math.IT | A wireless packet network is considered in which each user transmits a stream
of packets to its destination. The transmit power of each user interferes with
the transmission of all other users. A convex cost function of the completion
times of the user packets is minimized by optimally allocating the users'
transmiss... |
0812.3465 | Linearly Parameterized Bandits | cs.LG | We consider bandit problems involving a large (possibly infinite) collection
of arms, in which the expected reward of each arm is a linear function of an
$r$-dimensional random vector $\mathbf{Z} \in \mathbb{R}^r$, where $r \geq 2$.
The objective is to minimize the cumulative regret and Bayes risk. When the set
of ar... |
0812.3478 | Automatic Construction of Lightweight Domain Ontologies for Chemical
Engineering Risk Management | cs.AI | The need for domain ontologies in mission critical applications such as risk
management and hazard identification is becoming more and more pressing. Most
research on ontology learning conducted in the academia remains unrealistic for
real-world applications. One of the main problems is the dependence on
non-incremen... |
0812.3550 | XML Static Analyzer User Manual | cs.PL cs.DB cs.LO cs.SE | This document describes how to use the XML static analyzer in practice. It
provides informal documentation for using the XML reasoning solver
implementation. The solver allows automated verification of properties that are
expressed as logical formulas over trees. A logical formula may for instance
express structural ... |
0812.3632 | Optimal detection of homogeneous segment of observations in stochastic
sequence | math.PR cs.IT math.IT math.ST stat.TH | A Markov process is registered. At random moment $\theta$ the distribution of
observed sequence changes. Using probability maximizing approach the optimal
stopping rule for detecting the change is identified. Some explicit solution is
obtained.
|
0812.3642 | MIMO Two-way Relay Channel: Diversity-Multiplexing Tradeoff Analysis | cs.IT math.IT | A multi-hop two-way relay channel is considered in which all the terminals
are equipped with multiple antennas. Assuming independent quasi-static Rayleigh
fading channels and channel state information available at the receivers, we
characterize the optimal diversity-multiplexing gain tradeoff (DMT) curve for a
full-d... |
0812.3648 | A New Method for Knowledge Representation in Expert System's (XMLKR) | cs.DC cs.AI | Knowledge representation it is an essential section of a Expert Systems,
Because in this section we have a framework to establish an expert system then
we can modeling and use by this to design an expert system. Many method it is
exist for knowledge representation but each method have problems, in this paper
we intro... |
0812.3709 | Minimum Expected Distortion in Gaussian Source Coding with Fading Side
Information | cs.IT math.IT | An encoder, subject to a rate constraint, wishes to describe a Gaussian
source under squared error distortion. The decoder, besides receiving the
encoder's description, also observes side information consisting of
uncompressed source symbol subject to slow fading and noise. The decoder knows
the fading realization bu... |
0812.3715 | Business processes integration and performance indicators in a PLM | cs.DB | In an economic environment more and more competitive, the effective
management of information and knowledge is a strategic issue for industrial
enterprises. In the global marketplace, companies must use reactive strategies
and reduce their products development cycle. In this context, the PLM (Product
Lifecycle Manage... |
0812.3742 | Quickest Change Detection of a Markov Process Across a Sensor Array | cs.IT math.IT math.ST stat.TH | Recent attention in quickest change detection in the multi-sensor setting has
been on the case where the densities of the observations change at the same
instant at all the sensors due to the disruption. In this work, a more general
scenario is considered where the change propagates across the sensors, and its
propag... |
0812.3788 | Foundations of SPARQL Query Optimization | cs.DB | The SPARQL query language is a recent W3C standard for processing RDF data, a
format that has been developed to encode information in a machine-readable way.
We investigate the foundations of SPARQL query optimization and (a) provide
novel complexity results for the SPARQL evaluation problem, showing that the
main so... |
0812.3873 | The K-Receiver Broadcast Channel with Confidential Messages | cs.IT math.IT | The secrecy capacity region for the K-receiver degraded broadcast channel
(BC) is given for confidential messages sent to the receivers and to be kept
secret from an external wiretapper. Superposition coding and Wyner's random
code partitioning are used to show the achievable rate tuples. Error
probability analysis a... |
0812.3890 | Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward
Cooperative Networks | cs.IT math.IT | We present the optimal relay-subset selection and transmission-time for a
decode-and-forward, half-duplex cooperative network of arbitrary size. The
resource allocation is obtained by maximizing over the rates obtained for each
possible subset of active relays, and the unique time allocation for each set
can be obtai... |
0812.4012 | De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences | math.CO cs.IT math.IT | This paper presents a method to find new De Bruijn cycles based on ones of
lesser order. This is done by mapping a De Bruijn cycle to several vertex
disjoint cycles in a De Bruijn digraph of higher order and connecting these
cycles into one full cycle. We characterize homomorphisms between De Bruijn
digraphs of diffe... |
0812.4044 | The Offset Tree for Learning with Partial Labels | cs.LG cs.AI | We present an algorithm, called the Offset Tree, for learning to make
decisions in situations where the payoff of only one choice is observed, rather
than all choices. The algorithm reduces this setting to binary classification,
allowing one to reuse of any existing, fully supervised binary classification
algorithm i... |
0812.4170 | Finding Still Lifes with Memetic/Exact Hybrid Algorithms | cs.NE cs.AI | The maximum density still life problem (MDSLP) is a hard constraint
optimization problem based on Conway's game of life. It is a prime example of
weighted constrained optimization problem that has been recently tackled in the
constraint-programming community. Bucket elimination (BE) is a complete
technique commonly u... |
0812.4235 | Client-server multi-task learning from distributed datasets | cs.LG cs.AI | A client-server architecture to simultaneously solve multiple learning tasks
from distributed datasets is described. In such architecture, each client is
associated with an individual learning task and the associated dataset of
examples. The goal of the architecture is to perform information fusion from
multiple data... |
0812.4332 | Content-based and Algorithmic Classifications of Journals: Perspectives
on the Dynamics of Scientific Communication and Indexer Effects | physics.data-an cs.DL cs.IR physics.soc-ph | The aggregated journal-journal citation matrix -based on the Journal Citation
Reports (JCR) of the Science Citation Index- can be decomposed by indexers
and/or algorithmically. In this study, we test the results of two recently
available algorithms for the decomposition of large matrices against two
content-based cla... |
0812.4334 | Multi-User SISO Precoding based on Generalized Multi-Unitary
Decomposition for Single-carrier Transmission in Frequency Selective Channel | cs.IT math.IT | In this paper, we propose to exploit the richly scattered multi-path nature
of a frequency selective channel to provide additional degrees of freedom for
desigining effective precoding schemes for multi-user communications. We design
the precoding matrix for multi-user communications based on the Generalized
Multi-Un... |
0812.4360 | Driven by Compression Progress: A Simple Principle Explains Essential
Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention,
Curiosity, Creativity, Art, Science, Music, Jokes | cs.AI cs.NE | I argue that data becomes temporarily interesting by itself to some
self-improving, but computationally limited, subjective observer once he learns
to predict or compress the data in a better way, thus making it subjectively
simpler and more beautiful. Curiosity is the desire to create or discover more
non-random, no... |
0812.4446 | The Latent Relation Mapping Engine: Algorithm and Experiments | cs.CL cs.AI cs.LG | Many AI researchers and cognitive scientists have argued that analogy is the
core of cognition. The most influential work on computational modeling of
analogy-making is Structure Mapping Theory (SMT) and its implementation in the
Structure Mapping Engine (SME). A limitation of SME is the requirement for
complex hand-... |
0812.4460 | Emergence of Spontaneous Order Through Neighborhood Formation in
Peer-to-Peer Recommender Systems | cs.AI cs.IR cs.MA | The advent of the Semantic Web necessitates paradigm shifts away from
centralized client/server architectures towards decentralization and
peer-to-peer computation, making the existence of central authorities
superfluous and even impossible. At the same time, recommender systems are
gaining considerable impact in e-c... |
0812.4461 | Mining User Profiles to Support Structure and Explanation in Open Social
Networking | cs.IR | The proliferation of media sharing and social networking websites has brought
with it vast collections of site-specific user generated content. The result is
a Social Networking Divide in which the concepts and structure common across
different sites are hidden. The knowledge and structures from one social site
are n... |
0812.4471 | Diversity-Multiplexing Tradeoff of Network Coding with Bidirectional
Random Relaying | cs.IT math.IT | This paper develops a diversity-multiplexing tradeoff (DMT) over a
bidirectional random relay set in a wireless network where the distribution of
all nodes is a stationary Poisson point process. This is a nontrivial extension
of the DMT because it requires consideration of the cooperation (or lack
thereof) of relay n... |
0812.4487 | New Sequences Design from Weil Representation with Low Two-Dimensional
Correlation in Both Time and Phase Shifts | cs.IT cs.DM math.IT math.RT | For a given prime $p$, a new construction of families of the complex valued
sequences of period $p$ with efficient implementation is given by applying both
multiplicative characters and additive characters of finite field
$\mathbb{F}_p$. Such a signal set consists of $p^2(p-2)$ time-shift distinct
sequences, the magn... |
0812.4514 | Quantum generalized Reed-Solomon codes: Unified framework for quantum
MDS codes | quant-ph cs.IT math.IT | We construct a new family of quantum MDS codes from classical generalized
Reed-Solomon codes and derive the necessary and sufficient condition under
which these quantum codes exist. We also give code bounds and show how to
construct them analytically. We find that existing quantum MDS codes can be
unified under these... |
0812.4523 | System Theoretic Viewpoint on Modeling of Complex Systems: Design,
Synthesis, Simulation, and Control | cs.CE | We consider the basic features of complex dynamic and control systems,
including systems having hierarchical structure. Special attention is paid to
the problems of design and synthesis of complex systems and control models, and
to the development of simulation techniques and systems. A model of complex
system is pro... |
0812.4542 | Assessing scientific research performance and impact with single indices | cs.IR physics.soc-ph | We provide a comprehensive and critical review of the h-index and its most
important modifications proposed in the literature, as well as of other similar
indicators measuring research output and impact. Extensions of some of these
indices are presented and illustrated.
|
0812.4580 | Feature Markov Decision Processes | cs.AI cs.IT cs.LG math.IT | General purpose intelligent learning agents cycle through (complex,non-MDP)
sequences of observations, actions, and rewards. On the other hand,
reinforcement learning is well-developed for small finite state Markov Decision
Processes (MDPs). So far it is an art performed by human designers to extract
the right state ... |
0812.4581 | Feature Dynamic Bayesian Networks | cs.AI cs.IT cs.LG math.IT | Feature Markov Decision Processes (PhiMDPs) are well-suited for learning
agents in general environments. Nevertheless, unstructured (Phi)MDPs are
limited to relatively simple environments. Structured MDPs like Dynamic
Bayesian Networks (DBNs) are used for large-scale real-world problems. In this
article I extend PhiM... |
0812.4614 | I, Quantum Robot: Quantum Mind control on a Quantum Computer | quant-ph cs.AI cs.LO cs.RO | The logic which describes quantum robots is not orthodox quantum logic, but a
deductive calculus which reproduces the quantum tasks (computational processes,
and actions) taking into account quantum superposition and quantum
entanglement. A way toward the realization of intelligent quantum robots is to
adopt a quantu... |
0812.4627 | Bayesian Compressive Sensing via Belief Propagation | cs.IT math.IT | Compressive sensing (CS) is an emerging field based on the revelation that a
small collection of linear projections of a sparse signal contains enough
information for stable, sub-Nyquist signal acquisition. When a statistical
characterization of the signal is available, Bayesian inference can complement
conventional ... |
0812.4642 | Error-Trellis State Complexity of LDPC Convolutional Codes Based on
Circulant Matrices | cs.IT math.IT | Let H(D) be the parity-check matrix of an LDPC convolutional code
corresponding to the parity-check matrix H of a QC code obtained using the
method of Tanner et al. We see that the entries in H(D) are all monomials and
several rows (columns) have monomial factors. Let us cyclically shift the rows
of H. Then the parit... |
0812.4803 | Technical Report: Achievable Rates for the MAC with Correlated
Channel-State Information | cs.IT math.IT | In this paper we provide an achievable rate region for the discrete
memoryless multiple access channel with correlated state information known
non-causally at the encoders using a random binning technique. This result is a
generalization of the random binning technique used by Gel'fand and Pinsker for
the problem wit... |
0812.4826 | Delay-Throughput Tradeoff for Supportive Two-Tier Networks | cs.IT cs.NI math.IT | Consider a static wireless network that has two tiers with different
priorities: a primary tier vs. a secondary tier. The primary tier consists of
randomly distributed legacy nodes of density $n$, which have an absolute
priority to access the spectrum. The secondary tier consists of randomly
distributed cognitive nod... |
0812.4889 | Statistical Physics of Signal Estimation in Gaussian Noise: Theory and
Examples of Phase Transitions | cs.IT math.IT | We consider the problem of signal estimation (denoising) from a statistical
mechanical perspective, using a relationship between the minimum mean square
error (MMSE), of estimating a signal, and the mutual information between this
signal and its noisy version. The paper consists of essentially two parts. In
the first... |
0812.4937 | Efficient Interpolation in the Guruswami-Sudan Algorithm | cs.IT cs.DM math.AC math.IT | A novel algorithm is proposed for the interpolation step of the
Guruswami-Sudan list decoding algorithm. The proposed method is based on the
binary exponentiation algorithm, and can be considered as an extension of the
Lee-O'Sullivan algorithm. The algorithm is shown to achieve both asymptotical
and practical perform... |
0812.4952 | Importance Weighted Active Learning | cs.LG | We present a practical and statistically consistent scheme for actively
learning binary classifiers under general loss functions. Our algorithm uses
importance weighting to correct sampling bias, and by controlling the variance,
we are able to give rigorous label complexity bounds for the learning process.
Experiment... |
0812.4985 | On the Capacity of Partially Cognitive Radios | cs.IT math.IT | This paper considers the problem of cognitive radios with partial-message
information. Here, an interference channel setting is considered where one
transmitter (the "cognitive" one) knows the message of the other ("legitimate"
user) partially. An outer bound on the capacity region of this channel is found
for the "w... |
0812.4986 | An Array Algebra | cs.DB | This is a proposal of an algebra which aims at distributed array processing.
The focus lies on re-arranging and distributing array data, which may be
multi-dimensional. The context of the work is scientific processing; thus, the
core science operations are assumed to be taken care of in external libraries
or language... |
0812.5026 | Group representation design of digital signals and sequences | cs.IT cs.DM math.IT math.RT | In this survey a novel system, called the oscillator system, consisting of
order of p^3 functions (signals) on the finite field F_{p}, is described and
studied. The new functions are proved to satisfy good auto-correlation,
cross-correlation and low peak-to-average power ratio properties. Moreover, the
oscillator sys... |
0812.5032 | A New Clustering Algorithm Based Upon Flocking On Complex Network | cs.LG cs.AI cs.CV physics.soc-ph | We have proposed a model based upon flocking on a complex network, and then
developed two clustering algorithms on the basis of it. In the algorithms,
firstly a \textit{k}-nearest neighbor (knn) graph as a weighted and directed
graph is produced among all data points in a dataset each of which is regarded
as an agent... |
0812.5064 | A Novel Clustering Algorithm Based Upon Games on Evolving Network | cs.LG cs.CV cs.GT nlin.AO | This paper introduces a model based upon games on an evolving network, and
develops three clustering algorithms according to it. In the clustering
algorithms, data points for clustering are regarded as players who can make
decisions in games. On the network describing relationships among data points,
an edge-removing... |
0812.5104 | On Quantum and Classical Error Control Codes: Constructions and
Applications | cs.IT math.IT quant-ph | It is conjectured that quantum computers are able to solve certain problems
more quickly than any deterministic or probabilistic computer. A quantum
computer exploits the rules of quantum mechanics to speed up computations.
However, it is a formidable task to build a quantum computer, since the quantum
mechanical sys... |
0901.0015 | Maximum Entropy on Compact Groups | cs.IT math.IT math.PR | On a compact group the Haar probability measure plays the role of uniform
distribution. The entropy and rate distortion theory for this uniform
distribution is studied. New results and simplified proofs on convergence of
convolutions on compact groups are presented and they can be formulated as
entropy increases to i... |
0901.0042 | A family of asymptotically good quantum codes based on code
concatenation | quant-ph cs.IT math.IT | We explicitly construct an infinite family of asymptotically good
concatenated quantum stabilizer codes where the outer code uses CSS-type
quantum Reed-Solomon code and the inner code uses a set of special quantum
codes. In the field of quantum error-correcting codes, this is the first time
that a family of asymptoti... |
0901.0044 | Information Inequalities for Joint Distributions, with Interpretations
and Applications | cs.IT math.CO math.IT math.PR | Upper and lower bounds are obtained for the joint entropy of a collection of
random variables in terms of an arbitrary collection of subset joint entropies.
These inequalities generalize Shannon's chain rule for entropy as well as
inequalities of Han, Fujishige and Shearer. A duality between the upper and
lower bound... |
0901.0055 | Entropy and set cardinality inequalities for partition-determined
functions | cs.IT math.CO math.IT math.NT math.PR | A new notion of partition-determined functions is introduced, and several
basic inequalities are developed for the entropy of such functions of
independent random variables, as well as for cardinalities of compound sets
obtained using these functions. Here a compound set means a set obtained by
varying each argument ... |
0901.0062 | Cores of Cooperative Games in Information Theory | cs.IT cs.GT math.IT | Cores of cooperative games are ubiquitous in information theory, and arise
most frequently in the characterization of fundamental limits in various
scenarios involving multiple users. Examples include classical settings in
network information theory such as Slepian-Wolf source coding and multiple
access channels, cla... |
0901.0065 | Exact Histogram Specification Optimized for Structural Similarity | cs.CV cs.MM | An exact histogram specification (EHS) method modifies its input image to
have a specified histogram. Applications of EHS include image (contrast)
enhancement (e.g., by histogram equalization) and histogram watermarking.
Performing EHS on an image, however, reduces its visual quality. Starting from
the output of a ge... |
0901.0118 | On the Stability Region of Amplify-and-Forward Cooperative Relay
Networks | cs.IT math.IT | This paper considers an amplify-and-forward relay network with fading states.
Amplify-and-forward scheme (along with its variations) is the core mechanism
for enabling cooperative communication in wireless networks, and hence
understanding the network stability region under amplify-and-forward scheme is
very importan... |
0901.0163 | Limited-Rate Channel State Feedback for Multicarrier Block Fading
Channels | cs.IT math.IT | The capacity of a fading channel can be substantially increased by feeding
back channel state information from the receiver to the transmitter. With
limited-rate feedback what state information to feed back and how to encode it
are important open questions. This paper studies power loading in a
multicarrier system us... |
0901.0168 | Coding for Two-User SISO and MIMO Multiple Access Channels | cs.IT math.IT | Constellation Constrained (CC) capacity regions of a two-user SISO Gaussian
Multiple Access Channel (GMAC) with finite complex input alphabets and
continuous output are computed in this paper. When both the users employ the
same code alphabet, it is well known that an appropriate rotation between the
alphabets provid... |
0901.0170 | Pedestrian Traffic: on the Quickest Path | physics.soc-ph cs.MA physics.comp-ph | When a large group of pedestrians moves around a corner, most pedestrians do
not follow the shortest path, which is to stay as close as possible to the
inner wall, but try to minimize the travel time. For this they accept to move
on a longer path with some distance to the corner, to avoid large densities and
by this ... |
0901.0213 | Filtering Microarray Correlations by Statistical Literature Analysis
Yields Potential Hypotheses for Lactation Research | cs.DL cs.DB | Our results demonstrated that a previously reported protein name
co-occurrence method (5-mention PubGene) which was not based on a hypothesis
testing framework, it is generally statistically more significant than the 99th
percentile of Poisson distribution-based method of calculating co-occurrence.
It agrees with pre... |
0901.0220 | Comments on "Broadcast Channels with Arbitrarily Correlated Sources" | cs.IT math.IT | The Marton-Gelfand-Pinsker inner bound on the capacity region of broadcast
channels was extended by Han-Costa to include arbitrarily correlated sources
where the capacity region is replaced by an admissible source region. The main
arguments of Han-Costa are correct but unfortunately the authors overlooked an
inequali... |
0901.0222 | Dynamic Muscle Fatigue Evaluation in Virtual Working Environment | cs.RO | Musculoskeletal disorder (MSD) is one of the major health problems in
mechanical work especially in manual handling jobs. Muscle fatigue is believed
to be the main reason for MSD. Posture analysis techniques have been used to
expose MSD risks of the work, but most of the conventional methods are only
suitable for sta... |
0901.0252 | MIMO decoding based on stochastic reconstruction from multiple
projections | cs.IT cs.LG math.IT | Least squares (LS) fitting is one of the most fundamental techniques in
science and engineering. It is used to estimate parameters from multiple noisy
observations. In many problems the parameters are known a-priori to be bounded
integer valued, or they come from a finite set of values on an arbitrary finite
lattice.... |
0901.0269 | Random Linear Network Coding For Time Division Duplexing: Energy
Analysis | cs.IT math.IT | We study the energy performance of random linear network coding for time
division duplexing channels. We assume a packet erasure channel with nodes that
cannot transmit and receive information simultaneously. The sender transmits
coded data packets back-to-back before stopping to wait for the receiver to
acknowledge ... |
0901.0275 | Physical-Layer Security: Combining Error Control Coding and Cryptography | cs.IT cs.CR math.IT | In this paper we consider tandem error control coding and cryptography in the
setting of the {\em wiretap channel} due to Wyner. In a typical communications
system a cryptographic application is run at a layer above the physical layer
and assumes the channel is error free. However, in any real application the
channel... |
0901.0296 | Experience versus Talent Shapes the Structure of the Web | cs.CY cs.IR physics.soc-ph | We use sequential large-scale crawl data to empirically investigate and
validate the dynamics that underlie the evolution of the structure of the web.
We find that the overall structure of the web is defined by an intricate
interplay between experience or entitlement of the pages (as measured by the
number of inbound... |
0901.0317 | Design of a P System based Artificial Graph Chemistry | cs.NE cs.AI | Artificial Chemistries (ACs) are symbolic chemical metaphors for the
exploration of Artificial Life, with specific focus on the origin of life. In
this work we define a P system based artificial graph chemistry to understand
the principles leading to the evolution of life-like structures in an AC set up
and to develo... |
0901.0318 | Thoughts on an Unified Framework for Artificial Chemistries | cs.AI cs.IT math.IT nlin.AO | Artificial Chemistries (ACs) are symbolic chemical metaphors for the
exploration of Artificial Life, with specific focus on the problem of
biogenesis or the origin of life. This paper presents authors thoughts towards
defining a unified framework to characterize and classify symbolic artificial
chemistries by devisin... |
0901.0339 | Resolution-based Query Answering for Semantic Access to Relational
Databases: A Research Note | cs.LO cs.DB | We address the problem of semantic querying of relational databases (RDB)
modulo knowledge bases using very expressive knowledge representation
formalisms, such as full first-order logic or its various fragments. We propose
to use a first-order logic (FOL) reasoner for computing schematic answers to
deductive queries... |
0901.0358 | Weighted Naive Bayes Model for Semi-Structured Document Categorization | cs.IR | The aim of this paper is the supervised classification of semi-structured
data. A formal model based on bayesian classification is developed while
addressing the integration of the document structure into classification tasks.
We define what we call the structural context of occurrence for unstructured
data, and we d... |
0901.0401 | From Physics to Economics: An Econometric Example Using Maximum Relative
Entropy | q-fin.ST cs.IT math.IT physics.data-an physics.pop-ph stat.CO stat.ME | Econophysics, is based on the premise that some ideas and methods from
physics can be applied to economic situations. We intend to show in this paper
how a physics concept such as entropy can be applied to an economic problem. In
so doing, we demonstrate how information in the form of observable data and
moment const... |
0901.0492 | Transmission Capacities for Overlaid Wireless Ad Hoc Networks with
Outage Constraints | cs.IT math.IT | We study the transmission capacities of two coexisting wireless networks (a
primary network vs. a secondary network) that operate in the same geographic
region and share the same spectrum. We define transmission capacity as the
product among the density of transmissions, the transmission rate, and the
successful tran... |
0901.0521 | On Multipath Fading Channels at High SNR | cs.IT math.IT | This work studies the capacity of multipath fading channels. A noncoherent
channel model is considered, where neither the transmitter nor the receiver is
cognizant of the realization of the path gains, but both are cognizant of their
statistics. It is shown that if the delay spread is large in the sense that the
vari... |
0901.0536 | Polar Codes: Characterization of Exponent, Bounds, and Constructions | cs.IT math.IT | Polar codes were recently introduced by Ar\i kan. They achieve the capacity
of arbitrary symmetric binary-input discrete memoryless channels under a low
complexity successive cancellation decoding strategy. The original polar code
construction is closely related to the recursive construction of Reed-Muller
codes and ... |
0901.0541 | Linear Transformations and Restricted Isometry Property | cs.IT math.IT | The Restricted Isometry Property (RIP) introduced by Cand\'es and Tao is a
fundamental property in compressed sensing theory. It says that if a sampling
matrix satisfies the RIP of certain order proportional to the sparsity of the
signal, then the original signal can be reconstructed even if the sampling
matrix provi... |
0901.0573 | Asymptotic stability and capacity results for a broad family of power
adjustment rules: Expanded discussion | cs.IT math.FA math.IT | In any wireless communication environment in which a transmitter creates
interference to the others, a system of non-linear equations arises. Its form
(for 2 terminals) is p1=g1(p2;a1) and p2=g2(p1;a2), with p1, p2 power levels;
a1, a2 quality-of-service (QoS) targets; and g1, g2 functions akin to
"interference funct... |
0901.0595 | Capacity regions of two new classes of 2-receiver broadcast channels | cs.IT math.IT | Motivated by a simple broadcast channel, we generalize the notions of a less
noisy receiver and a more capable receiver to an essentially less noisy
receiver and an essentially more capable receiver respectively. We establish
the capacity regions of these classes by borrowing on existing techniques to
obtain the char... |
0901.0597 | On the Optimal Convergence Probability of Univariate Estimation of
Distribution Algorithms | cs.NE cs.AI | In this paper, we obtain bounds on the probability of convergence to the
optimal solution for the compact Genetic Algorithm (cGA) and the Population
Based Incremental Learning (PBIL). We also give a sufficient condition for
convergence of these algorithms to the optimal solution and compute a range of
possible values... |
0901.0598 | A Step Forward in Studying the Compact Genetic Algorithm | cs.NE cs.AI | The compact Genetic Algorithm (cGA) is an Estimation of Distribution
Algorithm that generates offspring population according to the estimated
probabilistic model of the parent population instead of using traditional
recombination and mutation operators. The cGA only needs a small amount of
memory; therefore, it may b... |
0901.0608 | Multicasting correlated multi-source to multi-sink over a network | cs.IT math.IT | The problem of network coding with multicast of a single source to multisink
has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they
have established the celebrated max-flow mini-cut theorem on non-physical
information flow over a network of independent channels. On the other hand, in
1980, Han h... |
0901.0633 | Optimal control as a graphical model inference problem | math.OC cs.SY | We reformulate a class of non-linear stochastic optimal control problems
introduced by Todorov (2007) as a Kullback-Leibler (KL) minimization problem.
As a result, the optimal control computation reduces to an inference
computation and approximate inference methods can be applied to efficiently
compute approximate op... |
0901.0643 | An Information Theoretic Analysis of Single Transceiver Passive RFID
Networks | cs.IT math.IT | In this paper, we study single transceiver passive RFID networks by modeling
the underlying physical system as a special cascade of a certain broadcast
channel (BCC) and a multiple access channel (MAC), using a "nested codebook"
structure in between. The particular application differentiates this
communication setup ... |
0901.0702 | Multidimensional Flash Codes | cs.IT math.IT | Flash memory is a non-volatile computer memory comprised of blocks of cells,
wherein each cell can take on q different levels corresponding to the number of
electrons it contains. Increasing the cell level is easy; however, reducing a
cell level forces all the other cells in the same block to be erased. This
erasing ... |
0901.0733 | Contextual hypotheses and semantics of logic programs | cs.LO cs.AI | Logic programming has developed as a rich field, built over a logical
substratum whose main constituent is a nonclassical form of negation, sometimes
coexisting with classical negation. The field has seen the advent of a number
of alternative semantics, with Kripke-Kleene semantics, the well-founded
semantics, the st... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.