• International Journal of Quality Innovation
• /
• v.7 no.3
• /
• pp.15-23
• /
• 2006

A spare ordering policy is considered for planned maintenance. Introducing the ordering, uptime, downtime, inventory costs and salvage value, we derive the expected cost effectiveness. The problem is to determine jointly the ordering time for a spare and the preventive replacement time for the operating unit which maximize the expected cost effectiveness. Some properties regarding the optimal policy are derived, and a numerical example is included to explain the proposed model.

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.545-556
• /
• 1996

In this paper, we introduce a new concept of partial ordering which permits us to compare pairs of the dependence structures of a new hitting times for POD multivariate vector process of interest as to their degree of POD-ness. We show that POD ordering is closed under convolution, limit in distribution, compound distribution, mixture of a certain type and convex combination. Finally, we present several examples of POD ordering processes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.407-416
• /
• 1998

For fast Cholesky factorization, it is most important to reduce the number of nonzero elements by ordering methods. Generally, the minimum deficiency ordering produces less nonzero elements, but it is very slow. We propose an efficient implementation method. The minimum deficiency ordering requires much computations related to adjacent nodes. But, we reduce those computations by using indistinguishable nodes, the clique storage structures, and the explicit storage structures to compute deficiencies.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.3
• /
• pp.32-40
• /
• 2009

In order to reduce time-to-market, the demand for fast fault diagnosis has been increased. In this paper, a fault dropping technique with fault candidate ordering and test pattern ordering for fast fault diagnosis is proposed. Experimental results using the full-scanned ISCAS 89 benchmark circuits show the efficiency of the fault dropping technique with fault candidate ordering and test pattern ordering.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.544-555
• /
• 2003

Since the result data from DNA microarray experiments contain a lot of gene expression information, adequate analysis methods are required. Hierarchical clustering is widely used for analysis of gene expression profiles. In this paper, we study leaf-ordering, which is a post-processing for the dendrograms output by hierarchical clusterings to improve the efficiency of DNA microarray data analysis. At first, we analyze existing leaf-ordering algorithms and then present new approaches for leaf-ordering. And we introduce a software HCLO(Hierarchical Clustering ＆ Leaf-Ordering Tool) that is our implementation of hierarchical clustering, some of existing leaf-ordering algorithms and those presented in this paper.

• Journal of The Korean Association For Science Education
• /
• v.12 no.3
• /
• pp.91-107
• /
• 1992

The Purpose of this study was to present the procedures and methods of ordering theory,and to search for a learning hierarchy among science process skills in each Piagetian cognitive reasoning level. One of the purpose of this is not to determine the clear and exact hierarchy but rather to demonstrate how ordering theoretic methods and procedures can be used to determine the hierarchy of logical relationships among a set of test items or the testing of a hypothesized hierarchy. Ordering theory was used to analyze five science process skills collected from 509 high school students. Ordering Theory has as its primary intent either the testing of hypothesized hierarchies among items at the determination of hierchies among items. Hierarchical relationships were identified within five science process skills. The results will be helpful in giving useful inform at ions to classroom teachers and science curriculum developer.

• Proceedings of the KOSOMBE Conference
• /
• v.1990 no.11
• /
• pp.15-18
• /
• 1990

In abdominal NMR imaging the respiratory ordering techniques have been successfully used to remove the ghosting artifacts arising from the respiratory motion. In the existing respiratory ordering schemes, however, it is generally accepted that blurring of the moving parts still remains as in the signal averaging technique. A new optimal respiratory ordering scheme which can correct the blurring as well as the ghosting artifacts is theoretically derived through the analysis of the phase encoding directional motion effects in Fourier imaging. The performance of the optimal respiratory ordering scheme is experimentally confirmed together with a suboptimal ordering scheme which is suggested as a compromise for the practicality.

• Journal of Korean Society for Quality Management
• /
• v.39 no.4
• /
• pp.480-485
• /
• 2011

This paper presents a spare ordering policy for preventive replacement with minimal repair. To analyze the ordering policy, the failure process is modeled by a non-homogeneous Poisson process. Introducing the ordering, repair, downtime, replacement costs and salvage value, we derive the expected cost effectiveness as a criterion of optimality when the lifetime and lead times for the regular and expedited orders are generally distributed random variables. It is shown that, under certain conditions, there exists a finite and unique optimum ordering time which maximizes the expected cost effectiveness. A numerical example is also included to explain the proposed model.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.6-8
• /
• 2006

Using enhanced ordering scheme of graylevel in an image, we can apply it to lossless image compression in this paper. The proposed method is ordering scheme to replace an original grayscale image with a particular ordered image without additional information. From the simulation, it is verified that the proposed method reduces the bit rates than plain ordering scheme. And it can be applied in various fields of lossless compression, water marking and edge detection.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.161-166
• /
• 2005

Locus ordering is the necessary step in constructing genetic map, and the construction of reliable and fine genetic map is one of the most important issue in genetic research area. Locus ordering searches for the best locus order among the possible orders and it amounts to evaluating the maximum likelihood for each order. With only 10 loci, for example, there are 1,814,000 possible orders, and therefore, locus ordering entails a big computational problem. In this paper we suggest a useful algorithm for loci ordering via the Fiedler vector. The suggested algorithm is easy to compute and can handle many loci simultaneously. Furthermore, the required computation time is very short compared to others and the result of locus ordering is very accurate.