Statistical Measures for Ordinary Least Squares Using the αQ Algorithm

This paper shows how the dynamic program algorithm called the Q algorithm can be used as an alternative algorithm to produce the coefficients of a least squares problem. It shows also how the output of the algorithm can be used to calculate various statistical quantities needed to evaluate linear models. In particular, we show how to calculate standard statistical quantities like the coefficient of determination R², the t statistics, and the F statistics. These quantities serve as a measure of how well the model fits the data.     

Higher-Order Convex Approximations of Young Measures in Optimal Control

The general theory of approximation of (possibly generalized) Young measures is presented, and concrete cases are investigated. An adjoint-operator approach, combined with quasi-interpolation of test integrands, is systematically used. Applicability is demonstrated on an optimal control problem for an elliptic system, together with one-dimensional illustrative calculations of various options.     

Existence of Optimal Controls for Semilinear Parabolic Equations without Cesari-Type Conditions

   Abstract. Optimal control problems governed by semilinear parabolic partial differential equations are considered. No Cesari-type conditions are assumed. By proving the existence theorem and the Pontryagin maximum principle of optimal ``state-control" pairs for the corresponding relaxed problems, an existence theorem of optimal pairs for the original problem is established.     

Technically optimal inspection policy with arithmetical adaption

A process is considered whose quality deteriorates accordingto a constant failure intensity . As in practice it can be difficultto estimate the true value of the purpose of this paper isto present a strategy which can be applied without knowing .In order to maximize the number of conforming items per timeunit perfect inspections and renewals are performed. The lengthof the inspection interval is described by an arithmetical sequenceand changes by the time depending on perceived assignable causes.Optimal adaptive control plans provide nearly the same performanceas in the case when is known.     

On generalized hamiltonian systems

1. PreliminaryIt is well known that{1] a 8ymPlectic form is invariant along the trajectory of a Hamilto-nian system. Based on this fundamental property, certain techniques have been developed.The purpose of this paper is to extend such an approach to a wider class of dynamic systeIns,namely, genera1ized Hamiltonian systems. Our purpose is to investigate a class of dynaInicsystems, which possess a certain "geometric structure".Deflnition 1.1[1'2]. Let M be a tIlallifo1d. w E fl'(M) is call…     

Convexity of Nonlinear Image of a Small Ball with Applications to Optimization

Let f: XY be a nonlinear differentiable map, X,Y are Hilbert spaces, B(a,r) is a ball in X with a center a and radius r. Suppose f (x) is Lipschitz in B(a,r) with Lipschitz constant L and f (a) is a surjection: f (a)X=Y; this implies the existence of >0 such that f (a)^* yy, yY. Then, if r,/(2L), the image F=f(B(a,)) of the ball B(a,) is convex. This result has numerous applications in optimization and control. First, duality theory holds for nonconvex mathematical programming problems with extra constraint x–a. Special effective algorithms for such optimization problems can be constructed as well. Second, the reachability set for small power control is convex. This leads to various results in optimal control.     

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.     

A unified framework for pull control mechanisms in multi‐stage manufacturing systems

This paper presents a unified framework for pull production control mechanisms in multistage manufacturing systems. A pull production control mechanism in a multistage manufacturing system is a mechanism that coordinates the release of parts into each stage of the system with the arrival of customer demands for final products. Four basic pull production control mechanisms are presented: Base Stock, Kanban, Generalized Kanban, and Extended Kanban. It is argued that on top of any of these basic coordination mechanisms, a local mechanism to control the workinprocess in each stage may be superimposed. Several cases of basic stage coordination mechanisms with stage workinprocess control are presented, and several production control systems that have appeared in the literature are shown to be equivalent to some of these cases.     

Time-optimal control of a parabolic system with time lags given in the integral form

In this paper the time-optimal control problem for a distributedparabolic system in which time lags appear in the integral formboth in the state equation and in the boundary condition ispresented. The particular properties of the optimal controlare discussed.     

Langford系统Hopf分叉的线性反馈控制

分析Langford系统的Hopf分叉现象，并研究采用线性反馈控制方法控制该系统的Hopf分叉.从理论上推导出受控系统产生Hopf分叉的条件，给出了某些极限环的解析表达式，对该系统进行了分叉点的转移与极限环的稳定性控制.数值模拟说明本文采用的方法对Langford系统的Hopf分叉控制是有效的. 关键词： Langford系统 反馈控制 Hopf分叉 极限环