Results 111 to 120 of about 1,321,024 (261)
Source codes of CLAYFORM and associated file of data constants, a Fortran 77 computer program for calculating structural formulae of clay minerals and other silicates [PDF]
, 1987 Marc W. Bodine
openalex +1 more source
Computer Physics Communications, 1995 Abstract MORATE (Molecular Orbital RATE calculations) is a computer program for direct dynamics calculations of unimolecular and bimolecular rate constants of gas-phase chemical reactions involving atoms, diatoms, or polyatomic species. The dynamical methods used are conventional or variational transition state theory and multidimensional ...
Hu, W. P. +10 more
openaire +3 more sources
Quantum algorithm for a generalized hidden shift problem [PDF]
, 2007 Consider the following generalized hidden shift problem: given a function f on {0,...,M − 1} × ZN promised to be injective for fixed b and satisfying f(b, x) = f(b + 1, x + s) for b = 0, 1,...,M − 2, find the unknown shift s ∈ ZN.
Childs, Andrew M., van Dam, Wim
core
The Fastest and Shortest Algorithm for All Well-Defined Problems [PDF]
International Journal of Foundations of Computer Science, Vol.13,
No.3, June 2002, 431-443, 2002 An algorithm $M$ is described that solves any well-defined problem $p$ as quickly as the fastest algorithm computing a solution to $p$, save for a factor of 5 and low-order additive terms. $M$ optimally distributes resources between the execution of provably correct $p$-solving programs and an enumeration of all proofs, including relevant proofs of ...
arxiv
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose This study aims to evaluate how different gantry angles, breathing rates (BPM), cine image speeds, and tracking algorithms affect beam on/off latency and the subsequent impact on target dose for a 0.35T MR‐Linac with a 6 MV FFF beam.
Mateb Al Khalifa +4 more
wiley +1 more source
Pseudorandomness for Regular Branching Programs via Fourier Analysis [PDF]
arXiv, 2013 We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is $O(\log^2 n)$, where $n$ is the length of the branching program. The previous best seed length known for this model was $n^{1/2+o(1)}$, which follows as a special case ...
arxiv
Automated rapidplan model validation using Eclipse scripting API
Journal of Applied Clinical Medical Physics, EarlyView.Abstract RapidPlan offers efficiency gains and quality improvements in treatment planning. Prior to its use in the clinic, it requires an extensive validation procedure in which established clinical plans and those generated by the model are compared. The manual iterative nature of this process is resource intensive, as numerous iterations are required
Bradley Beeksma +2 more
wiley +1 more source
Partial Evaluation for Program Comprehension [PDF]
Dans ACM Computing Surveys, Symposium on partial evaluation 30, 3
es (1998), 2006 Program comprehension is the most tedious and time consuming task of software maintenance, an important phase of the software life cycle. This is particularly true while maintaining scientific application programs that have been written in Fortran for decades and that are still vital in various domains even though more modern languages are used to ...
arxiv
Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs [PDF]
arXiv, 2015 Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form x' <= y + c, and describe that the value of x in the current state is at most the value of y in the previous state plus some integer constant c.
arxiv
Span Programs for Functions with Constant-Sized 1-certificates [PDF]
arXiv, 2011 Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph.
arxiv