Results 51 to 60 of about 559,747 (351)
K-causality coincides with stable causality
, 2008 It is proven that K-causality coincides with stable causality, and that in a K-causal spacetime the relation K^+ coincides with the Seifert's relation. As a consequence the causal relation "the spacetime is strongly causal and the closure of the causal ...
Minguzzi, E.
core +2 more sources
Advanced Science, EarlyView.Bacterial α‐diversity decreases, but stochasticity and community stability increase across the 15 m‐depth vertical profiles and along the degraded gradient within the active layer. The abundance and interaction of core taxa mainly control community stability in the active and permafrost layers, respectively.
Shengyun Chen +13 more
wiley +1 more source
Complements and transitive closures
Discrete Mathematics, 1972 AbstractThe complement of the transitive closure of the complement of a transitive relation is transitive. We prove this fact in three ways, analyze the underlying structure and consider various refinement's and applications.
Graham, R.L., Knuth, D.E., Motzkin, T.S.
openaire +2 more sources
Advanced 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
One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs
IEEE Access, 2020 Given a directed acyclic graph (DAG) G, G's transitive reduction (TR) Gtr is the unique DAG satisfying that Gtr has the minimum number of edges and has the same transitive closure (TC) as G.
Xian Tang +5 more
doaj +1 more source
A transitive closure algorithm [PDF]
BIT Numerical Mathematics, 1970 An algorithm is given for computing the transitive closure of a directed graph in a time no greater thana1N1n+a2n2 for largen wherea1 anda2 are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph andN1 is the number of arcs (not counting those arcs which are part of a cycle and not counting those arcs
openaire +2 more sources
Parameterized Complexity and Approximation Issues for the Colorful Components Problems
, 2018 The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last ten years.
Dondi, Riccardo, Sikora, Florian
core +2 more sources
SciLitMiner: An Intelligent System for Scientific Literature Mining and Knowledge Discovery
Advanced Intelligent Systems, EarlyView.SciLitMiner is an intelligent system that federately ingests scientific literature, filters it using advanced information retrieval methods, and applies retrieval‐augmented generation tailored to scientific domains. Demonstrated on creep deformation in γ‐TiAl alloys, SciLitMiner provides a controlled workflow for systematic knowledge discovery and ...
Vipul Gupta +3 more
wiley +1 more source
Health Economics, EarlyView.ABSTRACT Economic evaluations carried out from a societal perspective ought to account for the opportunity cost of a range of resources, including those committed by care recipients. People's time is such a resource: it is limited, valuable and it has an opportunity cost that should be reflected in cost calculations.
Lazaros Andronis +4 more
wiley +1 more source
Journal of Applied Philosophy, EarlyView.ABSTRACT Gender and race have received significant philosophical attention recently; they are the paradigm cases of social kinds in most philosophical accounts. I argue for the inclusion of caste as a social kind because it affects the lives of many people, and because it presents itself as an important test case for philosophers of social kinds.
Ajinkya Deshmukh
wiley +1 more source