MPP系统中的MP通信及其实现

论述了ＭＰＰ系统中节点机的通信结构，以及在主控机与节点机之间实现的Ｍｅｓｓａｇｅ Ｐａｓｓｉｎｇ通信及其通信协议。     

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.     

List partitions

By definition, apartition of a list is a division of that list into nonempty contiguous segments. Many programming and operations research problems can be specified in terms of list partitions, and we present a hierarchy of theorems for deriving programs from such specifications. Throughout, reasoning is conducted in an equational style using the calculus for program synthesis developed by Bird and Meertens.Supported by a BP research studentship.     

Introducing concurrency in sequential Java via laws

Nowadays multi-core processors can be found everywhere. It is well known that one way of improving performance is by parallelization. In this paper we propose a parallelization strategy for Java using algebraic laws. We perform an experiment with two benchmarks and show that our strategy produces a gain similar to a specialized parallel version provided by the Java Grande Benchmark (JGB).     

计算机专用实时母系统在VAX／VMS环境下的实现

“母系统—子系统”的工作方式是计算机专用实时系统研制中的一次重要尝试,本文闸明计算机专用实时母系统在VAX/VMS环境下的工程实现。     

The Z specification dependence graph

The lack of existing solutions makes it really hard to understand formal specification languages since the application domain for representations is useful for the purpose of carrying out certain software engineering operations such as slicing and the computation of program metrics.A Z specification dependence graph is presented in this letter. It draws on the strengths of a range of earlier works and adapts them, if necessary, to the Z language.     

激光起爆系统可靠性模拟计算

采用计算机模拟对激光起爆系统的可靠性进行了研究.利用开发的系统仿真程序对各部件对系统可靠性的影响进行了分析,并对不同可靠度下所需激光器输出能量进行了模拟计算.结果表明,系统的发火可靠性受激光起爆器的影响最大,其次为连接器,分束器的一致性对系统的可靠性影响相对较小.     

数字电视EMC测试用码流信号的配制

目前数字电视系统技术,测试标准以及测试设备还不够完善.本文对数字电视测试码流信号的进行研究,配制了一组适合EMC测试的码流信号,解决了数字电视EMC测试用码流信号难题.     

PLC与微机的实时通信程序设计

文章讨论了使用ＢｏｒｌａｎｄＣ＋＋语言,设计可编程序控制器ＰＬＣ与微机的实时通信软件的基本方法,包括串口的初始化、等内容。     

A HYBRID DYNAMIC PROGRAM SLICING

This letter proposes a hybrid method for computing dynamic program slicing. The key element is to construct a Coverage-Testing-based Dynamic Dependence Graph (CTDDG),which makes use of both dynamic and static information to get execution status. The approach overcomes the limitations of previous dynamic slicing methods, which have to redo slicing if slice criterion changes.