DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이수범 | ko |
dc.contributor.author | 곽병만 | ko |
dc.date.accessioned | 2013-03-06T06:14:09Z | - |
dc.date.available | 2013-03-06T06:14:09Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2003-12 | - |
dc.identifier.citation | 대한기계학회논문집 A, v.27, no.12, pp.2047 - 2054 | - |
dc.identifier.issn | 1226-4873 | - |
dc.identifier.uri | http://hdl.handle.net/10203/86082 | - |
dc.description.abstract | In this paper, an approach of automatically finding and modifying the most appropriate orthogonal array (GO) is suggested and applied to a new structural optimization procedure with two steps. GO is motivated by the situation where finding a proper orthogonal array from the tables in the literature is difficult or impossible. Now the Taguchi method is made available for various numbers of variables and levels. In the two-step structural optimization, the Taguchi method equipped with GO and a shape optimization using the finite differencing method is consecutively applied. The existence or non-existence of an element can be taken as a factor level and this feature is utilized finding the best topology from a set of potential topologies suggested from the user's expertise. This greatly enhances applicability and one can expect a better result than the case in which each step is applied independently because these steps are complementary each other. | - |
dc.language | English | - |
dc.publisher | 대한기계학회 | - |
dc.title | 실험에 적합한 직교 배열표의 자동 생성 및 2단계 구조 최적화에의 적용 | - |
dc.title.alternative | Automatic Generation of Orthogonal Arrays and Its Application to a Two-Step Structural Optimization | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 27 | - |
dc.citation.issue | 12 | - |
dc.citation.beginningpage | 2047 | - |
dc.citation.endingpage | 2054 | - |
dc.citation.publicationname | 대한기계학회논문집 A | - |
dc.contributor.localauthor | 곽병만 | - |
dc.contributor.nonIdAuthor | 이수범 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.