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
On the Computational Complexity of Conservative Computing
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
Workshop MIUR/COFIN -September 19-21, Ravello (SA) -p. 23
Complexity of ConsComp Theorem: ConsComp is NP-complete. Proof. Reduction from Partition (details on the paper). ...
reversible dvalued gates, as defined by [Cattaneo, Leporati and Leporini, 2002] • if n = m and d = 2, the conservation of the number of 1's given in input for reversible Boolean gates Bounds on the ...
) < 2M ≤ 2 · opt(I)
Conclusions We have: • proposed the first steps towards a theory of conservative computations • introduced a new NP-complete decision problem (ConsComp) and a new NP-hard optimization ...
doi:10.1007/978-3-540-45138-9_5
fatcat:qg5jpvj7ird3pfidwhzzac2cwm
On Exact Conservation for the Euler Equations with Complex Equations of State
2010
Communications in Computational 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.
Here we investigate the case of the Euler equations for a single gas using the Jones-Wilkins-Lee (JWL) equation of state. ...
Furthermore, we demonstrate that under certain conditions, a quasi-conservative method can exhibit higher rates of convergence near shocks than a strictly conservative counterpart of the same formal order ...
Acknowledgements This study has been supported by Lawrence Livermore National Laboratory under the auspices of the U.S. Department of Energy through contract number DE-AC52-07NA27344. ...
doi:10.4208/cicp.090909.100310a
fatcat:zbrht5tlg5eszing7yvwjybwcu
Derivation and Application of a Conserved Orbital Energy for the Inverted Pendulum Bipedal Walking Model
2007
Engineering of Complex Computer Systems (ICECCS), Proceedings of the IEEE International Conference on
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.
Given expressions for the Orbital Energy, we can compute where the foot should be placed or how the Center of Mass trajectory should be modified in order to achieve a desired velocity on the next step. ...
Using this model, we derive expressions for a conserved quantity, the "Orbital Energy", given a smooth Center of Mass trajectory. ...
If one assumes a lossless transfer of support on each step, one can then determine where to place the foot in order to achieve a new Linear Inverted Pendulum Energy, and hence the velocity on the next ...
doi:10.1109/robot.2007.364196
dblp:conf/icra/PrattD07
fatcat:dyklwe7emjfp5iaggmtap3wsgq
Introduction
2011
Natural Computing
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 2018; you can also visit the original URL.
The file type is application/pdf.
We thank all the reviewers who helped with this issue: Alastair Abbott, Larry ...
The problem is one of computational resources: new computational models may consume new resources, with a corresponding need for new complexity measures. ...
. • On the hierarchy of conservation laws in a cellular automaton, by Enrico Formenti, Jarkko Kari, and Siamak Taati Conservation laws in cellular automata are studied as an abstraction of the conservation ...
doi:10.1007/s11047-011-9247-z
fatcat:vwwk4gaufjcw5ctoh2r3yppbn4
FastV: From-point Visibility Culling on Complex Models
2009
Computer graphics forum (Print)
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 2011; you can also visit the original URL.
The file type is application/pdf.
We present an efficient technique to compute the potentially visible set (PVS) of triangles in a complex 3D scene from a viewpoint. The algorithm computes a conservative PVS at object space accuracy. ...
In practice, the algorithm can compute the PVS of CAD and scanned models composed of millions of triangles at interactive rates on a multi-core PC. ...
The three room acoustics models and anechoic audio clips are courtesy of The Virtual Acoustics group at Helsinki University of Technology. ...
doi:10.1111/j.1467-8659.2009.01501.x
fatcat:njntmhyusfhbbauidorwudffim
Evolution of gene regulation--on the road towards computational inferences
2010
Briefings in 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 2017; you can also visit the original URL.
The file type is application/pdf.
However, gain of understanding offers a reward beyond itself, since evolutionary considerations can enable discoveries in the first place, e.g. the computational identification of conserved transcription ...
This network is defined as the complex interplay of the sequence, biochemical modifications and structure of the chromosomal DNA with the regulatory proteins/RNA (transcription factors, co-factors, regulating ...
complexity of the evolutionary processes acting on it. ...
doi:10.1093/bib/bbq060
pmid:20702596
fatcat:iul5uujtdvafzcthc64eorcv5y
AN EVOLUTIONARY CONSERVATION-BASED METHOD FOR REFINING AND RERANKING PROTEIN COMPLEX STRUCTURES
2012
Journal of Bioinformatics and Computational 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 2017; you can also visit the original URL.
The file type is application/pdf.
Computational docking methods can provide researchers with a good starting point for the analysis of protein complexes. ...
We tested our method on docked candidates of eight protein complexes and the results suggest that the proposed scoring function helps bias the search toward complexes with native interactions. ...
Acknowledgments We thank the group of Dr. Olivier Lichtarge for their help in using the ET server. We also thank members of Haspel's and Shehu's research groups for useful discussions. ...
doi:10.1142/s0219720012420024
pmid:22809378
fatcat:bu4zbniycnfennq75cfv5pbgya
HotSprint: database of computational hot spots in protein interfaces
2007
Nucleic Acids Research
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.
The conserved residues in interfaces with certain buried accessible solvent area (ASA) and complex ASA thresholds are flagged as computational hot spots. ...
We present a new database of computational hot spots in protein interfaces: HotSprint. ...
The Open Access publication charges for this article were waived by the Oxford University Press. ...
doi:10.1093/nar/gkm813
pmid:17959648
pmcid:PMC2238999
fatcat:jsu3ydjcorbopj3hae3cza7mca
Page 1184 of Hydrological Processes Vol. 12, Issue 8
[page]
1998
Hydrological Processes
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Equation (2) provides the best basis on which to build a mass-conservative discretization of the transport equation. ...
BEN SLAMA
In particular we are here concerned with the SUBIEF module, which is used to compute the transport of one or more tracers. ...
Efficient Algorithms for Computing Conservative Portal Visibility Information
2000
Computer graphics forum (Print)
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 2009; you can also visit the original URL.
The file type is application/pdf.
The geometry of this information is termed a 'visibility volume' and its computation is usually quite complex. ...
In this paper we present techniques and algorithms which permit the computation of conservative viewing volumes incrementally. ...
The time complexity of function ViewVolume2 is linear on the number of edges of its arguments. ii. ...
doi:10.1111/1467-8659.00441
fatcat:egwn42ov55hkfi26gwbmb2n5su
Structural analysis of conserved base pairs in protein-DNA complexes
2002
Nucleic Acids Research
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 2007; you can also visit the original URL.
The file type is application/pdf.
Sites are used to compute conservation (information content) of each base pair, which indicates relative importance of the base pair in specific recognition. ...
The main result of this study is that conservation of base pairs in a site exhibits significant correlation with the number of contacts the base pairs have with the protein. ...
If a protein-DNA complex is available but recognition motif is unknown, one can compute the number of contacts per base pair and predict the most conserved ones. ...
doi:10.1093/nar/30.7.1704
pmid:11917033
pmcid:PMC101836
fatcat:57lb6nk4zbaitp35ukeapwuyre
Computer Aided Design of Extrusion Dies for Complex Geometry Profiles
2012
Materials Science Forum
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.
This research team is involved since the mid-nineties on the development of computational tools to aid the design of thermoplastic profile extrusion dies. ...
The inherent design freedom promoted by the employment of thermoplastic profiles is one of the major reasons for their attractiveness. ...
This PhD programme aims at developing a new computational rheology code, based on the same numerical method (FVM) but using unstructured meshes, which are required to model the flow in more complex geometries ...
doi:10.4028/www.scientific.net/msf.730-732.495
fatcat:bh4jro22zfci3hvg7oijrpcije
ClusterM: a scalable algorithm for computational prediction of conserved protein complexes across multiple protein interaction networks
2020
BMC Genomics
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.
Background The current computational methods on identifying conserved protein complexes across multiple Protein-Protein Interaction (PPI) networks suffer from the lack of explicit modeling of the desired ...
Conclusions ClusterM can better capture the desired topological property of a typical conserved protein complex, which is densely connected within the complex while being well-separated from the rest of ...
Therefore, we can compute the fraction of the number of matched reference conserved complexes. ...
doi:10.1186/s12864-020-07010-1
pmid:33208103
pmcid:PMC7677834
fatcat:pcmipdjiwvc2bhwzlpzklq3u5u
Conservative logic
1982
International Journal of Theoretical 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 2019; you can also visit the original URL.
The file type is application/pdf.
Conservative logic is a comprehensive model of computation which explicitly reflects a number of fundamental principles of physics, such as the reversibility of the dynamical laws and the conservation ...
The first uses binary, variables and is the conservative-logic counterpart of switching theory; this model proves that universal computing capabilities are compatible with the reversibility and conservation ...
In the remainder of this paper, we shall use the tools of conservative logic to deal with important issues of feasibility and of complexity of computational schemes. ...
doi:10.1007/bf01857727
fatcat:nal4qp7kbbclbgiy2peutjmske
Principle of Conservation of Computational Complexity
[article]
2018
arXiv
pre-print
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.
Other Versions
In this manuscript, we derive the principle of conservation of computational complexity. ...
We also provide an alternative explanation for the undecidability of the halting problem based on the principle. ...
Any findings and conclusions are those of the authors, and do not necessarily reflect the views of the funders. ...
arXiv:1712.01178v3
fatcat:dphk5e4zmvebfnyiplbqzmq5ka
« Previous
Showing results 1 — 15 out of 992,077 results