• Journal of the Korean Statistical Society
• /
• v.33 no.2
• /
• pp.159-167
• /
• 2004

We present a simple approach to finding the stationary workload of M/G/1 queues having generalized vacations and exhaustive service discipline. The approach is based on the level crossing technique. According to the approach, all that we need is the workload at the beginning of a busy period. An example system to which we apply the approach is the M/G/1 queue with both multiple vacations and D-policy.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.501-504
• /
• 1995

A Simultaneous optimal design of structural and control system of a semi-active suspension is applied on a helf-car model in this paper. Suspension stiffnesses and dampings are selected as structural design parameters and damping forces of variable dampers as controller parameters. Sence this optimization problem is of large discontinuous space, conventional exhaustive methods are not enough. So we here try out an approach using Genetic Algorithm for our problem. Through numerical simulation work, the performance of the simultaneously optimized system was tested and showed meaningful improvement over the partially optimized ones.

• Journal of the military operations research society of Korea
• /
• v.35 no.1
• /
• pp.21-32
• /
• 2009

In this study, the author uses a MATLAB simulation to develop and test a generalization of the traditional Random Search model which allows both the searcher and target to move and to be in different, but overlapping, areas. Also the best evasion speed for a randomly moving target against a Systematic Search is studied.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.500-503
• /
• 1989

Our work is an attempt to recognize objects without a rigid ordering of steps and with fuller use of previous results as analysis proceeds. We assume that the difference in brightness between the objects and the background is large enough to detect the background boundaries easily. Lines are mostly proposed insted of found by exhaustive search in the scne, the program is relatively efficient.

• Journal of the Korean Statistical Society
• /
• v.26 no.3
• /
• pp.355-363
• /
• 1997

In queueing theory, polling systems have been widely studied as a way of serving several stations in cyclic order. In this paper we consider Markov-modulated Poisson process which is useful for approximating a superposition of heterogeneous arrivals. We derive the mean waiting time of each station in a polling system where the arrival process is modeled by a Markov-modulated Poisson process.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.569-571
• /
• 1995

This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.95-104
• /
• 1996

We consider a two-phase queueing system with generalized vacation. Poisson arrivals receive a batch type service in the first phase and individual services in the second phase. The server takes generalized vacation when the system becomes empty. Generalized vacation includes single vacation, multiple vacation, and other types. We consider both gated batch service and exhaustive batch service. This is an extension of the model presented by Selvam and Sivasankaran [6].

• Journal of Korea Multimedia Society
• /
• v.21 no.3
• /
• pp.342-347
• /
• 2018

We proposed a fast detection of copy-move image forgery using four step search algorithm in the spatial domain. In the four-step search algorithm, the search area is 21 (-10 ~ +10), and the number of pixels to be scanned is 33. Our algorithm reduced computational complexity more than conventional copy move image forgery methods. The proposed method reduced 92.34 % of computational complexity compare to exhaustive search algorithm.

• Journal of the Korea Society for Simulation
• /
• v.1 no.1
• /
• pp.17-24
• /
• 1992

The capacity of the drilling process in Multi-Layer PCB fabrication can be affected by various process parameters determining material flows in the unit operations. The ratio of mass-lamination to pin lamination and the number of stacks as the most critical paramaters, among them, were chosen on the basis of exhaustive field evaluation to study their effects on the capacity of the process. The best alternative condition for maximum capacity of the process was selected by simulation of process.

• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.553-562
• /
• 2021

Directional regression (DR; Li and Wang, 2007) is well-known as an exhaustive sufficient dimension reduction method, and performs well in complex regression models to have linear and nonlinear trends. However, the extension of DR is not well-done upto date, so we will extend DR to accommodate multivariate regression and large p-small n regression. We propose three versions of DR for multivariate regression and discuss how DR is applicable for the latter regression case. Numerical studies confirm that DR is robust to the number of clusters and the choice of hierarchical-clustering or pooled DR.