The evolution of a truncated gaussian probability density through time—modelling animal liveweights after selection

The form of the probability density derived from the evolution in time of a previously truncated frequency distribution of animal Liveweights is of interest in animal husbandry. Truncated frequency distributions arise when the heavier animals are sold for slaughter and the lighter animals retained. The demands of modern quality assurance schemes require that, given information on animal growth, the farmer is able to estimate the number of animals that would meet the specifications at some time in the future after truncation. Assuming that animal growth can be described by a linear stochastic differential equation, we derive an explicit expression for the probability density of animal Liveweights at any time after the truncation of an initial Gaussian density. It is shown that this probability density converges rapidly to a Gaussian density, so that after about 20 days of typical growth rates for lambs, the resulting density is practically indistinguishable from Gaussian.     

脉冲充磁的超导圆盘的电流密度和俘获场分布的研究

本从第一性原理出发，计算了充磁线圈产生的磁场，脉冲充磁的超导圆盘中的感应电流密度和俘获场分布．以超导体中的电流运动方程为基础，通过磁通动力学方程E=Ec(J/Jc)^n和物质方程B=μ0H表示超导圆盘的超导特性．计算表明第一个脉冲充磁电流的峰值和磁通蠕动指数对于超导圆盘中的感应电流分布非常重要．同时研究了充磁电流的宽度，波形，第二个充磁电流的峰值和充磁线圈的形状对于俘获场的影响．计算表明不断减小脉冲充磁电流峰值的反复充磁可以保持超导圆盘中的感应电流密度的平台在一确定水平．     

单调全局最优化问题的凸化外逼近算法

单调优化是指目标函数与约束函数均为单调函数的全局优化问题．本文提出一种新的凸化变换方法把单调函数化为凸函数，进而把单调优化问题化为等价的凸极大或凹极小问题，然后采用Hoffman的外逼近方法来求得问题的全局最优解．我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较，通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法．     

BIFURCATIONS OF ROUGH 3—POINT—LOOP WITH HIGHER DIMENSIONS

The authors study the bifurcation problems of rough heteroclinic loop connecting three saddle points for the case β1 > 1, β2 > 1, β3 < 1 and β1β2β3 < 1. The existence, number, coexistence and incoexistence of 2-point-loop, 1-homoclinic orbit and 1-periodic orbit are studied. Meanwhile, the bifurcation surfaces and existence regions are given.     

反对称正交对称矩阵反问题

本文讨论一类反对称正交对称矩阵反问题及其最佳逼近．研究了这类矩阵的一些性质，利用这些性质给出了反问题解存在的一些条件和解的一般表达式，不仅证明了最佳逼近解的存在唯一性，而且给出了此解的具体表达式．     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

Pseudo-Strong Regularity Around a Set

A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ.     

F／Cl比与Eu~（2＋）：BaFCl中F色心的浓度和光激励截面的关系

研究了Ｅｕ（２＋）：ＢａＦｘＣｌ２在紫外线辐照下的光激励发光。通过改变激励方式及激励光的扫描方向，给出了Ｅｕ（２＋）：ＢａＦｘＣｌ２－ｘ光激励发光过程中，两种Ｆ色心的浓度比值与光激励截面比值的测定方法。利用这种测定方法，进一步研究了两种Ｆ色心的浓度比值和光激励截面比值与Ｆ／ＣＩ比值的关系。     

一类新的插值结点

有界单连通区域Ｇ，其边界θＧ＝Г∈（１，α），α〉０。本计算节以广义Ｆａｂｅｒ多项式φｎ（ｚ）的零点为插值结点的Ｌａｇｒａｎｇｅ插值多项式的逼近性质，得到了它对Ａ（Ｇ↑－）中的函数的一致逼近阶和平均逼近阶的估计，并且得到了它对Ｅ＾ｐ（Ｇ）中函数的平均逼近阶的估计，还指出关于平均逼近阶的估计是不可改进的。