• Journal of Bio-Environment Control
• /
• v.15 no.2
• /
• pp.173-176
• /
• 2006

The relationship between source leaf position and photo-assimilate translocation and distribution was characterized for tomato (Lycopersicon esculentum Mill) grown in the greenhouse. Three different positions of source leaf on the stem (first node above or below the first fruit cluster and $5^{th}$ node above the first fruit cluster) were tested for their influence on $^{14}CO_2$ assimilation and transfer to different parts of the plant. The leaves at the $5^{th}$ node above the first fruit cluster transferred the highest (57%) proportion of $C^{14}$ to other plant parts, followed by leaves home on the first node below the first fruit cluster (50%), and the first node above the first fruit cluster (39%). In all treatments, fruits served as the strongest sink for $C^{14}$, followed by stem, leaf, and root tissues. The leaf home on the $5^{th}$ node above the first fruit cluster transferred the largest amount of $C^{14}$ to the second fruit cluster.

• Journal of Plant Biology
• /
• v.36 no.1
• /
• pp.29-34
• /
• 1993

Observation was made on early ontogeny of vascular cambium in the cotyledonary node of Pinus koraiensis seedling in order to clarify the cambial ontogeny of the node which was hardly elongated. In transverse view, the derivatives by the early periclinal divisions at the outer region of the procambial strands differentiated to protophloem with establishing a certain degree of radial seriations. Later, some cells in the central region of the procambial strands begin divide periclinally, eventually the cells, differentiate gradually to the vascular cambium. In tangential view, early procambium is consisted of homogeneous short cells with transverse end walls which are tansformed into the long cells and short cells gradually. The long cells continue intrusive growth and the short cells repeat transverse division. Finally, the long and short cells differentiated to cambial fusiform initials and ray initials respectively. In tangential section, the differentiation pattern of cambial initials resembles that of the stem of Ginkgo biloba. But in transverse view, the characteristics in the origin of vascular cambium of the cotyledonary node resembles that of root. The vascular cambium in cotyledonary node is completed after eleven prophylls were formed.

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

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.394-400
• /
• 2002

Networks of Workstations(NOWs), that has features of flexibility and scalability, recently has emerged as an inexpensive alternative to massively parallel multicomputers. However it is not easier to perform deadlock-free multicast than regular topologies like mash or hypercube. Single phase differential multicast(SPDM) is a modified multicast algorithm with less burden of the root node. By applying quality of serviece(QoS), a specific node can have differentiated service and artificial change of message flow pattern is also available. As the results of performance evaluation experiments, SPDM has lower latency and lower packet concentration rate of the root node than the case of SPAM, and has ability to control network load distribution among switch nodes by controlling the assignment rate among nodes.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.202-210
• /
• 1995

Given a tree T with a root node 0 having the capacity H and a profit $c_{v}$ and a demand $d_{v}$ on each node v of T, the capacitated subtree of a tree problem(CSTP) is to find a subtree of T containing the root that has the maximum total profit, the sum of profits over the subtree, and also satisfies the constraint of which the sum of demands over the subtree must be less than or equal to H. We first define the so-called critical item for CSTP and find an upper bound on the linear programming relaxation of CSTP. We then present our branch and bound algorithm for solving CSTP and finally report the computational results on a set of randomly generated test problems.s.s.

• Journal of Bio-Environment Control
• /
• v.17 no.4
• /
• pp.252-260
• /
• 2008

This study was conducted to observe the characteristics of mineral nutrient uptake of single-node cutting rose 'Versilla' and to determine optimal nutrient solution control method for soilless culture of 'Versilla' in a closed hydroponic system. Nutrient solution was managed by five different control methods: macro- and micro-element control in aeroponic system (M&M), macroelement control in aeroponic system (M), nutrient solution supplement in aeroponic system (S); electrical conductivity (EC) control in aeroponic system(EC-A); EC control in deep flow technique system(EC-D). The concentration of $NO_3$-N exceeds optimal range whereas P and Mg decreased at the later stage of plant growth with the EC control method, EC-A and EC-D. The overall mineral nutrient content increased with S. On the other hand the nutrient content at the root environment was maintained optimal with M&M and M. The nutrient solution control methods had significantly effect on the cut-flower quality. In the M&M and M, flower length, fresh weight and root activity were higher than those with the other mineral nutrients control methods. The maximal efficiency of photochemistry (Fv/Fm) was higher for M&M, M and S than that with EC-A and EC-D. Based on the above results, it is highly recommended to control nutrient solution by mineral nutrient control methods (M&M and M) in a closed hydroponic system for single-node cutting rose, 'Versillia'.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.406-412
• /
• 2001

IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.3
• /
• pp.206-210
• /
• 2009

In this paper, we propose a new routing scheme based on multi-path routing which provides uniform energy consumption for all nodes. This scheme adds a new type of root node for constructing multi-path. The sink node delegates some partial roles to these root nodes. Such root nodes carry out path establishment independently. As a result, each nodes consume energy more uniformly and the network life-time will be extended. Through simulation, we confirmed that energy consumption of the whole network is scattered and the network life-time is extended. Moreover, we show that the proposed routing scheme improves the performance of network compared to previous routing strategies as the number of source nodes increases.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.133-140
• /
• 2008

This paper proposes an effective k-D tree traversal algorithm for ray tracing on a GPU. The previous k-D tree traverse algorithm based on GPU uses bottom-up searching from a leaf to the root after failing to find the ray intersected primitive in the leaf node. During the bottom-up search the algorithm decides the current node is visited or not from the parent node. In such a way, we need to visit the parent node which was already visited and the duplicated bounding box intersection tests. The new k-D tree traverse algorithm reduces the brother and parent duplicated visit by using an efficient method which decides whether the brother node is already visited or not during the bottom-up search. Also the algorithm take place bounding box intersection tests only for the nodes which is not yet done. As a result our experiment shows the new algorithm is about 30% faster than the previous.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.970-976
• /
• 2001

In this paper, OUIG IDL CFE, provided by Sunsoft, is used to take a IDL definitions as inputs and parse those. OmniORB3 is introduced to support functionality of the ORB. Suns CFE produce AST after parsing inputs. Actually, the node of AST Is instances of classes which are derived from CFE classes. As the compiler back end visit the node of the AST using iterator class, UTL_ScopeActiveIterator, it dumps codes of output. During processing, two files are generated. Routines of generating code are invoked by BE_produce.cc and codes are produced while visiting root of AST, idl_global->root(). The dump* functions which dump codes is called according to the type of node. In this paper, Mapping C++ of IDL definition is experimented and results In the same as that of omniidl which is provided by omniORB3. The code of results behavior correctly on omniORB3. In the future, we are interested in optimizing the performance of marshalling code via IDL compiler.