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

Physical Sciences and Mathematics Commons

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

Articles 1 - 9 of 9

Full-Text Articles in Physical Sciences and Mathematics

Machine Learning Applications For Drug Repurposing, Hansaim Lim Sep 2020

Machine Learning Applications For Drug Repurposing, Hansaim Lim

Dissertations, Theses, and Capstone Projects

The cost of bringing a drug to market is astounding and the failure rate is intimidating. Drug discovery has been of limited success under the conventional reductionist model of one-drug-one-gene-one-disease paradigm, where a single disease-associated gene is identified and a molecular binder to the specific target is subsequently designed. Under the simplistic paradigm of drug discovery, a drug molecule is assumed to interact only with the intended on-target. However, small molecular drugs often interact with multiple targets, and those off-target interactions are not considered under the conventional paradigm. As a result, drug-induced side effects and adverse reactions are often neglected …


A Semi-Automated Approach To Medical Image Segmentation Using Conditional Random Field Inference, Yu-Chi Hu Sep 2020

A Semi-Automated Approach To Medical Image Segmentation Using Conditional Random Field Inference, Yu-Chi Hu

Dissertations, Theses, and Capstone Projects

Medical image segmentation plays a crucial role in delivering effective patient care in various diagnostic and treatment modalities. Manual delineation of target volumes and all critical structures is a very tedious and highly time-consuming process and introduce uncertainties of treatment outcomes of patients. Fully automatic methods holds great promise for reducing cost and time, while at the same time improving accuracy and eliminating expert variability, yet there are still great challenges. Legally and ethically, human oversight must be integrated with ”smart tools” favoring a semi-automatic technique which can leverage the best aspects of both human and computer.

In this work …


Valid Time Rdf, Hsien-Tseng Wang Sep 2020

Valid Time Rdf, Hsien-Tseng Wang

Dissertations, Theses, and Capstone Projects

The Semantic Web aims at building a foundation of semantic-based data models and languages for not only manipulating data and knowledge, but also supporting decision making by machines. Naturally, time-varying data and knowledge are required in Semantic Web applications to incorporate time and further reason about it. However, the original specifications of Resource Description Framework (RDF) and Web Ontology Language (OWL) do not include constructs for handling time-varying data and knowledge. For simplicity, RDF model is confined to binary predicates, hence some form of reification is needed to represent higher-arity predicates. To this date, there are many proposals extending RDF …


Unclonable Secret Keys, Marios Georgiou Sep 2020

Unclonable Secret Keys, Marios Georgiou

Dissertations, Theses, and Capstone Projects

We propose a novel concept of securing cryptographic keys which we call “Unclonable Secret Keys,” where any cryptographic object is modified so that its secret key is an unclonable quantum bit-string whereas all other parameters such as messages, public keys, ciphertexts, signatures, etc., remain classical. We study this model in the authentication and encryption setting giving a plethora of definitions and positive results as well as several applications that are impossible in a purely classical setting.

In the authentication setting, we define the notion of one-shot signatures, a fundamental element in building unclonable keys, where the signing key not only …


Set Operators, Xiaojin Ye Sep 2020

Set Operators, Xiaojin Ye

Dissertations, Theses, and Capstone Projects

My research is centered on set operators. These are universally applicable regardless of the internal structure (numeric or non-numeric) of each individual observed datum. In our research, we have developed the theory of set operators to fill holes and gaps in observed data and eliminate paper shred garbage, thereby changing the observed symbolic data set into one whose pattern is closer to the pattern in the underlying population from which the observed data set was sampled with perturbations.

We describe different set operators including increasing operators, decreasing operators, ex- pansive operators, contractive operators, union preserving operators, intersection preserving op- erators, …


Role Of Influence In Complex Networks, Nur Dean Sep 2020

Role Of Influence In Complex Networks, Nur Dean

Dissertations, Theses, and Capstone Projects

Game theory is a wide ranging research area; that has attracted researchers from various fields. Scientists have been using game theory to understand the evolution of cooperation in complex networks. However, there is limited research that considers the structure and connectivity patterns in networks, which create heterogeneity among nodes. For example, due to the complex ways most networks are formed, it is common to have some highly “social” nodes, while others are highly isolated. This heterogeneity is measured through metrics referred to as “centrality” of nodes. Thus, the more “social” nodes tend to also have higher centrality.

In this thesis, …


New Approaches To Frequent And Incremental Frequent Pattern Mining, Mehmet Bicer Jun 2020

New Approaches To Frequent And Incremental Frequent Pattern Mining, Mehmet Bicer

Dissertations, Theses, and Capstone Projects

Data Mining (DM) is a process for extracting interesting patterns from large volumes of data. It is one of the crucial steps in Knowledge Discovery in Databases (KDD). It involves various data mining methods that mainly fall into predictive and descriptive models. Descriptive models look for patterns, rules, relationships and associations within data. One of the descriptive methods is association rule analysis, which represents co-occurrence of items or events. Association rules are commonly used in market basket analysis. An association rule is in the form of X → Y and it shows that X and Y co-occur with a given …


Novel Fast Algorithms For Low Rank Matrix Approximation, John T. Svadlenka Jun 2020

Novel Fast Algorithms For Low Rank Matrix Approximation, John T. Svadlenka

Dissertations, Theses, and Capstone Projects

Recent advances in matrix approximation have seen an emphasis on randomization techniques in which the goal was to create a sketch of an input matrix. This sketch, a random submatrix of an input matrix, having much fewer rows or columns, still preserves its relevant features. In one of such techniques random projections approximate the range of an input matrix. Dimension reduction transforms are obtained by means of multiplication of an input matrix by one or more matrices which can be orthogonal, random, and allowing fast multiplication by a vector. The Subsampled Randomized Hadamard Transform (SRHT) is the most popular among …


Robust Neural Machine Translation, Abdul Rafae Khan Feb 2020

Robust Neural Machine Translation, Abdul Rafae Khan

Dissertations, Theses, and Capstone Projects

This thesis aims for general robust Neural Machine Translation (NMT) that is agnostic to the test domain. NMT has achieved high quality on benchmarks with closed datasets such as WMT and NIST but can fail when the translation input contains noise due to, for example, mismatched domains or spelling errors. The standard solution is to apply domain adaptation or data augmentation to build a domain-dependent system. However, in real life, the input noise varies in a wide range of domains and types, which is unknown in the training phase. This thesis introduces five general approaches to improve NMT accuracy and …