异质谷间转移电子器件的计算机模拟

使用弛豫时间近似求出了描述两能谷间电子交换的方程。在此基础上建立了双能谷电子的连续性方程和油松方程。对具体的ＧａＡｓ／ＡｌｘＧａ１－ｘＡｓ异质谷间转移电子器件结构求解了这些方程组，得到了直流工作时器件内的电场分布、双能谷中载流子的布居以及两个能谷的电流分布。这些结果正好和常规Ｇｕｎｎ器件相反，说明了两种器件的不同工作机理。最后通过对低Ａｌ组份势垒结构的计算说明了Ｘ谷电子注入对器件工作的重要作用。     

行波管质量与可靠性信息管理系统的设计

本文从应用角度简要介绍了《行波管质量与可靠性信息管理系统》的研制背景，数据库的数据来源，数据结构，系统构成及功能特点。     

光学系统中离轴性公差的计算机设计

运用不共轴光学系统的光路计算和象质评价理论，通过共轴光学系统中光学表面，光学元件，部件的小位移和微倾斜，对切比雪夫综合象质函数计算相应的有关限差分，以掌握各种离轴性误差对象质的危害程度，再按多元函数的极值理论和适应度性优化技术自动妥共轴光学系统中各种轴性公差，并进行反馈和非线性处理；达到公差的最优化分配。     

Motion Perception Using Analog VLSI

Motion perception is arguably a fundamental mechanism used by natural species to accomplish a number of tasks, such as navigating freely in an unknown environment. Traditional motion perception methods tend to be computationally intensive, requiring powerful computers and large memories. However, by copying biological mechanisms, such as elementary motion discrimination at the early stages of the visual processing paths, it should be possible to build small and efficient motion perception systems. This paper describes the manner in which a simple motion perception model based on the insect visual system has been implemented using mixed analog/digital VLSI. The device has been fabricated in a 2 micron double metal, double polysilicon process, and comprises 61 photo-detectors, and associated analog and digital circuitry. While not entirely successful in that component mismatches hamper the detection of dark-to-bright changes in contrast, the results clearly show the feasibility of using such a device in autonomous control systems.     

计算机串行通信综述

本文着重向读者介绍目前流行的几种计算机串行通信规程，它们是ＥＩＡ－ＲＳ－２３２Ｃ、ＥＩＡ－ＲＳ－４２２Ａ、ＥＩＡ－ＲＳ－４２３Ａ、ＥＩＡ－ＲＳ－４４９、ＥＩＡ－ＲＳ－４８５、ＡＲ－ＩＮＣ－４２９等。     

CIMS环境中的数据模式转换

本文在分析CIMS环境中数据模式冲关类型的基础上，提出一种互连数据库系统模式结构，论述了在异构数据库集成中解决模式冲突的基本方法．在这种方法体系中，不需要建立整个企业的全局数据模式，各局部DBA以简单的方式定义应用所需的模式变换，系统根据这种定义自动完成各种转换，使用户看到的模式和数据结果与应用要求的一致．     

广播发射集散控制系统

本文介绍了广播发射台利用计算机技术、网络技术、遥控遥测技术、现代测试手段，对设备进行自动化控制与管理；实现设备技术指标自动测试，发射台无人值班、有人留守，建立机器的计算机档案制度，确保安全优质播出的方法和经验。     

单片机控制泄漏电流测试仪

以8031单片机为核心的泄漏电流测试仪的硬件结构和软件设计。     

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