Digital Commons Network^™

Resolvability In Graphs, Varaporn Saenpholphat

Dissertations

The distance d (u, v ) between two vertices u and v in a connected graph G is the length of a shortest u - v path in G . For an ordered set W = { w1 , w2 , [Special characters omitted.] &cdots; , wk } of vertices in G and a vertex v of G , the code of v with respect to W is the k -vector cW (v ) = (d ( v, w1 ),d (v, w 2 ), [Special characters omitted.] &cdots; , d …

Pattern Recognition For Electric Power System Protection, Yong Sheng

Doctoral Dissertations

The objective of this research is to demonstrate pattern recognition tools such as decision trees (DTs) and neural networks that will improve and automate the design of relay protection functions in electric power systems. Protection functions that will benefit from the research include relay algorithms for high voltage transformer protection (TP) and for high impedance fault (HIF) detection. A methodology, which uses DTs and wavelet analysis to distinguish transformer internal faults from other conditions that are easily mistaken for internal faults, has been developed. Also, a DT based solution is proposed to discriminate HIFs from normal operations that may confuse …

Comparing Clustering Algorithms For Use With Genomic And Proteomic Data, Rebecca A. Olson

Theses and Dissertations

The Human Genome Project and related projects have resulted in the development of a number of new experimental and analytic tools for use in genomic and proteomic research. In the area of toxicogenomics, researchers are concerned with how genes react to exposure to certain chemicals. The United States Air Force is interested in the effect of exposure to mission-essential chemicals. Although military personnel may come into contact with chemicals such as hydrazine, risk assessment is usually very limited. On the genomic level, risk assessment is a multi-stop and multi-disciplinary process. The process begins with an experiment that exposes cells to …

Finite Extinction Time For Non-Linear Absorption-Diffusion Equations, Jacob B. Goldberg

Theses and Dissertations

In this thesis, we develop a numerical method in order to approximate the solutions of one-dimensional, non-linear absorption-diffusion equations. We test our method for accuracy against a linear diffusion equation with a solution that can be written in closed form. We then test various types of diffusion and absorption terms to determine which ones produce extinction in finite time. We also develop a numerical method to computationally solve diffusion-free equations. We compare the numerical solutions of the one-dimensional, non-linear absorption-diffusion equation and the diffusion-free equation and we find that for the cases tested, the numerical absorption-diffusion solutions are always less …

Nonlinear Schrödinger Type Equations With Asymptotically Linear Terms, Francois A. Van Heerden

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

We study the nonlinear Schrödinger type equation

–Δu + (λg(x) + 1)u = f(u)

on the whole space R^N. The nonlinearity f is assumed to be asymptotically linear and g(x) ≥ 0 has a potential well. We do not assume a limit for g(x) as |x| → ∞ . Using variational techniques, we prove the existence of a positive solution for λ large. In the case where f is odd we obtain multiple pairs of solutions. The limiting behavior of solutions as λ → ∞ is also considered.

Tournament Matrices An Overview, Russel O. Carlson

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The results of a round robin tournament can be represented as a matrix of zeros and ones, by ordering the players and placing a one in the (i,j) position if player i beat player j, and zeros otherwise. These matrices, called tournament matrices, can be represented by graphs, called tournament graphs. They have been the subject of much research and study, yet there have been few attempts to give a wide exposition on the subject. Those that have been done tend to focus on the graph theoretical aspects of tournaments. S. Ree and Y. Koh did write a brief …

Selecting Salient Features In High Feature To Exemplar Ratio Conditions, Ismail Aslan

Theses and Dissertations

A key tenet to the Air Force's vision of Global Vigilance, Reach, and Power is the ability to project power via the use of aerial refueling. Scheduling of limited tanker resources is a major concern for Air Mobility Command (AMC). Currently the Combined Mating and Ranging Planning System (CMARPS) is used to plan aerial refueling operations, however due to the complex nature of the program and the length of time needed to run a scenario, the need for a simple tool that runs in much shorter time is desired. Ant colony algorithms are recently developed heuristics for finding solutions to …

Modeling And Analysis Of Multicommodity Network Flows Via Goal Programming, Matthew A. Scott

Theses and Dissertations

In this research we focused on the mobility system modeled by the AMC mobility planner's calculator (AMPCALC). We developed AMPCALC as a user-friendly tool and allow the user to easily carry out strategic airlift, air refueling and aeromedical evacuation calculations that are covered in Air Force Pamphlet 10-1403. In this study, Excel software and its macro language, Visual Basic for Application, are our two main tools. In the methodology of the thesis we examined fundamental aspects of the mobility system in AMPCALC. We discussed formulation logic of the mobility cycle. We presented ramp use optimization and tanker optimization processes. We …

Identifying Enlisted Stay And Leave Population Characteristics With Discriminant Analysis, Zabrina Y. Hoggard

Theses and Dissertations

The research contribution of this thesis is the first known integrated architecture and feature selection algorithm for Radial Basis Neural Networks (RBNNs). The objective is to apply the network iteratively to determine the final architecture and feature set used to evaluate a problem. Additionally, this thesis compares three different classification techniques, Discriminant Analysis (DA), Feed-Forward Neural Networks (FFN) and RBNNs against several hard to solve problems. These problems were used to evaluate general classifier performance as well as the performance of the feature selection techniques. This thesis describes the classification techniques as well as the measures used to evaluate them. …

An Analysis Of Mutually Dispersive Brown Symbols For Non-Linear Ambiguity Suppression, Matthew J. Papaphotis

Theses and Dissertations

This thesis significantly advances research towards the implementation of optimal Non-linear Ambiguity Suppression (NLS) waveforms by analyzing the Brown theorem. The Brown theorem is reintroduced with the use of simplified linear algebraic notation. A methodology for Brown symbol design and digitization is provided, and the concept of dispersive gain is introduced. Numerical methods are utilized to design, synthesize, and analyze Brown symbol performance. The theoretical performance in compression and dispersion of Brown symbols is demonstrated and is shown to exhibit significant improvement compared to discrete codes. As a result of this research a process is derived for the design of …

A Recommendation For Determining The Efficacy Of Weight Removal Estimates For The Pacific Cod Longline Cdq Fishery, Anna L. Furniss

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

In January 2000, the Alaska Department of Community and Economic Development contacted the National Marine Fisheries Service (NMFS) regarding concerns over the methods used to determine catch estimates for the Pacific Cod Community Development Quota (CDQ) fishery. Currently, NMFS determines catch estimates for the Pacific Cod CDQ fishery based on the data collected by observers from the North Pacific Groundfish Observer Program (NPGOP).

Observer estimates for catch are based on the random sampling methods for a longline fishing vessel as described in the North Pacific Groundfish Observer Manual. These sampling methods provide an official total catch (OTC) estimate for each …

Numerical Solution Of Markov Chains, Amr Lotfy Elsayad

Theses Digitization Project

This project deals with techniques to solve Markov Chains numerically.

Group Automorphisms And The Decomposition Of Plancherel Measures, David Slay

LSU Doctoral Dissertations

In this paper, a natural action of the automorphisms of a group on the space of irreducible unitary representations is used to decompose the Plancherel measure on the dual space as an integral of measures on homogeneous spaces. Explicit decompositions are obtained for the cases of free 2 and 3-step nilpotent Lie groups. These results are obtained using direct integral decompositions, induced representations, the Mackey Machine, and measure theory on homogeneous spaces.

A Monotone Follower Control Problem With A Nonconvex Functional And Some Related Problems, Jamiiru Luttamaguzi

LSU Doctoral Dissertations

A generalized one-dimensional monotone follower control problem with a nonconvex functional is considered. The controls are assumed to be nonnegative progressively measurable processes. The verification theorem for this problem is presented. A specific monotone follower control problem with a nonconvex functional is then considered in which the diffusion term is constant. The optimal control for this problem, which is explicitly given, can be viewed as tracking a standard Wiener process by a non anticipating process starting at 0. For some parameters values, the value function for this monotone follower control problem is shown to be C² and for other …

On The Stabilization And Regularization Of Rational Approximation Schemes For Semigroups, Simone Flory

LSU Doctoral Dissertations

In this work we discuss consistency, stability and convergence of rational approximation methods for strongly continuous semigroups on Banach spaces. The Lax-Chernoff theorem shows that in this setting consistency and stability assumptions are necessary to obtain strong uniform convergence of approximation methods. We investigate rational approximation methods for strongly continuous semigroups and their consistency properties, with special emphasis on A-stable methods and Padé-type approximations. In particular, we discuss the stability and convergence properties of these schemes, including the stability of the well-known and widely used Backward-Euler and Crank-Nicolson Schemes. Furthermore, we modify stabilization techniques developed by Hansbo, Larsson, Luskin, Rannacher, …

Exotic Integral Witt Equivalence Of Algebraic Number Fields, Changheon Kang

LSU Doctoral Dissertations

Two algebraic number fields K and L are said to be exotically integrally Witt equivalent if there is a ring isomorphism W(O_K) ~ W(O_L) between the Witt rings of the number rings O_K and O_L of K and L, respectively. This dissertation studies exotic integral Witt equivalence for totally complex number fields and gives necessary and sufficient conditions for exotic integral equivalence in two special classes of totally complex number fields.

On Properties Of Linear Control Systems On Lie Groups, Fabiana Cardetti

LSU Doctoral Dissertations

In this work we study controllability properties of linear control systems on Lie groups as introduced by Ayala and Tirao in [AT99]. A linear control system _x0006_Σ Lie group G is defined by x' = X(x) + Σ^k_j=1 u_jY_j(x), where the drift vector field X is an infinitesimal automorphism, u_j are piecewise constant functions, and the control vectors Y_j are left-invariant vector fields. Properties for the flow of the infinitesimal automorphism X and for the reachable set defined by _x0006_Σ are presented in Chapter 3. Under a condition similar to the Kalman …

Racks, Quandles And Virtual Knots, Victor Samuel Nelson

LSU Doctoral Dissertations

We begin with a brief survey of the theory of virtual knots, which was announced in 1996 by Kauffman. This leads naturally to the subject of quandles and quandle homology, which we also briefly introduce. Chapter 2 contains a proof in terms of Gauss diagrams that the forbidden moves unknot virtual knots. This chapter includes material which has appeared in the Journal of Knot Theory and its Ramifications and is reprinted here by permission of World Scientific Publishing. In chapter 3 (cowritten with my advisor R.A.Litherland) we confirm a conjecture of J.S.Carter et.al. that the long exact sequence in rack …

Explicit Multiplicative Relations Between Gauss Sums, Brian J. Murray

LSU Doctoral Dissertations

H.Hasse conjectured that all multiplicative relations between Gauss sums essentially follow from the Davenport-Hasse product formula and the norm relation for Gauss sums. While this is known to be false, very few counterexamples, now known as sign ambiguities, have been given. Here, we provide an explicit product formula giving an infinite class of new sign ambiguities and resolve the ambiguous sign in terms of the order of the ideal class of quadratic primes.

Discrete Mathematics Topics In The Secondary School Curriculum, Aimee Beth Boyd

LSU Master's Theses

This thesis discusses two topics of discrete mathematics in a manner suitable for presentation at a secondary-school level. The introduction outlines the benefits of including discrete mathematics in the secondary-school curriculum. The two chapters which follow include detailed treatment of the two selected topics: the Traveling Salesman Problem and RSA encryption. The discussion of the Traveling Salesman Problem consists of introduction to the problem through several real-life scenarios, followed by a discussion of various methods for solving the problem. We discuss exact and approximate algorithms together with their computational complexity and practical limitations. The discussion of RSA encryption begins with …