Millimeter-Wave Spectroscopy of Methylfuran Isomers: Local vs. Global Treatments of the Internal Rotation

Methylfurans are methylated aromatic heterocyclic volatile organic compounds and primary or secondary pollutants in the atmosphere due to their capability to form secondary organic aerosols in presence of atmospheric oxidants. There is therefore a significant interest to monitor these molecules in the gas phase. High resolution spectroscopic studies of methylated furan compounds are generally limited to pure rotational spectroscopy in the vibrational ground state. This lack of results might be explained by the difficulties arisen from the internal rotation of the methyl group inducing non-trivial patterns in the rotational spectra. In this study, we discuss the benefits to assign the mm-wave rotational-torsional spectra of methylfuran with the global approach of the BELGI-Cs code compared to local approaches such as XIAM and ERHAM. The global approach reproduces the observed rotational lines of 2-methylfuran and 3-methylfuran in the mm-wave region at the experimental accuracy for the ground vt=0 and the first torsional vt=1 states with a unique set of molecular parameters. In addition, the V3 and V6 parameters describing the internal rotation potential barrier may be determined with a high degree of accuracy with the global approach. Finally, a discussion with other heterocyclic compounds enables the study of the influence of the electronic environment on the hindered rotation of the methyl group.     

The Optimal Error Estimate of the Fully Discrete Locally Stabilized Finite Volume Method for the Non-Stationary Navier-Stokes Problem

This paper proves the optimal estimations of a low-order spatial-temporal fully discrete method for the non-stationary Navier-Stokes Problem. In this paper, the semi-implicit scheme based on Euler method is adopted for time discretization, while the special finite volume scheme is adopted for space discretization. Specifically, the spatial discretization adopts the traditional triangle P1−P0 trial function pair, combined with macro element form to ensure local stability. The theoretical analysis results show that under certain conditions, the full discretization proposed here has the characteristics of local stability, and we can indeed obtain the optimal theoretic and numerical order error estimation of velocity and pressure. This helps to enrich the corresponding theoretical results.     

寄生虚反射对外差干涉椭偏测量的影响

研究了一种采用横向塞曼激光器并且没有任何运动部件的外差干涉椭偏测量系统。由非理想的激光源、偏振分光镜等器件所产生的非线性误差,是影响纳米测量精度的主要因素。采用琼斯矢量法,分析并建立了光学系统寄生虚反射所引入的误差模型,讨论了虚反射对误差漂移的影响。在不考虑其它误差因素的前提下,同一光路内部产生的同频率虚反射波对测量结果没有影响;而不同频率的参考光束与测量光束之间的交叉虚反射所产生的膜厚测量误差为亚纳米量级。讨论了消除和抑制虚反射误差的方法。     

电阻抗图像重建中Jacobi矩阵的快速算法

Jacobi矩阵是电阻抗图像重建中计算量最大的部份。利用摄动法导出该矩阵的快速算法,可以大幅度地减少计算量。算例表明,这种方法是有效的。     

A least‐square weighted residual method for level set formulation

In this paper, a least‐square weighted residual method (LSWRM) for level set (LS) formulation is introduced to achieve interface capturing in two‐dimensional (2D) and three‐dimensional (3D) problems. An LSWRM was adopted for two semi‐discretized advection and reinitialization equations of the LS formulation. The present LSWRM provided good mathematical properties such as natural numerical diffusion and the symmetry of the resulting algebraic systems for the advection and reinitialization equations. The proposed method was validated by solving some 2D and 3D benchmark problems such as those involving a rotating slotted disk, the rotation of a slotted sphere, and a time‐reversed single‐vortex flow and a deformation problem of a spherical fluid. The numerical results were compared with those obtained from essentially non‐oscillatory type formulations and particle LS methods. Further, the proposed LSWRM for the LS formulation was coupled with a splitting finite element method code to solve the incompressible Navier–Stokes equations, and then, the collapse of a 3D broken dam flow was well simulated; in the simulation, the entrapping of air and the splashing of the surge front of water were reproduced. The mass conservation of the present method was found to be satisfactory during the entire simulation. Copyright © 2011 John Wiley & Sons, Ltd.     

Heterogeneities of grain boundary arrangement in polycrystals

Data on mutual arrangements of different types of grain boundaries in polycrystals are presented. The heterogeneity in grain boundary distribution, namely, the effect of gathering low-angle or special tilt grain boundaries is found in pure aluminum thin films, in sheets of Fe-3% Si alloy and in Al₂O₃ doped with MgO or MgO and Y ₂O₃. The local texture, i.e., formation of colonies or clusters of close-oriented grains is considered as a reason of this heterogeneity. The influences of grain boundary gathering on the transport properties of polycrystals and on the crack propagation are discussed. A new concept of effective grain size is suggested to analyze the relationship between material microstructures and material properties.     

解大型线性方程组的ATOR方法

本文提出了一种数值求解大型稀疏线性方程组Ax=b的具有三个参数的迭代法,我们称之为ATOR法,并且指出,熟知的Jacobi法、Gauss-Seidel法,SOR法,AOR法和TOR法为其特例.同时,我们对具有某些性质的系数矩阵A——Hermite正定矩阵、H-矩阵、L-矩阵和对角占优矩阵,讨论了ATOR法的收敛性以及给出了迭代矩阵谱半径的表达式和上界估计。     

半线性椭圆方程的正解

本文用特征理论及上下解方法,证明了一类半线性椭圆方程边值问题的正解的存在性,同时给出了解的估计.     

A note on adapting methods for continuous global optimization to the discrete case

In this note we show that various branch and bound methods for solving continuous global optimization problems can be readily adapted to the discrete case. As an illustration, we present an algorithm for minimizing a concave function over the integers contained in a compact polyhedron. Computational experience with this algorithm is reported.     

Approximation algorithms for scheduling unrelated parallel machines

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep _ij . The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.A preliminary version of this paper appeared in theProceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science (Computer Society Press of the IEEE, Washington, D.C., 1987) pp. 217–224.