id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0902.0465 | AxialGen: A Research Prototype for Automatically Generating the Axial
Map | cs.RO cs.CG | AxialGen is a research prototype for automatically generating the axial map,
which consists of the least number of the longest visibility lines (or axial
lines) for representing individual linearly stretched parts of open space of an
urban environment. Open space is the space between closed spaces such as
buildings a... |
0902.0514 | Graphical Reasoning in Compact Closed Categories for Quantum Computation | cs.SC cs.AI | Compact closed categories provide a foundational formalism for a variety of
important domains, including quantum computation. These categories have a
natural visualisation as a form of graphs. We present a formalism for
equational reasoning about such graphs and develop this into a generic proof
system with a fixed l... |
0902.0562 | A Unified Perspective on Parity- and Syndrome-Based Binary Data
Compression Using Off-the-Shelf Turbo Codecs | cs.IT math.IT | We consider the problem of compressing memoryless binary data with or without
side information at the decoder. We review the parity- and the syndrome-based
approaches and discuss their theoretical limits, assuming that there exists a
virtual binary symmetric channel between the source and the side information,
and th... |
0902.0606 | Beyond Zipf's law: Modeling the structure of human language | cs.CL physics.soc-ph | Human language, the most powerful communication system in history, is closely
associated with cognition. Written text is one of the fundamental
manifestations of language, and the study of its universal regularities can
give clues about how our brains process information and how we, as a society,
organize and share i... |
0902.0657 | Efficient implementation of linear programming decoding | cs.IT math.IT | While linear programming (LP) decoding provides more flexibility for
finite-length performance analysis than iterative message-passing (IMP)
decoding, it is computationally more complex to implement in its original form,
due to both the large size of the relaxed LP problem, and the inefficiency of
using general-purpo... |
0902.0668 | Application of the Weil representation: diagonalization of the discrete
Fourier transform | cs.IT cs.DM math.IT math.RT | We survey a new application of the Weil representation to construct a
canonical basis of eigenvectors for the discrete Fourier transform (DFT). The
transition matrix from the standard basis to the canonical basis defines a
novel transform which we call the discrete oscillator transform (DOT for
short). In addition, w... |
0902.0673 | Optimal profiles in variable speed flows | math.HO cs.CE math.OC physics.flu-dyn | Where a 2D problem of optimal profile in variable speed flow is resolved in a
class of convex Bezier curves, using symbolic and numerical computations.
|
0902.0744 | Embedding Data within Knowledge Spaces | cs.AI cs.HC cs.IR | The promise of e-Science will only be realized when data is discoverable,
accessible, and comprehensible within distributed teams, across disciplines,
and over the long-term--without reliance on out-of-band (non-digital) means. We
have developed the open-source Tupelo semantic content management framework and
are emp... |
0902.0763 | Genetic algorithm based optimization and post optimality analysis of
multi-pass face milling | cs.CE | This paper presents an optimization technique for the multi-pass face milling
process. Genetic algorithm (GA) is used to obtain the optimum cutting
parameters by minimizing the unit production cost for a given amount of
material removal. Cutting speed, feed and depth of cut for the finish and rough
passes are the cut... |
0902.0798 | Alleviating Media Bias Through Intelligent Agent Blogging | cs.AI | Consumers of mass media must have a comprehensive, balanced and plural
selection of news to get an unbiased perspective; but achieving this goal can
be very challenging, laborious and time consuming. News stories development
over time, its (in)consistency, and different level of coverage across the
media outlets are ... |
0902.0822 | Bootstrapped Oblivious Transfer and Secure Two-Party Function
Computation | cs.CR cs.IT math.IT | We propose an information theoretic framework for the secure two-party
function computation (SFC) problem and introduce the notion of SFC capacity. We
study and extend string oblivious transfer (OT) to sample-wise OT. We propose
an efficient, perfectly private OT protocol utilizing the binary erasure
channel or sourc... |
0902.0838 | The Ergodic Capacity of Phase-Fading Interference Networks | cs.IT math.IT | We identify the role of equal strength interference links as bottlenecks on
the ergodic sum capacity of a $K$ user phase-fading interference network, i.e.,
an interference network where the fading process is restricted primarily to
independent and uniform phase variations while the channel magnitudes are held
fixed a... |
0902.0892 | A Unified Framework for Linear-Programming Based Communication Receivers | cs.IT math.IT | It is shown that a large class of communication systems which admit a
sum-product algorithm (SPA) based receiver also admit a corresponding
linear-programming (LP) based receiver. The two receivers have a relationship
defined by the local structure of the underlying graphical model, and are
inhibited by the same phen... |
0902.0899 | Comparative concept similarity over Minspaces: Axiomatisation and
Tableaux Calculus | cs.AI | We study the logic of comparative concept similarity $\CSL$ introduced by
Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative
similarity comparison. In this logic we can formulate assertions of the form "
objects A are more similar to B than to C". The semantics of this logic is
defined by... |
0902.0947 | On the Gaussian MAC with Imperfect Feedback | cs.IT math.IT | New achievable rate regions are derived for the two-user additive white
Gaussian multiple-access channel with noisy feedback. The regions exhibit the
following two properties. Irrespective of the (finite) Gaussian feedback-noise
variances, the regions include rate points that lie outside the no-feedback
capacity regi... |
0902.0966 | Beam Selection Gain Versus Antenna Selection Gain | cs.IT math.IT | We consider beam selection using a fixed beamforming network (FBN) at a base
station with $M$ array antennas. In our setting, a Butler matrix is deployed at
the RF stage to form $M$ beams, and then the best beam is selected for
transmission. We provide the proofs of the key properties of the noncentral
chi-square dis... |
0902.1033 | New Confidence Measures for Statistical Machine Translation | cs.CL | A confidence measure is able to estimate the reliability of an hypothesis
provided by a machine translation system. The problem of confidence measure can
be seen as a process of testing : we want to decide whether the most probable
sequence of words provided by the machine translation system is correct or not.
In the... |
0902.1037 | Optimal design and optimal control of structures undergoing finite
rotations and elastic deformations | cs.NE cs.CE | In this work we deal with the optimal design and optimal control of
structures undergoing large rotations. In other words, we show how to find the
corresponding initial configuration and the corresponding set of multiple load
parameters in order to recover a desired deformed configuration or some
desirable features o... |
0902.1040 | Fast solving of Weighted Pairing Least-Squares systems | cs.MS cs.NE | This paper presents a generalization of the "weighted least-squares" (WLS),
named "weighted pairing least-squares" (WPLS), which uses a rectangular weight
matrix and is suitable for data alignment problems. Two fast solving methods,
suitable for solving full rank systems as well as rank deficient systems, are
studied... |
0902.1041 | Kolmogorov Complexity and Solovay Functions | cs.CC cs.IT math.IT math.LO | Solovay proved that there exists a computable upper bound f of the
prefix-free Kolmogorov complexity function K such that f (x) = K(x) for
infinitely many x. In this paper, we consider the class of computable functions
f such that K(x) <= f (x)+O(1) for all x and f (x) <= K(x) + O(1) for
infinitely many x, which we c... |
0902.1080 | A Model for Managing Collections of Patterns | cs.AI | Data mining algorithms are now able to efficiently deal with huge amount of
data. Various kinds of patterns may be discovered and may have some great
impact on the general development of knowledge. In many domains, end users may
want to have their data mined by data mining tools in order to extract patterns
that coul... |
0902.1179 | The Complexity of Datalog on Linear Orders | cs.LO cs.CC cs.DB | We study the program complexity of datalog on both finite and infinite linear
orders. Our main result states that on all linear orders with at least two
elements, the nonemptiness problem for datalog is EXPTIME-complete. While
containment of the nonemptiness problem in EXPTIME is known for finite linear
orders and ac... |
0902.1220 | Opportunistic Communications in Fading Multiaccess Relay Channels | cs.IT math.IT | The problem of optimal resource allocation is studied for ergodic fading
orthogonal multiaccess relay channels (MARCs) in which the users (sources)
communicate with a destination with the aid of a half-duplex relay that
transmits on a channel orthogonal to that used by the transmitting sources.
Under the assumption t... |
0902.1227 | Discovering general partial orders in event streams | cs.AI cs.LG | Frequent episode discovery is a popular framework for pattern discovery in
event streams. An episode is a partially ordered set of nodes with each node
associated with an event type. Efficient (and separate) algorithms exist for
episode discovery when the associated partial order is total (serial episode)
and trivial... |
0902.1258 | Extraction de concepts sous contraintes dans des donn\'ees d'expression
de g\`enes | cs.LG | In this paper, we propose a technique to extract constrained formal concepts.
|
0902.1259 | Database Transposition for Constrained (Closed) Pattern Mining | cs.LG | Recently, different works proposed a new way to mine patterns in databases
with pathological size. For example, experiments in genome biology usually
provide databases with thousands of attributes (genes) but only tens of objects
(experiments). In this case, mining the "transposed" database runs through a
smaller sea... |
0902.1267 | A Note on the Diagonalization of the Discrete Fourier Transform | cs.IT cs.DM math.IT math.RT | Following the approach developed by S. Gurevich and R. Hadani, an analytical
formula of the canonical basis of the DFT is given for the case $N=p$ where $p$
is a prime number and $p\equiv 1$ (mod 4).
|
0902.1275 | Delay Performance Optimization for Multiuser Diversity Systems with
Bursty-Traffic and Heterogeneous Wireless Links | cs.IT math.IT | This paper presents a cross-layer approach for optimizing the delay
performance of a multiuser diversity system with heterogeneous block-fading
channels and a delay-sensitive bursty-traffic. We consider the downlink of a
time-slotted multiuser system employing opportunistic scheduling with fair
performance at the med... |
0902.1278 | Fountain Codes Based Distributed Storage Algorithms for Large-scale
Wireless Sensor Networks | cs.IT cs.DS cs.NI math.IT | We consider large-scale sensor networks with n nodes, out of which k are in
possession, (e.g., have sensed or collected in some other way) k information
packets. In the scenarios in which network nodes are vulnerable because of, for
example, limited energy or a hostile environment, it is desirable to
disseminate the ... |
0902.1284 | Multi-Label Prediction via Compressed Sensing | cs.LG | We consider multi-label prediction problems with large output spaces under
the assumption of output sparsity -- that the target (label) vectors have small
support. We develop a general theory for a variant of the popular error
correcting output code scheme, using ideas from compressed sensing for
exploiting this spar... |
0902.1299 | Perfect Quantum Network Communication Protocol Based on Classical
Network Coding | quant-ph cs.IT math.IT | This paper considers a problem of quantum communication between parties that
are connected through a network of quantum channels. The model in this paper
assumes that there is no prior entanglement shared among any of the parties,
but that classical communication is free. The task is to perfectly transfer an
unknown ... |
0902.1351 | On the minimum distance graph of an extended Preparata code | cs.IT cs.DM math.IT | The minimum distance graph of an extended Preparata code P(m) has vertices
corresponding to codewords and edges corresponding to pairs of codewords that
are distance 6 apart. The clique structure of this graph is investigated and it
is established that the minimum distance graphs of two extended Preparata codes
are i... |
0902.1475 | Personalised and Dynamic Trust in Social Networks | cs.CY cs.IR physics.soc-ph | We propose a novel trust metric for social networks which is suitable for
application in recommender systems. It is personalised and dynamic and allows
to compute the indirect trust between two agents which are not neighbours based
on the direct trust between agents that are neighbours. In analogy to some
personalise... |
0902.1505 | On the Bures Volume of Separable Quantum States | quant-ph cs.IT math.FA math.IT math.MG | We obtain two sided estimates for the Bures volume of an arbitrary subset of
the set of $N\times N$ density matrices, in terms of the Hilbert-Schmidt volume
of that subset. For general subsets, our results are essentially optimal (for
large $N$). As applications, we derive in particular nontrivial lower and upper
bou... |
0902.1591 | Correlated Sources over Broadcast Channels | cs.IT math.IT | The problem of reliable transmission of correlated sources over the broadcast
channel, originally studied by Han and Costa, is revisited. An alternative
characterization of their sufficient condition for reliable transmission is
given, which includes results of Marton for channel coding over broadcast
channels and of... |
0902.1629 | Improvements of real coded genetic algorithms based on differential
operators preventing premature convergence | cs.NE cs.AI | This paper presents several types of evolutionary algorithms (EAs) used for
global optimization on real domains. The interest has been focused on
multimodal problems, where the difficulties of a premature convergence usually
occurs. First the standard genetic algorithm (SGA) using binary encoding of
real values and i... |
0902.1634 | A bound on the size of linear codes | cs.IT math.IT | We present a bound on the size of linear codes. This bound is independent of
other known bounds, e.g. the Griesmer bound.
|
0902.1647 | A competitive comparison of different types of evolutionary algorithms | cs.NE cs.AI | This paper presents comparison of several stochastic optimization algorithms
developed by authors in their previous works for the solution of some problems
arising in Civil Engineering. The introduced optimization methods are: the
integer augmented simulated annealing (IASA), the real-coded augmented
simulated anneal... |
0902.1665 | Novel anisotropic continuum-discrete damage model capable of
representing localized failure of massive structures. Part II: identification
from tests under heterogeneous stress field | cs.NE cs.CE | In Part I of this paper we have presented a simple model capable of
describing the localized failure of a massive structure. In this part, we
discuss the identification of the model parameters from two kinds of
experiments: a uniaxial tensile test and a three-point bending test. The former
is used only for illustrati... |
0902.1690 | Back analysis of microplane model parameters using soft computing
methods | cs.NE cs.AI | A new procedure based on layered feed-forward neural networks for the
microplane material model parameters identification is proposed in the present
paper. Novelties are usage of the Latin Hypercube Sampling method for the
generation of training sets, a systematic employment of stochastic sensitivity
analysis and a g... |
0902.1734 | A New Achievable Rate for the Gaussian Parallel Relay Channel | cs.IT math.IT | Schein and Gallager introduced the Gaussian parallel relay channel in 2000.
They proposed the Amplify-and-Forward (AF) and the Decode-and-Forward (DF)
strategies for this channel. For a long time, the best known achievable rate
for this channel was based on the AF and DF with time sharing (AF-DF).
Recently, a Rematch... |
0902.1786 | On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes | cs.IT math.IT | It is shown that dominant trapping sets of regular LDPC codes, so called
absorption sets, undergo a two-phased dynamic behavior in the iterative
message-passing decoding algorithm. Using a linear dynamic model for the
iteration behavior of these sets, it is shown that they undergo an initial
geometric growth phase wh... |
0902.1790 | Counting Distinctions: On the Conceptual Foundations of Shannon's
Information Theory | cs.IT cs.LO math.IT math.LO | Categorical logic has shown that modern logic is essentially the logic of
subsets (or "subobjects"). Partitions are dual to subsets so there is a dual
logic of partitions where a "distinction" [an ordered pair of distinct elements
(u,u') from the universe U ] is dual to an "element". An element being in a
subset is a... |
0902.1834 | Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots | cs.DS cs.CC cs.DC cs.RO | We consider a team of $k$ identical, oblivious, asynchronous mobile robots
that are able to sense (\emph{i.e.}, view) their environment, yet are unable to
communicate, and evolve on a constrained path. Previous results in this weak
scenario show that initial symmetry yields high lower bounds when problems are
to be s... |
0902.1853 | A Unified Approach to Sparse Signal Processing | cs.IT math.IT | A unified view of sparse signal processing is presented in tutorial form by
bringing together various fields. For each of these fields, various algorithms
and techniques, which have been developed to leverage sparsity, are described
succinctly. The common benefits of significant reduction in sampling rate and
process... |
0902.1911 | Topological Centrality and Its Applications | cs.IR cs.AI | Recent development of network structure analysis shows that it plays an
important role in characterizing complex system of many branches of sciences.
Different from previous network centrality measures, this paper proposes the
notion of topological centrality (TC) reflecting the topological positions of
nodes and edg... |
0902.1942 | On the Classification of Type II Codes of Length 24 | math.NT cs.DM cs.IT math.CO math.IT | We give a new, purely coding-theoretic proof of Koch's criterion on the
tetrad systems of Type II codes of length 24 using the theory of harmonic
weight enumerators. This approach is inspired by Venkov's approach to the
classification of the root systems of Type II lattices in R^{24}, and gives a
new instance of the ... |
0902.1947 | Cooperative Spectrum Sensing based on the Limiting Eigenvalue Ratio
Distribution in Wishart Matrices | cs.IT math.IT | Recent advances in random matrix theory have spurred the adoption of
eigenvalue-based detection techniques for cooperative spectrum sensing in
cognitive radio. Most of such techniques use the ratio between the largest and
the smallest eigenvalues of the received signal covariance matrix to infer the
presence or absen... |
0902.1996 | Convergence and Tradeoff of Utility-Optimal CSMA | cs.IT math.IT | It has been recently suggested that in wireless networks, CSMA-based
distributed MAC algorithms could achieve optimal utility without any message
passing. We present the first proof of convergence of such adaptive CSMA
algorithms towards an arbitrarily tight approximation of utility-optimizing
schedule. We also brief... |
0902.2036 | Modified Papoulis-Gerchberg algorithm for sparse signal recovery | cs.IT math.IT | Motivated by the well-known Papoulis-Gerchberg algorithm, an iterative
thresholding algorithm for recovery of sparse signals from few observations is
proposed. The sequence of iterates turns out to be similar to that of the
thresholded Landweber iterations, although not the same. The performance of the
proposed algor... |
0902.2104 | Tableau-based decision procedure for full coalitional multiagent
temporal-epistemic logic of linear time | cs.LO cs.MA | We develop a tableau-based decision procedure for the full coalitional
multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends
LTL with operators of common and distributed knowledge for all coalitions of
agents. The tableau procedure runs in exponential time, matching the lower
bound obtained by ... |
0902.2125 | Tableau-based procedure for deciding satisfiability in the full
coalitional multiagent epistemic logic | cs.LO cs.MA | We study the multiagent epistemic logic CMAELCD with operators for common and
distributed knowledge for all coalitions of agents. We introduce Hintikka
structures for this logic and prove that satisfiability in such structures is
equivalent to satisfiability in standard models. Using this result, we design
an increme... |
0902.2141 | Extracting the Kolmogorov Complexity of Strings and Sequences from
Sources with Limited Independence | cs.CC cs.IT math.IT | An infinite binary sequence has randomness rate at least $\sigma$ if, for
almost every $n$, the Kolmogorov complexity of its prefix of length $n$ is at
least $\sigma n$. It is known that for every rational $\sigma \in (0,1)$, on
one hand, there exists sequences with randomness rate $\sigma$ that can not be
effectivel... |
0902.2186 | A List of Household Objects for Robotic Retrieval Prioritized by People
with ALS (Version 092008) | cs.RO cs.HC | This technical report is designed to serve as a citable reference for the
original prioritized object list that the Healthcare Robotics Lab at Georgia
Tech released on its website in September of 2008. It is also expected to serve
as the primary citable reference for the research associated with this list
until the p... |
0902.2187 | A Standalone Markerless 3D Tracker for Handheld Augmented Reality | cs.CV cs.GR cs.MM | This paper presents an implementation of a markerless tracking technique
targeted to the Windows Mobile Pocket PC platform. The primary aim of this work
is to allow the development of standalone augmented reality applications for
handheld devices based on natural feature tracking. In order to achieve this
goal, a sub... |
0902.2206 | Feature Hashing for Large Scale Multitask Learning | cs.AI | Empirical evidence suggests that hashing is an effective strategy for
dimensionality reduction and practical nonparametric estimation. In this paper
we provide exponential tail bounds for feature hashing and show that the
interaction between random subspaces is negligible with high probability. We
demonstrate the fea... |
0902.2230 | BagPack: A general framework to represent semantic relations | cs.CL cs.IR | We introduce a way to represent word pairs instantiating arbitrary semantic
relations that keeps track of the contexts in which the words in the pair occur
both together and independently. The resulting features are of sufficient
generality to allow us, with the help of a standard supervised machine learning
algorith... |
0902.2235 | On Isometries for Convolutional Codes | cs.IT math.IT | In this paper we will discuss isometries and strong isometries for
convolutional codes. Isometries are weight-preserving module isomorphisms
whereas strong isometries are, in addition, degree-preserving. Special cases of
these maps are certain types of monomial transformations. We will show a form
of MacWilliams Equi... |
0902.2260 | Network Coding with Two-Way Relaying: Achievable Rate Regions and
Diversity-Multiplexing Tradeoffs | cs.IT math.IT | This paper addresses the fundamental characteristics of information exchange
via multihop network coding over two-way relaying in a wireless ad hoc network.
The end-to-end rate regions achieved by time-division multihop (TDMH),
MAC-layer network coding (MLNC) and PHY-layer network coding (PLNC) are first
characterize... |
0902.2316 | On weak isometries of Preparata codes | cs.IT math.IT | Let C1 and C2 be codes with code distance d. Codes C1 and C2 are called
weakly isometric, if there exists a mapping J:C1->C2, such that for any x,y
from C1 the equality d(x,y)=d holds if and only if d(J(x),J(y))=d. Obviously
two codes are weakly isometric if and only if the minimal distance graphs of
these codes are ... |
0902.2345 | What's in a Message? | cs.CL | In this paper we present the first step in a larger series of experiments for
the induction of predicate/argument structures. The structures that we are
inducing are very similar to the conceptual structures that are used in Frame
Semantics (such as FrameNet). Those structures are called messages and they
were previo... |
0902.2362 | XML Representation of Constraint Networks: Format XCSP 2.1 | cs.AI | We propose a new extended format to represent constraint networks using XML.
This format allows us to represent constraints defined either in extension or
in intension. It also allows us to reference global constraints. Any instance
of the problems CSP (Constraint Satisfaction Problem), QCSP (Quantified CSP)
and WCSP... |
0902.2367 | Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian
Constraints Combine | math.OC cs.IT math.IT | In this paper we study the problem of recovering sparse or compressible
signals from uniformly quantized measurements. We present a new class of convex
optimization programs, or decoders, coined Basis Pursuit DeQuantizer of moment
$p$ (BPDQ$_p$), that model the quantization distortion more faithfully than the
commonl... |
0902.2370 | Outer Bounds on the Admissible Source Region for Broadcast Channels with
Dependent Sources | cs.IT math.IT | Outer bounds on the admissible source region for broadcast channels with
dependent sources are developed and used to prove capacity results for several
classes of sources and channels.
|
0902.2399 | A Multi-Round Communication Lower Bound for Gap Hamming and Some
Consequences | cs.CC cs.DB cs.DS | The Gap-Hamming-Distance problem arose in the context of proving space lower
bounds for a number of key problems in the data stream model. In this problem,
Alice and Bob have to decide whether the Hamming distance between their $n$-bit
input strings is large (i.e., at least $n/2 + \sqrt n$) or small (i.e., at most
$n... |
0902.2420 | Self-Assembly as Graph Grammar as Distributed System | cs.DC cs.NE | In 2004, Klavins et al. introduced the use of graph grammars to describe --
and to program -- systems of self-assembly. It turns out that these graph
grammars are a "dual notion" of a graph rewriting characterization of
distributed systems that was proposed by Degano and Montanari over twenty years
ago. By applying t... |
0902.2425 | Finding Community Structure Based on Subgraph Similarity | cs.NI cs.IR physics.soc-ph | Community identification is a long-standing challenge in the modern network
science, especially for very large scale networks containing millions of nodes.
In this paper, we propose a new metric to quantify the structural similarity
between subgraphs, based on which an algorithm for community identification is
design... |
0902.2436 | Nested Lattice Codes for Gaussian Relay Networks with Interference | cs.IT math.IT | In this paper, a class of relay networks is considered. We assume that, at a
node, outgoing channels to its neighbors are orthogonal, while incoming signals
from neighbors can interfere with each other. We are interested in the
multicast capacity of these networks. As a subclass, we first focus on Gaussian
relay netw... |
0902.2438 | Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit | cs.IT math.IT | In this paper, a Gaussian two-way relay channel, where two source nodes
exchange messages with each other through a relay, is considered. We assume
that all nodes operate in full-duplex mode and there is no direct channel
between the source nodes. We propose an achievable scheme composed of nested
lattice codes for t... |
0902.2446 | Detection of Gaussian signals via hexagonal sensor networks | math.OC cs.SY | This paper considers a special case of the problem of identifying a static
scalar signal, depending on the location, using a planar network of sensors in
a distributed fashion. Motivated by the application to monitoring wild-fires
spreading and pollutants dispersion, we assume the signal to be Gaussian in
space. Usin... |
0902.2504 | Hyperset Approach to Semi-structured Databases and the Experimental
Implementation of the Query Language Delta | cs.DB | This thesis presents practical suggestions towards the implementation of the
hyperset approach to semi-structured databases and the associated query
language Delta. This work can be characterised as part of a top-down approach
to semi-structured databases, from theory to practice. The main original part
of this work ... |
0902.2559 | Power Allocation Games for MIMO Multiple Access Channels with
Coordination | cs.IT math.IT | A game theoretic approach is used to derive the optimal decentralized power
allocation (PA) in fast fading multiple access channels where the transmitters
and receiver are equipped with multiple antennas. The players (the mobile
terminals) are free to choose their PA in order to maximize their individual
transmission... |
0902.2692 | Combining coded signals with arbitrary modulations in orthogonal relay
channels | cs.IT math.IT | We consider a relay channel for which the following assumptions are made. (1)
The source-destination and relay-destination channels are orthogonal (frequency
division relay channel). (2) The relay implements the decode-and-forward
protocol. (3) The source and relay implement the same channel encoder, namely,
a onvolu... |
0902.2751 | Object Classification by means of Multi-Feature Concept Learning in a
Multi Expert-Agent System | cs.MA cs.LG | Classification of some objects in classes of concepts is an essential and
even breathtaking task in many applications. A solution is discussed here based
on Multi-Agent systems. A kernel of some expert agents in several classes is to
consult a central agent decide among the classification problem of a certain
object.... |
0902.2788 | Using SLP Neural Network to Persian Handwritten Digits Recognition | cs.CV | This paper has been withdrawn by the author ali pourmohammad.
|
0902.2851 | Leader Election Problem Versus Pattern Formation Problem | cs.DC cs.MA | Leader election and arbitrary pattern formation are funda- mental tasks for a
set of autonomous mobile robots. The former consists in distinguishing a unique
robot, called the leader. The latter aims in arranging the robots in the plane
to form any given pattern. The solv- ability of both these tasks turns out to
be ... |
0902.2871 | The Semantics of Kalah Game | cs.AI | The present work consisted in developing a plateau game. There are the
traditional ones (monopoly, cluedo, ect.) but those which interest us leave
less place at the chance (luck) than to the strategy such that the chess game.
Kallah is an old African game, its rules are simple but the strategies to be
used are very c... |
0902.2917 | Full Rate L2-Orthogonal Space-Time CPM for Three Antennas | cs.IT math.IT | To combine the power efficiency of Continuous Phase Modulation (CPM) with
enhanced performance in fading environments, some authors have suggested to use
CPM in combination with Space-Time Codes (STC). Recently, we have proposed a
CPM ST-coding scheme based on L2-orthogonality for two transmitting antennas.
In this p... |
0902.2948 | Optimized L2-Orthogonal STC CPM for 3 Antennas | cs.IT math.IT | In this paper, we introduce further our recently designed family of L2
orthogonal Space-Time codes for CPM. With their advantage of maintaining both
the constant envelope properties of CPM, the diversity of Space-Time codes and
moreover orthogonality, and thus reduced decoding complexity, these codes are
also full ra... |
0902.2953 | ImageSpace: An Environment for Image Ontology Management | cs.DL cs.DB cs.MM cs.SE | More and more researchers have realized that ontologies will play a critical
role in the development of the Semantic Web, the next generation Web in which
content is not only consumable by humans, but also by software agents. The
development of tools to support ontology management including creation,
visualization, a... |
0902.2969 | Ptarithmetic | cs.LO cs.AI cs.CC | The present article introduces ptarithmetic (short for "polynomial time
arithmetic") -- a formal number theory similar to the well known Peano
arithmetic, but based on the recently born computability logic (see
http://www.cis.upenn.edu/~giorgi/cl.html) instead of classical logic. The
formulas of ptarithmetic represen... |
0902.2975 | Writing Positive/Negative-Conditional Equations Conveniently | cs.AI cs.LO | We present a convenient notation for positive/negative-conditional equations.
The idea is to merge rules specifying the same function by using case-, if-,
match-, and let-expressions. Based on the presented macro-rule-construct,
positive/negative-conditional equational specifications can be written on a
higher level.... |
0902.2995 | ASF+ --- eine ASF-aehnliche Spezifikationssprache | cs.AI cs.SC | Maintaining the main aspects of the algebraic specification language ASF as
presented in [Bergstra&al.89] we have extend ASF with the following concepts:
While once exported names in ASF must stay visible up to the top the module
hierarchy, ASF+ permits a more sophisticated hiding of signature names. The
erroneous me... |
0902.3026 | OntoELAN: An Ontology-based Linguistic Multimedia Annotator | cs.DL cs.DB cs.MM cs.SE | Despite its scientific, political, and practical value, comprehensive
information about human languages, in all their variety and complexity, is not
readily obtainable and searchable. One reason is that many language data are
collected as audio and video recordings which imposes a challenge to document
indexing and r... |
0902.3027 | Ontology-Based Annotation of Multimedia Language Data for the Semantic
Web | cs.DL cs.DB cs.MM | There is an increasing interest and effort in preserving and documenting
endangered languages. Language data are valuable only when they are
well-cataloged, indexed and searchable. Many language data, particularly those
of lesser-spoken languages, are collected as audio and video recordings. While
multimedia data pro... |
0902.3056 | New Results in the Simultaneous Message Passing Model | cs.DC cs.CC cs.IT math.IT quant-ph | Consider the following Simultaneous Message Passing (SMP) model for computing
a relation f subset of X x Y x Z. In this model Alice, on input x in X and Bob,
on input y in Y, send one message each to a third party Referee who then
outputs a z in Z such that (x,y,z) in f. We first show optimal 'Direct sum'
results for... |
0902.3072 | Syntactic variation of support verb constructions | cs.CL | We report experiments about the syntactic variations of support verb
constructions, a special type of multiword expressions (MWEs) containing
predicative nouns. In these expressions, the noun can occur with or without the
verb, with no clear-cut semantic difference. We extracted from a large French
corpus a set of ex... |
0902.3076 | Coding for the Non-Orthogonal Amplify-and-Forward Cooperative Channel | cs.IT math.IT | In this work, we consider the problem of coding for the half-duplex
non-orthogonal amplify-and-forward (NAF) cooperative channel where the
transmitter to relay and the inter-relay links are highly reliable. We derive
bounds on the diversity order of the NAF protocol that are achieved by a
distributed space-time bit-i... |
0902.3114 | Analysis of the Second Moment of the LT Decoder | cs.IT math.IT | We analyze the second moment of the ripple size during the LT decoding
process and prove that the standard deviation of the ripple size for an LT-code
with length $k$ is of the order of $\sqrt k.$ Together with a result by Karp
et. al stating that the expectation of the ripple size is of the order of $k$
[3], this gi... |
0902.3176 | Error-Correcting Tournaments | cs.AI cs.LG | We present a family of pairwise tournaments reducing $k$-class classification
to binary classification. These reductions are provably robust against a
constant fraction of binary errors. The results improve on the PECOC
construction \cite{SECOC} with an exponential improvement in computation, from
$O(k)$ to $O(\log_2... |
0902.3178 | Multiple Multicasts with the Help of a Relay | cs.IT math.IT | The problem of simultaneous multicasting of multiple messages with the help
of a relay terminal is considered. In particular, a model is studied in which a
relay station simultaneously assists two transmitters in multicasting their
independent messages to two receivers. The relay may also have an independent
message ... |
0902.3196 | Symbolic Computing with Incremental Mindmaps to Manage and Mine Data
Streams - Some Applications | cs.NE cs.AI | In our understanding, a mind-map is an adaptive engine that basically works
incrementally on the fundament of existing transactional streams. Generally,
mind-maps consist of symbolic cells that are connected with each other and that
become either stronger or weaker depending on the transactional stream. Based
on the ... |
0902.3210 | Coverage in Multi-Antenna Two-Tier Networks | cs.NI cs.IT math.IT | In two-tier networks -- comprising a conventional cellular network overlaid
with shorter range hotspots (e.g. femtocells, distributed antennas, or wired
relays) -- with universal frequency reuse, the near-far effect from cross-tier
interference creates dead spots where reliable coverage cannot be guaranteed to
users ... |
0902.3223 | An Exact Algorithm for the Stratification Problem with Proportional
Allocation | cs.LG cs.DM cs.DS | We report a new optimal resolution for the statistical stratification problem
under proportional sampling allocation among strata. Consider a finite
population of N units, a random sample of n units selected from this population
and a number L of strata. Thus, we have to define which units belong to each
stratum so a... |
0902.3286 | MDS codes on the erasure-erasure wiretap channel | cs.IT math.IT | This paper considers the problem of perfectly secure communication on a
modified version of Wyner's wiretap channel II where both the main and
wiretapper's channels have some erasures. A secret message is to be encoded
into $n$ channel symbols and transmitted. The main channel is such that the
legitimate receiver rec... |
0902.3287 | Adaptive Decoding of LDPC Codes with Binary Messages | cs.IT math.IT | A novel adaptive binary decoding algorithm for LDPC codes is proposed, which
reduces the decoding complexity while having a comparable or even better
performance than corresponding non-adaptive alternatives. In each iteration the
variable node decoders use the binary check node decoders multiple times; each
single us... |
0902.3294 | Progress in Computer-Assisted Inductive Theorem Proving by
Human-Orientedness and Descente Infinie? | cs.AI cs.LO | In this short position paper we briefly review the development history of
automated inductive theorem proving and computer-assisted mathematical
induction. We think that the current low expectations on progress in this field
result from a faulty narrow-scope historical projection. Our main motivation is
to explain--o... |
0902.3372 | Gaussian Fading Is the Worst Fading | cs.IT math.IT | The capacity of peak-power limited, single-antenna, noncoherent, flat-fading
channels with memory is considered. The emphasis is on the capacity pre-log,
i.e., on the limiting ratio of channel capacity to the logarithm of the
signal-to-noise ratio (SNR), as the SNR tends to infinity. It is shown that,
among all stati... |
0902.3373 | Learning rules from multisource data for cardiac monitoring | cs.LG | This paper formalises the concept of learning symbolic rules from multisource
data in a cardiac monitoring context. Our sources, electrocardiograms and
arterial blood pressure measures, describe cardiac behaviours from different
viewpoints. To learn interpretable rules, we use an Inductive Logic Programming
(ILP) met... |
0902.3430 | Domain Adaptation: Learning Bounds and Algorithms | cs.LG cs.AI | This paper addresses the general problem of domain adaptation which arises in
a variety of applications where the distribution of the labeled sample
available somewhat differs from that of the test data. Building on previous
work by Ben-David et al. (2007), we introduce a novel distance between
distributions, discrep... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.