Computer and Systems Architecture Commons^™

Fail-Safe Logic Design Strategies Within Modern Fpga Architectures, Priya A. Bhakta

Electrical and Computer Engineering ETDs

Field Programmable Gate Arrays (FPGAs) are vulnerable to radiation-induced single event upsets (SEUs) and fault injection attacks, requiring the use of redundancy techniques such as fail-safe computing. Fail-safe computing refers to computing systems that revert to a non-operational safe state when a fault occurs. This work investigates circuit-level techniques and implements fail-safe computing processes as mitigation for SEUs and fault injection attacks on FPGAs. The analysis reveals vulnerabilities that exist in FPGAs over those in application-specific integrated circuits (ASIC); thus, requiring a more elaborate network of redundant circuits and checking logic. The reconfiguration capability of FPGAs adds complexity to fail-safe …

Crowdstrike Cyber Incident Vs. Past Major Cyber Incidents: Analysis And Solutions, Priyant Banerjee

Himalayan Research Papers Archive

On July 19, 2024, a technical malfunction in CrowdStrike’s Falcon sensor software led to a global ITdisruption, affecting millions of devices across multiple sectors. This incident, although not a direct cyber-attack, caused significant operational upheavals reminiscent of major past cyber incidents. This paperexplores the CrowdStrike incident in detail, compares it with previous major cyber events, and proposescomprehensive solutions to mitigate such risks in the future.The faulty update from CrowdStrike resulted in widespread system crashes, notably the "Blue Screen ofDeath," paralyzing operations in critical sectors such as healthcare, finance, and transportation. The paperexamines the immediate and cascading effects of the incident, …

Enabling Intelligent Network Management Through Multi-Agent Systems: An Implementation Of Autonomous Network System, Petro Mushidi Tshakwanda

Electrical and Computer Engineering ETDs

This Ph.D. dissertation presents a pioneering Multi-Agent System (MAS) approach for intelligent network management, particularly suited for next-generation networks like 5G and 6G. The thesis is segmented into four critical parts. Firstly, it contrasts the benefits of agent-based design over traditional micro-service architectures. Secondly, it elaborates on the implementation of network service agents in Python Agent Development Environment (PADE), employing machine learning and deep learning algorithms for performance evaluation. Thirdly, a new scalable approach, Scalable and Efficient DevOps (SE-DO), is introduced to optimize agent performance in resource-constrained settings. Fourthly, the dissertation delves into Quality of Service (QoS) and Radio Resource …

Optimizing High-Performance Computing Design: The Impacts Of Bandwidth And Topology Across Workloads For Distributed Shared Memory Systems, Jonathan A. Milton

Electrical and Computer Engineering ETDs

With the complexity of high-performance computing designs continuously increasing, the importance of evaluating with simulation also grows. One of the key design aspects is the network architecture; topology and bandwidth greatly influence the overall performance and should be optimized. This work uses simulations written to run in the Structural Simulation Toolkit software framework to evaluate a variety of architecture configurations, identify the optimal design point based on expected workload, and evaluate the changes with increased scale. The results show that advanced topologies outperform legacy architectures justifying the additional design complexity; and that after a certain point increasing the bandwidth provides …

Vi Energy-Efficient Memristor-Based Neuromorphic Computing Circuits And Systems For Radiation Detection Applications, Jorge Iván Canales Verdial

Electrical and Computer Engineering ETDs

Radionuclide spectroscopic sensor data is analyzed with minimal power consumption through the use of neuromorphic computing architectures. Memristor crossbars are harnessed as the computational substrate in this non-conventional computing platform and integrated with CMOS-based neurons to mimic the computational dynamics observed in the mammalian brain’s visual cortex. Functional prototypes using spiking sparse locally competitive approximations are presented. The architectures are evaluated for classification accuracy and energy efficiency. The proposed systems achieve a 90% true positive accuracy with a high-resolution detector and 86% with a low-resolution detector.

Blockchain Based Communication Architectures With Applications To Private Security Networks, Ashley N. Mayle

Computer Science ETDs

Existing communication protocols in security networks are highly centralized. While this naively makes the controls easier to physically secure, external actors require fewer resources to disrupt the system because there are fewer points in the system can be interrupted without the entire system failing. We present a solution to this problem using a proof-of-work-based blockchain implementation built on MultiChain. We construct a test-bed network containing visual imagers and microwave sensor information. These data types are ubiquitous in perimeter security systems and allow a realistic representation of a real-world network architecture. The cameras in this system use an object detection algorithm …

Nonlinear Least Squares 3-D Geolocation Solutions Using Time Differences Of Arrival, Michael V. Bredemann

Mathematics & Statistics ETDs

This thesis uses a geometric approach to derive and solve nonlinear least squares minimization problems to geolocate a signal source in three dimensions using time differences of arrival at multiple sensor locations. There is no restriction on the maximum number of sensors used. Residual errors reach the numerical limits of machine precision. Symmetric sensor orientations are found that prevent closed form solutions of source locations lying within the null space. Maximum uncertainties in relative sensor positions and time difference of arrivals, required to locate a source within a maximum specified error, are found from these results. Examples illustrate potential requirements …

Recipe For Disaster, Zac Travis

MFA Thesis Exhibit Catalogs

Today’s rapid advances in algorithmic processes are creating and generating predictions through common applications, including speech recognition, natural language (text) generation, search engine prediction, social media personalization, and product recommendations. These algorithmic processes rapidly sort through streams of computational calculations and personal digital footprints to predict, make decisions, translate, and attempt to mimic human cognitive function as closely as possible. This is known as machine learning.

The project Recipe for Disaster was developed by exploring automation in technology, specifically through the use of machine learning and recurrent neural networks. These algorithmic models feed on large amounts of data as a …

Criticality Assessments For Improving Algorithmic Robustness, Thomas B. Jones

Computer Science ETDs

Though computational models typically assume all program steps execute flawlessly, that does not imply all steps are equally important if a failure should occur. In the "Constrained Reliability Allocation" problem, sufficient resources are guaranteed for operations that prompt eventual program termination on failure, but those operations that only cause output errors are given a limited budget of some vital resource, insufficient to ensure correct operation for each of them.

In this dissertation, I present a novel representation of failures based on a combination of their timing and location combined with criticality assessments---a method used to predict the behavior of systems …

Special Issue: Neutrosophic Information Theory And Applications, Florentin Smarandache, Jun Ye

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophiclogic,symboliclogic,set,probability,statistics,etc.,are,respectively,generalizations of fuzzy and intuitionistic fuzzy logic and set, classical and imprecise probability, classical statistics, and so on. Neutrosophic logic, symbol logic, and set are gaining significant attention in solving many real-life problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. A number of new neutrosophic theories have been proposed and have been applied in computational intelligence, multiple-attribute decision making, image processing, medical diagnosis, fault diagnosis, optimization design, etc. This Special Issue gathers original research papers that report on the state of the art, as well as on recent advancements in neutrosophic information theory in soft computing, artificial intelligence, …

Improving Large Scale Application Performance Via Data Movement Reduction, Dewan M. Ibtesham

Computer Science ETDs

The compute capacity growth in high performance computing (HPC) systems is outperforming improvements in other areas of the system for example, memory capacity, network bandwidth and I/O bandwidth. Therefore, the cost of executing a floating point operation is decreasing at a faster rate than moving that data. This increasing performance gap causes wasted CPU cycles while waiting for slower I/O operations to complete in the memory hierarchy, network, and storage. These bottlenecks decrease application time to solution performance, and increase energy consumption, resulting in system under utilization. In other words, data movement is becoming a key concern for future HPC …

Distributed And Scalable Video Analysis Architecture For Human Activity Recognition Using Cloud Services, Cody Wilson Eilar

Electrical and Computer Engineering ETDs

This thesis proposes an open-source, maintainable system for detecting human activity in large video datasets using scalable hardware architectures. The system is validated by detecting writing and typing activities that were collected as part of the Advancing Out of School Learning in Mathematics and Engineering (AOLME) project. The implementation of the system using Amazon Web Services (AWS) is shown to be both horizontally and vertically scalable. The software associated with the system was designed to be robust so as to facilitate reproducibility and extensibility for future research.

Computational-Communicative Actions Of Informational Processing, Florentin Smarandache, Stefan Vladutescu

Branch Mathematics and Statistics Faculty and Staff Publications

This study is circumscribed to the Information Science. The zetetic aim of research is double: a) to define the concept of action of informational processing and b) to design a taxonomy of actions of informational processing. First, the investigation trays to demonstrate that the computational actions of informational processing or the informational actions are computational-investigative configurations for structuring information: clusters of highly-aggregated operations which are carried out in a unitary manner operate convergently and behave like a unique computational device. From a methodological point of view, they are comprised within the category of analytical instruments for the informational processing of …

Erasure Techniques In Mrd Codes, Florentin Smarandache, W.B. Vasantha Kandasamy, R. Sujatha, R.S. Raja Durai

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors study the erasure techniques in concatenated Maximum Rank Distance (MRD) codes. The authors for the first time in this book introduce the new notion of concatenation of MRD codes with binary codes, where we take the outer code as the RD code and the binary code as the inner code. The concatenated code consists of the codewords of the outer code expressed in terms of the alphabets of the inner code. These new class of codes are defined as CRM codes. This concatenation techniques helps one to construct any CRM code of desired minimum distance …

A New Approach To Algebraic Coding Theory Through The Applications Of Soft Sets, Florentin Smarandache, Mumtaz Ali

Branch Mathematics and Statistics Faculty and Staff Publications

Algebraic codes play a signifcant role in the minimisation of data corruption which caused by defects such as inference, noise channel, crosstalk, and packet loss. In this paper, we introduce soft codes (soft linear codes) through the application of soft sets which is an approximated collection of codes. We also discuss several types of soft codes such as type-1 soft codes, complete soft codes etc. Further, we construct the soft generator matrix and soft parity check matrix for the soft linear codes. Moreover, we develop two techniques for the decoding of soft codes.