Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

Spectral regions selection to improve prediction ability of PLS models by changeable size moving window partial least squares and searching combination moving window partial least squares

Changeable size moving window partial least squares (CSMWPLS) and searching combination moving window partial least squares (SCMWPLS) are proposed to search for an optimized spectral interval and an optimized combination of spectral regions from informative regions obtained by a previously proposed spectral interval selection method, moving window partial least squares (MWPLSR) [Anal. Chem. 74 (2002) 3555]. The utilization of informative regions aims to construct better PLS models than those based on the whole spectral points. The purpose of CSMWPLS and SCMWPLS is to optimize the informative regions and their combination to further improve the prediction ability of the PLS models. The results of their application to an open-path (OP)/FT-IR spectra data set show that the proposed methods, especially SCMWPLS can find out an optimized combination, with which one can improve, often significantly, the performance of the corresponding PLS model, in terms of low prediction error, root mean square error of prediction (RMSEP) with the reasonable latent variable (LVs) number, comparing with the results obtained using whole spectra or direct combination of informative regions for a compound. Regions consisting of the combinations obtained can easily be explained by the existence of IR absorption bands in those spectral regions.     

可调移动重叠分离图法用于高效液相色谱多台阶梯度分离条件优化的研究

计算机辅助高效液相色谱（HPLC）分离条件优化可以低成本、快速地得到优化的分离条,因而已较为广泛地用于复杂样品的分离分析。基于移动重叠分离图方法,又发展了一种新型的多台阶梯度分离条件的优化方法可调移动重叠分离图法。该方法通过预测不同流动相条件下各组分的保留时间、峰宽和分离度,绘制出对于样品中各组分的重叠分离区域图。在对当前台阶流动相组成进行优化的同时,考虑其对后面一到两个台阶上流出组分保留的影响,实时地重新绘制对于后面台阶上流出组分的重叠分离区域图。通过观察当前台阶流动相条件对当前台阶和后面台阶上流出组分分离的影响,综合考虑样品中所有组分的分离情况,找到更接近全局最优的分离条件。通过扫描的方法对优化得到的分离条件进行微调,能够进一步提高分离效果。采用文献数据对可调移动重叠分离图法的应用加以说明,在二元流动相体系下,证明了该方法在HPLC方法建立方面的优越性。     

Optimizing control of simulated moving beds--linear isotherm

A new optimization based adaptive control strategy for simulated moving beds (SMBs) is proposed. A linearized reduced order model, which accounts for the periodic nature of the SMB process, is used for online optimization and control. The manipulated variables are the four inlet flow rates, the outputs are the raffinate and extract concentrations. Concentration measurements at the raffinate and extract outlets are used as the feedback information. The state estimate from the periodic Kalman filter is used for the prediction of the outlet concentrations over a chosen horizon. Predicted outlet concentrations are the basis for the calculation of the optimal input adjustments, which maximize the productivity and minimize the desorbent consumption subject to constraints on product purities. The realization of this concept is discussed and the implementation on a virtual eight column SMB platform is assessed, in the case of binary linear systems. For a whole series of typical plant disturbances it is shown that the proposed approach is effective in minimizing off-spec products and in achieving optimal SMB operation, also in the case where there are significant model uncertainties.     

A review ofL=λW and extensions

A fundamental principle of queueing theory isL=W (Little's law), which states that the time-average or expected time-stationary number of customers in a system is equal to the product of the arrival rate and the customer-average or expected customer-stationary time each customer spends in the system. This principle is now well known and frequently applied. However, in recent years there have been extensions, such as H=G and the continuous, distributional, ordinal and central-limit-theorem versions, which show that theL=W relation, when viewed properly, has much more power than was previously realized. Moreover, connections have been established between H=G and other fundamental relations, such as the rate conservation law and PASTA (Poisson arrivals see time averages), which show that there is a much greater unity in the overall theory than was previously realized. This paper provides a review.This paper is dedicated to the memory of our colleague Professor Peter Franken (1937–1989), who contributed greatly to the subject of this paper and to queueing theory more generally.     

An ALE finite element method for a coupled Stefan problem and Navier–Stokes equations with free capillary surface

In this article, an ALE finite element method to simulate the partial melting of a workpiece of metal is presented. The model includes the heat transport in both the solid and liquid part, fluid flow in the liquid phase by the Navier–Stokes equations, tracking of the melt interface solid/liquid by the Stefan condition, treatment of the capillary boundary accounting for surface tension effects and a radiative boundary condition. We show that an accurate treatment of the moving boundaries is crucial to resolve their respective influences on the flow field and thus on the overall energy transport correctly. This is achieved by a mesh‐moving method, which explicitly tracks the phase boundary and makes it possible to use a sharp interface model without singularities in the boundary conditions at the triple junction. A numerical example describing the welding of a thin‐steel wire end by a laser, where all aforementioned effects have to be taken into account, proves the effectiveness of the approach.Copyright © 2012 John Wiley & Sons, Ltd.     

考虑运动受限的履带式移动机器人轨迹跟踪控制

针对履带式移动机器人的轨迹跟踪控制问题进行研究,首先,建立了履带式移动机器人的运动学模型和跟踪误差模型；其次,设计了转速有限时间控制和线速度滑模控制的轨迹跟踪控制律,并给出了考虑运动受限作用下的控制律修正表达式；最后,基于MATLAB对所提控制律进行仿真,对比分析了不考虑运动受限情况下跟踪控制效果;结果表明,设计的跟踪控制律能够实现履带式移动机器人对圆轨迹的有效跟踪,且考虑运动受限作用的控制律更加符合实际;文章研究分析了运动受限作用对于移动机器人轨迹跟踪控制的影响,分析结果对其他移动机器人的运动控制研究具有参考价值。     

Moving grid method for numerical simulation of stratified flows

We develop a second‐order accurate Navier–Stokes solver based on r‐adaptivity of the underlying numerical discretization. The motion of the mesh is based on the fluid velocity field; however, certain adjustments to the Lagrangian velocities are introduced to maintain quality of the mesh. The adjustments are based on the variational approach of energy minimization to redistribute grid points closer to the areas of rapid solution variation. To quantify the numerical diffusion inherent to each method, we monitor changes in the background potential energy, computation of which is based on the density field. We demonstrate on a standing interfacial gravity wave simulation how using our method of grid evolution decreases the rate of increase of the background potential energy compared with using the same advection scheme on the stationary grid. To further highlight the benefit of the proposed moving grid method, we apply it to the nonhydrostatic lock‐exchange flow where the evolution of the interface is more complex than in the standing wave test case. Naive grid evolution based on the fluid velocities in the lock‐exchange flow leads to grid tangling as Kelvin–Helmholtz billows develop at the interface. This is remedied by grid refinement using the variational approach. Copyright © 2012 John Wiley & Sons, Ltd.     

Non-linear global dynamics of an axially moving plate

In the present study, the geometrically non-linear dynamics of an axially moving plate is examined by constructing the bifurcation diagrams of Poincaré maps for the system in the sub and supercritical regimes. The von Kármán plate theory is employed to model the system by retaining in-plane displacements and inertia. The governing equations of motion of this gyroscopic system are obtained based on an energy method by means of the Lagrange equations which yields a set of second-order non-linear ordinary differential equations with coupled terms. A change of variables is employed to transform this set into a set of first-order non-linear ordinary differential equations. The resulting equations are solved using direct time integration, yielding time-varying generalized coordinates for the in-plane and out-of-plane motions. From these time histories, the bifurcation diagrams of Poincaré maps, phase-plane portraits, and Poincaré sections are constructed at points of interest in the parameter space for both the axial speed regimes.     

Simulation of three‐dimensional flows over moving objects by an improved immersed boundary–lattice Boltzmann method

An improved immersed boundary–lattice Boltzmann method (IB–LBM) developed recently [28] was applied in this work to simulate three‐dimensional (3D) flows over moving objects. By enforcing the non‐slip boundary condition, the method could avoid any flow penetration to the wall. In the developed IB–LBM solver, the flow field is obtained on the non‐uniform mesh by the efficient LBM that is based on the second‐order one‐dimensional interpolation. As a consequence, its coefficients could be computed simply. By simulating flows over a stationary sphere and torus [28] accurately and efficiently, the proposed IB–LBM showed its ability to handle 3D flow problems with curved boundaries. In this paper, we further applied this method to simulate 3D flows around moving boundaries. As a first example, the flow over a rotating sphere was simulated. The obtained results agreed very well with the previous data in the literature. Then, simulation of flow over a rotating torus was conducted. The capability of the improved IB–LBM for solving 3D flows over moving objects with complex geometries was demonstrated via the simulations of fish swimming and dragonfly flight. The numerical results displayed quantitative and qualitative agreement with the date in the literature. Copyright © 2011 John Wiley & Sons, Ltd.