Prolog逻辑程序的测试方法

Prolog逻辑程序设计语言具有不同于传统程序设计语言的特点.本文根据测试Prolog程序的实践,提出了一系列为Prolog程序生成测试用例的准则.按这些准则测试实际程序效果良好.这是在逻辑程序测试新领域迈出的一步.     

面向对象的程序设计语言CLUSTER86的设计与实现

本文介绍了笔者设计并实现的一种新型的面向对象的程序设计语言,着重讨论了在设计过程中采用的新的概念,并和其它类似语言作了比较.     

“菜鸟“小议

近年来,"菜鸟"作为一个新兴词语在网络上广为流传,甚至波及到社会生活的方方面面.通过语素分析和近义比较,可以来考察此词的读音和意义.     

A protocol for performance evaluation of line detection algorithms

Accurate and efficient vectorization of line drawings is essential for any higher level processing in document analysis and recognition systems. In spite of the prevalence of vectorization and line detection methods, no standard for their performance evaluation protocol exists. We propose a protocol for evaluating both straight and circular line extraction to help compare, select, improve, and even design line detection algorithms to be incorporated into line drawing recognition and understanding systems. The protocol involves both positive and negative sets of indices, at pixel and vector levels. Time efficiency is also included in the protocol. The protocol may be extended to handle lines of any shape as well as other classes of graphic objects.     

C语言编程在智能化重力加速度测试仪中的应用

在基于单片机的智能化重力加速度测试仪中采用Ｃ语言编程简化了程序设计任务，对于汇编语言难于处理的浮点数运算及汉字打印输出可通过Ｃ语言编译器的内部库函数调用实现，介绍了一种专为８０５１系列单片机设计的Ｃ语言编译器Ｆｒａｎｋｉｌｉｎ Ｃ５１，它具有代码优化功能，能产生极高效率的机器码，并且提供了丰富的内部函数库。描述了Ｃ５１函数库所支持的ＩＥＥＥ标准浮点数的内存格式以及采用ｓｐｒｉｎｔｆ（）函数处理包括     

标志树文法及其语法分析

树文法是一种高维文法，能够用来表达二维以上复杂对象的构造规则．在模式识别、图式语言等领域有着广泛的应用前景．本文在树文法有关概念基础上提出了标志树、连接标志、标志树文法等概念，构造了标志树的匹配和识别算法，并成功解决了标志树文法的语法分析器构造问题．     

三太子智能页面描述语言文本（1.0版）

本文给出一种全新的页面描述语言文本，它是一种真正的程序设计语言，而且是一种面向对象的智能语言。本语言已具有绿色软件的品格。     

Compile-time copy elimination

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.     

A process oriented semantics of the PRAM-language FORK

The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.

In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model.