Results 41 to 50 of about 4,457 (265)

Relational Contractions Involving Shifting Distance Functions with Applications to Boundary Value Problems

open access: yesAxioms, 2023
This manuscript includes certain results on fixed points under a generalized contraction involving a pair of shifting distance functions in the framework of metric space endowed with a class of transitive relation.
Ebrahem Ateatullah Algehyne   +2 more
doaj   +1 more source

Machine Learning‐Enhanced Random Matrix Theory Design for Human Immunodeficiency Virus Vaccine Development

open access: yesAdvanced Intelligent Discovery, EarlyView.
This study integrates random matrix theory (RMT) and principal component analysis (PCA) to improve the identification of correlated regions in HIV protein sequences for vaccine design. PCA validation enhances the reliability of RMT‐derived correlations, particularly in small‐sample, high‐dimensional datasets, enabling more accurate detection of ...
Mariyam Siddiqah   +3 more
wiley   +1 more source

Refining Transitive and Pseudo-Transitive Relations at Web Scale

open access: yes, 2021
The publication of knowledge graphs on the Web in the form of RDF datasets, and the subsequent integration of such knowledge graphs are both essential to the idea of Linked Open Data. Combining such knowledge graphs can result in undesirable graph structures and even in logical inconsistencies.
Wang, Shuai   +3 more
openaire   +3 more sources

A Robust Deep Temporal Causal Discovery Platform for Single‐Cell Gene Regulatory Network Reconstruction

open access: yesAdvanced Intelligent Discovery, EarlyView.
scTIGER2.0 is a deep‐learning framework that infers gene regulatory networks from single‐cell RNA sequencing data. By integrating correlation, pseudotime ordering, deep learning and bootstrap‐based significance testing, it reduces false positives and reveals directional gene interactions.
Nishi Gupta   +3 more
wiley   +1 more source

Generalized Weak Contractions Involving a Pair of Auxiliary Functions via Locally Transitive Binary Relations and Applications to Boundary Value Problems

open access: yesMathematics
The intent of this paper was to investigate the fixed-point results under relation-theoretic generalized weak contractivity condition employing a pair of auxiliary functions ϕ and ψ verifying appropriate properties.
Nidal H. E. Eljaneid   +5 more
doaj   +1 more source

The combinational structure of non-homogeneous Markov chains with countable states

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1983
Let P(s,t) denote a non-homogeneous continuous parameter Markov chain with countable state space E and parameter space [a,b], −∞
A. Mukherjea, A. Nakassis
doaj   +1 more source

Employing Locally Finitely T-Transitive Binary Relations to Prove Coincidence Theorems for Nonlinear Contractions

open access: yesJournal of Function Spaces, 2020
In this article, we prove some relation-theoretic results on coincidence and common fixed point for a nonlinear contraction employing a locally finitely T-transitive binary relation, where T stands for a self-mapping on the underlying metric space.
Mohammad Arif   +3 more
doaj   +1 more source

Materials Representation Learning Based on a Material–Motif Network and Heterogeneous Graphs

open access: yesAdvanced Intelligent Discovery, EarlyView.
Structure motifs in materials are used to construct a bipartite material–motif network that links each material to its constituent motifs and establishes connectivity among materials sharing common motifs. Network analysis reveals material clusters associated with different functional applications and supports motif‐guided screening of materials.
Anoj Aryal   +3 more
wiley   +1 more source

Geraghty Type Contractions in Relational Metric Space with Applications to Fractional Differential Equations

open access: yesFractal and Fractional, 2023
The present manuscript is devoted to investigating some existence and uniqueness results on fixed points by employing generalized contractions in the context of metric space endued with a weak class of transitive relation.
Ahmed Alamer   +4 more
doaj   +1 more source

Reachability Relations and the Structure of Transitive Digraphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2009
In this paper we investigate reachability relations on the vertices of digraphs. If $W$ is a walk in a digraph $D$, then the height of $W$ is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed opposite to their orientation.
Norbert Seifter   +1 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy