Related papers: On Bipolar Soft Sets
Algorithmic discrimination is an important aspect when data is used for predictive purposes. This paper analyzes the relationships between discrimination and classification, data set partitioning, and decision models, as well as…
We study multivariate problems like function approximation, numerical integration, global optimization and dispersion. We obtain new results on the information complexity $n(\varepsilon,d)$ of these problems. The information complexity is…
The concepts of fuzzy objects and their classes are described that make it possible to structurally represent knowledge about fuzzy and partially-defined objects and their classes. Operations over such objects and classes are also proposed…
The present paper is devoted to study some completeness properties of transitive binary relational set, i.e., a set together with a transitive binary relation (so called t-set).
We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform inter- polants and their existence in terms of bisimula- tions, tight complexity bounds for…
Soft materials, such as colloidal suspensions, polymer solutions, and biological systems, are typically multicomponent mixtures of macromolecules and simpler components (e.g., microions, monomers, solvent) that can assemble into complex…
This paper introduces a definition of ideological polarization of an electorate around a particular central point. The definition is flexible about the location or boundaries of the center. Using US survey data, the paper shows how this…
This paper aims to present the different aspects and characteristics of strategic and operational information and propose a categorization pattern allowing to consider an information as strategic or operational. This categorization is to be…
We give several algorithms addressing computations of intersections of conjugate subgroups.
We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational…
We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…
Soft interactions are not easily disentangled from hard ones. In an operational definition of soft and hard processes one finds that at presently analyzed scales there is an interplay of soft and hard processes. As the scale increases, so…
Submodularity is an important concept in integer and combinatorial optimization. A classical submodular set function models the utility of selecting homogenous items from a single ground set, and such selections can be represented by binary…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
We investigate the class of bisymmetric and quasitrivial binary operations on a given set $X$ and provide various characterizations of this class as well as the subclass of bisymmetric, quasitrivial, and order-preserving binary operations.…
A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for specifying and reasoning about algorithms that manipulate mathematical…
We expose the information flow capabilities of pure bipartite entanglement as a theorem -- which embodies the exact statement on the `seemingly acausal flow of information' in protocols such as teleportation. We use this theorem to…
Learning Spaces are certain set systems that are applied in the mathematical modeling of education. We propose a suitable compression (without loss of information) of such set systems to facilitate their logical and statistical analysis.…
A new seemingly weak axiomatic formulation of information algebras is given. It is shown how such information algebras can be embedded into set (information) algebras. In set algebras there is a natural relation of conditional independence…
We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can…