对规范粒子极化矢量的一些讨论

对规范粒子的极化矢量做了较为系统的论述. 讨论内容包括极化矢量的具体形式和性质、求和规则和规范传播子之间的关系以及由其张成的投影算子的性质. 通过若干精选的例子, 进一步演示了计算牵涉规范粒子的过程时采用的基本方法和应当注意事项.     

JLab Hall-A上小角度GDH实验中的粒子鉴别及其效率

在JLab的A大厅上的小角度GDH实验中, 因为散射截面及截面不对称度的测量需要干净的电子样本和足够的事例统计, 径迹在簇射量能器和气体阈契仑柯夫探测器理的信息被用来完成粒子鉴别的任务. 通过优化粒子在两种探测器里的信息筛选条件, 可以得到较高的电子接收效率和π的去除能力. 因为探测器的分辨能力与粒子的动量等运动学参量有关, 所以对于不同的数据的粒子鉴别条件分别进行了优化, 并得到了对应的电子接收效率和π的去除能力.     

了解积分——求和

求一个函数的黎曼积分,实际上就是一个分割、近似代替、求和、取极限的过程.求和运算是整个积分计算的轴心.就积分四部曲中的求和问题,做一个一般性的讨论.文中使用的是分析和讨论的语言,不去追求数学语言本身的严格性.目的不仅是探讨求和这个步骤,在黎曼积分意义下具体实现的过程和隐含的内容,而且对一般的积分中的求和实现的可能性、应该满足的条件、实现的过程,以及应该注意那些基本问题,也做一点儿逻辑上的探讨.已达到以知识为媒介,提高认知能力的目的.     

PSP对癌症病人化/放疗毒性反应的数据统计分析

按WHO抗癌药急性及亚急性毒性分级标准 ,对 650例化、放疗肿瘤患者分别作了治疗前后毒性反应的总分值统计。结果加服PSP组 ( 557例 )的疗后总分值为837,低于疗前的 962 ;而 93例阳性对照组 (加服鲨肝醇 )疗前总分为 157,疗后为 2 4 1,疗后总分高于疗前。用Wilcoxon两样本秩和统计法检验 ,PSP组和对照组间具有极显著差异 ,表明PSP对比、放疗药物引起的毒副反应有明显降低效应。     

A degree sum condition for long cycles passing through a linear forest

Let G be a (k+m)-connected graph and F be a linear forest in G such that |E(F)|=m and F has at most k-2 components of order 1, where k?2 and m?0. In this paper, we prove that if every independent set S of G with |S|=k+1 contains two vertices whose degree sum is at least d, then G has a cycle C of length at least min{d-m,|V(G)|} which contains all the vertices and edges of F.     

关于组合交错和的渐近性

所谓的Rice’s方法是估计交错和Df_n=sum from k=0 to n(_k~n)(-1)~kf_k,其中,序列f_n能扩充为一个解析函数f(n).在算法分析的许多问题中,经常导出序列Df_n.在60年代,Knuth在分类交换基     

Degree sum and nowhere-zero 3-flows

Let G be a simple graph on n vertices. In this paper, we prove that if G satisfies the condition that d(x)+d(y)≥n for each xy∈E(G), then G has no nowhere-zero 3-flow if and only if G is either one of the five graphs on at most 6 vertices or one of a very special class of graphs on at least 6 vertices.     

WEIGHTED NONLINEAR REGRESSION

Minimization of the weighted nonlinear sum of squares of differences may be converted to the minimization of sum of squares. The Gauss-Newton method is recalled and the length of the step of the steepest descent method is determined by substituting the steepest descent direction in the Gauss-Newton formula. The existence of minimum is shown.     

On RSA moduli with almost half of the bits prescribed

We show that using character sum estimates due to H. Iwaniec leads to an improvement of recent results about the distribution and finding RSA moduli M=pl, where p and l are primes, with prescribed bit patterns. We are now able to specify about n bits instead of about n/2 bits as in the previous work. We also show that the same result of H. Iwaniec can be used to obtain an unconditional version of a combinatorial result of W. de Launey and D. Gordon that was originally derived under the Extended Riemann Hypothesis.     

Modified constructions of binary sequences using multiplicative inverse

Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.