复杂系统的一般数学框架(Ⅰ)

复杂系统的基本和最简单的结构就是网络.根据这一思想,本系列论文拟发展一套处理复杂系统的新数学框架.本文详细论述了系统的概念、一般描述方法:系统=(硬部,软部,环境)和局整关系,包括子系统、元素与系统的关系和系统与系统的关系;给出了系统运算的基本法则;简要论述了系统的软、硬部之间的诱导转化.     

A theory for synchronization of dynamical systems

In this paper, a theory for synchronization of multiple dynamical systems under specific constraints is developed from a theory of discontinuous dynamical systems. The concepts on synchronization of two or more dynamical systems to specific constraints are presented. The synchronization, desynchronization and penetration of multiple dynamical systems to multiple specified constraints are discussed, and the necessary and sufficient conditions for such synchronicity are developed. The synchronicity of two dynamical systems to a single specific constraint and to multiple specific constraints is investigated. Finally, the synchronization and the corresponding complexity for multiple slave systems with multiple master systems are discussed briefly. The meaning of synchronization for dynamical systems with constraints is extended as a generalized, universal concept. The theory presented in this paper may be as a universal theory for dynamical systems. The paper provides a theoretic frame work in order to control slave systems which can be synchronized with master systems through specific constraints in a general sense.     

On the heritability of the property <Emphasis Type="Italic">D</Emphasis><Subscript><Emphasis Type="Italic">π</Emphasis></Subscript> by subgroups

We consider the so-called Jordan-Pochhammer systems, a special class of linear Pfaffian systems of Fuchsian type on complex linear (or projective) spaces. These systems appeared as systems of differential equations for hypergeometric type integrals in which the integrand is a product of powers of linear functions. These systems also arise in some reductions of the Knizhnik-Zamolodchikov equations. The main advantage of these systems is the possibility of presenting a basis in the solution space of such systems in an explicit integral form and, as a consequence, of describing their monodromy representation. The main focus in the paper is placed on the applications of Jordan-Pochhammer systems. We describe the relationship of Jordan-Pochhammer systems to isomonodromic deformations of Fuchsian systems that are described by the Schlesinger equations, as well as to the linearization of the dynamical system of bending spatial polygons. We also describe the application of Jordan-Pochhammer systems to constructing Kohno systems on the Manin-Schechtman configuration spaces.     

Yield management in UK hotels: a systems analysis

A yield management (YM) system is one of the most recent examples of systems development in the hotel industry. YM systems interact with global distribution systems, property management systems and front office systems. However, despite the prevalence of the term ‘systems’, little operational research or systems analysis has been conducted in the hotel sector. In hospitality research journals, yield management is the most researched aspect of hotel operations, but such research is largely conceptual, with limited examples of empirical or systems analysis. This study was designed to undertake, for the first time, a soft systems analysis of yield management in hotels and to develop a systems model. Research was conducted in a number of hotels implementing yield management. One of the case studies is presented to illustrate this. Using this conceptual model, YM theory is critiqued, YM practice is discussed, and subsequently a number of YM issues are identified.     

RECURSIVE SYSTEM IDENTIFICATION

Most of existing methods in system identification with possible exception of those for linear systems are off-line in nature, and hence are nonrecursive. This paper demonstrates the recent progress in recursive system identification. The recursive identification algorithms are presented not only for linear systems （multivariate ARMAX systems） but also for nonlinear systems such as the Hammerstein and Wiener systems, and the nonlinear ARX systems. The estimates generated by the algorithms are online updated and converge a.s. to the true values as time tends to infinity.     

A unified theory for coherent systems in reliability part III: Two special cases for multinary systems—binary-type coherence and homogeneous coherence

As shown in a companion-paper,¹ binary and multinary coherent systems can be studied with unified arguments, through monotone binary coherent systems. These are binary coherent systems submitted to some monotone constraint and generalize the classic theory of free binary coherent systems. By considering the unified point of view thus obtained, this paper gives what is perhaps the most suggestive representation for multinary coherent systems, since this extends the definition of binary coherent systems in terms of series-parallel (parallel-series) structures. Then, this paper examines the special case of multinary systems that can be studied directly with the classic theory of free binary coherent systems. It thus enlarges and complements, in a shorter unified manner, the particular cases considered in earlier studies.     

Ten years of genetic fuzzy systems: current framework and new trends

Fuzzy systems have demonstrated their ability to solve different kinds of problems in various application domains. Currently, there is an increasing interest to augment fuzzy systems with learning and adaptation capabilities. Two of the most successful approaches to hybridise fuzzy systems with learning and adaptation methods have been made in the realm of soft computing. Neural fuzzy systems and genetic fuzzy systems hybridise the approximate reasoning method of fuzzy systems with the learning capabilities of neural networks and evolutionary algorithms.The objective of this paper is to provide an account of genetic fuzzy systems, with special attention to genetic fuzzy rule-based systems. After a brief introduction to models and applications of genetic fuzzy systems, the field is overviewed, new trends are identified, a critical evaluation of genetic fuzzy systems for fuzzy knowledge extraction is elaborated, and open questions that remain to be addressed in the future are raised. The paper also includes some of the key references required to quickly access implementation details of genetic fuzzy systems.     

Symplectic Transformations and a Reduction Method for Asymptotically Linear Hamiltonian Systems

In many fields of applications, especially in applications from mechanics, many equations of motion can be written as Hamiltonian systems. In this paper, we study a class of asymptotically linear Hamiltonian systems. We construct a symplectic transformation which reduces the linear systems of the Hamiltonian systems. This reduction method can be applied to study the existence of periodic solutions for a class of asymptotically linear Hamiltonian systems under weaker conditions on the linear systems of the Hamiltonian systems.     

Moderate deviations for time-varying dynamic systems driven by non-homogeneous Markov chains with Two-time Scales

Motivated by problems arising in time-dependent queues and dynamic systems with random environment, this work develops moderate deviations principles for dynamic systems driven by a fast-varying non-homogeneous Markov chain in continuous time. A distinct feature is that the Markov chain is time dependent or inhomogeneous, so are the dynamic systems. Under irreducibility of the non-homogeneous Markov chain, moderate deviations of a non-homogeneous functional are established first. With the help of a martingale problem formulation and a functional central limit theorem for the two timescale system, both upper and lower bounds of moderate deviations are obtained for the rapidly fluctuating Markovian systems. Then applications to queueing systems and dynamic systems modulated by a fast-varying Markov chain are examined.     

A unified theory for coherent systems in reliability I. A generalization for some classic theory: Monotone binary coherent systems

Binary coherent system theory has played an important part in reliability. Its extension to (‘degradable’ or ‘multistate’ or) multinary systems has recently been considered in various papers, through various definitions. This paper lays the foundations of a unified theory for coherent systems by first giving unified arguments to apply and to investigate further binary and multinary systems. Monotone binary systems are introduced and examined by generalizing classic deterministic and probabilistic results. Applications of monotone coherence to the multinary case are proposed in a companion paper with a unified viewpoint on multinary coherent systems. As an indication, monotone constraints are defined with a partition of the component set and some total orderings imposed on the elements of the concerned partition. The discrete partition retrieves the classic theory of (free) binary coherent systems; some constraints defined from component levels lead to multinary coherent systems; some other constraints apply to systems submitted to some ‘common stresses’, e.g. the organizing system of a monotone coherent decomposition.     

相对不可约合作系统解的单调性

合作系统是一类重要的动力系统,本世纪八十年代Hirsch曾就不可约合作系统给出了一系列重要结论,但在实际问题中有许多合作系统不是不可约的却具有不可约合作系统的性质,本文提出了比不可约性更广的相对不可约概念,指出这类系统的解与严格不可约系统的解同样具有强单调性,并给出严格的证明,从而将Hirsch的结果做了进一步推广,最后介绍凝血系统中相对不可约合作系统的应用实例。     

On stability for switched linear positive systems

This paper addresses the stability properties of switched linear positive systems in continuous-time as well as in discrete-time. In the discrete-time case, some sufficient and necessary conditions for asymptotic stability are derived for pairs of second order systems. Similar conditions are also established for a finite number of second order systems. Furthermore, for higher order systems, some results on stability are provided in a similar manner. In particular, in this case, a common linear Lyapunov function guaranteeing the stability of the switched positive systems can be easily located by means of geometry properties. In the continuous-time case, a finite number of second order systems are considered. Some equivalent conditions for stability of such systems are developed.     

On the Full Idle Time in Multiphase Queueing Systems

The modern queueing theory is a powerful tool for a quantitative and qualitative analysis of communication systems, computer networks, transportation systems, and many other technical systems. The paper is designated to the analysis of queueing systems arising in the network theory and communications theory (such as the so-called multiphase queueing systems, tandem queues, or series of queueing systems). We present heavy traffic limit theorems for the full idle time in multiphase queueing systems. We prove functional limit theorems for values of the full idle time of a queueing system, which is its important probability characteristic. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 367–386, July–September, 2005.     

Categorical Abstract Algebraic Logic: Leibniz Equality and Homomorphism Theorems

The study of structure systems, an abstraction of the concept of first-order structures, is continued. Structure systems have algebraic systems rather than universal algebras as their algebraic reducts. Moreover, their relational component consists of a collection of relation systems on the underlying functors rather than simply a system of relations on a single set. Congruence systems of structure systems are introduced and the Leibniz congruence system of a structure system is defined. Analogs of the Homomorphism, the Second Isomorphism and the Correspondence Theorems of Universal Algebra are provided in this more abstract context. These results generalize corresponding results of Elgueta for equality-free first-order logic. Finally, a version of Gödel’s Completeness Theorem is provided with reference to structure systems.     

Linear stationary control systems over a Boolean semiring: Geometric properties and the isomorphism problem

In the present paper, we consider linear stationary dynamical systems over a Boolean semiring B. We analyze the complete observability, identifiability, reachability, and controllability of such systems. We define the notion of a “graph of modules” of completely controllable, completely reachable Boolean linear stationary systems by analogy with the spaces of modules in the case of systems over fields. We give a graph-theoretic interpretation of systems of this class. We solve the isomorphism problem in this class of systems.     

On the Representation Theory of Lie Triple Systems

In this paper, we take a new look at the representation theory of Lie triple systems. We consider both ordinary Lie triple systems and restricted Lie triple systems in the sense of [14]. In a final section, we begin a study of the cohomology of Lie triple systems.

     

相对论性Birkhoff系统动力学方程的代数结构与Poisson积分方法

定义相对论性Ｐｆａｆｆ作用量,得到相对论性Ｐｆａｆｆ Ｂｉｒｋｈｏｆｆ原理和相对论性Ｂｉｒｋｈｏｆｆ方程．证明了自治形式和半自治形式的相对论性Ｂｉｒｋｈｏｆｆ方程具有相容代数结构和Ｌｉｅ代数结构;一般非 自治形式的相对论性Ｂｉｒｋｈｏｆｆ方程没有代数结构．研究一种特殊的非自治形式的相对论性Ｂｉｒｋｈｏｆｆ方程,它具有相容代数结构和Ｌｉｅ容许代数结构．给出相对论性Ｂｉｒｋｈｏｆｆ方程的Ｐｏｉｓｓｏｎ积分 方法．最后给出应用性实例．     

Some problems of the linear theory of systems of ordinary differential equations

We consider problems of the linear theory of systems of ordinary differential equations related to the investigation of invariant hyperplanes of these systems, the notion of equivalence for these systems, and the Floquet–Lyapunov theory for periodic systems of linear equations. In particular, we introduce the notion of equivalence of systems of linear differential equations of different orders, propose a new formula of the Floquet form for periodic systems, and present the application of this formula to the introduction of amplitude–phase coordinates in a neighborhood of a periodic trajectory of a dynamical system.