====== Jennifer E. Walter ====== Associate Professor\\ Department of Computer Science\\ Vassar College\\ \\ Office: //124 OLB//\\ \\ Office hours: // Mon and Wed, 10:15 to 11:45 am, Tue and Thu, 1:15 to 3 pm // \\ \\ Office Phone: // (845)437-7449 ([[http://www.cs.vassar.edu/~walter/mailBox.png|Map to my office]])//\\ \\ Email: // [[jewalter@vassar.edu]] // \\ //Write it on your heart that every day is the best day in the year.//\\ -Ralph Waldo Emerson\\ \\ ---- ===== VWiCS (Vassar Women in Computer Science) ===== * [[http://www.cs.vassar.edu/~walter/VWiCS.html|VWiCS Program Announcement]] \\ Please contact me to find out how you can get involved! ---- ===== GHC (Grace Hopper Celebration of Women in Computing) ===== * [[http://www.cs.vassar.edu/~walter/atDisney.jpg|Picture of VWiCS members at the 2007 Grace Hopper Celebration of Women in Computing in Orlando, FL]] * [[http://www.cs.vassar.edu/~walter/SmileyWomen.jpg|Picture of VWiCS members at the 2008 Grace Hopper Celebration of Women in Computing in Keystone, CO]] * [[http://www.cs.vassar.edu/~walter/GHC09group.jpg|Picture of VWiCS members at the 2009 Grace Hopper Celebration of Women in Computing, Tuscon, AZ]] * [[http://www.cs.vassar.edu/~walter/betterGrpPic2010.jpg|Picture of VWiCS members at the 2010 Grace Hopper Celebration of Women in Computing in Atlanta, GA]] * Sorry, no picture of VWiCS members at the 2011 GHC in Portland, OR. But we were there!! * [[http://www.cs.vassar.edu/~walter/ghc2012group.jpg|Picture of VWiCS members at the 2012 Grace Hopper Celebration of Women in Computing in Baltimore, MD]]\\ Any Vassar students interested in attending the next GHC (in Minneapolis!) should e-mail me. Applications are due in Spring 2013. ---- ===== Courses to be taught in Spring 2013 ===== * __CMPU101 - Introduction to Problem Solving and Abstraction__ (sections 51 and 52) * **Course highlights**: - Course is "green", i.e., all assignments and labs are submitted and graded electronically. - No previous computer programming or mathematics necessary! - We concentrate on problem solving using a computer language with a very small set of statement types, requiring less memorization than most programming languages; few students have previously programmed in the language we will use, so all students start on a level playing field. - Graphics and animation techniques are utilized. - Labs and assignments are fun and interesting. \\ \\ /* * __CMPU241-01 - Analysis of Algorithms__ (1 section) * **Course highlights**: - Upper level course teaching the student to design and analyze the complexity of algorithms. - Focus on comparing different algorithms in terms of running time and memory space used during execution as a function of input size. - Introduction to basic algorithms for particular problems (e.g., sorting, searching, spanning trees, minimum spanning trees). - P versus NP algorithms and NP-completeness.\\ \\ * __CMPU240-01 - Language Theory (Theory of Computation)__ (1 section) * **Course highlights**: - Upper level course teaching students different basic models of computation including: * Finite automata, * Push-down automata, and * Turing machines. - Focus on creating and identifying machines and grammars to produce particular languages, such as: * Regular Languages * Context-free Languages, * Context-sensitive Languages (the Chomsky hierarchy). - Computability, the Halting Problem and reduction proofs. \\ \\ * Programming will be optional for some assignments. Some experience with programming logic is necessary. * Prerequisite: CMPU 145.\\ \\ */ ---- ===== History of courses taught ===== * CMPU101 - Introduction to Computer Science (Vassar): Spring 2013, Fall 2012, Fall 2011, Spring 2011, Spring 2010, Spring 2009, Fall 2008, Spring 2008, Fall 2007, Fall 2006, Fall 2005, Spring 2005, Fall 2003, Fall 2001 \\ \\ * CMPU102 - Introduction to object-oriented programming (Vassar): Fall 2010, Spring 2010, Fall 2009, Spring 2005, Fall 2004, Spring 2003, Fall 2002, Spring 2002\\ \\ * CMPU125 - Topics in Computer Science (CMPU101-102 combination): Fall 2008\\ \\ * CMPU240 - Language theory and Computation (Vassar): Fall 2007, Fall 2006, Fall 2002\\ \\ * CMPU241 - Algorithmics (Vassar): Fall 2011, Spring 2009, Spring 2008, Spring 2006, Spring 2003, Spring 2002\\ \\ * CMPU342 - Algorithmic Geometry (Vassar) *New course*, Spring 2006\\ \\ * CPSC433 - Formal Languages and Automata (Texas A&M): Summer 2001, Spring 2001 \\ ---- \\ ===== Research Interests (Student Employment Opportunities) ===== Development, analysis, and simulation of distributed algorithms. In particular, my work has concentrated on development of distributed algorithms for mobile ad hoc networks and for modular, reconfigurable robotic systems. A grant from the National Science Foundation (IIS-0712911) has enabled me to hire Vassar College undergraduate students to collaborate in research on motion planning algorithms for hexagonal robotic systems as well as the development and simulation of distributed algorithms on networks of mobile processors. To learn more about my research, please contact me via e-mail to request an appointment. \\ ---- \\ ===== Publications ===== * **//Monographs //** \\ \\ //J. Welch and J. Walter//, //Link Reversal Algorithms//: Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, Series Editor Nancy Lynch, October 2011, 93 pages. ISBN: 9781608450411 (paperback). ISBN: 9781608450428 (ebook). This volume is a version of a work that appears in the //Synthesis Digital Library of Engineering and Computer Science// \\ \\ \\ * **//Journal Papers //** (* indicates undergraduate student co-author) \\ \\ //R. Ingram*, T. Radeva, P. Shields*, S. Viqar, J. Walter, and J. Welch//, __A Leader Election Algorithm for Dynamic Networks with Causal Clocks__, accepted to // Springer-Verlag Journal on Distributed Computing//, to appear. 38 pages, 2013.\\ \\ //J. Walter, E. Tsai*, and N. Amato//, __Algorithms for Fast Concurrent Reconfiguration of Hexagonal Metamorphic Robots__, //IEEE Transactions on Robotics//, Vol. 21, No. 4, pp. 621-631, 2005. \\ \\ //J. Walter, J. Welch, and N. Amato//, __ Distributed Reconfiguration of Metamorphic Robot Chains__, //Springer-Verlag Journal on Distributed Computing//, 17:171-189, 2004. \\ \\ //J. Walter, J. Welch, and N. Amato//, __Concurrent metamorphosis of hexagonal robot chains into simple connected configurations__, //IEEE Transactions on Robotics and Automation//, Vol. 18, No. 6, pp. 945-956, 2002.\\ \\ //J. Walter, J. Welch, and N. Vaidya//, __A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks__, //Wireless Networks//, Vol. 9, No. 6, November 2001, pages 585-600. \\ \\ \\ * **//Papers in refereed conferences and workshops //** (*indicates undergraduate student co-author)**//://** \\ \\ S. Wong* and J. Walter, __Deterministic Distributed Algorithm for Self-Reconfiguration of Modular Robots from Arbitrary to Straight Chain Configurations__, accepted to the //IEEE International Conference on Robotics and Automation//, May 2013, Kongresszentrum Karlsruhe, Karlsruhe, Germany (acceptance rate 39%). \\ \\ J. Bateau*, A. Clark*, K. McEachern*, E. Schutze*, and J. Walter, __Increasing the Efficiency of Distributed Goal-Filling Algorithms for Self-Reconfigurable Hexagonal Metamorphic Robots__, //Proc. of the International Conference on Parallel and Distributed Techniques and Applications//, July 2012, Las Vegas, NV (acceptance rate 28%).\\ \\ P. Ivanov* and J. Walter, __Layering Algorithm for Collision-Free Traversal Using Hexagonal Self-Reconfigurable Metamorphic Robots__, in //Proc. of the IEEE International Conference on Intelligent Robotic Systems//, Oct. 2010, Taipei, Taiwan, pages 521-528 (acceptance rate 58%).\\ \\ S. Matysik* and J. Walter, __Using a Pocket-Filling Strategy for Distributed Reconfiguration of a System of Hexagonal Metamorphic Robots in an Obstacle-Cluttered Environment__, in //Proc. of the IEEE International Conference on Robotics and Automation//, May 2009, Kobe, Japan, Page(s):4265 - 4272 (acceptance rate 43%). \\ \\ R. Ingram*, P. Shields*, J. Walter, and J. Welch, __An Asynchronous Leader Election Algorithm for Dynamic Networks__, in //Proc. of the IEEE International Parallel and Distributed Processing Symposium//, May 2009, Rome, Italy (acceptance rate 23%), 12 pages in un-numbered volume.\\ \\ D. Little* and J. Walter, __Using Hexagonal Metamorphic Robots to Form Temporary Bridges__, in //Proc. of the IEEE International Conference on Intelligent Robotic Systems//, Aug. 2005, Edmonton, Alberta, Canada, pages 2652-2657 (acceptance rate 55%).\\ \\ J. Kamunyori* and J. Walter, __Enveloping Multiple Obstacles with Hexagonal Metamorphic Robots, __ in //Proc. of the International Conference on Parallel and Distributed Techniques and Applications//, June 2005, Las Vegas, NV, pages 3097-3103 (acceptance rate 26%).\\ \\ J. Walter, M. Brooks*, D. Little*, and N. Amato, __Enveloping Multi-Pocket Obstacles with Hexagonal Metamorphic Robots__, in //Proc. of the IEEE Intl. Conf. on Robotics and Automation//, Apr. 2004, New Orleans, LA, pages 2204-2209 (acceptance rate 58.8%).\\ \\ J. Walter, M. Brooks*, and N. Amato, __Filling an Obstacle Pocket with Hexagonal Metamorphic Robots__, in //Proc. of the 8th Conference on Intelligent Autonomous Systems//, 10-13 March 2004, Amsterdam, the Netherlands (invited paper for special session), pages 703-711.\\ \\ J. Walter and D. Little*, __Bridging Gaps in Traversal Surfaces with Hexagonal Metamorphic Robots__, in //Proc. of the American Nuclear Society 10th International Conference on Robotics and Remote Systems for Hazardous Environments//, 28-31 March, 2004, Gainesville, FL, pages 438-444 (invited paper for special session).\\ \\ J. Walter, E. Tsai*, and N. Amato, __Enveloping Obstacles with Hexagonal Metamorphic Robots__, in //Proceedings of the IEEE International Conference on Robotics and Automation, // May 2003, Taipei, Taiwan, pages 741-748 (acceptance rate 60.5%).\\ \\ J. Walter, E. Tsai*, and N. Amato, __Choosing Good Paths for Fast Distributed Reconfiguration of Hexagonal Metamorphic Robots__, in //Proceedings of the IEEE International Conference on Robotics and Automation, // May 2002, Washington, DC, pages 102-109 (acceptance rate 59.8%).\\ \\ J. Walter, G. Cao, and M. Mohanty,[[http://www.cs.vassar.edu/~walter/pomc.pdf| A K-Mutual Exclusion Algorithm for Ad Hoc Wireless Networks]] (pdf format), in //Proceedings of the first annual Workshop on Principles of Mobile Computing (POMC 2001)//, August 2001, pages 29-39 (acceptance rate 42%).\\ \\ J. Walter, J. Welch, and N. Amato, [[http://www.cs.vassar.edu/~walter/acmSub.ps.gz| Distributed Reconfiguration of Metamorphic Robot Chains]], in // Proceedings of the Nineteenth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2000)//, Portland, Oregon, 2000, pages 171-180 (acceptance rate 27%).\\ \\ J. Walter, J. Welch, and N. Amato, [[http://www.cs.vassar.edu/~walter/spie.ps.gz| Distributed reconfiguration of hexagonal metamorphic robots in two dimensions]], in //Sensor Fusion and Decentralized Control in Robotic Systems III//, Gerard T. McKee and Paul S. Schenker, eds., //Proceedings of SPIE//, Vol. 4196, pages 441-453, 2000 (invited paper for special session).\\ \\ J. Walter, J. Welch, and N. Vaidya, [[http://www.cs.vassar.edu/~walter/hd.ps.gz|A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks]], //1998 Dial M for Mobility workshop//, Dallas TX, Oct. 1998, 15 pgs (acceptance rate 45%).\\ \\ J. Walter and J. L. Welch, [[http://www.cs.vassar.edu/~walter/submission.ps.gz|Hazard-Free Connection Release]], //1997 International Conference on Parallel and Distributed Techniques and Applications (PDPTA '97)//, Las Vegas, NV, July 1997, pp. 1668-1672. The original version of this paper is available in my [[http://www.cs.vassar.edu/~walter/keeper.ps.gz| Master's Thesis]], Texas A&M University, 1997.\\ \\ \\ * Technical Reports:\\ \\ D. Little and J. Walter, __Using Hexagonal Metamorphic Robots to Form Temporary Bridges: Proof of Correctness__, Texas A&M Parasol Robotic Laboratory Technical Report 05-001, 2005.\\ \\ J. Walter, A K-Mutual Exclusion Algorithm for Dynamic Networks, Texas A&M Technical Report 00-022, 31 pages, 2000.\\ \\ J. Walter and S. Kini, A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks, Texas A&M Technical Report 97-014, 1997.\\ \\ ---- Last Updated January 31, 2013 [[:top|Computer Science Home Page ]]