The World Wide Web (the “Web”) provides an alternative source of information for consumers and business users. Some users also view the Web as a source of entertainment. Surfing the Web, cybercafes, etc. appeal to the sophisticated Web user as a way of having a good time.
Many Americans raised in the television age view entertainment as a serial event. Specifically, generations of viewers have experienced television shows, movies, radio programs, and concerts which all proceed linearly from a beginning to an end. Some potential Web users of this generation view surfing the Web as intimidating from perhaps two respects: (1) the use of technology; and (2) the increasingly unorganized, virtually unlimited number of choices that are available. The Web is not inherently a linear entertainment medium. A Web user may typically go directly from any given site to a large number of other sites. At best, some websites provide links to similar sites, however they typically do not offer more than a cursory indication of what the linked sites contain.
In addition, even sophisticated Web users are often frustrated by the amount of useless, undesirable material that appears on the Web. Take, for example, a user who wishes to look at pictures of classic automobiles. A search on classic automobiles may yield 10,000 hits. A website-by-website search for interesting material may yield many sites that do not meet the user's expectations as to the content, properties or quality. Some sites may be a single page that prompts a user to order a catalog. Other sites may have text but no pictures.
Accordingly, there is a need for creating entertaining Web programs that appeal to a wide cross section of potential viewers.
The present invention addresses the need for creating and navigating entertaining Web programs that filter out unwanted information and present desired information in a series of linearly linked websites. In one embodiment of the present invention, a user starts with the first site and in a guided tour fashion, when finished, is directed exclusively to the second site. When done with the second site, the user is directed exclusively to the next site, etc. The progression of sites defines a programmed linear hypermedia resource path that is geared towards the entertainment of the user. Users may also implement the system and method described in more detail below for educational purposes or as a research tool.
Referring to
As shown in
Unlike a typical search result from an Internet search engine on the Web, a linear hypermedia resource program includes a selected group of media elements that are associated by a series of exclusive forward and backward links that are, in one embodiment, accessible at all times as the hypermedia resources are browsed.
Preferably, the program elements 25 of a linear hypermedia resource program 23 are stored in the common remote information node 16 controlled by the internet service provider used by a subscriber at a subscriber station 18 (
Utilizing the system of
A forward direction button 36 is displayed to the user on the display device of the subscriber station 18 and the subscriber station receives a first signal in response to an action of the user that indicates an activation of the forward link button (at steps 42, 44). If a signal is received indicating that the user has selected the forward directional button, a second base media element is downloaded and provided to the subscriber station (at step 46). As with the first hypermedia resource, the user may download and display selected media elements from the second hypermedia resource until satisfied (at step 48). The steps of responding to the user command to display a base media element of a hypermedia in a linear hypermedia resource program and, in response to subsequent commands of a user, to download and display other media elements from that hypermedia resource may be repeated many times. In this fashion, the user can traverse all of the program elements of the linear hypermedia resource program including all of the base media elements and any desired media elements of each hypermedia resource.
By way of an example for implementing the method described above and shown in
The user can activate the forward direction button 36 to go to a second web site on the tour. The second website may display subject matter relevant to the real life of, or a movie character portrayal by, the celebrity. If, for example, the celebrity was known to smoke cigars, a cigar store website having a variety of cigars for sale via mail order can be displayed. As the user progresses through the linear program, the user may come across a website having little appeal to the user and so the user may simply hit the forward direction button 36 to proceed along to the next in the serially linked series of websites. In addition, a skip next button (not shown) can likewise allow a user to skip the next program element in the linear program 23 and proceed directly to the program element after the next program element. The remaining program elements 25 in the linear program 23 can include website pages for Broadway plays the celebrity acted in, vacations in exotic locations associated with the celebrity, pictures of the celebrity in favorite roles, and so on.
It should be noted that, in one embodiment of the present invention the user is free to engage hyperlinks that are present in each hypermedia resource. This allows the user to browse any of the individual hypermedia elements of the hypermedia resource as well as other linked hypermedia resources that may not be on the linear path. In this embodiment, the activation of the forward or back buttons directs the user to the next or previous hypermedia resource, respectively, and therefore allows the user to return to the path provided by the linear program 23.
In one embodiment, selection of a beginner experience level disables all links appearing on media elements in the linear hypermedia resource program. This feature discourages users from leaving the path defined by the program and becoming lost in cyberspace. In an alternative embodiment, the step of modifying the set of available commands may include disabling Web links between hypermedia resources 20 and only allowing a user to peruse media elements 22 within a selected hypermedia resource 20 until the next hypermedia resource 20 in the linear hypermedia resource program is selected through the forward or back direction buttons 36 in the user interface 28.
After selecting the experience level and modifying the set of available commands, the method proceeds in much the same way as described in
While
According to another aspect of the invention, in one embodiment a user at a subscriber station 18 may utilize software at the common remote information node 16 to generate a linear hypermedia resource program. As shown in
As shown in
When the search criteria are received at the node 16, the professional director or intelligent agent may evaluate media elements to select and organize, in an exclusive linearly linked fashion, highly relevant media elements satisfying the user's search criteria (at steps 102-108). For example, a user interested in shopping for furniture on the Web specifies the types of furniture in which he or she is interested (e.g., Chippendale breakfront mahogany china cabinets), and the type of websites desired (e.g., furniture stores with websites that show JPEG or MPEG images of the furniture with prices for each piece). Examples of other suitable file formats are any of a number of known graphics, video, audio and tactile data formats. Preferably, the user has the appropriate hardware and software at the subscriber station to interpret the electronic media element content into the video, audio, or tactile domain. A user also preferably designates file information content choices in the search criteria. File information content may be used to filter for Web pages that contain price listings or have the ability to place secure product orders via credit card. Many other file criteria may be used to select appropriate media elements. For example, a user can also specify that information must be presented in a certain language, that suitable websites must have been updated within a predetermined period, and so on.
The user may optionally specify the time frame for generating a desired linear hypermedia resource program. For example, the user may request that the linear hypermedia resource program be ready by Friday night that week. The intelligent agent or professional director works off-line of the user to create a series of links that define a desirable path through a series of websites that meet the user's criteria. Once complete, the linear hypermedia resource program (in this example a serial path of website pages from one or more websites) is delivered to the user by HTTP or email. The common remote information node may automatically notify the user that the program is ready or may wait for the user to retrieve it.
Internet service providers, or other linear hypermedia program sources offering users custom-made linear hypermedia resource programs, may offer linear hypermedia resource programs of different lengths and quality. In order to accommodate different needs and budgets, a method for generating a desired linear hypermedia resource program and accounting for billing information is useful. As
As described above, the step of evaluating the media elements may be done with an intelligent agent such as a search engine with artificial intelligence capabilities, or may be done manually by personnel at the Internet service provider. Base media elements are then selected from the pool of relevant hypermedia resources and then assigned to program element positions in the linear hypermedia resource program (at step 116). The resulting linear hypermedia resource program is then transmitted from the common remote information node to the subscriber station (at step 118) and a billing record is also generated at the common remote information node of the Internet service provider in accordance with the time frame requested and scope of the search (at steps 120). Factors such as processor time, memory requirement for the linear program, or storage period at a server such as the common remote information node may also be incorporated into the billing record.
Different versions of a method for creating a linear hypermedia resource program are pictorially illustrated in
The various methods described herein, in a preferred embodiment, are intended for operation as software programs running on a computer processor. One of ordinary skill in the art will recognize that other hardware implementations such as application specific integrated circuits, programmable logic arrays and other hardware devices can likewise be constructed to implement the methods described herein. It should also be noted that the various methods of the present invention can be implemented in software, in one of a variety of known computer languages, and stored on a tangible storage medium such as a magnetic or optical disk, read-only memory or random access memory and be produced as an article of manufacture.
As has been described above, a system and method for navigating and creating linear hypermedia resource programs are provided. The system and method provide a serial entertainment medium for internet Web users of all experience levels. A common remote information node such as a server operated by an internet service provider may generate, and store the contents of, a linear hypermedia resource program. A user can access the program through a user interface from a subscriber terminal. The program, which may consist of Web pages from one or more websites, is preferably traversed linearly with the user interface. Depending on a selected skill level, various links may be disabled to better guide a user along the predetermined linear path. The method also describes selecting media elements to include and editing their placement in the linear program. As will be recognized by those skilled in the art, the type of computers and communications devices used may be any one of a number of commonly available computers and communications devices. The communications networks for interconnecting hypermedia resources in the distributed hypermedia resource network may be internet communications networks or other types of networks.
It is intended that the foregoing detailed description be regarded as illustrative rather than limiting, and that it be understood that the following claims, including all equivalents, are intended to define the scope of the invention.
The present U.S. Utility Patent Application claims priority pursuant to 35 U.S.C. § 120 as a continuation of U.S. Utility application Ser. No. 15/681,714, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM,”, filed Aug. 21, 2017, which is a continuation of U.S. Utility application Ser. No. 14/728,576, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed Jun. 2, 2015, issued as U.S. Pat. No. 9,772,814 on Sep. 26, 2017, which is a continuation of U.S. Utility application Ser. No. 13/552,282, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed Jul. 18, 2012, issued as U.S. Pat. No. 9,083,672 on Jul. 14, 2015, which is a continuation of U.S. Utility application Ser. No. 13/116,421, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed May 26, 2011, issued as U.S. Pat. No. 8,250,173 on Aug. 21, 2012, which is a continuation of U.S. Utility application Ser. No. 12/426,428, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed Apr. 20, 2009, issued as U.S. Pat. No. 8,250,170 on Aug. 21, 2012, which is a continuation of U.S. Utility application Ser. No. 11/784,305, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed Apr. 6, 2007, issued as U.S. Pat. No. 7,539,738 on May 26, 2009, which is a continuation of U.S. Utility application Ser. No. 10/884,187, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed Jul. 1, 2004, issued as U.S. Pat. No. 7,216,155 on May 8, 2007, which is a continuation of U.S. Utility application Ser. No. 09/964,104, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed Sep. 26, 2001, issued as U.S. Pat. No. 6,779,026 on Aug. 17, 2004, which is a continuation of U.S. Utility application Ser. No. 09/680,899, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed Oct. 6, 2000, issued as U.S. Pat. No. 6,330,596 on Dec. 11, 2001, which is a continuation of U.S. Utility application Ser. No. 09/167,514, entitled “SYSTEM AND METHOD FOR CREATING AND NAVIGATING A LINEAR HYPERMEDIA RESOURCE PROGRAM”, filed Oct. 6, 1998, issued as U.S. Pat. No. 6,145,000 on Nov. 7, 2000, all of which are hereby incorporated herein by reference in their entirety and made part of the present U.S. Utility Patent Application for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
5303367 | Leenstra, Sr. et al. | Apr 1994 | A |
5408655 | Oren et al. | Apr 1995 | A |
5446891 | Kaplan et al. | Aug 1995 | A |
5551055 | Matheny et al. | Aug 1996 | A |
5572643 | Judson | Nov 1996 | A |
5630117 | Oren et al. | May 1997 | A |
5694594 | Chang | Dec 1997 | A |
5708826 | Ikeda et al. | Jan 1998 | A |
5717922 | Hohensee et al. | Feb 1998 | A |
5721911 | Ha et al. | Feb 1998 | A |
5724567 | Rose et al. | Mar 1998 | A |
5727129 | Barrett et al. | Mar 1998 | A |
5764908 | Shoji et al. | Jun 1998 | A |
5774526 | Propp et al. | Jun 1998 | A |
5794257 | Liu et al. | Aug 1998 | A |
5802299 | Logan et al. | Sep 1998 | A |
5806077 | Wecker | Sep 1998 | A |
5809247 | Richardson et al. | Sep 1998 | A |
5812134 | Pooser et al. | Sep 1998 | A |
5818439 | Nagasaka et al. | Oct 1998 | A |
5838906 | Doyle et al. | Nov 1998 | A |
5848396 | Gerace | Dec 1998 | A |
5877766 | Bates et al. | Mar 1999 | A |
5884079 | Furusawa | Mar 1999 | A |
5890172 | Borman et al. | Mar 1999 | A |
5898833 | Kidder | Apr 1999 | A |
5920859 | Li | Jul 1999 | A |
5933841 | Schumacher et al. | Aug 1999 | A |
5937163 | Lee et al. | Aug 1999 | A |
5940831 | Takano | Aug 1999 | A |
5958016 | Chang et al. | Sep 1999 | A |
5983245 | Newman et al. | Nov 1999 | A |
5987466 | Greer et al. | Nov 1999 | A |
5987501 | Hamilton et al. | Nov 1999 | A |
5996015 | Day et al. | Nov 1999 | A |
5999929 | Goodman | Dec 1999 | A |
6009429 | Greer et al. | Dec 1999 | A |
6032156 | Marcus | Feb 2000 | A |
6032162 | Burke | Feb 2000 | A |
6032196 | Monier | Feb 2000 | A |
6035330 | Astiz et al. | Mar 2000 | A |
6037935 | Bates et al. | Mar 2000 | A |
6044374 | Nesamoney et al. | Mar 2000 | A |
6049799 | Mangat et al. | Apr 2000 | A |
6070228 | Belknap et al. | May 2000 | A |
6091416 | Cragun | Jul 2000 | A |
6112212 | Heitler | Aug 2000 | A |
6145000 | Stuckman et al. | Nov 2000 | A |
6151017 | Suzuoka et al. | Nov 2000 | A |
6151630 | Williams | Nov 2000 | A |
6154771 | Rangan et al. | Nov 2000 | A |
6182072 | Leak et al. | Jan 2001 | B1 |
6189019 | Blumer | Feb 2001 | B1 |
6212533 | Tabuchi | Apr 2001 | B1 |
6216112 | Fuller et al. | Apr 2001 | B1 |
6243713 | Nelson et al. | Jun 2001 | B1 |
6256623 | Jones | Jul 2001 | B1 |
6297819 | Furst | Oct 2001 | B1 |
6297824 | Hearst et al. | Oct 2001 | B1 |
6330596 | Stuckman et al. | Dec 2001 | B1 |
6341310 | Leshem et al. | Jan 2002 | B1 |
6360234 | Jain et al. | Mar 2002 | B2 |
6378130 | Adams | Apr 2002 | B1 |
6404445 | Galea et al. | Jun 2002 | B1 |
6415281 | Anderson | Jul 2002 | B1 |
6442574 | Schumacher et al. | Aug 2002 | B1 |
6448987 | Easty et al. | Sep 2002 | B1 |
6486895 | Robertson et al. | Nov 2002 | B1 |
6572662 | Manohar et al. | Jun 2003 | B2 |
6597377 | MacPhail | Jul 2003 | B1 |
6628307 | Fair | Sep 2003 | B1 |
6658623 | Schilit et al. | Dec 2003 | B1 |
6751777 | Bates et al. | Jun 2004 | B2 |
6772139 | Smith, III | Aug 2004 | B1 |
6779026 | Stuckman et al. | Aug 2004 | B2 |
6810409 | Fry et al. | Oct 2004 | B1 |
6832355 | Duperrouzel et al. | Dec 2004 | B1 |
7010747 | Perttunen | Mar 2006 | B1 |
7162562 | Chen | Jan 2007 | B2 |
7213198 | Harik | May 2007 | B1 |
7346840 | Ravishankar et al. | Mar 2008 | B1 |
7424523 | Stuckman et al. | Sep 2008 | B2 |
7478144 | Stuckman et al. | Jan 2009 | B2 |
7539738 | Stuckman et al. | May 2009 | B2 |
7555476 | Holbrook | Jun 2009 | B2 |
7761863 | Illowsky | Jul 2010 | B2 |
7769830 | Stuckman et al. | Aug 2010 | B2 |
7949707 | McDowall et al. | May 2011 | B2 |
8640160 | Stefanik et al. | Jan 2014 | B2 |
9083672 | Stuckman et al. | Jul 2015 | B2 |
9226655 | Iwase et al. | Jan 2016 | B2 |
9772814 | Stuckman et al. | Sep 2017 | B2 |
9864575 | Stuckman | Jan 2018 | B2 |
20010034814 | Rosenzweig | Oct 2001 | A1 |
20010049698 | Hsu et al. | Dec 2001 | A1 |
20040008225 | Campbell | Jan 2004 | A1 |
20070168413 | Barletta et al. | Jul 2007 | A1 |
20100168413 | Indusegaram | Jul 2010 | A1 |
Number | Date | Country |
---|---|---|
2208874 | May 2001 | CA |
9849634 | Nov 1998 | WO |
Entry |
---|
Yahoo Holdings, Inc.'s Invalidity Contentions, Dated Nov. 6, 2017, Pursuant to Local Patent Local Rule 3-3; Nov. 6, 2017; 1465 pages. |
Braverman; CCI Slide Show 1.0; Sep. 22, 1994; 2 pgs; http://archive.ncsa.illinois.edu/cyberia/stats/sshow-src/readme-sshow. |
Chang, et al.; A Fully Automated Content-Based Video Search Engine Supporting Spatiotemporal Queries; IEEE Transactions on Circuits and Systems for Video Technology; vol. 8, No. 5; Sep. 1998; 14 pgs. |
Cool Links: Overview; 1997; 3 pgs; http://web.archive.org/web/19980210201910/http://www.i-a-i.com/services/cool/overview.html. |
Cool Links: Technical Overview; 1997; 2 pgs; http://web.archive.org/web/19980210201925/http://www.i-a-i.com/services/cool/technical.html. |
Gloor; Elements of Hypermedia Design: Techniques for Navigation & Visualization in Cyberspace; 1997; 393 pgs; Birkhauser Boston. |
Hauck; Supporting Hierarchical Guided Tours in the World Wide Web; Computer Networks and ISDN Systems 28; 1996; pp. 1233-1242. |
Hauswirth; Pooh's Guided Tour Service; Nov. 11, 1995; 12 pgs; http://web.archive.org/web/19970117063457/http://www.infosys.tuwien.ac.at/GuidedTour. |
Joachims; WebWatcher Demo; Sep. 15, 1997; 1 pg; http://www.cs.cmu.edu/afs/cs.cmu.edu/project/theo-6/web-agent/www/wwdemo.html. |
Kistler, et al.; WebL—a programming language for the Web; Computer Networks and ISDN Systems; 1998; 14 pgs; http://wwwconference.org/www7/1832/com1832.htm. |
Marshall, et al.; Guided Tours and On-Line Presentations: How Authors Make Existing Hypertext Intelligible for Readers; Hypertext '89 Proceedings; Nov. 1989; 12 pgs. |
Moody; WebPath: Sharable Personalized Guided Web Tours; Lotus Technical Report 98-09; 18 pgs. |
NCSA Mosaic Common Client Interface; National Center for Supercomputing Applications; Mar. 31, 1995; 2 pgs; http://www.soberit.hut.fi/tik-76/95-96/palautukset/rahi/et/cci-spec.html. |
Schuler, et al.; Designing User Interfaces for Hypermedia; ESPRIT Project 6532; HIFI; vol. 1; Oct. 1994; 259 pgs. |
Shipman, et al.; Guided paths through Web-based collections: Design, experiences, and adaptations. J. Am. Soc. Inf. Sci., 51; 2000; 260-272. |
Shipman, III, et al.; Creating Educational Guided Paths over the World-Wide Web; In Proceedings of Ed-Telecom 96; 1996; 6 pgs; Center for the Study of Digital Libraries & Department of Computer Science. Texas A&M University, College Station, TX 77843-3112, USA. |
Smith, et al.; Searching for Images and Videos on the World-Wide Web; Center for Telecommunication Research Technical Report #459-96-25; Aug. 19, 1996; 19 pgs. |
Surfbot 3.0; http://web.archive.org/web/19971211151824/http://www.surflogic.com/sb30menu.html. |
Surflogic LLC, Home of the Surfbot; Mar./Apr. 1997; 1 pg; http://web.archive.org/web/19970613064653/http://www.specter.com/home.html. |
Walden's Paths—About the Name; Nov. 13, 2002; 2 pgs; http://www.csdl.tamu.edu/walden/about-name.html. |
Walden's Paths—An Introduction to Walden's Paths for Teachers; Nov. 13, 2002; 3 pgs; http://www.csdl.tamu.edu/walden/walden-intro.html. |
Walden's Paths Project Home Page; Nov. 27, 2002; 3 pgs; http://www.csdl.tamu.edu/walden/. |
WebWatch 1.1 data sheet; 1995-1996; 1 pg; http://web.archive.org/web/19971211162807/http://www.surflogic.com/ww.1.x/datasheet_ww1.html. |
WebWatch 1.1 Frequently Asked Questions; 1995-1996; 2 pgs; http://web.archive.org/web/19980218101324/http://www.surflogic.com/ww.1.x/faq_ww1.html. |
WebWatch 1.1 Online Documentation; 1995-1996; 1 pg; http://web.archive.org/web/19980218101324/http://www.surflogic.com/ww.1.x/faq_ww1.html. |
Zelleweger; Scripted Documents: A Hypermedia Path Mechanism; Hypertext '89; Nov. 5-8, 1989; 12 pgs. |
Hypermedia Navigation LLC v. Yahoo Holdings, Inc; Notice of Motion and Motion to Dismiss Amended Complaint Pursuant to Fed. R. Civ. P. 12(b)(6) for Lack of Patentable Subject Matter Under 35 U.S.C. §101; Memorandum of Points and Authorities in Support Thereof; Case No. 4:17-cv-03188-HSG; United States District Court, Northern District of California; Filed Sep. 12, 2017; 32 pages. |
“Expanding Unidirectional Ring of Pages”, dated Dec. 22, 1994, obtained at the internet address: http://wombat.doc.ic.ac.uk/europa.html, printed Mar. 11, 2004, 2 pages. |
“Get Looped and Get Traffic!”, dated Aug. 21, 1997, obtained at the internet address:http://lists. w3.org/Archives/Public/www-lib/1 997JulSep/00 I 6.html, printed May 29, 2003, 2 pages |
“Targeted EMAG Advertising”, dated Aug. 19, 1997, obtained at the internet address: http://lists.w3.org/Archives/Public/www-lib/1 997JulSep/001 4. html, printed May 29, 2003. |
Hypermedia Navigation LLC V. Yahoo!, Inc.; Notice of Motion and Motion to Dismiss Pursuant to Fed. R. Civ. P. 12(c) for Lack of Patentable Subject Matter Under 35 U.S.C. Section 101; Memorandum of Points and Authorities in Support Thereof; Case No. 4:17-cv-03188-HSG; In the United States District Court, Northern District of California; Filed Jun. 26, 2017; 28 pages. |
IBM Technical Disclosure Bulletin, “Publicly Accessible Web Pages with Restricted Direct Links Access,”vol. 40, No. 1, p. 179-180, Published Jan. 1997, 3 pages. |
Internet Article: “Information Retrieval and Organization”, http://www.haifa.il.ibm.com/241Infor.htm, dated May 18, 1998, 1 page. |
Internet Article: “Organizing documents to support browsing in digital libraries”, http://edfu.lis.uiuc.edu/allterton/95/s4/maarek.html, dated May 18, 1998, 4 pages. |
Internet Article: Java-Based Apps—Mapuccino:, http://www.ibm.com/java/mappucion; dated May 18, 1998, 1 page. |
Marlatt, Andrew, “‘Web Rings’ Emerge as Alternative to Search Engines”, dated Oct. 20, 1997, obtained at the internet address: http;//uhoh.org/internet.sub.--dot.sub.--com.sub.-19971020.htm, printed Mar. 11, 2004, 3 pages. |
McKean, Maureen, Web Rings: Raising the Bar on Web Searches, dated 1997, obtained at the internet address: http:/lwebserver.cpg.comlfeatures/fl12.11l, printed May 22, 2003, 3 pages. |
Tim Oren, Gitta Salomon, Kristee Kreitman and Abbe Don, Publication entitled:Guides: Characterizing the Interface; pp. 1-9; Believed to have been published before Oct. 6, 1998, 5 pages. |
Wall Street Journal Article, “A Guide to the Web”, May 28, 1998, p. B7, 1 page. |
Shipman et al., Using Networked Information to Create Educational Guided Paths, Int'l Journal Educ. Telecomms. (Jul. 1997) (“Guided Paths”). |
Furuta et al., Hypertext Paths and the World-Wide Web: Experiences with Walden's Paths, Association for Computing Machinery—Hypertext 97 (Jul. 1997) (“Hypertext Paths”). |
Shipman et al., Generating Web-Based Presentations in Spatial Hypertext, Association for Computing Machinery—Intelligent User Interfaces (Jan. 1997) (“Web-Based Presentations”). |
Number | Date | Country | |
---|---|---|---|
20180095717 A1 | Apr 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15681714 | Aug 2017 | US |
Child | 15832482 | US | |
Parent | 14728576 | Jun 2015 | US |
Child | 15681714 | US | |
Parent | 13552282 | Jul 2012 | US |
Child | 14728576 | US | |
Parent | 13116421 | May 2011 | US |
Child | 13552282 | US | |
Parent | 12426428 | Apr 2009 | US |
Child | 13116421 | US | |
Parent | 11784305 | Apr 2007 | US |
Child | 12426428 | US | |
Parent | 10884187 | Jul 2004 | US |
Child | 11784305 | US | |
Parent | 09964104 | Sep 2001 | US |
Child | 10884187 | US | |
Parent | 09680899 | Oct 2000 | US |
Child | 09964104 | US | |
Parent | 09167514 | Oct 1998 | US |
Child | 09680899 | US |