Open Access. Powered by Scholars. Published by Universities.®
- Keyword
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Scheduling Problems, Aamir Kudai
Scheduling Problems, Aamir Kudai
Honors Theses
Manufacturing industry is growing exponentially. The need of using algorithms and computational techniques to enhance processes is increasing every day. Algorithms help us solve almost all kind of computational problems. Not only choosing the right algorithm for a problem is important but also optimizing its time and space efficiency is crucial. BorgWarner Transmission Systems located in Water Valley, Mississippi is one among the leading manufacturing companies. This paper will demonstrate a real-world audit scheduling problem happened at BorgWarner and the techniques used to solve it. A gentle introduction to some of the heuristic algorithms such as Genetic algorithm, Randomized algorithm, …
Mathemagics, Arthur Benjamin
Mathemagics, Arthur Benjamin
Dalrymple Lecture Series
Dr. Arthur Benjamin is the Smallwood Family Professor of Mathematics at Harvey Mudd College in Claremont, California. He is also a professional magician, and in his entertaining and fast-paced performance, Dr. Benjamin will demonstrate how to mentally add and multiply numbers faster than a calculator, how to figure out the day of the week of any date in history, and other amazing feats of mind.
Generalized Characteristics Of A Generic Polytope, Tommy Naugle
Generalized Characteristics Of A Generic Polytope, Tommy Naugle
Electronic Theses and Dissertations
For a smooth hypersurface S ⊂ R 2n given by the level set of a Hamiltonian function H, a symplectic form ω on R2n induces a vector field XH which flows tangent to S. By the nondegeneracy of ω, there exists a distinguished line bundle LS whose characteristics are the integral curves of XH. When S is the boundary of a smooth convex domain K˜ ⊂ R 2n, then the least action among closed characteristics of LS is equal to the Ekeland-Hofer-Zehnder capacity, a symplectic invariant. From a result due to Artstein-Avidan and Ostrover, there exists a continuous extension of …
Bases In Spaces Of Regular Multilinear Operators And Homogeneous Polynomials On Banach Lattices, Khazhak Varazdat Navoyan
Bases In Spaces Of Regular Multilinear Operators And Homogeneous Polynomials On Banach Lattices, Khazhak Varazdat Navoyan
Electronic Theses and Dissertations
For Banach lattices E1,…, Em and F with 1-unconditional bases, we show that the monomial sequence forms a 1-unconditional basis of Lr(E1,…, Em;F), the Banach lattice of all regular m-linear operators from E1×···× Em to F, if and only if each basis of E1,…,Em is shrinking and every positive m-linear operator from E 1×···×Em to F is weakly sequentially continuous. As a consequence, we obtain necessary and sufficient conditions for which the m-fold Fremlin projective tensor product E1⊗ |π|··· ⊗|π|E m (resp. the m-fold positive injective tensor product E1⊗|ϵ|··· ⊗ |ϵ|Em) has a shrinking basis or a boundedly complete basis. …
Automating The Calculation Of Hilbert-Kunz Multiplicities And F-Signatures, Gabriel Johnson
Automating The Calculation Of Hilbert-Kunz Multiplicities And F-Signatures, Gabriel Johnson
Honors Theses
We describe an application written to automate a calculation for the mathematical research of Dr. Spiroff of University of Mississippi & Dr. Enescu of Georgia State University. This work represents a way to overcome the barriers of the mathematical calculations in obtaining theoretical results.