CARMA模型的多新息增广随机梯度辨识算法

将多新息辨识理论用于研究CARMA模型参数辨识问题,通过把标量新息扩展为向量新患,即多新息,得出相应的多新息增广随机梯度辨识算法.仿真结果验证了提出算法的有效性.     

基于BCRLS-AEKF的锂离子电池荷电状态估计及硬件在环验证

研究有色噪声下的锂离子电池参数辨识与荷电状态(SOC)估计,并进行硬件在环实验验证.在动力电池模型的参数辨识过程中,利用带遗忘因子的偏差补偿递推最小二乘法进行偏差补偿,提高了有色噪声数据的参数辨识精度.在此基础上,利用自适应扩展卡尔曼算法进行SOC估计,使得滤波算法中的估计结果可以随着噪声统计特性的变化而自适应更新,实现了模型参数和电池状态的联合估计.最后,借助BMS测试系统模拟电池电压电流信息输出,完成了硬件在环实验以验证所提出的方法.实验结果表明,利用所提出算法估计得到的电池端电压和SOC误差分别小于10 mV和0.5%.     

一类3-正则图完美对集的计数

图的完美对集计数理论是图论研究的重要内容之一,此问题的研究具有很强的计算机科学、物理学和化学的应用背景,是一个有生机和活力的研究领域,也是快速发展的组合数学理论中许多重要思想的源泉.构造了一类3-正则新图2-3-nC₆,用嵌套递推的方法,得到了图2-3-nC₆的完美对集数的一个递推关系,再解出这个递推式的通解,从而得到了这个图的完美对集数计算公式.最后又给出这个图完美对集数计算公式的一个组合证明.     

有色噪声下系统阶次辨识的一种近似方法

本文分析了有色噪声下损失函数与噪声模型之间的关系。引入一广义损失函数J′,在噪声模型能估计的条件下,应用损失函数最小法能确定模型的阶次。     

大惯性系统的自适应起动控制

针对过程的起动段给出了一种预报控制策略。算法在起动段可以不依靠任何预辨识即可对过程的未知参数进行在线估计,在避免了超调和过渡过程时间过长的同时,过程可以很快地达到稳态,而且通过起动段积累起来的过程信息仍可用于稳态工作时的控制器调节,为了验证算法的性能,将其与常规的开关控制器在起动段的性能进行了比较。     

递归定义与归纳证法

递归定义与归纳证法是数学中最基本、最原始的手段,它不象一般人所认为的那样只是自然数所特有的。本文通过揭示递归定义与归纳证法的实质表明它们是本质上不依赖于自然数的逻辑系统内的特征,因而也适用于许多非自然数的对象。     

图像分层优化二元树表示及其转换研究

本文在分析图像分层表示的基础上,提出一种图像分层优化二元树结构表示.该优化二元树结构比指针二元树结构及指针四元树结构简单,多幅图像试验结果表明,该结构比指针二元树数据结构及指针四元树数据结构占用存储空间少.文中还研究了图像从二维数组表示到优化二元树结构表示的转换算法,图像显示结果表明,图像完全一样.     

最小方差自校正控制—具有恒定的闭环极点

提出一种具有恒定闭环极点的最小方差自校正控制器,该控制器将最小方差策略和极点配置策略结合起来,既保证了良好的伺服跟踪能力和抗干扰能力,又增强了控制器的鲁棒性。本文采用递推估计算法在线调整加权多项式来配置闭环极点,因而在不显著增加在线计算量的条件下有效地改善了控制器的性能。     

Auditing as a Trust Creation Process

This paper offers an account of a process to build up relations of trust as a necessary condition for developing a new concept of auditing. The conceptual base of the discussion is centered upon the idea of managing complexity. Specifically, trust is observed not only as a form of reducing the complexity of our world relevant to each of us, but also as a most powerful amplifier of social complexity. In the paper the distinction is made between contextual trust and responsible trust. It is argued that responsible trust is necessary in order to accept diversity and increase the organization's performance in a demanding environment. This, in turn, suggests the necessity to move from hierarchical organizations to recursive organizations. The system in focus in this work was the Colombian State and, in particular, the National Audit Office of Colombia, which has begun a process to support the development of self-controlled organizational systems.     

Transient Queue Size Distribution Solution of Geom / G / 1 Queue with Feedback-A Recursive Method

This paper considers the Geom / G / 1 queueing model with feedback according to a late arrival system with delayed access (LASDA). Using recursive method, this paper studies the transient property of the queue size from the initial state N(0⁺) = i. Some new results about the recursive expression of the transient queue size distribution at any epoch n ⁺ and the recursive formulae of the equilibrium distribution are obtained. Furthermore, the recursive formulae of the equilibrium queue size distribution at epoch n ⁻, and n are obtained, too. The important relations between stationary queue size distributions at different epochs are discovered (being different from the relations given in M / G / 1 queueing system). The model discussed in this paper can be widely applied in all kinds of communications and computer network. This research is supported by the National Natural Science Foundation of China under Grant No. 70871084, the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001, and the Scientific Research Fund of Southwestern University of Finance and Economics.