解线性最小二乘问题的一个新并行算法

讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 )     

Characterization of a 4-miktoarm star copolymer of the (PS-b-PI)3 PS type by temperature gradient interaction chromatography

Temperature gradient interaction chromatography (TGIC) was applied for the separation of a complex miktoarm star copolymer which has one polystyrene (PS) arm and three polystyrene-b-polyisoprene (PS-b-PI) diblock copolymer arms. Such miktoarm star polymers are much more difficult to characterize than branched homopolymers since the byproduct, typically polymers with missing arm(s) or coupled products, have not only different molecular weights but also different compositions. TGIC was able to fully separate the byproducts, and the composition of the molecular species corresponding to the different separated elution peaks was determined by two methods, fractionation/NMR and multiple detection (UV and RI). A reasonable agreement between the results of the two methods was obtained. By using the composition found, the corresponding molecular weights were determined by multi-angle light scattering detection. Based on the composition and the molecular weight we were able to identify the structure of the different molecular species.     

带惩罚项与随机输入的BP神经网络在线梯度学习算法的收敛性

本文对三层BP神经网络中带有惩罚项的在线梯度学习算法的收敛性问题进行了研究,在网络训练每一轮开始执行之前,对训练样本随机进行重排,以使网络学习更容易跳出局部极小,文中给出了误差函数的单调性定理以及该算法的弱收敛和强收敛性定理。     

基于MMD算法的HMM参数重估计的矩阵表示

本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力．利用该算法在对模型的参数进行重估计时．涉及到复杂的目标函数的梯度运算．击运用矩阵运算使得梯度运算变得简单明了，因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明．     

Geometry of an Accelerated Rotating Disk

We analyze the geometry of a rotating disk with a tangential acceleration in the framework of the theory of Special Relativity, using the kinematic linear differential system that verifies the relative position vector of time-like curves in a Fermi reference. A numerical integration of these equations for a generic initial value problem is made up and the results are compared with those obtained in other works.     

Numerical Modeling of Interior Ballistics Processes in Light Gas Guns

An improved procedure for modeling the operation of a light-gas gun is proposed. The motion of working bodies in both the firing chamber and the light-gas chamber is studied within the framework of the mechanics of heterogeneous media. The problem of barrel heating taking into account its melting and removal of thermal ablation products into the medium inside the bore is solved in a coupled formulation. Heat and mass transfer and friction on the barrel surface are calculated using empirical dependences. The deformable piston is considered compressible and elastoviscoplastic. Allowance is made for the presence of a clearance between the lateral surface of the piston and the barrel bore walls and the associated gas flow between the firing and the light-gas chamber. Calculation results are given.     

应用自动微分的Newton-PCG算法

一类新的使用符号微分的Newton-PCG型算法在文献[1]和[2]被导出来了。本文建立和研究应用自动微分的相应的Newton-PCG算法，理论分析和数值实验结果显示应用自动微分之后，目标函数的维数或复杂性越大，Newton-PCG算法对Newton法的改进越显著。     

On the influence of the surfactant''s polar group on the local and terminal velocities of bubbles

The local and the terminal velocities, the size and the degree of bubbles’ shape deformations were determined as a function of distance from the position of the bubble formation (capillary orifice) in solutions of n-octyltrimethylammonium bromide, n-octyldimethylphosphine oxide, n-octyl-β-D-glucopyranoside and n-octanoic acid.

These surface-active compounds have different polar groups but an identical hydrocarbon chain (C8) in the molecule. The motion of the bubbles was monitored and recorded using a stroboscopic illumination, a CCD camera, and a JVC professional video. The recorded bubble images were analyzed by the image analysis software. The bubbles accelerated rapidly and their shape was deformed immediately after detachment from the capillary. The extent of the bubbles’ shape deformation (ratio of horizontal and vertical diameters) was 1.5 in distilled water and dropped rapidly down to a level of ca. 1.05–1.03 with increasing surfactant concentration. After the acceleration period the bubbles either attained a constant value of the terminal velocity (distilled water and high concentrations of the solutions), or a maximum in the velocity profiles was observed (low concentrations). The values of the terminal velocity diminished drastically with increasing concentration, from the value of 35 cm/s in water down to about 15 cm/s, while the bubble diameter decreased by ca. 10% only. The surfactant adsorption at the surface of the bubbles was evaluated and the minimum adsorption coverages required to immobilize the bubbles’ surface were determined. It was found that this minimum adsorption coverage was ca. 4% for n-octyldimethylphosphine oxide, n-octyl-β-D-glucopyranoside, n-octanoic acid and 25% for n-octyltrimethylammonium bromide. The difference in the adsorption coverage together with the surfactants’ surface activities indicate that it is mainly the adsorption kinetics of the surfactants that governs the fluidity of interfaces of the rising bubbles.     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.