Recurrence and higher ergodic properties for quenched random Lorentz tubes in dimension bigger than two

We consider the billiard dynamics in a non-compact set of ℝ d that is constructed as a bi-infinite chain of translated copies of the same d-dimensional polytope. A random configuration of semi-dispersing scatterers is placed in each copy. The ensemble of dynamical systems thus defined, one for each global realization of the scatterers, is called quenched random Lorentz tube. Under some fairly general conditions, we prove that every system in the ensemble is hyperbolic and almost every system is recurrent, ergodic, and enjoys some higher chaotic properties.

Non-commutative symbolic coding

We give a non-commutative generalization of classical symbolic coding in the presence of a synchronizing word. This is done by a scattering theoretical approach. Classically, the existence of a synchronizing word turns out to be equivalent to asymptotic completeness of the corresponding Markov process. A criterion for asymptotic completeness in general is provided by the regularity of an associated extended transition operator. Commutative and non-commutative examples are analysed.

Stability criteria for the contextual emergence of macrostates in neural networks

More than thirty years ago, Amari and colleagues proposed a statistical framework for identifying structurally stable macrostates of neural networks from observations of their microstates. We compare their stochastic stability criterion with a deterministic stability criterion based on the ergodic theory of dynamical systems, recently proposed for the scheme of contextual emergence and applied to particular inter-level relations in neuroscience. Stochastic and deterministic stability criteria for macrostates rely on macro-level contexts, which make them sensitive to differences between different macro-levels.

Approximate Riemann solutions of the two-dimensional shallow-water equations

A finite-difference scheme based on flux difference splitting is presented for the solution of the two-dimensional shallow-water equations of ideal fluid flow. A linearised problem, analogous to that of Riemann for gasdynamics, is defined and a scheme, based on numerical characteristic decomposition, is presented for obtaining approximate solutions to the linearised problem. The method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second-order scheme which avoids non-physical, spurious oscillations. An extension to the two-dimensional equations with source terms, is included. The scheme is applied to a dam-break problem with cylindrical symmetry.

An efficient numerical scheme for the Euler equations

A finite difference scheme based on flux difference splitting is presented for the solution of the Euler equations for the compressible flow of an ideal gas. A linearised Riemann problem is defined, and a scheme based on numerical characteristic decomposition is presented for obtaining approximate solutions to the linearised problem. An average of the flow variables across the interface between cells is required, and this average is chosen to be the arithmetic mean for computational efficiency, leading to arithmetic averaging. This is in contrast to the usual ‘square root’ averages found in this type of Riemann solver, where the computational expense can be prohibitive. The method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second order scheme which avoids nonphysical, spurious oscillations. The scheme is applied to a shock tube problem and a blast wave problem. Each approximate solution compares well with those given by other schemes, and for the shock tube problem is in agreement with the exact solution.

An efficient numerical scheme for the two-dimensional shallow water equations using arithmetic averaging

A finite difference scheme based on flux difference splitting is presented for the solution of the two-dimensional shallow water equations of ideal fluid flow. A linearised problem, analogous to that of Riemann for gas dynamics is defined, and a scheme, based on numerical characteristic decomposition is presented for obtaining approximate solutions to the linearised problem, and incorporates the technique of operator splitting. An average of the flow variables across the interface between cells is required, and this average is chosen to be the arithmetic mean for computational efficiency leading to arithmetic averaging. This is in contrast to usual ‘square root’ averages found in this type of Riemann solver, where the computational expense can be prohibitive. The method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second order scheme which avoids nonphysical, spurious oscillations. An extension to the two-dimensional equations with source terms is included. The scheme is applied to the one-dimensional problems of a breaking dam and reflection of a bore, and in each case the approximate solution is compared to the exact solution of ideal fluid flow. The scheme is also applied to a problem of stationary bore generation in a channel of variable cross-section. Finally, the scheme is applied to two other dam-break problems, this time in two dimensions with one having cylindrical symmetry. Each approximate solution compares well with those given by other authors.

Solutions of a two-dimensional dam-break problem

Solutions of a two-dimensional dam break problem are presented for two tailwater/reservoir height ratios. The numerical scheme used is an extension of one previously given by the author [J. Hyd. Res. 26(3), 293–306 (1988)], and is based on numerical characteristic decomposition. Thus approximate solutions are obtained via linearised problems, and the method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second order scheme which avoids non-physical, spurious oscillations.

Prediction of supercritical flow in open channels

A finite difference scheme based on flux difference splitting is presented for the solution of the one-dimensional shallow water equations in open channels. A linearised problem, analogous to that of Riemann for gas dynamics, is defined and a scheme, based on numerical characteristic decomposition, is presented for obtaining approximate solutions to the linearised problem. The method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second order scheme which avoids non-physical, spurious oscillations. The scheme is applied to a problem of flow in a river whose geometry induces a region of supercritical flow.

Flux difference splitting for open channel flows

A finite difference scheme based on flux difference splitting is presented for the solution of the one-dimensional shallow-water equations in open channels, together with an extension to two-dimensional flows. A linearized problem, analogous to that of Riemann for gas dynamics, is defined and a scheme, based on numerical characteristic decomposition, is presented for obtaining approximate solutions to the linearized problem. The method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second-order scheme which avoids non-physical, spurious oscillations. The scheme is applied to a one-dimensional dam-break problem, and to a problem of flow in a river whose geometry induces a region of supercritical flow. The scheme is also applied to a two-dimensional dam-break problem. The numerical results are compared with the exact solution, or other numerical results, where available.

On-demand hd video using Jini based grid

This research establishes the feasibility of using a network centric technology, Jini, to provide a grid framework on which to perform parallel video encoding. A solution was implemented using Jini and obtained real-time on demand encoding of a 480 HD video stream. Further, a projection is made concerning the encoding of 1080 HD video in real-time, as the current grid was not powerful enough to achieve this above 15fps. The research found that Jini is able to provide a number of tools and services highly applicable in a grid environment. It is also suitable in terms of performance and responds well to a varying number of grid nodes. The main performance limiter was found to be the network bandwidth allocation, which when loaded with a large number of grid nodes was unable to handle the traffic.

Symmetry breaking, mixing, instability, and low frequency variability in a minimal Lorenz-like system

Starting from the classical Saltzman two-dimensional convection equations, we derive via a severe spectral truncation a minimal 10 ODE system which includes the thermal effect of viscous dissipation. Neglecting this process leads to a dynamical system which includes a decoupled generalized Lorenz system. The consideration of this process breaks an important symmetry and couples the dynamics of fast and slow variables, with the ensuing modifications to the structural properties of the attractor and of the spectral features. When the relevant nondimensional number (Eckert number Ec) is different from zero, an additional time scale of O(Ec−1) is introduced in the system, as shown with standard multiscale analysis and made clear by several numerical evidences. Moreover, the system is ergodic and hyperbolic, the slow variables feature long-term memory with 1/f3/2 power spectra, and the fast variables feature amplitude modulation. Increasing the strength of the thermal-viscous feedback has a stabilizing effect, as both the metric entropy and the Kaplan-Yorke attractor dimension decrease monotonically with Ec. The analyzed system features very rich dynamics: it overcomes some of the limitations of the Lorenz system and might have prototypical value in relevant processes in complex systems dynamics, such as the interaction between slow and fast variables, the presence of long-term memory, and the associated extreme value statistics. This analysis shows how neglecting the coupling of slow and fast variables only on the basis of scale analysis can be catastrophic. In fact, this leads to spurious invariances that affect essential dynamical properties (ergodicity, hyperbolicity) and that cause the model losing ability in describing intrinsically multiscale processes.

Time complexity analysis of the stochastic diffusion search

The Stochastic Diffusion Search algorithm -an integral part of Stochastic Search Networks is investigated. Stochastic Diffusion Search is an alternative solution for invariant pattern recognition and focus of attention. It has been shown that the algorithm can be modelled as an ergodic, finite state Markov Chain under some non-restrictive assumptions. Sub-linear time complexity for some settings of parameters has been formulated and proved. Some properties of the algorithm are then characterised and numerical examples illustrating some features of the algorithm are presented.

(Non-)ergodicity of a degenerate diffusion modeling the fiber lay down process

We analyze the large time behavior of a stochastic model for the lay down of fibers on a moving conveyor belt in the production process of nonwovens. It is shown that under weak conditions this degenerate diffusion process has a unique invariant distribution and is even geometrically ergodic. This generalizes results from previous works [M. Grothaus and A. Klar, SIAM J. Math. Anal., 40 (2008), pp. 968–983; J. Dolbeault et al., arXiv:1201.2156] concerning the case of a stationary conveyor belt, in which the situation of a moving conveyor belt has been left open.

Design of delay-tolerant linear dispersion codes

In cooperative communication networks, owing to the nodes' arbitrary geographical locations and individual oscillators, the system is fundamentally asynchronous. This will damage some of the key properties of the space-time codes and can lead to substantial performance degradation. In this paper, we study the design of linear dispersion codes (LDCs) for such asynchronous cooperative communication networks. Firstly, the concept of conventional LDCs is extended to the delay-tolerant version and new design criteria are discussed. Then we propose a new design method to yield delay-tolerant LDCs that reach the optimal Jensen's upper bound on ergodic capacity as well as minimum average pairwise error probability. The proposed design employs stochastic gradient algorithm to approach a local optimum. Moreover, it is improved by using simulated annealing type optimization to increase the likelihood of the global optimum. The proposed method allows for flexible number of nodes, receive antennas, modulated symbols and flexible length of codewords. Simulation results confirm the performance of the newly-proposed delay-tolerant LDCs.

Non-ergodicity of inviscid two-dimensional flow on a beta-plane and on the surface of a rotating sphere

It is shown that, for a sufficiently large value of β, two-dimensional flow on a doubly-periodic beta-plane cannot be ergodic (phase-space filling) on the phase-space surface of constant energy and enstrophy. A corresponding result holds for flow on the surface of a rotating sphere, for a sufficiently rapid rotation rate Ω. This implies that the higher-order, non-quadratic invariants are exerting a significant influence on the statistical evolution of the flow. The proof relies on the existence of a finite-amplitude Liapunov stability theorem for zonally symmetric basic states with a non-vanishing absolute-vorticity gradient. When the domain size is much larger than the size of a typical eddy, then a sufficient condition for non-ergodicity is that the wave steepness ε < 1, where ε = 2[surd radical]2Z/βU in the planar case and $\epsilon = 2^{\frac{1}{4}} a^{\frac{5}{2}}Z^{\frac{7}{4}}/\Omega U^{\frac{5}{2}}$ in the spherical case, and where Z is the enstrophy, U the r.m.s. velocity, and a the radius of the sphere. This result may help to explain why numerical simulations of unforced beta-plane turbulence (in which ε decreases in time) seem to evolve into a non-ergodic regime at large scales.