覆盖范围可变时WSNs优化算法

无线传感器网络（WSNs）具有放置方便,自组织,移动性强等特点,为了保证安全生产,可以将网络中的节点放置在煤矿井下狭长工作面上,用来对大型设备的工作情况和环境参数进行监测以提供实时信息。基于上述环境,提出了监测区域可变的覆盖算法,在B样条数学理论和Matlab工具的支持下做了算法仿真。结果表明：通常情况下覆盖度随着节点通信半径的增大而增加;合理选择第一个簇首会达到较高的覆盖度;合适的节点密度不但可以有效覆盖监测区域,还可延长网络寿命。     

无线传感器网络节点自调度冗余覆盖算法

对于能量受限的无线传感器网络,延长网络存活的时间很关键。针对这个问题,提出了一种基于能量均衡的传感器节点自调度冗余覆盖协议（SRCP）,通过仿真实验对该算法的有关性能进行了评价,性能评价表明：这种算法能有效使用节点能力,延长网络存活时间。     

改进的随机圆检测算法

介绍了一种基于随机圆检测的改进算法。解决了随机圆检测算法随机采样阶段引入的大量无效累积和验证阶段假设圆之外的边缘点所进行的无效计算的问题,首先对边缘图像进行8邻接连通,3个随机采样点在同一个连通曲线内选择,然后利用圆的性质求得圆的参数,再应用证据收集过程来进一步验证圆的真实性,该验证过程中只考虑假设圆的外切正方形和内接正方形之间的边缘点。实验结果表明,该算法计算量小,对比改进前,检测性能有所提高,且鲁棒性也相应提高,同时能够检测圆弧和有相互重叠的多个圆。     

“龙腾R2”微处理器模块级验证

针对"龙腾R2"微处理器验证过程中的存在验证规模大,人力资源不足的问题,采用流水线模型构建随机的指令序列生成器,搭建以功能覆盖率为导向的自动化验证平台;该平台在仿真验证过程中能根据处理器的运行状态及覆盖率实时地调整指令流以侧重当前验证不充分的功能模块,实现自动化验证;通过仿真,与传统方法相比,在达到同等验证程度的情况下,使用该平台验证周期明显缩短,同时验证覆盖率也有所提高。     

A hybrid multicast connectivity solution for multi-party collaborative environments

In multi-party collaborative environments, a group of users can share multiple media streams via IP multicasting. However, despite of the efficiency of IP multicast, it is not widely available and alternative application-layer multicast approaches are introduced. Application-layer multicast is advantageous, however, it incurs additional processing delays. In this paper, we present a new hybrid-style application-layer multicast solution that satisfies both network efficiency and easy deployment. We achieve this goal by connecting multicast islands through UDP tunnels employing UMTP (UDP multicast tunneling protocol). We also design a MPROBE protocol to remove multicast loop among multicast island in real Internet. We verify the feasibility of the proposed solution by implementing a prototype tool, AG Connector, that works on Access Grid multi-party collaborative environment.

On guiding the augmentation of an automated test suite via mutation analysis

Mutation testing has traditionally been used as a defect injection technique to assess the effectiveness of a test suite as represented by a “mutation score.” Recently, mutation testing tools have become more efficient, and industrial usage of mutation analysis is experiencing growth. Mutation analysis entails adding or modifying test cases until the test suite is sufficient to detect as many mutants as possible and the mutation score is satisfactory. The augmented test suite resulting from mutation analysis may reveal latent faults and provides a stronger test suite to detect future errors which might be injected. Software engineers often look for guidance on how to augment their test suite using information provided by line and/or branch coverage tools. As the use of mutation analysis grows, software engineers will want to know how the emerging technique compares with and/or complements coverage analysis for guiding the augmentation of an automated test suite. Additionally, software engineers can benefit from an enhanced understanding of efficient mutation analysis techniques. To address these needs for additional information about mutation analysis, we conducted an empirical study of the use of mutation analysis on two open source projects. Our results indicate that a focused effort on increasing mutation score leads to a corresponding increase in line and branch coverage to the point that line coverage, branch coverage and mutation score reach a maximum but leave some types of code structures uncovered. Mutation analysis guides the creation of additional “common programmer error” tests beyond those written to increase line and branch coverage. We also found that 74% of our chosen set of mutation operators is useful, on average, for producing new tests. The remaining 26% of mutation operators did not produce new test cases because their mutants were immediately detected by the initial test suite, indirectly detected by test suites we added to detect other mutants, or were not able to be detected by any test.

一种支持大规模数据逻辑函数优化的改进选拔算法

选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一,但在输出变量集合和质立方体集合规模较大的情况下,采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。为此,提出了求解多输出函数最小化覆盖的改进选拔算法。利用相交迭代和局部搜索的思想,分别对选拔法的极值运算和分支处理进行了改进。实验结果表明,在现有计算机资源条件下,该算法为大规模数据条件下逻辑函数的优化提供了一种有效的方法。     

嵌入式网络连通检测器的实现

介绍了以太网连通错误管理（CFM）的技术背景,指出纯软件开发的以太网的CFM模块具有局限性,并无法满足协议多变的特点。该模块是在SOPC系统上实现IEEE802．1ag协议中连通性检测功能。系统采用Altera公司提供的DE2开发板作为实现平台,实现了能以毫秒级速度发送及分级告警的嵌入式网络连通检测器。用两个开发板模拟一个小型的网络,通过PC机来对开发板进行操作和控制,利用对开发板上的LCD显示屏及LED显示灯进行监测,验证连通检测器的功能及性能。     

ICBF：汽车Ad-Hoc网络中一种改进的CBF算法

汽车Ad-Hoc网络是一种特殊的Ad-Hoc网络,其路由层面临着许多挑战。本文提出汽车Ad-Hoc网络中一种改进的CBF算法--ICBF。通过速度、方向和距离三个重要的因素控制定时器,更准确地选择下一跳转发节点;利用城市场景下汽车与相邻汽车之间速度差较小的特点,减少了数据包的广播;提出一种新的锚点路径选择算法,使得ICBF协议能够主动地感知地理拓扑和交通密度,从而达到优化路由性能的目的。实验表明,在城市场景下,ICBF算法能提高数据转发成功率,减少网络的带宽负荷。     

4G载波向5G重耕之前的5G业务覆盖能力研究

为了满足低成本建设5G广覆盖网络的需求,需要提前研究低频3G、4G网络向5G重耕的最佳方案。在没有进行重耕,因而没有理想的低频5G测试环境的情况下,采用理论分析的手段进行重耕后的覆盖能力估算。以未来L900重耕用于5G广覆盖为例,探讨了链路预算的关键设定、模型选择等问题,并通过多个本地网实际测试数据间接验证估算结果的合理性。所得结论已实际应用于某大运营商对全国900 MHz网络的规划方案,对于指导网络重耕具有重要的借鉴意义,也为面向覆盖和感知的6G网络演进及重耕提供了参考模型。