• Journal of the Korea Safety Management & Science
• /
• v.23 no.1
• /
• pp.65-70
• /
• 2021

Domestic as well as global automobile manufacturers are making greater efforts in cost reduction to strengthen the competitiveness. In this study, we developed a program to effectively manage standard time of automobile assembly line, and confirm based on A-automobile factory data. For the purpose, we develop the system which is possible to manage standard time as well as calculate man-hour for automobile assembly line.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.295-297
• /
• 1986

In this study, the strap down INS on an earth satellite launch vehicle is simulated with different computing cycles between processing the IMU signals and the navigation computation. At the time of separation of booster, error are discussed. The acceptable computing cycles can be determined by simulation.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1996.06a
• /
• pp.97-109
• /
• 1996

In the present work computations are carried out for analysis of complicated sheet metal forming process such as forming of a rear hinge. Finite element formulation using dynamic explicit time integration scheme and step-wise combined Implicit/Explicit scheme are introduced for numerical analysis of sheet metal forming process. The rigid-plastic finite element method based on membrane elements has long been employed as a useful numerical technique for the analysis of sheet metal forming because of its time effectiveness. The explicit scheme in general use is based on the elastic-plastic modelling of material requiring large computation time. In finite element simulation of sheet metal forming processes, the robustness and stability of computation are important requirements since the computation time and convergency become major points of consideration besides the solution accuracy due to the complexity of geometry and boundary conditions. The implicit scheme employs a more reliable and rigorous scheme in considering the equilibrium at each step of deformation, while in the explicit scheme the problem of convergency is eliminated at the cost of solution accuracy. The explicit approach and the implicit approach have merits and demerits, respectively. In order to combine the merits of these two methods a step-wise combined implicit/explicit scheme has been developed.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.5
• /
• pp.87-94
• /
• 2002

In this paper an asynchronous away multiplier with a parallel array structure is introduced. This parallel array structure is used to make the computation time faster with a lower Power consumption. Asymmetric parallel away structure is used to minimize the average computation time in an asynchronous multiplier. Simulation shows that this structure reduces the time needed for computation by 55% as compared to conventional booth encoding array structures and that the multiplier with the proposed away structure shows a reduction of 40% in the computational time with a relatively lower power consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1304-1320
• /
• 1994

There are two computation techniques in real time systems : precise and imprecise computation. The imprecise computation technique is a means to provide scheduling flexibility in real time systems. The studies on imprecise scheduling using queueing theoretical formulation up to data are to explicitly quantify the costs and benifits in trade-off between the average result quality and the average waiting time of tasks. This paper uses two imprecise scheduling schemes and solves the imprecision probability, the probability of any task being imprecise under two imprecise scheduling schemes and analyzes the dependence of the imprecision probability on several parameters os the monotone imprecise system.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.11
• /
• pp.361-368
• /
• 2015

In AAGFCS the effective range is regarded as a range for the bullet's speed exceeding the speed of sound to damage the stationary target. Hence the real engagement range might be extended over the effective range for the approaching target since bullet's relative speed to the target increases depending on the approaching speed. However previous TOF equations have good computation accuracy within the effective range only, and they can not be used above that range due to their bad accuracy. We propose an accurate TOF computation method which can be used both within and above the effective range in real time. Some simulation results are shown to demonstrate usefulness of our algorithm for the 30mm projectile.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.6
• /
• pp.293-305
• /
• 2005

This paper describes an improved Prony method in its speed, accuracy and reliability by efficiently determining the optimal sampling interval with use of DFT (discrete Fourier transformation). In the Prony method the computation time is dominated by the size of the linear prediction matrix, which is given by the number of data times the modeling order The size of the matrix in a general Prony method becomes large because of large number of data and so does the computation time. It is found that the Prony method produces satisfactory results when SNR is greater than three. The maximum sampling interval resulting minimum computation time is determined using the fact that the spectrum in DFT is inversely proportional to sampling interval. Also the process of computing the modes is made efficient by applying Hessenberg method to the companion matrix with complex shift and computing selectively only the dominant modes of interest. The proposed method is tested against the 2003 KEPCO system and found to be efficient and reliable. The proposed method may play a key role in monitoring in real time low frequency oscillations of power systems .

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.295-306
• /
• 2007

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agents. Most of the past research results are thus based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents, for the case of general shaped paths in agent movement. First, to reduce the computation time, an extended collision map is developed and utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, a priority for multi-agents is considered for successive and interactive modifications of the agent movements with lower priority. Various solutions using speed reduction and time delay of the relevant agents are investigated and compared in terms of the computation time. A practical implementation is finally provided for three different types of agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• Journal of Korean Society for Quality Management
• /
• v.49 no.2
• /
• pp.201-211
• /
• 2021

Purpose: This paper proposes a density adaptive grid algorithm for the k-NN regression model to reduce the computation time for large datasets without significant prediction accuracy loss. Methods: The proposed method utilizes the concept of the grid with centroid to reduce the number of reference data points so that the required computation time is much reduced. Since the grid generation process in this paper is based on quantiles of original variables, the proposed method can fully reflect the density information of the original reference data set. Results: Using five real-life datasets, the proposed k-NN regression model is compared with the original k-NN regression model. The results show that the proposed density adaptive grid-based k-NN regression model is superior to the original k-NN regression in terms of data reduction ratio and time efficiency ratio, and provides a similar prediction error if the appropriate number of grids is selected. Conclusion: The proposed density adaptive grid algorithm for the k-NN regression model is a simple and effective model which can help avoid a large loss of prediction accuracy with faster execution speed and fewer memory requirements during the testing phase.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.57-60
• /
• 2000

This paper presents a new adaptive fast motion estimation algorithm along with its architecture. The conventional algorithm such as full - search algorithm, three step algorithm have some disadvantages which are related to the amount of computation, the quality of image and the implementation of hardware, the proposed algorithm uses spatial correlation and a slope of motion vector in order to reduce the amount of computation and preserve good image quality, The proposed algorithm is better than the conventional Block Matching Algorithm(BMA) with regard to the amount of computation and image quality. Also, we propose an efficient at chitecture to implement the proposed algorithm. It is suitable for real time processing application.