Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm i » algorithm _ (Expand Search), algorithm a (Expand Search), algorithms _ (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
i function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm i » algorithm _ (Expand Search), algorithm a (Expand Search), algorithms _ (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
i function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
-
21
ADT: A Generalized Algorithm and Program for Beyond Born–Oppenheimer Equations of “<i>N</i>” Dimensional Sub-Hilbert Space
Published 2020“…It is noteworthy to mention that the nonadiabatic coupling terms (NACTs) often become singular (removable) at degenerate point(s) or along a seam in the nuclear configuration space (CS) and thereby, a unitary transformation is required to convert the kinetically coupled (adiabatic) Hamiltonian to a potentially (diabatic) one to avoid such singularity(ies). The “ADT” program can be efficiently used to (a) formulate analytic functional forms of differential equations for ADT angles and diabatic potential energy matrix and (b) solve the set of coupled differential equations numerically to evaluate ADT angles, residue due to singularity(ies), ADT matrices, and finally, diabatic potential energy surfaces (PESs). …”
-
22
-
23
-
24
-
25
-
26
-
27
-
28
-
29
-
30
-
31
-
32
a) FO Function, b) FI function.
Published 2023“…The SRL32 primitive (Reconfigurable Look up Tables—RLUTs) and DPR (Dynamic Partial Reconfiguration) are employed to reconfigure single round MISTY1 / KASUMI algorithms on the run-time. The RLUT based architecture attains dynamic logic functionality without extra hardware resources by internally modifying the LUT contents. …”
-
33
-
34
-
35
-
36
-
37
-
38
-
39
-
40