• The Journal of Natural Sciences
• /
• v.8 no.2
• /
• pp.83-91
• /
• 1996

We first obtain the departure process of a D-BMAP/Geo/1/K queue. The departure process is then exactly characterized by a k-state MMBP in order to capture the burstiness and correlation of the departure process.

• The Journal of Natural Sciences
• /
• v.7
• /
• pp.75-82
• /
• 1995

We obtain the departure process of a D-BMAP/Geo/1/K queue. We also study the burstiness and correlation of the departure process. We have observed that the autocorrelation coefficients of the interdeparture time(correlogram) of the departure process may oscillated.

• Journal of Korean Society for Quality Management
• /
• v.38 no.2
• /
• pp.171-179
• /
• 2010

Pearn et al.(2002) supposed the $C_{pp}$ multiple process performance analysis chart. This chart displays multiple processes with the process variation and process departure on one single chart. But, this chart can not display the distribution of the process variation and process departure and is inappropriate for processes with non-normal distributions. With bootstrapping method, we can display the distribution of the process variation and process departure on the $C_{pp}$ multiple process performance analysis chart.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2007.04a
• /
• pp.287-296
• /
• 2007

Pearn et al.(2002) supposed the $C_{pp}$ multiple process performance analysis chart. This chart display multiple processes with the process variation and process departure on one single chart. But, this chart can not display the distribution of the process variation and process departure. With bootstrapping method, we can display the distribution of the process variation and process departure on the $C_{pp}$ multiple process performance analysis chart.

• Industrial Engineering and Management Systems
• /
• v.1 no.1
• /
• pp.29-45
• /
• 2002

In this study, we consider infinite supply of raw materials and backlogged demands as given two boundary conditions. And we need not make any specific assumptions about the inter-arrival of external demand and service time distributions. We propose a numeric model and an algorithm in order to compute the first two moments of inter-departure process. Entropy enables us to examine the convergence of this process and to derive measurable relations of this process. Also, lower bound on the variance of inter-departure process plays an important role in proving the existence and uniqueness of an optimal solution for a numeric model and deriving the convergence order of augmented Lagrange multipliers method applied to a numeric model. Through these works, we confirm some structural properties and numeric examples how the validity and applicability of our study.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.428-437
• /
• 2005

In this paper, we developed lane departure warning system for lane departure situation of vehicle, accidentally. Color level of yellow lane of road side is changed to black and white level. And black and white level value of relevant pixel of original and yellow lane through added process of this are emphasized. In lane departure detection system, color image data processing method could improve the recognition of the yellow lane(central lane). We could get a system Performance of the high-speed image data Processing. Therefore, lane departure warning system will be utilized at the device for the safety going of the vehicle.

• The Journal of Engineering Research
• /
• v.1 no.1
• /
• pp.31-40
• /
• 1997

We first describe an approximation method for fitting a k-state MMBP to the departure process of a D-BMAP/Geo/1/K queue. The fitting model is them used in a simple decomposition algorithm to analyze a tandem configuration of finite capacity queue with cell loss.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 1998.11a
• /
• pp.594-609
• /
• 1998

In this dissertation, a new process capability index $C_{psk}$ is introduced for non-normal process. The Pearson curve and the Johnson curve are selected for capability index calculation and data modeling the normal-based index $C_{psk}$ is used as the model for non-normal process. A significant result of this research find that the ranking of the seven indices, $C_p,\;C_{pk},\;C_{pm},\;C^{\ast}_{pm},\;C_{pmk},\;C_s,\;C_{psk}$ in terms of sensitivity to departure of the process median from the target value T=M from the most sensitive one up to the least sensitive are $C_{psk},\;C_{s},\;C_{pmk},\;C^{\ast}_{pm},\;C_{pm},\;C_{pk},\;C_p$. i.e, By the criteria adopted for evaluation of PCI's $C_{psk}$ is the most sensitive to the departure of the process median from target and $C_p$ is least

• Journal of the Korean Society of Systems Engineering
• /
• v.14 no.2
• /
• pp.41-48
• /
• 2018

This paper describes the systems engineering development process for the Departure from Nucleate Boiling Ratio (DNBR) algorithm using FPGA. Current Core Protection Calculator System (CPCS) requirement and DNBR logic are analyzed in the reverse engineering phase and the new FPGA based DNBR algorithm is designed in the re-engineering phase. FPGA based DNBR algorithm is developed by VHSIC Hardware Description Language (VHDL) in the implementation phase and VHDL DNBR software is verified in the software Verification & Validation phase. Test cases are developed to perform the software module test for VHDL software modules. The APR 1400 simulator is used to collect the inputs data in 100%, 75%, and 50% reactor power condition. Test input signals are injected to the software modules following test case tables and output signals are compared with the expected test value. Minimum DNBR value from developed DNBR algorithm is validated by KEPCO E&C CPCS development facility. This paper summarizes the process to develop the FPGA-based DNBR calculation algorithm using systems engineering approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.15-26
• /
• 2000

We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be present in the network can not exceed a given value k. Customers arriving at the queueing network when there are more than k customers are forced to walt in an external queue. The arrival process to the queueing network is assumed to be arbitrary. It is known that the queueing network with population constrant and constant service times can be transformed into a simple network involving only two nodes. In this paper, the departure process from the queueing network is examined using this simple network. An approximation can be calculated with accuracy. Finally, validations against simulation data establish the tightness of these.