• 한국해양학회지
• /
• 제6권2호
• /
• pp.104-106
• /
• 1971

In enumerating salmon spawning population by the tag-recovery method, the error caused by the emigration of the tagged fish into the non-statistical area and the misjudgement of the tagged fish as untagged, which is caused by bear predation, appear to give a bias to the estimate of population size. Efforts were made in the present study to remove such bias by estimating population size under certain assumtion and by introducing a correction equation for the sample tag-ratios.

• Management Science and Financial Engineering
• /
• 제15권2호
• /
• pp.53-68
• /
• 2009

In this paper, we address a problem for minimizing the number of items inspected in a back-light-unit (BLU) inspection system, which includes a K-stage inspection system, a source inspection shop, and a re-inspection shop. In order to formulate our objective, we make a steady-state flow analysis between nodes (or shops), and derive the steady-state amount of flows between nodes and defective rates by solving a nonlinear balance equation. We provide an enumeration method for determining an optimal value of K which minimizes the number of items inspected. Our methodology could be applied and extended to similar situations with slight modification.

• Management Science and Financial Engineering
• /
• 제16권1호
• /
• pp.119-135
• /
• 2010

In this paper, we readdress the optimization problem for minimizing the inspection cost in a back-light unit inspection system, which forms a network including a K-stage inspection system, a source inspection shop, and a re-inspection shop. In order to formulate our objective function when the system is in a steady state, assuming that the number of nonconforming items in a lot follows a binomial distribution when a lot is formed for inspection, we make a steady-state network flow analysis between shops, and derive the steady-state amount of flows between nodes and the steady-state fraction defectives by solving a nonlinear balance equation. Finally we provide some fundamental properties and an enumeration method for determining an optimal value of K which minimizes our objective function. In addition, we compare our results numerically with previous ones.

• The Korean Journal of Applied Statistics
• /
• 제16권1호
• /
• pp.117-128
• /
• 2003

The goal of non-inferiority experiments is to show that the new treatment is not inferior to the standard experiment. In this paper we compare the three methods of variance estimation used in the unconditional exact tests of two proportions. The size and power of the tests with each variance estimation method are compared using complete enumeration.

• Journal of Korean Society for Quality Management
• /
• 제17권1호
• /
• pp.35-47
• /
• 1989

This paper is concerned with a development and evaluation of heuristic algorithms for the n-job, M-stage flowshop with sequence dependent setup times. Three heuristic algorithms, CAIDAN, DANNEN and PETROV, are proposed. The makespan is taken as a performance measure for the algorithms. The experiment for each algorithm is designed for a $4{\times}3{\times}3$ factorial design with 360 observations. The experimental factors are PS (ratio of processing times to setup times), M (number of machines), and N (number of jobs). The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration method. The result of comparision of performance measure is called a relative error. The mean relative errors of CAIDAN, DANNEN and PETROV algorithms are 4.488%. 6.712% and 7.282%, respectively. The computational results are analysed using SPSS. The experimental results show that the three factors are statistically signiticant at 5% level.

• Journal of Plant Biology
• /
• 제29권1호
• /
• pp.19-40
• /
• 1986

A study on the species description, enumeration and interspecific relationships of genus Filipendula was undertaken for four Korean and two Japanese species. The use of scanning electron miroscope(SEM) has made possible a detailed study of foliar trichomes, pollen grains and fruit surface features. A new method for the preparation of SEM samples was developed in this study. Filipendula glaberrima, F. formosa, and F. korean were reliable endemic species. Among them, F. glaberrima shares many characteristics with F. formosa. F. gloaberrima can be divided into tow types based on leaf, seed, flower and pollen characters. Type I is characterized by ciliated fruits, many branched vascular bundles on the petal, dense trichomes on the leaf vein of abaxial surface, and many foveolate pollen surface. Type II possesses glabrous fruits, a few vascular bundles on the petal, rare trichomes on the leaf vein and a few foveolate pollen surface. The significant taxonomic characteristics in the classification of genus Filipendula are their lengths of fruit stalks, the densities of marginal trichomes of fruits, and textures of stipules.

• Journal of Microbiology and Biotechnology
• /
• 제12권5호
• /
• pp.801-806
• /
• 2002

A multiplex competitive polymerase chain reaction (PCR) method was developed for the rapid identification and quantification of Leuconostoc mesnteroides and Lactobacillus plantarum populations which are the key microorganisms in kimchi fermentation. The strain-specific primers were designed to selectively amplify the target genes encoding 165 rRNA of L. plantarum and dextransucrase of L. mesenteroides. There was a linear relationship between the band intensity of PCR products and the number of colony forming units of each model organism. The PCR quantification method was compared with a traditional plate-counting method f3r the enumeration of the two lactic acid bacteria in a mixed suspension culture and also applied to a real food system, namely, watery kimchi. The population dynamics of the two model organisms in the mixed culture were reliably predictable by the competitive PCR analysis.

• The Journal of Engineering Geology
• /
• 제25권4호
• /
• pp.439-447
• /
• 2015

In this study, specific sections vulnerable to debris flow damage were selected, and a complete enumeration survey was performed for the sections with debris flow hazards. Based on this, the characteristics of the sections with debris flow hazards and the current status of actions against debris flow were examined, and an efficient installation plan for a debris flow damage prevention method that is required in the future was suggested. The results indicated that in the Route 56 section where the residential density is relatively higher between the two model survey sections, facilities for debris flow damage reduction were insufficient compared to those in the Route 6 section which is a mountain area. It is thought that several sites require urgent preparation of a facility for debris flow damage reduction. In addition, a numerical analysis showed that for debris barriers installed as a debris flow damage prevention method, distributed installation of a number of small-scale barriers facilities within a valley part was more effective than single installation of a large-scale debris barrier at the lower part of a valley.

• Journal of Korean Society of Transportation
• /
• 제23권2호
• /
• pp.117-130
• /
• 2005

In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

• Journal of the Korean Institute of Gas
• /
• 제17권1호
• /
• pp.49-55
• /
• 2013

Large scale systems, the facilities for the production of power, gas and chemical, have the complex structures. Most systems require the high reliability for the improvement of process efficiency, but it is difficult to analyze the reliability of processes with complex structures. In this study, we investigated reliability path of chemical process with k-out-of-n system by reliability block diagram(RBD) and calculated the reliability of process through the failure enumeration method of reliability path. This method should help in analyzing the reliability of k-out-of-n system.