1 / 1

AMP Automatic Meeting Planner

AMP Automatic Meeting Planner Team JVA : Dohan Kim , Jae Il Joo , Alison Hilaire , Virginie Vasselin KAIST Spring 2011 CS408: CS Project. PROJECT GOAL. To meet or not to meet? KAIST students and professors often have trouble to organize meetings for

nellie
Download Presentation

AMP Automatic Meeting Planner

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. AMP Automatic Meeting Planner Team JVA: Dohan Kim, Jae Il Joo, Alison Hilaire, VirginieVasselin KAIST Spring 2011 CS408: CS Project PROJECT GOAL • To meet or not to meet? • KAIST students and professors often have trouble to organize meetings for • make up classes or project work. To solve this problem, our team creates AMP, • the Automatic Meeting Planner. • This community website focuses on members of study groups or students’ club who • want to plan meeting easily. • Find the best meeting time and location • With AMP :-( • Fast • Clear • Pleasant • Without AMP :-( • Time consuming • Confusing • Irritating What should Prof. Lee use to plan his make up class? AMP of course! SYSTEM DESIGN SYSTEM REQUIREMENTS Design architecture Main algorithms SYSTEM ENVIRONMENT Web server APACHE2 Django/Python framework MySQL database Ajax for open-source scheduler CSS and HTML for user interface Use case diagram Application functionalities Quality attributes • Time finder • A meeting has: • time range • duration • possible attendants • For each attending user • find empty time slot • add slot to list of possible meeting time • add user to attendants’ list • Criteria to sort possible meeting times are: • Numbers of VIP that must attend • Total number of attendants • Time of day • Location finder • Each meeting attendants’ location is estimated according to schedule or user profile. • Compute M the mass center of attendants’ location • For each meeting location • calculate distance with M • if distance is smaller than the minimum, location is the new minimum Plan meeting time Plan meeting location Manage user’s timetable Manage group members Update user’s profile Discuss with group members Accessibility and Accuracy Usability and Speed Extensibility and Maintainability Privacy and Security TECHNICAL CHALLENGES • Algorithms to compute the best meeting conditions: time and location • Database schema to save groups and users ‘s information • Integration of open source components for the BBS (SCT forum) and user’s timetable (dhtmlxScheduler) CONCLUSION This CS project allowed us to learn more about software requirements. We also had to use software design techniques. Other aspects of our project involved not only reuse of components but also team management and project planning. THANKS TO : KAIST CS department for the server, the TAs and professors of the CS408 course for their advice and feedback

More Related