• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.515-518
• /
• 2005

LiDAR(Light Detection and Ranging) with digital aerial photograph can be used to measure tree growth factors like total height, height of clear-length, dbh(diameter at breast height) and crown projection area. Delineating crown is an important process for identifying and numbering individual trees. Crown delineation can be done by watershed method to segment basin according to elevation values of DSMmax produced by LiDAR. Digital aerial photograph can be used to validate the crown projection area using LiDAR. And tree height can be acquired by image processing using window filter$(3cell\times3cell\;or\;5cell\times5cell)$ that compares grid elevation values of individual crown segmented by watershed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.103-114
• /
• 2008

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.312-315
• /
• 2006

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like internet broadcasting are provided by overlay multicast technology due to the complex nature of IP multicast and the high cost to support multicast function. Since multicast members can dynamically join or leave their multicast group, it is necessary to keep a reliable overlay multicast tree to support real time service without delay. In this paper, we consider path level reliability that connects each member node. The problem is formulated as a binary integer programming which maximizes the reliability of multicast tree. Tabu search based algorithm is presented to solve the NP-hard problem.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.1-8
• /
• 1997

A wide class of networking application services, such as video teleconferencing, VOD, LAN bridging, and distributed data processing require multipoint communications. The essential component inteh network to achieve this is a multicast packet switch which is capable of packet replication and switching. In this paper, we propose an efficient mukticast addressing scheme using the smallest number of routing bits which is deterministic lower bound. The new scheme performs all point-to-multipoint connection in radix-2 tree ATM switch like banyan network. Also, we provide a simple radix-2 switch block diagram for achieving our algorithm. And we investigate several addressing schemes for implementing multicasting in radix-r tree ATM switch and evaluate several performance factors, such as complexity of the additional header bits, requirement of the internal speedup and complexity of the major hardware.

• Journal of Plant Biology
• /
• v.27 no.2
• /
• pp.51-60
• /
• 1984

Jisimdo is an island where evergreen broadleaved forests are well preserved. Soil environments and forest structures of Jisimdo were investigated, and an actual vegetation map and profile diagrams were drawn out. The natural vegetation of Jisimdo was divided into two stand units, one was evergreen broadleaved forest and the other was Pinus thunbergii forest. 26 species were identified as evergreen broadoeaved trees, and among them, Camellia japonica was the dominont of the tree layer of evergreen broadleaved forest. Profile diagram shows that Camellia japonica, with average height of 7∼8m, formed lower tree layer, and laurels like Cinnamomum japonicum, Machilus thunbergii, and Neolitsea sericea formed upper tree layer. In Pinus thunbergii forest, plants of shrub and herb layers were abundant because of much light penetrated into the forest floor, and these layers were largely composed of evergreen broadleaved trees. This fact shows the possibility of succession from Pinus thunbergii forest into evergreen broadleaved forest. Jisimdo is geographically adjacent to Jangseungpo and Okpo, and this increases the economic value of Jisimdo as a place of public resort. It will be necessary from being destroyed by land development and human interferences.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.324-330
• /
• 2021

Agriculture is one of the essential needs of human life on planet Earth. It is the source of food and earnings for many individuals around the world. The economy of many countries is associated with the agriculture sector. Lots of diseases exist that attack various fruits and crops. Apple Tree Leaves also suffer different types of pathological conditions that affect their production. These pathological conditions include apple scab, cedar apple rust, or multiple diseases, etc. In this paper, an automatic detection framework based on deep learning is investigated for apple leaves disease classification. Different pre-trained models, VGG16, ResNetV2, InceptionV3, and MobileNetV2, are considered for transfer learning. A combination of parameters like learning rate, batch size, and optimizer is analyzed, and the best combination of ResNetV2 with Adam optimizer provided the best classification accuracy of 94%.

• Nuclear Engineering and Technology
• /
• v.54 no.4
• /
• pp.1213-1220
• /
• 2022

The Emergency Diesel Generator (EDG) is a critical and essential part of the Nuclear Power Plant (NPP). Due to past catastrophic disasters, critical systems of NPP like EDG are designed to meet high dependability requirements. Therefore, we propose a framework for the dynamic reliability assessment using the Fault Tree and the Dynamic Bayesian Network. In this framework, the information of the component's failure probability is updated based on observed data. The framework is powerful to perform qualitative as well as quantitative analysis of the system. The validity of the framework is done by applying it on several NPP systems.

• Korean Journal of Plant Resources
• /
• v.36 no.1
• /
• pp.91-99
• /
• 2023

Plus tree selection is the essential first step in a tree improvement program. This study was carried out to select plus trees of black locust (Robinia pseudoacacia L.) for tree improvement in Korea. The candidate plus trees of black locust were selected from twenty-one places in the four provinces (Gangwon, Gyeonggi, Chungcheong and Gyeongsang) following comparison selection. The trees were examined for qualitative and quantitative traits of economic interest like tree height (H), diameter at breast height (DBH), clear bole height (CBH), stem straightness (SS), crown size (CS) and disease resistance. The 64 selected trees showed higher quality in growth characteristics than control trees. Average of height, DBH, CBH, SS and CS were 20.5 m, 31.1 cm, 10.1 m, 1.2 and 5.2 m respectively. In particular, it was shown that the growth characteristics were higher in Chungcheong population. The superiority percentage of selected candidate plus trees of black locust over their respective check trees ranged from 7.3% to 18.9% in height, 20.0% to 40.6% in DBH, 32.8% to 73.5% in CBH, 42.9% to 55.2% in SS and -11.1% to 9.4% in CS, respectively. The selected black locust will be useful in future tree breeding programs based on their clonal and progeny performance.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.79-89
• /
• 2016

In this paper, we proposed the object classification method using genetic and dynamic random forest consisting of optimal combination of unit tree. The random forest can ensure good generalization performance in combination of large amount of trees by assigning the randomization to the training samples and feature selection, etc. allocated to the decision tree as an ensemble classification model which combines with the unit decision tree based on the bagging. However, the random forest is composed of unit trees randomly, so it can show the excellent classification performance only when the sufficient amounts of trees are combined. There is no quantitative measurement method for the number of trees, and there is no choice but to repeat random tree structure continuously. The proposed algorithm is composed of random forest with a combination of optimal tree while maintaining the generalization performance of random forest. To achieve this, the problem of improving the classification performance was assigned to the optimization problem which found the optimal tree combination. For this end, the genetic algorithm methodology was applied. As a result of experiment, we had found out that the proposed algorithm could improve about 3~5% of classification performance in specific cases like common database and self infrared database compare with the existing random forest. In addition, we had shown that the optimal tree combination was decided at 55~60% level from the maximum trees.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.215-221
• /
• 2012

To address the bottleneck problem in data center networks, there have been several proposals for network architectures providing high path-diversity. In devising new schemes to utilize multiple paths, one must consider the effects on TCP performance because packet reordering can make TCP perform poorly. Therefore most schemes prevent packet reordering by sending packets through one of multiple available paths. In this study we show that packet reordering does not occur severely enough to have a significant impact on TCP performance when scattering packets through all available paths between a pair of hosts in Fat-Tree. Simulation results imply that it is possible to find a low-cost solution to the TCP performance problem for Fat-Tree-like topologies.