• Title/Summary/Keyword: Tree Modeling

Search Result 337, Processing Time 0.026 seconds

A Modeling of Discrete Event System Using Temporal Logic Framework and Petri Net (시간논리 구조와 Petri Net의 합성방법을 사용한 이산사건 시스템의 모델링)

  • Kim, Jin-Kwon;Mo, Young-Seung;Ryu, Young-Guk;Hwang, Hyung-Soo
    • Proceedings of the KIEE Conference
    • /
    • 1999.07b
    • /
    • pp.838-840
    • /
    • 1999
  • In this paper, modeling and analysis of discrete event systems by temporal logic frame works and petri net is considered. The reachability tree of the petri net can be used to solve the safeness, boundedness, conservation and coverability problems of discrete event systems. But the reachability tree of the petri net do not solve reachability and liveness problems in general. We proposed a method that synthesised the petri net and the temporal logic frameworks. This method slove some problems of petri net by logical representation of temporal logic frameworks.

  • PDF

Tree Structure Modeling and Genetic Algorithm-based Approach to Unequal-area Facility Layout Problem

  • Honiden, Terushige
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.2
    • /
    • pp.123-128
    • /
    • 2004
  • A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between facilities and total rectangular layout area where all facilities and dead spaces are enclosed. Using the genetic code corresponding to two kinds of information, facility sequence and branching positions in the tree structure model, a genetic algorithm has been applied for finding non-dominated solutions in the two-objective layout problem. We use three kinds of crossover (PMX, OX, CX) for the former part of the chromosome and one-point crossover for the latter part. Two kinds of layout problems have been tested by the proposed method. The results demonstrate that the presented algorithm is able to find good solutions in enough short time.

Crown Ratio Models for Tectona grandis (Linn. f) Stands in Osho Forest Reserve, Oyo State, Nigeria

  • Popoola, F.S.;Adesoye, P.O.
    • Journal of Forest and Environmental Science
    • /
    • v.28 no.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.

Analytical modeling of a Fat-tree Network with buffered a$\times$b switches (버퍼를 장착한 a$\times$b 스위치로 구성된 Fat-tree 망의 성능분석)

  • 신태지;양명국
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.374-377
    • /
    • 2003
  • In this paper, a performance evaluation model of the Fat-Tree network with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem in the switch network The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. Steady state probability concept is used to simplify the analyzing processes. Two important parameters of the network performance, throughput and delay, are then evaluated. To validate the proposed analysis model, the simulation is carried out on the various sizes of Fat-tree networks that use the multiple a$\times$b buffered crossbar switches. It is observed that both analysis and simulation results are match closely.

  • PDF

Bus Reconfiguration Strategy Based on Local Minimum Tree Search for the Event Processing of Automated Distribution Substations

  • Ko Yun-Seok
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.177-185
    • /
    • 2005
  • This paper proposes an expert system that can enhance the accuracy of real-time bus reconfiguration strategy by adopting the local minimum tree search method and that can minimize the spreading effect of the fault by considering the operating condition when a main transformer fault occurs in an automated substation. The local minimum tree search method is used to expand the best-first search method. This method has the advantage that it can improve the solution performance within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. The second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules from the obtained switching candidate set. Also, this paper proposes generalized distribution substation modeling using graph theory, and a substation database based on the study results is designed.

S-tree-Based Evolutionary Computation for Dynamic Modeling of Biochemical Systems (생화학 시스템의 동적 모델링을 위한 S-tree 기반의 진화연산)

  • 조동연;장병탁
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.823-825
    • /
    • 2003
  • 시간이 흐름에 따라 생화학 시스템이 변화하는 것을 기록한 데이터로부터 이 시스템의 상태 전이 및 시스템을 구성하는 각 생화학 물질간의 관계를 모델링하기 위한 방법으로 S-tree 구조를 제안한다. 이것은 주로 생화학 시스템의 동적 특성을 모델링 하기 위하여 연구되어 온 S-system을 나무 구조로 표현한 것이다. 본 논문에서는 진화 연산을 통해 주어진 시계열 데이터를 잘 설명하는 S-tree의 구조 및 그 변수들을 동시에 효과적으로 탐색하는 방법을 개발하였다. 이 방법에서는 구조 탐색을 위해 유전 프로그래밍(genetic programming)에서 사용되어 온 나무 구조의 교차 및 돌연변이 연산과 더불어 다양한 형태의 구조 탐색 연산자들을 도입하였고, 또한 동시에 알맞은 변수 값들을 찾기 위하여 확률적 돌연변이 연산을 통한 언덕 오르기(hill-climbing)를 수행한다. 제안된 방법을 효모의 혐기성 발효 데이터에 적용한 결과 주어진 시스템을 성공적으로 모델링할 수 있었다.

  • PDF

Hierarchical Modeling Methodology for Contraint Simulations (제약조건이 있는 시뮬레이션을 위한 계층적 모델링 방법론)

  • 이강선
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.4
    • /
    • pp.41-50
    • /
    • 2000
  • We have many simulation constraints to meet as a modeled system becomes large and complex. Real-time simulations are the examples in that they are constrained by certain non-function constraints (e.g., timing constraints). In this paper, an enhanced hierarchical modeling methodology is proposed to efficiently deal with constraint-simulations. The proposed modeling method enhances hierarchical modeling methods to provide multi-resolution model. A simulation model is composed by determining the optimal level of abstraction that is guaranteed to meet the given simulation constraints. Four modeling activities are defined in the proposed method: 1) Perform the logical architectural design activity to produce a multi-resolution model, 2) Organize abstraction information of the multi-resolution model with AT (Abstraction Tree) structure, 3) Formulate the given constraints based on U (Integer Programming) approach and embrace the constraints to AT, and 4) Compose a model based on the determined level of abstraction with which the multi-resolution model can satisfy all given simulation constraints. By systematically handling simulation constraints while minimizing the modeler's interventions, we provide an efficient modeling environment for constraint-simulations.

  • PDF

Improved Decision Tree-Based State Tying In Continuous Speech Recognition System (연속 음성 인식 시스템을 위한 향상된 결정 트리 기반 상태 공유)

  • ;Xintian Wu;Chaojun Liu
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.6
    • /
    • pp.49-56
    • /
    • 1999
  • In many continuous speech recognition systems based on HMMs, decision tree-based state tying has been used for not only improving the robustness and accuracy of context dependent acoustic modeling but also synthesizing unseen models. To construct the phonetic decision tree, standard method performs one-level pruning using just single Gaussian triphone models. In this paper, two novel approaches, two-level decision tree and multi-mixture decision tree, are proposed to get better performance through more accurate acoustic modeling. Two-level decision tree performs two level pruning for the state tying and the mixture weight tying. Using the second level, the tied states can have different mixture weights based on the similarities in their phonetic contexts. In the second approach, phonetic decision tree continues to be updated with training sequence, mixture splitting and re-estimation. Multi-mixture Gaussian as well as single Gaussian models are used to construct the multi-mixture decision tree. Continuous speech recognition experiment using these approaches on BN-96 and WSJ5k data showed a reduction in word error rate comparing to the standard decision tree based system given similar number of tied states.

  • PDF

A Meta-Model for the Storage of XML Schema using Model-Mapping Approach (모델 매핑 접근법을 이용한 XML 스키마 저장 메타모델에 대한 연구)

  • Lim, Hoon-Tae;Lim, Tae-Soo;Hong, Keun-Hee;Kang, Suk-Ho
    • IE interfaces
    • /
    • v.17 no.3
    • /
    • pp.330-337
    • /
    • 2004
  • Since XML (eXtensible Markup Language) was highlighted as an information interchange format, there is an increasing demand for incorporating XML with databases. Most of the approaches are focused on RDB (Relational Databases) because of legacy systems. But these approaches depend on the database system. Countless researches are being focused on DTD (Document Type Definition). However XML Schema is more comprehensive and efficient in many perspectives. We propose a meta-model for XML Schema that is independent of the database. There are three processes to build our meta-model: DOM (Document Object Model) tree analysis, object modeling and storing object into a fixed DB schema using model mapping approach. We propose four mapping rules for object modeling, which conform to the ODMG (Object Data Management Group) 3.0 standard. We expect that the model will be especially useful in building XML-based e-business applications.

A Study on Basic Modeling Method for MTF Analysis of Observation Satellites (관측위성의 MTF 해석을 위한 기본 모델링 기법 연구)

  • Kim, Do-Myung;Kim, Deok-Ryeol;Kim, Nak-Wan;Suk, Jin-Young;Kim, Hee-Seob;Kim, Gyu-Sun;Hyun, Young-Mok
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.5
    • /
    • pp.472-482
    • /
    • 2008
  • A modulation transfer function(MTF) tree is established to estimate the overall MTF of an observation satellite and to analyze the image performance. Basic MTF models relevant to each MTF tree component are represented as mathematical relationship between optics-structural dynamics, thermal deformation, attitude and dynamic characteristics of a satellite and the effects due to the space environment. The Basic MTF models consist of diffraction limited MTF with central obscuration, aberration, defocus, line-of-sight(LOS) jitter, linear motion, detector integration, and so forth. Performance estimation is demonstrated for a virtual earth-observation satellite in order to validate the constructed modeling method. The proposed models enable the system engineers to calculate the overall system MTF and to determine the crucial design parameters that affect the image performance in the conceptual design phase of an observation satellite.