• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3469-3476
• /
• 1999

In spatial database based on spatial data structures, instead of one-dimensional indexing structure, new indexing structure which corresponds to multi-dimensional features of spatial objects is required. In order to meet those requirements, in this paper we proposed new indexing structure for efficient retrieval of spatial database by carrying through the feature analysis of conventional multi-dimensional indexing structures. To improve the sequential search method of supernodes in the conventional X-tree and to reduce the retrieval time in case of generating the huge supernode, we proposed a indexing structure integrating the kd-tree based on point index structure into the X-tree. We implemented the proposed indexing structure and analyzed its retrieval time according to the dimension and distribution of experimental data.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.11
• /
• pp.1110-1116
• /
• 2008

In this paper, we suggest GP operators based on tree structure considering tree distributions in structure space and structural difficulties. The main idea of the proposed genetic operators is to place generated offspring into the specific region which nodes and depths are balanced and most of solutions exist. To enable that, the proposed operators are designed to utilize region information where parents belong and node/depth rates of selected subtree. To demonstrate the effectiveness of our proposed approach, experiments of binomial-3 regression, multiplexer and even parity problem are executed. The experiments results show that the proposed operators based on tree structure is superior to the results of standard GP for all three test problems in both success rate and number of evaluations.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2008.04a
• /
• pp.294-298
• /
• 2008

이메본 논문은 GP 트리의 노드포화도를 제어함으로써 트리의 구조공간에서 효율적인 개체 분포를 유도하는 GP 진화연산자를 제안한다. 특정 영역으로의 트리 개체의 분포가 성능에 미치는 영향을 검증하고 진화과정에서 나타나는 군집내의 개체 다양성과의 관계를 분석한다. 제안된 진화연산자를 회귀다항식, 멀티플렉서, 짝수 패리티의 3가지 벤치마크 문제에 대해서 실험을 하였고, 표준 GP 연산자와 비교하였다.

• KCI Concrete Journal
• /
• v.11 no.3
• /
• pp.165-174
• /
• 1999

The objective of the research stated herein is to observe the elastic and inelastic behaviors and ultimate capacity of 1:5 scale 3-story reinforced concrete frame. Pushover tests were performed to 1:5 scale 3-story reinforced concrete frames with and without infilled masonry. To simulate the earthquake effect, the lateral force distribution was maintained by an inverted triang1e by using the whiffle tree. From the test results, the relation ships between the total lateral load and the roof drift, the distribution of column shears, the relation between story shear and story drift, and the angular rotations at the critical portions of structures were obtained. The effects of infilled masonry were investigated with regards to the stiffness, strength, and ductility of structures. Final collapse modes of structures with and without infilled masonry were compared.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1999.04a
• /
• pp.529-536
• /
• 1999

The objective of the research stated herein is to observe th elastic and inelastic behaviors and ultimate capacity of 1 : 5 scale 3-story reinforced concrete frame. Pushover tests were performed to 1:5 scale 3-story reinforced concrete frames without and with infilled masonry. To simulate the earthquake effect, the lateral force distribution was maintained to be an inverted triangle by using the whiffle tree. From the results of tests, the relations between the total lateral load and the roof drift, the distribution of column shears, the relation between story shear and story drift, and the angular rotations at the critical portions of structures were obtained. The effects of infilled masonry are investigated with regards to the stiffness, strength, and ductility of structures. Final collapse modes of structures with and without infilled masonry are compared.

• Journal of People, Plants, and Environment
• /
• v.24 no.2
• /
• pp.219-227
• /
• 2021

Background and objective: Urban street trees play an important role in carbon reduction in cities where greenspace is scarce. There are ongoing studies on carbon reduction by street trees. However, information on the carbon reduction capacity of street trees based on field surveys is still limited. This study aimed to quantify carbon uptake and storage by urban street trees and suggest a method to improve planting of trees in order to increase their carbon reduction capacity. Methods: The cities selected were Sejong, Chungju, and Jeonju among cities without research on carbon reduction, considering the regional distribution in Korea. In the cities, 155 sample sites were selected using systematic sampling to conduct a field survey on street environments and planting structures. The surveyed data included tree species, diameter at breast height (DBH), diameter at root collar (DRC), height, crown width, and vertical structures. The carbon uptake and storage per tree were calculated using the quantification models developed for the urban trees of each species. Results: The average carbon uptake and storage of street trees were approximately 7.2 ± 0.6 kg/tree/yr and 87.1 ± 10.2 kg/tree, respectively. The key factors determining carbon uptake and storage were tree size, vertical structure, the composition of tree species, and growth conditions. The annual total carbon uptake and storage were approximately 1,135.8 tons and 22,737.8 tons, respectively. The total carbon uptake was about the same amount as carbon emitted by 2,272 vehicles a year. Conclusion: This study has significance in providing the basic unit to quantify carbon uptake and storage of street trees based on field surveys. To improve the carbon reduction capacity of street trees, it is necessary to consider planning strategies such as securing and extending available grounds and spaces for high-density street trees with a multi-layered structure.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.4
• /
• pp.37-45
• /
• 1997

With rapid increase of information requirements from various application areas, there has been much research on dynamic information storage structures that effectively support insertions, deletions and updates. In this appear we evaluate the performance of he existing dynamic signature file methods such as the S-tree, Quick Filter and HS file and provide guidelines for the most effective usage to a given operational environment. We derive analytic performance evaluation models of the storage structures based on retrieval time, storage overhead and insertion time. We also perform extensive experiments with various data distributions such as uniform, normal and exponential distributions. The relationships among various performance parameters are throughly investigated. We show through performance comparison based on analytic models and experiments that regardless of data distribution, the HS file significantly improves performance in both the retreival time and the storage overhead over S-tree and Quick Filter.

• Journal of Korea Multimedia Society
• /
• v.13 no.10
• /
• pp.1534-1546
• /
• 2010

In sensor network systems, various hierarchical clustering schemes have been proposed in order to efficiently maintain the energy consumption of sensor nodes. Most of these schemes, however, are hardly applicable in practice since these schemes might produce unbalanced clusters or randomly distributed clusters without taking into account of the distribution of sensor nodes. To overcome the limitations of such hierarchical clustering schemes, we propose a novel scheme called CSM(Clustering using Split & Merge algorithm), which exploits node split and merge algorithm of tree-based indexing structures to efficiently construct clusters. Our extensive performance studies show that the CSM constructs highly balanced clustering in a energy efficient way and achieves higher performance up to 1.6 times than the previous clustering schemes, under various operational conditions.

• Structural Engineering and Mechanics
• /
• v.9 no.6
• /
• pp.557-568
• /
• 2000

As time-variant reliability approaches become increasingly used for service life prediction of the aging infrastructure, the demand for computer solution methods continues to increase. Effcient computer techniques have become well established for the reliability analysis of structural systems. Thus far, however, this is largely limited to time-invariant reliability problems. Therefore, the requirements for time-variant reliability prediction of deteriorating structural systems under time-variant loads have remained incomplete. This study presents a computer program for $\underline{REL}$iability of $\underline{T}$ime-Variant $\underline{SYS}$tems, RELTSYS. This program uses a combined technique of adaptive importance sampling, numerical integration, and fault tree analysis to compute time-variant reliabilities of individual components and systems. Time-invariant quantities are generated using Monte Carlo simulation, whereas time-variant quantities are evaluated using numerical integration. Load distribution and post-failure redistribution are considered using fault tree analysis. The strengths and limitations of RELTSYS are presented via a numerical example.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.12
• /
• pp.209-217
• /
• 2022

Naval CMS(Combat Management System) is linked to various sensors and weapon equipment and use DDS(Data Distribution Service) for efficient data communication between ICU(Interface Control Unit) Node and IPN(Information Processing Node). In order to use DDS, software in the system communicates in an PUB/SUB(Publication/Subscribe) based on DDS topic. If the DDS messages structure in this PUB/SUB method does not match, problems such as incorrect command processing and wrong information delivery occur in sending and receiving application software. To improve this, this paper proposes a DDS message structure integrity verification method. To improve this, this paper proposes a DDS message structure integrity verification method using a hash tree. To verify the applicability of the proposed method to Naval CMS, the message integrity verification rate of the proposed method was measured, and the integrity verification method was applied to CMS and the initialization time of the existing combat management system was compared and the hash tree generation time of the message structures was measured to understand the effect on the operation and development process of CMS. Through this test, It was confirmed that the message structure verification method for system stability proposed in this paper can be applied to the Naval CMS.