A CSS1†is a system with the continues-state components. When a component has the ability to obtain all the situations from completely working to completely failed, it named continues-state component. In the real world, performance rate of elements are continuous and decrease by time. Continuity of components causes infinite working states and grows up the system states. In this paper we propose...

Z. Liang, A. Stenger, J. X. Ji, J. Ma, F. Boada University of Illinois at Urbana-Champaign, Urbana, IL, United States, University of Pittsburgh Medical Center, Pittsburgh, PA, United States, University of Texas MD Anderson Cancer Center, Houston, TX, United States SYNOPSIS Many imaging applications require collecting a time series of images. Conventional methods acquire these images independent...

Silvaco’s Guardian LVS tool compares two circuits that are defined by their netlists. The comparison is based strictly on the topological structure of these circuits. Topologically equivalent netlists are considered different, even if they are functionally equivalent. There are several techniques available for designing the same functionality by means of topologically different netlists. While ...

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev, Peled and Sun about equistable outer-planar graphs.

Recently, He and Yesha gave an algorithm for recognizing directed series parallel graphs, in time O(log n) with linearly many EREW processors. We give a new algorithm for this problem, based on a structural characterization of series parallel graphs in terms of their ear decompositions. Our algorithm can recognize undirected as well as directed series parallel graphs. It can be implemented in t...

Received July 17, 1997; accepted May 1, 1998. Communicated by Wen-Lian Hsu. *A preliminary version of this paper appeared in the proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’97) Las Vegas, Nevada, pp. 890-896, 1997. Research supported in part by NSC under Grant 83-0408-E-008-004. JOURNAL OF INFORMATION SCIENCE AND ENGINEER...

In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...