“Slow” active control of combustion instabilities by modification of liquid fuel spray properties

This paper describes an experimental investigation of the feasibility of using “slow” active control approaches, which “instantaneously” change liquid fuel spray properties, to suppress combustion instabilities. The objective of this control approach was to break up the feedback between the combustion process heat release and combustor pressure oscillations that drive the instability by changing the characteristics of the combustion process (e.g., the characteristic combustion time). To demonstrate the feasibility of such control, this study used a proprietary fuel injector (Nanomiser^TM), which can vary its fuel spray properties, to investigate the dependence of acoustics–combustion process coupling, i.e., the driving of combustion instabilities, upon the fuel spray properties. This study showed that by changing the spray characteristics it is possible to significantly damp combustion instabilities. Furthermore, using combustion zone chemiluminescence distributions, which were obtained by Abel’s deconvolution synchronized with measured acoustic data, it has been shown that the instabilities were mostly driven midway between the combustor centerline and wall, a short distance downstream from the flame holder, where the mean axial flow velocity is approximately zero in the vortex near the flame holder. The results of this study strongly suggest that a “slow” active control system that employs controllable fuel injectors could be effectively used to prevent the onset of detrimental combustion instabilities.     

拟线性椭圆变分不等式的障碍最优控制问题

对拟线性椭圆变分不等式的障碍最优控制问题(即以障碍为控制变量)进行了研究．指标泛函为Lagrange型,其中含有控制变量二阶导数的p次幂,这使得最优性条件的推导颇为不易．对所考虑的问题给出了最优控制的存在性定理以及必要条件．     

一类It型非线性时滞关联随机大系统的分散鲁棒控制

在非线性项满足全局Lipschitz条件下,本文研究了一类It型非线性时滞关联随机大系统的分散鲁棒控制问题.系统的时滞是关于状态和控制输入的.基于Lyapunov泛函及线性矩阵不等式(LMI)的分析方法,得到了无记忆状态反馈控制器使整个时滞关联随机大系统可镇定的充分条件.     

两指标双F统计过程控制图

当产品质量指标服从二元正态分时,可用T2控制图与Λ控制图联合判断产品生产的过程是否处于受控状态。本文利用T2统计量与F统计量、Λ统计量与F统计量之间的关系,得到了两指标情形下两类基于F分布统计量的统计过程控制图,简称双F统计过程控制图,并给出了控制图应用实例。     

Optimal vaccine scheduling in cancer immunotherapy

Cancer immunotherapy aims at stimulating the immune system to react against cancer stealth capabilities. It consists of repeatedly injecting small doses of a tumor-associated molecule one wants the immune system to recognize, until a consistent immune response directed against the tumor cells is observed.

We have applied the theory of optimal control to the problem of finding the optimal schedule of injections of an immunotherapeutic agent against cancer. The method employed works for a general ODE system and can be applied to find the optimal protocol in a variety of clinical problems where the kinetics of the drug or treatment and its influence on the normal physiologic functions have been described by a mathematical model.

We show that the choice of the cost function has dramatic effects on the kind of solution the optimization algorithm is able to find. This provides evidence that a careful ODE model and optimization schema must be designed by mathematicians and clinicians using their proper different perspectives.     

Normality of the maximum principle for nonconvex constrained Bolza problems

We consider a Bolza optimal control problem with state constraints. It is well known that under some technical assumptions every strong local minimizer of this problem satisfies first order necessary optimality conditions in the form of a constrained maximum principle. In general, the maximum principle may be abnormal or even degenerate and so does not provide a sufficient information about optimal controls. In the recent literature some sufficient conditions were proposed to guarantee that at least one maximum principle is nondegenerate, cf. [A.V. Arutyanov, S.M. Aseev, Investigation of the degeneracy phenomenon of the maximum principle for optimal control problems with state constraints, SIAM J. Control Optim. 35 (1997) 930–952; F. Rampazzo, R.B. Vinter, A theorem on existence of neighbouring trajectories satisfying a state constraint, with applications to optimal control, IMA 16 (4) (1999) 335–351; F. Rampazzo, R.B. Vinter, Degenerate optimal control problems with state constraints, SIAM J. Control Optim. 39 (4) (2000) 989–1007]. Our aim is to show that actually conditions of a similar nature guarantee normality of every nondegenerate maximum principle. In particular we allow the initial condition to be fixed and the state constraints to be nonsmooth. To prove normality we use J. Yorke type linearization of control systems and show the existence of a solution to a linearized control system satisfying new state constraints defined, in turn, by linearization of the original set of constraints along an extremal trajectory.     

增强型延迟反馈法控制低维混沌系统的解析研究

基于时间延迟反馈控制混沌系统的方法,提出一种增强型控制方案,并利用分析延迟系统产生Hopf分支条件的方法,给出这种方案控制低维连续自治混沌系统时,在达到控制目标的条件下,控制参数的一般解析关系.将这一方案和分析方法应用到两个混沌模型中,结果表明:采用修正的方案可以明显地改善控制混沌的效果和质量;解析分析的结果与实际数值计算的结果一致. 关键词： 延迟反馈 混沌控制 Hopf分支     

On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

基于Web的图书馆管理系统访问控制策略

针对基于Web的图书馆管理系统资源访问控制的动态性问题，提出了一种基于角色的访问控制策略描述方案．通过对基于Web的图书馆管理系统访问控制管理影响因素和访问控制需求的分析，结合NIST基于角色的访问控制统一模型标准，构造了一种基于角色的访问控制元模型．并在这一元模型的基础上，提出了一种紧凑的基于角色的访问控制XML策略描述语言框架．结果表明该访问控制策略描述语言框架适合表述动态环境下对图书馆资源的访问策略，提高了基于Web的图书馆管理系统资源访问的安全性．     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.