The search session has expired. Please query the service again.
A fuzzy inference system (FIS) is an effective prediction method based on fuzzy logic. The performance of this model may vary depending on the defuzzification process. In the Mamdani-type FIS model, the defuzzification process is applied to the fuzzy output of the system only once at the last stage. In the FIS with rule-based defuzzification (FIS-RBD) model, the defuzzification process is applied to the fuzzy consequent part of each rule and the overall result of the system is calculated as the...
Computing the image of a regular language by the transitive closure of a relation is a central question in regular model checking. In a recent paper Bouajjani et al. [IEEE Comput. Soc. (2001) 399–408] proved that the class of regular languages – called APC – of the form
Computing the image of a regular language by the transitive closure of a
relation is a central question in regular model checking. In a recent
paper Bouajjani et al. [IEEE Comput. Soc. (2001) 399–408] proved that the class of
regular languages L – called APC – of the form UjL0,jL1,jL2,j...Lkj,j, where the union is finite and each
Li,j is either a single symbol or a language of the form B* with
B a subset of the alphabet, is closed under all semi-commutation
relations R. Moreover a recursive...
We extend the simply typed
λ-calculus with unbind and rebind primitive
constructs. That is, a value can be a fragment of open code,
which in order to be used should be explicitly rebound. This
mechanism nicely coexists with standard static binding. The
motivation is to provide an unifying foundation for mechanisms of
dynamic scoping, where the meaning of a name is
determined at runtime, rebinding, such as dynamic updating
of resources and exchange of mobile code, and delegation,
where an alternative...
We extend the simply typed
λ-calculus with unbind and rebind primitive
constructs. That is, a value can be a fragment of open code,
which in order to be used should be explicitly rebound. This
mechanism nicely coexists with standard static binding. The
motivation is to provide an unifying foundation for mechanisms of
dynamic scoping, where the meaning of a name is
determined at runtime, rebinding, such as dynamic updating
of resources and exchange of mobile code, and delegation,
where an alternative...
The process of modelling and developing commonality and variability for system families should be supported by suitable methods and notations. The object-oriented methods and their notations, which are used at present, focus on the development of a single system at a time. In this paper we analyse feature models as a representation of the common parts and variants contained in a system family, and propose using a feature diagram as a basic representation of commonality, variability and dependencies....
Currently displaying 1 –
13 of
13