参数曲面上的插值与混合

如何表示曲面上的曲线,在处理诸如数控加工中的路径设计以及CAD/CAM等领域频繁出现的曲面裁剪问题时显得日益重要.给出了数据点的切方向(切方向及曲率向量或测地曲率值)指定而G¹连续(G²连续)插值曲面上任意点列的方法.作为曲面上曲线插值问题的特例,还讨论了曲面上曲线的混合问题.基本思想是借助于微分几何的有关结论,曲面上曲线的插值问题被转化为其参数平面上类似的曲线插值问题.该方法能够用二维隐式方程来表示曲面上的插值曲线,从而把在显示该曲线时所面对的曲面求交的几何问题转化为计算隐式曲线的代数问题.实验证明该方法是可行的,而且适用于CAD/CAM及计算机图形学等领域.     

An inequality governing nonlinear H∞ control

This note gives necessary and sufficient conditions for solving a reasonable version of the nonlinear H^∞ control problem. The most objectionable hypothesis is elegant and holds in the linear case, but every possibly may not be forced for nonlinear systems. What we discover in distinction to Isidori and Astolfi (1992) and Ball et al. (1993) is that the key formula is not a (nonlinear) Riccati partial differential inequality, but a much more complicated inequality mixing partial derivatives and an approximation theoretic construction called the best approximation operator. This Chebeshev-Riccati inequality when specialized to the linear case gives the famous solution to the H^∞ control problem found in Doyle et al. (1989). While complicated the Chebeshev-Riccati inequality is (modulo a considerable number of hypotheses behind it) a solution to the nonlinear H^∞ control problem. It should serve as a rational basis for discovering new formulas and compromises. We follow the conventions of Ball et al. (1993) and this note adds directly to that paper.     

The l-control problem for time-varying discrete systems

This paper deals with the l²-problem for time-varying discrete systems. The problem considered is a deterministic counterpart of the well-known LQG problem. An adequate l²-seminorm for linear bounded input-output operators is introduced in order to express the optimality criterion. The solution is obtained by successively reducing the original problem to simpler ones putting in evidence the Separation Principle of the optimal controller.     

On the weighted sensitivity minimization problem for delay systems

We consider the H^∞-optimal sensitivity problem for delay systems. In particular, we consider computation of μ:= inf {|W-φq|_∞ : q ε H^∞(j )} where W(s) is any function in RH^∞(j ), and φ in H^∞(j ) is any inner function. We derive a new explicit solution in the pure delay case where φ = e^−sh, h > 0.     

H optimization problem with sign-indefinite quadratic form

This paper presents the solution to min-max control problem arising when the matrix C₁^TC₁ of the cost function in the standard H^∞ control problem (Doyle et al., 1989) is replaced by an arbitrary matrix Q 0. This difference is proved to be sufficient for results obtained in (Doyle et al., 1989) not to cover such the case. Their derivations essentially base on the cost function being H^∞ norm and can not be adjusted to deal with sign-indefinite quadratic form. With some sort of strict frequency condition assumed, state space technique is fruitful to obtain the necessary and sufficient conditions of the solvability of the problem. The solution is given by two Riccati equations and has some difference when compared to that of (Doyle et al., 1989).     

Bounded size dictionary compression: SC-completeness and NC algorithms

We study the parallel complexity of a bounded size dictionary version (LRU deletion heuristic) of the LZ2 compression algorithm. The unbounded version was shown to be P-complete. When the size of the dictionary is O(log^kn), the problem of computing the LZ2 compression is shown to be hard for the class of problems solvable simultaneously in polynomial time and O(log^kn) space (that is, SC^k). We also introduce a variation of this heuristic that turns out to be an SC^k-complete problem (the original heuristic belongs to SC^k+1). In virtue of these results, we argue that there are no practical parallel algorithms for LZ2 compression with LRU deletion heuristic or any other heuristic deleting dictionary elements in a continuous way. For simpler heuristics (SWAP, RESTART, FREEZE), practical parallel algorithms are given.     

Achievable H performance in sampled-data smoothing: beyond the -barrier

The lifting technique is a powerful tool for handling the periodically time-varying nature of sampled-data systems. Yet all known solutions of sampled-data H^∞ problems are limited to the case when the feedthrough part of the lifted system, , satisfies , where γ is the required H^∞ performance level. While this condition is always necessary in feedback control, it might be restrictive in signal processing applications, where some amount of delay or latency between measurement and estimation can be tolerated. In this paper, the sampled-data H^∞ fixed-lag smoothing problem with a smoothing lag of one sampling period is studied. The problem corresponds to the a-posteriori filtering problem in the lifted domain and is probably the simplest problem for which a smaller than performance level is achievable. The necessary and sufficient solvability conditions derived in the paper are compatible with those for the sampled-data filtering problem. This result extends the scope of applicability of the lifting technique and paves the way to the application of sampled-data methods in digital signal processing.     

Structure-Texture Image Decomposition—Modeling, Algorithms, and Parameter Selection

This paper explores various aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and ρ, where u holds the geometrical information and ρ holds the textural information. The focus of this paper is to study different energy terms and functional spaces that suit various types of textures. Our modeling uses the total-variation energy for extracting the structural part and one of four of the following norms for the textural part: L², G, L¹ and a new tunable norm, suggested here for the first time, based on Gabor functions. Apart from the broad perspective and our suggestions when each model should be used, the paper contains three specific novelties: first we show that the correlation graph between u and ρ may serve as an efficient tool to select the splitting parameter, second we propose a new fast algorithm to solve the TV − L¹ minimization problem, and third we introduce the theory and design tools for the TV-Gabor model. First online version published in February, 2006     

Flow regularity and optimality conditions with controls inL p

In this paper we study theC ^p regularity of the flow of a nonlinear nonautonomous control system with respect to control maps belonging toL ^p withp≥r. The results obtained are applied to get first- and second-order optimality conditions when the control space isL ^p . The problem which we consider is in the Mayer form and includes endpoint constraints. We present first-order necessary conditions for a wide class of control systems. Moreover, we show that the usual second-order sufficient conditions are effective only if the mapf that defines the control system is a polynomial of degree two in the control variable and the controls belong toL ².     

Stabilization and H control of symmetric systems: an explicit solution

In this paper we address the H^∞ control analysis, the output feedback stabilization, and the output feedback H^∞ control synthesis problems for state-space symmetric systems. Using a particular solution of the Bounded Real Lemma for an open-loop symmetric system we obtain an explicit expression to compute the H^∞ norm of the system. For the output feedback stabilization problem we obtain an explicit parametrization of all asymptotically stabilizing control gains of state-space symmetric systems. For the H^∞ control synthesis problem we derive an explicit expression for the optimally achievable closed-loop H^∞ norm and the optimal control gains. Extension to robust and positive real control of such systems are also examined. These results are obtained from the linear matrix inequality formulations of the stabilization and the H^∞ control synthesis problems using simple matrix algebraic tools.     

G 2 interpolation and blending on surfaces

We introduce a method for curvature-continuous (G ²) interpolation of an arbitrary sequence of points on a surface (implicit or parametric) with prescribed tangent and geodesic curvature at every point. The method can also be used forG ² blending of curves on surfaces. The interpolation/blending curve is the intersection curve of the given surface with a functional spline (implicit) surface. For the construction of blending curves, we derive the necessary formulas for the curvature of the surfaces. The intermediate results areG ² interpolation/blending methods in IR².     

Factorization and feedback stabilization for nonlinear systems

We establish the equivalence of internal input-out stability for two feedback configurations of a nonlinear, time-varying plant P for which a related plant G is assumed to have a factorization G = R with both R and R⁻¹ incrementally stable; this extends a factorization principle for stabilizability previously given only for the linear, time-invariant case. As an application of a special case we recover a version of the Youla parametrization of stabilizing compensators for the nonlinear case previously presented in the literature. We use degree theory to parametrize a collection of solutions of the H_∞-control problem for the case of a 1-gain stable or lossless plant. In the case of a plant G having a J-inner-outer factorization, this last result combined with the above-mentioned factorization principle leads to results on the H_∞-control problem for P.     

Synthesis of stable H controller via the chain scattering framework

A sufficient condition for the existence of suboptimal stable stabilizing H^∞ controllers is given. By exploiting the free parameter in the parameterization of stabilizing controllers and using the chain scattering framework, we reformulate the H^∞ strong stabilization problem as an equivalent H^∞ optimization problem which can be solved via only one algebraic Riccati equation. A parameterization of all suboptimal stable stabilizing H^∞ controllers is also given.     

On pure H reduced-order dynamic controllers: an erratum

There are at least two approaches advocated to obtain a pure H^∞ reduced-order dynamic controller for a given augmented plant. One approach is to eliminate completely the H² aspect from a standard H²/H^∞ setting. A second approach is to equate the H² aspect with the H^∞ aspect in that same setting. This paper invalidates the first approach but affirms the second approach and produces the correct equations resulting therefrom.     

A spectral characterization of H-optimal feedback performance and its efficient computation

We study the spectral properties of a ‘Toeplitz⁺ Hankel’ operator which arises in the context of the mixed-sensitivity H^∞-optimization problem and whose largest eigenvalue characterizes the optimal achievable performance ε₀. The existence of such an operator was first shown by Verma and Jonckheere [26], who also'noted the potential numerical advantage of computing eo through its eigenvalue characterization rather than through the ε-iteration. Here, we investigate this operator in detail, with the objective of efficiency computing its spectrum. We define an ‘adjoint’ linear-quadratic problem that involves the same ‘Toeplitz⁺ Hankel’ operator, as shown by Jonckheere and Silverman [13–16]. Consequently, a finite polynomial algorithm allows ε₀ to be characterized as simply as the largest root of a polynomial. Finally, a computationally more attractive state space algorithm emerges from the H^t8/LQ relationship. This algorithm yields a very good accuracy evaluation of the performance ε₀ by solving just one algebraic Riccati equation. Thorough exploitation of this algorithm results in a drastic computation reduction with respect to the standard e-iteration.     

A Hamiltonian-based solution to the two-block H problem for general plants in H and rational weights

A complete skew-Toeplitz-type solution to the two-block H^∞ problem for infinite-dimensional stable plants with rational weights is derived with a basis-free proof. The solution consists of one Riccati equation with a rank criterion for a transcendental function of a certain Hamiltonian. This gives a natural extension of the well-known formula for the one-block case. An example is given to illustrate the result.     

A batch arrival queue with a vacation time under single vacation policy

We consider an M^x/G/1 queueing system with a vacation time under single vacation policy, where the server takes exactly one vacation between two successive busy periods. We derive the steady state queue size distribution at different points in times, as well as the steady state distributions of busy period and unfinished work (backlog) of this model.Scope and purposeThis paper addresses issues of model building of manufacturing systems of job-shop type, where the server takes exactly one vacation after the end of each busy period. This vacation can be utilized as a post processing time after clearing the jobs in the system. To be more realistic, we further assume that the arrivals occur in batches of random size instead of single units and it covers many practical situations. For example in manufacturing systems of job-shop type, each job requires to manufacture more than one unit; in digital communication systems, messages which are transmitted could consist of a random number of packets. These manufacturing systems can be modeled by M^x/G/1 queue with a single vacation policy and this extends the results of Levy and Yechiali, Manage Sci 22 (1975) 202, and Doshi, Queueing Syst 1 (1986) 29.     

Another look at finite horizon H control problems for systems with input delays

We discuss a finite horizon H^∞ control problem for time-varying systems with input delays. Clarifying a relationship between two H^∞ control problems in input delay case and in measurement delay case, we derive a solution in input delay case based on the known result for the H^∞ control problem in measurement delay case, and show that the solution has the same predictor-observer structure as the solution in measurement delay case has. Using this structural information on the solution, we also present an elementary proof of the solution to the finite horizon H^∞ control problem for systems with input delays, which is based only on completion of squares.     

On the strict logic foundation of fuzzy reasoning

This paper focuses on the logic foundation of fuzzy reasoning. At first, a new complete first-order fuzzy predicate calculus system K^* corresponding to the formal system L^* is built. Based on the many-sort system K_ms^* corresponding to K^*, the triple I methods of FMP and FMT for fuzzy reasoning and their consistency are formalized, thus fuzzy reasoning is put completely and rigorously into the logic framework of fuzzy logic.The author is indebted to anonymous referee for his useful comments which have helped to improve the paper.