Virtual reality mobility model for wireless ad hoc networks

For wireless ad hoc networks simulation, node＇s mobility pattern and traffic pattern are two key elements. A new simulation model is presented based on the virtual reality collision detection algorithm in obstacle environment, and the model uses the path planning method to avoid obstacles and to compute the node＇s moving path. Obstacles also affect node＇s signal propagation. Considering these factors, this study implements the mobility model for wireless ad hoc networks. Simulation results show that the model has a significant impact on the performance of protocols.     

网络化制造环境下生产动态调度仿真与分析

针对网络化制造环境下生产系统特点,构建异地生产协同调度框架.基于调度框架进行动态仿真计算:应用模糊理论对生产时间分布概率进行判断,确定企业内部生产调度评测参数;使用Hopfield神经网络综合决策,求出企业外协生产与内部调度之间的可行解.将调度框架应用在实际生产调度问题中,对仿真计算结果继续综合优化,能够得到好的可行调度方案.     

异构无线分组网络中的接入选择机制

传统多接入选择(Multi-Radio Access Selection)方法只针对话音业务,在设计中仅仅考虑已接入用户数及系统容量,由于未将"分组级"信息考虑在内而不适用于无线分组网络。提出了一种新的异构无线分组网络中的接入选择算法,分组业务在多接入选择时考虑了实时、非实时的不同QoS要求和链路自适应机制(链路层重传及自适应调制编码);用户接入后,在保证其QoS的基础上,同时达到不同网络间负载均衡的目的。基于OPNET Modeler的动态仿真对算法性能进行了仿真评估,并与传统的最小用户数和最小路径损耗多接入选择方法在保证业务QoS和负载均衡性能方面进行了比较。     

New results on the robust stability analysis of neural networks with discrete and distributed time delays

Delay-dependent robust stability of cellular neural networks with time-varying discrete and distributed time-varying delays is considered. Based on Lyapunov stability theory and the linear matrix inequality （LMIs） technique, delay-dependent stability criteria are derived in terms of LMIs avoiding bounding certain cross terms, which often leads to conservatism. The effectiveness of the proposed stability criteria and the improvement over the existing results are illustrated in the numerical examples.     

传感器网络中基于最小覆盖重叠的移动部署

为了优化随机部署的传感器网络的覆盖率,提出了基于最小覆盖重叠(MCO,Minimum Coverage Overlap)的分布式移动部署算法.算法执行时,每个节点根据获得的邻居节点位置信息,计算节点覆盖圆周上覆盖重叠的分布情况,并沿着最大程度减小覆盖重叠的方向移动.通过算法的迭代运行,使网络覆盖重叠程度尽量减小,从而最大限度的优化了网络的覆盖率.仿真结果表明,与基于Voronoi图的算法相比,MCO算法在覆盖率、移动效率、移动距离和部署时间等方面具有更高的性能.     

复杂网络确定性模型研究的最新进展

复杂网络的确定性模型在复杂网络建模领域起着不可或缺的作用。按照复杂网络经典模型发展的先后次序,依次对随机图、小世界网络、无标度网络以及加权网络确定性模型的研究现状进行较全面的综述,重点介绍了相关模型的构造及其主要性质,并对复杂网络确定性模型未来的部分发展方向进行了展望。     

复杂网络演化博弈理论研究综述

综述复杂网络的结构特性对演化博弈动力学的影响的最新研究成果,研究个体在相互作用和冲突中的策略选择和演化问题,关注自私个体中合作现象的涌现。着重介绍了受到广泛关注的囚徒困境和雪堆博弈两个简单的博弈模型,并利用复杂网络刻画了个体间的联系,研究了空间结构与博弈动力学之间的关系,探讨了未来工作的研究方向。     

储层含油性识别中ANN和GA融合的模糊规则提取

提出一种基于ANN和GA融合的自学习自适应的模糊规则提取算法,用来对油层进行识别.其方法是:首先运用人工神经网络(ANN)对训练样本进行有导师学习,网络的输入是测井属性,输出表达为网络权值和输入的函数Ψk=f(xi(WG1)ij,(WG2)jk)(其中:Ψk代表含油性类别Ck的判别函数;C1为干层;C2为水层;C3为差油层;C4为油层).然后,以Ψk作为遗传算法(GA)中的适应度函数提取对应于类别Ck的模糊规则.最后,通过某油田oilsk81和oilsk83油井的实证研究表明,该方法能够有效地识别储层的含油性.     

Conflict Pattern Analysis: Preparing the Ground for Participation in Policy Implementation

The participation of non-state actors in implementation processes is often understood as a means to increase compliance efficiency. But the implementation of spatial policies frequently focuses on pre-established goals, processes and instruments and thus renders difficult open discourse and shared decision-making. This paper introduces conflict pattern analysis (CPA) as a tool that supports the analysis of the actual actor constellation in order to define efficient approaches that avoid common problems of participatory processes. CPA is a semi-formalised method that helps to identify key-actors, their relations and interaction amongst each other as well as their core beliefs, interests and resources. It aggregates this information to interaction patterns that can be compared, classified and linked to different participatory methods on a theoretically informed basis. Particularly on the local and regional level, this could be the first step for successful (participatory) implementation strategies.     

基于MPSO-BP的RBF网络自构建学习算法

采用PSO混合编码,提出了一种基于混合MPSO-BP的RBF自构建学习算法。该算法中,每个粒子由整数与实数两部分构成,分别对RBF的基函数个数及相关参数(中心、宽度和输出层权值)进行编码。同时设计了一个特殊的适应度函数,在保证精度的前提下,使网络的结构相对简单,以增强网络的自适应与泛化能力,减少主观因素设计对网络性能的影响。仿真实验表明,相对于RBF其他学习算法,所提算法隐节点少、精度高、泛化能力强。