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.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Sensitivity analysis for discrete optimal control problems

We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem.     

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.     

FTIR光谱遥测红外药剂的燃烧温度

本文利用遥感FTIR光谱，对红外药剂的燃烧特性进行了研究。在分辨率为4cm^-1时，收集4700－740cm^-1波段的光谱。从HF等燃烧产物发射的分子振转基带精细结构的谱线强度分布，可以对燃烧温度进行遥感测定，并给出了燃烧温度随时间的变化关系，实验结果表明燃烧表面附近温度梯度很大，存在着急剧的变化温度场，同时也说明，在不干扰火焰温度场的情况下，利用遥感FTIR光谱对剧烈的、非稳态快速燃烧的火焰温度进行连续实时的遥感测量，是一种快速、准确、灵敏度高的测温方法，显示了它在燃烧温度测量、产物浓度测试以及燃烧机理研究等方面的应用前景。     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Constraint Programming and Operations Research: Comments from an Operations Researcher

This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research.     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。