On the Merit of Selecting Different Belief Merging Operators

Belief merging operators combine multiple belief bases (a profile) into a collective one. When the conjunction of belief bases is consistent, all the operators agree on the result. However, if the conjunction of belief bases is inconsistent, the results vary between operators. There is no formal manner to measure the results and decide on which operator to select. So, in this paper we propose to evaluate the result of merging operators by using three ordering relations (fairness, satisfaction and strength) over operators for a given profile. Moreover, a relation of conformity over operators is introduced in order to classify how well the operator conforms to the definition of a merging operator. By using the four proposed relations we provide a comparison of some classical merging operators and evaluate the results for some specific profiles.

A comparison of merging operators in possibilistic logic.

In this paper, we compare merging operators in possibilistic logic. We rst propose an approach to evaluating the discriminating power of a merging operator. After that, we analyze the computational complexity of existing possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.

Norms of basic elementary operators on algebras of regular operators

We show that if E is an atomic Banach lattice with an ordercontinuous norm, A, B ∈ L^r(E) and M_A,_B is the operator on L^r(E) defined by M_A,_B(T) = AT B then ||M_A,_B||r = ||A||_r||B||_r but that there is no real α > 0 such that ||MA,B || ≥ α ||A||r||B ||r.

Generating analysis topology using virtual topology operators

Virtual topology operations have been utilized to generate an analysis topology definition suitable for downstream mesh generation. Detailed descriptions are provided for virtual topology merge and split operations for all topological entities, where virtual decompositions are robustly linked to the underlying geometry. Current virtual topology technology is extended to allow the virtual partitioning of volume cells. A valid description of the topology, including relative orientations, is maintained which enables downstream interrogations to be performed on the analysis topology description, such as determining if a specific meshing strategy can be applied to the virtual volume cells. As the virtual representation is a true non-manifold description of the sub-divided domain the interfaces between cells are recorded automatically. Therefore, the advantages of non-manifold modelling are exploited within the manifold modelling environment of a major commercial CAD system without any adaptation of the underlying CAD model. A hierarchical virtual structure is maintained where virtual entities are merged or partitioned. This has a major benefit over existing solutions as the virtual dependencies here are stored in an open and accessible manner, providing the analyst with the freedom to create, modify and edit the analysis topology in any preferred sequence.

Operators for Similarity Search: Semantics, Techniques and Usage Scenarios

This book provides a comprehensive tutorial on similarity operators. The authors systematically survey the set of similarity operators, primarily focusing on their semantics, while also touching upon mechanisms for processing them effectively.

The book starts off by providing introductory material on similarity search systems, highlighting the central role of similarity operators in such systems. This is followed by a systematic categorized overview of the variety of similarity operators that have been proposed in literature over the last two decades, including advanced operators such as RkNN, Reverse k-Ranks, Skyline k-Groups and K-N-Match. Since indexing is a core technology in the practical implementation of similarity operators, various indexing mechanisms are summarized. Finally, current research challenges are outlined, so as to enable interested readers to identify potential directions for future investigations.

In summary, this book offers a comprehensive overview of the field of similarity search operators, allowing readers to understand the area of similarity operators as it stands today, and in addition providing them with the background needed to understand recent novel approaches.

Spectrally isometric elementary operators

We present criteria for unital elementary operators (of small length) on unital semisimple Banach algebras to be spectral isometries. The surjective ones among them turn out to be algebra automorphisms.

More elementary operators that are spectrally bounded

We discuss some necessary and some sufficient conditions for an elementary operator x↦∑ⁿ_i=1a_ixb_i on a Banach algebra A to be spectrally bounded. In the case of length three, we obtain a complete characterisation when A acts irreducibly on a Banach space of dimension greater than three.

Locally quasi-nilpotent elementary operators

Let A be a unital dense algebra of linear mappings on a complex vector space X. Let φ = Σⁿ _i=1 M_ai,_bi be a locally quasi-nilpotent elementary operator of length n on A. We show that, if {a1, . . . , an} is locally linearly independent, then the local dimension of V (φ) = span{b_ia_j : 1 ≤ i, j ≤ n} is at most n(n−1) 2 . If ldim V (φ) = n(n−1) 2 , then there exists a representation of φ as φ = Σⁿ _i=1 M_ui,_vi with v_iu_j = 0 for i ≥ j. Moreover, we give a complete characterization of locally quasinilpotent elementary operators of length 3.

Elementary operators-still not elementary?

Properties of elementary operators, that is, finite sums of two-sided multiplications on a Banach algebra, have been studied under a vast variety of aspects by numerous authors. In this paper we review recent advances in a new direction that seems not to have been explored before: the question when an elementary operator is spectrally bounded or spectrally isometric. As with other investigations, a number of subtleties occur which show that elementary operators are still not elementary to handle.

Non-Gaussian distribution of collective operators in quantum spin chains

We numerically analyse the behavior of the full distribution of collective observables in quantum spin chains. While most of previous studies of quantum critical phenomena are limited to the first moments, here we demonstrate how quantum fluctuations at criticality lead to highly non-Gaussian distributions. Interestingly, we show that the distributions for different system sizes collapse on thesame curve after scaling for a wide range of transitions: first and second order quantum transitions and transitions of the Berezinskii–Kosterlitz–Thouless type. We propose and analyse the feasibility of an experimental reconstruction of the distribution using light–matter interfaces for atoms in optical lattices or in optical resonators.

Orbits of semigroups of truncated convolution operators

We prove that a semigroup generated by finitely many truncated convolution operators on $L_p[0, 1]$ with 1 ≤ p < ∞ is non-supercyclic. On the other hand, there is a truncated convolution operator, which possesses irregular vectors.