AGGREGATION OF FUZZY OPINIONS UNDER GROUP DECISION-MAKING BASED ON SIMILARITY AND DISTANCE

In this article,a new method for aggregating fuzzy individual opinions into a group consensusopinion is proposed.To obtain the aggregation weights of each individual opinion,a consistency indexof each expert with the other experts is introduced based on similarity and distance.The importance ofeach expert is also taken into consideration in the process of aggregation.Finally.a numerical exampleis presented to illustrate the efficiency of the procedure.     

双共识混合链跨异构域身份认证方案

针对目前基于区块链的身份认证方案存在节点性能损耗严重的问题,提出一种基于双共识混合链的跨异构域身份认证方案。采用多因子分析方法对基于综合性能的Raft共识算法进行优化,实现了对节点综合性能的合理评估;选出综合性能优异的节点作为跨域节点,可避免因跨域节点性能不佳而引起的系统故障。该方案结合实用拜占庭容错共识机制并引入监督节点,增强了认证系统的拜占庭容错能力,解决了因恶意节点导致的域内错误认证问题。利用SM9广播密码算法对认证过程中的通信数据进行加密,实现了系统的双向认证和保密通信,确保了系统的安全性。实验表明：该方案的双共识认证机制相较于单一共识认证机制,具有较强的拜占庭容错能力和较高的吞吐量,不但能使系统更加安全稳定,而且减少了单对单加解密计算操作,降低了系统的计算开销和时间开销。     

基于联盟链的微电网身份认证协议

目前,微电网电力交易存在着身份认证协议不安全、交易中心化、数据无法追踪溯源、节点之间缺乏共识等问题,而区块链具有分布式存储、去中心化、数据不可篡改等优势.为此,基于联盟链的微电网身份认证协议,将区块链应用于微电网的身份认证以解决上述问题.首先,使用零知识证明解决了新节点的身份认证问题.其次,将其ID写入Merkle树并在整个联盟链中广播,利用区块链可以保证数据不被篡改的原理确保了数据的安全性和可追溯性,解决了传统电力交易的中心化、数据存储不安全、电力交易无法追踪溯源等问题.最后,凭借着瑞波共识协议所具有的安全高效的优势有效地解决了节点之间的共识问题.通过方案对比可知:该方案采用的零知识证明在身份认证中具有计算开销小及瑞波共识机制算法具备共识速率快的优点.经过安全性分析及性能分析可知:该方案在解决微电网的身份认证安全性问题的同时又能保证节点的运行性能最优.     

The complexity of reconstructing trees from qualitative characters and subtrees

In taxonomy and other branches of classification it is useful to know when tree-like classifications on overlapping sets of labels can be consistently combined into a parent tree. This paper considers the computation complexity of this problem. Recognizing when a consistent parent tree exists is shown to be intractable (NP-complete) for sets of unrooted trees, even when each tree in the set classifies just four labels. Consequently determining the compatibility of qualitative characters and partial binary characters is, in general, also NP-complete. However for sets of rooted trees an algorithm is described which constructs the “strict consensus tree” of all consistent parent trees (when they exist) in polynomial time. The related question of recognizing when a set of subtrees uniquely defines a parent tree is also considered, and a simple necessary and sufficient condition is described for rooted trees. This work was supproted by the Alexander von Humoldt-Stiftung. I wish to thank Andreas Dress, Hans-Jürgen Bandelt and the referees for their helpful comments.     

基于强化学习和共识融合的分布式协作频谱感知方法

在频谱感知中为了解决不同信誉用户网络节点之间的数据融合问题,提出了一种基于强化学习和共识融合的分布式协作频谱感知方法。该方法将每个感知用户认为是一个智能体(agent),agent通过强化学习算法从相邻节点选择合作用户进行共识融合,采用信誉值作为奖励,确保agent倾向于信誉高的节点进行融合,并同时降低恶意用户的信誉值,使其逐渐退出感知网络,最后采用一致性融合方法使整个网络达成共识,并与判决门限对比,完成协作频谱感知。仿真实验表明,该方法能够有效的识别恶意用户,并通过强化学习提高整个网络的感知性能,使协作频谱感知网络更具智能性和稳定性。     

Group consensus for multiple networked Euler-Lagrange systems with parametric uncertainties

In this paper,a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters.In the group consensus problem,the agents asymptotically reach several different states rather than one consistent state.A novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed for each agent in order to solve the couple-group consensus problem.It is shown that the group consensus is reachable even when the system contains the uncertain parameters.Furthermore,the multi-group consensus is discussed as an extension of the couple-group consensus,and then the group consensus with switching topology is considered.Simulation results are finally provided to validate the effectiveness of the theoretical analysis.     

Consensus design for continuous-time multi-agent systems with communication delay

This paper investigates a consensus design problem for continuous-time first-order multiagent systems with uniform constant communication delay.Provided that the agent dynamic is unstable and the diagraph is undirected,sufficient conditions are derived to guarantee consensus.The key technique is the adoption of historical input information in the protocol.Especially,when agent＇s own historical input information is used in the protocol design,the consensus condition is constructed in terms of agent dynamic,communication delay,and the eigenratio of the network topology.Simulation result is presented to validate the effectiveness of the theoretical result.     

关于凸模糊锥的定义

给出了凸模糊锥的两种定义方法.首先,应用模糊点与模糊集的邻属关系,给出了( β, α) 凸模糊锥的定义.得到了三种有意义的凸模糊锥,即(∈,∈) 凸模糊锥,(∈,∈∨q) 凸模糊锥和(∈,∈∨q) 凸模糊锥.其次,利用合意空间理论,给出了C 凸模糊锥的定义.证明了(∈,∈) 凸模糊锥是C 凸模糊锥,C 凸模糊锥是基于t 范上的凸模糊锥,并且C 凸模糊锥同构于由经典凸锥生成的C 凸模糊锥.     

多无人机协同探测快速目标的控制方法设计

针对无人机(unmannd aerial vehicle, UAV)对快速运动目标的协同探测问题, 设计了一种多UAV协同探测控制算法。首先假设每架UAV都携带相同的探测载荷, 根据载荷特性设计了针对快速运动目标的UAV协同探测队形。然后引入固定时间控制一致性协议到UAV载荷角度控制中, 控制载荷持续照射目标; 引入有限时间一致性协议到UAV编队控制中, 用以形成协同探测队形, 并通过二跳网络加快队形的收敛。通过将UAV队形控制与UAV载荷的角度控制相结合, 从而实现UAV对快速运动目标探测时间的最大化, 极大的延长了高速运动目标被发现的时间。最终通过理论分析和仿真实验证明了该控制算法的有效性。