• Title/Summary/Keyword: R+-tree

Search Result 1,152, Processing Time 0.028 seconds

Lightweighted CTS Preconstruction Techniques for Checking Clock Tree Synthesizable Paths in RTL Design Time (레지스터 전달 수준 설계단계에서 사전 클럭트리합성 가능여부 판단을 위한 경량화된 클럭트리 재구성 방법)

  • Kwon, Nayoung;Park, Daejin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.10
    • /
    • pp.1537-1544
    • /
    • 2022
  • When designing chip, it considers design specification, timing problem, and clock synchronization on place & route (P&R) process. P&R process is complicated because of considering various factors. Chip uses clock tree synthesis (CTS) to reduce clock path delay. The purpose of this study is to examine shallow-CTS algorithm for checking clock tree synthesizable. Using open source Parser-Verilog, register transfer level (RTL) synthesizable Verilog file is parsed and it uses Pre-CTS and Post-CTS process that is included shallow-CTS. Based on longest clock path in the Pre-CTS and Post-CTS stages, the standard deviation before and after buffer insertion is compared and analyzed for the accuracy of CTS. In this paper, It is expected that the cost and time problem could be reduced by providing a pre-clock tree synthesis verification method at the RTL level without confirming the CTS result using the time-consuming licensed EDA tool.

ON THE FIBERS OF THE TREE PRODUCTS OF GROUPS WITH AMALGAMATION SUBGROUPS

  • ABDALLAH AL-HUSBAN;DOAA AL-SHAROA;RANIA SAADEH;AHMAD QAZZA;R.M.S. MAHMOOD
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.6
    • /
    • pp.1237-1256
    • /
    • 2023
  • The tree products of groups with amalgamation subgroups are generalizations of the free products of groups with amalgamation subgroup. The aim of this paper is to construct a tree called the standard tree where the tree products of groups with amalgamation subgroups act without inversions and then find the quotient of this action. Furthermore, we show that if the amalgamation subgroups are finite and the factor groups act on disjoint trees then there exists a tree called the fiber tree where the tree products of groups with amalgamation subgroups act without inversions and find the quotients of this action. If each factor is a tree products with amalgamation subgroups, we get a new fiber tree and the corresponding factors.

Storage and Retrieval Architecture based on Key-Value Solid State Device (Key-Value Solid State Device 기반의 저장 및 검색 아키텍처)

  • Sun, Yu Xiang;Lee, Yong-Ju
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.1
    • /
    • pp.45-52
    • /
    • 2020
  • This paper proposes a solution for storage and retrieval problems for Resource Description Framework (RDF) data utilizing a key-value Solid State Device (SSD), considering storage, retrieval performance, and security. We propose a two-step compression algorithm to separate logical relationship and true values from RDF data-sets using the key-value SSD. This improves not only compression and storage efficiency but also storage security. We also propose a hybrid retrieval structure based on R∗-tree to enhance retrieval efficiency and implement a sort-merge join algorithm, and discuss factors affecting R∗-tree retrieval efficiency. Finally, we show the proposed approach is superior to current compression, storage, and retrieval approaches, obtaining target results faster while requiring less space, and competitive in terms of versatility, flexibility and security.

Power-Aware Query Processing Using Optimized Distributed R-tree in Sensor Networks (센서 네트워크 환경에서 최적화된 분산 R-tree를 이용한 에너지 인식 질의 처리 방법)

  • Pandey Suraj;Eo Sang-Hun;Kim Ho-Seok;Bae Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.13D no.1 s.104
    • /
    • pp.23-28
    • /
    • 2006
  • In this paper, a power-aware query processing using optimized distributed R-tree in a sensor network is proposed. The proposed technique is a new approach for processing range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. The previous work just addressed the importance but didn't provide any efficient technique for processing range queries. A query processing scheme is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.

Aggregation Method using R-tree for Spatial Continuous Query in DSMS (DSMS에서 영역을 포함하는 공간 연속질의 처리를 위한 R-tree기반의 집계기법)

  • Kim, Sang-Ki;Li, Yan;Lee, Dong-Wook;Oh, Young-Hwan;Bae, Hae-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06c
    • /
    • pp.80-84
    • /
    • 2008
  • DSMS는 USN과 같은 환경으로부터 스트림데이터를 실시간으로 입력 받아 등록된 연속질의를 처리하는 시스템이다. DSMS는 등록된 연속질의 처리를 위해 필요한 데이터를 버퍼에 관리하며, 스트림데이터의 저장기법에 따라 연속질의 처리 성능 및 버퍼 저장비용이 개선될 수 있으며, DSMS에서 연속질의는 특정 스트림데이터에 대해 일정한 기간 동안의 평균 값, 최대 소 값, 누적 값 등의 집계 연산을 요구하는 경우가 많다. 기존의 DSMS에서는 이러한 집계 연산이 필요한 연속질의의 효율적인 처리를 위해 LINT, BINT등의 자원 공유 집계 처리기법이 제안 되었다. 하지만 기존의 자원공유 집계 기법들은 위치 값을 포함하는 GeoSensing 데이터에 대한 고려를 하지 않았다. 본 논문에서는 공간 DSMS에서 공간영역질의 기반의 연속질의를 효율적으로 처리하기 위한 R-tree기반의 집계기법을 제안한다. 이는 각각의 연속질의에 포함된 공간 영역을 R-tree 인덱스로 구성하고, 연속질의에 필요한 공간 스트림데이터에 대한 집계값을 저장하여 연속질의를 처리하는 것이다. 제안기법은 공간 DSMS에서 공간영역 기반의 연속질의 처리 성능을 개선할 수 있으며, R-tree 기반으로 해당 영역에 대한 데이터 만을 버퍼에 관리하여 저장비용을 줄일 수 있다.

  • PDF

Efficient Execution of Range Mosaic Queries (범위 모자이크 질의의 효율적인 수행)

  • Hong, Seok-Jin;Bae, Jin-Uk;Lee, Suk-Ho
    • Journal of KIISE:Databases
    • /
    • v.32 no.5
    • /
    • pp.487-497
    • /
    • 2005
  • A range mosaic query returns distribution of data within the query region as a pattern of mosaic, whereas a range aggregate query returns a single aggregate value of data within the query region. The range mosaic query divides a query region by a multi-dimensional grid, and calculates aggregate values of grid cells. In this paper, we propose a new type of query, range mosaic query and a new operator, mosaic-by, with which the range mosaic queries can be represented. In addition, we suggest efficient algorithms for processing range mosaic queries using an aggregate R-tree. The algorithm that we present computes aggregate results of every mosaic grid cell by one time traversal of the aggregate R-tree, and efficiently executes the queries with only a small number of node accesses by using the aggregate values of the aggregate R-tree. Our experimental study shows that the range mosaic query algorithm is reliable in terms of performance for several synthetic datasets and a real-world dataset.

Verifying the Possibility of Investigating Tree Ages Using Resistograph (레지스토그래피를 이용한 수령조사 가능성 검토)

  • Oh, Jung-ae;Seo, Jeong-Wook;Kim, Byung-Ro
    • Journal of the Korean Wood Science and Technology
    • /
    • v.47 no.1
    • /
    • pp.90-100
    • /
    • 2019
  • This study aims to determine the ideal feed speed of a resistograph to evaluate the number of tree rings in several tree species. The needle speed was fixed at 1,500 r/min. Herein, various tree species, such as Pseudotsuga menziesii, Pinus koraiensis, Abies holophylla, and Zelkova serrata, were considered for experiments. Results showed that the most proper feed speed for Zelkova serrata, Larix kaempferi, Pseudotsuga menziesii, Abies holophylla, and Pinus koraiensis was 75, 100, 100, 150, and 175 cm/min, respectively. However, in all the cases, the electric resistance values of tree ring narrower than 1 mm were not suitable for determining tree-ring boundaries. Upon comparing the inter-annual time series of ring widths and electric resistance values of resistograph, a meaningful synchronization was verified. If resistograph would be improved to the extent that it can measure tree rings narrower than 1 mm, it can replace the conventional method used for counting the number of tree rings in the increment cores. Additionally, it can also be used to investigate the tree growth.

Relation between crown-length, tree-height, diameter Clear-bale length and the longest branch length in a Pinus densiflora stand (적송림(赤松林)에 있어서의 성장인자간(成長因子間)의 상관(相關))

  • Yim, Kyong Bin;Pack, Myong Kyu
    • Journal of Korean Society of Forest Science
    • /
    • v.5 no.1
    • /
    • pp.27-32
    • /
    • 1966
  • Taking an opportunity of the application of clearcutting method, 140 red pine (Pinus densiflora Sieb. et Zucc.) trees grown at Chon-nam province, the southern part of South Korea, were fellen and the tree height, clear-bole length, D.B.H. diameter at base(0.2m above from the ground line) and the length of the longest branch were measured. The correlation between factors mentioned were analysed. The results are summarized as follows: 1. The correlation between crown length and tree height (r=0.821) was sinificant. 2. The correlation between the diameter at base and D.B.H. was highly significant (r=0.961). D.B.H. can be calculated from multiplying the diameter at base by 0.88. 3. A weak relation between D.B.H and tree height was abserved. 4. The positive correlation between tree height and clear-bole-length was calculated, but it was not sharp between D.B.H. and the length of the longest branch. 5. The height, basal area, D.B.H. and volume increment by tree class calculated from the data of the stem analysis are presented (Tab. 3~10).

  • PDF

Mariannaea samuelsii Isolated from a Bark Beetle-Infested Elm Tree in Korea

  • Tang, Longqing;Hyun, Min-Woo;Yun, Yeo-Hong;Suh, Dong-Yeon;Kim, Seong-Hwan;Sung, Gi-Ho;Choi, Hyung-Kyoon
    • Mycobiology
    • /
    • v.40 no.2
    • /
    • pp.94-99
    • /
    • 2012
  • During an investigation of fungi from an elm tree infested with bark beetles in Korea, one isolate, DUCC401, was isolated from elm wood. Based on morphological characteristics and phylogenetic analysis of the internal transcribed spacer and 28S rDNA (large subunit) sequences, the isolate, DUCC401, was identified as Mariannaea samuelsii. Mycelia of the fungus grew faster on malt extract agar than on potato dextrose agar and oatmeal agar media. Temperature and pH for optimal growth of fungal mycelia were 25oC and pH 7.0, respectively. The fungus demonstrated the capacity to degrade cellobiose, starch, and xylan. This is the first report on isolation of Mariannaea samuelsii in Korea.

Adaptive Cell-Based Index For Moving Objects In Indoor

  • Shin, Soong-Sun;Kim, Gyoung-Bae;Bae, Hae-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1815-1830
    • /
    • 2012
  • Existing R-tree that is based on a variety of outdoor-based techniques to manage moving objects have been investigated. Due to the different characteristics of the indoor and outdoor, it is difficult to management of moving object using existed methods in indoor setting. We propose a new index structure called ACII(adaptive Cell-based index for Indoor moving objects) for Indoor moving objects. ACII is Cell-based access structure adopting an overlapping technique. The ACII refines cells adaptively to handle indoor regional data, which may change its locations over time. The ACII consumed at most 30% of the space required by R-tree based methods, and achieved higher query performance compared with r-tree based methods.