Performance Analysis of Periodic Control for l1 and l∞ Disturbance Rejection

This paper presents a performance analysis of discrete time periodically time varying controllers for the rejection of l_p specific and uniform disturbances. Earlier results on l₂ performance are extended to l₁ and l_∞ performance to present a unified treatment of l_p performance for all p ε [1, ∞]. For a given linear time varying periodic controller, a linear time invariant controller is constructed and necessary and sufficient conditions are presented under which the linear time invariant controller gives strictly better l_p disturbance rejection performance than the time varying periodic controller.     

Solving multiple objective quasi-convex goal programming problems by linear programming

This study presents a novel means of resolving multiple objective goal programming (GP) problems with quasi-convex linear penalty functions. The proposed method initially expresses a quasi-convex function by the maximum operator of two convex functions, then solves it via a linear programming technique. The proposed method does not contain any zero–one variables; nor does it require dividing the multi-objective quasi-convex GP problem into large sub-problems as in conventional methods. Some illustrative examples are provided.     

基于矢量模型的语音线性预测研究

研究语音参数线性预测的并行处理问题。通过把语音源序列的相邻样本分组能够构成一个均方差平稳的语音向量自回归序列,在Hilbert空间中运用正交投影原理导出具有高度并行处理能力的一预测编码策略,由此可推出参数线性预测的并行处理自适应算法。同传统格型算法相比,这种算法的计算复杂度及存贮量有明显改善。最后通过仿真运算检测了算法的性能。     

Analyzing the structure of a class of linear automata over a ring $$ Z_{p^k } $$

Basic finite-automaton characteristics are established for the class of all linear automata and information-lossless automata over a ring. The complexities of solving problems of parametric identification and initial-state identification are analyzed. The sets of fixed points for mappings realized by initial automata are characterized. Canonical forms are proposed for linear automata over the ring. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 60–74, May–June 2008.     

Complexity and computability of solutions to linear programming systems

Through key examples and constructs, exact and approximate, complexity, computability, and solution of linear programming systems are reexamined in the light of Khachian's new notion of (approximate) solution. Algorithms, basic theorems, and alternate representations are reviewed. It is shown that the Klee-Minty example hasnever been exponential for (exact) adjacent extreme point algorithms and that the Balinski-Gomory (exact) algorithm continues to be polynomial in cases where (approximate) ellipsoidal centered-cutoff algorithms (Levin, Shor, Khachian, Gacs-Lovasz) are exponential. By model approximation, both the Klee-Minty and the new J. Clausen examples are shown to be trivial (explicitly solvable) interval programming problems. A new notion of computable (approximate) solution is proposed together with ana priori regularization for linear programming systems. New polyhedral constraint contraction algorithms are proposed for approximate solution and the relevance of interval programming for good starts or exact solution is brought forth. It is concluded from all this that the imposed problem ignorance of past complexity research is deleterious to research progress on computability or efficiency of computation.This research was partly supported by Project NR047-071, ONR Contract N00014-80-C-0242, and Project NR047-021, ONR Contract N00014-75-C-0569, with the Center for Cybernetic Studies, The University of Texas at Austin.     

露天磷矿数字配矿模型

露天磷矿选矿厂采用合理的配矿方案,对稳定入选磷矿的品位,增加选矿产率,降低生产成本有着重要的意义.为了提高入选磷矿石品位的均匀性和稳定性,提出了针对以入选磷矿品位为目标的从采矿场配矿到精矿仓配矿的整个生产环节的配矿方法.将采场内原矿、选矿厂原矿矿堆和选矿厂精矿仓均定义为矿堆,按照生产实际需求设定其属性.通过设定目标函数,实现使采矿场的开采原矿量最大,配矿方案总的运输距离最小,运输成本最低等目标.同时建立约束条件,使采矿场的开采原矿量要保证选矿厂正常生产,使每一矿堆的品位达到目标要求.最后,采集企业生产实际数据对模型加以验证,证明模型在指导露天磷矿山的生产过程中有重要的实际意义,配矿过程应成为矿山生产组织、管理的一个重要环节.     

基于有限障碍的全牛顿步内点算法

针对线性规划问题,文中引入了一种与传统障碍函数不同的新的障碍函数,其在可行域边界上的取值是有限的.沿此有限障碍函数所确定的新的搜索方向,给出了短步长全牛顿步内点算法,结果证明该算法具有目前求解线性规划问题最好的复杂性界.     

An iterative algorithm based on the piecewise linear system for solving bilateral obstacle problems

In this paper, we derive the piecewise linear system (PLS) associated with the bilateral obstacle problem and illustrate the equivalence between the linear system and finite-dimensional complementary problem. The existence and the uniqueness of the solution to the PLS are also demonstrated. Based on the PLS, a Picard iterative algorithm is proposed. The convergence analysis is given and examples are presented to verify the effectiveness of the method.     

Robust joint modeling of mean and dispersion through trimming

The Maximum Likelihood Estimator (MLE) and Extended Quasi-Likelihood (EQL) estimator have commonly been used to estimate the unknown parameters within the joint modeling of mean and dispersion framework. However, these estimators can be very sensitive to outliers in the data. In order to overcome this disadvantage, the usage of the maximum Trimmed Likelihood Estimator (TLE) and the maximum Extended Trimmed Quasi-Likelihood (ETQL) estimator is recommended to estimate the unknown parameters in a robust way. The superiority of these approaches in comparison with the MLE and EQL estimator is illustrated by an example and a simulation study. As a prominent measure of robustness, the finite sample Breakdown Point (BDP) of these estimators is characterized in this setting.     

基于新障碍参数更新的二阶Mehrotra型预估—校正算法

针对二阶Mehrotra型预估-校正算法的一种变型算法,本文介绍一种新的自适应障碍参数更新法。利用该更新方法提出了相应的算法。新算法与之前的二阶Mehrotra型预估-校正算法相比,不用根据预估步和校正步的步长来确定参数的更新,而是在每步迭代中都采用自适应更新。最后证明了该算法在没有引进任何＂保障措施＂的情况下也具有相同的多项式时间复杂度。