RSS를 이용한 국방 공개정보 수집 모델에 관한 연구

학위논문(석사) --서울대학교 대학원 :전기. 컴퓨터공학부,2008.2.Maste

Three Dimensional Optimum Design of Endosseous Implant in Dentistry by Multilevel Response Surface Optimization

In this paper, an optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen for design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size for each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem

Optimum Design of Endosseous Implant in Dentistry by Multilevel Optimization Method

In this paper, an optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen fur design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size fur each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem. Favorable solution is obtained by the MLO, which is compared to both solutions made by RSM and sequential quadratic programming (SQP) in the OAO problem