• Title/Summary/Keyword: Model Tree

Search Result 1,904, Processing Time 0.03 seconds

NPC Control Model for Defense in Soccer Game Applying the Decision Tree Learning Algorithm (결정트리 학습 알고리즘을 활용한 축구 게임 수비 NPC 제어 방법)

  • Cho, Dal-Ho;Lee, Yong-Ho;Kim, Jin-Hyung;Park, So-Young;Rhee, Dae-Woong
    • Journal of Korea Game Society
    • /
    • v.11 no.6
    • /
    • pp.61-70
    • /
    • 2011
  • In this paper, we propose a defense NPC control model in the soccer game by applying the Decision Tree learning algorithm. The proposed model extracts the direction patterns and the action patterns generated by many soccer game users, and applies these patterns to the Decision Tree learning algorithm. Then, the proposed model decides the direction and the action according to the learned Decision Tree. Experimental results show that the proposed model takes some time to learn the Decision Tree while the proposed model takes 0.001-0.003 milliseconds to decide the direction and the action based on the learned Decision Tree. Therefore, the proposed model can control NPC in the soccer game system in real time. Also, the proposed model achieves higher accuracy than a previous model (Letia98); because the proposed model can utilize current state information, its analyzed information, and previous state information.

Study on the tree-mimic array of solar cell modules (수목형상에 따른 태양전지 모듈의 배열 연구)

  • Kim, Ki-Hyun;Yun, Rin
    • Journal of the Korean Solar Energy Society
    • /
    • v.31 no.6
    • /
    • pp.32-39
    • /
    • 2011
  • This study is about the installation of the solar cell modules. The solar cell modules are built by the tree-mimic structure, and the performance is compared with that of the flat-plate type solar cell module installation. The mathematical tree model, which was suggested by Fisher and Honda, is utilized to determine the location of the solar cell modules for the tree-mimic type. The experiment shows that the generated electric power of the flat-plate type is higher than that of the tree-mimic type by 30% for one month of July. This lower performance for the tree-mimic type comes from the shading effects among the solar cell modules. The theoretical calculation for the absorbed solar radiation on the two types of solar cell installation shows that the tree-mimic type is higher than the flat-plate type by 8.5%. The shading area for the tree-mimic model is calculated with time by using the 3D-CAD, which will be utilized for the optimization of the tree-mimic model in the future.

Tree-inspired Chair Modeling (나무 성장 시뮬레이션을 이용한 의자 모델링 기법)

  • Zhang, Qimeng;Byun, Hae Won
    • Journal of the Korea Computer Graphics Society
    • /
    • v.23 no.5
    • /
    • pp.29-38
    • /
    • 2017
  • We propose a method for tree-inspired chair modeling that can generate a tree-branch pattern in the skeleton of an arbitrary chair shape. Unlike existing methods that merge multiple-input models, the proposed method requires only one mesh as input, namely the contour mesh of the user's desired part, to model the chair with a branch pattern generated by tree-growth simulation. We propose a new method for the efficient extraction of the contour-mesh region in the tree-branch pattern. First, we extract the contour mesh based on the face area of the input mesh. We then use the front and back mesh information to generate a skeleton mesh that reconstructs the connection information. In addition, to obtain the tree-branch pattern matching the shape of the input model, we propose a three-way tree-growth simulation method that considers the tangent vector of the shape surface. The proposed method reveals a new type of furniture modeling by using an existing furniture model and simple parameter values to model tree branches shaped appropriately for the input model skeleton. Our experiments demonstrate the performance and effectiveness of the proposed method.

Development of CISAT Model for Selecting R&D Planning System Alternatives (R&D프로젝트의 계획시스템대체안의 선정을 위한 CISAT모형의 개발)

  • Kang, Il-Jung;Kwon, Cheo-Shin
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2008.10a
    • /
    • pp.8-23
    • /
    • 2008
  • The purpose of this study is to develop a Cross Impact System Alternatives Tree(CISAT) model necessary for selecting the interdependent R&D planning system alternatives. This model modifies System Alternatives Tree(SAT) model developed by Kwon et al.. The SAT model is composed of several functions necessary for the achievement of a final goal and several subsystems for satisfying each function. In case that the relationship of technology alternatives is interdependent, this model overlooked a relative importance derived from occurrence or nonoccurrence of the technology alternatives in the future time varience. However, a complex evaluation process within the ballot system is another disadvantage of the SAT. To solve such problems, the Cross Impact Analysis(CIA) model is applied in the SAT model so as to consider the cross impact among interdependent system alternatives.

  • PDF

Implementation of Connected-Digit Recognition System Using Tree Structured Lexicon Model (트리 구조 어휘 사전을 이용한 연결 숫자음 인식 시스템의 구현)

  • Yun Young-Sun;Chae Yi-Geun
    • MALSORI
    • /
    • no.50
    • /
    • pp.123-137
    • /
    • 2004
  • In this paper, we consider the implementation of connected digit recognition system using tree structured lexicon model. To implement efficiently the fixed or variable length digit recognition system, finite state network (FSN) is required. We merge the word network algorithm that implements the FSN with lexical tree search algorithm that is used for general speech recognition system for fast search and large vocabulary systems. To find the efficient modeling of digit recognition system, we investigate some performance changes when the lexical tree search is applied.

  • PDF

Model Selection for Tree-Structured Regression

  • Kim, Sung-Ho
    • Journal of the Korean Statistical Society
    • /
    • v.25 no.1
    • /
    • pp.1-24
    • /
    • 1996
  • In selecting a final tree, Breiman, Friedman, Olshen, and Stone(1984) compare the prediction risks of a pair of tree, where one contains the other, using the standard error of the prediction risk of the larger one. This paper proposes an approach to selection of a final tree by using the standard error of the difference of the prediction risks between a pair of trees rather than the standard error of the larger one. This approach is compared with CART's for simulated data from a simple regression model. Asymptotic results of the approaches are also derived and compared to each other. Both the asymptotic and the simulation results indicate that final trees by CART tend to be smaller than desired.

  • PDF

Decision-Tree-Based Markov Model for Phrase Break Prediction

  • Kim, Sang-Hun;Oh, Seung-Shin
    • ETRI Journal
    • /
    • v.29 no.4
    • /
    • pp.527-529
    • /
    • 2007
  • In this paper, a decision-tree-based Markov model for phrase break prediction is proposed. The model takes advantage of the non-homogeneous-features-based classification ability of decision tree and temporal break sequence modeling based on the Markov process. For this experiment, a text corpus tagged with parts-of-speech and three break strength levels is prepared and evaluated. The complex feature set, textual conditions, and prior knowledge are utilized; and chunking rules are applied to the search results. The proposed model shows an error reduction rate of about 11.6% compared to the conventional classification model.

  • PDF

RC Tree Delay Estimation (RC tree의 지연시간 예측)

  • 유승주;최기영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.12
    • /
    • pp.209-219
    • /
    • 1995
  • As a new algorithm for RC tree delay estimation, we propose a $\tau$-model of the driver and a moment propagation method. The $\tau$-model represents the driver as a Thevenin equivalent circuit which has a one-time-constant voltage source and a linear resistor. The new driver model estimates the input voltage waveform applied to the RC more accurately than the k-factor model or the 2-piece waveform model. Compared with Elmore method, which is a lst-order approximation, the moment propagation method, which uses $\pi$-model loads to calculate the moments of the voltage waveform on each node of RC trees, gives more accurate results by performing higher-order approximations with the same simple tree walking algorithm. In addition, for the instability problem which is common to all the approximation methods using the moment matching technique, we propose a heuristic method which guarantees a stable and accureate 2nd order approximation. The proposed driver model and the moment propagation method give an accureacy close to SPICE results and more than 1000 times speedup over circuit level simulations for RC trees and FPGA interconnects in which the interconnect delay is dominant.

  • PDF

Two Uncertain Programming Models for Inverse Minimum Spanning Tree Problem

  • Zhang, Xiang;Wang, Qina;Zhou, Jian
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.1
    • /
    • pp.9-15
    • /
    • 2013
  • An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

Effects of Trees on Flow and Scalar Dispersion in an Urban Street Canyon (도시 협곡에서 수목이 흐름과 스칼라 물질 확산에 미치는 영향)

  • Kang, Geon;Kim, Jae-Jin
    • Atmosphere
    • /
    • v.25 no.4
    • /
    • pp.685-692
    • /
    • 2015
  • In this study, the effects of trees on flow and scalar dispersion in an urban street canyon were investigated using a computational fluid dynamics (CFD) model. For this, we implemented the drag terms of trees to the CFD model, and compared the CFD-simulated results to the wind-tunnel results. For comparison, we considered the same building configuration as the wind-tunnel experiment. The trees were located at the center of street canyon with the aspect ratio (defined as the ratio of the street width to the building height) of 1. First, the flow characteristics were analyzed in the tree-free and high-density tree cases and the results showed that the CFD model reproduced well the flow pattern of the wind-tunnel experiment and reflected the drag effect of trees in the street canyon. Then, the dispersion characteristics of scalar pollutants were investigated for the tree-free, low-density tree and medium-density tree cases. In the tree-free case, the nondimensionalized concentration distribution simulated by the CFD model was quite similar to that in the wind-tunnel experiment in magnitude and pattern. The correlation coefficients between the measured and simulated concentrations are more than 0.9 in all the cases. As the tree density increased, nondimensionalized concentration increased (decreased) near the wall of the upwind (downwind) building, which resulted from the decrease in wind speed case by the drag effect of trees. However, the CFD model underestimated (overestimated) the concentration near the wall of upwind (downwind) building.