• Journal of Korea Water Resources Association
• /
• v.53 no.8
• /
• pp.597-604
• /
• 2020

Muskingum, a hydrologic channel flood routing, is a method of predicting outflow by using the relationship between inflow, outflow, and storage. As many studies for Muskingum model were suggested, parameters were gradually increased and the calculation process was complicated by many parameters. To solve this problem, an optimization algorithm was applied to the parameter estimation of Muskingum model. This study applied the Advanced Nonlinear Muskingum Model considering continuous flow (ANLMM-L) to Wilson flood data and Sutculer flood data and compared results of the Linear Nonsingum Model incorporating Lateral flow (LMM-L), and Kinematic Wave Model (KWM). The Sum of Squares (SSQ) was used as an index for comparing simulated and observed results. Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was applied to the parameter estimation of ANLMM-L. In Wilson flood data, ANLMM-L showed more accurate results than LMM-L. In the Sutculer flood data, ANLMM-L showed better results than KWM, but SSQ was larger than in the case of Wilson flood data because the flow rate of Sutculer flood data is large. EBHS-CGS could be appplied to be appplicable to various water resources engineering problems as well as Muskingum flood routing in this study.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.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
• /
• v.2 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.577-588
• /
• 2007

The rapid growth of the Internet has stimulated the development of various new applications and services, and the service providers and the Internet users now require different levels of service qualities rather than current best-effort service which treats all incoming packet equally. Therefore, next generation routers should provide the various levels of services. In order to provide the quality of services, incoming packets should be classified into flows according to pre-defined rules, and this should be performed for all incoming packets in wire-speed. Packet classification not only involves multi-dimensional search but also finds the highest priority rule among all matching rules. Area-based quad-trie is a very good algorithm that constructs a two-dimensional trie using source and destination prefix fields. However, it performs the linear search for the prefix length, and hence it does not show very good search performance. In this paper, we propose to apply binary search on length to the area-based quad-trie algorithm. In improving the search performance, we also propose two new algorithms considering the priority of rules in building the trie.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.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)
• /
• v.5 no.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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• 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
• /
• v.25 no.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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.155-159
• /
• 2014

In this paper, we describe algorithm and digital circuit implementation of touch screen controller that has the faster response time. We enhance the response time by adaptive search method instead of linear search method of step level in the pulse width decision. The faster response time might bring effects of feeling better in the touch keyboard. The performance of the proposed algorithm and function is verified by using logic simulation and FPGA test board. It is expected to use in the mobile touch screen.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• 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.