Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 9 of 9

Full-Text Articles in Computer Engineering

A Novel Data Lineage Model For Critical Infrastructure And A Solution To A Special Case Of The Temporal Graph Reachability Problem, Ian Moncur May 2022

A Novel Data Lineage Model For Critical Infrastructure And A Solution To A Special Case Of The Temporal Graph Reachability Problem, Ian Moncur

Graduate Theses and Dissertations

Rapid and accurate damage assessment is crucial to minimize downtime in critical infrastructure. Dependency on modern technology requires fast and consistent techniques to prevent damage from spreading while also minimizing the impact of damage on system users. One technique to assist in assessment is data lineage, which involves tracing a history of dependencies for data items. The goal of this thesis is to present one novel model and an algorithm that uses data lineage with the goal of being fast and accurate. In function this model operates as a directed graph, with the vertices being data items and edges representing …


Optimized Damage Assessment And Recovery Through Data Categorization In Critical Infrastructure System., Shruthi Ramakrishnan May 2022

Optimized Damage Assessment And Recovery Through Data Categorization In Critical Infrastructure System., Shruthi Ramakrishnan

Graduate Theses and Dissertations

Critical infrastructures (CI) play a vital role in majority of the fields and sectors worldwide. It contributes a lot towards the economy of nations and towards the wellbeing of the society. They are highly coupled, interconnected and their interdependencies make them more complex systems. Thus, when a damage occurs in a CI system, its complex interdependencies make it get subjected to cascading effects which propagates faster from one infrastructure to another resulting in wide service degradations which in turn causes economic and societal effects. The propagation of cascading effects of disruptive events could be handled efficiently if the assessment and …


Side-Channel Analysis On Post-Quantum Cryptography Algorithms, Tristen Teague May 2022

Side-Channel Analysis On Post-Quantum Cryptography Algorithms, Tristen Teague

Computer Science and Computer Engineering Undergraduate Honors Theses

The advancements of quantum computers brings us closer to the threat of our current asymmetric cryptography algorithms being broken by Shor's Algorithm. NIST proposed a standardization effort in creating a new class of asymmetric cryptography named Post-Quantum Cryptography (PQC). These new algorithms will be resistant against both classical computers and sufficiently powerful quantum computers. Although the new algorithms seem mathematically secure, they can possibly be broken by a class of attacks known as side-channels attacks (SCA). Side-channel attacks involve exploiting the hardware that the algorithm runs on to figure out secret values that could break the security of the system. …


Promoting Diversity In Academic Research Communities Through Multivariate Expert Recommendation, Omar Salman Jul 2021

Promoting Diversity In Academic Research Communities Through Multivariate Expert Recommendation, Omar Salman

Graduate Theses and Dissertations

Expert recommendation is the process of identifying individuals who have the appropriate knowledge and skills to achieve a specific task. It has been widely used in the educational environment mainly in the hiring process, paper-reviewer assignment, and assembling conference program committees. In this research, we highlight the problem of diversity and fair representation of underrepresented groups in expertise recommendation, factors that current expertise recommendation systems rarely consider. We introduce a novel way to model experts in academia by considering demographic attributes in addition to skills. We use the h-index score to quantify skills for a researcher and we identify five …


Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang Apr 2021

Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang

Mathematical Sciences Spring Lecture Series

Algebraic multigrid (AMG) is a popular iterative solver and preconditioner for large sparse linear systems. When designed well, it is algorithmically scalable, enabling it to solve increasingly larger systems efficiently. While it consists of various highly parallel building blocks, the original method also consisted of various highly sequential components. A large amount of research has been performed over several decades to design new components that perform well on high performance computers. As a matter of fact, AMG has shown to scale well to more than a million processes. However, with single-core speeds plateauing, future increases in computing performance need to …


Music Feature Matching Using Computer Vision Algorithms, Mason Hollis May 2017

Music Feature Matching Using Computer Vision Algorithms, Mason Hollis

Computer Science and Computer Engineering Undergraduate Honors Theses

This paper seeks to establish the validity and potential benefits of using existing computer vision techniques on audio samples rather than traditional images in order to consistently and accurately identify a song of origin from a short audio clip of potentially noisy sound. To do this, the audio sample is first converted to a spectrogram image, which is used to generate SURF features. These features are compared against a database of features, which have been previously generated in a similar fashion, in order to find the best match. This algorithm has been implemented in a system that can run as …


Service Oriented Transitive Closure Solution, Jonathan Baran Aug 2008

Service Oriented Transitive Closure Solution, Jonathan Baran

Computer Science and Computer Engineering Undergraduate Honors Theses

The goal of this project is a service based solution that utilizes parallel and distributed processing algorithms to solve the transitive closure problem for a large dataset. A dataset may be view conceptually as a table in a database, with a physical structure representing a file containing a sequence of records and fields. Two records are said to be transitively related if and only if they are directly related due to sharing of one or more specific fields, or a sequence may be made from one record to the other under the condition that all intermediate entries are related the …


Visualization Of An Approach To Data Clustering, Marisabel Guevara May 2008

Visualization Of An Approach To Data Clustering, Marisabel Guevara

Computer Science and Computer Engineering Undergraduate Honors Theses

Using visualization and clustering goals as guidelines, this thesis explores a graphic implementation of a data clustering technique that repositions vertices by applying physical laws of charges and springs to the components of the graph. The resulting visualizations are evidence of the success of the approach as well as of the data sets that lend themselves to a clustering routine. Due to the visual product of the implementation, the algorithm is most useful as an aid in understanding the grouping pattern of a data set. Either for a rapid analysis or to assist in presentation, the visual result of the …


Interpolation Techniques For Overset Grids, Paul S. Sherman, Nathan B. Edgar Jan 2003

Interpolation Techniques For Overset Grids, Paul S. Sherman, Nathan B. Edgar

Journal of the Arkansas Academy of Science

The use of finite difference schemes in computational aeroacoustics requires the use of structured grids incomputational space. Complex geometries in the physical space can be modeled using multiple overlapping grids that are transformed into computational space. In this work, finite difference schemes are used that necessitate the addition of psuedo- or ghost-points in the overlap region of the grids for closure of the difference stencil. The functional values at these ghost points must be approximated from the values at the original grid points. This paper investigates interpolation techniques for these overset grids. An n th order interpolation scheme using Lagrange …