检索结果-内蒙古大学图书馆

Acta Mathematica Scientia 1983年第3期3卷 263-284页

作者：李传湘 Wuhan Institute of Methematical Sciences Academia Sinica

It is the main aim in this papar to establish isomorphic relation between an equibottom tree class and an integeral sequence,and to study emphatically the expanding process of a tree and the iterative algorithm on the... 详细信息

关键词： ZT tree data structure ST 一弓 tree

来源：评论

学校读者我要写书评

暂无评论

FAST IMPLEMENTATION OF PARTIAL GRAM-SCHMIDT ALGORITHM USING tree data structure WITH SEQUENTIAL ROW POINTERS data structure TO SOLVE STRUCTURAL PROBLEMS (PGS)

引用

ADVANCES IN ENGINEERING SOFTWARE 1993年第3期18卷 187-197页

作者： AJIZ, MA ALAALI, MA HAMED, MM BAHRAIN UNIV DEPT COMP SCIISA TOWNBAHRAIN

In this paper, tree data structure with sequential row pointers data structure is developed and used to implement the Partial Gram-Schmidt triangularization algorithm. This algorithm is used to find the solution of linear equations arising from many structural and network problems where the original matrix is non-symmetric and highly sparse, that is, the ratio between zeros and nonzeros elements is very large. An algorithm is developed using the above data structure and results are compared with the method given in M. A. Ajiz, Incomplete Methods For Computer Structural Analysis, PhD Thesis, Queen's University Belfast, 1982 and Ajiz & Jennings, Int. J. Num. Meth. Engng., 20, 949-966, 1984. Conjugate gradients algorithm is used in conjunction with Partial Gram-Schmidt algorithm to obtain the solution of problems obtaining four figure accuracy.

关键词： PARTIAL GRAM-SCHMIDT (PGS) tree data structure SEQUENTIAL ROW POINTER data structure STRUCTURAL PROBLEMS

来源：评论

学校读者我要写书评

暂无评论

Retinal Image Recognition Using tree data structure Search Method with Fractal Dimension Descriptors

引用

Procedia Technology 2013年 9卷 1074-1084页

作者： Diana Craveiro Mourão Carlos Manta Oliveira Luís A. Da Silva Cruz Department of Physics Faculty of Sciences and Technology University of Coimbra Rua Larga 3004-516 Coimbra Portugal Critical Health S.A. Parque Industrial de Taveiro Lote 48 – 3045 – 504 Coimbra Portugal Department of Electrical and Computer Engineering Faculty of Sciences and Technology University of Coimbra 3030-290 Coimbra Portugal

Monitoring the evolution of retinal pathologies can be done by comparing images from the same patient captured at different times. Therefore when a new retinal image is recorded it is important to identify other images in the image database that belong to the same patient. This paper explores the combination of tree data structures with Fractal Dimension image feature descriptors in order to identify a subset of images of the same patient. The method presented filters-out most of the database images retaining only about 19% of the total database population making the following identification-by-registration step a lot less complex, resulting in a decrease of about 86% in the total database search time when compared to an exhaustive search.

关键词： Retinal Image Retinal Image Recognition Image Retrieval tree data structure Fractal Dimension

来源：评论

学校读者我要写书评

暂无评论

q-gram matching using tree models

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND data ENGINEERING 2006年第4期18卷 433-447页

作者： Fogla, P Lee, W Georgia Inst Technol Coll Comp Atlanta GA 30332 USA

q-gram matching is used for approximate substring matching problems in a wide range of application areas, including intrusion detection. In this paper, we present a tree-based model to perform fast linear time q-gram matching. All q-grams present in the text are stored in a tree structure similar to Trie. We use a tree redundancy pruning algorithm to reduce the size of the tree without losing any information. We also use suffix links for fast q-gram search during query matching. We compare our work with the Rabin-Karp- based hash-table technique, commonly used for multiple q-gram search. We present results of experiments on system call sequence data used for intrusion detection.

关键词： intrusion detection q-gram matching pattern matching search problems string matching suffix tree trees tree data structure word processing

来源：评论

学校读者我要写书评

暂无评论

One billion points in the cloud - an octree for efficient processing of 3D laser scans

引用

ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING 2013年第Feb.期76卷 76-88页

作者： Elseberg, Jan Borrmann, Dorit Nuechter, Andreas Jacobs Univ Bremen gGmbH Automat Grp Sch Engn & Sci D-28759 Bremen Germany

Automated 3-dimensional modeling pipelines include 3D scanning, registration, data abstraction, and visualization. All steps in such a pipeline require the processing of a massive amount of 3D data, due to the ability of current 3D scanners to sample environments with a high density. The increasing sampling rates make it easy to acquire Billions of spatial data points. This paper presents algorithms and data structures for handling these data. We propose an efficient octree to store and compress 3D data without loss of precision. We demonstrate its usage for an exchange file format, fast point cloud visualization, sped-up 3D scan matching, and shape detection algorithms. We evaluate our approach using typical terrestrial laser scans. (C) 2012 International Society for Photogrammetry and Remote Sensing, Inc. (ISPRS) Published by Elsevier B.V. All rights reserved.

关键词： Octree tree data structure data compression Frustum culling Ray casting RANSAC Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Memory Efficient Hierarchical Lookup Tables for Mass Arbitrary-Side Growing Huffman trees Decoding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2008年第10期18卷 1335-1346页

作者： Wang, Sung-Wen Wu, Ja-Ling Chuang, Shang-Chih Hsiao, Chih-Chleh Tung, Yi-Shin Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 106 Taiwan Hon Hai Precis Ind Co Ltd Taipei 106 Taiwan

This paper addresses the optimization problem of minimizing the number of memory access subject to a rate constraint for any Huffman decoding of various standard codecs. We propose a Lagrangian multiplier based penalty-resource metric to be the targeting cost function. To the best of our knowledge, there is few related discussion, in the literature, on providing a criterion to judge the approaches of entropy decoding under resource constraint. The existing approaches which dealt with the decoding of the single-side growing Huffman tree may not be memory-efficient for arbitrary-side growing Huffman trees adopted in current codecs. By grouping the common prefix part of a Huffman tree, in stead of the commonly used single-side growing Huffman tree, we provide a memory efficient hierarchical lookup table to speed up the Huffman decoding. Simulation results show that the proposed hierarchical table outperforms previous methods. A Viterbi-like algorithm is also proposed to efficiently find the optimal hierarchical table. More importantly, the Viterbi-like algorithm obtains the same results as that of the brute-force search algorithm.

关键词： Audio/video decoding Huffman decoding tree data structure

来源：评论

学校读者我要写书评

暂无评论

Leveraging Write Heterogeneity of Phase Change Memory on Supporting Self-Balancing Binary tree

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2022年第6期41卷 1757-1770页

作者： Chang, Che-Wei Wu, Chun-Feng Chang, Yuan-Hao Yang, Ming-Chang Chang, Chieh-Fu Chang Gung Univ Dept Comp Sci & Informat Engn Sch Elect & Comp Engn Coll Engn Taoyuan 333 Taiwan Chang Gung Univ Artificial Intelligence Res Ctr Taoyuan 333 Taiwan Chang Gung Mem Hosp Dept Phys Med & Rehabil Taoyuan 333 Taiwan Acad Sinica Inst Informat Sci Taipei 115 Taiwan Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Peoples R China

With the increasing demand of massive/big data applications, nonvolatile memory (NVM), such as phase-change memory (PCM), has become a promising candidate to replace DRAM because of its low leakage power, nonvolatility, and high density. However, most of the existing memory read/write intensive algorithms and data structures are not aware of the PCM write heterogeneity in terms of both energy consumption and latency. In particular, self-balancing binary search trees, which are widely used to manage massive data in the big-data era, were designed without the consideration of PCM characteristics. Thus, the multiple rotations of the tree balancing process would degrade the memory performance. This work explores the relations among nodes and analyzes tree operations, and the node indexing and address mapping are redesigned to reduce the tree management overhead on single-level cell (SLC) PCM by decreasing the number of bit flips of tree rotations. When multilevel cell (MLC) PCM is included, our address mapping algorithm is developed to reduce the total energy consumption and latency with considerations of the heterogeneous write operations of different cell states. Experimental results show that our solution significantly outperforms the original implementation of a self-balancing binary search tree when the amount of data is large.

关键词： Phase change materials Random access memory Vegetation Binary search trees Nonvolatile memory Memory management Energy consumption Energy saving multilevel cell (MLC) nonvolatile memory (NVM) phase-change memory (PCM) tree data structure write heterogeneity

来源：评论

学校读者我要写书评

暂无评论

Adaptive spatial decomposition in fast multipole method

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2007年第1期226卷 17-28页

作者： Zhang, J. M. Tanaka, Masa. Hunan Univ Coll Mech & Automot Engn State Key Lab Adv Design & Mfg Vehicle Body Changsha 410082 Peoples R China Shinshu Univ Fac Engn Nagano 380 Japan

This work presents a new adaptive node-cluster algorithm for fast multipole method. In the algorithm, we use rectangular boxes instead of cubes, subdivide a box based on its shape, and tighten the child boxes at each subdivision step. More importantly, we determine the number of expansion terms in multipole to local translations according to the distance between the two interaction boxes. Our method is tested using benchmark examples for three-dimensional potential problems. The results obtained show that the new algorithm can solve a problem with 100 thousands nodes in about 20 min, and runs nearly three times faster than the standard algorithm. The proposed algorithm is especially suitable for treating slender and shell-like structures. (C) 2007 Elsevier Inc. All rights reserved.

关键词： adaptive node-cluster tree data structure fast multipole method hybrid boundary node method

来源：评论

学校读者我要写书评

暂无评论

FIVE GOOD REASONS TO USE THE HIERARCHICAL data FORMAT

引用

COMPUTING IN SCIENCE & ENGINEERING 2010年第5期12卷 84-90页

作者： Poinot, Marc Onera the French Aerosp. Labs. France

Practical experience migrating to HDF for a numerical simulation library illustrates the storage system's benefits as well as how numerical simulation codes contribute to an open system. In this article describe the hierarchical data format the computational fluid dynamics (CFD) data storage for the CFD General Notation Standard (CGNS).

关键词： CFD General Notation Standard CFD General Notation System (CGNS) Computational Fluid Dynamics HDF Hierarchical data Format (HDF) Numerical simulation computational fluid dynamic data storage computational fluid dynamics hierarchical data format mathematics computing numerical simulation codes numerical simulation library open system open systems open systems physics computing scientific computing storage system tree data structure tree data structures

来源：评论

学校读者我要写书评

暂无评论

Representing financial time series based on data point importance

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2008年第2期21卷 277-300页

作者： Fu, Tak-chung Chung, Fu-lai Luk, Robert Ng, Chak-man Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China Hong Kong Inst Vocat Educ Chai Wan Dept Comp & Informat Management Chaiwan Hong Kong Peoples R China

Recently, the increasing use of time series data has initiated various research and development attempts in the field of data and knowledge management. Time series data is characterized as large in data size, high dimensionality and update continuously. Moreover, the time series data is always considered as a whole instead of individual numerical fields, Indeed, a large set of time series data is from stock market. Stock time series has its own characteristics over other time series. Moreover, dimensionality reduction is an essential step before many dine series analysis and mining tasks. For these reasons, research is prompted to augment existing technologies and build new representation to manage financial time series data. In this paper, financial time series is represented according to the importance of the data points. With the concept of data point importance, a tree data structure, which supports incremental updating, is proposed to represent the time series and an access method for retrieving the time series data point from the tree, which is according to their order of importance, is introduced. This technique is capable to present the time series in different levels of detail and facilitate multi-resolution dimensionality reduction of the time series data. In this paper, different data point importance evaluation methods,,I new updating method and two dimensionality reduction approaches are proposed and evaluated by a series of experiments. Finally, the application of the proposed representation oil mobile environment is demonstrated.

关键词： financial time series representation multi-resolution visualization incremental updating Dimensionality reduction tree data structure mobile application

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：