• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.1
• /
• pp.49-56
• /
• 2006

A convergence behavior is under investigation near a simple real zero for the k-fold pseudo-Olver's method defined by extending the classical Olver's method. The order of convergence is shown to be at least k+3. The asymptotic error constant is explicitly given in terms of k and the corresponding simple zero. Various numerical examples with a proposed zero-finding algorithm are successfully confirmed with the use of symbolic and computational ability of Mathematica.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.994-998
• /
• 2005

A new control method, called a simple model matching, has been recently developed by the author. This is very simple and be applied for linear and nonlinear discrete time systems with/without time lag. Based on this formulation, identification is examined in this paper using an interconnected neural network with the EBP-EWLS learning algorithm. With this result, a control method is also presented for a nonlinear discrete time system.

• 전기의세계
• /
• v.30 no.12
• /
• pp.817-821
• /
• 1981

A simple scheme using the single equivalent machine representation, equivalent loss reprsentation and direct hydro-MW representation are applied to economic dispatch for practical applications. A,simple approach to calculation of incremental transmission losses is proposed from the fast decoupled load flow algorithm. This program is presently being tested on KECO system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.647-651
• /
• 1987

Yeast biomass in a biological continuous stirred tank reactor was controlled with an APPLE II microcomputer using adaptive control theory of bilinear systems. The controller used is as simple as a PID controller, but required less information. Cell concentration was well controlled by adjusting the inlet flow rate following the algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.59-64
• /
• 1979

The application of optimization techniques to the planning of industrial, economic, administrative and military activities with random technological coefficients has been extensively studied in the literature. Stochastic (linear) programs with simple recourse essentially model the allocation of scarce resources under uncertainty with linear penalties associated with shortages or surplus. This work on a problem with a discrete random resource vector, "The allocation of aircraft under uncertain demand" given in (1), is easily and efficiently handled by the application of the recently developed Wets' algorithm (8) for solving stochastic programs with simple recourse, which approves that such class of stochastic problems can be solved with the same efficiency as solving linear programs of the same size. It is known that the algorithm is also applicable to stochastic programs with continuous random demands for their approximate solutions.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.6
• /
• pp.331-338
• /
• 1988

A simple algorithm is presented for solving the thermal unit commitment problem which is one of very important areas in economic operation of power systems. This algorithm is based on simple priority ordering by the unit operation cost and it is shown that the operation cost of chosen sets of generators is the minimum. The proposed method differs from the conventional priority-based formulations in that the unit operation are calculated in every load level. Further the poerating reserve requiements are satisfied by the newly derived analytical security function or the expectation of reserve. The proposed method is proven to be very simple, accurate and efficient in a sample system.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.56-58
• /
• 2004

In this paper, we propose an adaptive beamforming algorithm for array antenna. The proposed beamforming algorithm is based on EDS (Euclidean Direction Search) algorithm. Generally LMS algorithm has a much slower rate of convergence, but its low computational complexity and robustness make it a representative method of adaptive beamforming. Although the RLS algorithm is known for its fast convergence to the optimal Wiener solution, it still suffers from high computational complexity and poor performance. The proposed EDS algorithm has a rapid convergence better than LMS algorithm, and has a computational more simple complexity than RLS algorithm. In this paper we compared the efficiency of the EDS algorithm with a standard LMS algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.301-309
• /
• 2009

A simple and efficient Lambda logic (${\lambda}-logic$) based algorithm is proposed for the solution of the generator constrained economic dispatch problem when the generating units having prohibited zones. The proposed method solves the economic dispatch (ED) problem that takes into account ramprate limits, transmission losses and prohibited operating zones in the power system operation. The proposed method uses a simple heuristic rule based on average power of prohibited operating zones which produces the feasibility of solution for the restricted operating units. The effectiveness of the algorithm is tested on five different test systems and the performance compared with other relevant methods reported in the literature. In all the cases, the proposed algorithm performs better than the previous existing algorithms with a less computational burden.

• International Journal of Aeronautical and Space Sciences
• /
• v.11 no.3
• /
• pp.184-192
• /
• 2010

In this paper, an initial fine alignment algorithm, which is developed for the strap-down inertial navigation systems of satellite launch vehicles, is considered. For fast and accurate alignment, a simple closed-loop estimation algorithm using a proportional-integral controller is introduced. Through computer simulation for the sway condition in the launch pad, it is shown that a simple filter structure can guarantee fast computational speed that is adequate for real-time implementation as well as the required alignment accuracy and robustness. In addition, its implementation results are presented for the Naro-1 flight test.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.10
• /
• pp.61-68
• /
• 2015

This paper deals with the pre-marshalling problem that the containers of container yard at container terminal are relocated in consensus sequence of loading schedule of container vessel. This problem is essential to improvement of competitive power of terminal. This problem has to relocate the all of containers in a bay with minimum number of movement. There are various algorithms such as metaheuristic as genetic algorithm and heuristic algorithm in order to find the solution of this problem. Nevertheless, there is no unique general algorithm that is suitable for various many data. And the main drawback of metaheuristic methods are not the solution finding rule but can be find the approximated solution with many random trials and by coincidence. This paper can be obtain the solution with O(m) time complexity that this problem deals with bin packing problem for m stack bins with descending order of take out ranking. For various experimental data, the proposed algorithm can be obtain the optimal solutions for all of data. And to conclude, this algorithm can be show that most simple and general algorithm with simple optimal solution finding rule.