液体可视图象序列中杂质小目标的检测方法

在分析红外图象和视图象差异的基础上，研究了一种适用于可视图像序列的运动小目标检测算法。受目标影响的象素点具有较弱的时间相关性，即相对普通象素点有较大的时间方差，根据此特征，用管道更新的方法产生新方差图象序列，再用管道更新的方法累积，增加信噪比，然后用基于统计均值的自适应门限方法分割出目标，最后将原图象的梯度倒数作为象素点强度的加权，有效地抑制灰度突变边界的传感器噪音，保存目标点。     

低复杂度序列的维数

本文研究符号空间中由零拓扑熵序列组成的集合.通过构造适当的自相似集,证明了该集合的盒维数为1,而Hausdorff维数为0.     

球面稳定同伦群中的一个新元素族$b_1g_0\tilde{\gamma}_s$

设$p\geq 7$素数,$A$为模$p$的Steenrod代数. 我们利用Adams谱序列证明了球面稳定同伦群$\pi_{\ast}S$中,存在由$b_1g_0\tilde{\gamma}_{s}\in Ext_A^{s+4,(s+1)p^2q+spq+sq+s-3}(Z_p,Z_p)$所表示的新的非平凡元素族,其中$q=2(p-1)$, $3\leq s相似文献   

Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments

The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.     

纵横扩张的优化

得到了最小折数纵横扩张的判别准则．针对4-正则图的平面嵌入的纵横扩张的特殊性，给出了它的最小折数纵横扩张判别准则．     

On the spectral sequence constructors of Guichardet and Stefan

The concept of a spectral sequence constructor is generalised to Hopf Galois extensions. The spectral sequence constructions that are given by Guichardet for crossed product algebras are also generalised and shown to provide examples. It is shown that all spectral sequence constructors for Hopf Galois extensions construct the same spectral sequence.     

马科维兹资产组合选择模型的旋转算法

提出线性不等式组的一种旋转算法，并用其求解马科维兹资产组合选择模型，此算法每次迭代约需n^2次乘法和加法，其中n是模型中变量的数目，在微机上运行Delphi程序的实验结果表明，从上海和深圳股市1072支股票70期周末收盘价计算出20个最优投资组合仅需314次迭代和45s。     

Slutsky定理在样本分位数的极限分布证明上的应用

为了更好地理解和应用样本分位数的极限分布,利用Slutsky定理,推导了样本分位数的极限分布.     

独立不同分布随机变盆序列的部分和的增量有多小

关于独立同分布随机变量部分和的增量有多小问题，目前已有了著名的结果.本文通过与独立同分布情形时完全不同的途径，讨论了独立不同分布情形时相应的问题.在矩母函数存在的条件下，获得了与同分布情形相近的结论.