Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered...     

一种改进的自适应模糊阈值图象分割方法

自适应模糊阈值图象分割方法的关键和困难在于隶属函数窗宽的自动调整和阈值搜索范围的确定.依靠图象灰度的统计特性初步确定阈值搜索范围，提出了一种改进方法，进而得到隶属函数的窗宽.实验表明这种方法避免了确定图象灰度直方图峰位置的困难，对较低亮度图象分割效果良好.     

Compactness in fuzzy convergence spaces

Lowen and Lowen [Applications of category theory to fuzzy subsets (Kluwer, 1992) p. 153] and Lowen et al. [Fuzzy Sets and Systems 40 (1991) 347] recently introduced the category FCS of fuzzy convergence spaces, a topological quasitopos which is a supercategory of FTS, the category of fuzzy topological spaces. In this paper, compactness in FCS is examined. Doing so we found that to define compactness as an absolute property we had to generalize the definition of fuzzy convergence space to fuzzy subsets. All basic theorems are proved including the Tychonoff product theorem. Based on the theory developed here, in a following publication, a Richardson compactification for fuzzy convergence spaces will be given.     

Max—min神经网络的一种有效学习算法

本文在Ａ．Ｂｌａｎｃｏ等人的算法的基础上，提出了ｍａｘ－ｍｉｎ神经网络的一种改进了的反馈学习算法，严格证明了该算法的迭代收敛性，理论分析及实例计算结果均表明，本文算法具有算法简单，收敛速度快，输出误差小等显著特点。     

On the law S ( S ( x , y ), T ( x , y )) = S ( x , y ) of fuzzy logic

Motivated by some functional models arising in fuzzy logic, when classical boolean relations between sets are generalized, we study the functional equation S(S(x, y), T(x, y)) = S(x, y), where S is a continuous t-conorm and T is a continuous t-norm. Some interesting methods for solving this type of equations are introduced.     

Neuro-fuzzy approach to processing inputs with missing values in pattern recognition problems

An approach to dealing with missing data, both during the design and normal operation of a neuro-fuzzy classifier is presented in this paper. Missing values are processed within a general fuzzy min–max neural network architecture utilising hyperbox fuzzy sets as input data cluster prototypes. An emphasis is put on ways of quantifying the uncertainty which missing data might have caused. This takes a form of classification procedure whose primary objective is the reduction of a number of viable alternatives rather than attempting to produce one winning class without supporting evidence. If required, the ways of selecting the most probable class among the viable alternatives found during the primary classification step, which are based on utilising the data frequency information, are also proposed. The reliability of the classification and the completeness of information is communicated by producing upper and lower classification membership values similar in essence to plausibility and belief measures to be found in the theory of evidence or possibility and necessity values to be found in the fuzzy sets theory. Similarities and differences between the proposed method and various fuzzy, neuro-fuzzy and probabilistic algorithms are also discussed. A number of simulation results for well-known data sets are provided in order to illustrate the properties and performance of the proposed approach.     

A parametric representation of linguistic hedges in Zadeh’s fuzzy logic

This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced.     

基于SPA的双枝模糊决策分析

将集对理论(SPA)与双枝模糊决策理论相结合,用集对分析的方法研究进行双枝模糊决策的方法,分别对双枝模糊决策因素域和双枝模糊决策的上枝、下枝和双枝进行了集对分析,给出了用SPA进行双枝模糊决策的性质,同时讨论了双枝模糊决策的动态分析方法,以及双枝模糊决策度强弱态势预测的方法,从而为双枝模糊决策理论的研究提供了新的视角和方法,为双枝模糊决策的应用提供了更方便的工具和更强的理论支持。     

Interpreting Observables in a Quantum World from the Categorial Standpoint

We develop a relativistic perspective on structures of quantum observables, in terms of localization systems of Boolean coordinatizing charts. This perspective implies that the quantum world is comprehended via Boolean reference frames for measurement of observables, pasted together along their overlaps. The scheme is formalized categorically, as an instance of the adjunction concept. The latter is used as a framework for the specification of a categorical equivalence signifying an invariance in the translational code of communication between Boolean localizing contexts and quantum systems. Aspects of the scheme semantics are discussed in relation to logic. The interpretation of coordinatizing localization systems, as structure sheaves, provides the basis for the development of an algebraic differential geometric machinery suited to the quantum regime.     

非线性守恒方程的两种稳定化谱元方法

考虑非线性守恒方程的高阶数值解法,介绍了基于谱元法的两种稳定性方法,一种是谱粘性消去法(SVV),另一种是过滤法.在SVV方法中,我们推广并分析了传统的基于单区域的SVV算子的定义.在过滤法中,我们分析了SVV-H elm holtz过滤算子的性质.文中从分析和计算两方面对两种方法进行了比较,建立了两者之间的关系.最后通过一系列数值试验说明方法的有效性.