UMass Lowell Computer Science 91'504 Advanced Algorithms Computational Geometry Prof' Karen Daniels

1
UMass Lowell Computer Science 91.504 Advanced
AlgorithmsComputational Geometry Prof. Karen
Daniels Spring, 2004

• Project

2
Project Deliverables
Deliverable Due Date Grade

• Preliminary Topic Choice (proposal 1st draft)
  3/29 2
• Proposal 4/5 3
• Class Discussion 1-page proposal summary
  4/12 5
• Status Report Draft Introduction 4/21 5
• Status Report Draft Theoretical Results
• Algorithm Design 4/26 5
• Status Report Draft Experimental Design
• Implementation Results 5/3 5
• Final Project Report Presentation 5/10
  10

35 of course grade
3
Project Guidelines Proposal

• Objective State the goal of the project
• State topic/research question
• Scope it to be doable in 7 weeks
• Plan List the tasks you need to accomplish
• Resources What do you need?
• Specialized equipment, language, OS?
• Specialized software/libraries?
• Additional research papers, books?
• More background in some area?
• Assessment Checklist Characterize your project
  (see next 2 slides)

4
Guidelines Proposal (continued)

• Assessment Checklist
• Characterize your projects theoretical aspects
• Algorithmic Paradigm Design
• Analysis Technique Design
• Algorithm Design
• Data Structure Design
• Algorithm and/or Data Structure Analysis
• correctness
• running time and/or space
• Observations/Conjectures

Clarity
Difficulty
Scope
Creativity
Organization
Impact
Correctness
5
Guidelines Proposal (continued)

• Assessment Checklist
• Characterize your projects implementation
  aspects
• Reuse of existing Code/Libraries
• New Code
• Experimental Design
• Test Suites
• Degenerate/boundary cases
• Numerical robustness

Clarity
Difficulty
Scope
Creativity
Organization
Impact
Correctness
6
Guidelines Class Discussion

• 15 minutes per student
• Distribute written 1-page proposal summary
• Briefly state your projects topic/research
  question
• Present (with a small number of slides) some
  interesting aspect of what youve learned so far
  from background/related work
• Prepare one or two questions or observations to
  use as discussion points
• Lead a short class discussion

7
Guidelines Final Report

• Abstract
• Introduction
• Theoretical Results
• Algorithm
• Implementation
• Results
• Summary Conclusion
• Future Work
• References

Well- written final submissions with research
content may be eligible for publishing as UMass
Lowell CS technical reports and/or submission to
CCCG04 in Montreal this August.
8
Guidelines Final Report (continued)

• Abstract Concise overview (at most 1 page)
• Introduction
• Motivation Why did you choose this project?
• State Topic / research question
• Background people need in order to understand
  project
• Related Work Context with respect to literature
• Conference, journal papers, web sites
• Summary of Results
• Overview of papers organization

9
Guidelines Final Report (continued)

• Theoretical Results
• Clear, concise statements of definitions, lemmas,
  theorems and proofs
• Notation guidelines
• Algorithm
• High-level algorithm description ( example)
• Algorithmic paradigm
• Data structures
• Pseudocode
• Analysis
• Correctness
• Solutions generated by algorithm are correct
• account for degenerate/boundary/special cases
• If a correct solution exists, algorithm finds it
• Control structures (loops, recursions,...)
  terminate correctly
• Asymptotic Running Time and Space Usage

10
Guidelines Final Report (continued)

• Experimental Design Implementation
• Enough of the right kind of information to allow
  other researchers to duplicate your work
• Resources environment
• What language did you code in?
• What existing code did you use? (software
  libraries, etc.)
• What equipment did you use? (machine (
  processor speed), OS, compiler)
• Assumptions
• Parameter values
• Treatment of special issues, such as numerical
  robustness
• How did you decide what kinds of measurements
  would be meaningful?
• Randomness statistical significance
• Test cases
• Representative examples
• Controlled tests to establish correctness
• Boundary/extreme cases
• Benchmarks, if available

11
Guidelines Final Report (continued)

• Results
• Experimental analysis
• Randomness statistical analysis
• Test cases
• Tables
• Figures
• Graphs and Charts
• Comparison with benchmarks
• Meaningful measurements
• CPU time?
• Combinatorial size of output?
• Effect of decisions on issues, such as numerical
  robustness
• Drawing appropriate conclusions
• Subjective?
• Objective?
• Were the results what you expected?

12
Guidelines Final Report (continued)

• Summary
• Summarize what you did
• Conclusion
• Summarize results impact
• Future Work
• What would you do if you had more time?
• References Bibliography
• Papers, books, web sites that you used
• Consistent format
• All work not your own must be cited!
• Others exact words must be quoted!

13
Guidelines Status Report

• Structured like Final Submission, except
• no Abstract or Conclusion
• fill in only what youve done so far
• can be revised later
• include a revised proposal if needed
• identify any issues you have encountered and your
  plan for resolving them

14
Guidelines Presentation

• 20 minute class presentation
• Explain to the class what you did
• Structure it any way you like!
• Some ideas
• slides (electronic or transparency)
• demos
• handouts

15
Project Topics (some possibilities)

• Build on a Part I assignment, such as random
  point assignments in 2D or 3D
• Navigate based on line arrangement to do
  combinatorially-based overlap increase or
  reduction
• Visualization Can geometric duality help with
  parallel coordinate representation of
  high-dimensional data?

16
Project Topics (some possibilities)

• Dynamic Wireless Channel Assignment
• design a heuristic that, given an assignment of
  frequencies to regions, transforms it into
  another assignment that
• satisfies a given demand level (number of
  frequencies) for each region
• respects a separation constraint
• minimizes the number of frequencies
• minimizes the number of frequency reassignments