k-紧优有向双环网络无限族的构建

本文给出了一种方法用于构造k-紧优双环网络无限族(k≥1),并用此方法构造出了4族3-紧优无限族,3族新的4-紧比无限族,3族5-紧优无限族及2族6-紧优无限族．     

Optimal intensity control of a multi-class queue

We study a mixed problem of optimal scheduling and input and output control of a single server queue with multi-classes of customers. The model extends the classical optimal scheduling problem by allowing the general point processes as the arrival and departure processes and the control of the arrival and departure intensities. The objective of our scheduling and control problem is to minimize the expected discounted inventory cost over an infinite horizon, and the problem is formulated as an intensity control. We find the well-knownc is the optimal solution to our problem.Supported in part by NSF under grant ECS-8658157, by ONR under contract N00014-84-K-0465, and by a grant from AT&T Bell Laboratories.The work was done while the author was a postdoctoral fellow in the Division of Applied Sciences, Harvard University, Cambridge, Massachusetts 02138.     

Solution of a class of stochastic linear-convex control problems using deterministic equivalents

In this paper, we identify a new class of stochastic linearconvex optimal control problems, whose solution can be obtained by solving appropriate equivalent deterministic optimal control problems. The term linear-convex is meant to imply that the dynamics is linear and the cost function is convex in the state variables, linear in the control variables, and separable. Moreover, some of the coefficients in the dynamics are allowed to be random and the expectations of the control variables are allowed to be constrained. For any stochastic linear-convex problem, the equivalent deterministic problem is obtained. Furthermore, it is shown that the optimal feedback policy of the stochastic problem is affine in its current state, where the affine transformation depends explicitly on the optimal solution of the equivalent deterministic problem in a simple way. The result is illustrated by its application to a simple stochastic inventory control problem.This research was supported in part by NSERC Grant A4617, by SSHRC Grant 410-83-0888, and by an INRIA Post-Doctoral Fellowship.     

Prophet inequalities for parallel processes

Generalizations of prophet inequalities for single sequences are obtained for optimal stopping of several parallel sequences of independent random variables. For example, if {X_{i, j}, 1 ≤ i ≤ n, 1 ≤ j < ∞} are independent non-negative random variables, then

Full-size image

and this bound is best possible. Applications are made to comparisons of the optimal expected returns of various alternative methods of stopping of parallel processes.     

Hereditary optimal control problems: Numerical method based upon a padé approximation

In this paper, we consider a particular approximation scheme which can be used to solve hereditary optimal control problems. These problems are characterized by variables with a time-delayed argumentx(t – ). In our approximation scheme, we first replace the variable with an augmented statey(t) x(t - ). The two-sided Laplace transform ofy(t) is a product of the Laplace transform ofx(t) and an exponential factor. This factor is approximated by a first-order Padé approximation, and a differential relation fory(t) can be found. The transformed problem, without any time-delayed argument, can then be solved using a gradient algorithm in the usual way. Four problems are solved to illustrate the validity and usefulness of this technique.This research was supported in part by the National Aeronautics and Space Administration under NASA Grant NCC-2-106.     

Tactical problems involving uncertain actions

The purpose of this paper is to solve anm-silent versusn-silent duel with arbitrary accuracy functionsP andQ which are continuously differentiable in [0, 1] with positive derivatives in (0, 1) and such thatP(0)=Q(0)=0,P(1)(0, 1),Q(1)(0, 1). The game can be interpreted as a game in which the players know only that the numbers of their actions have binomial distribution.Part of this paper was written during the author's stay at the Institute of Statistics and Mathematical Economics, University of Karlsruhe, FRG. The author wishes to thank Prof. S. Trybua, Technical University of Wrocaw, Poland, for helpful discussion in preparing the paper and Prof. D. Pallaschke, University of Karlsruhe, FRG, for help in preparing the numerical example.     

Optimal virtual orbitals to relax wave functions built up with transferred extremely localized molecular orbitals

Extremely localized molecular orbitals (ELMOs), namely orbitals strictly localized on molecular fragments, are easily transferable from one molecule to another one. Hence, they provide a natural way to set up the electronic structure of large molecules using a data base of orbitals obtained from model molecules. However, this procedure obviously increases the energy with respect to a traditional MO calculation. To gain accuracy, it is important to introduce a partial electron delocalization. This can be carried out by defining proper optimal virtual orbitals that supply an efficient set for nonorthogonal configurations to be employed in VB-like expansions.     

Elliptic Reconstruction and a Posteriori Error Estimates for Fully Discrete Semilinear Parabolic Optimal Control Problems

This article studies a posteriori error analysis of fully discrete finite element approximations for semilinear parabolic optimal control problems. Based on elliptic reconstruction approach introduced earlier by Makridakis and Nochetto [25], a residual based a posteriori error estimators for the state, co-state and control variables are derived. The space discretization of the state and co-state variables is done by using the piecewise linear and continuous finite elements, whereas the piecewise constant functions are employed for the control variable. The temporal discretization is based on the backward Euler method. We derive a posteriori error estimates for the state, co-state and control variables in the $L^\infty(0,T;L^2(\Omega))$-norm. Finally, a numerical experiment is performed to illustrate the performance of the derived estimators.     

Construction of Spatiotemporal-Coupling Optimal Low-Dimensional Dynamical Systems for Compressible Navier-Stokes Equations; [可压缩 Navier-Stokes 方程的时空耦合优化低维动力系统建模方法]北大核心CSCD

For the low-dimensional dynamical system model to study dynamics properties of Navier-Stokes equations, it is very important that the attraction domain of the low-dimensional model is the same as that of Navier-Stokes equations. However, to date, there is no universal approach to ensure this purpose for general problems. Herein, it is found that any low-dimensional model based on spatial bases, such as proper orthogonal decomposition bases, optimal spatial bases, and other classical spatial bases, is not predictable, i.e., the error increases with the time evolution of the flow field. With the theoretical framework for building optimal dynamical systems and the new concept of spatiotemporal-coupling spectrum expansion, the low-dimensional model for compressible Navier-Stokes equations was constructed to approximate the numerical solution to large-eddy simulation equations, and the numerical results and novel time evolution of spatiotemporal-coupling bases were given. The entire field error is typically below 10−2%, and the average error at each grid point is below 10−8%. The spatiotemporal-coupling optimal low-dimensional dynamical systems can ensure that the attraction domain of the low-dimensional model is the same as that of Navier-Stokes equations. Therefore, characteristic dynamics properties of spatiotemporal-coupling optimal low-dimensional dynamical systems are the same as those of real flow. © 2022 Editorial Office of Applied Mathematics and Mechanics. All rights reserved.     

“限时服务规则”下的复线船闸多目标调度优化

针对现有船舶过闸排队规则的欠缺,基于“限时服务规则”,构建复线船闸多目标双层优化调度模型:上层模型用于获得两个闸室安全区域的船舶排布可行方案;下层模型用于获得不同船舶排布可行方案的优化闸次数。下层模型分两个阶段完成:对符合“限时服务规则”的船舶,构建以闸次最少为目标的0-1规划模型,获得此类船舶安排的闸次;对其余船舶按照“先到先服务规则”,构建以闸次最少、闸室利用率最大为目标的多目标决策模型,获得不同船舶排布可行方案应该安排的频次。以位于江苏省干线航道上的某复线船闸某日24小时内过闸船舶的数据为例,计算结果表明:采用本文优化模型获得的优化方案与“经验编排方式”相比,两座船闸各节约2个闸次,两个船闸的平均闸室利用率分别提高了3.66和4.72个百分点。