利用少量体压传感器和支持向量机算法的坐姿识别方法

针对传统坐姿识别系统中传感器数量多和系统较复杂导致成本过高等问题,设计一种基于少量体压传感器和支持向量机(SVM)算法的坐姿识别方法.首先,设计一种由少量薄膜压力传感器构成的体压传感阵列,将其置于坐垫内部;然后,利用该传感阵列采集不同坐姿的体压数据,并绘制相应的体压分布等高线图;最后,以体压数据作为特征向量,结合支持向量机算法建模,以实现坐姿分类自动识别.测试结果表明:少量体压传感器也能获取不同坐姿的体压分布特征;SVM坐姿分类模型在熟悉样本下的坐姿识别准确率达98.3%,在陌生样本下的坐姿识别准确率达92.5%.     

通信距离受限条件下的无人机集群协同区域搜索

针对通信距离受限条件下的无人机(unmanned aerial vehicle, UAV)集群协同搜索任务, 考虑防相撞约束, 定制了一种能够在搜索过程中根据机间距离切换交互方法的UAV交互决策机制, 实现了动态环境中的搜索航迹规划。首先, 运用栅格化方法建立包含3种属性的环境认知地图对任务区域进行表征。其次, 考虑多种搜索任务需求, 以最大化搜索效率为目标建立UAV集群协同搜索模型。然后, 根据机间有效通信距离定义了UAV协同搜索过程中的通信状态, 设计了一种能够在通信完全有效、局部有效以及完全失效3种典型场景下切换信息交互方法的信息交互与决策机制。最后, 采用滚动时域优化方法, 实现集群各成员的自主决策与交互行为。仿真结果表明, 所提算法能够在通信距离受限条件下有效完成协同搜索任务, 在完成覆盖搜索任务时能够有效兼顾对动目标的搜索。     

复杂网络中连通支配中心性的计算

分析了现实生活中对重要节点的需求背景,对连通的网络模型提出了一种新型中心性评价指标,连通支配中心性。该中心性利用网络连通支配集的"连通"和"支配"两大特性,通过循环构建点导出支配子图的连通支配集,生成一棵支配关系扩展有向树。然后基于各节点在该有向树中的支配层次数,支配数和支配边权值3方面的属性,设计了反映节点支配能力强弱的中心性计算公式。最后以合作关系图为例进行相应实验,发现连通支配中心性比较高的节点不仅构成了网络的骨干网,能较好地维持网络基本形态,而且能桥接几个不同研究分区,起到一定的中介作用,体现了网络中节点的组织控制能力。     

Some interval-valued intuitionistic uncertain linguistic hybrid Shapley operators

Two interval-valued intuitionistic uncertain linguistic hybrid operators cal ed the induced interval-valued intuitionistic uncertain linguistic hybrid Shapley averaging （I-IIULHSA） operator and the induced interval-valued intuitionistic uncertain linguistic hybrid Shapley geometric （I-IIULHSG） operator are defined. These operators not only reflect the importance of elements and their ordered positions, but also consider the correlations among elements and their ordered positions. Since the fuzzy measures are defined on the power set, it makes the problem exponentially complex. In order to simplify the complexity of solving a fuzzy measure, we further define the induced interval-valued intuitionistic uncertain linguistic hybrid λ-Shapley averaging （I-IIULHλSA） operator and the induced interval-valued intuitionistic uncertain linguistic hybrid λ-Shapley geometric （I-IIULHλSG） operator. Moreover, an approach for multi-attribute group decision making under the interval-valued intuitionistic uncertain linguistic environment is developed. Finally, a numerical example is provided to verify the developed procedure and demonstrate its practicality and feasibility.     

Opportunistic spectrum sharing in software defined wireless network

Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks（MWNs） which significantly change human life. However, proliferating mobile demands lead to several intractable challenges that MWN has to face. Software-defined network is expected as a promising way for future network and has captured growing attention. Network virtualization is an essential feature in software-defined wireless network（SDWN）, and it brings two new entities, physical networks and virtual networks. Accordingly, efficiently assigning spectrum resource to virtual networks is one of the fundamental problems in SDWN. Directly orienting towards the spectrum resource allocation problem, firstly, the fluctuation features of virtual network requirements in SDWN are researched, and the opportunistic spectrum sharing method is introduced to SDWN. Then, the problem is proved as NP-hardness. After that, a dynamic programming and graph theory based spectrum sharing algorithm is proposed.Simulations demonstrate that the opportunistic spectrum sharing method conspicuously improves the system performance up to around 20%–30% in SDWN, and the proposed algorithm achieves more efficient performance.     

可列个非负线性合成对策的解结构

给出了可列个非负线性合成对策，证明了可列个非负线性合成对策的几种解也可由其子对策相应的解来表达，从而解决了可列个非负线性合成对策解的结构问题．     

C4k∪C4k∪Cm的优美性

Ｃ４ｋ∪Ｃ４ｋ的优美性已被证明，本文研究Ｃ４ｋ∪Ｃｋ∪Ｃｍ的优美性。给出了其为优美图的必要条件，同时给出了Ｃ４ｋ∪Ｃｋ∪Ｃｋ－１，Ｃ４（３ｔ＋１）∪Ｃ（ｔ＋１）∪Ｃ４（２ｔ＋１）以及Ｃ４（３ｔ＋１）∪Ｃ（３ｔ－１）∪Ｃｔ－１的优美标号。     

蕴含3Cl可图序列

设σ（３Ｃｌ，ｎ）是具有下述性质的最小正偶数，每个项和至少为σ（３Ｃｌ，ｎ）的ｎ项可图序列π都有一个实现含有长为３，４，…，ｌ的圈．本文首先给出了σ（３Ｃｌ，ｎ）的下界，并确定了当４ｌ６且ｎｌ时σ（３Ｃｌ，ｎ）的值．     

路图Pk（G）含有奇洞的充分性条件

研究了路图Pk(G）的完美性，得到路图Pk(G)含有奇洞的几个充分性条件。