• Title/Summary/Keyword: tree form

Search Result 489, Processing Time 0.028 seconds

Implementation of Java Bytecode Framework (자바 바이트코드 프레임워크 구현)

  • Kim, Ki-Tae;Kim, Je-Min;Yoo, Weon-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.3
    • /
    • pp.122-131
    • /
    • 2010
  • In this paper, we design and implement CTOC, a new bytecode analysis and translation tool. We also propose E-Tree, a new intermediate code, to efficiently deal with intermediate codes translated from bytecodes. E-Tree is expressed in a tree form by combining relevant bytecode instructions in basic blocks of eCFG to overcome the weaknesses of bytecodes such as complexity and analytical difficulty. To demonstrate the usefulness and possible extensibility of CTOC, we show the creation process of eCFG and E-Tree through practical bytecode analysis and translation and shows the optimization process of a bytecode program as an example of possible extensibility.

Growth Conditions of Natural Monument Old Big Trees in Gyeongsangnamdo, Korea (경상남도 천연기념물 노거수의 생육환경 연구)

  • Kim, Hyo-Jeong
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.14 no.5
    • /
    • pp.103-112
    • /
    • 2011
  • Old big tree transcends the simple meaning of trees as they are the natural monuments that embody the people's history and culture of this land. The Cultural Heritage Administration of Korea(CHA) defines and protects old big tree based not only on the size of the tree but also on its definitive cultural and natural factors such as value, implications, and originality. This research aims to identify and analyze the growth conditions, soil conditions and location character of 20 old big tree in Gyeongsangnamdo korea. The research examined the soundness of the arboreal form, the degree of damage on the bark, as well as the quantity of leafs levels to evaluate the overall condition of growth and development. Also, 9 elements such as soil texture, nitrogen and organic matter content, soil pH, phosphoric acid and EC were further analyzed The research analyzed in correlation of Growth condition and soil. Tree health related positivity that total nitrogen and organic matter. The result which analyzes location character, With natural monument old big trees raising a hand the area where is contiguous appeared with the fact that the farming village style where the rice field and the arable land of field etc. This research aimed at generating some foundational reference data for the analysis of the habitation and management conditions of natural monument old big tree within the Gyeongsangnamdo korea.

A Design and Implementation for Dynamic Relocate Algorithm Using the Binary Tree Structure (이진트리구조를 이용한 동적 재배치 알고리즘 설계 및 구현)

  • 최강희
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.6
    • /
    • pp.827-836
    • /
    • 2001
  • Data is represented by file structure in Computer System. But the file size is to be larger, it is hard to control and transmit. Therefore, in recent years, many researchers have developed new algorithms for the data compression. And now, we introduce a new Dynamic Compression Technique, making up for the weaknesses of huffman's. The huffman compression technique has two weaknesses. The first, it needs two steps of reading, one for acquiring character frequency and the other for real compression. The second, low compression rate caused by storing tree information. These weaknesses can be solved by our new Dynamic Relocatable Method, reducing the reading pass by relocating data file to dynamic form, and then storing tree information from pipeline structure. The first, it needs two steps of reading, one for acquiring character frequency and the other for real compression. The second, low compression rate caused by storing tree information. These weaknesses can be solved by our new Dynamic Relocatable Method, reducing the reading pass by relocating data file to dynamic form, and then storing tree information from pipeline structure.

  • PDF

Fast URL Lookup Using URL Prefix Hash Tree (URL Prefix 해시 트리를 이용한 URL 목록 검색 속도 향상)

  • Park, Chang-Wook;Hwang, Sun-Young
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.67-75
    • /
    • 2008
  • In this paper, we propose an efficient URL lookup algorithm for URL list-based web contents filtering systems. Converting a URL list into URL prefix form and building a hash tree representation of them, the proposed algorithm performs tree searches for URL lookups. It eliminates redundant searches of hash table method. Experimental results show that proposed algorithm is $62%{\sim}210%$ faster, depending on the number of segment, than conventional hash table method.

Fault Diagnosis of Screw type Air Compressor (스크루형 공기압축기의 고장진단)

  • Bae Yong-hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.28 no.7
    • /
    • pp.1092-1100
    • /
    • 2004
  • This paper describes the application of fault tree technique to analyze of compressor failure. Fault tree analysis technique involves the decomposition of a system into the specific form of fault tree where certain basic events lead to a specified top event which signifies the total failure of the system. In this research. fault trees for failure analysis of screw type air compressor are made. This fault trees are used to obtain minimal cut sets from system failure and system failure rate for the top event occurrence can be calculated. It is Possible to estimate air compressor reliability by using constructed fault trees through compressor failure example. It is Proved that FTA is efficient to investigate the compressor failure modes and diagnose system.

A GT-Based CAPP System Uing a Decision Tree

  • Noh, Sang-Do;Shim, Young-Bo;Cho, Hyun-Soo;Lee, Hong-Hee;Lee, Kyo-Il
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.263-266
    • /
    • 1995
  • Comtputer Aided Process Planning(CAPP) has been emerged as playing a key role in Computer Integrated Manufactunng(CIM) as the most critical link to integrate CAD and CAM. A modified variant CAPP system based on process planning rule base is developed in this paper. This CAPP system generates process plans automatically according to the GT code data provided as input. In order to execute process planning, various process planning rules are constructed in the form of decision tree and the inference engine that extracts the process plan based on the tree-structured rules are implemented.

  • PDF

OPTIMAL PORTFOLIO CHOICE IN A BINOMIAL-TREE AND ITS CONVERGENCE

  • Jeong, Seungwon;Ahn, Sang Jin;Koo, Hyeng Keun;Ahn, Seryoong
    • East Asian mathematical journal
    • /
    • v.38 no.3
    • /
    • pp.277-292
    • /
    • 2022
  • This study investigates the convergence of the optimal consumption and investment policies in a binomial-tree model to those in the continuous-time model of Merton (1969). We provide the convergence in explicit form and show that the convergence rate is of order ∆t, which is the length of time between consecutive time points. We also show by numerical solutions with realistic parameter values that the optimal policies in the binomial-tree model do not differ significantly from those in the continuous-time model for long-term portfolio management with a horizon over 30 years if rebalancing is done every 6 months.

A Buffer Insertion Method for RLC Interconnects (RLC 연결선의 버퍼 삽입 방법)

  • 김보겸;김승용;김석윤
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.2
    • /
    • pp.67-75
    • /
    • 2004
  • This paper presents a buffer insertion method for RLC-class interconnect structured as a sin91e line or a tree. First, a closed form expression for the interconnect delay of a CMOS buffer driving single RLC line is represented. This expression has been derived by the n-th power law for deep submicrometer technology and occurs to be within 9 percentage of maximal relative error in accuracy compared with the results of HSPICE simulation for various RLC loads. This paper proposes a closed form expression based on this for the buffer insertion of single RLC lines and the buffer sizing algorithms for RLC tree interconnects to optimize path delays. The proposed buffer insertion algorithms are applied to insert buffers for several interconnect trees with a 0.25${\mu}{\textrm}{m}$ CMOS technology and the results are compared against those of HSPICE.

NC End Milling Strategy of Triangulation-Based Curved Surface Model Using Steepest Directed Tree (최대경사방향 트리를 이용한 삼각형요소화 곡면모델의 NC 엔드밀링가공에 관한 연구)

  • 맹희영
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.9
    • /
    • pp.2089-2104
    • /
    • 1995
  • A novel and efficient cutter path planning method for machining intricately shaped curved surfaces, called the steepest directed tree method, is presented. The curved surface is defined by triangular facets, the density and structure of which are determined by the intricacy and form accuracy of the surface. Geometrical form definition and recognition of the topological features are used to connect the nodes of the triangulated surface meshes for the successive and interconnected steepest pathways, which makes good use of end milling characteristics. The planetary cutter centers are determined to locate along smoothly changing paths and then the height values of the cutter are adjusted to avoid surface interference. Several machined examples of intersecting and intricate surfaces are presented to illustrate the benefits of the new approach. It is shown that due to more consistent geometry matching between cutter and surface(in comparison with the current CC Cartesian method) surface finish can be typically improved. Moreover, the material in concave fillets which is difficult to be removed by ball mills can be removed efficiently. The built-in positioning of cutter to avoid interference runs minutely in the sharp and discontinuous regions. The steepest upward movement of the cutter gives a stable dynamic cutting state and allows increase in the feedrate and spindle speed while remaining the stable cutting state.

TREE FORM CLASSIFICATION OF OWNER PAYMENT BEHAVIOUR

  • Hanh Tran;David G. Carmichael;Maria C. A. Balatbat
    • International conference on construction engineering and project management
    • /
    • 2011.02a
    • /
    • pp.526-533
    • /
    • 2011
  • Contracting is said to be a high-risk business, and a common cause of business failure is related to cash management. A contractor's financial viability depends heavily on how actual payments from an owner deviate from those defined in the contract. The paper presents a method for contractors to evaluate the punctuality and fullness of owner payments based on historical behaviour. It does this by classifying owners according to their late and incomplete payment practices. A payment profile of an owner, in the form of aging claims submitted by the contractor, is used as a basis for the method's development. Regression trees are constructed based on three predictor variables, namely, the average time to payment following a claim, the total amount ending up being paid within a certain period and the level of variability in claim response times. The Tree package in the publicly available R program is used for building the trees. The analysis is particularly useful for contractors at the pre-tendering stage, when contractors predict the likely payment scenario in an upcoming project. Based on the method, the contractor can decide whether to tender or not tender, or adjust its financial preparations accordingly. The paper is a contribution in risk management applied to claim and dispute resolution practice. It is argued that by contractors having a better understanding of owner payment behaviour, fewer disputes and contractor business failures will occur.

  • PDF