The present invention relates to navigation systems, and more particularly to a system and method for selecting and presenting multiple routes to a user obtained from the user's peers.
The use of navigation systems to provide users with routes from one point to another point, such as those used in automobiles and mapping websites, is widespread. The use of navigation systems on cell phones and PDAs is one of the fastest growth application segments. Navigation systems are also available that are capable of calculating the shortest route for the user. Some navigation systems allow the user to specify route parameters like “avoid highways” and then present the user with a route that avoids highways.
Most navigation systems use static information, such as maps, to generate route and direction information. However, techniques are emerging for incorporating dynamic data into routing. For example, an article entitled “Car Pooling With GIS Map Server and Web Services,” by Muzaffer Dogru, Department of Information Technology, University of Zurich, Switzerland, Aug. 6, 2004, describes an approach by which “demanders” (people who need a ride to go somewhere) can be matched with “offerers” (people who are able to offer a ride). The demanders and offerers can specify not only the end points of their routes but also via locations, which are locations that each person will pass through along their routes. The purpose is to combine multiple routes from different offerers to enable a demander to travel from one point to another through some desired via locations. The end points and via locations of the demander can be thought of as specifying a route. A match occurs even if one or more offerers will be traveling in a synchronized manner across those via locations so that the demander could hitch a ride with them from point to point.
Although the approach taken by Dogru is an intriguing one, one disadvantage is that Dogru's approach may fail to meet the needs of some users. That is, rather than hitching rides with others to get from one point to another, users may rather know which of a number of proposed routes to get from one point to another they should seriously consider based on the routes of others. Using Dogru's approach, only the future or proposed routes of the offerers would be available for use in such an analysis. An unintended consequence of this approach is that it may compromise the offerers' privacy since their current plans may be revealed to others. In addition, it would be desirable to reinforce which routes the user should take based on long-term past historical data, rather than proposed or future route data.
A method and system are provided for selecting and presenting a route to a user. An exemplary embodiment includes storing a plurality of associations, each association between a route taken by a user and characteristics of the user. Received from a particular user is a request for at least one recommended route to a destination point. A query is formulated based on user specified parameters, including an origination point, the destination point, and a safety characteristic, to obtain the at least one recommended route. A plurality of routes, including routes from stored plurality of associations, is retrieved based on a safety characteristic of the routes and related to at least one of the origination point and the destination point is retrieved. At least one recommended route is recommended to the particular user based on at least one of the retrieved routes that most closely matches the user specified parameters.
According to the method and system disclosed herein, the user can determine what routes other people in their peer group have taken to get from one place to another.
The present invention relates to selecting and presenting a route to a user. The following description is presented to enable one of ordinary skill in the art to make and use the invention and is provided in the context of a patent application and its requirements. Various modifications to the preferred embodiments and the generic principles and features described herein will be readily apparent to those skilled in the art. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features described herein.
Users of navigation systems are able to obtain one or more proposed routes from service providers. However, many times, what users really want to know are the routes that other people similar to themselves or similarly situated to themselves are actually taking to get from one place to another. For example, consider the following scenario. Imagine a person is going to a basketball game. The person queries a navigation system and the system provides the person with the shortest route. However, there are several routes that may be taken of getting to the stadium. The person knows some of their friends take a route that takes them right to the parking lot. What the person wishes he or she knew at that moment is what routes that other people who are going to the game are taking or the routes that people usually take to go to the stadium. The person may also like to know in relative terms how many people take each of those routes and the types of people that take those routes.
Accordingly, a system and method are described whereby a user can request the routes that peers, identified using characteristics of the users, have taken to go from one point to another. The method comprises storing the routes that users have taken in the past, formulating queries to determine which peer to obtain routes from, aggregating the routes collected from peers in response to the query, and presenting the best routes to the user based on the routes collected from peers.
In block 52, a request from a particular user is received for at least one recommended route from an origination point to a destination point. In block 54, a query is formulated based on user specified parameters to obtain routes taken by other users, where the specified parameters include the origination point, the destination point and characteristics of other users. In block 56, a plurality of the stored routes taken by other users having at least some of the characteristics of other users and related to at least one of the origin and destination are retrieved in response to the query. In block 58, at least one recommended route is presented to the user using at least one of the received routes that most closely matches the specified parameters.
According to the exemplary embodiment, the characteristics of other users specified by the user are used to filter the number of potential other users that have traveled between the origin and destination so that the routes are only obtained from users in a particular peer group. For example, people are often puzzled about which of a number of possible routes they should consider seriously. The motivations can be as simple as knowing what others are doing to have a feeling of comfort about one's decision in favor or against a particular route. Often, underlying these are some specific motivations. For example, some useful characteristics may be naturally associated with several different proposed routes, including the total number of people that have taken each route; the number of people that have taken each route the user knows personally; and the number of people in the user's peer group that have taken the routes. The user may specify the characteristics of other users of a particular peer group by specifying demographic parameter values in a demographic profile, which may include parameters such as name, address, sex, age, driving experience, number of children, schools the children attend, and the like. For example, a school parent may wish to know what routes other parents choose to drop or pick up their children from a particular school. Along the same lines, a women may feel more comfortable knowing what routes have been taken by other women, especially their friends. Likewise, other groups—such as men, or older drivers, or beginning drivers—may prefer routes based on their own characteristics or demographic profile. The underlying motivation would be that it improves the odds of a selected route having some relevant attribute that would appeal to them.
Besides the characteristics or demographic profile of other users, the user may formulate queries to obtain a recommended route based on parameters of the routes themselves such as the following:
Referring to
Each of the navigation devices 102 includes a user interface (not shown) for receiving data indicating an origination point and destination point. The origination point and destination point may be input by the user prior to recording a route traveled by the user, or for querying the navigation device 102 for recommended routes between origination and destination points. Each user of the navigation devices 102 may also enter data specifying a group of users with whom the user's routes may be shared and for whom the routes may be requested. The group of users specified by each user may be stored in a buddy list. Each user of the navigation devices 102 may also enter data specifying the user's own demographic profile. Each user's buddy list, user characteristics, and/or demographic profile are uploaded to the server 104 and stored in a buddy list and user characteristic/demographic profile database 116 for all users. During travel of each user, the respective navigation devices 102 may record the routes traveled by the users using the position module 114, the position service 108, and the map service 110, as described below. The recorded route is then uploaded to the server 104 and stored in a user route database 118 for all users. When requesting a recommended route, a user of the navigation device 102 enters the desired origination point and the destination point, any desirable characteristics of the requested route, and any characteristics of the target peer group. The request and the user characteristics are then uploaded to the server 104. A routing module 120 on the server 104 is configured to select and present desirable routes to the user.
Referring to
In block 202, the server 104 receives recorded routes transmitted from the navigation devices 102 and stores the recorded routes in the user routes database 118 in association with the user who submitted the record route. In an exemplary embodiment, the position module 114 uses data from position service 108 and the map service 110 to record turns made on a street map as the navigation device 102 moves around. For frequent origination and destination points, the sequence of typical turns is thus recorded. In the preferred embodiment, the routes may be stored as a table of the format shown in
Referring again to
In block 206, the server 104 generates one or more candidate routes from the origination point to the destination point using conventional route solution techniques. In block 208, the server 104 uses the characteristics specified by the user to filter which set of user's should be queried for their routes. Since the routes that may be selected in response to the user's request may be selected from a potentially large set, the exemplary embodiment uses request characteristics, such as the demographic parameters, as a basis for making the appropriate selection of routes and reducing the potentially large number of retrieved routes.
In block 210, the server's routing module 120 retrieves a list of users from the buddy list and demographic profile database 116 that match the specified characteristics of the user's request. In block 212, the routing module 120 generates an origin region around the origination point and generates a destination region around the destination point, and queries the route database 118 for the routes of the filtered set of users having at least either a beginning segment falling within the origin region or an ending segment falling within the destination region. Alternatively, the query may request routes having intermediate segments that pass through the origin region and the destination region.
In block 214, the routing module 120 retrieves the stored routes that match the query. In block 216, the routing module 120 assigns weights to the generated candidate routes based in part on how much the retrieved routes overlap the candidate routes. In one embodiment, the weight assigned to the generated candidate routes is proportional to the distance at least one of the retrieved routes overlaps the candidate route. In a second embodiment, the weight assigned to each generated candidate route is proportional to a number of street segments of one of the retrieved routes overlaps the candidate route.
Referring again to
In the example shown, the candidate route #2 is weighted because some of the segments of retrieved routes #2 and #3 overlap with the segments of candidate route #2. Because the segments of candidate route #1 are not overlapped by any retrieved routes, candidate route #1 is not weighted, and candidate route #2 is selected and presented to the user.
In a preferred embodiment, the query to retrieve a set of routes from the route database may be formulated as follows. First, a radius r is calculated based on a predetermined percentage of a distance between the origination point 250 and the destination point 252. In one embodiment, 0.1 of the distance between the origination point 250 and the destination point 252 may be used, for example. Next, the origin region 254 is calculated by generating a circle centered around the origination point 250 having the radius r. Similarly the destination region 256 is calculated by generating a circle centered around the destination point 252 having the radius r.
Next, arcs 258 and 260 that cut the origin and destination regions 254 and 256 are created having radii centered on the opposite point. That is, the arc 258 cutting the origin region 254 is centered at the destination point 252, and the arc 260 cutting the destination region 256 is centered at the origination point 250. To create the arcs, a radius R is determined that has a length close to, but less than the distance from the origination point 250 to the destination point 252 (referred to as the OD distance). For example, R may be set equal to the OD distance minus r/2, where r is as above 0.1 of the OD distance. The arc 258 of radius R is drawn through the origin region 254 centered at the destination point 252. The arc 260 of radius is drawn the R through the destination region 256 centered at the origination point 250.
When the OD distance is large, the routing module 120 may retrieve the routes that have at least an ending segment falling in the origin region 254 or an ending segment falling in the destination region 256, including reverse routes. When the OD distance is small, the routing module 120 may retrieve the routes that have at least an ending segment falling within the region bounded by the origin region 254 and the arc 258, or an ending segment falling with the region bounded by the destination region 256 and the arc 260.
In block 304, the routing module 120′ receives a request from the user for a recommendation of a route from an origination point to a destination point. In block 306, the routing module 120′ generates one or more candidate routes from the origination point to the destination point using conventional route solution techniques. In block 308, the routing module 120′ uses the characteristics specified by the user to filter which set of other user's navigation devices should be queried for their routes.
Referring now to
In block 314, user 2's navigation device generates an origin region around the origin point and a destination region around the destination point. This step may also include verifying that the request comes from a user who is a member of user 2's buddy list. Alternatively, block 314 may be performed by user 1's device.
In block 316, the routing module 120′ of user 2's device retrieves from its route database 118′ the stored routes that have either a beginning segment falling within the origin region or in ending segment falling within the destination region. Alternatively, the query may request routes having intermediate segments that pass through the origin region and the destination region. In block 318, the routing module 120′ returns the retrieved routes to user 1's navigation device.
In block 320, the routing module 120′ of user 1's device assigns weights to the generated candidate routes based in part on how much the returned routes overlap the candidate routes. In block 322, the routing module 120′ selects one or more of the candidate routes having the highest assigned weights and presents the selected routes to the requesting user.
A method and system for selecting and presenting multiple routes to the user obtained from the user's peers has been disclosed. The present invention has been described in accordance with the embodiments shown, and one of ordinary skill in the art will readily recognize that there could be variations to the embodiments, and any variations would be within the spirit and scope of the present invention. Accordingly, many modifications may be made by one of ordinary skill in the art without departing from the spirit and scope of the appended claims.
This application is a continuation of co-pending U.S. patent application Ser. No. 13/179,909, filed Jul. 11, 2011, titled “System and Method for Selecting and Presenting a Route to a User,” which is a continuation of U.S. patent application Ser. No. 12/714,807, filed Mar. 1, 2010, titled “System and Method for Selecting and Presenting a Route to a User,” (now U.S. Pat. No. 7,991,544), which is a continuation of U.S. patent application Ser. No. 11/234,464, filed Sep. 23, 2005, titled “System and Method for Selecting and Presenting a Route to a User,” (now U.S. Pat. No. 7,698,061), which are commonly owned with this application and are herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5177685 | Davis et al. | Jan 1993 | A |
5220507 | Kirson | Jun 1993 | A |
5371678 | Nomura | Dec 1994 | A |
5452212 | Yokoyama | Sep 1995 | A |
5493692 | Theimer et al. | Feb 1996 | A |
5519608 | Kupiec | May 1996 | A |
5528501 | Hanson | Jun 1996 | A |
5659476 | LeFebvre et al. | Aug 1997 | A |
5682525 | Bouve et al. | Oct 1997 | A |
5696962 | Kupiec | Dec 1997 | A |
5729457 | Seymour | Mar 1998 | A |
5734721 | Clark | Mar 1998 | A |
5748148 | Heiser et al. | May 1998 | A |
5754939 | Herz et al. | May 1998 | A |
5790976 | Boll et al. | Aug 1998 | A |
5796727 | Harrison et al. | Aug 1998 | A |
5802492 | DeLorme et al. | Sep 1998 | A |
5812134 | Pooser et al. | Sep 1998 | A |
5848373 | DeLorme | Dec 1998 | A |
5903901 | Kawakura et al. | May 1999 | A |
5949776 | Mahany et al. | Sep 1999 | A |
6014090 | Rosen et al. | Jan 2000 | A |
6041311 | Chislenko et al. | Mar 2000 | A |
6049711 | Ben-Yehezkel et al. | Apr 2000 | A |
6067499 | Yagyu et al. | May 2000 | A |
6072409 | Fushimi et al. | Jun 2000 | A |
6088717 | Reed et al. | Jul 2000 | A |
6098015 | Nimura et al. | Aug 2000 | A |
6161149 | Achacoso et al. | Dec 2000 | A |
6179252 | Roop et al. | Jan 2001 | B1 |
6199014 | Walker et al. | Mar 2001 | B1 |
6209111 | Kadyk et al. | Mar 2001 | B1 |
6212474 | Fowler et al. | Apr 2001 | B1 |
6249742 | Friederich | Jun 2001 | B1 |
6278941 | Yokoyama | Aug 2001 | B1 |
6282492 | Gorai et al. | Aug 2001 | B1 |
6285950 | Tanimoto | Sep 2001 | B1 |
6324467 | Machii et al. | Nov 2001 | B1 |
6334086 | Park et al. | Dec 2001 | B1 |
6349203 | Asaoka et al. | Feb 2002 | B1 |
6359896 | Baker et al. | Mar 2002 | B1 |
6363392 | Halstead et al. | Mar 2002 | B1 |
6385602 | Tso et al. | May 2002 | B1 |
6408301 | Patton et al. | Jun 2002 | B1 |
6415226 | Kozak | Jul 2002 | B1 |
6434579 | Shaffer et al. | Aug 2002 | B1 |
6477526 | Hayashi et al. | Nov 2002 | B2 |
6480783 | Myr | Nov 2002 | B1 |
6484092 | Seibel | Nov 2002 | B2 |
6502102 | Haswell et al. | Dec 2002 | B1 |
6505118 | Chowanic | Jan 2003 | B2 |
6523046 | Liu et al. | Feb 2003 | B2 |
6526349 | Bullock et al. | Feb 2003 | B2 |
6535868 | Galeazzi et al. | Mar 2003 | B1 |
6539080 | Bruce et al. | Mar 2003 | B1 |
6542749 | Tanaka et al. | Apr 2003 | B2 |
6549768 | Fraccaroli | Apr 2003 | B1 |
6567743 | Mueller et al. | May 2003 | B1 |
6577949 | Robinson et al. | Jun 2003 | B1 |
6611754 | Klein | Aug 2003 | B2 |
6618593 | Drutman et al. | Sep 2003 | B1 |
6629100 | Morris et al. | Sep 2003 | B2 |
6629104 | Parulski et al. | Sep 2003 | B1 |
6633812 | Martin et al. | Oct 2003 | B1 |
6654681 | Kiendl et al. | Nov 2003 | B1 |
6662105 | Tada et al. | Dec 2003 | B1 |
6675015 | Martini et al. | Jan 2004 | B1 |
6675268 | DeKoning et al. | Jan 2004 | B1 |
6681108 | Terry et al. | Jan 2004 | B1 |
6704118 | Hull et al. | Mar 2004 | B1 |
6708186 | Claborn et al. | Mar 2004 | B1 |
6721650 | Fushiki et al. | Apr 2004 | B2 |
6721653 | Watanabe | Apr 2004 | B2 |
6721747 | Lipkin | Apr 2004 | B2 |
6735583 | Bjarnestam | May 2004 | B1 |
6757684 | Svendsen et al. | Jun 2004 | B2 |
6762696 | Hulverscheidt et al. | Jul 2004 | B2 |
6765998 | Bruce et al. | Jul 2004 | B2 |
6778903 | Robinson et al. | Aug 2004 | B2 |
6810323 | Bullock et al. | Oct 2004 | B1 |
6813502 | Son et al. | Nov 2004 | B2 |
6820081 | Kawai et al. | Nov 2004 | B1 |
6853841 | St. Pierre | Feb 2005 | B1 |
6876642 | Adams et al. | Apr 2005 | B1 |
6895329 | Wolfson | May 2005 | B1 |
6920455 | Weschler | Jul 2005 | B1 |
6937860 | Jahn | Aug 2005 | B2 |
6947571 | Rhoads et al. | Sep 2005 | B1 |
6954443 | Forstadius et al. | Oct 2005 | B2 |
6961562 | Ross | Nov 2005 | B2 |
6961658 | Ohler | Nov 2005 | B2 |
6963900 | Boyd | Nov 2005 | B2 |
6970703 | Fuchs et al. | Nov 2005 | B2 |
6975266 | Abraham et al. | Dec 2005 | B2 |
6990497 | O'Rourke et al. | Jan 2006 | B2 |
6999783 | Toyryla et al. | Feb 2006 | B2 |
7010424 | Zhao | Mar 2006 | B2 |
7020710 | Weber et al. | Mar 2006 | B2 |
7027773 | McMillin | Apr 2006 | B1 |
7035618 | Schnurr | Apr 2006 | B2 |
7035912 | Arteaga | Apr 2006 | B2 |
7047315 | Srivastava | May 2006 | B1 |
7085571 | Kalhan et al. | Aug 2006 | B2 |
7096233 | Mori et al. | Aug 2006 | B2 |
7110592 | Kotake et al. | Sep 2006 | B2 |
7123189 | Lalik et al. | Oct 2006 | B2 |
7130740 | Vanegas et al. | Oct 2006 | B2 |
7134040 | Ayres | Nov 2006 | B2 |
7149625 | Mathews et al. | Dec 2006 | B2 |
7157997 | Ohkubo | Jan 2007 | B2 |
7158876 | Crook | Jan 2007 | B2 |
7171018 | Rhoads et al. | Jan 2007 | B2 |
7203753 | Yeager et al. | Apr 2007 | B2 |
7206568 | Sudit | Apr 2007 | B2 |
7218611 | Mimura et al. | May 2007 | B2 |
7231293 | Lapstun et al. | Jun 2007 | B2 |
7236799 | Wilson et al. | Jun 2007 | B2 |
7240106 | Cochran et al. | Jul 2007 | B2 |
7243134 | Bruner et al. | Jul 2007 | B2 |
7248841 | Agee et al. | Jul 2007 | B2 |
7249367 | Bove, Jr. et al. | Jul 2007 | B2 |
7260638 | Crosbie | Aug 2007 | B2 |
7269854 | Simmons et al. | Sep 2007 | B2 |
7271742 | Sheha | Sep 2007 | B2 |
7283628 | Stein et al. | Oct 2007 | B2 |
7319379 | Melvin | Jan 2008 | B1 |
7333820 | Sheha et al. | Feb 2008 | B2 |
7333889 | Hashizume | Feb 2008 | B2 |
7340768 | Rosenberger | Mar 2008 | B2 |
7343160 | Morton | Mar 2008 | B2 |
7359894 | Liebman et al. | Apr 2008 | B1 |
7373109 | Pohja et al. | May 2008 | B2 |
7392130 | Rosen | Jun 2008 | B1 |
7412325 | Tannenbaum et al. | Aug 2008 | B1 |
7424363 | Cheng et al. | Sep 2008 | B2 |
7512702 | Srivastava et al. | Mar 2009 | B1 |
7516212 | Nguyen et al. | Apr 2009 | B2 |
7538691 | Horstemeyer | May 2009 | B2 |
7590486 | Okude et al. | Sep 2009 | B2 |
7593809 | Rosen | Sep 2009 | B2 |
7600189 | Fujisawa | Oct 2009 | B2 |
7617542 | Vataja | Nov 2009 | B2 |
7624024 | Levis et al. | Nov 2009 | B2 |
7630986 | Herz et al. | Dec 2009 | B1 |
7668832 | Yeh et al. | Feb 2010 | B2 |
7676585 | Francke et al. | Mar 2010 | B1 |
7684815 | Counts et al. | Mar 2010 | B2 |
7692684 | Ku et al. | Apr 2010 | B2 |
7698061 | Singh | Apr 2010 | B2 |
7706280 | Raciborski et al. | Apr 2010 | B2 |
7725472 | Uchiyama | May 2010 | B2 |
7729947 | Philbin et al. | Jun 2010 | B1 |
7809500 | Couckuyt et al. | Oct 2010 | B2 |
7818394 | Lawler et al. | Oct 2010 | B1 |
7881945 | Schmitt | Feb 2011 | B2 |
7908080 | Rowley | Mar 2011 | B2 |
7908254 | Suermondt et al. | Mar 2011 | B2 |
7912642 | Zhao et al. | Mar 2011 | B2 |
8019692 | Rosen | Sep 2011 | B2 |
8375008 | Gomes | Feb 2013 | B1 |
8473729 | Trethewey et al. | Jun 2013 | B2 |
20010019309 | Saeki et al. | Sep 2001 | A1 |
20010029182 | McCann et al. | Oct 2001 | A1 |
20010029425 | Myr | Oct 2001 | A1 |
20010039659 | Simmons et al. | Nov 2001 | A1 |
20010044310 | Lincke | Nov 2001 | A1 |
20010047241 | Khavakh et al. | Nov 2001 | A1 |
20010048449 | Baker | Dec 2001 | A1 |
20010056325 | Pu et al. | Dec 2001 | A1 |
20020051540 | Glick et al. | May 2002 | A1 |
20020069192 | Aegerter | Jun 2002 | A1 |
20020086659 | Lauper | Jul 2002 | A1 |
20020099737 | Porter et al. | Jul 2002 | A1 |
20020120396 | Boies et al. | Aug 2002 | A1 |
20020128773 | Chowanic et al. | Sep 2002 | A1 |
20020152020 | Seibel | Oct 2002 | A1 |
20020156572 | Bullock et al. | Oct 2002 | A1 |
20020184377 | Flavin | Dec 2002 | A1 |
20030014397 | Chau et al. | Jan 2003 | A1 |
20030018607 | Lennon et al. | Jan 2003 | A1 |
20030022675 | Mergler | Jan 2003 | A1 |
20030023578 | Durand et al. | Jan 2003 | A1 |
20030050062 | Chen et al. | Mar 2003 | A1 |
20030055558 | Watanabe et al. | Mar 2003 | A1 |
20030065663 | Chu | Apr 2003 | A1 |
20030065721 | Roskind | Apr 2003 | A1 |
20030105585 | Ukita | Jun 2003 | A1 |
20030109985 | Kotzin | Jun 2003 | A1 |
20030126100 | Chithambaram | Jul 2003 | A1 |
20030126212 | Morris | Jul 2003 | A1 |
20030135608 | Bodin et al. | Jul 2003 | A1 |
20030144794 | Schuessler | Jul 2003 | A1 |
20030163333 | Podgurny et al. | Aug 2003 | A1 |
20030182052 | DeLorme et al. | Sep 2003 | A1 |
20030191584 | Robinson et al. | Oct 2003 | A1 |
20030195808 | Brown et al. | Oct 2003 | A1 |
20030227479 | Mizrahi et al. | Dec 2003 | A1 |
20030229549 | Wolinsky et al. | Dec 2003 | A1 |
20030236095 | Ross | Dec 2003 | A1 |
20040024912 | Fukao et al. | Feb 2004 | A1 |
20040103280 | Balfanz et al. | May 2004 | A1 |
20040106415 | Maeda et al. | Jun 2004 | A1 |
20040107219 | Rosenberger | Jun 2004 | A1 |
20040117110 | Sasajima | Jun 2004 | A1 |
20040148393 | Breiter et al. | Jul 2004 | A1 |
20040158393 | Oonishi et al. | Aug 2004 | A1 |
20040158565 | Kakuta et al. | Aug 2004 | A1 |
20040160307 | Saikkonen et al. | Aug 2004 | A1 |
20040172191 | Vitikainen | Sep 2004 | A1 |
20040186661 | Barton | Sep 2004 | A1 |
20040192339 | Wilson et al. | Sep 2004 | A1 |
20040193902 | Vogler et al. | Sep 2004 | A1 |
20040196163 | Takenaga et al. | Oct 2004 | A1 |
20040203902 | Wilson et al. | Oct 2004 | A1 |
20040203903 | Wilson et al. | Oct 2004 | A1 |
20040224702 | Chaskar | Nov 2004 | A1 |
20040225436 | Yoshihashi | Nov 2004 | A1 |
20040225519 | Martin | Nov 2004 | A1 |
20050015197 | Ohtsuji et al. | Jan 2005 | A1 |
20050015800 | Holcomb | Jan 2005 | A1 |
20050021369 | Cohen et al. | Jan 2005 | A1 |
20050025320 | Barry | Feb 2005 | A1 |
20050033780 | Simelius et al. | Feb 2005 | A1 |
20050050027 | Yeh et al. | Mar 2005 | A1 |
20050055450 | Gang | Mar 2005 | A1 |
20050059379 | Sovio et al. | Mar 2005 | A1 |
20050060350 | Baum et al. | Mar 2005 | A1 |
20050064864 | Horton et al. | Mar 2005 | A1 |
20050071221 | Selby | Mar 2005 | A1 |
20050080556 | Toelle | Apr 2005 | A1 |
20050096840 | Simske | May 2005 | A1 |
20050102098 | Montealegre et al. | May 2005 | A1 |
20050102101 | Beesley et al. | May 2005 | A1 |
20050131628 | Peeters | Jun 2005 | A1 |
20050144483 | Robertson | Jun 2005 | A1 |
20050160270 | Goldberg et al. | Jul 2005 | A1 |
20050176406 | Krishnakumar et al. | Aug 2005 | A1 |
20050192742 | Okochi | Sep 2005 | A1 |
20050197846 | Pezaris et al. | Sep 2005 | A1 |
20050209773 | Hara | Sep 2005 | A1 |
20050221841 | Piccionelli et al. | Oct 2005 | A1 |
20050222764 | Uyeki | Oct 2005 | A1 |
20050245233 | Anderson | Nov 2005 | A1 |
20050246095 | Banet et al. | Nov 2005 | A1 |
20050251453 | Lu | Nov 2005 | A1 |
20050251565 | Weel | Nov 2005 | A1 |
20050251566 | Weel | Nov 2005 | A1 |
20050251576 | Weel | Nov 2005 | A1 |
20050251807 | Weel | Nov 2005 | A1 |
20050256635 | Gardner | Nov 2005 | A1 |
20050273250 | Hamilton | Dec 2005 | A1 |
20050278371 | Funk et al. | Dec 2005 | A1 |
20050288859 | Golding | Dec 2005 | A1 |
20060004512 | Herbst et al. | Jan 2006 | A1 |
20060004631 | Roberts et al. | Jan 2006 | A1 |
20060009907 | Kuroda et al. | Jan 2006 | A1 |
20060029040 | Sherman et al. | Feb 2006 | A1 |
20060031007 | Agnew et al. | Feb 2006 | A1 |
20060036363 | Crook | Feb 2006 | A1 |
20060046709 | Krumm et al. | Mar 2006 | A1 |
20060046740 | Johnson | Mar 2006 | A1 |
20060047568 | Eisenberg et al. | Mar 2006 | A1 |
20060069500 | Hashizume | Mar 2006 | A1 |
20060069503 | Suomela et al. | Mar 2006 | A1 |
20060080029 | Kodani et al. | Apr 2006 | A1 |
20060080034 | Hayashi | Apr 2006 | A1 |
20060082472 | Adachi et al. | Apr 2006 | A1 |
20060085419 | Rosen | Apr 2006 | A1 |
20060085821 | Simmons et al. | Apr 2006 | A9 |
20060112067 | Morris | May 2006 | A1 |
20060112141 | Morris | May 2006 | A1 |
20060149461 | Rowley et al. | Jul 2006 | A1 |
20060149628 | Chefalas et al. | Jul 2006 | A1 |
20060149631 | Brazell et al. | Jul 2006 | A1 |
20060161599 | Rosen | Jul 2006 | A1 |
20060168264 | Baba et al. | Jul 2006 | A1 |
20060184313 | Butler | Aug 2006 | A1 |
20060187028 | Kiang et al. | Aug 2006 | A1 |
20060203804 | Whitmore et al. | Sep 2006 | A1 |
20060217879 | Ikeuchi et al. | Sep 2006 | A1 |
20060218153 | Voon et al. | Sep 2006 | A1 |
20060218225 | Hee Voon et al. | Sep 2006 | A1 |
20060223518 | Haney | Oct 2006 | A1 |
20060229802 | Vertelney et al. | Oct 2006 | A1 |
20060229939 | Bhakta et al. | Oct 2006 | A1 |
20060240856 | Counts et al. | Oct 2006 | A1 |
20060242291 | Nevalainen | Oct 2006 | A1 |
20060247852 | Kortge et al. | Nov 2006 | A1 |
20060256008 | Rosenberg | Nov 2006 | A1 |
20060265119 | McMahan et al. | Nov 2006 | A1 |
20060287766 | Kraft | Dec 2006 | A1 |
20060287813 | Quigley | Dec 2006 | A1 |
20060287815 | Gluck | Dec 2006 | A1 |
20060287915 | Boulet et al. | Dec 2006 | A1 |
20060288074 | Rosenberg | Dec 2006 | A1 |
20070032942 | Thota | Feb 2007 | A1 |
20070050129 | Salmre | Mar 2007 | A1 |
20070121843 | Atazky et al. | May 2007 | A1 |
20070124157 | Laumeyer et al. | May 2007 | A1 |
20070168254 | Steelberg et al. | Jul 2007 | A1 |
20070168888 | Jawerth | Jul 2007 | A1 |
20070180496 | Fransdonk | Aug 2007 | A1 |
20070202844 | Wilson et al. | Aug 2007 | A1 |
20070244633 | Phillips et al. | Oct 2007 | A1 |
20070260508 | Barry et al. | Nov 2007 | A1 |
20080004043 | Wilson et al. | Jan 2008 | A1 |
20080048856 | Culpepper et al. | Feb 2008 | A1 |
20080120021 | Kaneda | May 2008 | A1 |
20080133759 | Weel | Jun 2008 | A1 |
20080184317 | Khedouri et al. | Jul 2008 | A1 |
20080188246 | Sheha et al. | Aug 2008 | A1 |
20080319808 | Wofford et al. | Dec 2008 | A1 |
20090196302 | Pastorino et al. | Aug 2009 | A1 |
20090276500 | Karmarkar | Nov 2009 | A1 |
20100027527 | Higgins et al. | Feb 2010 | A1 |
20100211868 | Karmarkar et al. | Aug 2010 | A1 |
20110004840 | Feinberg et al. | Jan 2011 | A1 |
Number | Date | Country |
---|---|---|
09-287970 | Apr 1997 | JP |
2000201170 | Jul 2000 | JP |
2001082974 | Mar 2001 | JP |
2004118853 | Apr 2004 | JP |
2004205443 | Jul 2004 | JP |
WO 0131964 | May 2001 | WO |
WO 0139506 | May 2001 | WO |
WO 0146781 | Jun 2001 | WO |
WO 0158165 | Aug 2001 | WO |
WO 0211407 | Feb 2002 | WO |
WO 2003081391 | Oct 2003 | WO |
Entry |
---|
“3GPP,” Wikipedia, at <http://en.wikipedia.org/wiki/3GPP>, as revised Mar. 27, 2008, printed Dec. 12, 2011, 1 page. |
“4G,” Wikipedia, at <htpp://en.wikipedia.org/wiki4G>, as revised Apr. 23, 2008, printed Dec. 12, 2011, 1 page. |
Abstract, Tanaka, K. et al., “A destination prediction method using driving contexts and trajectory for car navigation systems,” Proc. Of the 2009 ACM symposium on Applied Computing (SAC'09), Mar. 9-12, 2009, Honolulu, Hawaii, pp. 190-195, ACM, New York, New York, 2009, 3 pages. |
“About Google Map Maker,” at <http://sites.google.com/site/mapmakeruserhelp/home>, printed May 21, 2009, 1 page. |
“AirSage's WiSE Technology,” at <http://wvvw.airsage.com/site/index.cfm?id—art=46598&actMenultemID=22134&vsprache/ENAIRSA GE WiSE—TECHNOLOGY L.cfm>, viewed as early as Mar. 22, 2010, company founded in May 2000, 1 page. |
Iannella, R., “An Idiot's Guide to the Resource Description Framework,” The New Review Of Information Networking, vol. 4, Sep. 3, 1998, pp. 1-10. |
Magerkurth, C. et al., “An Intelligent User Service Architecture for Networked Home Environments,” in 2nd International Conference on Intelligent Environments, Jul. 5-6, 2006, Athens, Greece, pp. 361-370, 10 pages. |
“Anthem—Overview,” at <http://www.intercastingcorp.com/platform/anthem>, copyright 2004-2007, Intercasting Corp., printed Jan. 16, 2008, 2 pages. |
“Apple—iPod classic,” at <http://www.apple.com/ipodclassic/>, printed Oct. 26, 2007, 1 page. |
Shaffer, Jeremy, “Architecture, Applications, and Data Analysis of a Wireless Network Location Service,” Thesis Defense presentation, Apr. 11, 2006, Electrical and Computer Engineering Department, Carnegie Mellon University, 37 pages. |
Rhoads, M., “Avoiding Common Traps When Accessing RDBMS Data,” NESUG 2008, Coder's Corner, 11 pages. |
Tayebi, M. A., et al., “B2Rank: An Algorithm for Ranking Blogs Based On Behavioral Features,” 2007 IEEE WIC/ACM International Conference on Web Intelligence, pp. 104-107. |
Lavelle, B. et al., “Bluetooth Familiarity: Methods of Calculation, Applications and Limitations,” Mobile Interaction with the Real World (MIRW 2007), Sep. 9, 2007, Singapore, found at <http://www.medien.ifi.Imu.de/mirw2007/papers/MIRW2007—Lavelle.pdf>, 4 pages. |
“Bluetooth.com—Learn,” http://www.bluetooth.com/Bluetooth/Learn/, copyright 2007 Bluetooth SIG, Inc., printed Oct. 26, 2007, 1 page. |
Dogru, Muzaffer, “Car Pooling With GIS Map Server and Web Services,” Department of Information Technology, University of Zurich, Switzerland, Aug. 6, 2004, pp. 1-83. |
“Club TomTom,” at <http://www.clubtomtom.com/general/get-to-know-tomtom-mapshare%E2%84%A2/>, Jul. 31, 2007, copyright TomTom, printed Mar. 12, 2010, 9 pages. |
Joly, A. et al., “Contextual Recommendation of Social Updates, a Tag-based Framework,” International Conference on Active Media Technology (AMT'10),Toronto, Canada, Aug. 28-30, 2010, found at <http://liris.cnrs.fr/Documents/Liris-4747.pdf>, 12 pages. |
“Creating Custom Properties for Files and Folders,” [online] May 1999 [Retrieved on Mar. 4, 2007] Retrieved from the Internet: <URL: http://www.bc.edu/offices/help/meta-elements/doc/articles/html/MYF-customprops.shtml> 5 pages. |
Demirbas, M. et al., “Crowd-Sourced Sensing and Collaboration Using Twitter,” in Proceedings of WOWMON Symposium, Jun. 14-17, 2010, Montreal, Canada, found at <http://www.cse.buffalo.edu/˜mbayir/papers/crowdsource.pdf>, 9 pages. |
Zahradnik, Fred, “Dash Express is Innovative, but There's Room for Improvement,” at <http://gps.about.com/od/incarportablegp1/fr/dash—review.htm>, from the Internet Archive, dated Nov. 8, 2009, printed Apr. 20, 2012, 3 pages. |
Jain, A. K., “Data Clustering: 50 Years Beyond K-Means,” 19th International Conference on Pattern Recognization (ICPR), Tampa, FL, Dec. 8, 2008, 33 pages. |
“Dating Service—Singles, Personals and Love, Match.com,” http://www.match.com/, copyright 2008 Match.com, printed Jan. 16, 2008, 2 pages. |
Millonig, A. and Schechtner, K., “Developing Landmark-based Pedestrian Navigation Systems,” Proceedings of the 8th International IEEE Conference on Intelligent Transportation Systems, Vienna, Austria, Sep. 13-16, 2005, copyright 2005, IEEE, 6 pages. |
“Digital rights management,” at <http://en.wikipedia.org/wiki/Digital—rights—management>, includes information dating back to 1998, page last modified Apr. 16, 2011, printed Apr. 21, 2011, 21 pages. |
Abstract, Seeburger, J. and Schroeter, R., “Disposable Maps: Ad hoc Location Sharing,” Proceedings of the 21st Annual Conference of the Australian Computer-Human Interaction Special Interest Group: Design: Open 24/7, Nov. 23-27, 2009, Melbourne, Australia, abstract found at <http://www.smartservicescrc.com.au/PDF/P09—042—abstract.pdf>, 1 page. |
Davies, J. J. et al., “Distributed, vehicular computation for map generation,” presentation slides, 2007 Annual Meeting of the Association of American Geographers, Apr. 2007, found at <http://www.cl.cam.ac.uk/research/dtg/www/files/publications/public/jjd27/davies-aag07.pdf>, 21 pages. ♂ |
“dodgeball.com:: mobile social software,” at <http://www.dodgeball.com/>, copyright 2008, Google Inc., printed Jan. 16, 2008, 1 page. |
Abstract, Karp, R. M. and Rabin, M. 0., “Efficient randomized pattern-matching algorithms,” IBM Journal of Research and Development, vol. 31, No. 2, pp. 249-260, Mar. 1987, 1 page. |
“eHarmony,” http://eharmony.com/, copyright 2000-2008 eHarmony.com, printed Jan. 16, 2008, 1 page. |
Muster, Richard T., Captain, USAF, “Exploitation of Geographic Information Systems for Vehicular Destination Prediction,” Masters Thesis, Department of Electrical Engineering and Computer Science, Graduate School of Engineering and Management, Air Force Institute of Technology, Air University, Wright-Patterson Air Force Base, Ohio, Mar. 2009, found at <http://wvvw.dtic.mil/cgi-bin/GetTRDoc?AD=ADA499514>, 205 pages. |
Abstract, Ekpenyong, F., Palmer-Brown, D., and Brimicombe, A., “Extracting road information from recorded GPS data using snap-drift neural network,” Neurocomputing, vol. 73, Issues 1-3, Dec. 2009, pp. 24-36, 6 pages. |
“Fire Eagle,” at <http://fireeagle.yahoo.net>, copyright 2007-2011, Yahoo! Inc., printed Apr. 28, 2011, 2 pages. |
“Fire Eagle: What is Fire Eagle?”, found at <http://fireeagle.yahoo.net/help> on the Internet Archive, dated Jul. 9, 2011, copyright 2007-2011, Yahoo! Inc., printed Nov. 10, 2011, 4 pages. |
“flickr,” http://www.flickr.com/, copyright 2008 Yahoo! Inc., printed Jan. 16, 2008, 1 page. |
“Friendster—Home,” http://www.friendster.com/, copyright 2002-2007 Friendster, Inc., printed Jan. 16, 2008, 1 page. |
“Google AdWords: Regional and Local Targeting,” https://adwords.google.com/select/targeting.html, copyright 2008 Google, printed Jul. 17, 2008, 1 page. |
Shankland, Stephen, “Google crowdsources maps directions, too,” Mar. 11, 2009, at <http://news.cnet.com/8301-17939—109-10193481-2.html>, printed May 21, 2009, 3 pages. |
“Google Talk,” http://www.google.com/talk/, copyright 2008 Google, printed Jan. 16, 2008, 1 page. |
Newman, Jared, “Google's Realtime Search Update Does What Twitter Won't,” PCWorld, Aug. 26, 2010, Retrieved from the internet: http://www.pcworld.com/article/204246/googles—realtime—search—update—does—what—twitter—wont.html. |
Belic, Dusan, “GyPSii launches GyPSii Connect, web-based service for automatic updates of user's status across other social networks,” May 14, 2009, IntoMobile, at <http://www.intomobile.com/2009/05/14/gypsii-launches-gypsii-connect-web-based-service-forautomatic-updates-of-users-status-across-other-social-networks/>, printed Oct. 23, 2009, 7 pages. |
Vihavainen et al., “'I can't lie anymore: The Implications of Location Automation for Mobile Social Applications,” Proceedings of MobiQuitous 2009, Jul. 13-16, 2009, Toronto, Canada, IEEE Press, found at <https://hiit.fi/˜svihavai/vihavainen—oulasvirta—sarvas—mobiquitous09.pdf>, 10 pages. |
“iChat. Not being there is half the fun,” http://www.apple.com/macosx/features/ichat.html, printed Jan. 16, 2008, 1 page. |
“icq,” http://www.icq.com/, copyright 1998-2008 ICQ Inc., printed Jan. 16, 2008, 2 pages. |
Bruntrup, R. et al., “Incremental Map Generation with GPS Traces,” Presentation Slides, University of Dortmund, Germany, 2005, found at <http://www.google.com/url?sa=t&rct=j&q=bruntrup%20incremental%20map%20generation&source=web&cd=2&ved=0CoQFjAB&url=http%3A%2F%2Fmapgeneration.berlios.de%2Ftiki%2Ftiki-download—wiki—attachment.php%3Fattld%3D1&ei-ZruVT—O8J9L16AGV-LGKBA&usg-AFQjCNF4B61uAHpAjtDc46FyNLqw4bgl1A>, 16 pages. |
Bruntrup, R., et al., “Incremental Map Generation with GPS Traces,” in Proc. of the IEEE Conference on Intelligent Transportation Systems, Sep. 13-16, 2005, Vienna, Austria, pp. 574-579, copyright 2005, IEEE, 7 pages. |
“Instant Messenger—AIM—Instant Message Your Online Buddies for Free—AIM,” http://dashboard.aim.com/aim, copyright 2007 AOL LLC, printed Nov. 8, 2007, 6 pages. |
“Intel and ARM collaborate on device security,” Oct. 15, 2007, at <http://www.windowsfordevices.com/news/NS5120676853.html>, copyright 1996-2010, Ziff Davis Enterprise Holdings, Inc., printed Apr. 20, 2012, 5 pages. |
Gratton, Eloise, “Internet and Wireless Privacy—A Legal Guide to Global Business Practices,” copyright 2003, CCH Candian Limited, Canada, portions of pp. 339 and 340, 1 page. |
“Internet Relay Chat—Wikipedia, the free encyclopedia,” http://en.wikipedia.org/wiki/IRC, printed Nov. 16, 2007, 11 pages. |
“IP Multimedia Subsystem,” http://en.wikipedia.org/wiki/IP—Multimedia—Subsystem, printed Jul. 8, 2009, 11 pages. |
“IPv6,” Wikipedia, at <http://en.wikipedia.org/wiki/IPv6>, includes information that dates back to the early 1980s, page last modified Apr. 18, 2011, printed Apr. 21, 2011, 16 pages. |
“Jabber SoftwareFoundation,” http://www.jabber.org/, copyright 1999-2005 the Jabber Software Foundation, printed Jan. 16, 2008, 3 pages. |
Shanahan, Kevin P. and Freedman, Michael J., “Locality Prediction for Oblivious Clients,” In Proc. of the International Workshop on Peer-to-Peer Systems (IPTPS), Feb. 24-25, 2005, Ithaca, New York, found at <http://cs.brown.edu/courses/cs296-2/papers/netmap.pdf>, 6 pages. |
Ardagna, C.A. et al., “Location Privacy Protection Through Obfuscation-based Techniques,” Lecture Notes in Computer Science, 2007, vol. 4602, pp. 47-60, Data and Applications Security XXI, Jul. 811, 2007, Redondo Beach, California, 16 pages. |
“Machine Perception and Learning of Complex Social Systems,” Reality Mining, copyright 2009, Nathan Eagle/Massachusetts Institute of Technology, at <http://reality.media.mit.edu/>, printed Oct. 23, 2009, 1 page. |
Jones, M., “Matt's Wikimapia Blog,” Sep. 15, 2006, at <http://wikimapia.mattjonesblog.com/2006/09/15/how-to-1-adding-a-new-place/>, printed May 21, 2009, 24 pages. |
Amin, Saurabh et al., “Mobile Century—Using GPS Mobile Phones as Traffic Sensors: A Field Experiment,” 15th World Conference on Intelligent Transportation Systems, Nov. 16-20, 2008, New York, New York, available from <http://www.ce.berkeley.edu/˜bayen/conferences/its08.pdf>, 4 pages. |
“mobile community, free sms, mobile dating, text flirting and friends networking—playtxt . . . ,” http://web.archive.org/web/20070225125113rn—1/www.playtxt.net/playtxt.do, printed Jan. 16, 2008, 1 page. |
“Mobile Data Security in Version 8.02: Convenience Versus Confidentiality,” iAnywhere.com pp. 1-12 (2005). |
Choney, Suzanne, “Mobile services mushroom for locating friends,” Aug. 14, 2008, copyright 2008, MSNBC.com, 1 page. |
Woyke, Elizabeth, “Motorola's Secret Weapon,” Jul. 30, 2009, Forbes.com, at <http://www.forbes.com/2009/07/30/motorola-software-smartphones-intelligent-technology-motorola.html>, printed Oct. 23, 2009, 5 pages. |
“Multicast,” Wikipedia, at <http://en.wikipedia.org/wiki/Multicast>, includes information that dates back to 2005, page last modified Mar. 26, 2011, printed Apr. 21, 2011, 5 pages. |
“MySpace,” at <http://www.myspace.com/>, copyright 2003-2008, MySpace.com, printed Jan. 16, 2008, 2 pages. |
Page, X. and Kobsa, A., “Navigating the Social Terrain with Google Latitude,” presented at iConference 2010, Feb. 3-6, 2010, Urbana-Chapmpaign, Illinois, pre-conference paper found at <http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.158.6512&rep=rep1&type=pdf>, 5 pages. |
Priya Ganapati, “Navigation Companies Crowdsource Maps, Traffic Services,” Feb. 11, 2009, at <http://www.wired.com/gadgetlab/2009/02/user-generated/>, printed May 21, 2009, 4 pages. |
“NAVTEQ: The secrets behind Ovi Maps,” at <http://noknok.tv/2009/07/08/navteq-the-secrets-behind-ovi-maps/>, Jul. 8, 2009, copyright 2007-2010, Republic Publishing Ltd, printed Mar. 12, 2010, 6 pages. |
Privat, Ludovic, “NAVX: We provide Content to TomTom, Garmin and Mio,'” GPS Business News, Feb. 2, 2009, at <http://www.gpsbusinessnews.com/NAVX-we-provide-content-to-TomTom,- Garmin-and-Mio-—a1305.html>, printed Apr. 20, 2012, 2 pages. |
“Neatcall—Products,” found at <http://neatcall.com/index.php?dir=site&p.=content&cs=3008> on Internet Archive, dated Mar. 1, 2010, copyright 2010, Neatcall Ltd., printed Oct. 26, 2011, 2 pp. |
“Nested Groups in Crowd,” last edited by Sarah Maddox on Nov. 27, 2008, found at <http://confluence.atlassian.com/display/CROWD/Nested=Groups=in=Crowd>, printed Jun. 8, 2009, 5 pages. |
Bales, Elizabeth, “Noncommand Interfaces for Communication Technology in Mobile Settings,” retrieved on Oct. 25, 2010 at <http://cseweb.ucsd.edu/users/earrowsm/bales.pdf>, 12 pages. |
Raptopolou, K., “On Past-Time Indexing of Moving Objects,” Science Direct, The Journal Of System and Software 79 (2006) published online Dec. 15, 2005, pp. 1079-1091. |
Gruteser, M. and Hoh, B., “On the Anonymity of Periodic Location Samples,” in Proceedings of the Second International Conference on Security in Pervasive Computing, Apr. 6-8, 2005, Boppard, Germany, 16 pages. |
“OpenLDA Software 2.3 Administrator's Guide: Schema Specification,” [online] Jun. 2003 [retrieved on Mar. 4, 2007] Retrieved from the Internet: <URL: http://www.openldap.org/doc/admin23/schema.html> pp. 2-8. |
“OpenStreetMap,” <http://www.openstreetmap.org/>, printed May 21, 2009, 1 page. |
Otlacan, Otilia, “Optimus Works with NewBay to Launch Mobile Social Networking Service,” Nov. 10, 2009, Ad Ops Online, at <http://www.adoperationsonline.com/2009/11/10/optimusworks-with-newbay-to-launch-mo . . . >, printed Mar. 4, 2010, 6 pages. |
Krumm, J. and Horvitz, E., “Predestination: Inferring Destinations from Partial Trajectories,” UbiComp 2006, Sep. 17-21, 2006, Orange County, California, 18 pages. |
Kincaid, Jason, “Quub: A Micromessaging Service That Asks ‘What are you doing?’ And Means It,” TechCrunch, Apr. 27, 2009, at <http://techcrunch.com/2009/04/27/quub-a-micromessaging-service-that-asks-what-are-you-doing-and-means-it/>, 10 pages. |
“Rabble—Social networking for your phone,” http://www.rabble.com/, copyright 2005-2008 Intercasting Corp., printed Jan. 16, 2008, 1 page. |
Skalbeck, R.V., “Re-Hashing the Hash Tag—Crowd Competition and Community Standards,” at the #AALL2009 Conference in LLRX.com. Retrieved Dec. 13, 2012, from http://www.11rx.com/features/twitter.htm. 5 pages. |
Davies, J. J. et al., “Scalable, Distributed, Real-Time Map Generation,” Pervasive Computing, vol. 5, No. 4, Oct.-Dec. 2006, pp. 47-54, copyright 2006, IEEE, 9 pages. |
Abstract, Rahman, A. et al., “SenseFace: A Sensor Network Overlay for Social Networks,” I2MTC 2009, International Instrumentation and Measurement Technology Conference, Singapore, May 5-7, 2009, IEEE, abstract found at <http://ieeexplore.ieee.org/xpl/freeabs—all.jsp?arnumber=5168605>, 1 page. |
“Session Initiation Protocol,” Wikipedia, at <http://en.wikipedia.org/wiki/Session—Initiation—Protocol>, from the Internet Archive, dated Dec. 17, 2008, last modified Dec. 11, 2008, printed May 30, 2012, 6 pages. |
“SmallPlanet: Home,” http://web.archive.org/web/20061105030323/http://www.smallplanet.net/, copyright 2005 SmallPlanet.net, printed Jan. 16, 2008, 1 page. |
“So What is 8Hands?,” at <http://www.8hands.com/>, copyright 2006-2007, 8hands, printed Mar. 4, 2010, 2 pages. |
“Technology—Geo Targeting,” http://www.invidi.com/pages/itc—technology—05.html, copyright 2007, printed Nov. 18, 2008, 1 page. |
“Tele Atlas Leverages Community Input to Add New Roads and Location Content,” at <http://www.teleatlas.com/WhyTeleAtlas/Pressroom/PressReleases/TA—CT031226>, Jun. 22, 2009, Gent, Belgium, copyright 2010, Tele Atlas BV, printed Mar. 12, 2010, 2 pages. |
Page, X. and Kobsa, A., “The Circles of Latitude: Adoption and Usage of Location Tracking in Online Social Networking,” in IEEE International Conference on Computational Science and Engineering, Aug. 29-31, 2009, Vancouver, Canada, vol. 4, pp. 1027-1030, found at <http://www.computer.org/portal/web/csdl/doi?doc=doi/10.1109/CSE.2009.195>, 4 pages. |
Zhang, K., et al., “The Study And Implementation of Micro-Blog Search Engine Based On Nutch,” IEEE 2010, V1-850-V1-854, 5 pages. |
Farhi, Paul, “The Twitter Explosion,” American Journalism Review, Apr./May 2009 Issue, at <http://ajr.org/article—printable.asp?id=4756>, printed Jun. 25, 2009, 6 pages. |
“TomTom Map Share technology,” at <http://www.tomtom.com/page/mapshare>, copyright 2009, TomTom International BV, printed Mar. 12, 2010, 3 pages. |
“TrackItBack—The World's Largest Lost & Found Recovery Service | News,” articles dating from Mar. 29, 2005,-Jun. 27, 2008, found at <http://www.trackitback.com/portal/press.html>, copyright 2003-2011, TrackItBack, printed on Apr. 18, 2011, 4 pages. |
Smale, S. and Greenberg, S., “Transient Life: Collecting and sharing personal information,” in OZCHI 2006, Nov. 20-24, 2006, Sydney, Australia, found at <http://grouplab.cpsc.ucalgary.ca/grouplab/uploads/Publications/Publications/2006—TransientLife.OZCHI.pdf>, 14 pages. |
Abstract, Alvarez-Garcia, J.A. at al., “Trip destination prediction based on past GPS log using a Hidden Markov Model,” Expert Systems with Applications, vol. 37, Issue 12, Dec. 2010, Elsevier Ltd, pp. 8166-8171, available online Jun. 2, 2010, 3 pages. |
“Twibes,” at <http://blog.twibes.com/twitter-tools/what-is-a-twibe>, dated Jul. 9, 2009, copyright 2009, Twibes.com, printed Nov. 14, 2012, 3 pages. |
Lenhart, A. and Fox, S., “Twitter and status updating,” Pew Internet, Feb. 12, 2009, at <http://fortysouth.com/wp-content/uploads/2009/05/Twitter-and-status-updating.pdf>, 11 pages. |
“Twitter Groups,” at <http://twittgroups.com/index.php>, from the Internet Archive dated Jan. 5, 2010, copyright 2008, twittgroups.com, printed Nov. 14, 2012, 3 pages. |
“Twittermap.tv,” at <http://twittermap.tv/cms/k19.What-is-this.htm>, from the Internet Archive dated Jan. 27, 2010, copyright 2009, Oliver heeger/kado media, printed Nov. 14, 2012, 1 page. |
“Twittervision Uses Google Earth to Track Updates Around the Globe,” posted by Eric on Mar. 14, 2010, at <http://alltwitterapps.com/2010/03/14/twittervision-uses-google-earth-to-track-updates-around-the-globe/>, printed Nov. 14, 2012, 3 pages. |
Ekpenyong, F. et al., “Updating of Road Network Databases: Spatio-Temporal Trajectory Grouping Using Snap-Drift Neural Network,” In Proceedings of International Conference on Engineering Applications of Neural Networks, EANN 2007, Aug. 29-31, 2007, Thessaloniki, Greece, 10 pages. |
Jones, Q. et al., “Urban Enclave Location-Aware Social Computing,” Proceeds of Internet Research 7.0: Internet Convergences, Brisbane, Australia, Sep. 27-30, 2006, found at <http://aoir.org/files/c4d0c2e397e8a5ddb140a40f7fa9.pdf>, 10 pages. |
Swedlow, Tracy, “Verizon Launches Twitter, Facebook, Fantasy Sports and Internet Video Widgets for FiOS TV,” InteractiveTV Today, Jul. 15, 2009, Retrieved from the internet: http://www.itvt.com/story/5204/verizon-launches-twitter-facebook-fantasy-sports-and-internet-videowidgets-fios-tv. |
“Web Crawler,” [online] Wikipedia.org [retrieved on Jan. 21, 2007] Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Web—crawling> 5 pages. |
“WikiMapia,” Wikipedia, at <http://en.wikipedia.org/wiki/WikiMapia>, last modified May 19, 2009, printed May 21, 2009, 4 pages. |
“Windows Live Messenger—Overview,” http://get.live.com/messenger/overview, copyright 2007 Microsoft Corp., printed Nov. 28, 2007, 1 page. |
“Yahoo! Personals,” http://personals.yahoo.com/us/homepage/splash, copyright 2008 Yahoo! Inc., printed Jan. 16, 2008, 2 pages. |
“Yammer: Product,” at <https://www.yammer.com/about/product>, from the Internet Archive dated Jan. 6, 2010, copyright 2010, Yammer, printed Nov. 14, 2012, 3 pages. |
“Zune,” http://wvw.zune.net/en-US/, copyright 2008 Microsoft Corporation, printed Jan. 16, 2008, 1 page. |
Number | Date | Country | |
---|---|---|---|
20140058669 A1 | Feb 2014 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13179909 | Jul 2011 | US |
Child | 14066800 | US | |
Parent | 12714807 | Mar 2010 | US |
Child | 13179909 | US | |
Parent | 11234464 | Sep 2005 | US |
Child | 12714807 | US |