Theses and Dissertations at Montana State University (MSU)
Permanent URI for this collectionhttps://scholarworks.montana.edu/handle/1/733
Browse
6 results
Search Results
Item Exploratory study on the effectiveness of type-level complexity metrics(Montana State University - Bozeman, College of Engineering, 2018) Smith, Killian; Chairperson, Graduate Committee: Clemente IzurietaThe research presented in this thesis analyzes the feasibility of using information collected at the type level of object oriented software systems as a metric for software complexity, using the number of recorded faults as the response variable. In other words, we ask the question: Do popular industrial language type systems encode enough of the model logic to provide useful information about software quality? A longitudinal case study was performed on five open source Java projects of varying sizes and domains to obtain empirical evidence supporting the proposed type level metrics. It is shown that the type level metrics Unique Morphisms and Logic per Line of Code are more strongly correlated to the number of reported faults than the popular metrics Cyclomatic Complexity and Instability, and performed comparably to Afferent Coupling, Control per Line of Code, and Depth of Inheritance Tree. However, the type level metrics did not perform as well as Efferent Coupling. In addition to looking at metrics at single points in time, successive changes in metrics between software versions was analyzed. There was insufficient evidence to suggest that the metrics reviewed in this case study provided predictive capabilities in regards to the number of faults in the system. This work is an exploratory study; reducing the threats to external validity requires further research on a wider variety of domains and languages.Item Finding disjoint dense clubs in an undirected graph(Montana State University - Bozeman, College of Engineering, 2016) Zou, Peng; Chairperson, Graduate Committee: Binhai ZhuFor over a decade, software like Twitter, Facebook and WeChat have changed people's lives by creating social groups and networks easily. They give people a new convenient 'world' where we can share everything that happens around us, and social networks have grown enormously in recent years. In essence, social networks are full of data and have become an indispensable part of our life. Trust is an important feature of the relationship between two users in a social network. With the development of social networks, the trust among its members has become a big issue. In a social network, the trust among its members usually cannot be carried over many users. In the corresponding social network modeled as a graph, a user is denoted by a vertex and an edge between two vertices means that these two users communicate a lot above some threshold and they trust each other. An online social community is usually corresponding to a dense region in such a graph. A complex social network is usually composed of several groups/communities (the regions with a lot of edges), and this characterization of community structure means the appearance of densely connected groups of vertices, with only sparse connections between groups. For analyzing the structure of social networks and the relationship between users, it is important to find disjoint groups/communities with a small diameter and with a decent size, formally called dense clubs in this thesis. We focus on handling this NP-complete problem in this thesis. First, from the parameterized computational complexity point of view, we show that this problem does not admit a polynomial kernel (implying that it is unlikely to apply some reduction rules to obtain a practically small problem size). Then, we focus on the dual version of the problem, i.e., deleting 'd' vertices to obtain some disjoint dense clubs. We show that this dual problem admits a simple FPT algorithm using a bounded search tree method (the running time is still too high for practical datasets). Finally, we combine a simple reduction rule together with some heuristic methods to obtain a practical solution (verified by extensive testing on practical datasets). Empirical results show that this heuristic algorithm is very sensitive to all parameters. This algorithm is suitable on graphs which have a mixture of dense and sparse regions. These graphs are very common in the real world.Item Case-based reasoning in agriculture : analysis of the aphid case decision-support system(Montana State University - Bozeman, College of Engineering, 1993) Belote, David ClintonItem The design of an adaptive, intelligent operating system scheduler(Montana State University - Bozeman, College of Engineering, 1985) Lammers, TerenceItem Reconstruction of digitized contour lines(Montana State University - Bozeman, College of Engineering, 1991) Swenson, Charles GlenItem An information retrieval system for images from the trace satellite(Montana State University - Bozeman, College of Engineering, 2008) Lamb, Robert Ray; Chairperson, Graduate Committee: Rafal A. AngrykThe ability to identify particular features and structures, such as faces or types of scenery in images, is a topic with many available applications and potential solutions. In this paper we discuss solar images and the results of our preliminary investigation of techniques that can be used to identify solar phenomena in images from the TRACE satellite. Being able to automatically identify various phenomena in solar images is of great interest for scientists studying phenomena on the sun. A set of characteristics that can be quickly extracted from solar images needs to be acquired. These characteristics are used to create classifiers for various phenomena contained in solar images. There are many obstacles that need to be overcome when extracting features and creating these classifiers. These include the inherent unbalanced data sets due to varying rates at which different phenomena appear and multiple phenomenon that could appear in each image. The classifiers that have been generated were used in the creation of an information retrieval system to make finding phenomenon solar images quick and easy.