• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.672-674
• /
• 2000

There are various ways in classification methodologies of data mining such as neural networks but the result should be explicit and understandable and the classification rules be short and clear. Rough set theory is a effective technique in extracting knowledge from incomplete and inconsistent information and makes an offer classification and approximation by various attributes with effect. This paper discusses granularity of knowledge for reasoning of uncertain concepts by using generalized rough set approximations based on hierarchical granulation structure and uses hierarchical classification methodology that is more effective technique for classification by applying core to upper level. The consistency rules with minimal attributes is discovered and applied to classifying real data.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1195-1198
• /
• 1999

This paper presents optimal placement of minimal set of phasor measurement units(PMU's) and observability of measurement system with PMU. By using the incidence matrix symbolic method which directly assigns measurement and pseudo-measurement to incidence matrix, it is much simpler and easier to analyze observability. The optimal PMU set is found through the simulated-annealing(SA) and the direct combinational method. The cooling schedule parameter which is suitable to the property of problem to solve is specified and optimal placement is proven by presented direct combinational method. Search spaces are limited within reasonable feasible solution region to reduce a unnecessary one in the SA implementation based on global search. The proposed method presents to save CPU time and estimate state vectors based on optimal PMU set.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.1
• /
• pp.57-61
• /
• 1984

This paper deals with the selection of minimal test instruction set for microprocessor data processing test. This test method is based on a function description of the instructions which are obtained from the data given by the user's manual. Selecting procedure is done in 3 steps: 1) a test execution graphs are represented on the instructions which are grouped functionally, 2) the essential graphs, the eliminable graphs, the eliminable graphs, and the eligible graphs are built, 3) optimal test instruction set from the essential graphs and the eligible graphs is defined. In the case of INTEL 8048, 50 test instructions can be selected optimally from 8048 instruction repertories (96 instructions)

• IE interfaces
• /
• v.12 no.1
• /
• pp.94-101
• /
• 1999

The set covering(SC) problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The SC problem has been proven to be NP-complete and many algorithms have been presented to solve the SC problem. In this paper we present hybrid simulated annealing(HSA) algorithm based on the Simulated Annealing(SA) for the SC problem. The HSA is an algorithm which combines SA with a crossover operation in a genetic algorithm and a local search method. Our experimental results show that the HSA obtains better results than SA does.

• Journal of Korean Society for Quality Management
• /
• v.40 no.4
• /
• pp.481-496
• /
• 2012

Purpose: This paper aims at improving inefficiency of an existing posterior preference articulation method proposed for dual response surface optimization. The method generates a set of non-dominated solutions and then allows a decision maker (DM) to select the best solution among them through an interval selection strategy. Methods: This paper proposes an iterative posterior preference articulation method, which repeatedly generates the predetermined number of non-dominated solutions in an interval which becomes gradually narrower over rounds. Results: The existing method generates a good number of non-dominated solutions not used in the DM's selection process, while the proposed method generates the minimal number of non-dominated solutions necessitated in the selection process. Conclusion: The proposed method enables a satisfactory compromise solution to be achieved with minimal cognitive burden of the DM as well as with light computation load in generating non-dominated solutions.

• Journal of Institute of Convergence Technology
• /
• v.10 no.1
• /
• pp.7-12
• /
• 2020

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.299-302
• /
• 2002

Error detection and correction using CRC and the general class of cyclic codes is an important part of designing reliable data transmission schemes. The decoding method for cyclic codes using covering patterns is easily-implementable, and its complexity de-pends on the number of covering patterns employed. Determination of the minimal set of covering patterns for a given code is an open problem. In this paper, an efficient search method for constructing minimal sets of covering patterns is proposed and compared with several existing search methods. The result is applicable to various codes of practical interest.

• Journal of Mechanical Science and Technology
• /
• v.16 no.10
• /
• pp.1287-1295
• /
• 2002

In this work, the fuel economy of a parallel hybrid electric vehicle is investigated. A vehicle control algorithm which yields operating points where operational cost of HEV is minimal is suggested. The operational cost of HEV is decided considering both the cost of fossil fuel consumed by an engine and the cost of electricity consumed by an electric motor. A procedure for obtaining the operating points of minimal fuel consumption is introduced. Simulations are carried out for 3 variations of HEV and the results are compared to the fuel economy of a conventional vehicle in order to investigate the effect of hybridization. Simulation results show that HEV with the vehicle control algorithm suggested in this work has a fuel economy 45% better than the conventional vehicle if braking energy is recuperated fully by regeneration and idling of the engine is eliminated. The vehicle modification is also investigated to obtain the target fuel economy set in PNGV program.

• Interaction and multiscale mechanics
• /
• v.1 no.1
• /
• pp.103-121
• /
• 2008

This paper presents an optimization-based method for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain braced frame. Based on a non-stochastic modeling of uncertainty, we assume that the parameters both of brace stiffnesses and external forces are uncertain but bounded. A brace member represents the sum of the stiffness of the actual brace and the contributions of some non-structural elements, and hence we assume that the axial stiffness of each brace is uncertain. By using the $\mathcal{S}$-lemma, we formulate a semidefinite programming (SDP) problem which provides an outer approximation of the minimal bounding ellipsoid. The minimum bounding ellipsoids are computed for a braced frame under several uncertain circumstances.

• Speech Sciences
• /
• v.12 no.2
• /
• pp.153-170
• /
• 2005

The sub-Nyquist nonuniform sampling (SNNS) and the perfect reconstruction (PR) formula are proposed for the development of a systematic method to obtain minimal representation of a speech signal. In the proposed method, the instantaneous sampling frequency (ISF) varies, depending on the least upper boundary of spectral support of a speech signal in time-frequency domain (TFD). The definition of the instantaneous bandwidth (IB), which determines the ISF and is used for generating the set of samples that represent continuous-time signals perfectly, is given. Also, the spectral characteristics of the sampled data generated by the sub-Nyquist nonuniform sampling method is analyzed. The proposed method doesn't generate the redundant samples due to the time-varying property of the instantaneous bandwidth of a speech signal.