相关论文: Game of Life on Phyllosilicates: Gliders, Oscillat…
We investigate the structure and dynamics of sodium disilicate by means of molecular dynamics computer simulation. We show that the structure is described by a partially destroyed tetrahedral SiO_4 network and a spherical super structure…
We present a computational simulation of evolving entities that includes symbiosis with shifting levels of selection. Evolution by natural selection shifts from the level of the original entities to the level of the new symbiotic entity. In…
First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of…
In this work we study the nonlinear dynamics of the static and the driven ellipse. In the static case, we find numerically an asymptotical algebraic decay for the escape of an ensemble of non-interacting particles through a small hole due…
A partially parallel dynamical noisy binary choice (Ising) game in discrete time of $N$ players on complete graphs with $k$ players having a possibility of changing their strategies at each time moment called $k$-flip Ising game is…
The three-spin-$1/2$ decoherence-free subsystem defines a logical qubit protected from collective noise and supports exchange-only universal gates. Such logical qubits are well-suited for implementation with electrically-defined quantum…
Mean Field Games with state constraints are differential games with infinitely many agents, each agent facing a constraint on his state. The aim of this paper is to provide a meaning of the PDE system associated with these games, the…
The cornerstone underpinning deep learning is the guarantee that gradient descent on an objective converges to local minima. Unfortunately, this guarantee fails in settings, such as generative adversarial nets, where there are multiple…
Free standing silicene is predicted to display comparable electronic properties as graphene. However, the yet synthesized silicene-like structures have been only realized on different substrates which turned out to exhibit versatile…
This paper addresses the problem of finding cycles in the state transition graphs of synchronous Boolean networks. Synchronous Boolean networks are a class of deterministic finite state machines which are used for the modeling of gene…
Transition metal dichalcogenides (TMDs) combine interesting optical and spintronic properties in an atomically-thin material, where the light polarization can be used to control the spin and valley degrees-of-freedom for the development of…
Plasmodium of \emph{Physarum polycephalum} is a single huge (visible by naked eye) cell with myriad of nuclei. The plasmodium is a promising substrate for non-classical, nature-inspired, computing devices. It is capable for approximation of…
Spin-orbit coupling (SOC) and electron-electron interaction can mutually influence each other and give rise to a plethora of intriguing phenomena in condensed matter systems. In pristine bilayer graphene, which has weak SOC, intrinsic…
A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a…
Friedel oscillations of electron densities near step edges have an analog in microwave billiards. A random plane wave model, normally only appropriate for the eigenfunctions of a purely chaotic system, can be applied and is tested for…
Conway's Game of Life (Life), a well known algorithm within the broader class of cellular automata (CA), exhibits complex emergent dynamics, with extreme sensitivity to initial conditions. Modeling and predicting such intricate behavior…
The asynchronous systems are the models of the asynchronous circuits from the digital electrical engineering. An asynchronous system f is a multi-valued function that assigns to each admissible input u a set f(u) of possible states x in…
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general…
Motzkin chain is a model of nearest-neighbor interacting quantum $s=1$ spins with open boundary conditions. It is known that it has a unique ground state which can be viewed as a sum of Motzkin paths. We consider the case of periodic…
We developed the self-consistent method for the calculation of the density of states $N(\epsilon)$ in the SF bilayers. It based on the quasi-classical Usadel equations and takes into account the suppression of superconductivity in the S…