Stability analysis of neutral systems with distributed delays

The stability of neutral systems with distributed delays is investigated in this paper. A modified Lyapunov-Krasovskii functional is constructed to study this class of systems. The proposed stability criterion is discrete-, distributed- and neutral-delay-dependent. In addition, by this method one can study the case when the coefficient matrix of the neutral delay term is time-varying uncertain. The reduced conservatism is illustrated in a numerical example.     

Control of frictional dynamics of a one-dimensional particle array

Control of frictional forces is required in many applications of tribology. While the problem is approached by chemical means traditionally, a recent approach was proposed to control the system mechanically to tune frictional responses. We design feedback control laws for a one-dimensional particle array sliding on a surface subject to friction. The Frenkel-Kontorova model describing the dynamics is a nonlinear interconnected system and the accessible control elements are average quantities only. We prove local stability of equilibrium points of the un-controlled system in the presence of linear and nonlinear particle interactions, respectively. We then formulate a tracking control problem, whose control objective is for the average system to reach a designated targeted velocity using accessible elements. Sufficient stabilization conditions are explicitly derived for the closed-loop error systems using the Lyapunov theory based methods. Simulation results show satisfactory performances. The results can be applied to other physical systems whose dynamics is described by the Frenkel-Kontorova model.     

模拟时滞化学反应系统中的DK-Leap算法

最近发展的可精确模拟时滞化学反应系统的动力学状态的时滞随机模拟算法(delay stochastic simulation algorithm,DSSA)的模拟效率很低。本文提出了一个模拟时滞化学反应系统的加速DK-Leap(Delay K-Leap)算法。DK-Leap算法首先确定满足Leap条件的总反应次数K,然后利用得到τ的概率密度函数随机确定时间区间[t,t τ)。由于每个反应通道的反应次数由K确定,该算法可得到较好的模拟精度。数值试验表明DK-Leap算法在模拟时滞化学反应系统时能取得很好的性能。     

Computing presentations for subgroups of polycyclic groups and of context-free groups

Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92     

A quantized set-membership estimation-based heading control method of unmanned surface vessels under unknown-but-bounded wave-induced disturbances

This paper is concerned with the heading tracking control problem for a network-based unmanned surface vessel (USV) under wave-induced disturbances. Considering the characteristics of the wave-induced disturbances, the unknown-but-bounded (UBB) noise model is adopted. Meanwhile, signal quantization is taken into account due to the limited capacity of the communication channel. Based on these considerations, a novel set-membership based control scheme is proposed, which consists of a set-membership filter (SMF) and a set-membership controller (SMC). In the proposed control scheme, the SMF is designed for providing an ellipsoidal estimation set for the USV at each sampling step, and then the SMC uses the estimation set for producing control input for the USV in order to track the reference. Sufficient conditions are derived for the considered USV system to be asymptotically stable and satisfy the modified set-membership performance constraint. Simulation results verifies the effectiveness of the proposed control scheme.     

Stabilization of uncertain networked control systems with actuator saturation and probabilistic cyberattacks

This paper investigates the stabilization of uncertain networked control systems (NCSs) with actuator saturation and cyberattacks. The cyberattacks are governed by a set of independent random variables satisfying Bernoulli distribution. To relieve the network bandwidth load effectively, an event-triggered communication strategy is proposed. By employing Lyapunov stability theory and stochastic analysis techniques, a stability criterion is obtained for the system with actuator saturation and cyberattacks. Moreover, the desired controller gain is derived by solving some matrix inequalities. Finally, the validity and applicability of the criteria are verified through numerical examples.     

Japanese educational and learning systems in the post-industrial society: A value chain of educational and learning systems

Japan's educational system has some major problems. The most important among these concerns is the basic concept of the educational process and the goal of education. The old concept of public educational systems has become outdated in today's Japanese society, although this concept had supported social and spiritual faith, economic success and selfless devotion to one's country for more than 100 years. Now, Japanese people need a new concept of the educational process and the goal of education for the twenty-first century. The paper proposes a value chain of educational and learning systems aimed at building a network consisting of multiple fields for fostering future human resources.     

ARPO-2: An expert system for legal advice on the breach of building contracts

Although Berman and Hafner [Berman 1989, pp. 928–938] presented the possibility to adapt the model of reasoning of development of an expert system for medical diagnosis to the reasoning of a judge when he/she sentences criminals does not resemble the reasoning found in the decisions of physicians, mathematicians or statisticians.When a lawyer reasons, he/she not only looks for the solution of a case; he/she simultaneously looks for the bases on which his/her reasoning can rest [Galindo 1992, pp. 363–367]. That is to say, he/she not only needs to find the solution but moreover he/she has to find the references (laws, jurisprudence and bibliography) that allow him/her to argue the solution.In many cases, computer solutions to these reasoning processes have been made in a separated way: the solution to the cases using expert systems, and the search of documentation using information retrieval systems.This paper presents the ARPO-2 prototype, a solution integrating the two aspects of legal reasoning: an expert system which is able to simultaneously find the solution to a problem and to give the necessary references so that the lawyer argues the solution. The subject on which the prototype solves problems is the breach of building contracts.In this paper, we describe the process of development of an expert system for solving, justification and documentation of breach of contracts, giving details on the way how the objects that intervene in the case were defined as well as on the reasoning followed.This paper was funded in part by DGICYT, Spanish Civil Law Computerization Project: PB870-632.     

美国一流大学计算机组成与系统结构实验课程研究

文章针对美国一流大学的计算机组成与系统结构实验课程进行研究,重点介绍UC Berkeley,MIT,Stanford University,CMU相关实验课程的内容和特色,为我国大学计算机组成与系统结构实验课程今后的改革与发展提供参考。