74,086 research outputs found

    Unsharp Degrees of Freedom and the Generating of Symmetries

    Get PDF
    In quantum theory, real degrees of freedom are usually described by operators which are self-adjoint. There are, however, exceptions to the rule. This is because, in infinite dimensional Hilbert spaces, an operator is not necessarily self-adjoint even if its expectation values are real. Instead, the operator may be merely symmetric. Such operators are not diagonalizable - and as a consequence they describe real degrees of freedom which display a form of "unsharpness" or "fuzzyness". For example, there are indications that this type of operators could arise with the description of space-time at the string or at the Planck scale, where some form of unsharpness or fuzzyness has long been conjectured. A priori, however, a potential problem with merely symmetric operators is the fact that, unlike self-adjoint operators, they do not generate unitaries - at least not straightforwardly. Here, we show for a large class of these operators that they do generate unitaries in a well defined way, and that these operators even generate the entire unitary group of the Hilbert space. This shows that merely symmetric operators, in addition to describing unsharp physical entities, may indeed also play a r{\^o}le in the generation of symmetries, e.g. within a fundamental theory of quantum gravity.Comment: 23 pages, LaTe

    Interval-valued and intuitionistic fuzzy mathematical morphologies as special cases of L-fuzzy mathematical morphology

    Get PDF
    Mathematical morphology (MM) offers a wide range of tools for image processing and computer vision. MM was originally conceived for the processing of binary images and later extended to gray-scale morphology. Extensions of classical binary morphology to gray-scale morphology include approaches based on fuzzy set theory that give rise to fuzzy mathematical morphology (FMM). From a mathematical point of view, FMM relies on the fact that the class of all fuzzy sets over a certain universe forms a complete lattice. Recall that complete lattices provide for the most general framework in which MM can be conducted. The concept of L-fuzzy set generalizes not only the concept of fuzzy set but also the concepts of interval-valued fuzzy set and Atanassov’s intuitionistic fuzzy set. In addition, the class of L-fuzzy sets forms a complete lattice whenever the underlying set L constitutes a complete lattice. Based on these observations, we develop a general approach towards L-fuzzy mathematical morphology in this paper. Our focus is in particular on the construction of connectives for interval-valued and intuitionistic fuzzy mathematical morphologies that arise as special, isomorphic cases of L-fuzzy MM. As an application of these ideas, we generate a combination of some well-known medical image reconstruction techniques in terms of interval-valued fuzzy image processing

    Conceptual design and implementation of the fuzzy semantic model

    Get PDF
    FSM is one of few database models that support fuzziness, uncertainty and impreciseness of real-world at the class definition level. FSM authorizes an entity to be partially member of its class according to a given degree of membership that reflects the level to which the entity verifies the extent properties of this class. This paper deals with the conceptual design of FSM and adresses some implementation issues.ou

    A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

    Get PDF
    Real world combinatorial optimization problems such as scheduling are typically too complex to solve with exact methods. Additionally, the problems often have to observe vaguely specified constraints of different importance, the available data may be uncertain, and compromises between antagonistic criteria may be necessary. We present a combination of approximate reasoning based constraints and iterative optimization based heuristics that help to model and solve such problems in a framework of C++ software libraries called StarFLIP++. While initially developed to schedule continuous caster units in steel plants, we present in this paper results from reusing the library components in a shift scheduling system for the workforce of an industrial production plant.Comment: 33 pages, 9 figures; for a project overview see http://www.dbai.tuwien.ac.at/proj/StarFLIP
    corecore