海量随机数碰撞率检测的快捷方法  

A fast method for collision detection of massive random number

作　　者：孟秀哲 杨栋毅[2] 

机构地区：[1]北京交通大学电气工程学院,北京100044 [2]中国科学院大学工程科学学院

出　　处：《计算机时代》2016年第8期44-46,共3页Computer Era

摘　　要：针对海量随机数碰撞率实时检测的需求,利用随机数的随机特性,结合文件系统路径编码的方式,提出了一种类似于平衡B叉树的平衡检索森林的结构与算法。该方法避免了平衡B叉树的编程复杂性,检测效率非常高,有效地解决了海量随机数碰撞率检测因耗时量过大而难以在工程上快速实现的问题。For the demand of real-time detection of massive random number collision rate, by using the stochastic properties of the random number and the file system path coding, a method of balanced search forest similar to the balanced B search tree is proposed. This method avoids the programming complexity of the balanced B search＇ tree, and the detection efficiency is very high. It can effectively solve the problem that the collision rate detection of massive random number is too much time consuming to be quickly realized in engineering.

关 键 词：随机数 海量随机数 碰撞率检测 路径编码 平衡检索森林 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]