Hasil untuk "nlin.AO"

Menampilkan 20 dari ~0 hasil · dari arXiv

JSON API
arXiv Open Access 2023
Self adaptation of networks of non-identical pulse-coupled excitatory and inhibitory oscillators in the presence of distance-related delays to achieve frequency synchronisation

L. Gil

We show that a network of non-identical nodes, with excitable dynamics, pulse-coupled, with coupling delays depending on the Euclidean distance between nodes, is able to adapt the topology of its connections to obtain spike frequency synchronization. The adapted network exhibits remarkable properties: sparse, anti-cluster, necessary presence of a minimum of inhibitory nodes, predominance of connections from inhibitory nodes over those from excitatory nodes and finally spontaneous spatial structuring of the inhibitory projections: the furthest the most intense.

en nlin.AO
arXiv Open Access 2022
A note on explicit solutions of FitzHugh-Rinzel system

Monica De Angelis

The numerous scientific feedbacks that the FitzHugh-Rinzel system (FHR) is having in various scientific fields, lead to further studies on the determination of its explicit solutions. Indeed, such a study can help to get a better understanding of several behaviors in the complex dynamics of biological systems. In this note, a class of traveling wave solutions is determined and specific solutions are achieved to explicitly show the contribution due to a diffusion term considered in the FHR model.

en nlin.AO
arXiv Open Access 2021
Influence of sound on empirical brain networks

Jakub Sawicki, Eckehard Schöll

We analyze the influence of an external sound source in a network of FitzHugh-Nagumo oscillators with empirical structural connectivity measured in healthy human subjects. We report synchronization patterns, induced by the frequency of the sound source. We show that the level of synchrony can be enhanced by choosing the frequency of the sound source and its amplitude as control parameters for synchronization patterns. We discuss a minimum model elucidating the modalities of the influence of music on the human brain.

arXiv Open Access 2018
Fractional networks, the new structure

R. Vilela Mendes

Real world networks have, for a long time, been modelled by scale-free networks, which have many sparsely connected nodes and a few highly connected ones (the hubs). However, both in society and in biology, a new structure must be acknowledged, the fractional networks. These networks are characterized by the existence of very many long-range connections, display superdiffusion, Lévy flights and robustness properties different from the scale-free networks.

en nlin.AO, physics.soc-ph
arXiv Open Access 2013
Idiosyncrasy as an explanation for power laws in nature

Salvador Pueyo

Complex systems theory pays much attention to simple mechanisms producing nontrivial patterns, especially power laws. However, power laws with exponent close to one also result from complex mixtures of mechanisms that, in isolation, would not necessarily give this type of distribution. Probably, both paths to the power law are relevant in nature. The second gives a plausible explanation for some instances of power laws emerging in extremely complex systems, such as ecosystems.

en nlin.AO, q-bio.PE
arXiv Open Access 2013
Coarse-grained description of general oscillator networks

Yuki Izumida, Hiroshi Kori

We propose a novel and systematic method for coarse-graining oscillator networks described by phase equations. Our coarse-graining method enables us to obtain the closed coarse-grained equations for a few effective eigenmodes, which is based on the eigenvalue problem of the linearized system around the phase-locked solution and a nonlinear transformation. We demonstrate our method by applying it to oscillator dynamics on a random graph, which exhibits a saddle-node bifurcation at the bifurcation point.

en nlin.AO, cond-mat.stat-mech
arXiv Open Access 2011
The Recursive Gauss-Newton Filter

Roaldje Nadjiasngar, Michael Inggs

This paper presents a compact, recursive, non-linear, filter, derived from the Gauss-Newton (GNF), which is an algorithm that is based on weighted least squares and the Newton method of local linearisation. The recursive form (RGNF), which is then adapted to the Levenberg-Maquardt method is applicable to linear / nonlinear of process state models, coupled with the linear / nonlinear observation schemes. Simulation studies have demonstrated the robustness of the RGNF, and a large reduction in the amount of computational memory required, identified in the past as a major limitation on the use of the GNF.

en nlin.AO
arXiv Open Access 2009
Agent Components and the Emergence of Altruism in Social Interaction Networks

Fariel Shafee

We discuss a special aspect of agents placed in a social network. If an agent can be seen as comprising many components, the expressions and interactions among these components may be crucial. We discuss the role of patterns within the environment as a mode of expression of these components. The stability and identity of an agent is derived as a function of component and component-pattern identity. The agent is then placed in a specific social network within the environment, and the enigmatic case of altruism is explained in terms of interacting component identities.

en nlin.AO, nlin.PS
arXiv Open Access 2008
Some hints for the design of digital chaos-based cryptosystems: lessons learned from cryptanalysis

David Arroyo, Gonzalo Alvarez, Shujun Li

In this work we comment some conclusions derived from the analysis of recent proposals on the field of chaos-based cryptography. These observations remark the main problems detected in some of those schemes under examination. Therefore, this paper is a list of what to avoid when considering chaos as source of new strategies to conceal and protect information.

en nlin.AO, nlin.CD
arXiv Open Access 2007
Dynamical and spectral properties of complex networks

Juan A. Almendral, Albert Díaz-Guilera

Dynamical properties of complex networks are related to the spectral properties of the Laplacian matrix that describes the pattern of connectivity of the network. In particular we compute the synchronization time for different types of networks and different dynamics. We show that the main dependence of the synchronization time is on the smallest nonzero eigenvalue of the Laplacian matrix, in contrast to other proposals in terms of the spectrum of the adjacency matrix. Then, this topological property becomes the most relevant for the dynamics.

arXiv Open Access 1996
A Simple Learning Algorithm for the Traveling Salesman Problem

Kan Chen

We propose a learning algorithm for solving the traveling salesman problem based on a simple strategy of trial and adaptation: i) A tour is selected by choosing cities probabilistically according to the ``synaptic'' strengths between cities. ii) The ``synaptic'' strengths of the links that form the tour are then enhanced (reduced) if the tour length is shorter (longer) than the average result of the previous trials. We perform extensive simulations of the random distance traveling-salesman problem. For sufficiently slow learning rates, near optimal tours can be obtained with the average optimal tour lengths close to the lower bounds for the shortest tour lengths.

arXiv Open Access 1993
Evolution to the Edge of Chaos in Imitation Game

Kunihiko Kaneko, Junji Suzuki

Motivated by the evolution of complex bird songs, an abstract imitation game is proposed to study the increase of dynamical complexity: Artificial "birds" display a "song" time series to each other, and those that imitate the other's song better win the game. With the introduction of population dynamics according to the score of the game and the mutation of parameters for the song dynamics, the dynamics is found to evolve towards the borderline between chaos and a periodic window, after punctuated equilibria. The importance of edge of chaos with topological chaos for complexity is stressed.

en nlin.AO, q-bio.PE
arXiv Open Access 1997
Codon Bias and Mutability in HIV Sequences

H. Waelbroeck

A survey of the patterns of synonymous codon preferences in the HIV env gene reveals a relation between the codon bias and the mutability requirements in different regions in the protein. At hypervariable regions in $gp120$, one finds a greater proportion of codons that tend to mutate non-synonymously, but to a target that is similar in hydrophobicity and volume. We argue that this strategy results from a compromise between the selective pressure placed on the virus by the induced immune response, which favours amino acid substitutions in the complementarity determining regions, and the negative selection against missense mutations that violate structural constraints of the env protein.

en nlin.AO, q-bio
arXiv Open Access 1999
Model of self-replicating cell capable of self-maintenance

Naoaki Ono, Takashi Ikegami

We construct a simple model of a proto-cell that simulates a stochastic dynamics of abstract chemicals on a two-dimensional lattice. We assume that chemicals catalyze their reproduction through interaction with each other, and that between some chemicals repulsion occurs. We have shown that chemicals organize themselves into a cell-like structure that maintains its membranes dynamically. Further, we have obtained cells that can divide themselves automatically into daughter cells.

en nlin.AO, q-bio
arXiv Open Access 2002
Fractal dimension and self-similarity in Asparagus plumosus

J. R. Castrejon-Pita, A. Sarmiento Galan, R. Castrejon-Garcia

We measure the fractal dimension of an African plant that is widely cultivated as ornamental, the Asparagus plumosus. This plant presents self-similarity, remarkable in at least two different scalings. In the following, we present the results obtained by analyzing this plant via the box counting method for three different scalings. We show in a quantitatively way that this species is a fractal.

en nlin.AO, q-bio.QM
arXiv Open Access 1995
A Statistical Approach to Vehicular Traffic

Jan Freund, Thorsten Pöschel

A two--dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of the four directions. The flow of cars obeys realistic traffic rules. We investigate the dependence of the average velocity of cars on the global traffic density. At a critical threshold for the density the average velocity reduces drastically caused by jamming. For the low density regime we provide analytical results which agree with the numerical results.

en nlin.AO
arXiv Open Access 1994
Towards A Description Of Interactive Psychoinformation Systems. Preliminary Remarks. (K Opisaniyu Interaktivnyh Psihoinformatsionnyh Sistem. Predvaritel'Nye Zamechaniya)

Denis Juriev

An approach to description of interactive psychoinformation systems, based on the concept of "virtualization" and essentially using the technique of the "secondary image synthesis" (adap-org/9409002), is sketched. The article has a rather discussional character and maybe considered as a comment to some statements of the introduction to the author's paper "Complex projective geometry and quantum projective field theory" (Theor. Math. Phys., 1994).

en nlin.AO
arXiv Open Access 1995
Proportion Regulation in Globally Coupled Nonlinear Systems

Tsuyoshi Mizuguchi, Masaki Sano

As a model of proportion regulation in differentiation process of biological system, globally coupled activator-inhibitor systems are studied. Formation and destabilization of one and two cluster state are predicted analytically. Numerical simulations show that the proportion of units of clusters is chosen within a finite range and it is selected depend on the initial condition.