• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.1
• /
• pp.1-9
• /
• 1991

This paper describes a new method of calculating expected energy generation and loss of load probability (L.O.L.P) for electric power system operation and expansion planning. The method represents an equivalent load duration curve (E.L.D.C) as a mixture of cumulants approximation (M.O.N.A). By regarding a load distribution as many normal distributions-rather than one normal distribution-and representing each of them in terms of Gram-Charlier expansion, we could improve the accuracy of results. We developed an algorithm which automatically determines the number of distribution and demarcation points. In modeling of a supply system, we made subsets of generators according to the number of generator outage: since the calculation of each subset's moment needs to be processed rapidly, we further developed specific recursive formulae. The method is applied to the test systems and the results are compared with those of cumulant, M.O.N.A. and Booth-Baleriaux method. It is verified that the M.O.C.A. method is faster and more accure than any other method.

• Smart Structures and Systems
• /
• v.18 no.5
• /
• pp.839-864
• /
• 2016

This paper presents an efficient method for updating the structural finite element model. Model updating is performed through minimizing the difference between the recorded acceleration of a real damaged structure and a hypothetical damaged one. This is performed by updating physical parameters (module of elasticity in this study) in each step using iterative process of modified nonlinear conjugate gradient (M-NCG) and modified Broyden-Fletcher-Goldfarb-Shanno algorithm (M-BFGS) separately. These algorithms are based on sensitivity analysis and provide a solution for nonlinear damage detection problem. Three illustrative test examples are considered to assess the performance of the proposed method. Finally, it is demonstrated that the proposed method is satisfactory for detecting the location and ratio of structural damage in presence of noise.

• Journal of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.755-770
• /
• 2013

One of the interesting nonlinear matrix equations is the quadratic matrix equation defined by $$Q(X)=AX^2+BX+C=0$$, where X is a $n{\times}n$ unknown real matrix, and A, B and C are $n{\times}n$ given matrices with real elements. Another one is the matrix polynomial $$P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_m=0,\;X,\;A_i{\in}\mathbb{R}^{n{\times}n}$$. Newton's method is used to find the symmetric and bisymmetric solvents of the nonlinear matrix equations Q(X) and P(X). The method does not depend on the singularity of the Fr$\acute{e}$chet derivative. Finally, we give some numerical examples.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2002.08a
• /
• pp.347-350
• /
• 2002

Transposed scan is an innovation that paves the road to ultra-slim CRTs with deflection angles up to 135$^{\circ}C$ We discuss the integration of video transposition with the other video processing functions in the television set. An in-place transposition algorithm which minimizes the amount of frame memory is proposed as a low-cost solution for transposed scan conversion. The difference in visual perception of transposed scan and normal scan depends on the frame rate and the line density of the video format. We found that for high frame rates and high line densities, no difference was perceived for both scan modes.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.1-26
• /
• 1994

Simulated annealing is an attractive, but expensive, heuristic method for approximating the solution to combinatorial optimization problems. Attempts to parallel simulated annealing, particularly on distributed memory multicomputers, are hampered by the algorithm's requirement of a globally consistent system state. In a multicomputer, maintaining the global state S involves explicit message traffic and is a critical performance bottleneck. To mitigate this bottleneck, it becomes necessary to amortize the overhead of these state updates over as many parallel state changes as possible. By using this technique, errors in the actual cost C(S) of a particular state S will be introduced into the annealing process. This paper places analytically derived bounds on this error in order to assure convergence to the correct optimal result. The resulting parallel simulated annealing algorithm dynamically changes the frequency of global updates as a function of the annealing control parameter, i.e. temperature. Implementation results on an Intel iPSC/2 are reported.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.677-679
• /
• 2017

Data convergecast is an indispensable task for any WSN applications. Typically, scheduling in the WSN consists of two phases: tree construction and scheduling. The optimal tree structure and scheduling for the network is proven NP-hard. This paper focuses on the delay optimality while constructing the data convergecast tree. The algorithm can take any tree as the input, and by performing the switches (i.e. a node changes its parent), the expected aggregation delay is potentially reduced. Note that while constructing the tree, only the in-tree collisions between the child nodes sending data to their common parent is considered.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.787-790
• /
• 2017

Data quality is the main issue in the classification problems; generally, the presence of noisy instances in the training dataset will not lead to robust classification performance. Such instances may cause the generated decision tree to suffer from over-fitting and its accuracy may decrease. Decision trees are useful, efficient, and commonly used for solving various real world classification problems in data mining. In this paper, we introduce a preprocessing technique to improve the classification accuracy rates of the C4.5 decision tree algorithm. In the proposed preprocessing method, we applied the naive Bayes classifier to remove the noisy instances from the training dataset. We applied our proposed method to a real e-commerce sales dataset to test the performance of the proposed algorithm against the existing C4.5 decision tree classifier. As the experimental results, the proposed method improved the classification accuracy by 8.5% and 14.32% using training dataset and 10-fold crossvalidation, respectively.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.304-307
• /
• 2008

A spreadsheet-based linear program (LP) software, so called, the LP-Tableau is developed to aid users to learn the simplex algorithm systematically and to understand the various conditions that make the problem unusual and, in some instances, impossible to solve. The LP-Tableau has several good features over other spreadsheet-based LP software programs available. First, the data input in the LP-Tableau is very convenient especially when small-sized problems are analyzed. Further, the LP-Tableau allows for two solution methods (i.e., Big-M and Two-Phase) and displays the whole iterations in tableau format. Thus users can easily understand the principle of the algorithm step by step. Finally, the LP-Tableau visually displays various conditions of the optimal solutions that might occur in solving the LP problems.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.12 no.1
• /
• pp.24-33
• /
• 2012

This paper describes a multi-mode LDPC decoder which supports 19 block lengths and 6 code rates of Quasi-Cyclic LDPC code for Mobile WiMAX system. To achieve an efficient implementation of 114 operation modes, some design optimizations are considered including block-serial layered decoding scheme, a memory reduction technique based on the min-sum decoding algorithm and a novel method for generating the cyclic shift values of parity check matrix. From fixed-point simulations, decoding performance and optimal hardware parameters are analyzed. The designed LDPC decoder is verified by FPGA implementation, and synthesized with a $0.18-{\mu}m$ CMOS cell library. It has 380,000 gates and 52,992 bits RAM, and the estimated throughput is about 164 ~ 222 Mbps at 56 MHz@1.8 V.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.111-114
• /
• 2001

In this paper, we supposed teller following algorithm that using sound localization for developing dialog type humanoid robot. A sound localization is studied for develop the techniques of an efficient 3-D sound system based on the psychoacoustics of spatial hearing with multimedia or virtual reality. When a robot talk with human, it is necessary that robot follow human for improved human interface and adaptive noise canceling. We apply this algorithm to robot system.