Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
34,804 | Novelty Detection for Robot Neotaxis | cs.RO | The ability of a robot to detect and respond to changes in its environment is
potentially very useful, as it draws attention to new and potentially important
features. We describe an algorithm for learning to filter out previously
experienced stimuli to allow further concentration on novel features. The
algorithm uses ... | computer science |
34,805 | Novelty Detection on a Mobile Robot Using Habituation | cs.RO | In this paper a novelty filter is introduced which allows a robot operating
in an un structured environment to produce a self-organised model of its
surroundings and to detect deviations from the learned model. The environment
is perceived using the rob ot's 16 sonar sensors. The algorithm produces a
novelty measure fo... | computer science |
34,806 | On Classes of Functions for which No Free Lunch Results Hold | cs.NE | In a recent paper it was shown that No Free Lunch results hold for any subset
F of the set of all possible functions from a finite set X to a finite set Y
iff F is closed under permutation of X. In this article, we prove that the
number of those subsets can be neglected compared to the overall number of
possible subset... | computer science |
34,807 | Trust Brokerage Systems for the Internet | cs.CR | This thesis addresses the problem of providing trusted individuals with
confidential information about other individuals, in particular, granting
access to databases of personal records using the World-Wide Web. It proposes
an access rights management system for distributed databases which aims to
create and implement ... | computer science |
34,808 | Aging, double helix and small world property in genetic algorithms | cs.NE | Over a quarter of century after the invention of genetic algorithms and
miriads of their modifications, as well as successful implementations, we are
still lacking many essential details of thorough analysis of it's inner
working. One of such fundamental questions is: how many generations do we need
to solve the optimi... | computer science |
34,809 | A Simple Model of Unbounded Evolutionary Versatility as a Largest-Scale
Trend in Organismal Evolution | cs.NE | The idea that there are any large-scale trends in the evolution of biological
organisms is highly controversial. It is commonly believed, for example, that
there is a large-scale trend in evolution towards increasing complexity, but
empirical and theoretical arguments undermine this belief. Natural selection
results in... | computer science |
34,810 | Increasing Evolvability Considered as a Large-Scale Trend in Evolution | cs.NE | Evolvability is the capacity to evolve. This paper introduces a simple
computational model of evolvability and demonstrates that, under certain
conditions, evolvability can increase indefinitely, even when there is no
direct selection for evolvability. The model shows that increasing evolvability
implies an acceleratin... | computer science |
34,811 | Recent Results on No-Free-Lunch Theorems for Optimization | cs.NE | The sharpened No-Free-Lunch-theorem (NFL-theorem) states that the performance
of all optimization algorithms averaged over any finite set F of functions is
equal if and only if F is closed under permutation (c.u.p.) and each target
function in F is equally likely. In this paper, we first summarize some
consequences of ... | computer science |
34,812 | Self-Replicating Machines in Continuous Space with Virtual Physics | cs.NE | JohnnyVon is an implementation of self-replicating machines in continuous
two-dimensional space. Two types of particles drift about in a virtual liquid.
The particles are automata with discrete internal states but continuous
external relationships. Their internal states are governed by finite state
machines but their e... | computer science |
34,813 | Why Two Sexes? | cs.NE | Evolutionary role of the separation into two sexes from a cyberneticist's
point of view. [I translated this 1965 article from Russian "Nauka i Zhizn"
(Science and Life) in 1988. In a popular form, the article puts forward several
useful ideas not all of which even today are necessarily well known or widely
accepted. Bo... | computer science |
34,814 | Chosen-Plaintext Cryptanalysis of a Clipped-Neural-Network-Based Chaotic
Cipher | cs.CR | In ISNN'04, a novel symmetric cipher was proposed, by combining a chaotic
signal and a clipped neural network (CNN) for encryption. The present paper
analyzes the security of this chaotic cipher against chosen-plaintext attacks,
and points out that this cipher can be broken by a chosen-plaintext attack.
Experimental an... | computer science |
34,815 | Self-Replicating Strands that Self-Assemble into User-Specified Meshes | cs.NE | It has been argued that a central objective of nanotechnology is to make
products inexpensively, and that self-replication is an effective approach to
very low-cost manufacturing. The research presented here is intended to be a
step towards this vision. In previous work (JohnnyVon 1.0), we simulated
machines that bonde... | computer science |
34,816 | Amazing geometry of genetic space or are genetic algorithms convergent? | cs.NE | There is no proof yet of convergence of Genetic Algorithms. We do not supply
it too. Instead, we present some thoughts and arguments to convince the Reader,
that Genetic Algorithms are essentially bound for success. For this purpose, we
consider only the crossover operators, single- or multiple-point, together with
sel... | computer science |
34,817 | Evaluation de Techniques de Traitement des Refusés pour l'Octroi de
Crédit | cs.NE | We present the problem of "Reject Inference" for credit acceptance. Because
of the current legal framework (Basel II), credit institutions need to
industrialize their processes for credit acceptance, including Reject
Inference. We present here a methodology to compare various techniques of
Reject Inference and show tha... | computer science |
34,818 | Ideas by Statistical Mechanics (ISM) | cs.CE | Ideas by Statistical Mechanics (ISM) is a generic program to model evolution
and propagation of ideas/patterns throughout populations subjected to
endogenous and exogenous interactions. The program is based on the author's
work in Statistical Mechanics of Neocortical Interactions (SMNI), and uses the
author's Adaptive ... | computer science |
34,819 | Advances in Self Organising Maps | cs.NE | The Self-Organizing Map (SOM) with its related extensions is the most popular
artificial neural algorithm for use in unsupervised learning, clustering,
classification and data visualization. Over 5,000 publications have been
reported in the open literature, and many commercial projects employ the SOM as
a tool for solv... | computer science |
34,820 | Magnification Laws of Winner-Relaxing and Winner-Enhancing Kohonen
Feature Maps | cs.NE | Self-Organizing Maps are models for unsupervised representation formation of
cortical receptor fields by stimuli-driven self-organization in laterally
coupled winner-take-all feedforward structures. This paper discusses
modifications of the original Kohonen model that were motivated by a potential
function, in their ab... | computer science |
34,821 | Automatic Generation of Benchmarks for Plagiarism Detection Tools using
Grammatical Evolution | cs.NE | This paper has been withdrawn by the authors due to a major rewriting. | computer science |
34,822 | Whitehead method and Genetic Algorithms | math.GR | In this paper we discuss a genetic version (GWA) of the Whitehead's
algorithm, which is one of the basic algorithms in combinatorial group theory.
It turns out that GWA is surprisingly fast and outperforms the standard
Whitehead's algorithm in free groups of rank >= 5. Experimenting with GWA we
collected an interesting... | computer science |
34,823 | Genetic algorithms and the Andrews-Curtis conjecture | math.GR | The Andrews-Curtis conjecture claims that every balanced presentation of the
trivial group can be transformed into the trivial presentation by a finite
sequence of "elementary transformations" which are Nielsen transformations
together with an arbitrary conjugation of a relator. It is believed that the
Andrews-Curtis c... | computer science |
34,824 | Cartes auto-organisées pour l'analyse exploratoire de données et
la visualisation | math.ST | This paper shows how to use the Kohonen algorithm to represent
multidimensional data, by exploiting the self-organizing property. It is
possible to get such maps as well for quantitative variables as for qualitative
ones, or for a mixing of both. The contents of the paper come from various
works by SAMOS-MATISSE member... | computer science |
34,825 | Working times in atypical forms of employment: the special case of
part-time work | math.ST | In the present article, we attempt to devise a typology of forms of part-time
employment by applying a widely used neuronal methodology called Kohonen maps.
Starting out with data that we describe using category-specific variables, we
show how it is possible to represent observations and the modalities of the
variables... | computer science |
34,826 | On the use of self-organizing maps to accelerate vector quantization | math.ST | Self-organizing maps (SOM) are widely used for their topology preservation
property: neighboring input vectors are quantified (or classified) either on
the same location or on neighbor ones on a predefined grid. SOM are also widely
used for their more classical vector quantization property. We show in this
paper that u... | computer science |
34,827 | Statistical tools to assess the reliability of self-organizing maps | math.ST | Results of neural network learning are always subject to some variability,
due to the sensitivity to initial conditions, to convergence to local minima,
and, sometimes more dramatically, to sampling variability. This paper presents
a set of tools designed to assess the reliability of the results of
Self-Organizing Maps... | computer science |
34,828 | Bootstrap for neural model selection | math.ST | Bootstrap techniques (also called resampling computation techniques) have
introduced new advances in modeling and model evaluation. Using resampling
methods to construct a series of new samples which are based on the original
data set, allows to estimate the stability of the parameters. Properties such
as convergence a... | computer science |
34,829 | Missing values : processing with the Kohonen algorithm | math.ST | The processing of data which contain missing values is a complicated and
always awkward problem, when the data come from real-world contexts. In
applications, we are very often in front of observations for which all the
values are not available, and this can occur for many reasons: typing errors,
fields left unanswered... | computer science |
34,830 | Consumer Profile Identification and Allocation | math.ST | We propose an easy-to-use methodology to allocate one of the groups which
have been previously built from a complete learning data base, to new
individuals. The learning data base contains continuous and categorical
variables for each individual. The groups (clusters) are built by using only
the continuous variables an... | computer science |
34,831 | On model selection and the disability of neural networks to decompose
tasks | nlin.AO | A neural network with fixed topology can be regarded as a parametrization of
functions, which decides on the correlations between functional variations when
parameters are adapted. We propose an analysis, based on a differential
geometry point of view, that allows to calculate these correlations. In
practise, this desc... | computer science |
34,832 | A neural model for multi-expert architectures | nlin.AO | We present a generalization of conventional artificial neural networks that
allows for a functional equivalence to multi-expert systems. The new model
provides an architectural freedom going beyond existing multi-expert models and
an integrative formalism to compare and combine various techniques of learning.
(We consi... | computer science |
34,833 | Neutrality: A Necessity for Self-Adaptation | nlin.AO | Self-adaptation is used in all main paradigms of evolutionary computation to
increase efficiency. We claim that the basis of self-adaptation is the use of
neutrality. In the absence of external control neutrality allows a variation of
the search distribution without the risk of fitness loss. | computer science |
34,834 | The structure of evolutionary exploration: On crossover, buildings
blocks and Estimation-Of-Distribution Algorithms | nlin.AO | The notion of building blocks can be related to the structure of the
offspring probability distribution: loci of which variability is strongly
correlated constitute a building block. We call this correlated exploration.
With this background we analyze the structure of the offspring probability
distribution, or explorat... | computer science |
34,835 | Transmitting a signal by amplitude modulation in a chaotic network | nlin.CD | We discuss the ability of a network with non linear relays and chaotic
dynamics to transmit signals, on the basis of a linear response theory
developed by Ruelle \cite{Ruelle} for dissipative systems. We show in
particular how the dynamics interfere with the graph topology to produce an
effective transmission network, ... | computer science |
34,836 | From Neuron to Neural Networks dynamics | nlin.AO | This paper presents an overview of some techniques and concepts coming from
dynamical system theory and used for the analysis of dynamical neural networks
models. In a first section, we describe the dynamics of the neuron, starting
from the Hodgkin-Huxley description, which is somehow the canonical description
for the ... | computer science |
34,837 | Competition of Self-Organized Rotating Spiral Autowaves in a
Nonequilibrium Dissipative System of Three-Level Phaser | nlin.CG | We present results of cellular automata based investigations of rotating
spiral autowaves in a nonequilibrium excitable medium which models three-level
paramagnetic microwave phonon laser (phaser). The computational model is
described in arXiv:cond-mat/0410460v2 and arXiv:cond-mat/0602345v1 . We have
observed several n... | computer science |
34,838 | Evolution of differentiated expression patterns in digital organisms | cs.NE | We investigate the evolutionary processes behind the development and
optimization of multiple threads of execution in digital organisms using the
avida platform, a software package that implements Darwinian evolution on
populations of self-replicating computer programs. The system is seeded with a
linearly executed anc... | computer science |
34,839 | Self-adaptive exploration in evolutionary search | cs.NE | We address a primary question of computational as well as biological research
on evolution: How can an exploration strategy adapt in such a way as to exploit
the information gained about the problem at hand? We first introduce an
integrated formalism of evolutionary search which provides a unified view on
different spe... | computer science |
34,840 | Learning about knowledge: A complex network approach | cs.NE | This article describes an approach to modeling knowledge acquisition in terms
of walks along complex networks. Each subset of knowledge is represented as a
node, and relations between such knowledge are expressed as edges. Two types of
edges are considered, corresponding to free and conditional transitions. The
latter ... | computer science |
34,841 | Pattern Excitation-Based Processing: The Music of The Brain | cs.NE | An approach to information processing based on the excitation of patterns of
activity by non-linear active resonators in response to their input patterns is
proposed. Arguments are presented to show that any computation performed by a
conventional Turing machine-based computer, called T-machine in this paper,
could als... | computer science |
34,842 | Spike timing precision and neural error correction: local behavior | cs.NE | The effects of spike timing precision and dynamical behavior on error
correction in spiking neurons were investigated. Stationary discharges -- phase
locked, quasiperiodic, or chaotic -- were induced in a simulated neuron by
presenting pacemaker presynaptic spike trains across a model of a prototypical
inhibitory synap... | computer science |
34,843 | Characterizing Self-Developing Biological Neural Networks: A First Step
Towards their Application To Computing Systems | cs.AR | Carbon nanotubes are often seen as the only alternative technology to silicon
transistors. While they are the most likely short-term one, other longer-term
alternatives should be studied as well. While contemplating biological neurons
as an alternative component may seem preposterous at first sight, significant
recent ... | computer science |
34,844 | Neuromodulation Influences Synchronization and Intrinsic Read-out | cs.NE | The roles of neuromodulation in a neural network, such as in a cortical
microcolumn, are still incompletely understood. Neuromodulation influences
neural processing by presynaptic and postsynaptic regulation of synaptic
efficacy. Synaptic efficacy modulation can be an effective way to rapidly alter
network density and ... | computer science |
34,845 | The use of the GARP genetic algorithm and internet grid computing in the
Lifemapper world atlas of species biodiversity | cs.DC | Lifemapper (http://www.lifemapper.org) is a predictive electronic atlas of
the Earth's biological biodiversity. Using a screensaver version of the GARP
genetic algorithm for modeling species distributions, Lifemapper harnesses vast
computing resources through 'volunteers' PCs similar to SETI@home, to develop
models of ... | computer science |
34,846 | Quantum Pattern Retrieval by Qubit Networks with Hebb Interactions | cs.NE | Qubit networks with long-range interactions inspired by the Hebb rule can be
used as quantum associative memories. Starting from a uniform superposition,
the unitary evolution generated by these interactions drives the network
through a quantum phase transition at a critical computation time, after which
ferromagnetic ... | computer science |
34,847 | Evolutionary Mesh Numbering: Preliminary Results | cs.NA | Mesh numbering is a critical issue in Finite Element Methods, as the
computational cost of one analysis is highly dependent on the order of the
nodes of the mesh. This paper presents some preliminary investigations on the
problem of mesh numbering using Evolutionary Algorithms. Three conclusions can
be drawn from these... | computer science |
34,848 | Efficient supervised learning in networks with binary synapses | cs.NE | Recent experimental studies indicate that synaptic changes induced by
neuronal activity are discrete jumps between a small number of stable states.
Learning in systems with discrete synapses is known to be a computationally
hard problem. Here, we study a neurobiologically plausible on-line learning
algorithm that deriv... | computer science |
34,849 | Constructing Bio-molecular Databases on a DNA-based Computer | cs.NE | Codd [Codd 1970] wrote the first paper in which the model of a relational
database was proposed. Adleman [Adleman 1994] wrote the first paper in which
DNA strands in a test tube were used to solve an instance of the Hamiltonian
path problem. From [Adleman 1994], it is obviously indicated that for storing
information in... | computer science |
34,850 | D-optimal Bayesian Interrogation for Parameter and Noise Identification
of Recurrent Neural Networks | cs.NE | We introduce a novel online Bayesian method for the identification of a
family of noisy recurrent neural networks (RNNs). We develop Bayesian active
learning technique in order to optimize the interrogating stimuli given past
experiences. In particular, we consider the unknown parameters as stochastic
variables and use... | computer science |
34,851 | Emergence, Competition and Dynamical Stabilization of Dissipative
Rotating Spiral Waves in an Excitable Medium: A Computational Model Based on
Cellular Automata | nlin.CG | We report some qualitatively new features of emergence, competition and
dynamical stabilization of dissipative rotating spiral waves (RSWs) in the
cellular-automaton model of laser-like excitable media proposed in
arXiv:cond-mat/0410460v2 ; arXiv:cond-mat/0602345 . Part of the observed
features are caused by unusual me... | computer science |
34,852 | Self-organized criticality and adaptation in discrete dynamical networks | nlin.AO | It has been proposed that adaptation in complex systems is optimized at the
critical boundary between ordered and disordered dynamical regimes. Here, we
review models of evolving dynamical networks that lead to self-organization of
network topology based on a local coupling between a dynamical order parameter
and rewir... | computer science |
34,853 | Bayesian Inference Based on Stationary Fokker-Planck Sampling | cs.NE | A novel formalism for Bayesian learning in the context of complex inference
models is proposed. The method is based on the use of the Stationary
Fokker--Planck (SFP) approach to sample from the posterior density. Stationary
Fokker--Planck sampling generalizes the Gibbs sampler algorithm for arbitrary
and unknown condit... | computer science |
34,854 | Artificial Neural Network-based error compensation procedure for
low-cost encoders | cs.NE | An Artificial Neural Network-based error compensation method is proposed for
improving the accuracy of resolver-based 16-bit encoders by compensating for
their respective systematic error profiles. The error compensation procedure,
for a particular encoder, involves obtaining its error profile by calibrating
it on a pr... | computer science |
34,855 | New Solutions to the Firing Squad Synchronization Problems for Neural
and Hyperdag P Systems | cs.CE | We propose two uniform solutions to an open question: the Firing Squad
Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems,
with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively,
where e_c is the eccentricity of the commander cell of the dag or digraph
underlying these P ... | computer science |
34,856 | Evolutionary multi-stage financial scenario tree generation | cs.NE | Multi-stage financial decision optimization under uncertainty depends on a
careful numerical approximation of the underlying stochastic process, which
describes the future returns of the selected assets or asset categories.
Various approaches towards an optimal generation of discrete-time,
discrete-state approximations... | computer science |
34,857 | An Energy Efficient Scheme for Data Gathering in Wireless Sensor
Networks Using Particle Swarm Optimization | cs.NI | This paper has been withdrawn by the author due to a crucial sign error in
equation 1 | computer science |
34,858 | A New Metaheuristic Bat-Inspired Algorithm | math.OC | Metaheuristic algorithms such as particle swarm optimization, firefly
algorithm and harmony search are now becoming powerful methods for solving many
tough optimization problems. In this paper, we propose a new metaheuristic
method, the Bat Algorithm, based on the echolocation behaviour of bats. We also
intend to combi... | computer science |
34,859 | Tailored RF pulse optimization for magnetization inversion at ultra high
field | cs.CE | The radiofrequency (RF) transmit field is severely inhomogeneous at ultrahigh
field due to both RF penetration and RF coil design issues. This particularly
impairs image quality for sequences that use inversion pulses such as
magnetization prepared rapid acquisition gradient echo and limits the use of
quantitative arte... | computer science |
34,860 | Universal algorithms, mathematics of semirings and parallel computations | math.NA | This is a survey paper on applications of mathematics of semirings to
numerical analysis and computing. Concepts of universal algorithm and generic
program are discussed. Relations between these concepts and mathematics of
semirings are examined. A very brief introduction to mathematics of semirings
(including idempote... | computer science |
34,861 | An Agent-based Simulation of the Effectiveness of Creative Leadership | cs.MA | This paper investigates the effectiveness of creative versus uncreative
leadership using EVOC, an agent-based model of cultural evolution. Each
iteration, each agent in the artificial society invents a new action, or
imitates a neighbor's action. Only the leader's actions can be imitated by all
other agents, referred t... | computer science |
34,862 | Overcoming Problems in the Measurement of Biological Complexity | cs.CE | In a genetic algorithm, fluctuations of the entropy of a genome over time are
interpreted as fluctuations of the information that the genome's organism is
storing about its environment, being this reflected in more complex organisms.
The computation of this entropy presents technical problems due to the small
populatio... | computer science |
34,863 | Analysis of attractor distances in Random Boolean Networks | cs.NE | We study the properties of the distance between attractors in Random Boolean
Networks, a prominent model of genetic regulatory networks. We define three
distance measures, upon which attractor distance matrices are constructed and
their main statistic parameters are computed. The experimental analysis shows
that ordere... | computer science |
34,864 | On the Impact of Mutation-Selection Balance on the Runtime of
Evolutionary Algorithms | cs.NE | The interplay between mutation and selection plays a fundamental role in the
behaviour of evolutionary algorithms (EAs). However, this interplay is still
not completely understood. This paper presents a rigorous runtime analysis of a
non-elitist population-based EA that uses the linear ranking selection
mechanism. The ... | computer science |
34,865 | Ranking-Based Black-Box Complexity | cs.NE | Randomized search heuristics such as evolutionary algorithms, simulated
annealing, and ant colony optimization are a broadly used class of
general-purpose algorithms. Analyzing them via classical methods of theoretical
computer science is a growing field. While several strong runtime analysis
results have appeared in t... | computer science |
34,866 | On the Preliminary Design of Multiple Gravity-Assist Trajectories | math.OC | In this paper the preliminary design of multiple gravity-assist trajectories
is formulated as a global optimization problem. An analysis of the structure of
the solution space reveals a strong multimodality, which is strictly dependent
on the complexity of the model. On the other hand it is shown how an
oversimplificat... | computer science |
34,867 | Collective stability of networks of winner-take-all circuits | cs.NE | The neocortex has a remarkably uniform neuronal organization, suggesting that
common principles of processing are employed throughout its extent. In
particular, the patterns of connectivity observed in the superficial layers of
the visual cortex are consistent with the recurrent excitation and inhibitory
feedback requi... | computer science |
34,868 | Splitting method for spatio-temporal search efforts planning | cs.NE | This article deals with the spatio-temporal sensors deployment in order to
maximize detection probability of an intelligent and randomly moving target in
an area under surveillance. Our work is based on the rare events simulation
framework. More precisely, we derive a novel stochastic optimization algorithm
based on th... | computer science |
34,869 | Is the Multiverse Hypothesis capable of explaining the Fine Tuning of
Nature Laws and Constants? The Case of Cellular Automata | nlin.CG | The objective of this paper is analyzing to which extent the multiverse
hypothesis provides a real explanation of the peculiarities of the laws and
constants in our universe. First we argue in favor of the thesis that all
multiverses except Tegmark's <<mathematical multiverse>> are too small to
explain the fine tuning,... | computer science |
34,870 | Predicting the Structure of Alloys using Genetic Algorithms | cs.NE | We discuss a novel genetic algorithm that can be used to find global minima
on the potential energy surface of disordered ceramics and alloys using a
real-space symmetry adapted crossover. Due to a high number of symmetrically
equivalent solutions of many alloys a conventional genetic algorithms using
reasonable popula... | computer science |
34,871 | Cloud-based Evolutionary Algorithms: An algorithmic study | cs.NE | After a proof of concept using Dropbox(tm), a free storage and
synchronization service, showed that an evolutionary algorithm using several
dissimilar computers connected via WiFi or Ethernet had a good scaling behavior
in terms of evaluations per second, it remains to be proved whether that effect
also translates to t... | computer science |
34,872 | 1st International Workshop on Distributed Evolutionary Computation in
Informal Environments | cs.NE | Online conference proceedings for the IWDECIE workshop, taking place in New
Orleans on June 5th, 2011. The workshop focuses on non-conventional
implementations of bioinspired algorithms and its conceptual implications. | computer science |
34,873 | Multi-Robot Organisms: State of the Art | cs.RO | This paper represents the state of the art development on the field of
artificial multi-robot organisms. It briefly considers mechatronic development,
sensor and computational equipment, software framework and introduces one of
the Grand Challenges for swarm and reconfigurable robotics. | computer science |
34,874 | Collective Adaptive Systems: Challenges Beyond Evolvability | cs.ET | This position paper overviews several challenges of collective adaptive
systems, which are beyond the research objectives of current top-projects in
ICT, and especially in FET, initiatives. The attention is paid not only to
challenges and new research topics, but also to their impact and potential
breakthroughs in info... | computer science |
34,875 | Memristors can implement fuzzy logic | cs.ET | In our work we propose implementing fuzzy logic using memristors. Min and max
operations are done by antipodally configured memristor circuits that may be
assembled into computational circuits. We discuss computational power of such
circuits with respect to m-efficiency and experimentally observed behavior of
memristiv... | computer science |
34,876 | Period-halving Bifurcation of a Neuronal Recurrence Equation | cs.NE | We study the sequences generated by neuronal recurrence equations of the form
$x(n) = {\bf 1}[\sum_{j=1}^{h} a_{j} x(n-j)- \theta]$. From a neuronal
recurrence equation of memory size $h$ which describes a cycle of length
$\rho(m) \times lcm(p_0, p_1,..., p_{-1+\rho(m)})$, we construct a set of
$\rho(m)$ neuronal recur... | computer science |
34,877 | A Neuron Based Switch: Application to Low Power Mixed Signal Circuits | cs.ET | Human brain is functionally and physically complex. This 'complexity' can be
seen as a result of biological design process involving extensive use of
concepts such as modularity and hierarchy. Over the past decade, deeper
insights into the functioning of cortical neurons have led to the development
of models that can b... | computer science |
34,878 | A Multi-objective Exploratory Procedure for Regression Model Selection | stat.CO | Variable selection is recognized as one of the most critical steps in
statistical modeling. The problems encountered in engineering and social
sciences are commonly characterized by over-abundance of explanatory variables,
non-linearities and unknown interdependencies between the regressors. An added
difficulty is that... | computer science |
34,879 | An Implementation of Intrusion Detection System Using Genetic Algorithm | cs.CR | Nowadays it is very important to maintain a high level security to ensure
safe and trusted communication of information between various organizations.
But secured data communication over internet and any other network is always
under threat of intrusions and misuses. So Intrusion Detection Systems have
become a needful... | computer science |
34,880 | Paraiso : An Automated Tuning Framework for Explicit Solvers of Partial
Differential Equations | cs.DC | We propose Paraiso, a domain specific language embedded in functional
programming language Haskell, for automated tuning of explicit solvers of
partial differential equations (PDEs) on GPUs as well as multicore CPUs. In
Paraiso, one can describe PDE solving algorithms succinctly using tensor
equations notation. Hydrody... | computer science |
34,881 | The bistable brain: a neuronal model with symbiotic interactions | nlin.CD | In general, the behavior of large and complex aggregates of elementary
components can not be understood nor extrapolated from the properties of a few
components. The brain is a good example of this type of networked systems where
some patterns of behavior are observed independently of the topology and of the
number of ... | computer science |
34,882 | Synthesis of Stochastic Flow Networks | cs.IT | A stochastic flow network is a directed graph with incoming edges (inputs)
and outgoing edges (outputs), tokens enter through the input edges, travel
stochastically in the network, and can exit the network through the output
edges. Each node in the network is a splitter, namely, a token can enter a node
through an inco... | computer science |
34,883 | Load Distribution Composite Design Pattern for Genetic Algorithm-Based
Autonomic Computing Systems | cs.SE | Current autonomic computing systems are ad hoc solutions that are designed
and implemented from the scratch. When designing software, in most cases two or
more patterns are to be composed to solve a bigger problem. A composite design
patterns shows a synergy that makes the composition more than just the sum of
its part... | computer science |
34,884 | A new class of metrics for spike trains | cs.IT | The distance between a pair of spike trains, quantifying the differences
between them, can be measured using various metrics. Here we introduce a new
class of spike train metrics, inspired by the Pompeiu-Hausdorff distance, and
compare them with existing metrics. Some of our new metrics (the modulus-metric
and the max-... | computer science |
34,885 | Predator confusion is sufficient to evolve swarming behavior | cs.NE | Swarming behaviors in animals have been extensively studied due to their
implications for the evolution of cooperation, social cognition, and
predator-prey dynamics. An important goal of these studies is discerning which
evolutionary pressures favor the formation of swarms. One hypothesis is that
swarms arise because t... | computer science |
34,886 | Group theory, group actions, evolutionary algorithms, and global
optimization | cs.NE | In this paper we use group, action and orbit to understand how evolutionary
solve nonconvex optimization problems. | computer science |
34,887 | Eléments pour une théorie des réseaux en phase d'apprentissage | nlin.AO | This study deals with the evolution of the so called intelligent networks
(insect society without leader, cells of an organism, brain...) during their
apprenticeship period. The used formalism draws one's inspiration from the one
of the Quantum field theory (Principle of stationary action, gauge fields,
invariance by s... | computer science |
34,888 | Neural Networks Built from Unreliable Components | cs.NE | Recent advances in associative memory design through strutured pattern sets
and graph-based inference algorithms have allowed the reliable learning and
retrieval of an exponential number of patterns. Both these and classical
associative memories, however, have assumed internally noiseless computational
nodes. This pape... | computer science |
34,889 | Improvement studies on neutron-gamma separation in HPGe detectors by
using neural networks | cs.NE | The neutrons emitted in heavy-ion fusion-evaporation (HIFE) reactions
together with the gamma-rays cause unwanted backgrounds in gamma-ray spectra.
Especially in the nuclear reactions, where relativistic ion beams (RIBs) are
used, these neutrons are serious problem. They have to be rejected in order to
obtain clearer g... | computer science |
34,890 | Convergence Analysis and Parallel Computing Implementation for the
Multiagent Coordination Optimization Algorithm | math.OC | In this report, a novel variation of Particle Swarm Optimization (PSO)
algorithm, called Multiagent Coordination Optimization (MCO), is implemented in
a parallel computing way for practical use by introducing MATLAB built-in
function "parfor" into MCO. Then we rigorously analyze the global convergence
of MCO by means o... | computer science |
34,891 | To which extend is the "neural code" a metric ? | cs.NE | Here is proposed a review of the different choices to structure spike trains,
using deterministic metrics. Temporal constraints observed in biological or
computational spike trains are first taken into account. The relation with
existing neural codes (rate coding, rank coding, phase coding, ..) is then
discussed. To wh... | computer science |
34,892 | Introducing numerical bounds to improve event-based neural network
simulation | nlin.AO | Although the spike-trains in neural networks are mainly constrained by the
neural dynamics itself, global temporal constraints (refractoriness, time
precision, propagation delays, ..) are also to be taken into account. These
constraints are revisited in this paper in order to use them in event-based
simulation paradigm... | computer science |
34,893 | Semistability-Based Convergence Analysis for Paracontracting Multiagent
Coordination Optimization | cs.SY | This sequential technical report extends some of the previous results we
posted at arXiv:1306.0225. | computer science |
34,894 | Performance Measurement Under Increasing Environmental Uncertainty In
The Context of Interval Type-2 Fuzzy Logic Based Robotic Sailing | cs.RO | Performance measurement of robotic controllers based on fuzzy logic,
operating under uncertainty, is a subject area which has been somewhat ignored
in the current literature. In this paper standard measures such as RMSE are
shown to be inappropriate for use under conditions where the environmental
uncertainty changes s... | computer science |
34,895 | Improving Sparse Associative Memories by Escaping from Bogus Fixed
Points | cs.NE | The Gripon-Berrou neural network (GBNN) is a recently invented recurrent
neural network embracing a LDPC-like sparse encoding setup which makes it
extremely resilient to noise and errors. A natural use of GBNN is as an
associative memory. There are two activation rules for the neuron dynamics,
namely sum-of-sum and sum... | computer science |
34,896 | Collecting Coupons with Random Initial Stake | cs.DM | Motivated by a problem in the theory of randomized search heuristics, we give
a very precise analysis for the coupon collector problem where the collector
starts with a random set of coupons (chosen uniformly from all sets).
We show that the expected number of rounds until we have a coupon of each
type is $nH_{n/2} -... | computer science |
34,897 | Using Intelligent Agents to Understand Management Practices and Retail
Productivity | 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 producti... | computer science |
34,898 | An Agent-Based Simulation of In-Store Customer Experiences | cs.NE | 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 curre... | computer science |
34,899 | Solving $k$-Nearest Neighbor Problem on Multiple Graphics Processors | cs.IR | The recommendation system is a software system to predict customers' unknown
preferences from known preferences. In the recommendation system, customers'
preferences are encoded into vectors, and finding the nearest vectors to each
vector is an essential part. This vector-searching part of the problem is
called a $k$-n... | computer science |
34,900 | Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes | cs.IT | We show how the necessary and sufficient conditions for the NFL to apply can
be reduced to the single requirement of the set of objective functions under
consideration being closed under permutation, and quantify the extent to which
a set of objectives not closed under permutation can give rise to a performance
differe... | computer science |
34,901 | A note on evolutionary stochastic portfolio optimization and
probabilistic constraints | cs.CE | In this note, we extend an evolutionary stochastic portfolio optimization
framework to include probabilistic constraints. Both the stochastic
programming-based modeling environment as well as the evolutionary optimization
environment are ideally suited for an integration of various types of
probabilistic constraints. W... | computer science |
34,902 | The Computing of Digital Ecosystems | cs.DC | 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. However, the computing technologies that contribute
to these p... | computer science |
34,903 | Emergent Criticality Through Adaptive Information Processing in Boolean
Networks | cs.NE | We study information processing in populations of Boolean networks with
evolving connectivity and systematically explore the interplay between the
learning capability, robustness, the network topology, and the task complexity.
We solve a long-standing open question and find computationally that, for large
system sizes ... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.