The evolution of haploid and diploid phases of the life cycle is investigated theoretically, using a model where the relative length of haploid and diploid phases is under genetic control. The model assumes that selection occurs in both phases and that fitness in each phase is a function of the time spent in that phase. The equilibrium and stability conditions that allow for all-haploid, all-di...

Abstract. We analyze the dynamics of a deterministic model of inhibitory neuronal networks proving that the discontinuities of the Poincaré map produce a never empty chaotic set, while its continuity pieces produce stable orbits. We classify the systems in three types: the almost everywhere (a.e.) chaotic, the a.e. stable, and the combined systems. The a.e. stable are periodic and chaos appears...

For biological populations with nonoverlapping generations, population growth takes place in discrete time steps and is described by difference equations. Some of the simplest such nonlinear difference equations can exhibit a remarkrible spectrum of dynamical behavior, from stable equilibrium points, to stable cyclic oscillations between two population points, to stable cycles with four points,...

Some of the simplest nonlinear difference equations describing the growth of biological populations with nonoverlapping generations can exhibit a remarkable spectrum of dynamical behavior, from stable equilibrium points, to stable cyclic oscillations between 2 population points, to stable cycles with 4, 8, 16, . . . points, through to a chaotic regime in which (depending on the initial populati...

In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz’s answer sets semantics (initially defined as ‘stable model semantics’). This paper introduces a fundamental result, which is very relevant for Answer Set programming, and planning. For the first time since the definition of the stable model semantics, the class of logic programs for which a...

Cliques and odd cycles are well known to induce facet-de.ning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the .rst part of this paper we generalize both notions to (Kn \ e)-cycles, a new class of n-critical graphs, and discuss some implications for the class of in.nite planar...

This is the sequel to the paper [Li]. In this paper, we construct the virtual moduli cycles of the degeneration of the moduli of stable morphisms constructed in [Li]. We also construct the virtual moduli cycles of the moduli of relative stable morphisms of a pair of a smooth divisor in a smooth variety. Based on these, we prove a degeneration formula of the Gromov-Witten invariants.

We introduce non-volatile resistive crossbar memory based on ionic liquid covalently functionalized on a partially reduced graphene oxide (PrGO). The write-read-erase-read (WRER) cycles were very stable after several hundred cycles and the retention time of both the ON and OFF states was stable for over 1000 s, indicating that the device we developed can function as a non-volatile memory device.

An industrially applied LCC power converter is modelled as a hybrid system. It is found that the hybrid system given a parameter set up and different initial conditions has three different limit cycles, one unstable and two asymmetric stable limit cycles. Effects of the asymmetric limit cycles are considered.