Physical Sciences and Mathematics Commons^™

Comparative Analysis Of Kmer Counting And Estimation Tools, Ankitha Vejandla

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

The rapid development of next-generation sequencing (NGS) technologies for determining the sequence of DNA has revolutionized genome research in recent years. De novo assemblers are the most commonly used tools to perform genome assembly. Most of the assemblers use de Bruijn graphs that break the sequenced reads into smaller sequences (sub-strings), called kmers, where k denotes the length of the sub-strings. The kmer counting and analysis of kmer frequency distribution are important in genome assembly. The main goal of this research is to provide a detailed analysis of the performance of different kmer counting and estimation tools that are currently …

Agent Based Modeling Of The Spread Of Social Unrest Based On Infectious Disease Spread Model, Anup Adhikari

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Social unrest activities are the tools for people to show dissatisfaction, and often people are motivated by similar unrest activities in another region. This causes a spread of unrest activities across space and time. In this thesis, we model the spread of social unrest across time and space. The underlying novel methodology is to model the regions as agents that transition from one state to another based on changes in their environment. The methodology involves (1) creating a region vector for each agent based on socio-demographic, cultural, economic, infrastructural, geographic, and environmental (SCEIGE) factors, (2) formulating neighborhood distance function to …

Quantum State Estimation And Tracking For Superconducting Processors Using Machine Learning, Shiva Lotfallahzadeh Barzili

Computational and Data Sciences (PhD) Dissertations

Quantum technology has been rapidly growing; in particular, the experiments that have been performed with superconducting qubits and circuit QED have allowed us to explore the light-matter interaction at its most fundamental level. The study of coherent dynamics between two-level systems and resonator modes can provide insight into fundamental aspects of quantum physics, such as how the state of a system evolves while being continuously observed. To study such an evolving quantum system, experimenters need to verify the accuracy of state preparation and control since quantum systems are very fragile and sensitive to environmental disturbance. In this thesis, I look …

An Information-Theoretic Analysis Of Adherence To Physical Exercise Routines, Lily Foster

Computational and Data Sciences (MS) Theses

One of the most common recommendations in healthcare is to simply form healthy habits, but little research has been done to understand the formation and continuation of a healthy habit that isn’t heavily influenced by an individual’s interpretation. Arizona State University’s WalkIT study aimed to analyze how goal setting and financial reinforcement can influence moderate-to-vigorous physical activity (MVPA) in adults, while using data from accelerometers to alleviate individual bias. In this trial, 512 insufficiently active adults were recruited to wear an accelerometer for 1 year and were then randomly assigned to one of the four study groups. Each group had …

Numerical Studies Of Regularized Navier-Stokes Equations And An Application Of A Run-To-Run Control Model For Membrane Filtration At A Large Urban Water Treatment Facility, Jeffrey Belding

UNLV Theses, Dissertations, Professional Papers, and Capstones

This dissertation consists of two parts. The first part consists of research on accurate and efficient turbulent fluid flow modeling via a family of regularizations of the Navier-Stokes equation which are known as Time Relaxation models. In the second part, we look into the modeling application for the filtration/backwash process at the River Mountains Water Treatment Facility in Henderson, NV.

In the first two chapters, we introduce the Time Relaxation models and their associated differential filter equations. In addition, we develop the regularization method which employs the Nth van Cittert deconvolution operator, which gives rise to the family of models. …

From Language Comprehension Towards General Ai, Binay Dahal

UNLV Theses, Dissertations, Professional Papers, and Capstones

Language comprehension or more formally, natural language understanding is one of the major undertakings in Artificial Intelligence. In this work, we explore a few of the problems in language understanding using fixed deep learning models. Specifically, first, we look into question generation. Asking questions relates to the cognitive ability of language comprehension and context understanding. For that reason, making progress in question generation is significant. We introduce a novel task called “question generation with masked target answer” and propose various models and present the baseline result for the task. Next, we extend on the question generation task and develop a …

Calculating The Learning Rate Of A Neural Network Using A Genetic Algorithm, Eric Miller

UNLV Theses, Dissertations, Professional Papers, and Capstones

In the field of Computer Science, neural networks and genetic algorithms have become very popular tools in solving complex problems. Because of this growing popularity, there has been several attempts to combine the two concepts. Some of these attempts focused on using genetic algorithms to determine the best architecture, starting weights, or feature selection, to name of few of the applications. While a lot of the research that is available focuses on solving more than one element of the neural network design or is looking to use genetic algorithms to replace a part of the traditional neural network, such as …

Ab-Initio And Empirical Simulations Of Aluminum And Copper Metal, William Wolfs

UNLV Theses, Dissertations, Professional Papers, and Capstones

In this work, I perform detailed calculations on the bulk and electronic properties of aluminum and copper metal. Originally, I was motivated by experimental work on the solidsolid phase changes in pure aluminum. These phase changes were well predicted by density functional theory(DFT) but difficult or impossible to predict using embedded atom method potentials(EAM). EAM potentials are in wide use to describe many properties of bulk materials, and it seemed worrying that something so basic as a phase change could not be predicted. I began running high precision calculations with DFT and compared the results to EAM potentials which had …

Data Analytics In Hotel And Integrated Resort Brands: An Evaluation Of Past Literature And Proposed Research For The Future, Luke Andrew Walocko

UNLV Theses, Dissertations, Professional Papers, and Capstones

Data analytics in hotel and integrated resort brands is a growing strategy implemented to support business decisions designed to generate revenue or save costs. This study utilizes a literature review of data analytics related publications to provide recommendations on future research topics to improve the quality of literature related to data analytics in hotel and integrated resort brands. The study is not limited to hospitality specific research and uses research from all industries to identify gaps in publications for hospitality scholars to explore. Three proposed research questions for future exploration were composed based on the comparison of literature written for …

Conserved And Divergent Features Of Neuronal Camkii Holoenzyme Structure, Function, And Highorder Assembly, Olivia R. Buonarati, Adam P. Miller, Steven J. Coultrap, K. Ulrich Bayer, Steve L. Reichow

Chemistry Faculty Publications and Presentations

Neuronal CaMKII holoenzymes (^a and ^b isoforms) enable molecular signal computation underlying learning and memory but also mediate excitotoxic neuronal death. Here, we provide a comparative analysis of these signaling devices, using single-particle electron microscopy (EM) in combination with biochemical and live cell imaging studies. In the basal state, both isoforms assemble mainly as 12-mers (but also 14-mers and even 16-mers for the b isoform). CaMKIIa and ^b isoforms adopt an ensemble of extended activatable states (with average radius of 12.6 versus 16.8 nm, respectively), characterized by multiple transient intra- and interholoenzyme interactions associated with distinct functional properties. The …

Learning Large Neighborhood Search Policy For Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

We propose a deep reinforcement learning (RL) method to learn large neighborhood search (LNS) policy for integer programming (IP). The RL policy is trained as the destroy operator to select a subset of variables at each step, which is reoptimized by an IP solver as the repair operator. However, the combinatorial number of variable subsets prevents direct application of typical RL algorithms. To tackle this challenge, we represent all subsets by factorizing them into binary decisions on each variable. We then design a neural network to learn policies for each variable in parallel, trained by a customized actor-critic algorithm. We …

Solving The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Occasional Drivers By Simulated Annealing, Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-Chi Huang

Research Collection School Of Computing and Information Systems

This research studies the vehicle routing problem with simultaneous pickup and delivery with an occasional driver (VRPSPDOD). VRPSPDOD is a new variant of the vehicle routing problems with simultaneous pickup and delivery (VRPSPD). Different from VRPSPD, in VRPSPDOD, occasional drivers are employed to work with regular vehicles to service customers’ pickup and delivery requests in order to minimize the total cost. We formulate a mixed integer linear programming model for VRPSPD and propose a heuristic algorithm based on simulated annealing (SA) to solve the problem. The results of comprehensive numerical experiments show that the proposed SA performs well in terms …

Rmm: Reinforced Memory Management For Class-Incremental Learning, Yaoyao Liu, Qianru Sun, Qianru Sun

Research Collection School Of Computing and Information Systems

Class-Incremental Learning (CIL) [38] trains classifiers under a strict memory budget: in each incremental phase, learning is done for new data, most of which is abandoned to free space for the next phase. The preserved data are exemplars used for replaying. However, existing methods use a static and ad hoc strategy for memory allocation, which is often sub-optimal. In this work, we propose a dynamic memory management strategy that is optimized for the incremental phases and different object classes. We call our method reinforced memory management (RMM), leveraging reinforcement learning. RMM training is not naturally compatible with CIL as the …

Etherlearn: Decentralizing Learning Via Blockchain, Nguyen Binh Duong Ta, Tian Jun Joel Yang

Research Collection School Of Computing and Information Systems

In institutes of higher learning, most of the time course material development and delivery follow a centralized model which is fully lecturer-controlled. In this model, engaging students as partners in learning is a challenging problem as: 1) students are usually hesitant to contribute due to the fear of getting it wrong, 2) not much incentive for them to put in the extra effort, and 3) current online learning systems lack adequate facilities to support seamless and anonymous interactions between students. In this work, we propose EtherLearn, a blockchain based peer-learning system to distribute the control of how course material and …

Empirical Evaluation Of Minority Oversampling Techniques In The Context Of Android Malware Detection, Lwin Khin Shar, Nguyen Binh Duong Ta, David Lo

Research Collection School Of Computing and Information Systems

In Android malware classification, the distribution of training data among classes is often imbalanced. This causes the learning algorithm to bias towards the dominant classes, resulting in mis-classification of minority classes. One effective way to improve the performance of classifiers is the synthetic generation of minority instances. One pioneer technique in this area is Synthetic Minority Oversampling Technique (SMOTE) and since its publication in 2002, several variants of SMOTE have been proposed and evaluated on various imbalanced datasets. However, these techniques have not been evaluated in the context of Android malware detection. Studies have shown that the performance of SMOTE …

Statistical Moderation: A Case Study In Grading On A Curve, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

There is a negative perception about “grading on a curve,” because of the feeling that the cohort strength may skew the final grades one way or another. However, given the difficulties in ensuring absolute uniformity in assessment across the years, especially when taught and assessed by different instructors under different settings, grading on a curve may be a necessary evil. Once we accept this type of statistical moderation as the last line of defense in standardizing the final scores so that student cohorts from different terms or sections or schools may be compared, we have to implement it well. In …

Context-Aware Graph Convolutional Network For Dynamic Origin-Destination Prediction, Juan Nathaniel, Baihua Zheng

Research Collection School Of Computing and Information Systems

A robust Origin-Destination (OD) prediction is key to urban mobility. A good forecasting model can reduce operational risks and improve service availability, among many other upsides. Here, we examine the use of Graph Convolutional Net-work (GCN) and its hybrid Markov-Chain (GCN-MC) variant to perform a context-aware OD prediction based on a large-scale public transportation dataset in Singapore. Compared with the baseline Markov-Chain algorithm and GCN, the proposed hybrid GCN-MC model improves the prediction accuracy by 37% and 12% respectively. Lastly, the addition of temporal and historical contextual information further improves the performance of the proposed hybrid model by 4 –12%.

Fine-Grained Generalization Analysis Of Inductive Matrix Completion, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Marius Kloft

Research Collection School Of Computing and Information Systems

In this paper, we bridge the gap between the state-of-the-art theoretical results for matrix completion with the nuclear norm and their equivalent in \textit{inductive matrix completion}: (1) In the distribution-free setting, we prove bounds improving the previously best scaling of \widetilde{O}(rd2) to \widetilde{O}(d3/2√r), where d is the dimension of the side information and rr is the rank. (2) We introduce the (smoothed) \textit{adjusted trace-norm minimization} strategy, an inductive analogue of the weighted trace norm, for which we show guarantees of the order \widetilde{O}(dr) under arbitrary sampling. In the inductive case, a similar rate was previously achieved only under uniform sampling …

Beyond Smoothness : Incorporating Low-Rank Analysis Into Nonparametric Density Estimation, Rob Vandermeulen, Antoine Ledent

Research Collection School Of Computing and Information Systems

The construction and theoretical analysis of the most popular universally consistent nonparametric density estimators hinge on one functional property: smoothness. In this paper we investigate the theoretical implications of incorporating a multi-view latent variable model, a type of low-rank model, into nonparametric density estimation. To do this we perform extensive analysis on histogram-style estimators that integrate a multi-view model. Our analysis culminates in showing that there exists a universally consistent histogram-style estimator that converges to any multi-view model with a finite number of Lipschitz continuous components at a rate of ˜O(1/3√n) in L1 error. In contrast, the standard histogram estimator …

Strategic Behavior And Market Inefficiency In Blockchain-Based Auctions, Ping Fan Ke, Jianqing Chen, Zhiling Guo

Research Collection School Of Computing and Information Systems

Blockchain-based auctions play a key role in decentralized finance, such as liquidation of collaterals in crypto-lending. In this research, we show that a Blockchain-based auction is subject to the threat to availability because of the characteristics of the Blockchain platform, which could lead to auction inefficiency or even market failure. Specifically, an adversary could occupy all of the transaction capacity of an auction by sending transactions with sufficiently high transaction fees, and then win the item in an auction with a nearly zero bid price as there are no competitors available. We discuss how to prevent this kind of strategic …

Russian Logics And The Culture Of Impossible: Part 1. Recovering Intelligentsia Logics, Ksenia Tatarchenko, Anya Yermakova, Liesbeth De Mol

Research Collection College of Integrative Studies

This article reinterprets algorithmic rationality by looking at the interaction between mathematical logic, mechanized reasoning, and, later, computing in the Russian Imperial and Soviet contexts to offer a history of the algorithm as a mathematical object bridging the inner and outer worlds, a humanistic vision that we, following logician Vladimir Uspensky, call the “culture of the impossible.” We unfold the deep roots of this vision as embodied in scientific intelligentsia. In Part I, we examine continuities between the turn-of-the-twentieth-century discussions of poznaniye—an epistemic orientation towards the process of knowledge acquisition—and the postwar rise of the Soviet school of mathematical logic. …

Broadcast Authenticated Encryption With Keyword Search, Xueqiao Liu, Kai He, Guomin Yang, Willy Susilo, Joseph Tonien, Qiong Huang

Research Collection School Of Computing and Information Systems

The emergence of public-key encryption with keyword search (PEKS) has provided an elegant approach to enable keyword search over encrypted content. Due to its high computational complexity proportional to the number of intended receivers, the trivial way of deploying PEKS for data sharing with multiple receivers is impractical, which motivates the development of a new PEKS framework for broadcast mode. However, existing works suffer from either the vulnerability to keyword guessing attacks (KGA) or high computation and communication complexity. In this work, a new primitive for keyword search in broadcast mode, named broadcast authenticated encryption with keyword search (BAEKS), is …

Deriving Invariant Checkers For Critical Infrastructure Using Axiomatic Design Principles, Cheah Huei Yoong, Venkata Reddy Palleti, Rajib Ranjan Maiti, Arlindo Silva, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

Cyber-physical systems (CPSs) in critical infrastructure face serious threats of attack, motivating research into a wide variety of defence mechanisms such as those that monitor for violations of invariants, i.e. logical properties over sensor and actuator states that should always be true. Many approaches for identifying invariants attempt to do so automatically, typically using data logs, but these can miss valid system properties if relevant behaviours are not well-represented in the data. Furthermore, as the CPS is already built, resolving any design flaws or weak points identified through this process is costly. In this paper, we propose a systematic …

Self-Supervised Learning Disentangled Group Representation As Feature, Tan Wang, Zhongqi Yue, Jianqiang Huang, Qianru Sun, Hanwang Zhang

Research Collection School Of Computing and Information Systems

A good visual representation is an inference map from observations (images) to features (vectors) that faithfully reflects the hidden modularized generative factors (semantics). In this paper, we formulate the notion of “good” representation from a group-theoretic view using Higgins’ definition of disentangled representation [38], and show that existing Self-Supervised Learning (SSL) only disentangles simple augmentation features such as rotation and colorization, thus unable to modularize the remaining semantics. To break the limitation, we propose an iterative SSL algorithm: Iterative Partition-based Invariant Risk Minimization (IP-IRM), which successfully grounds the abstract semantics and the group acting on them into concrete contrastive learning. …

Automated Doubt Identification From Informal Reflections Through Hybrid Sentic Patterns And Machine Learning Approach, Siaw Ling Lo, Kar Way Tan, Eng Lieh Ouh

Research Collection School Of Computing and Information Systems

Do my students understand? The question that lingers in every instructor’s mind after each lesson. With the focus on learner-centered pedagogy, is it feasible to provide timely and relevant guidance to individual learners according to their levels of understanding? One of the options available is to collect reflections from learners after each lesson to extract relevant feedback so that doubts or questions can be addressed in a timely manner. In this paper, we derived a hybrid approach that leverages a novel Doubt Sentic Pattern Detection (SPD) algorithm and a machine learning model to automate the identification of doubts from students’ …

Data Fusion For Trust Evaluation, Zheng Yan, Qinghua Zheng, Laurence T. Yang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Trust evaluation is a process to quantify trust by analyzing the data related to the factors that affect trust. It has been widely applied in many fields to facilitate decision making, system entity collaboration and security establishment. For example, in social networking, trust evaluation helps users make a social decision, reduce the risk of social interactions, and ensure the quality of a social networking environment. In digital communications, trust evaluation can be applied to detect malicious nodes, filter unwanted traffic and improve communication security. In e-commerce and cloud services, trust evaluation helps users selecting an appropriate product or service from …

Robust Bipoly-Matching For Multi-Granular Entities, Ween Jiann Lee, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Entity matching across two data sources is a prevalent need in many domains, including e-commerce. Of interest is the scenario where entities have varying granularity, e.g., a coarse product category may match multiple finer categories. Previous work in one-to-many matching generally presumes the `one' necessarily comes from a designated source and the `many' from the other source. In contrast, we propose a novel formulation that allows concurrent one-to-many bidirectional matching in any direction. Beyond flexibility, we also seek matching that is more robust to noisy similarity values arising from diverse entity descriptions, by introducing receptivity and reclusivity notions. In addition …

On Analysing Student Resilience In Higher Education Programs Using A Data-Driven Approach, Audrey Tedja Widjaja, Ee Peng Lim, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Analysing student resilience is important as research has shown that resilience is related to students’ academic performance and their persistence through academic setbacks. While questionnaires can be conducted to assess student resilience directly, they suffer from human recall errors and deliberate suppression of true responses. In this paper, we propose ACREA, ACademic REsilience Analytics framework which adopts a datadriven approach to analyse student resilient behavior with the use of student-course data. ACREA defines academic setbacks experienced by students and measures how well students overcome such setbacks using a quasi-experimental design. By applying ACREA on a real world student-course dataset, we …

Microservices Orchestration Vs. Choreography: A Decision Framework, Alan @ Ali Madjelisi Megargel, Christopher M. Poskitt, Shankararaman, Venky

Research Collection School Of Computing and Information Systems

Microservices-based applications consist of loosely coupled, independently deployable services that encapsulate units of functionality. To implement larger application processes, these microservices must communicate and collaborate. Typically, this follows one of two patterns: (1) choreography, in which communication is done via asynchronous message-passing; or (2) orchestration, in which a controller is used to synchronously manage the process flow. Choosing the right pattern requires the resolution of some trade-offs concerning coupling, chattiness, visibility, and design. To address this problem, we propose a decision framework for microservices collaboration patterns that helps solution architects to crystallize their goals, compare the key factors, and then …

Degree Doesn't Matter: Identifying The Drivers Of Interaction In Software Development Ecosystem, Amrita Bhattacharjee, Subhajit Datta, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Large scale software development ecosystems represent one of the most complex human enterprises. In such settings, developers are embedded in a web of shared concerns, responsibilities, and objectives at individual and collective levels. A deep understanding of the factors that influence developers to connect with one another is crucial in appreciating the challenges of such ecosystems as well as formulating strategies to overcome those challenges. We use real world data from multiple software development ecosystems to construct developer interaction networks and examine the mechanisms of such network formation using statistical models to identify developer attributes that have maximal influence on …