• The Journal of the Acoustical Society of Korea
• /
• v.15 no.3E
• /
• pp.60-65
• /
• 1996

This paper describes on the Korean continuous speech recognition system for flight reservation. It adopts a frame-synchronous One-Pass DP search algorithm driven by syntactic constraints of context free grammar(CFG). For recognition, 48 phoneme-like units(PLU) were defined and used as basic units for acoustic modeling of Korean. This modeling was conducted using a HMM technique, where each model has 4-states 3-continuous output probability distributions and 3-discrete-duration distributions. Language modeling by CFG was also applied to the task domain of flight reservation, which consisted of 346 words and 422 rewriting rules. In the tests, the sentence recognition rate of 62.6% was obtained after speaker adaptation.

• Proceedings of the KIPE Conference
• /
• 2003.11a
• /
• pp.69-72
• /
• 2003

The paper presents implementation of a PV fuzzy logic power tracking controller. Using maximum power point tracker with the intermediate converter can increase the system efficiency by matching the PV system to the load. A new fuzzy MPPT is proposed, where fuzzy inputs parameters are dp/dI and the last incremental of duty of duty ratio $L{\delta}D$, and the output is the new incremental value $(new{\delta}D)$ according to the maximum power point under various illumination levels.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.10
• /
• pp.2041-2046
• /
• 2009

In this paper, we propose the feature points extraction method of hand region using vision. To do this, first, we find the HCbCr color model by using HSI and YCbCr color model. Second, we extract the hand region by using the HCbCr color model and the fuzzy color filter. Third, we extract the exact hand region by applying labeling algorithm to extracted hand region. Fourth, after finding the center of gravity of extracted hand region, we obtain the first feature points by using Canny edge, chain code, and DP method. And then, we obtain the feature points of hand region by applying the convex hull method to the extracted first feature points. Finally, we demonstrate the effectiveness and feasibility of the proposed method through some experiments.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.8
• /
• pp.917-923
• /
• 1999

This paper proposes an efficient method of hydro-thermal scheduling in coordination with head variation and hydraulically coupled plants using Evolutionary Programing(EP). Based on the EP technique, the proposed algorithm is capable of determining the global optimal solutions. The constraints such a power balance condition, water available condition and transmission losses are embedded and satisfied throughout the proposed EP approach. The effectiveness of the proposed approach is demonstrated on the test systems and compared to those of other method. The results show that the new approach obtains a more highly optimal solutions than the conventional other methods such as newton-raphson method, Dynamic Programming(DP), LU factorization.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.4
• /
• pp.686-693
• /
• 2013

Generation Expansion Planning (GEP) is one of the most important decision-making activities in electric utilities. Least-cost GEP is to determine the minimum-cost capacity addition plan (i.e., the type and number of candidate plants) that meets forecasted demand within a pre specified reliability criterion over a planning horizon. In this paper, Differential Evolution (DE), and Opposition-based Differential Evolution (ODE) algorithms have been applied to the GEP problem. The original GEP problem has been modified by incorporating Virtual Mapping Procedure (VMP). The GEP problem of a synthetic test systems for 6-year, 14-year and 24-year planning horizons having five types of candidate units have been considered. The results have been compared with Dynamic Programming (DP) method. The ODE performs well and converges faster than DE.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.634-643
• /
• 2021

In this paper, an FPGA-based acceleration scheme of range Doppler algorithm (RDA) is proposed for the real time synthetic aperture radar (SAR) imaging. Hardware architectures of matched filter based on systolic array architecture and a high speed sinc interpolator to compensate range cell migration (RCM) are presented. In addition, the proposed hardware was implemented and accelerated on Xilinx Alveo FPGA. Experimental results for 4096×4096-size SAR imaging showed that FPGA-based implementation achieves 2 times acceleration compared to GPU-based design. It was also confirmed the proposed design can be implemented with 60,247 CLB LUTs, 103,728 CLB registers, 20 block RAM tiles and 592 DPSs at the operating frequency of 312 MHz.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.11 no.4
• /
• pp.91-102
• /
• 1991

Traditionally, a dynamic programming(DP) technique has been used to the multireservoir control system. The algorithm has inherent problem to increase computational requirements exponentially due to discretization of variables and expanding the dimension of the system. To solve this problem, this paper describes transforming the optimal control system into a quadratic programming(QP), using Laguerre polynomials(LP) and its properties. The objective function of the proposed QP is independent of time variable. The solution of the QP is obtained by nonlinear programming(NLP) using augmented Lagrangian multiplier method. The numerical experiment shows that the water level of reservoirs is higher than Lee's and the evaluated benefit value is about the same as other researcher's.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.19-43
• /
• 2005

This paper considers a variation of the customer order scheduling problem, and the variation is the case where the machine-job assignment is fixed. We examine the parallel machine environment, and the objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, different machines can simultaneously process different jobs in a batch. The recognition version of this problem is known to be NP-complete in the strong sense even if there exist only two parallel machines. When there are an arbitrary number of parallel machines, we establish three lower bounds and develop a dynamic programming (DP) algorithm which runs in exponential time on the number of batches. We present two simple but intuitive heuristics, SB and GR, and find some special cases where SB and GR generate an optimal schedule. We also find worst case upper bounds on the relative error. For the case of the two parallel machines, we show that GR generates an optimal schedule when processing times of all batches are equal. Finally, the heuristics and the lower bounds are empirically evaluated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.