• Journal of Korean Society for Quality Management
• /
• v.26 no.1
• /
• pp.48-60
• /
• 1998

This paper proposes a fourth generation index $C_{psk}$, constructed from $C_{psk}$, by introducing the factor｜$\mu$-T｜ in the numerator as an extra penalty for the departure of the process mean from the preassigned target value T. The motivation behind the introduction of $C_{psk}$ is that when $T\neqM$ process shifts away from target are evaluated without respect to direction. All indices that are now in use assume normally distributed data, and any use of the indices on non-normal data results in inaccurate capability measurements. In this paper, 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 six indices, $C_{p}$, $C_{pk}$, $C_{pm}$, ${C^*}_{psk}$, $C_{pmk}$, $C_{psk}$in terms of sensitivity to departure of the process median from the target value from the most sensitive one up to the least sensitive are $C_{psk}$, $C_{pmk}$, ${C^*}_{psk}$,$C_{pm}$, $C_{pk}$, $C_{p}$.

• Journal of the Korea Society for Simulation
• /
• v.20 no.2
• /
• pp.1-10
• /
• 2011

In queueing network analysis, arrival processes are usually modeled as renewal processes by matching mean and variance. The renewal approximation simplifies the analysis and provides reasonably good estimate for the performance measures of the queueing systems under moderate conditions. However, high variability in arrival process or in service process requires more sophisticated approximation procedures for the variability parameter of departure/arrival processes. In this paper, we propose an heuristic approach to refine Whitt's variability function with the k-interval squared coefficient of variation also known as the index of dispersion for intervals(IDI). Regression analysis is used to establish an empirical relationships between the IDI of arrival process and the IDI of departure process of a queueing system.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.4
• /
• pp.113-121
• /
• 2009

In this paper, we consider the departure process from the open and nested tandem Queueing network with population constraint and constant service times. It is known that the Queueing network can be transformed into a simple Queueing network which can be easy to analyze. Using this simple Queueing network, upper and lower bounds on the interdeparture time are obtained. We prove that the variance of the interdeparture time is bounded within these two bounds. Validation against simulation data is shown that how it works the variance of the interdeparture time within two bounds. These bounds can be applied to obtain the better variance of the interdeparture time using a suitable method.

• Journal of the Ergonomics Society of Korea
• /
• v.36 no.4
• /
• pp.343-353
• /
• 2017

Objective: This study aims to evaluate the efficiency of two representative subway map design types, namely a diagram type and a geographical type using physiological metrics, performance metrics, and self-reported metrics, which are representative usability metrics. Background: Subway maps need to be designed in order for users to quickly search and recognize subway line information. Although most cities' subway maps currently use the diagram type designed by Henry Beck, New York City's subway map has recently been changed to the subway map type combined with the geographical type designed by Michael Hertz. However, not many studies on its efficiency are found, and the studies that are available mainly depend on questionnaire surveys or take on a subjective behavioral study type based on experts' experiences. In this regard, evaluation through a more objective method is needed. Method: This study employed usability metrics as a method to evaluate the efficiency of information search targeting the diagram type and geographical type subway maps used mostly as subway maps. To this end, physiological metrics obtained through eye tracking, task completion time, representative metric of task performance, and subjective evaluation metrics were used for the suitability evaluation of subway map designs. Results: In the result of gaze movement distance analysis, no significant difference was shown in the two design types in terms of a process finding a departure station from the starting point and a process finding a transfer station between the departure station and arrival station (destination). However, the gaze movement distance in the process finding the arrival station at the departure station was significantly shorter in the geographical type, rather than in the diagram type. The analysis of task completion time showed a result similar to the gaze movement distance analysis result. Task completion time was significantly shorter in the geographical type, rather than in the diagram type, which is in the process finding the arrival station at the departure station. In other information search processes, no significant difference was shown. As a result of subjective evaluation metrics analysis, no significant difference was revealed in the two design types. Conclusion: An analysis on the two representative subway map design types was carried out via the adoption of usability metrics. As a result, although no significant difference was shown in some information search processes, it was revealed that information search was easier in the geographical type overall. Also, it was found that usability metrics can be effectively used to evaluate the design types of subway maps. Application: The study results can be used to set design direction to offer ease in information search on subway lines. The study also can be used as a method to evaluate a subway map's design type.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.9
• /
• pp.766-772
• /
• 2016

Recent advances in networking and computers, especially internet of things (IoT) technologies, have improved the quality of home life and industrial sites. However, the security vulnerability of IoT technologies causes life-threatening issues and information leakage concerns. Studies regarding security algorithms are being conducted. In this paper, we proposed SEED algorithms based on one time passwords (OTPs). The specified server sent time data to the client every 10 seconds. The client changed the security key using time data and generated a ciphertext by combining the changed security key and the matrix. We applied the SEED algorithms with enhanced security to Linux-based embedded boards and android smart phones, then conducted a door lock control experiment (door lock & unlock). In this process, the power consumed for decryption was measured. The power consumption of the OTP-based algorithm was measured as 0.405-0.465W. The OTP-based algorithm didn't show any difference from the existing SEED algorithms, but showed a better performance than the existing algorithms.

• Nuclear Engineering and Technology
• /
• v.48 no.4
• /
• pp.915-924
• /
• 2016

After a severe accident to the nuclear reactor, the in-vessel retention strategy is a key way to prevent the leakage of radioactive material. Nanofluid is a steady suspension used to improve heat-transfer characteristics of working fluids, formed by adding solid particles with diameters below 100nm to the base fluids, and its thermal physical properties and heat-transfer characteristics are much different from the conventional working fluids. Thus, nanofluids with appropriate nanoparticle type and volume concentration can enhance the heat-transfer process. In this study, the moving particle semi-implicit method-meshless advection using flow-directional local grid method is used to simulate the bubble growth, departure, and sliding on the downward-facing heating surface in pure water and nanofluid (1.0 vol.% $Al_2O_3/H_2O$) flow boiling processes; additionally, the bubble critical departure angle and sliding characteristics and their influence are also investigated. The results indicate that the bubble in nanofluid departs from the heating surface more easily and the critical departure inclined angle of nanofluid is greater than that of pure water. In addition, the influence of nanofluid on bubble sliding is not significant compared with pure water.

• Nuclear Engineering and Technology
• /
• v.48 no.4
• /
• pp.859-869
• /
• 2016

Component-scale modeling of boiling is predominantly based on the Eulerian-Eulerian two-fluid approach. Within this framework, wall boiling is accounted for via the Rensselaer Polytechnic Institute (RPI) model and, within this model, the bubble is characterized using three main parameters: departure diameter (D), nucleation site density (N), and departure frequency (f). Typically, the magnitudes of these three parameters are obtained from empirical correlations. However, in recent years, efforts have been directed toward mechanistic modeling of the boiling process. Of the three parameters mentioned above, the departure diameter (D) is least affected by the intrinsic uncertainties of the nucleate boiling process. This feature, along with its prominence within the RPI boiling model, has made it the primary candidate for mechanistic modeling ventures. Mechanistic modeling of D is mostly carried out through solving of force balance equations on the bubble. Forces incorporated in these equations are formulated as functions of the radius of the bubble and have been developed for, and applied to, low-pressure conditions only. Conversely, for high-pressure conditions, no mechanistic information is available regarding the growth rates of bubbles and the forces acting on them. In this study, we use direct numerical simulation coupled with an interface tracking method to simulate bubble growth under high (up to 45 bar) pressure, to obtain the kind of mechanistic information required for an RPI-type approach. In this study, we compare the resulting bubble growth rate curves with predictions made with existing experimental data.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.185-205
• /
• 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. Under these situations, the ultimate objective of this study is to prove the variability propagation principle in a pull serial line and is to measure it in terms of the first two moments of the inter-departure process subject to number of cards in each cell. Two preparations are required to achieve this objective : The one is to derive a true lower bound of variance of the inter-departure process. The other is to establish a constrained discrete minimax problem for the no backorder (backlogging) probabilities in each cell. We may get some fundamental results necessary to a completion for the proof through the necessary and sufficient conditions for existence of optimal solution of a constrained discrete minimax problem and the implicit function theorem. finally, we propose a numeric model to measure the variability propagation principle. Numeric examples show the validity and applicability of our study.

• Communications of the Korean Mathematical Society
• /
• v.14 no.3
• /
• pp.611-625
• /
• 1999

We consider ΜΑΡ/G/ 1 finite capacity queue with mul-tiple thresholds on buffer. The arrival of customers follows a Markov-ian arrival process(MAP). The service time of a customer depends on the queue length at service initiation of the customer. By using the embeded Markov chain method and the supplementary variable method, we obtain the queue length distribution ar departure epochs and at arbitrary epochs. This gives the loss probability and the mean waiting time by Little's law. We also give a simple numerical examples to apply the overload control in packetized networks.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.119-134
• /
• 2001

This paper proposed a dynamic transit vehicle simulation model and a dynamic transit passengers simulation model, which can simultaneously simulate the transit vehicles and passengers traveling on a transit network, and also developed an algorithm of dynamic departure time choice model based on individual passenger. The proposed model assumes that each passenger's behavior is heterogeneous based on stochastic process by relaxing the assumption of homogeneity among passengers and travelers have imperfect information and bounded rationality to more actually represent and to simulate each passenger's behavior. The proposed model integrated a inference and preference reforming procedure into the learning and decision making process in order to describe and to analyze the departure time choices of transit passengers. To analyze and evaluate the model an example transit line heading for work place was used. Numerical results indicated that in the model based on heterogeneous passengers the travelers' preference influenced more seriously on the departure time choice behavior, while in the model based on homogeneous passengers it does not. The results based on homogeneous passengers seemed to be unrealistic in the view of rational behavior. These results imply that the aggregated travel demand models such as the traditional network assignment models based on user equilibrium, assuming perfect information on the network, homogeneity and rationality, might be different from the real dynamic travel demand patterns occurred on actual network.