Energy minimization and design for testability

The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables.     

一种适合协同工作系统的安全认证方案

针对网络化协同工作系统的安全认证需求，综合应用Kerberos协议、X．509证书和口令认证技术，借鉴PKI的思想，设计了一种适合网络化协同工作系统的灵活而易于扩展的安全认证方案。这个方案能够保证证书的安全分发，满足网络化协同工作系统对分散、动态的用户安全身份认证的要求。     

Integrating integer programming and probabilistic deduction graphs for probabilistic reasoning

Optimal solutions of several variants of the probabilistic reasoning problem were found by a new technique that integrates integer programming and probabilistic deduction graphs (PDG). PDGs are extended from deduction graphs of the and-type via normal deduction graphs. The foregoing variants to be solved can involve multiple hypotheses and multiple evidences where the former is given and the latter is unknown and being found or vice versa. The relationship among these hypotheses and evidences with possible intermediaries is represented by a causal graph. The proposed method can handle a large causal graph of any type and find an optimal solution by invoking a linear integer programming package. In addition, formulating the reasoning problem to fit integer programming takes a polynomial time. H.-L. Li was visiting the Department of Computer Sciences, University of North Texas in 1988–1989. He is with the Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.     

A survey of CSCW systems

Over the last decade, computer supported cooperative work (CSCW) has emerged as an identifiable research area that focuses on the role of the computer in group work. CSCW is a generic term which combines the understanding of the nature of group working with the enabling technologies of computer networking, systems support and applications. The paper examines the classes of system which have emerged to support cooperative working. A framework for characterising and describing CSCW systems is presented and four major classes of cooperative system identified. Each of these classes of cooperative system are examined highlighting their general characteristics and applicability to CSCW.     

一种椭圆弧长的作图求解法及其误差分析

本文给出了一种椭圆弧长的作图求解方法,即由作图求得椭圆弧长的近似值。通过对100个椭圆弧长的求解结果表明,由此方法求得的椭圆弧长的误差甚小,从而在相当高的精度范围内,提供了一种工程中适用并且简单易行的求解椭圆弧长的方法。     

基于多信号流图的飞控系统实时故障诊断

针对飞控系统构造复杂、解析建模困难的特点，给出一种基于多信号流图模型进行实时故障诊断的方法。该方法首先建立系统的多信号流图模型，然后根据模型得出相关矩阵，在相关矩阵和各实时测试结果基础上按照实时故障诊断基本算法进行诊断推理，判定系统各模块所处的状态。对某型飞机飞控系统的建模以及模拟诊断结果表明，该方法能隔离多故障，同时降低虚警率，是一种十分有效的实时故障诊断方法。     

Controlling the losing probability in a monotone game

We deal with a complex game between Alice and Bob where each contender’s probability of victory grows monotonically by unknown amounts with the resources employed. For a fixed effort on Alice’s part, Bob increases his resources on the basis of the results for each round (victory, tie or defeat) with the aim of reducing the probability of defeat to below a given threshold. We read this goal in terms of computing a confidence interval for the probability of losing and realize that the moves in some contests may bring in an indeterminacy trap: in certain games Bob cannot simultaneously have both a low probability-of-defeat measure and a narrow confidence interval. We use the inferential mechanism called twisting argument to compute the above interval on the basis of two joint statistics. Careful use of such statistics allows us to avoid indeterminacy.     

Linearly many faults in Cayley graphs generated by transposition trees

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.