Piecewise Deterministic Markov Control Processes with Feedback Controls and Unbounded Costs

The control of piecewise-deterministic processes is studied where only local boundedness of the data is assumed. Moreover the discount rate may be zero. The value function is shown to be solution to the Bellman equation in a weak sense; however the solution concept is strong enough to generate optimal policies. Continuity and compactness conditions are given for the existence of nonrelaxed optimal feedback controls.     

Dynamic boundary stabilization of a Reissner–Mindlin plate with Timoshenko beam

This paper is concerned with well‐posedness results for a mathematical model for the transversal vibrations of a two‐dimensional hybrid elastic structure consisting of a rectangular Reissner–Mindlin plate with a Timoshenko beam attached to its free edge. The model incorporates linear dynamic feedback controls along the interface between the plate and the beam. Classical semigroup methods are employed to show the unique solvability of the coupled initial‐boundary‐value problem. We also show that the energy associated with the system exhibits the property of strong stability. Copyright © 2004 John Wiley & Sons, Ltd.     

A monotone iterative scheme for a nonlinear second order equation based on a generalized anti–maximum principle

In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the L^p norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞.     

The Convergence and Stability of Splitting Finite-Difference Schemes for Nonlinear Evolutionary Equations

We consider a splitting finite-difference scheme for an initial-boundary value problem for a two-dimensional nonlinear evolutionary equation. The problem is split into nonlinear and linear parts. The linear part is also split into locally one-dimensional equations. We prove the convergence and stability of the scheme in L ₂ and C norms. Printed in Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 413–434, July–September, 2005.     

Control Policy for a Manufacturing System with Random Yield and Rework

We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived.     

Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control

Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N ³. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction.     

n进制中非零数字之积函数的均值公式

设 N =a1nk1+ a2 nk2 +… + asnks( 1 aik2 >… >ks 0 ) ,a( N,n) =a1a2 … as,本文给出了均值 Ar( N ,n) =∑m相似文献   

一种锰铜压阻测量新方法

 简单分析了几种常用的恒流供电锰铜压阻测量方法，并对这些测试方法的特点和不足进行了讨论。最后介绍一种利用数字示波器进行高保真高精度测量的方法，利用此法不仅提高了压力测量的精度，并且把小阻值锰铜压力计的测量范围向低端扩展到0.17 GPa。     

Application of stochastic optimal control to the suboptimal design of thrust-mass profiles

Stochastic optimal control techniques are applied to compare the performance of identical medium-range air-to-air missiles which have different thrust-mass profiles. The measure of the performance is the probability of reaching a lock-on-point with a favorable range of guidance and flight parameters, during a fixed time interval [0,t _f ], given that, during the flight, the trajectories of the missile are subjected to a variety of constraints including dynamic pressure constraints.     

Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis [3] for all n≥ t ≥ 2.