极小相位FIR数字滤波器的设计方法

本文在文献[2]的基础上,提出一种设计极小相位FIR数字滤波器的具体方法.该方法计算量小,且较准确,便于工程应用.     

Robust Optimal Disturbance Observer Design for the Non‐Minimum Phase System

In this paper, a design strategy of robust disturbance observer is proposed systematically for stable non‐minimum phase systems. This strategy synthesizes the internal and robust stability, relative order and mixed sensitivity design requirements together to establish the optimization function. The optimal solution is obtained by standard H_∞ control theory under the condition of guarantying the presented requirements. Simulation results of a rotary mechanical system show the effectiveness of the proposed strategy.     

A Generalized Input-output-based Digital Sliding-mode Control for Piezoelectric Actuators with Non-minimum Phase Property

International Journal of Control, Automation and Systems - In this paper, a generalized input-output-based digital sliding-mode control (GIODSMC) is developed for piezoelectric actuators (PEA) with...     

Construction of the Minimum Phase Systems and the Problem of Stabilization

For the affine system with vector control, the problem of stabilization of the zero equilibrium position can be solved by stabilizing the zero output value, provided that the affine system is a minimum phase one. The minimum phase systems enable essential extension of the set of stabilizing feedbacks. In order to make use of this approach in the problem of stabilization of the stationary point of the multidimensional affine system, one needs a virtual vector output such that the system is a minimum phase one. Existence of conditions for these virtual vector outputs and a method for their determination were presented. Virtual output-based stabilization is attained by constructing the Lyapunov function for a closed-loop system.     

MIMO非线性最小相位系统的光滑调节

本文研究多输入多输出非线性最小相位系统的光滑调节问题,得到的主要结论是:对合的在原点具有相对阶的局部双曲最小相位系统能渐近跟踪满足某种有界条件的局部Lyapunov稳定的信号.一类具有一致相对阶的全局指数稳定的最小相位系统,若满足某种类似的Lipschitz条件,则能渐近跟踪一类很广泛的信号,既可以是Poisson稳定的,也可以是无界的.     

Direct Adaptive Dynamic Compensation for Minimum Phase Systems With Unknown Relative Degree

We consider parameter-monotonic direct adaptive control for single-input-single-output minimum-phase linear time-invariant systems with knowledge of the sign of the high-frequency gain (first nonzero Markov parameter) and an upper bound on the magnitude of the high-frequency gain. The first part of the paper is devoted to fixed-gain analysis of single-parameter high-gain-stabilizing controllers. Two novel fixed-gain dynamic compensators are presented for stabilizing minimum-phase systems. One compensator stabilizes systems with arbitrary-but-known relative degree, while the other utilizes a Fibonacci series construction to stabilize systems with unknown-but-bounded relative degree. Next, we provide a general treatment of parameter-monotonic adaptive control, including a result that guarantees state convergence to zero. This result is then combined with the high-gain-stabilizing controllers to yield parameter-monotonic direct adaptive dynamic compensation for minimum-phase systems with either arbitrary-but-known or unknown-but-bounded relative degree     

一种求解最小割集问题的新思路

从本质上来说,最小割集问题与最大流问题是同一个问题。由于后者的实用性更强,人们对它投入的关注与研究也更多,因而实际中是通过最大流问题来求最小割集问题。最大流-最小割集定理给出了一种用最大流算法求最小割集问题的方法,但在实际应用中,这种方法有时显得繁冗并有些迂回。文章首先介绍了最大流、最小割集的相关概念,然后从实际应用出发提出了一种用最大流求流图最小割集的新算法。随后证明了该算法的正确性,并举例说明了这种算法思想在其它方面的应用。     

求列表极小值的量子算法

求列表极小值的算法具有广泛的应用。如果能够找到有效的求列表极小值的量子算法,那就可以找到求列表极大值的量子算法,从而与Grover量子搜索算法、求中值量子算法一起构成一套有效的量子算法体系。这些算法将构成用量子计算求解实际应用问题的核心和基础,并为量子算法的进一步研究提供坚实的基础。该文给出了一个时间复杂度为O(N√)的求列表极小值的量子算法。     

基于非线性PID的非最小相位系统控制

提出一种新型非线性PID控制器简单结构,利用非线性PID控制器的非线性特性,抑制非最小相位系统的右半平面零点所造成的负调问题,克服非最小相位系统的超调、负调和调整时间之间的矛盾.数值仿真结果表明,由非线性PID控制器构成的非最小相位系统具有良好的动静态性能、高的控制精度和较强的鲁棒性.数值结果说明方法有效,算法简单,易于实时实现.     

基于非线性PID的非最小相位系统控制

提出一种新型非线性PID控制器简单结构，利用非线性PID控制器的非线性特性，抑制非最小相位系统的右半平面零点所造成的负调问题，克服非最小相位系统的超凋、负调和调整时间之间的矛盾。数值仿真结果表明，由非线性PID控制器构成的非最小相位系统具有良好的动静态性能、高的控制精度和较强的鲁棒性。数值结果说明方法有效，算法简单，易于实时实现。     

Precise Tracking for Continuous‐Time Non‐Minimum Phase Systems

Stable inversion based precise tracking for continuous‐time square or nonsquare non‐minimum phase systems is studied. However, high precision trajectory tracking of non‐minimum phase systems can be obtained by the stable inversion method but requiring large enough extended time interval. In order to solve this problem of large extended time restriction, a novel approach to precise trajectory tracking of non‐minimum phase systems is proposed, it is called the improved stable inversion (ISI) method, using an optimal integration of the pre‐actuation and the optimal state transition (OST) techniques. The ISI method can obtain precise trajectory tracking with a smaller extended time interval as compared to the stable inversion method. The proposed method achieves better validation through numerical simulations for the non‐minimum phase system.     

A memetic algorithm for the Minimum Sum Coloring Problem

Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on a set of 77 well-known DIMACS and COLOR 2002–2004 benchmark instances show that the proposed algorithm achieves highly competitive results in comparison with five state-of-the-art algorithms. In particular, the proposed algorithm can improve the best known results for 15 instances.     

应用层组播的最小延迟生成树算法

实时传输是应用层组播技术的一个主要应用领域,对网络延迟有严格的限制.保证低延迟组播成功的关键在于构建高效的应用层组播树,研究构建最小延迟应用层组播树的算法.首先分析影响延迟的3个因素:链路的传输时间、结点的发送/转发时间和结点度,然后把求解应用层组播树的问题抽象成对边和点都带权的有向图求解"度约束最小延迟生成树"的问题,同时证明这个问题属于NP-hard,并且提出了两类启发式近似算法:基于度的算法和基于最大延迟路径的算法.最后通过模拟实验说明了所提出算法的有效性.     

Robust Fault Tolerant Control Design for Nonlinear Systems not Satisfying Matching and Minimum Phase Conditions

International Journal of Control, Automation and Systems - This paper proposes an adaptive sliding mode fault tolerant control design for lipschitz nonlinear system subject to simultaneous actuator...     

A Faster Algorithm for Finding Minimum Tucker Submatrices

A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are central in computational molecular biology, in particular for physical mapping and ancestral genome reconstruction. In 1972, Tucker gave a characterization of matrices that have the C1P by a set of forbidden submatrices, and a substantial amount of research has been devoted to the problem of efficiently finding such a minimum size forbidden submatrix. This paper presents a new O(?? ³ m ²(m??+n ³)) time algorithm for this particular task for a m×n binary matrix with at most ?? 1-entries per row, thereby improving the O(?? ³ m ²(mn+n ³)) time algorithm of M.?Dom, J.?Guo and R.?Niedermeier [Approximation and fixed-parameter algorithms for consecutive ones submatrix problems, Journal of Computer and System Sciences, 76(3?C4): 204?C221, 2010]. Moreover, this approach can be used??with a much heavier machinery??to address harder problems related to Minimal Conflicting Set [G.?Blin, R.?Rizzi, and S.?Vialette. A Polynomial-Time Algorithm for Finding Minimal Conflicting Sets, Proc. 6th International Computer Science Symposium in Russia (CSR), [2011]].     

A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering

Due to their ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice. However, in such clustering algorithms, the search for nearest neighbor in the construction of minimum spanning trees is the main source of computation and the standard solutions take O(N^{2}) time. In this paper, we present a fast minimum spanning tree-inspired clustering algorithm, which, by using an efficient implementation of the cut and the cycle property of the minimum spanning trees, can have much better performance than O(N^{2}).     

构造最小生成树的量子算法

图的最小生成树问题是网络优化中的一类基本问题。目前构造最小生成树的算法都是基于传统计算机的算法如Prim算法和Kruskal算法。该文提出了一个用于构造图的最小生成树的量子算法,它结合量子搜索的方法和经典Kruskal算法的思想,对于n个节点m条边的图,依次搜索出n-1条边使它们构成一棵最小生成树。这一算法的时间复杂性为O(nm√)。与经典Kruskal算法相比,在同等条件下,该文的算法有较快的加速。     

集合覆盖问题的启发函数算法

本文给出了求解NP困难问题的完备策略的概念,在此基础上提出了一个求解集合覆盖问题的启发函数算法SCHF(set-covering heuristic function),文中对该算法的合理性、时间复杂性以及解的精度进行了分析,本文的主要创新点是用已知的完备策略建立启发函数,并用该启发函数进行空间搜索求出优化解.该方法具有一定的普遍性,可以应用到其它的NP困难问题.它为求解NP困难问题的近似解提供了一种行之有效的方法.在规则学习中的应用结果表明,本文给出的SCHF算法是非常有效的.     

确定任意形状物体最小包围盒的一种方法

最小包围盒广泛应用于碰撞检测、模具分型设计、产品包装设计以及图像处理、模式识别等领域。根据不同的应用场合对包围盒的不同要求,提出了一种简单、实用的确定任意物体最小包围盒的方法,利用现有的CAD软件本身具有确定轴向包围盒的功能,通过对AutoCAD软件的二次开发,利用程序自动确定出任意形状物体的最小体积包围盒或最小面积包围盒,以适应于不同的应用场合。     

A Confidence Region for Regression Parameters with Inequality Constraints

A confidence region for linear regression parameters is determined for the case where the parameters are estimated with regard for linear constraints. An example of application of the results obtained is described.