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

Applied Mathematics Commons

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

5,216 Full-Text Articles 5,835 Authors 1,159,765 Downloads 206 Institutions

All Articles in Applied Mathematics

Faceted Search

5,216 full-text articles. Page 166 of 172.

Parametric Lp Analysis, Allen Holder 2010 Rose-Hulman Institute of Technology

Parametric Lp Analysis, Allen Holder

Mathematical Sciences Technical Reports (MSTR)

Parametric linear programming is the study of how optimal properties depend on data parametrizations. The study is nearly as old as the field of linear programming itself, and it is important since it highlights how a problem changes as what is often estimated data varies. We present what is a modern perspective on the classical analysis of the objective value's response to parametrizations in the right-hand side and cost vector. We also mention a few applications and provide citations for further study


An Algorithm For Wavelet–Based Elemental Spectrum Analysis, Bruce Kessler 2010 Western Kentucky University

An Algorithm For Wavelet–Based Elemental Spectrum Analysis, Bruce Kessler

Mathematics Faculty Publications

At the previous Approximation Theory XII meeting, I discussed some preliminary work with the Applied Physics Institute at Western Kentucky University in using multiwavelets to provide an objective analysis of gamma-ray spectrum generated from fast neutron bombardment of objects, for the purpose of identifying the elemental composition of the object. The method discussed at the time worked moderately well with the limited amount of data provided, but subsequent use with data sets of different compounds and with different detectors brought to light serious flaws with its implementation.

This talk will illustrate those issues and will address how they have been ...


Maximizing Strike Planning Efficiency For A Given Class Of Targets, Necip Dirik 2010 Air Force Institute of Technology

Maximizing Strike Planning Efficiency For A Given Class Of Targets, Necip Dirik

Theses and Dissertations

Strike planning is one of the fundamental tasks of the Turkish Air Force and involves assignment of strike aircraft to targets with a maximum level of efficiency. Therefore, planning an optimal strike plan based on the preferences of the decision maker is crucial. The efficiency of the strike plan in this research implies attacking the maximum number of targets while considering target priority and the desired level of damage on each target. Another objective is to minimize the cost of the plan. This research develops an exact model that maximizes the efficiency of the strike plan using LINGO with Excel ...


A Multi-Objective Approach To A Bipartite Assignment Matching Problem Using Weighted Values From Multiple Contraints, Greg S. Jeong 2010 Air Force Institute of Technology

A Multi-Objective Approach To A Bipartite Assignment Matching Problem Using Weighted Values From Multiple Contraints, Greg S. Jeong

Theses and Dissertations

US Air Force recruiters routinely assign new recruits to available jobs every month. The goal is to find the best assignments in an efficient manner. Although this problem is modeled as a bipartite assignment matching problem, it is not new to the field of Operations Research. This research presents a new approach to solve assignment matching problems given multiple side constraints. Using two multi-criteria optimization techniques, lexicographic optimization and the elastic constraint method, the assignment matching algorithm efficiently produces an optimal solution in a fraction of the time currently spent. This approach is demonstrated in assigning new USAF recruits to ...


Screening And Sufficiency In Multiobjective Decision Problems With Large Alternative Sets, Michael D. Cote 2010 Air Force Institute of Technology

Screening And Sufficiency In Multiobjective Decision Problems With Large Alternative Sets, Michael D. Cote

Theses and Dissertations

Portfolio selection problems with combinatorially-large alternative sets can be impossible to evaluate precisely on a reasonable timescale. When portfolios require complex modeling for performance assessment, prohibitive computational processing times can result. Eliminating a small number of alternatives through an intelligent screening process can greatly reduce the number of alternative combinations, thereby decreasing a problem's evaluation time and cost. A methodology was developed for the class of hierarchical portfolio selection problems in which multiple objectives are all judged on the same sub-objectives. First, a novel capability-based alternative screening process was devised to identify and remove poor alternatives, thereby reducing the ...


The Uav Continuous Coverage Problem, Taegyun Ha 2010 Air Force Institute of Technology

The Uav Continuous Coverage Problem, Taegyun Ha

Theses and Dissertations

The purpose of this research is to develop a method to find an optimal UAV cyclic schedule to provide maximum coverage over a target area to support an ISR mission. The goal is to reach continuous coverage. UAV continuous coverage of a target area is crucial for the success of an ISR mission. Even the smallest coverage gap may jeopardize the success of the mission. Ideally it is desirable to obtain continuous coverage of a target area but the stochastic nature of the problem makes continuous coverage without gaps unlikely. However, it is still possible to obtain a high coverage ...


Validation Of A Novel Approach To Solving Multibody Systems Using Hamilton's Weak Principle, Ashton D. Hainge 2010 Air Force Institute of Technology

Validation Of A Novel Approach To Solving Multibody Systems Using Hamilton's Weak Principle, Ashton D. Hainge

Theses and Dissertations

A novel approach for formulating and solving for the dynamic response of multibody systems has been developed using Hamilton’s Law of Varying Action as its unifying principle. In order to assure that the associated computer program is sufficiently robust when applied across a wide range of dynamic systems, the program must be verified and validated. The purpose of the research was to perform the verification and validation of the program. Results from the program were compared with closed-form and numerical solutions of simple systems, such as a simple pendulum and a rotating pendulum. The accuracy of the program for ...


An Algorithm For Wavelet–Based Elemental Spectrum Analysis, Bruce Kessler 2010 Western Kentucky University

An Algorithm For Wavelet–Based Elemental Spectrum Analysis, Bruce Kessler

Bruce Kessler

At the previous Approximation Theory XII meeting, I discussed some preliminary work with the Applied Physics Institute at Western Kentucky University in using multiwavelets to provide an objective analysis of gamma-ray spectrum generated from fast neutron bombardment of objects, for the purpose of identifying the elemental composition of the object. The method discussed at the time worked moderately well with the limited amount of data provided, but subsequent use with data sets of different compounds and with different detectors brought to light serious flaws with its implementation.

This talk will illustrate those issues and will address how they have been ...


Comments Submitted To The Us Patent Office On Enhancing The Quality Of Examination, Ron D. Katznelson 2010 Bi-Level Technologies

Comments Submitted To The Us Patent Office On Enhancing The Quality Of Examination, Ron D. Katznelson

Ron D. Katznelson

No abstract provided.


On Simulating Univariate And Multivariate Burr Type Iii And Type Xii Distributions, Todd C. Headrick, Mohan D. Pant, Yanyan Sheng 2010 Southern Illinois University Carbondale

On Simulating Univariate And Multivariate Burr Type Iii And Type Xii Distributions, Todd C. Headrick, Mohan D. Pant, Yanyan Sheng

Mohan Dev Pant

This paper describes a method for simulating univariate and multivariate Burr Type III and Type XII distributions with specified correlation matrices. The methodology is based on the derivation of the parametric forms of a pdf and cdf for this family of distributions. The paper shows how shape parameters can be computed for specified values of skew and kurtosis. It is also demonstrated how to compute percentage points and other measures of central tendency such as the mode, median, and trimmed mean. Examples are provided to demonstrate how this Burr family can be used in the context of distribution fitting using ...


Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson 2010 Butler University

Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson

Jonathan P. Sorenson

We discuss a method for computing Σ �≤� 1/�, using time about �2/3 and space about �1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function �(�), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses.


Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson 2010 Butler University

Computing Prime Harmonic Sums, Eric Bach, Dominic Klyve, Jonathan P. Sorenson

Jonathan P. Sorenson

We discuss a method for computing Σ �≤� 1/�, using time about �2/3 and space about �1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function �(�), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses.


First-Order And Second-Order Optimality Conditions For Nonsmooth Constrained Problems Via Convolution Smoothing, Andrew C. Eberhard, Boris S. Mordukhovich 2010 Royal Melbourne Institute of Technology, Australia

First-Order And Second-Order Optimality Conditions For Nonsmooth Constrained Problems Via Convolution Smoothing, Andrew C. Eberhard, Boris S. Mordukhovich

Mathematics Research Reports

This paper mainly concerns deriving first-order and second-order necessary (and partly sufficient) optimality conditions for a general class of constrained optimization problems via smoothing regularization procedures based on infimal-like convolutions/envelopes. In this way we obtain first-order optimality conditions of both lower subdifferential and upper subdifferential types and then second-order conditions of three kinds involving, respectively, generalized second-order directional derivatives, graphical derivatives of first-order subdifferentials, and secondorder subdifferentials defined via coderivatives of first-order constructions.


Time Is Not A Vector: Corrections To The Article “Vectorial Relativity Versus Special Or General Relativity?”, Jorge A. Franco 2010 Universidad Central de Venezuela

Time Is Not A Vector: Corrections To The Article “Vectorial Relativity Versus Special Or General Relativity?”, Jorge A. Franco

Jorge A Franco

In this work the main conceptual errors that sequentially were introduced in the development of the Special Theory of Relativity (SR) are explained. A simple presentation of the Lorentz Transformations (LT) is given, within where it is emphasized that, by using an incomplete configuration, repeated by more than one hundred years, it leads to a first error of a chain of them, when it is assumed that the cross sectional components, in the movable inertial reference system, are invariant or not affected by its relative movement respect a fixed inertial system, on the basis of a presumed “postulate of isotropy ...


Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ 2010 California Polytechnic State University - San Luis Obispo

Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ

Master's Theses and Project Reports

View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.

In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft ...


Patent Examination Policy And The Social Costs Of Examiner Allowance And Rejection Errors, Ron D. Katznelson 2010 Bi-Level Technologies

Patent Examination Policy And The Social Costs Of Examiner Allowance And Rejection Errors, Ron D. Katznelson

Ron D. Katznelson

No abstract provided.


Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson 2010 Butler University

Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson

Jonathan P. Sorenson

In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.


Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson 2010 Butler University

Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson

Jonathan P. Sorenson

In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.


Selective Recursive Kernel Learning For Online Identification Of Nonlinear Systems With Narx Form, Yi Liu, Haiqing Wang, Jiang Yu, Ping Li 2010 Zhejiang University

Selective Recursive Kernel Learning For Online Identification Of Nonlinear Systems With Narx Form, Yi Liu, Haiqing Wang, Jiang Yu, Ping Li

Dr. Yi Liu

Online identification of nonlinear systems is still an important while difficult task in practice. A general and simple online identification method, namely Selective Recursive Kernel Learning (SRKL), is proposed for multi-input–multi-output (MIMO) systems with the nonlinear autoregressive with exogenous input form. A two-stage RKL online identification framework is first formulated, where the information contained by a sample (i.e., the new arriving or old useless one) can be introduced into and/or deleted from the model, recursively. Then, a sparsification strategy to restrict the model complexity is developed to guarantee all the output channels of the MIMO model accurate ...


View From The Hill: Operation Comics, Amy Bingham, Bruce Kessler 2010 Western Kentucky University

View From The Hill: Operation Comics, Amy Bingham, Bruce Kessler

Bruce Kessler

"Operation Comics", comic books with embedded math content appropriate for 4th-6th graders, was the topic of this episode of "View from the Hill".


Digital Commons powered by bepress