1 / 16

TAILOR-MADE WEB SEARCHES FOR INDIVIDUAL WEB SURPHERS

TAILOR-MADE WEB SEARCHES FOR INDIVIDUAL WEB SURPHERS. PHASE I : Literary PHASE II: Minor I PHASE III: Minor II PHASE IV: Major I PHASE V: Major II PHASE VI: Major III PHASE VII: Major IV PHASE VIII: Test & Debug. ABSTRACT.

orien
Download Presentation

TAILOR-MADE WEB SEARCHES FOR INDIVIDUAL WEB SURPHERS

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. TAILOR-MADE WEB SEARCHES FOR INDIVIDUAL WEB SURPHERS • PHASE I : Literary • PHASE II: Minor I • PHASE III: Minor II • PHASE IV: Major I • PHASE V: Major II • PHASE VI: Major III • PHASE VII: Major IV • PHASE VIII: Test & Debug

  2. ABSTRACT My research, Tailor-Made Web Searches for Individual Web Surfers, entails a systematic approach that will afford Individual Web Surfers the luxury of a more personalized-priority search result. Utilizing the programming language JAVA, HTML, PERL, and the Client/Server Amaya, I have began implementing the aforementioned research. Given the results of previous searches, maintained in a flat-file (Cookie – text file database), each newly devised search [new search string consisting of the same-exact string (i.e. Previous Search String: “Love”, New Search String: “Love”)] will precede the return search results with the previous Individual Web Surfer’s major hits (Web Pages that have been Book Marked, revisited at least one time, and that the Individual Web User spent at least five minutes on) bubbled to the top of the priority followed by the total return search results found by the server.

  3. PHASE I – LITERARY RESEARCH • Select Topic For Research: • Check Research Validity: • Via World Wide Web (WWW) • Via Library Resources • Implementation Influences: • Form a Suffice Attack-Approach: • Gather Resources: • Lay Out Plans in Organized Manner:

  4. RESEARCH STRUCTURE – FLOW CHART

  5. PHASE II – MINOR IMPLEMENTATIONS I • Design Web/Program Level Algorithm: • HTML Algorithm • JAVA Program Language Algorithm (P.L.A) • Write Web/Program Level Code: • HTML Code • JAVA P.L. Code • Test and Debug Web/Program Level Code: • HTML Code • JAVA P.L. Code

  6. Initialiations: UserName := “ “; Password := “ “; While UserName != null Input UserName; CheckIf Exists Input Password; Input Validate P; End While MINOR IMPLEMENTATIONS I - ALGORITHM

  7. PHASE III – MINOR IMPLEMENTATIONS II • Design Web/Program Level Algorithm: • HTML Algorithm - (Update) • JAVA P.L. Algorithm • Write Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (Develop Flat-File) • Test and Debug Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (Apply Flat-File)

  8. Initialiations: UserName := “ “; Password := “ “; While UserName != null Open Flat-File; Input Password; CheckIf Exists Input UserName; Input Validate P; Print URL to Flat-File; Print Date to Flat-File; Calculate Time On Page; Print Bookmarked? To Flat-File; Check if Bookmarked? Print Time to Flat-File; Print Number Visits to Flat-File; End While Close Flat-File MINOR IMPLEMENTATIONS II - ALGORITHM

  9. PHASE IV – MAJOR IMPLEMENTATIONS I • Design Web/Program Level Algorithm: • HTML Algorithm – (Update) • JAVA P.L. Algorithm (For Amaya) • Write Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (To Link To Amaya) • Test and Debug Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (Utilize Amaya)

  10. PHASE V – MAJOR IMPLEMENTATIONS II • Design Web/Program Level Algorithm: • HTML Algorithm - (Update) • JAVA P.L. Algorithm (For User Intercept) • Write Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (To Intercept To And From) • Test and Debug Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (Intercept To And From)

  11. PHASE VI – MAJOR IMPLEMENTATIONS III • Design Web/Program Level Algorithm: • HTML Algorithm - (Update) • JAVA P.L. Algorithm (For Server Intercept) • Write Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (To Intercept To And From) • Test and Debug Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (Intercept To And From)

  12. PHASE VII – MAJOR IMPLEMENTATIONS IV • Design Web/Program Level Algorithm: • HTML Algorithm - (Update) • JAVA P.L. Algorithm (For Server/Client) • Write Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (Server-Client/Client-Server) • Test and Debug Web/Program Level Code: • HTML Code - (Update) • JAVA P.L. Code – (Make Them Communicate)

  13. PHASE VIII – TEST AND DEBUG SYSTEM • Link Web/Program Level Algorithms: • HTML Algorithm - (Update) • JAVA P.L. Algorithm (For Entire System) • Copy And Paste Method/Functions: • Test And Debug Entire System:

  14. SEARCH ENGINE TAILOR-MADE PROCESSES DATA SERVER USER DATA CONCLUSION/SUMMARY

  15. WORK-CITED • http://www.something.com

  16. ACKNOWLEDGMENTS • Special Thanks To: • Dr. Douglas Heisterkamp – Program Coordinator • Mr. Ralph Grayson – Ph.D Student (OSU) • Mr. Billy Gaston – Ph.D Student (OSU) • Mrs. Tynan Grayson – Mentor/Advisor (LU) • Dr. Inhai Ro – Advisor/Instructor (LU)

More Related