• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.77-93
• /
• 1998

It is discussed how to locate idle vehicles of AGVS on unidirectional guide paths. The problem is modeled as a median location problem on a cyclic network. The characteristics of the optimal location are analyzed and some useful properties are suggested to reduce the solution space. Based on the properties found, several special types of networks - a pure single-loop type, the loop type with a single branching intersection and the loop type with local branching node - are also analyzed as well as the general cyclic network. In each case of the networks, a solution procedure is suggested. Some numerical examples are provided to illustrate the algorithms developed.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.830-833
• /
• 2005

SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

• Asian Journal of Turfgrass Science
• /
• v.1 no.1
• /
• pp.42-48
• /
• 1987

This study was carried out to elucidate the physiological and ecological mechamism of the branch pattern and electronmicroscopic structure of photosynthetic organs in Zoysia japonica Steud. The angles between the internodes of rhizome and the branches of Z.iaponica were changed from 0 to 52 degrees. The rhizomes tended to branch from the 3th node to the 10th node. When the terminal bud was damaged by various environmental factors, the initial branching formation was appeared immediately to the 4th node. The internode growth of the rhizome started from the beginning of April and continued to the end of Octobor. It became evident that there is a division labor between two different kinds of photosynthetic cells of mesophyll and bundle sheath tissues in Z.japonica The thick-walled bundle sheath cells surrounds the leaf vascular bundles as the Kranz type and separates them from the mesophyll cells.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.1-19
• /
• 1994

A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.

• Journal of English Language & Literature
• /
• v.56 no.6
• /
• pp.1191-1210
• /
• 2010

This article claims that English liquid consonants are characterized by the presence of complex place nodes, regardless of dialectal varieties. The primary difference between rhotic and laterals can be pursued in a phonological sense. The level of subbranching nodes is in charge of the disparities among two types of liquids: the branching immediately below the Coronal node with laterals, while branching at the secondary sublevel with rhotics. In this context, the processes of rhotic deletion and lateral vocalization can be understood as those motivated to get rid of complex place nodes. That is, those processes take place as part of phonological attrition. Next, the onset/coda asymmetry regarding liquids stems from the dispreference of vocoid at the onset position, which is readily accounted for by the series of constraints on the well-formedness on the onset, namely Harmonic Onset. The rationale of gradualness and harmonic improvement proposed by Harmonic Serialism is useful to separate the attested outputs from unattested ones across the whole gamut of English varieties. All in all, the primary benefits of our analysis can be found in the consistence in the explanation for the operations running through the sounds regarded as belonging to liquid consonants, comprising the whole range of rhotic and lateral consonants.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.86-102
• /
• 1991

The purpose of this paper is to present a branch and bound algorithm for the hierarchical transportation network design problem in 2-level directed networks. This problem is to find the least cost of hierarchical transportation networks which consist of a primary path and a secondary path. The primary path is a simple path from a prespecified orgin node to a prespecified terminal node. All nodes must be either a transsipment node on the primary path or connected to that path via secondary arcs. This problem is formulated to a 0-1 inter programming problem with assignment and illegal subtour elimination equations as constaints. We show that the subproblem relaxing subtour elimination constraints is transformed to a linear programming problem by means of the totally unimodularity. Optimal solutions of this subproblem are polynoially obtained by the assignment algorithm and complementary slackness conditions. Therefore, the optimal value of this subproblme is used as a lower bound. When an optimal solution of the subproblem has an illegal subtour, a better disjoint rule is adopted as the branching strategy for reducing the number of branched problems. The computational comparison between the least bound rule and the depth first rule for the search strategy is given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.

• FLOWER RESEARCH JOURNAL
• /
• v.17 no.1
• /
• pp.15-22
• /
• 2009

This study was conducted to examine characteristics of rhizome growth and flowering of white lotus (Nelumbo nucifera) plant in Muan Hoesan-lake for collecting the basic data on the cultivation and the flowering which is growing in Muan Hoesan-lake of Jeonnam province in Korea. We have planted from the seeds and the enlarged rhizomes of the white lotus which were planted in the plastic containers on April 20 and May 4, 2008, and cultivated under rain shelter condition. Rhizome growth pattern and the flowering characteristics of the white lotus were examined on September 4, 2008. Main rhizomes of the white lotus propagated by the seeds and the enlarged rhizomes were branched by 10% and 15%, respectively. Numbers of nodes in the bloomed and non-bloomed rhizomes of the white lotus were over 14 and below 11, respectively. Flower was not observed in the white lotus when propagated with seeds, however, flowers came out up to 80% by the enlarged rhizomes. First flowers were bloomed from the late July and to the early August, and the number of flowers were 4.0~4.4. The first flower stalks without branching of the main rhizome were emerged in 8.8th node, however, that with branching were 8.0th node. Time to flowering from the emergence of flower stalk on the above-ground parts were required 16 days. White flowers from the lotus were 15.3 cm in height and 28.2 cm in width, their longevity was 3.3 days and the averaged flower fresh weight was 29.2 g. The results conclude that optimum number of nodes on the main rhizomes for blooming the white lotus flowers should be over 8 nodes before the rhizome enlargement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.598-607
• /
• 2005

We propose a new external-memory index data structure, the Suffix B-tree. The Suffix B-tree is a B-tree in which the key is a string like the String B-tree. While the node in the String B-tree is implemented with a Patricia trio, the node in the Suffix B-tree is implemented with an array. So the Suffix B-tree is simpler and easier to be Implemented than the String B-tree. Nevertheless, the branching algorithm of the Suffix B-tree is as efficient as that of the String B-tree. Consequently, the Suffix B-tree takes the same worst-case disk accesses as the String B-tree to solve the string matching problem, which is fundamental and important in the area of string algorithms.

• Plant Biotechnology Reports
• /
• v.2 no.1
• /
• pp.21-31
• /
• 2008

In plants, the oxygen generated by photosynthesis can be excited to form reactive oxygen species (ROS) under excessive sunlight. Excess ROS including singlet oxygen ($^1O_2$) inhibit the growth, development and photosynthesis of plants. To isolate ROS-resistant crop plants, we used paraquat (PQ), a generator of $O_2{^-}$ as a source of screening and mutagen, and obtained two PQ-resistant lines in Pisum sativum, namely R3-1 and R3-2. Both lines showed greater resistance to PQ than their wild type (WT) siblings with respect to germination, root growth, and shoot growth. Biochemical analysis showed differences in these lines, in which ROS-scavenging enzymes undergo changes with a distinguishable increase in Mn-SOD. We further observed that the cytosolic catalases (CATs) in leaves in both lines were shifted in a native-PAGE analysis compared with that of the WT, indicating that the release of bound $^1O_2$ was enhanced. Phenotypic analysis revealed distinguishable differences in leaf development, and in flowering time and position. In addition, R3-1 and R3-2 showed shorter individual inter-node lengths, dwarf plant height, and stronger branching compared with the WT. These results suggested that PQ-induced ROS-resistant Pisum have the potential pleiotropic effects on flowering time and stem branching, and that ROS including $^1O_2$ plays not only important roles in plant growth and development as a signal transducer, but also appears as a strong inhibitor for crop yield.