Ying, M; Bouchon-Meunier, B(John Wiley & Sons Inc, 1998-01)
We analyze the influence of some usual linguistic modifiers, such as scalar product, normalization, Bouchon-Meunier modifiers, perturbation, and (weakening and reinforcement) power, in the process of approximate reasoning ...
Edge detection in computer vision and image processing is a process which detects one kind of significant feature in an image that appears as discontinuities in intensities. A parallel edge detection algorithm based on ...
Generally, the disorders in a neural network diagnosis model are assumed independent each other. In this paper, we propose a neural network model for diagnostic problem solving where the disorder independence assumption ...
This article outlines the utilization of Petri nets as a computerized process modeling and analysis tool for the study of the Edmonton Mail Processing Plant (MPP). Development of new systems or designing improvement in ...
We propose the concepts of maximum and average perturbations of fuzzy sets and estimate maximum and average perturbation parameters for various methods of fuzzy reasoning.
We give a very short proof of uniqueness of solutions of equations regarding observation congruence, the main notion of equality, over Milner's process calculus. (C) 1999-Elsevier Science B.V. All rights reserved.
We introduce a new definition of weak confluences and show that they are equivalent to tau-inertness without any appealing to tau-well-foundedness. (C) 2000 Elsevier Science B.V. All rights reserved.
We present a basic Framework of automats theory based on quantum logic. In particular, we introduce the orthomodular lattice-valued (quantum) predicate of recognizability and establish some of its fundamental properties.
We establish the pumping lemma in automata theory based on quantum logic under certain conditions on implication, and discuss the recognizability by the product and union of orthomodular lattice-valued (quantum) automata. ...
Biacino, L; Gerla, G; Ying, M(Wiley-V C H Verlag Gmbh, 2000-01)
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composing two closure operators and that the ...
This paper describes an application level active networking (ALAN) infrastructure that we have developed. An implementation has been released called ''funnelWeb''. This paper discusses the motivation for such a system, its ...
The traditional min-cut problem involves finding a cut with minimum weight between two specified vertices. The planar multiway cut problem is a NP-hard generalization of the min-cut problem. It involves separating a weighted ...
One strategy to the discrimination problem is to identify the state with certainty, leaving a possibility of undecidability. This paper gives an upper bound for the maximal success probability of unambiguous discrimination ...
Regarding behaviour equivalence in higher-order process calculi, Sangiorgi (Inform. and Comput. 131 (1996) 141) and Thomsen (Inform. and Comput. 116 (1995) 38) introduced context and higher-order bisimulations, respectively. ...
We use a semantical method of complete residuated lattice-valued logic to give a generalization of fuzzy topology as a partial answer to a problem by Rosser and Turquette.