• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1990.10a
• /
• pp.1-16
• /
• 1990

In this paper, a system to measure treeing degradation phenomena in organic insulating materials, using an image sensor, is discussed. Using an image processing technique, tree features immediately after tree initiation as well as changes in the configuration of the tree were measured. which up to now have been extremely difficult to observe by conventional visual methods. As a result, it was possible to record the image of tree propagation immediately after its first appearance, and to describe the specific characteristics of tree growth in terms of the length, the degraded area and the sequential images.

• Journal of The Korean Astronomical Society
• /
• v.27 no.1
• /
• pp.13-29
• /
• 1994

We have constructed a 3-dim hydrodynamics code called BTSPH. The fluid dynamics part of the code is based on the smoothed particle hydrodynamics (SPH), and for its Poisson solver the binary tree (BT) scheme is employed. We let the smoothing length in the SPH algorithm vary with space and time, so that resolution of the calculation is considerably enhanced over the version of SPH with fixed smoothing length. The binary tree scheme calculates the gravitational force at a point by collecting the monopole forces from neighboring particles and the multipole forces from aggregates of distant particles. The BTSPH is free from geometric constraints, does not rely on grids, and needs arrays of moderate size. With the code we have run the following set of test calculations: one-dim shock tube, adiabatic collapse of an isothermal cloud, small oscillation of an equilibrium polytrope of index 3/2, and tidal encounter of the polytrope and a point mass perturber. Results of the tests confirmed the code performance.

• The Proceedings of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.8 no.1
• /
• pp.57-62
• /
• 1994

In this paper, a system for measuring of treeing degradation in organic dielectric material by using image processing technics, is discussed. Traditionally, treeing is measured by visual method. It made difficulty to understanding for features and changes in the configlEation of the tree growth. Using image processing system, it is made to describe the characters of the tree growth, specially length of tree and area of treeing degradation. From this image processing and visual measurement, the similar results were made, an automatic measurement system was made for configuration of the tree growth.

• Journal of Forest and Environmental Science
• /
• v.33 no.2
• /
• pp.147-153
• /
• 2017

The purpose of this study was to examine productivity and cost of tree-length harvesting using cable yarding system in a larch (Larix leptolepis) clear-cutting stand located in Pyeongchang-gun, Gangwon-do. We used tree-length harvesting method using cable yarding system with a tower yarder HAM300. The productivity was $17.6m^3/hr$ for felling, $12.4m^3/hr$ for delimbing, $4.2m^3/hr$ for yarding, and $8.1m^3/hr$ for processing. The total cost of the harvesting system was $48,381won/m^3$, which was majorly composed of yarding operation cost, at $40,169won/m^3$ (79.3%), while felling had the lowest cost at $1,154won/m^3$ (4.1%). Major factors affecting felling and processing productivity was tree volume and the number and thickness of branches for delimbing productivity. In addition, we suggest that training and education for machine operators were critical to improve yarding productivity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.9
• /
• pp.1395-1403
• /
• 1993

Protocol conformance is crucial to inter-operability and cost effective computer communication. Given a protocol specification, the task of checking whether an inplementation conforms to the specification is called conformance testing. The efficiency and fault coverage of conformance testing are largely dependent on how test cases are chosen. Some states may have more one UIO sequence when the protocol is represented by FSM (Finite State Machine). The length of test sequence can be minimized if the optimal test sequences are chosen. In this paper, we construct the depth-tree to find the maximum overlapping among the test sequence. By using the resulting depth-tree, we generate the minimum-length test sequence. We show the example of the minimum-length test sequence obtained by using the resulting depth-tree.

• Journal of agriculture & life science
• /
• v.45 no.5
• /
• pp.1-8
• /
• 2011

In this study, 160 tea tree (Camellia sinensis L.) lines were classified by caffeine content using colorimetric methods. Among them, caffeine-rich lines (HR-78, HR-137, HR-82 and HR-123) and poor lines (HP-85, HP-88, HP-19, and HP-131) were selected. To know the difference in morphological and genetic characters between caffeine-rich and poor lines, we used leaf/shoot growth and RAPD methods. Cluster pattern of morphological characters (leaf width, leaf length, leaf area and shoot length) showed that shoot length was longer in caffein-rich lines than in -poor lines. In genetic analysis, amplified DNA bands having various sizes were detected in RAPD analysis where 30 random primers were used. However, the discriminated primer set that distinguish caffein-rich tree line from -poor lines was not found. These results can be used as the basic data to determine the morphological and genetic differences among caffein-rich and -poor lines.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.87-95
• /
• 2012

In this paper, PTAS three-dimensional Steiner minimum tree connecting numerous input nodes rapidly in 3D space is proposed. Steiner minimum tree problem belongs to NP problem domain, and when properly devised heuristic introduces, it is generally superior to other algorithms as minimum spanning tree affiliated with P problem domain. But when the number of input nodes is very large, the problem requires excessive execution time. In this paper, a method using PTAS is proposed to solve the difficulty. In experiments for 70,000 input nodes in 3D space, the tree produced by the proposed 8 space partitioned PTAS method reduced 86.88% execution time, compared with the tree by naive 3D steiner minimum tree method, though increased 0.81% tree length. This affirms the proposed method can work well for applications that many nodes of three dimensions are need to connect swifty, enduring slight increase of tree length.

• Korean Journal of Environmental Agriculture
• /
• v.42 no.4
• /
• pp.297-310
• /
• 2023

M.7 rootstock is moderately resistant to fire blight. However, M.7 is generally too vigorous for high-density apple systems, but it can be grafted onto cultivars that exhibit weak tree growth, such as 'Sansa'. This study investigated the vegetative growth, yield, and fruit quality of 'Sansa' apple trees grafted on M.7 or M.9 rootstocks to assess the feasibility of establishing domestic high-density apple systems using M.7 and to determine the optimum exposure length for rootstocks. Trees were planted with exposed rootstock lengths of 5, 10, and 15 cm. The vegetative growth of apple trees grafted onto M.7 was greater than that of M.9 and vegetative growth tended to decrease as the exposed length of rootstock increased. However, the differences in yield per tree, average weights, soluble solids contents, and titratable acidity due to the rootstock and its exposure length varied. The accumulated yield over a 10 year period and the yield efficiency of M.7 were lower than that of M.9 and the yield efficiency tended to decrease as the exposed length of rootstock increased. When apple trees were grafted onto M.9, biennial bearing and tree vigor weakening occurred if the exposed length of the rootstock was over 10 cm. Conversely, when apple trees were grafted onto M.7, vegetative growth was excessive if the exposed length of rootstock was below 10 cm. Based on the results from this study, the optimum M.7 and M.9 exposure lengths for 'Sansa' were 15 cm and 5 cm, respectively.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.5
• /
• pp.25-34
• /
• 2010

By introducing additional nodes called Steiner points, the problem of Steiner Minimum Tree whose length can be shorter than Minimum Spanning Tree and which connects all input terminal nodes belongs to Non-Polynomial Complete domain. Though diverse heuristic methods can be applied to the problem, most of them may meet serious pains in computing and waiting for a solution of the problem with numerous input nodes. For numerous input nodes, an efficient PTAS approximation method producing candidate unit steiner trees with portals in most bottom layer, merging them hierarchically to construct their parent steiner trees in upper layer and building swiftly final approximation Steiner tree in most top layer is suggested in this paper. The experiment with 16,000 input nodes and designed 16 unit areas in most bottom layer shows 85.4% execution time improvement in serial processing and 98.9% in parallel processing comparing with pure Steiner heuristic method, though 0.24% overhead of tree length. Therefore, the suggested PTAS Steiner tree method can have a wide range applications to build a large scale approximation Steiner tree quickly.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.213-220
• /
• 2010

In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.