A combined queueing network and stochastic Petri-net approach for evaluating the performability of fault-tolerant computer systems

In this paper the performability analysis of fault-tolerant computer systems using a hierarchical decomposition technique is presented. A special class of queueing network (QN) models, the so-called BCMP [4], and generalized stochastic Petri nets (GSPN) [1] which are often used to separately model performance and reliability respectively, have been combined in order to preserve the best modelling features of both.

A conceptual model is decomposed into GSPN and BCMP submodels, which are solved in isolation. Then, the remaining GSPN portion of the model is aggregated with flow-equivalents of BCMP models, in order to compute performability measures. The substitutes of BCMP models are presented by means of simple GSPN constructs, thereby preserving the 1st and 2nd moments of the throughput. A simple example of a data communication system where failed transmissions are corrected, is presented.     

An LP-based heuristic procedure for the generalized assignment problem with special ordered sets

The generalized assignment problem with special ordered sets (GAPS2), is the problem of allocating n tasks to m time-periods, where each task must be assigned to a time-period, or shared between two consecutive time-periods. For reasonably large values of m and n the NP-hard combinatorial problem GAPS2 becomes intractable for standard mathematical programming software, hence there is a need for heuristic algorithms to solve such problems. It will be shown how an LP-based heuristic developed previously for the well-established generalized assignment problem can be modified and extended to solve GAPS2. Encouraging results, in terms of speed and accuracy, in particular when compared to an existing heuristic for GAPS2, are described.     

A generalized gamma distribution with application to drought data

Gamma distributions are some of the most popular models for hydrological processes. In this paper, a very flexible family which contains the gamma distribution as a particular case is introduced. Evidence of flexibility is shown by examining the shape of its probability density function (pdf). A treatment of the mathematical properties is provided by deriving expressions for the n th moment. Estimation and simulation issues are also considered. Finally, a detailed application to drought data from the State of Nebraska is illustrated.     

转移法色交换

将图Ｇ的着色由一种变为中一种，通常用Ｋｅｍｐｅ法以交换。但是，对于某些情况，用此法无效。针对这个问题，本文提出了一种转移法色交换，它适用于平面图着色，方法直观，清晰且有效。     

GENERALIZED INVERSE GROUP OF SIGNAL AND ITS IMPLEMENTATION WITH NEURAL NETWORKS

A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational simulation have shown that (1) there is a group of finite length of generalized inverse signals for any given finite signal, which forms the GIG; (2) each inverse group has different leaking coefficients, thus different abnormal states; (3) each GIG can be implemented by a grouped and improved single-layer perceptron which appears with fast convergence. When used in deconvolution, the proposed GIG can form a new parallel finite length of filtering deconvolution method. On off-line processing, the computational time is reduced to O(N) from O(N2). And the less the leaking coefficient is, the more reliable the deconvolution will be.     

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.     

应用并行技术实现CAD／CAM的高度集成

传统的CAD/CAM系统由于设计思想本身的局限性,其内部只能达到一种松散的基于数据交换的低水平的集成,产品的设计方法也不符合工程技术人员的设计思路。本文提出了基于全耦合的单一数据模型的并行CAD/CAM系统设计思想,使得CAD/CAM系统内部达到以数据共享为基础的高度集成。并行CAD/CAM系统充分体现了工程技术人员的思维方式及产品设计过程的反复性和协调性。此外,文中还提出广义参数化设计的新概念,它与特征设计方法的有机结合保证了产品模型的完整性和产品设计过程的同步性。特征共享是实现CAD和CAM集成的关键因素。并行CAD/CAM系统应用面向对象软件设计思想,实现了复杂数据模型的内部封装,并为数据模型和功能模块之间提供简单直观的界面。面向对象设计方法是开发并行CAD/CAM系统的有效手段。     

基于广义最小均方的自适应递归滤波算法

本文提出了一种广义最小均方(GLMS)算法,分析了GLMS算法的性能,并根据GLMS算法,导出一种自适应递归滤波(ARF)算法。在推导中,ARF算法避开了超稳定定理,从而考虑自适应系统的严格正实条件和Popov不等式是不必要的。计算机模拟表明ARF算法具有很高的收敛速度。     

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.