In this paper, the authors introduce a workflow model. The development of computer network technology enables us to share the distributed data in real time. It is a considerable significance in the practical application of network capabilities not only to office work but also to the medical environment. In order to construct a well-connected, managed post (environment, scene), a model is needed to design the workflow. Here we propose a workflow model to cope with the scene of unforeseen events that we usually encounter in daily clinical activities. We give careful consideration to the ability of this model to manage dynamic changes within the workflow and describe its application to a medical scene (triage) and then carry out simulations based on this model. The authors are able to demonstrate the validity of this model through this simulation. 相似文献
The quantum-dot cellular automata (QCA) is considered to be one of the ground-breaking nanotechnologies developed over the last two decades. A layered T (LT) logic cell library is constructed herein, and the methodology is extended to generic adder and subtractor module designs. The two proposed algorithms lead to more efficient QCA layout designs for an n-bit ripple carry adder (RCA) and subtractor based on an effective clock zone assignment approach. The suggested one-, four-, and eight-bit RCAs and subtractors surpass most of their existing counterparts by offering lower effective area and cell complexity. A comparative analysis is presented regarding the complexity, irreversible power dissipation, and Costα of the proposed n-bit layouts from a cost estimation purview.
Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. [1] proposed an efficient multi-precision integer division algorithm, and experimentally showed that it is about three times faster than the most popular algorithms proposed by Knuth [2] and Smith [3]. This paper reports a bug in the algorithm of Huang et al. [1], and suggests the necessary corrections. The theoretical correctness proof of the proposed algorithm is also given. The resulting algorithm remains as fast as that of [1]. 相似文献
Failure analysis of a steel chimney used in a lime plant was carried out. The chimney broke from two different locations during a storm. During the site visit, it was observed that the chimney was dislodged from weld joints. The chimney was made up of hot rolled mild steel plates. Investigations were carried out on the failed chimney plate and welding between plates. The investigation consists of visual observation, chemical analysis, characterization of macro- and microstructures, measurement of hardness, tensile property tests and energy-dispersive spectroscopy (EDS). Calculation of wind load at the location of breakage was also carried out. EDS analysis revealed entrapment of slag inside weld. Overall analysis suggested that the failure took place due to selection of improper reconditioning technique as well as poor workmanship in welding. 相似文献
Microarray technology has made it possible to monitor the expression levels of many genes simultaneously across a number of experimental conditions. Fuzzy clustering is an important tool for analyzing microarray gene expression data. In this article, a real-coded Simulated Annealing (VSA) based fuzzy clustering method with variable length configuration is developed and combined with popular Artificial Neural Network (ANN) based classifier. The idea is to refine the clustering produced by VSA using ANN classifier to obtain improved clustering performance. The proposed technique is used to cluster three publicly available real life microarray data sets. The superior performance of the proposed technique has been demonstrated by comparing with some widely used existing clustering algorithms. Also statistical significance test has been conducted to establish the statistical significance of the superior performance of the proposed clustering algorithm. Finally biological relevance of the clustering solutions are established. 相似文献
Failure diagnosability has been widely studied for discrete event system (DES) models because of modeling simplicity and computational
efficiency due to abstraction. In the literature it is often held that for diagnosability, such models can be used not only
for systems that fall naturally in the class of DES but also for the ones traditionally treated as continuous variable dynamic
systems. A class of algorithms for failure diagnosability of DES models has been successfully developed for systems where
fairness is not a part of the model. These algorithms are based on detecting cycles in the normal and the failure model that
look identical. However, there exist systems with all transitions fair where the diagnosability condition that hinges upon
this feature renders many failures non-diagnosable although they may actually be diagnosable by transitions out of a cycle.
Hence, the diagnosability conditions based on cycle detection need to be modified to hold for many real-world systems where
all transitions are fair. In this work, however, it is shown by means of an example that a system may have some transitions
fair and some unfair. A new failure diagnosability mechanism is proposed for DES models with both fair and unfair transitions.
Time complexity for deciding diagnosability of DES models with fair and unfair transitions is analyzed and compared with the
time complexities of other DES diagnosability analysis methods reported in the literature. 相似文献