Results 11 to 20 of about 2,112 (254)
The women made it work: fuzzy transitive closure of the results chain in a dengue prevention trial in Mexico [PDF]
BMC Public Health, 2017 Background A modified theory of planned behaviour (acronym CASCADA) proposes that Conscious knowledge precedes a change in Attitude, which in turn precedes positive deviations from negative Subjective norms, intention to Change, perception of Agency to ...
Neil Andersson +4 more
doaj +2 more sources
Transitive Closures of Ternary Fuzzy Relations [PDF]
International Journal of Computational Intelligence Systems, 2021 Recently, we have introduced six types of composition of ternary fuzzy relations. These compositions are close in spirit to the composition of binary fuzzy relations.
Lemnaouar Zedam, Bernard De Baets
doaj +4 more sources
Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present a new approach to the logical design of relational databases, based on strategic port graph rewriting. We show how to model relational schemata as attributed port graphs and provide port graph rewriting rules to perform computations on ...
János Varga
doaj +3 more sources
Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing [PDF]
BMC Bioinformatics, 2017 Background RNA secondary structure prediction is a compute intensive task that lies at the core of several search algorithms in bioinformatics. Fortunately, the RNA folding approaches, such as the Nussinov base pair maximization, involve mathematical ...
Marek Palkowski, Wlodzimierz Bielecki
doaj +2 more sources
Algebraic structures for transitive closure [PDF]
Theoretical Computer Science, 1977 AbstractClosed semi-rings and the closure of matrices over closed semi-rings are defined and studied. Closed semi-rings are structures weaker than the structures studied by Conway [3] and Aho, Hopcroft and Ullman [1]. Examples of closed semi-rings and closure operations are given, including the case of semi-rings on which the closure of an element is ...
Daniel Lehmann
openalex +3 more sources
Tree Canonization and Transitive Closure
Information and Computation, 2000 AbstractWe prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree isomorphism and canonization are in L (1992, S. Lindell, in “24th Symp. on Theory of Comput.” pp. 400–404).
Kousha Etessami, Neil Immerman
openalex +4 more sources
Transitive-Closure Spanners [PDF]
SIAM Journal on Computing, 2009 Given a directed graph G = (V,E) and an integer k>=1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, E_H) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were implicitly studied in access control, data structures, and property testing, and properties of these spanners have been
Arnab Bhattacharyya +4 more
openalex +4 more sources
Protein SciHaibo Liu +3 more
openalex +2 more sources
Transitive closure and betweenness relations
Fuzzy Sets and Systems, 2001 Indistinguishability operators fuzzify the concept of equivalence relation and have been proved a useful tool in theoretical studies as well as in di0erent applications such as fuzzy control or approximate reasoning. One interesting problem is their construction. There are di0erent ways depending on how the data are given and on their future use.
D. Boixader, J. Jacas, J. Recasens
openalex +4 more sources
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
Logical Methods in Computer Science, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
doaj +1 more source