• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.10
• /
• pp.1328-1336
• /
• 2014

This paper proposes Power System Health Index(PSHI) newly. The paper describes several kind of power system health indices based on two main categories, which are adequacy and security. In adequacy, four kinds of health indices of Frequency, Voltage, Reserve(Operating Reserve Power and Frequency Regulation Reserve Power) and Overload of lines and transformers are proposed. In security, four kinds of health indices of Voltage(154kV, 345kV and 765kV), Overload of lines and transformers, Power flow constraint among areas and SPS are proposed. All indices are mapped with three domains, which are indicated as Health, Margin and Risk, defined with expert interview. While domains of health, margin and risk is defined similar with the conventional well being analysis of power system. The criterion of the domains is proposed using an interview with expert operators and practical reliability codes in Korea. The several kinds of health index functions, which are linear ratio, piecewise linear ration and reverse ratio function etc. are developed in this paper. It will be expected that the developed health indices can help operators to control power system more successfully and also prevent power system from accident as like as black out in future because operator can make a decision immediately based on more easily visual information of system conditions from too much indices acquisition of complex power system.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.12
• /
• pp.154-161
• /
• 2009

A fuel cell power plant is a very complex system which has various control loops with some non-linearity. For control of a fuel cell power plant, dynamic models of fuel cell stacks have been developed and simplified process flow diagrams of a fuel cell power plant has been presented. Using such a model of a Molten Carbonate Fuel Cell (MCFC) power plant, this paper deals with development of an intelligent setpoint reference governor (I-SRG) to find the optimal setpoints and feed forward control inputs for the plant power demand. The I-SRG is implemented with neural network by using Particle Swarm Optimization (PSO) algorithm based on system constraints and performance objectives. The feasibility of the I-SRG is shown through simulation of an MCFC power plant for tracking control of its power demand.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1867-1875
• /
• 2011

In this paper, a low-area 256-point FFT structure is proposed. For low-area implementation CSD(Canonic Signed Digit) multiplier method is chosen. Because multiplication type should be less for efficient CSD multiplier application to the FFT structure, the Radix-$4^2$ algorithm is chosen for those purposes. After, in the proposed structure, the number of multiplication type is minimized in each multiplication block, the CSD multipliers are applied for implementation of multiplication. Furthermore, in CSD multiplier implementation, cell-area is more reduced through common sub-expression sharing(CSS). The Verilog-HDL coding result shows 29.9% cell area reduction in the complex multiplication part and 12.54% cell area reduction in overall 256-point FFT structure comparison with those of the conventional structure.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2006.06a
• /
• pp.730-736
• /
• 2006

In this paper, we propose a rotation resistant robust logo embedding watermarking technique. Geometric manipulations make the detection process very complex and difficult. Watermark embedding ill the normalized image directly suffers from smoothing effect due to the interpolation during the image normalization. This can be avoided by estimating the transform parameters using image normalization technique, instead of embedding in the normalized image. Conventional rotation resistant schemes that use full frame transform. In this paper, we adopt $8{\times}8$ block DCT and calculate masking using a spatio-frequency localization of the $8{\times}8$ block DCT coefficients. Experimental results show that the proposed algorithm is robust against rotation process.

• Journal of KIISE:Software and Applications
• /
• v.30 no.11
• /
• pp.1054-1061
• /
• 2003

Q-Learning, a representative algorithm of reinforcement learning, experiences repeatedly until estimation values about all state-action pairs of state space converge and achieve optimal policies. When the state space is high dimensional or continuous, complex reinforcement learning tasks involve very large state space and suffer from storing all individual state values in a single table. We introduce Q-Map that is new function approximation method to get classified policies. As an agent learns on-line, Q-Map groups states of similar situations and adapts to new experiences repeatedly. State-action pairs necessary for fine control are treated in the form of rule. As a result of experiment in maze environment and mountain car problem, we can achieve classified knowledge and extract easily rules from Q-Map

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.455-465
• /
• 2009

Suffix trees are widely used in similar sequence matching for DNA. They have several problems such as time consuming, large space usages of disks and memories and data skew, since DNA sequences are very large and do not fit in the main memory. Thus, in the paper, we present a space efficient indexing method called SENoM, allowing us to build trees without merging phases for the partitioned sub trees. The proposed method is constructed in two phases. In the first phase, we partition the suffixes of the input string based on a common variable-length prefix till the number of suffixes is smaller than a threshold. In the second phase, we construct a sub tree based on the disk using the suffix sets, and then write it to the disk. The proposed method, SENoM eliminates complex merging phases. We show experimentally that proposed method is effective as bellows. SENoM reduces the disk usage less than 35% and reduces the memory usage less than 20% compared with TRELLIS algorithm. SENoM is available to query efficiently using the prefix tree even when the length of query sequence is large.

• Journal of Advanced Navigation Technology
• /
• v.17 no.6
• /
• pp.804-809
• /
• 2013

The current state monitoring system at a semiconductor manufacturing process is based on the manually collected sensor data, which involves limitations when it comes to complex malfunction detection and real time monitoring. This study aims to design a situation recognition algorithm to form a network over time by creating a domain ontology and to suggest a system to provide users with services by generating events upon finding risk factors in the semiconductor process. To this end, a multiple sensor node for situational inference was designed and tested. As a result of the experiment, events to which the rule of time inference was applied occurred for the contents formed over time with regard to a quantity of collected data while the events that occurred with regard to malfunction and external time factors provided log data only.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.418-425
• /
• 2005

3D surface reconstruction is to make the original geometry of 3D objects from 2D geometric information. Barequet's algorithm is well known and most widely used in surface reconstruction. It tiles matched regions first, then triangulates clefts using dynamic programming. However it takes considerably long processing time while manipulating complex model. Our method tiles a simple region that does not have branches along minimally distant vertex pairs at once. When there are branches, our method divides contour lines into a simple region and clefts. We propose a fast and simple method that calculates medial axes using a minimum distance in cleft region. Experimental results show that our method can produce accurate models than the previous method within short time.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.12
• /
• pp.399-408
• /
• 2015

In the direct Gun Fire Control System(GFCS), it is essential to analyze the impact of the specific error components on the hit probability to optimize the system design. For this purpose the sensitivity equations of these error components are conveniently used, but it is too difficult to get those equations for the complex system with too many system elements. Normally sensitivity analysis is performed using numerical and statistical methods for the ground combat system. This method requires much computation, and makes us difficult to estimate the sensitivity change of specific error component intuitionally for the changing operating conditions. In this paper we propose a set of sensitivity equations deriving from closed form solution of the ballistic differential equation for the bullet. They are handy equations with very little computations, easy to understand the physical meaning of the related system variables. Some simulation results are shown to demonstrate usefulness of our algorithm for the 30mm projectile.