• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.21-34
• /
• 2007

According to recent rapid price drop and capacity growth of main memory, the number of applications on main memory databases is dramatically increasing. Cache miss, which means a phenomenon that the data required by CPU is not resident in cache and is accessed from main memory, is one of the major causes of performance degradation of main memory databases. Several cache-conscious trees have been proposed for reducing cache miss and making the most use of cache in main memory databases. Since each cache-conscious tree has its own unique features, more than one cache-conscious tree can be used in a single application depending on the application's requirement. Moreover, if there is no existing cache-conscious tree that satisfies the application's requirement, we should implement a new cache-conscious tree only for the application's sake. In this paper, we propose the cache-conscious generalized search tree (CC-GiST). The CC-GiST is an extension of the disk-based generalized search tree (GiST) [HNP95] to be tache-conscious, and provides the entire common features and algorithms in the existing cache-conscious trees including pointer compression and key compression techniques. For implementing a cache-conscious tree based on the CC-GiST proposed in this paper, one should implement only a few functions specific to the cache-conscious tree. We show how to implement the most representative cache-conscious trees such as the CSB+-tree, the pkB-tree, and the CR-tree based on the CC-GiST. The CC-GiST eliminates the troublesomeness caused by managing mire than one cache-conscious tree in an application, and provides a framework for efficiently implementing arbitrary cache-conscious trees with new features.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.7
• /
• pp.3468-3473
• /
• 2013

Conditions that overlay multicast tree must satisfy for the real-time application system of a video-conference, an internet broadcasting is two things. First, the degree of nodes in a tree must be proper value. Second, the diameter of the multicast tree, distance between longest two users should be short. If the path between two users in the tree is long, the delay time in data transmission between two users great. So, it is not suitable to the application system such as video-conferences. In this paper, the cost of the dijkstra algorithm calculate with proposed score-function through checking the extra bandwidth, the delay and the requested bandwidth. It is composed the tree through the dijkstra algorithm.

• The Journal of Society for e-Business Studies
• /
• v.15 no.3
• /
• pp.85-98
• /
• 2010

The prevailing infrastructure of ubiquitous computing paradigm on the one hand making significant development for integrating technology in the daily life but on the other hand raising concerns for privacy and confidentiality. This research presents a new privacy-preserving spatio-temporal query processing technique, in which location based services (LBS) can be serviced without revealing specific locations of private users. Existing location cloaking techniques are based on a grid-based structures such as a Quad-tree and a multi-layered grid. Grid-based approaches can suffer a deterioration of the quality in query results since they are based on pre-defined size of grids which cannot be adapted for variations of data distributions. Instead of using a grid, we propose a location-cloaking algorithm which uses the R-tree, a widely adopted spatio-temporal index structure. The proposed algorithm uses the MBRs of leaf nodes as the cloaked locations of users, since each leaf node guarantees having not less than a certain number of objects. Experimental results show the superiority of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.2
• /
• pp.304-310
• /
• 2020

The technology in 3D modelling have advanced not only maps, heritages, constructions but also trees modelling. By laser scanning(Faro s350) and photogrammetry software(Pix4d) for 3D modelling, this study compared with real coniferous tree and both technology's results about characteristics of shape, texture, and dimensions. As a result, both technologies all showed high reproducibility. The scanning technique showed very good results in the reproduction about bark and leaves. Comparing the detailed dimensions on it, the error between the actual tree and modelling with scanning was 1.7~2.2%, and the scanning result was larger than the actual tree. The error between the actual tree and photogrammetry was only 0.2~0.5%, which was larger than the actual tree. On the other hand, the dark areas's modelling was not fully processed. This study is meaningful as a basic research that can be used for tree DB on BIM for the landscape architecture, landscape design and analysis with AR technology, historical tree and heritage also.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.719-726
• /
• 2014

TRIZ, the theory of inventive problem solving, is widely used in traditional engineering fields such as mechanical, electrical, and electronic engineering and generated good results. Yet there are few examples in software field. But software field requires creative problem solving capabilities more than any other fields and we expect that we can get remarkable results by applying TRIZ in this field. In this paper, we try to break the psychological inertia that TRIZ is difficult to use in software area through development of new software, the Smart Clicker, by applying TRIZ. And we present an approach how to apply TRIZ in software field.

• Aerospace Engineering and Technology
• /
• v.6 no.1
• /
• pp.92-96
• /
• 2007

The conventional commands & telemetry system of Korean low-earth orbiting satellites has certain limitations in accommodating various missions. As the payload becomes complex, it requires very complicated operational concepts in terms of commands and telemetry. With the current design, commands and telemetry formats have to be rebuilt whenever new payloads or operation concepts are involved, and many constraints in operation shall be produced due to the lacks of its flexibility. In this paper, a new strategy for commands & telemetry development partially derived from PUS (Packet Utilization Standard) of European Space Agency, which provides enhanced features for the accommodation of payloads & operational requirements, is presented.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.195-202
• /
• 2001

In this paper, we show a study on how to model a phoneme of which acoustic feature is changed according to both left-hand and right-hand phonemes. For this purpose, we make a comparative study on two kinds of algorithms; a unit reduction algorithm and decision tree modeling. The unit reduction algorithm uses only statistical information while the decision tree modeling uses statistical information and Korean acoustical information simultaneously. Especially, we focus on how to model context-dependent phonemes based on decision tree modeling. Finally, we show the recognition rate when context-dependent phonemes are obtained by the decision tree modeling.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.857-860
• /
• 2009

최근 유무선 통신 시스템의 발전에 따른 인터넷 환경의 급격한 변화는 가상공간의 출현과 유비쿼터스 컴퓨팅 환경 구축에 대한 요구를 가속화시키고 있으며 이와 관련된 이론 및 기술의 발전을 주도해 왔다. 이와 관련한 문제들 중에 가장 근간이 되는 문제들 중 하나는 최적 통신 스패닝 트리(OCST: Optimal Communication Spanning Tree) 문제이다. 본 논문에서는 이러한 최적 통신 스패닝 트리 문제를 해결하기 위해 파라미터를 자동 조절하는 유전 알고리즘 (Parameter Auto Tuned GA, PAT-GA)을 이용한다. 제안하는 유전 알고리즘은 교차율, 돌연변이율과 같은 파라미터를 자동조절하기 위해 퍼지 논리 제어기 (FLC: Fuzzy Logic Controller)를 이용한다. 임의로 생성된 예제에 대한 수치 실험을 통해 통신시스템의 기본 문제 중 하나인 최적 통신 스패닝 트리 문제의 해법으로서의 제안 알고리즘의 유용성과 효율성을 확인한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.792-795
• /
• 2010

사용자 그룹 서비스는 IPTV를 비롯한 다양한 분야에 걸쳐 응용되고 있으며, 안전한 그룹 통신을 위해 그룹 키를 사용한다. 그룹 키 관리를 보다 효율적으로 하기 위해 최근 많은 연구에서 트리를 이용한 기법을 제시하였다. 트리의 루트 노드로부터 하향식 방식으로 노드 값을 구성하고, 특히 이진트리를 이용하여 그룹 멤버의 가입과 탈퇴에 따라 그룹 키를 갱신하는데 소요되는 비용을 줄였다. 대부분의 연구에서 그룹 키를 갱신하는데 필요한 메시지 전송량이 lg(N) 수준이다. 본 논문에서는 단말 노드로부터 루트 노드 방향으로 노드 값을 구성한 상향식 해시 트리를 기반으로 그룹 키를 갱신하는데 필요한 메시지 전송량이 lg(1) 수준인 기법을 제안한다. 이 기법은 가입 또는 탈퇴가 발생했을 때 즉시 키를 갱신하여 동적이고, 기존의 기법들에 비해 서비스 제공자와 네트워크 대역폭의 부담이 감소하여 효율적이다.

• Journal of the Korean Applied Science and Technology
• /
• v.34 no.1
• /
• pp.66-82
• /
• 2017

Organosilicone-based surfactants consist of hydrophobic organosilicone groups coupled to hydrophilic polar groups. Organosilicone surfactants have been widely used in many industrial fields starting from polyurethane foam to construction materials, cosmetics, paints & inks, agrochemicals, etc., because of their low surface tension, lubricity, spreading, water repellency and thermal and chemical stability, resulted from the unique properties of organosilicone. Especially, trisiloxane surfactants, having low molecular weight organosilicone as hydrophobe, exhibit low surface tension and excellent wettability and spreadability, leading to their applications as super wetter/super spreader, but have the disadvantage of vulnerability to hydrolysis. A variety of trisiloxane surfactant structures are required to provide the functional improvement and the defect resolution for reflecting the necessities in the various applications. This review covers the synthetic schemes of reactive trisiloxanes as hydrophobic siloxane backbones, the main reaction schemes, such as hydrosilylation reaction, for coupling reactive trisiloxanes to hydrophilic groups, and the synthetic schemes of the main trisiloxane surfactants including polyether-, carbohydrate-, gemini-, bolaform-, double trisiloxane-type surfactants.