基于时空联合性的无线传感网覆盖采样技术

覆盖采样作为无线传感器网络领域的一个基本问题,已经得到了广泛研究。但是目前研究大多只考虑空间覆盖性和网络生存周期等因素,并没有从实用的角度考虑覆盖区域的时空域覆盖特性。本文以综合考虑空间域和时间域为研究视角,提出了一种新型的以应用为导向的覆盖率指数,研究了一种基于时空联合性的无线传感网覆盖采样机制。最后通过时空覆盖率与事件侦测率指标两个指标进行了验证。     

Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks

Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must be reduced for effective utilization of the available resources. If two nodes have the same coverage area in their active state, and if both the nodes are activated simultaneously, it leads to redundancy in network and wastage of precious sensor resources. In this paper, we address the problem of network coverage and connectivity and propose an efficient solution to maintain coverage, while preserving the connectivity of the network. The proposed solution aims to cover the area of interest (AOI), while minimizing the count of the active sensor nodes. The overlap region of two sensor nodes varies with the distance between the nodes. If the distance between two sensor nodes is maximized, the overall coverage area of these nodes will also be maximized. Also, to preserve the connectivity of the network, each sensor node must be in the communication range of at least one other node. Results of simulation of the proposed solution indicate up to 95% coverage of the area, while consuming very less energy of 9.44 J per unit time in the network, simulated in an area of 2500 m².     

Testing Planning Domains (without Model Checkers)

We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning domains which is self-contained, in the sense that flight rules are verified using a planner and no external tools are required. We review and analyse coverage conditions for requirements-based testing, and we reason in detail on "Unique First Cause" (UFC) coverage for test suites. We characterise flight rules using patterns, encoded using LTL, and we provide UFC coverage for them. We then present a translation of LTL formulae into planning goals, and illustrate our approach on a case study.     

嵌入式软件的覆盖测试

覆盖测试是检验嵌入式软件功能结构正确性以及查找问题的重要方法和手段。纯粹的人工测试工作量大、操作不方便、周期长,需要借助一定的工具才能取得较好的效果。使用测试工具LDRA Testbed进行了覆盖率测试,达到了一定的语句、分支以及LCSAJ覆盖率。测试过程说明了该工具能够有效获取被测软件的动态覆盖率信息,评价测试用例的完整性,并有针对性地补充测试用例,进而提高软件测试的覆盖率,帮助决定何时终止软件测试。     

4130X钢韧脆转变温度的测定

采用V型缺口试样，通过系列温度的冲击试验．以冲击吸收功、纤维断面率的变化对4130X钢的韧脆转变温度进行了测定。试验结果表明，4130X钢韧脆转变温度为-40℃。     

对GML3.0的探讨

Internet与GIS结合成互联网地理信息系统(Internet GIS)是GIS软件发展的必然趋势,Internet GIS用于分布式地理信息的在线发布,并为分布式地理信息提供在线实时处理与分析的工具。对GML3.0(Geography Markup Language 3.0,地理标记语言)的发展和核心技术进行了深入的研究,其主要内容包含了GML3.0的数据类型、要素、要素集合、几何模型的类型及元素、时态、层等,给出了一些内容模型以及相关内容的UML表示,还给出了使用GML3.0进行数据共享和互操作的应用实例,并对未来的GML版本进行了预测。     

改进BP神经网络在负荷动静比例确定中的应用

指出了电力系统负荷动、静组成比例在实际电力系统分析、计算中的重要性，并应用一种改进的BP算法——Levenberg-Marquardt反向传播算法来对神经网络进行训练，进而利用人工神经网络(ANN)来确定电力系统综合负荷动、静组成比例为β=F[Y(t)，Y(t-1)，…，Y(t-n)，U(t)，U(t-1)，…，U(t-n)]。其中，β为动态负荷在综合负荷中所占的比例，Y=[P，Q]^T。，U=[V，f]^T。该算法改进了BP神经网络学习速度慢的缺点。应用该方法对仿真数据、动模实验数据和现场实测数据进行了测算，得出了其相应的动、静组成比例。测算结果验证了在确定负荷动、静比例时可以忽略频率的变化，证明了BP神经网络用于确定负荷动、静组成比例的有效性。     

仪器化冲击在评测断口剪切面积比例中的应用

根据示波曲线定量给出的特征载荷点分布关系，结合ESIS给出的评测夏比V型冲击断口剪切面积比例(PSF)经验公式，介绍了仪器化冲击试验在估算PSF数值中的具体应用。估算值与实际测量值所进行的误差离散性与置信区间的分析结果表明，选用合适的经验算法可以在试验过程中实时获得高度可靠的PSF结果。与常规光学手工评测技术相比，该方法不依赖于试验者的主观评测经验、不受特定客观试验条件的限制，具有广阔的应用前景，同时也为材料PSF评测以及动态断裂机理的研究提供了一套方便而有效的试验手段。     

用拉伸试验机横梁位移值计算断后伸长率

介绍利用拉伸试验机横梁位移数据计算拉伸试样断后伸长率的方法。由试样长度与标距不一致产生的测量偏差，可通过补偿值加以修正，其测量精度与常规测量方法基本相同。     

Trajectory segment selection with limited budget in mobile crowd sensing

Mobile Crowd Sensing is an emerging paradigm, in which a large number of participants are involved to complete a sensing task under a certain incentive mechanism. Hence, when the budget used to pay participants is limited, how to choose the most appropriate participants becomes a critical problem. Most of existing works aim to select a subset of participants to maximize the coverage, without considering redundancy. There are two kinds of redundancy in the existing literature, one is brought by the incomplete coverage assessment, while the other one is brought by the traditional participant selection process. Since paying for redundant data leads to budget waste, existing works cannot solve the participant selection problem commendably under limited budget. To address such issues, we first propose a coverage assessment considering both uniform coverage and maximum coverage, then design a trajectory segment selection scheme. Rather than choosing the whole trajectory of a participant, our scheme selects certain segments. Both offline and online algorithms are proposed in this paper. Two benchmarks are implemented and we carry out extensive experiments based on a real dataset. The evaluation results prove the effectiveness and the advantage of our algorithms in terms of the coverage quality.