Physical Sciences and Mathematics Commons^™

A Forward-Backward Fluence Model For The Low-Energy Neutron Boltzmann Equation, Gary Alan Feldman

Mathematics & Statistics Theses & Dissertations

In this research work, the neutron Boltzmann equation was separated into two coupled integro-differential equations describing forward and backward neutron fluence in selected materials. Linear B-splines were used to change the integro-differential equations into a coupled system of ordinary differential equations (O.D.E.'s). Difference approximations were then used to recast the O.D.E.'s into a coupled system of linear equations that were solved for forward and backward neutron fluences. Adding forward and backward fluences gave the total fluence at selected energies and depths in the material. Neutron fluences were computed in single material shields and in a shield followed by a target …

New Graphical Approach On The Analysis Of Experimental Data, Suha Sari

Dissertations

This study presents a new graphical method to identify significant effects in factorial experiments. The proposed methods are obtained for the different cases in which the design can be of full factorial or fractional factorial and the factor levels can be pure or mixed.

We focus on the different decomposition methods, for example orthogonal components system and orthogonal contrast method, to make use of the chisquare plot which requires that the sums of squares are of the same degrees of freedom. Examples and simulations illustrating the different cases of the procedure are presented.

Shortest Path Problems In A Stochastic And Dynamic Environment, Jae Il Cho

Theses and Dissertations

In this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network. First, we develop an algorithm for solving an independent expected shortest path problem. Next, we incorporate the inherent dependencies along successive links in two distinct ways to find the expected shortest path. Since the dependent expected shortest path problem cannot be solved with traditional deterministic approaches, we develop a heuristic based on the K-shortest path algorithm for this …

Stochastic Intra-Cellular Modeling, Thomas E. Hopkins

Theses and Dissertations

Air Force personnel may sometimes come into contact with potentially harmful chemicals while performing their duties. Of course the Air Force desires to keep any potential health risks to its members to a minimum. To this end the Air Force would like to identify which chemicals are toxic, their level of toxicity, and the processes by which these chemicals disrupt normal biological activities at the cellular level. The development of mathematical models can be of great benefit to toxicity studies. Because real world systems involve randomness, that is noise, and the desire is to create mathematical models to represent those …

Feature Guided Image Registration Applied To Phase And Wavelet-Base Optic Flow, Kate R. Duffy

Theses and Dissertations

Optic Flow algorithms are useful in problems such as computers vision, navigational systems, and robotics. However, current algorithms are computationally expensive or lack the accuracy to be effective compared with traditionally navigation systems. Recently, lower accuracy inertial navigation systems (INS) based on Microelectromechanical systems (MEMS) technology have been proposed to replace more accurate traditional navigation systems.

Redundant Discrete Wavelet Transform Based Super-Resolution Using Sub-Pixel Image Registration, Daniel L. Ward

Theses and Dissertations

The limited resolution of video imagery taken by aircraft, over geographical areas of interest, hinders the accurate extraction of useful information. The frame resolution of the video is determined by the camera that created it. Information exists about the camera which can be used to increase frame resolution beyond the resolution capability of the camera. This is achieved by a process called super-resolution, which uses multiple low-resolution video frames to create one high-resolution image.

The Mathematics Of Object Recognition In Machine And Human Vision, Sunyoung Kim

Theses Digitization Project

The purpose of this project was to see why projective geometry is related to the sort of sensors that machines and humans use for vision.

The Kauffman Bracket Skein Module Of The Quaternionic Manifold, John Michael Harris

LSU Doctoral Dissertations

In this work, we study the structure of the Kauffman bracket skein module of the quaternionic manifold over the field of rational functions. We begin with a brief survey of manifolds whose Kauffman bracket skein modules are known, and proceed in Chapter 2 by recalling the facts from Temperley-Lieb recoupling theory that we use in the proofs. In Chapter 3, using recoupling theory and with Mathematica's assistance, we index an infinite presentation of the skein module, and conjecture that it is five-dimensional. In Chapter 4, using a new set of relations, we prove that the skein module is indeed spanned …

Equations Of Parametric Surfaces With Base Points Via Syzygies, Haohao Wang

LSU Doctoral Dissertations

Suppose $S$ is a parametrized surface in complex projective 3-space $mathbf{P}^3$ given as the image of $phi: mathbf{P}^1 imes mathbf{P}^1 o mathbf{P}^3$. The implicitization problem is to compute an implicit equation $F=0$ of $S$ using the parametrization $phi$. An algorithm using syzygies exists for computing $F$ if $phi$ has no base points, i.e. $phi$ is everywhere defined. This work is an extension of this algorithm to the case of a surface with multiple base points of total multiplicity k. We accomplish this in three chapters. In Chapter 2, we develop the concept and properties of Castelnuovo-Mumford regularity in biprojective spaces. …

Splitter Theorems For 3- And 4-Regular Graphs, Jinko Kanno

LSU Doctoral Dissertations

Let g be a class of graphs and ≤ be a graph containment relation. A splitter theorem for g under ≤ is a result that claims the existence of a set O of graph operations such that if G and H are in g and H≤G with G≠H, then there is a decreasing sequence of graphs from G to H, say G=G₀≥G₁≥G₂...G_t=H, all intermediate graphs are in g, and each G_i can be obtained from G_i-1 by applying a single …

Stock Price Modeling And Insider Trading Theory, Jessica J. Guillory

LSU Master's Theses

The mathematical study of stock price modeling using Brownian motion and stochastic calculus is a relatively new field. The randomness of financial markets, geometric brownian motions, martingale theory, Ito's lemma, enlarged filtrations, and Girsanov's theorem provided the motivation for a simple characterization of the concepts of stock price modeling. This work presents the theory of stochastic calculus and its use in the financial market. The problems on which we focus are the models of an investor's portfolio of stocks with and without the possibility of insider trading, opportunities for fair pricing of an option, enlarged filtrations, consumptions, and admissibility. This …

Gauss' Method Of Least Squares: An Historically-Based Introduction, Belinda B. Brand

LSU Master's Theses

This work presents Gauss' justification of the method of least squares, following the treatment given by Gauss himself in "Theoria Combinationis Observationum Erroribus Minimis Obnoxiae," where the main idea is to show that the least squares estimate is the unbiased linear estimate of minimum variance. (Actually, we present Gauss' argument both in his terminology and translated into matrix terminology.) We show how this contrasts with Gauss' earlier justfication in "Theoria Motus Corporum Coelestium" which was based on the assumption of a normal distribution of errors, and yielded the estimate of maximum likelihood. We present as a background the development from …

On The Geometry And Topology Of Moduli Spaces Of Multi-Polygonal Linkages, Michael Edward Holcomb

LSU Doctoral Dissertations

The geometric, topological, and symplectic properties of moduli spaces (spaces of configurations modulo rotations and translations) of polygonal linkages have been studied by Kapovich, Millson, and Kamiyama, et. al. One can form a polygonal linkage by taking two free linkages and identifying initial and terminal vertices. This can be generalized so that one takes three free linkages and identifies initial and terminal vertices. Then one obtains a linkage which contains multiple polygons, any two of which have shared edges. The geometric and topological properties of moduli spaces of these multi-polygonal linkages are studied. These spaces turn out to be compact …

A Parametrization Approach For Solving The Hamilton-Jacobi-Equation And Application To The A2 Toda Lattice, Mohammad Dikko Aliyu

LSU Master's Theses

Hamilton-Jacobi (HJ)-theory is an extension of Lagrangian mechanics and concerns itself with a directed search for a coordinate transformation in which the equations of motion can be easily integrated. The equations of motion of a given mechanical system can often be simplified considerably by a suitable transformation of variables such that all the new position and momemtum coordinates are constants. A particular type of transformation is chosen in such a way that the new equations of motion retain the same form as in the former coordinates; such a transformation is called canonical or contact and can greatly simplify the solution …

Book Embeddings Of Graphs, Robin Leigh Blankenship

LSU Doctoral Dissertations

We use a structural theorem of Robertson and Seymour to show that for every minor-closed class of graphs, other than the class of all graphs, there is a number k such that every member of the class can be embedded in a book with k pages. Book embeddings of graphs with relation to surfaces, vertex extensions, clique-sums and r-rings are combined into a single book embedding of a graph in the minor-closed class. The effects of subdividing a complete graph and a complete bipartite graph with respect to book thickness are studied. We prove that if n ≥ 3, …

A Risk-Averse Strategy For Blackjack Using Fractional Dynamic Programming, Ryan A. Dutsch

LSU Master's Theses

We present how blackjack is related to a discrete-time control problem, rather than a zero-sum game. Using the compiler Visual C++, we write a program for a strategy for blackjack, but instead of maximizing the expected value, we use a risk-averse approach. We briefly describe how this risk-averse strategy is solved by using a special type of dynamic programming called fractional dynamic programming.