• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.33 no.1
• /
• pp.9-16
• /
• 1984

This paper describes the minimum cost expansion planning which is based on the economical aspect under the various conditions on the power system expansion planning. It presents not only linear cost characteristics analysis but also stepwise cost characteristics analysis which satisfies practical condition in the power system. The latter analysis must be handled by integer programming (IP), because the relation between the cost and the capacity has stepwise characteristics. In order to proceed the latter analysis, the solving procedure is illustrated in detais by using branch and bound method which includes the network flow theory and maximum flow-minimum cut theorem.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.5A
• /
• pp.477-486
• /
• 2009

This paper deals with the strongest static arches with the solid regular polygon cross-section. Both span length and volume of arch are always held constant regardless the shape functions of cross-sectional depth of regular polygon. The normal stresses acting on such arches are calculated when both static vertical and horizontal point loads are subjected. By using the calculating results of stresses, the optimal shapes of strongest static arches are obtained, under which the maximum normal stress become to be minimum. For determining the redundant of such indeterminate arches, the least work theorem is adopted. As the numerical results, the configurations, i.e. section ratios, of the strongest static arches are reported in tables and figures. The results of this study can be utilized in the field of the minimum weight design of the arch structures.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.422-425
• /
• 1997

We consider the robust control problem for nonminimum phase(NMP) systems with parametric uncertainty which appear often in aircraft and missile control. First, a new method that makes such an uncertain NMP system to be factored as a interval minimum phase(MP) transfer function and a time delay term in the Pade approximation form has been presented. The controller to be proposed consists of a compensator $C_{Q}$(s) with Smith predictor in the internal model control(IMC) structure, so that it can have good robustness and performance against the structured uncertainty and the time delay behaviour due to NMP plant the $C_{Q}$(s) is designed on the MP model by using QFT. The stability and performance of overall system has been evaluated by the generalized Kharitonov theorem.rem.

• Journal of the Korea Convergence Society
• /
• v.4 no.4
• /
• pp.41-48
• /
• 2013

Observer design for system with unknown input was carried out. First, Kalman filter was considered to estimate system state with White noise. With the results of Kalman filter design, state observer, controller properties, including controllability and observability, and the Kalman filter structure and algorithm were also studied. Kalman filter algorithm was applied to Position and velocity measurement based on Kalman filter with white noise, and it was constructed and achieved by programming based on Matlab programming. Finally, observer for system with unknown input was constructed with the help of Gershgorin's disc theorem. With the designed observer, system states was constructed and applied to system with unknown input. By simulation results, estimation performance was verified. In this project, state feedback control theory, observer theory and relevant design procedure, as well as Kalman filter design were understood and used in practical application.

• Korean Journal of Mathematics
• /
• v.23 no.1
• /
• pp.115-128
• /
• 2015

Plumbing surfaces of links were introduced to study the geometry of the complement of the links. A basket surface is one of these plumbing surfaces and it can be presented by two sequential presentations, the first sequence is the flat plumbing basket code found by Furihata, Hirasawa and Kobayashi and the second sequence presents the number of the full twists for each of annuli. The minimum number of plumbings to obtain a basket surface of a knot is defined to be the basket number of the given knot. In present article, we first find a classification theorem about the basket number of knots. We use these sequential presentations and the classification theorem to find the basket number of all prime knots whose crossing number is 7 or less except two knots $7_1$ and $7_5$.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.5
• /
• pp.368-373
• /
• 2004

Surface visualization can be useful, particularly for internet-based education and simulation system. Since the mesh data size directly affects the downloading and operational performance, the problem that should be solved for efficient surface visualization is to reduce the total number of polygons, constituting the surface geometry as much as Possible. In this paper, an efficient polygon reduction algorithm based on Stokes＇ theorem, and topology preservation to delete several adjacent vertices simultaneously for past polygon reduction is proposed. The algorithm is irrespective of the shape of polygon, and the number of the polygon. It can also reduce the number of polygons to the minimum number at one time. The performance and the usefulness for medical imaging application was demonstrated using synthesized geometrical objects including plane. cube. cylinder. and sphere. as well as a real human data.

• The Mathematical Education
• /
• v.49 no.2
• /
• pp.247-257
• /
• 2010

In this article an explanation of monotonicity of functions and the definition of local extrema in Korean highschool textbooks based on national curriculum(revised in 2007) are analyzed critically. On the basis of this analysis, we indicate some problems and propose its improvements.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.19-38
• /
• 2007

Graph theory is becoming increasingly significant as it is applied of mathematics, science and technology. It is being actively used in fields as varied as biochemistry(genomics), electrical engineering(communication networks and coding theory), computer science(algorithms and computation) and operations research(scheduling). The powerful results in other areas of pure mathematics. Rhis paper, besides giving a general outlook of these facts, includes new graph theoretical proofs of Fermat's Little Theorem and the Nielson-Schreier Theorem. New applications to DNA sequencing (the SNP assembly problem) and computer network security (worm propagation) using minimum vertex covers in graphs are discussed. We also show how to apply edge coloring and matching in graphs for scheduling (the timetabling problem) and vertex coloring in graphs for map coloring and the assignment of frequencies in GSM mobile phone networks. Finally, we revisit the classical problem of finding re-entrant knight's tours on a chessboard using Hamiltonian circuits in graphs.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.329-334
• /
• 1996

The notion of approximate derivative was introduced by Denjoy in 1916 [3]. Khintchine [5] proved that Rolle's theorem holds for approximate derivatives and Tolstoff [8] proved that every approximate derivative is of Baire class 1 and has Darboux property. Goffman and Neugebauer [4] proved the above results of Tolstoff [8] in a different and simplified method. Also they [4] proved indirectly (via Darboux property) that approximate derivatives possess mean value property.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.1E
• /
• pp.34-38
• /
• 1996

In this paper, a new fast voronoi divider for vector quantization (VQ) is introduced, which results from Theorem that the nearest vectors in the sense of minimum mean square error(MMSE) have almost the same mean values of their elements. An improved splitting method for a VQ codebook design using the fast voronoi divider is also presented. Experimental results show that the new method reduces the complexity of training a VQ codebook several times with a high signal to noise ratio(SNR) using an appropriate extensive parameter of codebook.