AMSER
https://amser.org/index.php?P=Home
AMSER (the Applied Math and Science Education Repository) provides educational resources and services built specifically for use by those in Community and Technical Colleges but free for anyone to use.en-usealmasy@scout.wisc.eduealmasy@scout.wisc.eduSat, 19 Apr 2014 00:00:00 -0500Thu, 17 Apr 2014 00:00:00 -0500http://www.rssboard.org/rss-2-0-1Allow Me 2 Reiterate
https://amser.org//index.php?P=FullRecord&ResourceId=16169
https://amser.org//index.php?P=FullRecord&ResourceId=16169This lesson from Illuminations teaches students to use a computer algebra system to determine the square root of 2 to a given number of decimal places. Students will learn how utilizing technology makes an algorithm easy to use, as well as using different modes with an iterative algorithm. The lesson is intended for grades 9-12 and should take one class period to complete.Thu, 20 Jan 2011 03:00:03 -0600Introduction to Algorithms
https://amser.org//index.php?P=FullRecord&ResourceId=16334
https://amser.org//index.php?P=FullRecord&ResourceId=16334This course provides an introduction to algorithms. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. Selected lecture notes, video and audio lectures, and assignments with solutions are included. MIT presents OpenCourseWare as free educational material online. No registration or enrollment is required to use the materials.Tue, 28 Dec 2010 03:00:02 -0600HotBits: Genuine Random Numbers
https://amser.org//index.php?P=FullRecord&ResourceId=8739
https://amser.org//index.php?P=FullRecord&ResourceId=8739HotBits is a genuine random number generator powered by radioactive decay. Simply click the "Request HotBits" link, and specify how many bytes you would like (up to 2048) and in what form you prefer them. Hexadecimal returns numbers and letters, while C language returns integers. Then click the "Get HotBits" button, and your random numbers will appear on the screen.Wed, 21 Oct 2009 03:00:02 -0500DAU StatRefresher
https://amser.org//index.php?P=FullRecord&ResourceId=9073
https://amser.org//index.php?P=FullRecord&ResourceId=9073This is the subject and lesson listing for the DAU statistics refresher course. Topics include clustering algorithms, correlation coefficient, conditional probability, data analysis, eleven types of distributions, measures of central tendency, multiple regression, random variables, rank correlation, residual analysis, scatter plots, standard deviation, uniform distribution, and variance. They are organized alphabetically and by subject. This is a nice reference tool for those needing quick definitions, or explanations, of different statistics terminology.Wed, 2 Sep 2009 03:00:02 -0500DAU StatRefresher: Clustering Algorithms
https://amser.org//index.php?P=FullRecord&ResourceId=9077
https://amser.org//index.php?P=FullRecord&ResourceId=9077This interactive module helps students to understand the definition of and uses for clustering algorithms. Students will learn to categorize the types of clustering algorithms, to use the minimal spanning tree and the k-means clustering algorithm, and to solve exercise problems using clustering algorithms. Each component has a detailed explanation along with quiz questions. A series of questions is presented at the end to test the students understanding of the lesson's entire concept.Thu, 22 Jan 2009 03:00:02 -0600Data Mining Technology
https://amser.org//index.php?P=FullRecord&ResourceId=5423
https://amser.org//index.php?P=FullRecord&ResourceId=5423This website provides a basic overview of Data Mining and some applications for the process. The site lists some typical tasks addressed by data mining, such as identifying cross-sell opportunities and predicting a peak load of a network. There are also some academic resources on such topics as "Anomaly Localization," "Generating Non-Linear Functions," and "Symbolic Knowledge Discovery."Mon, 14 Jan 2008 03:00:02 -0600Computational Geometry Pages
https://amser.org//index.php?P=FullRecord&ResourceId=5456
https://amser.org//index.php?P=FullRecord&ResourceId=5456A comprehensive directory of computational geometry resources both on and off the Internet. General Resources, Literature, Research and Teaching, Events, Software, other links. Also found at http://compgeom.cs.uiuc.edu/~jeffe/compgeom/.Thu, 27 Dec 2007 03:00:03 -0600Herbert Wilf
https://amser.org//index.php?P=FullRecord&ResourceId=5163
https://amser.org//index.php?P=FullRecord&ResourceId=5163Herbert Wilf is a combinatorialist. The entire text of his books generatingfunctionology, A=B,andAlgorithms and Complexitymay be downloaded in PDF format, as may his "East Side, West Side" lecture notes on combinatorial objects and Maple programming. Wilf's other articles are available in varying formats, including PostScript, .dvi, and TeX.Mon, 19 Nov 2007 03:00:01 -0600Habits of Mind: Mathematics Problem Solving Strategies
https://amser.org//index.php?P=FullRecord&ResourceId=5189
https://amser.org//index.php?P=FullRecord&ResourceId=5189These roughly 200 lesson plans are related to mathematical problem solving and are provided by the non-profit Education Development Center. The lesson plans are designed to help students develop both deep conceptual mathematical understandings and technical skills. The plans are provided both as PDF files and in HTML, and teacher comments are also provided. Topics covered include modeling / mathematizing; finding analogies / structural similarities / isomorphisms; working with graphs; working with units/dimensional analysis; proving; formulating conjectures / generalizing / abstracting; finding and using invariants; creating / analyzing an algorithm; dealing with non-unique solutions; visualization; solving by special cases; verifying / interpreting results; analyzing parameters; estimating; inventing and using notation. This is an extensive and thorough resource for first-cycle college mathematics teachers and teachers of advanced high school math.Mon, 12 Nov 2007 16:19:41 -0600Convex Hull Algorithms
https://amser.org//index.php?P=FullRecord&ResourceId=4378
https://amser.org//index.php?P=FullRecord&ResourceId=4378An applet that demonstrates some algorithms for computing the convex hull of points in three dimensions. See the points from different viewpoints; see how the Incremental algorithm constructs the hull, face by face; while it's playing, look at it from different directions; see how the gift-wrapping or divide-and-conquer algorithms construct the hull; look at animations of Delaunay triangulation algorithms.Thu, 9 Aug 2007 03:00:02 -0500Miscellaneous Mathematical Utilities
https://amser.org//index.php?P=FullRecord&ResourceId=4375
https://amser.org//index.php?P=FullRecord&ResourceId=4375Several online mathematical utilities intended for college and university students (math, physics, engineering, etc. students). Numerical utilities to solve (among others): N Equations in N Unknowns, Eigenvalues and Eigenvectors, Roots of Functions, and Numerical Integration. More utilities are constantly being added.Thu, 9 Aug 2007 03:00:01 -0500The Stony Brook Algorithm Repository
https://amser.org//index.php?P=FullRecord&ResourceId=4199
https://amser.org//index.php?P=FullRecord&ResourceId=4199A computer science professor at the State University of New York maintains this online repository, which serves "as a comprehensive collection of algorithm implementations for over seventy of the most fundamental problems in combinatorial algorithms." The algorithms are implemented in a variety of programming languages, from C++ to FORTRAN. Seven general categories are listed to facilitate finding a particular implementation. The code for each algorithm was gathered from many different sources and is now housed in one spot on this site, making it easy for programmers to use pre-written code for common problems rather than having to write their own.Thu, 26 Jul 2007 03:00:02 -0500Dictionary of Algorithms, Data Structures, and Problems
https://amser.org//index.php?P=FullRecord&ResourceId=4156
https://amser.org//index.php?P=FullRecord&ResourceId=4156The National Institute of Standards and Technology has recently updated its online Dictionary of Algorithms, Data Structures and Problems. The dictionary takes the form of a hypertext alphabetical list of terms dealing with algorithmic techniques and functions (e.g., Ackermann's Function), data structures, archetypical problems (e.g., "traveling salesman"), and related definitions. Nice features of the site include a page of links to implementations (code) and some expanded definitions and diagrams for the terms. In addition to the complete alphabetical listing, the list of terms may also be viewed categorized by subject area or by type of term (graphs, trees, sorting, etc.). The site's manager, NIST computer scientist Paul Black, welcomes contributions and is particularly in need of terms in state machines, combinatorics, parallel and randomized algorithms, heuristics, and quantum computing. Note that this dictionary does not include algorithms particular to communications, information processing, operating systems, programming languages, artificial intelligence, graphics, or numerical analysis. Overall, however, it is a great resource for university students and researchers.Mon, 23 Jul 2007 03:00:02 -0500Journal of Graph Algorithms and Applications
https://amser.org//index.php?P=FullRecord&ResourceId=3876
https://amser.org//index.php?P=FullRecord&ResourceId=3876The Journal of Graph Algorithms and Applications found at this Web site is the electronic version of the scientific journal with the same name. It is a collection of research papers dealing with the "analysis, design, implementation, and applications of graph algorithms." The current volume consists of select papers presented at the 1999 Symposium on Graph Drawing, which have since been revised. Previous volumes are archived on this site as well, and they can be freely accessed. Almost any discipline requires some sort of graphical representation, and specific uses of graph algorithms in various fields are addressed in this journal.Wed, 27 Jun 2007 03:00:02 -0500Michael Singer
https://amser.org//index.php?P=FullRecord&ResourceId=2522
https://amser.org//index.php?P=FullRecord&ResourceId=2522Differential (and difference) Galois theorist, algorithmic analyst, and computer algebraist, and professor at North Carolina State University. Available here: books and papers, some in PDF, PostScript, or .dvi versions; course notes for Computational Mathematics for the Life and Management Sciences; and a link to the Symbolic Systems Group (research and papers).Wed, 28 Mar 2007 03:00:01 -0500