矩阵DA的特征值及在系统稳定性分析中的应用

本文分析了矩阵ＤＡ的特征值，并提出了一种新的矩阵稳定性问题：Ｄ－－稳定性和块Ｄ－－稳定性．这里Ｄ是一个正对角阵，Ａ是给定的矩阵．应用劳斯判据及李雅普诺夫方法等，详细地分析了此类稳定性问题，提出了一些易于验证的结果，可用于分析多变量奇异摄动系统稳定问题．     

基于联系矩阵的围岩稳定性组合评价模型

围岩稳定性评价受诸多类型因素影响,是一个复杂不确定系统问题.为克服基于单一信息评价方法只能从特定角度分析围岩稳定性问题的缺陷,应用集对分析耦合理论探讨了可统一与融合各类信息特点的围岩稳定性组合评价新模型,以充分利用各类评价方法所包含的有用信息和避免单一方法预测错误的风险.该模型首先基于各种典型评价方法独立分析围岩稳定性,然后将获得的评价结果两两构成集对进行同异反分析,以构建联系矩阵和合理确定权重,最后基于组合原理综合评定围岩稳定性类别.实例应用结果表明,该模型用于围岩稳定性评价是有效可行的,且能综合各类评价方法的优点与提高预测精度,也为类似评价问题提供了参考.     

一类近可积Hamilton系统中随机现象和Smale马蹄间的关系

本文得到一种方法,可以用来研究含有两时间尺度系统中的复杂动力学行为.特别,利用这种方法,本文讨论了一类含有两时间尺度的近可积Hamilton系统的随机性,证明它实际上一种Smale马蹄意义下的混沌.最后,通过一个例子说明我们方法的有效性并在其中发现了一张随机网.     

复杂物流系统订货点量建模与仿真优化

复杂物流系统是一个由若干个制造商、若干个批发商和若干个零售商组成的网状物流链.讨论了在不确定性环境下,采取周期性盘点策略的复杂物流系统中各实体订货点量的建模与仿真问题.作者认为,在分散控制策略和以零售商为核心的控制策略这两种情况下,可以通过建立基于模糊集合理论的复杂物流系统模糊分析模型来确定各实体的最佳订货点量,在此基础上运用作者所开发的复杂物流系统仿真工具CLSim对订货点量进行仿真优化,可以得到在物流链集成控制策略下的订货点量.文章的最后,通过一个实例对作者的上述观点进行了说明.     

基于综合函数设计的模糊系统及其插值机理

分析现有模糊系统的数学表示形式,注意到模糊系统输出函数的构造常采用对规则后件模糊集峰点(中心)值加权平均的方法. 综合函数是因素空间理论中利用简单因素状态合成复杂因素状态的有效工具, 本文将综合函数用于构造规则后件模糊集峰点(中心)值的权重, 给出一种新的模糊系统设计方法, 并且证明了这种基于综合函数的模糊系统可归结为一种插值函数.     

基于合成规则的相似性推理及其在焊接参数设计中的应用

焊接过程是典型的复杂过程,应用模糊逻辑建立焊接参数推理系统可快速实现焊接工艺参数设计.近似推理机制是模糊系统研究和开发中的一个重要组成部分,在现有的相似性推理方法的基础上,融合经典的合成规则推理技术,提出一种新的基于合成规则的相似性推理方法.以CO_2保护焊焊接规范参数设计为背景介绍模糊推理在焊接领域的应用,运行结果表明,采用方法建立的模糊推理模型具有较高的推算精度,能够满足焊接工艺参数设计的要求.     

一个命题的逻辑结构分析

考虑了以数理逻辑中的等值演算为工具对一个结构较为复杂的定理的逻辑结构做了分析.这为我们常用的分析命题结构的方法如逆否命题等提供了一个新思路.     

输液管道流固耦合非线性动力稳定分析

将弱约束输流管道非定常流液固耦合运动按波-流-振动系统建模成由4个非线性微分方程组成的分析模型,按模态进行分解研究系统在多种耦合状态下具有的运动稳定特性.以悬臂梁管道为例分析了耦合系统奇点的属性,得到了前四阶模态运动的相图.结果说明,多种耦合条件下输流管道的稳定性变得更为复杂,各阶模态运动具有不同的稳定特性.     

混料对称设计最优性的图检验法

在混料试验中,当混料模型较为复杂且混料成份较多时,要验证一个设计ξ的最优性是比较困难的.一方面,当模型或约束较为复杂时难以证明方差函数是否满足最优性准则条件,另一方面,当混料成份多于3时不能通过绘制方差函数的曲面图来观察最优性.文章提出一种可用于验证混料对称设计的最优性的图检验法,通过实例分析,这种方法是有效的.     

具有限时滞一阶线性泛函微分方程的稳定性区域划分

讨论了一阶线性有限时滞泛函微分方程的稳定性区域,用一个超平面把参数空间划分为不同的稳定性区域.这个超平面上的每一点对应于特征方程在纯虚轴上至少存在一个零根(原点除外),所得结论可用于Hofp分枝分析和控制理论.     

基于半马尔科夫过程的逻辑门可靠性分析

动态故障树分析方法是在静态故障树的基础上拓展而来的自上而下的图形化演绎技术,可以很好地对具有复杂失效行为和交互作用的系统进行建模,进而分析系统的可靠性。本文从动态故障树逻辑门的可靠性建模与分析入手,结合半马尔科夫过程原理,将动态逻辑门转化为半马尔科夫链。其次给出在半马尔科夫链中动态逻辑门输出事件的发生概率和系统可靠性的计算公式。提出各种逻辑门到半马尔科夫链的通用转化模型,通过更改通用模型中的相关参数,将逻辑门转化为半马尔科夫链。最后,基于半马尔科夫过程求解动态逻辑门输出事件的发生概率,以动态优先与门、顺序相关门和备件门为例,并给出系统可靠性的计算公式。     

Stability analysis of data-driven local model networks

This article discusses stability analysis of data-driven dynamic local model networks. In contrast to traditional fuzzy modelling, the structure and complexity of such model architectures is not unique when only observed input- and output data are available for their parametrization. The present article complements the well-known trade-off between accuracy and complexity by the notion of stability. For this purpose, existing Lyapunov stability criteria for local model networks are extended by a decay rate which represents a scalar and quantitative stability measure. It allows to compare models with different degrees of complexity also in view of their stability. For some of the commonly available Lyapunov stability criteria, the individual local model transitions are crucial. Therefore, in this article, an approach is introduced to determine the actually occurring model transitions by means of the identification data. The methods presented in the article are illustrated and discussed by means of a simulation example. It is shown how model complexity and the related approximation quality can have an adverse impact on the stability and how the outcome of different Lyapunov criteria is affected by the proper determination of local model transitions.     

Study on a 3-dimensional game model with delayed bounded rationality

A nonlinear dynamic triopoly game model is studied based on the theory of nonlinear dynamics and previous researches in this paper. A lagged structure is introduced to the model to study stability conditions of the Nash equilibrium under a local adjustment process when players price their products with delayed bounded rationality. Numerical simulations are provided to demonstrate the complexity of system evolvement and influence of the strategy of delayed bounded rationality on system stability. We find that besides the lagged structure, suitable delayed parameters are also important factors to eliminate chaos or expand the stable region of the system, and various players’ adjustment parameters have different effect on stability of the system.     

Rudimentary Languages and Second-Order Logic

The aim of this paper is to point out the equivalence between three notions respectively issued from recursion theory, computational complexity and finite model theory. One the one hand, the rudimentary languages are known to be characterized by the linear hierarchy. On the other hand, this complexity class can be proved to correspond to monadic second-order logic with addition. Our viewpoint sheds some new light on the close connection between these domains: We bring together the two extremal notions by providing a direct logical characterization of rudimentary languages and a representation result of second-order logic into these languages. We use natural arithmetical tools, and our proofs contain no ingredient from computational complexity.     

基于交互耦合网络的项目组合决策模型研究

随着项目活动进入“大尺度”时代,复杂性成为现代化项目组合管理中的突出问题。在项目组合决策系统复杂性分析基础上,提出了交互耦合网络视角下的项目组合决策系统表征方法;借鉴非线性动力学建模方法构建项目组合决策系统复杂动力网络模型,结合模型的稳定解和稳定条件将项目组合决策系统划分为竞争型、共生型、强依存型和弱依存型,并通过数值仿真方法对系统的稳定域、分岔和混沌进行分析。研究表明,项目组合决策系统的复杂性和稳定性依赖于系统内交互关系作用,改善协作关系,避免过分竞争,以系统整体为先优化配置有利于项目组合目标实现。     

Upper bounds on complexity of Frege proofs with limited use of certain schemata

The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of the logic. The existence of a polynomial bound on proof complexity of every statement provable in this logic is a well-known open question. The axiomatization consists of three schemata. We show that any statement provable using unrestricted number of axioms from the first of the three schemata and polynomially-bounded in size set of axioms from the other schemata, has a polynomially-bounded proof complexity. In addition, it is also established, that any statement, provable using unrestricted number of axioms from the remaining two schemata and polynomially-bounded in size set of axioms from the first scheme, also has a polynomially-bounded proof complexity.     

Two results in negation-free logic

Negation-free propositional logic (or first-order logic) is clearly less expressive than the corresponding full system with negation. However, we present two complexity results for logic without negation that are no different from those for the original system. First, the problem of determining logical implication between sentences composed solely of conjunctions and disjunctions is shown to be as difficult as that between arbitrary sentences. Second, we show that the problem of determining a minimum satisfying assignment for a propositional formula in negation-free conjunctive normal form, even with no more than two disjuncts per clause, is NP-complete. We also show that unless P = NP, no polynomial time approximation scheme can exist for this problem.     

On the stability and Hopf bifurcation of a delay-induced predator–prey system with habitat complexity

We study the effect of the degree of habitat complexity and gestation delay on the stability of a predator–prey model. It is observed that there is stability switches, and Hopf bifurcation occurs when the delay crosses some critical value. By applying the normal form theory and the center manifold theorem, the explicit formulae which determine the stability and direction of the bifurcating periodic solutions are determined. The qualitative dynamical behavior of the model system is verified with the published data of Paramecium aurelia (prey) and Didinium nasutum (predator) interaction. It is observed that the quantitative level of abundance of system populations depends crucially on the delay parameter if the gestation period exceeds some critical value. However, the fluctuations in the population levels can be controlled completely by increasing the degree of habitat complexity.     

Complexity and asymptotic stability in the process of biochemical substance exchange in a coupled ring of cells

We have considered the complexity and asymptotic stability in the process of biochemical substance exchange in a coupled ring of cells. We have used coupled maps to model this process. It includes the coupling parameter, cell affinity and environmental factor as master parameters of the model. We have introduced: (i) the Lempel–Ziv complexity spectrum and (ii) the Lempel–Ziv complexity spectrum highest value to analyze the dynamics of two cell model. The asymptotic stability of this dynamical system using an eigenvalue-based method has been considered. Using these complexity measures we have noticed an “island” of low complexity in the space of the master parameters for the weak coupling. We have explored how stability of the equilibrium of the biochemical substance exchange in a multi-cell system (N = 100) is influenced by the changes in the master parameters of the model for the weak and strong coupling. We have found that in highly chaotic conditions there exists space of master parameters for which the process of biochemical substance exchange in a coupled ring of cells is stable.     

Discovering the dynamic behavior of unknown systems using fuzzy logic

To know the dynamic behavior of a system it is convenient to have a good dynamic model of it. However, in many cases it is not possible either because of its complexity or because of the lack of knowledge of the laws involved in its operation. In these cases, obtaining models from input–output data is shown as a highly effective technique. Specifically, intelligent modeling techniques have become important in recent years in this field. Among these techniques, fuzzy logic is especially interesting because it allows to incorporate to the model the knowledge that is possessed of the system, besides offering a more interpretable model than other techniques. A fuzzy model is, formally speaking, a mathematical model. Therefore, this model can be used to analyze the original system using known systems analysis techniques. In this paper a methodology for extract information from unknown systems using fuzzy logic is presented. More precisely, it is presented the exact linearization of a Takagi–Sugeno fuzzy model with no restrictions in use or distribution of its membership functions, as well as obtaining its equilibrium states, the study of its local behavior and the search for periodic orbits by the application of Poincaré.