The CubeSat pico-satellite is gaining popularity in both the educational and aerospace industries. Due to a lack of experience and constrained hardware capabilities, most of the university missions have been educational in nature. Cal Poly's project, PolySat, has gained significant experience from the launch of five CubeSats and has designed an entirely new hardware platform based on the knowledge gained from these missions. This hardware is a significant upgrade from what the previous missions used and has greatly increased the capabilities of the software, including supporting the use of the open source operating system Linux. Leveraging the previous PolySat experience, a new design approach has been followed for the development of a fault tolerant and flexible software architecture. As a result, a set of processes and custom libraries that run within Linux have been designed and implemented. Furthermore, an emphasis has been placed on fault tolerance with two features: a software watchdog and digital command signing capability. Lastly, a survey of related CubeSat projects and software fault tolerance papers has been conducted to determine that this new system is sufficient to meet the desired goals.

Mobile and web application security, particularly concerning the area of data privacy, has received much attention from the public in recent years. Most applications are installed without disclosing full information to users and clearly stating what they have access to. This often raises concerns when users become aware of unnecessary information being collected or stored. Unfortunately, most users have little to no technical knowledge in regard to what permissions should be granted and can only rely on their intuition and past experiences to make relatively uninformed decisions. DroidNet, a crowdsource based Android recommendation tool and framework, is a proposed avenue for the technically incapable. DroidNet alleviates privacy concerns and presents users with permission recommendations of high confidence based on the decisions from expert users on the network who are using the same applications. The framework combines an interactive user interface, used for data collection and presenting permission recommendations to users, with a transitional Bayesian inference model and multiple algorithms used for rating users based on their respective expertise levels. As a result, the recommendations that are provided to users are based on aggregated expert responses and their confidence levels. This work presents the completed DroidNet project in its entirety, including the implementation of the application, algorithms, and user interface itself. Additionally, this thesis presents and utilizes a unique collection of real-world data from actual Android users. The primary goal of this work is to evaluate the effectiveness and accuracy of DroidNet's recommendations and to show that regular mobile device users can benefit from crowdsourcing.

Scientific computing often requires solving systems of linear equations. Most software pack- ages for solving large-scale linear systems use Gaussian elimination methods such as LU- decomposition. An alternative method, recently introduced by K. Habgood and I. Arel, involves an application of Cramer’s Rule and Chio’s condensation to achieve a better per- forming system for solving linear systems on parallel computing platforms. This thesis describes an implementation of this algorithm on an nVidia graphics processor card us- ing the CUDA language. Increased performance, relative to the serial implementation, is demonstrated, paving the way for future parallel realizations of the scheme.

Scientific computing often requires solving systems of linear equations. Most software pack- ages for solving large-scale linear systems use Gaussian elimination methods such as LU- decomposition. An alternative method, recently introduced by K. Habgood and I. Arel, involves an application of Cramer’s Rule and Chio’s condensation to achieve a better per- forming system for solving linear systems on parallel computing platforms. This thesis describes an implementation of this algorithm on an nVidia graphics processor card us- ing the CUDA language. Increased performance, relative to the serial implementation, is demonstrated, paving the way for future parallel realizations of the scheme.

Execution time estimation plays an important role in computer system design. It is particularly critical in real-time system design, where to meet a deadline can be as important as to ensure the logical correctness of a program. To accurately estimate the execution time of a program can be extremely challenging, since the execution time of a program varies with inputs, the underlying computer architectures, and run-time dynamics, among other factors. The problem becomes even more challenging as computing systems moving from single core to multi-core platforms, with more hardware resources shared by multiple processing cores. The goal of this research is to investigate the relationship between the execution time of a program and the underlying architecture features (e.g. cache size, associativity, memory latency), as well as its run-time characteristics (e.g. cache miss ratios), and based on which, to estimate its execution time on a multi-core platform based on a regression approach. We developed our test platform based on GEM5, an open-source multi-core cycle-accurate simulation tool set. Our experimental results show clearly the strong relationship of the program execution time to architecture features and run-time characteristics. Moreover, we developed different execution time estimation algorithms using the regression approach for different programs with different software characteristics to improve the estimation accuracy.

Infrastructure-as-a-Service cloud platforms are incredibly complex: they rent hundreds of different types of servers across multiple geographical regions under a wide range of contract types that offer varying tradeoffs between risk and cost. Unfortunately, the internal dynamics of cloud platforms are opaque in several dimensions. For example, while the risk of servers not being available when requested is critical in optimizing these risk-cost tradeoffs, it is not typically made visible to users. Thus, inspired by prior work on Internet bandwidth probing, we propose actively probing cloud platforms to explicitly learn such information, where each "probe'' is a request for a particular type of server. We model the relationships between different contracts types to develop a market-based probing policy, which leverages the insight that real-time prices in cloud spot markets loosely correlate with the supply (and availability) of fixed-price on-demand servers. That is, the higher the spot price for a server, the more likely the corresponding fixed-price on-demand server is not available. We incorporate market-based probing into SpotLight, an information service that enables cloud applications to query this and other data, and use it to monitor the availability of more than 4500 distinct server types across 9 geographical regions in Amazon's Elastic Compute Cloud over a 3 month period. We analyze this data to reveal interesting observations about the platform's internal dynamics. We then show how SpotLight enables two recently proposed derivative cloud services to select a better mix of servers to host applications, which improves their availability from 70-90% to near 100% in practice.

Programming languages like Python, JavaScript, and Ruby are becoming increasingly popular due to their dynamic capabilities. These languages are often much easier to learn than other, statically type checked, languages such as C++ or Rust. Unfortunately, these dynamic languages come at the cost of losing compile-time optimizations. Python is arguably the most popular language for data scientists and researchers in the artificial intelligence and machine learning communities. As this research becomes increasingly popular, and the problems these researchers face become increasingly computationally expensive, questions are being raised about the performance of languages like Python. Language features found in Python, more specifically dynamic typing and run-time modification of object attributes, preclude common static analysis optimizations that often yield improved performance. This thesis attempts to quantify the cost of dynamic features in Python. Namely, the run-time modification of objects and scope as well as the dynamic type system. We introduce Cannoli, a Python 3.6.5 compiler that enforces restrictions on the language to enable opportunities for optimization. The Python code is compiled into an intermediate representation, Rust, which is further compiled and optimized by the Rust pipeline. We show that the analyzed features cause a significant reduction in performance and we quantify the cost of these features for language designers to consider.

We evaluate SQUASH, a new MAC for RFID, in hardware and software. A smaller hardware design for SQUASH is proposed which also reduces latency. Area and latency in hardware are reduced further with a new variant we call permuted SQUASH. We explore SQUASH on embedded microprocessors and propose a method to choose the optimal partial product ordering to reduce latency.

With the rapid growth of urban populations and increasing vehicular traffic, congestion has become a major challenge for transportation systems worldwide. Accurate estimation of travel time plays a crucial role in mitigating congestion and enhancing traffic management. This research focuses on developing a novel methodology that utilizes machine learning models to estimate travel time using real-time traffic data collected through Bluetooth sensors deployed at traffic intersections. The research compares five different prediction systems for replicating travel time estimation, evaluating their performance and accuracy. The results highlight the effectiveness of the machine learning models in accurately predicting travel time. Lastly, the research explores the creation of a model specifically designed to predict the travel time during peak hours, considering the impact of traffic lights on travel time between intersections. The findings of this study contribute to the development of efficient and reliable travel time prediction systems, enabling commuters to make informed decisions and improving traffic management strategies.

This paper discusses a modification to improve usability and functionality of a ge- netic neural net algorithm called NEAT (NeuroEvolution of Augmenting Topolo- gies). The modification aims to accomplish its goal by automatically changing parameters used by the algorithm with little input from a user. The advan- tage of the modification is to reduce the guesswork needed to setup a successful experiment with NEAT that produces a usable Artificial Intelligence (AI). The modified algorithm is tested against the unmodified NEAT with several different setups and the results are discussed. The algorithm shows strengths in some areas but can increase the runtime of NEAT due to the addition of parameters into the solution search space.