ON THE SLOW MANIFOLD CHARACTERISTICS OF CAPILLARY SUCTION APPARATUS DYNAMICS

The nonlinear dynamic behaviour relating the wet front size and liquid saturation under inner cylinder (or rectangular cell) in cylindrical (or rectangular) capillary suction apparatus was investigated. The slow manifold explanation was proposed and the fast- and slow-varying variables were identified. Experiments were conducted to verify theoretical findings.     

一种基于时间分层决策矩阵的综合评价算法

综合评价系统用四元总体（A，Z，X^(k)，D）表示，其中决策矩阵X^(k)是具有对象维i,指标维j,时间维k的三维矩阵，将三维矩阵X（k)按时间划分形成m个二维矩阵，每个二维矩阵分别代表每个年度n个评价对象对应于p个指标的属性集，讨论了按时间分层决策矩阵的多指标综合评价问题，描述了按时间分层的决策矩阵的求解算法，并采用Visual Foxpro数据库语言编程实现。     

加权算术平均与几何平均关系式的新证法

利用函数极小点的性质,得到了若干个正数的加权算术平均与几何平均关系式的新证法     

奇异值分解对非定常约束多体系统的动力学分析

通过对约束方程的雅可比矩阵进行奇异值分解，定义组合坐标，从拉格朗日第一类方程出发，建立了非定常约束多体系统的纯微分方程，给出了动力学数值分析的过程，最后举了一个算例。     

Mechanical performance of ceramic matrix composite I-beams

Experimental studies have been performed on ceramic matrix composite (CMC) I-sections, which typify joint designs for CMC components. Axial loads and moments have been applied to activate delamination mechanisms. The maximum load bearing capacity has large variability, governed by the severity of manufacturing flaws located in the transition region of the I-section. This variability leads to an unsatisfactory design situation. Delaminations that form from these flaws arrest and behave in a stable manner, subject to a remanent load bearing capacity. This remanent capacity has minimal variability. Hence, design based on the remanent load would be robust. An expression for this design criterion is presented.     

Input-output finite-time stability of time-varying linear singular systems

This paper studies the input-output finite-time stabilization problem for time-varying linear singular systems. The output and the input refer to the controlled output and the disturbance input,respectively.Two classes of disturbance inputs are considered,which belong to L-two and L-infinity.Sufficient conditions are firstly provided which guarantee the input-output finite-time stability.Based on this,state feedback controllers are designed such that the resultant closed-loop systems are input-output finite-time stable.The conditions are presented in terms of differential linear matrix inequalities.Finally,an example is presented to show the validity of the proposed results.     

Stability analysis for discrete linear systems with state saturation by a saturation-dependent Lyapunov functional

This paper concerns the stability analysis problem of discrete linear systems with state saturation using a saturation-dependent Lyapunov functional.We introduce a free matrix characterized by the sum of the absolute value of each elements for each row less than 1,which makes the state with saturation constraint reside in a convex polyhedron.A saturation-dependent Lyapunov functional is then designed to obtain a sufficient condition for such systems to be globally asymptotically stable.Based on this stability criterion,the state feedback control law synthesis problem is also studied.The obtained results are formulated in terms of bilinear matrix inequalities that can be solved by the presented iterative linear matrix inequality algorithm.Two numerical examples are used to demonstrate the effectiveness of the proposed method.     

二进制分辨矩阵在连续属性约简中的研究

针对二进制分辨矩阵无法处理连续型数据,提出一种基于邻域的改进二进制分辨矩阵及其属性约简方法。实验结果表明,与先数据离散化,后属性约简的方法相比,利用文中方法提取出的特征属性的分类能力更高。     

基于Sql Server BI平台和决策树技术的CET-4成绩分析

文章首先对Sql Server 2008商业智能平台及决策树技术相关理论作了介绍,然后对挖掘数据源数据进行了一系列预处理。利用Sql Server 2008商业智能平台下的决策树技术并采用数据挖掘扩展语言即DMX语言创建了CET-4成绩分析决策树模型。分类矩阵和挖掘提升图分别对该模型的评估结果表明了模型具有较高的可靠性和分类准确度,同时模型对应的一些规则可作为英语教学管理和改革的重要参考依据。     

EIGENVECTORS-BASED PARALLELISATION OF NESTED LOOPS WITH AFFINE DEPENDENCES

Abstract

This paper presents a method for parallelising nested loops with affine dependences. The data dependences of a program are represented exactly using a dependence matrix rather than an imprecise dependence abstraction. By a careful analysis of the eigenvectors and eigenvalues of the dependence matrix, we detect the parallelism inherent in the program, partition the iteration space of the program into sequential and parallel regions, and generate parallel code to execute these regions. For a class of programs considered in the paper, the proposed method can expose more coarse-grain and fine-grain parallelism than a hyperplane-based loop transformation.