神龙一号电子束质心运动测量研究

 在强流直线感应加速器中,电子束质心位置的控制是一项重要技术,要达到较好的控制效果,前提是对电子束质心位置进行准确的测量和定位。针对具有时间分辨的电子束质心位置的测量和确定,介绍了测量实验系统的建立和数据处理两个方面的研究工作。该处理方法在实际应用时能够将电子束质心位置的误差控制在1～2个像素内。用高速分幅相机以10 ns的时间间隔、3 ns的曝光时间获得了神龙一号加速器在漂移段出口处的电子束质心运动情况。结果表明：束的质心主要在半径为0.5 mm的区域内运动,束斑直径dFWHM值分别为8.4,8.8,8.5,9.3和7.6 mm,测量结果可以为束的调控提供准确参数。     

Permutations via linear translators

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [9], we give in several cases the compositional inverse of these permutations. The connection with complete permutations is also utilized to provide further infinite classes of permutations. Moreover, we propose new tools to study permutations of the form $x\mapsto x+{(x^{p^m}-x+\delta )}^s$ and a few infinite classes of permutations of this form are proposed.     

利用近红外及中红外融合技术对小麦产地和烘干程度的同时鉴别

小麦是制作馒头的主要原料之一,小麦中水、蛋白质、淀粉会因产地以及烘干程度的差异而不同,进而影响到加工成馒头的品质。所以实现对小麦产地和烘干程度的快速鉴别就显得尤为重要。感官评定是鉴别小麦产地和烘干程度常用的方法,对比感官评定,光谱分析可以识别样品中的分子结构等信息。基于此,尝试利用近红外和中红外光谱融合技术实现对不同产地和不同烘干程度的小麦同时鉴别。首先选取了两个不同产地的小麦,再利用微波干燥法对两个不同产地的小麦做烘干预处理,使烘干的小麦水含量为12%±0.5%,原麦水含量为18%±0.5%。分别标记为原麦A,烘干A,原麦B,烘干B,再将小麦研磨成粉末,过100目筛网筛选后,置于自封袋中备用。随后分别采集四种小麦样品的近红外和中红外光谱信息,在Matlab 7.10的环境下使用标准正态变量变换(standard normal variable transformation, SNVT)对采集到的原始光谱数据进行预处理,利用主成分分析对预处理后的数据进行降维处理,再结合线性判别分析（linear discriminant analysis,LDA）和支持向量机（support vector machine, SVM）分别建立小麦近红外、中红外光谱数据识别模型。另外利用联合区间偏最小二乘法（synergy interval partial least square, SiPLS）筛选出利用标准正态变量变换(SNVT)预处理后的小麦近红外和中红外光谱数据特征光谱区间,将筛选出的近红外和中红外光谱数据特征光谱区间融合后再结合线性判别分析（LDA）和支持向量机（SVM）建立小麦融合光谱信息的识别模型。然后比较同种光谱数据下利用线性判别分析（LDA）和支持向量机（SVM）建立的小麦识别模型识别率、比较同种建模方法下近红外和中红外光谱数据建立小麦识别模型识别率、比较同种建模方法下光谱数据融合和单一光谱数据建立小麦识别模型识别率。结果表明,同种光谱分析方法,利用SVM建立的四种小麦识别模型识别率高于利用LDA建立的小麦识别模型识别率。同种建模方法,近红外光谱数据建立的小麦识别模型识别率优于中红外光谱数据建立的小麦识别模型识别率。而在同种建模方法下,利用SiPLS筛选出近红外和中红外光谱数据的特征光谱区间数据融合后建立小麦识别模型识别率最高,光谱数据融合后结合LDA建立的小麦识别模型校正集识别率为98.75%,预测集识别率为97.50%;而将此选择的变量结合SVM建立的小麦识别模型的校正集和预测集识别率都达到100.0%。对比利用单一光谱数据建立的小麦识别模型识别率,光谱数据融合之后建立的小麦识别模型识别率得到显著提高,该研究从纵向和横向上全面地比较了光谱数据建立的小麦模型识别率,结果可为更准确地运用光谱融合技术建立小麦产地以及烘干程度识别模型提供参考。     

核实数据下响应变量缺失的线性EV模型经验似然推断

考虑响应变量随机缺失而协变量带有误差的线性模型,借助于核实数据和借补方法,构造了回归系数的两种经验似然比,证明了所提出的估计的经验对数似然比渐近于一个自由度为1的独立χ2变量的加权和;而经调整后所得的调整经验对数似然比渐近于自由度为p的χ2分布,该结果可以用来构造未知参数的置信域.此外,我们也构造了响应均值的调整经验对数似然比统计量,并证明了所提出的统计量渐近于x2分布,可用此结果构造响应均值的置信域.通过模拟研究比较了置信域的精度及其平均区间长度.     

A Boundedness Criterion via Atoms for Linear Operators in Hardy Spaces

Let p∈(0,1] and s≥[n(1/p−1)], where [n(1/p−1)] denotes the maximal integer no more than n(1/p−1). In this paper, the authors prove that a linear operator T extends to a bounded linear operator from the Hardy space H ^p (ℝ ⁿ ) to some quasi-Banach space ℬ if and only if T maps all (p,2,s)-atoms into uniformly bounded elements of ℬ.      

Some number-theoretic identities from group actions

We apply group actions to some natural situations like the natural ‘linear’ action of GL _r (Z _n ) and some of its subgroups to derive number-theoretic identities like

Convergence Analysis of the Inexact Infeasible Interior-Point Method for Linear Optimization

We present the convergence analysis of the inexact infeasible path-following (IIPF) interior-point algorithm. In this algorithm, the preconditioned conjugate gradient method is used to solve the reduced KKT system (the augmented system). The augmented system is preconditioned by using a block triangular matrix. The KKT system is solved approximately. Therefore, it becomes necessary to study the convergence of the interior-point method for this specific inexact case. We present the convergence analysis of the inexact infeasible path-following (IIPF) algorithm, prove the global convergence of this method and provide complexity analysis. Communicated by Y. Zhang.     

加性信号调制下指数形式关联噪声驱动的单模激光的光强关联时间

采用线性化近似,计算了加性信号调制下的由具有指数关联的两白噪声驱动的单模激光增益模型的光强关联时间.发现两噪声间关联程度对光强关联时间随噪声强度的变化曲线有很大的影响,两噪声间关联程度取不同值时,光强关联时间随噪声强度的变化曲线中将出现极大值(即出现共振) 或极小值(即出现抑制) .     

An Asynchronous Distributed Expectation Maximization Algorithm for Massive Data: The DEM Algorithm

The family of expectation--maximization (EM) algorithms provides a general approach to fitting flexible models for large and complex data. The expectation (E) step of EM-type algorithms is time-consuming in massive data applications because it requires multiple passes through the full data. We address this problem by proposing an asynchronous and distributed generalization of the EM called the distributed EM (DEM). Using DEM, existing EM-type algorithms are easily extended to massive data settings by exploiting the divide-and-conquer technique and widely available computing power, such as grid computing. The DEM algorithm reserves two groups of computing processes called workers and managers for performing the E step and the maximization step (M step), respectively. The samples are randomly partitioned into a large number of disjoint subsets and are stored on the worker processes. The E step of DEM algorithm is performed in parallel on all the workers, and every worker communicates its results to the managers at the end of local E step. The managers perform the M step after they have received results from a γ-fraction of the workers, where γ is a fixed constant in (0, 1]. The sequence of parameter estimates generated by the DEM algorithm retains the attractive properties of EM: convergence of the sequence of parameter estimates to a local mode and linear global rate of convergence. Across diverse simulations focused on linear mixed-effects models, the DEM algorithm is significantly faster than competing EM-type algorithms while having a similar accuracy. The DEM algorithm maintains its superior empirical performance on a movie ratings database consisting of 10 million ratings. Supplementary material for this article is available online.