Computerprogramm zur interaktiven Auswertung von 15N-tracerkinetischen Stoffwechselexperimenten

The theoretical concept of the computer program is based on the compartment theory for the 3-pool model using single pulse administration of the tracer. The code estimates the model parameters by means of the non-linear method of least squares fit under steady state conditions. Furthermore the parameters of the protein metabolism are calculated. The program works interactively and allows reading and modifying the experimental ¹⁵N tracer data via terminal and controlling the program.     

Tracking problem under a time-varying topology

This paper studies the multi-agent tracking problem of a third-order maneuvering target under uncertain communication environments. Each tracking agent is assumed to be a third-order system and can only use its own and neighbors＇ position, velocity, and acceleration information to design its control input. In this work, the uncertain communication environments are modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sufficient conditions for the existence of a tracking strategy have been expressed in terms of the solvability of linear matrix inequalities. Finally, a numerical example is employed to demonstrate the effectiveness of the proposed tracking strategy.     

Impulsive control of nonlinear systems with time-varying delays

A whole impulsive control scheme of nonlinear systems with time-varying delays, which is an extension for impulsive control of nonlinear systems without time delay, is presented in this paper. Utilizing the Lyapunov functions and the impulsive-type comparison principles, we establish a series of different conditions under which impulsively controlled nonlinear systems with time-varying delays are asymptotically stable. Then we estimate upper bounds of impulse interval and time-varying delays for asymptotically stable control. Finally a numerical example is given to illustrate the effectiveness of the method.     

Robust adaptive synchronization of chaotic neural networks by slide technique

In this paper, we focus on the robust adaptive synchronization between two coupled chaotic neural networks with all the parameters unknown and time-varying delay. In order to increase the robustness of the two coupled neural networks, the key idea is that a sliding-mode-type controller is employed. Moreover, without the estimate values of the network unknown parameters taken as an updating object, a new updating object is introduced in the constructing of controller. Using the proposed controller, without any requirements for the boundedness, monotonicity and differentiability of activation functions, and symmetry of connections, the two coupled chaotic neural networks can achieve global robust synchronization no matter what their initial states are. Finally, the numerical simulation validates the effectiveness and feasibility of the proposed technique.     

Synchronization of stochastically hybrid coupled neural networks with coupling discrete and distributed time-varying delays

A general model of linearly stochastically coupled identical connected neural networks with hybrid coupling is proposed, which is composed of constant coupling, coupling discrete time-varying delay and coupling distributed timevarying delay. All the coupling terms are subjected to stochastic disturbances described in terms of Brownian motion, which reflects a more realistic dynamical behaviour of coupled systems in practice. Based on a simple adaptive feedback controller and stochastic stability theory, several sufficient criteria are presented to ensure the synchronization of linearly stochastically coupled complex networks with coupling mixed time-varying delays. Finally, numerical simulations illustrated by scale-free complex networks verify the effectiveness of the proposed controllers.     

Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa

This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any -minihyper, with , where , is the disjoint union of points, lines,..., -dimensional subspaces. For q large, we improve on this result by increasing the upper bound on non-square, to non-square, square, , and (4) for square, p prime, p<3, to . In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry . For the coding-theoretical problem, our results classify the corresponding codes meeting the Griesmer bound.     

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg then the state complexity of is equal to the Wolf bound. For deg , we use Clifford's theorem to give a simple lower bound on the state complexity of . We then derive two further lower bounds on the state space dimensions of in terms of the gonality sequence of . (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.     

Existence of Perfect 4-Deletion-Correcting Codes with Length Six

By a T ^*(2, k, v)-code we mean a perfect4-deletion-correcting code of length 6 over an alphabet of size v, which is capable of correcting anycombination of up to 4 deletions and/or insertions of letters that occur in transmission of codewords. Thethird author (DCC Vol. 23, No. 1) presented a combinatorial construction for such codes and prove thata T ^*(2, 6, v)-code exists for all positive integers v 3 (mod 5), with 12 possible exceptions of v. In this paper, the notion of a directedgroup divisible quasidesign is introduced and used to show that a T ^*(2, 6,v)-code exists for all positive integers v 3 (mod 5), except possiblyfor v {173, 178, 203, 208}. The 12 missing cases for T ^*(2,6, v)-codes with v 3 (mod 5) are also provided, thereby the existenceproblem for T ^*(2, 6, v)-codes is almost complete.