逻辑度量空间

取赋值格为［０，１］，用积分工具引入了公式的真度和相似度的概念，并从而在公式集Ｆ上建立了伪距离，为近似推理提供了一种可能的框架．  

剩余格与正则剩余格的特征定理

本文进一步研究了具有广泛应用的一类模糊逻辑代数系统——剩余格，并引入了正则剩余格的概念，对剩余格与正则剩余格的定义进行了讨论，给出了剩余格与正则剩余格的特征定理，其中包含剩余格与正则剩余格的等式特征，从而这两个格类都构成簇．本文还讨论了剩余格与正则剩余格公理系统的独立性，以及它们与相近代数结构的关系．  

A filled function method for finding a global minimizer of a function of several variables

The concept of a filled function is introduced. We construct a particular filled function and analyze its properties. An algorithm for global minimization is generated based on the concept and properties of the filled function. Some typical examples with 1 to 10 variables are tested and computational results show that in most cases this algorithm works better than the tunneling algorithm. The advantages and disadvantages are analyzed and further research directions are discussed.  

H矩阵的判定

１引言在矩阵分析中，Ｈ矩阵是目前研究的热门课题之一，这主要是因为它的实际应用性很强。对于线性方程组ＡＸ＝ｂ，当系数矩阵Ａ为Ｈ矩阵时，许多经典的迭代算法均是收敛的，同时对目前提出的一些修正算法也是收敛的。在目前已给出的Ｈ矩阵的判定条件中，因许多条件本身的表现形式及其计算比较复杂，致使在实际应用中不便操作，因此寻找一个行之有效且易于计算的判定条件是非常有意义的。但是，至今这种尝试仍有待进一步解决。本文是在文［１］的基础上讨论了Ｈ矩阵的判定条件，扩展了适用范围，同时也给出一种排Ｈ矩阵的判定条件．２符号…  

Smarandache函数的值分布性质

对于给定的自然数n,著名的Smarandache函数S(n)定义为S(n)=min{m: m∈N,n|m!|.本文主要目的是利用初等方法研究S(n)的值分布性质,并给出了一些有趣的渐近公式．  

蕴涵格及其Fuzzy拓扑表现定理

以L－Lindenbaum代数为背景，引入了蕴涵格与正则蕴涵格的概念，讨论了其基本性质，引入了Fuzzy蕴涵空间的概念，为点集拓扑学中零维空间概念的推广．建立了正则蕴涵格的Fuzzy蕴涵空间表现定理，以此为基础可以给出著名的Stone表现定理的另一种证明．  

关于 Dirichlet L-函数的一次加权均值

利用三角和估计及其解析方法研究DirichletL函数的一次加权均值,得到了一个较为精确的渐近公式.  

Theory of truth degrees of propositions in two-valued logic

By means of infinite product of evenly distributed probabilistic spaces of cardinal 2 this paper introduces the concepts of truth degrees of formulas and similarity degrees among formulas, and a pseudo-metric on the set of formulas is derived therefrom, this offers a possible framework for developing an approximate reasoning theory of propositions in two-valued logic.  

(N)模糊积分

本文定义了一种新的模糊积分,它较[2]所定义的模糊积分与Lebesgue积分有更多的相似之处。特别是作为人类思维过程的模拟,较[2]更切近于实际。文中研究了这种积分的性质,证明了类似Lebesgue积分中Levi定理、Fatou定理等关于积分序列的收敛性定理,给出了把一般的模糊测度空间上的(N)模糊积分转化为R¹上以Lebesgue测度为模糊测度的(N)模糊积分的公式。§4中引进了一类特殊的所谓λ次可加模糊测度空间,给出了这种测度空间上收敛性的Егоров定理和Riesz定理并得到了该空间上的(N)模糊积分在积分号下取极限的一些充分条件。  

A Trigonometric Mutation Operation to Differential Evolution

Previous studies have shown that differential evolution is an efficient, effective and robust evolutionary optimization method. However, the convergence rate of differential evolution in optimizing a computationally expensive objective function still does not meet all our requirements, and attempting to speed up DE is considered necessary. In this paper, a new local search operation, trigonometric mutation, is proposed and embedded into the differential evolution algorithm. This modification enables the algorithm to get a better trade-off between the convergence rate and the robustness. Thus it can be possible to increase the convergence velocity of the differential evolution algorithm and thereby obtain an acceptable solution with a lower number of objective function evaluations. Such an improvement can be advantageous in many real-world problems where the evaluation of a candidate solution is a computationally expensive operation and consequently finding the global optimum or a good sub-optimal solution with the original differential evolution algorithm is too time-consuming, or even impossible within the time available. In this article, the mechanism of the trigonometric mutation operation is presented and analyzed. The modified differential evolution algorithm is demonstrated in cases of two well-known test functions, and is further examined with two practical training problems of neural networks. The obtained numerical simulation results are providing empirical evidences on the efficiency and effectiveness of the proposed modified differential evolution algorithm.