Multiswitching dual combination synchronization of time‐delay chaotic systems

This paper presents a novel synchronization scheme of multiswitching dual combination synchronization which is first of its kind. Multiswitching dual combination synchronization is achieved for 6 time‐delay chaotic systems. Asymptotically stable synchronization states are established by nonlinear control method and Lyapunov Krasovskii functional. To elaborate the proposed scheme, an example of time‐delay Rossler, Chen, and Shimizu Morioka systems is considered, where time‐delay Rossler system and Chen system are considered as drive systems and time‐delay Shimizu Morioka system is considered as response system. Theoretical analysis and computational results are in excellent agreement.     

基于指标变异程度与关联程度组合赋权的中国工业结构转换能力动态综合评价

从需求因素、供给因素、技术因素、可持续发展和对外贸易五方面构建了中国工业结构转换能力评价指标体系,运用反映指标变异程度差异信息的熵值法和离差最大化法以及反映指标关联程度差异信息的BP-DEMATEL方法确定指标权重,然后运用最小距离—最大熵方法对不同的权重结果进行集成得到组合权重,以此权重对中国30个省份的工业结构转换能力进行了静态与动态评价。评价结果显示中国工业结构转换能力各省份非均衡发展现象突出,呈现从东向西阶梯状递减的规律。     

自成像共焦腔相干合成空间滤波器设计

理论分析了利用自成像共焦腔实现激光列阵相干合成的物理模型,对自成像共焦腔的一维相干合成和二维相干合成进行了模拟仿真计算,得到腔内场的强度分布图样.在此基础上,研究了空间滤波器在相干合成中实现模式选择的机理,并讨论滤波器的设计对相干合成及模式选择的影响,分别对一维相干合成和二维相干合成的情况,仿真计算了输出功率与滤波器位置和宽度的关系,为实验提供了理论依据.     

ASDI:基于M-AHP-熵赋权法的机场可持续发展综合指数设计

通过分析探讨机场可持续发展综合评估问题,设计了由1个目标、3个准则和20个指标组成的机场可持续发展综合评价体系,建立了机场可持续发展定量评估综合指数模型.综合指数模型基于主客观相结合的M—AHP-熵权组合赋权法设计,力争对机场的可持续发展全面系统性的分析评估,最后结合上海机场为对象进行实证分析,结果符合各时期的实际情况,表明评价体系和评价方法的科学性与合理性.     

横向监督中基于社会偏好匹配的员工组合问题研究

考虑横向监督中基于社会偏好的三种员工组合方式:同质组合、异质组合与双高组合。运用委托代理理论,研究基于社会偏好匹配的员工组合问题。模型分别给出了不存在横向监督、存在横向监督且员工是同质组合、存在横向监督且员工是异质组合与存在横向监督且员工是双高组合四种情形下的均衡结果。根据均衡结果做进一步分析,得出结论:①存在横向监督时员工的努力程度与企业收益总是高于不存在横向监督的情形,但不同的员工组合方式对其努力程度的激励效果是相同的;②异质组合能够通过节约薪酬成本而间接地提高企业总收益,双高组合能够通过获得较多的员工投入而直接增加企业总收益,并且异质组合与双高组合总是优于同质组合;③员工的社会偏好与风险成本是决定企业最佳员工组合方式选择的关键因素:当员工的风险成本很小而社会偏好差距较大时企业应选择异质组合;而当员工的风险成本很大或者风险成本小并且员工社会偏好差距也较小时企业应选择双高组合;因此,根据员工的个性特征选择适宜的组合方式是实现横向监督激励效应最大化的关键。     

Complexity of networks II: The set complexity of edge‐colored graphs

We previously introduced the concept of “set‐complexity,” based on a context‐dependent measure of information, and used this concept to describe the complexity of gene interaction networks. In a previous paper of this series we analyzed the set‐complexity of binary graphs. Here, we extend this analysis to graphs with multicolored edges that more closely match biological structures like the gene interaction networks. All highly complex graphs by this measure exhibit a modular structure. A principal result of this work is that for the most complex graphs of a given size the number of edge colors is equal to the number of “modules” of the graph. Complete multipartite graphs (CMGs) are defined and analyzed. The relation between complexity and structure of these graphs is examined in detail. We establish that the mutual information between any two nodes in a CMG can be fully expressed in terms of entropy, and present an explicit expression for the set complexity of CMGs (Theorem 3). An algorithm for generating highly complex graphs from CMGs is described. We establish several theorems relating these concepts and connecting complex graphs with a variety of practical network properties. In exploring the relation between symmetry and complexity we use the idea of a similarity matrix and its spectrum for highly complex graphs. © 2012 Wiley Periodicals, Inc. Complexity, 2012     

与一般相似度函数相关的谱聚类的收敛性

谱聚类算法由与相似度函数相关的图Laplace 算子的特征函数产生. 本文证明与一般相似度函数相关的谱聚类算法的收敛性, 并使用覆盖数方法对收敛性给出量化估计. 当相似度函数是欧氏空间子集上一个Lipschitz s > 0 函数时, O(√log(n + 1)/√n) 形式的收敛率得到证实. 我们同时指出一个相应函数集的覆盖数的增长可以表现任意差.