泛函程序设计语言实现中的图归约演算

本文叙述了在Ｖｏｎ Ｎｅｕｍａｎｎ机器上实现基于λ演算，ＳＫＩ演算的泛函程序设计语言所采用的图归约演算。ＳＫＩ－Ｇ演算是ＳＫＩ演算的图形表示，是基于图形的形式归约系统，面向机器实现，是实现高阶，引用透明，归约语义，全惰性泛函程序设计语言的主要技术基础。     

一种基于ADT的函数语言及其操作语义模型

本文介绍一以ＡＤＴ为主要构件的函数语言，它是作者设计的函数式及面向对象式合成语言的函数部分，进而描述了其操作语义模型：多态λ演算十代数重写系统＝多态λ重写系统，并讨论该模型的Ｃｈｕｒｃｈ－Ｒｏｓｓｅｒ性质和强范式性质。     

六款KT133主板测试

现在Ｄｕｒｏｎ ＣＰＵ的价钱非常便宜,你在选择了 Ｄｕｒｏｎ ＣＰＵ后一定会为选择什么样的主板而烦恼吧！现在大多数玩家选择Ｄｕｒｏｎ ＣＰＵ所选择的主板芯片是 ＫＴ１３３,而选择什么牌子的ＫＴ１３３主板好呢？这次我们《电脑》杂志评测室专门做了一次ＫＴ１３３主板评测。这次的评测我们选了６块主板,在性能方面它们都表现都不错。分别是 ＤＦＩ的 ＡＫ７４－ ＥＣ、大众的 ＡＺ１１、艾崴ＫＶ２００－Ｒ、梅捷ＳＹ－Ｋ７ＶＴＡ、先锋ＩＳ－ＭＫ７ＡＶ。其中的艾崴ＫＶ２００－Ｒ有 ＩＤＥ ＲＡＩＤ１００, ＤＦＩ的 ＡＫ７４…     

DDFP语言的归约机实现技术

ＤＤＦＰ语言是一种基于表达式的泛函程序设计语言，这是一种具有归约语义的，引用透明的，能表达无限数据结构，高阶纯粹的函数式语言。它的实现是基于λ演算、ＳＬＩ演算、ＳＫＬ－Ｇ演算、ＬＮＦ演算及图归约技术。本文在［４］的基础上首先引进了ＬＮＦ演算，而后详细介绍了该语言的归约机实现技术，对结果作了讨论。     

TMS320C25与IBM—PC机的串行通讯

本文介绍了高数字信号处理（ＤＳＰ）芯片ＴＭ３２０Ｃ２５与ＩＢＭ－ＰＣ机进行串行通讯的实现方法，文中对ＴＭＳ３２０Ｃ２５的串行通讯接口电路和通讯程序作了论述。     

应用TCP／IP实现UNIX与WINDOWS的网络通信

阐述了 Ｓ Ｏ Ｃ Ｋ Ｅ Ｔ 的实质,并实现了基于 Ｔ Ｃ Ｐ／ Ｉ Ｐ 协议进行 Ｕ Ｎ Ｉ Ｘ 与 Ｗ Ｉ Ｎ Ｄ Ｏ Ｗ Ｓ 网络间的信息交换。     

NETWARE上屏蔽CTRL-BREAK和CTRL-C中断的一种方法

提出和实现了ＮＥＴＷＡＲＥ上屏蔽ＣＴＲＬ－ＢＲＥＡＫ和ＣＴＲＬ－Ｃ中断的一种方法，解决了一定条件下ＣＴＲＬ－ＢＲＥＡＫ或ＣＴＲＬ－Ｃ可中断这个ＢＡＴＣＨ作业并进入系统状态而严重影响了ＮＥＴＷＡＲＥ上ＭＩＳ应用的数据安全性的问题。     

玉米大斑病菌毒素的钝化反应及其机理研究

用１８种化合物对ＨＴ－毒素进行钝化反应试验，结果表明：代森锰锌、Ｎａ２ＭｏＯ４，ＮａＮＯ，ＺｎＳＯ４，ＫＭｎＯ４，ＫＩ及４种糖可钝化毒素，使其对玉米的毒性降低；而ＣｕＳＯ４，ＮａＣｌ，ＫＣＩ２Ｏ５，Ｈ２Ｏ２可使毒素毒性增强。毒素处理玉米叶片后细胞膜透性、细胞的Ｖｃ氧化酶，ＣＡＴ，ＰＡＬ，ＰＰＯ活性都发生了一定的规律性变化，而毒素中加入Ｈ２Ｏ２和代森锰锌可抑制或加强这种变化。     

微机系统窗口图形用户界面管理系统的设计与实现

计算机用户接口设计是计算机应用系统的一个重要发展方向。本文在论述了用户接口设计的理论与实现方法的基础上，设计并生成了一个在微机系统上运行的用户界面管理系统：ＷＧ－ＵＩＭＳ，该系统现于３８６档微机上，以ＭＩＣＲＯＳＯＦＴ ＷＩＮＤＯＷＳ３．０为支持环境，是一个集文字、图形为一体的ＵＩＭＳ。文中着重对ＷＧ－ＵＩＭＳ中的接口生成工作的设计思想、理论原型、实现过程及关键性数据结构等进行了论述。     

带有变量中误差的Logit回归模型及其计算

带有变量中误差的Ｌｏｇｉｔ回归模型及其计算吕纯濂，陈舜华（南京气象学院）Ｈ．Ｋｕｃｈｅｎｈｏｆｆ（慕尼黑大学统计与科学理论研究所）ＴＨＥＬＯＧＩＴＲＥＧＲＥＳＳＩＯＮＭＯＤＥＬＷＩＴＨＥＲＲＯＲＳ－ＩＮ－ＶＡＲＩＡＢＬＥＳＡＮＤＩＴＳＣＡＬＣＵＬＡＴ...     

Shallow Linear Action Graphs and their Embeddings

Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for a uniform behavioural theory for process calculi. Received October 2000 / Accepted in revised form April 2001     

Call-by-Value {lambda}-calculus and LJQ

LJQ is a focused sequent calculus for intuitionistic logic,with a simple restriction on the first premiss of the usualleft introduction rule for implication. In a previous paperwe discussed its history (going back to about 1950, or beyond)and presented its basic theory and some applications; here wediscuss in detail its relation to call-by-value reduction inlambda calculus, establishing a connection between LJQ and theCBV calculus _C of Moggi. In particular, we present an equationalcorrespondence between these two calculi forming a bijectionbetween the two sets of normal terms, and allowing reductionsin each to be simulated by reductions in the other.     

A Calculus of Lambda Calculus Contexts

The calculus c serves as a general framework for representing contexts. Essential features are control over variable capturing and the freedom to manipulate contexts before or after hole filling, by a mechanism of delayed substitution. The context calculus c is given in the form of an extension of the lambda calculus. Many notions of context can be represented within the framework; a particular variation can be obtained by the choice of a pretyping, which we illustrate by three examples.     

用Spi演算描述和验证密码学安全协议

讨论了针对共享密钥安全协议的Ｓｐｉ演算,而且对安全协议的Ｓｐｉ演算描述和验证进行了深入的探讨。     

远程诊断系统中两个关键问题的代数建模

基于网络的远程监测诊断系统是一个复杂的系统,其实施需要进行理性的建模分析.针对基于网络的远程监测诊断系统的实现和分析问题,利用了π演算以及δπ演算这一高度抽象的适于移动分布计算模式的代数建模工具,完成了基于网络的远程监测诊断系统的两个诊断特征问题：移动诊断和群组诊断的建模.建模结果表明δπ演算能很好地表达基于网络的远程监测诊断系统的这两个特征问题.     

Fast symbolic computation of the worst-case delay in tandem networks and applications

Computing deterministic performance guarantees is a defining issue for systems with hard real-time constraints, like reactive embedded systems. In this paper, we use burst-rate constrained arrivals and rate-latency servers to deduce tight worst-case delay bounds in tandem networks under arbitrary multiplexing. We present a constructive method for computing the exact worst-case delay, which we prove to be a linear function of the burstiness and latencies; our bounds are hence symbolic in these parameters. Our algorithm runs in quadratic time in the number of servers. We also present an application of our algorithm to the case of stochastic arrivals and server capacities. For a generalization of the exponentially bounded burstiness (EBB) model, we deduce a polynomial-time algorithm for stochastic delay bounds that strictly improve the state-of-the-art separated flow analysis (SFA) type bounds.     

半边图模型之聚合归约演算

提出了实现自组织多层次归约的一个指导原则,即自组聚合与归约的协调准则,其核心思想是,基于多聚合准则的自组聚合演算中的各个聚合子集是可以相交的,相交的部分是下一步归约演算的基础。给出了符合上述协调准则的自组图聚合归约演算模型,聚合子图是聚合演算的结果,在归约演算中,聚合子图对应为归约顶点,子图的子边界对应为归约半边,而由子图相交部分抽象出的子图边界之间的关系则对应为归约边,从而构成了形式上完整统一的自组织多层次归约。     

Barbed Congruence of Asymmetry and Mismatch

The X calculus is a model of concurrent and mobile systems. It emphasizes that communications are information exchanges. In the paper, two constructions are incorporated into the framework of the chi calculus, which are asymmetric communication and mismatch condition widely used in applications. Since the barbed bisimilarity has proved its generality and gained its popularity as an effective approach to generating a reasonable observational equivalence, we study both the operational and algebraic properties of the barbed bisimilarity in this enriched calculus. The investigation supports an improved understanding of the bisimulation behaviors of the model. It also gives a general picture of how the two constructions affect the observational theory.     

NETWORK SYNTHESIS AND VARELA'S CALCULUS

Abstract

Network models are given for self-referential expressions in the calculus of indications (of G. Spencer Brown). A precise model is presented for the behavior of such expressions in time. The extension of Brown's calculus by F. Varela is then shown to describe behavior invariant properties of these networks. Network design is discussed from this viewpoint     

区间逻辑的一个辅助证明工具

DC/P(duration calculus prover)是一族实时区间逻辑的辅助定理证明工具.它采用Gentzen风格相继式演算作为基本证明系统,并结合项重写、自动判定算法等技术以提高证明的自动化程序.该文介绍了DC/P的语义编码方法、采用的相继式证明系统及实现技术,并给出了应用实例.