Reducibility and correspondences of pure generalized grammars
Reducibility as a tool to extend the power of approximation algorithms the minimization of boolean expressions
Reducibility method in simply typed lambda calculus.
Reducing E-Commerce Risks Using Digital Certificates
Reducing Off-Line to On-Line: an Example and Its Applications
Reducing the adjacency matrix of a tree.
Reduction algorithms for some classes of aperiodic monoids
Reduction in the number of LUT elements for control units with code sharing
Two methods are proposed targeted at reduction in the number of look-up table elements in logic circuits of compositional microprogram control units (CMCUs) with code sharing. The methods assume the application of field-programmable gate arrays for the implementation of the combinational part of the CMCU, whereas embedded-memory blocks are used for implementation of its control memory. Both methods are based on the existence of classes of pseudoequivalent operational linear chains in a microprogram...
Reduction semantics for rational schemes
Refinement of a fuzzy control rule set.
Fuzzy logic controller performance depends on the fuzzy control rule set. This set can be obtained either by an expert or from a learning algorithm through a set of examples. Recently, we have developed SLAVE an inductive learning algorithm capable of identifying fuzzy systems. The refinement of the rules proposed by SLAVE (or by an expert) can be very important in order to improve the accuracy of the model and in order to simplify the description of the system. The refinement algorithm is based...
Refinement of UML collaborations
The paper concerns the concept of refinement as a commonly used design practice in the software development process. The refinement relationship is formulated and formally expressed for UML collaborations. Collaborations are suitable for presenting the proposed approach as they represent both static and dynamic aspects of a modeled system or its part, for example, a use case. Our approach to refinement is based on the rule of preserving the observable behavior of a modeled system. The introduced...
Refinements of inductive inference by Popperian and reliable machines
Reflection curves -- new computation and rendering techniques.
Reflections on refractions.
Reflections on spheres and cylinders of revolution.
Region of interest contrast measures
A survey of local image contrast measures is presented and a new contrast measure for measuring the local contrast of regions of interest is proposed. The measures validation is based on the gradual objective contrast decreasing on medical test images in both grayscale and color. The performance of the eleven most frequented contrast measures is mutually compared and their robustness to different types of image degradation is analyzed. Since the contrast measures can be both global, regional and...
Regular geodesic languages and the falsification by fellow traveler property.
Regular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
Regular languages definable by Lindström quantifiers
In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.
Regular prefix-codes and right power-bounded languages.