比较逻辑与异步触发时序电路的分析和综合

本文从触发器的完整状态方程出发,研究了异步触发时序电路的分析与综合的新方法,提出了触发器的α跃变、β跃变行为可用比较运算中的小于、大于运算表示,而各触发器的α跃变、β跃变之间的覆盖关系则可用大于等于运算进行检验。在此基础上提出了适用于使用计算机的异步触发时序电路的分析和综合程序。     

建立模糊诊断矩阵的一种新方法

本文首先提出了一个新的模糊逻辑算子——模糊加权综合算子“#”,进而给出建立模糊诊断矩阵的新方法——网络法 ,并给出了相应的算法     

The interlace polynomial of a graph

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers.     

心理素质诊断模型的建立与应用

综合运用国内外多种测量量表对大学生的心理素质进行诊断与测试 ,并应用多元统计分析方法对其心理素质结构主因素进行定量分析 ,在此基础上建立了心理素质诊断模型 ,并运用该模型对实际问题进行了分析 .     

基于加强型BP算法的神经网络故障诊断研究

文章给出了利用神经网络进行故障诊断的可行性、基本原理、诊断过程分析、和参数优化过程 ,并得出较为理想的诊断结果 .     

Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems

A transition in a graph is defined as a pair of adjacent edges. A transition system of an Eulerian graph refers to a set of partitions such that for each vertex of the graph, there corresponds to a partition of the set of edges incident to the vertex into transitions. A generalized transition system $F\left(G\right)$ over a graph $G$ defines a set of transitions over $G$. A compatible Eulerian circuit of an Eulerian graph $G$ with a generalized transition system $F\left(G\right)$ is defined as an Eulerian circuit in which no two consecutive edges form a transition defined by $F\left(G\right)$. In this paper, we further introduce the concept of weakly generalized transition system which is an extension of the generalized transition system and prove some Ore-type sufficient conditions for the existence of compatible Eulerian circuits in Eulerian graphs with (weakly) generalized transition systems and obtain corresponding results for Eulerian digraphs. Our conditions improve some previous results due to Jackson and Isaak, respectively.     

A Mixed Heuristic for Circuit Partitioning

As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimization and simulation, HDL-based synthesis, etc. is currently a field of increasing research activity. This paper describes a circuit partitioning algorithm which mixes Simulated Annealing (SA) and Tabu Search (TS) heuristics. The goal of such an algorithm is to obtain a balanced distribution of the target circuit among the processors of the multicomputer allowing a parallel CAD application for Test Pattern Generation to provide good efficiency. The results obtained indicate that the proposed algorithm outperforms both a pure Simulated Annealing and a Tabu Search. Moreover, the usefulness of the algorithm in providing a balanced workload distribution is demonstrated by the efficiency results obtained by a topological partitioning parallel test-pattern generator in which the proposed algorithm has been included. An extented algorithm that works with general graphs to compare our approach with other state of the art algorithms has been also included.     

A note on minimum degree conditions for supereulerian graphs

A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed.     

一种基于Fuzzy数学的计算机故障诊断新方法

提出了一种新的模糊诊断方法,建立了故障诊断的数学模型,并在计算机上实现了模糊诊断的仿真实验,并通过实例说明了这种方法有利于提高决策的准确性和可信度,在实际应用中是有效和可行的.     

从一个例子看统计分析在辅助医学诊断中的有用之处

从讨论影响脂肪肝的主要因素排序出发,应用简明统计分析,给出了辅助医学诊断中用于判断患者患脂肪肝的可能性,由此,对于可能性为零的情形可以排除进一步的生化检查,也就不会发生相应的感染.