期刊文献+

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

A fast method for collision detection of massive random number
下载PDF
导出
摘要 针对海量随机数碰撞率实时检测的需求,利用随机数的随机特性,结合文件系统路径编码的方式,提出了一种类似于平衡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.
出处 《计算机时代》 2016年第8期44-46,共3页 Computer Era
关键词 随机数 海量随机数 碰撞率检测 路径编码 平衡检索森林 random number massive random number collision rate detection path coding balanced search forest
  • 相关文献

参考文献7

  • 1杨睿.论伪随机序列及其应用[J].沈阳工程学院学报(自然科学版),2009,5(2):166-168. 被引量:9
  • 2江裕剑等.计算机模拟随机数发生器的产生、检验及应用[J].成都电讯工程学院学报,1983.1:117.
  • 3栾忠兰,吕强.伪随机数发生器的统计性质检验及其应用[J].计算机应用与软件,2010,27(10):168-170. 被引量:5
  • 4卢开澄.计算机密码学(第2版)[M].清华大学出版社,1998.
  • 5[美]DonaldE.Knuth著,苏运霖译.计算机程序设计艺术第3卷排序与查找(第2版)[M].国防工业出版社,2003.
  • 6[美]DonaldE.Knuth著,苏运霖译.计算机程序设计艺术第3卷排序与查找第2版[M].国防工业出版社,2003.
  • 7[美]DonaldE.Knuth,苏运霖译.计算机程序设计艺术第3卷排序与查找(第2版)[M].国防工业出版社,2003.

二级参考文献15

  • 1樊炳亮,李晓辉.一种生成平衡Gold序列的算法[J].微机发展,2005,15(9):18-20. 被引量:10
  • 2Holger H.Hoos,Thomas Stützle.Stochastic Local Search:Foundations and Applications[M].Morgan Kaufmann Publishers,2004.
  • 3Dave A D Tompkins,Holger H Hoos.On the Quality and Quantity of Random Decision in Stochastic Local Search for SAT[C]//Proceedings of the Nineteenth Conference of the Canadian Society for Computational Studies of Intelligence,2006,4013(6):146-158.
  • 4Donald Knuth.The art of computer programming,volume 2,chapter 3 Random Numbers[M].Addison-Wesley publishing company,1981.
  • 5Park S K,Miller K W.Random number generators:good ones are hard to find[J].Communications of the ACM,1988,31(5):1192-1201.
  • 6Schrage L.A more portable fortran random number generator[J].ACM Transactions on Mathematical Software,1979,5(2):132-138.
  • 7L'Ecuyer P.Efficient and portable combined random number generators[J].Communications of the ACM,1988,31(6):742-774.
  • 8William H Press,Saul A Teukolsky,William T Vetterling,et al.Flannery.Numerical Recipes in C,chapter 7 Random Numbers.Cabrrige University Press,1998.
  • 9Dorigo M,Maniezze V,Colorni A.The Ant System:Optimization by a colony of cooperating agents[J].IEEE Transactions on Systems,Man,and Cybernetics Part B:Cybernetics,1996,26(1):1-13.
  • 10Helsgaun K.An effiective implementation of the lin-kernighan traveling salesman heuristic[J].European Journal of Operational Research,2000,126(1):106-130.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部