LOUIS University of Alabama in Huntsville
Not a member yet
8547 research outputs found
Sort by
Down Street Station London Underground\u27s Use in War
Get PDFhttps://louis.uah.edu/honors-399/1007/thumbnail.jp
The Politics Behind Turning the Museum of London, Docklands from an Abandoned Factory into a Green Space
Get PDFhttps://louis.uah.edu/honors-399/1014/thumbnail.jp
The zero forcing number of graphs with prescribed girth
Get PDFThe zero forcing number is a graph parameter that was introduced in 2008 to study the minimum rank of matrices. Since then, it has garnered attention due to its applications in search problems, control theory, and power grid monitoring as well as a subject of theoretical interest in its own right. We denote the zero forcing number of a graph Z(G). Consider a subset Z of the vertex set of a simple graph G and color the vertices in Z pink. If a pink vertex has exactly one uncolored neighbor, then that pink vertex forces its sole uncolored neighbor to turn pink. If, through repeated forces, every vertex of G is eventually colored pink, then we call Z a Zero Forcing Set of G. Z(G) is the smallest cardinality of a zero forcing set of G. The girth of a graph is the order of the smallest cycle in G. In this dissertation we will study using the girth and minimum degree of a graph G to bound Z(G) from below. First, we discuss a lower bound first conjectured by Davila and Kenter and proven . We then characterize the girth and minimum degree of graphs that achieve this bound. Next, we prove two improved lower bounds for graphs with girth five and six. Additionally, we discuss the connections between the zero forcing number and the well studied theory of cages. We then use the Z-Grundy domination number and a well known rank result from KCJ Smith to find the value of several small Levi graphs of projective planes as well as establish general upper and lower bounds for the Levi graphs of projective planes
Complexity, grouping, and similarity: effects on numerosity estimations
Get PDFThis study looked at the effects of visual features like complexity, grouping, and similarity on numerosity estimations. I hypothesized that complex visual stimuli would be more difficult to accurately estimate than simple visual stimuli. Additionally, I hypothesized that stimuli that were visually similar or displayed in spread out, distributed patterns would have more accurate estimations compared to visually random or closely grouped stimuli. Lastly, this study was designed to assess the combined effects of these visual features on numerosity estimation accuracy. Participants were asked to briefly look at images displaying groups of items containing these visual features, estimate the number of items displayed, and provide a confidence judgment based on their perceived accuracy. A 2x2x2 repeated measures ANOVA was used to analyze the data. Analysis found that accuracy was increased by complex stimuli and improved when stimuli were displayed in spread out, distributed patterns. Similarity was not found to be a significant factor affecting estimation accuracy
A comparative study of methods for modeling Python source code semantic similarity
Get PDFIn this thesis, we did comparative study of various methods for generating Python source code embeddings and evaluated their effectiveness using semantic labels. We used both word embedding models, such as Word2Vec and GloVe, and document embedding models to capture the semantic meaning of Python source code. In terms of word embedding evaluation, Word2Vec, combined with cosine distance, achieved the highest nearest neighbor precision of 0.5790. For evaluation of Python source code (or document) embeddings, our analysis across two datasets showed that Doc2Vec, paired with cosine distance, outperformed other methods in semantic code similarity detection, achieving an AUROC between 0.80 and 0.81 and an AUPR between 0.82 and 0.83. Notably, transformer-based methods like CodeBERT and GPT-2 underperformed when used solely for inference, likely because these large language models are more effective in tasks like code completion and code recommendation rather than generating robust source code embeddings
Development of Clustering Methods for Unidirectional Weighted Graph Networks
Get PDFhttps://louis.uah.edu/research-horizons/1353/thumbnail.jp
Growing Awareness About Environmental Conservation in the Huntsville Botanical Gardens
Get PDFhttps://louis.uah.edu/research-horizons/1372/thumbnail.jp