Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Way-Finding: A New Approach To Studying Digital Communications, William Daniel Glade
Way-Finding: A New Approach To Studying Digital Communications, William Daniel Glade
Theses and Dissertations
This work further develops the way-finding model first proposed by Pearson and Kosicki (2017) which examines the flow of information in the digital age. Way-finding systems are online systems that help individuals find information—i.e. social media, search engines, email, etc. Using a grounded theory methodology, this new framework was explored in greater detail. Way-finding theory was created using the context of the elaboration likelihood model, gatekeeping theory, algorithmic gatekeepers, and the existence of the filter bubble phenomenon. This study establishes the three basic pillars of way-finding theory: the user’s mindset when accessing way-finding systems, the perception of how popular way-finding …
Academic Packing For Commercial Fpga Architectures, Travis D. Haroldsen
Academic Packing For Commercial Fpga Architectures, Travis D. Haroldsen
Theses and Dissertations
With a few exceptions, academic packing algorithms for FPGAs are typically applied solely to theoretical architectures. This has allowed the algorithms to focus on the basic components of packing while abstracting away many of the details dictated by real hardware. As commercially available FPGAs have advanced, however, the academic algorithms and architectures have diverged significantly from their commercial counterparts. In this dissertation, the RapidSmith 2 framework is presented. This framework accurately reflects the architecture of Xilinx FPGAs and provides support for integrating custom tools into the commercial CAD tools. Using this framework, the RSVPack packing algorithm is implemented. The RSVPack …
Sculpting: An Improved Inside-Out Scheme For All Hexahedral Meshing, Kirk S. Walton
Sculpting: An Improved Inside-Out Scheme For All Hexahedral Meshing, Kirk S. Walton
Theses and Dissertations
Generating all hexahedral meshes on arbitrary geometries has been an area of important research in recent history. Hexahedral meshes have advantages over tetrahedral meshes in structural mechanics because they provide more accurate results with fewer degrees of freedom. Many different approaches have been used to create all-hexahedral meshes. Grid-based, inside-out, or superposition meshing all refer to a similar meshing approach that is a very common mesh generation technique. Grid-based algorithms provide the ability to generate all hexahedral meshes by introducing a structured mesh that bounds the complete body modeled, marking hexahedra to define an interior and exterior mesh, manipulating the …
Surfacing Splicing: A Method Of Quadrilateral Mesh Generation And Modification For Surfaces By Dual Creation And Manipulation, Benjamin Todd Grover
Surfacing Splicing: A Method Of Quadrilateral Mesh Generation And Modification For Surfaces By Dual Creation And Manipulation, Benjamin Todd Grover
Theses and Dissertations
The effective generation high quality quadrilateral surface meshes is an area of important research and development for the finite element community. Quadrilateral elements generally lead to more efficient and accurate finite results. In addition, some all hexahedral volume meshing algorithms are based on an initial quadrilateral mesh surface mesh that has specific connectivity requirements. This thesis presents a new and unique procedure named "Surfaced Splicing". Surface Splicing allows for the generation of all quadrilateral surface meshes as well as the ability to edit these meshes via the dual. The dual contains the same data as the mesh but, unlike the …
Interval Matching And Control For Hexahedral Mesh Generation Of Swept Volumes, Jason F. Shepherd
Interval Matching And Control For Hexahedral Mesh Generation Of Swept Volumes, Jason F. Shepherd
Theses and Dissertations
Surface meshing algorithms require certain relationships among the number of intervals on the curves that bound the surface. Assigning the number of intervals to all of the curves in the model such that all relationships are satisfied is called interval assignment. Volume meshing algorithms also require certain relationships among the numbers of intervals on each of the curves on the volume. These relationships are not always captured by surface meshing requirements. This thesis presents a news technique for automatically identifying volume constraints. In this technique, volume constraints are grouped with surface constraints and are solved simultaneously. A sweepable volume has …