• Journal of IKEEE
• /
• v.20 no.3
• /
• pp.291-294
• /
• 2016

A new optical one-time pattern password(OTPT) mutual authentication method is proposed, which presents a two-factor authentication by 2-step phase-shifting digital holography and performs a two-way authentication by a challenge-response handshake of the optical OTPT in both directions. Because a client and a server use OTPT once as a random number and encrypt it for mutual authentication, it protects against a replay or a man-in-the middle attack and results in higher security level.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.787-798
• /
• 2003

The flow label field in IPv6 has been proposed to provide the QoS. Since the existing flow label specification scheme like random-number format utilizes the label only as the identifier of flow, it is not appropriate for providing differentiated services according to the characteristics of various types of real-time traffic. This paper proposes a hybrid scheme that makes use of the flow label fields as components of flow and QoS parameters as well. To be specific, this paper investigates a scheme that both guarantees the end-to-end service quality and utilizes efficiently backbone resources by allowing users to specify QoS parameters using flow labels. Assuming an MLPS-TE network as the backbone, we compare the performance of our proposed scheme with that of random-number scheme through simulation. The simulation result shows that our scheme is more efficient than the existing one in terms of the transmission rate as well as the resource utilization of the backbone.

• Korean Journal of Childcare and Education
• /
• v.20 no.2
• /
• pp.127-143
• /
• 2024

Objective: The purpose of this study is to develop a machine learning model to predict the subsequent childbirth intention of married women with one child, aiming to address the low birth rate problem in Korea, This will be achieved by utilizing data from the 2021 Family and Childbirth Survey conducted by the Korea Institute for Health and Social Affairs. Methods: A prediction model was developed using the Random Forest algorithm to predict the subsequent childbirth intention of married women with one child. This algorithm was chosen for its advantages in prediction and generalization, and its performance was evaluated. Results: The significance of variables influencing the Random Forest prediction model was confirmed. With the exception of the presence or absence of leave before and after childbirth, most variables contributed to predicting the intention to have subsequent childbirth. Notably, variables such as the mother's age, number of children planned at the time of marriage, average monthly household income, spouse's share of childcare burden, mother's weekday housework hours, and presence or absence of spouse's maternity leave emerged as relatively important predictors of subsequent childbirth intention.

• Management Science and Financial Engineering
• /
• v.2 no.1
• /
• pp.123-145
• /
• 1996

We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

• Korean Journal of Cognitive Science
• /
• v.31 no.1
• /
• pp.1-23
• /
• 2020

This paper introduces SNUDM, an analysis program for Ratcliff's diffusion model, which has been one of the most important models in cognitive psychology over the past 35 years and which has come to occupy an important place in cognitive neuroscience in recent years. The analysis tool is designed with the basic principles of easy comprehension and simplicity in use. A diffusion process was programmed as the limit of a simple random walk in a manner resembling Ratcliff & Tuerlinckx(2002). The response time distribution of the model was constructed by simulating the time taken by a random walk until it reaches a threshold with small steps. The optimal parameter values in the model are found to be the smallest value of the chi-square values obtained by comparing the resulting distribution and the experimental data using Simplex method. For simplicity and ease of use, the input file used here is created as a file containing the quantile of the reaction time, the trials and other information. The number of participants and the number of conditions required for such work programs are given in a way that answers the question. Using this analysis tool, the experimental data of Ratcliff, Gomez, & McKoon(2004) were analyzed. We found the very similar pattern of parameter values to Ratcliff et al.(2004) found. When comparing DMAT, fast-dm and SNUDM with the generated data, we found that when the number of trials is small, SNUDM estimates the boundary parameter to a value similar to fast-dm and less than the DMAT. In addition, when the number of trials was large, it was confirmed that all three tools estimate parameters similarly.

• Journal of Internet Computing and Services
• /
• v.13 no.6
• /
• pp.1-8
• /
• 2012

Clustering method is divided into hierarchical clustering, partitioning clustering, and more. K-Means algorithm is one of partitioning clustering and is adequate to cluster so many documents rapidly and easily. It has disadvantage that the random initial centers cause different result. So, the better choice is to place them as far away as possible from each other. We propose a new method of selecting initial centers in K-Means clustering. This method uses triangle height for initial centers of clusters. After that, the centers are distributed evenly and that result is more accurate than initial cluster centers selected random. It is time-consuming, but can reduce total clustering time by minimizing the number of allocation and recalculation. We can reduce the time spent on total clustering. Compared with the standard algorithm, average consuming time is reduced 38.4%.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.11 no.6
• /
• pp.45-51
• /
• 2002

The existing methods to split overall gear ratio of the cylindrical multi-stage gear train have their own limitations to be used in practical design and are also problematic to be implemented in a formalized algerian. This paper proposes two types of new methods to find gear ratios best approximating the overall gear ratio. The proposed methods are quite general to be applied to the gear train having any number of stages, and offer a considerably good result in a very short time. The first method uses the random search method and the second one is based on the simulated annealing algorithm. The proposed algorithms are expected to be very useful not only as an independent program to split overall gear ratio, but also as a desist sub-module for the integrated desist system of multi-stage gear drives.

• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.451-461
• /
• 2009

The Adaptive Random Testing(ART) aims to improve the performance of traditional Random Testing(RT) by reducing the number of test cases to find the failure region which is located in the input domain. Such enhancement can be obtained by efficient selection algorithms of test cases. The ART through Iterative Partitioning(IP-ART) is one of ART techniques and it uses an iterative input domain partitioning method to improve the performance of early-versions of ART which have significant drawbacks in computation time. And the IP-ART with Enlarged Input Domain(EIP-ART), an improved version of IP-ART, is known to make additional performance improvement with scalability by expanding to virtual test space beyond real input domain of IP-ART. The EIP-ART algorithm, however, have the drawback of heavy cost of computation time to generate test cases mainly due to the virtual input domain enlargement. For this reason, two algorithms are proposed in this paper to mitigate the computation overhead of the EIP-ART. In the experiments by simulations, the tiling technique of input domain, one of two proposed algorithms, showed significant improvements in terms of computation time and testing performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.1
• /
• pp.261-266
• /
• 2000

The password is the first step for computer security. If security of password is unimportant even constructing of fire-wall, it is useless. But end-user is not able to manage a high-difficulty password. So complement for password management is needed. In this paper, algorithm which produces one time password by using random number in client is used. Not oかy this is easy for end-user to manage password, but also this can eliminate insecurity for server hacking.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.4
• /
• pp.555-570
• /
• 1995

We consider a preventive replacement policy for a cold-standby system with N components, in which only one component is in operation at a time. If the component in operation fails, a standby component is immediately switched into operation. If all components fail, the system fails. The system is inspected at random poins in time to determine whether it is to be replaced or not. If the number of failed components at the time of inspection exceeds a threshold value r, the system is replaced. Otherwise the decision is put off until the next inspection point arrives. Under the cost structure which includes a replacement cost, a system down-time cost and a holding cost of the components, we develop an efficient procedure to find the optimal control values N and r, which minimize the expected cost per unit time.