Related papers: Soft-linkedness
We make progress towards resummation of power-suppressed logarithms in dijet event shapes such as thrust, which have the potential to improve high-precision fits for the value of the strong coupling constant. Using a newly developed…
From last decade, when Molodtsov introduced the theory of soft set as a new approach to deal with uncertainties, until now this theory was considered sharply by a fair number of researchers. Combination of fuzzy set theory and soft set…
This note offers a first bridge from machine learning to modern differential geometry. We show that the logits-to-probabilities step implemented by softmax can be modeled as a geometric interface: two potential-generated, conservative…
We introduce a set of combinatorial techniques for studying the simplicial bounded cohomology of semi-simplicial sets, simplicial complexes and posets. We apply these methods to prove several new bounded acyclicity results for…
We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Ne\v{s}et\v{r}il and Ossona de Mendez as a model for sparsity in graphs, is a…
Meta-learning has demonstrated promising results in few-shot classification (FSC) by learning to solve new problems using prior knowledge. Bayesian methods are effective at characterizing uncertainty in FSC, which is crucial in high-risk…
The recently proposed soft finite element method (SoftFEM) reduces the stiffness (condition numbers), consequently improving the overall approximation accuracy. The method subtracts a least-square term that penalizes the gradient jumps…
In this paper the author presents a kind of Soft Computing Technique, mainly an application of fuzzy set theory of Prof. Zadeh [16], on a problem of Medical Experts Systems. The choosen problem is on design of a physician's decision model…
In the setting of nonstandard analysis we introduce the notion of flexible sequence. The terms of flexible sequences are external numbers. These are a sort of analogue for the classical \emph{O$ (\cdot ) $} and \emph{o$ (\cdot ) $} notation…
Wyner's soft-covering lemma is the central analysis step for achievability proofs of information theoretic security, resolvability, and channel synthesis. It can also be used for simple achievability proofs in lossy source coding. This work…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
Notions of core, support and inversion of a soft set have been defined and studied. Soft approximations are soft sets developed through core and support, and are used for granulating the soft space. Membership structure of a soft set has…
The choice of a homogeneous ideal in a polynomial ring defines a closed subscheme $Z$ in a projective space as well as an infinite sequence of cones over $Z$ in progressively higher dimension projective spaces. Recent work of Aluffi…
Given a measurable space (X, M) there is a (Galois) connection between sub-sigma-algebras of M and equivalence relations on X. On the other hand equivalence relations on X are closely related to congruences on stochastic relations. In…
In the classical probability in continuous random variables there is no distinguishing between the probability involving strict inequality and non strict inequality. Moreover a probability involves equality collapse to zero without…
Connections on principal bundles play a fundamental role in expressing the equations of motion for mechanical systems with symmetry in an intrinsic fashion. A discrete theory of connections on principal bundles is constructed by introducing…
We study the embedding property in the category of sorted profinite groups. We introduce a notion of the sorted embedding property (SEP), analogous to the embedding property for profinite groups. We show that any sorted profinite group has…
Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…
The notion of $\theta$-FAM-linkedness, introduced in the second author's master thesis, is a formalization of the notion of strong FAM limits for intervals, whose initial form and applications have appeared in the work of Saharon Shelah,…
We prove sharp bounds on the virtual degrees introduced by Larsen and Shalev. This leads to improved bounds on characters of symmetric groups. We then sharpen bounds of Liebeck and Shalev concerning the Witten zeta function. Our main…