Results 41 to 50 of about 3,203 (298)
Advanced Engineering Materials, EarlyView.Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
Parameterized Linear Time Transitive Closure
Journal of Graph Algorithms and ApplicationsIn this paper, we first study the problem of decomposing a directed acyclic graph (DAG), $G=(V, E)$ into vertex-disjoint chains and present a fast and practical chain decomposition technique.
Giorgos Kritikakis, Ioannis Tollis
doaj +1 more source
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
Logical Methods in Computer Science, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Jean-Philippe Bernardy, Patrik Jansson
doaj +1 more source
A Transitive Closure Algorithm [PDF]
, 1968 An algorithm is given for computing the transitive closure of a directed graph in a time no greater than a1 N1 n + a2n2 for large n where a1 and a2 are constants depending on the computer used to execute the algorithm, n is the number of nodes in the ...
Purdom, Paul W.
core
Infinitary and Cyclic Proof Systems for Transitive Closure Logic [PDF]
, 2018 Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive definitions ...
Cohen, Liron, Rowe, Reuben N. S.
core +1 more source
From Circuits to Symphonies: A Systems‐Engineering Blueprint for Multimicrobial Synthetic Biology
Advanced Science, EarlyView.Engineering synthetic microbial consortia requires moving beyond intracellular genetic circuits toward coordinated multicellular design. A modular systems‐engineering framework is presented that integrates communication, temporal coordination, ecological structuring, and predictive modeling to guide application‐dependent consortium design ...
Miguel Fernández‐Niño +9 more
wiley +1 more source
An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity [PDF]
, 2009 A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations
Recasens Ferrés, Jorge +3 more
core +2 more sources
Multiprocessor Implementation of Transitive Closure [PDF]
, 2007 Graph theoretic algorithms are found quite effective for solving complex real life problems. Computing the transitive closure in directed graphs is a fundamental graph problem. Transitive closure can be thought of as establishing a data structure that
Bhalla, Sunidhi
core
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