A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Modular decomposition of transitive graphs and transitively orienting their complements
[article]
2017
arXiv
pre-print
Preserved Fulltext
Such graphs may be represented indirectly, as the transitive closure of a given graph. ...
This simplifies reduction for transitive digraphs, requiring only the computation of strongly connected components. ...
It turns out that the transitive closure of such a graph is a permutation graph, and that a pair of total orders characterizing the transitive closure can be computed in near-linear time. ...
arXiv:1710.04333v1
fatcat:jlidbduyn5gxxpbdesgcnttage
A compiled implementation of strong reduction
2002
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming - ICFP '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
An implementation in the Coq proof assistant demonstrates important speedups compared with the original interpreter-based implementation of strong reduction in Coq. ...
Our approach is based on compilation to the bytecode of an abstract machine performing weak reductions on non-closed terms, derived with minimal modifications from the ZAM machine used in the Objective ...
Acknowledgments Henri Laulhère conducted preliminary experiments on modifying the Objective Caml compiler to implement strong normalization circa 1998; the results of these experiments were communicated ...
doi:10.1145/581478.581501
dblp:conf/icfp/GregoireL02
fatcat:hyc6jim7rreu3jfllyghftt3ii
A compiled implementation of strong reduction
2002
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
An implementation in the Coq proof assistant demonstrates important speedups compared with the original interpreter-based implementation of strong reduction in Coq. ...
Our approach is based on compilation to the bytecode of an abstract machine performing weak reductions on non-closed terms, derived with minimal modifications from the ZAM machine used in the Objective ...
Acknowledgments Henri Laulhère conducted preliminary experiments on modifying the Objective Caml compiler to implement strong normalization circa 1998; the results of these experiments were communicated ...
doi:10.1145/583852.581501
fatcat:uftwfjnttve7bbxcdzfts6tb4i
Termination analysis for offline partial evaluation of a higher order functional language
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
One of the remaining problems on the path towards fully automatic partial evaluation is ensuring termination of the specialization phase. ...
We take an operational approach to the problem and consider the closure representation of higher-order functions to perform a combined data-and control-dependency analysis. ...
It is important to notice that the set of all transitions in a program is not the set of 1-step transitions but the transitive closure of these. ...
doi:10.1007/3-540-61739-6_34
fatcat:opb36id7unamjnizxj5wuxmbji
Page 1909 of Mathematical Reviews Vol. , Issue 97C
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Because of its high computation cost, it is of great interest to design efficient parallel algorithms for com- puting the transitive closure in relational database systems. ...
; Orlowska, Maria E. (5-QLD-C; Brisbane)
Parallel transitive closure computation in relational databases. ...
Page 7816 of Mathematical Reviews Vol. , Issue 97M
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The language R is called the root of L, denoted R = root(L). So root is, in some sense, an inverse operation of Kleene closure. ...
Some of the concepts imported from the theory of partial algebras could be of use in the graph transformation world. ...
Advancing NMDA Receptor Physiology by Integrating Multiple Approaches
2017
Trends in Neurosciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The most promising strategy going forward is through strong integration of multiple approaches. ...
The field appears poised for breakthroughs, including the exciting prospect of resolving the conformations and energetics of elementary steps in the activation process, and atomic-level modeling of the ...
This correlation implicates the degree of LBD lobe closure as a determinant of AMPAR partial agonism. ...
doi:10.1016/j.tins.2017.01.001
pmid:28187950
pmcid:PMC5339030
fatcat:ddvvmwb5bbdnhb2i3ffvjm5cnq
On the Minimisation of Acyclic Models
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We use a number of case studies to show that it is vastly more efficient than the standard bisimulation minimisation algorithms. ...
It is developed in the setting of interactive Markov chains, a model overarching both labelled transition systems and continuous-time Markov chains. ...
The computation of weak and branching bisimulation is theoretically dominated by the need to compute the transitive closure of internal transitions. ...
doi:10.1007/978-3-540-85361-9_25
fatcat:f6pfjh4cjbexfgxx4vujzc6xae
Phylogenetic super-networks from partial trees
2004
IEEE/ACM Transactions on Computational Biology & Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This paper poses the problem of inferring a phylogenetic super-network from such data and provides an efficient algorithm for doing so, called the Z-closure method. ...
Applications to a set of five published partial gene trees relating different fungal species and to six published partial gene trees relating different grasses illustrate the usefulness of the method and ...
For information on obtaining reprints of this article, please send e-mail to: tcbb@computer.org, and reference IEEECS Log Number TCBB-0161-0904. ...
doi:10.1109/tcbb.2004.44
pmid:17051697
fatcat:5fkq6ugdn5chzmzcmqf6ldeeda
AN EFFICIENT FULLY SYMBOLIC BISIMULATION ALGORITHM FOR NON-DETERMINISTIC SYSTEMS
2013
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
of computing the largest bisimulation over very large quotient spaces. ...
The definition of bisimulation suggests a partition-refinement step, which we show to be suitable for a saturation-based implementation. ...
Acknowledgments This work was partially supported by the National Science Foundation under grant CCF-1018057. ...
doi:10.1142/s012905411340011x
fatcat:kiijmvxhhfh7zirynu3v44jjl4
Phylogenetic Super-networks from Partial Trees
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This paper poses the problem of inferring a phylogenetic super-network from such data and provides an efficient algorithm for doing so, called the Z-closure method. ...
Applications to a set of five published partial gene trees relating different fungal species and to six published partial gene trees relating different grasses illustrate the usefulness of the method and ...
For information on obtaining reprints of this article, please send e-mail to: tcbb@computer.org, and reference IEEECS Log Number TCBB-0161-0904. ...
doi:10.1007/978-3-540-30219-3_33
fatcat:5qy2ixcf4nfyflg47o4ludznny
Tunable double photochromism of a family of bis-DTE bipyridine ligands and their dipolar Zn complexes
2012
Physical Chemistry, Chemical Physics - PCCP
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
These studies show that this series of DTE derivatives provides an efficient strategy to tune the photochromic properties through the combination of the electron-donor and electron-acceptor (D-A) groups ...
The orbital description of the doubly-open form (o,o)a n dh a l f -c l o s e df o r m( o,c)p r e d i c t s that double closure to the form (c,c) would occur using UV irradiation. ...
LO thanks the Re´gion Bretagne for a PhD grant.
Notes and references ...
doi:10.1039/c2cp23333a
pmid:22274540
fatcat:xjtf4gm4n5d4zguuydepptgwei
On Efficiency Preorders
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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 that for deciding observational ...
Further, the algorithm may be plugged in to existing model-checkers such as the Concurrency-Workbench of the New Century (CWB-NC) without any significant overheads of space or time. ...
Therefore it requires a time of O(n 3 ) to compute both transitive closure as well as the total number of invisible moves. ...
doi:10.1007/978-3-642-40213-5_6
fatcat:cwsz7tsvnvfrbgnqehhpaw6xqq
A computable expression of closure to efficient causation
2009
Journal of Theoretical Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a mathematical expression of closure to efficient causation in terms of λ-calculus; we argue that this opens up the perspective of developing principled computer simulations of ...
or principled problems in realizing a computer simulation or model of closure to efficient causation. ...
In other words, no model of closure to efficient causation could be Turing-computable. ...
doi:10.1016/j.jtbi.2008.12.012
pmid:19168079
fatcat:ywosyigg6zejdi7ah66gf6l3ry
Liquid pair correlations in four spatial dimensions: theory versus simulation
2015
Molecular Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We discuss the performance of different closures for the Ornstein-Zernike equation, by comparing the results to computer simulation data. ...
Using liquid integral equation theory, we calculate the pair correlations of particles that interact via a smooth repulsive pair potential in d = 4 spatial dimensions. ...
A versatile and computationally efficient alternative to the (semi-)analytical solution of arbitrary-dimensional liquid integral equations is the numerical solution by means of a spectral solver. ...
doi:10.1080/00268976.2014.993736
fatcat:qvzizpd7gbacraenbzp5dy7spu
« Previous
Showing results 1 — 15 out of 43,268 results