• 한국산림과학회지
• /
• 제102권2호
• /
• pp.229-238
• /
• 2013

효율적인 임목수확작업 기술의 보급과 임목수확작업시스템을 구축하기 위해 타워야더 및 스윙야더 등에 의한 전목집재작업시스템과 굴삭기 그래플 등에 의한 단목집재작업시스템의 작업비용을 비교 분석하였다. 전목집재 작업시스템에서 작업비용을 산정한 결과, 체인톱에 의한 벌목작업비용이 2,099원/$m^3$, 타워야더에 의한 전목집재작업비용이 28,286원/$m^3$, 스윙야더에 의한 전목집재작업비용이 18,265원/$m^3$, 굴삭기 그래플 및 체인톱에 의한 조재작업비용이 18,939원/$m^3$, 바퀴식 미니포워더에 의한 소운재 및 집적 작업비용이 20,484원/$m^3$, 굴삭기 그래플 및 소형 운재차에 의한 소운재 및 집적 작업비용이 12,701원/$m^3$으로 나타났다. 또한, 단목집재작업시스템에서 작업비용을 산정한 결과, 체인톱에 의한 벌목 및 조재 작업비용이 10,160원/$m^3$, 굴삭기 그래플에 의한 단목집재작업비용이 7,567원/$m^3$, 굴삭기 그래플에 의한 지엽수집작업비용이 6,982원/$m^3$, 굴삭기 그래플에 의한 작업로개설비용이 3,040원/$m^3$, 바퀴식 미니포워더에 의한 소운재 및 집적 작업비용이 20,484원/$m^3$, 굴삭기 그래플 및 소형 운재차에 의한 소운재 및 집적작업비용이 12,701원/$m^3$으로 나타났다.

• 한국정보과학회논문지:시스템및이론
• /
• 제30권5_6호
• /
• pp.319-323
• /
• 2003

이차원 평면에 주어진 n개의 점 집합 P에 대한, 최소 신장 트리(minimum spanning tree, MST)는 P의 점들을 연결한 신장 트리 중에서 에지 길이의 총합이 최소가 되는 트리로 정의된다. P에 대한 신장 트리의 지름(diameter)은 트리의 두 점을 연결한 트리 경로 중에서 최장 경로의 길이로 정의되며, 최소 지름 신장 트리(minimum-diameter spanning tree, MDST)는 P에 대한 신장 트리 중에서 지름이 가장 작은 트리를 의미한다. 현재까지 알려진 가장 좋은 알고리즘[3]은 MDST를 O(n$^3$) 시간에 구한다. 본 논문에서는 MDST의 지름보다 최대 5/4배 이내의 지름을 보장하는 신장 트리를 구하는 $O(n^2)$ 시간 근사 알고리즘(approximation algorithm)을 제시한다. 이것은 MDST 문제에 관한 첫 번째 근사 알고리즘이다.

• 한국통신학회논문지
• /
• 제28권2C호
• /
• pp.100-109
• /
• 2003

가변길이 나무구조 벡터양자화기(VLTSVQ : variable-length tree-structured vector quantizer)를 기반으로 하는 영상 부호화 방식인 차분 인덱스(DI : Differential index) 할당기법을 제안하였다. 각 소스벡터는 VLTSVQ의 단말 노드로 양자화가 되어지고, 각 단말 노드는 유일한 이진 벡터로 표현된다. 제안한 방법은 영상의 화질은 유지하면서 압축률을 개선하기 위해 이웃하는 영상 블록들간의 상관성을 이용하였다. 모의실험을 통하여 제안한 방법이 기존 방법들에 비해 매우 높은 압축률을 보였으며, 화소간의 상관성이 높은 영상에 대해서는 63.2%의 발생 비트율 감소를 확인하였다. 그리고 영상내의 이웃블록들간 상관성이 커질수록 더 큰 비트율이 감소됨을 보였다. 제안한 부호화 기법은 일반적으로 이웃된 화소들간에 높은 상관성을 가진 MR(magnetic resonance)영상 부호화에 효율적으로 사용될 수 있다.

• 대한전자공학회논문지SP
• /
• 제38권3호
• /
• pp.316-324
• /
• 2001

본 논문에서는 가역가변길이 부호를 테이블 메모리에 효율적으로 저장하는 방법을 제안한다. 여러개의 부호들을 적은 개수의 값들로 테이블을 구성하는 새로운 알고리듬으로, 가역가변길이 부호의 부호내의 비트 천이개수와 부호 구성 트리에서의 레벨을 이용하는 TNWT(Transition Number and Weight of Tree)방법을 제안한다. 압축에 앞서 가역가변길이 부호들의 가중치와 천이개수를 구하고, 신장된 값들이 서로 구분이 안되는 경우를 방지하기 위해 테이블의 값들을 재배열한다. 재배열이 끝난 배열의 값들을 세 개씩 묶어 압축된 테이블을 얻는다. 압축된 테이블은 부호의 천이개수와 가중치를 이용하여 복호해 낼 수 있다. 이러한 방법을 통하여 기존의 방법보다 약 20％ 적은 크기로 테이블 메모리를 구성하고, 압축된 테이블로 복호가 가능함을 확인하였다.

• Journal of Information Processing Systems
• /
• 제16권6호
• /
• pp.1324-1342
• /
• 2020

Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

• Journal of Forest and Environmental Science
• /
• 제38권4호
• /
• pp.275-283
• /
• 2022

A study was designed to investigate the pattern of sexual dimorphism in a plantation of Garcinia kola. Twenty trees were randomly selected for the study and have been observed to flower regularly. A total of 100 inflorescence were randomly collected from the crown of each tree and 500 flowers randomly assessed within the period of four (4) flowering seasons. Floral sex assessment was done visually and with a hand magnifying lens; floral morphometric measurements (i.e. pedicel and perianth length and breadth), inflorescence length, and breadth) was taken using a veneer caliper; number of flowers per inflorescence and inflorescence per twig was counted; while, data analysis was conducted on excel using analysis of variance and pairwise t-test comparison. Four floral sexes were identified in the G. kola plantation studied which were unisexual male flowers, unisexual female flowers, cosexual unisexual male flowers, and cosexual hermaphrodite flowers. Three tree sexes were identified viz: inconstant male, invariant female, and cosexual trees. The plantation was significantly sexually dimorphic in floral sex and phenotypic traits (i.e. pedicel and perianth size), and as well as sexually dimorphic in tree sex and reproductive phenotypic traits (i.e. inflorescence size, number of inflorescences per twig, and number of flower bud per inflorescence). The sexual system of the plantation was therefore trioecious with features suggestive of evolving dioecy through the gynodioecious pathway.

• Journal of Forest and Environmental Science
• /
• 제28권2호
• /
• pp.63-67
• /
• 2012

Crown ratio is the ratio of live crown length to tree height. It is often used as an important predictor variable for tree growth equation. It indicates tree vigor and is a useful parameter in forest health assessment. The objective of the study was to develop crown ratio prediction models for Tectona grandis. Based on the data set from the temporary sample plots, several non linear equations including logistics, Chapman Richard and exponential functions were tested. These functions were evaluated in terms of coefficient of determination ($R^2$) and standard error of the estimate (SEE). The significance of the estimated parameters was also verified. Plot of residuals against estimated crown ratios were observed. Although the logistic model had the highest $R^2$ and the least SEE, Chapman-Richard and Exponential functions were observed to be more consistent in their predictive ability; and were therefore recommended for predicting crown ratio in the stand.

• The Plant Pathology Journal
• /
• 제21권1호
• /
• pp.27-32
• /
• 2005

Leaf anthracnose was observed on leaves of Japanese spindle tree in Seoul, Korea from autumn 2003 to spring 2004. The causal fungus was purely isolated from he leaf spot lesions and cultured on PDA. The colony on PDA was cream to orange but blackish in the center n old cultures. Conidia were formed in blackish orange asses and were cylindrical in shape, measured 13-17${\times}$5-7 ${\mu}$m in size. Blackish brown setae were often observed on PDA and ranged up to 100 ${\mu}$m in length. Based on morphological and ITS region sequence analyses, the fungal strain was identified as Colletotrichum boninense. Koch’s postulates were fulfilled by inoculating tree leaves with 1 ${\times}$ $106^6$ conidia per ml in a moist chamber. This is the first study on the pathogenicity, growth and phylogenetic characteristics of C. boninense causing leaf anthracnose on Japanese spindle tree in Korea.

• 전자공학회논문지S
• /
• 제34S권9호
• /
• pp.99-108
• /
• 1997

An efficient wavelet packet algorithm to find wavelet packet quickly is presented in this paper. The top-down method maximizing the transform coding gain that is obtained from the second moment of the band is used to divide the subbands into wavelet tree. The bit allocation for each band in the tree is performed in proportion to its variance. Bands are coded by the lossless coding algorithm called the bit plane run length coding(BPRLC) and uniform quantizer. The proposed algorithm is compared with of the single tree algorithim proposed by Ramchandran and Vetterli. To verify the efficiency of our algorithm, simulations are jperformed using several sets of images. The results show us that our method reduces the execution time by about forty percent of that required by the single tree method while maintaining the comparable reconstructed image qualities.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.