• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2001.11a
• /
• pp.3-7
• /
• 2001

Although elbows are commonly used in practice, many questions regarding the optimum arrangement still remain unanswered. The effect due to an elbow lasts for a considerable distance downstream of the elbow and is severe when two elbows are in the system. The goal of this study is to provide an effective guide for the optimum arrangement of elbows and the optimum design of the approach piping system.

• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.33 no.12
• /
• pp.53-62
• /
• 2017

Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.5
• /
• pp.55-62
• /
• 2003

Subdomain-interface variational formulation is presented to solve a class of dynamic contact problems of composite structures. The penalty method is used for imposing inequality constraints on contact surfaces and for connecting finite element subdomains that satisfy interface compatibility conditions. As a result, any complex-shaped domain can be easily divided into independently modeled subdomains without considering the conformity of meshes on interfaces. Some advantageous features of the present method are shown through a set a numerical studies with a developed computer code.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.11
• /
• pp.7-14
• /
• 2005

A subdomain-interface finite element method is suggested to solve a class of fully- coupled thermomechanical problems with contact boundaries. The penalty method is used for connecting subdomains that satisfy interface compatibility conditions. As a result, effective stiffness matrices are always positive definite, and computational efficiency can be improved to a considerable degree. Moreover, any complex-shaped domain can be divided into independently modeled subdomains without considering the conformity of meshes on interfaces. Using a computer code based on the present method, these advantageous features are shown through a set of numerical studies.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.462-465
• /
• 2004

수치적인 데이터를 분류하기 위한 대표적인 방법은 퍼지 규칙을 사용하는 것이다. 하지만, 이러한 방법은 퍼지 소속 함수를 어떻게 정의하느냐에 따라 퍼지 분류의 성능이 크게 영향을 받는다는 문제점과 퍼지 규칙을 쉽게 이해하기 위해 가능한 퍼지 규칙의 수를 적게 유지해야한다는 문제점이 있다. 본 논문에서는 효과적이며 이해하기 쉬운 퍼지 규칙을 생성하기 위해 기울기 강하법을 기반으로 하는 소속 함수 학습 방법을 제안한다. 에러율을 감소하기 위해 Penalty 연산과 Reward 연산을 통해 소속 함수가 반복적으로 조절된다. 새로운 소속 함수는 Coverage 연산에 의해 생성된다. 또한 이해하기 쉬운 퍼지 규칙을 최적화하기 위해 학습된 소속 함수를 퍼지 결정 트리에 적용한다. 본 논문에서 제안한 알고리즘의 타당성을 확인하기 위해 벤치 마크 데이터인 Iris, Wisconsin Breast Cancer, Pima. Bupa 데이터를 이용하여 실험 결과를 보인다. 실험 결과를 통해 제안한 알고리즘이 기존의 C4.5와 FID 3.1 알고리즘보다 더 효과적이거나 비슷한 성능을 보임을 알 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.613-615
• /
• 2004

수치적인 데이터를 분류하기 위한 대표적인 방법은 퍼지 규칙을 사용하는 것이다. 하지만 퍼지 규칙을 이용하는 방법은 퍼지 소속 함수를 어떻게 정의하느냐에 따라 퍼지 분류의 성능이 크게 영향을 받는다는 문제점이 있다. 따라서 퍼지 규칙을 쉽게 이해하기 위해서는 가능한 퍼지 규칙의 수를 적게 유지하는 것이 필요하다. 본 논문에서는 효과적이며 이해하기 쉬운 퍼지 규칙을 생성하기 위해 기울기 강하법을 기반으로 하는 소속 함수 학습 방법을 제안한다 에러율을 감소하기 위해 Penalty 연산과 Reward 연산을 통해 소속 함수가 반복적으로 조절된다 새로운 소속 함수는 Coverage 연산에 의해 생성된다. 또한 이해하기 쉬운 퍼지 규칙을 최적화하기 위해 학습된 소속 함수골 퍼지 결정 트리에 적용한다. 본 논문에서 제안한 알고리즘의 타당성을 확인하기 위해 벤치 마크 데이터인 Iris, Wisconsin Breast Cancer, Plma, Bupa 데이터를 이용하여 실험 결과를 보인다. 실험 결과를 통해 제안한 알고리즘이 기존의 C4.5와 FID 3.1 알고리즘보다 더 효과적이거나 비슷한 성능을 보임을 알 수 있다.

• Journal of Korean Society of Steel Construction
• /
• v.16 no.2 s.69
• /
• pp.201-213
• /
• 2004

A GA-based optimum design algorithm and a program for plane steel frame structures with semi-rigid connections are presented. The algorithm is incorporated with the refined plastic hinge analysis method wherein geometric nonlinearity is considered by using the stability functions of beam-column members, and material nonlinearity, by using the gradual stiffness degradation model that includes the effects of residual stresses, moment redistribution through the occurrence of plastic hinges, semi-rigid connections, and geometric imperfection of members. In the genetic algorithm, the tournament selection method and micro-GAs are employed. The fitness function for the genetic algorithm is expressed as an unconstrained function composed of objective and penalty functions. The objective and penalty functions are expressed as the weight of steel frames and the constraint functions, respectively. In particular, the constraint functions fulfill the requirements of load-carrying capacity, serviceability, ductility, and construction workability. To verify the appropriateness of the present method, the optimal design results of two plane steel frames with rigid and semi-rigid connections are compared.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.3
• /
• pp.314-323
• /
• 2024

Recently, a score-penalty method has been used for the acoustic passive tracking of marine mammals. The interesting aspect of this technique lies in the loss function, which has a penalty term representing the mismatch between the measured signal and the modeled signal, while the traditional time-domain matched-field processing is positively considering the match between them. In this study, we apply the score-penalty method into the depth estimation of a passive target with a known source waveform. Assuming deep ocean environments with uncertainties in the sound speed profile, we evaluate the score-penalty method, comparing it with the time-domain matched field processing method. We shows that the score-penalty method is more accurate than the time-domain matched field processing method in the ocean environment with weak mismatch of sound speed profile, and has better efficiency. However, in the ocean enviroment with strong mismatch of the sound speed profile, the score-penalty method also fails in the depth estimation of a target, similar to the time-domain matched-field processing method.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2412-2420
• /
• 1997

An algorithm for detecting dominant points on a digital contour is proposed. The algorithm detects the dominant points from the given contour with the given number of points as a constraint condition. on the basis of the principle of the top-down approach. The dominant points are detected by minimizing the object function that presents the similarity between the given contour and the approximated polygon drawn by connecting the dominant points of candicate. The penalty multiplier method is applied to minimize the augmented Lagrangean function which is made by adding the penalty of the constraint condition to the object function. On the minimization, a local searching method by the partial problem division is considered, and it is clarified that the reasonable solution is obtained by the method. The proposed algorithm has a merit that the dominant points can be detected exactly and stably even for the digital contour composed of multiple-scale features and the similar contours, because it detects them on considering the property of a whole figure of the given contour. It is confirmed that the proposed algorithm is more excellent than other previously proposed algorithms by the comparison and the evaluation through the experiment on suing typical digital curves.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.3
• /
• pp.89-97
• /
• 1997

A genetic algorithm (GA) is a stochastic direct search strategy that mimics the process of genetic evolution. The GA applied herein works on a population of structural designs at any one time, and uses a structured information exchange based on the principles of natural selection and wurvival of the fittest to recombine the most desirable features of the designs over a sequence of generations until the process converges to a "maximum fitness" design. Principles of genetics are adapted into a search procedure for structural optimization. The methods consist of three genetics operations mainly named selection, cross- over and mutation. In this study, a method of finding the optimum topology of truss/beam structure is pro- posed by using the GA. In order to use GA in the optimum topology problem, chromosomes to FEM elements are assigned, and a penalty function is used to include constraints into fitness function. The results show that the GA has the potential to be an effective tool for the optimal design of structures accounting for sizing, geometrical and topological variables.variables.