id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0911.1678 | Industrial-Strength Formally Certified SAT Solving | cs.LO cs.AI | Boolean Satisfiability (SAT) solvers are now routinely used in the
verification of large industrial problems. However, their application in
safety-critical domains such as the railways, avionics, and automotive
industries requires some form of assurance for the results, as the solvers can
(and sometimes do) have bugs... |
0911.1685 | Multi-Objective Optimisation Method for Posture Prediction and Analysis
with Consideration of Fatigue Effect and its Application Case | cs.RO | Automation technique has been widely used in manufacturing industry, but
there are still manual handling operations required in assembly and maintenance
work in industry. Inappropriate posture and physical fatigue might result in
musculoskeletal disorders (MSDs) in such physical jobs. In ergonomics and
occupational b... |
0911.1691 | Vertical partitioning of relational OLTP databases using integer
programming | cs.DB cs.PF | A way to optimize performance of relational row store databases is to reduce
the row widths by vertically partitioning tables into table fractions in order
to minimize the number of irrelevant columns/attributes read by each
transaction. This paper considers vertical partitioning algorithms for
relational row-store O... |
0911.1707 | A Dynamic Vulnerability Map to Assess the Risk of Road Network Traffic
Utilization | cs.AI physics.soc-ph | Le Havre agglomeration (CODAH) includes 16 establishments classified Seveso
with high threshold. In the literature, we construct vulnerability maps to help
decision makers assess the risk. Such approaches remain static and do take into
account the population displacement in the estimation of the vulnerability. We
pro... |
0911.1708 | Different goals in multiscale simulations and how to reach them | cs.AI nlin.AO | In this paper we sum up our works on multiscale programs, mainly simulations.
We first start with describing what multiscaling is about, how it helps
perceiving signal from a background noise in a ?ow of data for example, for a
direct perception by a user or for a further use by another program. We then
give three ex... |
0911.1713 | Isometries and Construction of Permutation Arrays | math.CO cs.IT math.IT | An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming
distance d_H between any two distinct elements of C is at least equal to d. In
this paper, we use the characterisation of the isometry group of the metric
space (Sym(n),d_H) in order to develop generating algorithms with rejection of
isomorphic o... |
0911.1743 | Analysis of peeling decoder for MET ensembles | cs.IT math.IT | The peeling decoder introduced by Luby, et al. allows analysis of LDPC
decoding for the binary erasure channel (BEC). For irregular ensembles, they
analyze the decoder state as a Markov process and present a solution to the
differential equations describing the process mean. Multi-edge type (MET)
ensembles allow grea... |
0911.1745 | Sequence Folding, Lattice Tiling, and Multidimensional Coding | cs.IT math.CO math.IT | Folding a sequence $S$ into a multidimensional box is a well-known method
which is used as a multidimensional coding technique. The operation of folding
is generalized in a way that the sequence $S$ can be folded into various shapes
and not just a box. The new definition of folding is based on a lattice tiling
for th... |
0911.1763 | The Replicator Equation as an Inference Dynamic | math.DS cs.IT math.IT | The replicator equation is interpreted as a continuous inference equation and
a formal similarity between the discrete replicator equation and Bayesian
inference is described. Further connections between inference and the
replicator equation are given including a discussion of information divergences
and exponential ... |
0911.1764 | Escort Evolutionary Game Theory | math.DS cs.IT math.DG math.IT | A family of replicator-like dynamics, called the escort replicator equation,
is constructed using information-geometric concepts and generalized information
entropies and diverenges from statistical thermodynamics. Lyapunov functions
and escort generalizations of basic concepts and constructions in evolutionary
game ... |
0911.1813 | Interactive Privacy via the Median Mechanism | cs.CR cs.CC cs.DB cs.DS | We define a new interactive differentially private mechanism -- the median
mechanism -- for answering arbitrary predicate queries that arrive online.
Relative to fixed accuracy and privacy constraints, this mechanism can answer
exponentially more queries than the previously best known interactive privacy
mechanism (t... |
0911.1826 | Arithmetic completely regular codes | math.CO cs.IT math.IT | In this paper, we explore completely regular codes in the Hamming graphs and
related graphs. Experimental evidence suggests that many completely regular
codes have the property that the eigenvalues of the code are in arithmetic
progression. In order to better understand these "arithmetic completely regular
codes", we... |
0911.1842 | Standards for Language Resources | cs.CL | The goal of this paper is two-fold: to present an abstract data model for
linguistic annotations and its implementation using XML, RDF and related
standards; and to outline the work of a newly formed committee of the
International Standards Organization (ISO), ISO/TC 37/SC 4 Language Resource
Management, which will u... |
0911.1849 | The Feasibility of Interference Alignment over Measured MIMO-OFDM
Channels | cs.IT math.IT | Interference alignment (IA) has been shown to achieve the maximum achievable
degrees of freedom in the interference channel. This results in sum rate
scaling linearly with the number of users in the high signal-to-noise-ratio
(SNR) regime. Linear scaling is achieved by precoding transmitted signals to
align interfere... |
0911.1934 | On a Gel'fand-Yaglom-Peres theorem for f-divergences | cs.IT math.IT math.ST stat.TH | It is shown that the $f$-divergence between two probability measures $P$ and
$R$ equals the supremum of the same $f$-divergence computed over all finite
measurable partitions of the original space, thus generalizing results
previously proved by Gel'fand and Yaglom and by Peres for the Information
Divergence and more ... |
0911.1965 | Active Learning for Mention Detection: A Comparison of Sentence
Selection Strategies | cs.CL cs.AI | We propose and compare various sentence selection strategies for active
learning for the task of detecting mentions of entities. The best strategy
employs the sum of confidences of two statistical classifiers trained on
different views of the data. Our experimental results show that, compared to
the random selection ... |
0911.2022 | Interference Channels With Arbitrarily Correlated Sources | cs.IT math.IT | Communicating arbitrarily correlated sources over interference channels is
considered in this paper. A sufficient condition is found for the lossless
transmission of a pair of correlated sources over a discrete memoryless
interference channel. With independent sources, the sufficient condition
reduces to the Han-Koba... |
0911.2023 | Opportunistic capacity and error exponent regions for compound channel
with feedback | cs.IT math.IT | Variable length communication over a compound channel with feedback is
considered. Traditionally, capacity of a compound channel without feedback is
defined as the maximum rate that is determined before the start of
communication such that communication is reliable. This traditional definition
is pessimistic. In the ... |
0911.2053 | Interference Mitigation Through Limited Receiver Cooperation | cs.IT math.IT | Interference is a major issue limiting the performance in wireless networks.
Cooperation among receivers can help mitigate interference by forming
distributed MIMO systems. The rate at which receivers cooperate, however, is
limited in most scenarios. How much interference can one bit of receiver
cooperation mitigate?... |
0911.2197 | On the relation between plausibility logic and the maximum-entropy
principle: a numerical study | math.PR cs.IT math.IT physics.data-an | What is the relationship between plausibility logic and the principle of
maximum entropy? When does the principle give unreasonable or wrong results?
When is it appropriate to use the rule `expectation = average'? Can
plausibility logic give the same answers as the principle, and better answers
if those of the princi... |
0911.2258 | Discrete Hamilton-Jacobi Theory | math.OC cs.SY | We develop a discrete analogue of Hamilton-Jacobi theory in the framework of
discrete Hamiltonian mechanics. The resulting discrete Hamilton-Jacobi equation
is discrete only in time. We describe a discrete analogue of Jacobi's solution
and also prove a discrete version of the geometric Hamilton-Jacobi theorem. The
th... |
0911.2280 | PageRank Optimization by Edge Selection | cs.DS cs.CC cs.SI | The importance of a node in a directed graph can be measured by its PageRank.
The PageRank of a node is used in a number of application contexts - including
ranking websites - and can be interpreted as the average portion of time spent
at the node by an infinite random walk. We consider the problem of maximizing
the ... |
0911.2284 | A New Look at the Classical Entropy of Written English | cs.CL | A simple method for finding the entropy and redundancy of a reasonable long
sample of English text by direct computer processing and from first principles
according to Shannon theory is presented. As an example, results on the entropy
of the English language have been obtained based on a total of 20.3 million
charact... |
0911.2323 | A Type System for Required/Excluded Elements in CLS | cs.LO cs.CE | The calculus of looping sequences is a formalism for describing the evolution
of biological systems by means of term rewriting rules. We enrich this calculus
with a type discipline to guarantee the soundness of reduction rules with
respect to some biological properties deriving from the requirement of certain
element... |
0911.2324 | Deterministic Autopoietic Automata | cs.NE cs.FL | This paper studies two issues related to the paper on Computing by
Self-reproduction: Autopoietic Automata by Jiri Wiedermann. It is shown that
all results presented there extend to deterministic computations. In
particular, nondeterminism is not needed for a lineage to generate all
autopoietic automata.
|
0911.2327 | An Intuitive Automated Modelling Interface for Systems Biology | cs.PL cs.CE cs.LO q-bio.QM | We introduce a natural language interface for building stochastic pi calculus
models of biological systems. In this language, complex constructs describing
biochemical events are built from basic primitives of association, dissociation
and transformation. This language thus allows us to model biochemical systems
modu... |
0911.2330 | Diffusion Controlled Reactions, Fluctuation Dominated Kinetics, and
Living Cell Biochemistry | cs.CE cs.OH q-bio.QM | In recent years considerable portion of the computer science community has
focused its attention on understanding living cell biochemistry and efforts to
understand such complication reaction environment have spread over wide front,
ranging from systems biology approaches, through network analysis (motif
identificati... |
0911.2346 | Asymmetric Multilevel Diversity Coding and Asymmetric Gaussian Multiple
Descriptions | cs.IT math.IT | We consider the asymmetric multilevel diversity (A-MLD) coding problem, where
a set of $2^K-1$ information sources, ordered in a decreasing level of
importance, is encoded into $K$ messages (or descriptions). There are $2^K-1$
decoders, each of which has access to a non-empty subset of the encoded
messages. Each deco... |
0911.2381 | Analytical Determination of Fractal Structure in Stochastic Time Series | physics.data-an cond-mat.stat-mech cs.LG nlin.CD stat.ME | Current methods for determining whether a time series exhibits fractal
structure (FS) rely on subjective assessments on estimators of the Hurst
exponent (H). Here, I introduce the Bayesian Assessment of Scaling, an
analytical framework for drawing objective and accurate inferences on the FS of
time series. The techni... |
0911.2390 | How Creative Should Creators Be To Optimize the Evolution of Ideas? A
Computational Model | cs.AI cs.NE physics.soc-ph | There are both benefits and drawbacks to creativity. In a social group it is
not necessary for all members to be creative to benefit from creativity; some
merely imitate or enjoy the fruits of others' creative efforts. What proportion
should be creative? This paper contains a very preliminary investigation of
this qu... |
0911.2405 | Emotion: Appraisal-coping model for the "Cascades" problem | cs.AI | Modelling emotion has become a challenge nowadays. Therefore, several models
have been produced in order to express human emotional activity. However, only
a few of them are currently able to express the close relationship existing
between emotion and cognition. An appraisal-coping model is presented here,
with the a... |
0911.2501 | Emotion : mod\`ele d'appraisal-coping pour le probl\`eme des Cascades | cs.AI | Modeling emotion has become a challenge nowadays. Therefore, several models
have been produced in order to express human emotional activity. However, only
a few of them are currently able to express the close relationship existing
between emotion and cognition. An appraisal-coping model is presented here,
with the ai... |
0911.2551 | Minimax Robust Quickest Change Detection | cs.IT math.IT math.ST stat.TH | The popular criteria of optimality for quickest change detection procedures
are the Lorden criterion, the Shiryaev-Roberts-Pollak criterion, and the
Bayesian criterion. In this paper a robust version of these quickest change
detection problems is considered when the pre-change and post-change
distributions are not kn... |
0911.2564 | Distributed Coalition Formation Games for Secure Wireless Transmission | cs.IT math.IT | Cooperation among wireless nodes has been recently proposed for improving the
physical layer (PHY) security of wireless transmission in the presence of
multiple eavesdroppers. While existing PHY security literature answered the
question ``what are the link-level secrecy rate gains from cooperation?'', this
paper atte... |
0911.2632 | Measuring contextual citation impact of scientific journals | cs.DL cs.IR | This paper explores a new indicator of journal citation impact, denoted as
source normalized impact per paper (SNIP). It measures a journal's contextual
citation impact, taking into account characteristics of its properly defined
subject field, especially the frequency at which authors cite other papers in
their refe... |
0911.2746 | Model Selection: Two Fundamental Measures of Coherence and Their
Algorithmic Significance | cs.IT math.IT math.ST stat.TH | The problem of model selection arises in a number of contexts, such as
compressed sensing, subset selection in linear regression, estimation of
structures in graphical models, and signal denoising. This paper generalizes
the notion of \emph{incoherence} in the existing literature on model selection
and introduces two... |
0911.2784 | On Bregman Distances and Divergences of Probability Measures | cs.IT math.IT math.PR math.ST stat.TH | The paper introduces scaled Bregman distances of probability distributions
which admit non-uniform contributions of observed events. They are introduced
in a general form covering not only the distances of discrete and continuous
stochastic observations, but also the distances of random processes and
signals. It is s... |
0911.2829 | Proceedings Fifth Workshop on Developments in Computational
Models--Computational Models From Nature | cs.CE cs.AI cs.CC cs.FL cs.LO cs.NE cs.PL | The special theme of DCM 2009, co-located with ICALP 2009, concerned
Computational Models From Nature, with a particular emphasis on computational
models derived from physics and biology. The intention was to bring together
different approaches - in a community with a strong foundational background as
proffered by th... |
0911.2847 | Cooperative Precoding/Resource Allocation Games under Spectral Mask and
Total Power Constraints | cs.IT math.IT | The use of orthogonal signaling schemes such as time-, frequency-, or
code-division multiplexing (T-, F-, CDM) in multi-user systems allows for
power-efficient simple receivers. It is shown in this paper that by using
orthogonal signaling on frequency selective fading channels, the cooperative
Nash bargaining (NB)-ba... |
0911.2865 | Neural Networks for Dynamic Shortest Path Routing Problems - A Survey | cs.NE cs.AI | This paper reviews the overview of the dynamic shortest path routing problem
and the various neural networks to solve it. Different shortest path
optimization problems can be solved by using various neural networks
algorithms. The routing in packet switched multi-hop networks can be described
as a classical combinato... |
0911.2873 | Relating Granger causality to directed information theory for networks
of stochastic processes | cs.IT math.IT | This paper addresses the problem of inferring circulation of information
between multiple stochastic processes. We discuss two possible frameworks in
which the problem can be studied: directed information theory and Granger
causality. The main goal of the paper is to study the connection between these
two frameworks.... |
0911.2889 | Global communications in multiprocessor simulations of flames | cs.DC cs.CE cs.MS cs.PF | In this paper we investigate performance of global communications in a
particular parallel code. The code simulates dynamics of expansion of premixed
spherical flames using an asymptotic model of Sivashinsky type and a spectral
numerical algorithm. As a result, the code heavily relies on global all-to-all
interproces... |
0911.2900 | Computation Speed of the F.A.S.T. Model | cs.MA physics.soc-ph | The F.A.S.T. model for microscopic simulation of pedestrians was formulated
with the idea of parallelizability and small computation times in general in
mind, but so far it was never demonstrated, if it can in fact be implemented
efficiently for execution on a multi-core or multi-CPU system. In this
contribution resu... |
0911.2902 | Simulation of Pedestrians Crossing a Street | cs.MA | The simulation of vehicular traffic as well as pedestrian dynamics meanwhile
both have a decades long history. The success of this conference series, PED
and others show that the interest in these topics is still strongly increasing.
This contribution deals with a combination of both systems: pedestrians
crossing a s... |
0911.2904 | Sequential anomaly detection in the presence of noise and limited
feedback | cs.LG | This paper describes a methodology for detecting anomalies from sequentially
observed and potentially noisy data. The proposed approach consists of two main
elements: (1) {\em filtering}, or assigning a belief or likelihood to each
successive measurement based upon our ability to predict it from previous noisy
observ... |
0911.2922 | Sparse Eigenvectors of the Discrete Fourier Transform | cs.IT math.IT | We construct a basis of sparse eigenvectors for the N-dimensional discrete
Fourier transform. The sparsity differs from the optimal by at most a factor of
four. When N is a perfect square, the basis is orthogonal.
|
0911.2942 | Breaching Euclidean Distance-Preserving Data Perturbation Using Few
Known Inputs | cs.DB cs.CR | We examine Euclidean distance-preserving data perturbation as a tool for
privacy-preserving data mining. Such perturbations allow many important data
mining algorithms e.g. hierarchical and k-means clustering), with only minor
modification, to be applied to the perturbed data and produce exactly the same
results as i... |
0911.2948 | Spatial Analysis of Opportunistic Downlink Relaying in a Two-Hop
Cellular System | cs.IT cs.NI math.IT stat.ME | We consider a two-hop cellular system in which the mobile nodes help the base
station by relaying information to the dead spots. While two-hop cellular
schemes have been analyzed previously, the distribution of the node locations
has not been explicitly taken into account. In this paper, we model the node
locations o... |
0911.2952 | Cooperative Feedback for Multi-Antenna Cognitive Radio Networks | cs.IT math.IT | Cognitive beamforming (CB) is a multi-antenna technique for efficient
spectrum sharing between primary users (PUs) and secondary users (SUs) in a
cognitive radio network. Specifically, a multi-antenna SU transmitter applies
CB to suppress the interference to the PU receivers as well as enhance the
corresponding SU-li... |
0911.2974 | A Dynamic Near-Optimal Algorithm for Online Linear Programming | cs.DS cs.LG | A natural optimization model that formulates many online resource allocation
and revenue management problems is the online linear program (LP) in which the
constraint matrix is revealed column by column along with the corresponding
objective coefficient. In such a model, a decision variable has to be set each
time a ... |
0911.3108 | On game psychology: an experiment on the chess board/screen, should you
always "do your best", and why the programs with prescribed weaknesses cannot
be our good friends? | cs.AI cs.GT math.HO | It is noted that some unusual moves against a strong chess program greatly
weaken its ability to see the serious targets of the game, and its whole level
of play... It is suggested to create programs with different weaknesses in
order to analyze similar human behavior. Finally, a new version of chess,
"Chess Corrida"... |
0911.3125 | A computational model of the bottlenose dolphin sonar:
Feature-extracting method | cs.CE | The data describing a process of echo-image formation in bottlenose dolphin
sonar perception were accumulated in our experimental explorations. These data
were formalized mathematically and used in the computational model, comparative
testing of which in echo-discrimination tasks revealed no less capabilities
then th... |
0911.3209 | Apply Ant Colony Algorithm to Search All Extreme Points of Function | cs.AI cs.NE | To find all extreme points of multimodal functions is called extremum
problem, which is a well known difficult issue in optimization fields. Applying
ant colony optimization (ACO) to solve this problem is rarely reported. The
method of applying ACO to solve extremum problem is explored in this paper.
Experiment shows... |
0911.3213 | Optimum estimation via gradients of partition functions and information
measures: a statistical-mechanical perspective | cs.IT math.IT | In continuation to a recent work on the statistical--mechanical analysis of
minimum mean square error (MMSE) estimation in Gaussian noise via its relation
to the mutual information (the I-MMSE relation), here we propose a simple and
more direct relationship between optimum estimation and certain information
measures ... |
0911.3241 | Optimal Control in Two-Hop Relay Routing | cs.NI cs.IT math.IT | We study the optimal control of propagation of packets in delay tolerant
mobile ad-hoc networks. We consider a two-hop forwarding policy under which the
expected number of nodes carrying copies of the packets obeys a linear
dynamics. We exploit this property to formulate the problem in the framework of
linear quadrat... |
0911.3256 | Enumerative Coding for Grassmannian Space | cs.IT math.IT | The Grassmannian space $\Gr$ is the set of all $k-$dimensional subspaces of
the vector space~\smash{$\F_q^n$}. Recently, codes in the Grassmannian have
found an application in network coding. The main goal of this paper is to
present efficient enumerative encoding and decoding techniques for the
Grassmannian. These c... |
0911.3262 | Moderate-Density Parity-Check Codes | cs.IT math.IT | We propose a new type of short to moderate block-length, linear
error-correcting codes, called moderate-density parity-check (MDPC) codes. The
number of ones of the parity-check matrix of the codes presented is typically
higher than the number of ones of the parity-check matrix of low-density
parity-check (LDPC) code... |
0911.3280 | Automated languages phylogeny from Levenshtein distance | cs.CL q-bio.PE q-bio.QM | Languages evolve over time in a process in which reproduction, mutation and
extinction are all possible, similar to what happens to living organisms. Using
this similarity it is possible, in principle, to build family trees which show
the degree of relatedness between languages.
The method used by modern glottochro... |
0911.3292 | Automated words stability and languages phylogeny | cs.CL physics.soc-ph q-bio.PE | The idea of measuring distance between languages seems to have its roots in
the work of the French explorer Dumont D'Urville (D'Urville 1832). He collected
comparative words lists of various languages during his voyages aboard the
Astrolabe from 1826 to1829 and, in his work about the geographical division of
the Paci... |
0911.3298 | Understanding the Principles of Recursive Neural networks: A Generative
Approach to Tackle Model Complexity | cs.NE cs.LG | Recursive Neural Networks are non-linear adaptive models that are able to
learn deep structured information. However, these models have not yet been
broadly accepted. This fact is mainly due to its inherent complexity. In
particular, not only for being extremely complex information processing models,
but also because... |
0911.3304 | Keystroke Dynamics Authentication For Collaborative Systems | cs.LG | We present in this paper a study on the ability and the benefits of using a
keystroke dynamics authentication method for collaborative systems.
Authentication is a challenging issue in order to guarantee the security of use
of collaborative systems during the access control step. Many solutions exist
in the state of ... |
0911.3318 | Re-Pair Compression of Inverted Lists | cs.IR cs.DS | Compression of inverted lists with methods that support fast intersection
operations is an active research topic. Most compression schemes rely on
encoding differences between consecutive positions with techniques that favor
small numbers. In this paper we explore a completely different alternative: We
use Re-Pair co... |
0911.3347 | Optimal strategies for computing symmetric Boolean functions in
collocated networks | cs.IT math.IT | We address the problem of finding optimal strategies for computing Boolean
symmetric functions. We consider a collocated network, where each node's
transmissions can be heard by every other node. Each node has a Boolean
measurement and we wish to compute a given Boolean function of these
measurements with zero error.... |
0911.3349 | Seeing Science | astro-ph.IM cs.CV cs.GR stat.AP | The ability to represent scientific data and concepts visually is becoming
increasingly important due to the unprecedented exponential growth of
computational power during the present digital age. The data sets and
simulations scientists in all fields can now create are literally thousands of
times as large as those ... |
0911.3357 | Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks
and Computation | cs.NI cs.IT math.IT | Sensor networks potentially feature large numbers of nodes that can sense
their environment over time, communicate with each other over a wireless
network, and process information. They differ from data networks in that the
network as a whole may be designed for a specific application. We study the
theoretical founda... |
0911.3411 | Measuring the Meaning of Words in Contexts: An automated analysis of
controversies about Monarch butterflies, Frankenfoods, and stem cells | cs.CL cs.IR physics.soc-ph | Co-words have been considered as carriers of meaning across different domains
in studies of science, technology, and society. Words and co-words, however,
obtain meaning in sentences, and sentences obtain meaning in their contexts of
use. At the science/society interface, words can be expected to have different
meani... |
0911.3415 | Can Scientific Journals be Classified in terms of Aggregated
Journal-Journal Citation Relations using the Journal Citation Reports? | cs.DL cs.IR physics.soc-ph | The aggregated citation relations among journals included in the Science
Citation Index provide us with a huge matrix which can be analyzed in various
ways. Using principal component analysis or factor analysis, the factor scores
can be used as indicators of the position of the cited journals in the citing
dimensions... |
0911.3416 | Classification and Powerlaws: The Logarithmic Transformation | cs.IR cs.DL physics.soc-ph | Logarithmic transformation of the data has been recommended by the literature
in the case of highly skewed distributions such as those commonly found in
information science. The purpose of the transformation is to make the data
conform to the lognormal law of error for inferential purposes. How does this
transformati... |
0911.3422 | Co-occurrence Matrices and their Applications in Information Science:
Extending ACA to the Web Environment | cs.IR cs.DL physics.soc-ph | Co-occurrence matrices, such as co-citation, co-word, and co-link matrices,
have been used widely in the information sciences. However, confusion and
controversy have hindered the proper statistical analysis of this data. The
underlying problem, in our opinion, involved understanding the nature of
various types of ma... |
0911.3482 | Complexity of Networks (reprise) | cs.IT math.IT nlin.AO q-bio.PE | Network or graph structures are ubiquitous in the study of complex systems.
Often, we are interested in complexity trends of these system as it evolves
under some dynamic. An example might be looking at the complexity of a food web
as species enter an ecosystem via migration or speciation, and leave via
extinction.
... |
0911.3514 | Sampling and reconstructing signals from a union of linear subspaces | cs.IT math.IT | In this note we study the problem of sampling and reconstructing signals
which are assumed to lie on or close to one of several subspaces of a Hilbert
space. Importantly, we here consider a very general setting in which we allow
infinitely many subspaces in infinite dimensional Hilbert spaces. This general
approach a... |
0911.3581 | X-Learn: An XML-Based, Multi-agent System for Supporting "User-Device"
Adaptive E-learning | cs.CY cs.MA | In this paper we present X-Learn, an XML-based, multi-agent system for
supporting "user-device" adaptive e-learning. X-Learn is characterized by the
following features: (i) it is highly subjective, since it handles quite a rich
and detailed user profile that plays a key role during the learning activities;
(ii) it is... |
0911.3600 | "Almost automatic" and semantic integration of XML Schemas at various
"severity" levels | cs.DB | This paper presents a novel approach for the integration of a set of XML
Schemas. The proposed approach is specialized for XML, is almost automatic,
semantic and "light". As a further, original, peculiarity, it is parametric
w.r.t. a "severity" level against which the integration task is performed. The
paper describe... |
0911.3633 | A Geometric Approach to Sample Compression | cs.LG math.CO math.GT stat.ML | The Sample Compression Conjecture of Littlestone & Warmuth has remained
unsolved for over two decades. This paper presents a systematic geometric
investigation of the compression of finite maximum concept classes. Simple
arrangements of hyperplanes in Hyperbolic space, and Piecewise-Linear
hyperplane arrangements, ar... |
0911.3643 | Multiple Presents: How Search Engines Re-write the Past | cs.IR physics.soc-ph | Internet search engines function in a present which changes continuously. The
search engines update their indices regularly, overwriting Web pages with newer
ones, adding new pages to the index, and losing older ones. Some search engines
can be used to search for information at the internet for specific periods of
ti... |
0911.3668 | Signal acquisition via polarization modulation in single photon sources | quant-ph cs.IT math.IT | A simple model system is introduced for demonstrating how a single photon
source might be used to transduce classical analog information. The theoretical
scheme results in measurements of analog source samples that are (i) quantized
in the sense of analog-to-digital conversion and (ii) corrupted by random noise
that ... |
0911.3676 | Pipelined Encoding for Deterministic and Noisy Relay Networks | cs.IT math.IT | Recent coding strategies for deterministic and noisy relay networks are
related to the pipelining of block Markov encoding. For deterministic networks,
it is shown that pipelined encoding improves encoding delay, as opposed to
end-to-end delay. For noisy networks, it is observed that decode-and-forward
exhibits good ... |
0911.3708 | Manipulability of Single Transferable Vote | cs.AI cs.CC cs.GT cs.MA | For many voting rules, it is NP-hard to compute a successful manipulation.
However, NP-hardness only bounds the worst-case complexity. Recent theoretical
results suggest that manipulation may often be easy in practice. We study
empirically the cost of manipulating the single transferable vote (STV) rule.
This was one... |
0911.3717 | Artificial Neural Network-based error compensation procedure for
low-cost encoders | cs.NE astro-ph.IM physics.comp-ph | An Artificial Neural Network-based error compensation method is proposed for
improving the accuracy of resolver-based 16-bit encoders by compensating for
their respective systematic error profiles. The error compensation procedure,
for a particular encoder, involves obtaining its error profile by calibrating
it on a ... |
0911.3723 | Applications of the Dynamic Distance Potential Field Method | cs.MA | Recently the dynamic distance potential field (DDPF) was introduced as a
computationally efficient method to make agents in a simulation of pedestrians
move rather on the quickest path than the shortest. It can be considered to be
an estimated-remaining-journey-time-based one-shot dynamic assignment method
for pedest... |
0911.3753 | Evolutionary estimation of a Coupled Markov Chain credit risk model | cs.NE cs.CE | There exists a range of different models for estimating and simulating credit
risk transitions to optimally manage credit risk portfolios and products. In
this chapter we present a Coupled Markov Chain approach to model rating
transitions and thereby default probabilities of companies. As the likelihood
of the model ... |
0911.3823 | Google matrix and Ulam networks of intermittency maps | cs.IR cond-mat.dis-nn nlin.AO nlin.CD physics.soc-ph | We study the properties of the Google matrix of an Ulam network generated by
intermittency maps. This network is created by the Ulam method which gives a
matrix approximant for the Perron-Frobenius operator of dynamical map. The
spectral properties of eigenvalues and eigenvectors of this matrix are
analyzed. We show ... |
0911.3842 | Musical Genres: Beating to the Rhythms of Different Drums | physics.data-an cs.IR cs.SD physics.soc-ph | Online music databases have increased signicantly as a consequence of the
rapid growth of the Internet and digital audio, requiring the development of
faster and more efficient tools for music content analysis. Musical genres are
widely used to organize music collections. In this paper, the problem of
automatic music... |
0911.3872 | Equivalence perspectives in communication, source-channel connections
and universal source-channel separation | cs.IT math.IT | An operational perspective is used to understand the relationship between
source and channel coding. This is based on a direct reduction of one problem
to another that uses random coding (and hence common randomness) but unlike all
prior work, does not involve any functional computations, in particular, no
mutual-inf... |
0911.3921 | Error Rates of the Maximum-Likelihood Detector for Arbitrary
Constellations: Convex/Concave Behavior and Applications | cs.IT math.IT | Motivated by a recent surge of interest in convex optimization techniques,
convexity/concavity properties of error rates of the maximum likelihood
detector operating in the AWGN channel are studied and extended to
frequency-flat slow-fading channels. Generic conditions are identified under
which the symbol error rate... |
0911.3944 | Likelihood-based semi-supervised model selection with applications to
speech processing | stat.ML cs.CL cs.LG stat.AP | In conventional supervised pattern recognition tasks, model selection is
typically accomplished by minimizing the classification error rate on a set of
so-called development data, subject to ground-truth labeling by human experts
or some other means. In the context of speech processing systems and other
large-scale p... |
0911.3979 | Making the road by searching - A search engine based on Swarm
Information Foraging | cs.IR cs.HC | Search engines are nowadays one of the most important entry points for
Internet users and a central tool to solve most of their information needs.
Still, there exist a substantial amount of users' searches which obtain
unsatisfactory results. Needless to say, several lines of research aim to
increase the relevancy of... |
0911.3992 | Storage Coding for Wear Leveling in Flash Memories | cs.IT math.IT | Flash memory is a non-volatile computer memory comprised of blocks of cells,
wherein each cell is implemented as either NAND or NOR floating gate. NAND
flash is currently the most widely used type of flash memory. In a NAND flash
memory, every block of cells consists of numerous pages; rewriting even a
single page re... |
0911.4046 | Super-Linear Convergence of Dual Augmented-Lagrangian Algorithm for
Sparsity Regularized Estimation | stat.ML cs.LG stat.ME | We analyze the convergence behaviour of a recently proposed algorithm for
regularized estimation called Dual Augmented Lagrangian (DAL). Our analysis is
based on a new interpretation of DAL as a proximal minimization algorithm. We
theoretically show under some conditions that DAL converges super-linearly in a
non-asy... |
0911.4167 | Wyner-Ziv Coding over Broadcast Channels: Digital Schemes | cs.IT math.IT | This paper addresses lossy transmission of a common source over a broadcast
channel when there is correlated side information at the receivers, with
emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme
that combines ideas from the lossless version of the problem, i.e.,
Slepian-Wolf coding ove... |
0911.4178 | Folksonomic Tag Clouds as an Aid to Content Indexing | cs.IR cs.HC | Social tagging systems have recently developed as a popular method of data
organisation on the Internet. These systems allow users to organise their
content in a way that makes sense to them, rather than forcing them to use a
pre-determined and rigid set of categorisations. These folksonomies provide
well populated s... |
0911.4207 | An information theoretic approach to statistical dependence: copula
information | q-fin.ST cs.IT math.IT physics.data-an stat.AP | We discuss the connection between information and copula theories by showing
that a copula can be employed to decompose the information content of a
multivariate distribution into marginal and dependence components, with the
latter quantified by the mutual information. We define the information excess
as a measure of... |
0911.4219 | Message Passing Algorithms for Compressed Sensing: I. Motivation and
Construction | cs.IT math.IT | In a recent paper, the authors proposed a new class of low-complexity
iterative thresholding algorithms for reconstructing sparse signals from a
small set of linear measurements \cite{DMM}. The new algorithms are broadly
referred to as AMP, for approximate message passing. This is the first of two
conference papers d... |
0911.4222 | Message Passing Algorithms for Compressed Sensing: II. Analysis and
Validation | cs.IT math.IT | In a recent paper, the authors proposed a new class of low-complexity
iterative thresholding algorithms for reconstructing sparse signals from a
small set of linear measurements \cite{DMM}. The new algorithms are broadly
referred to as AMP, for approximate message passing. This is the second of two
conference papers ... |
0911.4230 | Introduction to Bioinformatics | cs.CE | Bioinformatics is a new discipline that addresses the need to manage and
interpret the data that in the past decade was massively generated by genomic
research. This discipline represents the convergence of genomics, biotechnology
and information technology, and encompasses analysis and interpretation of
data, modeli... |
0911.4262 | Towards Industrialized Conception and Production of Serious Games | cs.LG cs.HC | Serious Games (SGs) have experienced a tremendous outburst these last years.
Video game companies have been producing fun, user-friendly SGs, but their
educational value has yet to be proven. Meanwhile, cognition research scientist
have been developing SGs in such a way as to guarantee an educational gain, but
the fu... |
0911.4292 | Similarity Measures, Author Cocitation Analysis, and Information Theory | cs.IR physics.soc-ph | The use of Pearson's correlation coefficient in Author Cocitation Analysis
was compared with Salton's cosine measure in a number of recent contributions.
Unlike the Pearson correlation, the cosine is insensitive to the number of
zeros. However, one has the option of applying a logarithmic transformation in
correlatio... |
0911.4302 | An Indicator of Research Front Activity: Measuring Intellectual
Organization as Uncertainty Reduction in Document Sets | cs.DL cs.IR physics.soc-ph | When using scientific literature to model scholarly discourse, a research
specialty can be operationalized as an evolving set of related documents. Each
publication can be expected to contribute to the further development of the
specialty at the research front. The specific combinations of title words and
cited refer... |
0911.4329 | Structural Consistency: Enabling XML Keyword Search to Eliminate
Spurious Results Consistently | cs.DB | XML keyword search is a user-friendly way to query XML data using only
keywords. In XML keyword search, to achieve high precision without sacrificing
recall, it is important to remove spurious results not intended by the user.
Efforts to eliminate spurious results have enjoyed some success by using the
concepts of LC... |
0911.4385 | Bio-inspired speed detection and discrimination | cs.CV cs.NE | In the field of computer vision, a crucial task is the detection of motion
(also called optical flow extraction). This operation allows analysis such as
3D reconstruction, feature tracking, time-to-collision and novelty detection
among others. Most of the optical flow extraction techniques work within a
finite range ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.