Optimal Control of the Primary Drying Stage of Freeze Drying of Solutions in Vials Using Variational Calculus

The problem of operating freeze drying of pharmaceutical products in vials placed in trays of a freeze dryer to remove free water (in frozen state) at a minimum time was formulated as an optimal control problem. Two different types of freeze dryer designs were considered. In type I freeze dryer design, upper and lower plate temperatures were controlled together, while in type II freeze dryer design, upper and lower plate temperatures were controlled independently. The heat input to the material being dried and the drying chamber pressure were considered as control variables. Constraints were placed on the system state variables by the melting and scorch temperatures during primary drying stage. Necessary conditions of optimality for the primary drying stage of freeze drying process in vials are derived and presented. Furthermore, an approach for constructing the optimal control policies that would minimize the drying time for the primary drying stage was given. In order to analyze optimal control policy for the primary drying stage of the freeze-drying process in vials, a rigorous multi-dimensional unsteady state mathematical model was used. The theoretical approach presented in this work was applied in the freeze drying of skim milk. Significant reductions in the drying times of primary drying stage of freeze drying process in vials were obtained, as compared to the drying times obtained from conventional operational policies.     

Shallow Linear Action Graphs and their Embeddings

Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for a uniform behavioural theory for process calculi. Received October 2000 / Accepted in revised form April 2001     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

弹丸外弹道优化设计初始点的选取

在弹丸外弹道优化设计中,需对优化设计变量赋于初始值.初始值选取得如何,对整个优化计算所耗机时、迭代点收敛到哪个极值点上等等,影响很大.该文对初始值的选取原则、选取方法等作了讨论,所得结果也可作为对弹丸主要结构参数选优的预估.     

输入——输出迭代算法中松弛因子的确定

本文利用变分的手段提示了输入—输出迭代算法中松弛因子的取值规律。     

The principles of information processing based on the numerical solution of the nonlinear heat-conduction problem. Pt. 1. The three-dimensional discrete mathematical model

A three-dimensional solution of the direct problem of heat conduction when a linear pulsed heat source acts in the plane of contact of two semibounded bodies is presented. The solution is obtained by the method of finite differences. An example of the modeling is considered. __________ Translated from Izmeritel’naya Tekhnika, No. 10, pp. 42–45, October, 2007.     

A new curvature technique calculation for surface tension contribution in PLIC-VOF method

The volume of fluid (VOF) methods have been used for numerous numerical simulations. Among these techniques used to define the moving interface, the piecewise linear interface reconstruction (PLIC-VOF) is one of the most accurate. A study of the superficial tension impact on two-phase flow with free surface is presented. A new method based on direct staggered grid is developped to include surface tension in PLIC-VOF. The new numerical curvature calculation method doesn't need smoothed colour function and leads to less “spurious current”. This technique is applied to the calculus of surface tension force in the case of the rise of air bubble in viscous liquid and the fall of liquid drop in the same liquid on free surface. Droplets, thin layer and capillarity waves are observed after the free surface rupture for different Bond number. The influence of surface tension calculus is then obvioused and when the drop hit the free surface, wavelets propagate toward the virtual boundaries imposed.     

Nodally exact Ritz discretizations of 1D diffusion–absorption and Helmholtz equations by variational FIC and modified equation methods

This article presents the first application of the Finite Calculus (FIC) in a Ritz-FEM variational framework. FIC provides a steplength parametrization of mesh dimensions, which is used to modify the shape functions. This approach is applied to the FEM discretization of the steady-state, one-dimensional, diffusion–absorption and Helmholtz equations. Parametrized linear shape functions are directly inserted into a FIC functional. The resulting Ritz-FIC equations are symmetric and carry a element-level free parameter coming from the function modification process. Both constant- and variable-coefficient cases are studied. It is shown that the parameter can be used to produce nodally exact solutions for the constant coefficient case. The optimal value is found by matching the finite-order modified differential equation (FOMoDE) of the Ritz-FIC equations with the original field equation. The inclusion of the Ritz-FIC models in the context of templates is examined. This inclusion shows that there is an infinite number of nodally exact models for the constant coefficient case. The ingredients of these methods (FIC, Ritz, MoDE and templates) can be extended to multiple dimensions     

Probability densities for conditional statistics in the cubic sensor problem

This paper applies the techniques of Malliavin’s stochastic calculus of variations to Zakai’s equation for the one-dimensional cubic sensor problem in order to study the existence of densities of conditional statistics. Let {X _t} be a Brownian motion observed by a cubic sensor corrupted by white noise, and let denote the unnormalized conditional estimate of φ(X _i ). If φ₁,...,φ _n are linearly independent, and if , it is shown that the probability distribution of admits a density with respect to Lebesgue measure for anyn. This implies that, at any fixed time, the unnormalized conditional density cannot be characterized by a finite set of sufficient statistics. Research supported in part by NSF Grant No. MCS-8301880 and by the Institute for Mathematics and It Applications, Minneapolis, Minnesota.     

On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus

In Winkel (2001) a generalization of Bernstein polynomials and Bézier curves based on umbral calculus has been introduced. In the present paper we describe new geometric and algorithmic properties of this generalization including: (1) families of polynomials introduced by Stancu (1968) and Goldman (1985), i.e., families that include both Bernstein and Lagrange polynomial, are generalized in a new way, (2) a generalized de Casteljau algorithm is discussed, (3) an efficient evaluation of generalized Bézier curves through a linear transformation of the control polygon is described, (4) a simple criterion for endpoint tangentiality is established.