Identification of novel non-autonomous CemaT transposable elements and evidence of their mobility within the C. elegans genome

We describe here two new transposable elements, CemaT4 and CemaT5, that were identified within the sequenced genome of Caenorhabditis elegans using homology based searches. Five variants of CemaT4 were found, all non-autonomous and sharing 26 bp inverted terminal repeats (ITRs) and segments (152-367 bp) of sequence with similarity to the CemaT1 transposon of C. elegans. Sixteen copies of a short, 30 bp repetitive sequence, comprised entirely of an inverted repeat of the first 15 bp of CemaT4's ITR, were also found, each flanked by TA dinucleotide duplications, which are hallmarks of target site duplications of mariner-Tc transposon transpositions. The CemaT5 transposable element had no similarity to maT elements, except for sharing identical ITR sequences with CemaT3. We provide evidence that CemaT5 and CemaT3 are capable of excising from the C. elegans genome, despite neither transposon being capable of encoding a functional transposase enzyme. Presumably, these two transposons are cross-mobilised by an autonomous transposon that recognises their shared ITRs. The excisions of these and other non-autonomous elements may provide opportunities for abortive gap repair to create internal deletions and/or insert novel sequence within these transposons. The influence of non-autonomous element mobility and structural diversity on genome variation is discussed.

Set-valued Markov chains and negative semitrajectories of discretized dynamical systems

Computer simulation of dynamical systems involves a phase space which is the finite set of machine arithmetic. Rounding state values of the continuous system to this grid yields a spatially discrete dynamical system, often with different dynamical behaviour. Discretization of an invertible smooth system gives a system with set-valued negative semitrajectories. As the grid is refined, asymptotic behaviour of the semitrajectories follows probabilistic laws which correspond to a set-valued Markov chain, whose transition probabilities can be explicitly calculated. The results are illustrated for two-dimensional dynamical systems obtained by discretization of fractional linear transformations of the unit disc in the complex plane.

Integrable coupling in a model for Josephson tunneling between non-identical BCS systems

We extend a recent construction for an integrable model describing Josephson tunneling between identical BCS systems to the case where the BCS systems have different single particle energy levels. The exact solution of this generalized model is obtained through the Bethe ansatz.

Suppressing chaos via Lyapunov-Krasovskii's method

An algorithm for suppressing the chaotic oscillations in non-linear dynamical systems with singular Jacobian matrices is developed using a linear feedback control law based upon the Lyapunov-Krasovskii (LK) method. It appears that the LK method can serve effectively as a generalised method for the suppression of chaotic oscillations for a wide range of systems. Based on this method, the resulting conditions for undisturbed motions to be locally or globally stable are sufficient and conservative. The generalized Lorenz system and disturbed gyrostat equations are exemplified for the validation of the proposed feedback control rule. (c) 2005 Elsevier Ltd. All rights reserved.

On the Hopf bifurcation in control systems with a bounded nonlinearity asymptotically homogeneous at infinity

The paper studies existence, uniqueness, and stability of large-amplitude periodic cycles arising in Hopf bifurcation at infinity of autonomous control systems with bounded nonlinear feedback. We consider systems with functional nonlinearities of Landesman-Lazer type and a class of systems with hysteresis nonlinearities. The method is based on the technique of parameter functionalization and methods of monotone concave and convex operators. (C) 2001 Academic Press.

A uniform white-noise model for fixed-point roundoff errors in digital systems

Fixed-point roundoff noise in digital implementation of linear systems arises due to overflow, quantization of coefficients and input signals, and arithmetical errors. In uniform white-noise models, the last two types of roundoff errors are regarded as uniformly distributed independent random vectors on cubes of suitable size. For input signal quantization errors, the heuristic model is justified by a quantization theorem, which cannot be directly applied to arithmetical errors due to the complicated input-dependence of errors. The complete uniform white-noise model is shown to be valid in the sense of weak convergence of probabilistic measures as the lattice step tends to zero if the matrices of realization of the system in the state space satisfy certain nonresonance conditions and the finite-dimensional distributions of the input signal are absolutely continuous.

Explicit/implicit partitioning and a new explicit form of the generalized alpha method

Most finite element packages use the Newmark algorithm for time integration of structural dynamics. Various algorithms have been proposed to better optimize the high frequency dissipation of this algorithm. Hulbert and Chung proposed both implicit and explicit forms of the generalized alpha method. The algorithms optimize high frequency dissipation effectively, and despite recent work on algorithms that possess momentum conserving/energy dissipative properties in a non-linear context, the generalized alpha method remains an efficient way to solve many problems, especially with adaptive timestep control. However, the implicit and explicit algorithms use incompatible parameter sets and cannot be used together in a spatial partition, whereas this can be done for the Newmark algorithm, as Hughes and Liu demonstrated, and for the HHT-alpha algorithm developed from it. The present paper shows that the explicit generalized alpha method can be rewritten so that it becomes compatible with the implicit form. All four algorithmic parameters can be matched between the explicit and implicit forms. An element interface between implicit and explicit partitions can then be used, analogous to that devised by Hughes and Liu to extend the Newmark method. The stability of the explicit/implicit algorithm is examined in a linear context and found to exceed that of the explicit partition. The element partition is significantly less dissipative of intermediate frequencies than one using the HHT-alpha method. The explicit algorithm can also be rewritten so that the discrete equation of motion evaluates forces from displacements and velocities found at the predicted mid-point of a cycle. Copyright (C) 2003 John Wiley Sons, Ltd.

Hamiltonian mappings and circle packing phase spaces.

We introduce three area preserving maps with phase space structures which resemble circle packings. Each mapping is derived from a kicked Hamiltonian system with one of the three different phase space geometries (planar, hyperbolic or spherical) and exhibits an infinite number of coexisting stable periodic orbits which appear to ‘pack’ the phase space with circular resonances.

A power system control scheme based on security visualisation in parameter space

Power system real time security assessment is one of the fundamental modules of the electricity markets. Typically, when a contingency occurs, it is required that security assessment and enhancement module shall be ready for action within about 20 minutes’ time to meet the real time requirement. The recent California black out again highlighted the importance of system security. This paper proposed an approach for power system security assessment and enhancement based on the information provided from the pre-defined system parameter space. The proposed scheme opens up an efficient way for real time security assessment and enhancement in a competitive electricity market for single contingency case

Comparison of BR and QR Eigenvalue Algorithms for Power System Small Signal Stability Analysis

The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.

Asymptotic limits of a self-dual Ginzburg-Landau functional in bounded domains

In the author's joint paper [HJS] with Jest and Struwe, we discuss asymtotic limits of a self-dual Ginzburg-Landau functional involving a section of a line bundle over a closed Riemann surface and a connection on this bundle. In this paper, the author generalizes the above results [HJS] to the case of bounded domains.

Programming internet based DAI applications in Qu-Prolog

This paper presents the unique collection of additional features of Qu-Prolog, a variant of the Al programming language Prolog, and illustrates how they can be used for implementing DAI applications. By this we mean applications comprising communicating information servers, expert systems, or agents, with sophisticated reasoning capabilities and internal concurrency. Such an application exploits the key features of Qu-Prolog: support for the programming of sound non-clausal inference systems, multi-threading, and high level inter-thread message communication between Qu-Prolog query threads anywhere on the internet. The inter-thread communication uses email style symbolic names for threads, allowing easy construction of distributed applications using public names for threads. How threads react to received messages is specified by a disjunction of reaction rules which the thread periodically executes. A communications API allows smooth integration of components written in C, which to Qu-Prolog, look like remote query threads.

Heat flow for Yang-Mills-Higgs fields, part I

The Yang-Mills-Higgs field generalizes the Yang-Mills field. The authors establish the local existence and uniqueness of the weak solution to the heat flow for the Yang-Mills-Higgs field in a vector bundle over a compact Riemannian 4-manifold, and show that the weak solution is gauge-equivalent to a smooth solution and there are at most finite singularities at the maximum existing time.