Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 12 of 12

Full-Text Articles in Physical Sciences and Mathematics

Extensions Of Snomed Taxonomy Abstraction Networks Supporting Auditing And Complexity Analysis, Duo Wei Aug 2011

Extensions Of Snomed Taxonomy Abstraction Networks Supporting Auditing And Complexity Analysis, Duo Wei

Dissertations

The Systematized Nomenclature of Medicine – Clinical Terms (SNOMED CT) has been widely used as a standard terminology in various biomedical domains. The enhancement of the quality of SNOMED contributes to the improvement of the medical systems that it supports.

In previous work, the Structural Analysis of Biomedical Ontologies Center (SABOC) team has defined the partial-area taxonomy, a hierarchical abstraction network consisting of units called partial-areas. Each partial-area comprises a set of SNOMED concepts exhibiting a particular relationship structure and being distinguished by a unique root concept. In this dissertation, some extensions and applications of the taxonomy framework are considered. …


Security Systems Based On Gaussian Integers : Analysis Of Basic Operations And Time Complexity Of Secret Transformations, Aleksey Koval Aug 2011

Security Systems Based On Gaussian Integers : Analysis Of Basic Operations And Time Complexity Of Secret Transformations, Aleksey Koval

Dissertations

Many security algorithms currently in use rely heavily on integer arithmetic modulo prime numbers. Gaussian integers can be used with most security algorithms that are formulated for real integers. The aim of this work is to study the benefits of common security protocols with Gaussian integers. Although the main contribution of this work is to analyze and improve the application of Gaussian integers for various public key (PK) algorithms, Gaussian integers were studied in the context of image watermarking as well.

The significant benefits of the application of Gaussian integers become apparent when they are used with Discrete Logarithm Problem …


Investigation On Advanced Image Search Techniques, Abhishek Verma Aug 2011

Investigation On Advanced Image Search Techniques, Abhishek Verma

Dissertations

Content-based image search for retrieval of images based on the similarity in their visual contents, such as color, texture, and shape, to a query image is an active research area due to its broad applications. Color, for example, provides powerful information for image search and classification. This dissertation investigates advanced image search techniques and presents new color descriptors for image search and classification and robust image enhancement and segmentation methods for iris recognition.

First, several new color descriptors have been developed for color image search. Specifically, a new oRGB-SIFT descriptor, which integrates the oRGB color space and the Scale-Invariant Feature …


Development Of Advanced Algorithms To Detect, Characterize And Forecast Solar Activities, Yuan Yuan May 2011

Development Of Advanced Algorithms To Detect, Characterize And Forecast Solar Activities, Yuan Yuan

Dissertations

Study of the solar activity is an important part of space weather research. It is facing serious challenges because of large data volume, which requires application of state-of-the-art machine learning and computer vision techniques. This dissertation targets at two essential aspects in space weather research: automatic feature detection and forecasting of eruptive events.

Feature detection includes solar filament detection and solar fibril tracing. A solar filament consists of a mass of gas suspended over the chromosphere by magnetic fields and seen as a dark, ribbon-shaped feature on the bright solar disk in Hα (Hydrogen-alpha) full-disk solar images. In this dissertation, …


Applications Of Stochastic Simulation In Two-Stage Multiple Comparisons With The Best Problem And Time Average Variance Constant Estimation, Dibyendu Chakrabarti May 2011

Applications Of Stochastic Simulation In Two-Stage Multiple Comparisons With The Best Problem And Time Average Variance Constant Estimation, Dibyendu Chakrabarti

Dissertations

In this dissertation, we study two problems. In the first part, we consider the two-stage methods for comparing alternatives using simulation. Suppose there are a finite number of alternatives to compare, with each alternative having an unknown parameter that is the basis for comparison. The parameters are to be estimated using simulation, where the alternatives are simulated independently. We develop two-stage selection and multiple-comparison procedures for simulations under a general framework. The assumptions are that each alternative has a parameter estimation process that satisfies a random- time-change central limit theorem (CLT), and there is a weakly consistent variance estimator (WCVE) …


Active Caching For Recommender Systems, Muhammad Umar Qasim May 2011

Active Caching For Recommender Systems, Muhammad Umar Qasim

Dissertations

Web users are often overwhelmed by the amount of information available while carrying out browsing and searching tasks. Recommender systems substantially reduce the information overload by suggesting a list of similar documents that users might find interesting. However, generating these ranked lists requires an enormous amount of resources that often results in access latency. Caching frequently accessed data has been a useful technique for reducing stress on limited resources and improving response time. Traditional passive caching techniques, where the focus is on answering queries based on temporal locality or popularity, achieve a very limited performance gain. In this dissertation, we …


Dynamic-Parinet (D-Parinet) : Indexing Present And Future Trajectories In Networks, Mou Nandi May 2011

Dynamic-Parinet (D-Parinet) : Indexing Present And Future Trajectories In Networks, Mou Nandi

Theses

While indexing historical trajectories is a hot topic in the field of moving objects (MO) databases for many years, only a few of them consider that the objects movements are constrained. DYNAMIC-PARINET (D-PATINET) is designed for capturing of trajectory data flow in multiple discrete small time interval efficiently and to predict a MO’s movement or the underlying network state at a future time.

The cornerstone of D-PARINET is PARINET, an efficient index for historical trajectory data. The structure of PARINET is based on a combination of graph partitioning and a set of composite B+-tree local indexes tuned for a given …


Fast Program For Sequence Alignment Using Partition Function Posterior Probabilities, Meera Prasad May 2011

Fast Program For Sequence Alignment Using Partition Function Posterior Probabilities, Meera Prasad

Theses

The key requirements of a good sequence alignment tool are high accuracy and fast execution. The existing Probalign program is a highly accurate tool for sequence alignment of both proteins and nucleotides. However, the time for execution is fairly high. The focus is therefore, to reduce the running time of the existing version of Probalign, maintaining its current accuracy level.

The thesis conducts a detail analysis of the performance of Probalign to bring down the running time of the existing code. A modified version of Probalign, Version 1.4 is released. A new program for sequence alignment with faster computation is …


Ranking Single Nucleotide Polymorphisms With Support Vector Regression In Continuous Phenotypes, Seif Shahidain May 2011

Ranking Single Nucleotide Polymorphisms With Support Vector Regression In Continuous Phenotypes, Seif Shahidain

Theses

Support vector machines (SVM) have been used to improve the ranking of single nucleotide polymorphisms (SNPs) over traditional chi-square tests in disease case studies [2]. In this investigation, ranking SNPs with support vector regression (SVR) was compared to the Wald test in predicting continuous phenotypes. SVR-ranked SNPs consistently outperformed the Wald test-ranked SNPs to provide a more accurate prediction of the phenotype with fewer SNPs across several methods of prediction.


A Molecular Dynamics Simulation Based Principal Component Analysis Framework For Computation Of Multi-Scale Modeling Of Protein And Its Interaction With Solvent, Tao Wu Jan 2011

A Molecular Dynamics Simulation Based Principal Component Analysis Framework For Computation Of Multi-Scale Modeling Of Protein And Its Interaction With Solvent, Tao Wu

Dissertations

This dissertation presents a new computational framework for calculating the normal modes and interactions of proteins, macromolecular assemblies and surrounding solvents. The framework employs a combination of molecular dynamics simulation (MD) and principal component analysis (PCA). It enables the capture and visualization of the molecules' normal modes and interactions over time scales that are computationally challenging. It also provides a starting point for experimental and further computational studies of protein conformational changes.

A protein's function is sometimes linked to its conformational flexibility. Normal mode analysis (NMA) and various extensions of it have provided insights into the conformational fluctuations associated with …


Face Recognition Using Multiple Features In Different Color Spaces, Zhiming Liu Jan 2011

Face Recognition Using Multiple Features In Different Color Spaces, Zhiming Liu

Dissertations

Face recognition as a particular problem of pattern recognition has been attracting substantial attention from researchers in computer vision, pattern recognition, and machine learning. The recent Face Recognition Grand Challenge (FRGC) program reveals that uncontrolled illumination conditions pose grand challenges to face recognition performance. Most of the existing face recognition methods use gray-scale face images, which have been shown insufficient to tackle these challenges. To overcome this challenging problem in face recognition, this dissertation applies multiple features derived from the color images instead of the intensity images only.

First, this dissertation presents two face recognition methods, which operate in different …


Aminormotiffinder - A Graph Grammar Based Tool To Effectively Search A Minor Motifs In 3d Rna Molecules, Ankur Malhotra Jan 2011

Aminormotiffinder - A Graph Grammar Based Tool To Effectively Search A Minor Motifs In 3d Rna Molecules, Ankur Malhotra

Theses

RNA Motifs are three dimensional folds that play important role in RNA folding and its interaction with other molecules. They basically have modular structure and are composed of conserved building blocks dependent upon the sequence. Their automated in silico identification remains a challenging task. Existing motif identification tools does not correctly identify motifs with large structure variations. Here a “graph rewriting” based method is proposed to identify motifs in real three dimensional structures. The unique encoding of A Minor Searcher takes into consideration the non canonical base pairs and also multipairing of RNA structural motifs. The accuracy is demonstrated by …