Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Metropolis sampling"”.
-
The visualization of chemical bonding motifs from many-electron wavefunctions: Dynamic Voronoi Metropolis Sampling
… from the average position of Monte Carlo walkers sampling |Ψ|2, determines a self-consistent partitioning of the wavefunction. When one of the identical 3N-dimensional Voronoi sites is projected onto the coordinates of each electron, chemical motifs are naturally revealed. The structures of some …
-
Clustering Analysis of Zernike Coefficients Through Quantile Regression
… We employ Gibbs sampler and adaptive rejection Metropolis sampling to infer the parameters for each cluster. Bayesian information criterion (BIC) combined with a measure of uncertainty are used to determine the number of clusters. A comparison of likelihoods between the unclustered and the …
-
Development of Novel Bayesian Models of Environmental Systems with Application to the Prairie Wetlands of North America
… such as the Gibbs sampler and random walk Metropolis sampling. These findings enable the enumeration and estimation of an enormous variety of new models spanning a range of process specificities from purely empirical to purely mechanistic forms, all within the same coherent joint parameter …
-
Order Picking Optimization as a Service
… We mainly rely on Monte Carlo methods, including Metropolis sampling and Nested Annealing, Sequential Minimal Distance (SMD), restart heuristics, cost approximation using the Quadratic Assignment Problem (QAP) and sub-optimal PRP optimization. Results show that costs found at early stages in …
-
Bayesian Approach Dealing with Mixture Model Problems
… models. The first topic is Adaptive Rejection Metropolis Simulated Annealing for Detecting Global Maximum Regions, and the second topic is Bayesian Model Selection for Nonlinear Mixed Effects Model. In the first topic, we consider a finite mixture model, which is used to fit the data from …
-
Quantum algorithms for searching, resampling, and hidden shift problems
… based search algorithms, (2) quantum rejection sampling, and (3) the Boolean function hidden shift problem. The first two parts deal with generic techniques for constructing quantum algorithms, and the last part is on quantum algorithms for a specific algebraic problem. In the first part of this …
-
Strand Passage And Knotting Probabilities In An Interacting Self-Avoiding Polygon Model
… by Szafron (2000, 2009) to include energy-based Metropolis sampling. This modification allows one to sample Theta-SAPs of a particular knot type and connection class based on a priori chosen solvent conditions. Multiple simulations (each consisting of 40 billion time steps) of composite Markov …
-
From network to pathway: integrative network analysis of genomic data
… a statistically principled method, namely Metropolis random walk on graph (MRWOG), to highlight condition-specific PPI sub-networks in a probabilistic way. The method is based on the Markov chain Monte Carlo (MCMC) theory to generate a series of samples that will eventually converge to some …