基于Moran过程的竞争性舆情信息的网络传播博弈模型

新的媒体环境下,在享受不同形式在线社交网络提供便捷信息互动渠道的同时,需要加强对信息传播的管理与引导,防止其发展成为负面舆情信息肆意滋生的温床。结合传统演化博弈论与复杂网络理论,提出了竞争性舆情信息的网络传播博弈模型,并理论分析了正面舆情信息传播占优的收益条件及群体规模;随后,结合实际案例,通过仿真实验对比分析三种博弈环境下网络舆情的演化特征。三种博弈环境下,正面舆情信息传播策略占优条件均与收益有关,弱选择情境对收益参数的要求最为严格;强、弱选择情景下策略占优的条件还与群体规模有关,且强选择情景对群体规模的要求更为严格。     

基于AUPF的TDOA几何定位跟踪算法研究

使用无源时差（TDOA）定位技术确定无人机等小型辐射源目标的位置是当前研究的热点,针对时差定位算法较为复杂的实际情况,推导了时差双曲线的几何解,并提出了一种基于自适应无迹粒子滤波（AUPF）技术的移动目标定位跟踪方法。通过仿真对该方法在不同场景的应用效果进行了验证,进一步比较分析了算法的定位精度。结果表明,基于自适应无迹粒子滤波的时差几何定位跟踪算法可以在多种情况下较好地拟合出目标真实运动轨迹,实现对运动目标的定位跟踪,同时拥有更低的定位误差和更高的轨迹包容度,使用该方法可以显著提高对非合作移动辐射源目标的位置估计性能。     

Searching minimax game trees under memory space constraint

Games such as CHESS, GO and OTHELLO can be represented by minimax game trees. Among various search procedures to solve such game trees,- and SSS^* are perhaps most well known. Although it is proved that SSS^* explores only a subset of the nodes explored by-, - is commonly believed to be faster in real applications, since it requires very little memory space and hence its storage management cost is low. Contrary to this folklore, however, this paper reports, using the OTHELLO game as an example, that SSS^* is much faster than-. It is also demonstrated that SSS^* can be modified to make the required memory space controllable to some extent, while retaining the high efficiency of the original SSS^*.This research was partially supported by the Ministry of Education, Science and Culture of Japan, under a Scientific Grant-in-Aid.     

Robots positioning control revisited

Positioning control systems for robot arms are presented within a general framework in view of unification and classification. Treating coupling torques from other links as an external disturbance reduces the design of the control system to that of SISO servomechanisms driving each of the robot axes individually. A short survey of many control strategies proposed in the literature presents them as different methods aiming at attenuation of this disturbance. The use of disturbance observers is shown to provide a nice and simple way for that purpose. This could be applied to the improvement of actual industrial robots at the cost of slight software modifications.     

井下人员定位系统读卡器存储算法分析与测试

从查找时间与存储容量2个方面分析了适用于井下人员定位系统读卡器的3种存储算法,即链式存储算法、哈希表存储算法和哈希二叉树存储算法,给出了该3种不同存储算法的使用效率与应用场合。测试结果表明,链式存储算法查找时间呈线性增长,哈希表存储算法明显优越于链式存储算法,如果测试数据增多,其优越性会更明显;当数据量较大时,哈希搜索二叉树存储算法又明显优于哈希表存储算法,当人数达到行业所要求的8 000人以上时,选择哈希搜索二叉树存储算法更为合理。     

基于单片机的GPS／电子罗盘测姿定位系统

设计了一种基于GPS／电子罗盘的测姿定位系统。该系统利用单片机C8051F021作为中央处理器,功耗极低的iTrax03—02作为GPS接收机,数字电子罗盘HMR3300提供姿态信息,通过串口通信实现了实时测姿定位功能。实地跑车实验结果表明,该系统可以正确、可靠地完成运动载体的姿态和位置信息的实时测量,为最终的组合导航实现奠定了基础。     

The Peer’s Dilemma: A general framework to examine cooperation in pure peer-to-peer systems

The exploration of social dilemmas is being considered a major foundation for encountering the enforced necessities of cooperation in self-organizing environments. Such environments are characterized by self-interested parties and the absence of trusted third parties. Recent approaches apply evolutionary socio-inspired games to formally prove the existence and further prolongation of cooperation patterns within communities. For instance, the Prisoner’s Dilemma game has thus provided a rich opportunity to examine self-interested behaviors in pure peer-to-peer networks. However, assuming a total absence of coalitions, incentives and punishment mechanisms, several works argue against a durable maintenance of cooperation neither at single-shot nor repeated-scenarios. In this article, we formally and experimentally demonstrate a counterexample for the latter by applying evolutionary game theory and a particular instance of the Rock–Scissors–Paper game. Our framework proves that the cyclic dominance of certain type of nodes within a P2P system has an impact and introduces a strategic aspect to the evolution of the overall community.     

A novel adaptive cooperative location algorithm for wireless sensor networks

To overcome the disadvantages of the location algorithm based on received signal strength indication(RSSI) in the existing wireless sensor networks(WSNs),a novel adaptive cooperative location algorithm is proposed.To tolerate some minor errors in the information of node position,a reference anchor node is employed.On the other hand,Dixon method is used to remove the outliers of RSSI,the standard deviation threshold of RSSI and the learning model are put forward to reduce the ranging error of RSSI and improve the positioning precision effectively.Simulations are run to evaluate the performance of the algorithm.The results show that the proposed algorithm offers more precise location and better stability and robustness.     

无线多跳网络中基于博弈论的协作激励机制研究

无线多跳网络中网络传输性能容易受到自私节点的影响。本文首先对目前的节点协作激励机制进行了总结,然后,针对分簇路由中簇间路由场景,运用博弈论中非合作博弈的思想,建立博弈模型以激励簇内节点通过协作通信的方式帮助簇头进行数据包的转发,最后给出了基于非合作博弈的激励机制中纳什均衡解的求解过程。