• Journal of computational fluids engineering
• /
• v.4 no.3
• /
• pp.44-51
• /
• 1999

A modified version of SST turbulence model is suggested to simulate unsteady separated flows over oscillating airfoils. The original SST model, which shows good performance in predicting various steady flows, often results in oscillatory behavior of aerodynamic loads in large separated flow regions. It is shown that this oscillatory behavior is due to the adoption of the absolute value of vorticity in generalizing the original model. As a remedy, a modification is made such that the vorticity in the original SST model is replaced by strain rate. The present model is verified for a mild separated airfoil flow at fixed angle of incidence and for unsteady flowfields about oscillating airfoils. The results are compared with BSL model and original SST model. It is illustrated that the present model gives a better agreement with the experimental results than other two models.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.333-333
• /
• 2000

When the generalized singular perturbation method is used for model reduction, the state variables of the original system is reconstructed from the reduced order model. The state reduction error is defined, which shows how well the reconstructed state variables approximate the state variables of the original system equation.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.1312-1314
• /
• 2004

This paper proposes a new simplification algorithm that simplifies reconstructed polygonal mesh from 3D point set considering an original point set. Previous method computes error using mesh information, but it makes to increase error of difference between an original and a simplified model by reason of implementation of simplification. Proposed method simplifies a reconstructed model using an original point data, we acquire a simplified model similar an original. We show several simplified results to demonstrate the usability of our methods.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.2E
• /
• pp.27-31
• /
• 1997

This paper proposes a new rejection algorithm which distinguishes unregistered spoken words(or non-keywords) from registered vocabulary. Two kinds of garbage models are employed in this design ; the original garbage model and a new word garbage model. The original garbage model collects all non-keyword patterns where the new word garbage model collects patterns classified by recognizing each non-keyword pattern with registered vocabulary. These two types of garbage models work together to make a robust reject decision. The first stage of processing is the classification of an input pattern through the original garbage model. In the event that the first stage of processing is ambiguous, the new word dependent garbage model is used to classify thye input pattern as either a registered or non-registered word. This paper shows the efficiency of the new word dependent garbage model. A Dynamic Multisection method is used to test the performance of the algorithm. Results of this experiment show that the proposed algorithm performs at a higher level than that of the original garbage model.

• Journal of applied mathematics & informatics
• /
• v.2 no.2
• /
• pp.47-52
• /
• 1995

in this paper we reduce the trading strategy of discounted security model to trading strategy of original model

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.1
• /
• pp.1-8
• /
• 2016

We propose a novel framework for controlling various and complex models using primitive model. To control original model, first we correspond original model to simplified primitive model that contains original model. After doing deformable simulation with primitive model, we compute original model by inversion of result. Since existing method can only control one type formed models, our method - which can control all difference formed models by only one primitive model - has contribution. In conclusion, we show results that efficiently and intuitionally control the various deformable models by using one example primitive model.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.1
• /
• pp.9-15
• /
• 2003

To improve the performance of PID controller of high order systems by model reduction, we proposed two model reduction methods. One, Original model with two point $({\angle}G(jw)=\;-{\pi}/2,\;-{\pi})$ in Nyquist curve used gradient base method and genetic algorithm. The other, Original model without two point$({\angle}G(jw)=\;-{\pi}/2,\;-{\pi})$in Nyquist curve used to add very small dead time. This method has annexed very small dead time on the base model for reduction, and we remove it after getting the reduced model, and , we improved Smith-predictor for a dead-time compensator using genetic algorithms. This method considered four points$({\angle}G(jw)=0,\;-\pi/2,\;-\pi,\;-3\pi/2)$ in the Nyquist curve to reduce steady state error between original and reduced model. It is shown that the proposed methods have more performance than the conventional method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.863-874
• /
• 1999

세분화란 초기 원형 모델의 삼각형 메쉬를 여러 개의 작은 메쉬로 변환하는 기법으로, 간략화 된 모델을 다시 원상태로 표현하기 위해 사용된다. 기존의 보간에 의한 세분화는 전체 모델의 에지에 일률적으로 세분화를 적용하기 때문에, 효과가 적은 부분까지도 세분화가 수행하게 되어 효율이 떨어진다. 본 논문에서는 정점 변화율을 기반으로 에지를 선택하여 세분화를 수행한다. 따라서 원형 메쉬를 변환하여 세분화된 메쉬를 생성할 때, 모델의 각 부분들은 정점 변화율의 차이에 의해 서로 다른 세분화 정도를 가지게 된다. 이 과정을 통해 원형 모델의 곡률 특성이 반영된 세분화를 수행할 수 있게 되고, 전체 모델의 세분화 정도를 조정하는 것도 가능해진다. Abstract The subdivision is a mesh transformation, which makes an original triangle mesh to subdivided meshes. This method is used for recovering original model from simplified model. The existing subdivision based on interpolation is inefficient, because it is targeted for whole edges of mesh model. Therefore, this method applies to non-effective parts. In this paper the subdivision is executed by edge selection based on curvature. When original model is transformed to subdivided model by proposed method, the parts of model has different subdivision degrees by means of the averages of vertex curvature.Proposed method makes it enable subdivision, which deploy characteristics of curvatures of original model and adjusting a degree of subdivision in whole model.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.8
• /
• pp.573-580
• /
• 2020

One of challengeable problems of multi-agent systems is a positioning control. Augmented Cucker-Smale model is using for controlling position and velocity of the multi-agent system. The original model applies same coefficients to all agents in same group, so that does not consider characteristic of each agent. To enhance performance of the original model, this paper transforms original coefficients to Mahalanobis distance coefficients that reflects an initial distribution of multi-agent systems and applies statistical degrees of freedom. This paper not only confirms tendency of enhanced performance of the suggested model by using monte-carlo simulation, but also additionally compares trajectory of the original model with the suggested model to confirm coefficients of Mahalanobis distance performing correctly.

• 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.