Patent Grant
11334216
This disclosure relates to approaches for visually presenting geospatial information for correlation analysis.
Under conventional approaches, databases may include geospatial information. The geospatial information may be processed to provide information about particular area(s) in tabular form. Reviewing information in tabular form may not be intuitive or provide for ease in determining correlations for the geospatial information.
Various embodiments of the present disclosure may include systems, methods, and non-transitory computer readable media configured to visually present geospatial information. Various embodiments of the present disclosure may include systems, methods, and non-transitory computer readable media configured to receive an information request for an area. The area may include one or more predefined regions. The predefined region(s) may be subdivided into one or more levels of predefined sub-regions. Information for the area may be accessed. The information for the area may include region information for the predefined region(s) or sub-region information for the predefined sub-regions. A response to the information request may be determined based on the region information or the sub-region information. The response may enable a visual presentation of (1) the information for the area, and (2) one or more geographical boundaries corresponding to the area.
In some embodiments, the geographical boundaries of the predefined region(s) and the predefined sub-regions may be precomputed. In some embodiments, the predefined regions/predefined sub-regions may have one or more irregular polygon boundaries.
In some embodiments, recursive relationships may exist between the predefined region(s) and the level(s) of predefined sub-regions. In some embodiments, the level(s) of predefined sub-regions may include one or more levels corresponding to at least one of country, state, county, city, or zip code.
In some embodiments, individual levels of predefined sub-regions may correspond to individual zoom levels of a user interface.
In some embodiments, the information for the area may be obtained from two or more data sources. The data sources may include disparate data. The systems, methods, and non-transitory computer readable media may be configured to normalize the disparate data.
These and other features of the systems, methods, and non-transitory computer readable media disclosed herein, as well as the methods of operation and functions of the related elements of structure and the combination of parts and economies of manufacture, will become more apparent upon consideration of the following description and the appended claims with reference to the accompanying drawings, all of which form a part of this specification, wherein like reference numerals designate corresponding parts in the various figures. It is to be expressly understood, however, that the drawings are for purposes of illustration and description only and are not intended as a definition of the limits of the invention.
Certain features of various embodiments of the present technology are set forth with particularity in the appended claims. A better understanding of the features and advantages of the technology will be obtained by reference to the following detailed description that sets forth illustrative embodiments, in which the principles of the invention are utilized, and the accompanying drawings of which:
A claimed solution rooted in computer technology overcomes problems specifically arising in the realm of computer technology. In various implementations, a computing system may receive an information request for an area. The request may be received, for example, via a user's selection of the area through a user interface (e.g., via bounding box, change in zoom level, selection of particular information regarding the area). The area may include one or more predefined regions. The predefined regions may be subdivided into one or more levels of predefined sub-regions. Recursive relationships may exist between the predefined regions and the level(s) of predefined sub-regions. In some embodiments, the level(s) of predefined sub-regions may include one or more levels corresponding to country, state, county, city, and/or zip code. Geographical boundaries of the predefined regions and predefined sub-regions may be shaped as regular or irregular polygons. The geographical boundaries of the predefined regions and predefined sub-regions may be precomputed. Boundaries of different regions may be precomputed while the information within the boundaries (e.g., represented by colors, patterns, locations of interest, stamping) may be computed on the fly. For example, a vectorized tile set representing the geometries of the regions/sub-regions may be computed and cached for reuse, and information about the regions (e.g., metadata for a given feature) may be computed/re-computed as needed.
The computing system may access information for the area. In some embodiments, the information for the area may be obtained from two or more data sources (e.g., general data sources, user-specific data sources). The data sources may include disparate data, and the computing system may normalize the disparate data. The information for the area may include region information for the predefined region(s) or sub-region information for the predefined sub-regions. The computing system may determine a response to the information request based on the region information or the sub-region information. The response may enable a visual presentation of (1) the information for the area and (2) one or more geographical boundaries corresponding to the area. The use of precomputed geographical boundaries may enable the computing system to quickly provide/render information regarding the area requested by a user. The use of visual presentation of the geographical boundaries along with the information for the area may enable the user to better understand the context of the information and obtain correlations for the information.
As used herein, the term “area” may refer to a definable extent. An area may refer to an extent definable in the physical world (e.g., geographical area) or an extent definable for information (e.g., grouping of information). For example, an area may refer to a particular geographical area of the world, a country, a state, or other regions. An area may refer to a particular grouping of information (conceptually projected onto a plane) based on type, subject, topic, and/or other grouping of information. While the disclosure is described herein with respect to information relating to geographical areas (e.g., displayed on a map), there is merely for illustrative purposes and is not meant to be limiting.
The approach disclosed herein enables visual presentation of geospatial information to facilitate a user's understanding of context of the geospatial information and the user's correlation analysis of the geospatial information. The use of predefined regions/sub-regions (having precomputed boundaries) allows the computing system to quickly customize views of the regions/sub-regions on a map with customer-specific geospatial information and other (e.g., general, public) geospatial information. The map may be updated based on changes in the geospatial information without re-computation of the boundaries for the predefined regions/sub-regions. The map may be visually augmented with particular customer-specific and other geospatial information to provide context for the customer-specific geospatial information, and to provide for a geo-specific correlations of the geospatial information. The use of visual presentation of the geographical boundaries of the regions/sub-regions along with the geospatial information for the predefined regions/sub-regions may enable a user to better understand the context of the geospatial information and obtain correlations for the geospatial information. Rendering views of the geospatial information on the map may be accelerated by using precomputed/cached information for individual predefined regions/sub-regions. Precomputed/cached information for different predefined regions/sub-regions may form a hierarchy of precomputed/cached information, with the structure of the hierarchy corresponding to recursive relationships between the predefined regions and predefined sub-regions.
In various embodiments, the request engine 112 is configured to receive an information request for an area. The information request may be received directly at the computing system 102 (e.g., received from a user using the computing system 102) or received from another computing device (e.g., received from a user using a computing device that communicates with the computing system 102). The information request for an area may specify one or more particular areas and one or more desired information for the area(s). For example, an information request may specify a particular geographical region and the desired information about the geographical region. An information request may be received at once or in multiple parts. For example, the request engine 112 may receive an information request specifying both the area and the desired information in a single communication. The request engine 112 may receive an information request in parts—for example, a first communication may specify a particular area and a second communication may specify the desired information for the particular area. Other arrangements/structures of information requests are contemplated.
An area may include one or more predefined regions. Predefined region(s) may be subdivided into one or more levels of predefined sub-regions. Predefined regions and predefined sub-regions may be defined by boundaries (e.g., geographical boundaries). The boundaries of the predefined regions/predefined sub-regions may be shaped as regular polygons and/or irregular polygons. Recursive relationships may exist between the predefined region(s) and the level(s) of predefined sub-regions. That is, two or more predefined sub-regions of a particular level may make up a predefined sub-region of a higher level or a predefined region. For example, two of more predefined sub-regions of a second level may make up a predefined sub-region of a first level. Two or more predefined sub-regions of the first level may make up a predefined region. In some embodiments, the level(s) of predefined sub-regions may include one or more levels corresponding to at least one of country, state, county, city, or zip code. For example, an area may include a particular country, predefined regions may correspond to the different states of the country, predefined sub-regions of a first level may correspond to the different counties of the various states, predefined sub-regions of a second level may correspond to the different zip codes of the various counties, and so forth.
In some embodiments, one or more predefined regions/predefined sub-regions may be defined by one or more arbitrary boundaries. For example, a user may set as a predefined region/predefined sub-region an arbitrary combinations of zip codes/cities to facilitate viewing of information for the arbitrary region (e.g., creating a combination of zip codes/cities as a sales region to facilitate viewing of sales information for the particular zip codes/cities). In some embodiments, one or more arbitrary regions may be composed of sub-regions (e.g., zip codes/cities), and may themselves exist as children of an existing pre-defined region (e.g., states). Such hierarchical relationships between regions/sub-regions may allow for defining one or more regions based on non-geographic criteria, with such regions being parent/children of geographic regions. For example, a user/company may define sales regions at the same level as counties (e.g., individual sales regions including one or more counties), with sales regions being children of states (e.g., multiple sales regions make up a state) and parents of zip codes (e.g., multiple zip codes make up a sale region). Other arbitrary boundaries are contemplated.
The use of predefined regions and predefined sub-regions may facilitate visual presentation of geospatial information. Geospatial information may refer to information that is associated with one or more particular locations. Geospatial information may be static (e.g., does not change with time) or variable (e.g., changes with time). For example, a user may have geospatial information which may be reviewed as text/number, and/or in a tabular form. The presentation of information in text/number/tabular form may not facilitate the user's understanding of the context of the information and/or the user's correlation analysis of the information. The computing system 102 may enable the user to tie geospatial information to particular predefined regions/sub-regions, and enable the user to review the geospatial information along with the boundaries of the regions/sub-regions (e.g., visualize custom data for an area on a map of the area). Such visual presentation of the geospatial information may facilitate the user's understanding of the context of the information and/or the user's correlation analysis of the information. The use of predefined regions and predefined sub-regions may enable a user to integrate geospatial information into a model defined by the predefined regions and predefined sub-regions for analysis and operation.
The use of predefined regions and predefined sub-regions may enable a user to combine two or more geospatial information for visual presentation. A user may use the predefined regions/sub-regions to join user-specific geospatial information with other (e.g., general, public) geospatial information to provide additional context/layers to be viewed with the user-specific geospatial information. For example, a user may use the predefined regions/sub-regions to join sales information about an area with population information for the area, and visualize the sale information in addition to/along with the population information for the predefined regions/sub-regions within the area. Other combinations of geospatial information are contemplated.
In some embodiments, an information request for an area may be received through a user interface. The user interface may display a map of a geographic area and may enable a user to select a particular region within the map as the area for which information is desired. The user interface may display one or more options from which a user may select particular information desired for the selected area.
The user interface may enable a user to select (e.g., via a drawing tool, via a mouse click, via a key entry) the area for which information is desired. In some embodiments, a user's selection of a particular region within the map may include the user's selection of the extent of the map presented within the user interface. A user may change the extent of the map represented within the user interface based on changes in zoom and/or latitude/longitude of the area presented within the user interface. The portion of the map presented in the user interface may correspond to the area selected by the user. As another example, a user's selection of a particular region within the map may include the user's selection of particular datasets. A user may select a particular dataset that includes information regarding one or more portions within the map and those portions may correspond to the area selected by the user.
In some embodiments, the user interface may enable changes in zoom levels. Zoom levels may define the extent of the map/area/regions/sub-regions shown in the user interface. In some embodiments, predefined regions and levels of predefined sub-regions may correspond to individual zoom levels of the user interface. Zoom levels may define whether the user interface displays boundaries of the predefined regions and/or boundaries of a certain level of predefined sub-regions. For example, when using the zoom level with the smallest magnification (showing the largest extent of the map), the user interface may display the boundaries of predefined regions. When using the zoom level with the largest magnification (showing the smallest extent of the map), the user interface may display the boundaries of the lowest level of predefined sub-regions. The user interface may also provide the user with a choice between multiple different sets of sub-regions for a given zoom level. Other correspondence between zoom levels and boundaries of predefined regions/sub-regions are contemplated.
Tying the type of boundaries shown in the user interface to zoom levels may allow the user to change the type (e.g., amount of details) of the information retrieved relating to an area based on the zoom level used to view the area. For example, a user using the user interface to view a zoomed-out view of the map may be shown information aggregated for larger portions of the map than the user using the user interface to view a zoomed-in view of the map. In some embodiments, a user may manually change the type of boundaries shown in the user interface without changes in the zoom level. For example, a user may, while staying at the same zoom level, prompt the user interface to show (1) a more detailed version of the map (e.g., showing boundaries of lower levels of predefined sub-regions) or (2) a less detailed version of the map (e.g., showing boundaries of higher levels of predefined sub-regions/predefined regions).
In various embodiments, the access engine 114 is configured to access information for an area. Information for the area may be accessed from one or more storage locations. A storage location may refer to electronic storage located within the computing system 102 (e.g., integral and/or removable memory of the computing system 102), electronic storage coupled to the computing system 102, and/or electronic storage located remotely from the computing system 102 (e.g., electronic storage accessible to the computing system 102 through a network). The information for the area may be stored in one or more databases. The information for the area may be stored within a single file or across multiple files.
The information for the area may include region information for the predefined region(s) or sub-region information for the predefined sub-regions. Recursive relationships may exist between region information and sub-region information. That is, sub-region information for two or more predefined sub-regions may be used to determine region information for a particular predefined region. For example, a predefined region may correspond to a state and predefined sub-regions may correspond to different counties within the state. The sub-region information for the counties may be used to determine the region information for the state.
Information determined for a given predefined region/sub-region may be stored (e.g., cached) as precomputed information for the given predefined region/sub-region. For example, a predefined region may include two predefined sub-regions. Precomputed information for the predefined region may be cached for the predefined region and precomputed information for the individual predefined sub-regions may be cached for the individual sub-regions. Based on the information request, the information cached for the relevant region/sub-region may be accessed. Caching precomputing information may accelerate rendering views of the region information/sub-region information.
Information for an area may include geospatial information for the area, the predefined regions, and/or the predefined sub-regions. Information for the area may be generated based on merging of multiple data (e.g., data tables) based on relationships among the data. Individual data may include/be combined with location data to form geospatial information for the area. For example, information for an area may be generated based on merging of multiple data relating to vehicles within the area. Data relating to different types of vehicles may be stored in separate databases/tables, and the data may be merged to form the vehicle data for the area. Individual data within the vehicle data may include/be combined with location data for specific vehicles (e.g., obtained from GPS) to form geospatial information for the area. Location data may define a specific location in the world (e.g., specific latitude and longitude at a given time) or may define a particular predefined region/sub-region.
Information for an area may include user-specific geospatial information and other (e.g., general, public) geospatial information. For example, user-specific geospatial information may include sales information for an area while other geospatial information may include population information for the area. Other combinations of geospatial information are contemplated. Combination of other geospatial information with user-specific geospatial information may provide additional context/layers to be viewed with the user-specific geospatial information.
In some embodiments, the information for the area may be obtained from two or more data sources. The data sources may include disparate data. The access engine 114 may be configured to normalize the disparate data. Normalizing the data may include modifying one or multiple disparate data to make them compatible for comparison. Normalizing the data may include smoothing datasets to use different datasets together. For example, census information for an area may be obtained from two organizations that track the population differently (e.g., via different sized regions, via different demographics). The access engine 114 may normalize the census information so that the information may be visually presented together.
In various embodiments, the response engine 116 is configured to determine a response to the information request based on the region information, the sub-region information, and/or other information. Determining responses to information requests may include one or more operations on the region information and/or the sub-region information. Operations on the region/sub-region information may include aggregating, joining, determining maximum/minimum, filtering, determining distribution, determining average, and/or other operations on the region/sub-region information. The response engine 116 may be configured to change the accuracy of the response based on the levels of information used to determine the response. For example, the response engine 116 may use region information for a large area to provide a more approximated response. The response engine 116 may use sub-region information for small areas to provide a more accurate response. The response engine 116 may enable users to choose different levels of accuracy and/or sizes of areas for information. Changing the levels of accuracy/sizes of areas may result in different amounts of resource consumption (e.g., processing power, memory usage, duration of processing) to determine responses to information requests. For example, the response regime 116 may enable users to see slower responses with higher accuracy for a larger area or to see quicker responses with lower accuracy for a smaller area. The response engine 116 may recursively determine a response to an information request for an area based on the region information and the sub-region information. For example, desired information for an area may be determined by (1) determining the desired region information based on the sub-region information, and (2) determining the desired information for the area based on the region information.
Use of the region information and the sub-region information to determine the response may enable the response engine 116 to focus on the necessary data. For example, if the information request is for a particular county (a predefined sub-region) of a particular state (e.g., a predefined region), the response engine 116 may access the sub-region information for the particular county to determine the response, rather than accessing and shifting through the region information for the state to determine the response.
Use of the region information and the sub-region information to determine the response may enable the response engine 116 to approximate a response when the necessary data is not available. For example, if the information request is for a particular county (a predefined sub-region) of a particular state (e.g., a predefined region), the response engine 116 may attempt to access the sub-region information for the particular county. The sub-region information for the particular county may not exist. In some embodiments, the response engine 116 may use null data to provide a response to the information request. In some embodiments, the response engine 116 may use the region information for the particular state and modify the response to approximate the response for the particular county.
The response may enable a visual presentation of (1) the information for the area, and (2) one or more geographical boundaries corresponding to the area. The response engine 116 may use the geographical boundaries of the predefined regions and predefined sub-regions (e.g., shaped as regular or irregular polygons) to determine the response to the information request. The response may be determined by the response engine 116 as different visuals (e.g., different colors, patterns, locations of interest, stamping). The geographical boundaries of the predefined regions/sub-regions may be precomputed and the visuals determined based on the information request may be used to augment the view of the area defined by the geographical boundaries. For example, the response engine 116 may use the region information/sub-region information to determine in what color to shade a particular region/sub-region defined by precomputed geographical boundaries. Other uses of visuals are contemplated.
The use of precomputed geographical boundaries may enable quick/efficient visual presentation of (1) the information for the area, and (2) the geographical boundaries corresponding to the area. Drawing boundaries of a region/sub-region may be computationally much more expensive than visually augmenting (e.g., coloring) the drawn region. Thus, drawing boundaries of different regions/sub-regions within a map may be the main cost of presenting the map while visually augmenting the drawn map may be accomplished at little cost. The response engine 116 may use precomputed geographical boundaries (e.g., cached vectorized tile set representing the geometries of the regions/sub-regions) to quickly present the boundaries of the area while using the region/sub-region information to determine visual augmentations for the area. The boundaries of an area may be computed and cached for reuse, and information about the area (e.g., metadata for a given feature) may be computed/re-computed as needed.
For example, an initial information request may request information regarding a particular state including a number of counties. A user may zoom into the map to request information regarding a particular county divided into smaller sub-regions (e.g., by cities, by zip codes). The response engine 116 may use the precomputed geographical boundaries to provide a map view of the relevant area while computing the visual augmentation on the fly based on the relevant region/sub-region information. The use of precomputed geographical boundaries may enable the response engine 116 to quickly provide/render information regarding the area requested by the user. The use of visual presentation of the geographical boundaries along with the information for the area may enable the user to better understand the context of the information and obtain correlations for the information.
The response engine 116 may use the region information/sub-region information to provide visual augmentations that are correlated to the region information/sub-region information. For example, one form of visual augmentation may include stamping. Stamping may refer to placing visuals (e.g., icons) representing a particular object/characteristic within a map to represent the location of the particular object/characteristic. For example, locations of a certain type of store may be stamped on a map to provide a visual presentation of the stores. However, the number of stampings possible on a map is limited by the number of pixels used to display the map, and the number of stores within a given area may be too numerous to stamp every single store location on the map. The number of stamps may be reduced by providing an approximated view of the locations. A simple method of reducing the number of stamps may be to randomly choose which stamps will be shown on the map. For example, the stamps may be generated at random. Between overlapping stamps (overlaps caused by proximity of store locations), the later generated stamps may be chosen to be displayed on the map. However, such a simplification of stamps may result in loss of information pertinent to a user.
The response engine 116 may provide for reducing the number of stamps based on the region information/sub-region information. Rather than reducing the number of stamps randomly, the response engine 116 may choose which stamps to be presented as part of the response based on the pertinent information. Returning to the store stamping example, the response engine 116 may use the region information/sub-region information to choose which stamps to include in the response based on the user-specific information and/or other (e.g., general, public) information. For example, using the user-specific information, the response engine 116 may choose to present stamps for stores with the high sales/popularity, or to present stamps for stores in locations with high population/high income. Other combinations of user-specific information and other information for visual augmentation are contemplated.
The use of visual presentation of the geographical boundaries along with the information for the area may enable the user to better understand the context of the information and obtain correlations for the information. For example, providing geospatial information relating to health costs with geographical boundaries of areas (e.g., geographical boundaries corresponding to different hospital service areas) may enable a user to detect anomalous spending by particular hospitals, for particular treatments, and/or for particular patients. As another example, providing geospatial information relating to shipping costs by geographical boundaries of areas (e.g., geographical boundaries corresponding to zip codes, different distribution centers) may enable a user to determine which future distribution center location may have the greatest impact on reducing the costs of distribution. Other provision of content/correlations for information are contemplated.
The boundaries of the area 200 and the predefined regions within the area 200 may be computed and cached for reuse. Information about the area 200/predefined regions may be computed/re-computed as needed. The use of precomputed geographical boundaries of the area 200 and the predefined regions may enable faster provision/rendering of information regarding the area 200 requested by the user. Provision/rendering of views of geospatial information for the area 200 may be accelerated by using precomputed/cached information for the area 200/predefined regions. Precomputed/cached information for the area 200/predefined regions may form a hierarchy of precomputed/cached information, with the structure of the hierarchy corresponding to recursive relationships between the area 200 and the predefined regions.
The boundaries of the predefined region 260 and the predefined sub-regions within the predefined region 260 may be computed and cached for reuse. Information about the predefined region 260/predefined sub-regions may be computed/re-computed as needed. The use of precomputed geographical boundaries of the predefined region 260 and the predefined sub-regions may enable faster provision/rendering of information regarding the predefined region 260 requested by the user. Provision/rendering of views of geospatial information for predefined region 260 may be accelerated by using precomputed/cached information for the predefined region 260/predefined sub-regions. Precomputed/cached information for the predefined region 260/predefined sub-regions may form a hierarchy of precomputed/cached information, with the structure of the hierarchy corresponding to recursive relationships between the predefined region 260 and the predefined sub-regions.
The user interface 400 may include a title field 402, a tool set field 404, an information region 406, a display region 408, zoom options 410, and/or other fields, regions, options. The title field 402 may display the title of the information (e.g., map type) being displayed in the user interface 400. The tool set field 404 may include one or more tools to use and/or change the information displayed in the interface user 400. For example, the tool set field 404 may include a search field that enables a user to search for particular features, data addition/removal field that enables a user to add/remove data from the map, export field that enables a user to export a given map/given display of a map, and/or other fields. The information region 406 may display one or more types of information (e.g., histograms, information selection, area selection) relating to one or more areas/predefined regions/predefined sub-regions within the display region 408. The display region 408 may display one or more portions of a map (including one or more areas/predefined regions/predefined sub-regions) and/or other information. The display region 408 may display one or more particular information about the map (e.g., icons representing numbers/locations of particular objects within the map, heat map, color shading, other visual augmentations).
A user may use the zoom option 410 to change (e.g., increase, decrease) the level of zoom for the map/information displayed within the display region 408. Zoom levels may correspond to a particular type of predefined regions/predefined sub-regions displayed within the display region 408. For example, increasing the zoom level (more magnified view of the map) may enable a user to view predefined sub-regions (e.g., corresponding to counties, zip codes). Information for the area may be subdivided into region information (for individual predefined regions) and sub-region information (for individual predefined sub-regions). A response to an information request may be determined recursively based on the region information and the sub-region information. A response to an information request may be determined based on precomputed information cached for particular predefined regions/predefined sub-regions.
The determined response may be presented within the information region 406 and/or the display region 408. The determined response may be presented as visual augmentation (e.g., as colors, patterns, locations of interest, stamping) of the map presented within the display region 408. For example, an information request may seek information relating to store locations within the area shown within the display region 408. The response may be shown as circles within the display region 408, with the location of the circles corresponding to the location of certain stores, and the size of the circle corresponding to particular information (e.g., sales number for the stores, population being served by the store) about the stores.
In some embodiments, the information region 406, the display region 408, and/or other regions may provide information about the types of information available for view within the user interface 400. For example, the information region 406 may display a listing of types of information available for viewing within the display region 408, and the display region 408 may display bounding boxes representing the regions for which the information is available. Selection of a particular type of information in the information region 406 and/or a particular bounding box within the display region 408 may automatically switch the view within the display region 408 to display the selected region/information.
At block 502, an information request for an area may be received. The area may include one or more predefined regions and one or more levels of predefined sub-regions. At block 504, information for the area may be accessed. The information for the area may include region information for the predefined region(s) or sub-region information for the predefined sub-region(s). At block 506, a response to the information request may be determined based on the region information or the sub-region information. The response may enable a visual presentation of (1) the information for the area, and (2) one or more geographical boundaries corresponding to the area.
Hardware Implementation
The techniques described herein are implemented by one or more special-purpose computing devices. The special-purpose computing devices may be hard-wired to perform the techniques, or may include circuitry or digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the techniques, or may include one or more hardware processors programmed to perform the techniques pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices may also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques. The special-purpose computing devices may be desktop computer systems, server computer systems, portable computer systems, handheld devices, networking devices or any other device or combination of devices that incorporate hard-wired and/or program logic to implement the techniques.
Computing device(s) are generally controlled and coordinated by operating system software, such as iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, iOS, Blackberry OS, VxWorks, or other compatible operating systems. In other embodiments, the computing device may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.
The computer system 600 also includes a main memory 606, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 602 for storing information and instructions to be executed by processor 604. Main memory 606 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 604. Such instructions, when stored in storage media accessible to processor 604, render computer system 600 into a special-purpose machine that is customized to perform the operations specified in the instructions.
The computer system 600 further includes a read only memory (ROM) 608 or other static storage device coupled to bus 602 for storing static information and instructions for processor 604. A storage device 610, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 602 for storing information and instructions.
The computer system 600 may be coupled via bus 602 to a display 612, such as a cathode ray tube (CRT) or LCD display (or touch screen), for displaying information to a computer user. An input device 614, including alphanumeric and other keys, is coupled to bus 602 for communicating information and command selections to processor 604. Another type of user input device is cursor control 616, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 604 and for controlling cursor movement on display 612. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.
The computing system 600 may include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.
In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and may be originally stored in a compressed or installable format that requires installation, decompression or decryption prior to execution). Such software code may be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules or computing device functionality described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.
The computer system 600 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 600 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 600 in response to processor(s) 604 executing one or more sequences of one or more instructions contained in main memory 606. Such instructions may be read into main memory 606 from another storage medium, such as storage device 610. Execution of the sequences of instructions contained in main memory 606 causes processor(s) 604 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.
The term “non-transitory media,” and similar terms, as used herein refers to any media that store data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 610. Volatile media includes dynamic memory, such as main memory 606. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.
Non-transitory media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between non-transitory media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 602. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor 604 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 600 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 602. Bus 602 carries the data to main memory 606, from which processor 604 retrieves and executes the instructions. The instructions received by main memory 606 may retrieves and executes the instructions. The instructions received by main memory 606 may optionally be stored on storage device 610 either before or after execution by processor 604.
The computer system 600 also includes a communication interface 618 coupled to bus 602. Communication interface 618 provides a two-way data communication coupling to one or more network links that are connected to one or more local networks. For example, communication interface 618 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 618 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 618 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
A network link typically provides data communication through one or more networks to other data devices. For example, a network link may provide a connection through local network to a host computer or to data equipment operated by an Internet Service Provider (ISP). The ISP in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet”. Local network and Internet both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link and through communication interface 618, which carry the digital data to and from computer system 600, are example forms of transmission media.
The computer system 600 can send messages and receive data, including program code, through the network(s), network link and communication interface 618. In the Internet example, a server might transmit a requested code for an application program through the Internet, the ISP, the local network and the communication interface 618.
The received code may be executed by processor 604 as it is received, and/or stored in storage device 610, or other non-volatile storage for later execution.
Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may be implemented partially or wholly in application-specific circuitry.
The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and sub-combinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.
Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.
Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.
It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure. The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.
Certain embodiments are described herein as including logic or a number of components, engines, or mechanisms. Engines may constitute either software engines (e.g., code embodied on a machine-readable medium) or hardware engines. A “hardware engine” is a tangible unit capable of performing certain operations and may be configured or arranged in a certain physical manner. In various example embodiments, one or more computer systems (e.g., a standalone computer system, a client computer system, or a server computer system) or one or more hardware engines of a computer system (e.g., a processor or a group of processors) may be configured by software (e.g., an application or application portion) as a hardware engine that operates to perform certain operations as described herein.
In some embodiments, a hardware engine may be implemented mechanically, electronically, or any suitable combination thereof. For example, a hardware engine may include dedicated circuitry or logic that is permanently configured to perform certain operations. For example, a hardware engine may be a special-purpose processor, such as a Field-Programmable Gate Array (FPGA) or an Application Specific Integrated Circuit (ASIC). A hardware engine may also include programmable logic or circuitry that is temporarily configured by software to perform certain operations. For example, a hardware engine may include software executed by a general-purpose processor or other programmable processor. Once configured by such software, hardware engines become specific machines (or specific components of a machine) uniquely tailored to perform the configured functions and are no longer general-purpose processors. It will be appreciated that the decision to implement a hardware engine mechanically, in dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g., configured by software) may be driven by cost and time considerations.
Accordingly, the phrase “hardware engine” should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein. As used herein, “hardware-implemented engine” refers to a hardware engine. Considering embodiments in which hardware engines are temporarily configured (e.g., programmed), each of the hardware engines need not be configured or instantiated at any one instance in time. For example, where a hardware engine comprises a general-purpose processor configured by software to become a special-purpose processor, the general-purpose processor may be configured as respectively different special-purpose processors (e.g., comprising different hardware engines) at different times. Software accordingly configures a particular processor or processors, for example, to constitute a particular hardware engine at one instance of time and to constitute a different hardware engine at a different instance of time.
Hardware engines can provide information to, and receive information from, other hardware engines. Accordingly, the described hardware engines may be regarded as being communicatively coupled. Where multiple hardware engines exist contemporaneously, communications may be achieved through signal transmission (e.g., over appropriate circuits and buses) between or among two or more of the hardware engines. In embodiments in which multiple hardware engines are configured or instantiated at different times, communications between such hardware engines may be achieved, for example, through the storage and retrieval of information in memory structures to which the multiple hardware engines have access. For example, one hardware engine may perform an operation and store the output of that operation in a memory device to which it is communicatively coupled. A further hardware engine may then, at a later time, access the memory device to retrieve and process the stored output. Hardware engines may also initiate communications with input or output devices, and can operate on a resource (e.g., a collection of information).
The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented engines that operate to perform one or more operations or functions described herein. As used herein, “processor-implemented engine” refers to a hardware engine implemented using one or more processors.
Similarly, the methods described herein may be at least partially processor-implemented, with a particular processor or processors being an example of hardware. For example, at least some of the operations of a method may be performed by one or more processors or processor-implemented engines. Moreover, the one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). For example, at least some of the operations may be performed by a group of computers (as examples of machines including processors), with these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., an Application Program Interface (API)).
The performance of certain of the operations may be distributed among the processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processors or processor-implemented engines may be located in a single geographic location (e.g., within a home environment, an office environment, or a server farm). In other example embodiments, the processors or processor-implemented engines may be distributed across a number of geographic locations.
Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter herein.
Although an overview of the subject matter has been described with reference to specific example embodiments, various modifications and changes may be made to these embodiments without departing from the broader scope of embodiments of the present disclosure. Such embodiments of the subject matter may be referred to herein, individually or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any single disclosure or concept if more than one is, in fact, disclosed.
The embodiments illustrated herein are described in sufficient detail to enable those skilled in the art to practice the teachings disclosed. Other embodiments may be used and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. The Detailed Description, therefore, is not to be taken in a limiting sense, and the scope of various embodiments is defined only by the appended claims, along with the full range of equivalents to which such claims are entitled.
It will be appreciated that an “engine,” “system,” “data store,” and/or “database” may comprise software, hardware, firmware, and/or circuitry. In one example, one or more software programs comprising instructions capable of being executable by a processor may perform one or more of the functions of the engines, data stores, databases, or systems described herein. In another example, circuitry may perform the same or similar functions. Alternative embodiments may comprise more, less, or functionally equivalent engines, systems, data stores, or databases, and still be within the scope of present embodiments. For example, the functionality of the various systems, engines, data stores, and/or databases may be combined or divided differently.
“Open source” software is defined herein to be source code that allows distribution as source code as well as compiled form, with a well-publicized and indexed means of obtaining the source, optionally with a license that allows modifications and derived works.
The data stores described herein may be any suitable structure (e.g., an active database, a relational database, a self-referential database, a table, a matrix, an array, a flat file, a documented-oriented storage system, a non-relational No-SQL system, and the like), and may be cloud-based or otherwise.
As used herein, the term “or” may be construed in either an inclusive or exclusive sense. Moreover, plural instances may be provided for resources, operations, or structures described herein as a single instance. Additionally, boundaries between various resources, operations, engines, engines, and data stores are somewhat arbitrary, and particular operations are illustrated in a context of specific illustrative configurations. Other allocations of functionality are envisioned and may fall within a scope of various embodiments of the present disclosure. In general, structures and functionality presented as separate resources in the example configurations may be implemented as a combined structure or resource. Similarly, structures and functionality presented as a single resource may be implemented as separate resources. These and other variations, modifications, additions, and improvements fall within a scope of embodiments of the present disclosure as represented by the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.
Although the invention has been described in detail for the purpose of illustration based on what is currently considered to be the most practical and preferred implementations, it is to be understood that such detail is solely for that purpose and that the invention is not limited to the disclosed implementations, but, on the contrary, is intended to cover modifications and equivalent arrangements that are within the spirit and scope of the appended claims. For example, it is to be understood that the present invention contemplates that, to the extent possible, one or more features of any embodiment can be combined with one or more features of any other embodiment.
This application claims the benefit under 35 U.S.C. § 119(e) of the U.S. Provisional Application Ser. No. 62/512,638, filed May 30, 2017, the content of which is hereby incorporated by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4899161 | Morin et al. | Feb 1990 | A |
| 4958305 | Piazza | Sep 1990 | A |
| 5329108 | Lamoure | Jul 1994 | A |
| 5754182 | Kobayashi | May 1998 | A |
| 5781195 | Marvin | Jul 1998 | A |
| 5781704 | Rossmo | Jul 1998 | A |
| 6091956 | Hollenberg | Jul 2000 | A |
| 6100897 | Mayer et al. | Aug 2000 | A |
| 6157747 | Szeliski et al. | Dec 2000 | A |
| 6169552 | Endo et al. | Jan 2001 | B1 |
| 6173067 | Payton et al. | Jan 2001 | B1 |
| 6178432 | Cook et al. | Jan 2001 | B1 |
| 6247019 | Davies | Jun 2001 | B1 |
| 6389289 | Voce et al. | May 2002 | B1 |
| 6414683 | Gueziec | Jul 2002 | B1 |
| 6483509 | Rabenhorst | Nov 2002 | B1 |
| 6529900 | Patterson et al. | Mar 2003 | B1 |
| 6631496 | Li et al. | Oct 2003 | B1 |
| 6662103 | Skolnick et al. | Dec 2003 | B1 |
| 6757445 | Knopp | Jun 2004 | B1 |
| 6828920 | Owen et al. | Dec 2004 | B2 |
| 6983203 | Wako | Jan 2006 | B1 |
| 6985950 | Hanson et al. | Jan 2006 | B1 |
| 7036085 | Barros | Apr 2006 | B2 |
| 7158878 | Rasmussen et al. | Jan 2007 | B2 |
| 7375732 | Arcas | May 2008 | B2 |
| 7379811 | Rasmussen et al. | May 2008 | B2 |
| 7457706 | Malero et al. | Nov 2008 | B2 |
| 7502786 | Liu et al. | Mar 2009 | B2 |
| 7519470 | Brasche et al. | Apr 2009 | B2 |
| 7529195 | Gorman | May 2009 | B2 |
| 7539666 | Ashworth et al. | May 2009 | B2 |
| 7558677 | Jones | Jul 2009 | B2 |
| 7574428 | Leiserowitz et al. | Aug 2009 | B2 |
| 7579965 | Bucholz | Aug 2009 | B2 |
| 7617314 | Bansod et al. | Nov 2009 | B1 |
| 7620628 | Kapur et al. | Nov 2009 | B2 |
| 7663621 | Allen et al. | Feb 2010 | B1 |
| 7791616 | Ioup et al. | Sep 2010 | B2 |
| 7805457 | Viola et al. | Sep 2010 | B1 |
| 7809703 | Balabhadrapatruni et al. | Oct 2010 | B2 |
| 7872647 | Mayer et al. | Jan 2011 | B2 |
| 7894984 | Rasmussen et al. | Feb 2011 | B2 |
| 7899611 | Downs et al. | Mar 2011 | B2 |
| 7920963 | Jouline et al. | Apr 2011 | B2 |
| 7945852 | Pilskains | May 2011 | B1 |
| 7962281 | Rasmussen et al. | Jun 2011 | B2 |
| 7970240 | Chao et al. | Jun 2011 | B1 |
| 8010545 | Stefik et al. | Aug 2011 | B2 |
| 8036632 | Cona et al. | Oct 2011 | B1 |
| 8065080 | Koch | Nov 2011 | B2 |
| 8085268 | Carrino et al. | Dec 2011 | B2 |
| 8134457 | Velipasalar et al. | Mar 2012 | B2 |
| 8145703 | Frishert et al. | Mar 2012 | B2 |
| 8200676 | Frank | Jun 2012 | B2 |
| 8214361 | Sandler et al. | Jul 2012 | B1 |
| 8214764 | Gemmell et al. | Jul 2012 | B2 |
| 8229947 | Fujinaga | Jul 2012 | B2 |
| 8230333 | Decherd et al. | Jul 2012 | B2 |
| 8290942 | Jones et al. | Oct 2012 | B2 |
| 8290943 | Carbone et al. | Oct 2012 | B2 |
| 8301464 | Cave et al. | Oct 2012 | B1 |
| 8325178 | Doyle, Jr. | Dec 2012 | B1 |
| 8368695 | Howell et al. | Feb 2013 | B2 |
| 8397171 | Klassen et al. | Mar 2013 | B2 |
| 8400448 | Doyle, Jr. | Mar 2013 | B1 |
| 8407180 | Ramesh et al. | Mar 2013 | B1 |
| 8412234 | Gatmir-Motahari et al. | Apr 2013 | B1 |
| 8412707 | Mianji | Apr 2013 | B1 |
| 8422825 | Neophytou et al. | Apr 2013 | B1 |
| 8452790 | Mianji | May 2013 | B1 |
| 8463036 | Ramesh et al. | Jun 2013 | B1 |
| 8489331 | Kopf et al. | Jul 2013 | B2 |
| 8489641 | Seefeld et al. | Jul 2013 | B1 |
| 8498984 | Hwang et al. | Jul 2013 | B1 |
| 8508533 | Cervelli et al. | Aug 2013 | B2 |
| 8514229 | Cervelli et al. | Aug 2013 | B2 |
| 8515207 | Chau | Aug 2013 | B2 |
| 8564596 | Carrino et al. | Oct 2013 | B2 |
| 8742934 | Sarpy et al. | Jun 2014 | B1 |
| 8781169 | Jackson et al. | Jul 2014 | B2 |
| 8799799 | Cervelli | Aug 2014 | B1 |
| 8830322 | Nerayoff et al. | Sep 2014 | B2 |
| 8938686 | Erenrich et al. | Jan 2015 | B1 |
| 8949164 | Mohler | Feb 2015 | B1 |
| 9009177 | Zheng et al. | Apr 2015 | B2 |
| 9009610 | Florance | Apr 2015 | B2 |
| 9021384 | Beard et al. | Apr 2015 | B1 |
| 9104293 | Kornfeld et al. | Aug 2015 | B1 |
| 9104695 | Cervelli et al. | Aug 2015 | B1 |
| 9111380 | Piemonte et al. | Aug 2015 | B2 |
| 9129219 | Robertson et al. | Sep 2015 | B1 |
| 9146125 | Vulcano et al. | Sep 2015 | B2 |
| 9460175 | Hong | Oct 2016 | B1 |
| 20020003539 | Abe | Jan 2002 | A1 |
| 20020033848 | Sciammarella et al. | Mar 2002 | A1 |
| 20020116120 | Ruiz et al. | Aug 2002 | A1 |
| 20020130867 | Yang et al. | Sep 2002 | A1 |
| 20020130906 | Miyaki | Sep 2002 | A1 |
| 20030052896 | Higgins et al. | Mar 2003 | A1 |
| 20030103049 | Kindratenko et al. | Jun 2003 | A1 |
| 20030144868 | MacIntyre et al. | Jul 2003 | A1 |
| 20030163352 | Surpin et al. | Aug 2003 | A1 |
| 20030225755 | Iwayama et al. | Dec 2003 | A1 |
| 20040030492 | Fox et al. | Feb 2004 | A1 |
| 20040039498 | Ollis et al. | Feb 2004 | A1 |
| 20040098236 | Mayer et al. | May 2004 | A1 |
| 20050031197 | Knopp | Feb 2005 | A1 |
| 20050034062 | Bufkin et al. | Feb 2005 | A1 |
| 20050080769 | Gemmell | Apr 2005 | A1 |
| 20050143602 | Yada et al. | Jun 2005 | A1 |
| 20050162523 | Darrell et al. | Jul 2005 | A1 |
| 20050182502 | Iyengar | Aug 2005 | A1 |
| 20050182793 | Keenan et al. | Aug 2005 | A1 |
| 20050223044 | Ashworth et al. | Oct 2005 | A1 |
| 20050267652 | Allstadt et al. | Dec 2005 | A1 |
| 20060026170 | Kreitler et al. | Feb 2006 | A1 |
| 20060139375 | Rasmussen et al. | Jun 2006 | A1 |
| 20060146050 | Yamauchi | Jul 2006 | A1 |
| 20060149596 | Surpin et al. | Jul 2006 | A1 |
| 20060197837 | Flath et al. | Sep 2006 | A1 |
| 20060200384 | Arutunian et al. | Sep 2006 | A1 |
| 20060241974 | Chao et al. | Oct 2006 | A1 |
| 20060251307 | Florin et al. | Nov 2006 | A1 |
| 20060259527 | Devarakonda et al. | Nov 2006 | A1 |
| 20060271277 | Hu et al. | Nov 2006 | A1 |
| 20060279630 | Aggarwal et al. | Dec 2006 | A1 |
| 20070011150 | Frank | Jan 2007 | A1 |
| 20070016363 | Huang et al. | Jan 2007 | A1 |
| 20070024620 | Muller-Fischer et al. | Feb 2007 | A1 |
| 20070057966 | Ohno et al. | Mar 2007 | A1 |
| 20070078832 | Ott et al. | Apr 2007 | A1 |
| 20070115373 | Gallagher et al. | May 2007 | A1 |
| 20070188516 | Loup et al. | Aug 2007 | A1 |
| 20070208497 | Downs et al. | Sep 2007 | A1 |
| 20070208498 | Barker et al. | Sep 2007 | A1 |
| 20070258642 | Thota | Nov 2007 | A1 |
| 20070294643 | Kyle | Dec 2007 | A1 |
| 20080010273 | Frank | Jan 2008 | A1 |
| 20080010605 | Frank | Jan 2008 | A1 |
| 20080040684 | Crump | Feb 2008 | A1 |
| 20080051994 | Fisher | Feb 2008 | A1 |
| 20080077642 | Carbone et al. | Mar 2008 | A1 |
| 20080082578 | Hogue et al. | Apr 2008 | A1 |
| 20080098085 | Krane et al. | Apr 2008 | A1 |
| 20080104019 | Nath | May 2008 | A1 |
| 20080133579 | Lim | Jun 2008 | A1 |
| 20080163073 | Becker et al. | Jul 2008 | A1 |
| 20080192053 | Howell et al. | Aug 2008 | A1 |
| 20080195417 | Surpin et al. | Aug 2008 | A1 |
| 20080223834 | Griffiths et al. | Sep 2008 | A1 |
| 20080229056 | Agarwal et al. | Sep 2008 | A1 |
| 20080263468 | Cappione et al. | Oct 2008 | A1 |
| 20080267107 | Rosenberg | Oct 2008 | A1 |
| 20080270468 | Mao | Oct 2008 | A1 |
| 20080278311 | Grange et al. | Nov 2008 | A1 |
| 20080288306 | MacIntyre et al. | Nov 2008 | A1 |
| 20080294678 | Gorman et al. | Nov 2008 | A1 |
| 20080301643 | Appleton et al. | Dec 2008 | A1 |
| 20090002492 | Velipasalar et al. | Jan 2009 | A1 |
| 20090027418 | Maru et al. | Jan 2009 | A1 |
| 20090088964 | Schaaf et al. | Apr 2009 | A1 |
| 20090100018 | Roberts | Apr 2009 | A1 |
| 20090115786 | Shmiasaki et al. | May 2009 | A1 |
| 20090132921 | Hwangbo et al. | May 2009 | A1 |
| 20090132953 | Reed et al. | May 2009 | A1 |
| 20090144262 | White et al. | Jun 2009 | A1 |
| 20090158185 | Lacevic et al. | Jun 2009 | A1 |
| 20090171939 | Athsani et al. | Jul 2009 | A1 |
| 20090172511 | Decherd et al. | Jul 2009 | A1 |
| 20090179892 | Tsuda et al. | Jul 2009 | A1 |
| 20090187447 | Cheng et al. | Jul 2009 | A1 |
| 20090187464 | Bai et al. | Jul 2009 | A1 |
| 20090222400 | Kupershmidt et al. | Sep 2009 | A1 |
| 20090292626 | Oxford | Nov 2009 | A1 |
| 20090303251 | Balogh | Dec 2009 | A1 |
| 20100057716 | Stefik et al. | Mar 2010 | A1 |
| 20100063961 | Guiheneuf et al. | Mar 2010 | A1 |
| 20100070523 | Delgo et al. | Mar 2010 | A1 |
| 20100076968 | Boyns et al. | Mar 2010 | A1 |
| 20100106420 | Mattikalli et al. | Apr 2010 | A1 |
| 20100162176 | Dunton | Jun 2010 | A1 |
| 20100198684 | Eraker et al. | Aug 2010 | A1 |
| 20100199225 | Coleman et al. | Aug 2010 | A1 |
| 20100277611 | Holt et al. | Nov 2010 | A1 |
| 20100293174 | Bennett et al. | Nov 2010 | A1 |
| 20100305851 | Meyer | Dec 2010 | A1 |
| 20100321399 | Ellren et al. | Dec 2010 | A1 |
| 20110022312 | McDonough et al. | Jan 2011 | A1 |
| 20110072020 | Ngo | Mar 2011 | A1 |
| 20110090254 | Carrino et al. | Apr 2011 | A1 |
| 20110117878 | Barash et al. | May 2011 | A1 |
| 20110137766 | Rasmussen et al. | Jun 2011 | A1 |
| 20110145228 | Laurenzo | Jun 2011 | A1 |
| 20110153368 | Pierre et al. | Jun 2011 | A1 |
| 20110161096 | Buehler et al. | Jun 2011 | A1 |
| 20110170799 | Carrino et al. | Jul 2011 | A1 |
| 20110208724 | Jones et al. | Aug 2011 | A1 |
| 20110218934 | Elser | Sep 2011 | A1 |
| 20110225198 | Edwards et al. | Sep 2011 | A1 |
| 20110238690 | Arrasvuori et al. | Sep 2011 | A1 |
| 20110270705 | Parker | Nov 2011 | A1 |
| 20120066296 | Appleton et al. | Mar 2012 | A1 |
| 20120084118 | Bai et al. | Apr 2012 | A1 |
| 20120106801 | Jackson | May 2012 | A1 |
| 20120144335 | Abeln et al. | Jun 2012 | A1 |
| 20120158527 | Cannelongo et al. | Jun 2012 | A1 |
| 20120159363 | DeBacker et al. | Jun 2012 | A1 |
| 20120173985 | Peppel | Jul 2012 | A1 |
| 20120178473 | Wiren | Jul 2012 | A1 |
| 20120206469 | Hulubei et al. | Aug 2012 | A1 |
| 20120208636 | Feige | Aug 2012 | A1 |
| 20120221580 | Barney | Aug 2012 | A1 |
| 20110323888 | Osann, Jr. | Dec 2012 | |
| 20120323888 | Osann, Jr. | Dec 2012 | A1 |
| 20130006725 | Simanek et al. | Jan 2013 | A1 |
| 20130021445 | Cossette-Pacheco et al. | Jan 2013 | A1 |
| 20130057551 | Ebert et al. | Mar 2013 | A1 |
| 20130060786 | Serrano et al. | Mar 2013 | A1 |
| 20130073377 | Heath | Mar 2013 | A1 |
| 20130076732 | Cervelli et al. | Mar 2013 | A1 |
| 20130100134 | Cervelli et al. | Apr 2013 | A1 |
| 20130101159 | Chao et al. | Apr 2013 | A1 |
| 20130150004 | Rosen | Jun 2013 | A1 |
| 20130176321 | Mitchell et al. | Jul 2013 | A1 |
| 20130179420 | Park et al. | Jul 2013 | A1 |
| 20130254900 | Sathish et al. | Sep 2013 | A1 |
| 20130268520 | Fisher et al. | Oct 2013 | A1 |
| 20130279757 | Kephart | Oct 2013 | A1 |
| 20130282723 | Petersen et al. | Oct 2013 | A1 |
| 20130339891 | Blumenberg et al. | Dec 2013 | A1 |
| 20140011522 | Lin | Jan 2014 | A1 |
| 20140176606 | Narayan et al. | Jun 2014 | A1 |
| 20140218400 | O'Toole et al. | Aug 2014 | A1 |
| 20140333651 | Cervelli et al. | Nov 2014 | A1 |
| 20140337772 | Cervelli et al. | Nov 2014 | A1 |
| 20140361899 | Layson | Dec 2014 | A1 |
| 20140379850 | Peterson | Dec 2014 | A1 |
| 20150029176 | Baxter et al. | Jan 2015 | A1 |
| 20150095355 | Patton | Apr 2015 | A1 |
| 20150100907 | Erenrich et al. | Apr 2015 | A1 |
| 20150106170 | Bonica | Apr 2015 | A1 |
| 20150186821 | Wang et al. | Jul 2015 | A1 |
| 20150187036 | Wang et al. | Jul 2015 | A1 |
| 20150187100 | Berry et al. | Jul 2015 | A1 |
| 20150312323 | Peterson | Oct 2015 | A1 |
| 20150338233 | Cervelli et al. | Nov 2015 | A1 |
| 20150347457 | Zhu et al. | Dec 2015 | A1 |
| 20150356088 | Berkhin | Dec 2015 | A1 |
| 20150370828 | Maurer et al. | Dec 2015 | A1 |
| 20150371430 | Brewington | Dec 2015 | A1 |
| 20150379413 | Robertson et al. | Dec 2015 | A1 |
| 20160180060 | Nelson | Jun 2016 | A1 |
| 20170076227 | Elgie | Mar 2017 | A1 |
| 20170091627 | Terrazas | Mar 2017 | A1 |
| Number | Date | Country |
|---|---|---|
| 2012216622 | May 2015 | AU |
| 102013222023 | Jan 2015 | DE |
| 0 763 201 | Mar 1997 | EP |
| 2 575 107 | Apr 2013 | EP |
| 2858014 | Apr 2015 | EP |
| 2963595 | Jan 2016 | EP |
| 3101559 | Dec 2016 | EP |
| 2516155 | Jan 2015 | GB |
| 2012778 | Nov 2014 | NL |
| 624557 | Dec 2014 | NZ |
| WO 95032424 | Nov 1995 | WO |
| WO 2000009529 | Feb 2000 | WO |
| WO 2001098925 | Dec 2001 | WO |
| WO 2004057268 | Jul 2004 | WO |
| WO 2005013200 | Feb 2005 | WO |
| WO 2008064207 | May 2008 | WO |
| WO 2008128133 | Oct 2008 | WO |
| WO 2009061501 | May 2009 | WO |
| WO 2009123975 | Oct 2009 | WO |
| WO 2011058507 | May 2011 | WO |
| Entry |
|---|
| “A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30. |
| “Andy Turner's GISRUK 2012 Notes” <https://docs.google.com/document/d/1cTmxg7mVx5gd89lqblCYvCEnHA4QAivH4l4WpyPsqE4/edit?pli=l> printed Sep. 16, 2013 in 15 pages. |
| “How to Georectify an Image in ArcMap 10,” dated Feb. 23, 2014, 8 pages, retrieved from http://web.archive.org/web/20140223140531/gis.unc.edu/data/geog370/GeoreferencingLabGEOG37Q_Spring2013.pdf. |
| “HunchLab: Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v4i4/kernel-density-capabilities-added-to-hunchlab/ on Sep. 9, 2014, 2 pages. |
| Barnes et al., “Viewshed Analysis”, GIS-ARC/INFO 2001, <www.evsc.virginia.edu/˜jhp7e/evsc466/student_pres/Rounds.pdf>. |
| Carver et al., “Real-Time Visibility Analysis and Rapid Viewshed Calculation Using a Voxel-Based Modelling Approach,” GISRUK 2012 Conference, April 11-13, Lancaster UK, Apr. 13, 2012, pp. 6. |
| Chen et al., “Bringing Order to the Web: Automatically Categorizing Search Results,” CHI 2000, Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 1-6, 2000, The Hague, The Netherlands, pp. 145-152. |
| Definition “Identify”, downloaded Jan. 22, 2015, 1 page. |
| Definition “Overlay”, downloaded Jan. 22, 2015, 1 page. |
| Dramowicz, Ela, “Retail Trade Area Analysis Using the Huff Model,” Directions Magazine, Jul. 2, 2005 in 10 pages, http://www.directionsmag.com/articles/retail-trade-area-analysis-using-the-huff-model/123411. |
| Ghosh, P., “A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations,” Computer Vision, Graphics, and Image Processing, 1990, vol. 49, pp. 1-35. |
| GIS-NET 3 Public _ Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3_Public/Viewer.html. |
| Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005, May 6, 2002, 37 pages. |
| Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144. |
| Haralick et al., “Image Analysis Using Mathematical Morphology,” Pattern Analysis and Machine Intelligence, IEEE Transactions, Jul. 1987, vol. PAMI-9, No. 4, pp. 532-550. |
| Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16. |
| Huang et al., “Systematic and Integrative Analysis of Large Gene Lists Using DAVID Bioinformatics Resources,” Nature Protocols, 4.1, 2008, 44-57. |
| Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33. |
| Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36. |
| Ipbucker, C., “Inverse Transformation for Several Pseudo-cylindrical Map Projections Using Jacobian Matrix,” ICCSA 2009, Part 1 LNCS 5592, pp. 553-564. |
| Levine, N., “Crime Mapping and the Crimestat Program,” Geographical Analysis, 2006, vol. 38, pp. 41-56. |
| Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8. |
| Mandagere, Nagapramod, “Buffer Operations in GIS,” <http://www-users.cs.umn.edu/˜npramod/enc_pdf.pdf> retrieved Jan. 28, 2010, pp. 7. |
| Map Builder, “Rapid Mashup Development Tool for Google and Yahoo Maps!” <http://web.archive.org/web/20090626224734/http://www.mapbuilder.net/> printed Jul. 20, 2012 in 2 pages. |
| Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com. |
| Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com. |
| Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com. |
| Murray, C., Oracle Spatial Developer's Guide—6 Coordinate Systems (Spatial Reference Systems), <http://docs.oracle.com/cd/B28359_01/appdev.111/b28400.pdf>, Jun. 2009. |
| Open Street Map, “Amm's Diary:Unconnected ways and other data quality issues,” http://www.openstreetmap.org/user/amm/diary printed Jul. 23, 2012 in 3 pages. |
| POI Editor, “How To: Create Your Own Points of Interest,” <http://www.poieditor.com/articles/how_to_create_your_own_points_of_interest/> printed Jul. 22, 2012 in 4 pages. |
| Pozzi et al., “Vegetation and Population Density in Urban and Suburban Areas in the U.S.A.” Third International Symposium of Remote Sensing of Urban Areas Istanbul, Turkey, Jun. 2002, pp. 8. |
| Qiu, Fang, “3d Analysis and Surface Modeling”, <http://web.archive.org/web/20091202221925/http://www.utsa.edu/lrsg/Teaching/EES6513/08-3D.pdf> printed Sep. 16, 2013 in 26 pages. |
| Reddy et al., “Under the hood of GeoVRML 1.0,” SRI International, Proceedings of the fifth symposium on Vurtual Reality Modeling Language (Web3D—VRML), New York, NY, Feb. 2000, pp. 23-28. <http://pdf.aminer.org/000/648/038/under_the_hood_of_geovrml.pdf>. |
| Reibel et al., “Areal Interpolation of Population Counts Using Pre-classi_ed Land Cover Data,” Population Research and Policy Review, 2007, vol. 26, pp. 619-633. |
| Reibel, M., “Geographic Information Systems and Spatial Data Processing in Demography: a Review,” Population Research and Policy Review, 2007, vol. 26, pp. 601-618. |
| Rizzardi et al., “Interfacing U.S. Census Map Files with Statistical Graphics Software: Application and Use in Epidemiology,” Statistics in Medicine, Oct. 1993, vol. 12, No. 19-20, pp. 1953-1964. |
| Snyder, “Map Projections—A Working Manual,” U.S. Geological Survey Professional paper 1395, United States Government Printing Office, Washington: 1987, pp. 11-21 and 60-70. |
| Sonris, “Using the Area of Interest Tools,” <http://web.archive.org/web/20061001053327/http://sonris-www.dnr.state.la.us/gis/instruct_files/tutslide12> printed Jan. 3, 2013 in 1 page. |
| Tangelder et al., “Freeform Shape Matching Using Minkowski Operations,” The Netherlands, Jun. 1996, pp. 12. |
| Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011. |
| Valentini et al., “Ensembles of Learning Machines”, M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20. |
| VB Forums, “Buffer A Polygon,” Internet Citation, <http://www.vbforums.com/showthread.php?198436-Buffer-a-Polygon>, Specifically Thread #1, #5 & #11 retrieved on May 2, 2013, pp. 8. |
| Vivid Solutions, “JTS Topology Suite: Technical Specifications,” <http://www.vividsolutions.com/jts/bin/JTS%20Technical%20Specs.pdf> Version 1.4, 2003, pp. 36. |
| Wikipedia, “Douglas_Peucker-Algorithms,” <http://de.wikipedia.org/w/index.php?title=Douglas-Peucker-Algorithmus&oldid=91846042> printed Jul. 2011, pp. 2. |
| Wikipedia, “Ramer_Douglas_Peucker Algorithm,” <http://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm> printed Jul. 2011, pp. 3. |
| Wongsuphasawat et al., “Visual Analytics for Transportation Incident Data Sets,” Transportation Research Record 2138, 2009, pp. 135-145. |
| Woodbridge, Stephen, “[geos-devel] Polygon simplification,” <http://lists.osgeo.org/pipermail/geos-devel/2011-May/005210.html> dated May 8, 2011, pp. 3. |
| Official Communication for EP Appln. No. 18174839.3 dated Aug. 28, 2019, 6 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20180348991 A1 | Dec 2018 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62512638 | May 2017 | US |
