Mapquest, Inc.

Verizon Patent and Licensing Inc.

Antony Pegg

Brian B Quinion

Kevin Mayhew

Stephen Hess

Elise Neel

Miria Grunick

Colson Hillier

Joshua J Babetski

Marc Bernardini

Michael Wille

Darren A Spehr

Jeff Medaugh

Angela S Olivero

Gopakumar Sivanpillai

Anil Mathew

Daniel Mandle

Andrew McMahon

Christopher Benton Wood

Marshall B Matthews

Sanjay Manseta

Bryan C Westhafer

Philip Russo

Thomas P Vaccarino

Brian J McMahon

An illustrative geolocation authentication system designates a movement feasibility corroboration factor as a location corroboration factor for the geolocation authentication system to authenticate geolocations of mobile devices. Based on the designating of the movement feasibility corroboration factor, the geolocation authentication system determines a first reported geolocation of a mobile device associated with a first time and a second reported geolocation of the mobile device associated with a second time. Given that the mobile device is located at a true geolocation at the second time, the geolocation authentication system then determines, based on the first and second reported geolocations of the mobile device, a feasibility metric indicative of a likelihood that the second reported geolocation of the mobile device is the true geolocation at the second time. Corresponding methods and systems are also disclosed.

Methods and systems for authenticating a reported geolocation of a mobile device

An exemplary virtual boundary system determines a refined geolocation of a tracking device based on a positioning signal and a correction signal that are accessed from distinct signal sources. The virtual boundary system compares the refined geolocation of the tracking device and a geographic boundary. Then, based on the comparing of the refined geolocation and the geographic boundary, the virtual boundary system provides an alert indicative of the refined geolocation with respect to the geographic boundary. Corresponding methods and systems are also disclosed.

Virtual boundary methods and systems

An exemplary geolocation authentication system receives user input representative of customized authentication settings that designate a location corroboration factor from a plurality of location corroboration factors that correspond to independent ways of determining geolocations of mobile devices. The system receives, from a mobile device located at a true geolocation, a reported geolocation of the mobile device. Then, in response to the receiving of the reported geolocation, the system accesses a datapoint that characterizes a correlation between the reported geolocation of the mobile device and the true geolocation of the mobile device. The datapoint characterizes the correlation based on the location corroboration factor designated by the customized authentication settings. The system further determines, based on the datapoint, a custom confidence metric representative of a likelihood that the reported geolocation is the true geolocation. Corresponding methods and systems are also disclosed.

An exemplary virtual boundary system accesses a positioning signal generated by a positioning system. A geolocation for a real-time tracking device is derivable from the positioning signal within a first margin of error. The virtual boundary system also accesses a correction signal generated by a positioning enhancement system and corresponding to the positioning signal generated by the positioning system. Based on the positioning signal and the correction signal, the virtual boundary system determines a refined geolocation of the real-time tracking device relative to a user-specified geographic boundary. The refined geolocation is accurate within a second margin of error that is less than the first margin of error. Corresponding methods and systems are also disclosed.

Dynamic virtual boundary methods and systems

An exemplary dynamic virtual boundary system accesses a positioning signal, a corresponding correction signal, and data defining a user-specified geographic boundary configured to change in real time. The positioning signal is generated by a satellite within a satellite-based positioning system and is received by a real-time tracking device carried by a subject. The correction signal is generated by a terrestrial positioning enhancement system and is also received by the device. Based on the positioning and correction signals, the dynamic virtual boundary system continuously determines a refined geolocation of the device and continuously monitors whether the refined geolocation is within a predetermined distance of the boundary as the boundary changes in real time. In response to a determination during the monitoring that the refined geolocation is within the predetermined distance, the dynamic virtual boundary system provides an alert to assist in constraining the subject within an area defined by the boundary.

Systems, methods, and computer-readable media are provided for processing geographic data and identifying geographic locations. In one implementation, a computer-implemented method is provided that is performed by one or more processors, the method comprising operations including receiving a query including an address, parsing the address into tokens, and sending the tokens to one or more harvesters. The method also includes receiving one or more geographic location candidates from the one or more harvesters in response to the tokens, comparing the one or more candidates, and returning one or more geographic locations based on the comparison.

Systems and methods for processing geographic data

Systems and methods are disclosed for partitioning data into n partitions in a database used for information retrieval. According to certain embodiments implemented with at least one processor, a perceived load is determined for each of a plurality of substrings, each of the substrings corresponding to one or more entries in the database. The plurality of substrings are ordered from highest to lowest perceived load. Data associated with each of the first n substrings is assigned to a separate partition, wherein n is greater than one. Moreover, data associated with each of the remaining substrings is assigned to the n partitions based on a score. The score is computed by calculating, for each partition, a load variance and an entropy weight for the candidate substring. The load variance and the entropy weight are combined, and the candidate substring is assigned to the partition that has the lowest combined score.

Computerized systems and methods for partitioning data for information retrieval

Systems and methods are disclosed for identifying points-of-interest using customized query prediction. According to certain embodiments, a partial query is received from a client via a network. The partial query may comprise a plurality of characters associated with a full query and location data associated with the client. The received partial query may be analyzed using at least one dictionary. Based on the analysis of the received partial query, at least one query may be predicted. Moreover, at least one point-of-interest may be identified based on the at least one predicted query. Further, data associated with the at least one identified point-of-interest may be transmitted over the network to the client prior to receiving the full query from the client.

Computerized systems and methods for identifying points-of-interest using customized query prediction

Computer-implemented systems and methods are provided for parsing search queries. In accordance with some embodiments, search records including character strings are retrieved, and search query templates are generated comprising sequences of categories corresponding to character substrings of the character strings. Also, in accordance with some embodiments, search queries are parsed into character substrings and matched with a search query template. The search query template may then be used to associate categories with the character substrings. A search engine may use the categories to focus or otherwise refine a search based on parsed search query.

Systems and methods for parsing search queries

Systems and methods are provided for providing an ordered list of search results in response to a query. Consistent with certain embodiments, computer-implemented systems and methods may identify content items corresponding to a query. First relevance scores may be determined for the identified content items based on their relevance to the query. Second relevance scores may be determined by modifying at least one of the first relevance scores using a boost value. The boost value may be set to a default boost value when the query does not include an override boost value. The boost value may be set to the override boost value, when the query includes an override boost value. An ordered list of the identified content items may be generated based on the second relevance scores. The ordered list may be displayed on a display device.

Systems and methods for providing ordered results for search queries

Computerized systems and methods are provided for analyzing failed and successful search queries. In accordance with some embodiments, search records with character strings that are refinements of character strings of other search records are deemed related as belonging to a same user search. Minimum changed sections between character strings in related search records are determined. Correction pairs are created including the character sequences from the portions of the character strings containing the minimum changed sections. Frequencies of correction pairs in a pool of correction pairs are calculated, and the correction pairs appearing in the pool most frequently are stored in a correction log.

Systems and methods for analyzing failed and successful search queries

Systems and methods are disclosed for ingesting data, such as point of interest data. According to certain embodiments, a raw data load transmitted over a network is received from a first data source. The raw data load may comprise a plurality of raw data records, which may be stored in a first database. A first plurality of standard data records previously received from the first data source may be accessed and compared to each of the plurality of raw data records to identify at least one added record. The at least one added record may be compared to a second plurality of standard data records received from a second data source to identify a matching record received from the second data source. The at least one added record may be assigned a key from the matching record. Moreover, the updated information may be sent to an update queue, such that applications may be notified of and receive the updates.

Systems and methods for point of interest data ingestion

Computerized systems and methods are provided for generating results of a search query. In accordance with some implementations, data is received that is indicative of a character string related to a location and provided as input by a user. One or more hierarchically organized data trees are retrieved, from a storage device, for administrative areas related to the input character. Thereafter, probable target addresses are determined for the location utilizing the hierarchically organized data trees for each of the administrative areas, and a list of probable target addresses is provided for display to the user based on the hierarchy of the administrative areas.

Systems and methods for processing search queries utilizing hierarchically organized data

Methods and systems are provided for decluttering icons on a map graphically presented on a display. In one implementation, a method is provided for decluttering icons representing points-of-interest on a map, wherein the method includes determining whether icons in a map view are overlapping and grouping the icons which are determined to overlap into at least one icon group. The method may also include repositioning the icons in each icon group into a decluttered icon patterns, wherein repositioning includes repositioning the icons at a predetermined distance from a common focal point. In addition, the method may include adjusting the repositioned icons to a different position in the map view when the repositioned icons overlap. Additionally, or alternatively, the method may include repositioning an icon in at least one decluttered icon pattern to a new position in the map view based on input from a user.

Growing community of inventors

East Petersburg, PA, United States of America

Antony Pegg