Results 11 to 20 of about 443 (167)
Clinical Validation of a Handheld Deep Learning Tool for Identification of Glaucoma Medications [PDF]
Purpose: To validate a convolutional neural network (CNN)-based smartphone application for the identification of glaucoma eye drop medications in patients with normal and impaired vision.
Christopher D. Yang +5 more
doaj +2 more sources
Fixed-Point and Random Fixed-Point Theorems in Preordered Sets Equipped with a Distance Metric
This paper explores fixed points for both contractive and non-contractive mappings in traditional b-metric spaces, preordered b-metric spaces, and random b-metric spaces.
Ravindra K Bisht +2 more
exaly +3 more sources
Fixed point theorems for Geraghty-type mappings applied to solving nonlinear Volterra-Fredholm integral equations in modular G-metric spaces [PDF]
Purpose – The authors prove the existence and uniqueness of fixed point of mappings satisfying Geraghty-type contractions in the setting of preordered modular G-metric spaces.
Godwin Amechi Okeke, Daniel Francis
doaj +1 more source
On nominal sets with support-preorder [PDF]
Each nominal set 𝑋 can be equipped with a preorder relation ⪯ defined by the notion of support, so-called support-preorder. This preorder also leads us to the support topology on each nominal set.
Aliyeh Hossinabadi +2 more
doaj +1 more source
The Quotient in Preorder Theories [PDF]
In Proceedings GandALF 2020, arXiv:2009 ...
Inigo Incer Romeo +3 more
openaire +3 more sources
Multiparty Testing Preorders [PDF]
Variants of the must testing approach have been successfully applied in service oriented computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have
Rocco De Nicola, Hernán C. Melgratti
openaire +6 more sources
Updating Utility Functions on Preordered Sets
We consider the problem of extending a function fP defined on a subset P of an arbitrary set X to X strictly monotonically with respect to a preorder ≽ defined on X , without imposing continuity constraints.
Pavel Chebotarev
doaj +1 more source
Theories of efficiency preorders and precongruences for concurrent systems have been described in various papers. We describe a procedure to implement two of these precongruences. Considering the extra information that is needed to be maintained while computing efficiency preorders, our procedure with a complexity $O(n^{3}m)$, compares favourably with ...
Manish Gaur, S. Arun-Kumar
openaire +1 more source
Permutation Groups Generated by γ-Cycles
A γ-cycle is a cycle of the form (i+1,i+2,…,i+m) in the symmetric group Sn. We study the subgroups of Sn generated by several sets of γ-cycles. Our mathematical development is strongly supported by computational experiments and proofs based on do-it ...
Răzvan Diaconescu
doaj +1 more source
Preorders in Simple Games [PDF]
Any power index defines a total preorder in a simple game and, thus, induces a hierarchy among its players. The desirability relation, which is also a preorder, induces the same hierarchy as the Banzhaf and the Shapley indices on linear games, i.e., games in which the desirability relation is total.
Freixas Bosch, Josep +1 more
openaire +3 more sources

