Robust Output Tracking Control of an Uncertain Linear System via a Modified Optimal Linear-Quadratic Method

This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness.     

A Hybrid Approach to Scheduling with Earliness and Tardiness Costs

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time.     

紧急输送策略的线性规划模型

以美国南弗洛里达州递避飓风袭击为例建立了紧急输送情况下的线性规划模型。其中具体建立了以SCEPD(美国南弗洛里达州紧急情况预防部门)提出的公路反向，地区分块撤离，使用小路等三个最受人们关注的策略的模型。模型的灵敏度分析能很好地解释建立更多的临时避难所、限制车辆等策略对撤离的影响。在相近的环境下，中模型解得的结果很接近官方预测的结果，并且本的模型能对更广泛的情况进行分析．可给SCEPD提供一定参考。     

On the concept of point value in the infinite-dimensional realization theory

In this article, we study the effect of the chosen representation of a point value (and point evaluation) on the class of periodic signals realizable using a certain type of infinite-dimensional linear system. By suitably representing the point evaluation at the origin in a Hilbert space, we are able to give a complete characterization of its extensions. These extensions involve a new concept called δ-sequence, the use of which as an observation operator of an infinite-dimensional linear system is studied in this article. In particular, we consider their use in the realization of periodic signals. We also investigate how the use of δ-sequences affects the convergence properties of such realizations; we consider the rate and character of convergence and the removal of the Gibbs phenomenon. As still a further demonstration of the significance of the chosen concept of a point value, we discuss the use of distributional point values in the realization of periodic distributions. The possible applications of this work lie in regulator problems of infinite-dimensional control theory, as is indicated by the well-known internal model principle.     

应用无衍射贝塞尔光束的固体线膨胀系数测量系统

测量固体线膨胀系数是工程设计中的一项重要工作。这套非接触固体线膨胀系数测量系统利用激光三角法进行了设计。通过采用线阵CCD作为信号传感器来实现自动化测量。通过采用无衍射贝塞尔光束来提高测量精度和增大测量范围。     

Separating the solution sets of analytical and polynomial systems

A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval. This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system. Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. Research supported by CONACyT of Mexico, Grant 130036. Research partially supported by CONACyT of Mexico, Grant 44003.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

Minimum Disparity Estimation in Linear Regression Models: Distribution and Efficiency

This paper deals with the minimum disparity estimation in linear regression models. The estimators are defined as statistical quantities which minimize the blended weight Hellinger distance between a weighted kernel density estimator of errors and a smoothed model density of errors. It is shown that the estimators of the regression parameters are asymptotic normally distributed and efficient at the model if the weights of the density estimators are appropriately chosen.     

Numerical analysis of a model of cure process for composites

We consider a composite material composed of fibres included in a resin which becomes solid when it is heated up (reaction of reticulation). The mathematical modelling of the cure process is given by a kinetic equation describing the evolution of the reaction of reticulation coupled with the heat equation. In this paper, we are interested in the computation of approximate solutions. We propose a family of discretized problems depending on two parameters (β₁, β₂) ε [0, 1]² which split the linear and non‐ linear terms in implicit and explicit parts. We prove the stability and convergence of the discretization for any (β₁, β₂) ε [½, 1 ] × [0, 1]. We present also some numerical results. Copyright © 2006 John Wiley & Sons, Ltd.     

关于多项式系数微分方程复振荡理论的两个结果

本文证明了：如果ａ_ｋ－ｊ（ｊ＝１，…，ｋ）为多项式，ｄｅｇａ_ｋ－ｊ＝ｎ_ｋ－ｊ，存在某个ａ_ｋ－s（１≤ｓ≤ｋ）满足：当１≤ｊ＜ｓ时，ｎ_ｋ－ｊ／ｊ≤ｎ_ｋ－s／ｓ；当ｓ＜ｊ≤ｋ时，ｎ_ｋ－ｊ＜ｎ_ｋ－s－（ｊ－ｓ）．如果Ｆ≠０是整函数且满足σ（Ｆ）＝β＜（ｎ_ｋ－s＋ｓ）／ｓ，那么微分方程ｆ^（ｋ）＋ａ