异步时序电路的功能测试自动生成方法

异步时序电路的测试一直是一个比较困难的问题。该文通过在前人研究的基础上，提出了一种实用、高效的自动测试生成方法。该方法通过使用基于OBDD(有序二元判决图)的布尔特征函数的运算求解来确定电路的状态转换图，然后通过对转换图的强连通图的搜索运算简化状态转换图，最后使用图论的方法求出测试序列。     

知识表达系统函数规则简化的理论基础

0 引言粗集理论是波兰的Z.Pawlak等一批科学家提出来的,被用来研究不完整数据、不精确知识的表达、学习、归纳等。有些学者认为它无论在理论和应用上都是一种新的、最重要的并且是迅速发展的研充领域,为机器学习、知识获取、决策分析、数据库知识发现、专家系统、决策支持系统、归纳推理、模式识别、模糊控制等提供了一种很有效的数学方法。我们的研     

弹性力学变分原理的内在演变关系及等价性证明

建立有限元模型是基于各种各样的变分原理，本文系统论述了弹性力学传统变分原理的内在演变关系，并给出了最一般意义的二类变量广义变分原理等价性的证明方法。     

自动化功能测试的方法与实现

主要讨论了对大型软件进行自动化功能测试时的一些问题,并据此对测试过程的各个方面,如创建测试计划、设计测试案例、录 制、优化和执行脚本,以及如何确认和报告缺陷等都作了一些改进,最后通过实例表明了该过程的有效性。     

Legacy system program transformation by Lyee methodology

Based on the comparative review of several approaches to legacy system conversion and revitalization, the Lyee methodology application for the issue is presented to clarify its idea, the associated procedure, and the implemented tools. It could be said that with the tools and manual developed by ICBSM&T, the mechanical transformation of the conventional program to a Lyee-structured one becomes possible as long as the programs are made in a procedure-oriented language. In addition to the program structure conversion, the Lyee methodology permits people to choose any application language in the transformed program. At the same time, quite a new approach related to the system conversion is introduced, in which the chunk of data extracted from an old program is edited to make a new conventional structure program that has a logical sequence instead of a Lyee type of declarative program. These features can be realized through the concept of LyeeBELT, which is a set of word-information about the attributes, formulae, and conditions for an independent data item.

The overall workflow of the legacy program transformation is shown in the following.

A critical part in its implementation is the feasibility study (pre-analysis) stage where necessary information is supposed to be secured, and an appropriate plan and policy about the system to be revitalized in the new system environment should be clarified so as to customize the tools accordingly. If the initial process is completed, the mechanical legacy system conversion will be realized by registering the parameters in the tool, and the reestablishment of business knowledge in the LyeeBELT will be enabled. With the regulated business logic on the LyeeBELT, the program maintenance afterwards becomes drastically simplified and stable without the ‘spaghetti’ problem, so that software evolution can be possible.     

5种绿藻对几种常用抗生素的敏感性

考察莱茵衣藻、亚心形扁藻、四爿藻、微绿球藻和小球藻5种绿藻对几种常用抗生素的敏感性，结果表明，莱茵衣藻对卡那霉素、四环素敏感，敏感浓度(细胞致死浓度，下同)均为25μg／mL，对氯霉素敏感性次之，而对氨苄青霉素不敏感；亚心形扁藻和四爿藻对氯霉素敏感，敏感浓度均为25μg／mL，对四环素、卡那霉素和氨苄青霉素不表现敏感性；小球藻和微绿球藻对实验中的4种抗生素都不敏感。     

玻璃突起路标的尺寸优化

选择几何形状较为简单、逆反射性好且铺设施工方便的玻璃突起路标进行了研究,按照光学的折射、反射原理,以玻璃突起路标的逆反射性能为优化指标,对其进行了形状尺寸的优化设计,为突起路标的生产和应用提供了理论依据。     

"抢渡长江"问题数学建模及求解分析

对“抢渡长江”问题进行了分析，建立了一种函数极值的数学模型，分析了解题思路和初等求解方法．     

气动标记机系统若干关键算法研究

作者介绍了气动标记机的作用、基本构成和工作原理,指出目前标记机控制系统中存在的一些不足,在此基础上研究了气动标记机系统中的若干关键算法,提出了NURBS曲线插补、加工轨迹优化的一种实现算法。     

A functional correspondence between call-by-need evaluators and lazy abstract machines

We bridge the gap between compositional evaluators and abstract machines for the lambda-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations. This article is a followup of our article at PPDP 2003, where we consider call by name and call by value. Here, however, we consider call by need.We derive a lazy abstract machine from an ordinary call-by-need evaluator that threads a heap of updatable cells. In this resulting abstract machine, the continuation fragment for updating a heap cell naturally appears as an ‘update marker’, an implementation technique that was invented for the Three Instruction Machine and subsequently used to construct lazy variants of Krivine's abstract machine. Tuning the evaluator leads to other implementation techniques such as unboxed values. The correctness of the resulting abstract machines is a corollary of the correctness of the original evaluators and of the program transformations used in the derivation.