id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0705.1280 | A Novel method for the design of 2-DOF Parallel mechanisms for machining
applications | cs.RO | Parallel Kinematic Mechanisms (PKM) are interesting alternative designs for
machine tools. A design method based on velocity amplification factors analysis
is presented in this paper. The comparative study of two simple
two-degree-of-freedom PKM dedicated to machining applications is led through
this method: the comm... |
0705.1282 | Design of a Three-Axis Isotropic Parallel Manipulator for Machining
Applications: The Orthoglide | cs.RO | The orthoglide is a 3-DOF parallel mechanism designed at IRCCyN for machining
applications. It features three fixed parallel linear joints which are mounted
orthogonally and a mobile platform which moves in the Cartesian x-y-z space
with fixed orientation. The orthoglide has been designed as function of a
prescribed ... |
0705.1284 | Workspace Analysis of the Orthoglide using Interval Analysis | cs.RO | This paper addresses the workspace analysis of the orthoglide, a 3-DOF
parallel mechanism designed for machining applications. This machine features
three fixed parallel linear joints which are mounted orthogonally and a mobile
platform which moves in the Cartesian x-y-z space with fixed orientation. The
workspace an... |
0705.1285 | P\'eriph\'eriques haptiques et simulation d'objets, de robots et de
mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop | cs.RO | This paper presents the development of a new software in order to manage
objects, robots and mannequins in using the possibilities given by the haptic
feedback of the Phantom desktop devices. The haptic device provides 6
positional degree of freedom sensing but three degrees force feedback. This
software called eM-Vi... |
0705.1309 | Robust Multi-Cellular Developmental Design | cs.AI | This paper introduces a continuous model for Multi-cellular Developmental
Design. The cells are fixed on a 2D grid and exchange "chemicals" with their
neighbors during the growth process. The quantity of chemicals that a cell
produces, as well as the differentiation value of the cell in the phenotype,
are controlled ... |
0705.1336 | Diversity-Multiplexing Tradeoff via Asymptotic Analysis of Large MIMO
Systems | cs.IT math.IT | Diversity-multiplexing tradeoff (DMT) presents a compact framework to compare
various MIMO systems and channels in terms of the two main advantages they
provide (i.e. high data rate and/or low error rate). This tradeoff was
characterized asymptotically (SNR-> infinity) for i.i.d. Rayleigh fading
channel by Zheng and ... |
0705.1340 | On Optimum Power Allocation for the V-BLAST | cs.IT math.IT | A unified analytical framework for optimum power allocation in the unordered
V-BLAST algorithm and its comparative performance analysis are presented.
Compact closed-form approximations for the optimum power allocation are
derived, based on average total and block error rates. The choice of the
criterion has little i... |
0705.1343 | The Optimal Design of Three Degree-of-Freedom Parallel Mechanisms for
Machining Applications | cs.RO | The subject of this paper is the optimal design of a parallel mechanism
intended for three-axis machining applications. Parallel mechanisms are
interesting alternative designs in this context but most of them are designed
for three- or six-axis machining applications. In the last case, the position
and the orientatio... |
0705.1344 | Classification of one family of 3R positioning Manipulators | cs.RO | The aim of this paper is to classify one family of 3R serial positioning
manipulators. This categorization is based on the number of cusp points of
quaternary, binary, generic and non-generic manipulators. It was found three
subsets of manipulators with 0, 2 or 4 cusp points and one homotopy class for
generic quatern... |
0705.1345 | Degree Optimization and Stability Condition for the Min-Sum Decoder | cs.IT math.IT | The min-sum (MS) algorithm is arguably the second most fundamental algorithm
in the realm of message passing due to its optimality (for a tree code) with
respect to the {\em block error} probability \cite{Wiberg}. There also seems to
be a fundamental relationship of MS decoding with the linear programming
decoder \ci... |
0705.1384 | Matroid Pathwidth and Code Trellis Complexity | cs.DM cs.IT math.IT | We relate the notion of matroid pathwidth to the minimum trellis
state-complexity (which we term trellis-width) of a linear code, and to the
pathwidth of a graph. By reducing from the problem of computing the pathwidth
of a graph, we show that the problem of determining the pathwidth of a
representable matroid is NP-... |
0705.1390 | Machine and Component Residual Life Estimation through the Application
of Neural Networks | cs.CE | This paper concerns the use of neural networks for predicting the residual
life of machines and components. In addition, the advantage of using
condition-monitoring data to enhance the predictive capability of these neural
networks was also investigated. A number of neural network variations were
trained and tested w... |
0705.1394 | The Orthoglide: Kinematics and Workspace Analysis | cs.RO | The paper addresses kinematic and geometrical aspects of the Orthoglide, a
three-DOF parallel mechanism. This machine consists of three fixed linear
joints, which are mounted orthogonally, three identical legs and a mobile
platform, which moves in the Cartesian x-y-z space with fixed orientation. New
solutions to sol... |
0705.1395 | Subjective Evaluation of Forms in an Immersive Environment | cs.HC cs.RO | User's perception of product, by essence subjective, is a major topic in
marketing and industrial design. Many methods, based on users' tests, are used
so as to characterise this perception. We are interested in three main methods:
multidimensional scaling, semantic differential method, and preference mapping.
These ... |
0705.1397 | Realistic Rendering of Kinetostatic Indices of Mechanisms | cs.RO | The work presented in this paper is related to the use of a haptic device in
an environment of robotic simulation. Such device introduces a new approach to
feel and to understand the boundaries of the workspace of mechanisms as well as
its kinetostatic properties. Indeed, these concepts are abstract and thus often
di... |
0705.1399 | A New Concept of Modular Parallel Mechanism for Machining Applications | cs.RO | The subject of this paper is the design of a new concept of modular parallel
mechanisms for three, four or five-axis machining applications. Most parallel
mechanisms are designed for three- or six-axis machining applications. In the
last case, the position and the orientation of the tool are coupled and the
shape of ... |
0705.1400 | A Workspace based Classification of 3R Orthogonal Manipulators | cs.RO | A classification of a family of 3-revolute (3R) positioning manipulators is
established. This classification is based on the topology of their workspace.
The workspace is characterized in a half-cross section by the singular curves
of the manipulator. The workspace topology is defined by the number of cusps
and nodes... |
0705.1409 | Singularity Surfaces and Maximal Singularity-Free Boxes in the Joint
Space of Planar 3-RPR Parallel Manipulators | cs.RO | In this paper, a method to compute joint space singularity surfaces of 3-RPR
planar parallel manipulators is first presented. Then, a procedure to determine
maximal joint space singularity-free boxes is introduced. Numerical examples
are given in order to illustrate graphically the results. This study is of high
inte... |
0705.1410 | Kinematics analysis of the parallel module of the VERNE machine | cs.RO | The paper derives the inverse and forward kinematic equations of a spatial
three-degree-of-freedom parallel mechanism, which is the parallel module of a
hybrid serial-parallel 5-axis machine tool. This parallel mechanism consists of
a moving platform that is connected to a fixed base by three non-identical
legs. Each... |
0705.1450 | An Algorithm for Computing Cusp Points in the Joint Space of 3-RPR
Parallel Manipulators | cs.RO | This paper presents an algorithm for detecting and computing the cusp points
in the joint space of 3-RPR planar parallel manipulators. In manipulator
kinematics, cusp points are special points, which appear on the singular curves
of the manipulators. The nonsingular change of assembly mode of 3-RPR parallel
manipulat... |
0705.1453 | DWEB: A Data Warehouse Engineering Benchmark | cs.DB | Data warehouse architectural choices and optimization techniques are critical
to decision support query performance. To facilitate these choices, the
performance of the designed data warehouse must be assessed. This is usually
done with the help of benchmarks, which can either help system users comparing
the performa... |
0705.1454 | DOEF: A Dynamic Object Evaluation Framework | cs.DB | In object-oriented or object-relational databases such as multimedia
databases or most XML databases, access patterns are not static, i.e.,
applications do not always access the same objects in the same order
repeatedly. However, this has been the way these databases and associated
optimisation techniques like cluste... |
0705.1455 | Decision tree modeling with relational views | cs.DB | Data mining is a useful decision support technique that can be used to
discover production rules in warehouses or corporate data. Data mining research
has made much effort to apply various mining algorithms efficiently on large
databases. However, a serious problem in their practical application is the
long processin... |
0705.1456 | Warehousing Web Data | cs.DB | In a data warehousing process, mastering the data preparation phase allows
substantial gains in terms of time and performance when performing
multidimensional analysis or using data mining algorithms. Furthermore, a data
warehouse can require external data. The web is a prevalent data source in this
context. In this ... |
0705.1457 | Web data modeling for integration in data warehouses | cs.DB | In a data warehousing process, the data preparation phase is crucial.
Mastering this phase allows substantial gains in terms of time and performance
when performing a multidimensional analysis or using data mining algorithms.
Furthermore, a data warehouse can require external data. The web is a prevalent
data source ... |
0705.1481 | Actin - Technical Report | cs.NE | The Boolean satisfiability problem (SAT) can be solved efficiently with
variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict
analysis dependent dynamic decision heuristics has proved to be particularly
efficient, e.g. in Chaff. In this work, algorithms that initialize the variable
activity ... |
0705.1585 | HMM Speaker Identification Using Linear and Non-linear Merging
Techniques | cs.LG | Speaker identification is a powerful, non-invasive and in-expensive biometric
technique. The recognition accuracy, however, deteriorates when noise levels
affect a specific band of frequency. In this paper, we present a sub-band based
speaker identification that intends to improve the live testing performance.
Each f... |
0705.1612 | A Class of LDPC Erasure Distributions with Closed-Form Threshold
Expression | cs.IT math.IT | In this paper, a family of low-density parity-check (LDPC) degree
distributions, whose decoding threshold on the binary erasure channel (BEC)
admits a simple closed form, is presented. These degree distributions are a
subset of the check regular distributions (i.e. all the check nodes have the
same degree), and are r... |
0705.1617 | Non-Computability of Consciousness | quant-ph astro-ph cs.AI | With the great success in simulating many intelligent behaviors using
computing devices, there has been an ongoing debate whether all conscious
activities are computational processes. In this paper, the answer to this
question is shown to be no. A certain phenomenon of consciousness is
demonstrated to be fully repres... |
0705.1672 | Principal Component Analysis and Automatic Relevance Determination in
Damage Identification | cs.CE | This paper compares two neural network input selection schemes, the Principal
Component Analysis (PCA) and the Automatic Relevance Determination (ARD) based
on Mac-Kay's evidence framework. The PCA takes all the input data and projects
it onto a lower dimension space, thereby reduc-ing the dimension of the input
spac... |
0705.1673 | Using artificial intelligence for data reduction in mechanical
engineering | cs.CE cs.AI cs.NE | In this paper artificial neural networks and support vector machines are used
to reduce the amount of vibration data that is required to estimate the Time
Domain Average of a gear vibration signal. Two models for estimating the time
domain average of a gear vibration signal are proposed. The models are tested
on data... |
0705.1674 | Evolutionary Optimisation Methods for Template Based Image Registration | cs.CE cs.CV | This paper investigates the use of evolutionary optimisation techniques to
register a template with a scene image. An error function is created to measure
the correspondence of the template to the image. The problem presented here is
to optimise the horizontal, vertical and scaling parameters that register the
templa... |
0705.1680 | Option Pricing Using Bayesian Neural Networks | cs.CE cs.NE | Options have provided a field of much study because of the complexity
involved in pricing them. The Black-Scholes equations were developed to price
options but they are only valid for European styled options. There is added
complexity when trying to price American styled options and this is why the use
of neural netw... |
0705.1682 | Capacity of Underspread Noncoherent WSSUS Fading Channels under Peak
Signal Constraints | cs.IT math.IT | We characterize the capacity of the general class of noncoherent underspread
wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective
Rayleigh fading channels, under peak constraints in time and frequency and in
time only. Capacity upper and lower bounds are found which are explicit in the
chann... |
0705.1757 | Scalability and Optimisation of a Committee of Agents Using Genetic
Algorithm | cs.MA | A population of committees of agents that learn by using neural networks is
implemented to simulate the stock market. Each committee of agents, which is
regarded as a player in a game, is optimised by continually adapting the
architecture of the agents using genetic algorithms. The committees of agents
buy and sell s... |
0705.1759 | Finite Element Model Updating Using Response Surface Method | cs.CE | This paper proposes the response surface method for finite element model
updating. The response surface method is implemented by approximating the
finite element model surface response equation by a multi-layer perceptron. The
updated parameters of the finite element model were calculated using genetic
algorithm by o... |
0705.1760 | Dynamic Model Updating Using Particle Swarm Optimization Method | cs.CE cs.NE | This paper proposes the use of particle swarm optimization method (PSO) for
finite element (FE) model updating. The PSO method is compared to the existing
methods that use simulated annealing (SA) or genetic algorithms (GA) for FE
model for model updating. The proposed method is tested on an unsymmetrical
H-shaped st... |
0705.1787 | Energy-Efficient Resource Allocation in Wireless Networks: An Overview
of Game-Theoretic Approaches | cs.IT cs.GT math.IT | An overview of game-theoretic approaches to energy-efficient resource
allocation in wireless networks is presented. Focusing on multiple-access
networks, it is demonstrated that game theory can be used as an effective tool
to study resource allocation in wireless networks with quality-of-service (QoS)
constraints. A ... |
0705.1788 | A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA
Networks with Delay QoS Constraints | cs.IT cs.GT math.IT | A game-theoretic framework is used to study the effect of constellation size
on the energy efficiency of wireless networks for M-QAM modulation. A
non-cooperative game is proposed in which each user seeks to choose its
transmit power (and possibly transmit symbol rate) as well as the constellation
size in order to ma... |
0705.1789 | Random Linear Network Coding: A free cipher? | cs.IT cs.CR math.IT | We consider the level of information security provided by random linear
network coding in network scenarios in which all nodes comply with the
communication protocols yet are assumed to be potential eavesdroppers (i.e.
"nice but curious"). For this setup, which differs from wiretapping scenarios
considered previously... |
0705.1886 | Ontology-Supported and Ontology-Driven Conceptual Navigation on the
World Wide Web | cs.IR | This paper presents the principles of ontology-supported and ontology-driven
conceptual navigation. Conceptual navigation realizes the independence between
resources and links to facilitate interoperability and reusability. An engine
builds dynamic links, assembles resources under an argumentative scheme and
allows o... |
0705.1919 | Optimal Watermark Embedding and Detection Strategies Under Limited
Detection Resources | cs.IT cs.CR math.IT | An information-theoretic approach is proposed to watermark embedding and
detection under limited detector resources. First, we consider the attack-free
scenario under which asymptotically optimal decision regions in the
Neyman-Pearson sense are proposed, along with the optimal embedding rule.
Later, we explore the ca... |
0705.1922 | Crystallization in large wireless networks | cs.IT math.IT | We analyze fading interference relay networks where M single-antenna
source-destination terminal pairs communicate concurrently and in the same
frequency band through a set of K single-antenna relays using half-duplex
two-hop relaying. Assuming that the relays have channel state information
(CSI), it is shown that in... |
0705.1999 | A first-order Temporal Logic for Actions | cs.AI cs.LO | We present a multi-modal action logic with first-order modalities, which
contain terms which can be unified with the terms inside the subsequent
formulas and which can be quantified. This makes it possible to handle
simultaneously time and states. We discuss applications of this language to
action theory where it is ... |
0705.2009 | Bit-Interleaved Coded Multiple Beamforming with Imperfect CSIT | cs.IT math.IT | This paper addresses the performance of bit-interleaved coded multiple
beamforming (BICMB) [1], [2] with imperfect knowledge of beamforming vectors.
Most studies for limited-rate channel state information at the transmitter
(CSIT) assume that the precoding matrix has an invariance property under an
arbitrary unitary ... |
0705.2011 | Multi-Dimensional Recurrent Neural Networks | cs.AI cs.CV | Recurrent neural networks (RNNs) have proved effective at one dimensional
sequence learning tasks, such as speech and online handwriting recognition.
Some of the properties that make RNNs suitable for such tasks, for example
robustness to input warping, and the ability to access contextual information,
are also desir... |
0705.2106 | Scientific citations in Wikipedia | cs.DL cs.IR | The Internet-based encyclopaedia Wikipedia has grown to become one of the
most visited web-sites on the Internet. However, critics have questioned the
quality of entries, and an empirical study has shown Wikipedia to contain
errors in a 2005 sample of science entries. Biased coverage and lack of sources
are among the... |
0705.2235 | Response Prediction of Structural System Subject to Earthquake Motions
using Artificial Neural Network | cs.AI | This paper uses Artificial Neural Network (ANN) models to compute response of
structural system subject to Indian earthquakes at Chamoli and Uttarkashi
ground motion data. The system is first trained for a single real earthquake
data. The trained ANN architecture is then used to simulate earthquakes with
various inte... |
0705.2236 | Fault Classification using Pseudomodal Energies and Neuro-fuzzy
modelling | cs.AI | This paper presents a fault classification method which makes use of a
Takagi-Sugeno neuro-fuzzy model and Pseudomodal energies calculated from the
vibration signals of cylindrical shells. The calculation of Pseudomodal
Energies, for the purposes of condition monitoring, has previously been found
to be an accurate me... |
0705.2270 | Multi-Access MIMO Systems with Finite Rate Channel State Feedback | cs.IT math.IT | This paper characterizes the effect of finite rate channel state feedback on
the sum rate of a multi-access multiple-input multiple-output (MIMO) system. We
propose to control the users jointly, specifically, we first choose the users
jointly and then select the corresponding beamforming vectors jointly. To
quantify ... |
0705.2272 | Quantization Bounds on Grassmann Manifolds of Arbitrary Dimensions and
MIMO Communications with Feedback | cs.IT math.IT | This paper considers the quantization problem on the Grassmann manifold with
dimension n and p. The unique contribution is the derivation of a closed-form
formula for the volume of a metric ball in the Grassmann manifold when the
radius is sufficiently small. This volume formula holds for Grassmann manifolds
with arb... |
0705.2273 | On the Information Rate of MIMO Systems with Finite Rate Channel State
Feedback and Power On/Off Strategy | cs.IT math.IT | This paper quantifies the information rate of multiple-input multiple-output
(MIMO) systems with finite rate channel state feedback and power on/off
strategy. In power on/off strategy, a beamforming vector (beam) is either
turned on (denoted by on-beam) with a constant power or turned off. We prove
that the ratio of ... |
0705.2274 | How Many Users should be Turned On in a Multi-Antenna Broadcast Channel? | cs.IT math.IT | This paper considers broadcast channels with L antennas at the base station
and m single-antenna users, where each user has perfect channel knowledge and
the base station obtains channel information through a finite rate feedback.
The key observation of this paper is that the optimal number of on-users (users
turned ... |
0705.2278 | Unequal dimensional small balls and quantization on Grassmann Manifolds | cs.IT math.IT | The Grassmann manifold G_{n,p}(L) is the set of all p-dimensional planes
(through the origin) in the n-dimensional Euclidean space L^{n}, where L is
either R or C. This paper considers an unequal dimensional quantization in
which a source in G_{n,p}(L) is quantized through a code in G_{n,q}(L), where p
and q are not ... |
0705.2305 | Fuzzy and Multilayer Perceptron for Evaluation of HV Bushings | cs.AI cs.NE | The work proposes the application of fuzzy set theory (FST) to diagnose the
condition of high voltage bushings. The diagnosis uses dissolved gas analysis
(DGA) data from bushings based on IEC60599 and IEEE C57-104 criteria for oil
impregnated paper (OIP) bushings. FST and neural networks are compared in terms
of accu... |
0705.2307 | A Study in a Hybrid Centralised-Swarm Agent Community | cs.NE cs.AI | This paper describes a systems architecture for a hybrid Centralised/Swarm
based multi-agent system. The issue of local goal assignment for agents is
investigated through the use of a global agent which teaches the agents
responses to given situations. We implement a test problem in the form of a
Pursuit game, where ... |
0705.2310 | On-Line Condition Monitoring using Computational Intelligence | cs.AI | This paper presents bushing condition monitoring frameworks that use
multi-layer perceptrons (MLP), radial basis functions (RBF) and support vector
machines (SVM) classifiers. The first level of the framework determines if the
bushing is faulty or not while the second level determines the type of fault.
The diagnosti... |
0705.2318 | Statistical Mechanics of Nonlinear On-line Learning for Ensemble
Teachers | cs.LG cond-mat.dis-nn | We analyze the generalization performance of a student in a model composed of
nonlinear perceptrons: a true teacher, ensemble teachers, and the student. We
calculate the generalization error of the student analytically or numerically
using statistical mechanics in the framework of on-line learning. We treat two
well-... |
0705.2435 | Reduced Complexity Sphere Decoding for Square QAM via a New Lattice
Representation | cs.IT math.IT | Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection
algorithm, which has been adapted for different linear channels in digital
communications. The complexity of the SD has been shown to be exponential in
some cases, and polynomial in others and under certain assumptions. The sphere
radius and t... |
0705.2485 | Using Genetic Algorithms to Optimise Rough Set Partition Sizes for HIV
Data Analysis | cs.NE cs.AI q-bio.QM | In this paper, we present a method to optimise rough set partition sizes, to
which rule extraction is performed on HIV data. The genetic algorithm
optimisation technique is used to determine the partition sizes of a rough set
in order to maximise the rough sets prediction accuracy. The proposed method is
tested on a ... |
0705.2516 | Condition Monitoring of HV Bushings in the Presence of Missing Data
Using Evolutionary Computing | cs.NE cs.AI | The work proposes the application of neural networks with particle swarm
optimisation (PSO) and genetic algorithms (GA) to compensate for missing data
in classifying high voltage bushings. The classification is done using DGA data
from 60966 bushings based on IEEEc57.104, IEC599 and IEEE production rates
methods for ... |
0705.2535 | Informatics Carnot Machine | cs.IT math.IT | Based on Planck's blackbody equation it is argued that a single mode light
pulse, with a large number of photons, carries one entropy unit. Similarly, an
empty radiation mode carries no entropy. In this case, the calculated entropy
that a coded sequence of light pulses is carrying is simply the Gibbs mixing
entropy, ... |
0705.2604 | Computational Intelligence for Condition Monitoring | cs.CE | Condition monitoring techniques are described in this chapter. Two aspects of
condition monitoring process are considered: (1) feature extraction; and (2)
condition classification. Feature extraction methods described and implemented
are fractals, Kurtosis and Mel-frequency Cepstral Coefficients. Classification
metho... |
0705.2765 | On the monotonization of the training set | cs.LG cs.AI | We consider the problem of minimal correction of the training set to make it
consistent with monotonic constraints. This problem arises during analysis of
data sets via techniques that require monotone data. We show that this problem
is NP-hard in general and is equivalent to finding a maximal independent set in
spec... |
0705.2787 | Worst-Case Background Knowledge for Privacy-Preserving Data Publishing | cs.DB | Recent work has shown the necessity of considering an attacker's background
knowledge when reasoning about privacy in data publishing. However, in
practice, the data publisher does not know what background knowledge the
attacker possesses. Thus, it is important to consider the worst-case. In this
paper, we initiate a... |
0705.2847 | Capacity of Sparse Multipath Channels in the Ultra-Wideband Regime | cs.IT math.IT | This paper studies the ergodic capacity of time- and frequency-selective
multipath fading channels in the ultrawideband (UWB) regime when training
signals are used for channel estimation at the receiver. Motivated by recent
measurement results on UWB channels, we propose a model for sparse multipath
channels. A key i... |
0705.2848 | Non-Coherent Capacity and Reliability of Sparse Multipath Channels in
the Wideband Regime | cs.IT math.IT | In contrast to the prevalent assumption of rich multipath in information
theoretic analysis of wireless channels, physical channels exhibit sparse
multipath, especially at large bandwidths. We propose a model for sparse
multipath fading channels and present results on the impact of sparsity on
non-coherent capacity a... |
0705.2854 | Scanning and Sequential Decision Making for Multi-Dimensional Data -
Part II: the Noisy Case | cs.IT cs.CV math.IT | We consider the problem of sequential decision making on random fields
corrupted by noise. In this scenario, the decision maker observes a noisy
version of the data, yet judged with respect to the clean data. In particular,
we first consider the problem of sequentially scanning and filtering noisy
random fields. In t... |
0705.3013 | A stochastic non-cooperative game for energy efficiency in wireless data
networks | cs.IT cs.GT math.IT | In this paper the issue of energy efficiency in CDMA wireless data networks
is addressed through a game theoretic approach. Building on a recent paper by
the first two authors, wherein a non-cooperative game for spreading-code
optimization, power control, and receiver design has been proposed to maximize
the ratio of... |
0705.3025 | Spectral Efficiency of Spectrum Pooling Systems | cs.IT cs.NI math.IT | In this contribution, we investigate the idea of using cognitive radio to
reuse locally unused spectrum to increase the total system capacity. We
consider a multiband/wideband system in which the primary and cognitive users
wish to communicate to different receivers, subject to mutual interference and
assume that eac... |
0705.3050 | A competitive multi-agent model of interbank payment systems | cs.MA | We develop a dynamic multi-agent model of an interbank payment system where
banks choose their level of available funds on the basis of private payoff
maximisation. The model consists of the repetition of a simultaneous move stage
game with incomplete information, incomplete monitoring, and stochastic
payoffs. Adapta... |
0705.3058 | On the Shannon capacity and queueing stability of random access
multicast | cs.IT math.IT | We study and compare the Shannon capacity region and the stable throughput
region for a random access system in which source nodes multicast their
messages to multiple destination nodes. Under an erasure channel model which
accounts for interference and allows for multipacket reception, we first
characterize the Shan... |
0705.3099 | Distortion Minimization in Gaussian Layered Broadcast Coding with
Successive Refinement | cs.IT math.IT | A transmitter without channel state information (CSI) wishes to send a
delay-limited Gaussian source over a slowly fading channel. The source is coded
in superimposed layers, with each layer successively refining the description
in the previous one. The receiver decodes the layers that are supported by the
channel re... |
0705.3261 | Recovering Multiplexing Loss Through Successive Relaying Using
Repetition Coding | cs.IT math.IT | In this paper, a transmission protocol is studied for a two relay wireless
network in which simple repetition coding is applied at the relays.
Information-theoretic achievable rates for this transmission scheme are given,
and a space-time V-BLAST signalling and detection method that can approach them
is developed. It... |
0705.3344 | Multiuser detection in a dynamic environment Part I: User identification
and data detection | cs.IT math.IT | In random-access communication systems, the number of active users varies
with time, and has considerable bearing on receiver's performance. Thus,
techniques aimed at identifying not only the information transmitted, but also
that number, play a central role in those systems. An example of application of
these techni... |
0705.3360 | The Road to Quantum Artificial Intelligence | cs.AI | This paper overviews the basic principles and recent advances in the emerging
field of Quantum Computation (QC), highlighting its potential application to
Artificial Intelligence (AI). The paper provides a very brief introduction to
basic QC issues like quantum registers, quantum gates and quantum algorithms
and then... |
0705.3555 | Multidimensional Coded Modulation in Block-Fading Channnels | cs.IT math.IT | We study the problem of constructing coded modulation schemes over
multidimensional signal sets in Nakagami-$m$ block-fading channels. In
particular, we consider the optimal diversity reliability exponent of the error
probability when the multidimensional constellation is obtained as the rotation
of classical complex... |
0705.3561 | Generalizing Consistency and other Constraint Properties to Quantified
Constraints | cs.LO cs.AI | Quantified constraints and Quantified Boolean Formulae are typically much
more difficult to reason with than classical constraints, because quantifier
alternation makes the usual notion of solution inappropriate. As a consequence,
basic properties of Constraint Satisfaction Problems (CSP), such as consistency
or subs... |
0705.3593 | MI image registration using prior knowledge | cs.CV | Subtraction of aligned images is a means to assess changes in a wide variety
of clinical applications. In this paper we explore the information theoretical
origin of Mutual Information (MI), which is based on Shannon's entropy.However,
the interpretation of standard MI registration as a communication channel
suggests... |
0705.3644 | Subjective Information Measure and Rate Fidelity Theory | cs.IT cs.HC math.IT | Using fish-covering model, this paper intuitively explains how to extend
Hartley's information formula to the generalized information formula step by
step for measuring subjective information: metrical information (such as
conveyed by thermometers), sensory information (such as conveyed by color
vision), and semantic... |
0705.3669 | Structural Health Monitoring Using Neural Network Based Vibrational
System Identification | cs.NE cs.CV cs.SD | Composite fabrication technologies now provide the means for producing
high-strength, low-weight panels, plates, spars and other structural components
which use embedded fiber optic sensors and piezoelectric transducers. These
materials, often referred to as smart structures, make it possible to sense
internal charac... |
0705.3677 | Distributed Transmit Diversity in Relay Networks | cs.IT math.IT | We analyze fading relay networks, where a single-antenna source-destination
terminal pair communicates through a set of half-duplex single-antenna relays
using a two-hop protocol with linear processing at the relay level. A family of
relaying schemes is presented which achieves the entire optimal
diversity-multiplexi... |
0705.3693 | Morphing Ensemble Kalman Filters | math.DS cs.CV math.ST physics.ao-ph stat.ME stat.TH | A new type of ensemble filter is proposed, which combines an ensemble Kalman
filter (EnKF) with the ideas of morphing and registration from image
processing. This results in filters suitable for nonlinear problems whose
solutions exhibit moving coherent features, such as thin interfaces in wildfire
modeling. The ense... |
0705.3766 | On complexity of optimized crossover for binary representations | cs.NE cs.AI | We consider the computational complexity of producing the best possible
offspring in a crossover, given two solutions of the parents. The crossover
operators are studied on the class of Boolean linear programming problems,
where the Boolean vector of variables is used as the solution representation.
By means of effic... |
0705.3895 | Towards Understanding the Origin of Genetic Languages | q-bio.GN cs.IT math.IT physics.bio-ph quant-ph | Molecular biology is a nanotechnology that works--it has worked for billions
of years and in an amazing variety of circumstances. At its core is a system
for acquiring, processing and communicating information that is universal, from
viruses and bacteria to human beings. Advances in genetics and experience in
designi... |
0705.3949 | Translating a first-order modal language to relational algebra | cs.LO cs.DB | This paper is about Kripke structures that are inside a relational database
and queried with a modal language. At first the modal language that is used is
introduced, followed by a definition of the database and relational algebra.
Based on these definitions two things are presented: a mapping from components
of the ... |
0705.3990 | Interior Point Decoding for Linear Vector Channels | cs.IT math.IT | In this paper, a novel decoding algorithm for low-density parity-check (LDPC)
codes based on convex optimization is presented. The decoding algorithm, called
interior point decoding, is designed for linear vector channels. The linear
vector channels include many practically important channels such as inter
symbol int... |
0705.3992 | Average Stopping Set Weight Distribution of Redundant Random Matrix
Ensembles | cs.IT math.IT | In this paper, redundant random matrix ensembles (abbreviated as redundant
random ensembles) are defined and their stopping set (SS) weight distributions
are analyzed. A redundant random ensemble consists of a set of binary matrices
with linearly dependent rows. These linearly dependent rows (redundant rows)
signific... |
0705.3995 | On Undetected Error Probability of Binary Matrix Ensembles | cs.IT math.IT | In this paper, an analysis of the undetected error probability of ensembles
of binary matrices is presented. The ensemble called the Bernoulli ensemble
whose members are considered as matrices generated from i.i.d. Bernoulli source
is mainly considered here. The main contributions of this work are (i)
derivation of t... |
0705.4045 | The use of the logarithm of the variate in the calculation of
differential entropy among certain related statistical distributions | cs.IT math.IT | This paper demonstrates that basic statistics (mean, variance) of the
logarithm of the variate itself can be used in the calculation of differential
entropy among random variables known to be multiples and powers of a common
underlying variate. For the same set of distributions, the variance of the
differential self-... |
0705.4134 | The Battery-Discharge-Model: A Class of Stochastic Finite Automata to
Simulate Multidimensional Continued Fraction Expansion | cs.IT cs.CC cs.CR math.IT | We define an infinite stochastic state machine, the Battery-Discharge-Model
(BDM), which simulates the behaviour of linear and jump complexity of the
continued fraction expansion of multidimensional formal power series, a
relevant security measure in the cryptanalysis of stream ciphers.
We also obtain finite approx... |
0705.4138 | The Asymptotic Normalized Linear Complexity of Multisequences | cs.IT cs.CC cs.CR math.IT | We show that the asymptotic linear complexity of a multisequence a in
F_q^\infty that is I := liminf L_a(n)/n and S := limsup L_a(n)/n satisfy the
inequalities M/(M+1) <= S <= 1 and M(1-S) <= I <= 1-S/M, if all M sequences
have nonzero discrepancy infinitely often, and all pairs (I,S) satisfying these
conditions are ... |
0705.4302 | Truecluster matching | cs.AI | Cluster matching by permuting cluster labels is important in many clustering
contexts such as cluster validation and cluster ensemble techniques. The
classic approach is to minimize the euclidean distance between two cluster
solutions which induces inappropriate stability in certain settings. Therefore,
we present th... |
0705.4442 | World-set Decompositions: Expressiveness and Efficient Algorithms | cs.DB | Uncertain information is commonplace in real-world data management scenarios.
The ability to represent large sets of possible instances (worlds) while
supporting efficient storage and processing is an important challenge in this
context. The recent formalism of world-set decompositions (WSDs) provides a
space-efficie... |
0705.4485 | Mixed membership stochastic blockmodels | stat.ME cs.LG math.ST physics.soc-ph stat.ML stat.TH | Observations consisting of measurements on relationships for pairs of objects
arise in many settings, such as protein interaction and gene regulatory
networks, collections of author-recipient email, and social networks. Analyzing
such data with probabilisic models can be delicate because the simple
exchangeability as... |
0705.4566 | Loop corrections for message passing algorithms in continuous variable
models | cs.AI cs.LG | In this paper we derive the equations for Loop Corrected Belief Propagation
on a continuous variable Gaussian model. Using the exactness of the averages
for belief propagation for Gaussian models, a different way of obtaining the
covariances is found, based on Belief Propagation on cavity graphs. We discuss
the relat... |
0705.4584 | Modeling Epidemic Spread in Synthetic Populations - Virtual Plagues in
Massively Multiplayer Online Games | cs.CY cs.AI cs.MA | A virtual plague is a process in which a behavior-affecting property spreads
among characters in a Massively Multiplayer Online Game (MMOG). The MMOG
individuals constitute a synthetic population, and the game can be seen as a
form of interactive executable model for studying disease spread, albeit of a
very special ... |
0705.4606 | Dynamic User-Defined Similarity Searching in Semi-Structured Text
Retrieval | cs.IR cs.DS | Modern text retrieval systems often provide a similarity search utility, that
allows the user to find efficiently a fixed number k of documents in the data
set that are most similar to a given query (here a query is either a simple
sequence of keywords or the identifier of a full document found in previous
searches t... |
0705.4654 | Local Area Damage Detection in Composite Structures Using Piezoelectric
Transducers | cs.SD cs.CV | An integrated and automated smart structures approach for structural health
monitoring is presented, utilizing an array of piezoelectric transducers
attached to or embedded within the structure for both actuation and sensing.
The system actively interrogates the structure via broadband excitation of
multiple actuator... |
0705.4658 | Two sources are better than one for increasing the Kolmogorov complexity
of infinite sequences | cs.IT cs.CC math.IT | The randomness rate of an infinite binary sequence is characterized by the
sequence of ratios between the Kolmogorov complexity and the length of the
initial segments of the sequence. It is known that there is no uniform
effective procedure that transforms one input sequence into another sequence
with higher randomne... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.