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

Scaling Up Clustered Network Appliances with ScaleBricks

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW 2015年第4期45卷 241-254页

作者： Zhou, Dong Fan, Bin Lim, Hyeontaek Andersen, David G. Kaminsky, Michael Mitzenmacher, Michael Wang, Ren Singh, Ajaypal Carnegie Mellon Univ Pittsburgh PA 15213 USA Intel Labs Bangalore Karnataka India Harvard Univ Cambridge MA 02138 USA Connectem Inc Bombay Maharashtra India

This paper presents ScaleBricks, a new design for building scalable, clustered network appliances that must "pin" flow state to a specific handling node without being able to choose which node that should be. ScaleBricks applies a new, compact lookup structure to route packets directly to the appropriate handling node, without incurring the cost of multiple hops across the internal interconnect. Its lookup structure is many times smaller than the alternative approach of fully replicating a forwarding table onto all nodes. As a result, ScaleBricks is able to improve throughput and latency while simultaneously increasing the total number of flows that can be handled by such a cluster. This architecture is effective in practice: Used to optimize packet forwarding in an existing commercial LTE-to-Internet gateway, it increases the throughput of a four-node cluster by 23%, reduces latency by up to 10%, saves memory, and stores up to 5.7x more entries in the forwarding table.

关键词： network function virtualization scalability hashing algorithms

来源：评论

学校读者我要写书评

暂无评论

The Blockchain Art Simulation (BARTS) and Experiential Exercises 21

The Blockchain Art Simulation (BARTS) and Experiential Exerc...

引用

26th Conference on Innovation and Technology in Computer Science Education

作者： Sanders, Sean Patrick Sanders, G. Lawrence SUNY Buffalo Buffalo NY USA

ISBN: (纸本)9781450383974

This paper introduces the online Blockchain ART Simulation (BARTS) and a set of experiential online exercises that illustrate hashing concepts for validating blockchain transactions. Our premise is that understanding the role of secure hashing algorithms in the mining process is the primary conceptual impediment for students to gain an accurate picture of the validation process for blockchain transactions. The BARTS simulation helps develop the conceptual foundation for understanding hashing concepts, and it also leads to understanding blockchain-related concepts. In addition to assisting in understating blockchain concepts, the BARTS simulation and the accompanying exercises are useful in understanding and applying hashing concepts related to password verification, verifying software signatures, digital content signature verification, and averting man-in-the-middle threats.

关键词： hashing algorithms BARTS simulation blockchain concepts education

来源：评论

学校读者我要写书评

暂无评论

Enhancing Intersection Identification for Autonomous Vehicles: A Hash-Based Approach 10

Enhancing Intersection Identification for Autonomous Vehicle...

引用

10th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Olivieri, Giuseppe Volpe, Gaetano Mangini, Agostino Marcello Fanti, Maria Pia Polytech Univ Bari Dept Elect & Informat Engn I-70126 Bari BA Italy

ISBN: (纸本)9798350373981;9798350373974

The rapid advancement and deployment of Autonomous Vehicles (AVs) necessitate innovative solutions for reliable and efficient navigation. In this context, a crucial aspect is the unequivocal identification of intersections. This paper proposes a novel methodology for uniquely identifying intersections by applying a hash algorithm that generates a distinct fingerprint of each intersection, inspired by the operational mechanisms within blockchain platforms, particularly mimicking the generation of Transaction Hashes. The solution's core is creating a hash tree to unequivocally identify the intersection for the AVs' navigation. The application to a real complex case study shows the applicability of the proposed approach.

关键词： hashing algorithms Autonomous Vehicles Intersections

来源：评论

学校读者我要写书评

暂无评论

Techniques to Preserve the Integrity of The Electronic Versions of the Nobel Quran

Techniques to Preserve the Integrity of The Electronic Versi...

引用

Taibah-University International Conference on Advances in Information Technology for the Holy Quran and Its Sciences (NOORIC)

作者： Alsmadi, Izzat M. PSU Dept Informat Syst Riyadh Saudi Arabia

ISBN: (纸本)9781479928231

The ability to control data and information through the Internet can be challenging. Preliminary analysis showed that some literal modification may occur to some words of the Quran in the electronic versions that span the Internet. Such small modifications may not be noticed by public audience. The holly book of Quran includes a unique feature in that its worldwide copies are all identically similar. The 114 Suras and all verses and words in them are preserved in the exact form. As such, we designed and evaluated a model and a tool to preserve the integrity of the wording in the Quran through generating a Meta data related to all letters in the Quran preserving the counts and locations. Such data can be used eventually in the same way CRC or hash algorithms are used in security to check the integrity of a disk and its data file where any small change in the data will result in a different hash value. We conducted several experiments to evaluate the different parameters and challenges that can impact the automatic authentication process of Quranic verses based on information retrieval and hashing algorithms.

关键词： component information retreival security search engines documents' automatic evaluation hashing algorithms information authentication

来源：评论

学校读者我要写书评

暂无评论

Scaling Up Clustered Network Appliances with ScaleBricks 15

Scaling Up Clustered Network Appliances with ScaleBricks

引用

ACM Conference on Special Interest Group on Data Communication (SIGCOMM)

作者： Zhou, Dong Fan, Bin Lim, Hyeontaek Andersen, David G. Kaminsky, Michael Mitzenmacher, Michael Wang, Ren Singh, Ajaypal Carnegie Mellon Univ Pittsburgh PA 15213 USA Intel Labs Santa Clara CA USA Harvard Univ Cambridge MA 02138 USA Connectem Inc San Jose CA USA

ISBN: (纸本)9781450335423

关键词： network function virtualization scalability hashing algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast Searching in Biological Sequences Using Multiple Hash Functions

Fast Searching in Biological Sequences Using Multiple Hash F...

引用

12th IEEE International Conference on BioInformatics and BioEngineering (BIBE)

作者： Faro, Simone Lecroq, Thierry Univ Catania Dip Matemat & Informat Viale A Doria 6 I-95125 Catania Italy Univ Rouen EA 4108 LITIS Mont St Aignan France

ISBN: (纸本)9781467343589;9781467343572

With the availability of large amounts of DNA data, exact matching of nucleotide sequences has become an important application in modern computational biology and in meta-genomics. In this paper we present an efficient method based on multiple hashing functions which improves the performance of existing string matching algorithms when used for searching DNA sequences. From our experimental results it turns out that the new proposed technique leads to algorithms which are up to 8 times faster than the best algorithm known for matching multiple patterns. It turns out also that the gain in performances is larger when searching for larger sets. Thus, considering the fact that the number of reads produced by next generation sequencing equipments is ever growing, the new technique serves a good basis for massive multiple long pattern search applications.

关键词： string matching DNA searching text processing biological sequences hashing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Technique for Endogenously Silencing a Specific Human Gene by siRNA

An Intelligent Technique for Endogenously Silencing a Specif...

引用

3rd International Conference on E-Health and Bioengineering (EHB)

作者： Abdel-Rahman, Mohammad H. Youssif, Aliaa A. A. Ghaleb, Fayed F. M. Salem, Abdel-Badeeh M. Ain Shams Univ Fac Sci Dept Math Cairo Egypt Ain Shams Univ Fac Comp & Informat Sci Dept Comp Sci Cairo Egypt Helwan Univ Fac Comp & Informat Sci Dept Comp Sci Cairo Egypt

ISBN: (纸本)9781457702921

The use of short interfering RNA (siRNA) is an emerging powerful method for gene silencing. siRNA is a short RNA sequence that targets mRNA and causes the sequence-specific degradation of the mRNA. Despite its importance, few efforts have been made to develop algorithms and computational tools to detect genes controlled by siRNA process. This paper introduces an algorithm that uses an intelligent technique based on voting to determine whether a specific gene can be endogenously controlled by the cell using a siRNA sequence. When applying the proposed algorithm;the experimental results show that it requires relatively small memory space (not more than 70 MB) and in less than 3 minutes to determine whether a human gene can endogenously controlled. This makes the proposed algorithm practical to run into large genomes, specially the Human genome, and its specificity for only single gene increases its medical benefit as a tool for detecting treatments for specific diseases.

关键词： Gene silencing siRNA hashing algorithms Voting algorithms ESSG problem

来源：评论

学校读者我要写书评

暂无评论

CarChain: A Novel Public Blockchain-based Used Motor Vehicle History Reporting System

CarChain: A Novel Public Blockchain-based Used Motor Vehicle...

引用

IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology (JEEIT)

作者： Masoud, Mohammad Z. Jaradat, Yousef Jannoud, Ismael Zaidan, Dema Al Zaytoonah Univ Jordan Elect Engn Dept Amman 11733 Jordan

ISBN: (纸本)9781538679425

Blockchain Technology has been proposed to tackle author, centrality and storage issues. It converts centralized applications into dynamic distributed ones. Many researchers have proposed protocols and applications for mapping the old central applications into blockchain based distributed application. In this work, new system framework for Public World Wide Used Motor Vehicle History Reporting System, named CarChain, is proposed and designed. The new framework has not been constructed based on any of the popular well-known public blockchain networks. The framework constructs a peer-to-peer (P2P) overlay network that broadcasts transactions as any end system multicasting system in P2P live streaming applications. The framework allows car owners, repairing companies and insurance agencies to register and add new histories for cars in a simple method. Four different smart contracts control block updates in CarChain. In addition, database technology has been leveraged to cache intermediate data. We show in this paper the challenges and research opportunities that encounter blockchain based applications, such as CarChain.

关键词： CarChain BlockChain Peer-to-Peer (P2P) Overlay Network hashing algorithms

来源：评论

学校读者我要写书评

暂无评论

Exascale algorithms for Generalized MPI_Comm_split

Exascale Algorithms for Generalized MPI_Comm_split

引用

18th European MPI Users Group Meeting (EuroMPI 2011)

作者： Moody, Adam Ahn, Dong H. de Supinski, Bronis R. Lawrence Livermore Natl Lab Livermore CA 94551 USA

ISBN: (纸本)9783642244483

In the quest to build exascale supercomputers, designers are increasing the number of hierarchical levels that exist among system components. Software developed for these systems must account for the various hierarchies to achieve maximum efficiency. The first step in this work is to identify groups of processes that share common resources. We develop, analyze, and test several algorithms that can split millions of processes into groups based on arbitrary, user-defined data. We find that bitonic sort and our new hash-based algorithm best suit the task.

关键词： MPI MPI_Comm_split Sorting algorithms hashing algorithms Distributed group representation

来源：评论

学校读者我要写书评

暂无评论

The effect of deletions on different insertion disciplines for hash tables (extended abstract)

引用

Electronic Notes in Discrete Mathematics 2001年 7卷 146-149页

作者： Poblete, Patricio V. Viola, Alfredo Department of Computer Science University of Chile Santiago Blanco Encalada 2120 Chile Pedeciba Informática Instituto de Computación Universidad de la República Montevideo Casilla de Correo 16120 Distriro 6 Uruguay

Deletions in open addressing hash tables are often handled by marking the cells as "deleted" instead of "empty", because otherwise the search algorithm might fail to find some of the keys. The space used by deleted cells may be reused by subsequent insertions. Intuitively, search times should deteriorate as tables become contaminated with deleted cells and, as Knuth points out, in the long run the average successful search time should approach the average unsuccessful search time. We analize the effect of a long sequence of deletions and insertions over tables that use one of three insertion disciplines: standard "first-come-first-served" (FCFS)[2], "last-come-first-served" (LCFS) [3] and "Robin Hood" (RH)[1]. We show that deletions have the predicted effect over the average search cost, but their effect over the variance differs according to the insertion discipline used. When no deletions are allowed, FCFS has a very dispersed distribution, while those of LCFS and RH are very concentrated. But we show that, after many deletions and insertions, both FCFS and LCFS approach a common steady state with high dispersion, while the distribution of RH remains concentrated. We also study the transient behaviors of these methods, doing both an asymptotic and an exact analysis.

关键词： Analysis of algorithms Deletions hashing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：