id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0806.1797 | A new generalization of the proportional conflict redistribution rule
stable in terms of decision | cs.AI | In this chapter, we present and discuss a new generalized proportional
conflict redistribution rule. The Dezert-Smarandache extension of the
Demster-Shafer theory has relaunched the studies on the combination rules
especially for the management of the conflict. Many combination rules have been
proposed in the last fe... |
0806.1798 | Human expert fusion for image classification | cs.CV cs.AI | In image classification, merging the opinion of several human experts is very
important for different tasks such as the evaluation or the training. Indeed,
the ground truth is rarely known before the scene imaging. We propose here
different models in order to fuse the informations given by two or more
experts. The co... |
0806.1802 | Une nouvelle r\`egle de combinaison r\'epartissant le conflit -
Applications en imagerie Sonar et classification de cibles Radar | cs.AI | These last years, there were many studies on the problem of the conflict
coming from information combination, especially in evidence theory. We can
summarise the solutions for manage the conflict into three different
approaches: first, we can try to suppress or reduce the conflict before the
combination step, secondl... |
0806.1806 | Perfect Derived Propagators | cs.AI | When implementing a propagator for a constraint, one must decide about
variants: When implementing min, should one also implement max? Should one
implement linear equations both with and without coefficients? Constraint
variants are ubiquitous: implementing them requires considerable (if not
prohibitive) effort and d... |
0806.1816 | Cardinality heterogeneities in Web service composition: Issues and
solutions | cs.SE cs.DB | Data exchanges between Web services engaged in a composition raise several
heterogeneities. In this paper, we address the problem of data cardinality
heterogeneity in a composition. Firstly, we build a theoretical framework to
describe different aspects of Web services that relate to data cardinality, and
secondly, w... |
0806.1819 | A Low-Complexity, Full-Rate, Full-Diversity 2 X 2 STBC with Golden
Code's Coding Gain | cs.IT math.IT | This paper presents a low-ML-decoding-complexity, full-rate, full-diversity
space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna
multiple-input multiple-output (MIMO) system, with coding gain equal to that of
the best and well known Golden code for any QAM constellation. Recently, two
codes have b... |
0806.1834 | A Low-decoding-complexity, Large coding Gain, Full-rate, Full-diversity
STBC for 4 X 2 MIMO System | cs.IT math.IT | This paper proposes a low decoding complexity, full-diversity and full-rate
space-time block code (STBC) for 4 transmit and 2 receive ($4\times 2$)
multiple-input multiple-output (MIMO) systems. For such systems, the best code
known is the DjABBA code and recently, Biglieri, Hong and Viterbo have proposed
another STB... |
0806.1918 | Analysis of Social Voting Patterns on Digg | cs.CY cs.IR | The social Web is transforming the way information is created and
distributed. Blog authoring tools enable users to publish content, while sites
such as Digg and Del.icio.us are used to distribute content to a wider
audience. With content fast becoming a commodity, interest in using social
networks to promote and fin... |
0806.1919 | Non-linear index coding outperforming the linear optimum | cs.IT math.IT | The following source coding problem was introduced by Birk and Kol: a sender
holds a word $x\in\{0,1\}^n$, and wishes to broadcast a codeword to $n$
receivers, $R_1,...,R_n$. The receiver $R_i$ is interested in $x_i$, and has
prior \emph{side information} comprising some subset of the $n$ bits. This
corresponds to a ... |
0806.1945 | Complexity in atoms: an approach with a new analytical density | nlin.CD cs.IT math.IT physics.atom-ph quant-ph | In this work, the calculation of complexity on atomic systems is considered.
In order to unveil the increasing of this statistical magnitude with the atomic
number due to the relativistic effects, recently reported in [A. Borgoo, F. De
Proft, P. Geerlings, K.D. Sen, Chem. Phys. Lett., 444 (2007) 186], a new
analytica... |
0806.1984 | Classification of curves in 2D and 3D via affine integral signatures | cs.CV | We propose a robust classification algorithm for curves in 2D and 3D, under
the special and full groups of affine transformations. To each plane or spatial
curve we assign a plane signature curve. Curves, equivalent under an affine
transformation, have the same signature. The signatures introduced in this
paper are b... |
0806.2006 | Fusion de classifieurs pour la classification d'images sonar | cs.CV cs.AI | In this paper, we present some high level information fusion approaches for
numeric and symbolic data. We study the interest of such method particularly
for classifier fusion. A comparative study is made in a context of sea bed
characterization from sonar images. The classi- fication of kind of sediment is
a difficul... |
0806.2007 | Experts Fusion and Multilayer Perceptron Based on Belief Learning for
Sonar Image Classification | cs.CV cs.AI | The sonar images provide a rapid view of the seabed in order to characterize
it. However, in such as uncertain environment, real seabed is unknown and the
only information we can obtain, is the interpretation of different human
experts, sometimes in conflict. In this paper, we propose to manage this
conflict in order... |
0806.2008 | Generalized proportional conflict redistribution rule applied to Sonar
imagery and Radar targets classification | cs.CV cs.AI | In this chapter, we present two applications in information fusion in order
to evaluate the generalized proportional conflict redistribution rule presented
in the chapter \cite{Martin06a}. Most of the time the combination rules are
evaluated only on simple examples. We study here different combination rules
and compa... |
0806.2035 | Nodal distances for rooted phylogenetic trees | q-bio.PE cs.CE cs.DM | Dissimilarity measures for (possibly weighted) phylogenetic trees based on
the comparison of their vectors of path lengths between pairs of taxa, have
been present in the systematics literature since the early seventies. But, as
far as rooted phylogenetic trees goes, these vectors can only separate
non-weighted binar... |
0806.2084 | On the existence of compactly supported reconstruction functions in a
sampling problem | cs.IT math.FA math.IT math.NA | Assume that samples of a filtered version of a function in a shift-invariant
space are avalaible. This work deals with the existence of a sampling formula
involving these samples and having reconstruction functions with compact
support. Thus, low computational complexity is involved and truncation errors
are avoided.... |
0806.2139 | Beyond Nash Equilibrium: Solution Concepts for the 21st Century | cs.GT cs.AI cs.CR cs.DC | Nash equilibrium is the most commonly-used notion of equilibrium in game
theory. However, it suffers from numerous problems. Some are well known in the
game theory community; for example, the Nash equilibrium of repeated prisoner's
dilemma is neither normatively nor descriptively reasonable. However, new
problems ari... |
0806.2140 | Defaults and Normality in Causal Structures | cs.AI | A serious defect with the Halpern-Pearl (HP) definition of causality is
repaired by combining a theory of causality with a theory of defaults. In
addition, it is shown that (despite a claim to the contrary) a cause according
to the HP condition need not be a single conjunct. A definition of causality
motivated by Wri... |
0806.2198 | Capacity-achieving CPM schemes | cs.IT math.IT | The pragmatic approach to coded continuous-phase modulation (CPM) is proposed
as a capacity-achieving low-complexity alternative to the serially-concatenated
CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the
best spectrally-efficient CPM modulations to be embedded into SC-CPM schemes.
The... |
0806.2216 | An Intelligent Multi-Agent Recommender System for Human Capacity
Building | cs.AI cs.HC | This paper presents a Multi-Agent approach to the problem of recommending
training courses to engineering professionals. The recommendation system is
built as a proof of concept and limited to the electrical and mechanical
engineering disciplines. Through user modelling and data collection from a
survey, collaborativ... |
0806.2312 | Continuing Progress on a Lattice QCD Software Infrastructure | hep-lat cs.CE | We report on the progress of the software effort in the QCD Application Area
of SciDAC. In particular, we discuss how the software developed under SciDAC
enabled the aggressive exploitation of leadership computers, and we report on
progress in the area of QCD software for multi-core architectures.
|
0806.2356 | Development of Hybrid Intelligent Systems and their Applications from
Engineering Systems to Complex Systems | cs.AI cs.MA | In this study, we introduce general frame of MAny Connected Intelligent
Particles Systems (MACIPS). Connections and interconnections between particles
get a complex behavior of such merely simple system (system in
system).Contribution of natural computing, under information granulation
theory, are the main topic of t... |
0806.2513 | The Perfect Binary One-Error-Correcting Codes of Length 15: Part
I--Classification | cs.IT math.IT | A complete classification of the perfect binary one-error-correcting codes of
length 15 as well as their extensions of length 16 is presented. There are 5983
such inequivalent perfect codes and 2165 extended perfect codes. Efficient
generation of these codes relies on the recent classification of Steiner
quadruple sy... |
0806.2533 | Asymptotic Analysis of the Performance of LAS Algorithm for Large-MIMO
Detection | cs.IT math.IT | In our recent work, we reported an exhaustive study on the simulated bit
error rate (BER) performance of a low-complexity likelihood ascent search (LAS)
algorithm for detection in large multiple-input multiple-output (MIMO) systems
with large number of antennas that achieve high spectral efficiencies. Though
the algo... |
0806.2555 | Frequency of Correctness versus Average-Case Polynomial Time and
Generalized Juntas | cs.CC cs.GT cs.MA | We prove that every distributional problem solvable in polynomial time on the
average with respect to the uniform distribution has a frequently
self-knowingly correct polynomial-time algorithm. We also study some features
of probability weight of correctness with respect to generalizations of
Procaccia and Rosenschei... |
0806.2581 | A chain dictionary method for Word Sense Disambiguation and applications | cs.CL | A large class of unsupervised algorithms for Word Sense Disambiguation (WSD)
is that of dictionary-based methods. Various algorithms have as the root Lesk's
algorithm, which exploits the sense definitions in the dictionary directly. Our
approach uses the lexical base WordNet for a new algorithm originated in
Lesk's, ... |
0806.2643 | On the Capacity Equivalence with Side Information at Transmitter and
Receiver | cs.IT math.IT | In this paper, a channel that is contaminated by two independent Gaussian
noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$ is considered. The capacity of this
channel is computed when independent noisy versions of $S$ are known to the
transmitter and/or receiver. It is shown that the channel capacity is greater
then the capa... |
0806.2674 | On Certain Large Random Hermitian Jacobi Matrices with Applications to
Wireless Communications | cs.IT math.IT | In this paper we study the spectrum of certain large random Hermitian Jacobi
matrices. These matrices are known to describe certain communication setups. In
particular we are interested in an uplink cellular channel which models mobile
users experiencing a soft-handoff situation under joint multicell decoding.
Consid... |
0806.2682 | Weighted Superimposed Codes and Constrained Integer Compressed Sensing | cs.IT math.IT | We introduce a new family of codes, termed weighted superimposed codes
(WSCs). This family generalizes the class of Euclidean superimposed codes
(ESCs), used in multiuser identification systems. WSCs allow for discriminating
all bounded, integer-valued linear combinations of real-valued codewords that
satisfy prescri... |
0806.2726 | L2 Orthogonal Space Time Code for Continuous Phase Modulation | cs.IT math.IT | To combine the high power efficiency of Continuous Phase Modulation (CPM)
with either high spectral efficiency or enhanced performance in low Signal to
Noise conditions, some authors have proposed to introduce CPM in a MIMO frame,
by using Space Time Codes (STC). In this paper, we address the code design
problem of S... |
0806.2738 | Identification of information tonality based on Bayesian approach and
neural networks | cs.IT math.IT | A model of the identification of information tonality, based on Bayesian
approach and neural networks was described. In the context of this paper
tonality means positive or negative tone of both the whole information and its
parts which are related to particular concepts. The method, its application is
presented in t... |
0806.2760 | L2 OSTC-CPM: Theory and design | cs.IT math.IT | The combination of space-time coding (STC) and continuous phase modulation
(CPM) is an attractive field of research because both STC and CPM bring many
advantages for wireless communications. Zhang and Fitz [1] were the first to
apply this idea by constructing a trellis based scheme. But for these codes the
decoding ... |
0806.2843 | MultiKulti Algorithm: Migrating the Most Different Genotypes in an
Island Model | cs.NE cs.DC | Migration policies in distributed evolutionary algorithms has not been an
active research area until recently. However, in the same way as operators have
an impact on performance, the choice of migrants is due to have an impact too.
In this paper we propose a new policy (named multikulti) for choosing the
individuals... |
0806.2850 | Decoding Beta-Decay Systematics: A Global Statistical Model for Beta^-
Halflives | nucl-th astro-ph cond-mat.dis-nn cs.LG stat.ML | Statistical modeling of nuclear data provides a novel approach to nuclear
systematics complementary to established theoretical and phenomenological
approaches based on quantum theory. Continuing previous studies in which global
statistical modeling is pursued within the general framework of machine
learning theory, w... |
0806.2890 | Learning Graph Matching | cs.CV cs.LG | As a fundamental problem in pattern recognition, graph matching has
applications in a variety of fields, from computer vision to computational
biology. In graph matching, patterns are modeled as graphs and pattern
recognition amounts to finding a correspondence between the nodes of different
graphs. Many formulations... |
0806.2925 | Neural networks in 3D medical scan visualization | cs.AI cs.GR | For medical volume visualization, one of the most important tasks is to
reveal clinically relevant details from the 3D scan (CT, MRI ...), e.g. the
coronary arteries, without obscuring them with less significant parts. These
volume datasets contain different materials which are difficult to extract and
visualize with... |
0806.2943 | Modern Set | math.GM cs.IT math.IT | In this paper, we intend to generalize the classical set theory as much as
possible. we will do this by freeing sets from the regular properties of
classical sets; e.g., the law of excluded middle, the law of non-contradiction,
the distributive law, the commutative law,etc....
|
0806.2991 | On Information Rates of the Fading Wyner Cellular Model via the Thouless
Formula for the Strip | cs.IT math.IT | We apply the theory of random Schr\"odinger operators to the analysis of
multi-users communication channels similar to the Wyner model, that are
characterized by short-range intra-cell broadcasting. With $H$ the channel
transfer matrix, $HH^\dagger$ is a narrow-band matrix and in many aspects is
similar to a random S... |
0806.3023 | A Random Search Framework for Convergence Analysis of Distributed
Beamforming with Feedback | cs.DC cs.IT math.IT | The focus of this work is on the analysis of transmit beamforming schemes
with a low-rate feedback link in wireless sensor/relay networks, where nodes in
the network need to implement beamforming in a distributed manner.
Specifically, the problem of distributed phase alignment is considered, where
neither the transmi... |
0806.3031 | Multi Site Coordination using a Multi-Agent System | cs.MA | A new approach of coordination of decisions in a multi site system is
proposed. It is based this approach on a multi-agent concept and on the
principle of distributed network of enterprises. For this purpose, each
enterprise is defined as autonomous and performs simultaneously at the local
and global levels. The basi... |
0806.3032 | Multi-agents architecture for supply chain management | cs.MA | The purpose of this paper is to propose a new approach for the supply chain
management. This approach is based on the virtual enterprise paradigm and the
used of multi-agent concept. Each entity (like enterprise) is autonomous and
must perform local and global goals in relation with its environment. The base
componen... |
0806.3115 | Using rational numbers to key nested sets | cs.DB | This report details the generation and use of tree node ordering keys in a
single relational database table. The keys for each node are calculated from
the keys of its parent, in such a way that the sort order places every node in
the tree before all of its descendants and after all siblings having a lower
index. The... |
0806.3133 | Shannon Meets Carnot: Mutual Information Via Thermodynamics | cs.IT math.IT | In this contribution, the Gaussian channel is represented as an equivalent
thermal system allowing to express its input-output mutual information in terms
of thermodynamic quantities. This thermodynamic description of the mutual
information is based upon a generalization of the $2^{nd}$ thermodynamic law
and provides... |
0806.3227 | A Non-differential Distributed Space-Time Coding for Partially-Coherent
Cooperative Communication | cs.IT math.IT | In a distributed space-time coding scheme, based on the relay channel model,
the relay nodes co-operate to linearly process the transmitted signal from the
source and forward them to the destination such that the signal at the
destination appears as a space time block code. Recently, a code design
criteria for achiev... |
0806.3243 | Analysis of Verification-based Decoding on the q-ary Symmetric Channel
for Large q | cs.IT math.IT | We discuss and analyze a list-message-passing decoder with verification for
low-density parity-check (LDPC) codes on the q-ary symmetric channel (q-SC).
Rather than passing messages consisting of symbol probabilities, this decoder
passes lists of possible symbols and marks some lists as verified. The density
evolutio... |
0806.3246 | Broadcasting with side information | cs.IT math.IT | A sender holds a word x consisting of n blocks x_i, each of t bits, and
wishes to broadcast a codeword to m receivers, R_1,...,R_m. Each receiver R_i
is interested in one block, and has prior side information consisting of some
subset of the other blocks. Let \beta_t be the minimum number of bits that has
to be trans... |
0806.3277 | On McMillan's theorem about uniquely decipherable codes | math.CO cs.IT math.IT | Karush's proof of McMillan's theorem is recast as an argument involving
polynomials with non-commuting indeterminates certain evaluations of which
yield the Kraft sums of codes, proving a strengthened version of McMillan's
theorem.
|
0806.3284 | Optimal hash functions for approximate closest pairs on the n-cube | cs.IT math.IT | One way to find closest pairs in large datasets is to use hash functions. In
recent years locality-sensitive hash functions for various metrics have been
given: projecting an n-cube onto k bits is simple hash function that performs
well. In this paper we investigate alternatives to projection. For various
parameters ... |
0806.3317 | Differential Transmit Diversity Based on Quasi-Orthogonal Space-Time
Block Code | cs.IT math.IT | By using joint modulation and customized constellation set, we show that
Quasi-Orthogonal Space-Time Block Code (QO-STBC) can be used to form a new
differential space-time modulation (DSTM) scheme to provide full transmit
diversity with non-coherent detection. Our new scheme can provide higher code
rate than existing... |
0806.3320 | Unitary Differential Space-Time Modulation with Joint Modulation | cs.IT math.IT | We develop two new designs of unitary differential space-time modulation
(DSTM) with low decoding complexity. Their decoder can be separated into a few
parallel decoders, each of which has a decoding search space of less than
sqrt(N) if the DSTM codebook contains N codewords. Both designs are based on
the concept of ... |
0806.3321 | Achieving Near-Capacity at Low SNR on a Multiple-Antenna Multiple-User
Channel | cs.IT math.IT | We analyze the sensitivity of the capacity of a multi-antenna multi-user
system to the number of users being served. We show analytically that, for a
given desired sum-rate, the extra power needed to serve a subset of the users
at low SNR (signal-to-noise ratio) can be very small, and is generally much
smaller than t... |
0806.3322 | Power-Balanced Orthogonal Space-Time Block Code | cs.IT math.IT | In this paper, we propose two new systematic ways to construct amicable
orthogonal designs (AOD), with an aim to facilitate the construction of
power-balanced orthogonal spacetime block codes (O-STBC) with favorable
practical attributes. We also show that an AOD can be constructed from an
Amicable Family (AF), and su... |
0806.3324 | Optimizing Quasi-Orthogonal STBC Through Group-Constrained Linear
Transformation | cs.IT math.IT | In this paper, we first derive the generic algebraic structure of a
Quasi-Orthogonal STBC (QO-STBC). Next we propose Group-Constrained Linear
Transformation (GCLT) as a means to optimize the diversity and coding gains of
a QO-STBC with square or rectangular QAM constellations. Compared with QO-STBC
with constellation... |
0806.3325 | On the Search for High-Rate Quasi-Orthogonal Space-Time Block Code | cs.IT math.IT | A Quasi-Orthogonal Space-Time Block Code (QO-STBC) is attractive because it
achieves higher code rate than Orthogonal STBC and lower decoding complexity
than nonorthogonal STBC. In this paper, we first derive the algebraic structure
of QO-STBC, then we apply it in a novel graph-based search algorithm to find
high-rat... |
0806.3328 | Limited Feedback for Multi-Antenna Multi-user Communications with
Generalized Multi-Unitary Decomposition | cs.IT math.IT | In this paper, we propose a decomposition method called Generalized
Multi-Unitary Decomposition (GMUD) which is useful in multi-user MIMO
precoding. This decomposition transforms a complex matrix H into PRQ, where R
is a special matrix whose first row contains only a non-zero user defined value
at the left-most posit... |
0806.3329 | Beamforming Matrix Quantization with Variable Feedback Rate | cs.IT math.IT | We propose an improved beamforming matrix compression by Givens Rotation with
the use of variable feedback rate. The variable feedback rate means that the
number of bits used to represent the quantized beamforming matrix is based on
the value of the matrix. Compared with the fixed feedback rate scheme, the
proposed m... |
0806.3332 | Compressed Sensing of Analog Signals in Shift-Invariant Spaces | cs.IT math.IT | A traditional assumption underlying most data converters is that the signal
should be sampled at a rate exceeding twice the highest frequency. This
statement is based on a worst-case scenario in which the signal occupies the
entire available bandwidth. In practice, many signals are sparse so that only
part of the ban... |
0806.3474 | Information field theory for cosmological perturbation reconstruction
and non-linear signal analysis | astro-ph cs.IT hep-th math.IT physics.data-an stat.CO | We develop information field theory (IFT) as a means of Bayesian inference on
spatially distributed signals, the information fields. A didactical approach is
attempted. Starting from general considerations on the nature of measurements,
signals, noise, and their relation to a physical reality, we derive the
informati... |
0806.3537 | Statistical Learning of Arbitrary Computable Classifiers | cs.LG | Statistical learning theory chiefly studies restricted hypothesis classes,
particularly those with finite Vapnik-Chervonenkis (VC) dimension. The
fundamental quantity of interest is the sample complexity: the number of
samples required to learn to a specified level of accuracy. Here we consider
learning over the set ... |
0806.3628 | Four-node Relay Network with Bi-directional Traffic Employing Wireless
Network Coding with Pre-cancellation | cs.IT math.IT | Network coding has the potential to improve the overall throughput of a
network by combining different streams of data and forwarding them. In wireless
networks, the wireless channel provide an excellent medium for physical layer
network coding as signals from different transmitters are combined
automatically by the ... |
0806.3629 | Bi-Directional Multi-Antenna Relay Communications with Wireless Network
Coding | cs.IT math.IT | In this paper, we consider a two-way or bidirectional communications system
with a relay equipped with multiple antennas. We show that when the downlink
channel state information is not known at the relay, the benefit of having
additional antennas at the relay can only be obtained by using decode and
forward (DF) but... |
0806.3630 | Comparative Study of SVD and QRS in Closed-Loop Beamforming Systems | cs.IT math.IT | We compare two closed-loop beamforming algorithms, one based on singular
value decomposition (SVD) and the other based on equal diagonal QR
decomposition (QRS). SVD has the advantage of parallelizing the MIMO channel,
but each of the sub-channels has different gain. QRS has the advantage of
having equal diagonal valu... |
0806.3631 | Comparative Study of Open-loop Transmit Diversity Schemes for Four
Transmit Antennas in Coded OFDM Systems | cs.IT math.IT | We compare four open-loop transmit diversity schemes in a coded Orthogonal
Frequency Division Multiplexing (OFDM) system with four transmit antennas,
namely cyclic delay diversity (CDD), Space-Time Block Code (STBC, Alamouti code
is used) with CDD, Quasi-Orthogonal STBC (QO-STBC) and
Minimum-Decoding-Complexity QOSTB... |
0806.3633 | A Continuous Vector-Perturbation for Multi-Antenna Multi-User
Communication | cs.IT math.IT | The sum-rate of the broadcast channel in a multi-antenna multi-user
communication system can be achieved by using precoding and adding a regular
perturbation to the data vector. The perturbation can be removed by the modulus
function, thus transparent to the receiver, but the information of the
precoding matrix is ne... |
0806.3646 | Round Trip Time Prediction Using the Symbolic Function Network Approach | cs.NE cs.SC | In this paper, we develop a novel approach to model the Internet round trip
time using a recently proposed symbolic type neural network model called
symbolic function network. The developed predictor is shown to have good
generalization performance and simple representation compared to the multilayer
perceptron based... |
0806.3650 | Recursive Code Construction for Random Networks | cs.IT math.IT | A modification of Koetter-Kschischang codes for random networks is presented
(these codes were also studied by Wang et al. in the context of authentication
problems). The new codes have higher information rate, while maintaining the
same error-correcting capabilities. An efficient error-correcting algorithm is
propos... |
0806.3653 | Opportunistic Interference Alignment in MIMO Interference Channels | cs.GT cs.IT math.IT | We present two interference alignment techniques such that an opportunistic
point-to-point multiple input multiple output (MIMO) link can reuse, without
generating any additional interference, the same frequency band of a similar
pre-existing primary link. In this scenario, we exploit the fact that under
power constr... |
0806.3681 | On the d-dimensional Quasi-Equally Spaced Sampling | cs.IT math.IT | We study a class of random matrices that appear in several communication and
signal processing applications, and whose asymptotic eigenvalue distribution is
closely related to the reconstruction error of an irregularly sampled
bandlimited signal. We focus on the case where the random variables
characterizing these ma... |
0806.3710 | How Is Meaning Grounded in Dictionary Definitions? | cs.CL cs.DB | Meaning cannot be based on dictionary definitions all the way down: at some
point the circularity of definitions must be broken in some way, by grounding
the meanings of certain words in sensorimotor categories learned from
experience or shaped by evolution. This is the "symbol grounding problem." We
introduce the co... |
0806.3765 | Cross-concordances: terminology mapping and its effectiveness for
information retrieval | cs.DL cs.IR | The German Federal Ministry for Education and Research funded a major
terminology mapping initiative, which found its conclusion in 2007. The task of
this terminology mapping initiative was to organize, create and manage
'cross-concordances' between controlled vocabularies (thesauri, classification
systems, subject h... |
0806.3787 | Computational Approaches to Measuring the Similarity of Short Contexts :
A Review of Applications and Methods | cs.CL | Measuring the similarity of short written contexts is a fundamental problem
in Natural Language Processing. This article provides a unifying framework by
which short context problems can be categorized both by their intended
application and proposed solution. The goal is to show that various problems
and methodologie... |
0806.3799 | A Sublinear Algorithm for Sparse Reconstruction with l2/l2 Recovery
Guarantees | cs.IT math.IT | Compressed Sensing aims to capture attributes of a sparse signal using very
few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is
possible if the sensing matrix acts as a near isometry on all
$\boldsymbol{k}$-sparse signals. This property holds with overwhelming
probability if the entries of the m... |
0806.3802 | Efficient and Robust Compressed Sensing using High-Quality Expander
Graphs | cs.IT math.IT | Expander graphs have been recently proposed to construct efficient compressed
sensing algorithms. In particular, it has been shown that any $n$-dimensional
vector that is $k$-sparse (with $k\ll n$) can be fully recovered using
$O(k\log\frac{n}{k})$ measurements and only $O(k\log n)$ simple recovery
iterations. In thi... |
0806.3849 | Separability in the Ambient Logic | cs.LO cs.MA cs.PL | The \it{Ambient Logic} (AL) has been proposed for expressing properties of
process mobility in the calculus of Mobile Ambients (MA), and as a basis for
query languages on semistructured data. We study some basic questions
concerning the discriminating power of AL, focusing on the equivalence on
processes induced by t... |
0806.3885 | Conceptualization of seeded region growing by pixels aggregation. Part
1: the framework | cs.CV | Adams and Bishop have proposed in 1994 a novel region growing algorithm
called seeded region growing by pixels aggregation (SRGPA). This paper
introduces a framework to implement an algorithm using SRGPA. This framework is
built around two concepts: localization and organization of applied action.
This conceptualizat... |
0806.3887 | Conceptualization of seeded region growing by pixels aggregation. Part
2: how to localize a final partition invariant about the seeded region
initialisation order | cs.CV | In the previous paper, we have conceptualized the localization and the
organization of seeded region growing by pixels aggregation (SRGPA) but we do
not give the issue when there is a collision between two distinct regions
during the growing process. In this paper, we propose two implementations to
manage two classic... |
0806.3928 | Conceptualization of seeded region growing by pixels aggregation. Part
3: a wide range of algorithms | cs.CV | In the two previous papers of this serie, we have created a library, called
Population, dedicated to seeded region growing by pixels aggregation and we
have proposed different growing processes to get a partition with or without a
boundary region to divide the other regions or to get a partition invariant
about the s... |
0806.3938 | Cooperation with Complement is Better | cs.MA physics.soc-ph | In a setting where heterogeneous agents interact to accomplish a given set of
goals, cooperation is of utmost importance, especially when agents cannot
achieve their individual goals by exclusive use of their own efforts. Even when
we consider friendly environments and benevolent agents, cooperation involves
several ... |
0806.3939 | Conceptualization of seeded region growing by pixels aggregation. Part
4: Simple, generic and robust extraction of grains in granular materials
obtained by X-ray tomography | cs.CV | This paper proposes a simple, generic and robust method to extract the grains
from experimental tridimensionnal images of granular materials obtained by
X-ray tomography. This extraction has two steps: segmentation and splitting.
For the segmentation step, if there is a sufficient contrast between the
different compo... |
0806.3949 | Use of a Quantum Computer and the Quick Medical Reference To Give an
Approximate Diagnosis | quant-ph cs.AI | The Quick Medical Reference (QMR) is a compendium of statistical knowledge
connecting diseases to findings (symptoms). The information in QMR can be
represented as a Bayesian network. The inference problem (or, in more medical
language, giving a diagnosis) for the QMR is to, given some findings, find the
probability ... |
0806.3978 | Information In The Non-Stationary Case | q-bio.NC cs.IT math.IT q-bio.QM stat.ME | Information estimates such as the ``direct method'' of Strong et al. (1998)
sidestep the difficult problem of estimating the joint distribution of response
and stimulus by instead estimating the difference between the marginal and
conditional entropies of the response. While this is an effective estimation
strategy, ... |
0806.4020 | Design, Development and Testing of Underwater Vehicles: ITB Experience | cs.RO | The last decade has witnessed increasing worldwide interest in the research
of underwater robotics with particular focus on the area of autonomous
underwater vehicles (AUVs). The underwater robotics technology has enabled
human to access the depth of the ocean to conduct environmental surveys,
resources mapping as we... |
0806.4021 | Linear Parameter Varying Model Identification for Control of
Rotorcraft-based UAV | cs.RO | A rotorcraft-based unmanned aerial vehicle exhibits more complex properties
compared to its full-size counterparts due to its increased sensitivity to
control inputs and disturbances and higher bandwidth of its dynamics. As an
aerial vehicle with vertical take-off and landing capability, the helicopter
specifically p... |
0806.4168 | Established Clustering Procedures for Network Analysis | physics.soc-ph cs.SI physics.data-an stat.AP | In light of the burgeoning interest in network analysis in the new millenium,
we bring to the attention of contemporary network theorists, a two-stage
double-standarization and hierarchical clustering (single-linkage-like)
procedure devised in 1974. In its many applications over the next
decade--primarily to the migr... |
0806.4200 | The Secrecy Rate Region of the Broadcast Channel | cs.IT math.IT | In this paper, we consider a scenario where a source node wishes to broadcast
two confidential messages for two respective receivers, while a wire-tapper
also receives the transmitted signal. This model is motivated by wireless
communications, where individual secure messages are broadcast over open media
and can be ... |
0806.4210 | Agnostically Learning Juntas from Random Walks | cs.LG | We prove that the class of functions g:{-1,+1}^n -> {-1,+1} that only depend
on an unknown subset of k<<n variables (so-called k-juntas) is agnostically
learnable from a random walk in time polynomial in n, 2^{k^2}, epsilon^{-k},
and log(1/delta). In other words, there is an algorithm with the claimed
running time th... |
0806.4264 | Online network coding for optimal throughput and delay -- the
three-receiver case | cs.IT math.IT | For a packet erasure broadcast channel with three receivers, we propose a new
coding algorithm that makes use of feedback to dynamically adapt the code. Our
algorithm is throughput optimal, and we conjecture that it also achieves an
asymptotically optimal average decoding delay at the receivers. We consider
heavy tra... |
0806.4293 | Scalar Quantization for Audio Data Coding | cs.MM cs.IT math.IT | This paper is concerned with scalar quantization of transform coefficients in
an audio codec. The generalized Gaussian distribution (GGD) is used as an
approximation of one-dimensional probability density function for transform
coefficients obtained by modulated lapped transform (MLT) or modified cosine
transform (MD... |
0806.4341 | On Sequences with Non-Learnable Subsequences | cs.AI cs.LG | The remarkable results of Foster and Vohra was a starting point for a series
of papers which show that any sequence of outcomes can be learned (with no
prior knowledge) using some universal randomized forecasting algorithm and
forecast-dependent checking rules. We show that for the class of all
computationally effici... |
0806.4391 | Prediction with Expert Advice in Games with Unbounded One-Step Gains | cs.LG cs.AI | The games of prediction with expert advice are considered in this paper. We
present some modification of Kalai and Vempala algorithm of following the
perturbed leader for the case of unrestrictedly large one-step gains. We show
that in general case the cumulative gain of any probabilistic prediction
algorithm can be ... |
0806.4415 | On the inner and outer bounds of 3-receiver broadcast channels with
2-degraded message sets | cs.IT math.IT | We consider a broadcast channel with 3 receivers and 2 messages (M0, M1)
where two of the three receivers need to decode messages (M0, M1) while the
remaining one just needs to decode the message M0. We study the best known
inner and outer bounds under this setting, in an attempt to find the
deficiencies with the cur... |
0806.4422 | Computationally Efficient Estimators for Dimension Reductions Using
Stable Random Projections | cs.LG | The method of stable random projections is a tool for efficiently computing
the $l_\alpha$ distances using low memory, where $0<\alpha \leq 2$ is a tuning
parameter. The method boils down to a statistical estimation task and various
estimators have been proposed, based on the geometric mean, the harmonic mean,
and th... |
0806.4423 | On Approximating the Lp Distances for p>2 | cs.LG | Applications in machine learning and data mining require computing pairwise
Lp distances in a data matrix A. For massive high-dimensional data, computing
all pairwise distances of A can be infeasible. In fact, even storing A or all
pairwise distances of A in the memory may be also infeasible. This paper
proposes a si... |
0806.4451 | Counteracting Byzantine Adversaries with Network Coding: An Overhead
Analysis | cs.IT cs.CR math.IT | Network coding increases throughput and is robust against failures and
erasures. However, since it allows mixing of information within the network, a
single corrupted packet generated by a Byzantine attacker can easily
contaminate the information to multiple destinations.
In this paper, we study the transmission ov... |
0806.4468 | On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and
Broadcast Channels | cs.IT math.IT | This paper studies the information-theoretic limits of a secondary or
cognitive radio (CR) network under spectrum sharing with an existing primary
radio network. In particular, the fading cognitive multiple-access channel
(C-MAC) is first studied, where multiple secondary users transmit to the
secondary base station ... |
0806.4484 | On empirical meaning of randomness with respect to a real parameter | cs.LG cs.AI | We study the empirical meaning of randomness with respect to a family of
probability distributions $P_\theta$, where $\theta$ is a real parameter, using
algorithmic randomness theory. In the case when for a computable probability
distribution $P_\theta$ an effectively strongly consistent estimate exists, we
show that... |
0806.4510 | On Field Size and Success Probability in Network Coding | cs.IT math.IT | Using tools from algebraic geometry and Groebner basis theory we solve two
problems in network coding. First we present a method to determine the smallest
field size for which linear network coding is feasible. Second we derive
improved estimates on the success probability of random linear network coding.
These estim... |
0806.4511 | The model of quantum evolution | cs.AI | This paper has been withdrawn by the author due to extremely unscientific
errors.
|
0806.4572 | Problems of robustness for universal coding schemes | cs.IT cs.OH math.IT | The Lempel-Ziv universal coding scheme is asymptotically optimal for the
class of all stationary ergodic sources. A problem of robustness of this
property under small violations of ergodicity is studied. A notion of
deficiency of algorithmic randomness is used as a measure of disagreement
between data sequence and pr... |
0806.4627 | SP2Bench: A SPARQL Performance Benchmark | cs.DB cs.PF | Recently, the SPARQL query language for RDF has reached the W3C
recommendation status. In response to this emerging standard, the database
community is currently exploring efficient storage techniques for RDF data and
evaluation strategies for SPARQL queries. A meaningful analysis and comparison
of these approaches n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.