|   | 
Details
   web
Records
Author Concha-Vega, P.; Goles, E.; Montealegre, P.; Rios-Wilson, M.; Santivanez, J.
Title Introducing the activity parameter for elementary cellular automata Type
Year 2022 Publication International Journal Of Modern Physics C Abbreviated Journal Int. J. Mod Phys. C
Volume 33 Issue 09 Pages 2250121
Keywords Discrete dynamical systems; elementary cellular automata; rule space
Abstract Given an elementary cellular automaton (ECA) with local transition rule R, two different types of local transitions are identified: the ones in which a cell remains in its current state, called inactive transitions, and the ones in which the cell changes its current state, which are called active transitions. The number of active transitions of a rule is called its activity value. Based on latter identification, a rule R-1 is called a sub-rule of R-2 if the set of active transitions of R-1 is a subset of the active transitions of R-2.

In this paper, the notion of sub-rule for elementary cellular automata is introduced and explored: first, we consider a lattice that illustrates relations of nonequivalent elementary cellular automata according to nearby sub-rules. Then, we introduce statistical measures that allow us to compare rules and sub-rules. Finally, we explore the possible similarities in the dynamics of a rule with respect to its sub-rules, obtaining both empirical and theoretical results.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0129-1831 ISBN Medium
Area Expedition Conference
Notes WOS:000840726100005 Approved
Call Number UAI @ alexi.delcanto @ Serial 1630
Permanent link to this record
 

 
Author Dumett, M.A.; Cominetti, R.
Title On The Stability Of An Adaptive Learning Dynamics In Traffic Games Type
Year 2018 Publication Journal Of Dynamics And Games Abbreviated Journal J. Dyn. Games
Volume 5 Issue 4 Pages 265-282
Keywords Congestion games; adaptive learning dynamics; stochastic algorithms; routing equilibrium; dynamical systems; stability; Routh-Hurwitz criterion
Abstract This paper investigates the dynamic stability of an adaptive learning procedure in a traffic game. Using the Routh-Hurwitz criterion we study the stability of the rest points of the corresponding mean field dynamics. In the special case with two routes and two players we provide a full description of the number and nature of these rest points as well as the global asymptotic behavior of the dynamics. Depending on the parameters of the model, we find that there are either one, two or three equilibria and we show that in all cases the mean field trajectories converge towards a rest point for almost all initial conditions.
Address [Dumett, Miguel A.] San Diego State Univ, Computat Sci Res Ctr, San Diego, CA 92182 USA, Email: mdumett@sdsu.edu;
Corporate Author Thesis
Publisher Amer Inst Mathematical Sciences-Aims Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 2164-6066 ISBN Medium
Area Expedition Conference
Notes WOS:000450339800001 Approved
Call Number UAI @ eduardo.moreno @ Serial 1035
Permanent link to this record
 

 
Author Formenti, E.; Goles, E.; Martin, B.
Title Computational Complexity of Avalanches in the Kadanoff Sandpile Model Type
Year 2012 Publication Fundamenta Informaticae Abbreviated Journal Fundam. Inform.
Volume 115 Issue 1 Pages 107-124
Keywords Kadanoff Sandpile Model; Bak Sandpile Model; Sandpiles Models; Complexity; Discrete Dynamical Systems; Self-Organized Criticality (SOC)
Abstract This paper investigates the avalanche problem AP for the Kadanoff sandpile model (KSPM). We prove that (a slight restriction of) AP is in NC1 in dimension one, leaving the general case open. Moreover, we prove that AP is P-complete in dimension two. The proof of this latter result is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with an initial sand distribution in KSPM. These results are also related to the known prediction problem for sandpiles which is in NC1 for one-dimensional sandpiles and P-complete for dimension 3 or higher. The computational complexity of the prediction problem remains open for the Bak's model of two-dimensional sandpiles.
Address [Formenti, Enrico] Univ Nice Sophia Antipolis, I3S, UMR CNRS 6070, F-06903 Sophia Antipolis, France, Email: enrico.formenti@unice.fr
Corporate Author Thesis
Publisher Ios Press Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0169-2968 ISBN Medium
Area Expedition Conference
Notes WOS:000302777200008 Approved
Call Number UAI @ eduardo.moreno @ Serial 208
Permanent link to this record
 

 
Author Goles, E.; Lobos, F.; Ruz, G.A.; Sene, S.
Title Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks Type
Year 2020 Publication Natural Computing Abbreviated Journal Nat. Comput.
Volume 19 Issue 2 Pages 295-319
Keywords Discrete dynamical systems; Boolean networks; Biological network modeling
Abstract In this paper we study the dynamical behavior of Boolean networks with firing memory, namely Boolean networks whose vertices are updated synchronously depending on their proper Boolean local transition functions so that each vertex remains at its firing state a finite number of steps. We prove in particular that these networks have the same computational power than the classical ones, i.e. any Boolean network with firing memory composed of m vertices can be simulated by a Boolean network by adding vertices. We also prove general results on specific classes of networks. For instance, we show that the existence of at least one delay greater than 1 in disjunctive networks makes such networks have only fixed points as attractors. Moreover, for arbitrary networks composed of two vertices, we characterize the delay phase space, i.e. the delay values such that networks admits limit cycles or fixed points. Finally, we analyze two classical biological models by introducing delays: the model of the immune control of the lambda\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-phage and that of the genetic control of the floral morphogenesis of the plant Arabidopsis thaliana.
Address [Goles, Eric; Lobos, Fabiola; Ruz, Gonzalo A.] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Santiago, Chile, Email: eric.chacc@uai.cl;
Corporate Author Thesis
Publisher Springer Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1567-7818 ISBN Medium
Area Expedition Conference
Notes WOS:000531210800001 Approved
Call Number UAI @ eduardo.moreno @ Serial 1139
Permanent link to this record
 

 
Author Goles, E.; Montealegre, P.; Rios-Wilson, M.
Title On The Effects Of Firing Memory In The Dynamics Of Conjunctive Networks Type
Year 2020 Publication Discrete And Continuous Dynamical Systems Abbreviated Journal Discret. Contin. Dyn. Syst.
Volume 40 Issue 10 Pages 5765-5793
Keywords Discrete dynamical systems; boolean network; firing memory; conjunctive networks; prediction problem; and PSPACE
Abstract A boolean network is a map F : {0, 1}(n) -> {0, 1}(n) that defines a discrete dynamical system by the subsequent iterations of F. Nevertheless, it is thought that this definition is not always reliable in the context of applications, especially in biology. Concerning this issue, models based in the concept of adding asynchronicity to the dynamics were propose. Particularly, we are interested in a approach based in the concept of delay. We focus in a specific type of delay called firing memory and it effects in the dynamics of symmetric (non-directed) conjunctive networks. We find, in the caseis in which the implementation of the delay is not uniform, that all the complexity of the dynamics is somehow encapsulated in the component in which the delay has effect. Thus, we show, in the homogeneous case, that it is possible to exhibit attractors of non-polynomial period. In addition, we study the prediction problem consisting in, given an initial condition, determinate if a fixed coordinate will eventually change its state. We find again that in the non-homogeneous case all the complexity is determined by the component that is affected by the delay and we conclude in the homogeneous case that this problem is PSPACE-complete.
Address [Goles, Eric; Montealegre, Pedro] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Diagonal Torres 2650, Santiago, Chile, Email: eric.chacc@uai.cl;
Corporate Author Thesis
Publisher Amer Inst Mathematical Sciences-Aims Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1078-0947 ISBN Medium
Area Expedition Conference
Notes WOS:000545661800006 Approved
Call Number UAI @ eduardo.moreno @ Serial 1183
Permanent link to this record
 

 
Author Veliz-Tejo, A.; Travieso-Torres, J.C.; Peters, A.A.; Mora, A.; Leiva-Silva, F.
Title Normalized-Model Reference System for Parameter Estimation of Induction Motors Type
Year 2022 Publication Energies Abbreviated Journal Energies
Volume 15 Issue 13 Pages 4542
Keywords parameter estimation; adaptive systems; induction motors; nonlinear dynamical systems; persistent excitation
Abstract This manuscript proposes a short tuning march algorithm to estimate induction motors (IM) electrical and mechanical parameters. It has two main novel proposals. First, it starts by presenting a normalized-model reference adaptive system (N-MRAS) that extends a recently proposed normalized model reference adaptive controller for parameter estimation of higher-order nonlinear systems, adding filtering. Second, it proposes persistent exciting (PE) rules for the input amplitude. This N-MRAS normalizes the information vector and identification adaptive law gains for a more straightforward tuning method, avoiding trial and error. Later, two N-MRAS designs consider estimating IM electrical and mechanical parameters. Finally, the proposed algorithm considers starting with a V/f speed control strategy, applying a persistently exciting voltage and frequency, and applying the two designed N-MRAS. Test bench experiments validate the efficacy of the proposed algorithm for a 10 HP IM.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 1996-1073 ISBN Medium
Area Expedition Conference
Notes WOS:000825676800001 Approved
Call Number UAI @ alexi.delcanto @ Serial 1616
Permanent link to this record