• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1285-1293
• /
• 2011

We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

• Steel and Composite Structures
• /
• 제7권3호
• /
• pp.201-217
• /
• 2007

Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.408-410
• /
• 2003

In this paper, an improved gradient direction assisted linking algorithm is proposed. This algorithm begins with initial seeds satisfying some local criteria. Then it will search along the direction provided by the initial point. A window will be generated in the gradient direction of the current point. Instead of the conventional method which only considers the value of the local salient structure, an improved mathematical model is proposed to describe the desired linear features. This model not only considers the value of the salient structure but also the direction of it. Furthermore, the linking problem under this model can be efficiently solved by dynamic programming method. This algorithm is tested for linear features detection in IKONOS images. The result demonstrates this algorithm is quite promising.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2005년도 춘계 학술발표회 논문집
• /
• pp.359-366
• /
• 2005

Most engineering optimization are based on numerical linear and nonlinear programming methods that require substantial gradient information and usually seek to improve the solution in the neighborhood of a starting point. These algorithm, however, reveal a limited approach to complicated real-world optimization problems. If there is more than one local optimum in the problem, the result may depend on the selection of an initial point, and the obtained optimal solution may not necessarily be the global optimum. This paper describes a new harmony search(HS) meta-heuristic algorithm-based approach for structural size optimization problems with continuous design variables. This recently developed HS algorithm is 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. Two classical space truss optimization problems are presented to demonstrate the effectiveness and robustness of the HS algorithm. The results indicate that the proposed approach is a powerful search and optimization technique that may yield better solutions to structural engineering problems than those obtained using current algorithms.

• Structural Engineering and Mechanics
• /
• 제27권5호
• /
• pp.575-588
• /
• 2007

In this paper, two algorithms are presented for the optimum design of geometrically nonlinear steel space frames using tabu search. The first algorithm utilizes the features of short-term memory (tabu list) facility and aspiration criteria and the other has long-term memory (back-tracking) facility in addition to the aforementioned features. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Allowable stress design (ASD) specification, maximum drift (lateral displacement) and interstorey drift constraints were imposed on the frames. The algorithms were applied to the optimum design of three space frame structures. The designs obtained using the two algorithms were compared to each other. The comparisons showed that the second algorithm resulted in lighter frames.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국제학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.772-776
• /
• 1988

In quantized control systems, the control values can take only given discrete (e.g. integer) values. In case of dealing with the control problem on the discrete-time, final-stage fixed, quantized control systems with multidimensional performance functions, the first thing, new definition on noninferior solutions in these systems is necessary because of their discreteness in state variables, and the efficient search for those solutions at final-stage is unavoidable for seeking their discrete-time optimal controls to these systems. In this paper, to the quantized control problem given by the formulation of Halkin-typed linear control systems with two performance functions, a new definition on noninferior solutions of this system control problem and a heuristic effective search on these noninferior solutions are stated. By use of these concepts, two definitions on noninferior solutions and the algorithm consisted of 8 steps and attained by geometric approaches are given. And a numerical example using the present algorithm is shown.

• Structural Engineering and Mechanics
• /
• 제50권3호
• /
• pp.323-347
• /
• 2014

This paper proposes a Particle Swarm Optimization (PSO) algorithm, which is improved by making use of the Harmony Search (HS) approach and called HS-PSO algorithm. A computer code is developed for optimal sizing design of non-linear steel frames with various semi-rigid and rigid beam-to-column connections based on the HS-PSO algorithm. The developed code selects suitable sections for beams and columns, from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange W-shapes, such that the minimum total cost, which comprises total member plus connection costs, is obtained. Stress and displacement constraints of AISC-LRFD code together with the size constraints are imposed on the frame in the optimal design procedure. The nonlinear moment-rotation behavior of connections is modeled using the Frye-Morris polynomial model. Moreover, the P-${\Delta}$ effects of beam-column members are taken into account in the non-linear structural analysis. Three benchmark design examples with several types of connections are presented and the results are compared with those of standard PSO and of other researches as well. The comparison shows that the proposed HS-PSO algorithm performs better both than the PSO and the Big Bang-Big Crunch (BB-BC) methods.

• 정보보호학회논문지
• /
• 제9권3호
• /
• pp.63-74
• /
• 1999

본 논문에서 제안하는 HEA(Hangul Encryption Algorithm)는 초성, 중성, 종성의 다차원구조로 이루어진 한글의 특성을 이용하여 조합형 한글 음절을 암호화하여 조합형 한글 음절을 생 성한다. HEA 에서는 암호화 결과가 모두 한글 터미널에 표시가능한 한글이므로 출력 내용이 표시가능해 야 하는 메일 시스템 등에 유용하게 사용될 수 있다. HEA는 DES에 기반하고 있으며 키전수 탐색 differential cryptanalysis linear cryptanalysis 에대하여 DES와 유사한 안전도를 가지며 암호문의 음 소별 임의성, 평문-암호문 연쇄효과 키-암호문 연쇄효과도 갖는다. In this paper we present a Hangul Encryption Algorithm (HEA) which encrypts composition Hangul syllables into composition Hangul syllables using the non-linear structure of Hangul. Since ciphertexts generated by HEA are displayable characters HEA can be used in applications such as Privacy Enhanced mail (PEM) where ciphertexts should be displayable characters. HEA is based on DES and it can be shown that HEA is as safe as DES against the exhaustive key search differential cryptanalysis and linear cryptanalysis. HEA also has randomness of phonemes of ciphertexts and satisfies plaintext-ciphetext avalanche effect and key-ciphertext avalanche effect.

• 제어로봇시스템학회논문지
• /
• 제1권2호
• /
• pp.94-98
• /
• 1995

This paper proposes an optimal design method for the weight and cost of a moving magnet typer linear DC motor (MM-LDM). The optimal design condition such as type and size of MM-LDM were determined by the trinary search algorithm after adjusting a standard function and its related parameters. In order to verigy results of the optimal design by the computer simulation, the designed values such as a thrust, a current, a velocity, and etc. of the fabricated MM-LDM were measured. And the measurement results are in good agreement with the designed ones.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1989년도 추계학술발표회 발표논문초록집; 이화여자대학교, 서울; 23 Sep. 1989
• /
• pp.42-43
• /
• 1989