Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 21931 - 21960 of 27447

Full-Text Articles in Physical Sciences and Mathematics

A Gibbs Sampling Approach To Maximum A Posteriori Time Delay And Amplitude Estimations, Michele Picarelli May 2004

A Gibbs Sampling Approach To Maximum A Posteriori Time Delay And Amplitude Estimations, Michele Picarelli

Dissertations

Research concerned with underwater propagation in a shallow ocean environment is a growing area of study. In particular, the development of fast and accurate computational methods to estimate environmental parameters and source location is desired. In this work, only select features of the acoustic field are investigated, namely, the time delays and amplitudes of individual paths, the signal-to-noise ratio, and the number of multi-path arrivals. The amplitudes and delays contain pertinent information about the geometry associated with the environment of interest. Estimating the time delays and amplitudes of select paths in a manner that is both accurate and time efficient, …


Nonlinear Long-Wave Interfacial Stability Of Two-Layer Gas-Liquid Flow, Tetyana Segin May 2004

Nonlinear Long-Wave Interfacial Stability Of Two-Layer Gas-Liquid Flow, Tetyana Segin

Dissertations

The flow of two immiscible viscous fluids in a thin inclined channel is considered, in either a cocurrent or countercurrent regime. Following the air-water case, which is found in a variety of engineering systems, we allow the upper fluid to be either compressible or incompressible. The disparity of the length scales and the density and viscosity ratios of the two fluids is exploited through a lubrication approximation of the conservation of mass and the Navier-Stokes equations. As a result of this long-wave theory, a coupled nonlinear system of partial differential equations is obtained that describes the evolution of the interfacial …


Mixing Enhancement By Dual Speed Rotating Stirrer, Arnaud Goullet May 2004

Mixing Enhancement By Dual Speed Rotating Stirrer, Arnaud Goullet

Dissertations

Stirring is a well-known means of fluid mixing due to the emergence of complex patterns in the flow, even at low Reynolds numbers. In this work, we consider a stirrer rotating along a circular trajectory at constant speed. The fluid flow, considered incompressible, inviscid and two dimensional (in a circular container), is modeled by a point vortex model consisting of a vortex rotating in a circular container at constant angular speed. The mixing problem is addressed by considering the Hamiltonian form of the advection equations formulated in a frame of reference moving with the vortex. The dynamics of passive fluid …


On The Behavior Of The Algebraic Transfer, Robert R. Bruner, Lê M. Hà, Nguyễn H. V Hưng May 2004

On The Behavior Of The Algebraic Transfer, Robert R. Bruner, Lê M. Hà, Nguyễn H. V Hưng

Mathematics Faculty Research Publications

Let Tr_k : ��_2 (⊗ over GL_k) PH_i(B��_k) → Ext^(k,k+i)_A(��_2,��_2) be the algebraic transfer, which is defined by W. Singer as an algebraic version of the geometrical transfer tr_k : π_∗^S((B��_k)_+) → π_∗^S(S^0). It has been shown that the algebraic transfer is highly nontrivial and, more precisely, that Tr_k is an isomorphism for k = 1,2,3. However, Singer showed that Tr_5 is not an epimorphism. In this paper, we prove that Tr_4 does not detect the non zero element g_s ∈ Ext^(4,12·2^s)_A(��_2,��_2) for every s ≥ 1. As a consequence, the localized (Sq^0)^(−1)Tr_4 given by inverting the squaring operation Sq^0 …


Some Studies On Uncertainty Management In Dynamical System Using Fuzzy Techniques With Applications., Kausik Majumdar Dr. May 2004

Some Studies On Uncertainty Management In Dynamical System Using Fuzzy Techniques With Applications., Kausik Majumdar Dr.

Doctoral Theses

Unceriain information processing by fuzzy if-then rules has received a lot of attention. Here we have taken a different path to model a system. about which we do not have precise information namely. modelling the system by fuzy valued functions without resorting to fuzzy if-then rules. As a result. the phase (state) space of the system becomes a full set and the underlying fuzzy mapping becomes a fuzzy attainability vet mappine. A fuzzy phase space is a collection of special class of furry subsets (fuzsy points) of R&for some positive integral n. Let the collection of all fuzr, real numbers …


Orbifold Adjunction Formula And Sympletic Corbordisms Between Lens Spaces, Weimin Chen Chen May 2004

Orbifold Adjunction Formula And Sympletic Corbordisms Between Lens Spaces, Weimin Chen Chen

Weimin Chen

Each lens space has a canonical contact structure which lifts to the distribution of complex lines on the three-sphere. In this paper, we show that a symplectic homology cobordism between two lens spaces, which is given with the canonical contact structure on the boundary, must be diffeomorphic to the product of a lens space with the unit interval. As one of the main ingredients in the proof, we also derive in this paper the adjunction and intersection formulae for pseudoholomorphic curves in an almost complex 4–orbifold, extending the relevant work of Gromov and McDuff in the manifold setting.


Elliptic Curves Of Large Rank And Small Conductor, Noam D. Elkies, Mark Watkins May 2004

Elliptic Curves Of Large Rank And Small Conductor, Noam D. Elkies, Mark Watkins

Mathematics - All Scholarship

For r=6,7,...,11 we find an elliptic curve E/Q of rank at least r and the smallest conductor known, improving on the previous records by factors ranging from 1.0136 (for r=6) to over 100 (for r=10 and r=11). We describe our search methods, and tabulate, for each r=5,6,...,11, the five curves of lowest conductor, and (except for r=11) also the five of lowest absolute discriminant, that we found.


Ultraconnected And Critical Graphs, Jason Nicholas Grout May 2004

Ultraconnected And Critical Graphs, Jason Nicholas Grout

Theses and Dissertations

We investigate the ultraconnectivity condition on graphs, and provide further connections between critical and ultraconnected graphs in the positive definite partial matrix completion problem. We completely characterize when the join of graphs is ultraconnected, and prove that ultraconnectivity is preserved by Cartesian products. We completely characterize when adding a vertex to an ultraconnected graph preserves ultraconnectivity. We also derive bounds on the number of vertices which guarantee ultraconnectivity of certain classes of regular graphs. We give results from our exhaustive enumeration of ultraconnected graphs up to 11 vertices. Using techniques involving the Lovász theta parameter for graphs, we prove certain …


Statistical Pronouncements Iii, Shlomo S. Sawilowsky May 2004

Statistical Pronouncements Iii, Shlomo S. Sawilowsky

Theoretical and Behavioral Foundations of Education Faculty Publications

No abstract provided.


Sub-Supersolution Method For Quasilinear Parabolic Variational Inequalities, Siegfried Carl, Vy Khoi Le May 2004

Sub-Supersolution Method For Quasilinear Parabolic Variational Inequalities, Siegfried Carl, Vy Khoi Le

Mathematics and Statistics Faculty Research & Creative Works

This paper is about a systematic attempt to apply the sub-supersolution method to parabolic variational inequalities. We define appropriate concepts of sub-supersolutions and derive existence, comparison, and extremity results for such inequalities.


Optimal Control Of Delay Systems With Differential And Algebraic Dynamic Constraints, Boris S. Mordukhovich, Lianwen Wang May 2004

Optimal Control Of Delay Systems With Differential And Algebraic Dynamic Constraints, Boris S. Mordukhovich, Lianwen Wang

Mathematics Research Reports

This paper concerns constrained dynamic optimization problems governed by delay control systems whose dynamic constraints are described by both delay-differential inclusions and linear algebraic equations. This is a new class of optimal control systems that, on one hand, may be treated as a specific type of variational problems for neutral functional-differential inclusions while, on the other hand, is related to a special class of differential-algebraic systems with a general delay-differential inclusion and a linear constraint link between "slow" and "fast" variables. We pursue a two-hold goal: to study variational stability for this class of control systems with respect to discrete …


The Robustness Of Factor Analyses When The Data Does Not Conform To Standard Parametric Requirements, Haisong Peng May 2004

The Robustness Of Factor Analyses When The Data Does Not Conform To Standard Parametric Requirements, Haisong Peng

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

Objective: To access the robustness of factor analyses when the data does not conform to standard parametric requirements.

Methods: Data were simulated in package R. Maximum likelihood was used to fit and assess the factor models. Chi-square statistics were obtained to test hypotheses about the correct number of factors in simulated settings where the true number of factors was known. The number of true factors varied between 1 and 3; the number of observed variables was either 6 (for 1 factor) or 3 per factor for 2 or more factors.

Results: With standard normal factor populations, and normal errors added …


Σary, Minnesota State University Moorhead, Mathematics Department May 2004

Σary, Minnesota State University Moorhead, Mathematics Department

Math Department Newsletters

No abstract provided.


A Random Boolean Network Model And Deterministic Chaos, Mihaela Teodora Matache, Jack Heidel May 2004

A Random Boolean Network Model And Deterministic Chaos, Mihaela Teodora Matache, Jack Heidel

Mathematics Faculty Publications

This paper considers a simple Boolean network with N nodes, each node’s state at time t being determined by a certain number of parent nodes, which may vary from one node to another. This is an extension of a model studied by Andrecut and Ali ( [5]) who consider the same number of parents for all nodes. We make use of the same Boolean rule as the authors of [5], provide a generalization of the formula for the probability of finding a node in state 1 at a time t and use simulation methods to generate consecutive states of the …


Semilinear Elliptic Equations In Unbounded Domains, Francois A. Van Heerden May 2004

Semilinear Elliptic Equations In Unbounded Domains, Francois A. Van Heerden

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

We studied some semilinear elliptic equations on the entire space R^N. Our approach was variational, and the major obstacle was the breakdown in compactness due to the unboundedness of the domain. First, we considered an asymptotically linear Scltrodinger equation under the presence of a steep potential well. Using Lusternik-Schnirelmann theory, we obtained multiple solutions depending on the interplay between the linear, and nonlinear parts. We also exploited the nodal structure of the solutions. For periodic potentials, we constructed infinitely many homoclinic-type multibump solutions. This recovers the analogues result for the superlinear case. Finally, we introduced weights on the linear and …


Four-Dimensional Non-Reductive Homogeneous Manifolds With Neutral Metrics, Andrew Renner May 2004

Four-Dimensional Non-Reductive Homogeneous Manifolds With Neutral Metrics, Andrew Renner

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

A method due to É. Cartan was used to algebraically classify the possible four-dimensional manifolds that allow a (2, 2)-signature metric with a transitive group action which acts by isometries. These manifolds are classified according to the Lie algebra of the group action. There are six possibilities: four non-parameterized Lie algebras, one discretely parameterized family, and one family parameterized by R.


Lorentz Homogeneous Spaces And The Petrov Classification, Adam Bowers May 2004

Lorentz Homogeneous Spaces And The Petrov Classification, Adam Bowers

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

A. Z. Petrov gave a complete list of all local group actions on a four-dimensional space-time that admit an invariant Lorentz metric, up to an equivalence relation. His list was compiled by directly constructing all possible Lie algebras of infinitesimal generators of group actions that preserve a Lorentz metric. The goal of this paper was to verify that classification by algebraically constructing a list of all possible three-dimensional homogeneous spaces and calculating which among them have a non-degenerate invariant metric.


Application Of A Mickens Finite-Difference Scheme To The Cylindrical Bratu-Gelfand Problem, Ron Buckmire Apr 2004

Application Of A Mickens Finite-Difference Scheme To The Cylindrical Bratu-Gelfand Problem, Ron Buckmire

Ron Buckmire

No abstract provided.


Factorization Of Polynomials And Real Analytic Function, Radoslaw L. Stefanski Apr 2004

Factorization Of Polynomials And Real Analytic Function, Radoslaw L. Stefanski

Honors Theses

In this project, we address the question: When can a polynomial p(x, y) of two variables be factored as p(x, y) = f(x)g(y), where f and g are polynomials of one variable. We answer this question, using linear algebra, and create a Mathematica program which carries out this factorization. For example,

3+3x-5x^3+y+xy-5/3x^3y+y^2+xy^2-5/3x^3y^2 = (1+x-5/3x^3)(3+y+y^2)

We then generalize this concept and ask: When can p(x,y) can be written as

p(x,y) = f1(x)g2(y)+f2(x)g2(y)+...+fr(x)gr(y)

where fj,gj are polynomials. This can certainly be done (for large enough r). Which is the minimum such r? Again, we have a Mathematica program which carries out this …


Discovering The Potential For Advancements In Intrusion Detection Systems, Kenneth J. Buonforte Apr 2004

Discovering The Potential For Advancements In Intrusion Detection Systems, Kenneth J. Buonforte

Honors Theses

An intrusion detection system (IDS) is a collection of monitors strategically placed on a network or individual host in order to detect anomalous behavior. Since James Anderson introduced one of the first frameworks for an intrusion detection system in [1]. researchers have extended the capabilities of these systems. IDSs take many forms, from systems as basic as command line audit logs to those that emulate the defense mechanisms of the human immune system. However, as intrusion detection has evolved, scientists and administrators alike are beginning to question the need for this technology due to its lack of quantifiable performance and …


Two Theorems About Maximal Cohen--Macaulay Modules, Craig Huneke, Graham J. Leuschke Apr 2004

Two Theorems About Maximal Cohen--Macaulay Modules, Craig Huneke, Graham J. Leuschke

Mathematics - All Scholarship

This paper contains two theorems concerning the theory of maximal Cohen-Macaulay modules. The first theorem proves that certain Ext groups between maximal Cohen-Macaulay modules M and N must have finite length, provided only finitely many isomorphism classes of maximal Cohen-Macaulay modules exist having ranks up to the sum of the ranks of M and N. This has several corollaries. In particular it proves that a Cohen-Macaulay local ring of finite Cohen-Macaulay type has an isolated singularity. A well-known theorem of Auslander gives the same conclusion but requires that the ring be Henselian. Other corollaries of our result include statements concerning …


Securing Distributed Computations : In Search Of Reliable Large-Scale Compute Power And Refreshed Redundancy, Edward P. Kenney Apr 2004

Securing Distributed Computations : In Search Of Reliable Large-Scale Compute Power And Refreshed Redundancy, Edward P. Kenney

Honors Theses

The Internet may be the single largest technological advance or significant societal change in the last century. Not only does it allow access to more information than any human could ever hope to digest, but it produces the potential of having millions of computers combining their computational forces for the betterment of a single cause .. Tl is is the fundamental goal of distributed computing. A distributed system is defined to be a network of machines with some degree of centralized direction. In a distributed computational system each machine will accept computational tasks from a supervisor in a master-slave relationship. …


Products Of Characters And Finite P-Groups Ii, Edith Adan-Bante Apr 2004

Products Of Characters And Finite P-Groups Ii, Edith Adan-Bante

Faculty Publications

Let p be a prime number. Let G be a finite p-group and χ ∈ Irr(G). Denote by the -χ ∈ Irr(G) complex conjugate of χ . Assume that χ(1) = pn. We show that the number of distinct irreducible constituents of the product of χ-χ is at least 2n(p−1)+1.


Optimal Boundary Control Of Hyperbolic Equations With Pointwise State Constraints, Boris S. Mordukhovich, Jean-Pierre Raymond Apr 2004

Optimal Boundary Control Of Hyperbolic Equations With Pointwise State Constraints, Boris S. Mordukhovich, Jean-Pierre Raymond

Mathematics Research Reports

In this paper we consider dynamic optimization problems for hyperbolic systems with boundary controls and pointwise state constraints. In contrast to parabolic dynamics, such systems have not been sufficiently studied in the literature. The reason is the lack of regularity in the case of hyperbolic dynamics. We present necessary optimality conditions for both Neumann and Dirichlet boundary control problems and discuss differences and relationships between them.


Skew-Product Dynamical Systems: Applications To Difference Equations, Saber Elaydi, Robert J. Sacker Apr 2004

Skew-Product Dynamical Systems: Applications To Difference Equations, Saber Elaydi, Robert J. Sacker

Mathematics Faculty Research

No abstract provided.


Asymptotic Stability Of Linear Difference Equations Of Advanced Type, Fozi M. Dannan, Saber Elaydi Apr 2004

Asymptotic Stability Of Linear Difference Equations Of Advanced Type, Fozi M. Dannan, Saber Elaydi

Mathematics Faculty Research

Necessary and sufficient conditions are obtained for the asymptotic stability of difference equations of advanced type n of the form x(n) - ax(n+1) + bx(n+k) = 0, n = 0, 1, .. where a and b are arbitrary real numbers and k > 1. For a = 1, we establish an analogue of a result by Levin and May.


Mathematical And Empirical Modeling Of Chemical Reactions In A Microreactor, Jing Hu Apr 2004

Mathematical And Empirical Modeling Of Chemical Reactions In A Microreactor, Jing Hu

Doctoral Dissertations

This dissertation is concerned with mathematical and empirical modeling to simulate three important chemical reactions (cyclohexene hydrogenation and dehydrogenation, preferential oxidation of carbon monoxide, and the Fischer-Tropsch (F-T) synthesis in a microreaction system.

Empirical modeling and optimization techniques based on experimental design (Central Composite Design (CCD)) and response surface methodology were applied to these three chemical reactions. Regression models were built, and the operating conditions (such as temperature, the ratio of the reactants, and total flow rate) which maximize reactant conversion and product selectivity were determined for each reaction.

A probability model for predicting the probability that a certain species …


Author Information Apr 2004

Author Information

The Mathematics Enthusiast

No abstract provided.


Understanding Polygons And Polyhedrons Using Flexagons, Aaron Tekulve Apr 2004

Understanding Polygons And Polyhedrons Using Flexagons, Aaron Tekulve

The Mathematics Enthusiast

The goal of this paper is to help students understand simple polygons and simple polyhedrons. First the project within this paper involves having students look at polygons. Though much of this information should have been learned in the fourth grade it is still important to review this material. Having the students define certain shapes illustrates their true understanding of the subject. The second part to the project within this paper is to use the student’s knowledge of polygons and build polyhedrons. In this paper the students will only have to concern themselves with squares and equilateral triangles. Here they will …


Exploring Perimeter And Area With 4th Graders, Amber Lieberg Winkler Apr 2004

Exploring Perimeter And Area With 4th Graders, Amber Lieberg Winkler

The Mathematics Enthusiast

I am going to teach basic introductory geometry skills to 4th graders using Geometry’s Sketchpad. At this age, children are only beginning to learn about geometry in their math classes, and I would like for the students to understand these basic concepts using technology. This problem is so important for the students to learn early, and learn correctly. These skills will involve finding the area and perimeter of regular polygons, basic skills using Geometry’s Sketchpad, and activities that will apply these introductory concepts; directly correlating within the national geometry standards of mathematics. Children use geometry everyday, even when they don’t …