• Title/Summary/Keyword: 근사알고리즘

Search Result 779, Processing Time 0.029 seconds

Optimization of Valve Gates Locations Using Automated Runner System Modeling and Metamodels (유동 안내부 모델링 자동화 및 근사모델을 이용한 자동차용 도어트림의 밸브 게이트 위치 최적화)

  • Joe, Yong-Su;Park, Chang-Hyun;Pyo, Byung-Gi;Rhee, Byung-Ohk;Choi, Dong-Hoon
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.22 no.2
    • /
    • pp.115-122
    • /
    • 2014
  • Injection pressure is one of factors that influence part quality. In this paper, injection pressure was minimized by optimizing valve gate locations. In order to perform design optimization, MAPS-3DTM (Mold Analysis and Plastic Solution-3D) was used for injection mold analysis and PIAnOTM (Process Integration, Automation and Optimization) was used as process integration and design optimization. Also we adapted meta models based on design of experiments for efficiency. By using introduced methodology, we were able to obtain a result so that maximum injection pressure reduced by 28% compared to the initial design. And the validity of the proposed method could also be demonstrated.

Fast Triangular Mesh Approximation for Terrain Data Using Wavelet Coefficients (Wavelet 변환 계수를 이용한 대용량 지형정보 데이터의 삼각형 메쉬근사에 관한 연구)

  • 유한주;이상지;나종범
    • Journal of Broadcast Engineering
    • /
    • v.2 no.1
    • /
    • pp.65-73
    • /
    • 1997
  • This paper propose a new triangular mesh approximation method using wavelet coefficients for large terrain data. Using spatio-freguency localization characteristics of wavelet coefficients, we determine the complexity of terrain data and approximate the data according to the complexity. This proposed algorithm is simple and requires low computational cost due to its top-down approach. Because of the similarity between the mesh approximation and data compression procedures based on wavelet transform, we combine the mesh approximation scheme with the Embedded Zerotree Wavelet (EZW) coding scheme for the effective management of large terrain data. Computer simulation results demonstrate that the proposed algorithm is very prospective for the 3-D visualization of terrain data.

  • PDF

Approximate Multi-Objective Optimization of Robot Casting Considering Deflection and Weight (처짐과 무게를 고려한 주물 프레임의 다중목적 근사최적설계)

  • Choi, Ha-Young;Lee, Jongsoo;Park, Juno
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.21 no.6
    • /
    • pp.954-960
    • /
    • 2012
  • Nowadays, rapidly changing and unstable global economic environments request a lot of roles to engineers. In this situation, product should be designed to make more profit by cost down and to satisfy distinguished performance comparing to other competitive ones. In this research, the optimization design of the industrial robot casting will be done. The weight and deflection have to be reduced as objective functions and stress has to be constrained under some constant value. To reduce time cost, CCD (Central Composite Design) will be used to make experimental design. And RSM (Response Surface Methodology) will be taken to make regression model for objective functions and constraint function. Finally, optimization will be done with Genetic Algorithm. In this problem, the objective functions are multiple, so NSGA-II which is brilliant and efficient for such a problem will be used. For the solution quality check, the diversity between Pareto solutions will be also checked.

A Study on the Comparison of Performances Between Direct Method and Approximation Method in Structural Optimization (구조최적설계시 직접법 및 근사법 알고리즘의 성능 비교에 관한 연구)

  • 박영선;이상헌;박경진
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.2
    • /
    • pp.313-322
    • /
    • 1994
  • Structural optimization has been developed by two methods. One is the direct method which applies the Nonlinear Programming (NLP) algorithm directly to the structural optimization problem. This method is known to be very excellent mathematically. However, it is very expensive for large-scale problems due to the one-dimensional line search. The other method is the approximation method which utilizes the engineering senses very well. The original problem is approximated to a simple problem and an NLP algorithm is adopted for solving the approximated problems. Practical solutions are obtained with low cost by this method. The two methods are compared through standard structural optimization problems. The Finite element method with truss and beam elements is used for the structural and sensitivity analyses. The results are analyzed based on the convergence performances, the number is function calculations, the quality of the cost functions, and etc. The applications of both methods are also discussed.

The Detection Method of a Target Position above a Ground Medium using the Buried Antenna (지하 매설 안테나를 이용한 지상 표적의 위치파악 기법)

  • 조정식;김채영;이승학;정종철
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.12 no.4
    • /
    • pp.521-531
    • /
    • 2001
  • This paper presents the extraction scheme of the scattered waves by a target above the ground using the buried antenna in a lossy and dispersive medium. The half wave dipole antennas are used to transmit and to receive a signal. The transmission line model as a feeding model is considered to take into account the effect of transmission line in a real system. The ground is modeled by the 2nd order Debye approximation with the dispersion and loss. PLRC algorithm and DPML as absorbing boundary condition are utilized to apply the 2nd order Debye approximation to FDTD. To extract the scattered wave, in addition, we employed the delay time extraction algorithm. The simulations are conducted to observe the variation of magnitude in scattered wave and detection of target position according to the change of moisture content of the lossy medium.

  • PDF

A Study on 2-D Occluded Objects Recognition and Hidden Edge Reconstruction Using Polygonal Approximation and Coordinates Transition (다각근사화와 좌표 이동을 이용한 겹친 2차원 물체 인식 및 은선 재구성)

  • 박원진;유광열;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.12 no.5
    • /
    • pp.415-427
    • /
    • 1987
  • This paper presents an experimental model-based vision system which can identify and locate objects in scenes containing multiple occluded parts. The objects are assumed to be rigid and planar parts. In any recognition system the-type of objects that might appear in the image dictates the type of knowledge that is needed to recognize the object. The data is reduced to a sequential list of points or pixels that appear on the boundary of the objects. Next the boundary of the objects is smoothed using a polygonal approximation algorithm. Recognition cosists in finding the prototype that matches model to image. Now the hidden edge is reconstructed by transition model objects into occluded objects. The best match is obtained by optimising some similarity measure.

  • PDF

Terrain Reconstruction from Contour Lines (등고선을 이용한 지형 재구성)

  • Kim, Sung-Soo;Lee, Seong-Ho;Lee, Jong-Hun;Yang, Young-Kyu
    • Annual Conference of KIPS
    • /
    • 2001.10a
    • /
    • pp.641-644
    • /
    • 2001
  • 기존의 종이지도를 수치지도 처리과정으로 얻어진 등고선(contour line) 데이터는 원격탐사(Remote Sensing)와 지리정보시스템(GIS)의 응용분야에서 주로 사용되어지는 데이터이다. 이러한 등고선은 해당 지역의 DTM(Digital Terrain Model) 데이터 생성을 위해 보간(interpolation)하여 생성하는 데 연구가 집중되어 왔다. 본 논문에서는 DEM(Digital Elevation Model)으로부터 얻어진 등고선 데이터를 이용하여 사용자에게 3 차원으로 가시화 해 줄 수 있는 기법을 소개한다. 등고선 추출을 위한 방법으로는 기존의 소개되어진 Marching Square 알고리즘을 적용하였고, 지역적인 최고점(local minimum)과 최소점(maximum)을 구하기 위해 등고선을 열린 등고선(open contour)과 닫힌 등고선(closed contour)으로 분류하게 된다. 지역적 최고, 최소점을 찾기 위한 탐색공간을 줄이기 위해 닫힌 등고선만을 대상으로 등고선 트리를 생성하였으며, 생성된 트리의 리프노드에 대해서 최고, 최소점에 대한 근사(approximation)를 수행하게 된다. 이렇게 구해진 근사된 정점들과 등고선 데이터를 입력으로 하여 제한된 딜로니 삼각분할(Constrained Delaunay Triangulation)을 수행함으로써, 3 차원 지형을 재구성할 수 있다. 실험에서 USGS 로부터 획득한 지형 데이터를 이용하여 속도 측정을 하였다. 결과적으로 저장공간 측면에서 적은 량의 데이터를 가지면서 등고선을 표현할 수 있는 3 차원 지형을 렌더링 할 수 있음을 알 수 있다.

  • PDF

A variational Bayes method for pharmacokinetic model (약물동태학 모형에 대한 변분 베이즈 방법)

  • Parka, Sun;Jo, Seongil;Lee, Woojoo
    • The Korean Journal of Applied Statistics
    • /
    • v.34 no.1
    • /
    • pp.9-23
    • /
    • 2021
  • In the following paper we introduce a variational Bayes method that approximates posterior distributions with mean-field method. In particular, we introduce automatic differentiation variation inference (ADVI), which approximates joint posterior distributions using the product of Gaussian distributions after transforming parameters into real coordinate space, and then apply it to pharmacokinetic models that are models for the study of the time course of drug absorption, distribution, metabolism and excretion. We analyze real data sets using ADVI and compare the results with those based on Markov chain Monte Carlo. We implement the algorithms using Stan.

Sequential Convex Programming Based Performance Analysis of UAV Design (순차 컨벡스 프로그래밍 기반 무인기 설계 형상의 성능 분석)

  • Ko, Hyo-Sang;Choi, Hanlim;Jang, Jong-Youn;Kim, Joon;Ryu, Gu-Hyun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.50 no.11
    • /
    • pp.771-781
    • /
    • 2022
  • Sequential convex programming based performance analysis of the designed UAV is performed. The nonlinear optimization problems generated by aerodynamics are approximated to socond order program by discretization and convexification. To improve the performance of the algorithm, the solution of the relaxed problem is used as the initial trajectory. Dive trajectory optimization problem is analyzed through iterative solution procedure of approximated problem. Finally, the maximum final velocity according to the performance of the actuator model was compared.

An Efficient Data Path Synthesis Algorithm for Low-Power (저전력 데이타-경로를 위한 효율적인 고수준 합성 알고리즘)

  • Park, Chae-Ryung;Kim, Young-Tae;Kim, Tae-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.227-233
    • /
    • 2000
  • In this paper, we present a new high-level data path synthesis algorithm which solves the two design problems, namely, scheduling and allocation, with power minimization as a key design parameter. From the observations in previous works on data path synthesis for low power, we derive an integer programming (IP) formulation for the problem, from which we then develop an efficient heuristic to carry out the scheduling and allocation simultaneously. Our experimental results demonstrate that the proposed algorithm is very effective in saving power consumption of circuits significantly.

  • PDF