Archives of past seminars - Mathematics and Computer Science Department at Central College

Listing of past seminars

11/12/2008	Patrick Klopfenstein, Jesse Nieboer	Detecting Source-Code Plagiarism	S. Fyfe	first
Abstract: With the rise of the Internet, source code plagiarism has become more of a problem, both in the academic and business worlds. We discuss several different tools techniques that detect source code plagiarism, including JPlag and token conversion, MOSS and k-gram fingerprinting, and Code Suite which is a combination of five different techniques. Even with these techniques, manual review will always be necessary.
Sources: Detecting Source-Code Plagiarism -- http://www.ddj.com/architect/184405734 Plagiarism in natural and programming languages: an overview of current tools and technologies - http://ir.shef.ac.uk/cloughie/papers/plagiarism2000.pdf CodeMatch download site -- http://www.zeidmanconsulting.com; http://www.safe-corp.biz/products_codesuite.htm Winnowing: Local Algorithms for Document Fingerprinting --http://theory.stanford.edu/~aiken/publications/papers/sigmod03.pdf Catching Cheats with the Perl Compiler -- http://www.ddj.com/architect/184416093 JPlag: Finding plagiarisms among a set of programs -- http://page.mi.fu-berlin.de/prechelt/Biblio/jplagTR.pdf
10/29/2008	Jacob Vaverka	An Efficient B-Tree Layer Implementation for Flash-Memory Storage Systems	R. Franks	second
Abstract: Flash-memory has become a very common hardware today, and it could soon help eliminate one of the main computer components holding down speed, the traditional hard drive. But before flash-memory can replace traditional hard drives, some problems regarding overhead must be addressed. I will be looking at an approach called BFTL, which uses B-Trees in an attempt to reduce the overhead of typical flash-memory structures.
Sources: TBA
10/29/2008	Jonathan Merkle	For Your Eyes Only	R. Franks	second
Abstract: In the world of identification, your eyes can say a lot about you. Face recognition methods can be aided by first finding the positions of the eyes and normalizing the entire image based on the positions. We will discuss three methods for finding eye locations. We will also explore the EyePass system that takes eye movements as input for authentication.
Sources: B. Kroon, A. Hanjalic, S. Mass. "Eye Localization for Face Matching: Is it Always Useful and Under What Conditions?" ACM Transactions on Applied Perception 3.1 January 2006. Y. Zana, R. Cesar. "Face Recognition Based on Polar Frequency Features." CIVR July 2008. A.Luca, R. Weiss, H. HuBmann. "EyePass – Eye-Stroke Authentication for Public Terminals." CHI April 2008. R. Riopka, T. Boult. "The Eyes Have It." WBMA November 2003.
10/15/2008	Mallory Palmer	REU on Robotics.	R. Franks	second
Abstract: This seminar will focus on the discoveries made during the Research Experience for Undergraduates at Ithaca College this past summer on robotics. The main focus is on converting a Pioneer 3 DX robot into a wheelchair for toddlers with mobility problems. The presentation will cover previous work done with robotic wheelchairs, software used with robots, techniques for writing architectures for robotic wheelchairs, and the actual accomplishments of converting a Pioneer 3 robot into a wheelchair.
Sources: Arkin, R. C. (1988). Intelligent mobile robots in the workplace: leaving the guide behind. International Conference on Industrial and engineering applications of artificial intelligence and expert systems, 1, 553-561. doi:http://doi.acm.org/10.1145/51909.51973 Gat, E. (1991). Integrating Reaction and Planning in a Heterogeneous Asynchronous Architecture for Mobile Robot Navigation. ACM SIGART Bulletin, 2(4), 70-74. doi:http://doi.acm.org/10.1145/122344.122357 Kuno, Y. & Nakamura, A. (2003). Robotic Wheelchair Looking at All People. CHI '03 extended abstracts on Human factors in computing systems, 1008-1009. doi:http://doi.acm.org/10.1145/765891.766120 Low, K. H., Leow, W. K., & Ang, M. H. (2002). A hybrid mobile robot architecture with integrated planning and control. International Conference on Autonomous Agents, 219-226. doi:http://doi.acm.org/10.1145/544741.544797 Neves, M. C., & Oliveira, E. (1997). A control architecture for an autonomous mobile robot. International Conference on Autonomous Agents, 193-200. doi:http://doi.acm.org/10.1145/267658.267713 Simmons, R. (1991). Coordinating planning, perception, and action for mobile robots. ACM SIGART Bulletin, 2(4), 156-159. doi:http://doi.acm.org/10.1145/122344.122376
4/30/2008	Christa Stocks	Becoming the next Ken Jennings	R. Goodman	second
Abstract: Game theory is not just an abstract topic anymore; it can be used in real gaming situations, one of which is the game show Jeopardy! Within the final round, players can apply gaming theories in order to maximize their monetary earnings and win the day. These theories are applicable to two and three player situations, and can aid in the final decisions of what to wager in the final round.
Sources: Gilbert, George T., Rhonda L. Hatcher, Wagering in Final Jeopardy!, Mathematics Magazine, Vol.67, No. 4, (Oct., 1994), pp. 268-277.
4/23/2008	Evan Olson, Jordan Tiarks	The World's Biggest Taco	A. Hibbard	first
Abstract: Let's face it - we all enjoy food. We like to make sure we're getting as much as we can! It was this sort of thinking led us to our article, The World's Biggest Taco. We consider two different ways tortillas can be folded into tacos, with the goal in mind to find the shape of the taco that will contain the largest volume. This provides an excellent exercise in volume integration and optimization. Some of our results will be obtained analytically, while others will require us to resort to graphical and numerical methods using Mathematica. Finally, we will consider some real-world data, obtained from a grocery store, and see just how efficient everyday tacos are!
Sources: Bleecker, David D., and Lawrence J. Wallen. "The World's Biggest Taco." The College Mathematics Journal 29 (Jan., 1998), pp. 2-12.
4/16/2008	Andrew Green	Projective Geometry	R. Goodman	second
Abstract: Euclidean Geometry is a subset of another type of geometry called Projective Geometry. The differences between these two types of geometries make some ideas of Projective Geometry difficult to grasp. The hardest of these ideas is that all lines intersect even if the lines are parallel. This presentation will show some different ways to view the Projective Plane and how distances are not preserved whereas the Cross Product is.
Sources: Birchfield, Stan. "An Introduction to Projective Geometry (for computer vision)." 12 Mar 1998. 1 Feb 2008 .
4/16/2008	Nathaniel Birru	The BitTorrent Protocol	S. Fyfe	second
Abstract: BitTorrent is a peer-to-peer (P2P) sharing protocol that differs from the standard peer to peer design. What has made BitTorrent so successful in data sharing is its ability to split files into small blocks of data and efficiently share them between multiple users. The protocol takes blocks of data that a user has downloaded and shares them with others that do not have the data yet, and vise versa. BitTorrent needs few resources and has been proven to be faster than most P2P networks and some file servers. This protocol has become extremely powerful by using the combined bandwidth of multiple users and complex sharing algorithms.
Sources: A. Legout, G. Urvoy-Keller, and P. Michiardi. Rarest first and choke algorithms are enough. In IMC '06, Rio de Janeiro, Brazil, October 25-27.
4/9/2008	Robert Ringoen	Getting Groovy With Programming	S. Fyfe	second
Abstract: Groovy is an object oriented programming language which looks much like Java. Groovy is an improvement on Java because it is faster to code although it will still run in the JVM. When Groovy is compiled it creates JVM byte code which will allow correlation between Groovy and Java programs. Groovy has been discussed since 2003 but the non-beta version wasn't released until January 2, 2007. Programmers can use Groovy to quickly throw together test programs. Groovy is considered a scripting language and has resemblances to Python, Ruby, Perl and Smalltalk.
Sources: Barclay, Kenneth, John Savage. Groovy Programming. San Francisco: Morgan Kaufmann, 2007. Codehaus Foundation. Groovy an agile dynamic language for the Java Platform. 2006. 15 March 2008 http://groovy.codehaus.org/ Darwin, Ian. "Groovy, Java's New Scripting Language." onJava.com. 2004. O'Reilly. 15 March 2008 http://www.onjava.com/pub/a/onjava/2004/09/29/groovy.html Glover, Andrew. "Practically Groovy: MVC programming with Groovy templates." 2005. IBM. 15 March 2008 http://www.ibm.com/developerworks/java/library/j-pg02155/
4/9/2008	Andrew Meyer	Elliptic Curves and the El Gamal Cryptosystem	R. Goodman	second
Abstract: Cryptography has been used worldwide for hundreds of years. However, security in most cryptosystems has been an issue. Elliptic curves have played an increasingly important role in cryptographic situations since the 1980s due to their increased level of security. Along with mapping messages to numbers, elliptic curve cryptosystems map messages to points on a curve. The El Gamal Cryptosystem is a public key cryptosystem often used with elliptic curves due to the fact that its security relies on the discrete log problem. In this presentation I will discuss the arithmetic of elliptic curves and how they create an analog to the El Gamal cryptosystem.
Sources: Koblitz, N. (Jan. 1987).Elliptic Curve Cryptosystems. Mathematics of Computation. 48, 203-209. Trappe, W., & Washington, L. (2006). Introduction to Cryptography with Coding Theory.Upper Saddle River: Pearson Prentice Hall.
3/12/2008	Jordan Edgerly, David Poetting, Kapil Chugh	Euler and Logarithms	A. Hibbard	first
Abstract: The methods of computing logarithmic values have been simplified over time due to the contributions of various mathematicians. However, none were as significant as those of Leonhard Euler in the mid-18th century. Not only did Euler simplify logarithms, but he also connected his findings to other areas of mathematics.
Sources: Dunham, William. "Euler and Logarithms." Euler: The Master of Us All. Washington D.C.: Mathematical Association of America, 1999. 17-36.
3/5/2008	Brett DeHoogh	The New Age of Digital Signatures	R. Goodman	second
Abstract: As the World begins to rely more and more on the Internet, the security of digital signatures becomes more important. Digital signatures use public key cryptography to attach a signature to a given message through the use of hash functions, modular arithmetic, and by taking advantage of the "discrete log problem". The Digital Signature Algorithm (DSA) is a common system associated with digital signatures, and its security relies on the discrete log problem.
Sources: Boggan, Steve. "Cracked it!: Three million Britons have been issued with the new hi-tech passport, designed to frustrate terrorists and fraudsters. So why did Steve Boggan and a friendly computer expert find it so easy to break the security codes?." The Guardian (London) 11 17 2006 4. 02 09 Bohli, Jens-Matthias. "Key substitution attacks revisited: Taking into account malicious signers." Int. J. Inf. Secur. 05 26 2005 30-36. 02 09 2008 Burrows, James. "DIGITAL SIGNATURE STANDARD (DSS)." FIPS PUB 186. 05 19 1994. U.S. DEPARTMENT OF COMMERCE. 3 Mar 2008. Connors , Emma. "Sign your autograph with mobile phone." The Australian Financial Review 06 25 2007 10. 02 09 2008 "Hash Function." Wikipedia. 2008. Wikipedia Foundation, Inc.. 3 Mar 2008. Kodaganallur, Viswanathan. "Secure E-Commerce: Understanding the Public Key Cryptography." Information Systems Security 01 2006 44-52. 02 12 2008. Niederreiter, Harald. "Winning the crypto-war; Mathematicians and computer scientists collaborating to outsmart hackers." The Straits Times 03 10 2007 1-5. 02 09 2008. O'Brien, Danny. "Cryptographers fear prospect of quantum computing." The Irish Times 09 08 2006 7. 02 09 2008. Trappe, Wade. Introduction to Cryptography with Coding Theory. 2nd. New Jersey: Pearson Education, Inc., 2006.
3/5/2008	Joshua Stanton	Ajax	S. Fyfe	second
Abstract: Ajax, or Asynchronous JavaScript and XML, is a web development technique. Ajax uses JavaScript's XMLHTTPRequest Object to communicate with a server and parse the server's response document. This technique allows developers to create responsive real time web applications. While using Ajax the browser never freezes to wait for a server response, and the page can handle multiple events before the response comes back from the first event, eliminating the downtime from browser freezes.
Sources: Ballard Phil. Ajax in 10 minutes. Sams Publishing. Indianapolis Indiana. 2006.
2/20/2008	Michael De Jong	Managing Battery Lifetime with Energy-Aware Adaptation	S. Fyfe	second
Abstract: This paper demonstrates that finding a good relationship between operating systems and applications can help improve battery life to user-specified levels. A program developed for the study described in this paper, PowerScope, was used to take measurements of the energy usage of different applications on a system and determine what fractions of the energy cost were used by which processes. Readings were taken on various quality levels of each application. This information was then used to develop a profile that would determine the optimum balance between application quality and battery life. It was determined that combining hardware and software energy conservation methods were the best comprehensive solution for saving power and prolonging battery life. This paper will describe the set-up, implementation, and results of a variety of tests and how these results can be used to find a balance, or adaptation, between performance of an application and energy conservation.
Sources: Flinn, J., and Satyanaryan, M. Managing Battery Lifetime with Energy-Aware Adaptation. ACM Transactions on Computer Systems 22 (2004): 137-179. ACM Digital Library. Central College, Pella. Jan. 2008. Flinn, J., and Satyanaryan, M. Energy-Aware Adaptation for Mobile Applications. ACM (1999): 48-63. ACM Digital Library. Central College, Pella. Jan. 2008. Noble, B D., Satyanarayanan, M., Narayanan, D., Tilton, J. E., Flinn, J., and Walker, K.R. Agile Application-Aware Adaptation for Mobility. Proceedings of the 16th ACM Symposium On (1997): 276-287. ACM Digital Library. Central College, Pella. 16 Feb. 2008.
12/3/2007	Jonathan Merkle, Mallory Palmer, Andrew Mass	The Keepon Dancing Robot	R. Franks	first
Abstract: Keepon, a small dancing robot, uses visual and audio cues to find beats in music. This robot is used to study social interactions between humans and machines. We will discuss the hardware and software that goes into Keepon and also how well Keepon relates to humans.
Sources: Cycling '74. Cycling '74 Max/MSP: A graphical programming environment for music, audio, and multimedia., 2006. URL: http://www.cycling74.com/products/maxmsp. Michalowski, Marek P., Selma Sabanovic, Hideki Kozima "A dancing robot for rhythmic social interaction." Pages: 89 - 96, 2007 Proceeding of the ACM/IEEE international conference on Human-robot interaction, ISBN:978-1-59593-617-2
11/28/2007	Melissa Meyer	Rubik's Cube	A. Hibbard	second
Abstract: There are billions of configurations of a Rubik's cube, but fortunately there are some helpful macros or strategies to solve it. Concepts such as permutations and cycles will enable us to generate and manipulate macros. I will use the befuddler notation to explain how conjugates and commutators allow us to properly place a small number of cubies at a time.
Sources: Davis, Tom. "Teaching Mathematics with Rubik's Cube." The Two-Year College Mathematics Journal. Vol. 13, No. 3 (Jun., 1982), pp.178-185.
11/28/2007	Apurv Kumaria	Compiler Design	M. Johnson	second
Abstract: How does a computer understand a programming language? Is it the same way that humans do? Compilers are programs that help computers understand a language and convert it to a machine-executable target code. Paradigms for a compiler are based on human analysis of language. Individual characters are first built into words and tokenized by the scanner. These tokens are then passed to a parser, which determines the structure of the program, and then a semantic analyzer, which determines its behavior or meaning. The final stages of a compiler create and optimize machine language code to be run on the target machine. Compiler Design is the study of these individual phases of understanding a programming language and converting it to a machine language. In this talk, I will briefly describe the various phases of compiler construction with emphasis on the scanner.
Sources: Kenneth C. Louden. Compiler Construction: Principles and Practice. PWS Publishing Company.1997
11/21/2007	James Armstead, Anshul Kumaria	Agile Development: An adaptive approach to programming.	R. Franks	first
Abstract: Agile development is a project management technique based on short iterations within the development. These iterations are small projects containing all of the typical phases of a project phase: Design, Development, and Testing. Flavors of agile development include Extreme Programming and Scrum, which are stricter and more exact approaches to developing software. Examples of how to use these development techniques will be given.
Sources: Schach, Stephen. Object-Oriented Classic Software Design. Seventh. Boston: McGraw-Hill, 2007. Wells, Done. Extreme Programming. 17 Feb 2006. 1 Nov 2007 . Fowler, Martin. "The New Methodology." The New Methodology. 15 Dec 2005. 1 Nov 2007 .
11/14/2007	Benjamin Helland	The Generation of Prime Numbers	A. Hibbard	second
Abstract: Can a function, f, be found such that it outputs a set of unique and successive prime numbers without producing any non-prime values? Throughout mathematical history, polynomials, non-polynomials, and Wilson's theorem have converged to an interesting function. I will show a proof for Wilson's theorem and how it leads to a function that generates only prime numbers, every prime number, and each odd prime number exactly once.
Sources: Caldwell, C (2007, September 16). Euclid's proof of the infinitude of primes. Retrieved September 16, 2007, from The prime page Web site: http://primes.utm.edu/proofs/infinite/euclids.html Honsberger, Ross. Mathematical Gems II. The Mathematical Association of America, 1976.
11/14/2007	Greg Wilhelm	Automatic Web Block Tracing	S. Fyfe	second
Abstract: Web personal homepages which allow a user to identify specific content for their home page have grown in popularity recently with their ease of use in retaining information. The homepage is split up into web blocks, with each block obtaining updated content from a specific website. To update each block when the page is loaded into the browser, a block in the updated page corresponding to a block in the original page must be found. Two algorithms for finding a block in an updated page, Direct Path Finding (DPF) and Tree Edit Distance (TED), will be compared.
Sources: Corman, Thomas, et al. Introduction to Algorithms. 2nd ed. MIT, 2001. 1087-1090 Han, Jie, et al. "Homepage Live: Automatic Block Tracing for Web Personalization." Proceedings of the 16th international conference on World Wide Web May 2007 1-10. 11 Sept 2007 . Sebesta, Robert. Programming the World Wide Web. 3rd ed. Pearson Education, 2006.
11/7/2007	Christopher Lillis, Robert Ringoen	Steganography	R. Franks	first
Abstract: In the ever evolving world of security, people are finding new ways to hide information. One of these ways is hiding information within images. We will show the main algorithm for hiding information, and we will hide data within an image. We will also show some of the methods for identifying images that have hidden data within them.
Sources: Ge, Shen, and Gao, Yang "Least Significant Bit Steganography Detection with Machine Learning Techniques." Proceedings of the 2007 international workshop on Domain driven data mining DDDM '07, August 2007. Hunt, Dr. Kenny, "A Java Framework for Experimentation with Steganography". SIGCSE '05, February 2005. Ryder, James, "Steganography May Increase Learning Everywhere". Journal of Computing Sciences in Colleges, Volume 19 Issue 5, May 2004. ISSN:0001-0782
10/31/2007	Kendi Beyer	The Euclid-Euler Theorem	A. Hibbard	second
Abstract: Surprising to many, Euclid's Elements contained three books on number theory. Two thousand years later, Leonhard Euler continued Euclid's work to prove sufficient and necessary conditions for an even perfect number. Characteristics and definitions will be utilized in proving the "Euclid-Euler Theorem."
Sources: Dunham, William. Euler: The Master of Us All. The Mathematical Association of America, 1999. p 1-16.
10/31/2007	Brian Langstraat	Rich Uncle Pennybags's Secret	A. Hibbard	second
Abstract: Markov chains are used to model complex sequential-state systems. Monopoly, a popular board game, is analyzed using transition matrices and vectors to calculate Markov chains. Computers are utilized for quick analysis of the Markov chains. The frequency of landing on each space and the relative value of each monopoly are discussed. Models based on variations of Monopoly are explored.
Sources: Abbott, Stephen D., and Matt Richey. "Take a Walk on the Boardwalk." The College Mathematics Journal 28, No. 3 (May, 1997):162-171. Ash, Robert B., Richard L. Bishop. "Monopoly as a Markov Process." Mathematics Magazine 45, No. 1 (Jan. 1972): 26-29. Herman, Eugene A., Michael D. Pepe.. Visual Linear Algebra. Hoboken, NJ: John Wiley & Sons, 2005.
10/10/2007	Katherine Roloff	Venn Polyominoes	A. Hibbard	second
Abstract: Venn diagrams are often used in a variety of disciplines for a variety of purposes. Yet the Venn diagram itself is rarely studied in depth. In this presentation we will be looking at the properties and characteristics of Venn diagrams. We will then be relating Venn diagrams to polyominoes and using polyominoes to construct Venn diagrams.
Sources: Chow, Stirling & Ruskey, Frank. "Minimum Area Venn Diagrams Whose Curves Are Polyominoes" Mathematics Magazine. 80 (2007) 91-103. Hale, Margie. Essentials of Mathematics. Washington, D.C.: The Mathematical Association of America, 2003. Ruskey, Frank & Westin, Mark. A Survey of Venn Diagrams. 10 June 2005. 17 Sep. 2007 .
10/10/2007	Joshua McCollam	The Locker Puzzle	A. Hibbard	second
Abstract: Assume that I take your wallet and the wallets of 99 other people and put them in 100 lockers at random. How confident are you that you could find your wallet by opening only 50 lockers? How confident are you that all 100 people could find their wallets by opening only 50 lockers a piece? That is the goal of the locker problem: every player finds his/her own wallet. We will discuss the probability that the goal will be achieved. Also, we will look into strategies that can be implemented to give a higher probability that every person will find their wallet.
Sources: Curtin, Eugene, and Warshauer Max. "The Locker Puzzle." Mathematical Intelligencer (2006): 28-31. Gallian, Joseph. Contemporary Abstract Algebra. 6th ed. New York, NY: Houghton Mifflin Company, 2006. Hogg, Robert, and Tanis. Elliot. 7th ed. Upper Saddle River, NJ: Pearson Prentice Hall, 2006.
5/2/2007	Melissa Meyer, Christa Stocks	Theon's Ladder	W. Weber	first
Abstract: Theon's Ladder is used to find a rational approximation for the square root of any integer. By means of two recursive formulas, a ratio can be developed to give us this approximation. A proof of the convergence of Theon's Ladder will be given. We will also derive a quicker way to find rational approximations for any square root. We will find a closed form equation for the Ladder, and develop two other types of recursive relations by manipulating formulas.
Sources: Giberson, Shaun, and Thomas J. Osler. "Extending Theon's Ladder to Any Square Root." The College Mathematics Journal Vol. 35. No.3. (May 2004): 222-226.
5/1/2007	Danielle DeForest	Digital Cash	T. Linton	second
Abstract: Digital cash is a system that models the behavior of money using digital data. Stefan Brands created a system of digital cash that guarantees anonymity and also prevents counterfeiting. In this presentation, I will look at the different processes of creating a coin, spending a coin, and depositing a coin. By looking at these processes, we will see how Brands has strategically set up his cash system to prevent double spending.
Sources: Trappe, Wade, and Lawrence Washington. "Digital Cash." Introduction to Cryptography with Coding Theory. 2nd ed. Upper Saddle River, NJ: Pearson Prentice Hall, 2006. 287-294 [1] Grabbe, J. "The Mathematical Ideas Behind Digital Cash." Digital Finance: index to articles. 2000. 6 Feb 2007 www.aci.net/kalliste/dcintro.htm [2] Grabbe, J. "Stefan Brands' System of Digital Cash." Digital Finance: index to articles. 2000. 6 Feb 2007 . [3] Grabbe, J. "Concepts in Digital Cash" Digital Finance: index to articles. 2000. 6 Feb 2007 .
5/1/2007	Thad Nelson	Elliptic Curve Cryptography	T. Linton	second
Abstract: Elliptic Curve Cryptography is a form of cryptography that utilizes properties of point addition, point multiplication, and point multiplication's inverse operation for an elliptic curve. These properties allow for encryption codes to use smaller keys. With these smaller key sizes, a computer can decrypt the code quickly when the receiver knows the private key.
Sources: "An Elliptic Curve Cryptography (ECC) Primer." Device Forge. 20 July 2004. 5 Feb. 2007 . "Elliptic Curve Addition: A Geometric Approach." Certicom. 20 April 2007 . Trappe, Wade, and Lawrence C. Washington. Introduction to Cryptography with Coding Theory. 2nd ed. Upper Saddle River, NJ: Pearson Prentice Hall, 2006. 347-369.
4/25/2007	Andrew Ohnemus	Cryptography in Programming	S. Fyfe	second
Abstract: This speech will outline how cryptographic functions are used in programming. The cryptoAPI and some of its abilities will be the main focus of this speech.
Sources: Esposito, Dino. Supporting CryptoAPI in Real-World Applications. Microsoft Interactive Developer. June 1997. http://www.microsoft.com/mind/0697/crypto.asp Cryptography. Wikipedia. April 2007. http://en.wikipedia.org/wiki/Cryptography Tomlinson, Paula. Encrypting and Decrypting with the CryptoAPI. Dr. Dobb's. 3 October 2002. http://www.ddj.com/dept/windows/184416394
4/20/2007	Katrina Obermeier	The Trisection Problem	R. Goodman	second
Abstract: Can we tri-sect an arbitrary angle using only an unmarked straightedge and a compass? The Greeks thought we could. Geometric constructions have been a part of mathematics since the ancient Greeks began experimenting with them using these basic instruments. Since then there have been many problems related to geometric constructions under investigation in the realm of mathematics. Some of the problems have been proven impossible while others remain a mystery. In this talk, the speaker will cover an example showing that the trisection of most arbitrary angles is impossible using only a straightedge and compass. She will also briefly address the idea of constructible numbers and operations.
Sources: Yates, Robert C. "The Trisection Problem." National Mathematics Magazine. Vol.15, No. 3. Dec. 1940: 129-142. JSTOR. Retrieved on Jan. 31, 2007.
4/20/2007	Katherine Roloff	From Elves and Flowers to Euclid and Fibonacci	R. Goodman	second
Abstract: It has long been noted that many elements in nature exhibit Fibonacci numbers and patterns. The seeds of the sunflower and daisy are instances of these patterns in nature. In this talk, the speaker will discuss the seeds of these flowers as well as what is known as the Dancing Elf Puzzle. She will then discuss the Fibonacci relationships that the flowers and puzzles display. Finally, she will relate Euclid's Algorithm and continued fraction expansions to the flower seeds and Dancing Elf Puzzle.
Sources: Goldstine, Susan. "Dancing Elves and a Flower's View of Euclid's Algorithm." The Mathematical Intelligencer Num. 4 2006: 23-30.
4/18/2007	Kendi Beyer, Brian Langstraat, Greg Wilhelm	Confusing Clocks	W. Weber	first
Abstract: If the hands on a perfect analog clock are all the same length, would you still be able to determine the correct time? A graphical approach will be used to analyze the two-hand analog clock, and Mathematica will be utilized to find all algebraic solutions. Six permutations of the second, minute, and hour hands will be analyzed algebraically for the three-hand analog clock.
Sources: Ford, Ben, Cory Franzmeier, and Richard Gayle. "Confusing Clocks." Mathematics Magazine Vol. 71 (June 1998): 190-195. Herman, Eugene A., Michael D. Pepe, Eric P. Schulz. "Tutorials for Visual Linear Algebra." Visual Linear Algebra. United States of America: John Wiley & Sons, 2005. Weinstein, Gerald, and John H. Lindsey. "The Case of Horological Interchangeability." The American Mathematical Monthly 10 (1995): 364.
4/4/2007	Chelsey Keller	Interactive Real-Time Reflections	S. Fyfe	second
Abstract: Reflections are something that we see all the time in the natural world. Our research was to produce an accurate planar reflection in an interactive computer graphics program. We have written a program in OpenGL which simulates a mirror on a wall, accurately reflecting objects which move in the scene as well as their shadows. Displaying the correct image in the mirror required using projective textures, a technique we previously used to produce shadows and to texture objects in the scene. We implemented this projective texture using a framebuffer object which allowed for off-screen rendering. Developing this project was also an experiment in pair programming, which we found to be a very productive way to write software.
Sources: Beck, Kent. Extreme Programming Explained: Embrace Change. Addison-Wesley. Upper Saddle River, NJ. 2000. Cockburn, A. Williams, L. The Costs and Benefits of Pair Programming. in Extreme Programming Examined. Addison Wesley, Upper Saddle River, NJ. 2001. McReynolds, T. Blythe, D. Advanced Graphics Programming Using OpenGL. Elsevier Inc. San Francisco, CA. 2005. SGI – Developer Central Open Source. OpenGL Extensions. Silicon Graphics. 2006. http://oss.sgi.com/projects/ogl-sample/registry/EXT/framebuffer_object.txt Shreiner, D., M. Woo, J. Neider, T. Davis. OpenGL Programming Guide. Fifth Edition. Addison-Wesley, Upper Saddle River, NJ. 2006. Williams, L. A., Kessler, R.R. "All I Really Need to Know About Pair Programming I Learned in Kindergarten." Communications of the ACM 43, 5 (May 2000), 108-114. Diefenbach, P. J., Badler, N.I. Multi-Pass Pipeline Rendering: Realism For Dynamic Environments Rademacher, R. Ray Tracing: Graphics for the Masses. Crossroads 3, 4 (Summer 1997), 3-7 Ross, B. Raster Algorithms. Brock University. 2002. http://www.cosc.brocku.ca/Offerings/3P98/course/lectures/2d/. 1 October 2006. Shirley, Peter. Fundamentals of Computer Graphics. Second Edition. A K Peters, Wellesley, MA, 2005. Tech Info: Extreme Programming (XP). Extreme Programming FAQ. Jera Design. http://www.jera.com/techinfo/index.html. 15 September 2006. Williams, L. A., Kessler, R.R. "All I Really Need to Know About Pair Programming I Learned in Kindergarten." Communications of the ACM 43, 5 (May 2000), 108-114.
3/28/2007	Apurv Kumaria, Jacob Vaverka	Compilation Techniques for Embedded Systems	M. Johnson	first
Abstract: Programs for embedded systems have traditionally been written in assembly language or a system language like C. Widespread use and sophistication of applications has led to a desire for features of higher-level languages like code reuse and better code security. Java is a possible approach for new programs on embedded systems, but there are several reasons why Java would be difficult to implement. The main difficulties are the overhead and higher memory usage that comes with Java. Our presentation discusses two recent techniques for compiling Java that are suitable for a wide range of embedded systems. The first technique involves a Java based system called JEPES and the second is Java-to-C compilation. These techniques greatly reduce the overhead involved and reduce the code size compared to other compilation methods.
Sources: [1] Ulrik Pagh Schultz, Kim Burgaard and Flemming Gram Christensen. Compiling Java for Low-End Embedded Systems LCTES'03, June 11-13, 2003. [2] Ankush Varma and Shuvra S Bhattacharyaa, Java-through-C Compilation: An Enabling Technology for Java in Embedded Systems, DATE'04
3/28/2007	Brett DeHoogh, Andrew Meyer	Finding Exact Values for Infinite Sums	W. Weber	first
Abstract: Through the use of numerical analysis and many calculus strategies there are now more efficient ways to solve Euler's infinite series. We will show how easy it is to solve an infinite series when we write it in terms of a definite integral. We will also show a specific case where we can evaluate an infinite series using partial sums.
Sources: Dunham, William. Euler: The Master of Us All. The Mathematical Association of America, 1999. Efthimiou, Costas J.. "Finding Exact Values for Infinite Sums." Mathematics Magazine Feb. 1999: 45-51.
3/7/2007	Tami Kreykes	Flipping a Coin Over the Telephone	T. Linton	second
Abstract: Bob and Alice need to flip a coin over the telephone, and in order to do this fairly, they need help from a cryptologist. Before solving this problem, a few basic math concepts will need to be understood, such as modular arithmetic, square roots mod a prime number, and the Chinese Remainder Theorem. After discussing these ideas and computing the mathematics, Bob and Alice can finally solve their issue and see who really wins.
Sources: Garrett, Paul. Making, Breaking Codes, 2001, pgs 199-212. Trappe. W. and Washington, Lawrence. Introduction to Cryptography with Coding Theory, 2006, pgs 76-88, 307-315.
3/7/2007	Dustyn Baethke	Sperner's Lemma in Fair Division	T. Linton	second
Abstract: Dividing rent, chores, or even a cake evenly and fairly can be challenging knowing that everyone's preferences are different. I will look at the history of fair-division and the idea of the cake-cutting problem as an introduction to my presentation. Using Sperner's Lemma for Triangles and The n-Dimensional Sperner's Lemma, I will analyze how to fairly divide rooms in a house among roommates. By doing this I can show that there will exist a situation where every roommate will prefer a room other than the one they are given.
Sources: Bogomolny, Alexander. In Some Circumstances Index Equals the Content. 2007. 5 Feb. 2007.http://www.cut-the-knot.org/do_you_know/poincare.shtml. Sperner's Lemma. 2003. 31 Jan. 2007.http://planetmath.org/encyclopedia/SpernersLemma.html. Su, Francis Edward. "Rental Harmony: Sperner's Lemma in Fair Division." American Mathematical Monthly. December 1999: 930-942. Webb, John. Sperner's Lemma. 2000. 31 Jan. 2007. http://www.nrich.maths.org/mathsf/journalf/nov00/art2/index.html.
2/28/2007	Kristen Friedrichs	How do you stack up?	T. Linton	second
Abstract: My presentation, How do you stack up?, involves a classic children's toy called a stacking ring tower. I will look at the different permutations of the rings and the solutions so as to fit all the given rings onto a given tower. I will also look at what happens when we add in duplicate rings.
Sources: Bonomo, John P. and Carolyn K. Cuff (November 2004). How do you stack up? The College Mathematics Journal. 35(5) 351-361
2/21/2007	Adrian Bell	Relplicator Dymanics for Balanced Zero Sum Games	T. Linton	second
Abstract: Evolutionary game theory is a relatively new topic of study in mathematics that focuses on how players' strategy choices change with repeated plays of a game. The changes in strategy of a specific balanced symmetric zero sum game will be analyzed using a system of differential equations. Mathematica will also be utilized in order to visually represent, given a specific payoff matrix, the changes of strategies with repeated game play.
Sources: Aydin, Yelda. "Conservative Systems." University of Illinois, Champaign, Illinois. 14 July 2006. Aydin, Yelda. "Lecture 12: Examples of 3-D Game Dynamics." University of Illinois, Champaign, Illinois. 12 July 2006. Bromze, Immanuel M. "Lotka-Volterra Equation and Replicator Dynamics: New Issues in Classification." Biological Cybernetics. (1995): 447-453. Bomze, Immanuel M. "Lotka-Volterra Equation and Replicator Dynamics: A Two Dimensional Classification." Biological Cybernetics 1983: (201-11). Hauert, Christoph, Nina Haiden, Karl Sigmund. "The Dynamics of Public Goods." Discrete and Continuous Dynamical Systems. 4 (August 2004): 575-587. Jones, Jane. Game Theory: Mathematical Models of Conflict. Chichester: Horwood Publishers. 2000. Muncaster, Dr. Robert. "Evolutionary Game Theory." University of Illinois, Champaign, Illinois. July 2006. Peyton, Young. Individual Strategy and Social Structure: An Evolutionary Theory of Institutions. New Jersey: Princeton University Press. 1998. Samuelson, Larry. "Evolution and Game Theory." Journal of Economic Perspective. 16.2 (Spring 2002): 47-66. Stahl, Saul. A Gentle Introduction to Game Theory. Providence: American Mathematical Society, 1999. Szabó, György, Gábor Fáth. Evolutionary Games on Graphs. Budapest: Research Institute for Technical Physics and Material Sciences, 2006. Trick, Michael A. "Mixed Strategies." 1998. 6 Feb 2007. QUANT/notes/node79.html>.
12/6/2006	Benjamin Helland, Danielle DeForest	Euler and Logarithms part 2	W. Weber	first
Abstract: The properties of hyperbolic area mirror the corresponding properties of logarithms. Through the discovery and proof that the harmonic series diverges, Euler found a link between harmonic series and logarithms. Euler proved the partial sum of the harmonic series is like a logarithm plus Euler's constant such that 's rationality is an unsolved mystery. The speakers will walk through the history of Euler's exploration of these topics.
Sources: Dunham, William. "Euler and Logarithms." Euler: The Master of Us All. The Mathematical Association of America, 1999. 21-23, 29-37.
11/29/2006	Andrew Green, Tami Kreykes	Euler and Logarithms	W. Weber	first
Abstract: Have you ever thought how the great mathematician Euler investigated logarithms? After a brief description of Newton's generalized binomial theorem, the presenters will discuss how Euler defines a logarithm as the inverse function of the exponential. Then it will be discussed how Euler used the binomial theorem to expand a^x and, by substitution, how he discovered his constant e. In a similar fashion, the presenters will explain how Euler expanded ln(1+x) which produced a simpler method for calculating logarithms. Finally, the presenters will discuss the derivative of natural log function.
Sources: Dunham, William. Euler: The Master of Us All. The Mathematical Association of America, 1999. 20-29.
11/22/2006	Michael De Jong,	Energy-Aware Data Compression	M. Johnson	first
Abstract: Can data compression help save energy on mobile devices? This question will be analyzed and answered during this presentation. Some initial tests are run, and it is determined that on average the energy required to transmit data is 1000 times the energy of a single computation. This suggests that compression before transmission would be beneficial. However, after further tests and measurements, it is discovered that compression can actually increase the energy use of a mobile device. Reasons for this as well as solutions to the initial question will be presented.
Sources: BARR, K., ASANOVIC, K. Energy-Aware Lossless Data Compression. ACM Transactions on Computer Systems. Vol. 24, No. 3. Aug. 2006. 250-291.
11/15/2006	David Morris	Introductory Process Memory Editing in Windows	S. Fyfe	second
Abstract: When a computer program is executed and loaded into memory it is known as a process. This presentation will discuss the basic manipulation of the binary data of processes running in Microsoft Windows XP. Low level concepts, programming methods, and simple application techniques will be explained.
Sources: http://msdn.microsoft.com/library/
11/15/2006	Steven Knight	Biometrics	S. Fyfe	second
Abstract: Biometrics is a rapidly increase technology. Learn about background information on biometrics and how biometric devices can be used for identification or verification. Hand geometry and iris recognition biometric devices will be looked at in detail.
Sources: http://www.cl.cam.ac.uk/~jgd1000 http://www.globalsecurity.org/security/systems/hand.htm http://www.biometricscatalog.org/NSTCSubcommittee/Documents/Hand%20Geometry.pdf http://www.biometricscatalog.org/NSTCSubcommittee/Documents/Iris%20Recognition.pdf
11/1/2006	Dennis Jr Henle	Simplifying DNS Administration	S. Fyfe	second
Abstract: As a project assigned to me this summer while working at Alliance Technologies, I redesigned our entire DNS system and set up a web interface for making routine changes. The talk will include the steps that had to be taken to complete the task and some technical aspects what goes into DNS.
Sources: http://iptrack.sourceforge.net http://www.isc.org Stephen Webb, CCNA, Alliance Technologies
11/1/2006	Adam Wolf	Solving Recursive Formulas with a Generating Function	T. Linton	second
Abstract: Ever get bored doing the same thing over and over? When it comes to running I don't like to do the same route all the time. Well there exists a running group that has rules stipulating that no route may be repeated on there weekly run. In my paper and presentation I will answer the question of how long can the group go without repeating a route. The math will involve graph theory, recursive formulas and use of generating functions as a special trick to turn a recursive formula into an explicit formula.
Sources: Grimaldi, R. P. (1999). Discrete and Combinatorial Mathematics. New York: Addison Wesley Longman. Nissen, P. & Taylor, J. (1991). Running Clubs-A Combinatorial Investigation. Mathematics Magazine, 64(1), 39-44.
10/18/2006	Samantha Morris	Knot Theory: Maintaining Tricolorability with Reidemeister's Moves	T. Linton	second
Abstract: When we think of knots, we think of those pesky problems in our shoe laces that we can not getout fast enought, but there is so much more to them mathematically. Knot theory is a new concept that has come about in the mathematical world. Even with its brief history there are a lot of details that have been established. Some of these thoughts are trefoil knots, unknots, mirror images of knots, and different classifications of knots. There is a very specific topic though of the colouring of knots. Through using Reidemeister's moves it is possible to color any knot other then a projection of the unknot using only three colors. While this is a very important topic in knot theory the sources of information are endless.
Sources: Adams, Collin C. The Knot Book: An Elementary Introduction to the Mathematical Theory of Knots. New York: W.H. Freeman and Company, 1994. Oh, Geon. Summer Research (Knot Theory) Progress Repot Part 1. Einstein's Office: Summer Research (Knot Theory) Progress Repot Part 1. Nov. 26, 2005. < http://precondition.blogspot.com/2005/11/summer-research-knot-theory-progress.html>. Payne, Bryson R. The Reidemeister Moves. Knot Theory The Web Site For Learning More About Knots. < http://www.freelearning.com/knots/intro.htm>
10/11/2006	Megan Reinders	Identification Numbers	T. Linton	second
Abstract: Identification numbers are everywhere, from plane tickets to credit cards. We also see them when shopping for food and textbooks, but how do we know they have been copied properly? In this talk, I will describe how these numbers are made and checked for accuracy.
Sources: Kirtland, Joseph. Identification Numbers and Check Digit Schemes. Washington, DC: Mathematical Association of America, 2001. Luhn Formula. 2006. 7 Oct. 2006 http://www.webopedia.com/TERM/L/Luhn_formula.html.
10/11/2006	An Le	Computing Square Roots By Hand	T. Linton	second
Abstract: How can one evaluate Sqrt[2679814580] without the use of technology? This may seem like an impossible task; however, in this talk, we will examine an algorithm that allows us to do just that. Dating back many hundreds of years, this method will give us the closest approximation to Sqrt[n] to a given number of places having only basic computational skill as its stipulation. Furthermore, we will prove why this simple yet powerful method works for small values such as Sqrt[2]to large values like Sqrt[2679814580].
Sources: Brown, E. (1999). Square Roots from 1;24,51,10 to Dan Shanks. The College Mathematics Journal, 30(2), 82-95. Vintage Calculators Web Museum. (2000). Calculator Time-Line. Retrieved September 11, 2006, from http://www.vintagecalculators.com/html/calculator_time-line.html
5/3/2006	Joshua McCollam, Thad Nelson	The Pythagorean Theorem of Baseball and Alternative Models	R. Goodman	first
Abstract: Are you wondering how your favorite Major League Baseball team will perform this season? There is actually a way to attempt to predict your favorite team's winning percentage. Find out how this can be done by using several simple formulas. We will also be extending this idea making predictions for the 2006 MLB season.
Sources: http://retrosheet.org http://sports.espn.go.com/mlb/stats http://www.baseball-almanac.com http://www.images.yahoo.com Hogg Robert V., Tanis, Elliot A., Probability and Statistical Inference Jones, Michael A., Tappin, Linda A., "The Pythagorean Theorem of Baseball and Alternative Models"
4/26/2006	An Le, Katherine Roloff	Hunting for a Solution	R. Goodman	first
Abstract: Inspired by the motion picture "Good Will Hunting", our presentation is based on a four-part mathematical problem that is posed as a challenge to the group of graduate students in the movie. This problem involves basic properties of matrices and graph theory and the concept of generating functions. We will be presenting a thorough solution to this four-part problem.
Sources: Gibbs, R & O'donnell W. (2005). Good will hunting meets graphing calculators and CAS. Mathematics Teacher. 99(3). 218-222. Locke, S.C. (2006). Graph Theory. Retrieved on April 19,2006, from http://www.math.fau.edu.locke/GRAPHTHE.HTM Nakos, G. & Joyner, D. (1998). Linear Algebra with Applications. Pacific Grove: Brooks/Cole Publishing Company. Van Sant, G. (Director). (1997). Good Will Hunting [Motion picture]. United States: Miramax.
4/12/2006	Daniel Deines	Platonic Solids	M. Mills	second
Abstract: How do we really know that there are only five platonic solids in the entire world? Is it possible that we have missed one? As it would turn out, we can prove that there are indeed only five regular polyhedra. The five regular polyhedra are more commonly known as the Platonic Solids. For my Sr. presentation, I will introduce these five Platonic Solids and discuss some of the information that surrounds these "perfect" solids.
Sources: Sutton, D. (2002). Platonic & Archimedean Solids: The Geometry of Space. New York: Walker & Company Plato (1959). Timaeus: Translated by Francis M. Cornford. New York: Liberal Arts Press. Gurudev (2003). Why are there only 5 platonic solids? Retrieved on November 18, 2005, from http://www.hitxp.com/math/geo/euclid/210503.html. Taylor, B. (n.d.). Biography of Plato's Legendary Life & Works: Immortal Greek Philosopher of Antiquity & Eternal Wisdom. Retrieved on January 23, 2006, from http://www.briantaylor.com/Plato.htm. Escher, M.C. (1997). Platonic Solids. Math Academy Online. Retrieved on January 12, 2006, from http://www.mathacademy.com/pr/prime/articles/platsol/
4/12/2006	KatieAnn Hugh	Sudoku: Enumerating Valid 9x9 Boards	M. Mills	second
Abstract: Have you every tried to solve a Sudoku puzzle? Can you guess how many unique 9x9 Sudoku puzzles exist? Find out if you are in danger of running out of new puzzles to feed your addiction to this new puzzle rage. This talk will also discuss continuing research and variations of the game.
Sources: Felgenhauer, Bertram, Jarvis, Frazer. "Enumerating possible Sudoku grids." 20 June 2005 http://www.afjarvis.staff.shef.ac.uk/sudoku/sudoku.pdf "Mathematics of Sudoku" en.wikipedia.org/w/index.php?title=Mathematics_of_Sudoku http://www.maa.org/editorial/mathgames/mathgames_09_05_05.html Hayes, Brian. "Unwed Numbers." American Scientist 94 (2006): (12-15).
4/5/2006	David Morris, Eric Miller	Secure Port Knocking with Tumbler	S. Fyfe	first
Abstract: Port knocking software such as Tumbler can add valuable security to a network by allowing clients to communicate with a server over closed ports. This presentation will discuss port knocking theory, the Tumbler protocol, and its perl implementation.
Sources: Graham-Cumming, John. "Practical Secure Port Knocking." Dr. Dobb's Journal (November 2004).
3/29/2006	Kristen Friedrichs, Adam Wolf	Knight's Tours on a Torus	R. Goodman	first
Abstract: In this presentation, we will investigate the Knight's Tour Problem: Can a knight visit each square of a chessboard only once using a sequence of knight's moves, and finish on the same square as it began? It turns out this is not always possible. Therefore, we will investigate the related problem of knight's tours on a torus. The presentation will include various examples of knight's tours leading to a powerful conclusion.
Sources: Hoenigman, R. L. and Watkins, J. J. (1997). Knight's Tours on a Torus. Mathematics Magazine 70(3) 175-184. Schwenk, A. J. (1991). Which rectangular chessboards have a knight's tour? Mathematics Magazine 64(5) 325-332.
3/8/2006	Angela Cook	Radio Frequency IDentification	R. Franks	second
Abstract: A breif description of what RFID is and a little bit of the history of the technology. I will explain the need for a worldwide standard and explain the developement of the standard being developed by EPCglobal.
Sources: EPCglobal at http://www.epcglobalinc.org/about/about_epc_network.html Mousavidin, Elham. "RFID Technology: An Update". http://www.uhisrc.com/FTB/RFID/RFIDTechnology04.doc Want, Roy. "The Magic of RFID". Queue, Octover 2004. Smith, Peter. "RFID Tags - How They Work". http://www.siliconchip.com.au/cms/A_30750/article.html
3/8/2006	Andrew Hartwig	M&m Sequences	M. Mills	second
Abstract: Sequences are a series of numbers that have a pattern. Consider the sequence where the median of the first n terms is equal to the mean of the first n + 1 terms, where n ≥ 3, such a sequence is called an M&m sequence. The following is an example of an M&m sequence: 6, 78, 46, 54, 66, 74, 96, 108, 102, 110, 96, 100, 195, 213, 96, 96, 96, 96, … Notice how this M&m sequence stabilizes or becomes constant. The question that I will be investigating is the question: Does every M&m sequence stabilize?
Sources: Harris, Shutlz and Ray Shiflett. "M&m Sequences" The College Mathematics Journal. Vol. 36 No. 3, May 2005. Lay, Steven S. Analysis With an Introduction to Proof. New Jersey: Prentice Hall. 2005.
3/1/2006	Kristin Sturm	Magic Squares	M. Mills	second
Abstract: Magic squares are one of the oldest combinatorial problems which can offer various challenges to mathematicians. Unique equations can be used with a multiplication theorem in the process of taking two smaller magic squares to construct a larger magic square. Even order magic squares offer a bit of a challenge to construct. Even though a magic square of order two does not exist, it is possible to compose an even order magic square utilizing a magic square of order two. Further investigation into most-perfect magic squares brings out other magical mathematical revelations.
Sources: Denes, J. & Keedwell, A.D. (1974). Latin Squares and their Application. New York and London: Academic Press. Gardner, M. (2001). A Gardner's Workout: Training the mind and entertaining the spirit. Massachusetts: A K Peters. Widdis, D. B., & Richter, R. B. (1999, September). It's Magic! Multiplication Theorems for Magic Squares. The College Mathematics Journal, 20(4), 301-306.
3/1/2006	Gregory Kapusinski	Fractions With Cycling Digit Patterns	M. Mills	second
Abstract: I will examine fractions with cycling digit properties. We will explore these awe-inspiring fractions and examine them when placed on a circle diagram. In addition, an interesting and thought provoking proof about diametrically opposed entries will be derived.
Sources: Kalman, Dan. "Fractions wish Cycling Digit Patterns." The College Mathematics Journal, 27.2 (1996): 109-115.
2/22/2006	Erika Jordan	Solving Sudoku	R. Franks	second
Abstract: Do you enjoy solving Sudoku puzzles? If so, let me make solving them easier for you! This presentation will cover bipartite matching algorithms used in solving these tricky and fun puzzles.
Sources: Sedgewick, Robert. (1992). Algorithms in C++. (pp. 485-506).Addison-Wesley Publishing Company. Suchard, E., Yatom, R., & Shapir, E. (2006, February). Sudoku & Graph Theory. Dr. Dobb's Journal, 381, 56-57.
2/22/2006	Justin From	The Polynomial Root Squeezing Theorem	W. Weber	second
Abstract: Polynomials are one of the most widely used functions in mathematics, yet there are surprisingly many unanswered questions about the properties of these functions. This talk will present an innovative new idea referred to as the Polynomial Root Squeezing Theorem which shows that squeezing two of a polynomial's roots towards one another causes the polynomial's critical points to also squeeze towards one another. This talk will also include an explanation of how this new theorem can be utilized to prove the Span Minimization Conjecture. (Note: This research was completed at the Grand Valley State University REU program.)
Sources: 1) J. From, S. Kolins, and M. Boelkins, The Polynomial Root Squeezing Theorem. Currently under peer review for publication, for an electronic copy e-mail Justin From at fromj1@central.edu. 2) B. Anderson, Where the inflection points of a polynomial may lie. Mathematics Magazine, 70 (1997) 32-39. 3) G. Peyser, On the roots of the derivative of a polynomial with all real roots. Mathematical Notes, November (1967) 1102-1104. 4) R. Robinson, On the spans of the derivatives of polynomials. American Mathematical Monthly, 71 (1964) 504-508.
12/7/2005	Dustyn Baethke, Adrian Bell, Emily Owens	Cryptology: From Caesar Ciphers to Public-key Cryptosystems	R. Goodman	first
Abstract: This presentation will cover methods of enciphering and deciphering messages. The history of cryptology and simple examples of enciphering and deciphering techniques will be shown, followed by explanation and examples of the classic "knapsack" problem and RSA public-key ciphers.
Sources: Luciano, Dennis and Gordon Prichett. "Cryptology: From Caesar Ciphers to Public-key Cryptosystems". College Mathematics Journal Vol. 18 #1, Jan. 1987. Levy, Steven. Crypto. New York, Viking 2001. Dam, Kenneth and Herbert Lin, eds. Cryptography's Role in Securing the Information Society. Washington DC. National Academy Press 1996. "RSA systems". Wikipedia. http://en.wikipedia.org/wiki/RSA.
11/23/2005	Jeffrey Linacre	Genetic Algorithms & Evolution in Computing	R. Franks	second
Abstract: How can we use the theory of evolution to find the optimal solution to complex computing problems? Using mutation, crossover reproduction, and the "survival of the fittest" method we can create adaptive evolving genetic algorithms. Genetic algorithms have been around for years and now that we have the processing speed and power to effectively run them the sky is the limit.
Sources: http://www.geatbx.com/docu/docutoc.html#TopOfPage http://en.wikipedia.org/wiki/Genetic_algorithm#Applications Mind matters: Exploring the world of artificial intelligence, James p. Hogan Artificial Life: The quest for a new creation, Steven Levy Virtual Organisms, Mark Ward
11/16/2005	Andrew Ohnemus, Dennis Jr Henle	Threading in Java with Simple Examples	S. Fyfe	first
Abstract: With the move to multi-core CPU's upon us, programmers are faced with a major change in the way applications are programmed. This presentation will go over basic threading ideas and give some simple examples using the Java programming language.
Sources: De Gelas, Johan. The Quest for More Processing Power, Part Two: "Multi-core and Multi-threaded Gaming" Anandtech. 09 November 2005 http://www.anandtech.com/cpuchipsets/showdoc.aspx?i=2377 Krishnaprasad, Srinivasarao. "Weaving Java Threads: Some Student-Friendly Examples." Jacksonville State University.
11/9/2005	Samantha Morris, Megan Reinders	Simple Decision of the Guessing Game	R. Goodman	first
Abstract: Have you ever wondered how many guesses it should take to discover someone's secret number in a guessing game? If you are offered a bet to guess a secret number in a certain number of tries, when should you take it? In this talk, we will look at a simple guessing game and will use algebra and probability to determine when the game is fair to the player.
Sources: Battele J. Picture of Bill Gates. Retrieved October 27, 2005. from battellemedia.com/ images/bill-gates.jpg Martins, L. (1998). A Simple Decision Game for a Guessing Game. The College Mathematics Journal, 29, 371-375. Microsoft Images of Steve Ballmer. Retrieved October 27, 2005. from www.microsoft.com/.../ images/grandes/ballmer.jpg
11/2/2005	Trenton Powers	Overtime in the NFL: A Markov Chain Analysis	M. Mills	second
Abstract: Have you ever wondered how often the team that receives the ball first in overtime games in the NFL wins? What about how often the game ends on the first possession of overtime? Is there a better way for overtime games to be decided? Using Markov chains to model the play of evenly matched teams in overtime games, we will compare two overtime methods using real data from the 2002 NFL season.
Sources: J.G. Kemeny and J.L. Snell.(1960). Finite Markov Chains, Van Nostrand. Jones, M. A.(2004). Win, lose, or draw: A Markov chain anlalysis of overtime games in the National Football League. The College Mathematics Journal, 35(5), 330-336. L. Pasquarelli, Overtime format will be under review this offseason, Espn.com column, http://espn.go.com/nfl/columns/pasquarelli_len/1504220.html, 2003.
11/2/2005	Matthew Rohach	Holographic Memory	R. Franks	second
Abstract: Have you ever loaded a computer program and wondered why it takes so long to load? Would you ever like it to be faster? If so, then holographic memory might be the answer. Holographic memory you ask? It just so happens to be a leading candidate to replace your hard drive in your computer. It involves the mixing of holograms and long term storage into a revolutionary device that could change the face of computers.
Sources: Ashley, J. "Holographic Data Storage" IBM, 2000. http://computer.howstuffworks.com/holographic-memory.htm Boyles, Stephanie "Holographic Memory" April 12, 2000 http://www.post-gazette.com/healthscience/20011029disk1029p2.asp http://www.imagesco.com/articles/holography/HowToShootHolograms01.html Hariharan, P., "Basics of Holography" Press Syndicate of the University of Cambridge, 2002.
10/26/2005	Chelsey Keller, Benjamin Bollard, Steven Knight	GPS: Inside and Out	S. Fyfe	first
Abstract: Have you ever wondered how Global Positioning System (GPS) works? GPS has become a very powerful tool for many different applications. Our presentation will first explain the conceptual building blocks that GPS was constructed on. Using this information we will discuss the issues that result from implementation of these concepts as well as precision issues. We will conclude with some practical applications of GPS.
Sources: Franson, Johan. "GPS Programming & .NET." Dr. Dobb's Journal. June 2004. p. S6-S10 Person, Jon. "Writing GPS Applications." Dr. Dobb's Journal. January 2005. p. 52 – 56. Marshall, Brian and Harris, Tom. "GPS – explained". http://www.kowoma.de/en/gps/index.htm . 4 October 2005. How GPS Receivers Work, http://electronics.howstuffworks.com/gps.htm, 16 October 2005. Dana, Peter H. "Geodetic Datums Overview" http://www.colorado.edu/geography/gcraft/notes/datum/datum_f.html. Revised 11 February 2003. Accessed 7 October 2005.
10/19/2005	Gregory Kapusinski, Katrina Obermeier, Kristin Sturm	Three Ways to Sum a Series	R. Goodman	first
Abstract: Can the terms of an infinite series sum to a finite value? Infinite series are very intriguing and we will explore one particular infinite series that converges to an interesting and surprising value. We will show the convergence of "Euler's Series" by addressing three popular proofs using algebra, trigonometry, and calculus.
Sources: Hughes-Hallett, Deborah, Andrew Gleason, William McCallum, et al. (2005) Calculus (Fourth Edition). New Jersey: John Wiley & Sons, Inc. Hughes-Hallett, Deborah, Andrew Gleason, William McCallum, et al. (2002) Multivariable Calculus (Third Edition). New York: John Wiley & Sons, Inc. Kalman, Dan. (1993) Six Ways to Sum a Series. The College Mathematics Journal, 24(5), 402-421. Weisstein, Eric W. Euler, Leonhard (1707-1783). Retrieved September 27, 2005, from http://scienceworld.wolfram.com/biography/Euler.html
10/12/2005	Diana Carr	The Congestion of Graphs	M. Mills	second
Abstract: Edge congestion can be thought of as the cutwidth of a graph. In this paper we embed complete tripartite graphs into trees and spanning trees and determine the tree congestion and the spanning tree congestion. Considering a known theorem relating detours, tree congestion, and spanning tree congestion, we summarize results calculated for trees, complete bipartite graphs, and grids. In addition, we investigate the congestion for other families of graphs.
Sources: S.L. Bezrukov, J.D. Chavez, L.H. Harper, M. Rottger, U.-P. Schroeder. The Congestion of n-Cube Layout on a Rectangular Grid, Discrete Mathematics. 213 (2000) 13-19. . F.R.K. Chung. Labelings of Graphs, Selected Topics in Graph Theory, Vol. 3, Academic Press, San Diego, 1988. 151-168. . D.W. Clarke. The Cyclic Cutwidth of Mesh Cubes, Masters Thesis, Cal State Univ., San Bernardino, 2002. . J.D. Chavez and R. Trapp. The Cyclic Cutwidth of Trees, Discrete Applied Mathematics, 87, Elsevier Science, 1998, 25-32. . S. Hruska. On Tree Congestion, REU Project, Cal State Univ., San Bernardino, 2004. . M.L. Holben. The Cyclic Cutwidth of Complete Bipartite Graphs, REU Project, Cal State Univ., San Bernardino, 2003. . M. Johnson. The Linear and Cyclic Cutwidth of the Complete Bipartite Graph, REU Project, Cal State Univ., San Bernardino, 2002. . M.I. Ostrovskii. Minimal Congestion Trees, Discrete Mathematics. 285 (2004)219-226. . F.R. Rios. Complete Graphs as a First Step Toward Finding the Cyclic Cutwidth of the n-Cube, Cal State Univ., San Bernardino McNair Scholar's Program Summer Research Journal, 1996. . J. Rolim, O. Sykora, I. Vrto. Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes, Graph-Theoretic Concepts in Computer Science, Springer, Berlin, 1995. 252-264. . H. Schroder, O. Sykora, I. Vrto. Cyclic Cutwidth of the Mesh, SOFSEM'99: Theory and Practice of Informatics, Springer, Berlin, 1999. 449-458.
10/12/2005	Conrad Vernon	Computer Processors	R. Franks	second
Abstract: Have you thought about buying a new computer lately? If you have, one of the main things you have been deciding on is probably what processor your computer is going to have. In my presentation I will tell the differences between single core processors, Hyper-Threading processors, dual core processors and dual processor systems. You will learn what thread-level parallelism is and what processors benefit from it. The good and the bad of the newest and fastest technologies will be revealed. Now will you not only know which processor will best fit your needs, but you can learn why. There will also be a short talk about the programs the institute multi-threaded programming and how it is exactly used.
Sources: "All about dual-core processors" www.webopedia.com May 06, 2005 Fisco, Rich. "AMD and Intel double up" PC Magazine Vol. 24 Issue 13 August 9, 2005 www.amd.com www.intel.com "Threads" http://java.sun.com
10/5/2005	Sonja Henderson	How to Approach a Traffic Light	M. Mills	second
Abstract: When driving an automobile around a curve or up a hill, one might see a red traffic light in the distance. A question to ask one's self: "Do I maintain a constant speed in the hope that the light will turn before I reach it, or do I slow my vehicle in order to increase the chance that I will arrive at a green light and not have to stop?" If the situation is reversed and one saw a green light, a question to ask one's self is: "Do I accelerate to increase the chance of reaching the light before it turns red, or do I maintain a constant speed?" Given several physical assumptions, a conclusion can be made on what would be the most energy-efficient strategy to use in approaching a traffic light, which is sighted at an unknown time in its cycle.
Sources: Katz, J.I., "How to Approach a Traffic Light." Mathematics Magazine 63.4 Oct. 1990: 226-230
10/5/2005	Nathan Lykken	Pattern Recognition and Artificial Intelligence	R. Franks	second
Abstract: Artificial intelligence is all around us: in computer games, factories, security devices, and even at post offices and banks. One of the main branches of artificial intelligence is pattern recognition, which allows machines to have human-like vision. This presentation will cover the uses of pattern recognition and will explore how pattern recognition works in the area of character recognition.
Sources: About OCR. 2005. 14 Sep. 2005 . Artificial Intelligence. 12 Sep. 2005 . Artificial Intelligence. 2004. 12 Sep. 2005 . Artificial Intelligence. 2005. 26 Aug. 2005 . Brown, Eric W. Character Recognition by Feature Point Extraction. 14 Sep. 2005 . Gottesman, Ben Z. "Software Will Get Smarter." PC Magazine 22 June 1999: 128. Kim, Soo H., Hee K. Kwag, and Ching Y. Suen. "Word-level Optical Font Recognition Using Typographical Features." International Journal of Pattern Recognition and Artificial Intelligence 18 (2004): 541-561. Kurzweil, Ray. "Long Live AI." Forbes 15 Aug. 2005: 30. McCarthy, John. Branches of AI. 24 Nov. 2004. 26 Aug. 2005 . Mone, Gregory. "Trust Me—I'm a Robot." Popular Science Aug. 2005: 48. Moore, Charles W. Optical Character Recognition. Dec. 2003. 7 Sep. 2005 . Myers, Gregory K., and Jeff L. Decurtins. Text Keyword Recognition (SCRIBBLE). 2005. 7 Sep. 2005 . Nagy, George, Thomas A. Nartker, and Stephen V. Rice. "Optical Character Recognition: An illustrated guide to the frontier." Kluwer International Series 3967 (1999): 58-69. OCR Readers. 2005. 7 Sep. 2005 . OCR Systems. 1994. 7 Sep. 2005 . Optical Character Recognition. 2002. 7 Sep. 2005 . The Text Recognition Problem. 14 Sep. 2005 . What's OCR? 7 Sep. 2005 . Whitby, Blay. Artificial Intelligence. Oxford: Oneworld Publications, 2003.
9/28/2005	Breanne McCoy	Map Coloring: The Four-Color Theorem	M. Mills	second
Abstract: Have you ever had to color a map? In doing so, have you ever wondered what is the smallest number of colors needed so that no two countries sharing a common border are of the same color? Even if you answered no to these questions, I'm sure you may have looked at a map of the U.S. that follows this guideline. This paper will discuss this and show that for a planar map, four colors are enough. It will also include an algorithm which can be used for successful coloring of most maps.
Sources: Barnette, David. Map Coloring, Polyhedra, and the Four Color Theorem. Mathematical Association of America: 1983. Keeports, David. "A Map-Coloring Algorithm." Mathematics Teacher 84.9 (December 1991) 759-763. Wilson, Robin. Four Colors Suffice: How the Map Problem was Solved. Princeton University Press: 2002.
9/28/2005	Kimberly Flaherty	MPEG-2 Compression	R. Franks	second
Abstract: When you are watching a video, take a minute to stop and think about how the information for that video is saved and transmitted from place to place. The truth us that if every piece of information for a video was needed to replay it who knows how long it would take to transmit it through satellite or how much space it would take to save to a hard drive. I will be introducing you to a standard video compression technique called MPEG compression which is used in situations like this to make the storing and transmission of video a much more efficient process.
Sources: "Understanding MPEG-2 Compression" Creative Video. 01 April 2005. 07 September 2005 . "GlOSSARY OF TERMS" RCA TV. 07 September 2005 . Long, Mark. "Understanding MPEG-2 Digital Video Compression" Information Resources For Telecommunication Professionals. SHOWTIME. 1996. 25 Aug. 2005 . Rechnernetze. "MPEG video compression technique". Technische Universitat Chemnitz. 13. Mai 2005. 25 Aug. 2005 . Kenyon, N.D, C. Nightingale, Audiovisual Telecommunications. Great Britain. St Edmundsbury Press LTD, 1992.
5/4/2005	Angela Cook, Kimberly Flaherty, Erika Jordan	Data Recovery and System Back-up	R. Franks	first
Abstract: What happens when you boot up your computer, and all of your data is gone? What would you do? We will be introducing to you an overview of data recovery including the answer to this question. Types of data loss, data recovery options, computer forensics and backing up will also be discussed.
Sources: http://www.data-recovery.com/. 2004. Reynolds Data Recovery. 10 March. 2005 < http://www.data-recovery.com/video.html.>. http://www.dataemergency.co.uk. 2004. Data Recovery UKLIMITED. 10 March. 2005 . http://www.911foreniscdata.com. Computer Forensic Data and Electronic Evidence Services. 18 March. 2005 . http://wwwpcmech.com. PC Mechanic. March 22. 2005 < http://wwwpcmech.com/show/harddrive/664 >. Geller, Sidney B. Care and Handling of Computer Magnetic Storage Media. District of Columbia: U.S. Government Printing Office, 1983. http://www.ibm.com. Techdocs – The Technical Sales Library. April 27. 2005 < http://www.ibm.com/support/techdocs/atsmastr.nsf/WebIndex/FQ101856>.
4/27/2005	Marty Hagewood	Parallel Computing	T. Linton	second
Abstract: This presentation will cover parallel computing. It will include a disscusion on the topics of parallel memory architectures, types of parallel computing, benefits of parallel computing and the speedup factor. The presentation will then conclude with a number of issues related to designing parallel systems as well as the classification of parallel systems.
Sources: www.owlnet.rice.edu/~pjv http://www.llnl.gov/computing/tutorials/parallel_comp
4/27/2005	Jeremy Robinson	Artificial Intelligence: In 20 Questions or Less	T. Linton	second
Abstract: What if computers could think for themselves? Can robots be trained to complete boring factory jobs so humans aren't required to? Would this mean the end of human workers? Can robots be trained to learn and become so intelligent that they will eventually outsmart the human race? These and other questions are asked and answered in the field of artificial intelligence.
Sources: 20Q.net. 2004. < http://www.20q.net/index.html > The 20Q Team, Letter to the author. 30 March 2005. AI Explained.com. < http://www.aiexplained.com> Hogan, James P. Mind Matters: Exploring the World of Artificial Intelligence. New York: The Ballatine Publishing Group, 1997. Internet Games Tutorial. Kasabov, Nikola K. Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering. Cambridge: The MIT Press, 1998. McCarthy, John. What is Artificial Intelligence?. 24 November 2004.
4/20/2005	KatieAnn Hugh, Daniel Deines, Trenton Powers	A Mathematical Model for Predicting the Number of Potential Conflict Situations at Intersecting Air Routes	R. Goodman	first
Abstract: Have you flown in an airplane recently? Do you wonder about what goes on behind the scenes that insures your safety in the air? We are going to present a simplified version of one model that the FAA utilizes to keep air travel safe. With roughly 8 million aircraft flying in the United States each year, planning air route geometry must be precise. Our presentation will cover the tools used by air traffic controllers to help direct aircraft without complications. Through the use of this model and given data, we can find intersection route capacity as well as predict any potential conflict situations between two aircraft.
Sources: "A Mathematical Model for Predicting the Number of Potential Conflict Situations at Intersecting Air Routes" By Waheed Siddiqee http://www.sosmath.com/trig/douangl/douangl.html. Date retrieved: 3/20/05 http://www.faa.gov/. Date retrieved: 3/31/05 http://www.airliners.net/search/photo.search. Date retrieved: 4/14/05 Air Traffic Controllers http://stats.bls.gov/oco/ocos108.htm. Date retrieved: 4/1/05
4/13/2005	Tyler Sandersfeld	A Random Ladder Game	M. Mills	second
Abstract: When a situation arises where you must randomly choose between multiple options, what do you do? Do you flip a coin? Do you roll a die? Do you draw names out of a hat? These are all very common methods of random selection. There is another method, however, that is quite perplexing. Suppose one person, let's say Mr. E, asks another, let's say Miss Leading, to play a game. In this game, Mr. E draws several vertical bars. He proceeds to connect the bars with horizontal lines, resulting in a ladder-like formation. Mr. E asks Miss Leading to select a number from 1 to 9. Mr. E will then follow the path down to the bottom. The path follows the vertical bars until it hits a "rung," at which time the rung is crossed and the path continues until the end. If Miss Leading's path hits the dollar sign, she wins $20. "Number 5 is right above the dollar sign, so I pick 5," says Miss Leading. Mr. E starts down the fifth bar. He hits a rung, so he crosses over to bar 4. He continues to the end, where much to Miss Leading's disappointment, path 5 ends up one slot to the left of the dollar sign. Miss Leading suspects foul play. She believes there isn't a path that leads to the money. Mr. E proves her wrong by starting again, this time at path 7. Sure enough, he hits the dollar sign. Now Miss Leading is thinking. Is this game always fair? Will all end paths be reachable? What happens when the rules are altered? How about when new rungs are added? How probable is each possible outcome? Is this game really effective? Don't you worry, Miss Leading. I shall answer those questions for you!
Sources: Lange, L. & Miller, J. (1992) A Random Ladder Game: Permutations, Eigenvalues, and Convergence of Markov Chains. The College Mathematics Journal, 23, 373-385 Eric W. Weisstein. "Eigenvalue." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/Eigenvalue.html Eric W. Weisstein. "Markov Chain." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/MarkovChain.html
4/13/2005	Bret Schuring	Global Positioning System	T. Linton	second
Abstract: Have you ever gotten lost while traveling, and wondered where you were exactly located? Up until around two decades ago there was no exact way for you to know your location. The introduction of the global positioning system (GPS) solved this problem with the ability to accurately pinpoint your location on earth with a GPS receiver. This presentation will cover the components of the GPS and take a look at data used in the system. We will also cover sources of error that affect the data and how to minimize these errors in a real world GPS application.
Sources: Person, Jon. "Writing GPS Applications." Dr. Dobb's Journal Jan 2004: 52-56; Dana, Peter H. "Global Positioning System Overview." 2000. 20 March 2005. http://www.colorado.edu/geography/gcraft/notes/gps/gps_f.html; Person, Jon. "Writing Your Own GPS Applications: Part 2." The Code Project. 2004. 15 Mar 2005. http://www.codeproject.com/netcf/WritingGPSApplicaitons2.asp; GPS Guide for Beginners. Garmin Corporation. Dec 2000. 21 Mar 2005. http://www.garmin.com/manuals/GPSGuideforBeginners_Manual.pdf.
4/13/2005	Justin Richeson	802.11/WiFi Positioning Systems	T. Linton	second
Abstract: The applications for self-location today are endless; however there is a large void in the capability to do this. Today's GPS system is based on satellites high above the earth, and thus cannot be used to track position without a clear view of the sky, and even cellular based tracking has it's limitations and is not readily available to the public. Enter today's modern IEEE 802.11 standardized networks. 802.11/WiFi can be used for indoor tracking using principals based on these other conventional tracking systems, modified to work in an indoor environment. Various solutions are currently being developed to find the location of an 802.11 networking device, filling the gap left by conventional tracking systems.
Sources: http://24.237.160.4/files/networking/Infocom%20stuff/Infocom2001%20CD/DATA00/05A_3.PDF http://www.gmat.unsw.edu.au/snap/publications/wangy_etal2004a.pdf
4/13/2005	Amanda Dunn	Retirement Savings: How Much Do You Need?	M. Mills	second
Abstract: Retirement? How will you survive without the income of your job? Have you ever wondered how much money you should be saving now? Is there a fixed amount of money you would like to receive each year of your life after retiring? During my talk we will discuss things you probably never thought about regarding saving for your retirement fund. Building upon simpler examples, we will build up to a realistic amount that you and I should be saving today in order to guarantee ourselves a comfortable life after retirement. Finally, we will compare individual and group plans to see advantages and disadvantages to both. You're guaranteed to leave a little more knowledgeable and a lot more sensitive to the topic of retirement.
Sources: "1994 Uninsured Pensioners Mortality Table." Transactions of the Society of Actuaries. Vol 47. 1995: 819-863. Daniel, James W. "How Much Money Do You (or Your Parents) Need Money for Retirement?" The College Mathematics Journal. Sept. 1998: 278-83.
4/6/2005	Justin From, Andrew Hartwig	A Practical Application of Linear Algebra using GPS	R. Goodman	first
Abstract: Imagine you are deep-sea fishing in the Atlantic Ocean. After reeling in a blue marlin you realize that you are lost. You have a GPS locator on board, but the clock of the GPS is not working correctly. Instead of giving you your exact location, the GPS locator is only capable of giving you raw satellite data. What do you do? In our presentation we will discuss how to calculate the exact location of a GPS locator given raw satellite data. This talk will include discussion on various models for triangulation problems, solving an underdetermined linear system, and a Mathematica program that can find a location of a point on the earth's surface given satellite-type data from four fixed points.
Sources: "An Underdetermined System for GPS" by Dan Kalman; www.gpsworld.com; www.trimble.com/GPS
3/30/2005	Andrew Larson	Finding Prime Numbers / Base-a Pseudoprimes	M. Mills	second
Abstract: The paper contains a study of finding prime numbers using the sieves of Eratosthenes and two algorithms of the author's design. The first part of the paper covers and compares the algorithms and discusses the process of determining whether or not a proposed number is indeed a prime number. Next, the paper touches on Fermat's Little Theorem and the applications for finding both prime numbers and the primality of possible prime numbers using base-2 pseudoprimes. Finally the paper reports on the author's findings of large primes base-2 pseudoprimes with the various algorithms as well as comparing things that necessitate comparing and explaining why large primes are sought.
Sources: http://mathworld.wolfram.com/ The Little Book of Big Primes by Paulo Ribenboim The Book of Prime Number Records by Paulo Ribenboim Contemporary Abstract Algebra by Joseph A. Gallian
3/30/2005	Udit Manektala	Voice over IP	T. Linton	second
Abstract: Ever had to make a phone call to a friend in U.K or Mexico? Wished you could talk longer without having to worry about the exorbitant phone charge? Ever wondered how some Phone Cards offer low-cost long-distance telephony compared to your regular Telecom Provider? Ever wanted to just hit a button on a website that would dial its tech support number for you, instead of actually picking up a handset and dialing yourself? Welcome to the world of Voice over IP; Using Internet Protocol to transmit voice packets without circuit-switching that copper-wire phone system that should have been left behind in the last century. Offering Low Cost Telecom solutions using High-Tech means, VoIP is the future of telephony.
Sources: Voice over IP Fundamentals,( Davidson, Peters) (Cisco 2000) VoIP - Implementing Voice over IP (Khasnabish, B) (Wiley 2003) http://www.voip-info.org/wiki-Analog+Telephone+Adapters www.cuphone.com
3/23/2005	Matthew Rohach, Trent Keegan	Biometrics	R. Franks	first
Abstract: Have you ever thought that your personal information is not secure? Have you ever wanted it to be more secure? Or maybe not just your personal information… but you, yourself to be kept safer. Throughout this presentation we will go into different ways that have been developed to be able to help you keep you and your personal information secure, with the fact that you, yourself are a unique individual. We will also go into which of these methods are feasible, and which of these are still being worked on. In addition we will take you further into a better understanding of the most commonly used of these biometric resources, fingerprints.
Sources: http://bio-tech-inc.com/bio.htm "Comparison of Biometric Techniques; http://www.forensic-evidence.com/site/ID/ID_Biometric_jarvis.html; D. Maltoni, D.Maio, A.K. Jain, S.Prabhakar, "Handbook of fingerprint Recognition; Stewart T. Fleming, "Biometric Security;"
3/16/2005	Gary Pothoven	University Web Portals	T. Linton	second
Abstract: Do you ever wonder why Central College's myCentral web portal exists the way it does? Do you ever feel that myCentral should be much better? You may be right, but there are many other factors to consider. Web portals have become the "next big thing" for educational institutions looking to provide and personalize large amounts of information, tools, and services to a diverse body of users. Much like other unexplored ventures, many schools go about selecting and implementing web portals in an incorrect fashion. We will explore the emerging world of web portals and the mistakes universities make in their implementation. By the end, hopefully your questions about myCentral will be answered.
Sources: Connolly, Christopher G. "A Dynamic and Individualized Web System." U.S.; Pennsylvania; 1999, 8 p. In: EDUCAUSE '99: Celebrating New Beginnings. [Proceedings] (Long Beach, CA, October 26-29, 1999) Olsen, Florence. "The Power of Portals." The Chronicle of Higher Education: Information Technology, August 2002. http://chronicle.com/free/v48/i48/48a03201.htm Panetierri, Joe. "Can Free Portals Make the Grade?" University Business, Oct2004, Vol. 7 Issue 10, p37, 2. "Web Portals and Higher Education: Technologies to Make IT Personal." Edited by Richard N. Katz. Jossey-Bass Higher and Adult Education Series. San Fransisco: Jossey-Bass, 2002.
3/16/2005	Matthew Waldren	Celestial Geometry	M. Mills	second
Abstract: Have you ever looked up into the night sky and wondered what is going on? While the size of the universe and the possibilities there in, may appear limitless, there remain many specifics that we can know about this vast space. One of the particular specifics that we have come to understand involves the geometric precision of the paths that planets take when orbiting a sun. These paths can be described by Kepler's Laws of planetary motion and can be understood using elementary Euclidean geometry.
Sources: Fowles, Grant R., George L. Cassiday, "Analytical Mechanics." 6th Ed. Brooks/Cole, 1999. Tipler, Paul A. "Physics for Scientists and Engineers." 4th Ed. Vol.1. New York: W.H. Freeman & Co, 1999. Goodstein, David L., Judith R. Goodstein. "Feynman's Lost Lecture: The Motion of Planets Around the Sun." New York: W.W. Norton & Co, 1996.
3/2/2005	Corrie Schmidt	JPEG Compression	A. Hibbard	second
Abstract: Does 20 minutes to download an image seem like quite a long time of waiting? Does a good quality image taking up 6.48MB seem like a lot of space on your computer? Are you willing to spend this much time and space on just one image? If you answer no to this last question and yes to the first two, we will learn about the JPEG algorithm that can help make this a problem of your past, We will be exploring the basic ideas about images and stepping through the process of the JPEG algorithm.
Sources: "Color displays." Web Style Guide 2nd Edition. 25 Feb. 2005 "The JPEG Still Image Data Compression Standard." 23 Jan. 2005. http://www.cs.sfu.ca/CourseCentral/365/li/material/notes/Chap4/ Chap4.2/Chap4.2.html#Steps> Lobur, Julie and Linda Null. The essentials of Computer Organization and Architecture. Massachusetts: Jones and Bratlett Publishers, 2003 "JPEG Compression Example." 25 Feb. 2005 http://www.cs.sfu.ca/CourseCentral/365/li/material/cgi-bin/whichjpeg.cgi Wallace, Gregory K. The JPEG Still Picture Compression Standard. IEEE Transactions on Consumer Electronics. Massachusetts: Dec. 1991.
3/2/2005	Erika Hartung,	Prince Rupert's Rectangles	M. Mills	Second
Abstract: How would you like to win a bet? Could your skills in mathematics help you? Over 300 years ago this was the case for Prince Rupert. He won a wager that given two equal cubes, a hole can be cut in one that is large enough to pass the second through it. Since Prince Rupert's time, the idea of fitting a cube into another cube has been examined extensively. Using geometry and the rectangular cross-section of a cube or box, we will discover the largest such box that can be passed through the unit cube. This process examines multiple symmetries such as rotations and reflections along with algebraic manipulations to find the dimensions of the box.
Sources: Jerrard, Richard & Wetzel, John. "Prince Rupert's Rectangles." American Mathematical Monthly, Jan. 2004. Prince Rupert's Cube: www.mathworld.wolfram.com/PrinceRupertsCube.html
2/23/2005	Angela Grey,	Computer Viruses	A. Hibbard	Second
Abstract: Have you ever been annoyed when Central has to shut down the network at the beginning of the year because someone brought a virus to campus? Even though the network has to shut down, the virus could still be on someone's computer, and spread throughout the campus. This can cause a major problem and make it harder to get rid of. If you are interested in how viruses attack computer, how they spread, the different types of viruses that are out there, and what you can do to help protect both your computer and your friends computer, this is the talk you will want to listen to.
Sources: "Computer Virus Timeline." Infoplease 2005 Pearson Education, publishing as Infoplease.29 Jan. 2005 http://www.infoplease.com/ipa/A0872842.html Deal, John C. "Viral Contagia in Cyberspace." Military Review. March-April 2001: 17-23. Pfleeger, Charles P. Security In Computing. Upper Saddle River: Prentice Hall, 1997. "Symantec Security Response." 13 Feb. 2005. Solomon, Alan. PC Viruses. New York: Springer-Verlag, 1991.
2/23/2005	Andrea Berger	Rotational Symmetries of Polyhedra	M. Mills	second
Abstract: Most of us are familiar with the possible symmetries that a polygon may have. Polyhedra also have symmetries. Furthermore, the rotational symmetries that a polyhdron could have are limited. There are five and only five systems of rotational symmetry for polyhedra. I will describe these systems and prove that there are these five and only these five.
Sources: Polyhedra, Peter Cromwell