id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0712.0873 | The price of ignorance: The impact of side-information on delay for
lossless source-coding | cs.IT math.IT | Inspired by the context of compressing encrypted sources, this paper
considers the general tradeoff between rate, end-to-end delay, and probability
of error for lossless source coding with side-information. The notion of
end-to-end delay is made precise by considering a sequential setting in which
source symbols are ... |
0712.0932 | Dimensionality Reduction and Reconstruction using Mirroring Neural
Networks and Object Recognition based on Reduced Dimension Characteristic
Vector | cs.CV cs.AI cs.NE | In this paper, we present a Mirroring Neural Network architecture to perform
non-linear dimensionality reduction and Object Recognition using a reduced
lowdimensional characteristic vector. In addition to dimensionality reduction,
the network also reconstructs (mirrors) the original high-dimensional input
vector from... |
0712.0938 | Automatic Pattern Classification by Unsupervised Learning Using
Dimensionality Reduction of Data with Mirroring Neural Networks | cs.LG cs.AI cs.NE | This paper proposes an unsupervised learning technique by using Multi-layer
Mirroring Neural Network and Forgy's clustering algorithm. Multi-layer
Mirroring Neural Network is a neural network that can be trained with
generalized data inputs (different categories of image patterns) to perform
non-linear dimensionality... |
0712.0948 | A Common View on Strong, Uniform, and Other Notions of Equivalence in
Answer-Set Programming | cs.AI cs.LO | Logic programming under the answer-set semantics nowadays deals with numerous
different notions of program equivalence. This is due to the fact that
equivalence for substitution (known as strong equivalence) and ordinary
equivalence are different concepts. The former holds, given programs P and Q,
iff P can be faithf... |
0712.0975 | Random quantum codes from Gaussian ensembles and an uncertainty relation | quant-ph cs.IT math.IT | Using random Gaussian vectors and an information-uncertainty relation, we
give a proof that the coherent information is an achievable rate for
entanglement transmission through a noisy quantum channel. The codes are random
subspaces selected according to the Haar measure, but distorted as a function
of the sender's i... |
0712.1097 | On Using Unsatisfiability for Solving Maximum Satisfiability | cs.AI cs.DS | Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with
several practical applications. The most widely known MAXS AT algorithms are
ineffective at solving hard problems instances from practical application
domains. Recent work proposed using efficient Boolean Satisfiability (SAT)
solvers for sol... |
0712.1169 | Opportunistic Relaying in Wireless Networks | cs.IT math.IT | Relay networks having $n$ source-to-destination pairs and $m$ half-duplex
relays, all operating in the same frequency band in the presence of block
fading, are analyzed. This setup has attracted significant attention and
several relaying protocols have been reported in the literature. However, most
of the proposed so... |
0712.1182 | Cumulative and Averaging Fission of Beliefs | cs.AI cs.LO | Belief fusion is the principle of combining separate beliefs or bodies of
evidence originating from different sources. Depending on the situation to be
modelled, different belief fusion methods can be applied. Cumulative and
averaging belief fusion is defined for fusing opinions in subjective logic, and
for fusing be... |
0712.1310 | About Algorithm for Transformation of Logic Functions (ATLF) | cs.LO cs.AI | In this article the algorithm for transformation of logic functions which are
given by truth tables is considered. The suggested algorithm allows the
transformation of many-valued logic functions with the required number of
variables and can be looked in this sense as universal.
|
0712.1339 | Joint Receiver and Transmitter Optimization for Energy-Efficient CDMA
Communications | cs.IT cs.GT math.IT | This paper focuses on the cross-layer issue of joint multiuser detection and
resource allocation for energy efficiency in wireless CDMA networks. In
particular, assuming that a linear multiuser detector is adopted in the uplink
receiver, the case considered is that in which each terminal is allowed to vary
its transm... |
0712.1345 | Sequential operators in computability logic | cs.LO cs.AI math.LO | Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a
semantical platform and research program for redeveloping logic as a formal
theory of computability, as opposed to the formal theory of truth which it has
more traditionally been. Formulas in CL stand for (interactive) computational
problems... |
0712.1365 | Population stratification using a statistical model on hypergraphs | q-bio.PE cs.AI physics.data-an | Population stratification is a problem encountered in several areas of
biology and public health. We tackle this problem by mapping a population and
its elements attributes into a hypergraph, a natural extension of the concept
of graph or network to encode associations among any number of elements. On
this hypergraph... |
0712.1402 | Reconstruction of Markov Random Fields from Samples: Some Easy
Observations and Algorithms | cs.CC cs.LG | Markov random fields are used to model high dimensional distributions in a
number of applied areas. Much recent interest has been devoted to the
reconstruction of the dependency structure from independent samples from the
Markov random fields. We analyze a simple algorithm for reconstructing the
underlying graph defi... |
0712.1442 | On types of growth for graph-different permutations | math.CO cs.IT math.IT | We consider an infinite graph G whose vertex set is the set of natural
numbers and adjacency depends solely on the difference between vertices. We
study the largest cardinality of a set of permutations of [n] any pair of which
differ somewhere in a pair of adjacent vertices of G and determine it
completely in an inte... |
0712.1529 | Ontology and Formal Semantics - Integration Overdue | cs.AI cs.CL | In this note we suggest that difficulties encountered in natural language
semantics are, for the most part, due to the use of mere symbol manipulation
systems that are devoid of any content. In such systems, where there is hardly
any link with our common-sense view of the world, and it is quite difficult to
envision ... |
0712.1609 | Distributed Consensus Algorithms in Sensor Networks: Quantized Data and
Random Link Failures | cs.MA cs.IT math.IT | The paper studies the problem of distributed average consensus in sensor
networks with quantized data and random link failures. To achieve consensus,
dither (small noise) is added to the sensor states before quantization. When
the quantizer range is unbounded (countable number of quantizer levels),
stochastic approxi... |
0712.1659 | Non-linear and Linear Broadcasting with QoS Requirements: Tractable
Approaches for Bounded Channel Uncertainties | cs.IT math.IT | We consider the downlink of a cellular system in which the base station
employs multiple transmit antennas, each receiver has a single antenna, and the
users specify. We consider communication schemes in which the users have
certain Quality of Service (QoS) requirements. We study the design of robust
broadcasting sch... |
0712.1775 | On Computation of Error Locations and Values in Hermitian Codes | cs.IT math.IT | We obtain a technique to reduce the computational complexity associated with
decoding of Hermitian codes. In particular, we propose a method to compute the
error locations and values using an uni-variate error locator and an
uni-variate error evaluator polynomial. To achieve this, we introduce the
notion of Semi-Eras... |
0712.1863 | Constructing Bio-molecular Databases on a DNA-based Computer | cs.NE cs.DB q-bio.OT | Codd [Codd 1970] wrote the first paper in which the model of a relational
database was proposed. Adleman [Adleman 1994] wrote the first paper in which
DNA strands in a test tube were used to solve an instance of the Hamiltonian
path problem. From [Adleman 1994], it is obviously indicated that for storing
information ... |
0712.1875 | Critique du rapport signal \`a bruit en th\'eorie de l'information -- A
critical appraisal of the signal to noise ratio in information theory | cs.IT math.IT math.LO math.PR math.RA quant-ph | The signal to noise ratio, which plays such an important role in information
theory, is shown to become pointless in digital communications where - symbols
are modulating carriers, which are solutions of linear differential equations
with polynomial coefficients, - demodulations is achieved thanks to new
algebraic es... |
0712.1878 | Hierarchy construction schemes within the Scale set framework | cs.CV | Segmentation algorithms based on an energy minimisation framework often
depend on a scale parameter which balances a fit to data and a regularising
term. Irregular pyramids are defined as a stack of graphs successively reduced.
Within this framework, the scale is often defined implicitly as the height in
the pyramid.... |
0712.1987 | A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for
Gaussian Interference Channels | cs.IT math.IT | A new outer bound on the capacity region of Gaussian interference channels is
developed. The bound combines and improves existing genie-aided methods and is
shown to give the sum-rate capacity for noisy interference as defined in this
paper. Specifically, it is shown that if the channel coefficients and power
constra... |
0712.1996 | A case study of the difficulty of quantifier elimination in constraint
databases: the alibi query in moving object databases | cs.LO cs.CC cs.DB | In the constraint database model, spatial and spatio-temporal data are stored
by boolean combinations of polynomial equalities and inequalities over the real
numbers. The relational calculus augmented with polynomial constraints is the
standard first-order query language for constraint databases. Although the
express... |
0712.2063 | An axiomatic approach to intrinsic dimension of a dataset | cs.IR | We perform a deeper analysis of an axiomatic approach to the concept of
intrinsic dimension of a dataset proposed by us in the IJCNN'07 paper
(arXiv:cs/0703125). The main features of our approach are that a high intrinsic
dimension of a dataset reflects the presence of the curse of dimensionality (in
a certain mathem... |
0712.2100 | Medical image computing and computer-aided medical interventions applied
to soft tissues. Work in progress in urology | cs.OH cs.RO | Until recently, Computer-Aided Medical Interventions (CAMI) and Medical
Robotics have focused on rigid and non deformable anatomical structures.
Nowadays, special attention is paid to soft tissues, raising complex issues due
to their mobility and deformation. Mini-invasive digestive surgery was probably
one of the fi... |
0712.2141 | Numerical Sensitivity and Efficiency in the Treatment of Epistemic and
Aleatory Uncertainty | cs.AI math.PR | The treatment of both aleatory and epistemic uncertainty by recent methods
often requires an high computational effort. In this abstract, we propose a
numerical sampling method allowing to lighten the computational burden of
treating the information by means of so-called fuzzy random variables.
|
0712.2182 | Optimal codes for correcting a single (wrap-around) burst of errors | cs.IT math.IT | In 2007, Martinian and Trott presented codes for correcting a burst of
erasures with a minimum decoding delay. Their construction employs [n,k] codes
that can correct any burst of erasures (including wrap-around bursts) of length
n-k. The raised the question if such [n,k] codes exist for all integers k and n
with 1<=... |
0712.2223 | Entanglement-Assisted Quantum Convolutional Coding | quant-ph cs.IT math.IT | We show how to protect a stream of quantum information from decoherence
induced by a noisy quantum communication channel. We exploit preshared
entanglement and a convolutional coding structure to develop a theory of
entanglement-assisted quantum convolutional coding. Our construction produces a
Calderbank-Shor-Steane... |
0712.2245 | Exact and Approximate Expressions for the Probability of Undetected
Error of Varshamov-Tenengol'ts Codes | cs.IT math.IT | Computation of the undetected error probability for error correcting codes
over the Z-channel is an important issue, explored only in part in previous
literature. In this paper we consider the case of Varshamov-Tenengol'ts codes,
by presenting some analytical, numerical, and heuristic methods for unveiling
this addit... |
0712.2255 | Human-Machine Symbiosis, 50 Years On | cs.DC cs.CE cs.HC | Licklider advocated in 1960 the construction of computers capable of working
symbiotically with humans to address problems not easily addressed by humans
working alone. Since that time, many of the advances that he envisioned have
been achieved, yet the time spent by human problem solvers in mundane
activities remain... |
0712.2262 | The Earth System Grid: Supporting the Next Generation of Climate
Modeling Research | cs.CE cs.DC cs.NI | Understanding the earth's climate system and how it might be changing is a
preeminent scientific challenge. Global climate models are used to simulate
past, present, and future climates, and experiments are executed continuously
on an array of distributed supercomputers. The resulting data archive, spread
over severa... |
0712.2371 | Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras | cs.IT math.IT | It is well known that Space-Time Block Codes (STBCs) from orthogonal designs
(ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are
obtainable from unitary matrix representations of Clifford algebras. However,
SSD codes are obtainable from designs that are not orthogonal also. Recently,
two such c... |
0712.2384 | Multi-group ML Decodable Collocated and Distributed Space Time Block
Codes | cs.IT cs.DM math.IT math.RA | In this paper, collocated and distributed space-time block codes (DSTBCs)
which admit multi-group maximum likelihood (ML) decoding are studied. First the
collocated case is considered and the problem of constructing space-time block
codes (STBCs) which optimally tradeoff rate and ML decoding complexity is
posed. Rece... |
0712.2389 | Decomposition During Search for Propagation-Based Constraint Solvers | cs.AI | We describe decomposition during search (DDS), an integration of And/Or tree
search into propagation-based constraint solvers. The presented search
algorithm dynamically decomposes sub-problems of a constraint satisfaction
problem into independent partial problems, avoiding redundant work.
The paper discusses how D... |
0712.2430 | Limits to consistent on-line forecasting for ergodic time series | math.PR cs.IT math.IT | This study concerns problems of time-series forecasting under the weakest of
assumptions. Related results are surveyed and are points of departure for the
developments here, some of which are new and others are new derivations of
previous findings. The contributions in this study are all negative, showing
that variou... |
0712.2467 | Rethinking Information Theory for Mobile Ad Hoc Networks | cs.IT math.IT | The subject of this paper is the long-standing open problem of developing a
general capacity theory for wireless networks, particularly a theory capable of
describing the fundamental performance limits of mobile ad hoc networks
(MANETs). A MANET is a peer-to-peer network with no pre-existing
infrastructure. MANETs ar... |
0712.2469 | Directed Percolation in Wireless Networks with Interference and Noise | cs.IT cs.NI math.IT math.PR | Previous studies of connectivity in wireless networks have focused on
undirected geometric graphs. More sophisticated models such as
Signal-to-Interference-and-Noise-Ratio (SINR) model, however, usually leads to
directed graphs. In this paper, we study percolation processes in wireless
networks modelled by directed S... |
0712.2497 | A New Theoretic Foundation for Cross-Layer Optimization | cs.NI cs.LG | Cross-layer optimization solutions have been proposed in recent years to
improve the performance of network users operating in a time-varying,
error-prone wireless environment. However, these solutions often rely on ad-hoc
optimization approaches, which ignore the different environmental dynamics
experienced at vario... |
0712.2552 | The PBD-Closure of Constant-Composition Codes | cs.IT cs.DM math.CO math.IT | We show an interesting PBD-closure result for the set of lengths of
constant-composition codes whose distance and size meet certain conditions. A
consequence of this PBD-closure result is that the size of optimal
constant-composition codes can be determined for infinite families of parameter
sets from just a single e... |
0712.2553 | Constructions for Difference Triangle Sets | cs.IT cs.DM math.CO math.IT | Difference triangle sets are useful in many practical problems of information
transmission. This correspondence studies combinatorial and computational
constructions for difference triangle sets having small scopes. Our algorithms
have been used to produce difference triangle sets whose scopes are the best
currently ... |
0712.2579 | On the Information of the Second Moments Between Random Variables Using
Mutually Unbiased Bases | cs.IT math.IT | The notation of mutually unbiased bases(MUB) was first introduced by Ivanovic
to reconstruct density matrixes\cite{Ivanovic}. The subject about how to use
MUB to analyze, process, and utilize the information of the second moments
between random variables is studied in this paper. In the first part, the
mathematical f... |
0712.2587 | Maximum-Likelihood Priority-First Search Decodable Codes for Combined
Channel Estimation and Error Protection | cs.IT math.IT | The code that combines channel estimation and error protection has received
general attention recently, and has been considered a promising methodology to
compensate multi-path fading effect. It has been shown by simulations that such
code design can considerably improve the system performance over the
conventional d... |
0712.2592 | Strongly consistent nonparametric forecasting and regression for
stationary ergodic sequences | math.PR cs.IT math.IT | Let $\{(X_i,Y_i)\}$ be a stationary ergodic time series with $(X,Y)$ values
in the product space $\R^d\bigotimes \R .$ This study offers what is believed
to be the first strongly consistent (with respect to pointwise, least-squares,
and uniform distance) algorithm for inferring $m(x)=E[Y_0|X_0=x]$ under the
presumpti... |
0712.2619 | A New Lower Bound for A(17,6,6) | cs.IT cs.DM math.CO math.IT | We construct a record-breaking binary code of length 17, minimal distance 6,
constant weight 6, and containing 113 codewords.
|
0712.2630 | Evolving XSLT stylesheets | cs.NE cs.PL | This paper introduces a procedure based on genetic programming to evolve XSLT
programs (usually called stylesheets or logicsheets). XSLT is a general
purpose, document-oriented functional language, generally used to transform XML
documents (or, in general, solve any problem that can be coded as an XML
document). The ... |
0712.2640 | Optimal Memoryless Encoding for Low Power Off-Chip Data Buses | cs.AR cs.DM cs.IT math.IT | Off-chip buses account for a significant portion of the total system power
consumed in embedded systems. Bus encoding schemes have been proposed to
minimize power dissipation, but none has been demonstrated to be optimal with
respect to any measure. In this paper, we give the first provably optimal and
explicit (poly... |
0712.2643 | Changing Levels of Description in a Fluid Flow Simulation | physics.flu-dyn cs.CE | We describe here our perception of complex systems, of how we feel the
different layers of description are important part of a correct complex system
simulation. We describe a rough models categorization between rules based and
law based, of how these categories handled the levels of descriptions or
scales. We then d... |
0712.2684 | An Economic Model of Coupled Exponential Maps | q-fin.GN cs.MA nlin.AO physics.soc-ph | In this work, an ensemble of economic interacting agents is considered. The
agents are arranged in a linear array where only local couplings are allowed.
The deterministic dynamics of each agent is given by a map. This map is
expressed by two factors. The first one is a linear term that models the
expansion of the ag... |
0712.2773 | Middleware-based Database Replication: The Gaps between Theory and
Practice | cs.DB cs.DC cs.PF | The need for high availability and performance in data management systems has
been fueling a long running interest in database replication from both academia
and industry. However, academic groups often attack replication problems in
isolation, overlooking the need for completeness in their solutions, while
commercia... |
0712.2789 | Trading in Risk Dimensions (TRD) | cs.CE cs.NA | Previous work, mostly published, developed two-shell recursive trading
systems. An inner-shell of Canonical Momenta Indicators (CMI) is adaptively fit
to incoming market data. A parameterized trading-rule outer-shell uses the
global optimization code Adaptive Simulated Annealing (ASA) to fit the trading
system to his... |
0712.2857 | Single-Exclusion Number and the Stopping Redundancy of MDS Codes | cs.IT cs.DM math.CO math.IT | For a linear block code C, its stopping redundancy is defined as the smallest
number of check nodes in a Tanner graph for C, such that there exist no
stopping sets of size smaller than the minimum distance of C. Schwartz and
Vardy conjectured that the stopping redundancy of an MDS code should only
depend on its lengt... |
0712.2869 | Density estimation in linear time | cs.LG | We consider the problem of choosing a density estimate from a set of
distributions F, minimizing the L1-distance to an unknown distribution
(Devroye, Lugosi 2001). Devroye and Lugosi analyze two algorithms for the
problem: Scheffe tournament winner and minimum distance estimate. The Scheffe
tournament estimate requir... |
0712.2870 | The source coding game with a cheating switcher | cs.IT cs.CV math.IT | Motivated by the lossy compression of an active-vision video stream, we
consider the problem of finding the rate-distortion function of an arbitrarily
varying source (AVS) composed of a finite number of subsources with known
distributions. Berger's paper `The Source Coding Game', \emph{IEEE Trans.
Inform. Theory}, 19... |
0712.2872 | Low SNR Capacity of Noncoherent Fading Channels | cs.IT math.IT | Discrete-time Rayleigh fading single-input single-output (SISO) and
multiple-input multiple-output (MIMO) channels are considered, with no channel
state information at the transmitter or the receiver. The fading is assumed to
be stationary and correlated in time, but independent from antenna to antenna.
Peak-power an... |
0712.2923 | A Class of LULU Operators on Multi-Dimensional Arrays | cs.CV | The LULU operators for sequences are extended to multi-dimensional arrays via
the morphological concept of connection in a way which preserves their
essential properties, e.g. they are separators and form a four element fully
ordered semi-group. The power of the operators is demonstrated by deriving a
total variation... |
0712.2959 | Joint Source-Channel Coding Revisited: Information-Spectrum Approach | cs.IT math.IT | Given a general source with countably infinite source alphabet and a general
channel with arbitrary abstract channel input/channel output alphabets, we
study the joint source-channel coding problem from the information-spectrum
point of view. First, we generalize Feinstein's lemma (direct part) and
Verdu-Han's lemma ... |
0712.3147 | Common knowledge logic in a higher order proof assistant? | cs.AI cs.LO | This paper presents experiments on common knowledge logic, conducted with the
help of the proof assistant Coq. The main feature of common knowledge logic is
the eponymous modality that says that a group of agents shares a knowledge
about a certain proposition in a inductive way. This modality is specified by
using a ... |
0712.3277 | On the Capacity and Energy Efficiency of Training-Based Transmissions
over Fading Channels | cs.IT math.IT | In this paper, the capacity and energy efficiency of training-based
communication schemes employed for transmission over a-priori unknown Rayleigh
block fading channels are studied. In these schemes, periodically transmitted
training symbols are used at the receiver to obtain the minimum
mean-square-error (MMSE) esti... |
0712.3286 | Error Rate Analysis for Peaky Signaling over Fading Channels | cs.IT math.IT | In this paper, the performance of signaling strategies with high
peak-to-average power ratio is analyzed over both coherent and noncoherent
fading channels. Two modulation schemes, namely on-off phase-shift keying
(OOPSK) and on-off frequency-shift keying (OOFSK), are considered. Initially,
uncoded systems are analyz... |
0712.3298 | CLAIRLIB Documentation v1.03 | cs.IR cs.CL | The Clair library is intended to simplify a number of generic tasks in
Natural Language Processing (NLP), Information Retrieval (IR), and Network
Analysis. Its architecture also allows for external software to be plugged in
with very little effort. Functionality native to Clairlib includes
Tokenization, Summarization... |
0712.3299 | Computer- and robot-assisted urological surgery | cs.OH cs.RO | The author reviews the computer and robotic tools available to urologists to
help in diagnosis and technical procedures. The first part concerns the
contribution of robotics and presents several systems at various stages of
development (laboratory prototypes, systems under validation or marketed
systems). The second ... |
0712.3327 | The capacity of a class of 3-receiver broadcast channels with degraded
message sets | cs.IT math.IT | Korner and Marton established the capacity region for the 2-receiver
broadcast channel with degraded message sets. Recent results and conjectures
suggest that a straightforward extension of the Korner-Marton region to more
than 2 receivers is optimal. This paper shows that this is not the case. We
establish the capac... |
0712.3329 | Universal Intelligence: A Definition of Machine Intelligence | cs.AI | A fundamental problem in artificial intelligence is that nobody really knows
what intelligence is. The problem is especially acute when we need to consider
artificial systems which are significantly different to humans. In this paper
we approach this problem in the following way: We take a number of well known
inform... |
0712.3402 | Graph kernels between point clouds | cs.LG | Point clouds are sets of points in two or three dimensions. Most kernel
methods for learning on sets of points have not yet dealt with the specific
geometrical invariances and practical constraints associated with point clouds
in computer vision and graphics. In this paper, we present extensions of graph
kernels for ... |
0712.3423 | Tuplix Calculus | cs.LO cs.CE | We introduce a calculus for tuplices, which are expressions that generalize
matrices and vectors. Tuplices have an underlying data type for quantities that
are taken from a zero-totalized field. We start with the core tuplix calculus
CTC for entries and tests, which are combined using conjunctive composition. We
defi... |
0712.3501 | The Impact of Hard-Decision Detection on the Energy Efficiency of Phase
and Frequency Modulation | cs.IT math.IT | The central design challenge in next generation wireless systems is to have
these systems operate at high bandwidths and provide high data rates while
being cognizant of the energy consumption levels especially in mobile
applications. Since communicating at very high data rates prohibits obtaining
high bit resolution... |
0712.3576 | Protocols For Half-Duplex Multiple Relay Networks | cs.IT math.IT | In this paper we present several strategies for multiple relay networks which
are constrained by a half-duplex operation, i. e., each node either transmits
or receives on a particular resource. Using the discrete memoryless multiple
relay channel we present achievable rates for a multilevel partial
decode-and-forward... |
0712.3587 | Pattern Recognition System Design with Linear Encoding for Discrete
Patterns | cs.IT cs.CV math.IT | In this paper, designs and analyses of compressive recognition systems are
discussed, and also a method of establishing a dual connection between designs
of good communication codes and designs of recognition systems is presented.
Pattern recognition systems based on compressed patterns and compressed sensor
measurem... |
0712.3617 | A Unified Framework for Pricing Credit and Equity Derivatives | cs.CE | We propose a model which can be jointly calibrated to the corporate bond term
structure and equity option volatility surface of the same company. Our purpose
is to obtain explicit bond and equity option pricing formulas that can be
calibrated to find a risk neutral model that matches a set of observed market
prices. ... |
0712.3654 | Improving the Performance of PieceWise Linear Separation Incremental
Algorithms for Practical Hardware Implementations | cs.NE cs.AI cs.LG | In this paper we shall review the common problems associated with Piecewise
Linear Separation incremental algorithms. This kind of neural models yield poor
performances when dealing with some classification problems, due to the
evolving schemes used to construct the resulting networks. So as to avoid this
undesirable... |
0712.3705 | Framework and Resources for Natural Language Parser Evaluation | cs.CL | Because of the wide variety of contemporary practices used in the automatic
syntactic parsing of natural languages, it has become necessary to analyze and
evaluate the strengths and weaknesses of different approaches. This research is
all the more necessary because there are currently no genre- and
domain-independent... |
0712.3807 | Improved Collaborative Filtering Algorithm via Information
Transformation | cs.LG cs.CY | In this paper, we propose a spreading activation approach for collaborative
filtering (SA-CF). By using the opinion spreading process, the similarity
between any users can be obtained. The algorithm has remarkably higher accuracy
than the standard collaborative filtering (CF) using Pearson correlation.
Furthermore, w... |
0712.3823 | Multidimensional reconciliation for continuous-variable quantum key
distribution | quant-ph cs.IT math.IT | We propose a method for extracting an errorless secret key in a
continuous-variable quantum key distribution protocol, which is based on
Gaussian modulation of coherent states and homodyne detection. The crucial
feature is an eight-dimensional reconciliation method, based on the algebraic
properties of octonions. Sin... |
0712.3825 | Tests of Machine Intelligence | cs.AI | Although the definition and measurement of intelligence is clearly of
fundamental importance to the field of artificial intelligence, no general
survey of definitions and tests of machine intelligence exists. Indeed few
researchers are even aware of alternatives to the Turing test and its many
derivatives. In this pa... |
0712.3896 | Tighter and Stable Bounds for Marcum Q-Function | cs.IT math.IT | This paper proposes new bounds for Marcum Q-function, which prove extremely
tight and outperform all the bounds previously proposed in the literature. What
is more, the proposed bounds are good and stable both for large values and
small values of the parameters of the Marcum Q-function, where the previously
introduce... |
0712.3925 | QIS-XML: A metadata specification for Quantum Information Science | cs.SE cs.DB quant-ph | While Quantum Information Science (QIS) is still in its infancy, the ability
for quantum based hardware or computers to communicate and integrate with their
classical counterparts will be a major requirement towards their success.
Little attention however has been paid to this aspect of QIS. To manage and
exchange in... |
0712.3973 | GUIDE: Unifying Evolutionary Engines through a Graphical User Interface | cs.NE | Many kinds of Evolutionary Algorithms (EAs) have been described in the
literature since the last 30 years. However, though most of them share a common
structure, no existing software package allows the user to actually shift from
one model to another by simply changing a few parameters, e.g. in a single
window of a G... |
0712.4011 | Asymptotic Mutual Information Statistics of Separately-Correlated Rician
Fading MIMO Channels | cs.IT math.IT | Precise characterization of the mutual information of MIMO systems is
required to assess the throughput of wireless communication channels in the
presence of Rician fading and spatial correlation. Here, we present an
asymptotic approach allowing to approximate the distribution of the mutual
information as a Gaussian ... |
0712.4015 | A Fast Hierarchical Multilevel Image Segmentation Method using Unbiased
Estimators | cs.CV | This paper proposes a novel method for segmentation of images by hierarchical
multilevel thresholding. The method is global, agglomerative in nature and
disregards pixel locations. It involves the optimization of the ratio of the
unbiased estimators of within class to between class variances. We obtain a
recursive re... |
0712.4059 | On Distributed Computation in Noisy Random Planar Networks | cs.IT math.IT | We consider distributed computation of functions of distributed data in
random planar networks with noisy wireless links. We present a new algorithm
for computation of the maximum value which is order optimal in the number of
transmissions and computation time.We also adapt the histogram computation
algorithm of Ying... |
0712.4075 | Polytope Representations for Linear-Programming Decoding of Non-Binary
Linear Codes | cs.IT math.IT | In previous work, we demonstrated how decoding of a non-binary linear code
could be formulated as a linear-programming problem. In this paper, we study
different polytopes for use with linear-programming decoding, and show that for
many classes of codes these polytopes yield a complexity advantage for
decoding. These... |
0712.4096 | Error-Correction of Multidimensional Bursts | cs.IT math.IT | In this paper we present several constructions to generate codes for
correcting a multidimensional cluster-error. The goal is to correct a
cluster-error whose shape can be a box-error, a Lee sphere error, or an error
with an arbitrary shape. Our codes have very low redundancy, close to optimal,
and large range of par... |
0712.4099 | Digital Ecosystems: Optimisation by a Distributed Intelligence | cs.NE | Can intelligence optimise Digital Ecosystems? How could a distributed
intelligence interact with the ecosystem dynamics? Can the software components
that are part of genetic selection be intelligent in themselves, as in an
adaptive technology? We consider the effect of a distributed intelligence
mechanism on the evol... |
0712.4101 | Digital Ecosystems: Stability of Evolving Agent Populations | cs.NE | Stability is perhaps one of the most desirable features of any engineered
system, given the importance of being able to predict its response to various
environmental conditions prior to actual deployment. Engineered systems are
becoming ever more complex, approaching the same levels of biological
ecosystems, and so t... |
0712.4102 | Digital Ecosystems: Evolving Service-Oriented Architectures | cs.NE | We view Digital Ecosystems to be the digital counterparts of biological
ecosystems, exploiting the self-organising properties of biological ecosystems,
which are considered to be robust, self-organising and scalable architectures
that can automatically solve complex, dynamic problems. Digital Ecosystems are
a novel o... |
0712.4103 | On the Monotonicity of the Generalized Marcum and Nuttall Q-Functions | cs.IT math.IT | Monotonicity criteria are established for the generalized Marcum Q-function,
$\emph{Q}_{M}$, the standard Nuttall Q-function, $\emph{Q}_{M,N}$, and the
normalized Nuttall Q-function, $\mathcal{Q}_{M,N}$, with respect to their real
order indices M,N. Besides, closed-form expressions are derived for the
computation of ... |
0712.4115 | A Class of Quantum LDPC Codes Constructed From Finite Geometries | quant-ph cs.IT math.IT | Low-density parity check (LDPC) codes are a significant class of classical
codes with many applications. Several good LDPC codes have been constructed
using random, algebraic, and finite geometries approaches, with containing
cycles of length at least six in their Tanner graphs. However, it is impossible
to design a ... |
0712.4126 | TRUST-TECH based Methods for Optimization and Learning | cs.AI cs.CE cs.MS cs.NA cs.NE | Many problems that arise in machine learning domain deal with nonlinearity
and quite often demand users to obtain global optimal solutions rather than
local optimal ones. Optimization problems are inherent in machine learning
algorithms and hence many methods in machine learning were inherited from the
optimization l... |
0712.4135 | On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian
Block-Fading Channels | cs.IT math.IT | The focus of this paper is an information-theoretic study of retransmission
protocols for reliable packet communication under a secrecy constraint. The
hybrid automatic retransmission request (HARQ) protocol is revisited for a
block-fading wire-tap channel, in which two legitimate users communicate over a
block-fadin... |
0712.4153 | Biology of Applied Digital Ecosystems | cs.NE cs.MA | A primary motivation for our research in Digital Ecosystems is the desire to
exploit the self-organising properties of biological ecosystems. Ecosystems are
thought to be robust, scalable architectures that can automatically solve
complex, dynamic problems. However, the biological processes that contribute to
these p... |
0712.4159 | Creating a Digital Ecosystem: Service-Oriented Architectures with
Distributed Evolutionary Computing | cs.NE | We start with a discussion of the relevant literature, including Nature
Inspired Computing as a framework in which to understand this work, and the
process of biomimicry to be used in mimicking the necessary biological
processes to create Digital Ecosystems. We then consider the relevant
theoretical ecology in creati... |
0712.4183 | Probabilistic Visual Secret Sharing Schemes for Gray-scale images and
Color images | cs.CR cs.CV | Visual secrete sharing (VSS) is an encryption technique that utilizes human
visual system in the recovering of the secret image and it does not require any
complex calculation. Pixel expansion has been a major issue of VSS schemes. A
number of probabilistic VSS schemes with minimum pixel expansion have been
proposed ... |
0712.4209 | The Generalized Random Energy Model and its Application to the
Statistical Physics of Ensembles of Hierarchical Codes | cs.IT math.IT | In an earlier work, the statistical physics associated with
finite--temperature decoding of code ensembles, along with the relation to
their random coding error exponents, were explored in a framework that is
analogous to Derrida's random energy model (REM) of spin glasses, according to
which the energy levels of the... |
0712.4273 | Online EM Algorithm for Latent Data Models | stat.CO cs.LG | In this contribution, we propose a generic online (also sometimes called
adaptive or recursive) version of the Expectation-Maximisation (EM) algorithm
applicable to latent variable models of independent observations. Compared to
the algorithm of Titterington (1984), this approach is more directly connected
to the usu... |
0712.4318 | Convergence of Expected Utilities with Algorithmic Probability
Distributions | cs.AI | We consider an agent interacting with an unknown environment. The environment
is a function which maps natural numbers to natural numbers; the agent's set of
hypotheses about the environment contains all such functions which are
computable and compatible with a finite set of known input-output pairs, and
the agent as... |
0712.4321 | Subsystem Code Constructions | quant-ph cs.IT math.IT | Subsystem codes are the most versatile class of quantum error-correcting
codes known to date that combine the best features of all known passive and
active error-control schemes. The subsystem code is a subspace of the quantum
state space that is decomposed into a tensor product of two vector spaces: the
subsystem an... |
0712.4402 | Judgment | math.PR cs.AI math.LO | The concept of a judgment as a logical action which introduces new
information into a deductive system is examined. This leads to a way of
mathematically representing implication which is distinct from the familiar
material implication, according to which "If A then B" is considered to be
equivalent to "B or not-A". ... |
0801.0061 | Security for Wiretap Networks via Rank-Metric Codes | cs.IT cs.CR math.IT | The problem of securing a network coding communication system against a
wiretapper adversary is considered. The network implements linear network
coding to deliver $n$ packets from source to each receiver, and the wiretapper
can eavesdrop on $\mu$ arbitrarily chosen links. A coding scheme is proposed
that can achieve... |
0801.0102 | Reserved-Length Prefix Coding | cs.IT cs.DS math.IT | Huffman coding finds an optimal prefix code for a given probability mass
function. Consider situations in which one wishes to find an optimal code with
the restriction that all codewords have lengths that lie in a user-specified
set of lengths (or, equivalently, no codewords have lengths that lie in a
complementary s... |
0801.0131 | Two-Level Concept-Oriented Data Model | cs.DB | In this paper we describe a new approach to data modelling called the
concept-oriented model (CoM). This model is based on the formalism of nested
ordered sets which uses inclusion relation to produce hierarchical structure of
sets and ordering relation to produce multi-dimensional structure among its
elements. Neste... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.