8 resultados para Ordered subsets – Expectation maximization (OS-EM)
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 investigated, retrospectively, whether recidivism in a sample of court-ordered'graduates of an alcohol education and awareness program could be predicted. This alcohol education program was based on adult education principles and was philosophically akin to the thoughts of Drs. Jack Mezirow, Stephen Brookfield, and Patricia Cranton. Data on the sample of 214 Halton IDEA (Impaired Driver Education and Awareness) graduates were entered into a spread sheet. Descriptive statistics were generated. Each of the 214 program graduates had taken several tests during the course of the IDEA program. These tests measured knowledge, attitude about impaired driving, and degree of alcohol involvement. Test scores were analyzed to determine whether those IDEA graduates who recidivated differed in any measurable way from those who had no further criminal convictions after a period of at least three years. Their criminal records were obtained from the Canadian Police Information Centre (CPIC). Those program graduates who reoffended were compared to the vast majority who did not reoffend. Results of the study indicated that there was no way to determine who would recidivate from the data that were collected. Further studies could use a qualitative model. Follow-up interviews could be used to determine what impact, if any, attendance at the IDEA program had on the life of the graduates.
Resumo:
15th Congress, 1st session, 1817-1818, House. Doc. 81.
Resumo:
15th Congress, 1st session, 1817-1818, House. Doc. 81. February 20, 1817. Read, and ordered to lie upon the table.
Resumo:
Includes (p. 3-4) a letter from the Acting Secretary of War to the chairman of the committee dated Department of War, December 26th, 1816.
Resumo:
Concerning the request of the petitioners, former residents of Newark (present-day Niagara-on-the-Lake) in Upper Canada, for relief for the loss of their property when they were compelled to flee Canada after having aided the United States Army in the War of 1812.
Resumo:
Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.
Resumo:
List of goods including pots, food and nails ordered by Robert Nelles (2 ½ pages, handwritten). The item is stained and slightly torn, but legible, July 4, 1824.