Formation of long range ordered arrangement of quantum dots with the help of lateral centripetal flow

A simple “chimney” method was used to eliminate the voids in an arrangement of quantum dots sized 2 nm on a solid substrate, which resulted in a large well ordered superlattice of area in the order more than 1 μm². Based on the principle of speeding up the interparticle interaction of nanoparticles to overcome the particle-substrate one, a lateral centripetal force originated from a glass tube acting as a chimney in a simple evaporation device is imposed. This method allows the packing process to be controlled in a mechanical force field, that is, with the same nanogold dispersion different patterns on a substrate—from separate dots to an ordered compact monolayer or even a multilayer structure—could be easily obtained.     

绕圆柱体自由表面磁流体流动和传热的研究

本文对在不同雷诺数下,绕圆柱体的磁流体自由表面流动及传热进行了模拟,分析了磁场对绕流圆柱尾迹和涡分离的影响,获得了两种雷诺数下的电磁力密度、流场和温度场分布。结果表明,磁场不仅影响了流动的形态,而且对湍流有抑制作用,降低了自由表面的更新机制,从而减少了传热能力;在相同的Hartmann数下,相比低雷诺数下的流动换热情况,高雷诺数下的湍流不能被完全抑制,自由表面与尾迹的相互作用也较强,因而自由表面换热也较强。     

Minimum concave cost production system: A further generalization of multi-echelon model

We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n ⁴ m) algorithm for this class of problems.     

Turbulence without strange attractor

It is shown that pipe-flow turbulence consists of transients. The fractal dimensions of the dynamical process are thus all zero. Nevertheless, this is compatible with Grassberger-Procaccia analyses suggesting the existence of a high-dimensional strange attractor. The usefulness of the Grassberger-Procaccia method to detect the aging of transients is demonstrated.     

Flow injection-spectrophotometric determination of cresol compounds in water by reaction withp-aminophenol

A spectrophotometric method has been developed for the simultaneous determination ofo-cresol andm-cresol in water by reaction withp-aminophenol (PAP). Three different methodologies have been assayed; (i) batch analysis, after reaction in an alkaline medium in the presence of dissolved molecular oxygen as oxidizing agent, (ii) a stopped-flow procedure, carried out in the presence of KIO₄ and (iii) a flow injection method based on the same approach. The batch procedure requires 22 min for the full development of colour witho-cresol and 12 min form-cresol. In the stopped-flow mode, using KIO₄ and a reaction time of 12 min, better sensitivity can be obtained for both compounds and limits of detection of 10 g 1^–1 foro-cresol and 30 g 1^–1 form-cresol were found. The flow injection method has a lower sensitivity but permits more than 80 injections per hour. Based on the different maximum absorbance wavelengths obtained for the reaction products of PAP witho-cresol (614 nm) andm-cresol (632 nm), both compounds can be simultaneously determined in water samples and recoveries of 90 to 115% were found in spiked water samples of different types.     

Analytical solutions of the lattice Boltzmann BGK model

Analytical solutions of the two-dimensional triangular and square lattice Boltzmann BGK models have been obtained for the plane Poiseuille flow and the plane Couette flow. The analytical solutions are written in terms of the characteristic velocity of the flow, the single relaxation time , and the lattice spacing. The analytic solutions are the exact representation of these two flows without any approximation. Using the analytical solution, it is shown that in Poiseuille flow the bounce-back boundary condition introduces an error of first order in the lattice spacing. The boundary condition used by Kadanoffet al. in lattice gas automata to simulate Poiseuille flow is also considered for the triangular lattice Boltzmann BGK model. An analytical solution is obtained and used to show that the boundary condition introduces an error of second order in the lattice spacing.     

Minimum cost multiflows in undirected networks

LetN = (G, T, c, a) be a network, whereG is an undirected graph,T is a distinguished subset of its vertices (calledterminals), and each edgee ofG has nonnegative integer-valuedcapacity c(e) andcost a(e). Theminimum cost maximum multi(commodity)flow problem (*) studied in this paper is to find ac-admissible multiflowf inG such that: (i)f is allowed to contain partial flows connecting any pairs of terminals, (ii) the total value off is as large as possible, and (iii) the total cost off is as small as possible, subject to (ii). This generalizes, on one hand, the undirected version of the classical minimum cost maximum flow problem (when |T| = 2), and, on the other hand, the problem of finding a maximum fractional packing ofT-paths (whena 0). Lovász and Cherkassky independently proved that the latter has a half-integral optimal solution.A pseudo-polynomial algorithm for solving (*) has been developed earlier and, as its consequence, the theorem on the existence of a half-integral optimal solution for (*) was obtained. In the present paper we give a direct, shorter, proof of this theorem. Then we prove the existence of a half-integral optimal solution for the dual problem. Finally, we show that half-integral optimal primal and dual solutions can be designed by a combinatorial strongly polynomial algorithm, provided that some optimal dual solution is known (the latter can be found, in strongly polynomial time, by use of a version of the ellipsoid method).This work was partially supported by Chaire municipale, Mairie de Grenoble, France.     

Generalized solutions of a stochastic partial differential equation

We discuss the Cauchy problem of a certain stochastic parabolic partial differential equation arising in the nonlinear filtering theory, where the initial data and the nonhomogeneous noise term of the equation are given by Schwartz distributions. The generalized (distributional) solution is represented by a partial (conditional) generalized expectation ofT(t)° _0,t ^–1 , whereT(t) is a stochastic process with values in distributions and _s,t is a stochastic flow generated by a certain stochastic differential equation. The representation is used for getting estimates of the solution with respect to Sobolev norms.Further, by applying the partial Malliavin calculus of Kusuoka-Stroock, we show that any generalized solution is aC -function under a condition similar to Hörmander's hypoellipticity condition.     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.