定理

This paper weakened the Liouville s theorem conditions,and gives the Liouville theorem of a promotion.

弱化了刘维尔定理的条件，给出了刘维尔定理的一个推广。

By employing the local Lipschitz condition and Picard sequence, the local existence-uniqueness of solutions of stochastic functional differential equations of Ito-type is firstly obtained. Furthermore, a continuation theorem for stochastic functional differential equations of Ito-type is given by using stochastic analysis technique and the quasi-boundedness condition. Finally, by establishing some delay differential inequalities and using properties of H_m-functions, a stochastic version of Wintner theorem and the global existence-uniqueness of solutions of stochastic functional differential equations of Ito-type are given. The results generalize the earlier publications.

首先，利用局部Lipschitz条件和Picard序列，获得了伊藤随机泛函微分方程解的局部存在唯一性；其次，利用随机分析技巧和拟有界条件，建立了伊藤随机泛函微分方程解的延拓定理；最后，通过建立一些时滞微分不等式和利用H_m-函数的特性，得到了Wintner定理的随机版本和伊藤随机泛函微分方程解的全局存在唯一性，推广了已有的一些结果。

Firstly, the existence and uniqueness of the solution for neutral stochastic functional differential equations with infinite delay under the uniformly Lipschitz condition, linear grown condition and contractive condition can be directly derived; And the moment estimate of the solution and the estimate for error between the approximate solution and the accurate solution can be both given; If the uniformly Lipschitz condition is replaced by the local Lipschitz condition, the existence and uniqueness theorem can be gained; Meanwhile, the existence and uniqueness of the global solution in the interval 0,+∞ can also be obtained; Secondly, L~p-exponential estimate of the solution for neutral stochastic functional differential equations with infinite delay can be studied; At length, the theorem of the local solution about neutral stochastic functional differential equations with infinite delay only under the local Lipschitz condition and the contractive condition can be established.

首先，在一致Lipschitz条件，线性增长条件和压缩性条件下，直接得到了具无限时滞中立型随机泛函微分方程解的存在惟一性，并给出了解的矩估计，近似解与精确解之间的误差估计；将一致Lipschitz条件替换为局部Lipschitz条件，也得到了具无限时滞中立型随机泛函微分方程解的存在惟—性，同时，也给出了在整个区间0，+∞上具无限时滞中立型随机泛函微分方程解的存在惟一性定理；其次，也讨论了具无限时滞中立型随机泛函微分方程解的L~p指数估计；最后，在局部Lipschitz条件和压缩性条件下，建立了具无限时滞中立型随机泛函微分方程局部解的存在惟一性定理。

Besides, this paper puts forward three concrete methods for simplifying high variable logical function using graphic method.

提出并证明了一个定理，该定理揭示了将高变量逻辑函数转化为低变量逻辑函数并用小卡诺图来化简的一般意义和实用意义。

All the known results about analytic solutions for iterative functional differential equations are obtained by the majorant series and the Banach fixed point theorem.

本文的第三章首先利用不动点定理得到了一类迭代泛函微分方程高阶光滑解的存在性、唯一性和关于已知函数的连续依赖性定理，得到了与常微分方程类似的结论。

The main work and innovation1 In general , a image compression method has different effect to different image . Some are fit for image which has much high frequency . Some are fit for image which has much low frequency .This paper analysis the applicability of fractal algorithm . In this dissertation , an improved algorithum is given . The basic algorithum without eight change and the joint use of quantitative coding , The compression ratio and PSNR can be adjusted , and it can get more quickly speed of coding .2 To a group of exact fractal code , the decoding image can be any resolution .With this characteristic ,choose the proper domain block and range block,this paper get an algorithum which can get higher decoding PSNR and speed than the basic fractal algorithum.3 Give a new method to calculate the scale factor . The calculation of basic algorithum is complex and enormous . The factor of scale is an important variable of the basic algorithm. Now there are two methods to calculate the factor of scale .A new method was given to calculate the factor of scale. The calculation load and complexity are reduced by the new method. Compared with the basic algorithm , the method can reduce coding time.4 The basic fractal algorithum is based on the Collage theorem and contraction mapping theorem . A mathematic model based on basic fractal algorithum is given .

本文的主要工作及创新点主要包括以下几点：1一般情况下，一种图像压缩的方法对不同特点的图像，压缩效果会有所不同，本文利用分形压缩编码对不同特点的图像进行编码，分析了分形编码对不同图像的编码适用性，利用去掉8种变换的分形编码算法与简单的均匀量化编码方案相结合，得到了一种可以调节压缩比与解码质量的分形编码方案，该提高编码速度6倍以上。2分形编码的特点之一是分形解码的分辨率无关性，即对于一组分形编码可以将其解码到任意分辨率下，本文利用分形编码的这一特点，结合不同的量化编码方案，选择合适的定义域块与值域块及适当的编解码分辨率，得到了一种提高解码质量，编码速度提高12倍以上的加速算法。3比例因子是基本分形算法中的一个重要变量，目前有两种计算比例因子的方法，文中给出了一种新的求比例因子的方法，该方法简化了求比例因子的计算，从整体上减小了基本分形算法的计算量，简化了算法4分形压缩的数学基础是不动点定理与拼贴定理，本文根据基本的自动分形编码方法，建立数学模型对其进行推导，得到了用普通数学的极限理论解释分形编码的数学表达式，从而对由基本分形编码得到的解码图像中的像素点的值给出了确定的表达式。

Proposed in the p aper are the ordered monotony property of MFNNs when the transfer function is mo notone, the continuous mapping theorem, and non-approximation theorem to functi on.

给出了单调传递函数的MFNNs按序单调特性、连续映射定理以及非函数一致逼近定理。

This leads to Rees matrix representation theorems of some generalized completely simple semigroups.

本文首先建立了某类U-半超富足半群的Rees矩阵表示定理，并由此得到了若干广义完全单半群的Rees矩阵表示定理。

In this paper,we presented a succinct method to obtain the unitary matrix in the representation transformation by the theorem form,gave the reasonable demonstration,and simultaneously confirmed the theorem accuracy by a concrete example.

以定理的形式给出了表象变换中获得幺正矩阵的一种简洁方法，并给予了合理的证明，同时结合具体实例验证了定理的正确性。

Finally, we give the relations among the Von Neumann regular radicals of generalized matrix ring A, Aji-ring Ajjand ring A.

我们首先讨论了广义矩阵环的根，得到了广义矩阵环的稠密性定理和Wedderburn-Artin定理。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。