• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.168-185
• /
• 2003

This paper presents a progressive algorithm that not only can narrow down the search domain in the course of face identification but also can fast reconstruct various 3D objects from a sketch drawing. The sketch drawing, edge-vertex graph without hidden line removal, which serves as input for reconstruction process, is obtained from an inaccurate freehand sketch of a 3D wireframe object. The algorithm is executed in two stages. In the face identification stage, we generate and classify potential faces into implausible, basis, and minimal faces by using geometrical and topological constraints to reduce search space. The proposed algorithm searches the space of minimal faces only to identify actual faces of an object fast. In the object reconstruction stage, we progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order of faces. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. Furthermore, it allows the designer to change viewpoint during sketching. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• The Journal of the Korea Contents Association
• /
• v.20 no.7
• /
• pp.212-222
• /
• 2020

The purpose of this study is to understand the current status and trends of the research studies published by the Society for Industrial and Applied Mathematics which is a leader in the field of industrial mathematics around the world. To perform this purpose, titles and abstracts were collected from 6,255 research articles between 2016 and 2019, and the R program was used to analyze the topic modeling model with LDA techniques and a regression model. As the results of analyses, first, a variety of studies have been studied in the fields of industrial mathematics, such as algebra, discrete mathematics, geometry, topological mathematics, probability and statistics. Second, it was found that the ascending research subjects were fluid mechanics, graph theory, and stochastic differential equations, and the descending research subjects were computational theory and classical geometry. The results of the study, based on the understanding of the overall flows and changes of the intellectual structure in the fields of industrial mathematics, are expected to provide researchers in the field with implications of the future direction of research and how to build an industrial mathematics curriculum that reflects the zeitgeist in the field of education.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.16 no.6
• /
• pp.87-94
• /
• 2002

As a section insulator dividing the electric railroad catenaries with different phases, the AC/DC section insulator which divides AC and DC railroad catenary have the complex structure, and suffer irregular abrasion on the surface or insulator rods when it is installed at the underground railroad. This paper intended as an investigation of the irregular abrasion of section insulators, provides the field measurements of abrasion level along insulator length and the abrasion patterns. The height variation of insulator parts and the balding length of insulators against pantograph's contact force are analysed experimentally, and the irregular abrasion mechanism is clarified with the help of theoretical analysis on the interaction between pantographs and section insulators. On the basis of experimental and theoretical analysis, the countermeasures to reduce the irregular abrasion are provided too.

• Applied Chemistry for Engineering
• /
• v.26 no.3
• /
• pp.336-340
• /
• 2015

Three different types of polycarbonate (PC)/graphene oxide (GO) composites using diphenyl carbonate as a monomer were fabricated by melt polymerization. Those were the PC/GO composite (PC/GO) using a twin extruder, in-situ PC/GO composite (PC/GO-cat.) using a catalyst, and in-situ PC/GO composite (PC/GO-COCl) using a GO-COCl treated by -COCl, Chemical structures of the composites were confirmed by C-H and C=O stretching peak at $3000cm^{-1}$ and $1750cm^{-1}$, respectively. The slope for the storage (G') versus loss (G") modulus plot decreased with an increase in the heterogeneous property of polymer melts. So we can check the GO dispersion of the PC/GO composites using by the slop for G'-G" plot. According to the G'- G" slopes for three different types of PC/GO composites, GO was well dispersed within PC matrix in case of PC/GO and PC/GO-cat.. It was also confirmed by atomic force microscope (AFM) photos. One of the reasons for the poor GO dispersion of PC/GO-COCl is branching and crosslinking processes occurred during polymerization, which was further confirmed by a plot for the complex modulus versus phase difference.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.6
• /
• pp.269-277
• /
• 2024

With the advancement of modern IT technologies, the operation of autonomous vehicles is becoming a reality, and route planning is essential for this. Generally, route planning involves proposing the shortest path to minimize travel distance and the quickest path to minimize travel time. However, the quality of these routes depends on the topological characteristics of the road network graph. If the connectivity structure of the road network is not rational, there are limits to the performance improvement that routing algorithms can achieve. Real drivers consider psychological factors such as the number of turns, surrounding environment, traffic congestion, and road quality when choosing routes, and they particularly prefer routes with fewer turns. This paper introduces a simple path algorithm that seeks routes with the fewest turns, in addition to the traditional shortest distance and quickest time routes, to evaluate the characteristics of road networks. Using this simple path algorithm, we compare and evaluate the connectivity characteristics of road networks in 20 major cities worldwide. By analyzing these road network characteristics, we can identify the strengths and weaknesses of urban road networks and develop more efficient and safer route planning algorithms. This paper comprehensively examines the quality of road networks and the efficiency of route planning by analyzing and comparing the road network characteristics of each city using the proposed simple path algorithm.