面向安全的轮流中继选择方案

针对多中继轮流中继系统被窃听的问题,提出面向安全的轮流中继选择方案。首先提出了遍历的最优中继选择方案,并推导得到了保密速率的理论值;之后为降低复杂度,分别从降低计算复杂度和信道估计开销的角度设计了两种两阶段的次优中继选择方案,先缩小中继选择范围再进行搜索。仿真结果表明K-最大主信道中继选择方案能够以较低的复杂度实现最优保密速率。     

基于Intel VT硬件虚拟化的Rootkit技术

Intel VT硬件虚拟化技术使Rootkit可以利用底层优势实现深度隐藏。首先结合木马协同隐藏的思想,提出了基于Intel VT硬件虚拟化的Rootkit(HVRootkit)的协同隐藏模型,并给出形式化描述;然后根据该模型,在深入分析进程切换过程和操作系统内核数据结构的基础上,设计并实现了HVRootkit原型,该原型能够监控系统进程的切换过程,并通过修改与内核层进程视图和用户层进程视图相关的数据结构,隐藏系统进程。实验表明,HVRootkit原型符合协同隐藏的思想,能够实现对进程的深度隐藏,隐藏性能明显优于传统的内核级Rootkit。     

基于协同创新理念的高校研究生党建工作模式的研究

传统的高校研究生党建工作模式因自身的不适应性在新时期面临重重困境,协同创新理念已经成为当今高校探索资源共享新型研究生党建工作模式的必然选择。本文从理念、战略、利益三方面阐述对协同创新理念下研究生党建工作和思想政治教育的研究,并从构建校园网络平台、加强研本互动、完善交流机制三个具体措施表达了对协同创新理念推动研究生党建工作创新的理解。     

协同设计中的应用共享技术研究

文章针对目前应用共享的国内外研究现状,从应用共享的原理入手,对应用共享的一个核心问题--共享机制以及按共享机制的分类进行了分析和研究,进而讨论了应用共享的实现过程所涉及到应用共享实现方法.并通过协同设计工具及系统的开发对实现应用共享过程中遇到的问题,提出了一些相对较优的解决办法.     

高校科研能力的协同IWD粗糙集-块神经网络评估模型

针对高校科研能力评估过程中存在的多因素、高非线性特点,经典评估模型主观性较强,导致模型评估准确性不高的问题,提出基于协同智能水滴算法IWD和粗糙集块神经网络RBNN的高校科研能力评估模型。首先,引入智能水滴算法,并针对传统智能水滴算法固定旁域搜索范围不利于提升算法搜索效率的问题,提出一种局部空间自动缩放算法LSAS,该算法根据当前种群最优个体,自动调整下一步搜索空间大小,对进化过程进行指导,提高算法的进化效率;其次,基于粗糙集理论对高校科研能力数据进行特征预处理,简化数据计算量;最后,对块神经网络和粗糙集参数进行编码,并对高校科研能力模型进行评估。仿真结果表明,此评估模型具有较高的准确性和较快的计算效率。     

Game‐Based Valley‐Fill Charging Coordination for Large‐Population Plug‐in Electric Vehicles

Charging coordination of large‐population autonomous plug‐in electric vehicles (PEVs) in the power grid can be formulated as a class of constrained optimization problems. To overcome the computational complexity, a game‐based method is proposed for the charging problems of the PEV population, which is composed of homogeneous subpopulations, such that individuals update their best charging strategies simultaneously with respect to a common electricity price determined by the total demand. To mitigate the oscillation behavior caused by the greedy behavior for the cheap electricity by individuals, a deviation cost is introduced to penalize against the deviation of the individual strategy from the average value of the homogeneous subpopulation. By adopting a proper deviation cost and following a best strategy update mechanism, the game systems may converge to the socially optimal valley‐fill Nash equilibrium. Simulation examples are studied to illustrate the results.     

自主-合作教学模式在C＋＋程序设计教学改革中的应用

针对在C＋＋程序设计课程教学中存在的问题,结合对自主-合作教学模式的研究,提出以自主学习教学模式贯穿教学始终;案例驱动的精讲与泛读相结合;手写程序与机器调试相结合;自主学习与合作学习相结合的教学新思路。并阐述了上述方法在教学改革实践中的具体应用及效果。     

Joint relay selection and power allocation for amplify-and-forward two-path relaying networks

This paper presents a joint relay selection and power allocation scheme for amplify-and-forward two-path relaying networks,in which diferent relay nodes forward information symbols alternatively in adjacent time slots.Our approach is based on the maximization of the received signal-to-noise ratio under total power consumption by the transmission of the symbol.We show that in spite of inter-relay interferences,the maximization problem has a closed-form solution.Simulation results explicitly indicate that the performance of proposed approach outmatches the existing methods including equal power allocation and one-path relaying.     

A suboptimal joint bandwidth and power allocation for cooperative relay networks＂ a cooperative game theoretic approach

In commercial networks, user nodes operating on batteries are assumed to be selfish to consume their resources (i.e., bandwidth and power) solely maximizing their own benefits (e.g., the received signal-to-noise ratios (SNRs) and datarates). In this paper, a cooperative game theoretical framework is proposed to jointly perform the bandwidth and power allocation for selfish cooperative relay networks. To ensure a fair and efficient resource sharing between two selfish user nodes, we assume that either node can act as a source as well as a potential relay for each other and either node is willing to seek cooperative relaying only if the datarate achieved through cooperation is not lower than that achieved through noncooperation (i.e., direct transmission) by consuming the same amount of bandwidth and power resource. Define the cooperative strategy of a node as the number of bandwidth and power that it is willing to contribute for relaying purpose. The two node joint bandwidth and power allocation (JBPA) problem can then be formulated as a cooperative game. Since the Nash bargaining solution (NBS) to the JBPA game (JBPAG) is computationally difficult to obtain, we divide it into two subgames, i.e., the bandwidth allocation game (BAG) and the power allocation game (PAG). We prove that both the subgames have unique NBS. And then the suboptimal NBS to the JBPAG can be achieved by solving the BAG and PAG sequentially. Simulation results show that the proposed cooperative game scheme is efficient in that the performance loss of the NBS result to that of the maximal overall data-rate scheme is small while the maximal-rate scheme is unfair. The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance.     

Fair relay selection in decode-and-forward cooperation based on outage priority

The opportunistic cooperation schemes,where only the "best" relay is selected to forward the message,have been widely investigated recently for their good performance in terms of outage probability.However,the unfair selections of relays may cause unbalance power consumptions among relays,which reduces the lifetime of energy constrained networks.In this paper,we introduce a novel concept of outage priority based fairness(OPF),aiming at improving the selection fairness among relays appropriately without outage performance deterioration.Then,a cooperation scheme is proposed to meet this concept,and corresponding theoretical analysis is also provided.Afterward,based on OPF,the achievable upper bound of the fairness is derived,and an optimal cross-layer designed scheme is also provided to achieve the bound.Numerical simulations are carried out finally,which not only validate the theoretical analysis,but also show that taking advantages of the proposed schemes,the fairness among all relays,as well as the network lifetime,can be greatly improved without any loss of outage performance,especially in high SNR regime.