• Title/Summary/Keyword: And-Or tree

Search Result 2,669, Processing Time 0.031 seconds

A New Fast Algorithm for Short Range Force Calculation (근거리 힘 계산의 새로운 고속화 방법)

  • Lee, Sang-Hwan;Ahn, Cheol-O
    • 유체기계공업학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.383-386
    • /
    • 2006
  • In this study, we propose a new fast algorithm for calculating short range forces in molecular dynamics, This algorithm uses a new hierarchical tree data structure which has a high adaptiveness to the particle distribution. It can divide a parent cell into k daughter cells and the tree structure is independent of the coordinate system and particle distribution. We investigated the characteristics and the performance of the tree structure according to k. For parallel computation, we used orthogonal recursive bisection method for domain decomposition to distribute particles to each processor, and the numerical experiments were performed on a 32-node Linux cluster. We compared the performance of the oct-tree and developed new algorithm according to the particle distributions, problem sizes and the number of processors. The comparison was performed sing tree-independent method and the results are independent of computing platform, parallelization, or programming language. It was found that the new algorithm can reduce computing cost for a large problem which has a short search range compared to the computational domain. But there are only small differences in wall-clock time because the proposed algorithm requires much time to construct tree structure than the oct-tree and he performance gain is small compared to the time for single time step calculation.

  • PDF

The Analysis of Education Program Model for the Thinking Extension Ability of the Gifted in Information Based on Tree (정보영재의 사고력 신장을 위한 트리 기반 교육 프로그램의 분석)

  • Jung, Deok-Gil;Lho, Young-Uhg
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.543-546
    • /
    • 2007
  • 이 논문에서는 정보 영재의 사고력 신장을 위한 교육 프로그램으로 트리 기반의 모델을 제시하고 분석한다. 제시된 모델은 문제를 표현하는 트리(tree)의 유형에 따라 AND 트리, OR 트리, AND/OR 트리로 구분하여 문제를 해결하는 모텔들로 세분화 된다. 구성되는 트리의 유형에 따라 문제를 해결하는 방법론으로는 서로 상이한 알고리즘을 적용해야함을 보이고 있다. 구성되는 트리의 모형에 따라 적용되는 알고리즘에는 recursion과 heuristic 탐색 방법 등이 도입되어 적용된다. 이 모델은 저 수준의 사고력을 요구하는 간단한 모형에서 출발하여 고 수준의 사고력을 요구하는 복잡한 모형으로 발전시키는 교육 방법을 제시함으로써 사고력 신장의 정도에 따라 초등학교 학생들로부터 중학교, 고등학교 학생들에 이르기 까지 대상을 확대하여 점진적으로 적용할 수 있는 교육 방법이 될 수 있을 것으로 사료된다.

  • PDF

A Time Tree Scheduling Scheme for Energy Efficiency and Collision Avoidance in Sensor Networks (센서 네트워크에서 에너지 효율과 충돌 회피를 위한 타임 트리 스케줄링)

  • Lee, Kil-Hung
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.7
    • /
    • pp.962-970
    • /
    • 2009
  • This paper presents a data gathering and scheduling scheme for wireless sensor networks. We use a data gathering tree for sending the data from the sensor node to the base station. For an energy efficient operation of the sensor networks in a distributed manner, a time tree is built in order to reduce the collision probability and to minimize the total energy required to send data to the base station. A time tree is a data gathering tree where the base station is the root and each sensor node is either a relaying or a leaf node of the tree. Each tree operates in a different time schedule with possible different activation rate. Through the simulation, we found that the proposed scheme that uses time trees shows better characteristics in energy and data arrival rate when compared with other schemes such as SMAC and DMAC.

  • PDF

I-Tree: A Frequent Patterns Mining Approach without Candidate Generation or Support Constraint

  • Tanbeer, Syed Khairuzzaman;Sarkar, Jehad;Jeong, Byeong-Soo;Lee, Young-Koo;Lee, Sung-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.31-33
    • /
    • 2007
  • Devising an efficient one-pass frequent pattern mining algorithm has been an issue in data mining research in recent past. Pattern growth algorithms like FP-Growth which are found more efficient than candidate generation and test algorithms still require two database scans. Moreover, FP-growth approach requires rebuilding the base-tree while mining with different support counts. In this paper we propose an item-based tree, called I-Tree that not only efficiently mines frequent patterns with single database scan but also provides multiple mining scopes with multiple support thresholds. The 'build-once-mine-many' property of I-Tree allows it to construct the tree only once and perform mining operation several times with the variation of support count values.

  • PDF

A top-down iteration algorithm for Monte Carlo method for probability estimation of a fault tree with circular logic

  • Han, Sang Hoon
    • Nuclear Engineering and Technology
    • /
    • v.50 no.6
    • /
    • pp.854-859
    • /
    • 2018
  • Calculating minimal cut sets is a typical quantification method used to evaluate the top event probability for a fault tree. If minimal cut sets cannot be calculated or if the accuracy of the quantification result is in doubt, the Monte Carlo method can provide an alternative for fault tree quantification. The Monte Carlo method for fault tree quantification tends to take a long time because it repeats the calculation for a large number of samples. Herein, proposal is made to improve the quantification algorithm of a fault tree with circular logic. We developed a top-down iteration algorithm that combines the characteristics of the top-down approach and the iteration approach, thereby reducing the computation time of the Monte Carlo method.

An Extended Frequent Pattern Tree for Hiding Sensitive Frequent Itemsets (민감한 빈발 항목집합 숨기기 위한 확장 빈발 패턴 트리)

  • Lee, Dan-Young;An, Hyoung-Geun;Koh, Jae-Jin
    • The KIPS Transactions:PartD
    • /
    • v.18D no.3
    • /
    • pp.169-178
    • /
    • 2011
  • Recently, data sharing between enterprises or organizations is required matter for task cooperation. In this process, when the enterprise opens its database to the affiliates, it can be occurred to problem leaked sensitive information. To resolve this problem it is needed to hide sensitive information from the database. Previous research hiding sensitive information applied different heuristic algorithms to maintain quality of the database. But there have been few studies analyzing the effects on the items modified during the hiding process and trying to minimize the hided items. This paper suggests eFP-Tree(Extended Frequent Pattern Tree) based FP-Tree(Frequent Pattern Tree) to hide sensitive frequent itemsets. Node formation of eFP-Tree uses border to minimize impacts of non sensitive frequent itemsets in hiding process, by organizing all transaction, sensitive and border information differently to before. As a result to apply eFP-Tree to the example transaction database, the lost items were less than 10%, proving it is more effective than the existing algorithm and maintain the quality of database to the optimal.

THE APPLICATION OF PSA TECHNIQUES TO THE VITAL AREA IDENTIFICATION OF NUCLEAR POWER PLANTS

  • HA JAEJOO;JUNG WOO SIK;PARK CHANG-KUE
    • Nuclear Engineering and Technology
    • /
    • v.37 no.3
    • /
    • pp.259-264
    • /
    • 2005
  • This paper presents a vital area identification (VAI) method based on the current fault tree analysis (FTA) and probabilistic safety assessment (PSA) techniques for the physical protection of nuclear power plants. A structured framework of a top event prevention set analysis (TEPA) application to the VAI of nuclear power plants is also delineated. One of the important processes for physical protection in a nuclear power plant is VAI that is a process for identifying areas containing nuclear materials, structures, systems or components (SSCs) to be protected from sabotage, which could directly or indirectly lead to core damage and unacceptable radiological consequences. A software VIP (Vital area Identification Package based on the PSA method) is being developed by KAERI for the VAI of nuclear power plants. Furthermore, the KAERI fault tree solver FTREX (Fault Tree Reliability Evaluation eXpert) is specialized for the VIP to generate the candidates of the vital areas. FTREX can generate numerous MCSs for a huge fault tree with the lowest truncation limit and all possible prevention sets.

Environmental Factors Influencing Tree Species Regeneration in Different Forest Stands Growing on a Limestone Hill in Phrae Province, Northern Thailand

  • Asanok, Lamthai;Marod, Dokrak
    • Journal of Forest and Environmental Science
    • /
    • v.32 no.3
    • /
    • pp.237-252
    • /
    • 2016
  • Improved knowledge of the environmental factors affecting the natural regeneration of tree species in limestone forest is urgently required for species conservation. We examined the environmental factors and tree species characteristics that are important for colonization in diverse forest stands growing on a limestone hill in northern Thailand. Our analysis estimated the relative influence of forest structure and environmental factors on the regeneration traits of tree species. We established sixty-four $100-m^2$ plots in four forest stands on the limestone hill. We determined the species composition of canopy trees, regenerating seedlings, and saplings in relation to the physical environment. The relationships between environmental variables and tree species abundance were assessed by canonical correspondence analysis (CCA), and we used generalized linear mixed models to examine data on seedling/sapling abundances. The CCA ordination indicated that the abundance of tree species within the mixed deciduous forest was closely related to soil depth. The abundances of tree species growing within the sink-hole and hill-slope stands were positively related to the extent of rocky outcropping; light and soil moisture positively influenced the abundance of tree species in the hill-cliff stand. Physical factors had a greater effect on tree regeneration than did factors related to forest structure. Tree species, such as Ficus macleilandii, Dracaena cochinchinensis, and Phyllanthus mirabilis within the hill-cliff or sink-hole stand, colonized well on large rocky outcroppings that were well illuminated and had soft soils. These species regenerated well under conditions prevailing on the limestone hill. The colonization of several species in other stands was negatively influenced by environmental conditions at these sites. We found that natural regeneration of tree species on the limestone hill was difficult because of the prevailing combination of physical and biological factors. The influence of these factors was species dependent, and the magnitude of effects varied across forest stands.

Species for Tree Saps in Mt. Sobaek Area and Its Sap Resources (소백산지역의 수액채취수종의 분포 및 수액채취량)

  • Kim, Hong-Eun;Kwon, Ki-Chul;Park, Cheol-Ha;Cho, Nam-Seok
    • Journal of the Korean Wood Science and Technology
    • /
    • v.26 no.3
    • /
    • pp.81-92
    • /
    • 1998
  • Lately public interest in tree saps of maple and birch trees has been increased for sap drink as a natural medical beverage. To ensure tree sap drink for commercial production, species which are available in resources, their ecological regeneration characteristics in the natural forest stand, and tree sap resources should be investigated. Species for the collecting tree saps and their distribution were surveyed in the areas of Mt.Sobaek, Tanyang-gun, Chungcheongbuk-do. Mt.Sobaek area was selected to the proper place to survey as the feasible area for tapping tree saps for the natural beverage. Feasible tree species of this area are Betula costata, Betula schmidtii, Comus controversa, Acer mono, and Acer pseudosieboldianum based on the estimated tree sap amounts. Average and maximum species diversities of surveyed area were 4.2 and 5.39, respectively. Its evenness 0.78 referred that there are actively progressing ecological regeneration among diverse tree species. Tree saps are mainly harvested at the areas of upper and lower Wonmanteo. In terms of species, the most high sap amounts were from birch sap, next Comus controversa, the 3rd Acer mono. Many measures were suggested ecologically and technically, for commercial or practical production of tree sap drinks, though Mt.Sobaek area was evaluated as improper place because of geographical and transportational limitation.

  • PDF

Within0tree Disribution of matsucoccus thunbergianae on Pinus thunbergiana (해송에서의 솔껍질깍지의 벌레 수상분포 양식)

  • 박승찬
    • Korean journal of applied entomology
    • /
    • v.33 no.2
    • /
    • pp.114-121
    • /
    • 1994
  • Population densities of intermediate nymphs and egg saw of Matsucoccus thunbergianae, a major insect pest of Pinus thunbergiona in southern coastal area of Korean peninsula, were est~mated. Tree samples of ca. 10cm D.B.H. were collected from old infestation area and newly invaded area. The numben of plimaly branches per tree were not significantly different by the locality, but those of secondaly and smaller branches were smaller in old infestation area The numbers of intermediate nymphs per tree in old infestation area and in newly invaded area were 10.8 and 13.1 times more than those on the trunk, respectively Approximately between 4, 200 and 208, 500 nymphs per tree were estimated. Men secondaw and smaller bmnch samples collected from the basal part of middle crown height, or from the central or the basal part of lower crown height, the number of samples required for the emr range of 20% were 21 and 11 far 10-20cm and 20-3 crn long branches, respectively. Approx~mately 63.6% of egg sacs of the whole tree were on the trunk. The node/intemode bearing the largest branch had the highest egg sac density; including that, four adjacent nodes/intemodes had ca. 37% of egg saw on the trunk.

  • PDF