Master's Theses (1922-2009) Access restricted to Marquette CampusCopyright (c) 2016 Marquette University All rights reserved.
http://epublications.marquette.edu/theses
Recent documents in Master's Theses (1922-2009) Access restricted to Marquette Campusen-usTue, 09 Feb 2016 13:28:16 PST3600A Cubic Surface Generated by a Pencil of Planes and a Related Family of Cones Having a Common Vertex
http://epublications.marquette.edu/theses/2156
http://epublications.marquette.edu/theses/2156Tue, 09 Feb 2016 13:24:12 PSTDorothy J. RieggThe Saturation Magnetic Moment of Iron-Osmium Solid Solutions Between 77 Kelvin and 300 Kelvin
http://epublications.marquette.edu/theses/2155
http://epublications.marquette.edu/theses/2155Tue, 09 Feb 2016 13:15:36 PST
The purpose of this investigation was to determine the saturation magnetic moment of various iron-osmium alloys over the temperature range from 770 Kelvin to 3000 Kelvin. The lower temperature limit was selected since it corresponds to the boiling point of liquid nitrogen and is thus rather conveniently obtained by using liquid nitrogen as the coolant. The upper limit corresponds roughly to room temperature and again offers a suitable endpoint since the system was allowed to warm up to the temperature of its surroundings. A subsequent project will carry the investigation down to 4.2 Kelvin by the use of liquid helium as the coolant. The saturation magnetic moment was determined both, as a function of the temperature and also as a function of the percentage of osmium present in the iron. For this reason five different samples were investigated. The samples which were available consisted of 2, 4.4, 7.4, and 10 atomic percent of osmium in iron. Two separate 10 atomic percent samples were studied. The particular alloy of osmium with iron was of interest because osmium lies directly below iron in the periodic table and has the same number of electrons in its outermost subshell as does iron. Throughout this investigation the method of measurement used was that of Faraday. More will be said concerning this method in the discussion to follow.
]]>
John W. ScholmeierChasqui: Asynchronous Communication Middleware Design Affording Contingent Routing, Leveraging Peers and Mobility
http://epublications.marquette.edu/theses/2154
http://epublications.marquette.edu/theses/2154Tue, 09 Feb 2016 12:21:37 PST
As Smart Environments expand and wireless connectivity is assumed to be a given, the consequences and cost of losing connectivity increases. By sharing diverse communication resources among heterogeneous devices and redistributing messages from problematic network types to available connections, the chances of eventually delivering an application's message to one or more recipients can be increased, despite challenges faced by the source device. This thesis introduces a design and prototype for a middleware-based message persisting and passing system allowing application developers to associate contingencies for routing messages with the messages themselves. The generic design can be implemented across various platforms and device classes. Use of plug-ins allows for inclusion of emerging technologies and customization of deployments to leverage a host device's available resources, including peer-to-peer channels.
]]>
Mark CentgrafSyntactic Preservation Theorems and an Intuitionistic Formula Hierarchy
http://epublications.marquette.edu/theses/2153
http://epublications.marquette.edu/theses/2153Mon, 08 Feb 2016 14:02:00 PST
We prove several syntactic preservation theorems for intuitionistic predicate logic. The first is an intuitionistic analogue of the generalized (dual of the) Lyndon-Los-Tarski Theorem, which characterizes the sentences preserved under inverse images of homomorphisms of Kripke models having certain reflection properties. The second is an intuitionistic analogue of the generalized Los-Tarski Theorem, which characterizes the sentences preserved under submodels having certain reflection properties. The third is a generalized Sandwich Theorem. We define several intuitionistic formula hierarchies analogous to the classical formula hierarchies \In (= II~) and 3n (= E~), and we obtain intuitionistic analogues of .the Keisler Sandwich Theorem for \In-sentences. Each of these theorems implies the corresponding classical theorem in the case where the Kripke models force classical logic.
]]>
Jonathan A. FleischmannMeSH Association Viewer: Utilizing Association Learning and a Hierarchical Naive Bayes' Classifier to Graphically Summarize Scientific Literature
http://epublications.marquette.edu/theses/2152
http://epublications.marquette.edu/theses/2152Mon, 08 Feb 2016 14:01:58 PST
The goal of MeSH Association Viewer (MAV) is to utilize association learning to visualize and quantify relationships among physiological, disease related, and treatment related concepts. The bibliographic database MEDLINE is mined to create one-to-one association rules, while keeping track of each relationship's corresponding confidence and support. The MeSH taxonomy is utilized to create rules that represent multiple levels of abstraction. MAV's user interface returns visualizations which SiMAP's physiologists can use to create pathways backed by scientific literature.
]]>
Kurt HeilmanTowards Finding a Context-Dependent Initial Trust Value for the Trust Models
http://epublications.marquette.edu/theses/2151
http://epublications.marquette.edu/theses/2151Mon, 08 Feb 2016 14:01:55 PST
In recent years, there has been a tremendous growth in sharing of resources, services and content among different types of devices in a pervasive environment. This growth necessitates an efficient way of sharing the resources to ensure no devices can misuse others' resources. However, this type of activity in a pervasive environment always entails security breaches and privacy violations. In the literature, trust models have been used to solve this kind of problem. A trust value in these models is used to quantify security parameters, access level to a resource, amount of sharing etc. However, most of these trust models start with a constant value for any device regardless of the types of interactions. This assumption of constant value significantly undermines the effectiveness of a trust model. In this thesis, we found initial trust level is instead dynamic based on the context of a sharing activity. Context is defined as a set of conditions on which an activity changes. Initial level of trust also plays an important role in the transactions of E-commerce. It is found that most of the customers hesitate to make a transaction with the unknown websites due to the lack of initial trust. Therefore, we need a generic solution, which can dynamically predict the initial level of trust based on a context in various types of computing environments. In this thesis, we have addressed various problems of modeling a context and proposed approaches to solve those problems. We then proposed a model to predict the initial level of trust for a specific context. We have used several mathematical methods in our approaches and implemented prototypes to evaluate our claims.
]]>
Md Sazzad HossainManaging Medline: A Comparison of a Native XML Database System with a Relational Database System
http://epublications.marquette.edu/theses/2150
http://epublications.marquette.edu/theses/2150Mon, 08 Feb 2016 11:59:15 PST
Background The rapid growth of public literature databases like MEDLINE has created the need to efficiently store, retrieve and update the millions of scholarly articles and literature they contain. Moreover, the sheer size of MEDLINE makes querying them and extracting needed information an arduous process. Therefore, there is a need for a rapid and streamlined process to update, store and query MEDLINE in the most efficient manner. We believe that using alternative database systems like Native XML databases (NXD) will greatly speed up the update process significantly. Results We used existing and self-developed software packages to parse and load the 2006 release of MEDLINE into two different kinds of database systems, namely an NXD (Berkeley DB) and a relational database system (PostgreSQL). The two systems were compared using data collected on loading and parsing times, disk-space utilization and query performance. The loading times for the Berkeley DB and the PostgreSQL implementations were 48 hours and 92 hours respectively. The Berkeley DBXML database occupied 150.3 GB of disk space, while the PostgreSQL database used 16.8 GB in disk space. Conclusions The NXD offered a significantly faster performance in terms of data parsing and loading times. It was also easier to update and maintain, compared to the relational database system. However, in comparison, the relational database system we tested offered better performance in querying large datasets and was also significantly lower on disk space utilization. Beyond the scope of this project, we expect these findings to provide an area of focus to benefit future development of native XML database systems
]]>
Akshat KapoorAn Approach for Protein-Ligand Binding Prediction Based on Docking Studies of Distinct, Low Energy Conformations
http://epublications.marquette.edu/theses/2149
http://epublications.marquette.edu/theses/2149Tue, 02 Feb 2016 12:40:45 PST
One aspect of drug design involves filtering libraries of existing compounds in order to select those that interact strongly with the protein of interest. An active area of drug design research is creating computational filters for this process. This work develops a machine learning approach for constructing a prediction model for the interactions of drugs with Cytochrome P450 2D6 (CYP2D6). This enzyme is responsible for metabolizing 20-25% of all clinically utilized drugs. To construct this model, a set of attributes are created for each drug compound. The novelty of this approach is the use of results from molecular docking simulations as attributes. Furthermore, these compounds are docked into multiple low energy conformations of CYP2D6 that are distinct in 3-dimensional space. The final model performed with a 78% accuracy when predicting whether a given compound is a binder, non-binder, or has a moderate interaction with CYP2D6, which is comparable with current machine learning approaches for this type of problem.
]]>
Peter S. BazeleyThe Convergence of Infinite Series of Complex Terms and Some Applications to the Elementary Functions
http://epublications.marquette.edu/theses/2148
http://epublications.marquette.edu/theses/2148Tue, 02 Feb 2016 12:00:42 PST
The purpose of this paper is to present in one place the several theorems concerning the convergence of infinite series of a complex variable together with the usual operations on such series giving the conditions under which they are valid, i.e. the elementary operations; addition, subtraction, multiplication, division, and differentiation and integration term by term. In addition, it is our purpose to apply these theorems to the trigonometric, exponential and logarithmic functions. We shall then, of course, devote the first section of the paper to the proofs of the theorems above mentioned and then proceed to their application to the elementary functions.
]]>
Armond W. BearA Trust Based Security Solution (TBSS) for a Wireless Sensor Network
http://epublications.marquette.edu/theses/2147
http://epublications.marquette.edu/theses/2147Mon, 01 Feb 2016 13:15:20 PST
The wireless sensor network (WSN) has emerged as a new information and data gathering paradigm based on the collaborative efforts of a large number of autonomous sensing devices. Consequently, the wireless sensor network is variously being deployed in civilian application areas, including environment and habitat monitoring, healthcare applications, home automation, and traffic control. In addition, it supports various desirable functions for sensor networks including: ease of installation, self-identification, self-diagnosis, reliability, and time awareness for coordination with other sensor nodes. These reasons increased the consumption of wireless sensors network, and WSN will take an important place in pervasive computing. Despite the increased range of potential application frameworks, the security gap between existing Wireless Sensor Network designs and their requirements of security sensor network applications remains unresolved. With small memories and processors, limited energy and tiny packets, sensor networks cannot afford luxury of traditional security solutions; this limitation causes security threats. There are several important security challenges, including access control, message integrity and confidentiality, and trust solutions that require us to use a careful design of resource constraints for pursuing more enhanced security solutions for a wireless sensor network. In this thesis, we present an analysis of various current WSN security mechanisms, and we have also introduced a new idea of persistent security solutions that support trust within security in all of the general purposes of a Wireless Sensor Network area and conclude with future research challenges
]]>
Donghyun (Tony) KimSingular Solutions of Differential Equations and Their Applications
http://epublications.marquette.edu/theses/2146
http://epublications.marquette.edu/theses/2146Mon, 01 Feb 2016 12:20:51 PST
This thesis treats analytically and geometrically singular solutions of ordinary and partial differential equations with their applications. It verifies the truth that the procedure in dealing with problems in space afforded by partial differential equations and with families of surfaces represented by equations containing one or more arbitrary constants or parameters, is very similar to that used for families of curves in a plane.
]]>
M. Mechtildis MalinGeo-Obfuscator: Location Privacy Management Using Lossless Spatial Obfuscation
http://epublications.marquette.edu/theses/2145
http://epublications.marquette.edu/theses/2145Mon, 01 Feb 2016 11:59:45 PST
Location-awareness is an emerging field of research that aims to design and develop a safe computing model for storing and exchanging location-based data. Advances in location-detection, wireless and mobile technologies, combined with the remarkable widespread of handheld devices have all contributed to the rapid proliferation of location-awareness. Obtaining location-based data is an integral part of any location-aware application; this process discovers Points of Interest in the client's vicinity and provides localized information. However, the convenience poses a security risk by exposing the client 's location. The traditional security and privacy approaches are not applicable in this scenario due to the dynamic distribution of users in space and the client's need to expose a certain degree of location accuracy in order to receive meaningful results. In this thesis, we attempt to address these challenges by presenting an innovative approach for location privacy management using location obfuscation. The approach is based on our belief at location privacy should be managed by the client without relying on third party systems, such as the Location Anonymizer. The framework is autonomous, secure, and transparent, operates with no loss in result accuracy and ensures privacy under any distribution of users in space. We have evaluated our approach by conducting experiments and simulations on a proof of concept implementation.
]]>
Sergey BelyankinThe Theory of Runs and its Applications to Statistical Inference
http://epublications.marquette.edu/theses/2144
http://epublications.marquette.edu/theses/2144Mon, 01 Feb 2016 11:33:06 PST
The application of the theory of runs to the testing of statistical data is a fairly new method of treating such material. In 1940 A. Mood gave a thorough discussion of the distributions of runs. Since that time run theory has been used in testing for randomness and testing whether two samples are from the same population. This latter test was derived by A. Wald and J. Wolfowitz, the underlying theory being presented after A. Mood's work. The method used by these and others who have worked on the problem is combinatorial algebra. In 1956 O. Ludwig presented a paper on the topic, using stochastic processes. It is the purpose of this thesis to present some of the more important theory found in the papers of these men.
]]>
Sheila ConheadyThe Application of Vectors to the Theory of Curves in Four Dimensions
http://epublications.marquette.edu/theses/2143
http://epublications.marquette.edu/theses/2143Mon, 01 Feb 2016 11:21:47 PST
In his two-volume treatise, Geometry of Four Dimensions, A. R. Forsyth (2) has extensively developed the theory of curves and surfaces completely in Cartesian form. This paper has developed a portion of Forsyth's work on four dimensional curves by means of the vector notation of Weatherburn (4). The vector notation is more concise than the Cartesian form and it is to be hoped that it affords added clarity to intuitive concepts. Throughout the work, in order to maintain continuity, certain long calculations have been placed in the Appendices.
]]>
Phillip R. BenderConstruction and Analysis of the Conchoids of Conics
http://epublications.marquette.edu/theses/2142
http://epublications.marquette.edu/theses/2142Fri, 29 Jan 2016 13:45:40 PST
The purpose of this paper is to extend the construction suggested by L. Crelier to the case of conics. The construction shall be defined as follows: Given a conic C, a point 0, a constant length k, and a constant angle Alpha. Through O draw a radius vector intersecting the conic in P. at an angle QPQ equal to Alpha, draw PQ and PQ1 equal to k. The locus of Q and Q1 is the conchoid of the conic C. It is the purpose of this paper to examine the equations of the conchoids of the circle, parabola, ellipse, and hyperbola by means of methods accepted in curve analysis and to derive general characteristics of these conchoids. It is the further purpose of this paper to construct and classify sufficient sets of conchoids to enable one to follow the behavior of the conchoids of the circle, parabola, ellipse, and hyperbola within the finite region.
]]>
Issac CoganThe Geometry of a Complex Variable
http://epublications.marquette.edu/theses/2141
http://epublications.marquette.edu/theses/2141Fri, 29 Jan 2016 12:31:17 PST
References to the so-called imaginary or complex numbers had been made by mathematicians in early times. The method of dealing with such numbers or quantities gradually took form, until today we have at our disposal a full study of the complex variable. It is the purpose of this thesis to show how a geometry based on the complex variable is built up. By establishing a relationship between points in a plane and the plane itself, a coordinate system is founded. The mapping of one plane upon another, as well as transformations within the same plane, make up a large portion of the geometry of the complex variable.
]]>
Mary John Dominic BlongA Statistical Comparison of Financial Gain Realized Through Home Purchase in Selected Areas of Milwaukee County
http://epublications.marquette.edu/theses/2140
http://epublications.marquette.edu/theses/2140Fri, 29 Jan 2016 12:31:16 PST
In the minds of many Americans there lurks the belief, accepted as dogma, that as minorities move into a neighborhood property values necessarily go down. It has long been assumed that buying a home in certain areas of the city of Milwaukee invites financial disaster due to the influx of minorities and the consequent drop in property values. Similarly, it has been assumed that home buying in Milwaukee County suburbs is financially more prudent than buying in the city itself. The purpose of this study is to investigate the validity of these assumptions, and to identify some of the important factors in determining the financial gains of homeowners in selected areas of Milwaukee County. The financial gains of homeowners is measured in terms of their net worth in selected areas of the county after the period of ownership from 1968 to 1975. A comparison of the net worth of homeowners will establish a ranking of these areas on the basis of their financial gains.
]]>
Marie A. BrooksAn Apparatus for the Study of the Effects of Resonance in Low Frequency Alternating Current Circuits
http://epublications.marquette.edu/theses/2139
http://epublications.marquette.edu/theses/2139Tue, 15 Dec 2015 12:13:02 PSTAmos M. H. PetitIdentification of Acoustic Signals Using Artificial Neural Networks
http://epublications.marquette.edu/theses/2138
http://epublications.marquette.edu/theses/2138Tue, 15 Dec 2015 12:01:20 PST
This thesis describes, experiments in developing artificial neural networks, using a feedforward architecture and the backpropagation learning algorithm for classifying acoustic signals from three appliances: a washer, a dryer, and a furnace. The artificial neural network was trained to give the on/off status of these three appliances based on amplitudes of acoustic frequencies. Tests were performed on the network which varied the number of hidden units, learning rates, tolerances, and the number of training spectra. Two of the best artificial neural networks were compared to three classical pattern classification techniques: Euclidean distance, direction cosines, and the Tanimoto similarity measure. The performance of the network was also compared to that of human subjects visually classifying the spectra.
]]>
Russell C. MillerConformal Mapping
http://epublications.marquette.edu/theses/2137
http://epublications.marquette.edu/theses/2137Mon, 14 Dec 2015 11:23:04 PST
The purpose of this thesis is to give a simple interpretation of conformal mapping by some functions, showing how they map one plane upon the other, into what curves straight lines in one plane are carried over. The mapping of lines parallel to the co=ordinate axes gives the means of finding the equipotential lines and stream lines of a fluid in motion in two dimensions, also the equipontial lines and lines of force in a two-dimensional electric field. But there are more applications of conformal mapping in physics. Only these two examples were taken because they sufficiently show the use of conformal mapping in physics. The material for the problem I gathered from various books. Nearly every book dealing with Funktiontheorie and Functions of a Complex Variable contains more or less information about conformal representation. I found a very good introductions in conformal mapping in Beiberbach's "Einfushrung in die Konforme Abbildung" and in Lewent's "Konforme Abbildung."
]]>
Ingonda Von Mezynski