Change of evaporation rate of single monocomponent droplet with temperature using time-resolved phase rainbow refractometry

Droplet evaporation characterization, although of great significance, is still challenging. The recently developed phase rainbow refractometry (PRR) is proposed as an approach to measuring the droplet temperature, size as well as evaporation rate simultaneously, and is applied to a single flowing n-heptane droplet produced by a droplet-on-demand generator. The changes of droplet temperature and evaporation rate after a transient spark heating are reflected in the time-resolved PRR image. Results show that droplet evaporation rate increases with temperature, from ?1.28$\times {10}^{?8}$ m²/s at atmospheric 293 K to a range of (?1.5, ?8)$\times {10}^{?8}$ m²/s when heated to (294, 315) K, agreeing well with the Maxwell and Stefan–Fuchs model predictions. Uncertainty analysis suggests that the main source is the indeterminate gradient inside droplet, resulting in an underestimation of droplet temperature and evaporation rate. With the demonstration on simultaneous measurements of droplet refractive index as well as droplet transient and local evaporation rate in this work, PRR is a promising tool to investigate single droplet evaporation in real engine conditions.     

Monte Carlo simulation of electric conductivity for pure and doping fullerene (C60)

In this paper, we have used Monte Carlo (MC) method to simulate and study the temperature and doping effects on the electric conductivity of fullerene (C60). The results show that the band gap has reduced by the doping and the charge carrier transport is facilitated from valence band to conduction band by the temperature where is touched a 300 K. In this case, the conductivity reached a value of $4\times {10}^{-7}\text{S}{\text{cm}}^{-1}$. The electric conductivity of C60 can increase by the triphenylmethane dye crystal violet (CV) alkali metal to reach $4\times {10}^{-3}\text{S}{\text{cm}}^{-1}$ at 303 K. Our results of MC simulation have a good agreement with those extracted from literature [10], [33].     

Computation of limit periodic continued fractions. A survey

Over the last 20 years a large number of algorithms has been published to improve the speed and domain of convergence of continued fractions. In this survey we show that these algorithms are strongly related. Actually, they essentially boil down to two main principles.We also prove some results on asymptotic expansions of tail values of limit periodic continued fractions.Dedicated to Luigi Gatteschi on his seventieth birthdayThis research was partially supported by The Norwegian Research Council and by the HMC project ROLLS, under contract CHRX-CT93-0416.     

NA列加权乘积和的完全收敛性

本文讨论了NA和几类加权部分和及加权乘积和的完全收敛性，其中部分结果要优于iid列的已知结论。     

OPTIMAL INVESTMENT IN THE PROTECTION OF A VULNERABLE BIOLOGICAL RESOURCE

It is assumed that the probability of destruction of a biological asset by natural hazards can be reduced through investment in protection. Specifically a model, in which the hazard rate depends on both the age of the asset and the accumulated invested protection capital, is assumed. The protection capital depreciates through time and its effectiveness in reducing the hazard rate is subject to diminishing returns. It is shown how the investment schedule to maximize the expected net present value of the asset can be determined using the methods of deterministic optimal control, with the survival probability regarded as a state variable. The optimal investment pattern involves “bang-bang-singular” control. A numerical scheme for determining jointly the optimal investment policy and the optimal harvest (or replacement) age is outlined and a numerical example involving forest fire protection is given.     

A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian

This paper develops a modified quasi-Newton method for structured unconstrained optimization with partial information on the Hessian, based on a better approximation to the Hessian in current search direction. The new approximation is decided by both function values and gradients at the last two iterations unlike the original one which only uses the gradients at the last two iterations. The modified method owns local and superlinear convergence. Numerical experiments show that the proposed method is encouraging comparing with the methods proposed in [4] for structured unconstrained optimization Presented at the 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December 9–11, 2004     

具连续时滞Liénard方程概周期解的存在唯一性

结合Liapunov泛函，研究了具连续时滞Lienard方程概周期解的存在唯一性和安全一致渐进稳定性。     

Skew-Hermitian Triangular Splitting Iteration Methods for Non-Hermitian Positive Definite Linear Systems of Strong Skew-Hermitian Parts

By further generalizing the skew-symmetric triangular splitting iteration method studied by Krukier, Chikina and Belokon (Applied Numerical Mathematics, 41 (2002), pp. 89–105), in this paper, we present a new iteration scheme, called the modified skew-Hermitian triangular splitting iteration method, for solving the strongly non-Hermitian systems of linear equations with positive definite coefficient matrices. We discuss the convergence property and the optimal parameters of this new method in depth. Moreover, when it is applied to precondition the Krylov subspace methods like GMRES, the preconditioning property of the modified skew-Hermitian triangular splitting iteration is analyzed in detail. Numerical results show that, as both solver and preconditioner, the modified skew-Hermitian triangular splitting iteration method is very effective for solving large sparse positive definite systems of linear equations of strong skew-Hermitian parts.     

The semi‐iterative method applied to the hyper‐power iteration

The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.