id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0711.2270 | Can a Computer Laugh ? | cs.CL cs.AI q-bio.NC | A computer model of "a sense of humour" suggested previously
[arXiv:0711.2058,0711.2061], relating the humorous effect with a specific
malfunction in information processing, is given in somewhat different
exposition. Psychological aspects of humour are elaborated more thoroughly. The
mechanism of laughter is formulat... |
0711.2444 | Proof nets for display logic | cs.CL | This paper explores several extensions of proof nets for the Lambek calculus
in order to handle the different connectives of display logic in a natural way.
The new proof net calculus handles some recent additions to the Lambek
vocabulary such as Galois connections and Grishin interactions. It concludes
with an explo... |
0711.2478 | A Compact Self-organizing Cellular Automata-based Genetic Algorithm | cs.NE cs.AI | A Genetic Algorithm (GA) is proposed in which each member of the population
can change schemata only with its neighbors according to a rule. The rule
methodology and the neighborhood structure employ elements from the Cellular
Automata (CA) strategies. Each member of the GA population is assigned to a
cell and crosso... |
0711.2501 | Error Exponents of Erasure/List Decoding Revisited via Moments of
Distance Enumerators | cs.IT math.IT | The analysis of random coding error exponents pertaining to erasure/list
decoding, due to Forney, is revisited. Instead of using Jensen's inequality as
well as some other inequalities in the derivation, we demonstrate that an
exponentially tight analysis can be carried out by assessing the relevant
moments of a certa... |
0711.2503 | Sparsity in time-frequency representations | math.CA cs.IT math.IT | We consider signals and operators in finite dimension which have sparse
time-frequency representations. As main result we show that an $S$-sparse Gabor
representation in $\mathbb{C}^n$ with respect to a random unimodular window can
be recovered by Basis Pursuit with high probability provided that $S\leq
Cn/\log(n)$. ... |
0711.2547 | Interference Alignment on the Deterministic Channel and Application to
Fully Connected AWGN Interference Networks | cs.IT math.IT | An interference alignment example is constructed for the deterministic
channel model of the $K$ user interference channel. The deterministic channel
example is then translated into the Gaussian setting, creating the first known
example of a fully connected Gaussian $K$ user interference network with single
antenna no... |
0711.2615 | A Biologically Inspired Classifier | cs.DB cs.IR | We present a method for measuring the distance among records based on the
correlations of data stored in the corresponding database entries. The original
method (F. Bagnoli, A. Berrones and F. Franci. Physica A 332 (2004) 509-518)
was formulated in the context of opinion formation. The opinions expressed over
a set o... |
0711.2642 | Multiuser MIMO Achievable Rates with Downlink Training and Channel State
Feedback | cs.IT math.IT | We consider a MIMO fading broadcast channel and compute achievable ergodic
rates when channel state information is acquired at the receivers via downlink
training and it is provided to the transmitter by channel state feedback.
Unquantized (analog) and quantized (digital) channel state feedback schemes are
analyzed a... |
0711.2652 | An information-theoretic analog of a result of Perelman | math.DG cs.IT math.IT | Each compact manifold M of finite dimension k is differentiable and supports
an intrinsic probability measure. There then exists a measurable transformation
of M to the k-dimensional "surface" of the (k+1)-dimensional ball.
|
0711.2666 | The Generalized Asymptotic Equipartition Property: Necessary and
Sufficient Conditions | cs.IT math.IT | Suppose a string $X_1^n=(X_1,X_2,...,X_n)$ generated by a memoryless source
$(X_n)_{n\geq 1}$ with distribution $P$ is to be compressed with distortion no
greater than $D\geq 0$, using a memoryless random codebook with distribution
$Q$. The compression performance is determined by the ``generalized asymptotic
equipar... |
0711.2712 | Parity Forwarding for Multiple-Relay Networks | cs.IT math.IT | This paper proposes a relaying strategy for the multiple-relay network in
which each relay decodes a selection of transmitted messages by other
transmitting terminals, and forwards parities of the decoded codewords. This
protocol improves the previously known achievable rate of the
decode-and-forward (DF) strategy fo... |
0711.2745 | On Capacity Scaling in Arbitrary Wireless Networks | cs.IT math.IT | In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling
characterization of throughput scaling for random extended wireless networks
(i.e., $n$ nodes are placed uniformly at random in a square region of area
$n$). They showed that for small path-loss exponents $\alpha\in(2,3]$
cooperative communica... |
0711.2762 | Variations on Information Embedding in Multiple Access and Broadcast
Channels | cs.IT math.IT | Information embedding (IE) is the transmission of information within a host
signal subject to a distortion constraint. There are two types of embedding
methods, namely irreversible IE and reversible IE, depending upon whether or
not the host, as well as the message, is recovered at the decoder. In
irreversible IE, on... |
0711.2801 | Inverse Sampling for Nonasymptotic Sequential Estimation of Bounded
Variable Means | math.ST cs.LG math.PR stat.TH | In this paper, we consider the nonasymptotic sequential estimation of means
of random variables bounded in between zero and one. We have rigorously
demonstrated that, in order to guarantee prescribed relative precision and
confidence level, it suffices to continue sampling until the sample sum is no
less than a certa... |
0711.2824 | Degrees of Freedom of Wireless X Networks | cs.IT math.IT | We explore the degrees of freedom of $M\times N$ user wireless $X$ networks,
i.e. networks of $M$ transmitters and $N$ receivers where every transmitter has
an independent message for every receiver. We derive a general outerbound on
the degrees of freedom \emph{region} of these networks. When all nodes have a
single... |
0711.2832 | Premi\`ere \'etape vers une navigation r\'ef\'erentielle par l'image
pour l'assistance \`a la conception des ambiances lumineuses | cs.IR | In the first design stage, image reference plays a double role of means of
formulation and resolution of problems. In our approach, we consider image
reference as a support of creation activity to generate ideas and we propose a
tool for navigation in references by image in order to assist daylight ambience
design. W... |
0711.2867 | Maximizing PageRank via outlinks | cs.IR math.RA | We analyze linkage strategies for a set I of webpages for which the webmaster
wants to maximize the sum of Google's PageRank scores. The webmaster can only
choose the hyperlinks starting from the webpages of I and has no control on the
hyperlinks from other webpages. We provide an optimal linkage strategy under
some ... |
0711.2873 | Trellis Computations | cs.IT math.IT | For a certain class of functions, the distribution of the function values can
be calculated in the trellis or a sub-trellis. The forward/backward recursion
known from the BCJR algorithm is generalized to compute the moments of these
distributions. In analogy to the symbol probabilities, by introducing a
constraint at... |
0711.2897 | Estimation of fuzzy anomalies in Water Distribution Systems | cs.NE | State estimation is necessary in diagnosing anomalies in Water Demand Systems
(WDS). In this paper we present a neural network performing such a task. State
estimation is performed by using optimization, which tries to reconcile all the
available information. Quantification of the uncertainty of the input data
(telem... |
0711.2909 | Comparing the notions of optimality in CP-nets, strategic games and soft
constraints | cs.AI cs.GT | The notion of optimality naturally arises in many areas of applied
mathematics and computer science concerned with decision making. Here we
consider this notion in the context of three formalisms used for different
purposes in reasoning about multi-agent systems: strategic games, CP-nets, and
soft constraints. To rel... |
0711.2914 | Image Classification Using SVMs: One-against-One Vs One-against-All | cs.LG cs.AI cs.CV | Support Vector Machines (SVMs) are a relatively new supervised classification
technique to the land cover mapping community. They have their roots in
Statistical Learning Theory and have gained prominence because they are robust,
accurate and are effective even when using a small training sample. By their
nature SVMs... |
0711.2917 | Use of Wikipedia Categories in Entity Ranking | cs.IR | Wikipedia is a useful source of knowledge that has many applications in
language processing and knowledge representation. The Wikipedia category graph
can be compared with the class hierarchy in an ontology; it has some
characteristics in common as well as some differences. In this paper, we
present our approach for ... |
0711.2961 | Recognizing Members of the Tournament Equilibrium Set is NP-hard | cs.CC cs.GT cs.MA | A recurring theme in the mathematical social sciences is how to select the
"most desirable" elements given a binary dominance relation on a set of
alternatives. Schwartz's tournament equilibrium set (TEQ) ranks among the most
intriguing, but also among the most enigmatic, tournament solutions that have
been proposed ... |
0711.3077 | On Low Complexity Maximum Likelihood Decoding of Convolutional Codes | cs.IT cs.CC math.IT | This paper considers the average complexity of maximum likelihood (ML)
decoding of convolutional codes. ML decoding can be modeled as finding the most
probable path taken through a Markov graph. Integrated with the Viterbi
algorithm (VA), complexity reduction methods such as the sphere decoder often
use the sum log l... |
0711.3128 | Entity Ranking in Wikipedia | cs.IR | The traditional entity extraction problem lies in the ability of extracting
named entities from plain text using natural language processing techniques and
intensive training from large document collections. Examples of named entities
include organisations, people, locations, or dates. There are many research
activit... |
0711.3152 | Multipath Channels of Bounded Capacity | cs.IT math.IT | The capacity of discrete-time, non-coherent, multipath fading channels is
considered. It is shown that if the delay spread is large in the sense that the
variances of the path gains do not decay faster than geometrically, then
capacity is bounded in the signal-to-noise ratio.
|
0711.3176 | To Decode the Interference or To Consider it as Noise | cs.IT math.IT | We address single-user data transmission over a channel where the received
signal incurs interference from a finite number of users (interfering users)
that use single codebooks for transmitting their own messages. The receiver,
however, is allowed to decode interfering users' messages. This means the
signal transmit... |
0711.3197 | How to realize "a sense of humour" in computers ? | cs.CL cs.AI q-bio.NC | Computer model of a "sense of humour" suggested previously [arXiv:0711.2058,
0711.2061, 0711.2270] is raised to the level of a realistic algorithm.
|
0711.3205 | Relay Subset Selection in Wireless Networks Using Partial
Decode-and-Forward Transmission | cs.IT math.IT | This paper considers the problem of selecting a subset of nodes in a two-hop
wireless network to act as relays in aiding the communication between the
source-destination pair. Optimal relay subset selection with the objective of
maximizing the overall throughput is a difficult problem that depends on
multiple factors... |
0711.3235 | A Game-Theoretic Analysis of Updating Sets of Probabilities | cs.AI math.ST stat.TH | We consider how an agent should update her uncertainty when it is represented
by a set $\P$ of probability distributions and the agent observes that a random
variable $X$ takes on value $x$, given that the agent makes decisions using the
minimax criterion, perhaps the best-studied and most commonly-used criterion in
... |
0711.3251 | Limited Feedback-based Block Diagonalization for the MIMO Broadcast
Channel | cs.IT math.IT | Block diagonalization is a linear precoding technique for the multiple
antenna broadcast (downlink) channel that involves transmission of multiple
data streams to each receiver such that no multi-user interference is
experienced at any of the receivers. This low-complexity scheme operates only a
few dB away from capa... |
0711.3338 | Bounds for Compression in Streaming Models | cs.IT math.IT | Compression algorithms and streaming algorithms are both powerful tools for
dealing with massive data sets, but many of the best compression algorithms --
e.g., those based on the Burrows-Wheeler Transform -- at first seem
incompatible with streaming. In this paper we consider several popular
streaming models and ask... |
0711.3375 | An Inflationary Fixed Point Operator in XQuery | cs.DB | We introduce a controlled form of recursion in XQuery, inflationary fixed
points, familiar in the context of relational databases. This imposes
restrictions on the expressible types of recursion, but we show that
inflationary fixed points nevertheless are sufficiently versatile to capture a
wide range of interesting ... |
0711.3412 | Morphological annotation of Korean with Directly Maintainable Resources | cs.CL | This article describes an exclusively resource-based method of morphological
annotation of written Korean text. Korean is an agglutinative language. Our
annotator is designed to process text before the operation of a syntactic
parser. In its present state, it annotates one-stem words only. The output is a
graph of mo... |
0711.3419 | Translating OWL and Semantic Web Rules into Prolog: Moving Toward
Description Logic Programs | cs.AI | To appear in Theory and Practice of Logic Programming (TPLP), 2008.
We are researching the interaction between the rule and the ontology layers
of the Semantic Web, by comparing two options: 1) using OWL and its rule
extension SWRL to develop an integrated ontology/rule language, and 2) layering
rules on top of an ... |
0711.3449 | Lexicon management and standard formats | cs.CL | International standards for lexicon formats are in preparation. To a certain
extent, the proposed formats converge with prior results of standardization
projects. However, their adequacy for (i) lexicon management and (ii)
lexicon-driven applications have been little debated in the past, nor are they
as a part of the... |
0711.3452 | In memoriam Maurice Gross | cs.CL | Maurice Gross (1934-2001) was both a great linguist and a pioneer in natural
language processing. This article is written in homage to his memory
|
0711.3453 | A resource-based Korean morphological annotation system | cs.CL | We describe a resource-based method of morphological annotation of written
Korean text. Korean is an agglutinative language. The output of our system is a
graph of morphemes annotated with accurate linguistic information. The language
resources used by the system can be easily updated, which allows us-ers to
control ... |
0711.3454 | Graphes param\'etr\'es et outils de lexicalisation | cs.CL | Shifting to a lexicalized grammar reduces the number of parsing errors and
improves application results. However, such an operation affects a syntactic
parser in all its aspects. One of our research objectives is to design a
realistic model for grammar lexicalization. We carried out experiments for
which we used a gr... |
0711.3457 | Evaluation of a Grammar of French Determiners | cs.CL | Existing syntactic grammars of natural languages, even with a far from
complete coverage, are complex objects. Assessments of the quality of parts of
such grammars are useful for the validation of their construction. We evaluated
the quality of a grammar of French determiners that takes the form of a
recursive transi... |
0711.3545 | To Code or Not to Code Across Time: Space-Time Coding with Feedback | cs.IT math.IT | Space-time codes leverage the availability of multiple antennas to enhance
the reliability of communication over wireless channels. While space-time codes
have initially been designed with a focus on open-loop systems, recent
technological advances have enabled the possibility of low-rate feedback from
the receiver t... |
0711.3580 | An evolutionary model with Turing machines | q-bio.QM cs.NE q-bio.GN | The development of a large non-coding fraction in eukaryotic DNA and the
phenomenon of the code-bloat in the field of evolutionary computations show a
striking similarity. This seems to suggest that (in the presence of mechanisms
of code growth) the evolution of a complex code can't be attained without
maintaining a ... |
0711.3591 | An Estimation of Distribution Algorithm with Intelligent Local Search
for Rule-based Nurse Rostering | cs.NE cs.CE | This paper proposes a new memetic evolutionary algorithm to achieve explicit
learning in rule-based nurse rostering, which involves applying a set of
heuristic rules for each nurse's assignment. The main framework of the
algorithm is an estimation of distribution algorithm, in which an ant-miner
methodology improves ... |
0711.3594 | Clustering with Transitive Distance and K-Means Duality | cs.LG | Recent spectral clustering methods are a propular and powerful technique for
data clustering. These methods need to solve the eigenproblem whose
computational complexity is $O(n^3)$, where $n$ is the number of data samples.
In this paper, a non-eigenproblem based clustering method is proposed to deal
with the cluster... |
0711.3605 | Very strict selectional restrictions | cs.CL | We discuss the characteristics and behaviour of two parallel classes of verbs
in two Romance languages, French and Portuguese. Examples of these verbs are
Port. abater [gado] and Fr. abattre [b\'etail], both meaning "slaughter
[cattle]". In both languages, the definition of the class of verbs includes
several feature... |
0711.3628 | A Perl Package and an Alignment Tool for Phylogenetic Networks | q-bio.PE cs.CE | Phylogenetic networks are a generalization of phylogenetic trees that allow
for the representation of evolutionary events acting at the population level,
like recombination between genes, hybridization between lineages, and lateral
gene transfer. While most phylogenetics tools implement a wide range of
algorithms on ... |
0711.3629 | Convolutional codes from units in matrix and group rings | cs.IT math.IT math.RA | A general method for constructing convolutional codes from units in Laurent
series over matrix rings is presented. Using group ring as matrix rings, this
forms a basis for in-depth exploration of convolutional codes from group ring
encoding, wherein the ring in the group ring is itself a group ring. The method
is use... |
0711.3675 | Derivations of Normalized Mutual Information in Binary Classifications | cs.LG cs.IT math.IT | This correspondence studies the basic problem of classifications - how to
evaluate different classifiers. Although the conventional performance indexes,
such as accuracy, are commonly used in classifier selection or evaluation,
information-based criteria, such as mutual information, are becoming popular in
feature/mo... |
0711.3691 | Outilex, plate-forme logicielle de traitement de textes \'ecrits | cs.CL | The Outilex software platform, which will be made available to research,
development and industry, comprises software components implementing all the
fundamental operations of written text processing: processing without lexicons,
exploitation of lexicons and grammars, language resource management. All data
are struct... |
0711.3726 | Let's get the student into the driver's seat | cs.CL | Speaking a language and achieving proficiency in another one is a highly
complex process which requires the acquisition of various kinds of knowledge
and skills, like the learning of words, rules and patterns and their connection
to communicative goals (intentions), the usual starting point. To help the
learner to ac... |
0711.3856 | Forward estimation for ergodic time series | math.PR cs.IT math.IT | The forward estimation problem for stationary and ergodic time series
$\{X_n\}_{n=0}^{\infty}$ taking values from a finite alphabet ${\cal X}$ is to
estimate the probability that $X_{n+1}=x$ based on the observations $X_i$,
$0\le i\le n$ without prior knowledge of the distribution of the process
$\{X_n\}$. We present... |
0711.3867 | A Family of Likelihood Ascent Search Multiuser Detectors: Approach to
Single-User Performance via Quasi-Large Random Sequence CDMA | cs.IT math.IT | Since Tse and Verdu proved that the global maximum likelihood (GML) detector
achieves unit asymptotic multiuser efficiency (AME) in the limit of large
random spreading (LRS) CDMA, no suboptimal detector has been found to achieve
unit AME. In this letter, we obtain that the WSLAS detector with a linear
per-bit complex... |
0711.3869 | A Family of Likelihood Ascent Search Multiuser Detectors: an Upper Bound
of Bit Error Rate and a Lower Bound of Asymptotic Multiuser Efficiency | cs.IT math.IT | In this paper, the bit error performance of a family of likelihood ascent
search (LAS) multiuser detectors is analyzed. An upper bound on the BER of any
LAS detector is obtained by bounding the fixed point region with the worst
initial detector. The concept of indecomposable errors developed by Verdu is
applied to ti... |
0711.3915 | Distributed Consensus Algorithms in Sensor Networks: Link Failures and
Channel Noise | cs.IT cs.MA math.IT math.OC | The paper studies average consensus with random topologies (intermittent
links)
\emph{and} noisy channels. Consensus with noise in the network links leads to
the bias-variance dilemma--running consensus for long reduces the bias of the
final average estimate but increases its variance. We present two different
comp... |
0711.3926 | Rateless codes for AVC models | cs.IT math.IT | The arbitrarily varying channel (AVC) is a channel model whose state is
selected maliciously by an adversary. Fixed-blocklength coding assumes a
worst-case bound on the adversary's capabilities, which leads to pessimistic
results. This paper defines a variable-length perspective on this problem, for
which achievable ... |
0711.3935 | Coding for Network Coding | cs.IT cs.NI math.IT | We consider communication over a noisy network under randomized linear
network coding. Possible error mechanism include node- or link- failures,
Byzantine behavior of nodes, or an over-estimate of the network min-cut.
Building on the work of Koetter and Kschischang, we introduce a probabilistic
model for errors. We c... |
0711.3964 | Iterative Filtering for a Dynamical Reputation System | cs.IR | The paper introduces a novel iterative method that assigns a reputation to n
+ m items: n raters and m objects. Each rater evaluates a subset of objects
leading to a n x m rating matrix with a certain sparsity pattern. From this
rating matrix we give a nonlinear formula to define the reputation of raters
and objects.... |
0711.3983 | Self-dual, dual-containing and related quantum codes from group rings | cs.IT math.IT math.RA | Classes of self-dual codes and dual-containing codes are constructed. The
codes are obtained within group rings and, using an isomorphism between group
rings and matrices, equivalent codes are obtained in matrix form. Distances and
other properties are derived by working within the group ring. Quantum codes
are const... |
0711.4075 | Evaluating the Impact of Information Distortion on Normalized
Compression Distance | cs.IT math.IT | In this paper we apply different techniques of information distortion on a
set of classical books written in English. We study the impact that these
distortions have upon the Kolmogorov complexity and the clustering by
compression technique (the latter based on Normalized Compression Distance,
NCD). We show how to de... |
0711.4142 | Content Reuse and Interest Sharing in Tagging Communities | cs.DL cs.IR | Tagging communities represent a subclass of a broader class of user-generated
content-sharing online communities. In such communities users introduce and tag
content for later use. Although recent studies advocate and attempt to harness
social knowledge in this context by exploiting collaboration among users,
little ... |
0711.4175 | Graph Entropy, Network Coding and Guessing games | math.CO cs.IT math.IT | We introduce the (private) entropy of a directed graph (in a new network
coding sense) as well as a number of related concepts. We show that the entropy
of a directed graph is identical to its guessing number and can be bounded from
below with the number of vertices minus the size of the graph's shortest index
code. ... |
0711.4309 | Knowware: the third star after Hardware and Software | cs.SE cs.AI cs.CY | This book proposes to separate knowledge from software and to make it a
commodity that is called knowware. The architecture, representation and
function of Knowware are discussed. The principles of knowware engineering and
its three life cycle models: furnace model, crystallization model and spiral
model are proposed... |
0711.4324 | Report on "American Option Pricing and Hedging Strategies" | cs.CE cs.DM | This paper mainly discusses the American option's hedging strategies via
binomialmodel and the basic idea of pricing and hedging American option.
Although the essential scheme of hedging is almost the same as European option,
small differences may arise when simulating the process for American option
holder has more ... |
0711.4380 | Randomness and metastability in CDMA paradigms | cs.IT math.IT | Code Division Multiple Access (CDMA) in which the signature code assignment
to users contains a random element has recently become a cornerstone of CDMA
research. The random element in the construction is particularly attractive in
that it provides robustness and flexibility in application, whilst not making
signific... |
0711.4388 | Contextual Information Retrieval based on Algorithmic Information Theory
and Statistical Outlier Detection | cs.IR cs.IT math.IT | The main contribution of this paper is to design an Information Retrieval
(IR) technique based on Algorithmic Information Theory (using the Normalized
Compression Distance- NCD), statistical techniques (outliers), and novel
organization of data base structure. The paper shows how they can be integrated
to retrieve in... |
0711.4406 | Optimization of Information Rate Upper and Lower Bounds for Channels
with Memory | cs.IT math.IT | We consider the problem of minimizing upper bounds and maximizing lower
bounds on information rates of stationary and ergodic discrete-time channels
with memory. The channels we consider can have a finite number of states, such
as partial response channels, or they can have an infinite state-space, such as
time-varyi... |
0711.4414 | Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in
Cognitive Radio Networks | cs.IT math.IT | In cognitive radio (CR) networks, there are scenarios where the secondary
(lower priority) users intend to communicate with each other by
opportunistically utilizing the transmit spectrum originally allocated to the
existing primary (higher priority) users. For such a scenario, a secondary user
usually has to trade o... |
0711.4444 | Building the Tangent and Adjoint codes of the Ocean General Circulation
Model OPA with the Automatic Differentiation tool TAPENADE | cs.MS cs.CE | The ocean general circulation model OPA is developed by the LODYC team at
Paris VI university. OPA has recently undergone a major rewriting, migrating to
FORTRAN95, and its adjoint code needs to be rebuilt. For earlier versions, the
adjoint of OPA was written by hand at a high development cost. We use the
Automatic D... |
0711.4452 | Covariance and PCA for Categorical Variables | cs.LG | Covariances from categorical variables are defined using a regular simplex
expression for categories. The method follows the variance definition by Gini,
and it gives the covariance as a solution of simultaneous equations. The
calculated results give reasonable values for test data. A method of principal
component an... |
0711.4475 | Valence extraction using EM selection and co-occurrence matrices | cs.CL | This paper discusses two new procedures for extracting verb valences from raw
texts, with an application to the Polish language. The first novel technique,
the EM selection algorithm, performs unsupervised disambiguation of valence
frame forests, obtained by applying a non-probabilistic deep grammar parser and
some p... |
0711.4507 | The Second Law as a Cause of the Evolution | cs.IT cs.AI math.IT | It is a common belief that in any environment where life is possible, life
will be generated. Here it is suggested that the cause for a spontaneous
generation of complex systems is probability driven processes. Based on
equilibrium thermodynamics, it is argued that in low occupation number
statistical systems, the se... |
0711.4508 | Representation and Measure of Structural Information | cs.CC cs.CV cs.IT math.IT | We introduce a uniform representation of general objects that captures the
regularities with respect to their structure. It allows a representation of a
general class of objects including geometric patterns and images in a sparse,
modular, hierarchical, and recursive manner. The representation can exploit any
computa... |
0711.4557 | On Outage Behavior of Wideband Slow-Fading Channels | cs.IT math.IT | This paper investigates point-to-point information transmission over a
wideband slow-fading channel, modeled as an (asymptotically) large number of
independent identically distributed parallel channels, with the random channel
fading realizations remaining constant over the entire coding block. On the one
hand, in th... |
0711.4603 | A Note on Quantum Hamming Bound | quant-ph cs.IT math.IT | Proving the quantum Hamming bound for degenerate nonbinary stabilizer codes
has been an open problem for a decade. In this note, I prove this bound for
double error-correcting degenerate stabilizer codes. Also, I compute the
maximum length of single and double error-correcting MDS stabilizer codes over
finite fields.... |
0711.4759 | Copeland Voting Fully Resists Constructive Control | cs.GT cs.CC cs.MA | Control and bribery are settings in which an external agent seeks to
influence the outcome of an election. Faliszewski et al. [FHHR07] proved that
Llull voting (which is here denoted by Copeland^1) and a variant (here denoted
by Copeland^0) of Copeland voting are computationally resistant to many, yet
not all, types ... |
0711.4792 | On the Capacity of a Class of MIMO Cognitive Radios | cs.IT math.IT | Cognitive radios have been studied recently as a means to utilize spectrum in
a more efficient manner. This paper focuses on the fundamental limits of
operation of a MIMO cognitive radio network with a single licensed user and a
single cognitive user. The channel setting is equivalent to an interference
channel with ... |
0711.4809 | Local independence of fractional Brownian motion | math.PR cs.IT math.IT | Let S(t,t') be the sigma-algebra generated by the differences X(s)-X(s) with
s,s' in the interval(t,t'), where (X_t) is the fractional Brownian motion
process with Hurst index H between 0 and 1. We prove that for any two distinct
t and t' the sigma-algebras S(t-a,t+a) and S(t'-a,t'+a) are asymptotically
independent a... |
0711.4864 | Cooperative Relaying with State Available at the Relay | cs.IT math.IT | We consider a state-dependent full-duplex relay channel with the state of the
channel non-causally available at only the relay. In the framework of
cooperative wireless networks, some specific terminals can be equipped with
cognition capabilities, i.e, the relay in our model. In the discrete memoryless
(DM) case, we ... |
0711.4902 | Circumspect descent prevails in solving random constraint satisfaction
problems | cs.DS cond-mat.stat-mech cs.AI | We study the performance of stochastic local search algorithms for random
instances of the $K$-satisfiability ($K$-SAT) problem. We introduce a new
stochastic local search algorithm, ChainSAT, which moves in the energy
landscape of a problem instance by {\em never going upwards} in energy.
ChainSAT is a \emph{focused... |
0711.4924 | Nonuniform Bribery | cs.GT cs.CC cs.MA | We study the concept of bribery in the situation where voters are willing to
change their votes as we ask them, but where their prices depend on the nature
of the change we request. Our model is an extension of the one of Faliszewski
et al. [FHH06], where each voter has a single price for any change we may ask
for. W... |
0712.0042 | On the Mutual Information Distribution of OFDM-Based Spatial
Multiplexing: Exact Variance and Outage Approximation | cs.IT math.IT | This paper considers the distribution of the mutual information of
frequency-selective spatially-uncorrelated Rayleigh fading MIMO channels.
Results are presented for OFDM-based spatial multiplexing. New exact
closed-form expressions are derived for the variance of the mutual information.
In contrast to previous resu... |
0712.0057 | On Precision - Redundancy Relation in the Design of Source Coding
Algorithms | cs.IT math.IT | We study the effects of finite-precision representation of source's
probabilities on the efficiency of classic source coding algorithms, such as
Shannon, Gilbert-Moore, or arithmetic codes. In particular, we establish the
following simple connection between the redundancy $R$ and the number of bits
$W$ necessary for ... |
0712.0097 | Redundancy Estimates for Word-Based Encoding of Sequences Produced by a
Bernoulli Source | cs.IT math.IT | The efficiency of a code is estimated by its redundancy $R$, while the
complexity of a code is estimated by its average delay $\bar N$. In this work
we construct word-based codes, for which $R \lesssim \bar N^{-5/3}$. Therefore,
word-based codes can attain the same redundancy as block-codes while being much
less comp... |
0712.0105 | On estimating the memory for finitarily Markovian processes | math.PR cs.IT math.IT | Finitarily Markovian processes are those processes
$\{X_n\}_{n=-\infty}^{\infty}$ for which there is a finite $K$ ($K =
K(\{X_n\}_{n=-\infty}^0$) such that the conditional distribution of $X_1$ given
the entire past is equal to the conditional distribution of $X_1$ given only
$\{X_n\}_{n=1-K}^0$. The least such value... |
0712.0130 | On the Relationship between the Posterior and Optimal Similarity | cs.LG | For a classification problem described by the joint density $P(\omega,x)$,
models of $P(\omega\eq\omega'|x,x')$ (the ``Bayesian similarity measure'') have
been shown to be an optimal similarity measure for nearest neighbor
classification. This paper analyzes demonstrates several additional properties
of that conditio... |
0712.0131 | Learning Similarity for Character Recognition and 3D Object Recognition | cs.CV | I describe an approach to similarity motivated by Bayesian methods. This
yields a similarity function that is learnable using a standard Bayesian
methods. The relationship of the approach to variable kernel and variable
metric methods is discussed. The approach is related to variable kernel
Experimental results on ch... |
0712.0136 | Learning View Generalization Functions | cs.CV | Learning object models from views in 3D visual object recognition is usually
formulated either as a function approximation problem of a function describing
the view-manifold of an object, or as that of learning a class-conditional
density. This paper describes an alternative framework for learning in visual
object re... |
0712.0137 | View Based Methods can achieve Bayes-Optimal 3D Recognition | cs.CV | This paper proves that visual object recognition systems using only 2D
Euclidean similarity measurements to compare object views against previously
seen views can achieve the same recognition performance as observers having
access to all coordinate information and able of using arbitrary 3D models
internally. Further... |
0712.0171 | A Spectral Approach to Analyzing Belief Propagation for 3-Coloring | cs.CC cs.AI cs.DM | Contributing to the rigorous understanding of BP, in this paper we relate the
convergence of BP to spectral properties of the graph. This encompasses a
result for random graphs with a ``planted'' solution; thus, we obtain the first
rigorous result on BP for graph coloring in the case of a complex graphical
structure ... |
0712.0271 | Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem | cs.IT math.IT | Distributed source coding schemes are typically based on the use of channels
codes as source codes. In this paper we propose a new paradigm, termed
"distributed arithmetic coding", which exploits the fact that arithmetic codes
are good source as well as channel codes. In particular, we propose a
distributed binary ar... |
0712.0305 | The analytic computability of the Shannon transform for a large class of
random matrix channels | cs.IT math.IT | We define a class of "algebraic" random matrix channels for which one can
generically compute the limiting Shannon transform using numerical techniques
and often enumerate the low SNR series expansion coefficients in closed form.
We describe this class, the coefficient enumeration techniques and compare
theory with s... |
0712.0392 | Collaborative Gain in Resource Sharing Communication Networks | cs.IT math.IT | This paper has been withdrawn
|
0712.0451 | A Reactive Tabu Search Algorithm for Stimuli Generation in
Psycholinguistics | cs.AI cs.CC cs.DM cs.LG | The generation of meaningless "words" matching certain statistical and/or
linguistic criteria is frequently needed for experimental purposes in
Psycholinguistics. Such stimuli receive the name of pseudowords or nonwords in
the Cognitive Neuroscience literatue. The process for building nonwords
sometimes has to be bas... |
0712.0499 | Simrank++: Query rewriting through link analysis of the click graph | cs.DL cs.DB cs.IR | We focus on the problem of query rewriting for sponsored search. We base
rewrites on a historical click graph that records the ads that have been
clicked on in response to past user queries. Given a query q, we first consider
Simrank as a way to identify queries similar to q, i.e., queries whose ads a
user may be int... |
0712.0541 | New Construction of A Family of Quasi-Twisted Two-Weight Codes | cs.IT math.IT | Based on cyclic and consta-cyclic simplex codes, a new explicit construction
of a family of two-weight codes is presented. These two-weight codes obtained
are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based
on this construction, new optimal binary quasi-cyclic [195, 8, 96], [210, 8,
104] an... |
0712.0653 | Equations of States in Singular Statistical Estimation | cs.LG | Learning machines which have hierarchical structures or hidden variables are
singular statistical models because they are nonidentifiable and their Fisher
information matrices are singular. In singular statistical models, neither the
Bayes a posteriori distribution converges to the normal distribution nor the
maximum... |
0712.0744 | Computational Chemotaxis in Ants and Bacteria over Dynamic Environments | cs.MA cs.AI q-bio.PE q-bio.QM | Chemotaxis can be defined as an innate behavioural response by an organism to
a directional stimulus, in which bacteria, and other single-cell or
multicellular organisms direct their movements according to certain chemicals
in their environment. This is important for bacteria to find food (e.g.,
glucose) by swimming ... |
0712.0836 | Evolving localizations in reaction-diffusion cellular automata | cs.AI | We consider hexagonal cellular automata with immediate cell neighbourhood and
three cell-states. Every cell calculates its next state depending on the
integral representation of states in its neighbourhood, i.e. how many
neighbours are in each one state. We employ evolutionary algorithms to breed
local transition fun... |
0712.0840 | A Universal Kernel for Learning Regular Languages | cs.LG cs.DM | We give a universal kernel that renders all the regular languages linearly
separable. We are not able to compute this kernel efficiently and conjecture
that it is intractable, but we do have an efficient $\eps$-approximation.
|
0712.0871 | Balancing forward and feedback error correction for erasure channels
with unreliable feedback | cs.IT math.IT | The traditional information theoretic approach to studying feedback is to
consider ideal instantaneous high-rate feedback of the channel outputs to the
encoder. This was acceptable in classical work because the results were
negative: Shannon pointed out that even perfect feedback often does not improve
capacity and i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.