Krylov subspace methods of Hessenberg based for algebraic Riccati equation

In this paper, we propose a class of special Krylov subspace methods to solve continuous algebraic Riccati equation (CARE), i.e., the Hessenberg-based methods. The presented approaches can obtain efficiently the solution of algebraic Riccati equation to some extent. The main idea is to apply Kleinman-Newton"s method to transform the process of solving algebraic Riccati equation into Lyapunov equation at every inner iteration. Further, the Hessenberg process of pivoting strategy combined with Petrov-Galerkin condition and minimal norm condition is discussed for solving the Lyapunov equation in detail, then we get two methods, namely global generalized Hessenberg (GHESS) and changing minimal residual methods based on the Hessenberg process (CMRH) for solving CARE, respectively. Numerical experiments illustrate the efficiency of the provided methods.     

复合材料缠绕壳体结构成型和使用过程多场分析的研究进展

综述了复合材料缠绕壳体结构成型和使用过程的多场分析的国内外近代研究进展, 其中包括:缠绕成型工艺,固化工艺,超压工艺,使用过程中的应力分析,低速冲击损伤等相关问题. 在此基础上, 着重介绍了倍受航天界所关注的含薄壁金属内衬的复合材料缠绕容器的成型工艺和低速冲击损伤一体化研究工作, 并提出了该领域今后还需进一步研究的内容.      

Fenton类氧化技术处理有机废水的研究进展

Fenton类氧化技术处理有机废水是新兴的高级氧化技术。综述了微波-Fenton、超声波-Fenton等组合法、类Fenton法处理有机废水的研究情况,并对Fenton类氧化技术处理有机废水进行了展望。     

伪造风险损失欺诈博弈与最优保险合同设计

运用不完全信息动态博弈和机制设计的有关理论，建立了伪造风险损失欺诈博弈模型，研究了伪造风险损失欺诈博弈问题的纳什均衡及其保险双方的最优博弈策略。在此基础上，得出了使保险人的期望利润为零的保险定价公式，讨论了基于保险双方最优博弈策略的最优保险合同形式，证明了基于保险双方最优博弈策略的保险合同是部分保险。     

基于多信号流模型的诊断策略动态生成

针对静态故障树诊断序列长、人工可干预度差和不支持多现象并行推理问题,提出了基于D-矩阵和Rollout信息启发搜索算法的故障诊断策略动态生成方法,介绍了基于TEAMS多信号流模型的D-矩阵数据获取方法和Rollout信息启发搜索算法的DLL独立封装技术、输入输出数据规范和动态交互控制方法;基于此开发的交互式智能诊断系统(IIDS)软件平台经实际现场测试诊断验证,对诊断现场出现的多种客观条件,如系统工作模式或测试资源变化、用户干预和多故障现象并发推理等具有很好的适应性,故障覆盖率和隔离率指标高,对提高装备故障诊断的效率、准确性和灵活性具有显著作用。     

“双一流”背景下高等电化学课程改革与创新

以电化学原理与应用课程为例,结合中南大学“双一流”建设需要,提出高等电化学课程改革和创新的重要性。从教学内容、教学模式、教材资料和教学团队等方面的发展历程深入探讨了本课程的改革和创新方法,并对比展示了课程改革的初步成效。相信本课程的改革与创新探索研究对于研究生教育教学改革工作具有积极的推动作用。     

Domination game and minimal edge cuts

In this paper a relationship is established between the domination game and minimal edge cuts. It is proved that the game domination number of a connected graph can be bounded above in terms of the size of minimal edge cuts. In particular, if $C$ a minimum edge cut of a connected graph $G$, then ${\gamma }_g\left(G\right)\le {\gamma }_g(G?C)+2{\kappa }^{\prime }\left(G\right)$. Double-Staller graphs are introduced in order to show that this upper bound can be attained for graphs with a bridge. The obtained results are used to extend the family of known traceable graphs whose game domination numbers are at most one-half their order. Along the way two technical lemmas, which seem to be generally applicable for the study of the domination game, are proved.     

Two-dimensional warranty repair strategy based on minimal and complete repairs

For repairable products, the warrantor has options in choosing the degree of repair applied to an item that has failed within the warranty period. We focus on a particular warranty repair strategy, related to the degree of the warranty repair, for non-renewing, two-dimensional, free of charge to the consumer warranty policy. We consider a rectangular warranty region and divide it into three disjoint subregions, so that each of these subregions has a preassigned degree of repair for a faulty item. Our main goal is to determine the subregions, so that the associated expected warranty servicing cost per item sold is minimised. A comparison between our strategy and previously studied, more restrictive, ones is provided.     

Impulsive synchronization of time-varying dynamical network

Synchronization of time-varying dynamical network is investigated via impulsive control. Based on the Lyapunov function method and stability theory of impulsive differential equation, a synchronization criterion with respect to the system parameters and the impulsive gains and intervals is analytically derived. Further, an adaptive strategy is introduced for designing unified impulsive controllers, with a corresponding synchronization criterion derived. In this proposed adaptive control scheme, the impulsive instants adjust themselves to the needed values as time goes on, and an algorithm for determining the impulsive instants is provided and evaluated. The derived theoretical results are illustrated to be effective by several numerical examples.