Open Access. Powered by Scholars. Published by Universities.®
University of Arkansas, Fayetteville
Computer Science and Computer Engineering Undergraduate Honors Theses
Articles 1 - 2 of 2
Full-Text Articles in Theory and Algorithms
Service Oriented Transitive Closure Solution, Jonathan Baran
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
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 …