• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.109-112
• /
• 2000

Many applications in computer graphics require highly detailed complex models. However, the level of detail may vary considerably according to applications. It is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplification algorithm which uses iterative contractions of edges to simplify models and maintains surface error approximations using a quadric metric. In this paper, we present an improved quadric error metric for simplifying meshes. The new metric, based on subdivided edge classification, results in more accurate simplified meshes. We show that a subdivided edge classification captures discontinuities efficiently. The new scheme is demonstrated on a variety of meshes.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1993.10a
• /
• pp.106-112
• /
• 1993

This paper presents the optimum design of reinforced concrete conical shell which is fixed at the base and free at the top. The calculation of stresses is done using the SMAP(Segmented Matrix Analysis Package)program which uses the simple finite element method of analysis. The objective function contains the ratios of the unit cost of reinforcements and formwork to that of concrete. To Simplify the optimization procedure, the final optimum design of conical shell is obtained by combining the result of each element. The results are presented and discussed.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2000.04a
• /
• pp.141-145
• /
• 2000

A systematic method to find the optimal blank shape for sheet forming is proposed by coupling the numerical simulation technique. A weighted parameter was introduced in order to simplify the multi-variable optimization problem to a single-variable problem. The proposed method has been applied to the blank design of drawing processes to obtain the near-net shape within the required error bound after forming, Excellent results have been obtained between the numerical results and the target contour shapes. Through the investigation the proposed systematic method for optimal blank design is found to be effective in the practical forming processes

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.8
• /
• pp.23-32
• /
• 1998

In this paper, we propose a memory compiler to genrate embedded RAMs and ROMs for ASIC chips. We design the leaf cells to be compsoed of memory blocks. The compiler is built using tile-based method to simplify routing. The compiler can genrate any memory layouts to satisfy 64 to 4096 words and 4 to 256 bits per word. The technology we used here is 0.8.mu.m single poly double metal CMOS process. The address access time and power consumption are verifie dthrough the HSPICE simulation.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.787-792
• /
• 2012

We present a graphical algorithm and theorems for calculating the ranks of reaction networks. The ranks are needed to study behaviors of the networks from their structures. This approach can graphically simplify complex networks for the calculation. We show an example of a large network for the practical advantage.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.155-165
• /
• 2007

We consider a possible generalization of nondeterministic finite automata. The goals of this consideration are: to apply some obtained algorithms for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; to simplify some proofs for algorithms of simplification for usual nondeterministic automata.

• Proceedings of the KIPE Conference
• /
• 2010.07a
• /
• pp.51-52
• /
• 2010

In order to simplify the offline identification of induction motor parameters, a method based on optimization using a Tabu Search algorithm is proposed. The Tabu Search algorithm is used to minimize the error between the actual data and an estimated model. The robustness of the method is shown by identifying parameters of the induction motor in three different cases. The simulation results show that the method successfully estimates the motor parameters.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.233-237
• /
• 2003

An asymptotic property of the ordinary least squares estimator of the disturbance variance is considered in the regression model with correlated errors. It is shown that the convergence in probability of S$^2$ is equivalent to the asymptotic unbiasedness. Beyond the assumption on the design matrix or the variance-covariance matrix of disturbances error, the result is quite general and simplify the earlier results.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.73-83
• /
• 1999

In this paper, we consider the shortest path network problem with fixed charges. A turn penalty algorithm for the shortest path problem with fixed charges or turn penalties is presented, which is using the next node comparison method. The algorithm described here is designed to determine the shortest route in the shortest path network problem including turn penalties. Additionally, the way to simplify the computation for the shortest path problem with turn penalties was pursued.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.581-590
• /
• 2014

In approach theory, we can provide arbitrary products of ${\infty}p$-metric spaces with a natural structure, whereas, classically only if we rely on a countable product and the question arises, then, whether properties which are derived from countability properties in metric spaces, such as sequential and countable compactness, can also do away with countability. The classical results which simplify the study of compactness in pseudometric spaces, which proves that all three of the main kinds of compactness are identical, suggest a further study of the category $pMET^{\infty}$.