• Journal of the Korean Statistical Society
• /
• v.21 no.2
• /
• pp.201-207
• /
• 1992

The algorithm for obtaining the isotonic regression in simple tree order, the most basic and simplest model next to the simple order, is considered. We propose to call it "Pool-the-Maximum-Violators" algorithm (PMVA) in conjunction with the "Pool-Adjacent-Violators" algorithm (PAVA) in the simple order. The dual problem of obtaining the isotonic regression in simple tree order is our main concern. An intuitively appealing relation between the primal and the dual problems is demonstrated. The interesting difference is that in simple order the required number of pooling is at least the number of initial violating pairs and any path leads to the solution, whereas in the simple tree order it is at most the number of initial violators and there is only one advisable path although there may be some others leading to the same solution.o the same solution.

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.1023-1029
• /
• 2009

Oh (2009) has proposed a likelihood ratio test for comparing two agreements for dependent observations based on the concept of marginal homogeneity and marginal stochastic ordering. In this paper we consider the comparison of more than two agreement measures. Simple ordering and simple tree ordering among agreement measures are investigated. Some test procedures, including likelihood ratio test, are discussed.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.29 no.2
• /
• pp.68-76
• /
• 2001

The purpose of this study is to computerize street tree management using a CAD program in order to manage the drawing record of street trees systematically and concurrently. The configuration of this program is composed of Reference Data, Data Inquiry, and Cost Assessment. The Reference Data includes characteristics of trees, monthly managements records, damage by blight and insects and usage of pesticides. The Data Inquiry includes an individual search of the tree index, simple searches and multiple searches. The Cost Assessment includes two main components, the data input with labor cost, manure ocst and pesticide cost and the assesment of management cost for prevention of blight and insects, pruning and fertilization. The results of this study are as follows: 1) When there are practices such as transplanting and removing of street trees it is immediately updated with the various situation. By creating an in progress a tree management system, up to the date information can be given to the manager for decision making. 2) To identify individual tree at the site or in drawing, the street name and numbers were used instead of coordinates. Tree tags are attached to the street trees individually. It can make DB management simple and easy. 3) By doing simple or multiple search with constructed DB, data can be provided quickly. 4) The result of this type of search are useful in the assessment of management cost very useful in regards to items such as the pruning, pesticides scattering and fertilization. 5) By using the AutoCAD software and existing PC without purchasing new equipment, the cost of system implementation can be minimized.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.12
• /
• pp.209-219
• /
• 1995

As a new algorithm for RC tree delay estimation, we propose a $\tau$-model of the driver and a moment propagation method. The $\tau$-model represents the driver as a Thevenin equivalent circuit which has a one-time-constant voltage source and a linear resistor. The new driver model estimates the input voltage waveform applied to the RC more accurately than the k-factor model or the 2-piece waveform model. Compared with Elmore method, which is a lst-order approximation, the moment propagation method, which uses $\pi$-model loads to calculate the moments of the voltage waveform on each node of RC trees, gives more accurate results by performing higher-order approximations with the same simple tree walking algorithm. In addition, for the instability problem which is common to all the approximation methods using the moment matching technique, we propose a heuristic method which guarantees a stable and accureate 2nd order approximation. The proposed driver model and the moment propagation method give an accureacy close to SPICE results and more than 1000 times speedup over circuit level simulations for RC trees and FPGA interconnects in which the interconnect delay is dominant.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2750-2767
• /
• 1996

In this papr, a new lossless compression method is presented based on the Binary Adaptive Arithmetic Coder(BAAC). A simple unbalanced binary tree is created by recursively dividing the BAAC unit interval into two probability sub-inervals. On the tree the More Probable Predicted Value(MPPV) and Less Probable Predicated Value(LPPV) estimated by local statistics of the image pixels are arranged in decreasing order. The BAAC or Huffman coder is thus applied to the branches of the tree. The proposed method allows the coder be directly applied to the full bit-plane medical image without a decomposition of the full bit-planes into a series of binary bit-planes. The use of the full bit model template improves the compresion ratio. In addition, a fast computation for adjusting the interval is possible since a simple arithmetic operation based on probability interval estimation state machine is used for interval sub-division within the BAAC unit interval.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.25-32
• /
• 1990

This paper presents an approximate algorithm for computing Fault-tree probabilities. The method is essentially composed of three steps. In the first step, a Fault-tree is converted into a network form. In the second step, We change the network into a parallelized diagram. In the third step, the approximate fault-tree probability is calculated from the parallelized diagram. In this paper, in order to verify the method two hypothetical Fault-tree is used by examples. The results show that the method is very useful, even though it is an approximate technique, since it needs not to search the minimal cut sets and has the simple computing rontines.

• Journal of Power Electronics
• /
• v.8 no.1
• /
• pp.101-107
• /
• 2008

In this paper, the features extracted from vibration time signals are used to detect the bearing fault condition. The decision tree is applied to diagnose the bearing status, which has the benefits of being an expert system that is based on knowledge history and is simple to understand. This paper also suggests a genetic algorithm (GA) as a method to reduce the number of features. In order to show the potentials of this method in both aspects of accuracy and simplicity, the reduced-feature decision tree is compared with the non reduced-feature decision tree and the PCA-based decision tree.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.30 no.4
• /
• pp.92-104
• /
• 2002

This study investigates, analyzes, and summarizes Dansplantation techniques and methods through practical methodology centering on fieldwork in order to present effective planting methods for large trees that have important significance. The conclusions are as follows : 1. The transplantation process of a large tree generally consists of the stages of digging up a tree, manufacturing a carrier frame, loading the tee on a vehicle, transporting, transplanting the tree, installing a strut and maintaining and managing the new transplant. In addition, planting a tree on a mounted place includes the primary procedures of trimming out the root, and preparing for transplanting the tree on a mounted place, as well as the secondary work of trimming out the root, transplanting a tree on a mounted place, maintenance and management. 2. In order to decide on a transplantation method for a large-sized tree, a structure calculation has to be performed first. That is, one must calculate the weight of the tree and the allowable stress of the strut (H-beam, etc.) fhst and then decide on the upper method through computer modeling based upon this structural calculation. 3. As a result of the analysis of a transplanted tree using the life soil method, it was confirmed that large quantities of feeder roots had developed around the root within a short time after the transplantation. The life soil method has proven to be very effective for transplantation of large-sized trees. 4. As for the production method of an H-beam strut frame, it was found that the manufacturing process and disassembly process were simple and proper; therefore, the H-beam frame is an appropriate structure to be used in the transplantation of large trees. 5. The concavo-convex method, which consists of filling the life soil in the concavo-convex area around the root, was found to be a method that promotes the growth of feeder roots within a short period of time and saves the supply of water at the same time.

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

Lower bounds for the full level probabilities are derived under order restrictions in weights. Discussions are made on typical isotonic cones such as linear order, simple tree order, and unimodal order cones. We also discuss applications of these results for constructing conditional likelihood ratio tests for ordered hypotheses in a contingency table. A real data set on torus mandibularis will be analyzed for illustrating the testing procedure.

• Journal of Korean Society for Quality Management
• /
• v.19 no.2
• /
• pp.96-107
• /
• 1991

At the design stage of a plant, the plausible causes and pathways of release of hazardous materials are not clearly known. Thus there exist large amount of uncertainties on the consequences resulting from the operation of a fusion plant. In order to better handle such uncertain circumstances, we utilize the Probabilistic Risk Assessment(PRA) for the safety analyses on fusion power plant. In this paper, we concentrate on the tritium release accident. We develop a simple model that describes the process and flow of tritium, by which we figure out the locations of tritium inventory and their vulnerability. We construct event tree models that lead to various levels of tritium release from abnormal initiating events. Branch parameters on the event tree are assessed from the fault tree analysis. Based on the event tree models we construct influence diagram models which are more useful for the parameter updating and analysis. We briefly discuss the parameter updating scheme, and finally develop the methodology to obtain the predictive distribution of consequences resulting from the operating a fusion power plant. We also discuss the way to utilize the results of testing on sub-systems to reduce the uncertain ties on over all system.