基于Logistic映射的图像保密通信

将Logistic映射产生的混沌序列作为载波，利用序列具有的良好相关特性，提出了一种图像保密通信方案。计算机仿真结果表明，只要收发双方使用相同的初值条件，即使在有一定噪声的情况下也能正确地进行图像传输，而初值的微小差异将导致通信失败，表明混沌序列用于保密通信具有很高的安全性能，同时方案具有很强的抗干扰能力。对图像恢复质量进行了评估，并给出了误比特率与码片长度的经验公式。     

碱抽提强化的麦草浆ClO2漂白及ECF漂白流程

采用常规碱抽提(E)、氧加强的碱抽提(EO)、H2O2强化的碱抽提(EP)、氧和H2O2强化的碱抽提(EOP)对ClO2脱木素(D0)麦草浆进行改性,考查不同碱抽提方式的改性效果在后续漂段(D1)的体现,并就不同无元素氯(ECF)漂白流程(D0ED1、D0P、D0A/QP、D0EP、D0EPD1、D0EPP)进行对比.结果表明:不同碱抽提方式对D0浆木素的改性效果不同,就对后续漂段D1的影响而言,4种不同碱抽提方式下纸浆的可漂性顺序为D0EOPD0EPD0EOD0E;在4种碱抽提方式所对应的D0ED1漂白流程中,D1段ClO2用量的增加对白度的提升是有限的,以0.8%~1.0%为佳;D0EPD1和D0EPP流程漂白效果优于其它流程,采用D0EPD1和D0EPP流程漂后白度可分别达到82.3%ISO和83.8%ISO,均适用于麦草浆短序ECF漂白.     

Remark on the well-posedness of the problem of minimization of integral functionals

In this note, we study the well-posedness of the problem of constrained minimization of an integral functional and show that global well-posedness is equivalent to pointwise well-posedness almost everywhere. Our result extends an earlier one by Zolezzi.This research was supported by NSF Grant No. DMS 88-02688.     

Second-Order Subexponential Behavior of Subordinated Sequences

Suppose that , , and are three discrete probability distributions related by the equation (E): , where denotes the k-fold convolution of In this paper, we investigate the relation between the asymptotic behaviors of and . It turns out that, for wide classes of sequences and , relation (E) implies that , where is the mean of . The main object of this paper is to discuss the rate of convergence in this result. In our main results, we obtain O-estimates and exact asymptotic estimates for the difference .     

A Generalization of the Hilbert Basis Theorem

A generalization of the Hilbert basis theorem in the geometric setting is proposed. It asserts that, for any well-describable (in a certain sense) family of polynomials, there exists a number C such that if P is an everywhere dense (in a certain sense) subfamily of this family, a is an arbitrary point, and the first C polynomials in any sequence from P vanish at the point a, then all polynomials from P vanish at a.     

A NEW FAMILY OF BINARY SEQUENCES WITH OPTIMAL AUTOCORRELATION VALUES AND NICE PSEUDO-RANDOM PROPERTIES

In this paper we present a series of binary sequences which is a generalization of GMW sequences constructed by Scholtz and Welch. Our sequences have optimal autocorrelation values as m -sequences, and nice pseudo-random property. The number of such sequences is counted and the linear span of such sequences is evaluated.     

含k-次增生算子的Ishikawa迭代的收敛性问题

主要研究了非线性方程x Tx=f的Ishikawa迭代解．其中T为k-次增生的或增生的，并在一致光滑和任意的实Banach空间分别研究了上述方程的带误差的Ishikawa迭代解，从而推广了已知的一些结果。     

Simple Constructions of Almost k-wise Independent Random Variables

We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity.     

Strong tractability of multivariate integration using quasi-Monte Carlo algorithms

We study quasi-Monte Carlo algorithms based on low discrepancy sequences for multivariate integration. We consider the problem of how the minimal number of function evaluations needed to reduce the worst-case error from its initial error by a factor of depends on and the dimension . Strong tractability means that it does not depend on and is bounded by a polynomial in . The least possible value of the power of is called the -exponent of strong tractability. Sloan and Wozniakowski established a necessary and sufficient condition of strong tractability in weighted Sobolev spaces, and showed that the -exponent of strong tractability is between 1 and 2. However, their proof is not constructive.

In this paper we prove in a constructive way that multivariate integration in some weighted Sobolev spaces is strongly tractable with -exponent equal to 1, which is the best possible value under a stronger assumption than Sloan and Wozniakowski's assumption. We show that quasi-Monte Carlo algorithms using Niederreiter's -sequences and Sobol sequences achieve the optimal convergence order for any 0$"> independent of the dimension with a worst case deterministic guarantee (where is the number of function evaluations). This implies that strong tractability with the best -exponent can be achieved in appropriate weighted Sobolev spaces by using Niederreiter's -sequences and Sobol sequences.