Simulation of the oregonator model by using deterministic ARMS

We propose a deterministic method for simulating chemical reactions, deterministic abstract rewriting system on multisets (DARMS), which is based on the concept of mass action low. The feasibility and utility of DARMS are demonstrated by applying it to the oregonator, which is a well-known model of the Belousov-Zhabotinskii (BZ) reaction. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

三维数字摄影图中注记点高程值的自动检查

针对三维数字摄影图中注记点高程值出现的某些问题，进行了探索、研究，编写了对三维数字摄影图中注记点高程值进行自动检查与提取的程序，该程序的应用使三维数字摄影图中注记点高程值的数据质量有了保证。     

基于文本理解的自动文摘系统研究与实现

本系统模拟人的理解、知识获取认知过程，利用全信息词典有效地组织语言学知识。背景知识和领域知识，利用部分分析器算法，实现语法语义语用分析一体化，从文本中提取重要信息，将任一篇文章转换为计算机内的一个信息提取框架实体．根据填充情况，由文摘生成器产生合适的文摘．目前已实现计算机病毒领域文章的自动文摘，验证了文摘模型的可行性和有效性．文摘系统模型与领域无关．     

Experience with the universal intermediate language janus

Janus is a symbolic language intended for use as an intermediate language in the transportation of software. Since its initial design four years ago, it has been used to implement a portable Pascal compiler, in the design of an Algol 68 compiler, and to realize a portable package of mathematical routines. These experiences, together with a critical re-evaluation of the design criteria, have led to some modification of the specifications of Janus and an increased confidence in the viability of the approach. They have also indicated some problems yet to be solved. This paper reviews the significant lessons which we have learned, and quotes some results which support our confidence.     

Pointers and data abstractions in high level languages—II: Correctness proofs

Recognizing the problems that the use of pointers pose to the construction of reliable software, this two-part paper proposes a scheme by which pointers may be used in a controlled manner to build data abstractions without being used as abstractions in their own right. Part I, published in Computer Languages 2, 135–148, presents the language constructs facilitating the proposal. Part II, in this Issue, attempts to show, by use of a fairly complex example, that proving the correctness of an implementation of an abstraction built in this manner from pointers need not be more difficult than other implementation correctness proofs.     

家具产品生命周期的细分与设计策略

家具产品生命周期是指家具产品从最初的产品开发到被市场淘汰的全过程,分为开发期,导入期,成长期,成熟期和衰退期。在指导具体的家具企业产品开发实践活动时,家具产品生命周期的内涵可拓展为具体家具产品生命周期和抽象家具产品生命周期。只有把这两者结合起来考虑家具产品生命周期不同阶段的设计策略,才能指导不同的家具企业更好的发展。     

莲藕柔性去皮机的研究

介绍了莲藕去皮机的结构和工作原理,对莲藕的几何特性进行了统计分析,研究了刷轮厚度、喂入速度、动刷轮转速对去皮性能的影响规律,并进行了技术经济分析。     

A semantically-based formatting discipline for Pascal

The abstract (or semantic) syntax of the Pascal language is identified, and a linear representation for the trees so formed within the framework of the concrete syntax for that language is imposed. The indentation scheme so formed, augmented with a small number of pragmatic considerations, is compared with several previously proposed formatting schemes for Pascal and an example of the use of this new method is given.     

Distributing and revoking access authorizations on abstract objecs: A capability approch

In this paper a capability addressing environment is presented, based on the concept of extended capability. First of all it is shown that such an environment is well suited for implementing objects of abstract type. Then the problem of distributing and revoking access authorizations on abstract objects is considered and an efficient solution is presented. The revocation mechanism results in being selective, transitive and deferred.     

Designing structured cobol programs

COBOL is now more than 20 years old and will probably survive to become much older. Since it has some features which are out of date it is desirable to adapt at least the program style to some standards of modern programming languages. The adaption is not only a matter of style but also of costs of program production and program maintenance. This paper presents constructional rules for programming in COBOL which by-pass some of the drawbacks and allow more readable and more maintainable program structures. Finally a postprocessor is presented, that allows verification of the chosen constructional rules and documentation of the resulting programs.