• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.342-344
• /
• 2002

This paper presents a new strategy to find starting points for placing optimally Phasor Measurement Units(PMUs). The performance of the starting point, initial placement set of PMUs, affect critically the computational burden and/or time, because the Optimal PMU Placement (OPP) problem is formulated the combinatorial optimization. By analyzing the properties of OPP solutions on IEEE sample systems in detail, a new strategy for initial PMU placement, in this paper, is proposed. To verify the performance of the suggested strategy, the comparison with the existing strategy and the new one, on IEEE sample systems. is performed. By using the new strategy, the numbers of search spaces to solve the OPP problem is drastically decreased.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.99-102
• /
• 2009

In this paper a hierarchical stereo matching algorithm based on feature extraction is proposed. The boundary (edge) as feature point in an image is first obtained by segmenting an image into red, green, blue and white regions. With the obtained boundary information, disparities are extracted by matching window on the image boundary, and the initial disparity map is generated when assigned the same disparity to neighbor pixels. The final disparity map is created with the initial disparity. The regions with the same initial disparity are classified into the regions with the same color and we search the disparity again in each region with the same color by changing block size and search range. The experiment results are evaluated on the Middlebury data set and it show that the proposed algorithm performed better than a phase based algorithm in the sense that only about 14% of the disparities for the entire image are inaccurate in the final disparity map. Furthermore, it was verified that the boundary of each region with the same disparity was clearly distinguished.

• Journal of the military operations research society of Korea
• /
• v.22 no.1
• /
• pp.81-96
• /
• 1996

In a relational database environment, partitioning of data is directly concerned with the amount of data that needs to be required in a query or transaction. In this paper, we consider non-overlapping, vertical partitioning. Vertical partitioning algorithm in this paper is composed of two phases. In phase 1, we cluster the attributes with zero-one integer program that maximize affinity among attributes. The result of phase 1 is called 'Initial Fragments'. In phase 2, we modify Initial Fragments that is not directly considered by cost factors, making use of a transaction-based partitioning method. A transaction-based partitioning method is partitioning attributes according to a set of transactions. In this phase we select logical accesses which needs to be required in a transaction as comparison criteria. In phase 2, proposed algorithm consider only small number of modification of Initial Fragments in phase 1. This algorithm is so insensible to number of transactions and of attributes that it can applied to relatively large problems easily.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.306-314
• /
• 2000

In this paper we present a new approach to estimate link travel speed based on the hybrid neuro-fuzzy network. It combines the fuzzy ART algorithm for structure learning and the backpropagation algorithm for parameter adaptation. At first, the fuzzy ART algorithm partitions the input/output space using the training data set in order to construct initial neuro-fuzzy inference network. After the initial network topology is completed, a backpropagation learning scheme is applied to optimize parameters of fuzzy membership functions. An initial neuro-fuzzy network can be applicable to any other link where the probe car data are available. This can be realized by the network adaptation and add/modify module. In the network adaptation module, a CBR(Case-Based Reasoning) approach is used. Various experiments show that proposed methodology has better performance for estimating link travel speed comparing to the existing method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.48.4-48
• /
• 2001

Major objective of this paper is to develop the sliding mode control method for a nonlinear electro magnetic levitation system governed by a set of a second-order motion equation and a first-order electromagnetic equation. Simulations for initial responses were carried out to confirm the validity of the present design method.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.559-564
• /
• 2008

A prediction of binary droplets collision is important in the formation of falling drops and the evolution of sprays. The droplet velocity, impact parameter and drop-size ratio have influence on the interaction of the droplets. By the effect of these parameter, the collision processes are generated with the complicated phenomena. The droplet collision can be classified into four interactions such as the bouncing, coalescence, reflexive separation and stretching separation. In this study, the two-phase flow of the droplet collision was simulated numerically by using the Level Set method. 2D axi-symmetric simulations on the head-on collisions in the coalescence and reflexive separation, and 3D simulation on the off-center collisions in the coalescence and stretching separation were performed. These numerical results showed good agreements with the experimental and analytical results. For tracking the identity of droplets after the collision, transport equation for the volume fraction of the each initial droplet were used. From this, the identities of droplets were analyzed on the collision of droplets having different size.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.187-196
• /
• 1996

This paper introduces the concept of fixed weights and proposes an algorithm for classification by adding this concept to vector space separation method in LVQ. The proposed algorithm is based on competitive learning. It uses fixed weightsfor generality and fast adaptation efficient radius for new weight creation, and L1 distance for fast calcualtion. It can be applied to many fields requiring adaptive learning with the support of generality, real-tiem processing and sufficient training effect using smaller data set. Recognition rate of over 98% for the train set and 94% for the test set was obtained by applying the suggested algorithm to on-line handwritten recognition.

• The Korean Journal of Applied Statistics
• /
• v.21 no.3
• /
• pp.523-535
• /
• 2008

Initial work of microarray data analysis focused on identification of differentially expressed genes, and recently, the focus has moved to discovering significant sets of functionally related genes. We describe some problems of GSEA and PAGE, and propose a modified method to identify significant gene sets. The results based on a simulated experiment and real data analysis using a set of publicly available data show the superiority of the newly proposed method, GSA-AT, in detecting significant pathways with the accurate prediction.

• Journal of applied mathematics & informatics
• /
• v.38 no.5_6
• /
• pp.533-545
• /
• 2020

We initiate and introduce the notion of binary soft mapping, which is defined on collection of binary soft sets named as binary soft class over two initial universes U₁ and U₂ with fixed set of parameters. We also define and study the properties of binary soft images and binary soft inverse images of binary soft sets. Examples and counter examples are also given in support of presented properties. Moreover, these concepts are applied to the problem of medical diagnosis in medical expert systems.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2009.05a
• /
• pp.215-219
• /
• 2009

For the effective manufacture of doubly curved metal plates, a line array roll set (LARS) process is proposed. The suggested process utilizes a pair of upper and lower symmetric roll assemblies. In the process, the initial plate is progressed into the final shape in a stepwise or pathwise manner according to the basic principle of the incremental forming process. In this work, the intermediate shape which is closest to a final shape is proposed to fabricate the desired shape effectively in design of forming schedule. The intermediate shape has homogeneous curvature in a longitudinal and transverse direction so that it can be fabricated easily without complicated controls of rolls in the roll set. The method of approximation using genetic algorithm is proposed and applied to some actual ship hulls to evaluate the efficiency of the algorithm.