Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Analysis Of Github Pull Requests, Canon Ellis
Analysis Of Github Pull Requests, Canon Ellis
Computer Science and Engineering Theses and Dissertations
The popularity of the software repository site GitHub has created a rise in the Pull Based Development Models' use. An essential portion of pull-based development is the creation of Pull Requests. Pull Requests often have to be reviewed by an individual to be approved and accepted into the Master branch of a software repository. The reviewing process can often be time-consuming and introduce a relatively high level of lost development time. This paper examines thousands of pull requests to understand the most valuable metadata of pull requests. We then introduce metrics in comparing the metadata of pull requests to understand …
Analyzing Performance, Energy Consumption, And Reliability Of Mobile Applications, Osama Barack
Analyzing Performance, Energy Consumption, And Reliability Of Mobile Applications, Osama Barack
Computer Science and Engineering Theses and Dissertations
Mobile applications have become a high priority for software developers. Researchers and practitioners are working toward improving and optimizing the energy efficiency and performance of mobile applications due to the capacity limitation of mobile device processors and batteries. In addition, mobile applications have become popular among end-users, developers have introduced a wide range of features that increase the complexity of application code.
To improve and enhance the maintainability, extensibility, and understandability of application code, refactoring techniques were introduced. However, implementing such techniques to mobile applications affects energy efficiency and performance. To evaluate and categorize software implementation and optimization efficiency, several …
Deep Neural Network Based Student Response Modeling With Uncertainty, Multimodality And Attention, Xinyi Ding
Deep Neural Network Based Student Response Modeling With Uncertainty, Multimodality And Attention, Xinyi Ding
Computer Science and Engineering Theses and Dissertations
In this thesis, I investigate deep neural network based student response modeling, more specifically Knowledge Tracing (KT). Knowledge Tracing allows Intelligent Tutoring Systems to infer which topics or skills a student has mastered, thus adjusting curriculum accordingly. Deep neural network based knowledge tracing models like Deep Knowledge Tracing (DKT) and Dynamic Key-Value Memory Network (DKVMN) have achieved significant improvements compared with conventional probabilistic models. There are mainly two goals in this thesis: 1) To have a better understanding of existing deep neural network based models and their predictions through visualization and through incorporating uncertainties. 2) To improve the performance of …
Cognition And Context-Aware Computing: Towards A Situation-Aware System With A Case Study In Aviation, Justin C. Wilson
Cognition And Context-Aware Computing: Towards A Situation-Aware System With A Case Study In Aviation, Justin C. Wilson
Computer Science and Engineering Theses and Dissertations
In aviation, flight instructors seek to comprehend the intent and awareness of their students. With this awareness, derived from in-flight observation and post-flight examination, a human instructor can infer the internal contexts of their student aviators as they perform. It is this understanding that is fundamental for evaluating student development. Further, a well-understood construct for describing the state of knowledge about a dynamic environment is known as situational awareness (SA). Often pilot error is associated with SA [80], and it is fundamental to flight safety and mission execution. If these contexts can be automatically inferred, instructors and students can more …
The Prom Problem: Fair And Privacy-Enhanced Matchmaking With Identity Linked Wishes, Dwight Horne
The Prom Problem: Fair And Privacy-Enhanced Matchmaking With Identity Linked Wishes, Dwight Horne
Computer Science and Engineering Theses and Dissertations
In the Prom Problem (TPP), Alice wishes to attend a school dance with Bob and needs a risk-free, privacy preserving way to find out whether Bob shares that same wish. If not, no one should know that she inquired about it, not even Bob. TPP represents a special class of matchmaking challenges, augmenting the properties of privacy-enhanced matchmaking, further requiring fairness and support for identity linked wishes (ILW) – wishes involving specific identities that are only valid if all involved parties have those same wishes.
The Horne-Nair (HN) protocol was proposed as a solution to TPP along with a …
Automating Cyber Analytics, Matthew Zaber
Automating Cyber Analytics, Matthew Zaber
Computer Science and Engineering Theses and Dissertations
Model based security metrics are a growing area of cyber security research concerned with measuring the risk exposure of an information system. These metrics are typically studied in isolation, with the formulation of the test itself being the primary finding in publications. As a result, there is a flood of metric specifications available in the literature but a corresponding dearth of analyses verifying results for a given metric calculation under different conditions or comparing the efficacy of one measurement technique over another. The motivation of this thesis is to create a systematic methodology for model based security metric development, analysis, …
Heuristics For Sparsest Cut Approximations In Network Flow Applications, Fernando Vilas
Heuristics For Sparsest Cut Approximations In Network Flow Applications, Fernando Vilas
Computer Science and Engineering Theses and Dissertations
The Maximum Concurrent Flow Problem (MCFP) is a polynomially bounded problem that has been used over the years in a variety of applications. Sometimes it is used to attempt to find the Sparsest Cut, an NP-hard problem, and other times to find communities in Social Network Analysis (SNA) in its hierarchical formulation, the HMCFP. Though it is polynomially bounded, the MCFP quickly grows in space utilization, rendering it useful on only small problems. When it was defined, only a few hundred nodes could be solved, where a few decades later, graphs of one to two thousand nodes can still be …