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

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

来源：评论

学校读者我要写书评

暂无评论

PKT: fast color-based spatial model for human skin detection

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2021年第21-23期80卷 32807-32839页

作者： Samson, Grace L. Lu, Joan Univ Huddersfield Dept Comp Sci Huddersfield W Yorkshire England Univ Abuja Dept Comp Sci Abuja Nigeria

We present a new detection method for color-based object detection, which can improve the performance of learning procedures in terms of speed, accuracy, and efficiency, using spatial inference, and algorithm. We applied the model to human skin detection from an image;however, the method can also work for other machine learning tasks involving image pixels. We propose (1) an improved RGB/HSL human skin color threshold to tackle darker human skin color detection problem. (2), we also present a new rule-based fast algorithm (packed k-dimensional tree --- PKT) that depends on an improved spatial structure for human skin/face detection from colored 2D images. We also implemented a novel packed quad-tree (PQT) to speed up the quad-tree performance in terms of indexing. We compared the proposed system to traditional pixel-by-pixel (PBP)/pixel-wise (PW) operation, and quadtree based procedures. The results show that our proposed spatial structure performs better (with a very low false hit rate, very high precision, and accuracy rate) than most state-of-the-art models.

关键词： Image processing Skin detection Information retrieval Spatial data Modelling Interpolation Classification Pattern recognition tree data structure Computer vision

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A tree structure-based improved blockchain framework for a secure online bidding system

引用

COMPUTERS & SECURITY 2021年 102卷 102147-102147页

作者： Sarfaraz, Aaliya Chakrabortty, Ripon K. Essam, Daryl L. Univ New South Wales Sch Engn & Informat Technol Canberra ACT 2600 Australia

The BlockChain (BC) is considered as one of the most exciting developments in information and communication technology in the past decade and is widely known as a crypto intensive phenomenon. Achieving an efficient solution (e.g., decentralization, immutability, security, and transparency) using BC requires a considerable range of factors, such as: scalability, security, and privacy, which have a profound role in determining an overall solution's performance. Meanwhile, digital auctioning is one of the cornerstones of the modem Internet economy. Many of the existing auctions are open-bid auction systems where all bids are made open to either party. E-auctions rely on human resources, and often require the services of a third-party intermediary, which leads to a high cost in terms of money and time, and there is no guarantee that the third party is trustworthy. Moreover, BC's efficiency is a big challenge for large databases, particularly when the bidding system encompasses multiple options with geographically dispersed users. To address these issues, this paper proposes a BC-based framework for an open-bid auction system, for which privacy and security constraints are considered with different cryptographic primitives. The novelty of this framework derives from an enhanced approach for integrating BC structures by replacing the original chain structure with a tree structure. Throughout the online world, user privacy is a primary concern, because the electronic environment enables the collection of personal data. Hence this paper proposes a suitable cryptographic protocol for an open-bid auction atop BC. Here, the primary aim is to achieve security and privacy with greater efficiency, which largely depends on the effectiveness of the encryption algorithms used by BC. Essentially this paper considers Elliptic Curve Cryptography (ECC) and a dynamic cryptographic accumulator encryption algorithm to enhance security between auctioneer and bidder. The proposed e-bidding s

关键词： Blockchain tree data structure Scalability Encryption algorithms Dynamic accumulator Open-bid auction

来源：评论

学校读者我要写书评

暂无评论

Post-earthquake fire simulation considering overall seismic damage of sprinkler systems based on BIM and FEMA P-58

引用

AUTOMATION IN CONSTRUCTION 2018年 90卷 9-22页

作者： Xu, Zhen Zhang, Zongcai Lu, Xinzheng Zeng, Xiang Guan, Hong Univ Sci & Technol Beijing Sch Civil & Resource Engn Beijing 100083 Peoples R China Tsinghua Univ China Educ Minist Dept Civil Engn Key Lab Civil Engn Safety & Durabil Beijing 100084 Peoples R China Griffith Univ Griffith Sch Engn Gold Coast Campus Gold Coast Qld 4222 Australia

In this study, a post-earthquake fire simulation method considering the seismic damage of sprinkler systems is proposed to quantitatively assess the impact of the spread of fire owing to such damage. First, a modeling approach is designed to convert a building information model (BIM) to a computational fluid dynamics (CFD) model, thereby creating a high-fidelity model of a building and its sprinkler system in the fire dynamics simulator (FDS) program. Second, a probabilistic method for predicting the seismic damage of sprinkler components (including pipes and drops) is developed according to the next-generation performance-based design method in the Federal Emergency Management Agency (FEMA) P-58 report. Finally, using the seismic damage of the components, a prediction method is proposed to assess the overall seismic damage of the sprinkler system based on a tree data structure. A post-earthquake fire simulation of a six-story dormitory building is performed using the proposed method. The results indicate the level of effect that the seismic damage of the sprinkler system will have on the spreading of a post-earthquake fire. The outcome of this study provides an important practical method for quantitatively assessing the effect of the seismic damage of sprinkler systems on a post-earthquake fire.

关键词： Post-earthquake fire Sprinkler system BIM FEMA P-58 tree data structure

来源：评论

学校读者我要写书评

暂无评论

A Flexible Keyphrase Extraction Technique for Academic Literature

引用

Procedia Computer Science 2018年 135卷 553-563页

作者： Gollam Rabby Saiful Azad “ Mufti Mahmud Kamal Z. Zamli Mohammed Mostafizur Rahman Faculty of Computer Systems & Software Engineering University Malaysia Pahang Gambang Kuantan Malaysia IBM Centre of Excellence Gambang Kuantan Malaysia Department of Computing and Technology Nottingham Trent University Nottingham United Kingdom Department of Mathematics American International University - Bangladesh (AIUB) Dhaka Bangladesh

A keyphrase extraction technique endeavors to extract quality keyphrases from a given document, which provide a high-level summary of that document. Except statistical keyphrase extraction approaches, all other approaches are either domain-dependent or require a sufficient amount of training data, which are rare at present. Therefore, in this paper, a new tree-based automatic keyphrase extraction technique is proposed, which is domain-independent and employs nominal statistical knowledge; but no train data are required. The proposed technique extracts a quality keyphrase through forming a tree from a candidate keyphrase; and later, it is expanded or shrunk or remained in the same state depending on other similar candidate keyphrases. At the end, keyphrases are extracted from the resultant trees based on a value, µ (which is the Maturity Index (MI) of a node in the tree), which enables flexibility in this process. A small µ value would yield many and/or lengthy keyphrases (greedy approach); whereas, a large µ value would yield lower and/or abbreviated keyphrases (conservative approach). Thereby, a user can extract his/her desired-level of keyphrases through tuning µ value. The effectiveness of the proposed technique is evaluated on an actual corpus, and compared with Rapid Automatic Keyphrase Extraction (RAKE) technique.

关键词： Candidate keyphrase keyphrase automatic keyphrase extraction technique tree data structure

来源：评论

学校读者我要写书评

暂无评论

tree Based Reconstruction from Sparse Samples of Signals

Tree Based Reconstruction from Sparse Samples of Signals

引用

IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES)

作者： Krishnendhu, S. P. Nath, Aneesh G. TKM Coll Engn Dept Comp Sci & Engn Kollam Kerala India

ISBN: (纸本)9781538638644

The study in sparse representation of signals and its applications has changed the field of signal processing into a quickly developing area. These studies have opened tremendous feasible research ideas. Compressed sensing is one among the greatest beneficial field of these studies. Signal sparsity property introduced the idea of reconstruction of signals from very few prototype atoms of an overcomplete dictionary. The novel approach in dictionary learning process is K-SVD method. We propose a method to improve the sparse representation of signal by incorporating A* search algorithm in K-SVD. The usage of tree data structure has provided a lot of advantages including the introduction of auxiliary function, tree pruning techniques etc. Experimental results show that the proposed system provides more efficient and improved results than the conventional ones.

关键词： Compressed sensing Signal sparsity A* search Dictionary learning tree data structure K-SVD Pursuit algorithm

来源：评论

学校读者我要写书评

暂无评论

Interval Merging Binary tree 17th

Interval Merging Binary Tree

引用

17th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Finta, Istvan Farkas, Lorant Szenasi, Sandor Sergyan, Szabolcs Nokia Bell Labs H-1083 Budapest Hungary Obuda Univ John von Neumann Fac Informat Budapest Hungary

ISBN: (纸本)9783319654829;9783319654812

The general area of the paper is methods and data structures to efficiently avoid data duplication. In telecommunication networks operation support systems (OSS) process time series of counters related to the behaviour of network elements, such as failed location updates over the last 5 min. In general we may assume time series of key-value pairs with the key encoding the ordered sequence number of the particular counter. In certain scenarios packets are duplicated in the course of transmission from the network element to the OSS system. In other scenarios packets arrive out of order and some of them do not arrive at all. As a result KPI-s aggregated from the individual counters held by the packets will have incorrect values potentially resulting in thresholds agreed in SLA-s being falsely exceeded. The filtering of duplicated keys and the management of missing (out of order) keys should operate fast and exhibit relatively low memory footprint. For this purpose well known data constructs like hashes or binary search trees can be used, but usually they need to store all individual keys. This implies high memory footprint and slow operation, since the time complexity of a search or insert operation is proportional to the number of stored elements in most cases. We propose a special type of binary tree that overcomes both limitations within certain constraints.

关键词： data structure tree data structure Binary search tree AVL tree Red-Black tree B tree Interval tree Segment tree Streaming Storm data duplication Java collections framework Set Algorithm Interval merging binary tree

来源：评论

学校读者我要写书评

暂无评论

Account Charting and Financial Reporting At Accounting Module on Enterprise Resource Planning Using tree Traversal Algorithm

Account Charting and Financial Reporting At Accounting Modul...

引用

International Conference on Information and Communication Technology and Systems (ICTS)

作者： Adhitama, Muhammad Ashari Sarno, Riyanarto Sarwosri Inst Teknol Sepuluh Nopember Dept Informat Engn Surabaya Indonesia

ISBN: (纸本)9781509013814

Accounting is one of the main modules on enterprise resource planning, which monitors journal, chart of account, and create financial statements. Chart of account is a chart which controls all transactions in the enterprise. Onchart of accounts, there are some parent-child relation between some accounts. tree traversal algorithm is proposed on this paper to make steps on creating a chart of accounts more simple and more efficient. tree traversal algorithm also implemented in financial statements. This proposed methods are used to optimize the process of making chart of accounts.

关键词： Accounting Chart of Accounts Financial Statements tree data structure tree Traversal Algorithm

来源：评论

学校读者我要写书评

暂无评论

Using Thinking Based on Contradictions to Solve the Problem of Storing Hierarchical data

Using Thinking Based on Contradictions to Solve the Problem ...

引用

IEEE International Conference on Knowledge Engineering and Applications (ICKEA)

作者： Petrova, SvetIana Y. Kapitonova, Anna V. Yaroslav The Wise Novgorod State Univ NovSU Velikiy Novgorod Novgorodskaya O Russia Amcor Velikiy Novgorod Novgorodskaya O Russia

The paper provides an analysis of the problem by using the approach contradictions thinking and proposed several technical solutions for of hierarchical storage systems.

ISBN: (纸本)9781509034710

The paper provides an analysis of the problem by using the approach contradictions thinking and proposed several technical solutions for of hierarchical storage systems.

关键词： hierarchical system knowledge discover tree data structure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：