• Korean Journal of Plant Resources
• /
• v.16 no.1
• /
• pp.49-54
• /
• 2003

Effects of cutting time and scions section on shooting and plantlets growth characteristics were investigated to increase plantlets products by root cuttings in lacquer tree. Shoot induction from scion section was developed lately as it planted in earlier season. However, shooting rates were over 84% or more in cut planting on 15, 25 March and 5 April than sinee 15 April. Shoots were developed evenly as late cut planting. Generally, plant height, branch number, leaf number, stem diameter, and leaf area per plantlets was excellent in cut planting on 25 March and 5 April. Shooting rate from the root scion varied greatly by root sectionings. The rate of the 10 cm-long-scion was reached 84％, whereas only 54％ in no trimmed root scion after 10 weeks of cutting. Regenerated plantlets from root scion without cut were slightly good in shape, but their height, number of branch per plantlets, and stem diameter were not significant.

• Korean Journal of Environmental Agriculture
• /
• v.17 no.4
• /
• pp.358-361
• /
• 1998

This study was carried out to develop a short term hardening method of tree seedlings of Rhus chinensis Mill., Evodia daniellii Hemsley and Parthenocissus tricuspidata(Sieb. et Zucc.) Planck for afforestation on a concave and a crack of cut-rock slope. The seedlings were grown in a cylinder shaped pot made of polyvinyl net with the soil media of peatmoss, vermiculite, clay, compost, fertilizer, and absorbant(40:25:19:15:1:0.1, v:v). They were cultivated in a greenhouse for four months and in field condition for two months. During the last three months of the growing period the seedlings were hardened by periodic desiccation and irrigation in 4 to 10 days interval. The hardened seedlings showed lower leaf water potential, higher leaf osmotic pressure, and lower T/R ratio than those before the hardening. The hardened seedlings survived well on the soil medium in the concave of cut-rock slope.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.233-241
• /
• 2014

This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

• The Journal of the Korea Contents Association
• /
• v.7 no.10
• /
• pp.19-26
• /
• 2007

Since collaborative filtering has used the nearest-neighborhood method based on item preference it cannot only reflect exact contents but also has the problem of sparsity and scalability. The item-based collaborative filtering has been practically used improve these problems. However it still does not reflect attributes of the item. In this paper, we propose the method of associative group using the FP-Tree to solve the problem of existing recommendation system. The proposed makes frequent item and creates association rule by using FP-Tree without occurrence of candidate set. We made the efficient item group using $\alpha-cut$ according to the confidence of the association rule. To estimate the performance, the suggested method is compared with Gibbs Sampling, Expectation Maximization, and K-means in the MovieLens dataset.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.393-393
• /
• 2000

FTA(Fault Tree Analysis) is a safety analysis method that focuses on one particular accident or main system failure and provides a method of determining causes of that event. While most of the statistical and cut set analysis have been automated, actual construction of the fault-tree is usually done manually. Manual construction of the fault-tree is extremely time consuming and it requires high level of expertise and experience. In addition to the time involved, different analyst often produces different fault-trees either by incorrect logic or omission of certain events. Automatic fault-tree construction system can be efficient in solving above problems. This study presents a new Digraph-FT conversion algorithm that leads automatic FTA system.

• Journal of Korean Society of Forest Science
• /
• v.102 no.2
• /
• pp.229-238
• /
• 2013

This study was conducted to analyze on the operational cost of logging operations in the whole-tree logging operation system by tower-yarder and swing-yarder, and in the cut-to-length logging operation system by excavator with grapple in order to spread efficient logging operation technique and to establish the logging operation system. In the results of the analysis of operation cost, in case of the whole-tree logging operation system, the operation cost was 2,099 won/$m^3$ in felling by chain saw, 28,286 won/$m^3$ in yarding by tower-yarder, 18,265 won/$m^3$ in yarding by swing-yarder, 18,939 won/$m^3$ in bucking by excavator with grapple and chain saw, 20,484 won/$m^3$ in forwarding and accumulation by wheel type mini-forwarder, 12,701 won/$m^3$ in forwarding and accumulation by excavator with grapple and small forwarding vehicle. In case of the cut-to-length logging operation system, the operation cost was 10,160 won/$m^3$ in felling and bucking by chain saw, 7,567 won/$m^3$ in cut-to-length extraction by excavator with grapple, 6,982 won/$m^3$ in branches and leaves extraction by excavator with grapple, 3,040 won/$m^3$ in the operation road construction by excavator with grapple, 20,484 won/$m^3$ in forwarding and accumulation by wheel type mini-forwarder, 12,701 won/$m^3$ in forwarding and accumulation by excavator with grapple and small forwarding vehicle.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.25-32
• /
• 1990

This paper presents an approximate algorithm for computing Fault-tree probabilities. The method is essentially composed of three steps. In the first step, a Fault-tree is converted into a network form. In the second step, We change the network into a parallelized diagram. In the third step, the approximate fault-tree probability is calculated from the parallelized diagram. In this paper, in order to verify the method two hypothetical Fault-tree is used by examples. The results show that the method is very useful, even though it is an approximate technique, since it needs not to search the minimal cut sets and has the simple computing rontines.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.1
• /
• pp.35-43
• /
• 1996

A computer program for automatic deriving the symbolic equations of motion for robots using the programming language MATHEMATICA has been developed. The program, developed based on the Lagrange formalism, is applicable to the closed chain robots as well as the open chain robots. The closed chains are virtually cut open, and the kinematics and dynamics of the virtual open chain robot are analyzed. The constraints are applied to the virtually cut joints. As a result, the spatial closed chain robot can be considered as a tree structured open chain robot with kinematic constraints. The topology of tree structured open chain robot is described by a FATHER array. The FATHER array of a link indicates the link that is connected in the direction of base link. The constraints are represented by Lagrange multipliers. The parallel robot, DELTA, having three-dimensional closed chains is modeled and simulated to illustrate the approach.

• Nuclear Engineering and Technology
• /
• v.54 no.12
• /
• pp.4560-4570
• /
• 2022

Dynamic fault tree (DFT) and its related research methods have received extensive attention in safety analysis and reliability engineering. DFT can perform reliability modelling for systems with sequential correlation, resource sharing, and cold and hot spare parts. A technical modelling method of DFT is proposed for modelling ship collision accidents and loss-of-coolant accidents (LOCAs). Qualitative and quantitative analyses of DFT were carried out using the cutting sequence (CS)/extended cutting sequence (ECS) method. The results show nine types of dynamic fault failure modes in ship collision accidents, describing the fault propagation process of a dynamic system and reflect the dynamic changes of the entire accident system. The probability of a ship collision accident is 2.378 × 10^-9 by using CS. This failure mode cannot be expressed by a combination of basic events within the same event frame after an LOCA occurs in a marine nuclear reactor because the system contains warm spare parts. Therefore, the probability of losing reactor control was calculated as 8.125 × 10^-6 using the ECS. Compared with CS, ECS is more efficient considering expression and processing capabilities, and has a significant advantage considering cost.