5 resultados para Minimal maps for coincidence
em Brock University, Canada
Resumo:
Our objective is to develop a diffusion Monte Carlo (DMC) algorithm to estimate the exact expectation values, ($o|^|^o), of multiplicative operators, such as polarizabilities and high-order hyperpolarizabilities, for isolated atoms and molecules. The existing forward-walking pure diffusion Monte Carlo (FW-PDMC) algorithm which attempts this has a serious bias. On the other hand, the DMC algorithm with minimal stochastic reconfiguration provides unbiased estimates of the energies, but the expectation values ($o|^|^) are contaminated by ^, an user specified, approximate wave function, when A does not commute with the Hamiltonian. We modified the latter algorithm to obtain the exact expectation values for these operators, while at the same time eliminating the bias. To compare the efficiency of FW-PDMC and the modified DMC algorithms we calculated simple properties of the H atom, such as various functions of coordinates and polarizabilities. Using three non-exact wave functions, one of moderate quality and the others very crude, in each case the results are within statistical error of the exact values.
Resumo:
This study was conducted to measure the degree of adherence by public health care providers to a policy that requires them to implement minimal contact intervention for tobacco cessation with their clients. This study also described what components of the intervention may have contributed to the adherence of the policy and how health care providers felt about adhering to the policy. The intervention consisted of a policy for implementation of minimal contact intervention, changes to documentation, a health care provider mentor trained, a training session for health care providers, and ongoing paper and people supports for implementation. Data for this study were collected through a health care provider questionnaire, focus group interviews, and a compliance protocol including a chart audit. The findings of this study showed a high degree of adherence to the policy, that health care providers thought minimal contact intervention was important to conduct with their clients, and that health care providers felt supported to implement the intervention. No statistically significant difference was found between new and experienced health care providers on 17 of the 18 questions on the health care provider questionnaire. However there was a statistically significant difference between new and experienced health care providers with respect to their perception that “clients often feel like they have to accept tobacco cessation information from me.” Changes could be made to the minimal contact intervention and to documentation of the intervention. Implications for future research include implementation within other programs within Hamilton Public Health Services and implementation of this model within other public health units and other types of health care providers within Ontario.
Resumo:
The goal of most clustering algorithms is to find the optimal number of clusters (i.e. fewest number of clusters). However, analysis of molecular conformations of biological macromolecules obtained from computer simulations may benefit from a larger array of clusters. The Self-Organizing Map (SOM) clustering method has the advantage of generating large numbers of clusters, but often gives ambiguous results. In this work, SOMs have been shown to be reproducible when the same conformational dataset is independently clustered multiple times (~100), with the help of the Cramérs V-index (C_v). The ability of C_v to determine which SOMs are reproduced is generalizable across different SOM source codes. The conformational ensembles produced from MD (molecular dynamics) and REMD (replica exchange molecular dynamics) simulations of the penta peptide Met-enkephalin (MET) and the 34 amino acid protein human Parathyroid Hormone (hPTH) were used to evaluate SOM reproducibility. The training length for the SOM has a huge impact on the reproducibility. Analysis of MET conformational data definitively determined that toroidal SOMs cluster data better than bordered maps due to the fact that toroidal maps do not have an edge effect. For the source code from MATLAB, it was determined that the learning rate function should be LINEAR with an initial learning rate factor of 0.05 and the SOM should be trained by a sequential algorithm. The trained SOMs can be used as a supervised classification for another dataset. The toroidal 10×10 hexagonal SOMs produced from the MATLAB program for hPTH conformational data produced three sets of reproducible clusters (27%, 15%, and 13% of 100 independent runs) which find similar partitionings to those of smaller 6×6 SOMs. The χ^2 values produced as part of the C_v calculation were used to locate clusters with identical conformational memberships on independently trained SOMs, even those with different dimensions. The χ^2 values could relate the different SOM partitionings to each other.