基于串口的AVR串行下载线系统设计

介绍了AVR单片机串行下载线硬件组成、工作原理和AVR编程特性，讨论了下载线监控程序和PC上位机程序设计，给出了系统设计时应注意的问题。     

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.     

Optimal Ordered Problem Solver

We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, including those programs that organize and manage and adapt and reuse earlier acquired knowledge. The Optimal Ordered Problem Solver (OOPS) draws inspiration from Levin's Universal Search designed for single problems and universal Turing machines. It spends part of the total search time for a new problem on testing programs that exploit previous solution-computing programs in computable ways. If the new problem can be solved faster by copy-editing/invoking previous code than by solving the new problem from scratch, then OOPS will find this out. If not, then at least the previous solutions will not cause much harm. We introduce an efficient, recursive, backtracking-based way of implementing OOPS on realistic computers with limited storage. Experiments illustrate how OOPS can greatly profit from metalearning or metasearching, that is, searching for faster search procedures.     

电网监控系统(SCADA)历史数据库的研究与开发

电网利用SCADA技术实现了对电网设备的监控以及数据的获取。文中论述了SCADA系统中历史数据库的构架、数据存取接口以及程序实现，介绍了如何分别向数据库存储SCADA的分类数据，并就设计和开发中遇到的一些问题和解决的方法进行了讨论。     

基于VB6.0的单片机与PC通讯的实现与应用

如何利用微机来实时监控工业现场，将被越来越多的企业所重视。为了达到用PC机与单片机通讯实现控制工业现场的目的，研究并分析了基于VB6．0的可视化性和通讯控件以及与单片机关于串行通信原理和程序设计特点，结合实例介绍了单片机与PC机的串口通讯，通过指令和数据的传送来控制工业对象的方法。通过实例可见取得了相应程序的应用效果，本研究的方法结论是：产品应用的代码具有广泛的应用价值，稍加改动即可用于其他系统。     

Slicing Software for Model Construction

Applying finite-state verification techniques (e.g., model checking) to software requires that program source code be translated to a finite-state transition system that safely models program behavior. Automatically checking such a transition system for a correctness property is typically very costly, thus it is necessary to reduce the size of the transition system as much as possible. In fact, it is often the case that much of a program's source code is irrelevant for verifying a given correctness property.In this paper, we apply program slicing techniques to remove automatically such irrelevant code and thus reduce the size of the corresponding transition system models. We give a simple extension of the classical slicing definition, and prove its safety with respect to model checking of linear temporal logic (LTL) formulae. We discuss how this slicing strategy fits into a general methodology for deriving effective software models using abstraction-based program specialization.     

编制快走丝线切割3B程序的技巧

对传统的3B编程方法进行了新的探索和实践,在传统的3B手工编程的基础上总结出了易掌握、不易出错、高效的编程技巧即“终-终-终”;“起-终-起”的方法。通过比较教学证实,它是一种高效实用的新方法。     

关于并行语言Gamma的结构化扩充

Gamma(general abstract model for multiset manipulation)语言是一个可以避免人为序化的高层次并行程序设计工具.P.Frade t等人提出结构化Gamma以利于结构化应用数据以及表达特殊的控制约束和程序的自动分析. 在摒弃了基于“地址”的定义方式的基础上,给出结构化Gamma的更一般形式的语法、语义描 述,在两个层次上讨论结构重集(structured multiset)的类型,并指出,这种新模型保持了有 关程序的静态类型检测等理论成果.     

递归Prolog程序的正确性证明

本文提出了一种称为Ｐｒｏ图的图形方法,并用该图形方法进行了递归Ｐｒｏｌｏｇ程序的正确性证明,文中包括Ｐｒｏ图的基本概念及生成规则,Ｐｒｏ图上各节点的的关系,Ｐｒｏ图的激活过程,并给出了着急递归程序正确性证明的公理和定理。