模糊Rabin自动机和模糊Game自动机的等价性

自动机是理论计算机的一个重要的研究内容.模糊Rabin自动机和模糊Game自动机是经典自动机的延续,给出了模糊Rabin自动机和模糊Game自动机的相关定义,讨论各自的内在性质,并得到了二者的等价关系.这进一步丰富了模糊自动机理论.     

Well-Defined Fuzzy Sentential Logic

A many-valued sentential logic with truth values in an injective MV-algebra is introduced and the axiomatizability of this logic is proved. The paper develops some ideas of Goguen and generalizes the results of Pavelka on the unit interval. The proof for completeness is purely algebraic. A corollary of the Completeness Theorem is that fuzzy logic on the unit interval is semantically complete if and only if the algebra of the truth values is a complete MV-algebra. In the well-defined fuzzy sentential logic holds the Compactness Theorem, while the Deduction Theorem and the Finiteness Theorem in general do not hold. Because of its generality and good-behaviour, MV-valued logic can be regarded as a mathematical basis of fuzzy reasoning.     

The fuzzy intersection rule in variational analysis with applications

The fuzzy intersection rule for Fréchet normal cones in Asplund spaces was established by Mordukhovich and the author using the extremal principle, which appears more convenient to apply in some applications. In this paper, we present a complete discussion of this rule in various aspects. We show that the fuzzy intersection rule is another characterization of the Asplund property of the space. Various applications are considered as well. In particular, a complete set of fuzzy calculus rules for general lower semicontinuous functions are established.     

模糊自动机的强连通性及群自动机

为了更好地研究模糊自动机的结构和性质,采用代数的方法,在传统的模糊有限状态自动机的基础上,通过定义状态集合为代数群的自动机,讨论了这一类自动机的连通性和正则性,这丰富了模糊自动机理论．     

Bisimulations for fuzzy automata

Bisimulations have been widely used in many areas of computer science to model equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the study of equivalence between fuzzy automata. We prove that a uniform fuzzy relation between fuzzy automata A and B is a forward bisimulation if and only if its kernel and co-kernel are forward bisimulation fuzzy equivalence relations on A and B and there is a special isomorphism between factor fuzzy automata with respect to these fuzzy equivalence relations. As a consequence we get that fuzzy automata A and B are UFB-equivalent, i.e., there is a uniform forward bisimulation between them, if and only if there is a special isomorphism between the factor fuzzy automata of A and B with respect to their greatest forward bisimulation fuzzy equivalence relations. This result reduces the problem of testing UFB-equivalence to the problem of testing isomorphism of fuzzy automata, which is closely related to the well-known graph isomorphism problem. We prove some similar results for backward-forward bisimulations, and we point to fundamental differences. Because of the duality with the studied concepts, backward and forward-backward bisimulations are not considered separately. Finally, we give a comprehensive overview of various concepts on deterministic, nondeterministic, fuzzy, and weighted automata, which are related to bisimulations.     

Abstract Logics, Logic Maps, and Logic Homomorphisms

What is a logic? Which properties are preserved by maps between logics? What is the right notion for equivalence of logics? In order to give satisfactory answers we generalize and further develop the topological approach of [4] and present the foundations of a general theory of abstract logics which is based on the abstract concept of a theory. Each abstract logic determines a topology on the set of theories. We develop a theory of logic maps and show in what way they induce (continuous, open) functions on the corresponding topological spaces. We also establish connections to well-known notions such as translations of logics and the satisfaction axiom of institutions [5]. Logic homomorphisms are maps that behave in some sense like continuous functions and preserve more topological structure than logic maps in general. We introduce the notion of a logic isomorphism as a (not necessarily bijective) function on the sets of formulas that induces a homeomorphism between the respective topological spaces and gives rise to an equivalence relation on abstract logics. Therefore, we propose logic isomorphisms as an adequate and precise notion for equivalence of logics. Finally, we compare this concept with another recent proposal presented in [2]. This research was supported by the grant CNPq/FAPESB 350092/2006-0.     

Sequential fuzzy system identification

The problem of deriving the structure of a non-deterministic system from its behaviour is a difficult one even when that behaviour is itself well-defined. When the behaviour can be described only in fuzzy terms structural inference may appear virtually impossible. However, a rigorous formulation and solution of the problem for stochastic automata has recently been given [1] and, in this paper, the results are extended to fuzzy stochastic automata and grammars. The results obtained are of interest on a number of counts. (1) They are a further step towards an integrated ‘theory of uncertainty’; (2) They give new insights into problems of inductive reasoning and processes of ‘precisiation’; (3) They are algorithmic and have been embodied in a computer program that can be applied to the modelling of sequential fuzzy data; (4) They demonstrate that sequential fuzzy data may be modelled naturally in terms of ‘possibility’ vectors.     

Fuzzy neural network modeling for product development

A fairly general product development model is formulated and analyzed based on multiple attribute decision making with emphasis on the treatment of the linguistic and vague aspects by fuzzy logic and up-dating or learning by neural network. Due to the representative ability of fuzzy set theory and the learning or intelligent ability of neural network, the proposed approaches appear to be an effective tool for handling vague and not well-defined systems.     

Applications of fuzzy logic in the control of robotic manipulators

Fuzzy logic has been utilized at several hierarchical levels of a typical robotic control system. Four broad levels of application may be identified - task design, system monitoring (including self-tuning and self-organization), information filtering and preprocessing, and in-loop direct control. Even though the need for fuzzy logic is felt mostly at upper levels of the control system, the present applications are mainly concentrated within the lowest level, perhaps driven by convenience rather than necessity. This paper surveys several applications of fuzzy logic in the control of robotic manipulators. Applications are grouped into four hierarchical categories, broadly corresponding to an existing architecture of a robotic control system. Such a classification can be beneficial in ascertaining the appropriateness of fuzzy logic for the specific control task.     

Approximations by linear operators in spaces of fuzzy continuous functions

In this work, we further develop the Korovkin-type approximation theory by utilizing a fuzzy logic approach and principles of neoclassical analysis, which is a new branch of fuzzy mathematics and extends possibilities provided by the classical analysis. In the conventional setting, the Korovkin-type approximation theory is developed for continuous functions. Here we extend it to the space of fuzzy continuous functions, which contains a great diversity of functions that are not continuous. Furthermore, we give several applications, demonstrating that our new approximation results are stronger than the classical ones.     

A cloud computing based Big-Bang Big-Crunch fuzzy logic multi classifier system for Soccer video scenes classification

Soccer video summarization and classification is becoming a very important topic due to the world wide importance and popularity of soccer games which drives the need to automatically classify video scenes thus enabling better sport analysis, refereeing, training, advertisement, etc. Machine learning has been applied to the task of sports video classification. However, for some specific image and video problems (like sports video scenes classification), the learning task becomes convoluted and difficult due to the dynamic nature of the video sequence and the associated uncertainties relating to changes in light conditions, background, camera angle, occlusions and indistinguishable scene features, etc. The majority of previous techniques (such as SVM, neural network, decision tree, etc.) applied to sports video classifications did not provide a consummate solution, and such models could not be easily understood by human users; meanwhile, they increased the complexity and time of computation and the associated costs of the involved standalone machines. Hence, there is a need to develop a system which is able to address these drawbacks and handle the high levels of uncertainty in video scenes classification and undertake the heavy video processing securely and efficiently on a cloud computing based instance. Hence, in this paper we present a cloud computing based multi classifier systems which aggregates three classifiers based on neural networks and two fuzzy logic classifiers based on type-1 fuzzy logic and type-2 fuzzy logic classification systems which were optimized by a Big-Bang Big crunch optimization to maximize the system performance. We will present several real world experiments which shows the proposed classification system operating in real-time to produce high classification accuracies for soccer videos which outperforms the standalone classification systems based on neural networks, type-1 and type-2 fuzzy logic systems.     

具有输出字符功能的模糊自动机的最小化问题

通过文献[8]中两类具有输出字符功能的Fuzzy自动机和Fuzzy有限状态自动机的强等价性,等价性和弱等价性的条件,在以往仅仅给出的Fuzzy有限状态自动机的最小化问题基础上,讨论了具有更广泛意义的具有输出字符功能的Fuzzy自动机的最小化问题,以及其最小化自动机与Fuzzy有限状态自动机的最小化自动机在不同条件下的关系。     

强正则剩余格值逻辑系统（L）N及其完备性

正则剩余格是一类重要的模糊逻辑代数系统,而常见的模糊逻辑形式系统大多数带有非联接词,并且相应的Lindenbaum代数都是正则剩余格.本文以强正则剩余格为语义,建立了一个一般的命题演算形式系统LN,并且证明了这个系统的完备性.几种常见的带有非联接词的模糊逻辑形式系统都是系统LN的扩张.     

Nonconvex differential calculus for infinite-dimensional multifunctions

The paper is concerned with generalized differentiation of set-valued mappings between Banach spaces. Our basic object is the so-called coderivative of multifunctions that was introduced earlier by the first author and has had a number of useful applications to nonlinear analysis, optimization, and control. This coderivative is a nonconvex-valued mapping which is related to sequential limits of Fréchet-like graphical normals but is not dual to any tangentially generated derivative of multifunctions. Using a variational approach, we develop a full calculus for the coderivative in the framework of Asplund spaces. The latter class is sufficiently broad and convenient for many important applications. Some useful calculus results are also obtained in general Banach spaces.This research was partially supported by the National Science Foundation under grants DMS-9206989 and DMS-9404128, by the USA-Israel grant 94-00237, and by the NATO contract CRG-950360.     

强正则剩余格值逻辑系统L~N及其完备性

正则剩余格是一类重要的模糊逻辑代数系统,而常见的模糊逻辑形式系统大多数带有非联接词,并且相应的Lindenbaum代数都是正则剩余格.本文以强正则剩余格为语义,建立了一个一般的命题演算形式系统LN,并且证明了这个系统的完备性.几种常见的带有非联接词的模糊逻辑形式系统都是系统LN的扩张.     

模糊有限自动机的乘积覆盖性

推广模糊有限自动机的有限积,包括direct infinite乘积、cascade infinite乘积和wreath infinite 来积.进而讨论它们之间的关系,得到乘积覆盖性等代数性质.     

Chu duality theory and coalgebraic representation of quantum symmetries

Building upon Vaughan Pratt's work on applications of Chu space theory to Stone duality, we develop a general theory of categorical dualities on the basis of Chu space theory and closure conditions, which encompasses a variety of dualities for topological spaces, convex spaces, closure spaces, and measurable spaces (some of which are new duality results on their own). It works as a general method to generate analogues of categorical dualities between frames (locales) and topological spaces beyond topology, e.g., for measurable spaces, convex spaces, and closure spaces. After establishing the Chu duality theory, we apply the state-observable duality between quantum lattices and closure spaces to coalgebraic representations of quantum symmetries, showing that the quantum symmetry groupoid fully embeds into a purely coalgebraic category, i.e., the category of Born coalgebras, which refines, through the quantum duality that follows from Chu duality theory, Samson Abramsky's fibred coalgebraic representations of quantum symmetries (which, in turn, builds upon his Chu representations of symmetries).     

Residuated logics based on strict triangular norms with an involutive negation

In general, there is only one fuzzy logic in which the standard interpretation of the strong conjunction is a strict triangular norm, namely, the product logic. We study several equations which are satisfied by some strict t‐norms and their dual t‐conorms. Adding an involutive negation, these equations allow us to generate countably many logics based on strict t‐norms which are different from the product logic. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A new error estimation approach based on fuzzy logic system for H-R adaptive boundary element method

Conventional adaptive boundary element method cannot be universally applied to solve many more problems than the subject it discussed, and different error estimation formulas need to be designed for varied problems. This paper put forward a new error analysis method based on the fuzzy logic system, which is able to make error estimation effectively using human expert experience, and solve the two classical elasticity problems in conjunction with the H-R adaptive boundary element method. Numerical examples have illustrated the effectiveness, superiority and potential of a fuzzy logic approach in the adaptive boundary element method.