• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• 제5B권3호
• /
• pp.262-266
• /
• 2005

In this paper, in order to enhance thrust of slotless type Permanent Magnet Linear Synchronous Motor, an optimal design is achieved by combining a genetic algorithm with 3D space harmonic method. In the case of multi-objective functions, the ratio of thrust/weight and thrust/volume are increased by $\7.56[%]l\;and\;7.98\[%]$, respectively. Thus, miniaturization and lightweight were realized at the same time.

• 한국항공우주학회지
• /
• 제34권11호
• /
• pp.35-41
• /
• 2006

이 논문에서는 항공기의 비행제어에 적용하기 위해 각각의 비행영역에서 설계된 LQ(Linear Quadratic)제어기를 비행영역이 바뀜에도 충돌 없이 교체할 수 있는 알고리즘을 제안한다. 이 알고리즘은 기존의 구현 알고리즘에 비해 LQ제어기에 적용하기 편리하게 유도되었고, 비선형 모델에도 적용할 수 있도록 트림점을 포함한 식으로 제시된다. 제안된 알고리즘의 성능을 확인하기 위해 시험표준 문제로 초음속 시험 항공기의 LQ제어문제에 적용하는 모의실험을 수행하고 제어성능이 우수함을 예시한다.

• 한국통신학회논문지
• /
• 제32권2A호
• /
• pp.162-168
• /
• 2007

This paper proposes two detection algorithms for Multi-user Space Time Block Code systems. The first one is linear detection Gaussian Elimination algorithm, and then it combined with Ordered Successive Cancellation to get better performance. The comparisons between receiver and other popular receivers, including linear receivers are provided. It will be shown that the performance of Gaussian Elimination receiver is similar but more simplicity than linear detection algorithms and performance of Gaussian Elimination Ordered Successive Cancellation superior as compared to other linear detection method.

• 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.

• 융합신호처리학회논문지
• /
• 제3권1호
• /
• pp.87-92
• /
• 2002

배치(Placement)는 VLSI 회로의 physical design에서 중요한 단계로서 회로의 성능을 최대로 하기 위하여 회로 모듈의 집합을 배치시키는 문제이며, 배치 문제에서 최적의 해를 얻기 위해 클러스터 성장(cluster growth), 시뮬레이티드 어닐링(simulated annealing; SA), ILP(integer linear programming)등의 방식이 이용된다. 본 논문에서는 배치 문제에 대하여 확률 진화 알고리즘(stochastic evolution algorithm; StocE)을 이용한 해 공간 탐색(solution space search) 방식을 제안하였으며, 제안한 방식을 시뮬레이티드 어닐링 방식과 비교, 분석하였다.

• 대한전자공학회논문지
• /
• 제23권6호
• /
• pp.874-880
• /
• 1986

A new diagnastic method for detection and location of faults in a linear time-invariant system is proposed. The fault detection algorithm is formulated in a signal space, while the fault location algorithm with estimation is done in a parameter space. In a way different from the conventional approach, the method of fault location with estimation is studied to apply the new concept to establish the models with an unknown parameter under the assumption of 1-fold fault. According to computer simulation, the proposed diagnostic method is effective as an algorithm for fault diagnosis of industdrial process controllers.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.621-638
• /
• 2009

The linear system Ax = b will have (i) no solution, (ii) only one non-trivial (trivial) solution, or (iii) infinity of solutions. Our focus will be on cases (ii) and (iii). The mathematical models of many real-world problems give rise to (a) ill-conditioned linear systems, (b) singular linear systems (A is singular with all its linearly independent rows are sufficiently linearly independent), or (c) ill-conditioned singular linear systems (A is singular with some or all of its strictly linearly independent rows are near-linearly dependent). This article highlights the scope and need of a randomized algorithm for ill-conditioned/singular systems when a reasonably narrow domain of a solution vector is specified. Further, it stresses that with the increasing computing power, the importance of randomized algorithms is also increasing. It also points out that, for many optimization linear/nonlinear problems, randomized algorithms are increasingly dominating the deterministic approaches and, for some problems such as the traveling salesman problem, randomized algorithms are the only alternatives.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.55-65
• /
• 2000

This paper presents a linear programming based algorithm for pattern classification. Pattern classification is being considered to be critical in the area of artificial intelligence and business applications. Previous methods employing linear programming have been aimed at two-group discrimination with one or more linear discriminant functions. Therefore, there are some limitations in applying available linear programming formulations directly to general multi-class classification problems. The algorithm proposed in this manuscript is based on quadratic or polynomial discriminant functions, which allow more flexibility in covering the class regions in the N-dimensional space. The proposed algorithm is compared with other competitive methods of pattern classification in experimental results and is shown to be competitive enough for a general purpose classifier.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2092-2095
• /
• 2003

In this paper, we propose an algorithm to extract rectangular object area such 3s Data Matrix two-dimensional barcode using edge tracing-based linear feature detection. Hough transform is usually employed to detect lines of edge map. However, it requires parametric image space, and does not find the location of end points of the detected lines. Our algorithm detects end points of the detected lines using edge tracing and extracts object area using its shape information.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(I)
• /
• pp.185-189
• /
• 1987

An analysis and design of large-scale linear multivariable systems often requires to be block triangularized form for good sensitivity of the systems when their poles and zeros are varied. But the decomposition algorithms presented up to now need a procedure of permutation, rescaling and a solution of nonlinear algebraic equations, which are usually burden. To avoid these problem, in this paper we develop a newly alternative block triangular decomposition algorithm which used the generalized matrix sign function on the Z-plane. Also, the decomposition algorithm demonstrated using the fifth order linear model of a distillation tower system.