相关论文: Queues, Stacks, and Transcendentality at the Trans…

The presence of a period-doubling cascade in dynamical systems that depend on a parameter is one of the basic routes to chaos. It is rarely mentioned that there are virtually always infinitely many cascades whenever there is one. We report…

Autonomous randomly coupled neural networks display a transition to chaos at a critical coupling strength. We here investigate the effect of a time-varying input on the onset of chaos and the resulting consequences for information…

A new type of deterministic chaos for a system described by iterative two-dimensional maps is reported. The series being generated by the original map has an average upward trend while the first difference, which is the series of changes…

In a variety of studies of dynamical systems, the edge of order and chaos has been singled out as a region of complexity. It was suggested by Wolfram, on the basis of qualitative behaviour of cellular automata, that the computational basis…

The theory community has proposed several new heap variants in the recent past which have remained largely untested experimentally. We take the field back to the drawing board, with straightforward implementations of both classic and novel…

This paper proposed a quantum analogue of classical queue automata by using the definition of the quantum Turing machine and quantum finite-state automata. However, quantum automata equipped with storage medium of a stack has been…

We consider a many-parametric piecewise mapping with discontinuity. That is a one dimensional model of singular dynamic system. The stability boundary are calculated analytically and numerically. New typical features of stable cycle…

We visit a previously proposed discontinuous, two-parameter generalization of the continuous, one-parameter logistic map and present exhaustive numerical studies of the behavior for different values of the two parameters and initial points.…

Packet traffic in complex networks undergoes the jamming transition from free-flow to congested state as the number of packets in the system increases. Here we study such jamming transition when queues are operated by the priority queuing…

A network of signalized intersections is modeled as a queuing network. The intersections are regulated by fixed-time (FT) controls, all with the same cycle length or period, $T$. Vehicles arrive from outside the network at entry links in a…

In network systems, a local perturbation can amplify as it propagates, potentially leading to a large-scale cascading failure. Here we derive a continuous model to advance our understanding of cascading failures in power-grid networks. The…

The appearance of infinitely-many period-doubling cascades is one of the most prominent features observed in the study of maps depending on a parameter. They are associated with chaotic behavior, since bifurcation diagrams of a map with a…

The emergence of chaotic phenomena in a quantum system has long been an elusive subject. Experimental progresses in this subject have become urgently needed in recent years, when considerable theoretical studies have unveiled the vital…

Chaos is an inherently dynamical phenomenon traditionally studied for trajectories that are either permanently erratic or transiently influenced by permanently erratic ones lying on a set of measure zero. The latter gives rise to the final…

In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…

We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate lambda at queue 1, under a back-pressure (MaxWeight) algorithm: service at queue n is blocked unless its queue length is greater than that of…

We propose a technique for learning representations of parser states in transition-based dependency parsers. Our primary innovation is a new control structure for sequence-to-sequence neural networks---the stack LSTM. Like the conventional…

In stochastic models for queues and their networks, random events evolve in time. A process for their backward evolution is referred to as a time reversed process. It is often greatly helpful to view a stochastic model from two different…

We examine different generalizations of checking stack automata by allowing multiple input heads and multiple stacks, and characterize their computing power in terms of two-way multi-head finite automata and space-bounded Turing machines.…

In shear flows like pipe flow and plane Couette flow there is an extended range of parameters where linearly stable laminar flow coexists with a transient turbulent dynamics. When increasing the amplitude of a perturbation on top of the…