id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0910.4901 | Distortion Exponent in MIMO Channels with Feedback | cs.IT math.IT | The transmission of a Gaussian source over a block-fading multiple antenna
channel in the presence of a feedback link is considered. The feedback link is
assumed to be an error and delay free link of capacity 1 bit per channel use.
Under the short-term power constraint, the optimal exponential behavior of the
end-to-... |
0910.4903 | Articulation and Clarification of the Dendritic Cell Algorithm | cs.AI cs.NE | The Dendritic Cell algorithm (DCA) is inspired by recent work in innate
immunity. In this paper a formal description of the DCA is given. The DCA is
described in detail, and its use as an anomaly detector is illustrated within
the context of computer security. A port scan detection task is performed to
substantiate t... |
0910.4955 | On the Structure of Real-Time Encoders and Decoders in a Multi-Terminal
Communication System | cs.IT math.IT math.OC | A real-time communication system with two encoders communicating with a
single receiver over separate noisy channels is considered. The two encoders
make distinct partial observations of a Markov source. Each encoder must encode
its observations into a sequence of discrete symbols. The symbols are
transmitted over no... |
0910.5002 | An Iterative Shrinkage Approach to Total-Variation Image Restoration | cs.CV | The problem of restoration of digital images from their degraded measurements
plays a central role in a multitude of practically important applications. A
particularly challenging instance of this problem occurs in the case when the
degradation phenomenon is modeled by an ill-conditioned operator. In such a
case, the... |
0910.5027 | Information-theoretically Secret Key Generation for Fading Wireless
Channels | cs.CR cs.IT math.IT | The multipath-rich wireless environment associated with typical wireless
usage scenarios is characterized by a fading channel response that is
time-varying, location-sensitive, and uniquely shared by a given
transmitter-receiver pair. The complexity associated with a richly scattering
environment implies that the sho... |
0910.5073 | A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding
Codes | cs.IT math.IT | Conflict-avoiding codes are used in the multiple-access collision channel
without feedback. The number of codewords in a conflict-avoiding code is the
number of potential users that can be supported in the system. In this paper, a
new upper bound on the size of conflict-avoiding codes is proved. This upper
bound is g... |
0910.5076 | Algorithmic randomness and monotone complexity on product space | cs.IT math.IT | We study algorithmic randomness and monotone complexity on product of the set
of infinite binary sequences. We explore the following problems: monotone
complexity on product space, Lambalgen's theorem for correlated probability,
classification of random sets by likelihood ratio tests, decomposition of
complexity and ... |
0910.5135 | Error-correcting codes and phase transitions | cs.IT math.IT math.QA | The theory of error-correcting codes is concerned with constructing codes
that optimize simultaneously transmission rate and relative minimum distance.
These conflicting requirements determine an asymptotic bound, which is a
continuous curve in the space of parameters. The main goal of this paper is to
relate the asy... |
0910.5146 | Compressed sensing performance bounds under Poisson noise | cs.IT math.IT | This paper describes performance bounds for compressed sensing (CS) where the
underlying sparse or compressible (sparsely approximable) signal is a vector of
nonnegative intensities whose measurements are corrupted by Poisson noise. In
this setting, standard CS techniques cannot be applied directly for several
reason... |
0910.5260 | A Gradient Descent Algorithm on the Grassman Manifold for Matrix
Completion | cs.NA cs.LG | We consider the problem of reconstructing a low-rank matrix from a small
subset of its entries. In this paper, we describe the implementation of an
efficient algorithm called OptSpace, based on singular value decomposition
followed by local manifold optimization, for solving the low-rank matrix
completion problem. It... |
0910.5261 | On Detection With Partial Information In The Gaussian Setup | cs.IT cs.CR math.IT | We introduce the problem of communication with partial information, where
there is an asymmetry between the transmitter and the receiver codebooks.
Practical applications of the proposed setup include the robust signal hashing
problem within the context of multimedia security and asymmetric communications
with resour... |
0910.5264 | A Sequential Problem in Decentralized Detection with Communication | math.OC cs.IT math.IT | A sequential problem in decentralized detection is considered. Two observers
can make repeated noisy observations of a binary hypothesis on the state of the
environment. At any time, observer 1 can stop and send a final binary message
to observer 2 or it may continue to take more measurements. Every time observer
1 p... |
0910.5339 | On Physically Secure and Stable Slotted ALOHA System | cs.IT math.IT | In this paper, we consider the standard discrete-time slotted ALOHA with a
finite number of terminals with infinite size buffers. In our study, we jointly
consider the stability of this system together with the physical layer
security. We conduct our studies on both dominant and original systems, where
in a dominant ... |
0910.5386 | A theoretical foundation for building Knowledge-work Support Systems | cs.HC cs.DL cs.IR | In this paper we propose a novel approach aimed at building a new class of
information system platforms which we call the "Knowledge-work Support Systems"
or KwSS. KwSS can play a significant role in enhancing the IS support for
knowledge management processes, including those customarily identified as less
amenable t... |
0910.5405 | Artificial Immune Tissue using Self-Orgamizing Networks | cs.AI cs.NE | As introduced by Bentley et al. (2005), artificial immune systems (AIS) are
lacking tissue, which is present in one form or another in all living
multi-cellular organisms. Some have argued that this concept in the context of
AIS brings little novelty to the already saturated field of the immune inspired
computational... |
0910.5410 | The Uned systems at Senseval-2 | cs.CL cs.AI | We have participated in the SENSEVAL-2 English tasks (all words and lexical
sample) with an unsupervised system based on mutual information measured over a
large corpus (277 million words) and some additional heuristics. A supervised
extension of the system was also presented to the lexical sample task.
Our system ... |
0910.5419 | Word Sense Disambiguation Based on Mutual Information and Syntactic
Patterns | cs.CL cs.AI | This paper describes a hybrid system for WSD, presented to the English
all-words and lexical-sample tasks, that relies on two different unsupervised
approaches. The first one selects the senses according to mutual information
proximity between a context word a variant of the sense. The second heuristic
analyzes the e... |
0910.5454 | The Cyborg Astrobiologist: Testing a Novelty-Detection Algorithm on Two
Mobile Exploration Systems at Rivas Vaciamadrid in Spain and at the Mars
Desert Research Station in Utah | cs.CV astro-ph.EP astro-ph.IM cs.LG stat.ML | (ABRIDGED) In previous work, two platforms have been developed for testing
computer-vision algorithms for robotic planetary exploration (McGuire et al.
2004b,2005; Bartolo et al. 2007). The wearable-computer platform has been
tested at geological and astrobiological field sites in Spain (Rivas
Vaciamadrid and Riba de... |
0910.5461 | Anomaly Detection with Score functions based on Nearest Neighbor Graphs | cs.LG | We propose a novel non-parametric adaptive anomaly detection algorithm for
high dimensional data based on score functions derived from nearest neighbor
graphs on $n$-point nominal data. Anomalies are declared whenever the score of
a test sample falls below $\alpha$, which is supposed to be the desired false
alarm lev... |
0910.5516 | Finding overlapping communities in networks by label propagation | physics.soc-ph cs.SI | We propose an algorithm for finding overlapping community structure in very
large networks. The algorithm is based on the label propagation technique of
Raghavan, Albert, and Kumara, but is able to detect communities that overlap.
Like the original algorithm, vertices have labels that propagate between
neighbouring v... |
0910.5537 | An Analysis of Phase Synchronization Mismatch Sensitivity for Coherent
MIMO Radar Systems | cs.IT math.IT | In this study, the hybrid Cramer-Rao bound (CRB) is developed for target
localization, to establish the sensitivity of the estimation mean-square error
(MSE) to the level of phase synchronization mismatch in coherent Multiple-Input
Multiple-Output (MIMO) radar systems with widely distributed antennas. The
lower bound... |
0910.5542 | Forced Evolution in Silico by Artificial Transposons and their Genetic
Operators: The John Muir Ant Problem | cs.NE cs.AI | Modern evolutionary computation utilizes heuristic optimizations based upon
concepts borrowed from the Darwinian theory of natural selection. We believe
that a vital direction in this field must be algorithms that model the activity
of genomic parasites, such as transposons, in biological evolution. This
publication ... |
0910.5559 | On the characterization of the regions of feasible trajectories in the
workspace of parallel manipulators | cs.RO | It was shown recently that parallel manipulators with several inverse
kinematic solutions have the ability to avoid parallel singularities [Chablat
1998a] and self-collisions [Chablat 1998b] by choosing appropriate joint
configurations for the legs. In effect, depending on the joint configurations
of the legs, a give... |
0910.5673 | Synchronization and Transient Stability in Power Networks and
Non-Uniform Kuramoto Oscillators | math.OC cs.SY math-ph math.DS math.MP | Motivated by recent interest for multi-agent systems and smart power grid
architectures, we discuss the synchronization problem for the network-reduced
model of a power system with non-trivial transfer conductances. Our key insight
is to exploit the relationship between the power network model and a
first-order model... |
0910.5682 | Word Sense Disambiguation Using English-Spanish Aligned Phrases over
Comparable Corpora | cs.CL cs.AI | In this paper we describe a WSD experiment based on bilingual English-Spanish
comparable corpora in which individual noun phrases have been identified and
aligned with their respective counterparts in the other language. The
evaluation of the experiment has been carried out against SemCor.
We show that, with the al... |
0910.5697 | High Dimensional Error-Correcting Codes | cs.IT math.IT | In this paper we construct multidimensional codes with high dimension. The
codes can correct high dimensional errors which have the form of either small
clusters, or confined to an area with a small radius. We also consider small
number of errors in a small area. The clusters which are discussed are mainly
spheres su... |
0910.5759 | Secure Source Coding with a Helper | cs.IT math.IT | We consider a secure source coding problem with a rate-limited helper. In
particular, Alice observes an independent and identically distributed (i.i.d.)
source X and wishes to transmit this source losslessly to Bob over a
rate-limited link. A helper (Helen), observes an i.i.d. correlated source Y and
can transmit inf... |
0910.5761 | Which graphical models are difficult to learn? | stat.ML cond-mat.stat-mech cs.LG | We consider the problem of learning the structure of Ising models (pairwise
binary Markov random fields) from i.i.d. samples. While several methods have
been proposed to accomplish this task, their relative merits and limitations
remain somewhat obscure. By analyzing a number of concrete examples, we show
that low-co... |
0910.5794 | Calibration of 3-d.o.f. Translational Parallel Manipulators Using Leg
Observations | cs.RO | The paper proposes a novel approach for the geometrical model calibration of
quasi-isotropic parallel kinematic mechanisms of the Orthoglide family. It is
based on the observations of the manipulator leg parallelism during motions
between the specific test postures and employs a low-cost measuring system
composed of ... |
0910.5904 | A quantitative notion of redundancy for finite frames | math.FA cs.IT math.IT | The objective of this paper is to improve the customary definition of
redundancy by providing quantitative measures in its place, which we coin upper
and lower redundancies, that match better with an intuitive understanding of
redundancy for finite frames in a Hilbert space. This motivates a carefully
chosen list of ... |
0910.5932 | Metric and Kernel Learning using a Linear Transformation | cs.LG cs.CV cs.IR | Metric and kernel learning are important in several machine learning
applications. However, most existing metric learning algorithms are limited to
learning metrics over low-dimensional data, while existing kernel learning
algorithms are often limited to the transductive setting and do not generalize
to new data poin... |
0910.5950 | Limits on the Robustness of MIMO Joint Source-Channel Codes | cs.IT math.IT | In this paper, the theoretical limits on the robustness of MIMO joint source
channel codes is investigated. The case in which a single joint source channel
code is used for the entire range of SNRs and for all levels of required
fidelity is considered. Limits on the asymptotic performance of such a system
are charact... |
0911.0050 | How to Compare the Scientific Contributions between Research Groups | cs.IR cs.CY | We present a method to analyse the scientific contributions between research
groups. Given multiple research groups, we construct their journal/proceeding
graphs and then compute the similarity/gap between them using network analysis.
This analysis can be used for measuring similarity/gap of the topics/qualities
betw... |
0911.0054 | Learning Exponential Families in High-Dimensions: Strong Convexity and
Sparsity | cs.LG stat.ML | The versatility of exponential families, along with their attendant convexity
properties, make them a popular and effective statistical model. A central
issue is learning these models in high-dimensions, such as when there is some
sparsity pattern of the optimal parameter. This work characterizes a certain
strong con... |
0911.0089 | A Secure Communication Game with a Relay Helping the Eavesdropper | cs.IT math.IT | In this work a four terminal Gaussian network composed of a source, a
destination, an eavesdropper and a jammer relay is studied. The jammer relay
does not hear the source transmission. It assists the eavesdropper and aims to
decrease the achievable secrecy rates. The source, on the other hand, aims to
increase the a... |
0911.0090 | Context-free pairs of groups I: Context-free pairs and graphs | math.GR cs.IT math.IT | Let $G$ be a finitely generated group, $A$ a finite set of generators and $K$
a subgroup of $G$. We call the pair $(G,K)$ context-free if the set of all
words over $A$ that reduce in $G$ to an element of $K$ is a context-free
language. When $K$ is trivial, $G$ itself is called context-free; context-free
groups have b... |
0911.0130 | Minimal Polynomial Algorithms for Finite Sequences | cs.IT cs.DM cs.SC math.IT | We show that a straightforward rewrite of a known minimal polynomial
algorithm yields a simpler version of a recent algorithm of A. Salagean.
|
0911.0143 | Large Families of Optimal Two-Dimensional Optical Orthogonal Codes | cs.IT math.IT | Nine new 2-D OOCs are presented here, all sharing the common feature of a
code size that is much larger in relation to the number of time slots than
those of constructions appearing previously in the literature. Each of these
constructions is either optimal or asymptotically optimal with respect to
either the origina... |
0911.0183 | A Gibbs Sampling Based MAP Detection Algorithm for OFDM Over Rapidly
Varying Mobile Radio Channels | cs.IT math.AC math.IT | In orthogonal frequency-division multiplexing (OFDM) systems operating over
rapidly time-varying channels, the orthogonality between subcarriers is
destroyed leading to inter-carrier interference (ICI) and resulting in an
irreducible error floor. In this paper, a new and low-complexity maximum {\em a
posteriori} prob... |
0911.0225 | A Mirroring Theorem and its Application to a New Method of Unsupervised
Hierarchical Pattern Classification | cs.LG | In this paper, we prove a crucial theorem called Mirroring Theorem which
affirms that given a collection of samples with enough information in it such
that it can be classified into classes and subclasses then (i) There exists a
mapping which classifies and subclassifies these samples (ii) There exists a
hierarchical... |
0911.0231 | Synchronized Task Decomposition for Cooperative Multi-agent Systems | cs.MA cs.DC cs.SY | It is an amazing fact that remarkably complex behaviors could emerge from a
large collection of very rudimentary dynamical agents through very simple local
interactions. However, it still remains elusive on how to design these local
interactions among agents so as to achieve certain desired collective
behaviors. This... |
0911.0232 | Distributed strategies for generating weight-balanced and doubly
stochastic digraphs | math.OC cs.SY | Weight-balanced and doubly stochastic digraphs are two classes of digraphs
that play an essential role in a variety of cooperative control problems,
including formation control, distributed averaging, and optimization. We refer
to a digraph as doubly stochasticable (weight-balanceable) if it admits a
doubly stochasti... |
0911.0351 | On the precoder design of flat fading MIMO systems equipped with MMSE
receivers: a large system approach | cs.IT math.IT | This paper is devoted to the design of precoders maximizing the ergodic
mutual information (EMI) of bi-correlated flat fading MIMO systems equiped with
MMSE receivers. The channel state information and the second order statistics
of the channel are assumed available at the receiver side and at the
transmitter side re... |
0911.0460 | Feature-Weighted Linear Stacking | cs.LG cs.AI | Ensemble methods, such as stacking, are designed to boost predictive accuracy
by blending the predictions of multiple machine learning models. Recent work
has shown that the use of meta-features, additional inputs describing each
example in a dataset, can boost the performance of ensemble methods, but the
greatest re... |
0911.0462 | Strange Bedfellows: Quantum Mechanics and Data Mining | cs.LG physics.data-an quant-ph | Last year, in 2008, I gave a talk titled {\it Quantum Calisthenics}. This
year I am going to tell you about how the work I described then has spun off
into a most unlikely direction. What I am going to talk about is how one maps
the problem of finding clusters in a given data set into a problem in quantum
mechanics. ... |
0911.0467 | On Secure Network Coding with Nonuniform or Restricted Wiretap Sets | cs.IT math.IT | The secrecy capacity of a network, for a given collection of permissible
wiretap sets, is the maximum rate of communication such that observing links in
any permissible wiretap set reveals no information about the message. This
paper considers secure network coding with nonuniform or restricted wiretap
sets, for exam... |
0911.0481 | An Optimal Method For Wake Detection In SAR Images Using Radon
Transformation Combined With Wavelet Filters | cs.CV | A new fangled method for ship wake detection in synthetic aperture radar
(SAR) images is explored here. Most of the detection procedure applies the
Radon transform as its properties outfit more than any other transformation for
the detection purpose. But still it holds problems when the transform is
applied to an ima... |
0911.0485 | Novel Intrusion Detection using Probabilistic Neural Network and
Adaptive Boosting | cs.NE cs.LG | This article applies Machine Learning techniques to solve Intrusion Detection
problems within computer networks. Due to complex and dynamic nature of
computer networks and hacking techniques, detecting malicious activities
remains a challenging task for security experts, that is, currently available
defense systems s... |
0911.0486 | Building a Vietnamese Language Query Processing Framework for ELibrary
Searching Systems | cs.DL cs.IR | In the objective of building intelligent searching systems for Elibraries or
online bookstores, we have proposed a searching system model based on a
Vietnamese language query processing component. Such document searching systems
based on this model can allow users to use Vietnamese queries that represent
content info... |
0911.0490 | Breast Cancer Detection Using Multilevel Thresholding | cs.CV | This paper presents an algorithm which aims to assist the radiologist in
identifying breast cancer at its earlier stages. It combines several image
processing techniques like image negative, thresholding and segmentation
techniques for detection of tumor in mammograms. The algorithm is verified by
using mammograms fr... |
0911.0492 | PARNES: A rapidly convergent algorithm for accurate recovery of sparse
and approximately sparse signals | math.OC cs.SY math.NA | In this article, we propose an algorithm, NESTA-LASSO, for the LASSO problem,
i.e., an underdetermined linear least-squares problem with a 1-norm constraint
on the solution. We prove under the assumption of the restricted isometry
property (RIP) and a sparsity condition on the solution, that NESTA-LASSO is
guaranteed... |
0911.0499 | An Innovative Scheme For Effectual Fingerprint Data Compression Using
Bezier Curve Representations | cs.CV cs.CR cs.MM | Naturally, with the mounting application of biometric systems, there arises a
difficulty in storing and handling those acquired biometric data. Fingerprint
recognition has been recognized as one of the most mature and established
technique among all the biometrics systems. In recent times, with fingerprint
recognitio... |
0911.0505 | Scientific Data Mining in Astronomy | astro-ph.IM cs.DB cs.IR physics.data-an | We describe the application of data mining algorithms to research problems in
astronomy. We posit that data mining has always been fundamental to
astronomical research, since data mining is the basis of evidence-based
discovery, including classification, clustering, and novelty discovery. These
algorithms represent a... |
0911.0508 | Optimization and Evaluation of Nested Queries and Procedures | cs.DB | Many database applications perform complex data retrieval and update tasks.
Nested queries, and queries that invoke user-defined functions, which are
written using a mix of procedural and SQL constructs, are often used in such
applications. A straight-forward evaluation of such queries involves repeated
execution of ... |
0911.0519 | Xampling: Signal Acquisition and Processing in Union of Subspaces | cs.IT math.IT | We introduce Xampling, a unified framework for signal acquisition and
processing of signals in a union of subspaces. The main functions of this
framework are two. Analog compression that narrows down the input bandwidth
prior to sampling with commercial devices. A nonlinear algorithm then detects
the input subspace p... |
0911.0645 | Bayes estimators for phylogenetic reconstruction | q-bio.PE cs.LG q-bio.QM | Tree reconstruction methods are often judged by their accuracy, measured by
how close they get to the true tree. Yet most reconstruction methods like ML do
not explicitly maximize this accuracy. To address this problem, we propose a
Bayesian solution. Given tree samples, we propose finding the tree estimate
which is ... |
0911.0660 | The capacity region of a product of two unmatched Gaussian broadcast
channels with three particular messages and a common message | cs.IT math.IT | This paper considers a Gaussian broadcast channel with two unmatched degraded
components, three particular messages, and a common message that is intended
for all three receivers. It is shown that for this channel superposition coding
and Gaussian signalling is sufficient to achieve every point in the capacity
region... |
0911.0696 | A proof of the log-concavity conjecture related to the computation of
the ergodic capacity of MIMO channels | cs.IT math.IT | An upper bound on the ergodic capacity of {\bf MIMO} channels was introduced
recently in arXiv:0903.1952. This upper bound amounts to the maximization on
the simplex of some multilinear polynomial $p(\lambda_1,...,\lambda_n)$ with
non-negative coefficients. Interestingly, the coefficients are subpermanents of
some no... |
0911.0709 | Constellation Precoded Multiple Beamforming | cs.IT math.IT | Beamforming techniques that employ Singular Value Decomposition (SVD) are
commonly used in Multi-Input Multi-Output (MIMO) wireless communication
systems. In the absence of channel coding, when a single symbol is transmitted,
these systems achieve the full diversity order provided by the channel; whereas
when multipl... |
0911.0736 | A simple proof that random matrices are democratic | math.NA cs.IT math.IT | The recently introduced theory of compressive sensing (CS) enables the
reconstruction of sparse or compressible signals from a small set of
nonadaptive, linear measurements. If properly chosen, the number of
measurements can be significantly smaller than the ambient dimension of the
signal and yet preserve the signif... |
0911.0737 | Multiple Description Coding of Discrete Ergodic Sources | cs.IT math.IT | We investigate the problem of Multiple Description (MD) coding of discrete
ergodic processes. We introduce the notion of MD stationary coding, and
characterize its relationship to the conventional block MD coding. In
stationary coding, in addition to the two rate constraints normally considered
in the MD problem, we ... |
0911.0753 | An XML-based Multi-Agent System for Supporting Online Recruitment
Services | cs.MA | In this paper we propose an XML-based multi-agent recommender system for
supporting online recruitment services. Our system is characterized by the
following features: {\em (i)} it handles user profiles for personalizing the
job search over the Internet; {\em (ii)} it is based on the Intelligent Agent
Technology; {\e... |
0911.0781 | A Way to Understand Various Patterns of Data Mining Techniques for
Selected Domains | cs.DB cs.IR | This has much in common with traditional work in statistics and machine
learning. However, there are important new issues which arise because of the
sheer size of the data. One of the important problem in data mining is the
Classification-rule learning which involves finding rules that partition given
data into prede... |
0911.0787 | Generalized Discriminant Analysis algorithm for feature reduction in
Cyber Attack Detection System | cs.CR cs.CV cs.NE | This Generalized Discriminant Analysis (GDA) has provided an extremely
powerful approach to extracting non linear features. The network traffic data
provided for the design of intrusion detection system always are large with
ineffective information, thus we need to remove the worthless information from
the original h... |
0911.0801 | Tractable hypergraph properties for constraint satisfaction and
conjunctive queries | cs.DS cs.CC cs.DB cs.DM | An important question in the study of constraint satisfaction problems (CSP)
is understanding how the graph or hypergraph describing the incidence structure
of the constraints influences the complexity of the problem. For binary CSP
instances (i.e., where each constraint involves only two variables), the
situation is... |
0911.0820 | Power and Transmission Duration Control for Un-Slotted Cognitive Radio
Networks | cs.IT math.IT | We consider an unslotted primary channel with alternating on/off activity and
provide a solution to the problem of finding the optimal secondary transmission
power and duration given some sensing outcome. The goal is to maximize a
weighted sum of the primary and secondary throughput where the weight is
determined by ... |
0911.0844 | Sampling and Reconstruction of Signals in a Reproducing Kernel Subspace
of $L^p({\Bbb R}^d)$ | cs.IT math.FA math.IT | In this paper, we consider sampling and reconstruction of signals in a
reproducing kernel subspace of $L^p(\Rd), 1\le p\le \infty$, associated with an
idempotent integral operator whose kernel has certain off-diagonal decay and
regularity. The space of $p$-integrable non-uniform splines and the
shift-invariant spaces... |
0911.0874 | State Information in Bayesian Games | cs.IT cs.CR cs.GT math.IT | Two-player zero-sum repeated games are well understood. Computing the value
of such a game is straightforward. Additionally, if the payoffs are dependent
on a random state of the game known to one, both, or neither of the players,
the resulting value of the game has been analyzed under the framework of
Bayesian games... |
0911.0894 | A New Computational Schema for Euphonic Conjunctions in Sanskrit
Processing | cs.CL | Automated language processing is central to the drive to enable facilitated
referencing of increasingly available Sanskrit E texts. The first step towards
processing Sanskrit text involves the handling of Sanskrit compound words that
are an integral part of Sanskrit texts. This firstly necessitates the
processing of ... |
0911.0905 | Combining Training and Quantized Feedback in Multi-Antenna Reciprocal
Channels | cs.IT math.IT | The communication between a multiple-antenna transmitter and multiple
receivers (users) with either a single or multiple-antenna each can be
significantly enhanced by providing the channel state information at the
transmitter (CSIT) of the users, as this allows for scheduling, beamforming and
multiuser multiplexing g... |
0911.0907 | ANN-based Innovative Segmentation Method for Handwritten text in
Assamese | cs.CL | Artificial Neural Network (ANN) s has widely been used for recognition of
optically scanned character, which partially emulates human thinking in the
domain of the Artificial Intelligence. But prior to recognition, it is
necessary to segment the character from the text to sentences, words etc.
Segmentation of words i... |
0911.0912 | Multi-Agent System Interaction in Integrated SCM | cs.MA | Coordination between organizations on strategic, tactical and operation
levels leads to more effective and efficient supply chains. Supply chain
management is increasing day by day in modern enterprises. The environment is
becoming competitive and many enterprises will find it difficult to survive if
they do not make... |
0911.0914 | Enhanced Trustworthy and High-Quality Information Retrieval System for
Web Search Engines | cs.IR | The WWW is the most important source of information. But, there is no
guarantee for information correctness and lots of conflicting information is
retrieved by the search engines and the quality of provided information also
varies from low quality to high quality. We provide enhanced trustworthiness in
both specific ... |
0911.0971 | Multicell Zero-Forcing and User Scheduling on the Downlink of a Linear
Cell Array | cs.IT math.IT | Coordinated base station (BS) transmission has attracted much interest for
its potential to increase the capacity of wireless networks. Yet at the same
time, the achievable sum-rate with single-cell processing (SCP) scales
optimally with the number of users under Rayleigh fading conditions. One may
therefore ask if t... |
0911.1021 | Examples as Interaction: On Humans Teaching a Computer to Play a Game | cs.AI cs.GT | This paper reviews an experiment in human-computer interaction, where
interaction takes place when humans attempt to teach a computer to play a
strategy board game. We show that while individually learned models can be
shown to improve the playing performance of the computer, their straightforward
composition results... |
0911.1054 | Sum Rates, Rate Allocation, and User Scheduling for Multi-User MIMO
Vector Perturbation Precoding | cs.IT math.IT | This paper considers the multiuser multiple-input multiple-output (MIMO)
broadcast channel. We consider the case where the multiple transmit antennas
are used to deliver independent data streams to multiple users via vector
perturbation. We derive expressions for the sum rate in terms of the average
energy of the pre... |
0911.1072 | Error Correcting Coding for a Non-symmetric Ternary Channel | cs.IT math.IT | Ternary channels can be used to model the behavior of some memory devices,
where information is stored in three different levels. In this paper, error
correcting coding for a ternary channel where some of the error transitions are
not allowed, is considered. The resulting channel is non-symmetric, therefore
classical... |
0911.1082 | Ergodic Fading One-sided Interference Channels without State Information
at Transmitters | cs.IT math.IT | This work studies the capacity region of a two-user ergodic interference
channel with fading, where only one of the users is subject to interference
from the other user, and the channel state information (CSI) is only available
at the receivers. A layered erasure model with one-sided interference and with
arbitrary f... |
0911.1090 | On the Capacity of Constrained Systems | cs.IT math.IT | In the first chapter of Shannon's "A Mathematical Theory of Communication,"
it is shown that the maximum entropy rate of an input process of a constrained
system is limited by the combinatorial capacity of the system. Shannon
considers systems where the constraints define regular languages and uses
results from matri... |
0911.1112 | Memento: Time Travel for the Web | cs.IR cs.DL | The Web is ephemeral. Many resources have representations that change over
time, and many of those representations are lost forever. A lucky few manage to
reappear as archived resources that carry their own URIs. For example, some
content management systems maintain version pages that reflect a frozen prior
state of ... |
0911.1174 | Sharp Dichotomies for Regret Minimization in Metric Spaces | cs.DS cs.LG | The Lipschitz multi-armed bandit (MAB) problem generalizes the classical
multi-armed bandit problem by assuming one is given side information consisting
of a priori upper bounds on the difference in expected payoff between certain
pairs of strategies. Classical results of (Lai and Robbins 1985) and (Auer et
al. 2002)... |
0911.1275 | Continuity of mutual entropy in the large signal-to-noise ratio limit | cs.IT cs.IR math.IT math.PR | This article addresses the issue of the proof of the entropy power inequality
(EPI), an important tool in the analysis of Gaussian channels of information
transmission, proposed by Shannon.
We analyse continuity properties of the mutual entropy of the input and
output signals in an additive memoryless channel and d... |
0911.1298 | Affine Grassmann Codes | cs.IT math.AG math.IT | We consider a new class of linear codes, called affine Grassmann codes. These
can be viewed as a variant of generalized Reed-Muller codes and are closely
related to Grassmann codes. We determine the length, dimension, and the minimum
distance of any affine Grassmann code. Moreover, we show that affine Grassmann
codes... |
0911.1305 | Retrieval of very large numbers of items in the Web of Science: an
exercise to develop accurate search strategies | cs.DL cs.IR physics.soc-ph | The current communication presents a simple exercise with the aim of solving
a singular problem: the retrieval of extremely large amounts of items in the
Web of Science interface. As it is known, Web of Science interface allows a
user to obtain at most 100,000 items from a single query. But what about
queries that ac... |
0911.1318 | The relation between Pearson's correlation coefficient r and Salton's
cosine measure | cs.IR stat.ME | The relation between Pearson's correlation coefficient and Salton's cosine
measure is revealed based on the different possible values of the division of
the L1-norm and the L2-norm of a vector. These different values yield a sheaf
of increasingly straight lines which form together a cloud of points, being the
investi... |
0911.1320 | Knowledge linkage structures in communication studies using citation
analysis among communication journals | cs.DL cs.IR physics.soc-ph | This research analyzes a "who cites whom" matrix in terms of aggregated,
journal-journal citations to determine the location of communication studies on
the academic spectrum. Using the Journal of Communication as the seed journal,
the 2006 data in the Journal Citation Reports are used to map communication
studies. T... |
0911.1346 | Optimal Approximation Algorithms for Multi-agent Combinatorial Problems
with Discounted Price Functions | cs.MA cs.DS | Submodular functions are an important class of functions in combinatorial
optimization which satisfy the natural properties of decreasing marginal costs.
The study of these functions has led to strong structural properties with
applications in many areas. Recently, there has been significant interest in
extending the... |
0911.1368 | Performance Bounds for Expander-based Compressed Sensing in the presence
of Poisson Noise | cs.IT math.IT | This paper provides performance bounds for compressed sensing in the presence
of Poisson noise using expander graphs. The Poisson noise model is appropriate
for a variety of applications, including low-light imaging and digital
streaming, where the signal-independent and/or bounded noise models used in the
compressed... |
0911.1383 | Information Geometry and Evolutionary Game Theory | cs.IT cs.GT math.DS math.IT nlin.AO | The Shahshahani geometry of evolutionary game theory is realized as the
information geometry of the simplex, deriving from the Fisher information
metric of the manifold of categorical probability distributions. Some essential
concepts in evolutionary game theory are realized information-theoretically.
Results are ext... |
0911.1386 | Machine Learning: When and Where the Horses Went Astray? | cs.AI cs.LG | Machine Learning is usually defined as a subfield of AI, which is busy with
information extraction from raw data sets. Despite of its common acceptance and
widespread recognition, this definition is wrong and groundless. Meaningful
information does not belong to the data that bear it. It belongs to the
observers of t... |
0911.1388 | Binary Non-tiles | cs.DM cs.IT math.CO math.IT | A subset V of GF(2)^n is a tile if GF(2)^n can be covered by disjoint
translates of V. In other words, V is a tile if and only if there is a subset A
of GF(2)^n such that V+A = GF(2)^n uniquely (i.e., v + a = v' + a' implies that
v=v' and a=a' where v,v' in V and a,a' in A). In some problems in coding theory
and hash... |
0911.1419 | Belief Propagation and Loop Calculus for the Permanent of a Non-Negative
Matrix | cs.DS cond-mat.stat-mech cs.DM cs.LG cs.NA math.OC | We consider computation of permanent of a positive $(N\times N)$ non-negative
matrix, $P=(P_i^j|i,j=1,\cdots,N)$, or equivalently the problem of weighted
counting of the perfect matchings over the complete bipartite graph $K_{N,N}$.
The problem is known to be of likely exponential complexity. Stated as the
partition ... |
0911.1426 | On the Capacity of the Half-Duplex Diamond Channel | cs.IT math.IT | In this paper, a dual-hop communication system composed of a source S and a
destination D connected through two non-interfering half-duplex relays, R1 and
R2, is considered. In the literature of Information Theory, this configuration
is known as the diamond channel. In this setup, four transmission modes are
present,... |
0911.1447 | On the Normalization and Visualization of Author Co-Citation Data
Salton's Cosine versus the Jaccard Index | physics.soc-ph cs.DL cs.IR | The debate about which similarity measure one should use for the
normalization in the case of Author Co-citation Analysis (ACA) is further
complicated when one distinguishes between the symmetrical co-citation--or,
more generally, co-occurrence--matrix and the underlying asymmetrical
citation--occurrence--matrix. In ... |
0911.1451 | Co-word Analysis using the Chinese Character Set | cs.CL cs.DL | Until recently, Chinese texts could not be studied using co-word analysis
because the words are not separated by spaces in Chinese (and Japanese). A word
can be composed of one or more characters. The online availability of programs
that separate Chinese texts makes it possible to analyze them using semantic
maps. Ch... |
0911.1516 | A Discourse-based Approach in Text-based Machine Translation | cs.CL | This paper presents a theoretical research based approach to ellipsis
resolution in machine translation. The formula of discourse is applied in order
to resolve ellipses. The validity of the discourse formula is analyzed by
applying it to the real world text, i.e., newspaper fragments. The source text
is converted in... |
0911.1517 | Resolution of Unidentified Words in Machine Translation | cs.CL | This paper presents a mechanism of resolving unidentified lexical units in
Text-based Machine Translation (TBMT). In a Machine Translation (MT) system it
is unlikely to have a complete lexicon and hence there is intense need of a new
mechanism to handle the problem of unidentified words. These unknown words
could be ... |
0911.1564 | New Bounds for Restricted Isometry Constants | cs.IT math.IT | In this paper we show that if the restricted isometry constant $\delta_k$ of
the compressed sensing matrix satisfies \[ \delta_k < 0.307, \] then $k$-sparse
signals are guaranteed to be recovered exactly via $\ell_1$ minimization when
no noise is present and $k$-sparse signals can be estimated stably in the noisy
cas... |
0911.1582 | Manipulating Tournaments in Cup and Round Robin Competitions | cs.AI cs.GT cs.MA | In sports competitions, teams can manipulate the result by, for instance,
throwing games. We show that we can decide how to manipulate round robin and
cup competitions, two of the most popular types of sporting competitions in
polynomial time. In addition, we show that finding the minimal number of games
that need to... |
0911.1672 | Biological Computing Fundamentals and Futures | cs.CE q-bio.OT | The fields of computing and biology have begun to cross paths in new ways. In
this paper a review of the current research in biological computing is
presented. Fundamental concepts are introduced and these foundational elements
are explored to discuss the possibilities of a new computing paradigm. We
assume the reade... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.