Oral Presentations - Session 8Copyright (c) 2014 Illinois Wesleyan University All rights reserved.
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8
Recent Events in Oral Presentations - Session 8en-usFri, 28 Mar 2014 14:00:45 PDT3600The Coefficient Characterization of Polynomials with Golden Ratio Roots
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/6
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/6Sat, 20 Apr 2013 11:00:00 PDT
The golden ratio and the Fibonacci numbers have a very noticeable presence in many mathematical applications. They are intricately connected in many explorations that involve the optimization of every-day systems (both natural and man-made). With such a prominent existence, it is helpful to discover ways to characterize the polynomial models that have the golden ratio and its conjugate as roots. As it turns out, these polynomials can be completely characterized by the constant and linear terms of the polynomial, which are both functions of the Fibonacci and Lucas numbers. These polynomials can then be used to derive many new and well-known identities of Fibonacci and Lucas numbers as well as the golden ratio.
]]>
Kurt VanNess, '13 et al.Analyzing and Extending an Infeasibility Analysis Algorithm
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/5
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/5Sat, 20 Apr 2013 11:00:00 PDT
Constraint satisfaction problems (CSPs) comprise of finding assignments to a set of variables that satisfy some mathematical constraints. Unsatisfiable constraint problems are CSPs with no solution. However, useful characteristic subsets of the problem may be extracted with algorithms such as the MARCO algorithm, which outperforms the best known algorithms in the literature. A heuristic choice in the algorithm affects how it traverses the search space to output these subsets. The effect of this choice on the performance of the algorithm is analyzed. In addition, three different improvements to the algorithm are proposed: the first of these improvements sacrifices completeness in terms of one type of subset in order to improve the output rate of another; The second and third are variations of a local search in between iterations of the algorithm which result in improved guidance in the search space. The performance of these improvements is analyzed both individually and in combinations across a variety of benchmarks and they are shown to improve the output rate of MARCO.
]]>
Ammar Malik, '13 et al.Building a Case for Human rights Advocacy: the Guangcheng Case
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/4
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/4Sat, 14 Apr 2012 11:00:00 PDTElizabeth Liubicich '14 et al.Using Legal Instruments in Human Rights Advocacy: The Guangchen Chen Case
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/3
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/3Sat, 14 Apr 2012 11:00:00 PDTJeremy Duffee '14 et al.International and Transnational Mexican Migration: A Marxian Approach
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/2
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/2Sat, 14 Apr 2012 11:00:00 PDTAlejandro H. Monzon '13 et al.Choice, Coercion and Conflict: Linguistic Human Rights, Cultural Liberty and Peacekeeping in a Globalized World
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/1
http://digitalcommons.iwu.edu/jwprc/2012/oralpres8/1Sat, 14 Apr 2012 11:00:00 PDTMegan Thompson '12 et al.