• 한국환경과학회지
• /
• 제27권10호
• /
• pp.865-874
• /
• 2018

Fruit trees are a key part of agriculture in rural areas and have recently been a part of ecotourism or agrotourism. This study analyzes user segmentation based on user motivation to determine characteristics of potential customers in fruit tree farms, and thereby develop fruit tree experience and educational programs. We conducted a survey of 253 potential customers of fruit tree experience programs in September 2017. Data were evaluated using factor and cluster analyses. The results of the cluster analysis identified four distinct segments based on potential customers' motivations, that is, activity-oriented, learning-oriented, leisure-oriented, and purchase-oriented. These clusters showed that significant differences in the preference of potential customers exist. Different markets were segmented based on the benefits sought by users. The segments' characteristics were identified and activities relevant to each segment were proposed for rural tourism. Lastly, this study suggests directions for development of fruit tree farm experience and educational programs.

• Journal of Information Technology Applications and Management
• /
• 제12권1호
• /
• pp.111-123
• /
• 2005

Many indexing methods were proposed so that process moving object efficiently. Among them, indexing methods like the 3D R-tree treat temporal and spatial domain as the same. Actually, however. both domain had better process separately because of difference in character and unit. Especially in this paper we deal with limited region such as indoor environment since spatial domain is limited but temporal domain is grown. In this paper we present a novel indexing structure, namely STS-tree(Separation of Time and Space tree). based on limited region. STS-tree is a hybrid tree structure which consists of R-tree and one-dimensional TB-tree. The R-tree component indexes static object and spatial information such as topography of the space. The TB-tree component indexes moving object and temporal information.

• 대한원격탐사학회지
• /
• 제27권3호
• /
• pp.389-401
• /
• 2011

Most nations around the world have expressed significant concern in the climate change due to a rapid increase in green-house gases and thus reach an international agreement to control total amount of these gases for the mitigation of global warming. As the most important absorber of carbon dioxide, one of major green-house gases, forest resources should be more tightly managed with a means to measure their total amount, forest biomass, efficiently and accurately. Forest biomass has close relations with forest areas and tree height. Airborne LiDAR data helps extract biophysical properties on forest resources such as tree height more efficiently by providing detailed spatial information about the wide-range ground surface. Many researchers have thus developed various methods to estimate tree height using LiDAR data, which retain different performance and characteristics depending on forest environment and data characteristics. In this study, we attempted to investigate such various techniques to estimate tree height, elaborate their advantages and limitations, and suggest future research directions. We first examined the characteristics of LiDAR data applied to forest studies and then analyzed methods on filtering, a precedent procedure for tree height estimation. Regarding the methods for tree height estimation, we classified them into two categories: individual tree-based and regression-based method and described the representative methods under each category with a summary of their analysis results. Finally, we reviewed techniques regarding data fusion between LiDAR and other remote sensing data for future work.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.455-470
• /
• 2007

In phylogenetic tree construction the neighbor-joining algorithm is the most well known method which constructs a trivalent tree from a pairwise distance data measured by DNA sequences. The core part of the algorithm is its cherry picking criterion based on the tree structure of each quartet. We give a generalized version of the criterion based on the exact box model of quartets, known as the tight span of a metric. We also show by experiment why neighbor-joining and the quartet consistency count method give similar performance.

• 제어로봇시스템학회논문지
• /
• 제14권11호
• /
• pp.1110-1116
• /
• 2008

In this paper, we suggest GP operators based on tree structure considering tree distributions in structure space and structural difficulties. The main idea of the proposed genetic operators is to place generated offspring into the specific region which nodes and depths are balanced and most of solutions exist. To enable that, the proposed operators are designed to utilize region information where parents belong and node/depth rates of selected subtree. To demonstrate the effectiveness of our proposed approach, experiments of binomial-3 regression, multiplexer and even parity problem are executed. The experiments results show that the proposed operators based on tree structure is superior to the results of standard GP for all three test problems in both success rate and number of evaluations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권9호
• /
• pp.2173-2193
• /
• 2013

In order to reduce the distribution cost of sensor nodes, a mobile sensor deployment has been proposed. The mobile sensor deployment can be solved by finding the optimal layout and planning the movement of sensor nodes with minimum energy consumption. However, previous studies have not sufficiently addressed these issues with an efficient way. Therefore, we propose a new deployment approach satisfying these features, namely a tree-based approach. In the tree-based approach, we propose three matching schemes. These matching schemes match each sensor node to a vertex in a rake tree, which can be trivially transformed to the target layout. In our experiments, the tree-based approach successfully deploys the sensor nodes in the optimal layout and consumes less energy than previous works.

• 융합신호처리학회논문지
• /
• 제3권2호
• /
• pp.89-95
• /
• 2002

글로벌 라우팅(global routing)은 VLSI 설계 과정중의 하나로, 네트리스트의 모든 네트들을 연결하기 위하여 각 네트들을 라우팅 영역(routing area)에 할당시키는 문제이며, 글로벌 라우팅에서 최적의 해를 얻기 위해 maze routing 알고리즘, line-probe 알고리즘, shortest path 기반 알고리즘, Steiner tree 기반 알고리즘등이 이용된다. 본 논문에서는 라우팅 그래프에서 최단 경로 Steiner tree 탐색방법인 weighted network heuristic(WNH)과 이를 기반으로 하는 글로벌 라우팅 유전자 알고리즘(genetic algorithm; GA)을 제안하였으며, 제안한 방식을 시뮬레이티드 어닐링(SA) 방식과 비교, 분석하였다.

• Communications for Statistical Applications and Methods
• /
• 제24권6호
• /
• pp.543-559
• /
• 2017

Tree-based regression and classification ensembles form a standard part of the data-science toolkit. Many commonly used methods take an algorithmic view, proposing greedy methods for constructing decision trees; examples include the classification and regression trees algorithm, boosted decision trees, and random forests. Recent history has seen a surge of interest in Bayesian techniques for constructing decision tree ensembles, with these methods frequently outperforming their algorithmic counterparts. The goal of this article is to survey the landscape surrounding Bayesian decision tree methods, and to discuss recent modeling and computational developments. We provide connections between Bayesian tree-based methods and existing machine learning techniques, and outline several recent theoretical developments establishing frequentist consistency and rates of convergence for the posterior distribution. The methodology we present is applicable for a wide variety of statistical tasks including regression, classification, modeling of count data, and many others. We illustrate the methodology on both simulated and real datasets.

• Journal of Electrical Engineering and Technology
• /
• 제13권2호
• /
• pp.637-647
• /
• 2018

In this paper, we propose a method to search candidates of network reconfiguration to restore distribution system with distributed energy resources using a level-based tree search algorithm. First, we introduce a method of expressing distribution network with distributed energy resources for fault restoration, and to represent the distribution network into a simplified graph. Second, we explain the tree search algorithm, and introduce a method of performing the tree search on the basis of search levels, which we call a level-based tree search in this paper. Then, we propose a candidate search method for fault restoration, and explain it using an example. Finally, we verify the proposed method using computer simulations.

• 한국통신학회논문지
• /
• 제34권12B호
• /
• pp.1498-1505
• /
• 2009

In centralized control sensor network, tree-based multi-channel communication overcomes the recurrent channel switching and makes possible to transfer data simultaneously from different sources. In our paper, we propose a greedy algorithm named as NIT (Non-Intersecting Tree) that the trees can avoid inter-tree interference. We also propose channel switching technique by which trees can avoid link failure or area blocking due to external interference locally without rerunningthe algorithm and without interrupting the whole network. At first we applied our algorithm for a random topology and then we evaluate the performance of the network using NS-2 simulator. The results show that with the increasing of channel the throughputand delivery ratio are increased significantly. We got better performance than a using a recent proposed Tree-based Multi-Channel Protocol (TMCP).