id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0804.3120 | The Capacity Of Two Way Relay Channel | cs.IT math.IT | This paper investigates the capacity of a wireless two way relay channel in
which two end nodes exchange information via a relay node. The capacity is
defined in the information-theoretic sense as the maximum information exchange
rate between the two end nodes. We give an upper bound of the capacity by
applying the c... |
0804.3155 | Leveraging Coherent Distributed Space-Time Codes for Noncoherent
Communication in Relay Networks via Training | cs.IT math.IT | For point to point multiple input multiple output systems,
Dayal-Brehler-Varanasi have proved that training codes achieve the same
diversity order as that of the underlying coherent space time block code (STBC)
if a simple minimum mean squared error estimate of the channel formed using the
training part is employed f... |
0804.3160 | On the performance of approximate equilibria in congestion games | cs.GT cs.AI cs.NI | We study the performance of approximate Nash equilibria for linear congestion
games. We consider how much the price of anarchy worsens and how much the price
of stability improves as a function of the approximation factor $\epsilon$. We
give (almost) tight upper and lower bounds for both the price of anarchy and
the ... |
0804.3171 | Optimization Approach for Detecting the Critical Data on a Database | cs.DB | Through purposeful introduction of malicious transactions (tracking
transactions) into randomly select nodes of a (database) graph, soiled and
clean segments are identified. Soiled and clean measures corresponding those
segments are then computed. These measures are used to repose the problem of
critical database ele... |
0804.3215 | Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic | cs.IT math.IT | Packet-switching WDM ring networks with a hotspot transporting unicast,
multicast, and broadcast traffic are important components of high-speed
metropolitan area networks. For an arbitrary multicast fanout traffic model
with uniform, hotspot destination, and hotspot source packet traffic, we
analyze the maximum achie... |
0804.3234 | Technical Report - Automatic Contour Extraction from 2D Neuron Images | cs.CV q-bio.NC | This work describes a novel methodology for automatic contour extraction from
2D images of 3D neurons (e.g. camera lucida images and other types of 2D
microscopy). Most contour-based shape analysis methods can not be used to
characterize such cells because of overlaps between neuronal processes. The
proposed framewor... |
0804.3255 | Reconstruction of Multidimensional Signals from Irregular Noisy Samples | cs.IT math.IT | We focus on a multidimensional field with uncorrelated spectrum, and study
the quality of the reconstructed signal when the field samples are irregularly
spaced and affected by independent and identically distributed noise. More
specifically, we apply linear reconstruction techniques and take the mean
square error (M... |
0804.3259 | On Multiuser Power Region of Fading Multiple-Access Channel with
Multiple Antennas | cs.IT math.IT | This paper is concerned with the fading MIMO-MAC with multiple receive
antennas at the base station (BS) and multiple transmit antennas at each mobile
terminal (MT). Two multiple-access techniques are considered for scheduling
transmissions from each MT to the BS at the same frequency, which are
space-division multip... |
0804.3261 | Optimal Dynamic Resource Allocation for Multi-Antenna Broadcasting with
Heterogeneous Delay-Constrained Traffic | cs.IT math.IT | This paper is concerned with dynamic resource allocation in a cellular
wireless network with slow fading for support of data traffic having
heterogeneous transmission delay requirements. The multiple-input single-output
(MISO) fading broadcast channel (BC) is of interest where the base station (BS)
employs multiple t... |
0804.3269 | Phoneme recognition in TIMIT with BLSTM-CTC | cs.CL cs.NE | We compare the performance of a recurrent neural network with the best
results published so far on phoneme recognition in the TIMIT database. These
published results have been obtained with a combination of classifiers.
However, in this paper we apply a single recurrent neural network to the same
task. Our recurrent ... |
0804.3271 | Information Theoretic Operating Regimes of Large Wireless Networks | cs.IT math.IT | In analyzing the point-to-point wireless channel, insights about two
qualitatively different operating regimes--bandwidth- and power-limited--have
proven indispensable in the design of good communication schemes. In this
paper, we propose a new scaling law formulation for wireless networks that
allows us to develop a... |
0804.3361 | A New Approach to Automated Epileptic Diagnosis Using EEG and
Probabilistic Neural Network | cs.AI cs.CV | Epilepsy is one of the most common neurological disorders that greatly impair
patient' daily lives. Traditional epileptic diagnosis relies on tedious visual
screening by neurologists from lengthy EEG recording that requires the presence
of seizure (ictal) activities. Nowadays, there are many systems helping the
neuro... |
0804.3421 | Coalitions in Cooperative Wireless Networks | cs.GT cs.IT math.IT | Cooperation between rational users in wireless networks is studied using
coalitional game theory. Using the rate achieved by a user as its utility, it
is shown that the stable coalition structure, i.e., set of coalitions from
which users have no incentives to defect, depends on the manner in which the
rate gains are ... |
0804.3430 | Combining Beamforming and Space-Time Coding Using Noisy Quantized
Feedback | cs.IT math.IT | The goal of combining beamforming and space-time coding in this work is to
obtain full-diversity order and to provide additional received power (array
gain) compared to conventional space-time codes. In our system, we consider a
quasi-static fading environment and we incorporate both high-rate and low-rate
feedback c... |
0804.3439 | Information theoretic bounds for Compressed Sensing | cs.IT math.IT | In this paper we derive information theoretic performance bounds to sensing
and reconstruction of sparse phenomena from noisy projections. We consider two
settings: output noise models where the noise enters after the projection and
input noise models where the noise enters before the projection. We consider
two type... |
0804.3453 | Weighted Sum Rate Optimization for Cognitive Radio MIMO Broadcast
Channels | cs.IT math.IT | In this paper, we consider a cognitive radio (CR) network in which the
unlicensed (secondary) users are allowed to concurrently access the spectrum
allocated to the licensed (primary) users provided that their interference to
the primary users (PUs) satisfies certain constraints. We study a weighted sum
rate maximiza... |
0804.3459 | Towards a stable definition of Kolmogorov-Chaitin complexity | cs.IT cs.CC math.IT | Although information content is invariant up to an additive constant, the
range of possible additive constants applicable to programming languages is so
large that in practice it plays a major role in the actual evaluation of K(s),
the Kolmogorov-Chaitin complexity of a string s. Some attempts have been made
to arriv... |
0804.3500 | Natural pseudo-distance and optimal matching between reduced size
functions | cs.CG cs.CV | This paper studies the properties of a new lower bound for the natural
pseudo-distance. The natural pseudo-distance is a dissimilarity measure between
shapes, where a shape is viewed as a topological space endowed with a
real-valued continuous function. Measuring dissimilarity amounts to minimizing
the change in the ... |
0804.3507 | Sixteen New Linear Codes With Plotkin Sum | cs.IT math.IT | Sixteen new linear codes are presented: three of them improve the lower
bounds on the minimum distance for a linear code and the rest are an explicit
construction of unknown codes attaining the lower bounds on the minimum
distance. They are constructed using the Plotkin sum of two linear codes, also
called $(u|u+v)$ ... |
0804.3575 | Isotropic PCA and Affine-Invariant Clustering | cs.LG cs.CG | We present a new algorithm for clustering points in R^n. The key property of
the algorithm is that it is affine-invariant, i.e., it produces the same
partition for any affine transformation of the input. It has strong guarantees
when the input is drawn from a mixture model. For a mixture of two arbitrary
Gaussians, t... |
0804.3599 | Respect My Authority! HITS Without Hyperlinks, Utilizing Cluster-Based
Language Models | cs.IR cs.CL | We present an approach to improving the precision of an initial document
ranking wherein we utilize cluster information within a graph-based framework.
The main idea is to perform re-ranking based on centrality within bipartite
graphs of documents (on one side) and clusters (on the other side), on the
premise that th... |
0804.3671 | Constructions for Clumps Statistics | cs.DM cs.IR | We consider a component of the word statistics known as clump; starting from
a finite set of words, clumps are maximal overlapping sets of these
occurrences. This parameter has first been studied by Schbath with the aim of
counting the number of occurrences of words in random texts. Later work with
similar probabilis... |
0804.3678 | Causal inference using the algorithmic Markov condition | math.ST cs.IT math.IT stat.ML stat.TH | Inferring the causal structure that links n observables is usually based upon
detecting statistical dependences and choosing simple graphs that make the
joint measure Markovian. Here we argue why causal inference is also possible
when only single observations are present.
We develop a theory how to generate causal ... |
0804.3680 | Word-Based Text Compression | cs.IT math.IT | Today there are many universal compression algorithms, but in most cases is
for specific data better using specific algorithm - JPEG for images, MPEG for
movies, etc. For textual documents there are special methods based on PPM
algorithm or methods with non-character access, e.g. word-based compression. In
the past, ... |
0804.3817 | Multiple Random Oracles Are Better Than One | cs.LG | We study the problem of learning k-juntas given access to examples drawn from
a number of different product distributions. Thus we wish to learn a function f
: {-1,1}^n -> {-1,1} that depends on k (unknown) coordinates. While the best
known algorithms for the general problem of learning a k-junta require running
time... |
0804.3825 | On the inner and outer bounds for 2-receiver discrete memoryless
broadcast channels | cs.IT math.IT | We study the best known general inner bound[MAR '79] and outer bound[N-EG'07]
for the capacity region of the two user discrete memory less channel. We prove
that a seemingly stronger outer bound is identical to a weaker form of the
outer bound that was also presented in [N-EG'07]. We are able to further
express the b... |
0804.3862 | Image Processing in Optical Guidance for Autonomous Landing of Lunar
Probe | cs.RO | Because of the communication delay between earth and moon, the GNC technology
of lunar probe is becoming more important than ever. Current navigation
technology is not able to provide precise motion estimation for probe landing
control system Computer vision offers a new approach to solve this problem. In
this paper,... |
0804.3868 | Comparison of Various Methods for the Calculation of the Distance
Potential Field | physics.comp-ph cs.MA physics.soc-ph | The distance from a given position toward one or more destinations, exits,
and way points is a more or less important input variable in most models of
pedestrian dynamics. Except for the special case when there are no obstacles in
a concave scenario -- i.e. each position is visible from any other -- the
calculation o... |
0804.3874 | Hardware In The Loop Simulator in UAV Rapid Development Life Cycle | cs.RO | Field trial is very critical and high risk in autonomous UAV development life
cycle. Hardware in the loop (HIL) simulation is a computer simulation that has
the ability to simulate UAV flight characteristic, sensor modeling and actuator
modeling while communicating in real time with the UAV autopilot hardware. HIL
si... |
0804.3879 | Effects of Leaders Position and Shape on Aerodynamic Performances of V
Flight Formation | cs.RO | The influences of the leader in a group of V flight formation are dealt with.
The investigation is focused on the effect of its position and shape on
aerodynamics performances of a given V flight formation. Vortices generated the
wing tip of the leader moves downstream forming a pair of opposite rotating
line vortice... |
0804.3881 | Automated Flight Test and System Identification for Rotary Wing Small
Aerial Platform using Frequency Responses Analysis | cs.RO | This paper proposes an autopilot system that can be used to control the small
scale rotorcraft during the flight test for linear-frequency-domain system
identification. The input frequency swept is generated automatically as part of
the autopilot control command. Therefore the bandwidth coverage and consistency
of th... |
0804.3882 | Virtual Reality Simulation of Fire Fighting Robot Dynamic and Motion | cs.RO | This paper presents one approach in designing a Fire Fighting Robot which has
been contested annually in a robotic student competition in many countries
following the rules initiated at the Trinity College. The approach makes use of
computer simulation and animation in a virtual reality environment. In the
simulation... |
0804.3885 | Heading Lock Maneuver Testing of Autonomous Underwater Vehicle | cs.RO | In recent years, Autonomous Underwater Vehicle (UAV) research and development
at Bandung Institute of Technology in Indonesia has achieved the testing stage
in the field. This testing was still being classified as the early testing,
since some of the preliminary tests were carried out in the scale of the
laboratory. ... |
0804.3891 | Development of Architectures for Internet Telerobotics Systems | cs.RO | This paper presents our experience in developing and implementing Internet
telerobotics system. Internet telerobotics system refers to a robot system
controlled and monitored remotely through the Internet. A robot manipulator
with five degrees of freedom, called Mentor, is employed. Client-server
architecture is chos... |
0804.3894 | Unmanned Aerial Vehicle Instrumentation for Rapid Aerial Photo System | cs.RO | This research will proposed a new kind of relatively low cost autonomous UAV
that will enable farmers to make just in time mosaics of aerial photo of their
crop. These mosaics of aerial photo should be able to be produced with
relatively low cost and within the 24 hours of acquisition constraint. The
autonomous UAV w... |
0804.3895 | First Principle Approach to Modeling of Small Scale Helicopter | cs.RO | The establishment of global helicopter linear model is very precious and
useful for the design of the linear control laws, since it is never afforded in
the published literatures. In the first principle approach, the mathematical
model was developed using basic helicopter theory accounting for particular
characterist... |
0804.3897 | Optimal Tracking Controller Design for a Small Scale Helicopter | cs.RO | A model helicopter is more difficult to control than its full scale
counterparts. This is due to its greater sensitivity to control inputs and
disturbances as well as higher bandwidth of dynamics. This works is focused on
designing practical tracking controller for a small scale helicopter following
predefined trajec... |
0804.4042 | Uncorrectable Errors of Weight Half the Minimum Distance for Binary
Linear Codes | cs.IT math.IT | A lower bound on the number of uncorrectable errors of weight half the
minimum distance is derived for binary linear codes satisfying some condition.
The condition is satisfied by some primitive BCH codes, extended primitive BCH
codes, Reed-Muller codes, and random linear codes. The bound asymptotically
coincides wit... |
0804.4071 | Logic Mining Using Neural Networks | cs.LO cs.NE | Knowledge could be gained from experts, specialists in the area of interest,
or it can be gained by induction from sets of data. Automatic induction of
knowledge from data sets, usually stored in large databases, is called data
mining. Data mining methods are important in the management of complex systems.
There are ... |
0804.4073 | Grainy Numbers | cs.LO cs.AI | Grainy numbers are defined as tuples of bits. They form a lattice where the
meet and the join operations are an addition and a multiplication. They may be
substituted for the real numbers in the definition of fuzzy sets. The aim is to
propose an alternative negation for the complement that we'll call supplement.
|
0804.4075 | Logic Learning in Hopfield Networks | cs.LO cs.NE | Synaptic weights for neurons in logic programming can be calculated either by
using Hebbian learning or by Wan Abdullah's method. In other words, Hebbian
learning for governing events corresponding to some respective program clauses
is equivalent with learning using Wan Abdullah's method for the same respective
progr... |
0804.4187 | On the Asymptotic Behavior of Selfish Transmitters Sharing a Common
Channel | cs.IT cs.GT math.IT | This paper analyzes the asymptotic behavior of a multiple-access network
comprising a large number of selfish transmitters competing for access to a
common wireless communication channel, and having different utility functions
for determining their strategies. A necessary and sufficient condition is given
for the tot... |
0804.4194 | Asymptotic Bound on Binary Self-Orthogonal Codes | cs.IT math.IT | We present two constructions for binary self-orthogonal codes. It turns out
that our constructions yield a constructive bound on binary self-orthogonal
codes. In particular, when the information rate R=1/2, by our constructive
lower bound, the relative minimum distance \delta\approx 0.0595 (for GV bound,
\delta\appro... |
0804.4195 | Multi-Antenna Gaussian Broadcast Channels with Confidential Messages | cs.IT cs.CR math.IT | In wireless data networks, communication is particularly susceptible to
eavesdropping due to its broadcast nature. Security and privacy systems have
become critical for wireless providers and enterprise networks. This paper
considers the problem of secret communication over a Gaussian broadcast
channel, where a multi... |
0804.4204 | Distance Distributions in Finite Uniformly Random Networks: Theory and
Applications | cs.IT math.IT | In wireless networks, the knowledge of nodal distances is essential for
several areas such as system configuration, performance analysis and protocol
design. In order to evaluate distance distributions in random networks, the
underlying nodal arrangement is almost universally taken to be an infinite
Poisson point pro... |
0804.4237 | Explaining the Logical Nature of Electrical Solitons in Neural Circuits | cs.NE q-bio.NC | Neurons are modeled electrically based on ferroelectric membranes thin enough
to permit charge transfer, conjectured to be the tunneling result of thermally
energetic ions and random electrons. These membranes can be triggered to
produce electrical solitons, the main signals for brain associative memory and
logical p... |
0804.4239 | Capacity Definitions for General Channels with Receiver Side Information | cs.IT math.IT | We consider three capacity definitions for general channels with channel side
information at the receiver, where the channel is modeled as a sequence of
finite dimensional conditional distributions not necessarily stationary,
ergodic, or information stable. The {\em Shannon capacity} is the highest rate
asymptoticall... |
0804.4255 | Expected Message Delivery Time for Small-world Networks in the Continuum
Limit | cs.IT math.IT | Small-world networks are networks in which the graphical diameter of the
network is as small as the diameter of random graphs but whose nodes are highly
clustered when compared with the ones in a random graph. Examples of
small-world networks abound in sociology, biology, neuroscience and physics as
well as in human-... |
0804.4284 | Network Coding Capacity of Random Wireless Networks under a SINR Model | cs.IT cs.NI math.IT | Previous work on network coding capacity for random wired and wireless
networks have focused on the case where the capacities of links in the network
are independent. In this paper, we consider a more realistic model, where
wireless networks are modelled by random geometric graphs with interference and
noise. In this... |
0804.4298 | Wireless Erasure Networks with Feedback | cs.IT math.IT | Consider a lossy packet network of queues, communicating over a wireless
medium. This paper presents a throughput-optimal transmission strategy for a
unicast network when feedback is available, which has the following advantages:
It requires a very limited form of acknowledgment feedback. It is completely
distributed... |
0804.4305 | An Algorigtm for Singular Value Decomposition of Matrices in Blocks | math.NA cs.IR math.AC | Two methods to decompose block matrices analogous to Singular Matrix
Decomposition are proposed, one yielding the so called economy decomposition,
and other yielding the full decomposition. This method is devised to avoid
handling matrices bigger than the biggest blocks, so it is particularly
appropriate when a limit... |
0804.4316 | Asymmetric Quantum LDPC Codes | quant-ph cs.IT math.IT | Recently, quantum error-correcting codes were proposed that capitalize on the
fact that many physical error models lead to a significant asymmetry between
the probabilities for bit flip and phase flip errors. An example for a channel
which exhibits such asymmetry is the combined amplitude damping and dephasing
channe... |
0804.4336 | Counterflow Extension for the F.A.S.T.-Model | cs.MA physics.comp-ph | The F.A.S.T. (Floor field and Agent based Simulation Tool) model is a
microscopic model of pedestrian dynamics, which is discrete in space and time.
It was developed in a number of more or less consecutive steps from a simple CA
model. This contribution is a summary of a study on an extension of the
F.A.S.T-model for... |
0804.4384 | Linear-Programming Decoding of Nonbinary Linear Codes | cs.IT math.IT | A framework for linear-programming (LP) decoding of nonbinary linear codes
over rings is developed. This framework facilitates linear-programming based
reception for coded modulation systems which use direct modulation mapping of
coded symbols. It is proved that the resulting LP decoder has the
'maximum-likelihood ce... |
0804.4391 | A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function | cs.IT math.IT | A lower bound on the minimum mean-squared error (MSE) in a Bayesian
estimation problem is proposed in this paper. This bound utilizes a well-known
connection to the deterministic estimation setting. Using the prior
distribution, the bias function which minimizes the Cramer-Rao bound can be
determined, resulting in a ... |
0804.4395 | Development of a peristaltic micropump for bio-medical applications
based on mini LIPCA | cs.RO | This paper presents the design, fabrication, and experimental
characterization of a peristaltic micropump. The micropump is composed of two
layers fabricated from polydimethylsiloxane (PDMS) material. The first layer
has a rectangular channel and two valve seals. Three rectangular mini
lightweight piezo-composite act... |
0804.4451 | Dependence Structure Estimation via Copula | cs.LG cs.IR stat.ME | Dependence strucuture estimation is one of the important problems in machine
learning domain and has many applications in different scientific areas. In
this paper, a theoretical framework for such estimation based on copula and
copula entropy -- the probabilistic theory of representation and measurement of
statistic... |
0804.4455 | On the Capacity Bounds of Undirected Networks | cs.IT math.IT | In this work we improve on the bounds presented by Li&Li for network coding
gain in the undirected case. A tightened bound for the undirected multicast
problem with three terminals is derived. An interesting result shows that with
fractional routing, routing throughput can achieve at least 75% of the coding
throughpu... |
0804.4466 | Free Distance Bounds for Protograph-Based Regular LDPC Convolutional
Codes | cs.IT math.IT | In this paper asymptotic methods are used to form lower bounds on the free
distance to constraint length ratio of several ensembles of regular,
asymptotically good, protograph-based LDPC convolutional codes. In particular,
we show that the free distance to constraint length ratio of the regular LDPC
convolutional cod... |
0804.4489 | Generalized Degrees of Freedom of the Symmetric Gaussian $K$ User
Interference Channel | cs.IT math.IT | We characterize the generalized degrees of freedom of the $K$ user symmetric
Gaussian interference channel where all desired links have the same
signal-to-noise ratio (SNR) and all undesired links carrying interference have
the same interference-to-noise ratio, ${INR}={SNR}^\alpha$. We find that the
number of general... |
0804.4517 | A multivariate generalization of Costa's entropy power inequality | cs.IT math.IT | A simple multivariate version of Costa's entropy power inequality is proved.
In particular, it is shown that if independent white Gaussian noise is added to
an arbitrary multivariate signal, the entropy power of the resulting random
variable is a multidimensional concave function of the individual variances of
the co... |
0804.4584 | Feature Unification in TAG Derivation Trees | cs.CL | The derivation trees of a tree adjoining grammar provide a first insight into
the sentence semantics, and are thus prime targets for generation systems. We
define a formalism, feature-based regular tree grammars, and a translation from
feature based tree adjoining grammars into this new formalism. The translation
pre... |
0804.4622 | Fast Density Codes for Image Data | cs.NE | Recently, a new method for encoding data sets in the form of "Density Codes"
was proposed in the literature (Courrieu, 2006). This method allows to compare
sets of points belonging to every multidimensional space, and to build shape
spaces invariant to a wide variety of affine and non-affine transformations.
However,... |
0804.4662 | Rateless Coding for MIMO Block Fading Channels | cs.IT math.IT | In this paper the performance limits and design principles of rateless codes
over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is
used to analyze the system performance for all possible transmission rates. It
is revealed from the analysis that the design of such rateless codes follows
the de... |
0804.4682 | Introduction to Relational Networks for Classification | cs.LG | The use of computational intelligence techniques for classification has been
used in numerous applications. This paper compares the use of a Multi Layer
Perceptron Neural Network and a new Relational Network on classifying the HIV
status of women at ante-natal clinics. The paper discusses the architecture of
the rela... |
0804.4701 | Superposition-Coded Concurrent Decode-and-Forward Relaying | cs.IT math.IT | In this paper, a superposition-coded concurrent decode-and-forward (DF)
relaying protocol is presented. A specific scenario, where the inter-relay
channel is sufficiently strong, is considered. Assuming perfect source-relay
transmissions, the proposed scheme further improves the diversity performance
of previously pr... |
0804.4714 | Network Structure and Dynamics, and Emergence of Robustness by
Stabilizing Selection in an Artificial Genome | q-bio.MN cond-mat.dis-nn cs.NE q-bio.GN q-bio.PE | Genetic regulation is a key component in development, but a clear
understanding of the structure and dynamics of genetic networks is not yet at
hand. In this work we investigate these properties within an artificial genome
model originally introduced by Reil. We analyze statistical properties of
randomly generated ge... |
0804.4717 | Intelligent Unmanned Explorer for Deep Space Exploration | cs.RO | asteroids or comets have received remarkable attention in the world. In small
body explorations, especially, detailed in-situ surface exploration by tiny
rover is one of effective and fruitful means and is expected to make strong
contributions towards scientific studies. JAXA ISAS is promoting MUSES C
mission, which ... |
0804.4740 | An Affine-invariant Time-dependent Triangulation of Spatio-temporal Data | cs.CG cs.DB | In the geometric data model for spatio-temporal data, introduced by Chomicki
and Revesz, spatio-temporal data are modelled as a finite collection of
triangles that are transformed by time-dependent affinities of the plane. To
facilitate querying and animation of spatio-temporal data, we present a normal
form for data... |
0804.4741 | The Effect of Structural Diversity of an Ensemble of Classifiers on
Classification Accuracy | cs.LG | This paper aims to showcase the measure of structural diversity of an
ensemble of 9 classifiers and then map a relationship between this structural
diversity and accuracy. The structural diversity was induced by having
different architectures or structures of the classifiers The Genetical
Algorithms (GA) were used to... |
0804.4749 | Study of improving nano-contouring performance by employing
cross-coupling controller | cs.RO | For the tracking stage path planning, we design a two-axis cross-coupling
control system which uses the PI controller to compensate the contour error
between axes. In this paper, the stage adoptive is designed by our laboratory
(Precision Machine Center of National Formosa University). The cross-coupling
controller c... |
0804.4750 | The Numerical Control Design for a Pair of Dubins Vehicles | cs.RO | In this paper, a model of a pair of Dubins vehicles is considered. The
vehicles move from an initial position and orientation to final position and
orientation. A long the motion, the two vehicles are not allowed to collide
however the two vehicles cant to far each other. The optimal control of the
vehicle is found u... |
0804.4752 | Simulation of Dynamic Yaw Stability Derivatives of a Bird Using CFD | cs.RO | Simulation results on dynamic yaw stability derivatives of a gull bird by
means of computational fluid dynamics are presented. Two different kinds of
motions are used for determining the dynamic yaw stability derivatives CNr and
CNbeta . Concerning the first one, simple lateral translation and yaw rotary
motions in y... |
0804.4753 | Wavelet Based Iterative Learning Control with Fuzzy PD Feedback for
Position Tracking of A Pneumatic Servo System | cs.RO | In this paper, a wavelet-based iterative learning control (WILC) scheme with
Fuzzy PD feedback is presented for a pneumatic control system with nonsmooth
nonlinearities and uncertain parameters. The wavelet transform is employed to
extract the learnable dynamics from measured output signal before it can be
used to up... |
0804.4754 | Positive Real Synthesis of Networked Control System An LMI Approach | cs.RO | This paper presents the positive real analysis and synthesis for Networked
Control Systems (NCS) in discrete time. Based on the definition of passivity,
the sufficient condition of NCS is given by stochastic Lyapunov functional. The
controller via state feedback is designed to guarantee the stability of NCS and
close... |
0804.4757 | Analysis of Stability, Response and LQR Controller Design of a Small
Scale Helicopter Dynamics | cs.RO | This paper presents how to use feedback controller with helicopter dynamics
state space model. A simplified analysis is presented for controller design
using LQR of small scale helicopters for axial and forward flights. Our
approach is simple and gives the basic understanding about how to develop
controller for solvi... |
0804.4759 | Design and control of dynamical quantum processes in ortho para H2
conversion on surfaces | cs.RO | We present here a novel, cost-effective method for increasing and controlling
the ortho para H2 (o p H2) conversion yield. First, we invoke two processes
derived from fundamental, surface science insights, based on the effect of
molecular orientation on the hydrogen solid surface reaction, i.e., dynamical
quantum fil... |
0804.4774 | A Projection Method for Derivation of Non-Shannon-Type Information
Inequalities | cs.IT math.IT | In 1998, Zhang and Yeung found the first unconditional non-Shannon-type
information inequality. Recently, Dougherty, Freiling and Zeger gave six new
unconditional non-Shannon-type information inequalities. This work generalizes
their work and provides a method to systematically derive non-Shannon-type
information ine... |
0804.4799 | A Few More Quadratic APN Functions | cs.IT math.IT | We present two infinite families of APN functions where the degree of the
field is divisible by 3 but not 9. Our families contain two already known
families as special cases. We also discuss the inequivalence proof (by
computation) which shows that these functions are new.
|
0804.4808 | Solving Time of Least Square Systems in Sigma-Pi Unit Networks | cs.NE | The solving of least square systems is a useful operation in
neurocomputational modeling of learning, pattern matching, and pattern
recognition. In these last two cases, the solution must be obtained on-line,
thus the time required to solve a system in a plausible neural architecture is
critical. This paper presents ... |
0804.4809 | Fast Computation of Moore-Penrose Inverse Matrices | cs.NE | Many neural learning algorithms require to solve large least square systems
in order to obtain synaptic weights. Moore-Penrose inverse matrices allow for
solving such systems, even with rank deficiency, and they provide minimum-norm
vectors of synaptic weights, which contribute to the regularization of the
input-outp... |
0804.4866 | Sum-Capacity of Ergodic Fading Interference and Compound Multiaccess
Channels | cs.IT math.IT | The problem of resource allocation is studied for two-sender two-receiver
fading Gaussian interference channels (IFCs) and compound multiaccess channels
(C-MACs). The senders in an IFC communicate with their own receiver (unicast)
while those in a C-MAC communicate with both receivers (multicast). The
instantaneous f... |
0804.4885 | SimDialog: A visual game dialog editor | cs.HC cs.AI | SimDialog is a visual editor for dialog in computer games. This paper
presents the design of SimDialog, illustrating how script writers and
non-programmers can easily create dialog for video games with complex branching
structures and dynamic response characteristics. The system creates dialog as a
directed graph. Th... |
0804.4898 | A Quadratic Loss Multi-Class SVM | cs.LG | Using a support vector machine requires to set two types of hyperparameters:
the soft margin parameter C and the parameters of the kernel. To perform this
model selection task, the method of choice is cross-validation. Its
leave-one-out variant is known to produce an estimator of the generalization
error which is alm... |
0805.0012 | Joint Physical Layer Coding and Network Coding for Bi-Directional
Relaying | cs.IT math.IT | We consider the problem of two transmitters wishing to exchange information
through a relay in the middle. The channels between the transmitters and the
relay are assumed to be synchronized, average power constrained additive white
Gaussian noise channels with a real input with signal-to-noise ratio (SNR) of
snr. An ... |
0805.0034 | Diversity Order Gain with Noisy Feedback in Multiple Access Channels | cs.IT math.IT | In this paper, we study the effect of feedback channel noise on the
diversity-multiplexing tradeoff in multiuser MIMO systems using quantized
feedback, where each user has m transmit antennas and the base-station receiver
has n antennas. We derive an achievable tradeoff and use it to show that in
SNR-symmetric channe... |
0805.0050 | On the k-pairs problem | cs.IT math.IT | We consider network coding rates for directed and undirected $k$-pairs
networks. For directed networks, meagerness is known to be an upper bound on
network coding rates. We show that network coding rate can be $\Theta(|V|)$
multiplicative factor smaller than meagerness. For the undirected case, we show
some progress ... |
0805.0051 | Communicating the sum of sources over a network | cs.IT math.IT | We consider a network (that is capable of network coding) with a set of
sources and terminals, where each terminal is interested in recovering the sum
of the sources. Considering directed acyclic graphs with unit capacity edges
and independent, unit-entropy sources, we show the rate region when (a) there
are two sour... |
0805.0053 | Particle Filtering for Large Dimensional State Spaces with Multimodal
Observation Likelihoods | cs.IT math.IT math.ST stat.ME stat.TH | We study efficient importance sampling techniques for particle filtering (PF)
when either (a) the observation likelihood (OL) is frequently multimodal or
heavy-tailed, or (b) the state space dimension is large or both. When the OL is
multimodal, but the state transition pdf (STP) is narrow enough, the optimal
importa... |
0805.0065 | Communication Requirements for Generating Correlated Random Variables | cs.IT cs.GT math.IT math.PR | Two familiar notions of correlation are rediscovered as extreme operating
points for simulating a discrete memoryless channel, in which a channel output
is generated based only on a description of the channel input. Wyner's "common
information" coincides with the minimum description rate needed. However, when
common ... |
0805.0092 | Cellular Systems with Full-Duplex Compress-and-Forward Relaying and
Cooperative Base Stations | cs.IT math.IT | In this paper the advantages provided by multicell processing of signals
transmitted by mobile terminals (MTs) which are received via dedicated relay
terminals (RTs) are studied. It is assumed that each RT is capable of
full-duplex operation and receives the transmission of adjacent relay
terminals. Focusing on intra... |
0805.0108 | The Gaussian Wiretap Channel with a Helping Interferer | cs.IT cs.CR math.IT | Due to the broadcast nature of the wireless medium, wireless communication is
susceptible to adversarial eavesdropping. This paper describes how
eavesdropping can potentially be defeated by exploiting the superposition
nature of the wireless medium. A Gaussian wire-tap channel with a helping
interferer (WTC-HI) is co... |
0805.0120 | Nonnegative Matrix Factorization via Rank-One Downdate | cs.IR cs.NA | Nonnegative matrix factorization (NMF) was popularized as a tool for data
mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with
nonnegative entries by a product of two low-rank matrices, also with
nonnegative entries. We propose an algorithm called rank-one downdate (R1D) for
computing a NMF that... |
0805.0129 | On some entropy functionals derived from R\'enyi information divergence | cs.IT cond-mat.other math.IT | We consider the maximum entropy problems associated with R\'enyi $Q$-entropy,
subject to two kinds of constraints on expected values. The constraints
considered are a constraint on the standard expectation, and a constraint on
the generalized expectation as encountered in nonextensive statistics. The
optimum maximum ... |
0805.0131 | Diversity-Multiplexing Tradeoff in Selective-Fading Multiple-Access MIMO
Channels | cs.IT math.IT | We establish the optimal diversity-multiplexing (DM) tradeoff of coherent
selective-fading multiple-access multiple-input multiple-output (MIMO) channels
and provide corresponding code design criteria. As a byproduct, on the
conceptual level, we find an interesting relation between the DM tradeoff
framework and the n... |
0805.0149 | On Recovery of Sparse Signals via $\ell_1$ Minimization | cs.LG | This article considers constrained $\ell_1$ minimization methods for the
recovery of high dimensional sparse signals in three settings: noiseless,
bounded error and Gaussian noise. A unified and elementary treatment is given
in these noise settings for two $\ell_1$ minimization methods: the Dantzig
selector and $\ell... |
0805.0154 | The Tsallis entropy and the Shannon entropy of a universal probability | cs.IT cs.CC math.IT | We study the properties of Tsallis entropy and Shannon entropy from the point
of view of algorithmic randomness. In algorithmic information theory, there are
two equivalent ways to define the program-size complexity K(s) of a given
finite binary string s. In the standard way, K(s) is defined as the length of
the shor... |
0805.0173 | A Computer Search for N1L-Configurations | cs.IT math.IT | In an earlier paper the author defined N1L configurations, and stated a
conjecture concerning them which would lead to an improvement by a constant
factor to the sphere-packing bound for linear double error correcting codes.
Here a computer search is presented, in an effort to gather evidence on the
conjecture.
|
0805.0184 | Information, Energy and Density for Ad Hoc Sensor Networks over
Correlated Random Fields: Large Deviations Analysis | cs.IT math.IT | Using large deviations results that characterize the amount of information
per node on a two-dimensional (2-D) lattice, asymptotic behavior of a sensor
network deployed over a correlated random field for statistical inference is
investigated. Under a 2-D hidden Gauss-Markov random field model with symmetric
first ord... |
0805.0192 | Specification of an extensible and portable file format for electronic
structure and crystallographic data | cs.DL cond-mat.mtrl-sci cs.DB | In order to allow different software applications, in constant evolution, to
interact and exchange data, flexible file formats are needed. A file format
specification for different types of content has been elaborated to allow
communication of data for the software developed within the European Network of
Excellence ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.