id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0611113 | An Anthological Review of Research Utilizing MontyLingua, a Python-Based
End-to-End Text Processor | cs.CL | MontyLingua, an integral part of ConceptNet which is currently the largest
commonsense knowledge base, is an English text processor developed using Python
programming language in MIT Media Lab. The main feature of MontyLingua is the
coverage for all aspects of English text processing from raw input text to
semantic m... |
cs/0611114 | Very Sparse Stable Random Projections, Estimators and Tail Bounds for
Stable Random Projections | cs.DS cs.IT cs.LG math.IT | This paper will focus on three different aspects in improving the current
practice of stable random projections.
Firstly, we propose {\em very sparse stable random projections} to
significantly reduce the processing and storage cost, by replacing the
$\alpha$-stable distribution with a mixture of a symmetric $\alph... |
cs/0611115 | A higher-order active contour model of a `gas of circles' and its
application to tree crown extraction | cs.CV | Many image processing problems involve identifying the region in the image
domain occupied by a given entity in the scene. Automatic solution of these
problems requires models that incorporate significant prior knowledge about the
shape of the region. Many methods for including such knowledge run into
difficulties wh... |
cs/0611118 | A Neutrosophic Description Logic | cs.AI | Description Logics (DLs) are appropriate, widely used, logics for managing
structured knowledge. They allow reasoning about individuals and concepts, i.e.
set of individuals with common properties. Typically, DLs are limited to
dealing with crisp, well defined concepts. That is, concepts for which the
problem whether... |
cs/0611120 | Wireless Information-Theoretic Security - Part I: Theoretical Aspects | cs.IT math.IT | In this two-part paper, we consider the transmission of confidential data
over wireless wiretap channels. The first part presents an
information-theoretic problem formulation in which two legitimate partners
communicate over a quasi-static fading channel and an eavesdropper observes
their transmissions through anothe... |
cs/0611121 | Wireless Information-Theoretic Security - Part II: Practical
Implementation | cs.IT math.IT | In Part I of this two-part paper on confidential communication over wireless
channels, we studied the fundamental security limits of quasi-static fading
channels from the point of view of outage secrecy capacity with perfect and
imperfect channel state information. In Part II, we develop a practical secret
key agreem... |
cs/0611122 | Knowledge Representation Concepts for Automated SLA Management | cs.SE cs.AI cs.LO cs.PL | Outsourcing of complex IT infrastructure to IT service providers has
increased substantially during the past years. IT service providers must be
able to fulfil their service-quality commitments based upon predefined Service
Level Agreements (SLAs) with the service customer. They need to manage, execute
and maintain t... |
cs/0611123 | Functional Bregman Divergence and Bayesian Estimation of Distributions | cs.IT cs.LG math.IT | A class of distortions termed functional Bregman divergences is defined,
which includes squared error and relative entropy. A functional Bregman
divergence acts on functions or distributions, and generalizes the standard
Bregman divergence for vectors and a previous pointwise Bregman divergence that
was defined for f... |
cs/0611124 | Low-rank matrix factorization with attributes | cs.LG cs.AI cs.IR | We develop a new collaborative filtering (CF) method that combines both
previously known users' preferences, i.e. standard CF, as well as product/user
attributes, i.e. classical function approximation, to predict a given user's
interest in a particular product. Our method is a generalized low rank matrix
completion p... |
cs/0611125 | Relay Channels with Confidential Messages | cs.IT math.IT | We consider a relay channel where a relay helps the transmission of messages
from one sender to one receiver. The relay is considered not only as a sender
that helps the message transmission but as a wire-tapper who can obtain some
knowledge about the transmitted messages. In this paper we study the coding
problem of... |
cs/0611127 | Coupling Methodology within the Software Platform Alliances | cs.MS cs.CE | CEA, ANDRA and EDF are jointly developing the software platform ALLIANCES
which aim is to produce a tool for the simulation of nuclear waste storage and
disposal repository. This type of simulations deals with highly coupled
thermo-hydro-mechanical and chemical (T-H-M-C) processes. A key objective of
Alliances is to ... |
cs/0611129 | Shannon's secrecy system with informed receivers and its application to
systematic coding for wiretapped channels | cs.IT math.IT | Shannon's secrecy system is studied in a setting, where both the legitimate
decoder and the wiretapper have access to side information sequences correlated
to the source, but the wiretapper receives both the coded information and the
side information via channels that are more noisy than the respective channels
of th... |
cs/0611131 | Scatter Networks: A New Approach for Analyzing Information Scatter on
the Web | cs.IR | Information on any given topic is often scattered across the web. Previously
this scatter has been characterized through the distribution of a set of facts
(i.e. pieces of information) across web pages, showing that typically a few
pages contain many facts on the topic, while many pages contain just a few.
While such... |
cs/0611132 | The specifications making in complex CAD-system of renovation of the
enterprises on the basis of modules in the drawing and electronic catalogues | cs.CE | The experience of automation of the specifications making of the projects of
renovation of the industrial enterprises is described, being based on the
special modules in the drawing containing the visible image and additional
parameters, and electronic catalogues
|
cs/0611133 | The modelling of the automation schemes of technological processes in
CAD-system of renovation of the enterprises | cs.CE | According to the requirements of the Russian standards, the automation
schemes are necessary practically in each project of renovation of industrial
buildings and facilities, in which any technological processes are realized.
The model representations of the automation schemes in CAD-system TechnoCAD
GlassX are descr... |
cs/0611135 | Genetic Programming for Kernel-based Learning with Co-evolving Subsets
Selection | cs.AI | Support Vector Machines (SVMs) are well-established Machine Learning (ML)
algorithms. They rely on the fact that i) linear learning can be formalized as
a well-posed optimization problem; ii) non-linear learning can be brought into
linear learning thanks to the kernel trick and the mapping of the initial
search space... |
cs/0611136 | Neural Computation with Rings of Quasiperiodic Oscillators | cs.RO | We describe the use of quasiperiodic oscillators for computation and control
of robots. We also describe their relationship to central pattern generators in
simple organisms and develop a group theory for describing the dynamics of
these systems.
|
cs/0611138 | Functional Brain Imaging with Multi-Objective Multi-Modal Evolutionary
Optimization | cs.AI | Functional brain imaging is a source of spatio-temporal data mining problems.
A new framework hybridizing multi-objective and multi-modal optimization is
proposed to formalize these data mining problems, and addressed through
Evolutionary Computation (EC). The merits of EC for spatio-temporal data mining
are demonstr... |
cs/0611140 | On the Benefits of Inoculation, an Example in Train Scheduling | cs.AI cs.NE | The local reconstruction of a railway schedule following a small perturbation
of the traffic, seeking minimization of the total accumulated delay, is a very
difficult and tightly constrained combinatorial problem. Notoriously enough,
the railway company's public image degrades proportionally to the amount of
daily de... |
cs/0611141 | A Generic Global Constraint based on MDDs | cs.AI | The paper suggests the use of Multi-Valued Decision Diagrams (MDDs) as the
supporting data structure for a generic global constraint. We give an algorithm
for maintaining generalized arc consistency (GAC) on this constraint that
amortizes the cost of the GAC computation over a root-to-terminal path in the
search tree... |
cs/0611144 | Coding Improves the Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc
Networks: Two-Dimensional I.I.D. Mobility Models | cs.NI cs.IT math.IT | In this paper, we investigate the delay-throughput trade-offs in mobile
ad-hoc networks under two-dimensional i.i.d. mobility models. We consider two
mobility time-scales: (i) Fast mobility where node mobility is at the same
time-scale as data transmissions; (ii) Slow mobility where node mobility is
assumed to occur ... |
cs/0611145 | A Unified View of TD Algorithms; Introducing Full-Gradient TD and
Equi-Gradient Descent TD | cs.LG | This paper addresses the issue of policy evaluation in Markov Decision
Processes, using linear function approximation. It provides a unified view of
algorithms such as TD(lambda), LSTD(lambda), iLSTD, residual-gradient TD. It is
asserted that they all consist in minimizing a gradient function and differ by
the form o... |
cs/0611146 | Linear-Codes-Based Lossless Joint Source-Channel Coding for
Multiple-Access Channels | cs.IT math.IT | A general lossless joint source-channel coding (JSCC) scheme based on linear
codes and random interleavers for multiple-access channels (MACs) is presented
and then analyzed in this paper. By the information-spectrum approach and the
code-spectrum approach, it is shown that a linear code with a good joint
spectrum ca... |
cs/0611148 | Next Generation Language Resources using GRID | cs.DC cs.CL | This paper presents a case study concerning the challenges and requirements
posed by next generation language resources, realized as an overall model of
open, distributed and collaborative language infrastructure. If a sort of "new
paradigm" is required, we think that the emerging and still evolving technology
connec... |
cs/0611150 | A Novel Bayesian Classifier using Copula Functions | cs.LG cs.AI cs.IR | A useful method for representing Bayesian classifiers is through
\emph{discriminant functions}. Here, using copula functions, we propose a new
model for discriminants. This model provides a rich and generalized class of
decision boundaries. These decision boundaries significantly boost the
classification accuracy esp... |
cs/0611155 | Zig-zag and Replacement Product Graphs and LDPC Codes | cs.IT math.IT | The performance of codes defined from graphs depends on the expansion
property of the underlying graph in a crucial way. Graph products, such as the
zig-zag product and replacement product provide new infinite families of
constant degree expander graphs. The paper investigates the use of zig-zag and
replacement produ... |
cs/0611156 | D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative
Communication Protocols | cs.IT math.IT | We consider cooperative relay communication in a fading channel environment
under the Orthogonal Amplify and Forward (OAF) and Orthogonal and
Non-Orthogonal Selection Decode and Forward (OSDF and NSDF) protocols. For all
these protocols, we compute the Diversity-Multiplexing Gain Tradeoff (DMT). We
construct DMT opti... |
cs/0611160 | Complementary Sets, Generalized Reed-Muller Codes, and Power Control for
OFDM | cs.IT math.IT | The use of error-correcting codes for tight control of the peak-to-mean
envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing
(OFDM) transmission is considered in this correspondence. By generalizing a
result by Paterson, it is shown that each q-phase (q is even) sequence of
length 2^m lies in a ... |
cs/0611161 | On the Peak-to-Mean Envelope Power Ratio of Phase-Shifted Binary Codes | cs.IT math.IT | The peak-to-mean envelope power ratio (PMEPR) of a code employed in
orthogonal frequency-division multiplexing (OFDM) systems can be reduced by
permuting its coordinates and by rotating each coordinate by a fixed phase
shift. Motivated by some previous designs of phase shifts using suboptimal
methods, the following q... |
cs/0611162 | Quaternary Constant-Amplitude Codes for Multicode CDMA | cs.IT math.IT | A constant-amplitude code is a code that reduces the peak-to-average power
ratio (PAPR) in multicode code-division multiple access (MC-CDMA) systems to
the favorable value 1. In this paper quaternary constant-amplitude codes (codes
over Z_4) of length 2^m with error-correction capabilities are studied. These
codes ex... |
cs/0611163 | On Measuring the Impact of Human Actions in the Machine Learning of a
Board Game's Playing Policies | cs.AI cs.GT cs.NE | We investigate systematically the impact of human intervention in the
training of computer players in a strategy board game. In that game, computer
players utilise reinforcement learning with neural networks for evolving their
playing strategies and demonstrate a slow learning speed. Human intervention
can significan... |
cs/0611164 | Player co-modelling in a strategy board game: discovering how to play
fast | cs.AI cs.LG | In this paper we experiment with a 2-player strategy board game where playing
models are evolved using reinforcement learning and neural networks. The models
are evolved to speed up automatic game development based on human involvement
at varying levels of sophistication and density when compared to fully
autonomous ... |
cs/0611166 | Lossless fitness inheritance in genetic algorithms for decision trees | cs.AI cs.DS cs.NE | When genetic algorithms are used to evolve decision trees, key tree quality
parameters can be recursively computed and re-used across generations of
partially similar decision trees. Simply storing instance indices at leaves is
enough for fitness to be piecewise computed in a lossless fashion. We show the
derivation ... |
cs/0612002 | Reuse of designs: Desperately seeking an interdisciplinary cognitive
approach | cs.HC cs.AI | This text analyses the papers accepted for the workshop "Reuse of designs: an
interdisciplinary cognitive approach". Several dimensions and questions
considered as important (by the authors and/or by us) are addressed: What about
the "interdisciplinary cognitive" character of the approaches adopted by the
authors? Is... |
cs/0612007 | High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding vs.
Linear Precoding | cs.IT math.IT | We study the MIMO broadcast channel and compare the achievable throughput for
the optimal strategy of dirty paper coding to that achieved with sub-optimal
and lower complexity linear precoding (e.g., zero-forcing and block
diagonalization) transmission. Both strategies utilize all available spatial
dimensions and the... |
cs/0612011 | Estimation of Bit and Frame Error Rates of Low-Density Parity-Check
Codes on Binary Symmetric Channels | cs.IT math.IT | A method for estimating the performance of low-density parity-check (LDPC)
codes decoded by hard-decision iterative decoding algorithms on binary
symmetric channels (BSC) is proposed. Based on the enumeration of the smallest
weight error patterns that can not be all corrected by the decoder, this method
estimates bot... |
cs/0612012 | Geographic Gossip on Geometric Random Graphs via Affine Combinations | cs.MA cs.IT math.IT | In recent times, a considerable amount of work has been devoted to the
development and analysis of gossip algorithms in Geometric Random Graphs. In a
recently introduced model termed "Geographic Gossip," each node is aware of its
position but possesses no further information. Traditionally, gossip protocols
have alwa... |
cs/0612014 | Going Stupid with EcoLab | cs.MA | In 2005, Railsback et al. proposed a very simple model ({\em Stupid
Model}) that could be implemented within a couple of hours, and later
extended to demonstrate the use of common ABM platform functionality. They
provided implementations of the model in several agent based modelling
platforms, and compared the plat... |
cs/0612015 | On the intersection of additive perfect codes | cs.IT math.IT | The intersection problem for additive (extended and non-extended) perfect
codes, i.e. which are the possibilities for the number of codewords in the
intersection of two additive codes C1 and C2 of the same length, is
investigated. Lower and upper bounds for the intersection number are computed
and, for any value betw... |
cs/0612019 | On Finite Memory Universal Data Compression and Classification of
Individual Sequences | cs.IT math.IT | Consider the case where consecutive blocks of N letters of a semi-infinite
individual sequence X over a finite-alphabet are being compressed into binary
sequences by some one-to-one mapping. No a-priori information about X is
available at the encoder, which must therefore adopt a universal
data-compression algorithm.... |
cs/0612024 | On the Maximum Sum-rate Capacity of Cognitive Multiple Access Channel | cs.IT math.IT | We consider the communication scenario where multiple cognitive users wish to
communicate to the same receiver, in the presence of primary transmission. The
cognitive transmitters are assumed to have the side information about the
primary transmission. The capacity region of cognitive users is formulated
under the co... |
cs/0612027 | Experimental Information and Statistical Modeling of Physical Laws | cs.IT cs.IR math.IT | Statistical modeling of physical laws connects experiments with mathematical
descriptions of natural phenomena. The modeling is based on the probability
density of measured variables expressed by experimental data via a kernel
estimator. As an objective kernel the scattering function determined by
calibration of the ... |
cs/0612029 | A Classification of 6R Manipulators | cs.RO | This paper presents a classification of generic 6-revolute jointed (6R)
manipulators using homotopy class of their critical point manifold. A part of
classification is listed in this paper because of the complexity of homotopy
class of 4-torus. The results of this classification will serve future research
of the clas... |
cs/0612030 | Loop corrections for approximate inference | cs.AI cs.IT cs.LG math.IT | We propose a method for improving approximate inference methods that corrects
for the influence of loops in the graphical model. The method is applicable to
arbitrary factor graphs, provided that the size of the Markov blankets is not
too large. It is an alternative implementation of an idea introduced recently
by Mo... |
cs/0612031 | Estimating Aggregate Properties on Probabilistic Streams | cs.DS cs.DB | The probabilistic-stream model was introduced by Jayram et al. \cite{JKV07}.
It is a generalization of the data stream model that is suited to handling
``probabilistic'' data where each item of the stream represents a probability
distribution over a set of possible events. Therefore, a probabilistic stream
determines... |
cs/0612032 | Code Spectrum and Reliability Function: Binary Symmetric Channel | cs.IT math.IT | A new approach for upper bounding the channel reliability function using the
code spectrum is described. It allows to treat in a unified way both a low and
a high rate cases. In particular, the earlier known upper bounds are improved,
and a new derivation of the sphere-packing bound is presented.
|
cs/0612033 | Acronym-Meaning Extraction from Corpora Using Multi-Tape Weighted
Finite-State Machines | cs.CL cs.DS cs.SC | The automatic extraction of acronyms and their meaning from corpora is an
important sub-task of text mining. It can be seen as a special case of string
alignment, where a text chunk is aligned with an acronym. Alternative
alignments have different cost, and ideally the least costly one should give
the correct meaning... |
cs/0612041 | Viterbi Algorithm Generalized for n-Tape Best-Path Search | cs.CL cs.DS cs.SC | We present a generalization of the Viterbi algorithm for identifying the path
with minimal (resp. maximal) weight in a n-tape weighted finite-state machine
(n-WFSM), that accepts a given n-tuple of input strings (s_1,... s_n). It also
allows us to compile the best transduction of a given input n-tuple by a
weighted (... |
cs/0612042 | Decentralized Maximum Likelihood Estimation for Sensor Networks Composed
of Nonlinearly Coupled Dynamical Systems | cs.DC cs.IT math.IT | In this paper we propose a decentralized sensor network scheme capable to
reach a globally optimum maximum likelihood (ML) estimate through
self-synchronization of nonlinearly coupled dynamical systems. Each node of the
network is composed of a sensor and a first-order dynamical system initialized
with the local meas... |
cs/0612043 | About the Lifespan of Peer to Peer Networks | cs.DC cs.IR | We analyze the ability of peer to peer networks to deliver a complete file
among the peers. Early on we motivate a broad generalization of network
behavior organizing it into one of two successive phases. According to this
view the network has two main states: first centralized - few sources (roots)
hold the complete... |
cs/0612044 | The Relay-Eavesdropper Channel: Cooperation for Secrecy | cs.IT math.IT | This paper establishes the utility of user cooperation in facilitating secure
wireless communications. In particular, the four-terminal relay-eavesdropper
channel is introduced and an outer-bound on the optimal rate-equivocation
region is derived. Several cooperation strategies are then devised and the
corresponding ... |
cs/0612046 | Social Networks and Social Information Filtering on Digg | cs.HC cs.AI cs.IR | The new social media sites -- blogs, wikis, Flickr and Digg, among others --
underscore the transformation of the Web to a participatory medium in which
users are actively creating, evaluating and distributing information. Digg is a
social news aggregator which allows users to submit links to, vote on and
discuss new... |
cs/0612047 | Social Browsing on Flickr | cs.HC cs.AI | The new social media sites - blogs, wikis, del.icio.us and Flickr, among
others - underscore the transformation of the Web to a participatory medium in
which users are actively creating, evaluating and distributing information. The
photo-sharing site Flickr, for example, allows users to upload photographs,
view photo... |
cs/0612049 | Power Control in Distributed Cooperative OFDMA Cellular Networks | cs.IT math.IT | This paper has been withdrawn by the author.
|
cs/0612051 | On the Decoder Error Probability of Bounded Rank-Distance Decoders for
Maximum Rank Distance Codes | cs.IT math.IT | In this paper, we first introduce the concept of elementary linear subspace,
which has similar properties to those of a set of coordinates. We then use
elementary linear subspaces to derive properties of maximum rank distance (MRD)
codes that parallel those of maximum distance separable codes. Using these
properties,... |
cs/0612052 | Budget Optimization in Search-Based Advertising Auctions | cs.DS cs.CE cs.GT | Internet search companies sell advertisement slots based on users' search
queries via an auction. While there has been a lot of attention on the auction
process and its game-theoretic aspects, our focus is on the advertisers. In
particular, the advertisers have to solve a complex optimization problem of how
to place ... |
cs/0612053 | Deriving Schrodinger Equation From A Soft-Decision Iterative Decoding
Algorithm | cs.IT math.IT | The belief propagation algorithm has been recognized in the information
theory community as a soft-decision iterative decoding algorithm. It is the
most powerful algorithm found so far for attacking hard optimization problems
in channel decoding. Quantum mechanics is the foundation of modern physics with
the time-ind... |
cs/0612055 | Linear Probing with Constant Independence | cs.DS cs.DB | Hashing with linear probing dates back to the 1950s, and is among the most
studied algorithms. In recent years it has become one of the most important
hash table organizations since it uses the cache of modern computers very well.
Unfortunately, previous analysis rely either on complicated and space consuming
hash fu... |
cs/0612056 | Conscious Intelligent Systems - Part 1 : I X I | cs.AI | Did natural consciousness and intelligent systems arise out of a path that
was co-evolutionary to evolution? Can we explain human self-consciousness as
having risen out of such an evolutionary path? If so how could it have been?
In this first part of a two-part paper (titled IXI), we take a learning
system perspect... |
cs/0612057 | Conscious Intelligent Systems - Part II - Mind, Thought, Language and
Understanding | cs.AI | This is the second part of a paper on Conscious Intelligent Systems. We use
the understanding gained in the first part (Conscious Intelligent Systems Part
1: IXI (arxiv id cs.AI/0612056)) to look at understanding. We see how the
presence of mind affects understanding and intelligent systems; we see that the
presence ... |
cs/0612059 | Synchronization recovery and state model reduction for soft decoding of
variable length codes | cs.NI cs.IT math.IT | Variable length codes exhibit de-synchronization problems when transmitted
over noisy channels. Trellis decoding techniques based on Maximum A Posteriori
(MAP) estimators are often used to minimize the error rate on the estimated
sequence. If the number of symbols and/or bits transmitted are known by the
decoder, ter... |
cs/0612062 | Unifying Lexicons in view of a Phonological and Morphological Lexical DB | cs.IR | The present work falls in the line of activities promoted by the European
Languguage Resource Association (ELRA) Production Committee (PCom) and raises
issues in methods, procedures and tools for the reusability, creation, and
management of Language Resources. A two-fold purpose lies behind this
experiment. The first... |
cs/0612064 | Bounds on Key Appearance Equivocation for Substitution Ciphers | cs.IT cs.CR math.IT | The average conditional entropy of the key given the message and its
corresponding cryptogram, H(K|M,C), which is reffer as a key appearance
equivocation, was proposed as a theoretical measure of the strength of the
cipher system under a known-plaintext attack by Dunham in 1980. In the same
work (among other things),... |
cs/0612067 | Retrieving Reed-Solomon coded data under interpolation-based list
decoding | cs.IT math.IT | A transform that enables generator-matrix-based Reed-Solomon (RS) coded data
to be recovered under interpolation-based list decoding is presented. The
transform matrix needs to be computed only once and the transformation of an
element from the output list to the desired RS coded data block incurs $k^{2}$
field multi... |
cs/0612068 | Interactive Configuration by Regular String Constraints | cs.AI | A product configurator which is complete, backtrack free and able to compute
the valid domains at any state of the configuration can be constructed by
building a Binary Decision Diagram (BDD). Despite the fact that the size of the
BDD is exponential in the number of variables in the worst case, BDDs have
proved to wo... |
cs/0612073 | On the Fingerprinting Capacity Under the Marking Assumption | cs.IT cs.CR math.IT | We address the maximum attainable rate of fingerprinting codes under the
marking assumption, studying lower and upper bounds on the value of the rate
for various sizes of the attacker coalition. Lower bounds are obtained by
considering typical coalitions, which represents a new idea in the area of
fingerprinting and ... |
cs/0612075 | Intermediate Performance of Rateless Codes | cs.IT math.IT | Rateless/fountain codes are designed so that all input symbols can be
recovered from a slightly larger number of coded symbols, with high probability
using an iterative decoder. In this paper we investigate the number of input
symbols that can be recovered by the same decoder, but when the number of coded
symbols ava... |
cs/0612076 | A New Approach for Capacity Analysis of Large Dimensional Multi-Antenna
Channels | cs.IT math.IT math.PR | This paper adresses the behaviour of the mutual information of correlated
MIMO Rayleigh channels when the numbers of transmit and receive antennas
converge to infinity at the same rate. Using a new and simple approach based on
Poincar\'{e}-Nash inequality and on an integration by parts formula, it is
rigorously estab... |
cs/0612077 | Algebraic Signal Processing Theory | cs.IT math.IT | This paper presents an algebraic theory of linear signal processing. At the
core of algebraic signal processing is the concept of a linear signal model
defined as a triple (A, M, phi), where familiar concepts like the filter space
and the signal space are cast as an algebra A and a module M, respectively, and
phi gen... |
cs/0612078 | Effect of Finite Rate Feedback on CDMA Signature Optimization and MIMO
Beamforming Vector Selection | cs.IT math.IT | We analyze the effect of finite rate feedback on CDMA (code-division multiple
access) signature optimization and MIMO (multi-input-multi-output) beamforming
vector selection. In CDMA signature optimization, for a particular user, the
receiver selects a signature vector from a codebook to best avoid interference
from ... |
cs/0612080 | On the Decrease Rate of the Non-Gaussianness of the Sum of Independent
Random Variables | cs.IT math.IT | Several proofs of the monotonicity of the non-Gaussianness (divergence with
respect to a Gaussian random variable with identical second order statistics)
of the sum of n independent and identically distributed (i.i.d.) random
variables were published. We give an upper bound on the decrease rate of the
non-Gaussiannes... |
cs/0612083 | A Byzantine Fault Tolerant Distributed Commit Protocol | cs.DC cs.DB | In this paper, we present a Byzantine fault tolerant distributed commit
protocol for transactions running over untrusted networks. The traditional
two-phase commit protocol is enhanced by replicating the coordinator and by
running a Byzantine agreement algorithm among the coordinator replicas. Our
protocol can tolera... |
cs/0612084 | Achievable Rates for the General Gaussian Multiple Access Wire-Tap
Channel with Collective Secrecy | cs.IT cs.CR math.IT | We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT).
In this scenario, multiple users communicate with an intended receiver in the
presence of an intelligent and informed eavesdropper who is as capable as the
intended receiver, but has different channel parameters. We aim to provide
perfect s... |
cs/0612086 | An asynchronous, decentralised commitment protocol for semantic
optimistic replication | cs.DB cs.NI | We study large-scale distributed cooperative systems that use optimistic
replication. We represent a system as a graph of actions (operations) connected
by edges that reify semantic constraints between actions. Constraint types
include conflict, execution order, dependence, and atomicity. The local state
is some sche... |
cs/0612087 | Statistical mechanics of neocortical interactions: Portfolio of
Physiological Indicators | cs.CE cs.IT cs.NE math.IT q-bio.QM | There are several kinds of non-invasive imaging methods that are used to
collect data from the brain, e.g., EEG, MEG, PET, SPECT, fMRI, etc. It is
difficult to get resolution of information processing using any one of these
methods. Approaches to integrate data sources may help to get better resolution
of data and be... |
cs/0612095 | Approximation of the Two-Part MDL Code | cs.LG cs.AI cs.IT math.IT | Approximation of the optimal two-part MDL code for given data, through
successive monotonically length-decreasing two-part MDL codes, has the
following properties: (i) computation of each step may take arbitrarily long;
(ii) we may not know when we reach the optimum, or whether we will reach the
optimum at all; (iii)... |
cs/0612096 | Using state space differential geometry for nonlinear blind source
separation | cs.LG cs.SD | Given a time series of multicomponent measurements of an evolving stimulus,
nonlinear blind source separation (BSS) seeks to find a "source" time series,
comprised of statistically independent combinations of the measured components.
In this paper, we seek a source time series with local velocity cross
correlations t... |
cs/0612097 | Error Exponents for Variable-length Block Codes with Feedback and Cost
Constraints | cs.IT math.IT | Variable-length block-coding schemes are investigated for discrete memoryless
channels with ideal feedback under cost constraints. Upper and lower bounds are
found for the minimum achievable probability of decoding error $P_{e,\min}$ as
a function of constraints $R, \AV$, and $\bar \tau$ on the transmission rate,
ave... |
cs/0612099 | Network Information Flow in Small World Networks | cs.IT cs.DM math.IT | Recent results from statistical physics show that large classes of complex
networks, both man-made and of natural origin, are characterized by high
clustering properties yet strikingly short path lengths between pairs of nodes.
This class of networks are said to have a small-world topology. In the context
of communic... |
cs/0612101 | Maximum Entropy MIMO Wireless Channel Models | cs.IT math.IT | In this contribution, models of wireless channels are derived from the
maximum entropy principle, for several cases where only limited information
about the propagation environment is available. First, analytical models are
derived for the cases where certain parameters (channel energy, average energy,
spatial correl... |
cs/0612102 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | cs.DB | We show that for every conjunctive query, the complexity of evaluating it on
a probabilistic database is either \PTIME or #\P-complete, and we give an
algorithm for deciding whether a given conjunctive query is \PTIME or
#\P-complete. The dichotomy property is a fundamental result on query
evaluation on probabilistic... |
cs/0612103 | The Boundary Between Privacy and Utility in Data Anonymization | cs.DB | We consider the privacy problem in data publishing: given a relation I
containing sensitive information 'anonymize' it to obtain a view V such that,
on one hand attackers cannot learn any sensitive information from V, and on the
other hand legitimate users can use V to compute useful statistics on I. These
are confli... |
cs/0612104 | Sufficient Conditions for Coarse-Graining Evolutionary Dynamics | cs.NE cs.AI | It is commonly assumed that the ability to track the frequencies of a set of
schemata in the evolving population of an infinite population genetic algorithm
(IPGA) under different fitness functions will advance efforts to obtain a
theory of adaptation for the simple GA. Unfortunately, for IPGAs with long
genomes and ... |
cs/0612109 | Truncating the loop series expansion for Belief Propagation | cs.AI | Recently, M. Chertkov and V.Y. Chernyak derived an exact expression for the
partition sum (normalization constant) corresponding to a graphical model,
which is an expansion around the Belief Propagation solution. By adding
correction terms to the BP free energy, one for each "generalized loop" in the
factor graph, th... |
cs/0612110 | Architecture for Modular Data Centers | cs.DB | Several factors are driving high-scale deployments of large data centers
built upon commodity components. These commodity clusters are far cheaper than
mainframe systems of the past but they bring serious heat and power density
issues. Also the high failure rate of the individual components drives
significant adminis... |
cs/0612111 | Fragmentation in Large Object Repositories | cs.DB | Fragmentation leads to unpredictable and degraded application performance.
While these problems have been studied in detail for desktop filesystem
workloads, this study examines newer systems such as scalable object stores and
multimedia repositories. Such systems use a get/put interface to store objects.
In principl... |
cs/0612112 | Managing Query Compilation Memory Consumption to Improve DBMS Throughput | cs.DB | While there are known performance trade-offs between database page buffer
pool and query execution memory allocation policies, little has been written on
the impact of query compilation memory use on overall throughput of the
database management system (DBMS). We present a new aspect of the query
optimization problem... |
cs/0612113 | Isolation Support for Service-based Applications: A Position Paper | cs.DB | In this paper, we propose an approach to providing the benefits of isolation
in service-oriented applications where it is not feasible to hold traditional
locks for ACID transactions. Our technique, called "Promises", provides an
uniform view for clients which covers a wide range of implementation techniques
on the s... |
cs/0612114 | Demaq: A Foundation for Declarative XML Message Processing | cs.DB | This paper gives an overview of Demaq, an XML message processing system
operating on the foundation of transactional XML message queues. We focus on
the syntax and semantics of its fully declarative, rule-based application
language and demonstrate our message-based programming paradigm in the context
of a case study.... |
cs/0612115 | Consistent Streaming Through Time: A Vision for Event Stream Processing | cs.DB | Event processing will play an increasingly important role in constructing
enterprise applications that can immediately react to business critical events.
Various technologies have been proposed in recent years, such as event
processing, data streams and asynchronous messaging (e.g. pub/sub). We believe
these technolo... |
cs/0612117 | Statistical Mechanics of On-line Learning when a Moving Teacher Goes
around an Unlearnable True Teacher | cs.LG cond-mat.dis-nn | In the framework of on-line learning, a learning machine might move around a
teacher due to the differences in structures or output functions between the
teacher and the learning machine. In this paper we analyze the generalization
performance of a new student supervised by a moving machine. A model composed
of a fix... |
cs/0612118 | Gossiping with Multiple Messages | cs.NI cs.IT math.IT | This paper investigates the dissemination of multiple pieces of information
in large networks where users contact each other in a random uncoordinated
manner, and users upload one piece per unit time. The underlying motivation is
the design and analysis of piece selection protocols for peer-to-peer networks
which dis... |
cs/0612122 | Large N Analysis of Amplify-and-Forward MIMO Relay Channels with
Correlated Rayleigh Fading | cs.IT math.IT | In this correspondence the cumulants of the mutual information of the flat
Rayleigh fading amplify-and-forward MIMO relay channel without direct link
between source and destination are derived in the large array limit. The
analysis is based on the replica trick and covers both spatially independent
and correlated fad... |
cs/0612123 | Electronic Laboratory Notebook Assisting Reflectance Spectrometry in
Legal Medicine | cs.DB cs.DL cs.IR | Reflectance spectrometry is a fast and reliable method for the
characterisation of human skin if the spectra are analysed with respect to a
physical model describing the optical properties of human skin. For a field
study performed at the Institute of Legal Medicine and the Freiburg Materials
Research Center of the U... |
cs/0612124 | Highly robust error correction by convex programming | cs.IT math.IT math.PR math.ST stat.TH | This paper discusses a stylized communications problem where one wishes to
transmit a real-valued signal x in R^n (a block of n pieces of information) to
a remote receiver. We ask whether it is possible to transmit this information
reliably when a fraction of the transmitted codeword is corrupted by arbitrary
gross e... |
cs/0612126 | The virtual reality framework for engineering objects | cs.CE cs.MS | A framework for virtual reality of engineering objects has been developed.
This framework may simulate different equipment related to virtual reality.
Framework supports 6D dynamics, ordinary differential equations, finite
formulas, vector and matrix operations. The framework also supports embedding
of external softw... |
cs/0612127 | bdbms -- A Database Management System for Biological Data | cs.DB | Biologists are increasingly using databases for storing and managing their
data. Biological databases typically consist of a mixture of raw data,
metadata, sequences, annotations, and related data obtained from various
sources. Current database technology lacks several functionalities that are
needed by biological da... |
cs/0612128 | SASE: Complex Event Processing over Streams | cs.DB | RFID technology is gaining adoption on an increasing scale for tracking and
monitoring purposes. Wide deployments of RFID devices will soon generate an
unprecedented volume of data. Emerging applications require the RFID data to be
filtered and correlated for complex pattern detection and transformed to events
that p... |
cs/0612129 | Impliance: A Next Generation Information Management Appliance | cs.DB | ably successful in building a large market and adapting to the changes of the
last three decades, its impact on the broader market of information management
is surprisingly limited. If we were to design an information management system
from scratch, based upon today's requirements and hardware capabilities, would
it ... |
cs/0612132 | A New Era in Citation and Bibliometric Analyses: Web of Science, Scopus,
and Google Scholar | cs.DL cs.IR | Academic institutions, federal agencies, publishers, editors, authors, and
librarians increasingly rely on citation analysis for making hiring, promotion,
tenure, funding, and/or reviewer and journal evaluation and selection
decisions. The Institute for Scientific Information's (ISI) citation databases
have been used... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.