• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.927-931
• /
• 2003

In this paper, a new Recursive Least-Squares(RLS) algorithm based on matrix pseudo-inverses is presented. The aim is to use the proposed new RLS algorithm for not only the over-determined but also the under-determined estimation problem. Compared with previous results, e.g., Jie Zhou et al., the derivation of the proposed recursive form is much easier, and the recursion form is also much simpler. Furthermore, it is shown by simulations that the proposed RLS algorithm is more efficient and numerically stable than the existing algorithms.

• 대한기계학회논문집B
• /
• 제21권3호
• /
• pp.405-413
• /
• 1997

A thermal optimization of the chip arrangement in the PCB channel oriented vertically and cooled by natural convection has been studied. The objective of this study is to find the chip arrangement that minimizes the maximum temperature of the entire PCB channel. SIMPLER algorithm is employed in the analysis, and the genetic algorithm is used for the optimization. The results show that the chip with a maximum volumetric heat generation rate has to be located at the bottom of the channel, and chips with relatively high heat generation rates should not be close to each other, and small chip should not be located between the large chips.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
• /
• pp.356-359
• /
• 1997

Recently many studies have been conducted of fuzzy modeling since it can describe a nonlinear system better than the conventional methods. A famous researcher, M. Sugeno, suggested a fuzzy model which superbly describes a nonlinear system. In this paper, we suggest a new identification method for Sugeno-typo fuzzy model. The suggested algorithm is much simpler than the original identification strategy adopted in [1]. The algorithm suggested in this paper is somewhat similar to that of [2]. that is, the algorithm suggested in this paper consists of two consists of two steps: coarse tuning and fine tuning. In this paper, double clustering strategy is proposed for coarse tuning. Finally, the results of computer simulation are given to demonstrate the validity of this algorithm.

• 항공우주시스템공학회지
• /
• 제2권2호
• /
• pp.20-27
• /
• 2008

The characteristics of compressible flow are different from those of incompressible flow from the mathematical and physical point of view. Therefore, the way to solve the flowfield is different between compressible flow and incompressible flow. In general, density-based numerical algorithm is mainly used for compressible flow solver development. On the other hand, incompressible flow solver prefers to use pressure-based numerical algorithm. In this research, a compressible Navier-Stokes flow solver is developed by means of extending from pressure-based incompressible numerical algorithm to handle both compressible and incompressible flows using the same flow solver. The present flow solver is tested at various speed ranges and compared with the solutions of density-based compressible flow solver. Numerical results show a good agreement between two flow solvers.

• 전기학회논문지
• /
• 제59권2호
• /
• pp.476-483
• /
• 2010

If the data are pre-whitened, then gradient adaptive algorithms which are simpler than higher order statistics algorithms can be used in adaptive blind signal estimation. In this paper, we propose a blind subband affine projection algorithm for multiple-input multiple-output adaptive equalization in the blind environments. All of the adaptive filters in subband affine projection equalization are decomposed to polyphase components, and the coefficients of the decomposed adaptive sub-filters are updated by defining the multiple cost functions. An infinite impulse response filter bank is designed for the data pre-whitening. Pre-whitening procedure through subband filtering can speed up the convergence rate of the algorithm without additional computation. Simulation results are presented showing the proposed algorithm's convergence rate, blind equalization and blind signal separation performances.

• 한국CDE학회논문집
• /
• 제14권4호
• /
• pp.217-224
• /
• 2009

Most divide-and-conquer implementations for Delaunay triangulation utilize quad-edge or winged-edge data structure since triangles are frequently deleted and created during the merge process. How-ever, the proposed divide-and-conquer algorithm utilizes the array based data structure that is much simpler than the quad-edge data structure and requires less memory allocation. The proposed algorithm has two important features. Firstly, the information of space partitioning is represented as a permutation vector sequence in a vertices array, thus no additional data is required for the space partitioning. The permutation vector represents adaptively divided regions in two dimensions. The two-dimensional partitioning of the space is more efficient than one-dimensional partitioning in the merge process. Secondly, there is no deletion of edge in merge process and thus no bookkeeping of complex intermediate state for topology change is necessary. The algorithm is described in a compact manner with the proposed data structures and operators so that it can be easily implemented with computational efficiency.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권2호
• /
• pp.132-139
• /
• 2008

This paper proposes a scatternet topology formation, self-healing, and self-routing path optimization algorithm based on Relative Neighborhood Graph. The performance of the algorithm using ns-2 and extensible Bluetooth simulator called blueware shows that even though RNG-FHR does not have superior performance, it is simpler and easier to implement in deploying the Ad-Hoc network in the distributed dynamic environments due to the exchange of fewer messages and the only dependency on local information. We realize that our proposed algorithm is more practicable in a reasonable size network than in a large scale.

• 한국실내디자인학회논문집
• /
• 제15권1호
• /
• pp.30-38
• /
• 2006

The new aspect of contemporary architectural design is the computer simulation of morphogenesis and evolution of the organic body. Morphogenesis and evolution is the kind of emergence that is the process of complex pattern formation from simpler rules in complex system. The development comprises the sequence of pattern formation, differentiation, morphogenesis, growth. This study analyzes the application methodology of various biomorphism in contemporary architecture. The methods of generative application by computation in architecture are self-organization, differentiation, growth algorithm via MoSS. And the methods of evolution by computation are genetic algorithm, multi-parameter in environments, phylogenetic cross-over, competing as natural selection, mutation+external constraints, generative algorithm+genetic algorithm via Genr8.

• 한국컴퓨터그래픽스학회논문지
• /
• 제2권1호
• /
• pp.15-23
• /
• 1996

범프 맵핑(bump mapping)은 나무껍질과 같은 울퉁불퉁한 물체를 표현하기 위한 방법으로서 텍스쳐 맵핑(texture mapping)보다 더욱 사실적인 영상을 얻을 수 있는 렌더링(rendering) 기법이다. 본 논문에서는 기존의 범프 맵핑 알고리즘의 단점을 보완한 새로운 알고리즘을 제시하며, 또한 이 알고리즘을 실시간으로 처리하기 위한 하드웨어 구조를 제시한다. 이는 기존의 구조에 비해 구현하기가 더욱 간단한 것이다.

• ETRI Journal
• /
• 제30권6호
• /
• pp.853-855
• /
• 2008

This paper presents an energy-efficient spatial join algorithm for multiple sensor networks employing a spatial semijoin strategy. For optimization of the algorithm, we propose a GR-tree index and a grid-ID-based spatial approximation method, which are unique to sensor networks. The GR-tree is a distributed spatial index over the sensor nodes, which efficiently prunes away the nodes that will not participate in a spatial join result. The grid-ID-based approximation provides great reduction in communication cost by approximating many spatial objects in simpler forms. Our experiments demonstrate that the algorithm outperforms existing methods in reducing energy consumption at the nodes.