Numerical solutions of the shallow water equations with discontinuous bed topography

A simple scheme is developed for treatment of vertical bed topography in shallow water flows. The effect of the vertical step on flows is modelled with the shallow water equations including local energy loss terms. The bed elevation is denoted with z_b^‐ for the left and z_b⁺ for the right values at each grid point, hence exactly representing a discontinuity in the bed topography. The surface gradient method (SGM) is generalized to reconstruct water depths at cell interfaces involving a vertical step so that the fluxes at the cell interfaces can accurately be calculated with a Riemann solver. The scheme is verified by predicting a surge crossing a step, a tidal flow over a step and dam‐break flows on wet/dry beds. The results have shown good agreements compared with analytical solutions and available experimental data. The scheme is efficient, robust, and may be used for practical flow calculations. Copyright © 2002 John Wiley & Sons, Ltd.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

配送量不定的供应链协调

本文研究供应链管理中配送量不确定时，制造商和分销商之间的协调问题。通过建立惩罚和奖励机制模型来协调供应链各部分的运作，使得分散系统就如一个整体。同时分析供应链的利润分配问题，分别得出各个机制下分销商的最优决策。     

SEPARATING SCN~- FROM DESULPHURIZATION WASTE SOLUTION OF COCKING PLANT BY D241 RESIN

1. INTRODUCTION In the process of coking plant, about 30%~35% sulfur is transformed to H2S and some other sulfide, which form impurity in coal gas together with NH3 and HCN. Only 0.1% H2S containing in air can lead to die, so it is very important to carry on desulphurization and decyanation with coal gas [1~3]. Currently desulphurization and decyanation craft technique have Dry Oxidation Technology, Wet Oxidation Technology and Liquid Absorption Technology [2] three main kinds. The…     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

Spray Freeze-drying – The Process of Choice for Low Water Soluble Drugs?

Most of the novel highly potent drugs, developed on the basis of modern molecular medicine, taking into account cell surface recognition techniques, show poor water solubility. A chemical modification of the drug substance enhancing the solubility often decreases the pharmacological activity. Thus, as an alternative an increase of the solubility can be obtained by the reduction of the size of the drug particles. Unfortunately, it is often difficult to obtain micro or nanosized drug particles by classical or more advanced crystallization using supercritical gases or by milling techniques. In addition, nanosized particles are often not physically stable and need to be stabilized in an appropriate matrix. Thus, it may be of interest to manufacture directly nanosized drug particles stabilized in an inert hydrophilic matrix, i.e. nanostructured and nanocomposite systems. Solid solutions and solid dispersions represent nanostructured and nanocomposite systems. In this context, the use of the vacuum-fluidized-bed technique for the spray-drying of a low water soluble drug cosolubilized with a hydrophilic excipient in a polar organic solvent is discussed. In order to avoid the use of organic solvents, a special spray-freeze-drying technique working at atmospheric pressure is presented. This process is very suitable for temperature and otherwise sensitive drugs such as pharmaproteins.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

Simulated annealing with noisy or imprecise energy measurements

The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant.     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.