Other Applied Mathematics Commons^™

The Four-Color Theorem And Chromatic Numbers Of Graphs, Sarah E. Cates

Undergraduate Theses and Capstone Projects

We study graph colorings of the form made popular by the four-color theorem. Proved by Appel and Haken in 1976, the Four-Color Theorem states that all planar graphs can be vertex-colored with at most four colors. We consider an alternate way to prove the Four-Color Theorem, introduced by Hadwiger in 1943 and commonly know as Hadwiger’s Conjecture. In addition, we examine the chromatic number of graphs which are not planar. More specifically, we explore adding edges to a planar graph to create a non-planar graph which has the same chromatic number as the planar graph which we started from.

Mathematical Modeling Of Optimal Seasonal Reproductive Strategies And A Comparison Of Long-Term Viabilities Of Annuals And Perennials, Anthony Delegge

Department of Mathematics: Dissertations, Theses, and Student Research

In 1954, Lamont Cole posed a question which has motivated much ecological work in the past 50 years: When is the life history strategy of semelparity (organisms reproduce once, then die) favored, via evolution, over iteroparity (organisms may reproduce multiple times in their lifetime)? Although common sense should dictate that iteroparity would always be favored, we can observe that this is not always the case, since annual plants are not only prevalent, but can dominate an area. Also, certain plant species may be perennial in one region, but annual in another. Thus, in these areas, certain characteristics must be present …

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

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 …

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 …

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 …

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

Master's Theses

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 Development Training, suggested …

An Amazing Mathematical Card Trick, Arthur T. Benjamin

All HMC Faculty Publications and Research

A magician gives a member of the audience 20 cards to shuffle. After the cards are thoroughly mixed, the magician goes through the deck two cards at a time, sometimes putting the two cards face to face, sometimes back to back, and sometimes in the same direction. Before dealing each pair of cards into a pile, he asks random members of the audience if the pair should be flipped over or not. He goes through the pile again four cards at a time and before each group of four is dealt to a pile, the audience gets to decide whether …

From Energy Gradient And Natural Selection To Biodiversity And Stability Of Ecosystems, Bo Deng

Department of Mathematics: Faculty Publications

The purpose of this paper is to incorporate well-established ecological principles into a foodweb model consisting of four trophic levels --- abiotic resources, plants, herbivores, and carnivores. The underlining principles include Kimura's neutral theory of genetic evolution, Liebig's Law of the Minimum for plant growth, Holling's functionals for herbivore foraging and carnivore predation, the One-Life Rule for all organisms, and Lotka-Volterra's model for intraand interspecific competitions. Numerical simulations of the model led to the following statistical findings: (a) particular foodwebs can give contradicting observations on biodiversity and productivity, in particular, all known functional forms -- - positive, negative, sigmoidal, and …

Metastability And Plasticity In A Conceptual Model Of Neurons, Bo Deng

Department of Mathematics: Faculty Publications

For a new class of neuron models we demonstrate here that typical membrane action potentials and spike-bursts are only transient states but appear to be asymptotically stable; and yet such metastable states are plastic — being able to dynamically change from one action potential to another with different pulse frequencies and from one spike-burst to another with different spike-per-burst numbers. The pulse and spike-burst frequencies change with individual ions’ pump currents while their corresponding metastable-plastic states maintain the same transmembrane voltage and current profiles in range. It is also demonstrated that the plasticity requires two one-way ion pumps operating in …

Advances And Applications Of Dsmt For Information Fusion (In Chinese), Florentin Smarandache, Jean Dezert

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.