• Journal of Forest and Environmental Science
• /
• v.39 no.4
• /
• pp.203-212
• /
• 2023

Directional felling is a felling method practised by the Forestry Department in Peninsular Malaysia as prescribed in Field Work Manual (1997) for Selective Management Systems (SMS) in forest harvesting. Determining the direction of tree felling in Peninsular Malaysia is conducted during the pre-felling inventory 1 to 2 years before the felling operation. This study aimed to predict and analyze the direction of tree felling using the vector-based path distance back link method in Geographic Information Systems (GIS) and compare it with the felling direction observed on the ground. The study area is at Balah Forest Reserve, Kelantan, Peninsular Malaysia. A Path Distance Back Link (spatial analyst) function in ArcGIS Pro 3.0 was used in predicting tree felling direction. Meanwhile, a binary classification was used to compare the felling direction estimated using GIS and the tree felling direction observed on the ground. Results revealed that 61.3% of 31 trees predicted using the vector-based projection method were similar to the felling direction observed on the ground. It is important to note that dynamic changes of natural constraints might occur in the middle of tree felling operation, such as weather problems, wind speed, and unpredicted tree falling direction.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.787-790
• /
• 2003

This paper describes a high speed correlator that can acquire synchronization quickly. The existing addition algorithm is a binary adder tree architecture that will result in extremely slow speed of operation due to many levels of logic required for computation of correlation[2][3]. This paper suggests the new various architectures, which are systolic array architecture, simple pipeline architecture and block systolic array architecture[4][5]. The acquisition performance of the proposed architectures is analyzed and compared with the existing architecture. The comparison results show that the systolic array architecture and the block systolic array architecture reduce the timing delay up to 73% and 31%, respectively. And the results show that the simple pipeline architecture reduces the timing delay up to 53%..

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.2
• /
• pp.152-156
• /
• 2013

This paper presents a fast-lock dual-loop successive approximation register-controlled duty-cycle corrector (SARDCC) circuit using a mixed (binary+sequential) search algorithm. A wider duty-cycle correction range, higher operating frequency, and higher duty-cycle correction accuracy have been achieved by utilizing the dual-loop architecture and the binary search SAR that achieves the fast duty-cycle correcting property. By transforming the binary search SAR into a sequential search counter after the first DCC lock-in, the proposed dual-loop SARDCC keeps the closed-loop characteristic and tracks variations in process, voltage, and temperature (PVT). The measured duty cycle error is less than ${\pm}0.86%$ for a wide input duty-cycle range of 15-85 % over a wide frequency range of 0.5-2.0 GHz. The proposed dual-loop SARDCC is fabricated in a 0.18-${\mu}m$, 1.8-V CMOS process and occupies an active area of $0.075mm^2$.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.1
• /
• pp.229-235
• /
• 2014

We enumerate black and white colored d-ary trees with no leftmost ${\square}$-edges, which is a generalization of hybrid binary trees. Then the multi-colored hybrid d-ary trees with the same condition is studied.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.364-364
• /
• 2006

• Review of KIISC
• /
• v.2 no.3
• /
• pp.89-101
• /
• 1992

본 논문에서는 암호알고리듬 실현을 위해 요구되는계산량에 가장 큰 영향을 미치는 모듈러 지수(modular exponentiation)에 관한 여러가지 연산알고리듬을 분석 및 제시하고 그 예를 보인다. 본 논문에서 소개되는 연산알고리듬은 $X^n$(mod p)를 계산하기 위한 대표적 방식인 이진방식(binary method), 그리고 고리(chain)를 이용하는 파워트리 방식(power tree method)및 가산고리방식(addition chain method)등을 포함한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.44-57
• /
• 1995

In this paper GFI (Generalized Fuzzy Isodata) and FI (Fuzzy Isodata) algorithms are studied and applied to the tire tread pattern classification problem. GFI algorithm which repeatedly grouping the partitioned cluster depending on the fuzzy partition matrix is general form of GI algorithm. In the constructing the binary tree using GFI algorithm cluster validity, namely, whether partitioned cluster is feasible or not is checked and construction of the binary tree is obtained by FDH clustering algorithm. These algorithms show the good performance in selecting the prototypes of each patterns and classifying patterns. Directions of edge in the preprocessed image of tire tread pattern are selected as features of pattern. These features are thought to have useful information which well represents the characteristics of patterns.

• Journal of Information Technology Application
• /
• v.1
• /
• pp.173-211
• /
• 1999

The task of classification permeates all walks of life, from business and economics to science and public policy. In this context, nonlinear techniques from artificial intelligence have often proven to be more effective than the methods of classical statistics. The objective of knowledge discovery and data mining is to support decision making through the effective use of information. The automated approach to knowledge discovery is especially useful when dealing with large data sets or complex relationships. For many applications, automated software may find subtle patterns which escape the notice of manual analysis, or whose complexity exceeds the cognitive capabilities of humans. This paper explores the utility of a collaborative learning approach involving integrated models in the preprocessing and postprocessing stages. For instance, a genetic algorithm effects feature-weight optimization in a preprocessing module. Moreover, an inductive tree, artificial neural network (ANN), and k-nearest neighbor (kNN) techniques serve as postprocessing modules. More specifically, the postprocessors act as second0order classifiers which determine the best first-order classifier on a case-by-case basis. In addition to the second-order models, a voting scheme is investigated as a simple, but efficient, postprocessing model. The first-order models consist of statistical and machine learning models such as logistic regression (logit), multivariate discriminant analysis (MDA), ANN, and kNN. The genetic algorithm, inductive decision tree, and voting scheme act as kernel modules for collaborative learning. These ideas are explored against the background of a practical application relating to financial fraud management which exemplifies a binary classification problem.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.4
• /
• pp.507-520
• /
• 2001

In this paper, a hybrid algorithm for well detecting both abrupt and gradual scene changes is proposed. This algorithm examines only the candidate intervals for speedup using the binary tree method and skips the intervals that are not candidate. For accuracy, the temporal difference of variance is used to detect the gradual scene changes while the temporal difference of histogram is used to detect the abrupt scene changes. Experimental results show that the proposed hybrid algorithm using the binary tree method works up about 10 times faster that the sequential method and is effective in detecting abrupt scene change and gradual transitions including dissolving and fading.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.184-194
• /
• 2005

One of the most important factors that decide the overall performance of RFID system is anti-collision algorithm. By enhancing the anti-collision algorithm, we can increase the number of RFID tags that can be processed in unit time. Two anti-collision algorithms are most widely prevailed: one is ALOHA-based protocol and the other is a binary tree walking method, but these are still under research. In this paper, we suggest an anti-collision algorithm named AAC(Address Allocating and Calling) using pre-distributed random address, which is much faster and more efficient than existing ones. Finally, we evaluate our scheme using mathematical analysis and computer simulation.