Related papers: On a Well-behaved Relational Generalisation of Rou…
The inverse problem of general rough sets, considered by the present author in some of her earlier papers, in one of its manifestations is essentially the question of when an agent's view about crisp and non crisp objects over a set of…
Modularity is a very widely used measure of the level of clustering or community structure in networks. Here we consider a recent generalisation of the definition of modularity to temporal graphs, whose edge-sets change over discrete…
We extend Hacon--M\textsuperscript{c}Kernan's rational chain connectedness theorem to the complex analytic setting. As a consequence, we prove that the fibers of any resolution of singularities of complex analytic kawamata log terminal…
Let $\mathcal R$ be a $\Sigma^1_1$ binary relation and call a set $\mathcal R$-discrete iff no two distinct of its elements are $\mathcal R$-related. We show that in the extension of $\mathbf{L}$ by iterated Sacks forcing, there is a…
The identification of semantic relations between terms within texts is a fundamental task in Natural Language Processing which can support applications requiring a lightweight semantic interpretation model. Currently, semantic relation…
We generalise the Blok-J\'onsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and J\'onsson admit, in place…
The purpose of this paper is to study the notion of relative extreme amenability for pairs of topological groups. We give a characterization by a fixed point property on universal spaces. In addition we introduce the concepts of an…
We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…
We introduce the relation ${\rho}_{\lambda}$-orthogonality in the setting of normed spaces as an extension of some orthogonality relations based on norm derivatives, and present some of its essential properties. Among other things, we give…
We consider linear programs involving uncertain parameters and propose a new tractable robust counterpart which contains and generalizes several other models including the existing Affinely Adjustable Robust Counterpart and the Fully…
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general.…
We present a more general analysis of $H$-calibration for adversarially robust classification. By adopting a finer definition of calibration, we can cover settings beyond the restricted hypothesis sets studied in previous work. In…
We postulate the intuitive idea of reducts of fuzzy contexts based on formal concept analysis and rough set theory. For a complete residuated lattice $L$, it is shown that reducts of $L$-contexts in formal concept analysis are…
While deep networks have been enormously successful over the last decade, they rely on flat-feature vector representations, which makes them unsuitable for richly structured domains such as those arising in applications like social network…
We study the link between a compact hypersurface in $\P^{n+1}$ and the set of all its tangent planes. In this context, we identify $\P^{n+1}$ to the set of linear subspaces of codimension one by orthogonal complementarity. This gives rise…
Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…
In order to bring contraction analysis into the very fruitful and topical fields of stochastic and Bayesian systems, we extend here the theory describes in \cite{Lohmiller98} to random differential equations. We propose new definitions of…
We discuss the use of matrices for providing sequences of rationals that approximate algebraic irrationalities. In particular, we study the regular representation of algebraic extensions, proving that ratios between two entries of the…
In this paper, we have defined rough convergence and rough statistical convergence of double sequences in probabilistic normed spaces which is more generalized version than the rough statistical convergence of double sequences in normed…
Modulus of local continuity is used to evaluate the robustness of neural networks and fairness of their repeated uses in closed-loop models. Here, we revisit a connection between generalized derivatives and moduli of local continuity, and…