A self-adjusting algorithm for byzantine agreement

Summary Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. Fort faulty processes, we give an algorithm that has at mostt disagreements for 4t or more processes. Another algorithm is given forn3t+1 processes with the number of disagreements belowt ²/2. Both algorithms useO(n ³) message bits for binary value agreement. Yi Zhao is currently working on his Ph.D. degree in Computer Science at University of Houston. His research interests include fault tolerance, distributed computing, parallel computation and neural networks. He obtained his M.S. from University of Houston in 1988 and B.S. from Beijing University of Aeronautics and Astronautics in 1984, both in computer science. Farokh B. Bastani received the B. Tech. degree in electrical engineering from the Indian Institute of Technology, Bombay, India, and the M.S. and Ph.D. degrees in electrical engineering and computer science from the University of California, Berkeley. He joined the University of Houston in 1980, where he is currently an Associate Professor of Computer Science. His research interests include software design and validation techniques, distributed systems, and fault-tolerant systems. He is a member of the ACM and the IEEE and is on the editorial board of theIEEE Transactions on Software Engineering.     

电子警务中三维全景技术应用研究

随着信息技术的飞速发展,三维全景技术已成为电子警务中重要的组成部分。本文通过对三维全景技术特点和发展状况的介绍,提出了一套三维全景地理信息系统的应用框架,探讨了三维全景技术应用中的关键技术,并结合电子警务建设实际,详细介绍了三维全景技术在电子警务中的具体应用。可以预测,随着三维全景技术和物联网技术、云计算的集成,未来三维全景技术将成为电子警务的主流技术。     

电子政务数据共享模式研究

互联网的广泛应用,改变了社会公众对政府信息需求的观念。加强电子政务数据共享是社会发展的必然要求。为了保证政务信息的有效共享,实现不同部门不同类型数据的转换和重用,提出了一种新的基于公开密钥基础设施体系构造数据共享模式。在新的数据共享模式中,使用电子凭证替代传统的纸质凭证,增加了行政审批事务办理的快捷性、安全性、低碳环保性。为了进一步提高电子凭证的效率,将其与云计算无缝融合。通过对具体应用案例的分析,表明新的数据共享模式具有安全性、可行性和实用性。     

Cell处理器访存特征研究

Cell处理器是一款异构多核处理器,拥有强大的计算能力。但是,在进行应用并行化时,却受到本地存储器容量、访存带宽和数据传输延时等的限制。DMA传输是隐藏长延时、提高存储带宽利用率的有效方法。本文在分析Cell处理器结构基础上,进行了一系列详细的DMA测试,并利用指数拟合技术得到DMA平均带宽模型,发现参与DMA传输的SPE数量和每次DMA传输规模是影响DMA访存带宽的主要因素。     

基于OSEK规范的网络管理的研究与改进

首先论述了基于OSEK规范的网络管理特点并对OSEK网络管理的工作机制进行了详细分析;在基于OSEK网络管理特点和工作机制的基础上,对OSEK网络管理在以太网上的扩展、资源占有率优化和实时性提高几个方面给出了解决方案。     

有效的IPSec安全策略管理方案*

针对IPSec协议在安全策略管理存在的问题,引入信任管理的思想,介绍了一种基于信任管理的IPSec安全策略管理方案。该方案对分布式网络中的策略可以进行统一的描述,并通过一致性证明能够实现策略的委托授权管理,这样大大提高了IPSec安全策略管理效率和IPSec的灵活性。     

粗糙集理论及其在图像处理中的应用*

首先描述了粗糙集理论的基本概念,包括粗糙集知识表示方法和粗糙集约简理论;叙述了粗糙集理论及其与其他非线性理论相结合在图像处理中的应用情况;最后指出了粗糙集理论应用于图像处理的基本思路,并指出将粗糙集理论与其他非线性理论相结合应用于图像处理,将会产生更加有效的结果.     

一种引入通信的多移动机器人编队方法*

提出以视觉跟踪为基础并引入通信进行多机器人的编队控制方法,根据需要编写了一种新的通信协议,采用闭环l-Φ实现编队算法.这种多机器人编队控制避免了视觉系统的局限,能够更好地在复杂未知环境中协作完成任务,解决了编队控制的无反馈和实时性不高的问题,使得机器人能够准确迅速地进行跟踪和通信编队,一起顺利达到目标点.试验结果证明了该方法的有效性.     

基于FPGA的无线接入点硬件平台的设计与实现*

基于认证、安全及QoS等方面的研究需要,提出了基于FPGA的HostAP设计方案,并搭建了无线接入点的硬件平台,在此平台上进行了硬件的裁减与集成;设计和实现了无线接入点的硬件电路,完成了无线接入点的高速PCB布局布线.在PCB布局布线的过程中,重点解决了高速印制电路板设计中的传输线效应问题,最后进行了实际的系统测试.     

Effect and Evolution of Oxide Film in the HDH-Ti Powder Surface on Densification Behavior During Sintering

Metallurgical and Materials Transactions A - In this work, we used hydride-dehydride Ti (HDH-Ti) powders (with the oxygen levels of 0.17 and 0.51 wt pct, respectively) combined with microstructural...