id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1008.0938 | Emergence of Zipf's Law in the Evolution of Communication | nlin.AO cond-mat.stat-mech cs.IT math-ph math.IT math.MP physics.soc-ph | Zipf's law seems to be ubiquitous in human languages and appears to be a
universal property of complex communicating systems. Following the early
proposal made by Zipf concerning the presence of a tension between the efforts
of speaker and hearer in a communication system, we introduce evolution by
means of a variati... |
1008.0941 | Timing matters: Lessons From The CA Literature On Updating | cs.MA nlin.AO nlin.CG | In the present article we emphasize the importance of modeling time in the
context of agent-based models. To this end, we present a (selective) survey of
the Cellular Automata-literature on updating and draw parallels to the issue of
agent activation in agent-based models. By means of two simple models,
Schelling's s... |
1008.0961 | On the Shannon Cipher System With a Wiretapper Guessing Subject to
Distortion and Reliability Requirements | cs.IT math.IT | In this paper we discuss the processes in the Shannon cipher system with
discrete memoryless source and a guessing wiretapper. The wiretapper observes a
cryptogram of $N$-vector of ciphered messages in the public channel and tries
to guess successively the vector of messages within given distortion level
$\Delta$ and... |
1008.1043 | Aggregate Interference Modeling in Cognitive Radio Networks with Power
and Contention Control | cs.IT math.IT | In this paper, we present an interference model for cognitive radio (CR)
networks employing power control, contention control or hybrid power/contention
control schemes. For the first case, a power control scheme is proposed to
govern the transmission power of a CR node. For the second one, a contention
control schem... |
1008.1047 | Robust Adaptive Beamforming Based on Steering Vector Estimation via
Semidefinite Programming Relaxation | cs.IT math.IT math.OC stat.AP | We develop a new approach to robust adaptive beamforming in the presence of
signal steering vector errors. Since the signal steering vector is known
imprecisely, its presumed (prior) value is used to find a more accurate
estimate of the actual steering vector, which then is used for obtaining the
optimal beamforming ... |
1008.1079 | Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing | cs.IT math.CO math.IT | We consider perfect secret key generation for a ``pairwise independent
network'' model in which every pair of terminals share a random binary string,
with the strings shared by distinct terminal pairs being mutually independent.
The terminals are then allowed to communicate interactively over a public
noiseless chann... |
1008.1096 | The Naming Game in Social Networks: Community Formation and Consensus
Engineering | physics.soc-ph cond-mat.stat-mech cs.MA | We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat.
Mech.: Theory Exp. P06014] in empirical social networks. This stylized
agent-based model captures essential features of agreement dynamics in a
network of autonomous agents, corresponding to the development of shared
classification schemes ... |
1008.1140 | On Two Strong Converse Theorems for Stationary Discrete Memoryless
Channels | cs.IT math.IT | In 1973, Arimoto proved the strong converse theorem for the discrete
memoryless channels stating that when transmission rate $R$ is above channel
capacity $C$, the error probability of decoding goes to one as the block length
$n$ of code word tends to infinity. He proved the theorem by deriving the
exponent function ... |
1008.1145 | Linear Beamforming for the Spatially Correlated MISO broadcast channel | cs.IT math.IT | A spatially correlated broadcast setting with M antennas at the base station
and M users (each with a single antenna) is considered. We assume that the
users have perfect channel information about their links and the base station
has only statistical information about each user's link. The base station
employs a line... |
1008.1150 | Modeling the growth of fingerprints improves matching for adolescents | cs.CV stat.AP | We study the effect of growth on the fingerprints of adolescents, based on
which we suggest a simple method to adjust for growth when trying to recover a
juvenile's fingerprint in a database years later. Based on longitudinal data
sets in juveniles' criminal records, we show that growth essentially leads to
an isotro... |
1008.1188 | Data visualization in political and social sciences | cs.GR cs.CE cs.CY | The basic objective of data visualization is to provide an efficient
graphical display for summarizing and reasoning about quantitative information.
During the last decades, political science has accumulated a large corpus of
various kinds of data such as comprehensive factbooks and atlases,
characterizing all or mos... |
1008.1191 | Improved Fast Similarity Search in Dictionaries | cs.IR cs.DS | We engineer an algorithm to solve the approximate dictionary matching
problem. Given a list of words $\mathcal{W}$, maximum distance $d$ fixed at
preprocessing time and a query word $q$, we would like to retrieve all words
from $\mathcal{W}$ that can be transformed into $q$ with $d$ or less edit
operations. We presen... |
1008.1270 | Proceedings Twelfth Annual Workshop on Descriptional Complexity of
Formal Systems | cs.FL cs.CC cs.DM cs.IT cs.LO math.IT | The 12th annual workshop, Descriptional Complexity of Formal Systems 2010, is
taking place in Saskatoon, Canada, on August 8-10, 2010. It is jointly
organized by the IFIP Working Group 1.2 on Descriptional Complexity and by the
Department of Computer Science at the University of Saskatchewan. This volume
contains the... |
1008.1284 | Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding | math.NT cs.CR cs.IT math.IT | We develop a framework for solving polynomial equations with size constraints
on solutions. We obtain our results by showing how to apply a technique of
Coppersmith for finding small solutions of polynomial equations modulo integers
to analogous problems over polynomial rings, number fields, and function
fields. This... |
1008.1309 | Towards arrow-theoretic semantics of ontologies: conceptories | cs.LO cs.AI math.CT | In context of efforts of composing category-theoretic and logical methods in
the area of knowledge representation we propose the notion of conceptory. We
consider intersection/union and other constructions in conceptories as
expressive alternative to category-theoretic (co)limits and show they have
features similar t... |
1008.1328 | Semantic Oriented Agent based Approach towards Engineering Data
Management, Web Information Retrieval and User System Communication Problems | cs.AI | The four intensive problems to the software rose by the software industry
.i.e., User System Communication / Human Machine Interface, Meta Data
extraction, Information processing & management and Data representation are
discussed in this research paper. To contribute in the field we have proposed
and described an int... |
1008.1333 | An Agent based Approach towards Metadata Extraction, Modelling and
Information Retrieval over the Web | cs.AI | Web development is a challenging research area for its creativity and
complexity. The existing raised key challenge in web technology technologic
development is the presentation of data in machine read and process able format
to take advantage in knowledge based information extraction and maintenance.
Currently it is... |
1008.1335 | Designing a Dynamic Components and Agent based Approach for Semantic
Information Retrieval | cs.IR | In this paper based on agent and semantic web technologies we propose an
approach .i.e., Semantic Oriented Agent Based Search (SOAS), to cope with
currently existing challenges of Meta data extraction, modeling and information
retrieval over the web. SOAS is designed by keeping four major requirements
.i.e., Automati... |
1008.1337 | PDM based I-SOAS Data Warehouse Design | cs.DB | This research paper briefly describes the industrial contributions of Product
Data Management in any organization's technical and managerial data management.
Then focusing on some current major PDM based problems i.e. Static and
Unintelligent Search, Platform Independent System and Successful PDM System
Implementatio... |
1008.1339 | Removal of Communication Gap | cs.DB | This research is about an online forum designed and developed to improve the
communication process between alumni, new, old and upcoming students. In this
research paper we present targeted problems, designed architecture, used
technologies in development and final end product in detail.
|
1008.1343 | Spectrum of Sizes for Perfect Deletion-Correcting Codes | cs.IT cs.DM math.CO math.IT | One peculiarity with deletion-correcting codes is that perfect
$t$-deletion-correcting codes of the same length over the same alphabet can
have different numbers of codewords, because the balls of radius $t$ with
respect to the Levenshte\u{\i}n distance may be of different sizes. There is
interest, therefore, in dete... |
1008.1357 | Social Networks and Spin Glasses | cs.SI cs.CY | The networks formed from the links between telephones observed in a month's
call detail records (CDRs) in the UK are analyzed, looking for the
characteristics thought to identify a communications network or a social
network. Some novel methods are employed. We find similarities to both types of
network. We conclude t... |
1008.1366 | Efficient Dealiased Convolutions without Padding | cs.CE physics.comp-ph | Algorithms are developed for calculating dealiased linear convolution sums
without the expense of conventional zero-padding or phase-shift techniques. For
one-dimensional in-place convolutions, the memory requirements are identical
with the zero-padding technique, with the important distinction that the
additional wo... |
1008.1387 | Codes over Matrix Rings for Space-Time Coded Modulations | cs.IT math.IT | It is known that, for transmission over quasi-static MIMO fading channels
with n transmit antennas, diversity can be obtained by using an inner fully
diverse space-time block code while coding gain, derived from the determinant
criterion, comes from an appropriate outer code. When the inner code has a
cyclic algebra ... |
1008.1393 | Towards Nonstationary, Nonparametric Independent Process Analysis with
Unknown Source Component Dimensions | stat.ME cs.IT math.DS math.IT math.ST stat.TH | The goal of this paper is to extend independent subspace analysis (ISA) to
the case of (i) nonparametric, not strictly stationary source dynamics and (ii)
unknown source component dimensions. We make use of functional autoregressive
(fAR) processes to model the temporal evolution of the hidden sources. An
extension o... |
1008.1394 | Towards Design and Implementation of a Language Technology based
Information Processor for PDM Systems | cs.IR cs.CL cs.SE | Product Data Management (PDM) aims to provide 'Systems' contributing in
industries by electronically maintaining organizational data, improving data
repository system, facilitating with easy access to CAD and providing
additional information engineering and management modules to access, store,
integrate, secure, reco... |
1008.1398 | Semi-Supervised Kernel PCA | cs.LG | We present three generalisations of Kernel Principal Components Analysis
(KPCA) which incorporate knowledge of the class labels of a subset of the data
points. The first, MV-KPCA, penalises within class variances similar to Fisher
discriminant analysis. The second, LSKPCA is a hybrid of least squares
regression and k... |
1008.1427 | Optimal Feedback Systems with Analogue Adaptive Transmitters | cs.IT math.IT | The paper presents original approach to concurrent optimization of the
transmitting and receiving parts of adaptive communication systems (CS) with
feedback channels. The results of research show a possibility and the way of
designing the systems transmitting the signals with a bit rate equal to the
capacity of the f... |
1008.1438 | Harmonic Analysis and Qualitative Uncertainty Principle | cs.IT math-ph math.CA math.IT math.MP | This paper investigates the mathematical nature of qualitative uncertainty
principle (QUP), which plays an important role in mathematics, physics and
engineering fields. Consider a 3-tuple (K, H1, H2) that K: H1 -> H2 is an
integral operator. Suppose a signal f in H1, {\Omega}1 and {\Omega}2 are
domains on which f, K... |
1008.1455 | The Diversity-Multiplexing Tradeoff of the Dynamic Decode-and-Forward
Protocol on a MIMO Half-Duplex Relay Channel | cs.IT math.IT | The diversity-multiplexing tradeoff of the dynamic decode-and-forward
protocol is characterized for the half-duplex three-terminal (m,k,n)-relay
channel where the source, relay and the destination terminals have m, k and n
antennas, respectively. It is obtained as a solution to a simple, two-variable,
convex optimiza... |
1008.1484 | A note on communicating between information systems based on including
degrees | cs.AI | In order to study the communication between information systems, Gong and
Xiao [Z. Gong and Z. Xiao, Communicating between information systems based on
including degrees, International Journal of General Systems 39 (2010) 189--206]
proposed the concept of general relation mappings based on including degrees.
Some pro... |
1008.1516 | The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic
Approach | cs.GT cs.SI | We propose a new class of game-theoretic models for network formation in
which strategies are not directly related to edge choices, but instead
correspond more generally to the exertion of social effort. The observed social
network is thus a byproduct of an expressive strategic interaction, which can
more naturally e... |
1008.1566 | Separate Training for Conditional Random Fields Using Co-occurrence Rate
Factorization | cs.LG cs.AI | The standard training method of Conditional Random Fields (CRFs) is very slow
for large-scale applications. As an alternative, piecewise training divides the
full graph into pieces, trains them independently, and combines the learned
weights at test time. In this paper, we present \emph{separate} training for
undirec... |
1008.1610 | New Constant-Weight Codes from Propagation Rules | cs.IT cs.DM math.IT | This paper proposes some simple propagation rules which give rise to new
binary constant-weight codes.
|
1008.1611 | Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition
Codes | cs.IT cs.DM math.CO math.IT | An optimal constant-composition or constant-weight code of weight $w$ has
linear size if and only if its distance $d$ is at least $2w-1$. When $d\geq
2w$, the determination of the exact size of such a constant-composition or
constant-weight code is trivial, but the case of $d=2w-1$ has been solved
previously only for... |
1008.1615 | Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and
Code Synchronization | cs.IT cs.DM math.CO math.IT | Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise
to optimal frequency-hopping sequences and optimal comma-free codes. New
constructions for PCDPs, based on almost difference sets and cyclic difference
matrices, are given. These produce new infinite families of optimal PCDPs (and
hence opt... |
1008.1617 | Query-Efficient Locally Decodable Codes of Subexponential Length | cs.CC cs.DM cs.IT math.IT math.NT math.RA | We develop the algebraic theory behind the constructions of Yekhanin (2008)
and Efremenko (2009), in an attempt to understand the ``algebraic niceness''
phenomenon in $\mathbb{Z}_m$. We show that every integer $m = pq = 2^t -1$,
where $p$, $q$ and $t$ are prime, possesses the same good algebraic property as
$m=511$ t... |
1008.1643 | A Learning Algorithm based on High School Teaching Wisdom | cs.AI cs.LG | A learning algorithm based on primary school teaching and learning is
presented. The methodology is to continuously evaluate a student and to give
them training on the examples for which they repeatedly fail, until, they can
correctly answer all types of questions. This incremental learning procedure
produces better ... |
1008.1653 | The Magic Number Problem for Subregular Language Families | cs.FL cs.IT math.IT | We investigate the magic number problem, that is, the question whether there
exists a minimal n-state nondeterministic finite automaton (NFA) whose
equivalent minimal deterministic finite automaton (DFA) has alpha states, for
all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n).
A number alph... |
1008.1659 | The Maximal Subword Complexity of Quasiperiodic Infinite Words | cs.FL cs.DM cs.IT math.IT | We provide an exact estimate on the maximal subword complexity for
quasiperiodic infinite words. To this end we give a representation of the set
of finite and of infinite words having a certain quasiperiod q via a finite
language derived from q. It is shown that this language is a suffix code having
a bounded delay o... |
1008.1673 | Space and the Synchronic A-Ram | cs.CL cs.PL | Space is a circuit oriented, spatial programming language designed to exploit
the massive parallelism available in a novel formal model of computation called
the Synchronic A-Ram, and physically related FPGA and reconfigurable
architectures. Space expresses variable grained MIMD parallelism, is modular,
strictly type... |
1008.1674 | Balanced distribution-energy inequalities and related entropy bounds | math.FA cs.IT math.IT math.SP | Let $A$ be a self-adjoint operator acting over a space $X$ endowed with a
partition. We give lower bounds on the energy of a mixed state $\rho$ from its
distribution in the partition and the spectral density of $A$. These bounds
improve with the refinement of the partition, and generalize inequalities by
Li-Yau and L... |
1008.1695 | Biometric Authentication using Nonparametric Methods | cs.CV | The physiological and behavioral trait is employed to develop biometric
authentication systems. The proposed work deals with the authentication of iris
and signature based on minimum variance criteria. The iris patterns are
preprocessed based on area of the connected components. The segmented image
used for authentic... |
1008.1710 | Introduction to the 26th International Conference on Logic Programming
Special Issue | cs.AI cs.LO | This is the preface to the 26th International Conference on Logic Programming
Special Issue
|
1008.1715 | The universality of iterated hashing over variable-length strings | cs.DB cs.DS | Iterated hash functions process strings recursively, one character at a time.
At each iteration, they compute a new hash value from the preceding hash value
and the next character. We prove that iterated hashing can be pairwise
independent, but never 3-wise independent. We show that it can be almost
universal over st... |
1008.1723 | Role of Ontology in Semantic Web Development | cs.AI | World Wide Web (WWW) is the most popular global information sharing and
communication system consisting of three standards .i.e., Uniform Resource
Identifier (URL), Hypertext Transfer Protocol (HTTP) and Hypertext Mark-up
Language (HTML). Information is provided in text, image, audio and video
formats over the web by... |
1008.1744 | High-resolution scalar quantization with R\'enyi entropy constraint | cs.IT math.IT | We consider optimal scalar quantization with $r$th power distortion and
constrained R\'enyi entropy of order $\alpha$. For sources with an absolutely
continuous distribution the high rate asymptotics of the quantizer distortion
has long been known for $\alpha=0$ (fixed-rate quantization) and $\al pha=1$
(entropy-cons... |
1008.1766 | Soft-Decoding-Based Strategies for Relay and Interference Channels:
Analysis and Achievable Rates Using LDPC Codes | cs.IT math.IT | We provide a rigorous mathematical analysis of two communication strategies:
soft decode-and-forward (soft-DF) for relay channels, and soft partial
interference-cancelation (soft-IC) for interference channels. Both strategies
involve soft estimation, which assists the decoding process. We consider LDPC
codes, not bec... |
1008.1770 | A complex network approach to robustness and vulnerability of spatially
organized water distribution networks | physics.soc-ph cs.CE cs.SI math.CO | In this work, water distribution systems are regarded as large sparse planar
graphs with complex network characteristics and the relationship between
important topological features of the network (i.e. structural robustness and
loop redundancy) and system resilience, viewed as the antonym to structural
vulnerability,... |
1008.1846 | An algorithmic information-theoretic approach to the behaviour of
financial markets | q-fin.TR cs.CE cs.IT math.IT | Using frequency distributions of daily closing price time series of several
financial market indexes, we investigate whether the bias away from an
equiprobable sequence distribution found in the data, predicted by algorithmic
information theory, may account for some of the deviation of financial markets
from log-norm... |
1008.1970 | The Shannon Cipher System with a Guessing Wiretapper: General Sources | cs.IT math.IT | The Shannon cipher system is studied in the context of general sources using
a notion of computational secrecy introduced by Merhav & Arikan. Bounds are
derived on limiting exponents of guessing moments for general sources. The
bounds are shown to be tight for iid, Markov, and unifilar sources, thus
recovering some k... |
1008.1977 | Guessing Revisited: A Large Deviations Approach | cs.IT math.IT | The problem of guessing a random string is revisited. A close relation
between guessing and compression is first established. Then it is shown that if
the sequence of distributions of the information spectrum satisfies the large
deviation property with a certain rate function, then the limiting guessing
exponent exis... |
1008.1986 | For the sake of simplicity: Unsupervised extraction of lexical
simplifications from Wikipedia | cs.CL | We report on work in progress on extracting lexical simplifications (e.g.,
"collaborate" -> "work together"), focusing on utilizing edit histories in
Simple English Wikipedia for this task. We consider two main approaches: (1)
deriving simplification probabilities via an edit model that accounts for a
mixture of diff... |
1008.2005 | Approximation Analysis of Influence Spread in Social Networks | cs.DM cs.CC cs.SI | In the context of influence propagation in a social graph, we can identify
three orthogonal dimensions - the number of seed nodes activated at the
beginning (known as budget), the expected number of activated nodes at the end
of the propagation (known as expected spread or coverage), and the time taken
for the propag... |
1008.2008 | Rate-Constrained Simulation and Source Coding IID Sources | cs.IT math.IT | Necessary conditions for asymptotically optimal sliding-block or stationary
codes for source coding and rate-constrained simulation of memoryless sources
are presented and used to motivate a design technique for trellis-encoded
source coding and rate-constrained simulation. The code structure has intuitive
similariti... |
1008.2028 | Discovering shared and individual latent structure in multiple time
series | stat.ML cs.AI stat.ME | This paper proposes a nonparametric Bayesian method for exploratory data
analysis and feature construction in continuous time series. Our method focuses
on understanding shared features in a set of time series that exhibit
significant individual variability. Our method builds on the framework of
latent Diricihlet all... |
1008.2066 | Information transfer with small-amplitude signals | q-bio.NC cs.IT math.IT | We study the optimality conditions of information transfer in systems with
memory in the low signal-to-noise ratio regime of vanishing input amplitude. We
find that the optimal mutual information is represented by a maximum-variance
of the signal time course, with correlation structure determined by the Fisher
inform... |
1008.2069 | Information capacity in the weak-signal approximation | cs.IT math.IT q-bio.NC | We derive an approximate expression for mutual information in a broad class
of discrete-time stationary channels with continuous input, under the
constraint of vanishing input amplitude or power. The approximation describes
the input by its covariance matrix, while the channel properties are described
by the Fisher i... |
1008.2081 | Random Information Spread in Networks | math.CO cs.DM cs.SI math.PR | Let G=(V,E) be an undirected loopless graph with possible parallel edges and
s and t be two vertices of G. Assume that vertex s is labelled at the initial
time step and that every labelled vertex copies its labelling to neighbouring
vertices along edges with one labelled endpoint independently with probability
p in o... |
1008.2093 | Notes on Lattice-Reduction-Aided MMSE Equalization | cs.IT math.IT | Over the last years, novel low-complexity approaches to the equalization of
MIMO channels have gained much attention. Thereby, methods based on lattice
basis reduction are of special interest, as they achieve the optimum diversity
order. In this paper, a tutorial overview on LRA equalization optimized
according to th... |
1008.2121 | Constraint Propagation for First-Order Logic and Inductive Definitions | cs.LO cs.AI | Constraint propagation is one of the basic forms of inference in many
logic-based reasoning systems. In this paper, we investigate constraint
propagation for first-order logic (FO), a suitable language to express a wide
variety of constraints. We present an algorithm with polynomial-time data
complexity for constrain... |
1008.2122 | Secret Key and Private Key Constructions for Simple Multiterminal Source
Models | cs.IT cs.CR math.IT | We propose an approach for constructing secret and private keys based on the
long-known Slepian-Wolf code, due to Wyner, for correlated sources connected by
a virtual additive noise channel. Our work is motivated by results of Csisz\'ar
and Narayan which highlight innate connections between secrecy generation by
mult... |
1008.2147 | Quantum Tagging: Authenticating Location via Quantum Information and
Relativistic Signalling Constraints | quant-ph cs.CR cs.IT math.IT | We define the task of {\it quantum tagging}, that is, authenticating the
classical location of a classical tagging device by sending and receiving
quantum signals from suitably located distant sites, in an environment
controlled by an adversary whose quantum information processing and
transmitting power is unbounded.... |
1008.2159 | Submodular Functions: Learnability, Structure, and Optimization | cs.DS cs.DM cs.LG | Submodular functions are discrete functions that model laws of diminishing
returns and enjoy numerous algorithmic applications. They have been used in
many areas, including combinatorial optimization, machine learning, and
economics. In this work we study submodular functions from a learning theoretic
angle. We provi... |
1008.2160 | An early warning method for crush | cs.MA | Fatal crush conditions occur in crowds with tragic frequency. Event
organisers and architects are often criticised for failing to consider the
causes and implications of crush, but the reality is that the prediction and
mitigation of such conditions offers a significant technical challenge. Full
treatment of physical... |
1008.2186 | RDFViewS: A Storage Tuning Wizard for RDF Applications | cs.DB cs.AI | In recent years, the significant growth of RDF data used in numerous
applications has made its efficient and scalable manipulation an important
issue. In this paper, we present RDFViewS, a system capable of choosing the
most suitable views to materialize, in order to minimize the query response
time for a specific SP... |
1008.2247 | Symmetry and Uncountability of Computation | cs.CC cs.IT math.IT | This paper talk about the complexity of computation by Turing Machine. I take
attention to the relation of symmetry and order structure of the data, and I
think about the limitation of computation time. First, I make general problem
named "testing problem". And I get some condition of the P complete and NP
complete b... |
1008.2266 | Achievable Rates and Upper bounds for the Interference Relay Channel | cs.IT math.IT | The two user Gaussian interference channel with a full-duplex relay is
studied. By using genie aided approaches, two new upper bounds on the
achievable sum-rate in this setup are derived. These upper bounds are shown to
be tighter than previously known bounds under some conditions. Moreover, a
transmit strategy for t... |
1008.2277 | Faithfulness in Chain Graphs: The Gaussian Case | stat.ML cs.AI math.ST stat.TH | This paper deals with chain graphs under the classic
Lauritzen-Wermuth-Frydenberg interpretation. We prove that the regular Gaussian
distributions that factorize with respect to a chain graph $G$ with $d$
parameters have positive Lebesgue measure with respect to $\mathbb{R}^d$,
whereas those that factorize with respe... |
1008.2297 | An MGF-based Unified Framework to Determine the Joint Statistics of
Partial Sums of Ordered Random Variables | cs.IT math.IT | Order statistics find applications in various areas of communications and
signal processing. In this paper, we introduce an unified analytical framework
to determine the joint statistics of partial sums of ordered random variables
(RVs). With the proposed approach, we can systematically derive the joint
statistics of... |
1008.2300 | Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain
Databases (Technical Report) | cs.DB | Frequent itemset mining in uncertain transaction databases semantically and
computationally differs from traditional techniques applied on standard
(certain) transaction databases. Uncertain transaction databases consist of
sets of existentially uncertain items. The uncertainty of items in transactions
makes traditio... |
1008.2313 | Lagrangian method for solving Lane-Emden type equation arising in
astrophysics on semi-infinite domains | math-ph astro-ph.IM cs.CE math.MP math.NA | In this paper we propose a Lagrangian method for solving Lane-Emden equation
which is a nonlinear ordinary differential equation on semi-infinite interval.
This approach is based on a Modified generalized Laguerre functions Lagrangian
method. The method reduces the solution of this problem to the solution of a
system... |
1008.2322 | An approximate solution of the MHD Falkner-Skan flow by Hermite
functions pseudospectral method | math-ph cs.CE math.MP math.NA physics.comp-ph physics.flu-dyn | Based on a new approximation method, namely pseudospectral method, a solution
for the three order nonlinear ordinary differential laminar boundary layer
Falkner-Skan equation has been obtained on the semi-infinite domain. The
proposed approach is equipped by the orthogonal Hermite functions that have
perfect properti... |
1008.2337 | Numerical approximations for population growth model by Rational
Chebyshev and Hermite Functions collocation approach: A comparison | math-ph cs.CE math.MP math.NA | This paper aims to compare rational Chebyshev (RC) and Hermite functions (HF)
collocation approach to solve the Volterra's model for population growth of a
species within a closed system. This model is a nonlinear integro-differential
equation where the integral term represents the effect of toxin. This approach
is b... |
1008.2348 | Comparison between two common collocation approaches based on radial
basis functions for the case of heat transfer equations arising in porous
medium | math-ph cs.CE math.MP math.NA physics.comp-ph | In this paper two common collocation approaches based on radial basis
functions have been considered; one be computed through the integration process
(IRBF) and one be computed through the differentiation process (DRBF). We
investigated the two approaches on natural convection heat transfer equations
embedded in poro... |
1008.2368 | Construction of Rational Surfaces Yielding Good Codes | math.AG cs.IT math.IT math.NT | In the present article, we consider Algebraic Geometry codes on some rational
surfaces. The estimate of the minimum distance is translated into a point
counting problem on plane curves. This problem is solved by applying the upper
bound "\`a la Weil" of Aubry and Perret together with the bound of Homma and
Kim for pl... |
1008.2386 | Linear Precoding in Cooperative MIMO Cellular Networks with Limited
Coordination Clusters | cs.IT math.IT | In a cooperative multiple-antenna downlink cellular network, maximization of
a concave function of user rates is considered. A new linear precoding
technique called soft interference nulling (SIN) is proposed, which performs at
least as well as zero-forcing (ZF) beamforming. All base stations share channel
state info... |
1008.2410 | Removing the Barrier to Scalability in Parallel FMM | cs.CE cs.NA physics.comp-ph | The Fast Multipole Method (FMM) is well known to possess a bottleneck arising
from decreasing workload on higher levels of the FMM tree [Greengard and Gropp,
Comp. Math. Appl., 20(7), 1990]. We show that this potential bottleneck can be
eliminated by overlapping multipole and local expansion computations with
direct ... |
1008.2412 | Discover & eXplore Neural Network (DXNN) Platform, a Modular TWEANN | cs.NE cond-mat.dis-nn | In this paper I present a novel type of Topology and Weight Evolving
Artificial Neural Network (TWEANN) system called Modular Discover & eXplore
Neural Network (DXNN). Modular DXNN utilizes a hierarchical/modular topology
which allows for highly scalable and dynamically granular systems to evolve.
Among the novel fea... |
1008.2514 | Epistemic irrelevance in credal nets: the case of imprecise Markov trees | cs.AI math.PR stat.ML | We focus on credal nets, which are graphical models that generalise Bayesian
nets to imprecise probability. We replace the notion of strong independence
commonly used in credal nets with the weaker notion of epistemic irrelevance,
which is arguably more suited for a behavioural theory of probability. Focusing
on dire... |
1008.2526 | Low ML Decoding Complexity STBCs via Codes over GF(4) | cs.IT math.IT | In this paper, we give a new framework for constructing low ML decoding
complexity Space-Time Block Codes (STBCs) using codes over the finite field
$\mathbb{F}_4$. Almost all known low ML decoding complexity STBCs can be
obtained via this approach. New full-diversity STBCs with low ML decoding
complexity and cubic sh... |
1008.2529 | Quantum f-divergences and error correction | math-ph cs.IT math.IT math.MP quant-ph | Quantum f-divergences are a quantum generalization of the classical notion of
f-divergences, and are a special case of Petz' quasi-entropies. Many well known
distinguishability measures of quantum states are given by, or derived from,
f-divergences; special examples include the quantum relative entropy, the Renyi
rel... |
1008.2565 | Multigraph Sampling of Online Social Networks | cs.NI cs.DS cs.SI physics.data-an stat.ME | State-of-the-art techniques for probability sampling of users of online
social networks (OSNs) are based on random walks on a single social relation
(typically friendship). While powerful, these methods rely on the social graph
being fully connected. Furthermore, the mixing time of the sampling process
strongly depen... |
1008.2571 | Cooperative Secret Communication with Artificial Noise in Symmetric
Interference Channel | cs.IT math.IT | We consider the symmetric Gaussian interference channel where two users try
to enhance their secrecy rates in a cooperative manner. Artificial noise is
introduced along with useful information. We derive the power control and
artificial noise parameter for two kinds of optimal points, max-min point and
single user po... |
1008.2579 | Homotopy Perturbation Method for Image Restoration and Denoising | cs.CV cs.NA math.AP math.NA | The famous Perona-Malik (P-M) equation which was at first introduced for
image restoration has been solved via various numerical methods. In this paper
we will solve it for the first time via applying a new numerical method called
Homotopy Perturbation Method (HMP) and the correspondent approximated solutions
will be... |
1008.2581 | The LASSO risk for gaussian matrices | math.ST cs.IT math.IT stat.TH | We consider the problem of learning a coefficient vector x_0\in R^N from
noisy linear observation y=Ax_0+w \in R^n. In many contexts (ranging from model
selection to image processing) it is desirable to construct a sparse estimator
x'. In this case, a popular approach consists in solving an L1-penalized least
squares... |
1008.2613 | Joint maximum likelihood estimation of carrier and sampling frequency
offsets for OFDM systems | cs.IT math.IT | In orthogonal-frequency division multiplexing (OFDM) systems, carrier and
sampling frequency offsets (CFO and SFO, respectively) can destroy the
orthogonality of the subcarriers and degrade system performance. In the
literature, Nguyen-Le, Le-Ngoc, and Ko proposed a simple maximum-likelihood
(ML) scheme using two lon... |
1008.2626 | Mining tree-query associations in graphs | cs.DB cs.AI | New applications of data mining, such as in biology, bioinformatics, or
sociology, are faced with large datasetsstructured as graphs. We introduce a
novel class of tree-shapedpatterns called tree queries, and present algorithms
for miningtree queries and tree-query associations in a large data graph. Novel
about our ... |
1008.2743 | PMOG: The projected mixture of Gaussians model with application to blind
source separation | stat.ML cs.AI stat.ME | We extend the mixtures of Gaussians (MOG) model to the projected mixture of
Gaussians (PMOG) model. In the PMOG model, we assume that q dimensional input
data points z_i are projected by a q dimensional vector w into 1-D variables
u_i. The projected variables u_i are assumed to follow a 1-D MOG model. In the
PMOG mod... |
1008.2750 | On BICM receivers for TCM transmission | cs.IT math.IT | Recent results have shown that the performance of bit-interleaved coded
modulation (BICM) using convolutional codes in nonfading channels can be
significantly improved when the interleaver takes a trivial form (BICM-T),
i.e., when it does not interleave the bits at all. In this paper, we give a
formal explanation for... |
1008.2857 | Bidirectional multi-pair network with a MIMO relay: Beamforming
strategies and lack of duality | cs.IT math.IT | We address the problem of a multi-user relay network, where multiple
single-antenna node pairs want to exchange information by using a multiple
antenna relay node. Due to the half-duplex constraint of the relay, the
exchange of information takes place in two steps. In the first step, the nodes
transmit their data to ... |
1008.2873 | Compressive Channel Estimation for Two-way Relay Network in a
Frequency-Selective Channel with Compressed Sensing | cs.IT math.IT | Two-way relay network (TWRN) was introduced to realize high-data rate
transmission over the wireless frequency-selective channel. However, TWRC
requires the knowledge of channel state information (CSI) not only for coherent
data detection but also for the self-data removal. This is partial accomplished
by training se... |
1008.2972 | Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for
Polynomial Transforms Based on Induction | cs.IT math.IT math.RA | A polynomial transform is the multiplication of an input vector $x\in\C^n$ by
a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is
defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list
$b=\{p_0(x),\dots,p_{n-1}(x)\}$ and sample points $\alpha_k\in\C$ from a list
$\alpha=\... |
1008.2996 | Sparsity-Cognizant Total Least-Squares for Perturbed Compressive
Sampling | cs.IT math.IT | Solving linear regression problems based on the total least-squares (TLS)
criterion has well-documented merits in various applications, where
perturbations appear both in the data vector as well as in the regression
matrix. However, existing TLS approaches do not account for sparsity possibly
present in the unknown v... |
1008.3035 | Achievable Rates in Two-user Interference Channels with Finite Inputs
and (Very) Strong Interference | cs.IT math.IT | For two-user interference channels, the capacity is known for the case where
interference is stronger than the desired signal. Moreover, it is known that if
the interference is above a certain level, it does not reduce the capacity at
all. To achieve this capacity, the channel inputs need to be Gaussian
distributed. ... |
1008.3043 | Learning Functions of Few Arbitrary Linear Parameters in High Dimensions | math.NA cs.CC cs.LG stat.ML | Let us assume that $f$ is a continuous function defined on the unit ball of
$\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix
and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m
\in \mathbb N$ of possible point evaluations $f(x_i)$, $i=1,...,m$, of $f$,
which w... |
1008.3056 | On the Performance of Spectrum Sensing Algorithms using Multiple
Antennas | cs.IT math.IT stat.AP | In recent years, some spectrum sensing algorithms using multiple antennas,
such as the eigenvalue based detection (EBD), have attracted a lot of
attention. In this paper, we are interested in deriving the asymptotic
distributions of the test statistics of the EBD algorithms. Two EBD algorithms
using sample covariance... |
1008.3136 | MIMO Precoding Using Rotating Codebooks | cs.IT math.IT | Next generation wireless communications rely on multiple input multiple
output (MIMO) techniques to achieve high data rates. Feedback of channel
information can be used in MIMO precoding to fully activate the strongest
channel modes and improve MIMO performance. Unfortunately, the bandwidth of the
control channel via... |
1008.3146 | Exact Localization and Superresolution with Noisy Data and Random
Illumination | cs.IT math.IT math.PR physics.data-an physics.optics | This paper studies the problem of exact localization of sparse (point or
extended) objects with noisy data. The crux of the proposed approach consists
of random illumination. Several recovery methods are analyzed: the Lasso, BPDN
and the One-Step Thresholding (OST). For independent random probes, it is shown
that bot... |
1008.3147 | Proceedings First Workshop on Applications of Membrane computing,
Concurrency and Agent-based modelling in POPulation biology | cs.CE cs.MA | This volume contains the papers presented at the first International Workshop
on Applications of Membrane Computing, Concurrency and Agent-based Modelling in
Population Biology (AMCA-POP 2010) held in Jena, Germany on August 25th, 2010
as a satellite event of the 11th Conference on Membrane Computing (CMC11).
The a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.