• 한국수자원학회논문집
• /
• 제53권8호
• /
• pp.597-604
• /
• 2020

하도홍수추적을 위한 수문학적 방법인 머스킹검 방법은 유입량, 유출량 그리고 저류량의 관계를 활용하여 유출량을 예측하는 방법이다. 머스킹검 방법에 관한 많은 연구가 진행되면서 필요한 매개변수들은 점점 늘어나게 되었고, 많은 매개변수로 인해 계산과정이 복잡해졌다. 이러한 문제를 해결하기 위해 최적화 알고리즘을 머스킹검 방법의 매개변수 산정에 적용하였다. 본 연구는 Advanced Nonlinear Muskingum Model considering continuous flow (ANLMM-L)를 Wilson 홍수자료와 Sutculer 홍수자료에 적용하여 Linear Munsingum Model incorporating Lateral flow (LMM-L)과 Kinematic Wave Model (KWM)의 결과와 비교하였다. 관측 유출량과 모의 유출량과의 비교를 위한 지표로 Sum of Squares (SSQ)를 사용하였다. Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS)가 ANLMM-L의 매개변수 산정에 적용되었다. Wilson 홍수자료에 적용한 결과 LMM-L보다 ANLMM-L이 정확한 결과를 나타냈다. Sutculer 홍수자료에서는 ANLMM-L이 KWM보다 좋은 결과를 보이긴 했으나, Sutculer 홍수자료의 유량이 크기 때문에 Wilson 홍수자료의 경우에 비해 SSQ가 크게 나타났다. EBHS-CGS는 본 연구에서 적용한 머스킹검 홍수추적뿐만 아니라 다양한 수자원 공학 문제에 적용할 수 있을 것이다.

• Journal of Electrical Engineering and Technology
• /
• 제10권5호
• /
• pp.2142-2148
• /
• 2015

This paper proposes novel real-time footstep planning and following methods for the navigation of humanoid robots. A footstep command is defined by a walking direction and step lengths for footstep planning. The walking direction is determined by a uni-vector field navigation method, and the allowable yawing range caused by hardware limitation is considered. The lateral step length is determined to avoid collisions between the two legs while walking. The sagittal step length is modified by a binary search algorithm when collision occurs between the robot body and obstacles in a narrow space. If the robot body still collides with obstacles despite the modification of the sagittal step length, the lateral step length is shifted at the next footstep. For footstep following, a walking pattern generator based on a 3-D linear inverted pendulum model is utilized, which can generate modifiable walking patterns using the zero-moment point variation scheme. Therefore, it enables a humanoid robot to follow the footstep command planned for each footstep. The effectiveness of the proposed method is verified through simulation and experiment.

• Journal of Hydrospace Technology
• /
• 제2권2호
• /
• pp.24-35
• /
• 1996

This paper describes parameter identification techniques formulated for the estimation of maneuvering coefficients of a submerged body. The first part of this paper is concerned with the identifiability of the system parameters. The relationship between a stochastic linear time-invariant system and the equivalent dynamic system is investigated. The second is concerned with the development of the numerically stable identification technique. Two identification techniques are tested; one is the ma7mum likelihood (ML) methods using the Holder & Mead simplex search method and using the modified Newton-Raphson method, and the other is the modified extended Kalman filter (MEKF) method with a square-root algorithm, which can improve the numerical accuracy of the extended Kalman filter. As a results, it is said that the equations of motion for a submerged body have higher probability to generate simultaneous drift phenomenon compared to general state equations and only the ML method using the Holder & Mead simplex search method and the MEKF method with a square-root algorithm gives acceptable results.

• 한국통신학회논문지
• /
• 제32권9B호
• /
• pp.577-588
• /
• 2007

인터넷의 성장은 다양한 응용 프로그램들의 발달을 야기 시켰으며, 그로 인해 모든 패킷을 동일하게 처리하는 현재의 최선지원 서비스 보다 나은 서비스를 제공할 것을 요구하고 있다. 따라서 차세대 인터넷 라우터들은 다양한 레벨의 품질보장 서비스를 제공하여야 한다. 품질보장 서비스를 제공하기 위해서는 모든 입력 패킷을 미리 정의된 룰에 따라 구분하는 패킷 분류가 실시간으로 수행되어야 한다. 패킷분류는 패킷에 포함된 여러 헤더 필드에 대하여 다양한 종류의 검색을 수행하여야 하며, 일치하는 룰들 중에서 가장 높은 우선순위를 갖는 룰을 찾아야 하는 다차원 검색이다. 영역분할을 사용한 사분트라이 구조는 근원지와 목적지 프리픽스를 2차원 트라이 구조로 저장하여 검색을 진행하는 좋은 알고리즘이나, 길이에 대하여 선형검색을 하는 방법이므로 좋은 검색 성능을 보이지 못한다. 본 논문에서는 사분트라이 구조에서 길이에 대하여 이진검색을 진행하는 새로운 패킷분류 알고리즘을 제안한다. 또한 패킷이 여러 개의 룰과 일치하였을 경우 가장 높은 우선순위를 가지는 룰을 선택한다는 특성을 이용하여, 사분트라이를 만드는 과정에서 우선순위를 고려하여 검색 성능을 향상시킬 수 있는 방안을 제안한다.

• 대한기계학회논문집A
• /
• 제25권6호
• /
• pp.1004-1014
• /
• 2001

The fully automatic algorithm from initial finite element mesh generation to remeshing in two dimensional geometry is introduced using bubble packing method (BPM) for finite element analysis. BPM determines the node placement by force-balancing configuration of bubbles and the triangular meshes are made by Delaunay triangulation with advancing front concept. In BPM, we suggest two node-search algorithms and the adaptive/recursive bubble controls to search the optimal nodal position. To use the automatically generated mesh information in FEA, the new enhanced bandwidth minimization scheme with high efficiency in CPU time is developed. In the remeshing stage, the mesh refinement is incorporated by the control of bubble size using two parameters. And Superconvergent Patch Recovery (SPR) technique is used for error estimation. To verify the capability of this algorithm, we consider two elasticity problems, one is the bending problem of short cantilever beam and the tension problem of infinite plate with hole. The numerical results indicate that the algorithm by BPM is able to refine the mesh based on a posteriori error and control the mesh size easily by two parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권6호
• /
• pp.1101-1112
• /
• 2011

The Multiuser Eigenmode Transmission (MET) has generated significant interests in literature due to its optimal performance in linear precoding systems. The MET can simultaneously transmit several spatial multiplexing eigenmodes to multiple users which significantly enhance the system performance. The maximum number of users that can be served simultaneously is limited due to the constraints on the number antennas, and thus an appropriate user selection is critical to the MET system. Various algorithms have been developed in previous works such as the enumerative search algorithm. However, the high complexities of these algorithms impede their applications in practice. In this paper, motivated by the necessity of an efficient and effective user selection algorithm, a low complexity recursive user selection algorithm is proposed for the MET system. In addition, the fairness of the MET system is improved by using the combination of the proposed user selection algorithm and the adaptive Proportional Fair Scheduling (PFS) algorithm. Extensive simulations are implemented to verify the efficiency and effectiveness of the proposed algorithm.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 춘계 학술대회 학술발표 논문집
• /
• pp.325-329
• /
• 2003

This paper discuss the method of the system's efficient control using a Intelligent hybrid algorithm in nonlinear dynamics systems. Existing neural network and genetic algorithm for the control of non-linear systems work well in static states. but it be not particularly good in changeable states and must re-learn for the control of the system in the changed state. This time spend a lot of time. For the solution of this problem we suggest the intelligent hybrid self-tuning controller. it includes neural network, genetic algorithm and immune system. it is based on neural network, and immune system and genetic algorithm are added against a changed factor. We will call a change factor an antigen. When an antigen broke out, immune system come into action and genetic algorithm search an antibody. So the system is controled more stably and rapidly. Moreover, The Genetic algorithm use the memory address of the immune bank as a genetic factor. So it brings an advantage which the realization of a hardware easy.

• East Asian mathematical journal
• /
• 제25권1호
• /
• pp.55-68
• /
• 2009

In this paper we propose new large-update primal-dual inte-rior point algorithms for $P_*(\kappa)$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on the kernel function$\psi(t)=\frac{t^{p+1}-1}{p+1}+\frac{e^{\frac{1}{t}}-e}{e}$,$p{\in}$[0,1]. We showed that if a strictly feasible starting point is available, then the algorithm has $O((1+2\kappa)(logn)^{2}n^{\frac{1}{p+1}}log\frac{n}{\varepsilon}$ complexity bound.

• 한국인터넷방송통신학회논문지
• /
• 제14권1호
• /
• pp.155-159
• /
• 2014

본 논문은 디지털 회로로 구현된 터치스크린 제어 회로의 응답 속도를 빠르게 하기 위한 알고리즘과 회로구현을 기술하였다. 손가락이 터치되었을 때 해당하는 커패시턴스 값을 기존의 선형적인 방법대신에 적응형으로 탐색함으로써 응답 속도를 개선하였다. 응답 속도의 개선은 사용자가 터치 스크린을 이용하여 키보드 입력시 터치감을 높이는 효과를 가져온다. 시뮬레이션과 FPGA 검증을 통하여 제안된 알고리즘의 응답 속도 향상을 검증하였다. 모바일 터치 스크린 제품에 활용이 예상된다.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 제11회 음성통신 및 신호처리 워크샵 논문집 (SCAS 11권 1호)
• /
• pp.214-217
• /
• 1994

The major drawback in the Code Excited Linear Prediction type vocoders is their large computational requirements. In this paper, a simple method is proposed to reduce the pitch searching time in the pitch filter almost without degradation of quality. On the basis of the observational regularity of the correlation function of speech, only the limited numbers of pitch lags are considered to be an optimum pitch. This is done by skipping the negative envelope side of the correlation function and limiting the maximum number of lags to be considered preliminarily. By doing so, we can reduce the computational time of pitch searching more than 51% with negligible quality degradation. In addition to that, by combining that method with the conventional delta search technique, we can reduce the computational time requirements more than 60% without serious lowering the speech quality in segmental SNR measure compared to the conventional full search method.