• Journal of the Society of Naval Architects of Korea
• /
• v.36 no.4
• /
• pp.105-115
• /
• 1999

To develope the best optimized hull form, it has been generalized to evaluate the preliminary hull forms with the CFD tools in the initial stage of development and for this process it is needed to prepare various competent hull forms with high degree of fairness. In this paper, a modified shape variation method was developed to maintain the shape and fairness of parent hull form and the automatic update procedure was implemented on the basis of the association concept. It was shown that the hull form of the high quality in fairness and shape inherited from the parent hull form can be archived.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.71-79
• /
• 2006

Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.449-452
• /
• 2008

The building heights of big cities which charged with most space are 3-D information as relative vertical distance from ground control points, but they didn't know the heights using contour with maps as lose of skyline or building heights for downtown, practically continuously developed of many technology methods for implementation of 3-D spatial earth. So, For the view as stereos of variety earth form generated 3-D spatial and made terrain perspective map, 3-D simulated of regional and urban space as aviation images. In this papers, it composited geospatial informations and images by DEM generation, and developed and presented for techniques overlay of CAD data and photos captured at our surroundings uses. Particularly, The airborne LiDAR surveying which are very interesting trend have laser scanning sensor and determine the ground heights through detecting angle and range to the grounds, and then designated 3-D spatial composite and simulation from urban areas. Therefore in this papers are suggested ease selections on the users situation by compare as various simulations that its generation of 3-D spatial image by collective for downtown space and urban sub, and the implementation methods for more accurate, more select for the best images.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.67-77
• /
• 2004

A treatment of outlier has been discussed. Outliers disrupt the reliability of information systems and they should be eliminated prior to the information and/or data fusion. A time series-based elimination algorithm were proposed and prediction interval, as a criterion of acceptable value width, was obtained with the model. Ten actual link values were used and the best model was identified as IMA(1,1). Although the actual verification was difficult in a sense that the matching process between the eliminated data and model data was not readily available, the proposed model can be successfully used in practice with some calibration efforts.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.1-9
• /
• 2015

As attacks in cyber space become advanced and complex, monotonous defense approach of one-one matching manner between attack and defense may be limited to defend them. More efficient defense method is required. This paper proposes multi layers security scheme that can support to defend assets against diverse cyber attacks in systematical and adaptive. We model multi layers security scheme based on Defense Zone including several defense layers and also discuss essential technical elements necessary to realize multi layers security scheme such as cyber threats analysis and automated assignment of defense techniques. Also effects of multi layers security scheme and its applicability are explained. In future, for embodiment of multi layers security scheme, researches about detailed architecture design for Defense Zone, automated method to select the best defense technique against attack and modeling normal state of asset for attack detection are needed.

• Korean Journal of Remote Sensing
• /
• v.26 no.2
• /
• pp.87-98
• /
• 2010

For generating accurate land cover map over the whole Korean Peninsula, post-mosaic classification method is desirable in large area where multiple image data sets are used. We try to derive an optimal mosaic method of multi-temporal Landsat ETM+ scenes for the land cover classification over the Korea Peninsula. Total 65 Landsat ETM+ scenes were acquired, which were taken in 2000 and 2001. To reduce radiometric difference between adjacent Landsat ETM+ scenes, we apply three relative radiometric correction methods (histogram matching, 1st-regression method referenced center image, and 1st-regression method at each Landsat ETM+ path). After the relative correction, we generated three mosaic images for three seasons of leaf-off, transplanting, leaf-on season. For comparison, three mosaic images were compared by the mean absolute difference and computer classification accuracy. The results show that the mosaic image using 1st-regression method at each path show the best correction results and highest classification accuracy. Additionally, the mosaic image acquired during leaf-on season show the higher radiance variance between adjacent images than other season.

• The Journal of the Korean dental association
• /
• v.56 no.11
• /
• pp.631-640
• /
• 2018

Nowadays computer-guided "flapless" surgery for implant placement using templates is gaining popularity among clinicians and patients. The advantages of this surgical protocol are its minimally invasive nature, accuracy of implant placement, predictability, less post-surgical discomfort and reduced time required for definitive rehabilitation. Aim of this study is to describe the digital implant protocol, thanks to which is now possible to do a mini-invasive static guided implant surgery. This is possible thanks to a procedure named surface mapping based on the matching between numerous points on the surface of patient's dental casts and the corresponding anatomical surface points in the CBCT data. With some critical points and needing an adequate learning curve, this protocol allows to select the ideal implant position in depth, inclination and mesio-distal distance between natural teeth and or other implants enabling a very safe and predictable rehabilitation compared with conventional surgery. It represents a good tool for the best compromise between anatomy, function and aesthetic, able to guarantee better results in all clinical situations.

• The Mathematical Education
• /
• v.61 no.4
• /
• pp.581-595
• /
• 2022

The purpose of this study is to specify the procedure for making item models based on ontology models using automatic item generation in the mathematics subject through the CAFA system, and to explore the generated item instances. As an illustration for this, an item model was designed as a part of formative assessment based on the content characteristics, including concepts and calculations, and process characteristics, including application, using the representative values and the measures of dispersion in Mathematics of the 9th grade based on the evaluation criteria achievement standards. The item types generated in one item model were a best answer type, a correct answer type, a combined-response type, an incomplete statement type, a negative type, a true-false type, and a matching type. It was found that HTML, Google Charts, TTS, figures, videos and so on can be used as media. The implications of the use of digital evaluation based on automatic item generation were suggested in the aspects of students, pre-service teachers, general teachers, and special education, and the limitations of this study and future research directions were presented.

• The Journal of Korean Philosophical History
• /
• no.35
• /
• pp.361-384
• /
• 2012

In this study, I considered an important characteristic of system in pre-Qin philosophy that accomplished all categories with the best value. I pointed out misreading that thinkers separated fazhi-theory from shu zhi- theory of Hanfeizi. So I analyzed argument causes of Hanfeizi's shuzhi-theory through epistemology, ethics, military theory. And I proved that understanding the actual conditions and essences of things assured the objective bases on a reward and punishment. There are three things about argument bases of Hanfeizi's shuzi-theory. First, the epistemology that analyzes the actuality of a thing and that endows a duty matching the natural character of a thing. Second, ethics that isn't restricted by a fixed form and is in harmony with a law and that reveals a selfish character freely. Third, military theory, that is a trick that analyzes the quality of a case and a thing accurately. Above the three show that there are an objective basis of reward and punishment and an fair execution about a law in Hanfeizi's shuzhi-theory.