基于XML的安全协议形式化描述方法

针对安全协议的设计与分析复杂且容易出错的问题,文章为编写一个自动验证工具提出一种基于XML(eXtensible Markup Language)语言的时间相关安全协议形式化描述方法。该方法将安全协议用树状结构表示,用XML语言进行描述,为简化安全协议的形式化分析提供了帮助。     

携带诱骗信息的多层网络隐写方法

为了提升网络隐写方法中秘密信息隐蔽传输的安全性,研究了携带诱骗信息的多层网络隐写方法。方法分为两层,高层方法用于携带诱骗信息欺骗检测者,低层方法利用网络协议栈纵向多协议之间的关系编码秘密信息,实现隐蔽通信。实验结果表明,该方法能够在保证隐写带宽的同时,确保了秘密信息传输的安全性。     

面向战术互联网子网路由协议与网络业务的仿真分析

战术互联网是美军的新一代通信系统,它实现了美军三大传统通信系统的互联互通,在战场信息的传递与交互上至关重要。移动Ad hoc网络技术是战术互联网中的关键技术,再加上战场中的节点移动性强,高效稳定的路由算法是Ad hoc网络技术的重点和难点。战术互联网末端网络的主要业务是战场态势信息的交互以及话音通信,主要分析战场环境下不同射频功率和不同路由协议对战术互联网末端Ad hoc网络数据和话音业务性能的影响。     

水下作战网络综述

首先介绍了国外水下作战网络研究的发展现状,详细阐述了美国水下作战网络的研究成果,并简要介绍了我国在水下作战网络研究方面的现状.在此基础上,提出了水下作战网络的概念和网络模型,分析了水下作战网络的特点、网络体系结构与网络拓扑结构、网络协议,然后指出了构建水下作战网络面临的困难,及我国应着重突破的技术难点,希望为接下来的具体研究提供一定的指导.     

基于伪临界值的Cache一致性协议验证方法

针对Cache一致性协议状态空间爆炸问题,提出共享集合伪临界值(Pseudo-cutoff)的概念,并以采用释放一致性模型的CC-NUMA系统为例,分析了共享数据的分布情况,推导出在一定条件下共享集合伪临界值为4的结论,有效优化了目录Cache协议状态空间,并提出了解决小概率的宽共享事件的方法.实验数据表明,基于伪临界值的协议模型优化,能够有效缩小Cache协议状态空间,加快验证速度,扩大验证规模.     

用于减少远程Cache访问延迟的最后一次写访问预测方法

为减少远程Cache访问延迟,提高共享存储系统的性能,提出了一种新的基于程序内在写突发特性的最后一次写访问预测方法,并对一个具体的目录协议进行了改造,以支持该预测方法。通过预测Cache块的最后一次写访问并提前对其进行降级,处理器能直接从主存中读取数据,从而减少了远程Cache访问所需的一个网络跳步数。与当前基于指令的预测方法相比,该方法能极大减少存储开销。基准测试程序的评测结果表明,该方法能获得83.1%的预测准确率,并且能提高8.57%的程序执行性能,同时与基于指令的预测方法相比,该方法能分别减少历史踪迹表69%的存储开销和签名表36%的存储开销。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

编程实现局域网内可靠传输文件的方法研究

针对在开发船舶动力系统分布式设计环境过程中遇到的文件传输问题,讨论了分别基于Socket技术和.NET Remoting技术的编程实现方法.通过比较发现,后者具有编程简单、使用可靠等方面的明显优势.另外,通过实验方式确定了传送过程中数据块大小的选择,并对文件加密解密的问题采用了加入随机数据的方式进行解决.     

可靠UDP协议栈的FPGA实现

基于Xilinx公司的Virtex-5系列FPGA开发板,采用VHDL硬件描述语言,并运用模块化的设计理念,参考TCP_IP协议栈的工作机制,设计并实现了一个具有接收确认及漏发重发功能的可靠的UDP_IP网络通信协议栈。同时,设计并实现了一个以太网控制器,该控制器与UDP_IP协议一起构成一个完整的网络通信链路协议。经过上板测试验证,该通信协议栈能正确高效地完成网络数据的发送和接收等工作,且稳定性良好。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.