Neural network-based shape retrieval using moment invariants and Zernike moments.

Shape is one of the fundamental image features for use in Content-Based Image Retrieval (CBIR). Compared with other visual features such as color and texture, it is extremely powerful and provides capability for object recognition and similarity-based image retrieval. In this thesis, we propose a Neural Network-Based Shape Retrieval System using Moment Invariants and Zernike Moments. Moment Invariants and Zernike Moments are two region-based shape representation schemes and are derived from the shape in an image and serve as image features. k means clustering is used to group similar images in an image collection into k clusters whereas Neural Network is used to facilitate retrieval against a given query image. Neural Network is trained by the clustering result on all of the images in the collection using back-propagation algorithm. In this scheme, Neural Network serves as a classifier such that moments are inputs to the Neural Network and the output is one of the k classes that have the largest similarities to the query image. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .C444. Source: Masters Abstracts International, Volume: 44-03, page: 1396. Thesis (M.Sc.)--University of Windsor (Canada), 2005

Never a \u27needless\u27 suicide: An empirical test of Shneidman\u27s theory of psychological needs, psychological pain, and suicidality (Edwin Shneidman).

The phenomenology of suicidal thoughts and behaviour has been an area of increased interest in recent years. One particular area of focus is psychological pain, or psychache. In this dissertation, Edwin Shneidman\u27s psychological theory of suicide was studied. Shneidman has theorized that psychological needs are associated with the development of psychological pain, which in turn leads to suicide as an escape from pain. Two hundred and fifty-seven undergraduate students completed the Personality Research Form, the Psychache Scale, the Orbach and Mikulincer Mental Pain Scale, two items from Shneidman\u27s Psychological Pain Assessment Scale, as well as demographic and suicide history items. Measures of psychological pain demonstrated convergent validity. Low need for affiliation and high impulsivity were significantly related to psychological pain. All measures of psychological pain were associated with suicidal ideation and history of suicide attempts. Possible gender differences emerged. This study provides some evidence for Shneidman\u27s theory, although not all identified needs were supported. The importance of understanding the role of psychological pain in the phenomenology of suicidal thinking and behaviour is emphasized.Dept. of Psychology. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .D375. Source: Dissertation Abstracts International, Volume: 66-11, Section: B, page: 6267. Thesis (Ph.D.)--University of Windsor (Canada), 2005

Estimating SUR Tobit Model while errors are gaussian scale mixtures: with an application to high frequency financial data

This paper examines multivariate Tobit system with Scale mixture disturbances. Three estimation methods, namely Maximum Simulated Likelihood, Expectation Maximization Algorithm and Bayesian MCMC simulators, are proposed and compared via generated data experiments. The chief finding is that Bayesian approach outperforms others in terms of accuracy, speed and stability. The proposed model is also applied to a real data set and study the high frequency price and trading volume dynamics. The empirical results confirm the information contents of historical price, lending support to the usefulness of technical analysis. In addition, the scale mixture model is also extended to sample selection SUR Tobit and finite Gaussian regime mixtures.Tobit; Gaussian mixtures; Bayesian

Coupled Vlasov and two-fluid codes on GPUs

We present a way to combine Vlasov and two-fluid codes for the simulation of a collisionless plasma in large domains while keeping full information of the velocity distribution in localized areas of interest. This is made possible by solving the full Vlasov equation in one region while the remaining area is treated by a 5-moment two-fluid code. In such a treatment, the main challenge of coupling kinetic and fluid descriptions is the interchange of physically correct boundary conditions between the different plasma models. In contrast to other treatments, we do not rely on any specific form of the distribution function, e.g. a Maxwellian type. Instead, we combine an extrapolation of the distribution function and a correction of the moments based on the fluid data. Thus, throughout the simulation both codes provide the necessary boundary conditions for each other. A speed-up factor of around 20 is achieved by using GPUs for the computationally expensive solution of the Vlasov equation and an overall factor of at least 60 using the coupling strategy combined with the GPU computation. The coupled codes were then tested on the GEM reconnection challenge

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes

Spatially-coupled LDPC codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially-coupled ensembles when transmission takes place over the binary erasure channel. We discuss how the parameters of the scaling law are connected to fundamental quantities appearing in the asymptotic analysis of these ensembles and we verify that the predictions of the scaling law fit well to the data derived from simulations over a wide range of parameters. The ultimate goal of this line of research is to develop analytic tools for the design of spatially-coupled LDPC codes under practical constraints

Simulation of 1+1 dimensional surface growth and lattices gases using GPUs

Restricted solid on solid surface growth models can be mapped onto binary lattice gases. We show that efficient simulation algorithms can be realized on GPUs either by CUDA or by OpenCL programming. We consider a deposition/evaporation model following Kardar-Parisi-Zhang growth in 1+1 dimensions related to the Asymmetric Simple Exclusion Process and show that for sizes, that fit into the shared memory of GPUs one can achieve the maximum parallelization speedup ~ x100 for a Quadro FX 5800 graphics card with respect to a single CPU of 2.67 GHz). This permits us to study the effect of quenched columnar disorder, requiring extremely long simulation times. We compare the CUDA realization with an OpenCL implementation designed for processor clusters via MPI. A two-lane traffic model with randomized turning points is also realized and the dynamical behavior has been investigated.Comment: 20 pages 12 figures, 1 table, to appear in Comp. Phys. Com

QMCPACK: Advances in the development, efficiency, and application of auxiliary field and real-space variational and diffusion Quantum Monte Carlo

We review recent advances in the capabilities of the open source ab initio Quantum Monte Carlo (QMC) package QMCPACK and the workflow tool Nexus used for greater efficiency and reproducibility. The auxiliary field QMC (AFQMC) implementation has been greatly expanded to include k-point symmetries, tensor-hypercontraction, and accelerated graphical processing unit (GPU) support. These scaling and memory reductions greatly increase the number of orbitals that can practically be included in AFQMC calculations, increasing accuracy. Advances in real space methods include techniques for accurate computation of band gaps and for systematically improving the nodal surface of ground state wavefunctions. Results of these calculations can be used to validate application of more approximate electronic structure methods including GW and density functional based techniques. To provide an improved foundation for these calculations we utilize a new set of correlation-consistent effective core potentials (pseudopotentials) that are more accurate than previous sets; these can also be applied in quantum-chemical and other many-body applications, not only QMC. These advances increase the efficiency, accuracy, and range of properties that can be studied in both molecules and materials with QMC and QMCPACK

Automatic visual recognition using parallel machines

Invariant features and quick matching algorithms are two major concerns in the area of automatic visual recognition. The former reduces the size of an established model database, and the latter shortens the computation time. This dissertation, will discussed both line invariants under perspective projection and parallel implementation of a dynamic programming technique for shape recognition. The feasibility of using parallel machines can be demonstrated through the dramatically reduced time complexity. In this dissertation, our algorithms are implemented on the AP1000 MIMD parallel machines. For processing an object with a features, the time complexity of the proposed parallel algorithm is O(n), while that of a uniprocessor is O(n2). The two applications, one for shape matching and the other for chain-code extraction, are used in order to demonstrate the usefulness of our methods. Invariants from four general lines under perspective projection are also discussed in here. In contrast to the approach which uses the epipolar geometry, we investigate the invariants under isotropy subgroups. Theoretically speaking, two independent invariants can be found for four general lines in 3D space. In practice, we show how to obtain these two invariants from the projective images of four general lines without the need of camera calibration. A projective invariant recognition system based on a hypothesis-generation-testing scheme is run on the hypercube parallel architecture. Object recognition is achieved by matching the scene projective invariants to the model projective invariants, called transfer. Then a hypothesis-generation-testing scheme is implemented on the hypercube parallel architecture