• Journal of Information Management
• /
• v.39 no.3
• /
• pp.205-220
• /
• 2008

This research focused on the major determinants for the strategic utilization of technology tree as a strategic technology information repository after the adoption of the technology tree in the R&D intensive organization. The study was performed based on both theoretical study and qualitative case study approaches. The result is as follows; for the strategic utilization of the technology tree for the information repository, it should be the market base and be closely related with the technology roadmap. In terms of the needs of times, this study regarding the strategic utilization of technology tree as a strategic technology information repository and as a s strategic supplement for technology roadmap is anticipated to be a good reference for the R&D-oriented organizations and technology-related studies in coming years.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2001.11a
• /
• pp.207-208
• /
• 2001

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3219-3236
• /
• 2012

A tree routing structure is often adopted for many-to-one data gathering and aggregation in sensor networks. For real-time scenarios, considering lossy wireless links, it is an important issue how to construct a maximum-lifetime data gathering tree with delay constraint. In this work, we study the problem of lifetime-preserving and delay-constrained tree construction in unreliable sensor networks. We prove that the problem is NP-complete. A greedy approximation algorithm is proposed. We use expected transmissions count (ETX) as the link quality indicator, as well as a measure of delay. Our algorithm starts from an arbitrary least ETX tree, and iteratively adjusts the hierarchy of the tree to reduce the load on bottleneck nodes by pruning and grafting its sub-tree. The complexity of the proposed algorithm is $O(N^4)$. Finally, extensive simulations are carried out to verify our approach. Simulation results show that our algorithm provides longer lifetime in various situations compared to existing data gathering schemes.

• Research in Plant Disease
• /
• v.10 no.4
• /
• pp.227-230
• /
• 2004

Occurrence and epidemiology of crown gall caused by A. tumefaciens in persimmon tree was investigated. Persimmon tree was more sensitive to crown gall disease than peach and jujube tree. Over 80% persimmon trees were infected to crown gall in all investigated region with no relation to planted years. Yield of infected tree was severely decreased to 54%. Incidence of crown gall in nursery field of persimmon tree was also severe and the infection rate of persimmon seedlings collected from market was 34%. It was guessed that the primary inoculum of crown gall caused by A. tumefaciens is infected persimmon seedlings.

• Journal of applied mathematics & informatics
• /
• v.41 no.6
• /
• pp.1237-1256
• /
• 2023

The tree products of groups with amalgamation subgroups are generalizations of the free products of groups with amalgamation subgroup. The aim of this paper is to construct a tree called the standard tree where the tree products of groups with amalgamation subgroups act without inversions and then find the quotient of this action. Furthermore, we show that if the amalgamation subgroups are finite and the factor groups act on disjoint trees then there exists a tree called the fiber tree where the tree products of groups with amalgamation subgroups act without inversions and find the quotients of this action. If each factor is a tree products with amalgamation subgroups, we get a new fiber tree and the corresponding factors.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2008.11a
• /
• pp.295-295
• /
• 2008

Water tree experiments were done for several types of cross-linked polyethylenes. Test method is followed by ASTM D6097. Polyethylene is divided for four subgroup. First One is chemically cross-linked general XLPE, and second one is chemically cross-linked tree-retardant XLPE, and the third one is silane cross-linked polyethylene made by monosil process, and the last one is silane cross-linked polythylene made by copolymer. Tree retardant XLPE shows the shortest water tree length. Cahemcally cross-linked general XLPE shows the longest water tree length. Silane cross-linked polyethylene by copolymer is similar to tree retardant XLPE and similar breakdown strength. So silane cross-linked XLPE by copolymer could be used for the the medium voltage cable which should have tree retardant characteristics.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

• Journal of Industrial Technology
• /
• v.31 no.B
• /
• pp.113-117
• /
• 2011

The purpose of this study is to determine the antimicrobial effect of tea tree oil a against pathogens relate to acne. Tea tree oil extracted from Australian Melaleuca alterifolia has been studied extensively for their antimicrobial properties against different type of bacteria and fungi. Tea tree oil has been reported to have antibacterial, antiinflammatory and antitumor activities, among others. By evaluating the antibacterial effect of Tea Tree Oil of Australia, the MIC value of Tea Tree oil against P. acnes was 0.05% and 0.5% against aerobic bacteria. This study showed that Tea Tree Oil has antibacterial effect against bacteria which induce acne. Tea Tree Oil had better antibacterial effect against P. acnes compared to aerobic bacteria. It is promising to develop a nature-based functional material for makeup product, which can cure and prevent acne.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.427-432
• /
• 1998

When an undirected tree T and a vertex ${\gamma}$ in the tree are given the problem to transform T into a rooted tree with ${\gamma}$ as its root is considered. Using Euler tour and prefix sum an optimal algorithm has been developed [2,3]. We will present another parallel algorithm which is optimal also on EREW PRAM. Our approach resuces the given tree step by step by pruning and pointer jumping. That is the tree structure is retained during algorithm processing such that than other tree computations can be carried out in parallel.

• ETRI Journal
• /
• v.43 no.6
• /
• pp.1024-1037
• /
• 2021

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+algorithms.