• Journal of Forest and Environmental Science
• /
• v.35 no.1
• /
• pp.1-5
• /
• 2019

Species diversity is one of the most important indices that used to evaluate the sustainability of forest communities. In the present study, three variables including number of individuals (frequency of species), basal area and volume of tree species were compared to estimate tree species diversity in broadleaves forests of Iran. Based on systematic random design, 30 plots (circle plot, $1000m^2$) was selected. Type of species, number of species, DBH and height of trees were measured. Simpson (1-D), Hill ($N_2$), Shannon-Wiener (H'), Mc Arthur ($N_1$), Smith-Wilson ($E_{var}$) and Margalef ($R_1$) indices used to estimate tree species diversity. Species diversity was calculated in each plot. ANOVA test showed that there was a significant difference between of three variables used for estimation of species diversity. Number of trees variable has more precision than basal area and volume variables to estimate of species diversity. But Duncan test revealed that there were significant difference between of basal area and volume variables with number of trees. Therefore, basal area and volume variables were selected as more suitable variables in order to estimate of biodiversity indices in northern forests of Iran.

• Journal of Korean Society of Forest Science
• /
• v.101 no.4
• /
• pp.648-655
• /
• 2012

This research is aimed at suggesting the reasonable guideline for managing tree density of a therapeutic forest to enhance the therapeutic efficiency. To obtain visually preferable tree density for 4 coniferous tree species; Pinus koraiensis, Chamaecyparis obtusa, Pinus densiflora, Larix kaempferi, the simulations of tree density according to the 3 diameter classes are used. 250 people participated in questionnaire and 239 people of them were analyzed. The tree density preferences of 4 tree species are as follows; Pinus koraiensis forest; tree density for trees with Diameter (DBH=D)<25 cm about 816/ha, tree density for trees with 25=D<40 about 400/ha and tree density for trees with 40=D about 277/ha. Chamaecyparis obtusa forest; tree density for trees with D<25 about 625/ha, tree density for trees with 25=D<40 about 625/ha and tree density for trees with 40=D about 400/ha. Pinus densiflora forest; tree density for trees with D<25 about 816/ha, tree density for trees with 25=D<40 about 625/ha and tree density for trees with 40=D about 400/ha. Larix kaempferi forest; tree density for trees with D<25 about 625/ha, tree density for trees with 25=D<40 about 625/ha and tree density for trees with 40=D about 277/ha.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.04b
• /
• pp.305-309
• /
• 1993

The application of fault tree technique to the analysis of compressor failure is considered. The techniques involve the decomposition of the system into a logic diagram or fault tree in whichcertain basic or primary events lead to a specified top event which signifiss the total failure of the system. The fault trees are used to obtain miniumal cut sets from whichthe modes of system failure and, hence the reliability for the top event can be calculated. The method of constructing fault trees and the subsequent estimation of reliability of the system is illustrated through a compressor failure. FTA is roved to be efficient to investigate the compressor fault train.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.899-910
• /
• 2019

In this paper, we enumerate the cardinalities for the set of all vertices of outdegree ${\geq}k$ at level ${\geq}{\ell}$ among all rooted ordered d-trees with n edges. Our results unite and generalize several previous works in the literature.

• Journal of Korean Society of Forest Science
• /
• v.71 no.1
• /
• pp.40-44
• /
• 1985

This study was carried out to know the difference in growth and degree of competition between individuals of thinned and unthinned larch stands. Annual increment and total growth were obtained from the cores sampled at breast height. The correlation between adjacent individual trees was investigated. 1) The correlation between radius growth and basal area was used to estimated the degree of competition among individual trees. 2) In estimating the degree of competition the correlation between two individual trees was better method than others. 3) Up to 9 years after planting no competition between individual trees occurred and the Night positive correlation was shown. 4) High degree of competition was observed at age of 10 years after the planting, as the correlation coefficient was getting smaller. 5) The degree of competition among individual trees increased with increase of the growth of total stand.

• The Korean Journal of Ecology
• /
• v.13 no.4
• /
• pp.311-320
• /
• 1990

This paper deals with pollen analysis of a 190cm core collected from the Chollipo Arboretum sedimentary basin($N36^{\circ}47$ 43", $E1269^{\circ}$ 7") in southwestern Korea in order to know the change of the climate and vegetation. In this research it is found that the pollen zones are divided into two layers. Pollen zone, I, the lower layer, is flourished with broadleaved trees such as Quercus, Alnus, Corylus, Betula, Carpinus and Castanopsis, and about 30~40% of pollen of those trees consist of that of Q. acuta/glauca and Castanopsis which are evergreen trees. And pollen of Trapa, Typhaceae and Nymphaceae living in wet habitat, is dominant among the nonarboreal pollen. Therefore we can conclude that it ould be warmer and more humid than present in this area of the past. In pollen zone, the upper layer, pollen of Pinus is dominant and those of Artemisia, Gramineae, Compositae and spore are increased in quantity, while pollen of Quercus, Belula and Nymphaceae decreased. It it supposed that the climate of this zone was drier than that zone.that zone.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.7-14
• /
• 2003

A number of embedded wavelet image coding methods have been proposed since the introduction of EZW(Embedded Zerotree Wavelet) algorithm. A common characteristic of these methods is that they use fundamental ideas found in the EZW algorithm. Especially, one of these methods is the SPIHT(Set Partitioning in Hierarchy Trees) algorithm, which became very popular since it was able to achieve equal or better performance than EZW without having to use an arithmetic encoder. In this paper We propose a recursive set partitioning in hierarchy trees(RSPIHT) algorithm for embedded image coding and evaluate it's effectiveness experimentally. The proposed RSPIHT algorithm takes the simple and regular form and the worst case time complexity of O(n). From the viewpoint of processing time, the RSPIHT algorithm takes about 16.4% improvement in average than the SPIHT algorithm at T-layer over 4 of experimental images. Also from the viewpoint of coding rate, the RSPIHT algorithm takes similar results at T-layer under 7 but the improved results at other T-layer of experimental images.

• KIEE International Transactions on Electrophysics and Applications
• /
• v.11C no.2
• /
• pp.12-17
• /
• 2001

In this work, the correlation between the PD Patterns and the electrical tree propagation has been investigated by use of the specimen removed from the insulation of the real 154 kV XLPE underground power cables. As a result, it could be deduced that the PD pattern regarding electrical trees depends on their type which could be classified into three different distinct groups such as branch-bush mixed. Considering the results of our investigation, if the partial discharge magnitude is only considered for the diagnosis of the cable system, it is possible to draw a wrong decision. Therefore, it is possible to propose that the time characteristics of PD pattern should be taken into account for the diagnosis of the cable system in addition to the conventional $\Phi$-q-n characteristics.

• Communications of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.361-369
• /
• 2018

For a given graph G = (V, E), a set $D{\subseteq}V(G)$ is said to be an outer-connected vertex edge dominating set if D is a vertex edge dominating set and the graph $G{\backslash}D$ is connected. The outer-connected vertex edge domination number of a graph G, denoted by ${\gamma}^{oc}_{ve}(G)$, is the cardinality of a minimum outer connected vertex edge dominating set of G. We characterize trees T of order n with l leaves, s support vertices, for which ${\gamma}^{oc}_{ve}(T)=(n-l+s+1)/3$ and also characterize trees with equal domination number and outer-connected vertex edge domination number.

• Journal of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.205-219
• /
• 2002

We deride formulas for the expected values $\mu$(n) of the independent domination numbers of a random planted plane tree and a random trivalent tree with n vertices, respectively, and we determine the asymptotic behavior of $\mu$(n) as n goes to infinity.