• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2009

In this paper, a new adaptive vertex clustering using a KD-tree is presented for 3D mesh partitioning. A vertex clustering is used to divide a huge 3D mesh into several partitions for various mesh processing. An octree-based clustering and K-means clustering are currently leading techniques. However, the octree-based methods practice uniform space divisions and so each partitioned mesh has non-uniformly distributed number of vertices and the difference in its size. The K-means clustering produces uniformly partitioned meshes but takes much time due to many repetitions and optimizations. Therefore, we propose to use a KD-tree to efficiently partition meshes with uniform number of vertices. The bounding box region of the given mesh is adaptively subdivided according to the number of vertices included and dynamically determined axis. As a result, the partitioned meshes have a property of compactness with uniformly distributed vertices.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.157-168
• /
• 2011

Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree's insertion performance.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.21 no.1
• /
• pp.61-77
• /
• 2019

If a new utility tunnel is planned for high density existing urban areas in Korea, a rational decision-making process such as the determination of optimum design capacity by using the feasibility evaluation system based on quantitative evaluation indexes and the economic evaluation is needed. Thus, the previous study presented the important weight of individual higher-level indexes (3 items) and sub-indexes (16 items) through a hierarchy analysis (AHP) for quantitative evaluation index items, considering the characteristics of each urban type. In addition, an economic evaluation method was proposed considering 10 benefit items and 8 cost items by adding 3 new items, including the effects of traffic accidents, noise reduction and socio-economic losses, to the existing items for the benefit cost analysis suitable for urban utility tunnels. This study presented a quantitative feasibility evaluation method using the important weight of 16 sub-index items such as the road management sector, public facilities sector and urban environment sector. Afterwards, the results of quantitative feasibility and economic evaluation were compared and analyzed in 123 main road sections of the Seoul. In addition, a comprehensive evaluation method was proposed by the combination of the two evaluation results. The design capacity optimization program, which will be developed by programming the logic of the quantitative feasibility and economic evaluation system presented in this study, will be utilized in the planning and design phases of urban community zones and will ultimately contribute to the vitalization of urban utility tunnels.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1035-1049
• /
• 2014

This paper presents a new method to detect attack patterns in security-critical systems, based on a new notion of Behavior Ontology. Generally security-critical systems are large and complex, and they are subject to be attacked in every possible way. Therefore it is very complicated to detect various attacks through a semantic structure designed to detect such attacks. This paper handles the complication with Behavior Ontology, where patterns of attacks in the systems are defined as a sequences of actions on the class ontology of the systems. We define the patterns of attacks as sequences of actions, and the attack patterns can then be abstracted in a hierarchical order, forming a lattice, based on the inclusion relations. Once the behavior ontology for the attack patterns is defined, the attacks in the target systems can be detected both semantically and hierarchically in the ontology structure. When compared to other attack models, the behavior ontology analysis proposed in this paper is found to be very effective and efficient in terms of time and space.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.11-19
• /
• 2007

This paper proposes RCB(Reduced Compact Binary) tie to correct faults of both CB(Compact Binary) tie and HCB(Hierarchical Compact Binary) trie. First, in the case of CB trie, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nods used in balancing trees. On the other hand, if the HCB trie realized hierarchically, given certain depth to prevent the map from increasing on the right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CB trie and of many tree links. In the case of RCB trie in this thesis, the tree-map could be reduced by about 35% by completely cutting down dummy nods and the whole size by half, compared with the HCB trie.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.6
• /
• pp.933-943
• /
• 2019

The purpose of this study is to identify determinants for preferred funeral methods depending on socio-economic characteristics. In South Korea, the Act on Funeral Services, Etc. categorizes funeral methods into burial, inurnment, and natural burial. This study empirically analyzes how and what socio-economic characteristics affect choices among these three categories. Data is collected from Social Survey 2017 and funeral facilities in the country. The data to be analyzed is developed in terms of a hierarchy which puts the burial and cremation methods in an upper class and the inurnment and natural burial methods in a lower class. Based on this data, a nested logit model is employed to conduct empirical analysis. The analysis indicates that those characteristics that have a statistically significant influence on preferred methods include gender, age, householder, marriage, satisfaction with life, class awareness, monthly income, housing type, housing tenure type, and living in city area. Each variable's modulus of calculated direct and cross elasticity need to be used to analyze the outcome of a nested logit model. In this study, the modulus of direct and cross elasticity are determined for the significant variables. The calculated direct elasticity is applied to analyze the likelihood of choosing each funeral method when there are changes in the significant variables. When a particular method has been selected, on the other hand, the cross elasticity is utilized to analyze changes to the likelihood of choosing the other methods. One of the most notable results is related to natural burial. In order to meet the demand for natural burial, it is necessary to provide more burial sites and raise awareness of natural burial. This will facilitate the efficient use of national territorial space.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.6
• /
• pp.625-633
• /
• 2020

this study, an expert AHP questionnaire analysis of public and private groups was conducted to take into consideration the requirements for realistic disaster services. Considered are public areas that manage disasters like fires and earthquakes that can be a major threat to national safety, as well as private areas that mainly develop disaster-related technologies. In the questionnaire, the public respondents valued accurate disaster situation information (ranked 4th and 6th) for citizens (1st), managers (3rd), and related organizations (2nd); the private sector highly valued the importance of three-dimensional (3D) control (ranked 1st, 3rd, and 5th) using future technologies. This study suggests the realization of a disaster-response service that meets the needs of public safety and technological innovation based on a 3D safety state information platform. We anticipate that this study will provide useful data for applying technology and for establishing detailed scenarios during the test bed and commercialization phases. We also expect that further studies will be conducted, such as the practical application and operation of realistic disaster response services, on the financial resources for the proliferation of local governments, and on policy support measures.

• Journal of Korea Game Society
• /
• v.11 no.4
• /
• pp.15-26
• /
• 2011

Game level design is a collaborative work to create a virtual world for a computer game including maps, agents, monsters, objects, players and events based on predefined its game scenario. It is a promising collaborative design application. The game level design generally requires much time and cost, as the size of its target game space becomes huge. However, traditional game level design tools do not provide concurrency control mechanisms among multiple participating game designers. They do not provide consistency of undo and redo mechanisms for erroneous collaborative tasks during iterative modifications and updates of collaborative tasks among multiple designers. In this paper, we propose a concurrency control and a collaborative editing mechanism to enhance productivity of the collaborative game level design. The proposed system provides hierarchical structures of shared objects and a concurrency control mechanism for each object. The proposed system also provides a consistent undo and redo mechanism to enhance modifications and updates on intermediate results of the level design procedures.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.259-267
• /
• 2013

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.

• Cross-Cultural Studies
• /
• v.40
• /
• pp.41-60
• /
• 2015

This article aims at exploring the convergence and sharing of cultural tastes among Northeast Asian countries by analyzing TV drama "Boys over flower", based on the original Japanese manga and produced in Korea, China, Japan and Taiwan in the $21^{st}$ century. It explores the expectation and desire of the mass who have taken pleasure in watching it in each country as well. This article argues that the sharing of the sensitivities and tastes of young women, the main consumer of the drama, by the mass of the four countries, are an important cultural phenomenon in that it reveals the emergence of "girl" as an active cultural consumer, who had been the object of a restraint and strict protection of the bourgeois family structure.