Three-dimensional stretched flow of Jeffrey fluid with variable thermal conductivity and thermal radiation

This article addresses the three-dimensional stretched flow of the Jeffrey fluid with thermal radiation. The thermal conductivity of the fluid varies linearly with respect to temperature. Computations are performed for the velocity and temperature fields. Graphs for the velocity and temperature are plotted to examine the behaviors with different parameters. Numerical values of the local Nusselt number are presented and discussed. The present results are compared with the existing limiting solutions, showing good agreement with each other.     

Invariant tori of nonlinear Schrödinger equation

In this paper, we consider one-dimensional nonlinear Schrödinger equation iut−uxx+V(x)u+f(²|u|)u=0 on [0,π]×R under the boundary conditions a₁u(t,0)−b₁ux(t,0)=0, a₂u(t,π)+b₂ux(t,π)=0, , for i=1,2. It is proved that for a prescribed and analytic positive potential V(x), the above equation admits small-amplitude quasi-periodic solutions corresponding to d-dimensional invariant tori of the associated infinite-dimensional dynamical system.     

从高放废液中去除锕系元素的TRPO 流程发展三十年

放射性废物,尤其是高放废物的妥善处理处置是各国政府和民众非常重视的一个问题,也是影响核能可持续发展的关键因素之一。高放废液是后处理Purex流程排放出来的废液,它集中了乏燃料中95%以上的放射性,其中α放射性核素的存在决定了需要将其处置在地质处置库中与生物圈隔离10万年以上。“分离-嬗变”方法处理高放废液可以有效缩减地质处置库与生物圈隔离的时限。TRPO具有良好的物性、辐照稳定性和对三价、四价和六价锕系元素良好的萃取选择性。基于此,我国提出了从高放废液中分离锕系元素的TRPO流程。多次热验证实验和中间规模冷台架实验结果证明TRPO流程处理我国生产堆高放废液,可完全实现高放废液的非α化。TRPO流程具有我国自主知识产权,在我国生产堆高放废液和动力堆高放废液处理中都具有良好的应有前景。     

光谱多元分析校正集和验证集样本分布优选方法研究

分析了校正集和验证集样品数随性质分布不均匀性对光谱多元分析校正的不良影响,揭示了实际光谱多元校正中“均值化”现象,即性质值小的样本预测值结果偏大,性质值大的则偏小,提出了一种优选样品新方法—Rank-KS。其综合考虑光谱空间和性质空间对样本进行挑选,将性质空间平均分为若干小区间,在每个小区间内分别利用Kennard-Stone法和随机法进行校正集和验证集样本的挑选,这样得到的校正集和验证集可明显改善样本数随性质分布的均匀性。以红外光谱测定汽油中碳酸二甲酯(DMC)含量和近红外光谱测定二甲亚砜溶液二甲亚砜浓度为研究对象,分别采用Rank-KS、随机法、Kennard-Stone、浓度梯度法和SPXY等方法选择校正集和验证集样品,使用多元线性回归和偏最小二乘法建立模型,比较这些方法对光谱多元校正分析的影响,结果表明Rank-KS方法可改善校正集和验证集样品数随性质分布的均匀性;对于样本数分布中间局部样本多和两端局部少、或者局部没有样本的样本集,使用Rank-KS算法挑选校正集,无论使用MLR还是PLS1建立多元分析模型,均能明显改善其模型预测能力,使得到的模型的预测均方根最小。     

Two-variable linear programming in parallel

Two-variable linear programming is a fundamental problem in computational geometry. Sequentially, this problem was solved optimally in linear time by Megiddo and Dyer using the elegant prune-and-search technique. In parallel, the previously best known deterministic algorithm on the EREW PRAM for this problem takes O(lognloglogn) time and O(n) work. In this paper, we present a faster parallel deterministic two-variable linear programming algorithm, which takes O(lognlog^*n) time and O(n) work on the EREW PRAM. Our algorithm is based on an interesting parallel prune-and-search technique, and makes use of new geometric observations which can be viewed as generalizations of those used by Megiddo and Dyer's sequential algorithms. Our parallel prune-and-search technique also leads to efficient EREW PRAM algorithm for the weighted selection problem, and is likely to be useful in solving other problems.     

Formulations and valid inequalities for the node capacitated graph partitioning problem

We investigate the problem of partitioning the nodes of a graph under capacity restriction on the sum of the node weights in each subset of the partition. The objective is to minimize the sum of the costs of the edges between the subsets of the partition. This problem has a variety of applications, for instance in the design of electronic circuits and devices. We present alternative integer programming formulations for this problem and discuss the links between these formulations. Having chosen to work in the space of edges of the multicut, we investigate the convex hull of incidence vectors of feasible multicuts. In particular, several classes of inequalities are introduced, and their strength and robustness are analyzed as various problem parameters change.     

A hybrid grouping genetic algorithm for bin packing

The grouping genetic algorithm (GGA) is a genetic algorithm heavily modified to suit the structure of grouping problems. Those are the problems where the aim is to find a good partition of a set or to group together the members of the set. The bin packing problem (BPP) is a well known NP-hard grouping problem: items of various sizes have to be grouped inside bins of fixed capacity. On the other hand, the reduction method of Martello and Toth, based on their dominance criterion, constitutes one of the best OR techniques for optimization of the BPP to date.In this article, we first describe the GGA paradigm as compared to the classic Holland-style GA and the ordering GA. We then show how the bin packing GGA can be enhanced with a local optimization inspired by the dominance criterion. An extensive experimental comparison shows that the combination yields an algorithm superior to either of its components.     

An Improved 3D SPIHT Coding for Hyperspectral Imagery Data Compression

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｃｏｍｐｒｅｓｓｉｏｎｃａｎｂｅａｃｈｉｅｖｅｄｂｙｅｎｃｏｄｉｎｇｔｈｅｔｒａｎｓｆｏｒｍｅｄｄａｔａ .Ａｆｕｎｄａｍｅｎｔａｌｇｏａｌｏｆｄａｔａｃｏｍｐｒｅｓｓｉｏｎｉｓｔｏｒｅｄｕｃｅｔｈｅｂｉｔｒａｔｅｆｏｒｔｒａｎｓｍｉｓｓｉｏｎｏｒｓｔｏｒａｇｅｗｈｉｌｅｍａｉｎｔａｉｎｉｎｇａｎａｃｃｅｐｔａｂｌｅｆｉｄｅｌｉｔｙｏｒｉｍａｇｅｑｕａｌｉｔｙ,ｅｓｐｅｃｉａｌｌｙａｖｏｌｕｍｅｏｆ 3Ｄｈｙｐｅｒｓｐｅｃｔｒａｌｉｍａｇｅｒｙｄａｔａｎｅｅｄｓｕｃｈｐ…     

Formations of polyvinyltoluene microlatexes in quaternary oil in water cetyltrimethylammonium bromide microemulsions

Polymerization of vinyltoluene (VT) in quaternary microemulsions containing cetyltrimethylammonium bromide (CTAB) as the cationic surfactant is studied using laser Raman spectroscopy (LRS) and dilatometry. The influences of water soluble (potassium peroxodisulphate, ammonium peroxodisulphate) and oil soluble (azobisisobutyronitrile, benzoyl peroxide) initiators, monomer, surfactant, cosurfactants (n-alcohol and bifunctional alcohols) and temperature on the rates of polymerization (R _p), energy of activation (Ea), particle diameter (D), number of polymer particles (N _p), molecular weight of polyvinyltoluene (M _v) and number of polymer chains per latex particle (N _pc) are investigated. The dependencies of the kinetic and latex size parameters on the initiators and cosurfactants are discussed in terms of the efficiency of the initiators in initiating the polymerization and on the interfacial partitioning behavior of various cosurfactants. The polymerization mechanism seems to follow Smith Ewart Case II hypothesis with two distinct rate regions. Final polymer microlatexes are found to lie within 10–50 nm as observed by transmission electron microscopy (TEM). Molecular weights are in the range of (1 to 5)×10⁶. Each latex particle contains one to three polymer chains.     

Usort: An efficient hybrid of Distributive Partitioning Sorting

A new hybrid of Distributive Partitioning Sorting is described and tested against Quicksort on uniformly distributed items. Pointer sort versions of both algorithms are also tested.