基于矩阵秩的概念格生成算法

形式概念分析的核心是概念格,它在本质上描述了对象和属性之间的联系,表明了概念之间的泛化和例化关系。利用矩阵行秩的概念及概念格上的二元运算提出了一种基于矩阵秩的概念格生成算法,实例表明该算法行之有效。     

An Optimal Control Problem with a Small Parameter

A controlled object with small nonlinearity and two boundary conditions is considered. An integral performance criterion is established. The behavior of optimal value of such an extremal problem is studied as the small parameter tends to zero.     

基于GF(q~N)上秩距离码的生成矩阵的认证方案

基于 GF ( q N ) ( q为素数 )上秩距离码的生成矩阵 ,本文提出了一个认证方案 ,证明了在随机预言模型中给出的协议是一个零知识交互证明 ,并表明通过参数的选取 ,此方案是安全的。     

化学动力学参数估值计算中Jacobi矩阵的快速计算

本文通过分析指出:采用 Marquardt 方法估计化学反应动力学参数时,Jacobi 矩阵不必记算得十分精确。并据此提出了一种既能保证一定精度、又能大大减少计算量的计算 Jacobi矩阵的方法。     

Matrix reduction in a combinatorial computation

The 5-flow conjecture of Tutte is that every bridgeless graph has a nowhere-zero 5-flow. Recently Kochol developed a method giving lower bounds for the girth of a smallest counterexample to the 5-flow conjecture. It consists in comparing rank of a matrix with rank of its submatrix. In this paper we present a reduction of the size of these matrices.     

进化策略在极大似然法参数估计中的应用

采用极大似然法进行参数估计,是为了避免传统优化算法的缺点。本文采用进化策略算法与极大似然参数估计法相结合使参数估计变量不再受初始值影响,从而可获得全局更优的解。最后,以威布尔三参数分布为例进行参数估计。结果表明,该方法有求解精度高和收敛速度快的优点,从而使进化策略算法能更好地应用于数理统计中。     

一种借助邻接矩阵求任意图最大团的方法

最大团问题是图论中重要的NPC问题。文章以一种新的方法,通过矩阵运算选择图上可能存在最大团的分支,进而实现求解最大团的问题。算法的每一个步骤都可以用成熟的并行方法替代。     

Solution of a Matrix Problem on a Mathematical Safe for Locks of the Same Kind. I

A mathematical safe problem is first formulated in a general form. The case of a set of locks that are of the same kind and are arranged in the form of a rectangular matrix is considered. Locks are considered to be of the same kind if their states are specified by numbers from the class of residues to a definite modulus. In the case of a prime modulus, a complete solution is provided. All the results obtained are illustrated by examples.__________Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 155–167, March–April 2005.     

矩阵正规程度的度量与矩阵的对角优势度

采用统计研究的方法,详细分析了衡量矩阵正规程度的几种主要指标之间的关系以及它们与矩阵的特征值摄动量的关系,进而讨论了矩阵的对角优势度与上述诸指标之间以及与特征值摄动量之间的关系,给出了一些经验公式.     

Certification of Numerical Computation of the Sign of the Determinant of a Matrix

Certified computation of the sign of the determinant of a matrix is a central problem in computational geometry. Certification by known methods is practically difficult because the magnitude of the determinant of an integer input matrix A may vary dramatically, from 1 to || A || ⁿ , and the round-off error bound of the determinant computation varies proportionally. Because of such a variation, high precision computation of \det A is required to ensure that the error bound is smaller than the magnitude of the determinant. We observe, however, that our certification task of determining only a single bit of \det A , that is, the bit carrying the sign, does not require us to estimate the latter round-off error. Instead, we solve a much simpler task of computing numerically the factorization of a matrix by Gaussian elimination with pivoting (which is a subroutine of LAPACK and LINPACK) and of estimating the minimum distance 1/||A ^-1 || from A to a singular matrix. Such an estimate gives us a desired range for the round-off error of the factorization such that the invariance of the sign of det A is ensured as long as the error varies in this range. Based on these simple but novel observations, we devise new effective arithmetic filters for the certification of the sign, compare them with the known filters, and confirm the efficiency of our techniques by some numerical tests. Received March 29, 1998; revised December 14, 1998.     

复杂控制系统随机参量的广义自相关性研究

研究泛逻辑推理中广义自相关系数k值的求解方法,提出了基于泛逻辑的复杂控制系统不确定性推理模型,给出了求解k值的一般步骤和相关定理.研究了3种连续型随机参量的广义自相关性:均匀分布的k值恒等于0.5,是一种理想的精确估计模型;没有基变换时的指数分布和标准正态分布的k值均小于0.5,它们对随机参量的逻辑值呈偏小估计.推导出了求解N范数和k值的通用公式,建立起泛逻辑理论和不确定性推理与控制之间的实用性桥梁.     

计算随机矩阵期望最大特征问题的自组织算法

设Ｎ为一随机变量矩阵,Ａ＝Ｅ（Ｎ）为Ｎ的数学期望,（Ａ（ｔ））为Ｎ为一系列观测。本文提出逐次基于Ｎ的观测而计算Ｎ的数学期望Ａ之最大特征向量的一个自组织算法。理论分析和数值实验表明：所提出的算法可行,有效,有很强的实用性。     

Determining the Upper Bound of the Spectral Norm of a Random Matrix and Its Application to Diagnosis of the Kalman Filter

An upper confidence bound for the spectral norm of a random matrix A(k) R ^n×m that consists of normally distributed random variables with zero mathematical expectation is found in the paper. Based on the theoretical results obtained, an approach is proposed to dynamic diagnosis of the Kalman filter via an innovation sequence.     

物联网时代的小数据传输方案研究和对运营商网络的影响评估

首先介绍了用于M2M通信的网络架构以及应对小数据传输可行的解决方案,然后对小数据传输的各种方案给予了详细的描述、分析和对比,最后总结了M2M通信模式下的小数据传输方案对运营商现有网络可能带来的影响。     

Estimating the Focus of Expansion in Analog VLSI

In the course of designing an integrated system for locating the focus of expansion (FOE) from a sequence of images taken while a camera is translating, a variety of direct motion vision algorithms based on image brightness gradients have been studied (McQuirk, 1991, 1996b). The location of the FOE is the intersection of the translation vector of the camera with the image plane, and hence gives the direction of camera motion. This paper describes two approaches that appeared promising for analog very large scale integrated (VLSI) circuit implementation. In particular, two algorithms based on these approaches are compared with respect to bias, robustness to noise, and suitability for realization in analog VLSI. From these results, one algorithm was chosen for implementation. This paper also briefly discuss the real-time analog CMOS/CCD VLSI architecture realized in the FOE chip.     

基于矩阵算法的主动配电网交直流混合网络供电恢复策略研究

考虑到直流输电技术的发展,直流配电应用于配电网中是未来配电网的研究重点。本文为解决主动配电网交直流混合网络的供电恢复问题,提出含直流配电线路的主动配电网供电恢复方案,当交流配电线路出现故障时,考虑直流侧配电线路网损、换流器以及分布式电源影响下的供电恢复方案;当直流配电线路出现故障时,考虑转换直流侧运行方式或让失电的直流负荷转入计划孤岛运行模式,以保证直流侧重要负荷的持续供电,分别提出交流侧和直流侧约束条件,并在约束条件下选取网络损耗、线路末端电压越限节点个数以及开关操作次数作为指标构建目标函数,依据矩阵算法对供电恢复过程的不同恢复方案进行大数据分析与处理,得出最优方案。通过改进的IEEE 123节点算例证明,提出的方案能够有效的解决主动配电网的供电恢复问题。     

A graph-theoretic characterization for the rank of the transfer matrix of a structured system

In this paper structured systems are considered and the generic rank of the transfer matrix of such systems is introduced. It is shown that this rank equals the maximum number of vertex disjoint paths from the input vertices to the output vertices in the graph that can be associated to the structured system. This maximum number of disjoint paths can be calculated using techniques from combinatorics. As an application a structural version of the well-known almost disturbance decoupling problem is proposed. The results in this paper were obtained while the author was affiliated with the Centre for Mathematics and Computer Science in Amsterdam, The Netherlands.     

全厂负荷分配系统在火电厂的成功运用

全厂负荷分配系统采用了梯级控制方式,并基于节能降耗的原则,根据单元机组煤耗量自动对各台机组负荷进行优化分配,或在比例分配模式下,由值长根据实际情况对机组负荷进行分配。本文主要介绍了这套全厂负荷分配系统的结构、功能、可靠性、运行方式及在贵州黔西发电厂应用效果等。     

Estimation Accuracy of Linear Regression Parameters with Regard for Inequalitiy Constraints Based on a Truncated Matrix of Mean Square Errors of Parameter Estimates

Estimation accuracy of regression parameters with regard for inequality constraints and a forecast using the model obtained are compared with the least square estimation method. It is shown that the introduced constraints allows us to increase the estimation and forecasting accuracy.     

模糊自整定PID参数控制器在火电厂水处理中的应用

设计了一种Fuzzy自整定PID参数控制器来改善目前火电厂中化学除氧和加氨调节给水pH值控制系统，并成功地用Visual Basic将其模块化。