id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0808.2515 | Provably efficient instanton search algorithm for LP decoding of LDPC
codes over the BSC | cs.IT cond-mat.stat-mech math.IT | We consider Linear Programming (LP) decoding of a fixed Low-Density
Parity-Check (LDPC) code over the Binary Symmetric Channel (BSC). The LP
decoder fails when it outputs a pseudo-codeword which is not a codeword. We
design an efficient algorithm termed the Instanton Search Algorithm (ISA)
which, given a random input... |
0808.2530 | Fair Scheduling in Networks Through Packet Election | cs.IT math.IT | We consider the problem of designing a fair scheduling algorithm for
discrete-time constrained queuing networks. Each queue has dedicated exogenous
packet arrivals. There are constraints on which queues can be served
simultaneously. This model effectively describes important special instances
like network switches, i... |
0808.2548 | Negative Beta Encoder | cs.IT math.IT | A new class of analog-to-digital (A/D) and digital-to-analog (D/A) converters
using a flaky quantiser, called the $\beta$-encoder, has been shown to have
exponential bit rate accuracy while possessing a self-correction property for
fluctuations of the amplifier factor $\beta$ and the quantiser threshold $\nu$.
The pr... |
0808.2562 | Spectrum Sensing Algorithms for Cognitive Radio Based on Statistical
Covariances | cs.IT math.IT | Spectrum sensing, i.e., detecting the presence of primary users in a licensed
spectrum, is a fundamental problem in cognitive radio. Since the statistical
covariances of received signal and noise are usually different, they can be
used to differentiate the case where the primary user's signal is present from
the case... |
0808.2659 | Distributed Source Coding using Abelian Group Codes | cs.IT math.IT | In this work, we consider a distributed source coding problem with a joint
distortion criterion depending on the sources and the reconstruction. This
includes as a special case the problem of computing a function of the sources
to within some distortion and also the classic Slepian-Wolf problem,
Berger-Tung problem, ... |
0808.2670 | Solving the apparent diversity-accuracy dilemma of recommender systems | cs.IR physics.soc-ph | Recommender systems use data on past user preferences to predict possible
future likes and interests. A key challenge is that while the most useful
individual recommendations are to be found among diverse niche objects, the
most reliably accurate results are obtained by methods that recommend objects
based on user or... |
0808.2703 | Low-Signal-Energy Asymptotics of Capacity and Mutual Information for the
Discrete-Time Poisson Channel | cs.IT math.IT | The first terms of the low-signal-energy asymptotics for the mutual
information in the discrete-time Poisson channel are derived and compared to an
asymptotic expression of the capacity. In the presence of non-zero additive
noise (either Poisson or geometric), the mutual information is concave at zero
signal-energy a... |
0808.2833 | Efficient tests for equivalence of hidden Markov processes and quantum
random walks | cs.IT math.IT | While two hidden Markov process (HMP) resp. quantum random walk (QRW)
parametrizations can differ from one another, the stochastic processes arising
from them can be equivalent. Here a polynomial-time algorithm is presented
which can determine equivalence of two HMP parametrizations $\cM_1,\cM_2$ resp.
two QRW parame... |
0808.2837 | List Decoding of Burst Errors | cs.IT cs.DM math.IT | A generalization of the Reiger bound is presented for the list decoding of
burst errors. It is then shown that Reed-Solomon codes attain this bound.
|
0808.2904 | Investigation of the Zipf-plot of the extinct Meroitic language | cs.CL | The ancient and extinct language Meroitic is investigated using Zipf's Law.
In particular, since Meroitic is still undeciphered, the Zipf law analysis
allows us to assess the quality of current texts and possible avenues for
future investigation using statistical techniques.
|
0808.2931 | Spatial planning with constraints on translational distances between
geometric objects | cs.CG cs.RO | The main constraint on relative position of geometric objects, used in
spatial planning for computing the C-space maps (for example, in robotics, CAD,
and packaging), is the relative non-overlapping of objects. This is the
simplest constraint in which the minimum translational distance between objects
is greater than... |
0808.2964 | Estimating the Lengths of Memory Words | cs.IT math.IT | For a stationary stochastic process $\{X_n\}$ with values in some set $A$, a
finite word $w \in A^K$ is called a memory word if the conditional probability
of $X_0$ given the past is constant on the cylinder set defined by
$X_{-K}^{-1}=w$. It is a called a minimal memory word if no proper suffix of
$w$ is also a memo... |
0808.2984 | Building an interpretable fuzzy rule base from data using Orthogonal
Least Squares Application to a depollution problem | cs.LG cs.AI | In many fields where human understanding plays a crucial role, such as
bioprocesses, the capacity of extracting knowledge from data is of critical
importance. Within this framework, fuzzy learning methods, if properly used,
can greatly help human experts. Amongst these methods, the aim of orthogonal
transformations, ... |
0808.3003 | Codes Associated with Orthogonal Groups and Power Moments of Kloosterman
Sums | math.NT cs.IT math.IT | In this paper, we construct three binary linear codes $C(SO^{-}(2,q))$,
$C(O^{-}(2,q))$, $C(SO^{-}(4,q))$, respectively associated with the orthogonal
groups $SO^{-}(2,q)$, $O^{-}(2,q)$, $SO^{-}(4,q)$, with $q$ powers of two. Then
we obtain recursive formulas for the power moments of Kloosterman and
2-dimensional Klo... |
0808.3109 | n-ary Fuzzy Logic and Neutrosophic Logic Operators | cs.AI | We extend Knuth's 16 Boolean binary logic operators to fuzzy logic and
neutrosophic logic binary operators. Then we generalize them to n-ary fuzzy
logic and neutrosophic logic operators using the smarandache codification of
the Venn diagram and a defined vector neutrosophic law. In such way, new
operators in neutroso... |
0808.3145 | Approximate capacity of the two-way relay channel: A deterministic
approach | cs.IT math.IT | We study the capacity of the full-duplex bidirectional (or two-way) relay
channel with two nodes and one relay. The channels in the forward direction are
assumed to be different (in general) than the channels in the backward
direction, i.e. channel reciprocity is not assumed. We use the recently
proposed deterministi... |
0808.3214 | The discrete Fourier transform: A canonical basis of eigenfunctions | cs.IT cs.DM math.IT math.RT | The discrete Fourier transform (DFT) is an important operator which acts on
the Hilbert space of complex valued functions on the ring Z/NZ. In the case
where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors
for the DFT. The transition matrix from the standard basis to the canonical
basis defin... |
0808.3230 | Phase Transitions on Fixed Connected Graphs and Random Graphs in the
Presence of Noise | math.OC cs.IT math.IT | In this paper, we study the phase transition behavior emerging from the
interactions among multiple agents in the presence of noise. We propose a
simple discrete-time model in which a group of non-mobile agents form either a
fixed connected graph or a random graph process, and each agent, taking bipolar
value either ... |
0808.3231 | Multi-Instance Multi-Label Learning | cs.LG cs.AI | In this paper, we propose the MIML (Multi-Instance Multi-Label learning)
framework where an example is described by multiple instances and associated
with multiple class labels. Compared to traditional learning frameworks, the
MIML framework is more convenient and natural for representing complicated
objects which ha... |
0808.3281 | On the diagonalization of the discrete Fourier transform | cs.IT cs.DM math.IT math.RT | The discrete Fourier transform (DFT) is an important operator which acts on
the Hilbert space of complex valued functions on the ring Z/NZ. In the case
where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors
for the DFT. The transition matrix from the standard basis to the canonical
basis defin... |
0808.3296 | Confirmation Bias and the Open Access Advantage: Some Methodological
Suggestions for the Davis Citation Study | cs.DL cs.DB | Davis (2008) analyzes citations from 2004-2007 in 11 biomedical journals. 15%
of authors paid to make them Open Access (OA). The outcome is a significant OA
citation Advantage, but a small one (21%). The author infers that the OA
advantage has been shrinking yearly, but the data suggest the opposite. Further
analyses... |
0808.3418 | Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part II:
Parallel Slow Fading Channels | cs.IT cs.CR math.IT | This is the second part of a two-part paper that studies the problem of
jamming in a fixed-rate transmission system with fading. In the first part, we
studied the scenario with a fast fading channel, and found Nash equilibria of
mixed strategies for short term power constraints, and for average power
constraints with... |
0808.3431 | Jamming in Fixed-Rate Wireless Systems with Power Constraints - Part I:
Fast Fading Channels | cs.IT cs.CR math.IT | This is the first part of a two-part paper that studies the problem of
jamming in a fixed-rate transmission system with fading. Both transmitter and
jammer are subject to power constraints which can be enforced over each
codeword short-term / peak) or over all codewords (long-term / average), hence
generating differe... |
0808.3453 | Codes on hypergraphs | cs.IT math.IT | Codes on hypergraphs are an extension of the well-studied family of codes on
bipartite graphs. Bilu and Hoory (2004) constructed an explicit family of codes
on regular t-partite hypergraphs whose minimum distance improves earlier
estimates of the distance of bipartite-graph codes. They also suggested a
decoding algor... |
0808.3502 | Cooperative Protocols for Random Access Networks | cs.IT math.IT | Cooperative communications have emerged as a significant concept to improve
reliability and throughput in wireless systems. On the other hand, WLANs based
on random access mechanism have become popular due to ease of deployment and
low cost. Since cooperation introduces extra transmissions among the
cooperating nodes... |
0808.3504 | On the Growth Rate of the Weight Distribution of Irregular
Doubly-Generalized LDPC Codes | cs.IT math.IT | In this paper, an expression for the asymptotic growth rate of the number of
small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC)
codes is derived. The expression is compact and generalizes existing results
for LDPC and generalized LDPC (GLDPC) codes. Assuming that there exist check
and variab... |
0808.3511 | Conditional probability based significance tests for sequential patterns
in multi-neuronal spike trains | q-bio.NC cond-mat.dis-nn cs.DB q-bio.QM stat.ME | In this paper we consider the problem of detecting statistically significant
sequential patterns in multi-neuronal spike trains. These patterns are
characterized by ordered sequences of spikes from different neurons with
specific delays between spikes. We have previously proposed a data mining
scheme to efficiently d... |
0808.3563 | What It Feels Like To Hear Voices: Fond Memories of Julian Jaynes | cs.CL | Julian Jaynes's profound humanitarian convictions not only prevented him from
going to war, but would have prevented him from ever kicking a dog. Yet
according to his theory, not only are language-less dogs unconscious, but so
too were the speaking/hearing Greeks in the Bicameral Era, when they heard
gods' voices tel... |
0808.3569 | Offloading Cognition onto Cognitive Technology | cs.MA cs.CL | "Cognizing" (e.g., thinking, understanding, and knowing) is a mental state.
Systems without mental states, such as cognitive technology, can sometimes
contribute to human cognition, but that does not make them cognizers. Cognizers
can offload some of their cognitive functions onto cognitive technology,
thereby extend... |
0808.3572 | Model-Based Compressive Sensing | cs.IT math.IT | Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for
the acquisition of sparse or compressible signals that can be well approximated
by just K << N elements from an N-dimensional basis. Instead of taking periodic
samples, CS measures inner products with M < N random vectors and then recovers
the... |
0808.3616 | Constructing word similarities in Meroitic as an aid to decipherment | cs.CL | Meroitic is the still undeciphered language of the ancient civilization of
Kush. Over the years, various techniques for decipherment such as finding a
bilingual text or cognates from modern or other ancient languages in the Sudan
and surrounding areas has not been successful. Using techniques borrowed from
informatio... |
0808.3689 | Optimal Power Allocation for Fading Channels in Cognitive Radio
Networks: Ergodic Capacity and Outage Capacity | cs.IT math.IT | A cognitive radio network (CRN) is formed by either allowing the secondary
users (SUs) in a secondary communication network (SCN) to opportunistically
operate in the frequency bands originally allocated to a primary communication
network (PCN) or by allowing SCN to coexist with the primary users (PUs) in PCN
as long ... |
0808.3712 | Critique du rapport signal \`a bruit en communications num\'eriques --
Questioning the signal to noise ratio in digital communications | cs.IT math.IT math.PR math.RA | The signal to noise ratio, which plays such an important r\^ole in
information theory, is shown to become pointless for digital communications
where the demodulation is achieved via new fast estimation techniques.
Operational calculus, differential algebra, noncommutative algebra and
nonstandard analysis are the main... |
0808.3726 | Highly accurate recommendation algorithm based on high-order
similarities | physics.data-an cs.IR | In this Letter, we introduce a modified collaborative filtering (MCF)
algorithm, which has remarkably higher accuracy than the standard collaborative
filtering. In the MCF, instead of the standard Pearson coefficient, the
user-user similarities are obtained by a diffusion process. Furthermore, by
considering the seco... |
0808.3746 | A game-theoretic version of Oakes' example for randomized forecasting | cs.LG cs.GT | Using the game-theoretic framework for probability, Vovk and Shafer. have
shown that it is always possible, using randomization, to make sequential
probability forecasts that pass any countable set of well-behaved statistical
tests. This result generalizes work by other authors, who consider only tests
of calbration.... |
0808.3756 | Approaching Blokh-Zyablov Error Exponent with Linear-Time
Encodable/Decodable Codes | cs.IT cs.CC math.IT | Guruswami and Indyk showed in [1] that Forney's error exponent can be
achieved with linear coding complexity over binary symmetric channels. This
paper extends this conclusion to general discrete-time memoryless channels and
shows that Forney's and Blokh-Zyablov error exponents can be arbitrarily
approached by one-le... |
0808.3889 | Open architecture for multilingual parallel texts | cs.CL | Multilingual parallel texts (abbreviated to parallel texts) are linguistic
versions of the same content ("translations"); e.g., the Maastricht Treaty in
English and Spanish are parallel texts. This document is about creating an open
architecture for the whole Authoring, Translation and Publishing Chain
(ATP-chain) fo... |
0808.3959 | A Simple Extension of the $\modulo$-$\Lambda$ Transformation | cs.IT math.IT | A simple lemma is derived that allows to transform a general scalar
(non-Gaussian, non-additive) continuous-alphabet channel as well as a general
multiple-access channel into a modulo-additive noise channel. While in general
the transformation is information lossy, it allows to leverage linear coding
techniques and c... |
0808.3971 | Networked MIMO with Clustered Linear Precoding | cs.IT math.IT | A clustered base transceiver station (BTS) coordination strategy is proposed
for a large cellular MIMO network, which includes full intra-cluster
coordination to enhance the sum rate and limited inter-cluster coordination to
reduce interference for the cluster edge users. Multi-cell block
diagonalization is used to c... |
0808.4060 | TrustMAS: Trusted Communication Platform for Multi-Agent Systems | cs.CR cs.MA | The paper presents TrustMAS - Trusted Communication Platform for Multi-Agent
Systems, which provides trust and anonymity for mobile agents. The platform
includes anonymous technique based on random-walk algorithm for providing
general purpose anonymous communication for agents. All agents, which take part
in the prop... |
0808.4100 | Codes and Noncommutative Stochastic Matrices | math.RA cs.IT math.IT | Given a matrix over a skew field fixing the column (1,...,1)^t, we give
formulas for a row vector fixed by this matrix. The same techniques are applied
to give noncommutative extensions of probabilistic properties of codes.
|
0808.4111 | Relative Entropy and Statistics | cs.IT math.IT math.ST stat.TH | Formalising the confrontation of opinions (models) to observations (data) is
the task of Inferential Statistics. Information Theory provides us with a basic
functional, the relative entropy (or Kullback-Leibler divergence), an
asymmetrical measure of dissimilarity between the empirical and the theoretical
distributio... |
0808.4122 | Swapping Lemmas for Regular and Context-Free Languages | cs.CC cs.CL cs.FL | In formal language theory, one of the most fundamental tools, known as
pumping lemmas, is extremely useful for regular and context-free languages.
However, there are natural properties for which the pumping lemmas are of
little use. One of such examples concerns a notion of advice, which depends
only on the size of a... |
0808.4133 | Tableau-based decision procedure for the multi-agent epistemic logic
with operators of common and distributed knowledge | cs.LO cs.MA | We develop an incremental-tableau-based decision procedure for the
multi-agent epistemic logic MAEL(CD) (aka S5_n (CD)), whose language contains
operators of individual knowledge for a finite set Ag of agents, as well as
operators of distributed and common knowledge among all agents in Ag. Our
tableau procedure works... |
0808.4135 | Achieving the Empirical Capacity Using Feedback Part I: Memoryless
Additive Models | cs.IT math.IT | We address the problem of universal communications over an unknown channel
with an instantaneous noiseless feedback, and show how rates corresponding to
the empirical behavior of the channel can be attained, although no rate can be
guaranteed in advance. First, we consider a discrete modulo-additive channel
with alph... |
0808.4146 | Dynamic Connectivity in ALOHA Ad Hoc Networks | cs.IT cs.NI math.IT math.PR | In a wireless network the set of transmitting nodes changes frequently
because of the MAC scheduler and the traffic load. Previously, connectivity in
wireless networks was analyzed using static geometric graphs, and as we show
leads to an overly constrained design criterion. The dynamic nature of the
transmitting set... |
0808.4156 | Rate-Distortion via Markov Chain Monte Carlo | cs.IT math.IT | We propose an approach to lossy source coding, utilizing ideas from Gibbs
sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is
to sample a reconstruction sequence from a Boltzmann distribution associated
with an energy function that incorporates the distortion between the source and
reconst... |
0808.4160 | Using Relative Entropy to Find Optimal Approximations: an Application to
Simple Fluids | cond-mat.stat-mech cs.IT math.IT math.PR physics.data-an | We develop a maximum relative entropy formalism to generate optimal
approximations to probability distributions. The central results consist in (a)
justifying the use of relative entropy as the uniquely natural criterion to
select a preferred approximation from within a family of trial parameterized
distributions, an... |
0809.0009 | Distributed Parameter Estimation in Sensor Networks: Nonlinear
Observation Models and Imperfect Communication | cs.MA cs.IT math.IT | The paper studies distributed static parameter (vector) estimation in sensor
networks with nonlinear observation models and noisy inter-sensor
communication. It introduces \emph{separably estimable} observation models that
generalize the observability condition in linear centralized estimation to
nonlinear distribute... |
0809.0016 | An overview of the transmission capacity of wireless networks | cs.IT math.IT | This paper surveys and unifies a number of recent contributions that have
collectively developed a metric for decentralized wireless network analysis
known as transmission capacity. Although it is notoriously difficult to derive
general end-to-end capacity results for multi-terminal or \adhoc networks, the
transmissi... |
0809.0032 | A Variational Inference Framework for Soft-In-Soft-Out Detection in
Multiple Access Channels | cs.IT cs.LG math.IT | We propose a unified framework for deriving and studying soft-in-soft-out
(SISO) detection in interference channels using the concept of variational
inference. The proposed framework may be used in multiple-access interference
(MAI), inter-symbol interference (ISI), and multiple-input multiple-outpu
(MIMO) channels. ... |
0809.0070 | Underwater Acoustic Networks: Channel Models and Network Coding based
Lower Bound to Transmission Power for Multicast | cs.IT math.IT | The goal of this paper is two-fold. First, to establish a tractable model for
the underwater acoustic channel useful for network optimization in terms of
convexity. Second, to propose a network coding based lower bound for
transmission power in underwater acoustic networks, and compare this bound to
the performance o... |
0809.0091 | A functional view of upper bounds on codes | cs.IT math.IT | Functional and linear-algebraic approaches to the Delsarte problem of upper
bounds on codes are discussed. We show that Christoffel-Darboux kernels and
Levenshtein polynomials related to them arise as stationary points of the
moment functionals of some distributions. We also show that they can be derived
as eigenfunc... |
0809.0099 | Degrees of Freedom of the $K$ User $M \times N$ MIMO Interference
Channel | cs.IT math.IT | We provide innerbound and outerbound for the total number of degrees of
freedom of the $K$ user multiple input multiple output (MIMO) Gaussian
interference channel with $M$ antennas at each transmitter and $N$ antennas at
each receiver if the channel coefficients are time-varying and drawn from a
continuous distribut... |
0809.0103 | On the nature of long-range letter correlations in texts | cs.CL cs.IT math.IT | The origin of long-range letter correlations in natural texts is studied
using random walk analysis and Jensen-Shannon divergence. It is concluded that
they result from slow variations in letter frequency distribution, which are a
consequence of slow variations in lexical composition within the text. These
correlatio... |
0809.0116 | Toward Expressive and Scalable Sponsored Search Auctions | cs.DB | Internet search results are a growing and highly profitable advertising
platform. Search providers auction advertising slots to advertisers on their
search result pages. Due to the high volume of searches and the users' low
tolerance for search result latency, it is imperative to resolve these auctions
fast. Current ... |
0809.0124 | A Uniform Approach to Analogies, Synonyms, Antonyms, and Associations | cs.CL cs.IR cs.LG | Recognizing analogies, synonyms, antonyms, and associations appear to be four
distinct tasks, requiring distinct NLP algorithms. In the past, the four tasks
have been treated independently, using a wide variety of algorithms. These four
semantic classes, however, are a tiny sample of the full range of semantic
phenom... |
0809.0158 | Network Tomography Based on Additive Metrics | cs.NI cs.IT math.IT | Inference of the network structure (e.g., routing topology) and dynamics
(e.g., link performance) is an essential component in many network design and
management tasks. In this paper we propose a new, general framework for
analyzing and designing routing topology and link performance inference
algorithms using ideas ... |
0809.0199 | Dense Error Correction via L1-Minimization | cs.IT math.IT | This paper studies the problem of recovering a non-negative sparse signal $\x
\in \Re^n$ from highly corrupted linear measurements $\y = A\x + \e \in \Re^m$,
where $\e$ is an unknown error vector whose nonzero entries may be unbounded.
Motivated by an observation from face recognition in computer vision, this
paper p... |
0809.0271 | Randomised Variable Neighbourhood Search for Multi Objective
Optimisation | cs.AI | Various local search approaches have recently been applied to machine
scheduling problems under multiple objectives. Their foremost consideration is
the identification of the set of Pareto optimal alternatives. An important
aspect of successfully solving these problems lies in the definition of an
appropriate neighbo... |
0809.0360 | The Complexity of Enriched Mu-Calculi | cs.LO cs.CL | The fully enriched μ-calculus is the extension of the propositional
μ-calculus with inverse programs, graded modalities, and nominals. While
satisfiability in several expressive fragments of the fully enriched
μ-calculus is known to be decidable and ExpTime-complete, it has recently
been proved that the full... |
0809.0406 | Foundations of the Pareto Iterated Local Search Metaheuristic | cs.AI | The paper describes the proposition and application of a local search
metaheuristic for multi-objective optimization problems. It is based on two
main principles of heuristic search, intensification through variable
neighborhoods, and diversification through perturbations and successive
iterations in favorable region... |
0809.0410 | A Computational Study of Genetic Crossover Operators for Multi-Objective
Vehicle Routing Problem with Soft Time Windows | cs.AI | The article describes an investigation of the effectiveness of genetic
algorithms for multi-objective combinatorial optimization (MOCO) by presenting
an application for the vehicle routing problem with soft time windows. The work
is motivated by the question, if and how the problem structure influences the
effectiven... |
0809.0416 | Genetic Algorithms for multiple objective vehicle routing | cs.AI | The talk describes a general approach of a genetic algorithm for multiple
objective optimization problems. A particular dominance relation between the
individuals of the population is used to define a fitness operator, enabling
the genetic algorithm to adress even problems with efficient, but
convex-dominated alterna... |
0809.0444 | Quantum classification | quant-ph cs.LG | Quantum classification is defined as the task of predicting the associated
class of an unknown quantum state drawn from an ensemble of pure states given a
finite number of copies of this state. By recasting the state discrimination
problem within the framework of Machine Learning (ML), we can use the notion of
learni... |
0809.0448 | The Stock Market as a Game: An Agent Based Approach to Trading in Stocks | q-fin.TR cs.AI cs.GT | Just as war is sometimes fallaciously represented as a zero sum game -- when
in fact war is a negative sum game - stock market trading, a positive sum game
over time, is often erroneously represented as a zero sum game. This is called
the "zero sum fallacy" -- the erroneous belief that one trader in a stock
market ex... |
0809.0458 | Agent Models of Political Interactions | cs.AI cs.GT | Looks at state interactions from an agent based AI perspective to see state
interactions as an example of emergent intelligent behavior. Exposes basic
principles of game theory.
|
0809.0490 | Principal Graphs and Manifolds | cs.LG cs.NE stat.ML | In many physical, statistical, biological and other investigations it is
desirable to approximate a system of points by objects of lower dimension
and/or complexity. For this purpose, Karl Pearson invented principal component
analysis in 1901 and found 'lines and planes of closest fit to system of
points'. The famous... |
0809.0522 | The first-mover advantage in scientific publication | physics.soc-ph cs.DL cs.SI | Mathematical models of the scientific citation process predict a strong
"first-mover" effect under which the first papers in a field will, essentially
regardless of content, receive citations at a rate enormously higher than
papers published later. Moreover papers are expected to retain this advantage
in perpetuity -... |
0809.0536 | How to Fully Exploit the Degrees of Freedom in the Downlink of MISO
Systems With Opportunistic Beamforming | cs.IT math.IT | The opportunistic beamforming in the downlink of multiple-input single-output
(MISO) systems forms $N$ transmit beams, usually, no more than the number of
transmit antennas $N_t$. However, the degrees of freedom in this downlink is as
large as $N_t^2$. That is, at most $N_t^2$ rather than only $N_t$ users can be
simu... |
0809.0539 | Signature Quantization in Fading CDMA With Limited Feedback | cs.IT math.IT | In this work, we analyze the performance of a signature quantization scheme
for reverse-link Direct Sequence (DS)- Code Division Multiple Access (CDMA).
Assuming perfect estimates of the channel and interference covariance, the
receiver selects the signature that minimizes interference power or maximizes
signal-to-in... |
0809.0545 | Frequency Locking of an Optical Cavity using LQG Integral Control | quant-ph cs.SY | This paper considers the application of integral Linear Quadratic Gaussian
(LQG) optimal control theory to a problem of cavity locking in quantum optics.
The cavity locking problem involves controlling the error between the laser
frequency and the resonant frequency of the cavity. A model for the cavity
system, which... |
0809.0610 | A framework for the interactive resolution of multi-objective vehicle
routing problems | cs.AI | The article presents a framework for the resolution of rich vehicle routing
problems which are difficult to address with standard optimization techniques.
We use local search on the basis on variable neighborhood search for the
construction of the solutions, but embed the techniques in a flexible framework
that allow... |
0809.0635 | Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity
STBCs for 2 X 2 and 4 X 2 MIMO Systems | cs.IT math.IT | This paper (Part of the content of this manuscript has been accepted for
presentation in IEEE Globecom 2008, to be held in New Orleans) deals with low
maximum likelihood (ML) decoding complexity, full-rate and full-diversity
space-time block codes (STBCs), which also offer large coding gain, for the 2
transmit antenn... |
0809.0662 | Improving Local Search for Fuzzy Scheduling Problems | cs.AI | The integration of fuzzy set theory and fuzzy logic into scheduling is a
rather new aspect with growing importance for manufacturing applications,
resulting in various unsolved aspects. In the current paper, we investigate an
improved local search technique for fuzzy scheduling problems with fitness
plateaus, using a... |
0809.0680 | The Prolog Interface to the Unstructured Information Management
Architecture | cs.SE cs.IR | In this paper we describe the design and implementation of the Prolog
interface to the Unstructured Information Management Architecture (UIMA) and
some of its applications in natural language processing. The UIMA Prolog
interface translates unstructured data and the UIMA Common Analysis Structure
(CAS) into a Prolog ... |
0809.0686 | Energy Scaling Laws for Distributed Inference in Random Fusion Networks | cs.IT cs.NI math.IT math.ST stat.TH | The energy scaling laws of multihop data fusion networks for distributed
inference are considered. The fusion network consists of randomly located
sensors distributed i.i.d. according to a general spatial distribution in an
expanding region. Among the class of data fusion schemes that enable optimal
inference at the ... |
0809.0723 | A Simple Mechanism for Focused Web-harvesting | cs.IR cs.CY | The focused web-harvesting is deployed to realize an automated and
comprehensive index databases as an alternative way for virtual topical data
integration. The web-harvesting has been implemented and extended by not only
specifying the targeted URLs, but also predefining human-edited harvesting
parameters to improve... |
0809.0727 | Microcontroller-based System for Modular Networked Robot | cs.RO cs.CY | A prototype of modular networked robot for autonomous monitoring works with
full control over web through wireless connection has been developed. The robot
is equipped with a particular set of built-in analyzing tools and appropriate
censors, depending on its main purposes, to enable self-independent and
real-time da... |
0809.0728 | A Spectrum-Shaping Perspective on Cognitive Radio | cs.IT math.IT | A new perspective on cognitive radio is presented, where the pre-existent
legacy service is either uncoded or coded and a pair of cognitive transceivers
need be appropriately deployed to coexist with the legacy service. The basic
idea underlying the new perspective is to exploit the fact that, typically, the
legacy c... |
0809.0733 | There exists no self-dual [24,12,10] code over F5 | math.CO cs.IT math.IT | Self-dual codes over F5 exist for all even lengths. The smallest length for
which the largest minimum weight among self-dual codes has not been determined
is 24, and the largest minimum weight is either 9 or 10. In this note, we show
that there exists no self-dual [24,12,10] code over F5, using the
classification of ... |
0809.0737 | Malleable Coding with Fixed Reuse | cs.IT math.IT | In cloud computing, storage area networks, remote backup storage, and similar
settings, stored data is modified with updates from new versions. Representing
information and modifying the representation are both expensive. Therefore it
is desirable for the data to not only be compressed but to also be easily
modified ... |
0809.0745 | Sparse Recovery by Non-convex Optimization -- Instance Optimality | cs.IT math.IT | In this note, we address the theoretical properties of $\Delta_p$, a class of
compressed sensing decoders that rely on $\ell^p$ minimization with 0<p<1 to
recover estimates of sparse and compressible signals from incomplete and
inaccurate measurements. In particular, we extend the results of Candes,
Romberg and Tao, ... |
0809.0753 | Proposition of the Interactive Pareto Iterated Local Search Procedure -
Elements and Initial Experiments | cs.AI cs.HC | The article presents an approach to interactively solve multi-objective
optimization problems. While the identification of efficient solutions is
supported by computational intelligence techniques on the basis of local
search, the search is directed by partial preference information obtained from
the decision maker.
... |
0809.0755 | Bin Packing Under Multiple Objectives - a Heuristic Approximation
Approach | cs.AI | The article proposes a heuristic approximation approach to the bin packing
problem under multiple objectives. In addition to the traditional objective of
minimizing the number of bins, the heterogeneousness of the elements in each
bin is minimized, leading to a biobjective formulation of the problem with a
tradeoff b... |
0809.0757 | An application of the Threshold Accepting metaheuristic for curriculum
based course timetabling | cs.AI | The article presents a local search approach for the solution of timetabling
problems in general, with a particular implementation for competition track 3
of the International Timetabling Competition 2007 (ITC 2007). The heuristic
search procedure is based on Threshold Accepting to overcome local optima. A
stochastic... |
0809.0788 | Peek Arc Consistency | cs.AI cs.CC cs.LO | This paper studies peek arc consistency, a reasoning technique that extends
the well-known arc consistency technique for constraint satisfaction. In
contrast to other more costly extensions of arc consistency that have been
studied in the literature, peek arc consistency requires only linear space and
quadratic time ... |
0809.0835 | Approximating the volume of unions and intersections of high-dimensional
geometric objects | cs.CG cs.NE | We consider the computation of the volume of the union of high-dimensional
geometric objects. While showing that this problem is #P-hard already for very
simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects
where one can: (1) test whether a given point lies inside the object, (2)
sample a p... |
0809.0840 | HEP data analysis using jHepWork and Java | cs.CE hep-ex hep-ph | A role of Java in high-energy physics and recent progress in development of a
platform-independent data-analysis framework, jHepWork, is discussed. The
framework produces professional graphics and has many libraries for data
manipulation.
|
0809.0853 | Estimating divergence functionals and the likelihood ratio by convex
risk minimization | math.ST cs.IT math.IT stat.TH | We develop and analyze $M$-estimation methods for divergence functionals and
the likelihood ratios of two probability distributions. Our method is based on
a non-asymptotic variational characterization of $f$-divergences, which allows
the problem of estimating divergences to be tackled via convex empirical risk
optim... |
0809.0908 | Reduced Complexity Demodulation and Equalization Scheme for Differential
Impulse Radio UWB Systems with ISI | cs.IT math.IT | In this paper, we consider the demodulation and equalization problem of
differential Impulse Radio (IR) Ultra-WideBand (UWB) Systems with
Inter-Symbol-Interference (ISI). The differential IR UWB systems have been
extensively discussed recently. The advantage of differential IR UWB systems
include simple receiver fron... |
0809.0916 | Irreversible Monte Carlo Algorithms for Efficient Sampling | cond-mat.stat-mech cs.IT math.IT math.PR stat.AP | Equilibrium systems evolve according to Detailed Balance (DB). This principe
guided development of the Monte-Carlo sampling techniques, of which
Metropolis-Hastings (MH) algorithm is the famous representative. It is also
known that DB is sufficient but not necessary. We construct irreversible
deformation of a given r... |
0809.0918 | Intersecting random graphs and networks with multiple adjacency
constraints: A simple example | cs.IT math.IT math.PR | When studying networks using random graph models, one is sometimes faced with
situations where the notion of adjacency between nodes reflects multiple
constraints. Traditional random graph models are insufficient to handle such
situations.
A simple idea to account for multiple constraints consists in taking the
int... |
0809.0922 | Superposition for Fixed Domains | cs.AI cs.LO | Superposition is an established decision procedure for a variety of
first-order logic theories represented by sets of clauses. A satisfiable
theory, saturated by superposition, implicitly defines a minimal term-generated
model for the theory. Proving universal properties with respect to a saturated
theory directly le... |
0809.0949 | Efficient Implementation of the Generalized Tunstall Code Generation
Algorithm | cs.IT cs.DS math.IT | A method is presented for constructing a Tunstall code that is linear time in
the number of output items. This is an improvement on the state of the art for
non-Bernoulli sources, including Markov sources, which require a (suboptimal)
generalization of Tunstall's algorithm proposed by Savari and analytically
examined... |
0809.0961 | MOOPPS: An Optimization System for Multi Objective Scheduling | cs.AI cs.HC | In the current paper, we present an optimization system solving multi
objective production scheduling problems (MOOPPS). The identification of Pareto
optimal alternatives or at least a close approximation of them is possible by a
set of implemented metaheuristics. Necessary control parameters can easily be
adjusted b... |
0809.1017 | Entropy Concentration and the Empirical Coding Game | cs.IT cs.LG math.IT math.ST stat.ME stat.TH | We give a characterization of Maximum Entropy/Minimum Relative Entropy
inference by providing two `strong entropy concentration' theorems. These
theorems unify and generalize Jaynes' `concentration phenomenon' and Van
Campenhout and Cover's `conditional limit theorem'. The theorems characterize
exactly in what sense ... |
0809.1039 | High-SNR Analysis of Outage-Limited Communications with Bursty and
Delay-Limited Information | cs.IT math.IT | This work analyzes the high-SNR asymptotic error performance of
outage-limited communications with fading, where the number of bits that arrive
at the transmitter during any time slot is random but the delivery of bits at
the receiver must adhere to a strict delay limitation. Specifically, bit errors
are caused by er... |
0809.1043 | On Unique Decodability | cs.IT math.IT | In this paper we propose a revisitation of the topic of unique decodability
and of some fundamental theorems of lossless coding. It is widely believed
that, for any discrete source X, every "uniquely decodable" block code
satisfies E[l(X_1 X_2 ... X_n)]>= H(X_1,X_2,...,X_n), where X_1, X_2,...,X_n
are the first n sym... |
0809.1053 | An impossibility result for process discrimination | math.PR cs.IT math.IT math.ST stat.TH | Two series of binary observations $x_1,x_1,...$ and $y_1,y_2,...$ are
presented: at each time $n\in\N$ we are given $x_n$ and $y_n$. It is assumed
that the sequences are generated independently of each other by two
B-processes. We are interested in the question of whether the sequences
represent a typical realization... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.