• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.75-80
• /
• 1999

This paper presents a new method to find a optimal solution for stochastic system. This method uses Genetic Algorithm(GA) and simulation. GA is used to search for new alternative and simulation is used to evaluate alternative. The stochastic system has one or more random variables as inputs. Random inputs lead to random outputs. Since the outputs are random, they can be considered only as estimates of the true characteristics of they system. These estimates could greatly differ from the corresponding real characteristics for the system. We need multiple replications to get reliable information on the system. And we have to analyze output data to get a optimal solution. It requires too much computation to be practical. We address the problem of reducing computation. The procedure on this paper use GA character, an iterative process, to reduce the number of replications. The same chromosomes could exit in post and present generation. Computation can be reduced by using the information of the same chromosomes which exist in post and present current generation.

• Journal of the Korea Society for Simulation
• /
• v.13 no.1
• /
• pp.11-23
• /
• 2004

The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.3
• /
• pp.114-129
• /
• 1993

A FFT array processor algorithm and architecture which anc use a minumum required number of simple, duplicate multiplier-adder processing elements according to various computation speed, will be presented. It is based on the p fold symmetry in the radix p constant geometry FFT butterfly stage with shuffled inputs and normally ordered outputs. Also, a methodology to implement a high performance high radix FFT with VLSI by constructing a high radix processing element with the duplications of a simple lower radix processing element will be discussed. Various performances and the trade-off between computation speed and hardware complexity will be evaluated and compared. Bases on the presented architecture, a radix 2, 8 point FFT processing element chip has been designed and it structure and the results will be discusses.

• Bulletin of the Korean Chemical Society
• /
• v.34 no.8
• /
• pp.2281-2285
• /
• 2013

The electronic structure, optical spectra, and thermodynamic properties of the three FOX-7 polymorphs (${\alpha}$, ${\beta}$, and ${\gamma}$) have been studied systematically using density functional theory. The LDA (CA-PZ) and generalized gradient approximation (GGA) (PW91) functions were used to relax the three FOX-7 phases without any constraint. Their density of states and partial density of states were calculated and analyzed. The band gaps for the three phases were calculated and the sequence of their sensitivity was presented. Their absorption coefficients were computed and compared. The thermodynamic functions including enthalpy (H), entropy (S), free energy (G), and heat capacity ($C_p$) for the three phases were evaluated.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.31 no.10
• /
• pp.93-100
• /
• 1982

This paper presents the optimum computational algorithm for the real time control of system voltage and reactive power on the basis of a improved search method. In particular, special emphasis has been placed on the speed up computation at the first phase, and on the selection of initial state to reduce the transmission losses in the second phase. For the real time control, the new computation is improved and the computation time is very much reduced. And also, this paper discusses the integrated control scheme of system voltage and reactive power from the viewpoint of hierarchical control pattern, and studes the combination of the optimum system operations and controls.

• Journal of the Korean Society of Safety
• /
• v.31 no.3
• /
• pp.162-167
• /
• 2016

As the simple empirical and phenomenological model applied to the analysis of leakage and explosion of chemical substances does not regard numerous variables, such as positional density of installations and equipment, turbulence, atmospheric conditions, obstacles, and wind effects, there is a significant gap between actual accident consequence and computation. Therefore, the risk management of a chemical plant based on such a computation surely has low reliability. Since a process plant is required to have outcomes more similar to the actual outcomes to secure highly reliable safety, this study was designed to apply the CFD (computational fluid dynamics) simulation technique to analyze a virtual prediction under numerous variables of leakages and explosions very similarly to reality, in order to review the computation technique of the practical safety distance at a process plant.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.955-959
• /
• 2004

Existing Clustering Methods for spatial data mining process only Point objects, not spatial objects with polygonometry such as lines and areas. It is because that distance computation between objects with polygonometry for clustering is more complex than distance computation between point objects. To solve this problem, we design a clustering method based on regular grid cell structures. In details, it reduces cost and time for distance computation using cell relationships in grid cell structures.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.7
• /
• pp.453-457
• /
• 2005

With the expansion of Internet, a variety of image databases are widely used and it is needed to select the part of an image what he wants. In contents-based image retrieval system, Zernikie moment and ART Descriptors are used fur shape descriptors in MPEC-7. This paper presents a fast computation method to determine the radius of a bounding circle that encloses an object in a binary image. With conventional methods, the whole area of the image should be scanned first and the distance from every pixel to the center point be computed. The proposed 4-directional scan method and fast circle-drawing algorithm is utilized to minimize the scanning area and reduce the number of operations fur computing the distance. Experimental results show that proposed method saves the computation time to determine the radius of a bounding circle efficiently.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.714-716
• /
• 1996

This paper presents an optimization method for optimal reactive power dispatch which minimizes real power loss and improves voltage profile of power systems using evolutionary computation such as genetic algorithms(GAs), evolutionary programming(EP). and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most these approaches have the common defect of being caught to a local minimum solution. Recently, global search methods such as GAs, EP, and ES are introduced. The proposed methods were applied to the IEEE 30-bus system. Each simulation result, compared with that obtained by using a conventional gradient-based optimization method, Sequential Quadratic Programming (SQP), shows the possibility of applications of evolutionary computation to large scale power systems.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• pp.166-168
• /
• 1996

This paper presents an power system optimization method which solves real and reactive power dispatch problems using evolutionary computation such as genetic algorithms(GAs), evolutionary programming(EP), and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most these approaches have the common defect of being caught to a local minimum solution. Recently, global search methods such as GAs, EP, and ES are introduced. The proposed methods, applied to the IEEE 30-bus system, were run for 12 other exogenous parameters. Each simulation result, by which evolutionary computations are compared and analyzed, shows the possibility of applications of evolutionary computation to large scale power systems.