• Title/Summary/Keyword: Tree Management Information

Search Result 713, Processing Time 0.031 seconds

A Study on XML Development Support System for DB Integration (데이터베이스 통합을 위한 XML 개발 지원 시스템에 관한 연구)

  • Cho, Chong Duck;Park, Young Soo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.2
    • /
    • pp.39-53
    • /
    • 2010
  • In this paper, we suggest an XML Development Support(XDS) System as a good developing tool to solve the problems that related with the database integration, increased to the developing terms and costs when the developing of XML programming base on the web server. XDS System is designed for the purpose of easily coding the XML program, of simply changing the programming structure and of completely maintaining the program environment. According to the predefined policy, XDS System provides necessary informations such as tables, columns, or relational keys from Database for developer. The developer step by step selects or sets what he needs. And XDS System creates an XML Tree with the result of selected information. The XML Tree includes all information of making an XML Schema and some XML Stylesheet. XDS System creates an XML Schema for all clients and creates many XML Stylesheets for each client using the XML Tree.

Group Key Management using (2,4)-Tree ((2,4)-트리를 이용한 그룹키 관리)

  • 조태남;이상호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.4
    • /
    • pp.77-89
    • /
    • 2001
  • Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.

On-farm Tree Planting and Management Guidelines for Medium to High Potential Areas of Kenya

  • Makee, Luvanda A.
    • Journal of Forest and Environmental Science
    • /
    • v.32 no.4
    • /
    • pp.392-399
    • /
    • 2016
  • This review paper presents guidelines which stakeholders use in addressing on-farm tree planting configuration, establishment, tending, silvi- cultural management, management of pests and diseases, challenges and opportunities as practiced in the medium to high potential areas of Kenya. The tree planting configurations discussed includes blocks planting (woodlot), boundary, compound planting, home/fruit gardens, trees intercropped or mixed with pasture, trees on riverbanks and roadside. Participatory monitoring and evaluation techniques have been highlighted. The main challenges facing tree planting activities include culture and attitude of local people, land and tree tenure, inadequate technical support, lack of recognition and integration of technical information and indigenous knowledge, capital and labour shortages, lack of appropriate incentives measures, damage by domestic and wild animals, conflict over trees on the boundary and policy and legal issues. This guideline targets forest managers, extension agents, students and other practitioners in policy and day to day decision making processes in Kenya.

Intelligent Production Management System with the Enhanced PathTree (개선된 패스트리를 이용한 지능형 생산관리 시스템)

  • Kwon, Kyung-Lag;Ryu, Jae-Hwan;Sohn, Jong-Soo;Chung, In-Jeong
    • The KIPS Transactions:PartD
    • /
    • v.16D no.4
    • /
    • pp.621-630
    • /
    • 2009
  • In recent years, there have been many attempts to connect the latest RFID (Radio Frequency Identification) technology with EIS (Enterprise Information System) and utilize them. However, in most cases the focus is only on the simultaneous multiple reading capability of the RFID technology neglecting the management of massive data created from the reader. As a result, it is difficult to obtain time-related information such as flow prediction and analysis in process control. In this paper, we suggest a new method called 'procedure tree', an enhanced and complementary version of PathTree which is one of RFID data mining techniques, to manage massive RFID data sets effectively and to perform a real-time process control efficiently. We will evaluate efficiency of the proposed system after applying real-time process management system connected with the RFID-based EIS. Through the suggested method, we are able to perform such tasks as prediction or tracking of process flow for real-time process control and inventory management efficiently which the existing RFID-based production system could not have done.

RFID Location Based Tree Management System (TMS) Using Insertion UHF RFID Tag and GPS (UHF RFID 태그와 GPS를 사용한 위치기반 수목관리용 RFID 시스템 구현)

  • Nam, Seahyeon;Chung, You Chung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.10
    • /
    • pp.909-914
    • /
    • 2012
  • The paper introduces the RFID location based Tree Management System (TMS) using UHF RFID tag and GPS. The bolt shape tag has been developed since the wood material has high dielectric constant. Since the characteristics and impedance of tag antenna can be changed by the material next to the tag, the plastic bolt shape tag antenna has to be carefully designed with consideration of the high dielectric constant of the wood material. The RFID TMS system has been utilized with the bolt shape tag antenna and GPS. The TMS system uses and links Google map to locate the location of the trees. Therefore, this system allow us to manage the trees economically and efficiently.

Design of Software Opportunity Tree and Its Algorithm Design to Defect Management (소프트웨어 결함 처리를 위한 Opportunity Tree 및 알고리즘 설계)

  • Lee, Eun-Ser;Lee, Kyung-Whan
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.873-884
    • /
    • 2004
  • This research provides the solution of defect problem and detection of defect and its causes that happen on software development. For developing a reliable software, a key factor is to find and manage defects that are during software development. Based on defect items analysis, we understand associated relation between defects and design defect opportunity tree. Developing the similar project, we can estimate defect and prepare to solve defect by using defect management opportunity tree.

A Study on the Profitability of Coffee Franchise Firms using ROIC Tree, ROA & ROE (ROIC(영업투하자본율) Tree와 ROA, ROE를 활용한 커피프랜차이즈 기업의 수익성에 관한 연구)

  • Kim, Tae-Ho;Kim, Hak-Seon
    • Culinary science and hospitality research
    • /
    • v.24 no.1
    • /
    • pp.130-139
    • /
    • 2018
  • The purpose of this study was to grasp the profitability of coffee franchise companies using ROIC tree, ROA and ROE. As a result, ROA was using assets efficiently, and some companies are in desperate need to improve their management based on past brand recognition, and a new paradigm management strategy is urgently required. In particular, the franchise company's current cost burden is greater than comparable firms. In ROE, the capital was operating efficiently. Since ROIC is very difficult to classify business related and operating related amounts accurately based on financial statement information, there is a limit to accurate ROIC calculation. Therefore, ROIC is estimated to be 7.6~38.29% as of 2016 based on ROIC calculation. In the case of continuous growth companies, investments are made to improve steady sales, but some companies seem to be unable to escape from past paradigm. In order to continue the growth of the company beyond the accounting profit in the future, the ROIC Tree can be used to measure the subdivided management performance and propose efficiency plan.

Ordinary B-tree vs NTFS B-tree: A Digital Forensics Perspectives

  • Cho, Gyu-Sang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.8
    • /
    • pp.73-83
    • /
    • 2017
  • In this paper, we discuss the differences between an ordinary B-tree and B-tree implemented by NTFS. There are lots of distinctions between the two B-tree, if not understand the distinctions fully, it is difficult to utilize and analyze artifacts of NTFS. Not much, actually, is known about the implementation of NTFS, especially B-tree index for directory management. Several items of B-tree features are performed that includes a node size, minimum number of children, root node without children, type of key, key sorting, type of pointer to child node, expansion and reduction of node, return of node. Furthermore, it is emphasized the fact that NTFS use B-tree structure not B+structure clearly.

Key Management for Multicast Encryption using Unbalanced Tree (비대칭 트리 구조를 이용한 멀티캐스트 암호화 키 관리)

  • 박희안;공은배
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04a
    • /
    • pp.835-837
    • /
    • 2001
  • 본 논문에서는 안전한 멀티캐스트를 위해 사용되는 암호화 키를 비대칭 Tree를 이용하여 관리하는 방법을 제안하였다. 기존의 대칭 Tree를 이용한 방법은 모든 사용자들을 같은 레벨에 위치시킴으로써 각 사용자들에 따라 다를 수 있는 Join/Remove 빈도수를 고려하지 않고 모두 똑 같은 확률을 가진 것으로 간주하여 그에 따른 불필요한 메시지 전송이 많았다. 그러나 본 논문에서 제안한 방법은 각 사용자의 빈도수를 고려하여 Tree를 비대칭으로 구성함으로써 키 관리를 위해 전송하는 메시지의 양을 효율적으로 줄일 수 있고 경우에 따라서는 Center와 사용자가 가진 키의 양도 기존 방법보다 상당히 작아질 수 있다.

  • PDF

F-Tree : Flash Memory based Indexing Scheme for Portable Information Devices (F-Tree : 휴대용 정보기기를 위한 플래시 메모리 기반 색인 기법)

  • Byun, Si-Woo
    • Journal of Information Technology Applications and Management
    • /
    • v.13 no.4
    • /
    • pp.257-271
    • /
    • 2006
  • Recently, flash memories are one of best media to support portable computer's storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional Indexing scheme such as B-Tree due to the relatively slow characteristics of flash operation as compared to RAM memory. In order to achieve this goal, we devise a new indexing scheme called F-Tree. F-Tree improves tree operation performance by compressing pointers and keys in tree nodes and rewriting the nodes without a slow erase operation in node insert/delete processes. Based on the results of the performance evaluation, we conclude that F-Tree indexing scheme outperforms the traditional indexing scheme.

  • PDF