Fault diagnosis of operational synchronous digital systems

Diagnosing faults on operational synchronous digital system

Sensitivity analysis Progress report, 1 Mar. - 1 May 1967

Flow graph technique for calculating sensitivity coefficients for electric network

Trace Complexity of Chaotic Reversible Cellular Automata

Delvenne, K\r{u}rka and Blondel have defined new notions of computational complexity for arbitrary symbolic systems, and shown examples of effective systems that are computationally universal in this sense. The notion is defined in terms of the trace function of the system, and aims to capture its dynamics. We present a Devaney-chaotic reversible cellular automaton that is universal in their sense, answering a question that they explicitly left open. We also discuss some implications and limitations of the construction.Comment: 12 pages + 1 page appendix, 4 figures. Accepted to Reversible Computation 2014 (proceedings published by Springer

Bifurcations in the Space of Exponential Maps

This article investigates the parameter space of the exponential family $z\mapsto \exp(z)+\kappa$. We prove that the boundary (in \C) of every hyperbolic component is a Jordan arc, as conjectured by Eremenko and Lyubich as well as Baker and Rippon. In fact, we prove the stronger statement that the exponential bifurcation locus is connected in \C, which is an analog of Douady and Hubbard's celebrated theorem that the Mandelbrot set is connected. We show furthermore that $\infty$ is not accessible through any nonhyperbolic ("queer") stable component. The main part of the argument consists of demonstrating a general "Squeezing Lemma", which controls the structure of parameter space near infinity. We also prove a second conjecture of Eremenko and Lyubich concerning bifurcation trees of hyperbolic components.Comment: 29 pages, 3 figures. The main change in the new version is the introduction of Theorem 1.1 on the connectivity of the bifurcation locus, which follows from the results of the original version but was not explicitly stated. Also, some small revisions have been made and references update

Reversible skew laurent polynomial rings and deformations of poisson automorphisms

A skew Laurent polynomial ring S = R[x(+/- 1); alpha] is reversible if it has a reversing automorphism, that is, an automorphism theta of period 2 that transposes x and x(-1) and restricts to an automorphism gamma of R with gamma = gamma(-1). We study invariants for reversing automorphisms and apply our methods to determine the rings of invariants of reversing automorphisms of the two most familiar examples of simple skew Laurent polynomial rings, namely a localization of the enveloping algebra of the two-dimensional non-abelian solvable Lie algebra and the coordinate ring of the quantum torus, both of which are deformations of Poisson algebras over the base field F. Their reversing automorphisms are deformations of Poisson automorphisms of those Poisson algebras. In each case, the ring of invariants of the Poisson automorphism is the coordinate ring B of a surface in F-3 and the ring of invariants S-theta of the reversing automorphism is a deformation of B and is a factor of a deformation of F[x(1), x(2), x(3)] for a Poisson bracket determined by the appropriate surface

The effect of precipitation and application rate on dicyandiamide persistence and efficiency in two Irish grassland soils

peer-reviewedThe nitrification inhibitor dicyandiamide (DCD) has had variable success in reducing nitrate (NO3-) leaching and nitrous oxide (N2O) emissions from soils receiving nitrogen (N) fertilisers. Factors such as soil type, temperature and moisture have been linked to the variable efficacy of DCD. Since DCD is water soluble it can be leached from the rooting zone where it is intended to inhibit nitrification. Intact soil columns (15 cm diameter by 35 cm long) were taken from luvic gleysol and haplic cambisol grassland sites and placed in growth chambers. DCD was applied at 15 or 30 kg DCD ha-1, with high or low precipitation. Leaching of DCD, mineral N and the residual soil DCD concentrations were determined over eight weeks High precipitation increased DCD in leachate and decreased recovery in soil. A soil x DCD rate interaction was detected for the DCD unaccounted (proxy for degraded DCD). In the cambisol degradation of DCD was high (circa 81%) and unaffected by DCD rate. In contrast DCD degradation in the gleysol was lower and differentially affected by rate, 67 and 46% for the 15 and 30 kg ha-1 treatments, respectively. Differences DCD degradation rates between soils may be related to differences in organic matter content and associated microbiological activity. Variable degradation rates of DCD in soil, unrelated to temperature or moisture, may contribute to varying DCD efficacy. Soil properties should be considered when tailoring DCD strategies for improving nitrogen use efficiency and crop yields, through the reduction of reactive nitrogen loss.This research was financially supported under the National Development Plan, through the Research Stimulus Fund, administered by the Department of Agriculture, Food and the Marine under grants 07519 and 07545

Extension of Lorenz Unpredictability

It is found that Lorenz systems can be unidirectionally coupled such that the chaos expands from the drive system. This is true if the response system is not chaotic, but admits a global attractor, an equilibrium or a cycle. The extension of sensitivity and period-doubling cascade are theoretically proved, and the appearance of cyclic chaos as well as intermittency in interconnected Lorenz systems are demonstrated. A possible connection of our results with the global weather unpredictability is provided.Comment: 32 pages, 13 figure

Cutting and Shuffling a Line Segment: Mixing by Interval Exchange Transformations

We present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing processes. Illustrative examples of the mixing behaviors, including pathological cases that violate the assumptions of the known governing theorems and lead to poor mixing, are shown. Since the mathematical theory applies as the number of iterations of the map goes to infinity, we introduce practical measures of mixing (the percent unmixed and the number of intermaterial interfaces) that can be computed over given (finite) numbers of iterations. We find that good mixing can be achieved after a finite number of iterations of a one-dimensional cutting and shuffling map, even though such a map cannot be considered chaotic in the usual sense and/or it may not fulfill the conditions of the ergodic theorems for interval exchange transformations. Specifically, good shuffling can occur with only six or seven intervals of roughly the same length, as long as the rearrangement order is an irreducible permutation. This study has implications for a number of mixing processes in which discontinuities arise either by construction or due to the underlying physics.Comment: 21 pages, 10 figures, ws-ijbc class; accepted for publication in International Journal of Bifurcation and Chao

Distributional chaotic generalized shifts

Suppose $X$ is a finite discrete space with at least two elements, $\Gamma$ is a nonempty countable set, and consider self--map $\varphi:\Gamma\to\Gamma$. We prove that the generalized shift $\sigma_\varphi:X^\Gamma\to X^\Gamma$ with $\sigma_\varphi((x_\alpha)_{\alpha\in\Gamma})=(x_{\varphi(\alpha)})_{\alpha\in\Gamma}$ (for $(x_\alpha)_{\alpha\in\Gamma}\in X^\Gamma$) is: $\bullet$ distributional chaotic (uniform, type 1, type 2) if and only if $\varphi:\Gamma\to\Gamma$ has at least a non-quasi-periodic point, $\bullet$ dense distributional chaotic if and only if $\varphi:\Gamma\to\Gamma$ does not have any periodic point, $\bullet$ transitive distributional chaotic if and only if $\varphi:\Gamma\to\Gamma$ is one--to--one without any periodic point. We complete the text by counterexamples.Comment: 13 page