Accelerated Frame Data Relocation On Xilinx Field Programmable Gate Array,
2010
Utah State University
Accelerated Frame Data Relocation On Xilinx Field Programmable Gate Array, Ramachandra Kallam
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Emerging reconfiguration techniques that include partial dynamic reconfiguration and partial bitstream relocation have been addressed in the past in order to expose the flexibility of field programmable gate array at runtime. Partial bitstream relocation is a technique used to target a partial bitstream of a partial reconfigurable region (PRR) onto other identical reconfigurable regions inside an FPGA, while partial dynamic reconfiguration is used to target a single reconfigurable region. Prior works in this domain aim to minimize "relocation time" with the help of on-chip or on-line processing. In this thesis, a novel PRR-PRR relocation algorithm is proposed and implemented both …
A Finite Domain Constraint Approach For Placement And Routing Of Coarse-Grained Reconfigurable Architectures,
2010
Utah State University
A Finite Domain Constraint Approach For Placement And Routing Of Coarse-Grained Reconfigurable Architectures, Rohit Saraswat
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Scheduling, placement, and routing are important steps in Very Large Scale Integration (VLSI) design. Researchers have developed numerous techniques to solve placement and routing problems. As the complexity of Application Specific Integrated Circuits (ASICs) increased over the past decades, so did the demand for improved place and route techniques. The primary objective of these place and route approaches has typically been wirelength minimization due to its impact on signal delay and design performance. With the advent of Field Programmable Gate Arrays (FPGAs), the same place and route techniques were applied to FPGA-based design. However, traditional place and route techniques may …
The Pursuit Of An Unequivocal Primary Representation,
2010
Utah State University
The Pursuit Of An Unequivocal Primary Representation, Delroy A. Brinkerhoff
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
A chief human characteristic is the desire and ability to change the world. Prior planning is crucial when those changes are complex and extensive, and require the cooperation of many people. To satisfy this need, many disciplines have developed specialized notations for representing the plans. Developers in one discipline, computer-based instruction, are burdened by the current need to use two separate notations. Instructional experts design the instruction and represent the design with a primary representation. The instruction described in a primary representation is easy to see, which makes the representation suitable for evaluation, communication, and enhancement. Programmers translate the primary …
Improved Framework For Fast And Efficient Memory-Based Frame Data Reconfiguration For Multi-Row Spanning Designs On Field Programmable Gate Arrays,
2010
Utah State University
Improved Framework For Fast And Efficient Memory-Based Frame Data Reconfiguration For Multi-Row Spanning Designs On Field Programmable Gate Arrays, Rohan Sreeram
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Reconfigurable computing is an evolving paradigm in computer architecture where the ability to load different designs onto a field programmable gate array (FPGA) at execution time has proven useful in adapting FPGA prototypes to a wide range of applications. Reconfiguration techniques can be primarily categorized as Partial Dynamic Reconfiguration (PDR) and Partial Bitstream Relocation (PBR). PDR involves reconfiguring a single Partial Reconfiguration Region (PRR) with a partial bitstream, while PBR is targeted at reconfiguring multiple PRRs on the FPGA with a partial bitstream. Previous techniques have primarily focused on using either slower off-chip memory or on-chip memory-based solutions to store …
Application Of Temporal Difference Learning To The Game Of Snake.,
2010
University of Louisville
Application Of Temporal Difference Learning To The Game Of Snake., Christopher Lockhart
Electronic Theses and Dissertations
The game of Snake has been selected to provide a unique application of the TD( ) algorithm as proposed by Sutton. A reinforcement learning technique for producing computer controlled players is documented. Using value function approximation with multilayer artificial neural networks and the actor-critic architecture, computer players capable of playing the game of Snake can be created. The adaptation to the standard neural network backpropagation procedure will be documented. Not only does the proposed technique provide reasonable player performance, its application is unique; this approach to Snake has never been documented. By performing sets of trials, the performance of the …
An Exploration Of Formal Methods And Tools Applied To A Small Satellite Software System,
2010
Utah State University
An Exploration Of Formal Methods And Tools Applied To A Small Satellite Software System, Russell J. Grover
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Formal system modeling has been a topic of interest in the research community for many years. Modeling a system helps engineers understand it better and enables them to check different aspects of it to ensure that there is no undesired or unexpected behavior and that it does what it was designed to do. This thesis takes two existing tools that were created to aid in the designing of spacecraft systems and creates a layer to connect them together and allow them to be used jointly. The first tool is a library of formal descriptions used to specify spacecraft behavior in …
A Web And Mobile System For Environmental Decision Support,
2010
Technological University of Dublin
A Web And Mobile System For Environmental Decision Support, James Carswell, Keith Gardiner, Michela Bertolotto, Andrea Rizzine
Books/Book chapters
Current field data collection methods for many of today’s scientific and other observer/monitor type applications are still entrenched in the “clipboard age”, requiring manual data transcription to a database management system at some (often much) later date, and only allows for visualisation and analysis of recently captured field data “back in the lab”. This chapter is targeted at progressing today’s pen & paper methodology into the spatially enabled mobile computing age of realtime multi-media data input, integration, visualisation, and analysis simultaneously both in the field and the lab. The system described is customized to the specific needs of the Canadian …
Healthcare Professional Roles: The Ontology Model For E-Learning,
2010
Technological University Dublin
Healthcare Professional Roles: The Ontology Model For E-Learning, Lorraine Carmody, Elizabeth Sherry, John Cardiff
Conference Papers
The paper aims to present the MEDeLEARN project, an ontology-driven virtual learning environment for Medical Information System training. The current training environment for healthcare professionals in the use of essential medical information systems in a large urban training hospital is based on conventional instructor-led training sessions. Problems arise due to the demanding nature of the hospital working environment, causing training to be cancelled or curtailed. This mode of training delivery is deemed to be inefficient and ineffective, with the danger of serious errors occurring as a consequence.
The project investigates whether a virtual learning environment can address the competency gap …
The Great Teakon: A 3d Video Game,
2010
Syracuse University
The Great Teakon: A 3d Video Game, Chad Cable
Renée Crown University Honors Thesis Projects - All
The Great Teakon is an experimental 3D video game that uses gameplay as a narrative device. Players take charge of Charles Teakon, a rising film star, during the silent film era in the early 1900ʼs. But when Charles breaks his leg on set, heʼs forced into retirement and obscurity. After a 30 year hiatus, he decides to return to the film world and complete his unfinished movie. ! As the protagonist ages, so will the players - not only is this reflected in the physicality of the characters, landscape, and architecture, but the actual mechanics for interacting with the virtual …
Bio-Inspired Distributed Constrained Optimization Technique And Its Application In Dynamic Thermal Management,
2010
Utah State University
Bio-Inspired Distributed Constrained Optimization Technique And Its Application In Dynamic Thermal Management, Saranya Chandrasekaran
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
The stomatal network in plants is a well-characterized biological system that hypothetically solves the constrained optimization problem of maximizing CO2 uptake from the air while constraining evaporative water loss during the process of photosynthesis. There are numerous such constrained optimization problems present in the real world as well as in computer science. This thesis work attempts to solve one such constrained optimization problem in a distributed manner by taking a cue from the dynamics of stomatal networks. The problem considered here is Dynamic Thermal Management (DTM) in a multi-processing element system in computing. There have been several approaches in …
Exploring Managed Nand Media Endurance,
2010
Boise State University
Exploring Managed Nand Media Endurance, Mark G. Jurenka
Boise State University Theses and Dissertations
Flash memory can be found in media players, cameras, cell phones and portable storage. These consumer items have universally compatible storage devices. However, what is their longevity and what is the long-term data retention reliability? This thesis will explore and attempt to answer these questions. Predicting accurate endurance ratings and long-term storage reliability is problematic; a storage card in a cell phone will simply wear differently if used for personal computer backup. Advertised longevity ratings can also be ambiguous, specified in a number of years of ‘typical’ and ‘average’ use.
This thesis begins by exploring the operation of flash technology …
Design Of Adaptive Collective Foraging In Swarm Robotic Systems,
2010
Western Michigan University
Design Of Adaptive Collective Foraging In Swarm Robotic Systems, Hanyi Dai
Dissertations
Inspired by the collective behavior observed in biological colonies, swarm robotics is a new approach to design a distributed control algorithm in order to coordinate a group of simple robots performing a complex group task. With only limited computation and communication ability of individual robots, one of the challenges in designing such multi-robotic systems is to understand the effect of individual robots behavior on the group performance. This thesis dedicates the research to designing a set of local interaction and adaptation rule for individual robots so that optimized collective foraging performance can be achieved at group level.
The research starts …
Hidra: Hierarchical Inter-Domain Routing Architecture,
2010
California Polytechnic State University, San Luis Obispo
Hidra: Hierarchical Inter-Domain Routing Architecture, Bryan Clevenger
Master's Theses
As the Internet continues to expand, the global default-free zone (DFZ) forwarding table has begun to grow faster than hardware can economically keep pace with. Various policies are in place to mitigate this growth rate, but current projections indicate policy alone is inadequate. As such, a number of technical solutions have been proposed. This work builds on many of these proposed solutions, and furthers the debate surrounding the resolution to this problem. It discusses several design decisions necessary to any proposed solution, and based on these tradeoffs it proposes a Hierarchical Inter-Domain Routing Architecture - HIDRA, a comprehensive architecture with …
Naked Object File System (Nofs): A Framework To Expose An Object-Oriented Domain Model As A File System,
2010
Loyola University Chicago
Naked Object File System (Nofs): A Framework To Expose An Object-Oriented Domain Model As A File System, Joseph P. Kaylor, Konstantin Läufer, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
We present Naked Objects File System (NOFS), a novel framework that allows a developer to expose a domain model as a file system by leveraging the Naked Objects design principle. NOFS allows a developer to construct a file system without having to understand or implement all details related to normal file systems development. In this paper we explore file systems frameworks and object-oriented frameworks in a historical context and present an example domain model using the framework. This paper is based on a fully-functional implementation that is distributed as free/open source software, including virtual machine images to demonstrate and study …
Open Innovation In Platform Competition,
2010
Singapore Management University
Open Innovation In Platform Competition, Mei Lin
Research Collection School Of Computing and Information Systems
We examine the competition between a proprietary platform and an open platform,where each platform holds a two-sided market consisted of app developers and users.The open platform cultivates an innovative environment by inviting public efforts todevelop the platform itself and permitting distribution of apps outside of its own appmarket; the proprietary platform restricts apps sales solely within its app market. Weuse a game theoretic model to capture this competitive phenomenon and analyze theimpact of growth of the open source community on the platform competition. We foundthat growth of the open community mitigates the platform rivalry, and balances the developernetwork sizes on …
Acceleration Of Biomolecular Simulations Using Fpga-Based Reconfigurable Computing,
2010
Clemson University
Acceleration Of Biomolecular Simulations Using Fpga-Based Reconfigurable Computing, Ananth Nallamuthu
All Theses
A paradigm shift is occurring in the way compute-intensive scientific applications are developed. Thanks to advancements in commercially viable hybrid architectures for High-Performance Computing (HPC), the focus has shifted from improving performance by merely scaling algorithms on von Neumann computing nodes to fully exploiting additional computational capabilities provided by accelerators such as FPGAs (Field Programmable Gate Arrays) and GPGPUs (General Purpose Graphical Processing Units).
Computational chemists use Molecular Dynamics (MD) simulations like LAMMPS (Large Scale Atomic Molecular Massively Parallel Systems) and NAMD (NAnoscale Molecular Dynamics) to simulate biomolecular behaviour such as protein folding and small molecule docking to proteins. MD …
Fpga Based Timing Module And Optical Communication Card Design For Spallation Neutron Source,
2010
Clemson University
Fpga Based Timing Module And Optical Communication Card Design For Spallation Neutron Source, Biswa Singh
All Theses
The Timing Module and Optical Communication Card (OCC) are used for acquisition of neutron event data by the instrument systems at the Spallation Neutron Source (SNS) neutron scattering facility. The instrument systems produce a very large flux of neutrons of varying energies over a short time period through the spallation process. The Timing Module and OCC require high-bandwidth communication to ensure high-speed data movement to the memory in the data collection system without loss of neutron data. The existing implementations use a standard PCI-X bus interface to transfer the data between the cards and the host computer. The data processing …
Timing Side-Channel Attacks On Ssh,
2010
Clemson University
Timing Side-Channel Attacks On Ssh, Harikrishnan Bhanu
All Theses
In most secure communication standards today, additional latency is kept to a minimum to preserve the Quality-of-Service. As a result, it is possible to mount side-channel attacks using timing analysis. In this thesis we discuss the viability of these attacks, and demonstrate them by inferring Hidden Markov Models of protocols. These Hidden Markov Models can be used to both detect protocol use and infer information about protocol state. We create experiments that use Markov models to generate traffic and show that we can accurately reconstruct models under many circumstances. We analyze what occurs when timing delays have enough jitter that …
Acceleration Of Spiking Neural Networks On Single-Gpu And Multi-Gpu Systems,
2010
Clemson University
Acceleration Of Spiking Neural Networks On Single-Gpu And Multi-Gpu Systems, Venkittaraman Vivek Pallipuram Krishnamani
All Theses
There has been a strong interest in modeling a mammalian brain in order to study the architectural and functional principles of the brain and offer tools to neuroscientists and medical researchers for related studies. Artificial Neural Networks (ANNs) are compute models that try to simulate the structure and/or the functional behavior of neurons and process information using the connectionist approach to computation. Hence, the ANNs are the viable options for such studies.
Of many classes of ANNs, Spiking Neuron Network models (SNNs) have been employed to simulate mammalian brain, capturing its functionality and inference capabilities. In this class of neuron …
Traffic Analysis Of Anonymity Systems,
2010
Clemson University
Traffic Analysis Of Anonymity Systems, Ryan Craven
All Theses
This research applies statistical methods in pattern recognition to test the privacy capabilities of a very popular anonymity tool used on the Internet known as Tor.
Using a recently developed algorithm known as Causal State Splitting and Reconstruction (CSSR), we can create hidden Markov models of network processes proxied through Tor. In contrast to other techniques, our CSSR extensions create a minimum entropy model without any prior knowledge of the underlying state structure. The inter-packet time delays of the network process, preserved by Tor, can be symbolized into ranges and used to construct the models.
After the construction of training …
