• 제목/요약/키워드: optimal approximation

검색결과 476건 처리시간 0.029초

신경망을 이용한 냉간단조품의 금형형상 설계 (Die Shape Design for Cold Forged Products Using the Artificial Neural Network)

  • 김동진;김태형;김병민;최재찬
    • 대한기계학회논문집A
    • /
    • 제21권5호
    • /
    • pp.727-734
    • /
    • 1997
  • In practice, the design of forging processes is performed based on an experience-oriented technology, that is designer's experience and expensive trial and errors. Using the finite element simulation and the artificial neural network, we propose an optimal die geometry satisfying the design conditions of final product. A three-layer neural network is used and the back propagation algorithm is employed to train the network. An optimal die geometry that satisfied the same between inner extruded rib and outer extruded one is determined by applying the ability of function approximation of neural network. The neural networks may reduce the number of finite element simulation for determine the optimal die geometry of forging products and further they are usefully applied to physical modelling for the forging design.

유전자 알고리즘과 합성 성능지수에 의한 최적 퍼지-뉴럴 네트워크 구조의 설계 (The Design of Optimal Fuzzy-Neural networks Structure by Means of GA and an Aggregate Weighted Performance Index)

  • 오성권;윤기찬;김현기
    • 제어로봇시스템학회논문지
    • /
    • 제6권3호
    • /
    • pp.273-283
    • /
    • 2000
  • In this paper we suggest an optimal design method of Fuzzy-Neural Networks(FNN) model for complex and nonlinear systems. The FNNs use the simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. And we use a HCM(Hard C-Means) Clustering Algorithm to find initial parameters of the membership function. The parameters such as parameters of membership functions learning rates and momentum weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. According to selection and adjustment of a weighting factor of an aggregate objective function which depends on the number of data and a certain degree of nonlinearity (distribution of I/O data we show that it is available and effective to design and optimal FNN model structure with a mutual balance and dependency between approximation and generalization abilities. This methodology sheds light on the role and impact of different parameters of the model on its performance (especially the mapping and predicting capabilities of the rule based computing). To evaluate the performance of the proposed model we use the time series data for gas furnace the data of sewage treatment process and traffic route choice process.

  • PDF

강성최적설계법을 이용한 아웃리거 시스템의 거동특성 및 효율성 평가 (Structural Behavior Characteristics and Efficiency Evaluation of Outrigger System using Stiffness-Based Optimal Design Technique)

  • 김호수;이한주
    • 한국공간구조학회논문집
    • /
    • 제5권3호
    • /
    • pp.123-130
    • /
    • 2005
  • 본 연구에서는 횡하중을 받는 아웃리거 시스템의 횡변위를 정량적으로 제어할 수 있는 효율적인 강성최적설계기법을 제시하고 이를 이용하여 아웃리거 시스템의 거동특성 및 효율성을 평가하고자 한다. 이를 위해 아웃리거를 이용한 고층 구조물의 거동특성을 고려한 민감도 해석을 수행하며 아울러 수학적계획법의 일반성을 유지하면서도, 큰 규모의 문제도 효율적으로 다룰 수 있는 근사화 개념을 도입하여 구속조건식을 설정한다. 특히 초기에 주어진 단면형상이 최적설계 과정동안 계속 유지된다는 가정을 이용하여 부재재설계 기법을 개발한다. 제시된 정량적인 횡변위 제어 방안의 효용성을 검토하기 위해 네 가지 형태의 50층 고층구조물 예제가 고려된다.

  • PDF

NETLA를 이용한 이진 신경회로망의 최적 합성방법 (Optimal Synthesis Method for Binary Neural Network using NETLA)

  • 성상규;김태우;박두환;조현우;하홍곤;이준탁
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 하계학술대회 논문집 D
    • /
    • pp.2726-2728
    • /
    • 2001
  • This paper describes an optimal synthesis method of binary neural network(BNN) for an approximation problem of a circular region using a newly proposed learning algorithm[7] Our object is to minimize the number of connections and neurons in hidden layer by using a Newly Expanded and Truncated Learning Algorithm(NETLA) for the multilayer BNN. The synthesis method in the NETLA is based on the extension principle of Expanded and Truncated Learning(ETL) and is based on Expanded Sum of Product (ESP) as one of the boolean expression techniques. And it has an ability to optimize the given BNN in the binary space without any iterative training as the conventional Error Back Propagation(EBP) algorithm[6] If all the true and false patterns are only given, the connection weights and the threshold values can be immediately determined by an optimal synthesis method of the NETLA without any tedious learning. Futhermore, the number of the required neurons in hidden layer can be reduced and the fast learning of BNN can be realized. The superiority of this NETLA to other algorithms was proved by the approximation problem of one circular region.

  • PDF

AN OPTIMAL CONTROL APPROACH TO CONFORMAL FLATTENING OF TRIANGULATED SURFACES

  • PARK, YESOM;LEE, BYUNGJOON;MIN, CHOHONG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제23권4호
    • /
    • pp.351-365
    • /
    • 2019
  • This article presents a new approach for conformal flattening with optimal cone singularity. The algorithm here takes an optimal control for selecting optimal cones and uses the Ricci flow to force the flattening. This work is considered as a modification to the work of Soliman et al. [1] in the sense that they make use of the Yamabe equation for the flattening, which is an approximation of the Ricci flow. We present a numerical algorithm based on the optimal control with the mathematical background. Several numerical results validate that our method is optimal in total cone angle and usage of the Ricci flow ensures the conformal flattening while selecting optimal cones.

동적 프로그래밍에 기반한 윤곽선 근사화를 위한 정점 선택 방법 (Vertex Selection Scheme for Shape Approximation Based on Dynamic Programming)

  • 이시웅;최재각;남재열
    • 대한전자공학회논문지SP
    • /
    • 제41권3호
    • /
    • pp.121-127
    • /
    • 2004
  • This paper presents a new vertex selection scheme for shape approximation. In the proposed method, final vertex points are determined by "two-step procedure". In the first step, initial vertices are simply selected on the contour, which constitute a subset of the original contour, using conventional methods such as an iterated refinement method (IRM) or a progressive vertex selection (PVS) method In the second step, a vertex adjustment Process is incorporated to generate final vertices which are no more confined to the contour and optimal in the view of the given distortion measure. For the optimality of the final vertices, the dynamic programming (DP)-based solution for the adjustment of vertices is proposed. There are two main contributions of this work First, we show that DP can be successfully applied to vertex adjustment. Second, by using DP, the global optimality in the vertex selection can be achieved without iterative processes. Experimental results are presented to show the superiority of our method over the traditional methods.

Efficient Deployment of RSUs in Smart Highway Environment

  • Ge, Mingzhu;Chung, Yeongjee
    • International journal of advanced smart convergence
    • /
    • 제8권4호
    • /
    • pp.179-187
    • /
    • 2019
  • Vehicular density is usually low in a highway environment. Consequently, connectivity of the vehicular ad hoc networks (VANETs) might be poor. We are investigating the problem of deploying the approximation optimal roadside units (RSUs) on the highway covered by VANETs, which employs VANETs to provide excellent connectivity. The goal is to estimate the minimal number of deployed RSUs to guarantee the connectivity probability of the VANET within a given threshold considering that RSUs are to be allocated equidistantly. We apply an approximation algorithm to distribute RSUs locations in the VANETs. Thereafter, performance of the proposed scheme is evaluated by calculating the connectivity probability of the VANET. The simulation results show that there is the threshold value M of implemented RSUs corresponding to each vehicular network with N vehicles. The connectivity probability increases slowly with the number of RSUs getting larger.

균일 화상 품질 구현을 위한 닥터 블레이드 접촉압력 근사모델링 (Approximate Modeling of Doctor Blade Contact Pressure for Realization of Uniform Image Quality)

  • 최하영;박승찬;이종수
    • 한국생산제조학회지
    • /
    • 제22권2호
    • /
    • pp.241-247
    • /
    • 2013
  • The doctor blade is equipped in a toner cartridge and is a device to maintain the uniform thickness of a toner by controlling the pressure on the developing roller. The contact pressure between the developing roller and the doctor blade is one of the significant factors for image quality and durability of toner cartridge. The purpose of this study is to develop approximation model in order to minimize the time and cost which are needed much required in making optimal design of the doctor blade. Central composite design was used for the design of experiment and response surface design was used for approximation. The data for contact pressure were acquired through finite element analysis and data of image density and toner weight were acquired through experiment. The approximation model developed in this study has presented very high fitness.

헬리곱터 꼬리 날개의 최적 설계 (Optimal Design of Helicopter Tailer Boom)

  • 한석영
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
    • /
    • pp.419-424
    • /
    • 1999
  • In this paper, the comparison of the first order approximation schemes such as SLP (sequential linear programming), CONLIN(convex linearization), MMA(method of moving asymptotes) and the second order approximation scheme, SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore, when it is considered with the expense of computation, MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem, it was applied to the helicopter tail boom considering column buckling and local wall buckling constraints. It is concluded that MMA can be a very efficient approximation scheme from simple problems to complex problems.

  • PDF

TWO-SCALE PRODUCT APPROXIMATION FOR SEMILINEAR PARABOLIC PROBLEMS IN MIXED METHODS

  • Kim, Dongho;Park, Eun-Jae;Seo, Boyoon
    • 대한수학회지
    • /
    • 제51권2호
    • /
    • pp.267-288
    • /
    • 2014
  • We propose and analyze two-scale product approximation for semilinear heat equations in the mixed finite element method. In order to efficiently resolve nonlinear algebraic equations resulting from the mixed method for semilinear parabolic problems, we treat the nonlinear terms using some interpolation operator and exploit a two-scale grid algorithm. With this scheme, the nonlinear problem is reduced to a linear problem on a fine scale mesh without losing overall accuracy of the final system. We derive optimal order $L^{\infty}((0, T];L^2({\Omega}))$-error estimates for the relevant variables. Numerical results are presented to support the theory developed in this paper.