id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0803.1025 | Asymptotic Concentration Behaviors of Linear Combinations of Weight
Distributions on Random Linear Code Ensemble | cs.IT math.IT | Asymptotic concentration behaviors of linear combinations of weight
distributions on the random linear code ensemble are presented. Many important
properties of a binary linear code can be expressed as the form of a linear
combination of weight distributions such as number of codewords, undetected
error probability a... |
0803.1087 | The Future of Scientific Simulations: from Artificial Life to Artificial
Cosmogenesis | cs.AI | This philosophical paper explores the relation between modern scientific
simulations and the future of the universe. We argue that a simulation of an
entire universe will result from future scientific activity. This requires us
to tackle the challenge of simulating open-ended evolution at all levels in a
single simul... |
0803.1090 | Self-Corrected Min-Sum decoding of LDPC codes | cs.IT math.IT | In this paper we propose a very simple but powerful self-correction method
for the Min-Sum decoding of LPDC codes. Unlike other correction methods known
in the literature, our method does not try to correct the check node processing
approximation, but it modifies the variable node processing by erasing
unreliable mes... |
0803.1094 | Min-Max decoding for non binary LDPC codes | cs.IT math.IT | Iterative decoding of non-binary LDPC codes is currently performed using
either the Sum-Product or the Min-Sum algorithms or slightly different versions
of them. In this paper, several low-complexity quasi-optimal iterative
algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is
one of them an... |
0803.1096 | Algebraic-geometric codes from vector bundles and their decoding | cs.IT math.IT | Algebraic-geometric codes can be constructed by evaluating a certain set of
functions on a set of distinct rational points of an algebraic curve. The set
of functions that are evaluated is the linear space of a given divisor or,
equivalently, the set of section of a given line bundle. Using arbitrary rank
vector bund... |
0803.1120 | The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple
Access Channel | cs.IT math.IT | For general memoryless systems, the typical information theoretic solution -
when exists - has a "single-letter" form. This reflects the fact that optimum
performance can be approached by a random code (or a random binning scheme),
generated using independent and identically distributed copies of some
single-letter d... |
0803.1144 | Asymptotic Capacity and Optimal Precoding Strategy of Multi-Level
Precode & Forward in Correlated Channels | cs.IT math.IT | We analyze a multi-level MIMO relaying system where a multiple-antenna
transmitter sends data to a multipleantenna receiver through several relay
levels, also equipped with multiple antennas. Assuming correlated fading in
each hop, each relay receives a faded version of the signal transmitted by the
previous level, p... |
0803.1195 | Secure Lossless Compression with Side Information | cs.IT math.IT | Secure data compression in the presence of side information at both a
legitimate receiver and an eavesdropper is explored. A noise-free, limited rate
link between the source and the receiver, whose output can be perfectly
observed by the eavesdropper, is assumed. As opposed to the wiretap channel
model, in which secu... |
0803.1207 | Serious Flaws in Korf et al.'s Analysis on Time Complexity of A* | cs.AI | This paper has been withdrawn.
|
0803.1221 | Non-Singular Assembly-mode Changing Motions for 3-RPR Parallel
Manipulators | cs.RO physics.class-ph | When moving from one arbitrary location at another, a parallel manipulator
may change its assembly-mode without crossing a singularity. Because the
non-singular change of assembly-mode cannot be simply detected, the actual
assembly-mode during motion is difficult to track. This paper proposes a global
explanatory app... |
0803.1227 | Linear programming bounds for unitary space time codes | cs.IT math.IT | The linear programming method is applied to the space $\U_n(\C)$ of unitary
matrices in order to obtain bounds for codes relative to the diversity sum and
the diversity product. Theoretical and numerical results improving previously
known bounds are derived.
|
0803.1323 | A Game Theoretic Framework for Decentralized Power Allocation in IDMA
Systems | cs.IT cs.GT math.IT | In this contribution we present a decentralized power allocation algorithm
for the uplink interleave division multiple access (IDMA) channel. Within the
proposed optimal strategy for power allocation, each user aims at selfishly
maximizing its own utility function. An iterative chip by chip (CBC) decoder at
the recei... |
0803.1443 | Lexical growth, entropy and the benefits of networking | cs.IT math.IT q-bio.QM | If each node of an idealized network has an equal capacity to efficiently
exchange benefits, then the network's capacity to use energy is scaled by the
average amount of energy required to connect any two of its nodes. The scaling
factor equals \textit{e}, and the network's entropy is $\ln(n)$. Networking
emerges in ... |
0803.1445 | Distributed Joint Source-Channel Coding on a Multiple Access Channel
with Side Information | cs.IT math.IT | We consider the problem of transmission of several distributed sources over a
multiple access channel (MAC) with side information at the sources and the
decoder. Source-channel separation does not hold for this channel. Sufficient
conditions are provided for transmission of sources with a given distortion.
The source... |
0803.1454 | Tight Bounds on the Capacity of Binary Input random CDMA Systems | cs.IT math.IT | We consider multiple access communication on a binary input additive white
Gaussian noise channel using randomly spread code division. For a general class
of symmetric distributions for spreading coefficients, in the limit of a large
number of users, we prove an upper bound on the capacity, which matches a
formula th... |
0803.1457 | Hybrid Reasoning and the Future of Iconic Representations | cs.AI cs.LO | We give a brief overview of the main characteristics of diagrammatic
reasoning, analyze a case of human reasoning in a mastermind game, and explain
why hybrid representation systems (HRS) are particularly attractive and
promising for Artificial General Intelligence and Computer Science in general.
|
0803.1511 | The Capacity Region of the Degraded Finite-State Broadcast Channel | cs.IT math.IT | We consider the discrete, time-varying broadcast channel with memory under
the assumption that the channel states belong to a set of finite cardinality.
We first define the physically degraded finite-state broadcast channel for
which we derive the capacity region. We then define the stochastically degraded
finite-sta... |
0803.1555 | Privacy Preserving ID3 over Horizontally, Vertically and Grid
Partitioned Data | cs.DB cs.LG | We consider privacy preserving decision tree induction via ID3 in the case
where the training data is horizontally or vertically distributed. Furthermore,
we consider the same problem in the case where the data is both horizontally
and vertically distributed, a situation we refer to as grid partitioned data.
We give ... |
0803.1568 | Dempster-Shafer for Anomaly Detection | cs.NE cs.AI cs.CR | In this paper, we implement an anomaly detection system using the
Dempster-Shafer method. Using two standard benchmark problems we show that by
combining multiple signals it is possible to achieve better results than by
using a single signal. We further show that by applying this approach to a
real-world email datase... |
0803.1576 | Simulation Optimization of the Crossdock Door Assignment Problem | cs.NE cs.CE | The purpose of this report is to present the Crossdock Door Assignment
Problem, which involves assigning destinations to outbound dock doors of
Crossdock centres such that travel distance by material handling equipment is
minimized. We propose a two fold solution; simulation and optimization of the
simulation model s... |
0803.1586 | Spatio-activity based object detection | cs.CV | We present the SAMMI lightweight object detection method which has a high
level of accuracy and robustness, and which is able to operate in an
environment with a large number of cameras. Background modeling is based on DCT
coefficients provided by cameras. Foreground detection uses similarity in
temporal characterist... |
0803.1596 | Using Intelligent Agents to understand organisational behaviour | cs.NE cs.MA | This paper introduces two ongoing research projects which seek to apply
computer modelling techniques in order to simulate human behaviour within
organisations. Previous research in other disciplines has suggested that
complex social behaviours are governed by relatively simple rules which, when
identified, can be us... |
0803.1598 | A Multi-Agent Simulation of Retail Management Practices | cs.NE | We apply Agent-Based Modeling and Simulation (ABMS) to investigate a set of
problems in a retail context. Specifically, we are working to understand the
relationship between human resource management practices and retail
productivity. Despite the fact we are working within a relatively novel and
complex domain, it is... |
0803.1600 | Understanding Retail Productivity by Simulating Management Practise | cs.NE | Intelligent agents offer a new and exciting way of understanding the world of
work. In this paper we apply agent-based modeling and simulation to investigate
a set of problems in a retail context. Specifically, we are working to
understand the relationship between human resource management practices and
retail produc... |
0803.1604 | Using Intelligent Agents to Understand Management Practices and Retail
Productivity | cs.NE cs.CE cs.MA | Intelligent agents offer a new and exciting way of understanding the world of
work. In this paper we apply agent-based modeling and simulation to investigate
a set of problems in a retail context. Specifically, we are working to
understand the relationship between human resource management practices and
retail produc... |
0803.1621 | An Agent-Based Simulation of In-Store Customer Experiences | cs.NE cs.CE cs.MA | Agent-based modelling and simulation offers a new and exciting way of
understanding the world of work. In this paper we describe the development of
an agent-based simulation model, designed to help to understand the
relationship between human resource management practices and retail
productivity. We report on the cur... |
0803.1626 | Genetic-Algorithm Seeding Of Idiotypic Networks For Mobile-Robot
Navigation | cs.NE cs.RO | Robot-control designers have begun to exploit the properties of the human
immune system in order to produce dynamic systems that can adapt to complex,
varying, real-world tasks. Jernes idiotypic-network theory has proved the most
popular artificial-immune-system (AIS) method for incorporation into
behaviour-based rob... |
0803.1695 | Use of self-correlation metrics for evaluation of information properties
of binary strings | cs.IT math.IT | It is demonstrated that appropriately chosen computable metrics based on
self-correlation properties provide a degree of determinism sufficient to
segregate binary strings by level of information content.
|
0803.1716 | Citation Counting, Citation Ranking, and h-Index of Human-Computer
Interaction Researchers: A Comparison between Scopus and Web of Science | cs.HC cs.IR | This study examines the differences between Scopus and Web of Science in the
citation counting, citation ranking, and h-index of 22 top human-computer
interaction (HCI) researchers from EQUATOR--a large British Interdisciplinary
Research Collaboration project. Results indicate that Scopus provides
significantly more ... |
0803.1728 | Investigating a Hybrid Metaheuristic For Job Shop Rescheduling | cs.NE cs.CE | Previous research has shown that artificial immune systems can be used to
produce robust schedules in a manufacturing environment. The main goal is to
develop building blocks (antibodies) of partial schedules that can be used to
construct backup solutions (antigens) when disturbances occur during
production. The buil... |
0803.1733 | Degrees of Freedom of the MIMO Interference Channel with Cooperation and
Cognition | cs.IT math.IT | In this paper, we explore the benefits, in the sense of total (sum rate)
degrees of freedom (DOF), of cooperation and cognitive message sharing for a
two-user multiple-input-multiple-output (MIMO) Gaussian interference channel
with $M_1$, $M_2$ antennas at transmitters and $N_1$, $N_2$ antennas at
receivers. For the ... |
0803.1807 | Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC | cs.IT math.IT | In this paper we investigate the decoding of parallel turbo codes over the
binary erasure channel suited for upper-layer error correction. The proposed
algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the
first symbols are received. This algorithm compares with the iterative decoding
of code... |
0803.1926 | Improved evolutionary generation of XSLT stylesheets | cs.NE cs.AI | This paper introduces a procedure based on genetic programming to evolve XSLT
programs (usually called stylesheets or logicsheets). XSLT is a general
purpose, document-oriented functional language, generally used to transform XML
documents (or, in general, solve any problem that can be coded as an XML
document). The ... |
0803.1945 | Resampling and requantization of band-limited Gaussian stochastic
signals with flat power spectrum | cs.IT math.IT | A theoretical analysis, aimed at characterizing the degradation induced by
the resampling and requantization processes applied to band-limited Gaussian
signals with flat power spectrum, available through their digitized samples, is
presented. The analysis provides an efficient algorithm for computing the
complete {jo... |
0803.1985 | An Investigation of the Sequential Sampling Method for Crossdocking
Simulation Output Variance Reduction | cs.NE cs.CE | This paper investigates the reduction of variance associated with a
simulation output performance measure, using the Sequential Sampling method
while applying minimum simulation replications, for a class of JIT (Just in
Time) warehousing system called crossdocking. We initially used the Sequential
Sampling method to ... |
0803.1992 | Achievable Rates and Optimal Resource Allocation for Imperfectly-Known
Fading Relay Channels | cs.IT math.IT | In this paper, achievable rates and optimal resource allocation strategies
for imperfectly-known fading relay channels are studied. It is assumed that
communication starts with the network training phase in which the receivers
estimate the fading coefficients of their respective channels. In the data
transmission pha... |
0803.1993 | Improved Squeaky Wheel Optimisation for Driver Scheduling | cs.NE cs.CE | This paper presents a technique called Improved Squeaky Wheel Optimisation
for driver scheduling problems. It improves the original Squeaky Wheel
Optimisations effectiveness and execution speed by incorporating two additional
steps of Selection and Mutation which implement evolution within a single
solution. In the I... |
0803.1994 | The Application of Bayesian Optimization and Classifier Systems in Nurse
Scheduling | cs.NE cs.CE | Two ideas taken from Bayesian optimization and classifier systems are
presented for personnel scheduling based on choosing a suitable scheduling rule
from a set for each persons assignment. Unlike our previous work of using
genetic algorithms whose learning is implicit, the learning in both approaches
is explicit, i.... |
0803.1997 | Danger Theory: The Link between AIS and IDS? | cs.NE cs.AI cs.CR | We present ideas about creating a next generation Intrusion Detection System
based on the latest immunological theories. The central challenge with computer
security is determining the difference between normal and potentially harmful
activity. For half a century, developers have protected their systems by coding
rul... |
0803.2092 | An Ant-Based Model for Multiple Sequence Alignment | q-bio.QM cs.AI | Multiple sequence alignment is a key process in today's biology, and finding
a relevant alignment of several sequences is much more challenging than just
optimizing some improbable evaluation functions. Our approach for addressing
multiple sequence alignment focuses on the building of structures in a new
graph model:... |
0803.2212 | Conditioning Probabilistic Databases | cs.DB cs.AI | Past research on probabilistic databases has studied the problem of answering
queries on a static database. Application scenarios of probabilistic databases
however often involve the conditioning of a database using additional
information in the form of new evidence. The conditioning problem is thus to
transform a pr... |
0803.2220 | The Anatomy of Mitos Web Search Engine | cs.IR | Engineering a Web search engine offering effective and efficient information
retrieval is a challenging task. This document presents our experiences from
designing and developing a Web search engine offering a wide spectrum of
functionalities and we report some interesting experimental results. A rather
peculiar desi... |
0803.2257 | High-Resolution Radar via Compressed Sensing | math.NA cs.IT math.IT | A stylized compressed sensing radar is proposed in which the time-frequency
plane is discretized into an N by N grid. Assuming the number of targets K is
small (i.e., K much less than N^2), then we can transmit a sufficiently
"incoherent" pulse and employ the techniques of compressed sensing to
reconstruct the target... |
0803.2262 | Constant-Rank Codes and Their Connection to Constant-Dimension Codes | cs.IT math.IT | Constant-dimension codes have recently received attention due to their
significance to error control in noncoherent random linear network coding. What
the maximal cardinality of any constant-dimension code with finite dimension
and minimum distance is and how to construct the optimal constant-dimension
code (or codes... |
0803.2306 | Tableau-based decision procedures for logics of strategic ability in
multi-agent systems | cs.LO cs.AI cs.MA | We develop an incremental tableau-based decision procedures for the
Alternating-time temporal logic ATL and some of its variants.
While running within the theoretically established complexity upper bound, we
claim that our tableau is practically more efficient in the average case than
other decision procedures fo... |
0803.2314 | Problem Solving and Complex Systems | cs.NE | The observation and modeling of natural Complex Systems (CSs) like the human
nervous system, the evolution or the weather, allows the definition of special
abilities and models reusable to solve other problems. For instance, Genetic
Algorithms or Ant Colony Optimizations are inspired from natural CSs to solve
optimiz... |
0803.2337 | Data Fusion Trees for Detection: Does Architecture Matter? | cs.IT math.IT | We consider the problem of decentralized detection in a network consisting of
a large number of nodes arranged as a tree of bounded height, under the
assumption of conditionally independent, identically distributed observations.
We characterize the optimal error exponent under a Neyman-Pearson formulation.
We show th... |
0803.2363 | lambda-Connectedness Determination for Image Segmentation | cs.CV cs.DM | Image segmentation is to separate an image into distinct homogeneous regions
belonging to different objects. It is an essential step in image analysis and
computer vision. This paper compares some segmentation technologies and
attempts to find an automated way to better determine the parameters for image
segmentation... |
0803.2392 | CoSaMP: Iterative signal recovery from incomplete and inaccurate samples | math.NA cs.IT math.IT | Compressive sampling offers a new paradigm for acquiring signals that are
compressible with respect to an orthonormal basis. The major algorithmic
challenge in compressive sampling is to approximate a compressible signal from
noisy samples. This paper describes a new iterative recovery algorithm called
CoSaMP that de... |
0803.2427 | A General Rate Duality of the MIMO Multiple Access Channel and the MIMO
Broadcast Channel | cs.IT math.IT | We present a general rate duality between the multiple access channel (MAC)
and the broadcast channel (BC) which is applicable to systems with and without
nonlinear interference cancellation. Different to the state-of-the-art rate
duality with interference subtraction from Vishwanath et al., the proposed
duality is f... |
0803.2443 | Discrete stochastic processes, replicator and Fokker-Planck equations of
coevolutionary dynamics in finite and infinite populations | q-bio.PE cond-mat.stat-mech cs.SI math.PR math.ST physics.bio-ph physics.soc-ph stat.TH | Finite-size fluctuations in coevolutionary dynamics arise in models of
biological as well as of social and economic systems. This brief tutorial
review surveys a systematic approach starting from a stochastic process
discrete both in time and state. The limit $N\to \infty$ of an infinite
population can be considered ... |
0803.2460 | Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the
BEC | cs.IT math.IT | The error performance of the ensemble of typical LDPC codes transmitted over
the binary erasure channel (BEC) is analyzed. In the past, lower bounds on the
error exponents were derived. In this paper a probabilistic upper bound on this
error exponent is derived. This bound holds with some confidence level.
|
0803.2559 | Logical Queries over Views: Decidability and Expressiveness | cs.LO cs.DB | We study the problem of deciding satisfiability of first order logic queries
over views, our aim being to delimit the boundary between the decidable and the
undecidable fragments of this language. Views currently occupy a central place
in database research, due to their role in applications such as information
integr... |
0803.2570 | Unequal Error Protection: An Information Theoretic Perspective | cs.IT cs.DM math.CO math.IT | An information theoretic framework for unequal error protection is developed
in terms of the exponential error bounds. The fundamental difference between
the bit-wise and message-wise unequal error protection (UEP) is demonstrated,
for fixed length block codes on DMCs without feedback. Effect of feedback is
investiga... |
0803.2639 | Maximal Orders in the Design of Dense Space-Time Lattice Codes | cs.IT cs.DM math.IT math.RA | We construct explicit rate-one, full-diversity, geometrically dense matrix
lattices with large, non-vanishing determinants (NVD) for four transmit antenna
multiple-input single-output (MISO) space-time (ST) applications. The
constructions are based on the theory of rings of algebraic integers and
related subrings of ... |
0803.2675 | Digital Ecosystems: Self-Organisation of Evolving Agent Populations | cs.NE cs.CC | A primary motivation for our research in Digital Ecosystems is the desire to
exploit the self-organising properties of biological ecosystems. Ecosystems are
thought to be robust, scalable architectures that can automatically solve
complex, dynamic problems. Self-organisation is perhaps one of the most
desirable featu... |
0803.2695 | KohonAnts: A Self-Organizing Ant Algorithm for Clustering and Pattern
Classification | cs.NE cs.CV | In this paper we introduce a new ant-based method that takes advantage of the
cooperative self-organization of Ant Colony Systems to create a naturally
inspired clustering and pattern recognition method. The approach considers each
data item as an ant, which moves inside a grid changing the cells it goes
through, in ... |
0803.2812 | Using Spatially Varying Pixels Exposures and Bayer-covered Photosensors
for High Dynamic Range Imaging | cs.CV | The method of a linear high dynamic range imaging using solid-state
photosensors with Bayer colour filters array is provided in this paper. Using
information from neighbour pixels, it is possible to reconstruct linear images
with wide dynamic range from the oversaturated images. Bayer colour filters
array is consider... |
0803.2827 | Impact of CSI on Distributed Space-Time Coding in Wireless Relay
Networks | cs.IT math.IT | We consider a two-hop wireless network where a transmitter communicates with
a receiver via $M$ relays with an amplify-and-forward (AF) protocol. Recent
works have shown that sophisticated linear processing such as beamforming and
distributed space-time coding (DSTC) at relays enables to improve the AF
performance. H... |
0803.2856 | Figuring out Actors in Text Streams: Using Collocations to establish
Incremental Mind-maps | cs.CL cs.LG | The recognition, involvement, and description of main actors influences the
story line of the whole text. This is of higher importance as the text per se
represents a flow of words and expressions that once it is read it is lost. In
this respect, the understanding of a text and moreover on how the actor exactly
behav... |
0803.2904 | A Distance Metric for Tree-Sibling Time Consistent Phylogenetic Networks | q-bio.PE cs.CE cs.DM | The presence of reticulate evolutionary events in phylogenies turn
phylogenetic trees into phylogenetic networks. These events imply in particular
that there may exist multiple evolutionary paths from a non-extant species to
an extant one, and this multiplicity makes the comparison of phylogenetic
networks much more ... |
0803.2925 | Equivalence of Probabilistic Tournament and Polynomial Ranking Selection | cs.NE | Crucial to an Evolutionary Algorithm's performance is its selection scheme.
We mathematically investigate the relation between polynomial rank and
probabilistic tournament methods which are (respectively) generalisations of
the popular linear ranking and tournament selection schemes. We show that every
probabilistic ... |
0803.2957 | Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall
Layout and Tenant Selection Problem | cs.NE cs.CE | During our earlier research, it was recognised that in order to be successful
with an indirect genetic algorithm approach using a decoder, the decoder has to
strike a balance between being an optimiser in its own right and finding
feasible solutions. Previously this balance was achieved manually. Here we
extend this ... |
0803.2965 | An Indirect Genetic Algorithm for Set Covering Problems | cs.NE cs.AI | This paper presents a new type of genetic algorithm for the set covering
problem. It differs from previous evolutionary approaches first because it is
an indirect algorithm, i.e. the actual solutions are found by an external
decoder function. The genetic algorithm itself provides this decoder with
permutations of the... |
0803.2966 | On the Application of Hierarchical Coevolutionary Genetic Algorithms:
Recombination and Evaluation Partners | cs.NE cs.AI | This paper examines the use of a hierarchical coevolutionary genetic
algorithm under different partnering strategies. Cascading clusters of
sub-populations are built from the bottom up, with higher-level sub-populations
optimising larger parts of the problem. Hence higher-level sub-populations
potentially search a la... |
0803.2967 | Building Better Nurse Scheduling Algorithms | cs.NE cs.CE | The aim of this research is twofold: Firstly, to model and solve a complex
nurse scheduling problem with an integer programming formulation and
evolutionary algorithms. Secondly, to detail a novel statistical method of
comparing and hence building better scheduling algorithms by identifying
successful algorithm modif... |
0803.2969 | An Indirect Genetic Algorithm for a Nurse Scheduling Problem | cs.NE cs.CE | This paper describes a Genetic Algorithms approach to a manpower-scheduling
problem arising at a major UK hospital. Although Genetic Algorithms have been
successfully used for similar problems in the past, they always had to overcome
the limitations of the classical Genetic Algorithms paradigm in handling the
conflic... |
0803.2970 | A Recommender System based on Idiotypic Artificial Immune Networks | cs.NE cs.AI | The immune system is a complex biological system with a highly distributed,
adaptive and self-organising nature. This paper presents an Artificial Immune
System (AIS) that exploits some of these characteristics and is applied to the
task of film recommendation by Collaborative Filtering (CF). Natural evolution
and in... |
0803.2973 | Rule Generalisation in Intrusion Detection Systems using Snort | cs.NE cs.CR | Intrusion Detection Systems (ids)provide an important layer of security for
computer systems and networks, and are becoming more and more necessary as
reliance on Internet services increases and systems with sensitive data are
more commonly open to Internet access. An ids responsibility is to detect
suspicious or una... |
0803.2975 | An Estimation of Distribution Algorithm for Nurse Scheduling | cs.NE cs.CE | Schedules can be built in a similar way to a human scheduler by using a set
of rules that involve domain knowledge. This paper presents an Estimation of
Distribution Algorithm (eda) for the nurse scheduling problem, which involves
choosing a suitable scheduling rule from a set for the assignment of each
nurse. Unlike... |
0803.2981 | Idiotypic Immune Networks in Mobile Robot Control | cs.NE cs.AI cs.RO | Jerne's idiotypic network theory postulates that the immune response involves
inter-antibody stimulation and suppression as well as matching to antigens. The
theory has proved the most popular Artificial Immune System (ais) model for
incorporation into behavior-based robotics but guidelines for implementing
idiotypic... |
0803.3117 | On the Diversity-Multiplexing Tradeoff in Multiple-Relay Network | cs.IT math.IT | This paper studies the setup of a multiple-relay network in which $K$
half-duplex multiple-antenna relays assist in the transmission between
a/several multiple-antenna transmitter(s) and a multiple-antenna receiver. Each
two nodes are assumed to be either connected through a quasi-static Rayleigh
fading channel, or d... |
0803.3186 | Towards a human eye behavior model by applying Data Mining Techniques on
Gaze Information from IEC | cs.HC cs.NE | In this paper, we firstly present what is Interactive Evolutionary
Computation (IEC) and rapidly how we have combined this artificial intelligence
technique with an eye-tracker for visual optimization. Next, in order to
correctly parameterize our application, we present results from applying data
mining techniques on... |
0803.3192 | Eye-Tracking Evolutionary Algorithm to minimize user's fatigue in IEC
applied to Interactive One-Max problem | cs.AI | In this paper, we describe a new algorithm that consists in combining an
eye-tracker for minimizing the fatigue of a user during the evaluation process
of Interactive Evolutionary Computation. The approach is then applied to the
Interactive One-Max optimization problem.
|
0803.3224 | A Model-Based Frequency Constraint for Mining Associations from
Transaction Data | cs.DB | Mining frequent itemsets is a popular method for finding associated items in
databases. For this method, support, the co-occurrence frequency of the items
which form an association, is used as the primary indicator of the
associations's significance. A single user-specified support threshold is used
to decided if ass... |
0803.3360 | Asymptotics of input-constrained binary symmetric channel capacity | math.PR cs.IT math.IT | We study the classical problem of noisy constrained capacity in the case of
the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs
are sequences chosen from a constrained set. Motivated by a result of
Ordentlich and Weissman [In Proceedings of IEEE Information Theory Workshop
(2004) 117--122],... |
0803.3363 | Node discovery in a networked organization | cs.AI | In this paper, I present a method to solve a node discovery problem in a
networked organization. Covert nodes refer to the nodes which are not
observable directly. They affect social interactions, but do not appear in the
surveillance logs which record the participants of the social interactions.
Discovering the cove... |
0803.3404 | Some results on $\mathbb{R}$-computable structures | cs.DB cs.LO math.LO | This survey paper examines the effective model theory obtained with the BSS
model of real number computation. It treats the following topics: computable
ordinals, satisfaction of computable infinitary formulas, forcing as a
construction technique, effective categoricity, effective topology, and
relations with other m... |
0803.3448 | Secure Hop-by-Hop Aggregation of End-to-End Concealed Data in Wireless
Sensor Networks | cs.CR cs.IT cs.NI math.IT | In-network data aggregation is an essential technique in mission critical
wireless sensor networks (WSNs) for achieving effective transmission and hence
better power conservation. Common security protocols for aggregated WSNs are
either hop-by-hop or end-to-end, each of which has its own encryption schemes
considerin... |
0803.3490 | Robustness and Regularization of Support Vector Machines | cs.LG cs.AI | We consider regularized support vector machines (SVMs) and show that they are
precisely equivalent to a new robust optimization formulation. We show that
this equivalence of robust optimization and regularization has implications for
both algorithms, and analysis. In terms of algorithms, the equivalence suggests
more... |
0803.3501 | Multiagent Approach for the Representation of Information in a Decision
Support System | cs.AI | In an emergency situation, the actors need an assistance allowing them to
react swiftly and efficiently. In this prospect, we present in this paper a
decision support system that aims to prepare actors in a crisis situation
thanks to a decision-making support. The global architecture of this system is
presented in th... |
0803.3539 | Reinforcement Learning by Value Gradients | cs.NE cs.AI | The concept of the value-gradient is introduced and developed in the context
of reinforcement learning. It is shown that by learning the value-gradients
exploration or stochastic behaviour is no longer needed to find locally optimal
trajectories. This is the main motivation for using value-gradients, and it is
argued... |
0803.3553 | New Families of Triple Error Correcting Codes with BCH Parameters | cs.IT cs.DM math.IT | Discovered by Bose, Chaudhuri and Hocquenghem, the BCH family of error
correcting codes are one of the most studied families in coding theory. They
are also among the best performing codes, particularly when the number of
errors being corrected is small relative to the code length. In this article we
consider binary ... |
0803.3608 | The Category-Theoretic Arithmetic of Information | math.CT cs.IT math.IT | We highlight the underlying category-theoretic structure of measures of
information flow. We present an axiomatic framework in which communication
systems are represented as morphisms, and information flow is characterized by
its behavior when communication systems are combined. Our framework includes a
variety of di... |
0803.3645 | A New Sphere-Packing Bound for Maximal Error Exponent for
Multiple-Access Channels | cs.IT math.IT | In this work, a new lower bound for the maximal error probability of a
two-user discrete memoryless (DM) multiple-access channel (MAC) is derived.
This is the first bound of this type that explicitly imposes independence of
the users' input distributions (conditioned on the time-sharing auxiliary
variable) and thus r... |
0803.3657 | Improved Lower Bounds for Constant GC-Content DNA Codes | cs.IT cs.DS math.CO math.IT q-bio.GN q-bio.QM | The design of large libraries of oligonucleotides having constant GC-content
and satisfying Hamming distance constraints between oligonucleotides and their
Watson-Crick complements is important in reducing hybridization errors in DNA
computing, DNA microarray technologies, and molecular bar coding. Various
techniques... |
0803.3658 | The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A
Complete Solution | cs.IT cs.DM math.CO math.IT | This correspondence introduces two new constructive techniques to complete
the determination of the sizes of optimal q-ary codes of constant weight three
and distance four.
|
0803.3693 | Succinct Data Structures for Retrieval and Approximate Membership | cs.DS cs.DB cs.IR | The retrieval problem is the problem of associating data with keys in a set.
Formally, the data structure must store a function f: U ->{0,1}^r that has
specified values on the elements of a given set S, a subset of U, |S|=n, but
may have any value on elements outside S. Minimal perfect hashing makes it
possible to av... |
0803.3746 | Cluster Approach to the Domains Formation | cs.NE cs.DS | As a rule, a quadratic functional depending on a great number of binary
variables has a lot of local minima. One of approaches allowing one to find in
averaged deeper local minima is aggregation of binary variables into larger
blocks/domains. To minimize the functional one has to change the states of
aggregated varia... |
0803.3773 | Capacity of Gaussian MIMO Bidirectional Broadcast Channels | cs.IT math.IT | We consider the broadcast phase of a three-node network, where a relay node
establishes a bidirectional communication between two nodes using a spectrally
efficient two-phase decode-and-forward protocol. In the first phase the two
nodes transmit their messages to the relay node. Then the relay node decodes
the messag... |
0803.3777 | Lower Bounds on the Minimum Pseudodistance for Linear Codes with $q$-ary
PSK Modulation over AWGN | cs.IT math.IT | We present lower bounds on the minimum pseudocodeword effective Euclidean
distance (or minimum "pseudodistance") for coded modulation systems using
linear codes with $q$-ary phase-shift keying (PSK) modulation over the additive
white Gaussian noise (AWGN) channel. These bounds apply to both binary and
nonbinary coded... |
0803.3781 | Fourier Spectra of Binomial APN Functions | cs.DM cs.IT math.IT | In this paper we compute the Fourier spectra of some recently discovered
binomial APN functions. One consequence of this is the determination of the
nonlinearity of the functions, which measures their resistance to linear
cryptanalysis. Another consequence is that certain error-correcting codes
related to these funct... |
0803.3812 | Preferred extensions as stable models | cs.AI cs.SC | Given an argumentation framework AF, we introduce a mapping function that
constructs a disjunctive logic program P, such that the preferred extensions of
AF correspond to the stable models of P, after intersecting each stable model
with the relevant atoms. The given mapping function is of polynomial size
w.r.t. AF. I... |
0803.3816 | Approaching the Capacity of Wireless Networks through Distributed
Interference Alignment | cs.IT math.IT | Recent results establish the optimality of interference alignment to approach
the Shannon capacity of interference networks at high SNR. However, the extent
to which interference can be aligned over a finite number of signalling
dimensions remains unknown. Another important concern for interference
alignment schemes ... |
0803.3838 | Recorded Step Directional Mutation for Faster Convergence | cs.NE cs.LG | Two meta-evolutionary optimization strategies described in this paper
accelerate the convergence of evolutionary programming algorithms while still
retaining much of their ability to deal with multi-modal problems. The
strategies, called directional mutation and recorded step in this paper, can
operate independently ... |
0803.3850 | State Estimation Over Wireless Channels Using Multiple Sensors:
Asymptotic Behaviour and Optimal Power Allocation | cs.IT math.IT | This paper considers state estimation of linear systems using analog amplify
and forwarding with multiple sensors, for both multiple access and orthogonal
access schemes. Optimal state estimation can be achieved at the fusion center
using a time varying Kalman filter. We show that in many situations, the
estimation e... |
0803.3880 | Asymptotically Optimum Universal One-Bit Watermarking for Gaussian
Covertexts and Gaussian Attacks | cs.IT math.IT | The problem of optimum watermark embedding and detection was addressed in a
recent paper by Merhav and Sabbag, where the optimality criterion was the
maximum false-negative error exponent subject to a guaranteed false-positive
error exponent. In particular, Merhav and Sabbag derived universal
asymptotically optimum e... |
0803.3900 | A Component Based Heuristic Search method with Adaptive Perturbations
for Hospital Personnel Scheduling | cs.NE cs.CE | Nurse rostering is a complex scheduling problem that affects hospital
personnel on a daily basis all over the world. This paper presents a new
component-based approach with adaptive perturbations, for a nurse scheduling
problem arising at a major UK hospital. The main idea behind this technique is
to decompose a sche... |
0803.3905 | Introduction to Multi-Agent Simulation | cs.NE cs.MA | When designing systems that are complex, dynamic and stochastic in nature,
simulation is generally recognised as one of the best design support
technologies, and a valuable aid in the strategic and tactical decision making
process. A simulation model consists of a set of rules that define how a system
changes over ti... |
0803.3912 | Artificial Immune Systems Tutorial | cs.NE cs.AI cs.MA | The biological immune system is a robust, complex, adaptive system that
defends the body from foreign pathogens. It is able to categorize all cells (or
molecules) within the body as self-cells or non-self cells. It does this with
the help of a distributed task force that has the intelligence to take action
from a loc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.