一类广义非扩张映像的不动点定理

在 Ｂａｎａｃｈ空间中讨论一类广义非扩张映像的不动点的存在性和迭代逼近，以及不动点集的性质。     

一类迭代序列Cesaro平均收敛的条件

该文给出了帐篷映射产生的迭代序列Cesaro平均收敛的条件．研究了它与实数二进展式度量性质之间的联系．     

关于极限的几个定理

给出了极限的几个定理及其推论，可以解决或简化某类极限问题。推论2修正了数学通报11（1963）《关于极限的一个定理》。     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

The continuity of superposition operators on some sequence spaces defined by moduli

Let λ and μ be solid sequence spaces. For a sequence of modulus functions Φ = (ϕ k) let λ(Φ) = {x = (x _k ): (ϕk(|x _k |)) ∈ λ}. Given another sequence of modulus functions Ψ = (ψ_k), we characterize the continuity of the superposition operators P _f from λ(Φ) into μ (Ψ) for some Banach sequence spaces λ and μ under the assumptions that the moduli ϕk (k ∈ ℕ) are unbounded and the topologies on the sequence spaces λ(Φ) and μ(Ψ) are given by certain F-norms. As applications we consider superposition operators on some multiplier sequence spaces of Maddox type. This research was supported by Estonian Science Foundation Grant 5376.     

Performance Enhancement for Optical Fast Frequency-hopping CDMA Systems by BCH Channel Coding

In this paper, the impact of optical beat noise on the performance of optical fast frequency-hopping code-division multiple-access (FFH OCDMA) networks is analyzed. BCH/FFH-OCDMA to reduce the impact of optical beat noise is proposed. It is shown that, BCH/FFH-OCDMA has much better performance under the same bit rate, same chip time and same number of available wavelengths. Another advantage for BCH/FFH-OCDMA is that the code length of one-coincidence sequence will be shorter, which can greatly reduce the difficulty of fabrication for fiber gratings.     

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

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

低复杂度序列的维数

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

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.