You searched for:

Series
:
For All Practical Purposes : Introduction to Contemporary Mathematics
x
26 entries
Refine search
Browser-rss

Search Results:

Number
Remove Star
Title
Format
Year
Location & Availability
Call #
1.

Management Science Overview [electronic resource]

Loading...
Program 1 introduces Management science or the study of scheduling (people, workflow) in order to maximize efficiency and effectiveness. Algorithms are used to generate accurate and optimal solutions to problems involving street networks (garbage collection, postal deliveries), scheduling (airlines), and routing problems (salespeople, telephone relays). Overview conveys the scope and applicability of management science concepts.
Online
1986
2.

Street Smarts [electronic resource]

Loading...
Program 2 illustrates that routing problems that involve traversing streets in a city can be solved by graphing. It also shows how to find efficient travel routes using graphs and Euler circuits. Curb inspections and other street-related jobs provide concrete illustrations of the central concepts.
Online
1986
3.

Trains, Planes and Critical Paths [electronic resource]

Loading...
Program 3 highlights nearest-neighbor and greedy algorithms to show how they aid in solving complex routing problems. Critical path analysis is also featured, as are order requirement directed graphs (digraphs). Demonstrates how to find approximate solutions to the traveling salesman problem (TSP) and how to distinguish between Euler circuits and the TSP.
Online
1986
4.

Juggling Machines [electronic resource]

Loading...
Program 4 demonstrates how the scheduling requirements of airliners and police patrol cars illustrate how crucial algorithms are to everyday life. List processing algorithms are used in simplified scheduling problems, constructed to provide insight into the behavior of scheduling processors. Bin packing problems and heuristic algorithms are also featured.
Online
1986
5.

Juicy Problems [electronic resource]

Loading...
Program 5 demonstrates that economies depend on the optimal use of resources to produce goods and services at maximum profit. It introduces linear programming as a powerful tool for determining the best combination of manpower and resource use. The corner principle, simplex method, and potentially faster linear programming methods are also discussed.
Online
1986
6.

Statistics Overview [electronic resource]

Loading...
Program 6 moves from baseball scores and roulette odds to national unemployment figures and quality control testing, to show that statistics help us to understand information and make better decisions. This overview introduces the subject, featuring professionals in labor statistics and medicine who use statistical methods to determine probable outcomes in their fields.
Online
1986
7.

Behind the Headlines [electronic resource]

Loading...
Program 7 illustrates how data are collected for specific purposes by sampling or experimentation. Random sampling is employed to eliminate bias, and experiments are controlled to discover cause-and-effect relationships. Randomized comparative experiments are explained, as is the use of Latin square designs for statistical data gathering.
Online
1986
8.

Picture This [electronic resource]

Loading...
Program 8 demonstrates that exploratory data analysis is the art of looking for unanticipated patterns in data. Uses of histograms, box plots, and scatterplots are explained, as are the meanings of mean, median, quartiles, and outliers in statistical parlance. Illustrations are drawn from examples relating to seismic analysis, Napoleon's march, and baseball.
Online
1986
9.

Place Your Bets [electronic resource]

Loading...
Program 9 demonstrates that random events have unpredictable outcomes that over time follow a predictable pattern. Visits a casino to capture first-hand footage of this phenomenon in action. Includes sampling distribution, normal curves, standard deviation, expected value, and the central limit theorem.
Online
1986
10.

Confident Conclusions [electronic resource]

Loading...
Program 10 compares formal statistical inference, as opposed to exploratory data analysis, based on calculations of probability. Defines confidence intervals and demonstrates how to find a 95% confidence interval for a population proportion p. Application examples are drawn from a health study, manufacturing, and Gallup poll interviews.
Online
1986
11.

Social Choice Overview [electronic resource]

Loading...
Program 11 highlights how individual choices and taking chances are analyzed using game theory, one of the important developments of twentieth-century mathematics. Collective choice is analyzed using election theory, weighted voting, and apportionment. Real-life examples show the utility of the concepts.
Online
1986
12.

The Impossible Dream [electronic resource]

Loading...
Program 12 discusses five voting methods: plurality, plurality with runoff, Condorcet, Borda, and sequential runoff voting. Dramatic reenactments of a political convention and a news broadcast are presented to clarify concepts. An example of Nobelist Kenneth Arrow's theorem on voting theory is also featured.
Online
1986
13.

Zero Sum Games [electronic resource]

Loading...
Program 14 shows how Game theory deals with strategies employed by parties with conflicting needs. Optimal strategies (pure and mixed) are described mathematically, and game matrices are explained. Expected value equations, a graphical interpretation, a restaurant illustrating the minimax technique, and an illegal parking example are presented.
Online
1986
14.

Prisoner's Dilemma [electronic resource]

Loading...
Program 15 explores social situations involving decision-making strategies in games of partial conflict. Prisoner's dilemmas and games of chicken are explained in the broader context of corporate takeovers, national defense, politics, and labor relations.
Online
1986
15.

On Size and Shape Overview [electronic resource]

Loading...
Program 16 explores and analyzes geometry and its relationship to natural beauty and art, drawing examples using geometric applications, from Leonardo da Vinci's window for recording proper linear perspective in art, to symmetry-based classification systems in archaeology. The Fibonacci sequence fractals and their applications in many disciplines are also discussed and illustrated.
Online
1986
16.

How Big Is Too Big [electronic resource]

Loading...
Program 17 examines problems dealing with geometric similarity and scale, including discussions of tensile strength of building materials and their relationship to maximum size and proportion. Tiling patterns, two-dimensional Penrose tilings, and their importance to crystallography usage are also featured.
Online
1986
17.

It Grows and Grows [electronic resource]

Loading...
In Program 18 examples ranging from money in the bank to fish in the sea are used to explicate population growth. The mathematics of determining harvesting rates to maintain sustainable yields is explained. Also emphasizes the importance of determining population size and related measures, concluding with an examination of demography and population pyramids.
Online
1986; 1987
18.

Stand Up Conic [electronic resource]

Loading...
Program 19 explains the importance of understanding conic sections using examples of their usage in telescopic lenses, airplane wing design, suspension bridges, and vehicle headlights. Hyperbola, parabola, and ellipse are defined, and Kepler's first law, reflective property, and laws of planetary motion are elucidated.
Online
1986
19.

More Equal Than Others [electronic resource]

Loading...
Program 13 addresses the issue of fair representation. Fair division and apportionment problems are described, with the simple case of slicing a cake used to explain more complex cases in politics and voting. Reenactments also demonstrate how weighted voting and winning coalitions work.
Online
1987
20.

It Started in Greece [electronic resource]

Loading...
Program 20 focuses on Euclidean geometry as a mathematical tool used to measure the world. The Great Pyramid, tunnel construction, and other examples are shown to illustrate congruent triangles, similarity, and the Pythagorean theorem. Students also learn the parallel postulate and how to distinguish between Euclidean and non-Euclidean geometry.
Online
1986