• 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.

• 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.

• Korean Journal of Environment and Ecology
• /
• v.35 no.4
• /
• pp.398-407
• /
• 2021

This study intended to identify causes of poor tree vigor in the Hanbando coastal forest by investigating its geographical environment, climate condition, soil physicochemical characteristics, and growth condition of Pinus thunbergii. It divided the forest into an area with poor tree vigor or dead standing trees and a control area with good tree vigor and examined them separately. The survey showed that stand density was significantly higher in the area with poor tree vigor. In contrast, the crown width in the area with good tree vigor was wider. The number of dead standing trees and the stand density showed a negative correlation. The stand density and diameter at breast height (DBH), tree height, crown height, and crown width also showed a negative correlation. The result indicated that, as the tree's stand density increases, the crowns of individual trees overlapped and the lower branches died. Then crown height and crown width decreased, and the number of leaves and photosynthesis was reduced, leading to lower tree height and weaker growth of breast diameter. As a result, tree vigor weakened, and combined with environmental pressures from the lack of moisture and nutrients in coastal soil and salty wind, P. thunbergii in coastal areas is expected to die massively. Although the causes of dead standing trees and poor tree vigor of P. thunbergii in the Hanbando coastal forest are complicated, poor management of adequate tree density in response to the growth of P. thunbergii is the primary cause. The secondary cause is external environmental pressures, including unfavorable soil conditions and salty and strong wind that obstruct the growth of P. thunbergii.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.15-25
• /
• 2000

In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.4
• /
• pp.338-343
• /
• 2015

We suggest a method to configure feature functions of continuous conditional random field (C-CRF). Regression tree and similarity analysis are introduced to construct the first and second feature functions of C-CRF, respectively. Rules from the regression tree are transformed to logic functions. If a logic in the set of rules is true for a data then it returns the corresponding value of leaf node and zero, otherwise. We build an Euclidean similarity matrix to define neighborhood, which constitute the second feature function. Using two feature functions, we make a C-CRF model and an illustrate example is provided.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.123-128
• /
• 2004

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between facilities and total rectangular layout area where all facilities and dead spaces are enclosed. Using the genetic code corresponding to two kinds of information, facility sequence and branching positions in the tree structure model, a genetic algorithm has been applied for finding non-dominated solutions in the two-objective layout problem. We use three kinds of crossover (PMX, OX, CX) for the former part of the chromosome and one-point crossover for the latter part. Two kinds of layout problems have been tested by the proposed method. The results demonstrate that the presented algorithm is able to find good solutions in enough short time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.81-89
• /
• 2000

The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.8-23
• /
• 2008

The purpose of this study is to develop a Cross Impact System Alternatives Tree(CISAT) model necessary for selecting the interdependent R&D planning system alternatives. This model modifies System Alternatives Tree(SAT) model developed by Kwon et al.. The SAT model is composed of several functions necessary for the achievement of a final goal and several subsystems for satisfying each function. In case that the relationship of technology alternatives is interdependent, this model overlooked a relative importance derived from occurrence or nonoccurrence of the technology alternatives in the future time varience. However, a complex evaluation process within the ballot system is another disadvantage of the SAT. To solve such problems, the Cross Impact Analysis(CIA) model is applied in the SAT model so as to consider the cross impact among interdependent system alternatives.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.1-22
• /
• 1990

This susrvey is on modelling of various network design problems with tree configuration, which have a wide variety of practical applications, particularly in communication, which have a wide a variety of practical applications, particularly in communication and transportation network planning. Models which can be classified as either minimum spanning tree of Steiner tree, are investigated. Various important variants of each basic model are then classified according to model structurs. In addition to the calssification, the typical solution method for each problem is briefly sketched, along with some remarks on further research issues.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.65-76
• /
• 2009

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.