A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

Running programs backwards: The logical inversion of imperative computation

Imperative programs can be inverted directly from their forward-directed program code with the use of logical inference. The relational semantics of imperative computations treats programs as logical relations over the observable state of the environment, which is taken to be the state of the variables in memory. Program relations denote both forward and backward computations, and the direction of the computation depends upon the instantiation pattern of arguments in the relation. This view of inversion has practical applications when the relational semantics is treated as a logic program. Depending on the logic programming inference scheme used, execution of this relational program can compute the inverse of the imperative program. A number of nontrivial imperative computations can be inverted with minimal logic programming tools.     

二阶A型Cooper变换的增强型

对二阶Ａ型Ｃｏｏｐｅｒ变换进行增强，放宽可用性条件，并证明了其正确性，最后举例说明其应用。     

峒室爆破CAD设计方法研究

本文对峒室爆破断面布药计算机辅助设计参数驱动方法进行了探讨围绕断面布药主要参数的变化，提出一种基于参数驱动的计算机辅助设计方法，利用ｗｉｎｄｏｗｓ操作系统下的动态数据交换特性，对断面布药进行布药参数优化，实现了交互调整布药，形成一套断面布的计算机软件，为工程爆破设计实现计算机提供了一种可行的方法。     

离散Hopfield神经网络和联想记忆的开关电流技术实现

研究了离散Ｈｏｐｆｉｅｌｄ神经网络（ＤＨＮＮ）和联想记忆神经网络的开关电流技术实现，利用多权输入跨导，开关电流延迟器（ＳＩＤ）和可编程电流比较器（ＰＣＣ）实现了离散Ｈｏｐｉｅｌｄ神经网络，并提出了利用离散Ｈｏｐｆｉｅｌｄ神经网络实现自联想记忆时相应的开关电流电路，所提出了开关电流神经网络适宜于超大规模集成，能在低电压（如３．３Ｖ）下工作。     

MS—Windows3.1下应用程序间数据交换方法及其选用策略

本文分析讨论了在ＭＳ－Ｗｉｎｄｏｗｓ操作系统下的应用程序间的数据交换的概念及方法，并给出了这些方法的选用策略。这些方法包括裁剪板，动态数据交换（ＤＤＥ），对象的连接及嵌入（ＯＬＥ），动态连接库（ＤＬＬ）。     

A review of robust design methods for multiple responses

Problems in engineering design often involve determining design variable settings to optimize individual product performance for multiple criteria, which are often in conflict. We review mathematically rigorous techniques from the statistical literature for finding a vector x of design variable settings, which produces an optimal compromise solution among a group of prioritized response variables. The best compromise solution is typically gained by optimizing an objective function, which incorporates the prioritized demands of multiple responses. Since most multi-response objective functions are constructed by combining the functions used to optimize univariate responses, a review of the prominent univariate approaches is presented first. A multivariate approach from the engineering literature called the compromise Decision Support Problem is also reviewed. Finally a table comparing the relative merits of the different multivariate approaches summarizes the article in a concise and user-friendly fashion.     

Computational complexity of queries based on itemsets

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.     

一次国际设计竞赛的尝试--多维住宅设计

在后工业时代，建筑设计已经冲破了西方思维所惯用的二元对立方式的约束，呈现出日新月异的景象，建筑表皮的创作尤为突出。这个住宅设计是从四维分解到四维连续的一种大胆尝试，并引入拓扑学的基本方法处理动态空间。     

A frame-based knowledge representation model and its mapping to nested relations

The first part of this paper introduces the basic constructs of a frame representation model and gives a formal definition for them. Subsequently the nested relational model (NF²) is described as an extension of the classical relational model to support relation-valued attributes. In the second part of this paper both models are compared with each other and a mapping of frame representation structures to NF² structures is specified. The structural similarities between frames and NF² relations are made clear and it is shown that their main difference is due to the type polymorphism introduced by the concept hierarchy of the frame model. This causes type collisions to occur in the strictly typed NF² model when frames are directly mapped to NF² structures. Two solutions to this problem are suggested and compared. The paper concludes with a reformulation of query operations of the frame model in terms of NF² algebra operations.