Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Evolvable hardware (2)
- Machine Learning (2)
- Performance (2)
- ARTMAP (1)
- Adaptable architectures (1)
-
- Autonomous systems (1)
- Category Proliferation (1)
- Classification (1)
- Contexts (1)
- CxBR (1)
- Design (1)
- FPGA FAULT TOLERANCE RECONFIGURATION GENETIC ALGORITHMS (1)
- Fault tolerance (1)
- File system (1)
- Fpga (1)
- Genetic Algorithms (1)
- Genetic Operators (1)
- Group testing (1)
- Human Behavior Models (1)
- I/O (1)
- Learning (1)
- M/M/1 Queuing (1)
- Mobile robots (1)
- Organic systems (1)
- Parallel (1)
- Quality of Service (1)
- Real time data (1)
- Reconfigurable architectures (1)
- Reinforcement (1)
- Reliability (1)
Articles 1 - 8 of 8
Full-Text Articles in Engineering
Dynamic Task Allocation In Mobile Robot Systems Using Utility Funtions, Scott Vander Weide
Dynamic Task Allocation In Mobile Robot Systems Using Utility Funtions, Scott Vander Weide
Electronic Theses and Dissertations
We define a novel algorithm based on utility functions for dynamically allocating tasks to mobile robots in a multi-robot system. The algorithm attempts to maximize the performance of the mobile robot while minimizing inter-robot communications. The algorithm takes into consideration the proximity of the mobile robot to the task, the priority of the task, the capability required by the task, the capabilities of the mobile robot, and the rarity of the capability within the population of mobile robots. We evaluate the proposed algorithm in a simulation study and compare it to alternative approaches, including the contract net protocol, an approach …
Optimizing Dynamic Logic Realizations For Partial Reconfiguration Of Field Programmable Gate Arrays, Matthew Parris
Optimizing Dynamic Logic Realizations For Partial Reconfiguration Of Field Programmable Gate Arrays, Matthew Parris
Electronic Theses and Dissertations
Many digital logic applications can take advantage of the reconfiguration capability of Field Programmable Gate Arrays (FPGAs) to dynamically patch design flaws, recover from faults, or time-multiplex between functions. Partial reconfiguration is the process by which a user modifies one or more modules residing on the FPGA device independently of the others. Partial Reconfiguration reduces the granularity of reconfiguration to be a set of columns or rectangular region of the device. Decreasing the granularity of reconfiguration results in reduced configuration filesizes and, thus, reduced configuration times. When compared to one bitstream of a non-partial reconfiguration implementation, smaller modules resulting in …
Sustainable Fault-Handling Of Reconfigurable Logic Using Throughput-Driven Assessment, Carthik Sharma
Sustainable Fault-Handling Of Reconfigurable Logic Using Throughput-Driven Assessment, Carthik Sharma
Electronic Theses and Dissertations
A sustainable Evolvable Hardware (EH) system is developed for SRAM-based reconfigurable Field Programmable Gate Arrays (FPGAs) using outlier detection and group testing-based assessment principles. The fault diagnosis methods presented herein leverage throughput-driven, relative fitness assessment to maintain resource viability autonomously. Group testing-based techniques are developed for adaptive input-driven fault isolation in FPGAs, without the need for exhaustive testing or coding-based evaluation. The techniques maintain the device operational, and when possible generate validated outputs throughout the repair process. Adaptive fault isolation methods based on discrepancy-enabled pair-wise comparisons are developed. By observing the discrepancy characteristics of multiple Concurrent Error Detection (CED) configurations, …
A Competitive Reconfiguration Approach To Autonomous Fault Handling Using Genetic Algorithms, Kening Zhang
A Competitive Reconfiguration Approach To Autonomous Fault Handling Using Genetic Algorithms, Kening Zhang
Electronic Theses and Dissertations
In this dissertation, a novel self-repair approach based on Consensus Based Evaluation (CBE) for autonomous repair of SRAM-based Field Programmable Gate Arrays (FPGAs) is developed, evaluated, and refined. An initial population of functionally identical (same input-output behavior), yet physically distinct (alternative design or place-and-route realization) FPGA configurations is produced at design time. During run-time, the CBE approach ranks these alternative configurations after evaluating their discrepancy relative to the consensus formed by the population. Through runtime competition, faults in the logical resources become occluded from the visibility of subsequent FPGA operations. Meanwhile, offspring formed through crossover and mutation of faulty and …
A Reinforcement Learning Technique For Enhancing Human Behavior Models In A Context-Based Architecture, David Aihe
A Reinforcement Learning Technique For Enhancing Human Behavior Models In A Context-Based Architecture, David Aihe
Electronic Theses and Dissertations
A reinforcement-learning technique for enhancing human behavior models in a context-based learning architecture is presented. Prior to the introduction of this technique, human models built and developed in a Context-Based reasoning framework lacked learning capabilities. As such, their performance and quality of behavior was always limited by what the subject matter expert whose knowledge is modeled was able to articulate or demonstrate. Results from experiments performed show that subject matter experts are prone to making errors and at times they lack information on situations that are inherently necessary for the human models to behave appropriately and optimally in those situations. …
An Adaptive Multiobjective Evolutionary Approach To Optimize Artmap Neural Networks, Assem Kaylani
An Adaptive Multiobjective Evolutionary Approach To Optimize Artmap Neural Networks, Assem Kaylani
Electronic Theses and Dissertations
This dissertation deals with the evolutionary optimization of ART neural network architectures. ART (adaptive resonance theory) was introduced by a Grossberg in 1976. In the last 20 years (1987-2007) a number of ART neural network architectures were introduced into the literature (Fuzzy ARTMAP (1992), Gaussian ARTMAP (1996 and 1997) and Ellipsoidal ARTMAP (2001)). In this dissertation, we focus on the evolutionary optimization of ART neural network architectures with the intent of optimizing the size and the generalization performance of the ART neural network. A number of researchers have focused on the evolutionary optimization of neural networks, but no research has …
Metadata And Data Management In High Performance File And Storage Systems, Peng Gu
Metadata And Data Management In High Performance File And Storage Systems, Peng Gu
Electronic Theses and Dissertations
With the advent of emerging "e-Science" applications, today's scientific research increasingly relies on petascale-and-beyond computing over large data sets of the same magnitude. While the computational power of supercomputers has recently entered the era of petascale, the performance of their storage system is far lagged behind by many orders of magnitude. This places an imperative demand on revolutionizing their underlying I/O systems, on which the management of both metadata and data is deemed to have significant performance implications. Prefetching/caching and data locality awareness optimizations, as conventional and effective management techniques for metadata and data I/O performance enhancement, still play their …
Delay Sensitive Routing For Real Time Traffic Over Ad-Hoc Networks, Dipika Darshana
Delay Sensitive Routing For Real Time Traffic Over Ad-Hoc Networks, Dipika Darshana
Electronic Theses and Dissertations
Wireless ad hoc network consists of inexpensive nodes that form a mobile communication network. Due to limitations of the transmission range, the nodes rely on each other to forward packets such that messages can be delivered across the network. The selection of the path along which a packet is forwarded from the source node to the destination node is done by the routing algorithm. Most commonly used routing algorithms, though effective for non-real time applications, cannot handle real-time applications that require strict delay bounds on packet delivery. In this thesis, we propose a routing protocol that ensures timely delivery of …