Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Exploratory Search With Archetype-Based Language Models, Brent D. Davis
Exploratory Search With Archetype-Based Language Models, Brent D. Davis
Electronic Thesis and Dissertation Repository
This dissertation explores how machine learning, natural language processing and information retrieval may assist the exploratory search task. Exploratory search is a search where the ideal outcome of the search is unknown, and thus the ideal language to use in a retrieval query to match it is unavailable. Three algorithms represent the contribution of this work. Archetype-based Modeling and Search provides a way to use previously identified archetypal documents relevant to an archetype to form a notion of similarity and find related documents that match the defined archetype. This is beneficial for exploratory search as it can generalize beyond standard …
Algorithms For Glycan Structure Identification With Tandem Mass Spectrometry, Weiping Sun
Algorithms For Glycan Structure Identification With Tandem Mass Spectrometry, Weiping Sun
Electronic Thesis and Dissertation Repository
Glycosylation is a frequently observed post-translational modification (PTM) of proteins. It has been estimated over half of eukaryotic proteins in nature are glycoproteins. Glycoprotein analysis plays a vital role in drug preparation. Thus, characterization of glycans that are linked to proteins has become necessary in glycoproteomics. Mass spectrometry has become an effective analytical technique for glycoproteomics analysis because of its high throughput and sensitivity. The large amount of spectral data collected in a mass spectrometry experiment makes manual interpretation impossible and requires effective computational approaches for automated analysis. Different algorithmic solutions have been proposed to address the challenges in glycoproteomics …
Computing Intersection Multiplicity Via Triangular Decomposition, Paul Vrbik
Computing Intersection Multiplicity Via Triangular Decomposition, Paul Vrbik
Electronic Thesis and Dissertation Repository
Fulton’s algorithm is used to calculate the intersection multiplicity of two plane curves about a rational point. This work extends Fulton’s algorithm first to algebraic points (encoded by triangular sets) and then, with some generic assumptions, to l many hypersurfaces.
Out of necessity, we give a standard-basis free method (i.e. practically efficient method) for calculating tangent cones at points on curves.