一种工程化的双门限辐射源目标识别方法

针对辐射源数量多、运动速度差异大、信息处理时效性要求高等特点,提出一类双门限辐射源目标识别方法;该方法首先构造信号与目标的相似度度量,通过双门限检测得到辐射源信号不属于任何目标、信号属于某个目标、模糊三类判定结论,对于模糊判定结果,构造差值门限进一步减小不确定性,提高目标识别能力;仿真结果表明所提出的方法能够快速有效地实现目标识别,便于工程化应用。     

交叉口混合交通流微观控制模型

为构建智能网联汽车(CAV)和有人驾驶汽车(HDV)混合通行情况下的交叉口通行机制与控制方法, 本文提出CAV专用道条件下交叉口协同通行模型. 首先, 设计CAV专用道条件下的交叉口布置, 对交叉口进行网格化处理,将CAV通行时隙和HDV绿灯相位对交叉口某部分网格某时段的占用统一到交叉口时空资源描述框架下; 其次, 建立兼顾CAV与HDV的交叉口时空网格资源分配模型, 构建自适应信号灯控制算法和CAV轨迹规划算法; 再次, 以车辆最小延误为目标进行自适应信号灯配时优化和CAV轨迹优化; 最后, 选取广州某典型交叉口建立仿真实验对所提方法的有效性进行了验证.     

针对运动目标的多无人机协同鸽群优化搜索方法

针对多无人机协同运动目标搜索问题,本文设计了改进鸽群优化算法的协同搜索决策.首先,基于运动目标的独立性,建立了服从正态分布的目标概率信息图模型;为了提高环境中目标存在的确定度,建立了搜索环境的确定度信息图.其次,通过建立的吸引和排斥数字信息素图,引导无人机向未搜索区域飞行,减少重复搜索概率,提高协同目标搜索效率,并基于传统的鸽群算法,通过加入速度更新修正机制和精英代机制对其进行改进.然后,结合环境中目标的存在概率信息以及无人机搜索目标的探测信息,使用改进鸽群优化算法,规划无人机的最优搜索飞行路径.并设计避碰机制,以有效防止无人机搜索过程中的碰撞.最后,通过比较仿真实验验证了改进鸽群优化算法对运动目标协同搜索的有效性.     

高中信息技术课堂案例分析

新的课程体系促生新的教学理念,新的教学理念引领新的教学模式。本文结合一个具体的高中信息技术课堂案例,分析信息技术课堂中普遍采用的任务驱动教学方法和自主协作学习方法的实施过程,阐述多样化的学习方式对培养高中学生的问题分析能力、自主探究能力、合作学习能力以及提升学生的信息素养所起的促进作用。     

Asynchronous cooperative communication systems:A survey on signal designs

Cooperative communications is a promising technique for future high speed wireless communications.These systems may be formulated as virtual multi-input multi-output (MIMO) systems where spatial/cooperetive diversity is a key advantage. However,different from MIMO systems,one of the major chal- lenges for cooperative communications systems is that the cooperative transmissions in cooperative systems may be neither time nor frequency synchronized,since the transmissions are from multiple cooperative nodes at...     

多星系统相对轨道的自适应协同控制

基于一致性理论,在无向拓扑结构上对多星系统相对轨道的协同控制问题进行了研究.本文考虑近地卫星相对轨道的非线性方程,首先设计控制律使得多星系统形成目标队形,并给出了速度阻尼和通信拓扑(相对速度间的拓扑关系)连通性之间的关系;其次,针对卫星质量具有不确定性的情形,设计了新的辅助变量,提出了自适应的协同控制律,这里要求传感(相对位置间的拓扑关系)和通信具有相同的拓扑结构.最后对4颗卫星的编队飞行进行了仿真分析,仿真结果表明本文设计的协同控制律是有效可行的.     

Performance analysis and partner selection for cooperative diversity based on MQAM modulation

An adaptive decode-and-forward (DF) cooperative diversity system based on quadrature modulation is proposed, in which each user is allowed to transmit its own and the partner’s data simultaneously via the in-phase and quadrature components of M -ary quadrature amplitude modulation (MQAM) constellation. Cooperative transmission in this way can avoid the bandwidth expansion in traditional cooperative systems. The closed form expression of the average bit error rate (BER) performance is derived in terms of the...     

Robust cooperative output tracking of networked high-order power integrators systems

This paper focuses on a robust cooperative output tracking problem of networked power integrator systems. The dynamics of each system is considered as a nonlinear high-order power integrator whose linearised model is uncontrollable around its origin. It is proven via Lyapunov Theory that under some mild assumptions and graph structural properties, all agents’ outputs in the network can be synchronised to a desired trajectory with a bounded error in the presence of external disturbances as well as model uncertainties. Moreover, the tracking performance can be tuned by appropriately choosing parameters within the controller. The proposed controller for each agent is in the essence constructed via backstepping technique consisting of three components: the state feedback of its own, the outputs of its neighbours and the information of the desired trajectory if connected, and thus in a distributed manner.     

An approach for community detection in social networks based on cooperative games theory

Detecting communities is of great importance in social network analysis. However it is an issue that has not yet been satisfactorily solved, despite the efforts made by interdisciplinary research communities over the past few years, because of the nature of complexity in deciding how community structures should be recognized. In this paper we propose an approach based on cooperative game theory for community detection in social networks. We regard individuals as players, and regard communities as coalitions formed by players, and model community detection problem as the formation and optimization of coalitions. Furthermore, we define coalition profile for players to indicate coalitions that players joined, the order of a coalition profile is defined as the number of coalitions in a coalition profile, and we introduce a utility function to measure preference of coalition profiles. Accordingly, we propose an algorithm to detect a coalition profile with maximal utility function values. We have implemented the algorithms developed in this study and experimental results demonstrate the effectiveness of our approaches.