Programmed OL-systems

In this paper, two generalizations of OL-systems called strong programmed OL-systems and weak programmed OL-systems are introduced. The interesting feature is that the class of programmed OLs contains the class of CFPGs. The relationships with Chomskian grammars and other L-systems are established. The closure properties of the models introduced under various operations are studied.     

Advanced Programmed Motion Tracking Control of Nonholonomic Mechanical Systems

Trajectory tracking control of nonholonomic systems has been extended to tracking a desired motion. The desired motion is specified by equations of constraints, referred to as programmed, which may be differential equations of high order and may be nonholonomic. The strategy enables motion tracking control under the assumption that the system dynamics are accurately known. It is referred to as a model reference tracking control strategy for programmed motion. In this paper, adaptive and repetitive extensions of the strategy are proposed. Two selected advanced tracking control algorithms, i.e., the desired compensation adaptation law and the repetitive control law, which were originally dedicated to holonomic systems, are adapted to motion tracking control of nonholonomic systems. Simulation studies that illustrate programmed motion tracking control of systems with unknown parameters and the performance of repetitive motions are provided. A new performance measure to evaluate a programmed motion tracking performance is introduced.      

Programmed Mutagenesis Is Universal

Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that programmed mutagenesis is theoretically universal by showing how Minsky's 4-symbol 7-state Universal Turing Machine [11] can be implemented using a programmed mutagenesis system. Each step of the Universal Turing Machine is implemented by four cycles of programmed mutagenesis, and progress is guaranteed by the use of alternate sense strands for each rewriting cycle. The measured efficiency of an in vitro programmed mutagenesis system suggests that segregating the products of DNA replication into separate compartments would be an efficient way to implement molecular computation.     

某有源靶弹微波源程序指向系统的设计与实现

针对有源靶弹供靶过程中因靶弹微波源对被试舰艇照射不稳定而导致供靶失败的问题,论证了微波源程序指向系统的技术要求,介绍了基于安控系统的有源靶弹微波源程序指向系统一体化设计方案,研制了某有源靶弹微波源程序指向系统,通过实际应用表明,该系统具有指向精度高、工作可靠、可扩展性强等特点,大大提高了掠海有源靶弹的供靶成功率。     

The direct algorithm for calculating programmed controls of a special form in the problem of guidance of an orbital telescope

The problem is studied for calculating the programmed control of an orbital telescope with two-stage powered gyroscopes as actuators of the control system. Modifications are considered of the direct method for calculating the programmed controls, which is alternative to the method of inverse problems of dynamics. The suggested versions of the algorithm afford either the calculation of smooth controls taking prescribed values at the initial and the finite instant of time or the calculation of piecewise linear programmed controls realizable by the rotation of gyronodes with constant accelerations. The special feature of the dynamic model of an orbital telescope is the availability of the model of an invariant manifold in the space of states. The presented algorithm rebuilds the linearized model at each iteration of the calculation, its boundary conditions, and makes up a collection of independent variables of the state for these conditions.     

A useful lemma for context-free programmed grammars

We show that all quasi-realtime one-way multi-counter languages can be generated by a context-free -free programmed grammar (even under the free interpretation). The result can be used to obtain a new and almost trivial proof of the fundamental theorem that arbitrary context-free programmed grammars can generate all recursively enumerable languages. The proof of our result also yields the following, interesting characterization: the quasi-realtime one-way multi-counter languages are precisely the -limited homomorphic images of (free) context-free programmed production languages. It follows that the (free) derivation languages of context-free or even context-free programmed grammars, which were known to be context-sensitive, are in fact contained in the family of context-free -free programmed languages.     

基于SOAP的组播IP-TS流控制软件的开发

为实现软件控制IP传送(IP transm ission,IP-TS)流组播汇聚,在分析交换板的接口函数代码后进行了基于简单对象访问协议(simp le ob ject access protocol,SOAP)的组播控制模块的开发、MySQL数据库建模,并编写了超文本预处理器(hypertext preprocessor,PHP)网络页面脚本。该软件应用于实际硬件系统中,能够使用户通过网页操作发出配置指令来完成组播IP-TS流的汇聚控制,而基于SOAP协议的软件则能够在分布式的环境下较稳定地实现控制功能。     

使用IEEE—488总线的计算机自动测试系统

本文介绍通用仪器仪表标准总线IEEE-488，连接计算机和程控仪器，配以软件设计，组成自动测试系统。还介绍了适合于PC机的IEEE－488适配器与程控仪器的编程。     

移动机器人Java Agent控制系统设计

针对移动机器人的任务和硬件组成,提出了基于Java 开发平台的Agent控制系统设计方法。以目前应用较广泛的JADE作为Agent开发平台,采用JNI方法实现了Agent与硬件系统的交互。在运动控制卡上设计了有实时性要求的轨迹生成、运动控制、位姿估计和安全控制等4个行为任务,将数据库和路径规划等管理性行为设计在车载PC104工业控制计算机上。人机交互界面可作为独立的Agent驻留在上位监控计算机上。这种方法结合了Java Agent开发平台的普遍性和工业控制的实时性,实验证明了该方法的可行性。     

Experimental efficiency of programmed mutagenesis

Mismatched DNA annealing followed by strand replication can cause the programmed evolution of DNA sequences. We have reported that this process is theoretically equivalent in computational power to a desktop computer by demonstrating a constructive way to encode arbitrary computations as DNA molecules within the framework of programmed mutagenesis, a system that consists solely of cycles of DNA annealing, polymerization, and ligation.^1,2) Thus, programmed mutagenesis is theoretically universal and we report here the experimental efficiency of its primitive operations. The measured efficiency of an in vitro programmed mutagenesis system suggests that segregating the products of DNA replication into separate compartments would be an efficient way to implement molecular computation. For computer science, using single DNA molecules to represent the state of a computation holds the promise of a new paradigm of composable molecular computing. For biology, the demonstration that DNA sequences could guide their own evolution under computational rules may have implications as we begin to unravel the mysteries of genome encoding and natural evolution. Julia Khodor, Ph.D.: She has just received her Ph.D. in Electrical Engineering and Computer Science from MIT and is now enjoying her time off with her new daughter. She received her B.S. in Mathematics with Computer Science and B.S. in Biology in 1996 and her M.S. in Computer Science in 1998, all from MIT. Her graduate research was in the area of biological computing, primarily focusing on programmed mutagenesis. She is looking forward to the joys and challenges of an academic career. David K. Gifford, Ph.D.: He is a professor of computer science and electrical engineering at MIT, where he leads a research group investigating issues in computational functional genomics. His research interests include understanding data from high-throughput experimental systems using probabilistic modeling techniques. He received a Ph.D. in computer science from Stanford University.     

The programmed MOCODISS package and its application to design of rod systems on the elastic base

The work deals with the programmed system of MOCODISS (Modeling of Continuous-Discrete Systems) that permits calculating and designing rod systems on the elastic base. The mathematical model is presented that describes the dynamics of elastically attached rods with associated masses on the inhomogeneous base. Principal functional possibilities and the field of application of the programmed MOCODISS package are considered. The application is shown of the package to the problem of lateral oscillations of the rod system with elastic joints on the elastic step base.     

On the Equations of Kinematics and Dynamics of Constrained Mechanical Systems

The method of constructing of kinematical and dynamicalequations of mechanical systems, applied to numerical realization, isproposed in this paper. The corresponding difference equations, whichare obtained, give a guarantee of computations with given precision. Theequations of programmed constraints and those of constraintperturbations are defined. The stability of the programmed manifold fornumerical solutions of the kinematical and dynamical equations isobtained by means of corresponding construction of the constraintperturbation equations. The dynamical equations of system withprogrammed constraints are set up in the form of Lagrange equations ingeneralized coordinates. Certain inverse problems of rigid body dynamicsare considered.     

Graph Based Debugging with Fujaba

This work is part of the Fujaba project. The Fujaba project aims to use the Unified Modeling Language UML as a programmed graph rewriting language. This paper describes the new graph based debugging functionality that has just been added to the Fujaba environment. This new debugging functionality allows to visualize Java heap object structures as the current host graph and to execute programmed graph rewrite rules stepwise.     

嵌入式汇编语言软件单元测试方法

单元测试是在整个软件开发过程中的一个重要环节,单元是软件的构成基础,因此单元的质量是整个软件质量的保证。嵌入式软件由于与CPu密切相关,多采用汇编语言编程,使得其测试一直是个难点,特别是单元测试。针对嵌入式软件的特点,本文根据软件单元测试的理论,介绍一种使用旋极AsmTester对嵌入式汇编语言编程的软件进行单元测试的方法。     

On the generative power of sequential and parallel programmed graph grammars

Programmed graph grammars are formally introduced and their generative power is investigated. Programmed graph grammars differ from other approaches to graph grammars in the so-called control diagram which controls the application order of productions. Restricting the form of the productions of a programmed graph grammar we get several classes of graph languages. These are compared mutually as well as with the hierarchy introduced by Nagl [18]. For unrestricted and monotone productions corresponding classes of graph languages coincide, while the class of context free programmed graph languages is properly contained in the class of context free graph languages in the sense of [18].     

Artificial life based on the programmed self-decomposition model, SIVA

To examine the effect and significance of the phenomenon of death, we have developed an artificial life simulator, SIVA-III (simulator for individuals of virtual automata III), based on a “programmed self-decomposition model”. The architecture of this simulator consists of a “finite heterogeneous habitation environment” and “artificial life with programmed individual death and concurrent self-decomposition”. We conducted experiments under various settings to comparare and contrast mortal life and immortal life. The results clearly demonstrated the validity of a self-decomposing, programmed individual death, and the limitations inherent in immortal life, suggesting a striking superiority of mortal life over immortal life. This work was presented in part at the Fifth International Symposium on Artificial Life and Robotics, Oita, Japan, January 26–28, 2000     

平面多边形直骨架及软件实现算法

本文介绍一种平面多边形新的骨架-直骨架,其完全基于矢量数据处理,且具有良好的中值特性和可解性,利用STL的多向链表和优先队列数据结构设计直骨架计算的主要流程和步骤,该实现方法结构简单清晰,通用性强,可为工程实际应用提供参考。     

基于Linux的CPLD在系统升级驱动程序设计

论述了通过微控制器实现CPLD在系统升级的方法。以AT91SAM9260CPU为硬件平台,以Linux2.6.30内核为系统软件平台,基于Xilinx官方JTAG状态机实现源码,编写了CPLD在系统升级的Linux驱动程序。并将驱动以模块加载的方式成功加载进了Linux内核。编写驱动测试程序并调试,结果表明,系统能正常执行xsvf文件,实现在系统升级CPLD。     

Model-driven rapid prototyping with programmed graph transformations

Modern software systems are constantly increasing in complexity and supporting the rapid prototyping of such systems has become crucial to check the feasibility of extensions and optimizations, thereby reducing risks and, consequently, the cost of development. As modern software systems are also expected to be reused, extended, and adapted over a much longer lifetime than ever before, ensuring the maintainability of such systems is equally gaining relevance.In this paper, we present the development, optimization and maintenance of MoSo-PoLiTe, a framework for Software Product Line (SPL) testing, as a novel case study for rapid prototyping via metamodelling and programmed graph transformations.The first part of the case study evaluates the use of programmed graph transformations for optimizing an existing, hand-written system (MoSo-PoLiTe) via rapid prototyping of various strategies. In the second part, we present a complete re-engineering of the hand-written system with programmed graph transformations and provide a critical comparison of both implementations.Our results and conclusions indicate that metamodelling and programmed graph transformation are not only suitable techniques for rapid prototyping, but also lead to more maintainable systems.     

Programming squat wall strengths and tuning associated codes with pruned modular neural network

This study designed a four-layer modular neural network (MNN) to predict and program squat wall strength values. Results generated by the proposed MNN include predictions and programmed formulas that are similar in form to modular polynomials, which permit MNN programming to interpret training results in a meaningful way that offers significant advantages over famous neural networks. This study employed particle swarm optimization for MNN parameter learning and structure learning in order to prune MNN to avoid overfitting and increase programmed formula concision. To extend the uses of MNN programming, this paper further employed MNN tuning to refine existing analytical methods and codes. Case studies focused on squat wall strength analyses. Study results demonstrated that MNN programming uniquely uses a programmed formula to deliver good prediction accuracy. MNN tuning further improved the studied methods. Programmed formulas also provided insights into input parameter impacts and significant modular functions.