• Journal of information and communication convergence engineering
• /
• v.17 no.4
• /
• pp.279-284
• /
• 2019

This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.

• Asian Journal of Turfgrass Science
• /
• v.3 no.2
• /
• pp.73-76
• /
• 1989

To establish a lawn Zoysia japonica Steud with seeds a win of experiments were conducted for the investigation of seedling root system. The results m summarized m follows; Zoysia japonica and maize elongated mesocotyle in germinating stage. but rye and barley did not. The mesocotyle of Z. japonica seed pushed the elongating coleoptile up throngh the soil, hence could emerge from more deeply planted. The crown roots of Z japonica originated from the coleoptile node. The crown roots of barley originated from the first foliage led node.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.131-140
• /
• 2014

In this paper, we present an efficient implementation of Kruskal's algorithm to obtain a minimum spanning tree. The proposed method utilizes the union-find data structure, reducing the depth of the tree of the node set by making the nodes in the path to root be the child node of the root of combined tree. This method can reduce the depth of the tree by shortening the path to the root and lowering the level of the node. This is an efficient method because if the tree's depth reduces, it could shorten the time of finding the root of the tree to which the node belongs. The performance of the proposed method is evaluated through the graphs generated randomly. The results showed that the proposed method outperformed the conventional method in terms of the depth of the tree.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.2E
• /
• pp.43-49
• /
• 1995

In this paper a space search technique is used to detect and locate the faults of the circuit interconnections. The circuit interconnections are represented by the tree structure and the tree space is searched to detect and locate the open faults of the circuit interconnections. The breadth search is used to detect the open faults and reduce the space size. The depth search is used to locate the open faults.

• Journal of Plant Biology
• /
• v.35 no.4
• /
• pp.359-364
• /
• 1992

The vascular cambium in Ginkgo biloba seedling began to differentiate in the cotyledonary node, and then the differentiation proceeded bidirectionally from the cotyledonary node toward the stem and root. In tangential view, procambium at the early developmental stage was a homogeneous structure consisted of almost similar cells in shape, and at the later stage the procambium became a heterogeneous one consisted of long cells and short cells. Such a differentiation pattern in the cotyledonary node was similar to that in the stem. However, it was different from that in the root. Fusiform initials and ray initials consisting the vascular cambium were originated from the long cells and the short cells, respectively. The long cells and the fusiform initials in the cotyledonary node were shorter and wider than those in the first internode.ernode.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.12
• /
• pp.3159-3174
• /
• 1994

A simple octree encoding algorithm based on a tetrahedron root has been developed to be used for fully automatic generation of three dimensional finite element meshes. This algorithm starts octree decomposition from a tetrahedron root node instead of a hexahedron root node so that the terminal mode has the same topology as the final tetrahedral mesh. As a result, the terminal octant can be used as a tetrahedral finite element without transforming its topology. In this part(I) of the thesis, an efficient algorithm for the tetrahedron-based octree is proposed. For this development, the following problems have been solved, : (1) an efficient data structure for storing the octree and finite elements, (2) an encoding scheme of a tetrahedral octree, (3) a neighbor finding technique for the tetrahedron-based octree.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.7
• /
• pp.498-509
• /
• 1988

A BF(breadth-first) linear quadtree as a new data structure for image data is suggested, which enables us to compress the image data efficiently and to make operations of the compressed data easily. It is a list of path names for black nodes as the linear quadtree is. The path name for each black node of a BF linear quadtree is represented as a sequence of path codes from the root node to itself, whereas that of linear quadtree as a sequence of path codes from the root node to itself and fill characters for cut-offed path from it to any n-level node which corresponds to a pixel of an image. The BF linear quadtree provides a more efficent compression ratio than the linear quadtree does, because the former does not require redundant characters, fill characters, for the cut-offed paths. Several operations for image processing can be also implemented on this hierarchical structure efficiently, because it is composed of only the black nodes ad the linear quadtree is . In this paper, algorithms for several operations on the BF linear quadtree are defined and analyzed. Experimental results for forur image data are also given and discussed.

• Korean Journal of Plant Resources
• /
• v.21 no.3
• /
• pp.184-191
• /
• 2008

This experiments were carried out to find out the effects of different explant materials, kinds and concentration of plant growth regulators, and total nitrogen and sucrose contents on the in vitro regeneration of Abeliophyllum distichum Nakai. The effects of growth regulators on regeneration from 3 explant sources (leaf, internode and node) were more or less same. Leaf explants produced only callus with 2ip (Isopentenyladenine) and NAA (Naphthaleneacetic acid) treatment and other regulators had no effects. Test with internode explants yielded about same results but callus was obtained with 2,4-D (2,4-Dichlorophenoxyacetic acid). Node explants resulted in shoot regeneration by all regulator treatment except NAA and 2,4-D, but control also showed similar results. Callus formation from internode and node explants was vigorous by 2ip, zeatin, and 2,4-D treatments and high NAA concentration resulted in higher callus formation. In this experiment, various mixed treatment of growth regulators were also employed, using node as explant material. Shoot regeneration was obtained with BA (Benzyl adenine) + NAA treatments but the results were comparable with control. Generally shoot and root regeneration was poor with all combined treatment except 2ip + NAA and 2,4-D + NAA. However, callus was formed readily with all treatments. In this experiment, combined treatments of regulators were applied on the callus derived from singular regulator treatment. The results showed no shoot and root regeneration with any combination of 2,4-D, IAA (Indoleacetic acid) and NAA, but soft milky white callus was formed in all the treatments. No shoot and root regeneration was observed with any combination of 2iP, NAA and IAA, but somewhat hard, light green callus was formed in all the treatments. Callus formation decreased with high kinetin concentration in case of kinetin + NAA treatment. The experiments with total nitrogen content of media showed that low concentrations of 15 and 30mM were effective for the shoot and root regeneration. Sucrose experiment demonstrated shoot regeneration with 1${\sim}$4% concentration, and root and callus formation with 2${\sim}$4%. No root and callus formation was observed with 0 and 1% sucrose.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.1
• /
• pp.39-45
• /
• 2014

This paper proposes an architecture of a sensor network for gathering data under a powerful beam cluster tree architecture. This architecture is used when there is a need to gather data from sensor node where there is no sink node connected to an existing network, or it is required to get a series of data specific to an event or time. The transmit distance of the beam signal is longer than that of the usual sensor node. The nodes of the network make a tree network when receiving a beam message transmitting from the powerful root node. All sensor nodes in a sink tree network synchronize to the superframe and know exactly the sequence value of the current superframe. When there is data to send to the sink node, the sensor node sends data at the corresponding allocated channel. Data sending schemes under the guaranteed time slot are tested and the delay and jitter performance is explained.