Existence of two solutions of m-point boundary value problem for second order dynamic equations on time scales

In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

标度系统一致性矩阵容量的计算方法

本文研究正互反矩阵的变换性质 ,提出一种保持正互反矩阵一致性程度的等价分类 ,为计算各种标度系统下的一致矩阵容量提供了计算方法     

The Asymmetric Avalanche Process

An asymmetric stochastic process describing the avalanche dynamics on a ring is proposed. A general kinetic equation which incorporates the exclusion and avalanche processes is considered. The Bethe ansatz method is used to calculate the generating function for the total distance covered by all particles. It gives the average velocity of particles which exhibits a phase transition from an intermittent to continuous flow. We calculated also higher cumulants and the large deviation function for the particle flow. The latter has the universal form obtained earlier for the asymmetric exclusion process and conjectured to be common for all models of the Kardar–Parisi–Zhang universality class.     

酵母蛋白质网络的动力学性质

蛋白质-蛋白质、蛋白质-DNA相互作用网络决定了细胞中各种关键功能的执行．基于芽殖酵母(budding yeast saccharomyces cerevisiae)的蛋白质-蛋白质相互作用网络数据和相关的实验文献，我们建立了调控细胞周期和生命周期(cell cycle and life cycle)的蛋白质网络，并利用离散模型研究了该网络的动力学性质，研究表明：细胞周期网络的动力学性质具有很强的稳定性，约94％的蛋白质初态将演化到对应于生物学G1基态的稳定态，使其成为惟一的全局吸引点；同时，绝大多数的初态的演化路径都通过由G1激发态到G1基态的细胞周期演化路径，使细胞周期路径成为全局性的“吸引”路径。     

Liminf results on the increments of an (N,d)-Gaussian process

We establish some liminf theorems on the increments of a (N,d)-Gaussian process with the usual Euclidean norm, via estimating upper bounds of large deviation probabilities on the suprema of the (N,d)-Gaussian process. This revised version was published online in June 2006 with corrections to the Cover Date.     

Decentralized iterative learning control for a class of large scale interconnected dynamical systems

The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes.     

The Laplace transform on time scales revisited

In this work, we reexamine the time scale Laplace transform as defined by Bohner and Peterson [M. Bohner, A. Peterson, Dynamic Equations on Time Scales: An Introduction with Applications, Birkhäuser, Boston, 2001; M. Bohner, A. Peterson, Laplace transform and Z-transform: Unification and extension, Methods Appl. Anal. 9 (1) (2002) 155-162]. In particular, we give conditions on the class of functions which have a transform, develop an inversion formula for the transform, and further, we provide a convolution for the transform. The notion of convolution leads to considering its algebraic structure—in particular the existence of an identity element—motivating the development of the Dirac delta functional on time scales. Applications and examples of these concepts are given.     

OSCILLATION FOR NONAUTONOMOUS NEUTRAL DYNAMIC DELAY EQUATIONS ON TIME SCALES

The article is concerned with oscillation of nonautonomous neutral dynamic delay equations on time scales. Sufficient conditions are established for the existence of bounded positive solutions and for oscillation of all solutions of this equation. Some results extend known results for difference equations when the time scale is the set Z of positive integers and for differential equations when the time scale is the set R of real numbers.