Patent Grant
10572487
This application hereby incorporates by reference in their entireties, and for all purposes, each of the following:
U.S. Pat. No. 8,799,240 entitled “System and Method for Investigating Large Amounts of Data,” which issued from U.S. patent application Ser. No. 13/167,680 filed Jun. 23, 2011 (“the '240 patent”).
U.S. Pat. No. 9,092,482 entitled “Fair Scheduling for Mixed-Query Loads,” which issued from U.S. patent application Ser. No. 13/826,228 filed Mar. 14, 2013 (“the '482 patent”).
U.S. patent application Ser. No. 14/859,882 entitled “Systems and Interactive User Interfaces For Dynamic Retrieval, Analysis, and Triage of Data Items” filed Sep. 21, 2015 (“the '882 application”).
In the area of computer-based platforms, a database may be queried.
The systems, methods, and devices described herein each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this disclosure, several non-limiting features will now be discussed briefly.
One embodiment includes a computer-implemented method for scheduling recurrent searches of multiple disparate electronic logs and for distributing results of the recurrent searches, the computer-implemented method comprising: storing a first plurality of search results in a non-transitory computer storage medium; accessing a search object, the search object comprising one or more search terms, first and second data source identifiers, and a frequency, wherein the first data source identifiers corresponds to a first data source and the second data source identifier corresponds to a second data source, and wherein each data source of the first and second data sources comprises an electronic log; determining to query the first and second data sources based at least in part on the frequency; querying the first and second data sources, wherein each electronic log of the first and second data sources comprises electronic log entries, wherein said querying determines a second plurality of search results; comparing the first plurality of search results to the second plurality of search results; in response to said comparison, determining a new search result, wherein the new search result is present in the second plurality of search results and not present in the first plurality of search results; and transmitting a first alert, wherein the first alert corresponds to the new search result.
In some embodiments, the computer-implemented method of the preceding paragraph can include a combination or sub-combination of features. The first alert can include an electronic communication to a recipient. The computer-implemented method can further include: serializing the first plurality of search results to first data, wherein storing the first plurality of search results comprises storing the first data in the non-transitory computer storage medium; accessing the first data from the non-transitory computer storage medium; and deserializing the first data to a first plurality of objects, wherein comparing the first plurality of search results to the second plurality of search results comprises comparing the first plurality of objects to the second plurality of search results. The computer-implemented method can further include: serializing the second plurality of search results to second data; and replacing, in the non-transitory computer storage medium, the first data with the second data. The computer-implemented method can further include: querying the first data source at a first time, wherein said querying of the first data source determines the first plurality of search results, wherein the new search result corresponds to a log entry in the first data source, the log entry comprising a timestamp, the timestamp predating the first time, and wherein the log entry was added to the first data source after the first time. The computer-implemented method can further include: receiving, from a user interface, user input corresponding to data properties of the search object; and generating the first search object from the user input. The first plurality of search results can correspond to a first set of data objects, and the second plurality of search results can correspond to a second set of data objects, and wherein comparing the first plurality of search results to the second plurality of search results comprises using a set comparison operation on the first set of data objects and the second set of data objects. The search object can further include an event condition, and determining to query the first and second data sources is further based at least in part on an event condition. The computer-implemented method can further include: receiving an event, and wherein determining to query the first and second data sources is further based at least in part on the event condition indicating that the event has occurred. The event can correspond to a data sync of at least one of the first data source or the second data source.
Another embodiment includes a non-transitory computer storage medium for storing computer executable instructions that when executed by a computer hardware processor perform operations comprising: accessing a search object, the search object comprising one or more search terms, a data source identifier, and a frequency, wherein the data source identifier corresponds to a first data source; querying the first data source at a first time, wherein said querying at the first time determines a first plurality of search results; determining to query the first data source again based at least in part on the frequency; querying the first data source at a second time, wherein said querying at the second time determines a second plurality of search results; comparing the first plurality of search results to the second plurality of search results; in response to said comparison, determine a new search result, wherein the new search result is present in the second plurality of search results and not present in the first plurality of search results; and transmitting a first alert, wherein the first alert corresponds to the new search result.
In some embodiments, the non-transitory computer storage medium of the preceding paragraph can include a combination or sub-combination of features. The first alert can include an electronic communication to a recipient. The operations can further include: serializing the first plurality of search results to first data; storing the first data in a second non-transitory computer storage medium; accessing the first data from the second non-transitory computer storage medium; and deserializing the first data to a first plurality of objects, wherein comparing the first plurality of search results to the second plurality of search results comprises comparing the first plurality of objects to the second plurality of search results. The operations can further include: serializing the second plurality of search results to second data; and replacing, in the second non-transitory computer storage medium, the first data with the second data. The new search result can correspond to a log entry in the first data source, the log entry can include a timestamp, the timestamp predates the first time, and wherein the log entry was added to the first data source between the first time and the second time. The operations can further include: receiving, from a user interface, user input corresponding to data properties of the search object; and generating the first search object from the user input. The first plurality of search results can correspond to a first set of data objects, and the second plurality of search results can correspond to a second set of data objects, and wherein comparing the first plurality of search results to the second plurality of search results comprises using a set comparison operation on the first set of data objects and the second set of data objects. The search object can further include an event condition, and determining to query the first data source at the first time is further based at least in part on an event condition. The operations can further include: receiving an event, and wherein determining to query the first data source at the first time is further based at least in part on the event condition indicating that the event has occurred. The event can correspond to a data sync of at least the first data source.
Another embodiment includes a system for scheduling recurrent searches of multiple disparate data sources and for distributing results of the recurrent searches, the system comprising: a non-transitory computer storage medium configured to store a first plurality of search results; a search system, the search system configured to search a plurality of data sources, wherein each data source of the plurality of data sources comprises an electronic log; an alert system; and one or more hardware computer processors programmed, via executable code instructions, to: access a search object, the search object comprising one or more search terms, a plurality of data source identifiers, and an execution condition, wherein the plurality of data source identifiers corresponds to first and second data sources of the plurality of data sources; determine to query the first and second data sources based at least in part on the execution condition; query, via the search system, the first and second data sources, wherein each electronic log of the first and second data sources comprises electronic log entries, wherein said querying determines a second plurality of search results; compare the first plurality of search results to the second plurality of search results; in response to said comparison, determine a new search result, wherein the new search result is present in the second plurality of search results and not present in the first plurality of search results; transmit a first alert to the alert system, wherein the first alert corresponds to the new search result.
In some embodiments, the computing system of the preceding paragraph can include a combination or sub-combination of features. The execution condition can include at least one of a frequency or an event condition. The one or more hardware processors can be further programmed to: receive an event, and wherein determining to query the first and second data sources is further based at least in part on the execution condition indicating that the event has occurred. The event can correspond to a data sync of at least one of the first data source or the second data source. The one or more hardware processors can be further programmed to: serialize the first plurality of search results to first data, wherein the non-transitory computer storage medium is configured to store the first plurality of search results as the first data; access the first data from the non-transitory computer storage medium; and deserialize the first data to a first plurality of objects, wherein comparing the first plurality of search results to the second plurality of search results comprises comparing the first plurality of objects to the second plurality of search results. The one or more hardware processors can be further programmed to: serialize the second plurality of search results to second data; and replace, in the non-transitory computer storage medium, the first data with the second data. The one or more hardware processors can be further programmed to: query, via the search system, the first data source at a first time, wherein said querying of the first data source determines the first plurality of search results, wherein the new search result corresponds to a log entry in the first data source, the log entry comprises a timestamp, the timestamp predates the first time, and wherein the log entry was added to the first data source after the first time. The first plurality of search results can correspond to a first set of data objects, and the second plurality of search results can correspond to a second set of data objects, and wherein comparing the first plurality of search results to the second plurality of search results comprises using a set comparison operation on the first set of data objects and the second set of data objects.
The following drawings and the associated descriptions are provided to illustrate embodiments of the present disclosure and do not limit the scope of the claims. Aspects and many of the attendant advantages of this disclosure will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:
Although certain preferred embodiments and examples are disclosed below, inventive subject matter extends beyond the specifically disclosed embodiments to other alternative embodiments and/or uses and to modifications and equivalents thereof. Thus, the scope of the claims appended hereto is not limited by any of the particular embodiments described below. For example, in any method or process disclosed herein, the acts or operations of the method or process may be performed in any suitable sequence and are not necessarily limited to any particular disclosed sequence. Various operations may be described as multiple discrete operations in turn, in a manner that may be helpful in understanding certain embodiments; however, the order of description should not be construed to imply that these operations are order dependent. Additionally, the structures, systems, and/or devices described herein may be embodied as integrated components or as separate components. For purposes of comparing various embodiments, certain aspects and advantages of these embodiments are described. Not necessarily all such aspects or advantages are achieved by any particular embodiment. Thus, for example, various embodiments may be carried out in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other aspects or advantages as may also be taught or suggested herein.
In order to facilitate an understanding of the systems and methods discussed herein, a number of terms are defined below. The terms defined below, as well as other terms used herein, should be construed to include the provided definitions, the ordinary and customary meaning of the terms, and/or any other implied meaning for the respective terms. Thus, the definitions below do not limit the meaning of these terms, but only provide example definitions.
Ontology: Stored information that provides a data model for storage of data in one or more databases. For example, the stored data may comprise definitions for object types and property types for data in a database, and how objects and properties may be related.
Database: Any data structure (and/or combinations of multiple data structures) for storing and/or organizing data, including, but not limited to, relational databases (e.g., Oracle databases, mySQL databases, etc.), non-relational databases (e.g., NoSQL databases, etc.), in-memory databases, spreadsheets, as comma separated values (CSV) files, eXtendible markup language (XML) files, TeXT (TXT) files, flat files, spreadsheet files, and/or any other widely used or proprietary format for data storage. Databases are typically stored in one or more data stores. Accordingly, each database referred to herein (e.g., in the description herein and/or the figures of the present application) is to be understood as being stored in one or more data stores. The terms “database” and “data source” may be used interchangeably in the present disclosure.
Data Store: Any computer readable storage medium and/or device (or collection of data storage mediums and/or devices). Examples of data stores include, but are not limited to, optical disks (e.g., CD-ROM, DVD-ROM, etc.), magnetic disks (e.g., hard disks, floppy disks, etc.), memory circuits (e.g., solid state drives, random-access memory (RAM), etc.), and/or the like. Another example of a data store is a hosted storage environment that includes a collection of physical data storage devices that may be remotely accessible and may be rapidly provisioned as needed (commonly referred to as “cloud” storage).
Data Object (Object), Data Item (Item), or Data Entity (Entity): A data container for information. A data object may be associated with a number of definable properties (as described herein). As described herein, a search object is an example data object for conducting recurrent searches. A data object may represent a specific thing, or a group of things, in the world. For example, a data object may represent an item such as a person, a place, an organization, an account, a computer, an activity, or other noun. A data item may represent an event that happens at a point in time or for a duration. A data item may represent a document or other unstructured data source such as an e-mail message, a news report, or a written paper or article. Each data item may be associated with a unique identifier that uniquely identifies the data item. The terms “data object,” “data item,” “data entity,” “item,” “object,” and “entity” may be used interchangeably and/or synonymously in the present disclosure.
Item (or Entity or Object) Type: Type of a data item (for example, Person, Event, or Document). Data item types may be defined by an ontology and may be modified or updated to include additional data item types. An data item definition (for example, in an ontology) may include how the data item is related to other data items, such as being a sub-data item type of another data item type (for example, an agent may be a sub-data item of a person data item type), and the properties the data item type may have.
Properties: Also referred to herein as “attributes” or “metadata” of data items. A property of a data item may include any item of information associated with, and/or relevant to, the data item. At a minimum, each property of a data item has a property type and a value or values. For example, properties associated with a person data item may include a name (for example, John Doe), an address (for example, 123 S. Orange Street), and/or a phone number (for example, 800-0000), among other properties. In another example, properties associated with a computer data item may include a list of users (for example, user1, user 2, and the like), and/or an IP (internet protocol) address, among other properties.
Property Type: The type of data a property is, such as a string, an integer, or a double. Property types may include complex property types, such as a series data values associated with timed ticks (for example, a time series), and the like.
Property Value: The value associated with a property, which is of the type indicated in the property type associated with the property. A property may have multiple values.
Recurrent (or Recurring) Search: Refers to a search of a data source that is scheduled and/or occurs one or more times. A non-limiting example recurrent search is a periodic search, such as a search occurring and/or being initiated every 15 minutes, 30 minutes, hourly, daily, weekly, any other periodic pattern, and/or some combination thereof. In some embodiments, a recurrent search may be based on some other schedule that is non-periodic. For example, a recurrent search may be triggered by an event and/or may be based on evaluation of data coming into the system. For example, the system may be configured to initiate a search when new data is added to a data source, which may occur on an ad-hoc basis. Accordingly, the event and/or data-driven searches may occur in real-time or substantially in real-time.
Overview
Analysts may be interested in searching enormous data sets on a recurring and/or automatic basis. The data sets may be from multiple disparate data sources that include gigabytes, terabytes, or even petabytes of data. Non-limiting example data sources include electronic logs, such as, proxy logs, virtual private network (“VPN”) logs, malware lists, email logs, phone call logs, vehicle logs, geographic logs, or other electronic logs discussed herein. Example searches include partial text string matching for known uniform resource locators (“URLs”) or names of malware within the electronic logs. Accordingly, the systems and techniques discussed herein may be used to automatically identify potential threats that may be intrinsically tied to network and/or computer technology, such as proxy logs, network security, malware, phishing, and/or other computer-related areas. Those analysts may also be interested in receiving alerts via electronic communications and/or via an alert system to review search results.
Disclosed herein are systems and methods for enabling a user to specify searches of multiple data sources to automatically occur on a periodic basis. For example, a user may create a search object that specifies the data sources of interest, search terms, and a frequency for the search to occur. The user may configure new and/or edit recurrent searches on an ad-hoc basis through the user interface of the system. Example frequencies for recurrent searches include every fifteen minutes, thirty minutes, hourly, daily, weekly, any other periodic pattern, and/or some combination thereof. In some embodiments, queries are sent to a search system that efficiently searches multiple disparate data sources. For example, the search system may be optimized to efficiently search the data sources based on the last search timestamp to only search data source entries after the last search timestamp. The user may also review and edit previously created searches, and review results of searches. The system automatically performs the specified searches, and notifies the user and/or a team of the user each time new results are found. For example, an email electronic communication alert, such as email, may be sent to one or more users and/or teams. In some embodiments, alerts may be sent to an alert system that enables a user and/or users of one or more permissioned groups to view the search results.
Embodiments of the present disclosure relate to an efficient and/or optimized alerting system. For example, search results may be viewed in more detail in an optimized alert graphical user interface. In an embodiment, data related to search results is transmitted from a search management system to an alert system. In this embodiment, the alert system may use the received data to generate the alert and/or to enhance the received data with additional information that may be useful to an analyst in reviewing the search result. Additionally or alternatively, the alert system may send an electronic communication alert that optionally includes a link to view the alert in the alert system.
Embodiments of the present disclosure relate to a search management system that may automatically search multiple data sources in a memory-efficient and/or resource-efficient manner. For example, the recurrent searches of the search management system may repeatedly search the multiple data sources such that the searching is targeted towards recently added data and/or avoids recurrent searches of previously searched data, which may be from data sources of terabytes or petabytes of data. Accordingly, the systems and methods described herein may provide early notification associated with one or multiple data sources when there has been an update to those respective data sources that correspond to user-specified criteria.
Example Search Management System
The example search management system 100 includes a search process manager 104, a user interface server 106, an alert manager 108, and search storage 116. In this embodiment, a user may perform operations via the user interface server 106 such as selecting data sources of interest, specifying one or more search terms, reviewing and/or editing previously created searches, and/or reviewing results of searches, as described in further detail herein. As illustrated, user created recurrent searches may be stored in search storage 116 as search objects 112. Search process manager 104 may access the search objects 112 to automatically query the data sources 122 via the search system 120. The search process manager 104 may store the search results 114 from the search system 120 in the search storage 116, cause presentation of the results in the user interface server 106, and/or distribute results via the alert system 130, each of which is as described in further detail herein. Additionally or alternatively, the search process manager 104 may store the search results 114 from the search system 120 in the data sources 122 of the search system 120.
In this embodiment, the search management system 100 communicates with the search system 120 and the alert system 130. For example, the search system 120 may be configured to query disparate data sources 122 in an efficient manner. The example alert system 130 may provide a user interface that enables users to view alerts and/or search results. In other embodiments, the search system 120 and/or the alert system 130 are optional and the search management system 100 may query the data sources 122 and/or present the user interfaces described herein.
Example Search Processes
Beginning at block 202, the search process manager 104 accesses a search object. A search object may be created and/or edited via the user interface server 106, which is described in greater detail with respect to
At block 204, the search process manager 104 determines whether to initiate a search based on the accessed search object at block 202. For example, the search process manager 104 checks the status property and determines to initiate a search based on the search object if the status is “enabled.” If the status is “disabled,” the search process manager 104 exits the process loop and returns to block 202 process other search objects and/or this same search object at a later time (for example, the status of the search object may be changed from “disabled” to “enabled.”) The search process manager 104 may also determine whether to initiate a search from the search object based on the current timestamp, and the frequency and the last execution timestamp properties of the search object. For example, the search object contains a frequency property for recurrent searches every fifteen minutes and a last execution timestamp of 2015-10-21 12:45:13 GMT. The search process manager 104 accesses the current timestamp. If the current timestamp is 2015-10-21 12:50:30 GMT, then the search process manager 104 does not initiate a search because the fifteen minute periodic time has not elapsed and the search process manager 104 exits the loop and returns to block 202. However, if the current timestamp is 2015-10-21 13:01:10 GMT, then the search process manager 104 determines that a search should be initiated and proceeds to the next block.
Additionally or alternatively, the search process manager 104 determines whether to initiate a search based on an event. For example, the accessed search object may include an event condition that may cause a search to run. Example events include a data sync event or a scheduled user downtime event. Example user downtime events include when a computing system for users is unavailable and/or a beginning time for when there is low usage by users of the computing system, e.g., after work hours, late at night, and/or early in the morning. Continuing with the example, the search process manager 104 may receive an indication or event and/or determine that the event has occurred, and then initiate a search based on the received indication or event and/or determination that the event has occurred. In some embodiments, it may be advantageous to initiate searches based on events. For example, initiating a search after a data sync may advantageously search the recently updated data. As another example, initiating a search after user downtime may advantageously avoid interfering and/or adversely affecting the user experience since searching the data sources may adversely affect the user experience due to performance impacts from the searching.
At block 206, the search process manager 104 uses the search object to query the one or more data sources via the search system. In some embodiments, the search system 120 includes an Application Programming Interface to receive the one or search terms, the one or more data sources, and other inputs. As discussed herein, the one or more data sources may include electronic logs. Further, the search system 120 may efficiently search the data source(s) to only search those data source entries that have a corresponding timestamp after the last execution timestamp of the search object. Accordingly, previously found search results are not included in the search results from the current periodic search. In other words, in some embodiments, the search process manager 104 searches the date ranges that it has not searched before. For example, if the search process manager 104 initiated a search at 10:00 and then initiated another search again at 10:15, the search process manager 104 would search the search system 120 for the specific search terms in the 10:00-10:15 time range. The most recently searched time or the last execution timestamp is tracked in the search object. Searching by the search system 120 may include textual, partial textual searching, geographic searching, searching using regular expressions, and/or searching using wildcards. For example, if the search string is “www.evil.com,” the search system 120 may search the one or more data sources for entries that match “www.evil.com” or a partial match such as “evil.com.” Additional information regarding searching via indexes and other techniques is described in the '240 patent, e.g., see Col. 15 l. 41-Col. 22 l. 34.
In some embodiments, the search system 120 searches one or more disparate data sources in an efficient manner. The data sources may be from numerous devices from one or more entities, such as proxy logs, VPN logs, malware lists, badge logs, phone call logs, blacklists, whitelists, email logs, process logs, intrusion detection system logs, credit card transaction data, etc. The search system 120 may be agnostic to the type of data sources and may be capable of supporting searches for any types of data sources. The search system 120 may efficiently search a subset of a particular electronic log and not the entire electronic log. For example, the search system 120 may identify a subset of the electronic log entries that have corresponding timestamps after a particular time. Additionally or alternatively, the search system 120 may use indexes and/or checkpoints within the electronic logs and/or data structures corresponding to the electronic logs to efficiently search the electronic logs. As discussed herein, in other embodiments, the search management system 100 searches the data sources directly.
Additional information regarding searching large amounts of data, multiple data sources, and the search system 130 is found in U.S. Pat. Nos. 8,799,240 and 9,092,482. For example, the '240 patent describes searching large amounts of data in Col. 3 l. 6-Col. 22 l. 34, and in particular describes using key-values to efficiently search multiple large data sources, each of which may be used by the search system 130. As another example, the '482 patent describes a efficiently scheduling queries of databases in Col. 3 l. 21-Col. 12 l. 34, which may be used by the search system 130.
In some embodiments, the search object supports complex logic for performing searches. For example, in addition to one or more search terms, the search object may include Boolean instructions for conducting searches. An example Boolean instruction includes Boolean algebra such as: “evil.com & !musicevil.com,” which would match results with “evil.com” but excludes the domain name of “musicevil.com.” Another example Boolean instruction would be to match a particular search term with another condition. In some embodiments, the complex logic may include conditional instructions based on data types. For example, in the same search object, different search terms may be specified for different data types and/or data sources. Continuing with the example, the search object may include the search instruction: “if type==IP address then 101.12.19.11; if type==domain then evil.com,” which would instruct the system to search for “101.12.19.11” among IP address data types and/or data sources and to search for “evil.com” among domain data types and/or data sources.
At block 208, the search process manager 104 receives the search results from the search system 120. The example search result 114A of
At block 210, the alert manager 108 and/or alert system 130 generates and transmits an electronic communication alert. For example, an email alert may be transmitted to one or more email addresses corresponding to particular users and/or list serves. In some embodiments, the email alert contains information identifying the particular search object for which search results were found. Additionally or alternatively, the email alert includes the search results and/or excerpts from the electronic log corresponding to the search results. Additional information regarding electronic communication alerts are described in further detail with respect to
At block 212, the alert manager 108 generates and transmits an alert to the alert system 130. For example, the alert may include the search results and/or other information associated with the respective search object for the search result. The alert system 130 may include user interfaces for presenting the alert information. Additional information regarding alerts, user interfaces, and the alert system 120 are described in further detail with respect to
In some embodiments, the alert manager 108 generates other forms of alerts other than those described up blocks 210 and 212. For example, the alert manager 108 generates textual alerts and/or other data object alerts for use by the search management system 100. For example, the search management system 100 may present the generated alerts via the user interface server 106 and/or may store the alerts in the search storage 116, which is described in further detail below. As discussed herein, at blocks 210 and 212 and/or during other alert distribution, the alert manager 108 uses the properties of the search objects, such as the recipients and/or the permissions of the respective search objects, to determine the recipients of the alerts.
At block 214, the alert manager 108 stores the search results and/or alerts in the search storage 116. In some embodiments, the search results and/or alerts may be viewed in a user interface. Additionally or alternatively, the search management system 100 may distribute the search results and/or alerts to users and/or to other systems. In some embodiments, some of blocks 210, 212, and/or 214 are optional. For example, the alert manager 108 may send one alert instead of multiple alerts via different systems. Accordingly, following the sending of one or more alerts, process 200 returns to block 202 to continue checking and conducting recurrent searches. For example, the search object with a frequency property of 15 minutes will cause a search to be executed by the search process manager approximately every 15 minutes. In some embodiments, if there are no search results based on a particular search then no alerts will be sent.
Access Control
Example access control item 330 includes group 321 and permission 322. Example group 321 identifies a set of users and/or teams. Example permission 322 identifies an operation that a user in the set can perform on search data 340. Additionally or alternatively, example permission 322 further identifies an operation the user in the set can perform on access control list 300. Non-limiting examples of permission 322 include read, write, owner, create, delete, read only, and/or some combination thereof.
In some embodiments, if access control list 300 has a classification 330, then a user must be authorized for the classification 330. Thus, classification 330 may override permission 322 granted to the entity and/or user. For example, one possible set of classification markings as part of classification 330 include “Top Secret,” “Secret,” “Confidential,” “Restricted,” “For Official Use Only,” among others, while another example classification scheme may use the markings: “Public” and “Restricted,” among others. For example, the permissions of an access control list may indicate that a particular data object should not be shared with particular users.
Example Search Management User Interfaces
Example Electronic Communication Alerts
In other embodiments, the search management system 100 may send electronic communication alert 850 that includes the search results and/or excerpts from a log file. For example, elements of the example electronic communication alert 850 may be similar to electronic communication alert 800, such as similarities between links 804A, 806A, and 808A of alert 800 and links 854A, 856A, and 858A of alert 850, respectively. Alert 850 may include search results 852 that displays portions of the electronic log where there was a positive match based on the search object. In some embodiments, search results 852 may include a portion of the search results. For example, search results 852 may include a predefined and/or configurable number of search results, such as the 100 most recent entries from the electronic log. The search results 852 of the electronic communication may be configurable. For example, an administrator may configure the electronic communication to omit particular columns from the search results 852. As illustrated in the body of the communication alert 850, the communication alert 850 may report new results as compared to a previous search, which may correspond to the example process as described in further detail with respect to
The example search results 860 illustrate another example table that may be included in the communication alert 850. For example, instead of listing IP addresses as shown in the search results 852, the search results 860 may list license plate identifiers corresponding to geographic coordinates such as latitudinal and longitudinal coordinates. As described herein, the search management system 100 may be capable of scheduling recurrent searches to identify data entries that correspond to a geographic location and/or area.
In some embodiments, the electronic communication alerts may be configurable. For example, the search management system 100 may allow users and/or administrators to configure the electronic communication alerts. Continuing with the example, a user and/or administrator may specify the information and/or links in the electronic communication alerts, such as any of the information and/or features in the user interfaces described herein.
Example Alert User Interfaces
In some embodiments, user interfaces 900, 1000, and/or 1100 may be configured via the alert system 130 to display search results and/or alerts based on permissions. For example, a search object may be configured to not only particular user, however, the permissions associated with the search object may enable the user to view the search results and/or alerts and user interfaces 900, 1000, and/or 1100 because the user may belong to the permissioned group. A permissioned group may be based on the access control list 300 as described herein with respect to
Embodiments of the present disclosure relate to a search management system that may automatically search multiple data sources and may be capable of detecting retrospective changes to a data source. For example, data may be backfilled in a data source and the recurrent searches of the search management system may be capable of detecting a matching search result within the backfilled data. The search management system may be able to determine search results in a memory-efficient and/or resource-efficient manner. In some embodiments, the capability to identify search results retrospectively, such as in the case of backfilled data, may occur alternatively or additionally to the processes of avoiding recurrent searches of previously searched data, as described herein.
Additional Example Search Management Systems
As illustrated, user created recurrent searches may be stored in search storage 116 as search objects 112. For example, the search object 112B-112D may represent various properties of a search object. In the example, the search object 112B-112D may be stored and/or accessed in a JavaScript Object Notation (JSON) data format. The example search object 112B-112D includes one or more “queries.” An example query may specify a data source to be queried and one or more matching criteria, which may include one or more comparison operators. For example, various matching criteria may correspond to textual matching, partial textual matching, geographic matching at one or more coordinates and/or within a geographic area, matching using regular expressions, and/or matching using wildcards. The search object 112B-112D may specify: one or more indices of a data source; a frequency; a parameter for the oldest search results to look for; a parameter for when the search should begin; a parameter for when the search should expire (“expiryDate”), such as automatically becoming disabled; a predetermined and/or maximum number of results to return; one or more recipients; an event that may cause a search to run; and/or a permissions group. Search process manager 104 may access the search objects 112 to automatically query the data sources 122 via the search system 120.
As described herein, the search process manager 104 may store the search results 114 from the search system 120 in the search storage 116. For example, for a current search, the search results 114 may be stored and/or serialized to the search storage 116. In some embodiments, the most recent search results 114 may replace previous search results to conserve memory resources. The search process manager 104 may cause presentation of the results in the user interface server 106, and/or distribute results via the alert system 130, each of which is as described in further detail herein. In some embodiments, the user interface server 106 and/or the search management system 100 enables a user the capability of row-by-row deletion of data entries in the data sources 122.
In some embodiments, the search management system 100 enables a user to search using a “tag.” A tag may be a data structure identifying multiple related indices from multiple data types and/or data sources. For example, “IP” or “domain name” indices may be found in multiple discrete data types and/or data sources. Thus, a tag for “IP” indices in multiple data types and/or data sources may enable searching of multiple data types and/or data sources at once for the same search term and/or parameter. A recurring search may also be configured with a search object that includes one or more search terms and/or parameters for one or more tags.
Additional Example Search Processes
Beginning at block 1402, the search process manager 104 accesses a search object. A search object may be created and/or edited via the user interface server 106, which is described in greater detail with respect to
At block 1404, the search process manager 104 determines whether to initiate a search based on the accessed search object at block 1402. For example, the search process manager 104 checks the status property and determines to initiate a search based on the search object if the status is “enabled.” If the status is “disabled,” the search process manager 104 exits the process loop and returns to block 1402 process other search objects and/or this same search object at a later time (for example, the status of the search object may be changed from “disabled” to “enabled.”) The search process manager 104 may also determine whether to initiate a search from the search object based on a current timestamp, the start and/or expiration dates of the search object, the frequency the search object, an event, and/or a last execution timestamp associated with the search object. In one example, the example search object contains a frequency property for recurrent searches every fifteen minutes and there is an associated last execution timestamp of 2015-10-21 12:45:13 GMT. The search process manager 104 accesses the current timestamp. If the current timestamp is 2015-10-09 12:50:30 GMT (and the start and expiration dates are 2015-09-01 00:00:00 and 2015-10-01 00:00:00, respectively), then the search process manager 104 does not initiate a search because the fifteen minute periodic time has not elapsed and the search process manager 104 exits the loop and returns to block 202. However, if the current timestamp is 2015-10-21 13:01:10 GMT, then the search process manager 104 determines that a search should be initiated and proceeds to the next block. As described herein, the search process manager 104 may evaluate an execution condition of the search object to determine whether to initiate a search. For example, initiating a search after receiving and/or determining an event has occurred, which is described in further detail with respect to block 204 of
At block 1406, the search process manager 104 uses the search object to query the one or more data sources via the search system. In some embodiments, the search system 120 includes an Application Programming Interface to receive the one or search terms, the one or more data sources, and other inputs. As discussed herein, the one or more data sources may include electronic logs. The search system 120 may search the entire data sources, such as electronic logs, for the one or more search terms. Additionally or alternatively to block 206 of
At block 1407, the search process manager 104 receives the search results from the search system 120. In
At block 1408, the search process manager 104 compares the current search results with previous search results, where applicable. For example, the search results may be in a data object format. Example data object formats include Java or C# data objects. As described herein, previous search results may be accessed in a data object format. Accordingly, the search process manager 104 may compare the current search results and the previous search results. An example comparison may be a Set comparison, such as a Java Set comparison operation. If this is the first time that a recurrent search detects results than no comparison is necessary and the current search results would be new results and the search process manager 104 would proceed to block 1410. As described herein, in some embodiments the search results may be serialized and/or stored in a serialized data format in the search storage 116. Accordingly, the previous search results may be deserialized from the search storage 116 into data objects for comparison in block 1408.
At block 1409, based on the comparison at block 1408, the search process manager 104 determines if there any new results and/or any change in results. For example, the comparison at block 1408, such as a Set comparison, determines that there any new data objects in the current search results as compared to the previous search results. If there are no new search results, the search process manager 104 returns to block 1402. Returning to block 1402 after block 1409 may efficiently process the search results because blocks 1410, 1412, and/or 1414 may be skipped, which may conserve resources and/or reduce processor usage. If there are new search results, the search process manager 104 proceeds to block 1410.
At block 1410, the alert manager 108 generates and transmits an electronic communication alert. For example, an email alert may be transmitted to one or more email addresses corresponding to particular users and/or list serves. In some embodiments, the email alert contains information identifying the particular search object for which search results were found. Additionally or alternatively, the email alert includes the search results and/or excerpts from the data source(s) corresponding to the search results. Additional information regarding electronic communication alerts are described in further detail with respect to
At block 1412, the alert manager 108 and/or alert system 130 generates and transmits an alert to the alert system 130. For example, the alert may include the search results and/or other information associated with the respective search object for the search result. The alert system 130 may include user interfaces for presenting the alert information. Additional information regarding alerts, user interfaces, and the alert system 120 are described in further detail with respect to
At block 1414, the alert manager 108 stores the search results and/or alerts in the search storage 116. For example, the current search results may be stored in the search storage 116. An example method for storing search results that are in a data object format may be serializing the objects and storing the serialized objects in the search storage 116. In some embodiments, the serialized search results may replace the previous search results in the search storage 116 to conserve memory resources in the search storage 116. Accordingly, the next time the current search runs, the search process manager 104 may retrieve the previous results from the search storage 116, at block 1408, such as by converting the serialized results into data objects also known as deserialization. In some embodiments, block 1414 may be executed any time search results are retrieved, thereby storing search results after any run, instead of being stored when there are new results as illustrated in the example method 1400. In some embodiments, search results in the search storage 116 may not be discarded and/or replaced. For example, the search results for each recurrent search may be stored for a period of time. Block 1414 may be similar to block 214 of
Additional Example Search Management User Interfaces
Implementation Mechanisms
The various computing device(s) discussed herein, such as the search management system 100, search process manager 104, alert manager 108, user interface server 106, and/or user computing device 102, are generally controlled and coordinated by operating system software, such as, but not limited to, iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, Macintosh OS X, VxWorks, or other compatible operating systems. In other embodiments, the computing devices 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 search management system 100 may be hosted and/or executed on one or more computing devices with one or more hardware processors and with any of the previously mentioned operating system software.
The search management system 100 may execute software, e.g., standalone software applications, applications within browsers, network applications, etc., whether by the particular application, the operating system, or otherwise. Any of the systems discussed herein may be performed by the search management system 100 and/or a similar computing system having some or all of the components discussed with reference to
The search management system 100 includes a bus 1202 or other communication mechanism for communicating information, and a hardware processor, or multiple processors, 1204 coupled with bus 1202 for processing information.
The search management system 100 also includes a main memory 1206, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 1202 for storing information and instructions to be executed by processor(s) 1204. Main memory 1206 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor(s) 1204. Such instructions, when stored in storage media accessible to processor(s) 1204, render the search management system 100 into a special-purpose machine that is customized to perform the operations specified in the instructions. Such instructions, as executed by hardware processors, may implement the methods and systems described herein for scheduling recurrent searches from multiple data sources and/or for providing the search results to one or more users.
The search management system 100 further includes a read only memory (ROM) 1208 or other static storage device coupled to bus 1202 for storing static information and instructions for processor(s) 1204. A storage device 1210, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 1202 for storing information and instructions. The search process manager 104 and/or the alert manager 108 of
In some embodiments, each of the search storage 116 and/or the data sources 122 of
The search management system 100 and/or user computing device 102 may be coupled via bus 1202 to a display 1212, such as a cathode ray tube (CRT) or LCD display or touch screen, for displaying information to a computer user. An input device 1214 is coupled to bus 1002 for communicating information and command selections to processor 1204. One type of input device 1214 is a keyboard including alphanumeric and other keys. Another type of input device 1214 is a touch screen. Another type of user input device is cursor control 1216, such as a mouse, a trackball, a touch screen, or cursor direction keys for communicating direction information and command selections to processor 1204 and for controlling cursor movement on display 1212. This input device may have 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 search management system 100 may include a presentation module to implement a GUI, for example,
In general, the word “instructions,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software units, possibly having entry and exit points, written in a programming language, such as, but not limited to, Java, Lua, C, C++, or C#. A software unit 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, but not limited to, BASIC, Perl, or Python. It will be appreciated that software units may be callable from other units or from themselves, and/or may be invoked in response to detected events or interrupts. Software units configured for execution on computing devices by their hardware processor(s) 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. Generally, the instructions 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 search management system 100, or components of it, such as the search process manager 104, the alert manager 108, user interface server 106 of
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 1210. Volatile media includes dynamic memory, such as main memory 1206. 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 1202. 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(s) 1204 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 may load the instructions into its dynamic memory and send the instructions over a telephone or cable line using a modem. A modem local to the search management system 100 may receive the data on the telephone or cable 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 1202. Bus 1202 carries the data to main memory 1206, from which the processor(s) 1204 retrieves and executes the instructions. The instructions received by main memory 1206 may retrieve and execute the instructions. The instructions received by main memory 1206 may optionally be stored on storage device 1210 either before or after execution by processor(s) 1204.
The search management system 100 also includes a communication interface 1218 coupled to bus 1202. Communication interface 1218 provides a two-way data communication coupling to a network link 1220 that is connected to a local network 1222. For example, communication interface 1218 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 1218 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to be communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 1218 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 1220 typically provides data communication through one or more networks to other data devices. For example, network link 1220 may provide a connection through local network 1222 to a host computer 1224 or to data equipment operated by an Internet Service Provider (ISP) 1226. ISP 1226 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 1228. Local network 1222 and Internet 1228 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 1220 and through communication interface 1218, which carry the digital data to and from the search management system 100, are example forms of transmission media.
A network, such as the network 160 of
The search management system 100 can send messages and receive data, including program code, through the network(s), network link 1220 and communication interface 1218. In the Internet example, a server 1230 might transmit a requested code for an application program through Internet 1228, ISP 1226, local network 1222 and communication interface 1218.
The received code may be executed by processor(s) 1204 as it is received, and/or stored in storage device 1210, or other non-volatile storage for later execution.
In some embodiments, the search management system 100 may operate in a distributed computing environment including several computer systems that are interconnected using one or more computer networks. The search management system 100 could also operate within a computing environment having a fewer or greater number of devices than are illustrated in
It will be appreciated that while the present disclosure typically discusses searching of malware and/or proxy logs, the systems and methods described herein may be agnostic to the types of data being searched and/or may search any type of data source, such as, credit card logs, phone logs, etc., for example.
Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code instructions 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 subcombinations 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.
The term “a” as used herein should be given an inclusive rather than exclusive interpretation. For example, unless specifically noted, the term “a” should not be understood to mean “exactly one” or “one and only one”; instead, the term “a” means “one or more” or “at least one,” whether used in the claims or elsewhere in the specification and regardless of uses of quantifiers such as “at least one,” “one or more,” or “a plurality” elsewhere in the claims or specification.
The term “comprising” as used herein should be given an inclusive rather than exclusive interpretation. For example, a general purpose computer comprising one or more processors should not be interpreted as excluding other computer components, and may possibly include such components as memory, input/output devices, and/or network interfaces, among others.
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 units, 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.
Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are hereby incorporated by reference under 37 CFR 1.57. This application is a continuation of U.S. patent application Ser. No. 15/152,017 entitled “Periodic Database Search Manager For Multiple Data Sources” filed May 11, 2016, which claims benefit of U.S. Provisional Patent Application Ser. No. 62/249,088 entitled “Periodic Database Search Manager for Multiple Data Sources” filed Oct. 30, 2015 and U.S. Provisional Patent Application Ser. No. 62/330,465 entitled “Periodic Database Search Manager for Multiple Data Sources” filed May 2, 2016. Each of these applications are hereby incorporated by reference herein in their entireties.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5109399 | Thompson | Apr 1992 | A |
| 5329108 | Lamoure | Jul 1994 | A |
| 5632009 | Rao et al. | May 1997 | A |
| 5670987 | Doi et al. | Sep 1997 | A |
| 5724575 | Hoover et al. | Mar 1998 | A |
| 5781704 | Rossmo | Jul 1998 | A |
| 5798769 | Chiu et al. | Aug 1998 | A |
| 5845300 | Comer | Dec 1998 | A |
| 5872973 | Mitchell et al. | Feb 1999 | A |
| 5897636 | Kaeser | Apr 1999 | A |
| 6003040 | Mital et al. | Dec 1999 | A |
| 6057757 | Arrowsmith et al. | May 2000 | A |
| 6073129 | Levine et al. | Jun 2000 | A |
| 6091956 | Hollenberg | Jul 2000 | A |
| 6094653 | Li et al. | Jul 2000 | A |
| 6161098 | Wallman | Dec 2000 | A |
| 6167405 | Rosensteel, Jr. et al. | Dec 2000 | A |
| 6219053 | Tachibana et al. | Apr 2001 | B1 |
| 6232971 | Haynes | May 2001 | B1 |
| 6243717 | Gordon et al. | Jun 2001 | B1 |
| 6247019 | Davies | Jun 2001 | B1 |
| 6279018 | Kudrolli et al. | Aug 2001 | B1 |
| 6304873 | Klein et al. | Oct 2001 | B1 |
| 6341310 | Leshem et al. | Jan 2002 | B1 |
| 6366933 | Ball et al. | Apr 2002 | B1 |
| 6369835 | Lin | Apr 2002 | B1 |
| 6374251 | Fayyad et al. | Apr 2002 | B1 |
| 6418438 | Campbell | Jul 2002 | B1 |
| 6430305 | Decker | Aug 2002 | B1 |
| 6456997 | Shukla | Sep 2002 | B1 |
| 6510504 | Satyanarayana | Jan 2003 | B2 |
| 6549752 | Tsukamoto | Apr 2003 | B2 |
| 6549944 | Weinberg et al. | Apr 2003 | B1 |
| 6560620 | Ching | May 2003 | B1 |
| 6567936 | Yang et al. | May 2003 | B1 |
| 6574635 | Stauber et al. | Jun 2003 | B2 |
| 6581068 | Bensoussan et al. | Jun 2003 | B1 |
| 6594672 | Lampson et al. | Jul 2003 | B1 |
| 6631496 | Li et al. | Oct 2003 | B1 |
| 6642945 | Sharpe | Nov 2003 | B1 |
| 6674434 | Chojnacki et al. | Jan 2004 | B1 |
| 6714936 | Nevin, III | Mar 2004 | B1 |
| 6745382 | Zothner | Jun 2004 | B1 |
| 6775675 | Nwabueze et al. | Aug 2004 | B1 |
| 6820135 | Dingman | Nov 2004 | B1 |
| 6828920 | Owen et al. | Dec 2004 | B2 |
| 6839745 | Dingari et al. | Jan 2005 | B1 |
| 6877137 | Rivette et al. | Apr 2005 | B1 |
| 6906717 | Couckuyt et al. | Jun 2005 | B2 |
| 6976210 | Silva et al. | Dec 2005 | B1 |
| 6978419 | Kantrowitz | Dec 2005 | B1 |
| 6980984 | Huffman et al. | Dec 2005 | B1 |
| 6985950 | Hanson et al. | Jan 2006 | B1 |
| 7036085 | Barros | Apr 2006 | B2 |
| 7043702 | Chi et al. | May 2006 | B2 |
| 7055110 | Kupka et al. | May 2006 | B2 |
| 7058648 | Lightfoot et al. | Jun 2006 | B1 |
| 7111231 | Huck et al. | Sep 2006 | B1 |
| 7139800 | Bellotti et al. | Nov 2006 | B2 |
| 7158878 | Rasmussen et al. | Jan 2007 | B2 |
| 7162475 | Ackerman | Jan 2007 | B2 |
| 7168039 | Bertram | Jan 2007 | B2 |
| 7171427 | Witowski et al. | Jan 2007 | B2 |
| 7194680 | Roy et al. | Mar 2007 | B1 |
| 7269786 | Malloy et al. | Sep 2007 | B1 |
| 7278105 | Kitts | Oct 2007 | B1 |
| 7290698 | Poslinski et al. | Nov 2007 | B2 |
| 7318054 | Nomura et al. | Jan 2008 | B2 |
| 7333998 | Heckerman et al. | Feb 2008 | B2 |
| 7370047 | Gorman | May 2008 | B2 |
| 7373669 | Eisen | May 2008 | B2 |
| 7379811 | Rasmussen et al. | May 2008 | B2 |
| 7379903 | Caballero et al. | May 2008 | B2 |
| 7392249 | Harris et al. | Jun 2008 | B1 |
| 7426654 | Adams et al. | Sep 2008 | B2 |
| 7451397 | Weber et al. | Nov 2008 | B2 |
| 7454466 | Bellotti et al. | Nov 2008 | B2 |
| 7461158 | Rider et al. | Dec 2008 | B2 |
| 7467375 | Tondreau et al. | Dec 2008 | B2 |
| 7487139 | Fraleigh et al. | Feb 2009 | B2 |
| 7502786 | Liu et al. | Mar 2009 | B2 |
| 7525422 | Bishop et al. | Apr 2009 | B2 |
| 7529727 | Arning et al. | May 2009 | B2 |
| 7529734 | Dirisala | May 2009 | B2 |
| 7558677 | Jones | Jun 2009 | B2 |
| 7574409 | Patinkin | Aug 2009 | B2 |
| 7574428 | Leiserowitz et al. | Aug 2009 | B2 |
| 7579965 | Bucholz | Aug 2009 | B2 |
| 7596285 | Brown et al. | Sep 2009 | B2 |
| 7614006 | Molander | Nov 2009 | B2 |
| 7617232 | Gabbert et al. | Nov 2009 | B2 |
| 7620628 | Kapur et al. | Nov 2009 | B2 |
| 7627812 | Chamberlain et al. | Dec 2009 | B2 |
| 7634717 | Chamberlain et al. | Dec 2009 | B2 |
| 7703021 | Flam | Apr 2010 | B1 |
| 7706817 | Bamrah et al. | Apr 2010 | B2 |
| 7712049 | Williams et al. | May 2010 | B2 |
| 7716077 | Mikurak | May 2010 | B1 |
| 7725530 | Sah et al. | May 2010 | B2 |
| 7725547 | Albertson et al. | May 2010 | B2 |
| 7725728 | Ama et al. | May 2010 | B2 |
| 7730082 | Sah et al. | Jun 2010 | B2 |
| 7730109 | Rohrs et al. | Jun 2010 | B2 |
| 7756843 | Palmer | Jul 2010 | B1 |
| 7761407 | Stern | Jul 2010 | B1 |
| 7770100 | Chamberlain et al. | Aug 2010 | B2 |
| 7783658 | Bayliss | Aug 2010 | B1 |
| 7805457 | Viola et al. | Sep 2010 | B1 |
| 7809703 | Balabhadrapatruni et al. | Oct 2010 | B2 |
| 7814084 | Hallett et al. | Oct 2010 | B2 |
| 7814102 | Miller et al. | Oct 2010 | B2 |
| 7818658 | Chen | Oct 2010 | B2 |
| 7870493 | Pall et al. | Jan 2011 | B2 |
| 7894984 | Rasmussen et al. | Feb 2011 | B2 |
| 7899611 | Downs et al. | Mar 2011 | B2 |
| 7899796 | Borthwick et al. | Mar 2011 | B1 |
| 7917376 | Bellin et al. | Mar 2011 | B2 |
| 7920963 | Jouline et al. | Apr 2011 | B2 |
| 7933862 | Chamberlain et al. | Apr 2011 | B2 |
| 7941321 | Greenstein et al. | May 2011 | B2 |
| 7962281 | Rasmussen et al. | Jun 2011 | B2 |
| 7962495 | Jain et al. | Jun 2011 | B2 |
| 7962848 | Bertram | Jun 2011 | B2 |
| 7970240 | Chao et al. | Jun 2011 | B1 |
| 7971150 | Raskutti et al. | Jun 2011 | B2 |
| 7984374 | Caro et al. | Jun 2011 | B2 |
| 7979457 | Garman | Jul 2011 | B1 |
| 8001465 | Kudrolli et al. | Aug 2011 | B2 |
| 8001482 | Bhattiprolu et al. | Aug 2011 | B2 |
| 8010545 | Stefik et al. | Aug 2011 | B2 |
| 8015487 | Roy et al. | Sep 2011 | B2 |
| 8024778 | Cash et al. | Sep 2011 | B2 |
| 8036632 | Cona et al. | Oct 2011 | B1 |
| 8036971 | Aymeloglu et al. | Oct 2011 | B2 |
| 8041714 | Aymeloglu et al. | Oct 2011 | B2 |
| 8046283 | Burns | Oct 2011 | B2 |
| 8046362 | Bayliss | Oct 2011 | B2 |
| 8054756 | Chand et al. | Nov 2011 | B2 |
| 8095582 | Cramer | Jan 2012 | B2 |
| 8103543 | Zwicky | Jan 2012 | B1 |
| 8112425 | Baum et al. | Feb 2012 | B2 |
| 8126848 | Wagner | Feb 2012 | B2 |
| 8134457 | Velipasalar et al. | Mar 2012 | B2 |
| 8135679 | Bayliss | Mar 2012 | B2 |
| 8135719 | Bayliss | Mar 2012 | B2 |
| 8145703 | Frishert et al. | Mar 2012 | B2 |
| 8185819 | Sah et al. | May 2012 | B2 |
| 8196184 | Amirov et al. | Jun 2012 | B2 |
| 8214361 | Sandler et al. | Jul 2012 | B1 |
| 8214490 | Vos et al. | Jul 2012 | B1 |
| 8214764 | Gemmell et al. | Jul 2012 | B2 |
| 8225201 | Michael | Jul 2012 | B2 |
| 8229902 | Vishniac et al. | Jul 2012 | B2 |
| 8229947 | Fujinaga | Jul 2012 | B2 |
| 8230333 | Decherd et al. | Jul 2012 | B2 |
| 8250474 | Peters et al. | Aug 2012 | B2 |
| 8266168 | Bayliss | Sep 2012 | B2 |
| 8271461 | Pike et al. | Sep 2012 | B2 |
| 8280880 | Aymeloglu et al. | Oct 2012 | B1 |
| 8290838 | Thakur et al. | Oct 2012 | B1 |
| 8290926 | Ozzie et al. | Oct 2012 | B2 |
| 8290942 | Jones et al. | Oct 2012 | B2 |
| 8301464 | Cave et al. | Oct 2012 | B1 |
| 8301904 | Gryaznov | Oct 2012 | B1 |
| 8302855 | Ma et al. | Nov 2012 | B2 |
| 8312367 | Foster | Nov 2012 | B2 |
| 8312546 | Alme | Nov 2012 | B2 |
| 8321943 | Walters et al. | Nov 2012 | B1 |
| 8347398 | Weber | Jan 2013 | B1 |
| 8352881 | Champion et al. | Jan 2013 | B2 |
| 8368695 | Howell et al. | Feb 2013 | B2 |
| 8375141 | Rowstron | Feb 2013 | B2 |
| 8392394 | Kumar et al. | Mar 2013 | B1 |
| 8397171 | Klassen et al. | Mar 2013 | B2 |
| 8412707 | Mianji | Apr 2013 | B1 |
| 8423909 | Zabielski | Apr 2013 | B2 |
| 8447674 | Choudhuri et al. | May 2013 | B2 |
| 8447722 | Ahuja et al. | May 2013 | B1 |
| 8452790 | Mianji | May 2013 | B1 |
| 8463036 | Ramesh et al. | Jun 2013 | B1 |
| 8473454 | Evanitsky et al. | Jun 2013 | B2 |
| 8484115 | Aymeloglu et al. | Jul 2013 | B2 |
| 8484168 | Bayliss | Jul 2013 | B2 |
| 8489331 | Kopf et al. | Jul 2013 | B2 |
| 8489623 | Jain et al. | Jul 2013 | B2 |
| 8489641 | Seefeld et al. | Jul 2013 | B1 |
| 8495077 | Bayliss | Jul 2013 | B2 |
| 8498969 | Bayliss | Jul 2013 | B2 |
| 8498984 | Hwang et al. | Jul 2013 | B1 |
| 8504542 | Chang et al. | Aug 2013 | B2 |
| 8510743 | Hackborn et al. | Aug 2013 | B2 |
| 8514082 | Cova et al. | Aug 2013 | B2 |
| 8515207 | Chau | Aug 2013 | B2 |
| 8554579 | Tribble et al. | Oct 2013 | B2 |
| 8554653 | Falkenborg et al. | Oct 2013 | B2 |
| 8554709 | Goodson et al. | Oct 2013 | B2 |
| 8560413 | Quarterman | Oct 2013 | B1 |
| 8577911 | Stepinski et al. | Nov 2013 | B1 |
| 8589273 | Creeden et al. | Nov 2013 | B2 |
| 8595234 | Siripuapu et al. | Nov 2013 | B2 |
| 8600872 | Yan | Dec 2013 | B1 |
| 8620641 | Farnsworth et al. | Dec 2013 | B2 |
| 8620934 | Fong et al. | Dec 2013 | B2 |
| 8639757 | Zang et al. | Jan 2014 | B1 |
| 8646080 | Williamson et al. | Feb 2014 | B2 |
| 8656478 | Forristal | Feb 2014 | B1 |
| 8676857 | Adams et al. | Mar 2014 | B1 |
| 8682812 | Ranjan | Mar 2014 | B1 |
| 8688573 | Ruknoic et al. | Apr 2014 | B1 |
| 8689108 | Duffield et al. | Apr 2014 | B1 |
| 8700643 | Gossweiler | Apr 2014 | B1 |
| 8713467 | Goldenberg et al. | Apr 2014 | B1 |
| 8726379 | Stiansen et al. | May 2014 | B1 |
| 8739278 | Varghese | May 2014 | B2 |
| 8742934 | Sarpy et al. | Jun 2014 | B1 |
| 8744890 | Bernier | Jun 2014 | B1 |
| 8745516 | Mason et al. | Jun 2014 | B2 |
| 8781169 | Jackson et al. | Jul 2014 | B2 |
| 8786605 | Curtis et al. | Jul 2014 | B1 |
| 8787939 | Papakipos et al. | Jul 2014 | B2 |
| 8788405 | Sprague et al. | Jul 2014 | B1 |
| 8788407 | Singh et al. | Jul 2014 | B1 |
| 8799799 | Cervelli et al. | Aug 2014 | B1 |
| 8812960 | Sun et al. | Aug 2014 | B1 |
| 8818892 | Sprague et al. | Aug 2014 | B1 |
| 8830322 | Nerayoff et al. | Sep 2014 | B2 |
| 8832594 | Thompson et al. | Sep 2014 | B1 |
| 8868537 | Colgrove et al. | Oct 2014 | B1 |
| 8898184 | Garman | Nov 2014 | B1 |
| 8917274 | Ma et al. | Dec 2014 | B2 |
| 8924388 | Elliot et al. | Dec 2014 | B2 |
| 8924389 | Elliot et al. | Dec 2014 | B2 |
| 8924872 | Bogomolov et al. | Dec 2014 | B1 |
| 8930331 | McGrew et al. | Jan 2015 | B2 |
| 8937619 | Sharma et al. | Jan 2015 | B2 |
| 8938686 | Erenrich et al. | Jan 2015 | B1 |
| 8949164 | Mohler | Feb 2015 | B1 |
| 8954410 | Chang et al. | Feb 2015 | B2 |
| 9009171 | Grossman et al. | Apr 2015 | B1 |
| 9009827 | Albertson et al. | Apr 2015 | B1 |
| 9021260 | Falk et al. | Apr 2015 | B1 |
| 9021384 | Beard et al. | Apr 2015 | B1 |
| 9043696 | Meiklejohn et al. | May 2015 | B1 |
| 9043894 | Dennison et al. | May 2015 | B1 |
| 9069842 | Melby | Jun 2015 | B2 |
| 9092482 | Harris et al. | Jul 2015 | B2 |
| 9100428 | Visbal | Aug 2015 | B1 |
| 9116975 | Shankar et al. | Aug 2015 | B2 |
| 9129219 | Robertson et al. | Sep 2015 | B1 |
| 9135233 | Fan et al. | Sep 2015 | B2 |
| 9135658 | Sprague et al. | Sep 2015 | B2 |
| 9146954 | Boe et al. | Sep 2015 | B1 |
| 9165299 | Stowe et al. | Oct 2015 | B1 |
| 9171334 | Visbal et al. | Oct 2015 | B1 |
| 9177344 | Singh et al. | Nov 2015 | B1 |
| 9202249 | Cohen et al. | Dec 2015 | B1 |
| 9208159 | Stowe et al. | Dec 2015 | B2 |
| 9229952 | Meacham et al. | Jan 2016 | B1 |
| 9230280 | Maag et al. | Jan 2016 | B1 |
| 9256664 | Chakerian et al. | Feb 2016 | B2 |
| 9280532 | Cicerone | Mar 2016 | B2 |
| 9344447 | Cohen et al. | May 2016 | B2 |
| 9348920 | Kesin | May 2016 | B1 |
| 9367872 | Visbal et al. | Jun 2016 | B1 |
| 9535974 | Kesin et al. | Jan 2017 | B1 |
| 9547693 | Sheasby et al. | Jan 2017 | B1 |
| 9645727 | Devarajan et al. | May 2017 | B2 |
| 9817563 | Stokes et al. | Nov 2017 | B1 |
| 9898528 | Kesin | Feb 2018 | B2 |
| 10180929 | Kesin et al. | Jan 2019 | B1 |
| 20010021936 | Bertram | Sep 2001 | A1 |
| 20010051949 | Carey et al. | Dec 2001 | A1 |
| 20010056522 | Satyanarayana | Dec 2001 | A1 |
| 20020013781 | Petersen et al. | Jan 2002 | A1 |
| 20020033848 | Sciammarella et al. | Mar 2002 | A1 |
| 20020065708 | Senay et al. | May 2002 | A1 |
| 20020083039 | Ferrari | Jun 2002 | A1 |
| 20020091694 | Hrle et al. | Jul 2002 | A1 |
| 20020091707 | Keller | Jul 2002 | A1 |
| 20020095360 | Joao | Jul 2002 | A1 |
| 20020095658 | Shulman | Jul 2002 | A1 |
| 20020103705 | Brady | Aug 2002 | A1 |
| 20020116120 | Ruiz et al. | Aug 2002 | A1 |
| 20020130907 | Chi et al. | Sep 2002 | A1 |
| 20020147805 | Leshem et al. | Oct 2002 | A1 |
| 20020169759 | Kraft et al. | Nov 2002 | A1 |
| 20020174201 | Ramer et al. | Nov 2002 | A1 |
| 20020194119 | Wright et al. | Dec 2002 | A1 |
| 20030028560 | Kudrolli et al. | Feb 2003 | A1 |
| 20030033228 | Bosworth-Davies et al. | Feb 2003 | A1 |
| 20030036848 | Sheha et al. | Feb 2003 | A1 |
| 20030039948 | Donahue | Feb 2003 | A1 |
| 20030055830 | Gutierrez-Rivas et al. | Mar 2003 | A1 |
| 20030074368 | Schuetze et al. | Apr 2003 | A1 |
| 20030097330 | Hillmer et al. | May 2003 | A1 |
| 20030105759 | Bess et al. | Jun 2003 | A1 |
| 20030115481 | Baird et al. | Jun 2003 | A1 |
| 20030120675 | Stauber et al. | Jun 2003 | A1 |
| 20030126102 | Borthwick | Jul 2003 | A1 |
| 20030130993 | Mendelevitch et al. | Jul 2003 | A1 |
| 20030140106 | Raguseo | Jul 2003 | A1 |
| 20030144868 | MacIntyre et al. | Jul 2003 | A1 |
| 20030154044 | Lundstedt et al. | Aug 2003 | A1 |
| 20030163352 | Surpin et al. | Aug 2003 | A1 |
| 20030172014 | Quackenbush et al. | Sep 2003 | A1 |
| 20030200217 | Ackerman | Oct 2003 | A1 |
| 20030212718 | Tester | Nov 2003 | A1 |
| 20030225755 | Iwayama et al. | Dec 2003 | A1 |
| 20030229848 | Arend et al. | Dec 2003 | A1 |
| 20040032432 | Baynger | Feb 2004 | A1 |
| 20040034570 | Davis | Feb 2004 | A1 |
| 20040064256 | Barinek et al. | Apr 2004 | A1 |
| 20040085318 | Hassler et al. | May 2004 | A1 |
| 20040095349 | Bito et al. | May 2004 | A1 |
| 20040111410 | Burgoon et al. | Jun 2004 | A1 |
| 20040111480 | Yue | Jun 2004 | A1 |
| 20040117345 | Bamford et al. | Jun 2004 | A1 |
| 20040117387 | Civetta et al. | Jun 2004 | A1 |
| 20040126840 | Cheng et al. | Jul 2004 | A1 |
| 20040143602 | Ruiz et al. | Jul 2004 | A1 |
| 20040143796 | Lerner et al. | Jul 2004 | A1 |
| 20040148301 | McKay et al. | Jul 2004 | A1 |
| 20040153418 | Hanweck | Aug 2004 | A1 |
| 20040160309 | Stilp | Aug 2004 | A1 |
| 20040163039 | McPherson et al. | Aug 2004 | A1 |
| 20040181543 | Wu et al. | Sep 2004 | A1 |
| 20040181554 | Heckerman et al. | Sep 2004 | A1 |
| 20040193600 | Kaasten et al. | Sep 2004 | A1 |
| 20040205524 | Richter et al. | Oct 2004 | A1 |
| 20040221223 | Yu et al. | Nov 2004 | A1 |
| 20040236688 | Bozeman | Nov 2004 | A1 |
| 20040260702 | Cragun et al. | Dec 2004 | A1 |
| 20040267746 | Marcjan et al. | Dec 2004 | A1 |
| 20050010472 | Quatse et al. | Jan 2005 | A1 |
| 20050027705 | Sadri et al. | Feb 2005 | A1 |
| 20050028094 | Allyn | Feb 2005 | A1 |
| 20050039119 | Parks et al. | Feb 2005 | A1 |
| 20050065811 | Chu et al. | Mar 2005 | A1 |
| 20050078858 | Yao et al. | Apr 2005 | A1 |
| 20050080769 | Gemmell | Apr 2005 | A1 |
| 20050086207 | Heuer et al. | Apr 2005 | A1 |
| 20050097441 | Herbach et al. | May 2005 | A1 |
| 20050108063 | Madill et al. | May 2005 | A1 |
| 20050108231 | Findleton et al. | May 2005 | A1 |
| 20050114763 | Nonomura et al. | May 2005 | A1 |
| 20050125715 | Franco et al. | Jun 2005 | A1 |
| 20050154628 | Eckart et al. | Jul 2005 | A1 |
| 20050154769 | Eckart et al. | Jul 2005 | A1 |
| 20050162523 | Darrell et al. | Jul 2005 | A1 |
| 20050166144 | Gross | Jul 2005 | A1 |
| 20050180330 | Shapiro | Aug 2005 | A1 |
| 20050182793 | Keenan et al. | Aug 2005 | A1 |
| 20050183005 | Denoue et al. | Aug 2005 | A1 |
| 20050210409 | Jou | Sep 2005 | A1 |
| 20050222928 | Steier et al. | Oct 2005 | A1 |
| 20050246327 | Yeung et al. | Nov 2005 | A1 |
| 20050251786 | Citron et al. | Nov 2005 | A1 |
| 20050289524 | McGinnes | Dec 2005 | A1 |
| 20060026120 | Carolan et al. | Feb 2006 | A1 |
| 20060026170 | Kreitler et al. | Feb 2006 | A1 |
| 20060045470 | Poslinski et al. | Mar 2006 | A1 |
| 20060059139 | Robinson | Mar 2006 | A1 |
| 20060074866 | Chamberlain et al. | Apr 2006 | A1 |
| 20060074881 | Vembu et al. | Apr 2006 | A1 |
| 20060080316 | Gilmore et al. | Apr 2006 | A1 |
| 20060080616 | Vogel et al. | Apr 2006 | A1 |
| 20060080619 | Carlson et al. | Apr 2006 | A1 |
| 20060093222 | Saffer et al. | May 2006 | A1 |
| 20060095521 | Patinkin | May 2006 | A1 |
| 20060106847 | Eckardt et al. | May 2006 | A1 |
| 20060116991 | Calderwood | Jun 2006 | A1 |
| 20060129746 | Porter | Jun 2006 | A1 |
| 20060136402 | Lee et al. | Jun 2006 | A1 |
| 20060139375 | Rasmussen et al. | Jun 2006 | A1 |
| 20060142949 | Helt | Jun 2006 | A1 |
| 20060143034 | Rothermel | Jun 2006 | A1 |
| 20060143075 | Carr et al. | Jun 2006 | A1 |
| 20060143079 | Basak et al. | Jun 2006 | A1 |
| 20060149596 | Surpin et al. | Jul 2006 | A1 |
| 20060161558 | Tamma et al. | Jul 2006 | A1 |
| 20060184889 | Molander | Aug 2006 | A1 |
| 20060203337 | White | Sep 2006 | A1 |
| 20060209085 | Wong et al. | Sep 2006 | A1 |
| 20060218206 | Bourbonnais et al. | Sep 2006 | A1 |
| 20060218405 | Ama et al. | Sep 2006 | A1 |
| 20060218491 | Grossman et al. | Sep 2006 | A1 |
| 20060218637 | Thomas et al. | Sep 2006 | A1 |
| 20060241974 | Chao et al. | Oct 2006 | A1 |
| 20060242040 | Rader | Oct 2006 | A1 |
| 20060242630 | Koike et al. | Oct 2006 | A1 |
| 20060253502 | Raman et al. | Nov 2006 | A1 |
| 20060265397 | Bryan et al. | Nov 2006 | A1 |
| 20060271277 | Hu et al. | Nov 2006 | A1 |
| 20060279630 | Aggarwal et al. | Dec 2006 | A1 |
| 20070000999 | Kubo et al. | Jan 2007 | A1 |
| 20070011150 | Frank | Jan 2007 | A1 |
| 20070011304 | Error | Jan 2007 | A1 |
| 20070016363 | Huang et al. | Jan 2007 | A1 |
| 20070038646 | Thota | Feb 2007 | A1 |
| 20070038962 | Fuchs et al. | Feb 2007 | A1 |
| 20070050429 | Goldring et al. | Mar 2007 | A1 |
| 20070057966 | Ohno et al. | Mar 2007 | A1 |
| 20070061487 | Moore et al. | Mar 2007 | A1 |
| 20070078832 | Ott et al. | Apr 2007 | A1 |
| 20070083541 | Fraleigh et al. | Apr 2007 | A1 |
| 20070094389 | Nussey et al. | Apr 2007 | A1 |
| 20070106582 | Baker et al. | May 2007 | A1 |
| 20070130206 | Zhou et al. | Jun 2007 | A1 |
| 20070143253 | Kostamaa et al. | Jun 2007 | A1 |
| 20070150369 | Zivin | Jun 2007 | A1 |
| 20070150801 | Chidlovskii et al. | Jun 2007 | A1 |
| 20070156673 | Maga | Jul 2007 | A1 |
| 20070174760 | Chamberlain et al. | Jul 2007 | A1 |
| 20070185850 | Walters et al. | Aug 2007 | A1 |
| 20070185867 | Maga | Aug 2007 | A1 |
| 20070192265 | Chopin et al. | Aug 2007 | A1 |
| 20070198571 | Ferguson et al. | Aug 2007 | A1 |
| 20070208497 | Downs et al. | Sep 2007 | A1 |
| 20070208498 | Barker et al. | Sep 2007 | A1 |
| 20070208736 | Tanigawa et al. | Sep 2007 | A1 |
| 20070233709 | Abnous | Oct 2007 | A1 |
| 20070233756 | D'Souza et al. | Oct 2007 | A1 |
| 20070240062 | Christena et al. | Oct 2007 | A1 |
| 20070266336 | Nojima et al. | Nov 2007 | A1 |
| 20070271317 | Carmel | Nov 2007 | A1 |
| 20070284433 | Domenica et al. | Dec 2007 | A1 |
| 20070294200 | Au | Dec 2007 | A1 |
| 20070294643 | Kyle | Dec 2007 | A1 |
| 20080015970 | Brookfield et al. | Jan 2008 | A1 |
| 20080016216 | Worley et al. | Jan 2008 | A1 |
| 20080040275 | Paulsen et al. | Feb 2008 | A1 |
| 20080040684 | Crump | Feb 2008 | A1 |
| 20080051989 | Welsh | Feb 2008 | A1 |
| 20080052142 | Bailey et al. | Feb 2008 | A1 |
| 20080189408 | Cancel et al. | Feb 2008 | A1 |
| 20080071731 | Ma et al. | Mar 2008 | A1 |
| 20080077597 | Butler | Mar 2008 | A1 |
| 20080077642 | Carbone et al. | Mar 2008 | A1 |
| 20080082486 | Lermant et al. | Apr 2008 | A1 |
| 20080104019 | Nath | May 2008 | A1 |
| 20080104060 | Abhyankar et al. | May 2008 | A1 |
| 20080104149 | Vishniac et al. | May 2008 | A1 |
| 20080126951 | Sood et al. | May 2008 | A1 |
| 20080133567 | Ames et al. | Jun 2008 | A1 |
| 20080148398 | Mezack et al. | Jun 2008 | A1 |
| 20080155440 | Trevor et al. | Jun 2008 | A1 |
| 20080162616 | Worley et al. | Jul 2008 | A1 |
| 20080195417 | Surpin et al. | Aug 2008 | A1 |
| 20080195608 | Clover | Aug 2008 | A1 |
| 20080195672 | Hamel et al. | Aug 2008 | A1 |
| 20080201339 | McGrew | Aug 2008 | A1 |
| 20080215546 | Baum et al. | Sep 2008 | A1 |
| 20080222295 | Robinson et al. | Sep 2008 | A1 |
| 20080249983 | Meisels et al. | Oct 2008 | A1 |
| 20080255973 | El Wade et al. | Oct 2008 | A1 |
| 20080263468 | Cappione et al. | Oct 2008 | A1 |
| 20080267107 | Rosenberg | Oct 2008 | A1 |
| 20080270316 | Guidotti et al. | Oct 2008 | A1 |
| 20080270391 | Newbold et al. | Oct 2008 | A1 |
| 20080276167 | Michael | Nov 2008 | A1 |
| 20080278311 | Grange et al. | Nov 2008 | A1 |
| 20080288306 | MacIntyre et al. | Nov 2008 | A1 |
| 20080288425 | Posse et al. | Nov 2008 | A1 |
| 20080301378 | Carrie | Dec 2008 | A1 |
| 20080301643 | Appleton et al. | Dec 2008 | A1 |
| 20080313132 | Hao et al. | Dec 2008 | A1 |
| 20080319991 | Ross | Dec 2008 | A1 |
| 20090002492 | Velipasalar et al. | Jan 2009 | A1 |
| 20090018940 | Wang et al. | Jan 2009 | A1 |
| 20090024505 | Patel et al. | Jan 2009 | A1 |
| 20090024589 | Sood et al. | Jan 2009 | A1 |
| 20090027418 | Maru et al. | Jan 2009 | A1 |
| 20090030915 | Winter et al. | Jan 2009 | A1 |
| 20090031247 | Walter et al. | Jan 2009 | A1 |
| 20090037417 | Shankar et al. | Feb 2009 | A1 |
| 20090044279 | Crawford et al. | Feb 2009 | A1 |
| 20090055251 | Shah et al. | Feb 2009 | A1 |
| 20090070200 | August | Mar 2009 | A1 |
| 20090076845 | Bellin et al. | Mar 2009 | A1 |
| 20090082997 | Tokman et al. | Mar 2009 | A1 |
| 20090083184 | Eisen | Mar 2009 | A1 |
| 20090088964 | Schaaf et al. | Apr 2009 | A1 |
| 20090106178 | Chu | Apr 2009 | A1 |
| 20090106308 | Killian et al. | Apr 2009 | A1 |
| 20090112745 | Stefanescu | Apr 2009 | A1 |
| 20090119309 | Gibson et al. | May 2009 | A1 |
| 20090125359 | Knapic | May 2009 | A1 |
| 20090125369 | Kloosstra et al. | May 2009 | A1 |
| 20090125459 | Norton et al. | May 2009 | A1 |
| 20090132921 | Hwangbo et al. | May 2009 | A1 |
| 20090132953 | Reed et al. | May 2009 | A1 |
| 20090143052 | Bates et al. | Jun 2009 | A1 |
| 20090144262 | White et al. | Jun 2009 | A1 |
| 20090144274 | Fraleigh et al. | Jun 2009 | A1 |
| 20090150854 | Elaasar et al. | Jun 2009 | A1 |
| 20090164387 | Armstrong et al. | Jun 2009 | A1 |
| 20090164934 | Bhattiprolu et al. | Jun 2009 | A1 |
| 20090171939 | Athsani et al. | Jul 2009 | A1 |
| 20090172511 | Decherd et al. | Jul 2009 | A1 |
| 20090172669 | Bobak et al. | Jul 2009 | A1 |
| 20090172821 | Daira et al. | Jul 2009 | A1 |
| 20090177962 | Gusmorino et al. | Jul 2009 | A1 |
| 20090179892 | Tsuda et al. | Jul 2009 | A1 |
| 20090187464 | Bai et al. | Jul 2009 | A1 |
| 20090187546 | Whyte et al. | Jul 2009 | A1 |
| 20090187548 | Ji et al. | Jul 2009 | A1 |
| 20090192957 | Subramanian et al. | Jul 2009 | A1 |
| 20090222400 | Kupershmidt et al. | Sep 2009 | A1 |
| 20090222759 | Drieschner | Sep 2009 | A1 |
| 20090222760 | Halverson et al. | Sep 2009 | A1 |
| 20090234720 | George et al. | Sep 2009 | A1 |
| 20090240664 | Dinker et al. | Sep 2009 | A1 |
| 20090249244 | Robinson et al. | Oct 2009 | A1 |
| 20090254970 | Agarwal et al. | Oct 2009 | A1 |
| 20090254971 | Herz | Oct 2009 | A1 |
| 20090271343 | Vaiciulis et al. | Oct 2009 | A1 |
| 20090271359 | Bayliss | Oct 2009 | A1 |
| 20090271435 | Yako et al. | Oct 2009 | A1 |
| 20090281839 | Lynn et al. | Nov 2009 | A1 |
| 20090287470 | Farnsworth et al. | Nov 2009 | A1 |
| 20090292626 | Oxford | Nov 2009 | A1 |
| 20090300589 | Watters et al. | Dec 2009 | A1 |
| 20090307049 | Elliott et al. | Dec 2009 | A1 |
| 20090313223 | Rantanen | Dec 2009 | A1 |
| 20090313311 | Hoffmann et al. | Dec 2009 | A1 |
| 20090313463 | Pang et al. | Dec 2009 | A1 |
| 20090318775 | Michelson et al. | Dec 2009 | A1 |
| 20090319418 | Herz | Dec 2009 | A1 |
| 20090319891 | MacKinlay | Dec 2009 | A1 |
| 20090327208 | Bittner et al. | Dec 2009 | A1 |
| 20100011282 | Dollard et al. | Jan 2010 | A1 |
| 20100030722 | Goodson et al. | Feb 2010 | A1 |
| 20100031141 | Summers et al. | Feb 2010 | A1 |
| 20100036831 | Vemuri et al. | Feb 2010 | A1 |
| 20100042922 | Bradateanu et al. | Feb 2010 | A1 |
| 20100057622 | Faith et al. | Mar 2010 | A1 |
| 20100057716 | Stefik et al. | Mar 2010 | A1 |
| 20100070489 | Aymeloglu et al. | Mar 2010 | A1 |
| 20100070523 | Delgo et al. | Mar 2010 | A1 |
| 20100070842 | Aymeloglu et al. | Mar 2010 | A1 |
| 20100070845 | Facemire et al. | Mar 2010 | A1 |
| 20100070897 | Aymeloglu et al. | Mar 2010 | A1 |
| 20100076939 | Iwaki et al. | Mar 2010 | A1 |
| 20100077481 | Polyakov et al. | Mar 2010 | A1 |
| 20100077483 | Stolfo et al. | Mar 2010 | A1 |
| 20100082541 | Kottomtharayil | Apr 2010 | A1 |
| 20100088158 | Pollack | Apr 2010 | A1 |
| 20100098318 | Anderson | Apr 2010 | A1 |
| 20100100963 | Mahaffey | Apr 2010 | A1 |
| 20100103124 | Kruzeniski et al. | Apr 2010 | A1 |
| 20100106611 | Paulsen et al. | Apr 2010 | A1 |
| 20100106752 | Eckardt et al. | Apr 2010 | A1 |
| 20100114817 | Broeder et al. | May 2010 | A1 |
| 20100114831 | Gilbert et al. | May 2010 | A1 |
| 20100114887 | Conway et al. | May 2010 | A1 |
| 20100122152 | Chamberlain et al. | May 2010 | A1 |
| 20100125546 | Barrett et al. | May 2010 | A1 |
| 20100131457 | Heimendinger | May 2010 | A1 |
| 20100131502 | Fordham | May 2010 | A1 |
| 20100138842 | Balko et al. | Jun 2010 | A1 |
| 20100145909 | Ngo | Jun 2010 | A1 |
| 20100161565 | Lee et al. | Jun 2010 | A1 |
| 20100161688 | Kesselman et al. | Jun 2010 | A1 |
| 20100161735 | Sharma | Jun 2010 | A1 |
| 20100162176 | Dunton | Jun 2010 | A1 |
| 20100169237 | Howard et al. | Jul 2010 | A1 |
| 20100185691 | Irmak et al. | Jul 2010 | A1 |
| 20100191563 | Schlaifer et al. | Jul 2010 | A1 |
| 20100191884 | Holenstein et al. | Jul 2010 | A1 |
| 20100198684 | Eraker et al. | Aug 2010 | A1 |
| 20100199225 | Coleman et al. | Aug 2010 | A1 |
| 20100211550 | Daniello et al. | Aug 2010 | A1 |
| 20100211618 | Anderson et al. | Aug 2010 | A1 |
| 20100228812 | Uomini | Sep 2010 | A1 |
| 20100235606 | Oreland et al. | Sep 2010 | A1 |
| 20100235915 | Memon et al. | Sep 2010 | A1 |
| 20100250412 | Wagner | Sep 2010 | A1 |
| 20100262688 | Hussain et al. | Oct 2010 | A1 |
| 20100280857 | Liu et al. | Nov 2010 | A1 |
| 20100283787 | Hamedi et al. | Nov 2010 | A1 |
| 20100293174 | Bennett et al. | Nov 2010 | A1 |
| 20100306029 | Jolley | Dec 2010 | A1 |
| 20100306713 | Geisner et al. | Dec 2010 | A1 |
| 20100312837 | Bodapati et al. | Dec 2010 | A1 |
| 20100313119 | Baldwin et al. | Dec 2010 | A1 |
| 20100318838 | Katano et al. | Dec 2010 | A1 |
| 20100318924 | Frankel et al. | Dec 2010 | A1 |
| 20100321399 | Ellren et al. | Dec 2010 | A1 |
| 20100325526 | Ellis et al. | Dec 2010 | A1 |
| 20100325581 | Finkelstein et al. | Dec 2010 | A1 |
| 20100330801 | Rouh | Dec 2010 | A1 |
| 20110004498 | Readshaw | Jan 2011 | A1 |
| 20110029498 | Ferguson et al. | Feb 2011 | A1 |
| 20110029526 | Knight et al. | Feb 2011 | A1 |
| 20110047159 | Baid et al. | Feb 2011 | A1 |
| 20110047540 | Williams et al. | Feb 2011 | A1 |
| 20110055140 | Roychowdhury | Mar 2011 | A1 |
| 20110060753 | Shaked et al. | Mar 2011 | A1 |
| 20110061013 | Bilicki et al. | Mar 2011 | A1 |
| 20110066933 | Ludwig | Mar 2011 | A1 |
| 20110074811 | Hanson et al. | Mar 2011 | A1 |
| 20110078055 | Faribault et al. | Mar 2011 | A1 |
| 20110078173 | Seligmann et al. | Mar 2011 | A1 |
| 20110087519 | Fordyce, III et al. | Apr 2011 | A1 |
| 20110093327 | Fordyce et al. | Apr 2011 | A1 |
| 20110099133 | Chang et al. | Apr 2011 | A1 |
| 20110117878 | Barash et al. | May 2011 | A1 |
| 20110119100 | Ruhl et al. | May 2011 | A1 |
| 20110131122 | Griffin et al. | Jun 2011 | A1 |
| 20110131547 | Elaasar | Jun 2011 | A1 |
| 20110137766 | Rasmussen et al. | Jun 2011 | A1 |
| 20110153384 | Horne et al. | Jun 2011 | A1 |
| 20110153592 | DeMarcken | Jun 2011 | A1 |
| 20110161096 | Buehler et al. | Jun 2011 | A1 |
| 20110161132 | Goel et al. | Jun 2011 | A1 |
| 20110161137 | Ubalde et al. | Jun 2011 | A1 |
| 20110167054 | Bailey et al. | Jul 2011 | A1 |
| 20110167105 | Ramakrishnan et al. | Jul 2011 | A1 |
| 20110167493 | Song et al. | Jul 2011 | A1 |
| 20110170799 | Carrino et al. | Jul 2011 | A1 |
| 20110173032 | Payne et al. | Jul 2011 | A1 |
| 20110173093 | Psota et al. | Jul 2011 | A1 |
| 20110173619 | Fish | Jul 2011 | A1 |
| 20110178842 | Rane et al. | Jul 2011 | A1 |
| 20110181598 | O'Neall et al. | Jul 2011 | A1 |
| 20110184813 | Barne et al. | Jul 2011 | A1 |
| 20110185316 | Reid et al. | Jul 2011 | A1 |
| 20110196737 | Vadlamani et al. | Aug 2011 | A1 |
| 20110202500 | Warn et al. | Aug 2011 | A1 |
| 20110208565 | Ross et al. | Aug 2011 | A1 |
| 20110208724 | Jones et al. | Aug 2011 | A1 |
| 20110213655 | Henkin | Sep 2011 | A1 |
| 20110218934 | Elser | Sep 2011 | A1 |
| 20110218955 | Tang | Sep 2011 | A1 |
| 20110219321 | Gonzalez et al. | Sep 2011 | A1 |
| 20110219450 | McDougal et al. | Sep 2011 | A1 |
| 20110225198 | Edwards et al. | Sep 2011 | A1 |
| 20110225650 | Margolies et al. | Sep 2011 | A1 |
| 20110231223 | Winters | Sep 2011 | A1 |
| 20110238495 | Kang | Sep 2011 | A1 |
| 20110238510 | Rowen et al. | Sep 2011 | A1 |
| 20110238553 | Raj et al. | Sep 2011 | A1 |
| 20110238570 | Li et al. | Sep 2011 | A1 |
| 20110246229 | Pacha | Oct 2011 | A1 |
| 20110251951 | Kolkowtiz | Oct 2011 | A1 |
| 20110258158 | Resende et al. | Oct 2011 | A1 |
| 20110258190 | Chen et al. | Oct 2011 | A1 |
| 20110258242 | Eidson et al. | Oct 2011 | A1 |
| 20110270604 | Qi et al. | Nov 2011 | A1 |
| 20110270705 | Parker | Nov 2011 | A1 |
| 20110270812 | Ruby | Nov 2011 | A1 |
| 20110270834 | Sokolan et al. | Nov 2011 | A1 |
| 20110289397 | Eastmond et al. | Nov 2011 | A1 |
| 20110289407 | Naik et al. | Nov 2011 | A1 |
| 20110289420 | Morioka et al. | Nov 2011 | A1 |
| 20110291851 | Whisenant | Dec 2011 | A1 |
| 20110295649 | Fine | Dec 2011 | A1 |
| 20110307382 | Siegel et al. | Dec 2011 | A1 |
| 20110310005 | Chen et al. | Dec 2011 | A1 |
| 20110314007 | Dassa et al. | Dec 2011 | A1 |
| 20110314024 | Chang et al. | Dec 2011 | A1 |
| 20110314546 | Aziz et al. | Dec 2011 | A1 |
| 20120004904 | Shin et al. | Jan 2012 | A1 |
| 20120005581 | Turner et al. | Jan 2012 | A1 |
| 20120011238 | Rathod | Jan 2012 | A1 |
| 20120011245 | Gillette et al. | Jan 2012 | A1 |
| 20120019559 | Siler et al. | Jan 2012 | A1 |
| 20120022945 | Falkenborg et al. | Jan 2012 | A1 |
| 20120036013 | Neuhaus et al. | Feb 2012 | A1 |
| 20120036434 | Oberstein | Feb 2012 | A1 |
| 20120050293 | Carlhian et al. | Mar 2012 | A1 |
| 20120054284 | Rakshit | Mar 2012 | A1 |
| 20120059853 | Jagota | Mar 2012 | A1 |
| 20120066166 | Curbera et al. | Mar 2012 | A1 |
| 20120066296 | Appleton et al. | Mar 2012 | A1 |
| 20120072825 | Sherkin et al. | Mar 2012 | A1 |
| 20120075324 | Cardno et al. | Mar 2012 | A1 |
| 20120079363 | Folting et al. | Mar 2012 | A1 |
| 20120084117 | Tavares et al. | Apr 2012 | A1 |
| 20120084118 | Bai et al. | Apr 2012 | A1 |
| 20120084135 | Nissan et al. | Apr 2012 | A1 |
| 20120084287 | Lakshminarayan et al. | Apr 2012 | A1 |
| 20120084866 | Stolfo | Apr 2012 | A1 |
| 20120106801 | Jackson | May 2012 | A1 |
| 20120116828 | Shannon | May 2012 | A1 |
| 20120117082 | Koperda et al. | May 2012 | A1 |
| 20120123989 | Yu et al. | May 2012 | A1 |
| 20120124179 | Cappio et al. | May 2012 | A1 |
| 20120131107 | Yost | May 2012 | A1 |
| 20120131512 | Takeuchi et al. | May 2012 | A1 |
| 20120136804 | Lucia | May 2012 | A1 |
| 20120137235 | TS et al. | May 2012 | A1 |
| 20120144335 | Abeln et al. | Jun 2012 | A1 |
| 20120150791 | Willson | Jun 2012 | A1 |
| 20120158626 | Zhu et al. | Jun 2012 | A1 |
| 20120159307 | Chung et al. | Jun 2012 | A1 |
| 20120159312 | Mital et al. | Jun 2012 | A1 |
| 20120159362 | Brown et al. | Jun 2012 | A1 |
| 20120159399 | Bastide et al. | Jun 2012 | A1 |
| 20120170847 | Tsukidate | Jul 2012 | A1 |
| 20120173381 | Smith | Jul 2012 | A1 |
| 20120173985 | Peppel | Jul 2012 | A1 |
| 20120180002 | Campbell et al. | Jul 2012 | A1 |
| 20120196557 | Reich et al. | Aug 2012 | A1 |
| 20120196558 | Reich et al. | Aug 2012 | A1 |
| 20120197651 | Robinson et al. | Aug 2012 | A1 |
| 20120203584 | Mishor et al. | Aug 2012 | A1 |
| 20120203708 | Psota et al. | Aug 2012 | A1 |
| 20120208636 | Feige | Aug 2012 | A1 |
| 20120215784 | King et al. | Aug 2012 | A1 |
| 20120215898 | Shah et al. | Aug 2012 | A1 |
| 20120221511 | Gibson et al. | Aug 2012 | A1 |
| 20120221553 | Wittmer et al. | Aug 2012 | A1 |
| 20120221580 | Barney | Aug 2012 | A1 |
| 20120226523 | Weiss | Sep 2012 | A1 |
| 20120233145 | Howes | Sep 2012 | A1 |
| 20120245976 | Kumar et al. | Sep 2012 | A1 |
| 20120246148 | Dror | Sep 2012 | A1 |
| 20120254129 | Wheeler et al. | Oct 2012 | A1 |
| 20120266245 | McDougal et al. | Oct 2012 | A1 |
| 20120278273 | Fang | Nov 2012 | A1 |
| 20120284345 | Costenaro et al. | Nov 2012 | A1 |
| 20120290879 | Shibuya et al. | Nov 2012 | A1 |
| 20120296907 | Long et al. | Nov 2012 | A1 |
| 20120304244 | Xie et al. | Nov 2012 | A1 |
| 20120310831 | Harris et al. | Dec 2012 | A1 |
| 20120310838 | Harris et al. | Dec 2012 | A1 |
| 20120311684 | Paulsen et al. | Dec 2012 | A1 |
| 20120323829 | Stokes et al. | Dec 2012 | A1 |
| 20120323888 | Osann, Jr. | Dec 2012 | A1 |
| 20120330801 | McDougal et al. | Dec 2012 | A1 |
| 20120330908 | Stowe et al. | Dec 2012 | A1 |
| 20120330973 | Ghuneim et al. | Dec 2012 | A1 |
| 20130006426 | Healey et al. | Jan 2013 | A1 |
| 20130006655 | Van Arkel et al. | Jan 2013 | A1 |
| 20130006668 | Van Arkel et al. | Jan 2013 | A1 |
| 20130006725 | Simanek et al. | Jan 2013 | A1 |
| 20130006916 | McBride et al. | Jan 2013 | A1 |
| 20130016106 | Yip et al. | Jan 2013 | A1 |
| 20130018796 | Kolhatkar et al. | Jan 2013 | A1 |
| 20130024268 | Manickavelu | Jan 2013 | A1 |
| 20130024307 | Fuerstenberg et al. | Jan 2013 | A1 |
| 20130024339 | Choudhuri et al. | Jan 2013 | A1 |
| 20130036346 | Cicerone | Feb 2013 | A1 |
| 20130046635 | Grigg et al. | Feb 2013 | A1 |
| 20130046783 | Zhang | Feb 2013 | A1 |
| 20130046842 | Muntz et al. | Feb 2013 | A1 |
| 20130050217 | Armitage | Feb 2013 | A1 |
| 20130054306 | Bhalla | Feb 2013 | A1 |
| 20130055145 | Antony et al. | Feb 2013 | A1 |
| 20130057551 | Ebert et al. | Mar 2013 | A1 |
| 20130060742 | Chang et al. | Mar 2013 | A1 |
| 20130060786 | Serrano et al. | Mar 2013 | A1 |
| 20130061169 | Pearcy et al. | Mar 2013 | A1 |
| 20130073377 | Heath | Mar 2013 | A1 |
| 20130073454 | Busch | Mar 2013 | A1 |
| 20130078943 | Biage et al. | Mar 2013 | A1 |
| 20130086482 | Parsons | Apr 2013 | A1 |
| 20130096988 | Grossman et al. | Apr 2013 | A1 |
| 20130097130 | Bingol et al. | Apr 2013 | A1 |
| 20130097482 | Marantz et al. | Apr 2013 | A1 |
| 20130101159 | Chao et al. | Apr 2013 | A1 |
| 20130110746 | Ahn | May 2013 | A1 |
| 20130110822 | Ikeda et al. | May 2013 | A1 |
| 20130110877 | Bonham et al. | May 2013 | A1 |
| 20130111320 | Campbell et al. | May 2013 | A1 |
| 20130117011 | Ahmed et al. | May 2013 | A1 |
| 20130117651 | Waldman et al. | May 2013 | A1 |
| 20130150004 | Rosen | Jun 2013 | A1 |
| 20130151148 | Parundekar et al. | Jun 2013 | A1 |
| 20130151388 | Falkenborg et al. | Jun 2013 | A1 |
| 20130151453 | Bhanot et al. | Jun 2013 | A1 |
| 20130157234 | Gulli et al. | Jun 2013 | A1 |
| 20130159340 | Blanco et al. | Jun 2013 | A1 |
| 20130160120 | Malaviya et al. | Jun 2013 | A1 |
| 20130166348 | Scotto | Jun 2013 | A1 |
| 20130166480 | Popescu et al. | Jun 2013 | A1 |
| 20130166550 | Buchmann et al. | Jun 2013 | A1 |
| 20130176321 | Mitchell et al. | Jul 2013 | A1 |
| 20130179420 | Park et al. | Jul 2013 | A1 |
| 20130185245 | Anderson | Jul 2013 | A1 |
| 20130185307 | El-Yaniv et al. | Jul 2013 | A1 |
| 20130185320 | Iwasaki et al. | Jul 2013 | A1 |
| 20130197925 | Blue | Aug 2013 | A1 |
| 20130211985 | Clark et al. | Aug 2013 | A1 |
| 20130224696 | Wolfe et al. | Aug 2013 | A1 |
| 20130225212 | Khan | Aug 2013 | A1 |
| 20130226318 | Procyk | Aug 2013 | A1 |
| 20130226953 | Markovich et al. | Aug 2013 | A1 |
| 20130232045 | Tai et al. | Sep 2013 | A1 |
| 20130238616 | Rose et al. | Sep 2013 | A1 |
| 20130246170 | Gross et al. | Sep 2013 | A1 |
| 20130246537 | Gaddala | Sep 2013 | A1 |
| 20130246597 | Iizawa et al. | Sep 2013 | A1 |
| 20130251233 | Yang et al. | Sep 2013 | A1 |
| 20130262527 | Hunter et al. | Oct 2013 | A1 |
| 20130263019 | Castellanos et al. | Oct 2013 | A1 |
| 20130267207 | Hao et al. | Oct 2013 | A1 |
| 20130268520 | Fisher et al. | Oct 2013 | A1 |
| 20130276799 | Davidson | Oct 2013 | A1 |
| 20130279757 | Kephart | Oct 2013 | A1 |
| 20130282696 | John et al. | Oct 2013 | A1 |
| 20130290011 | Lynn et al. | Oct 2013 | A1 |
| 20130290825 | Arndt et al. | Oct 2013 | A1 |
| 20130297619 | Chandrasekaran et al. | Nov 2013 | A1 |
| 20130304770 | Boero et al. | Nov 2013 | A1 |
| 20130311375 | Priebatsch | Nov 2013 | A1 |
| 20130318060 | Chang et al. | Nov 2013 | A1 |
| 20130318594 | Hoy et al. | Nov 2013 | A1 |
| 20130318604 | Coates et al. | Nov 2013 | A1 |
| 20130332862 | Mirra et al. | Dec 2013 | A1 |
| 20130339218 | Subramanian et al. | Dec 2013 | A1 |
| 20130339514 | Crank et al. | Dec 2013 | A1 |
| 20140006109 | Callioni et al. | Jan 2014 | A1 |
| 20140012796 | Petersen et al. | Jan 2014 | A1 |
| 20140019119 | Liu et al. | Jan 2014 | A1 |
| 20140019936 | Cohanoff | Jan 2014 | A1 |
| 20140032506 | Hoey et al. | Jan 2014 | A1 |
| 20140033010 | Richardt et al. | Jan 2014 | A1 |
| 20140040371 | Gurevich et al. | Feb 2014 | A1 |
| 20140047319 | Eberlein | Feb 2014 | A1 |
| 20140047357 | Alfaro et al. | Feb 2014 | A1 |
| 20140058763 | Zizzamia et al. | Feb 2014 | A1 |
| 20140058914 | Song et al. | Feb 2014 | A1 |
| 20140059038 | McPherson et al. | Feb 2014 | A1 |
| 20140067611 | Adachi et al. | Mar 2014 | A1 |
| 20140068487 | Steiger et al. | Mar 2014 | A1 |
| 20140074855 | Zhao et al. | Mar 2014 | A1 |
| 20140081652 | Klindworth | Mar 2014 | A1 |
| 20140095273 | Tang et al. | Apr 2014 | A1 |
| 20140095509 | Patton | Apr 2014 | A1 |
| 20140108068 | Williams | Apr 2014 | A1 |
| 20140108380 | Gotz et al. | Apr 2014 | A1 |
| 20140108985 | Scott et al. | Apr 2014 | A1 |
| 20140123279 | Bishop et al. | May 2014 | A1 |
| 20140129261 | Bothwell et al. | May 2014 | A1 |
| 20140136285 | Carvalho | May 2014 | A1 |
| 20140143009 | Brice et al. | May 2014 | A1 |
| 20140149130 | Getchius | May 2014 | A1 |
| 20140149272 | Hirani et al. | May 2014 | A1 |
| 20140149436 | Bahrami et al. | May 2014 | A1 |
| 20140156484 | Chan et al. | Jun 2014 | A1 |
| 20140156527 | Grigg et al. | Jun 2014 | A1 |
| 20140157172 | Peery et al. | Jun 2014 | A1 |
| 20140164502 | Khodorenko et al. | Jun 2014 | A1 |
| 20140181833 | Bird et al. | Jun 2014 | A1 |
| 20140189536 | Lange et al. | Jul 2014 | A1 |
| 20140189870 | Singla et al. | Jul 2014 | A1 |
| 20140195515 | Baker et al. | Jul 2014 | A1 |
| 20140195887 | Ellis et al. | Jul 2014 | A1 |
| 20140195916 | Kwan et al. | Jul 2014 | A1 |
| 20140214579 | Shen et al. | Jul 2014 | A1 |
| 20140222521 | Chait | Aug 2014 | A1 |
| 20140222793 | Sadkin et al. | Aug 2014 | A1 |
| 20140229554 | Grunin et al. | Aug 2014 | A1 |
| 20140244388 | Manouchehri et al. | Aug 2014 | A1 |
| 20140258246 | Lo Faro et al. | Sep 2014 | A1 |
| 20140267294 | Ma | Sep 2014 | A1 |
| 20140267295 | Sharma | Sep 2014 | A1 |
| 20140279824 | Tamayo | Sep 2014 | A1 |
| 20140280293 | Scanlon | Sep 2014 | A1 |
| 20140283067 | Call et al. | Sep 2014 | A1 |
| 20140310266 | Greenfield | Oct 2014 | A1 |
| 20140310282 | Sprague et al. | Oct 2014 | A1 |
| 20140316911 | Gross | Oct 2014 | A1 |
| 20140317104 | Isaacs et al. | Oct 2014 | A1 |
| 20140324876 | Konik et al. | Oct 2014 | A1 |
| 20140330845 | Feldschuh | Nov 2014 | A1 |
| 20140331119 | Dixon et al. | Nov 2014 | A1 |
| 20140333651 | Cervelli et al. | Nov 2014 | A1 |
| 20140337772 | Cervelli et al. | Nov 2014 | A1 |
| 20140344230 | Krause et al. | Nov 2014 | A1 |
| 20140344231 | Stowe et al. | Nov 2014 | A1 |
| 20140344256 | Bitincka | Nov 2014 | A1 |
| 20140351070 | Christner et al. | Nov 2014 | A1 |
| 20140358829 | Hurwitz | Dec 2014 | A1 |
| 20140366132 | Stiansen et al. | Dec 2014 | A1 |
| 20140379755 | Kuriakose et al. | Dec 2014 | A1 |
| 20140379812 | Paul et al. | Dec 2014 | A1 |
| 20150019394 | Unser et al. | Jan 2015 | A1 |
| 20150039886 | Kahol et al. | Feb 2015 | A1 |
| 20150046870 | Goldenberg et al. | Feb 2015 | A1 |
| 20150067533 | Volach | Mar 2015 | A1 |
| 20150073929 | Psota et al. | Mar 2015 | A1 |
| 20150073954 | Braff | Mar 2015 | A1 |
| 20150089353 | Folkening | Mar 2015 | A1 |
| 20150089424 | Duffield et al. | Mar 2015 | A1 |
| 20150095773 | Gonsalves et al. | Apr 2015 | A1 |
| 20150100897 | Sun et al. | Apr 2015 | A1 |
| 20150100907 | Erenrich et al. | Apr 2015 | A1 |
| 20150106347 | McGrew et al. | Apr 2015 | A1 |
| 20150106379 | Elliot et al. | Apr 2015 | A1 |
| 20150112956 | Chang et al. | Apr 2015 | A1 |
| 20150112998 | Shankar et al. | Apr 2015 | A1 |
| 20150134666 | Gattiker et al. | May 2015 | A1 |
| 20150135113 | Sekharan | May 2015 | A1 |
| 20150135256 | Hoy et al. | May 2015 | A1 |
| 20150169709 | Kara et al. | Jun 2015 | A1 |
| 20150169726 | Kara et al. | Jun 2015 | A1 |
| 20150170077 | Kara et al. | Jun 2015 | A1 |
| 20150178825 | Huerta | Jun 2015 | A1 |
| 20150178877 | Bogomolov et al. | Jun 2015 | A1 |
| 20150186821 | Wang et al. | Jul 2015 | A1 |
| 20150187036 | Wang et al. | Jul 2015 | A1 |
| 20150188872 | White | Jul 2015 | A1 |
| 20150199324 | Nishioka | Jul 2015 | A1 |
| 20150212663 | Papale et al. | Jul 2015 | A1 |
| 20150213043 | Ishii et al. | Jul 2015 | A1 |
| 20150213134 | Nie et al. | Jul 2015 | A1 |
| 20150227295 | Meiklejohn et al. | Aug 2015 | A1 |
| 20150235334 | Wang et al. | Aug 2015 | A1 |
| 20150242397 | Zhuang | Aug 2015 | A1 |
| 20150261817 | Harris et al. | Sep 2015 | A1 |
| 20150309719 | Ma et al. | Oct 2015 | A1 |
| 20150317342 | Grossman et al. | Nov 2015 | A1 |
| 20150324868 | Kaftan et al. | Nov 2015 | A1 |
| 20150338233 | Cervelli et al. | Nov 2015 | A1 |
| 20150341467 | Lim et al. | Nov 2015 | A1 |
| 20150347903 | Saxena et al. | Dec 2015 | A1 |
| 20150378996 | Kesin et al. | Dec 2015 | A1 |
| 20150379413 | Robertson et al. | Dec 2015 | A1 |
| 20160004667 | Chakerian et al. | Jan 2016 | A1 |
| 20160004764 | Chakerian et al. | Jan 2016 | A1 |
| 20160034470 | Sprague et al. | Feb 2016 | A1 |
| 20160034545 | Shankar et al. | Feb 2016 | A1 |
| 20160034555 | Rahut et al. | Feb 2016 | A1 |
| 20160048937 | Mathura et al. | Feb 2016 | A1 |
| 20160062555 | Ward et al. | Mar 2016 | A1 |
| 20160098173 | Slawinski et al. | Apr 2016 | A1 |
| 20160098485 | Burke et al. | Apr 2016 | A1 |
| 20160147730 | Cicerone | May 2016 | A1 |
| 20160147769 | Murphey et al. | May 2016 | A1 |
| 20160180451 | Visbal et al. | Jun 2016 | A1 |
| 20160180557 | Yousaf et al. | Jun 2016 | A1 |
| 20160210195 | Sinha | Jul 2016 | A1 |
| 20160306965 | Iyer | Oct 2016 | A1 |
| 20170046349 | Shankar et al. | Feb 2017 | A1 |
| 20180052597 | Stokes et al. | Feb 2018 | A1 |
| 20180173792 | Kesin | Jun 2018 | A1 |
| 20190114309 | Kesin et al. | Apr 2019 | A1 |
| Number | Date | Country |
|---|---|---|
| 2014206155 | Dec 2015 | AU |
| 2014250678 | Feb 2016 | AU |
| 102546446 | Jul 2012 | CN |
| 103167093 | Jun 2013 | CN |
| 102054015 | May 2014 | CN |
| 102014103482 | Sep 2014 | DE |
| 102014204827 | Sep 2014 | DE |
| 102014204830 | Sep 2014 | DE |
| 102014204834 | Sep 2014 | DE |
| 102014215621 | Feb 2015 | DE |
| 0652513 | May 1995 | EP |
| 1191463 | Mar 2002 | EP |
| 1672527 | Jun 2006 | EP |
| 2487610 | Aug 2012 | EP |
| 2551799 | Jan 2013 | EP |
| 2555126 | Feb 2013 | EP |
| 2555153 | Feb 2013 | EP |
| 2560134 | Feb 2013 | EP |
| 2778977 | Sep 2014 | EP |
| 2835745 | Feb 2015 | EP |
| 2835770 | Feb 2015 | EP |
| 2838039 | Feb 2015 | EP |
| 2846241 | Mar 2015 | EP |
| 2851852 | Mar 2015 | EP |
| 2858014 | Apr 2015 | EP |
| 2858018 | Apr 2015 | EP |
| 2863326 | Apr 2015 | EP |
| 2863346 | Apr 2015 | EP |
| 2869211 | May 2015 | EP |
| 2884439 | Jun 2015 | EP |
| 2884440 | Jun 2015 | EP |
| 2889814 | Jul 2015 | EP |
| 2891992 | Jul 2015 | EP |
| 2892197 | Jul 2015 | EP |
| 2911078 | Aug 2015 | EP |
| 2911100 | Aug 2015 | EP |
| 2940603 | Nov 2015 | EP |
| 2940609 | Nov 2015 | EP |
| 2963577 | Jan 2016 | EP |
| 2963595 | Jan 2016 | EP |
| 2985729 | Feb 2016 | EP |
| 3018879 | May 2016 | EP |
| 3037991 | Jun 2016 | EP |
| 3037992 | Jun 2016 | EP |
| 3038002 | Jun 2016 | EP |
| 3038046 | Jun 2016 | EP |
| 2513247 | Oct 2014 | GB |
| 2516155 | Jan 2015 | GB |
| 2518745 | Apr 2015 | GB |
| 2012778 | Nov 2014 | NL |
| 2013306 | Feb 2015 | NL |
| 624557 | Dec 2014 | NZ |
| WO 00009529 | Feb 2000 | WO |
| WO 02065353 | Aug 2002 | WO |
| WO 2005104736 | Nov 2005 | WO |
| WO 2005116851 | Dec 2005 | WO |
| WO 2008011728 | Jan 2008 | WO |
| WO 2008064207 | May 2008 | WO |
| WO 2008113059 | Sep 2008 | WO |
| WO 2009061501 | May 2009 | WO |
| WO 2010000014 | Jan 2010 | WO |
| WO 2010030913 | Mar 2010 | WO |
| WO 2010098958 | Sep 2010 | WO |
| WO 2012025915 | Mar 2012 | WO |
| WO 2013010157 | Jan 2013 | WO |
| WO 2013102892 | Jul 2013 | WO |
| WO 2013126281 | Aug 2013 | WO |
| Entry |
|---|
| US 8,712,906 B1, 04/2014, Sprague et al. (withdrawn) |
| US 8,725,631 B1, 05/2014, Sprague et al. (withdrawn) |
| Liu, Ling, et al., “Differential Evaluation of Continual Queries”, ICDCS 1996, Hong Kong, May 27-30, 1996, pp. 458-465. |
| About 80 Minutes, “Palantir in a Number of Parts—Part 6—Graph,” Mar. 21, 2013, pp. 1-6, retrieved from the internet http://about80minutes.blogspot.nl/2013/03/palantir-in-number-of-parts-part-6-graph.html retrieved on Aug. 18, 2015. |
| Alur et al., “Chapter 2: IBM InfoSphere DataStage Stages,” IBM InfoSphere DataStage Data Flow and Job Design, Jul. 1, 2008, pp. 35-137. |
| Anjewierden et al., “Automatic Indexing of PDF Documents with Ontologies”, Social Science Informatics, University of Amsterdam, The Netherlands, Jun. 11, 2011, pp. 8. |
| Baker et al., “The Development of a Common Enumeration of Vulnerabilities and Exposures,” Presented at the Second International Workshop on Recent Advances in Intrusion Detection, Sep. 7-9, 1999, pp. 35. |
| Gesher, Ari, “Palantir Screenshots in the Wild: Swing Sightings,” The Palantir Blog, Sep. 11, 2007, pp. 1-12, retrieved from the internet https://www.palantir.com/2007/09/palantir-screenshots/ retrieved on Aug. 18, 2015. |
| Jelen, Bill, “Excel 2013 in Depth, Video Enhanced Edition,” Jan. 25, 2013. |
| 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. |
| Palantir Technolgies, “Palantir Labs—Timeline,” Oct. 1, 2010, retrieved from the internet https://www.youtube.com/watch?v=JCgDW5bru9M retrieved on Aug. 19, 2015. |
| Quest, “Toad for Oracle 11.6—Guide to Using Toad,” Sep. 24, 2012, pp. 1-162. |
| Wikipedia, “Mobile Web,” Jan. 23, 2015, retrieved from the internet on Mar. 15, 2016 https://en.wikipedia.org/w/index.php?title=Mobile_Web&oldid=643800164. |
| Wright et al., “Palantir Technologies VAST 2010 Challenge Text Records—Investigations into Arms Dealing,” Oct. 29, 2010, pp. 1-10, retrieved from the internet http://hcil2.cs.umd.edu/newvarepository/VAST%20Challenge%202010/challenges/MC1%20-%20Investigations%20into%20Arms%20Dealing/entries/Palantir%20Technologies/ retrieved on Aug. 20, 2015. |
| Notice of Acceptance for Australian Patent Application No. 2014250678 dated Oct. 7, 2015. |
| Notice of Allowance for U.S. Appl. No. 12/556,318 dated Apr. 11, 2016. |
| Notice of Allowance for U.S. Appl. No. 12/556,318 dated Nov. 2, 2015. |
| Notice of Allowance for U.S. Appl. No. 13/196,788 dated Dec. 18, 2015. |
| Notice of Allowance for U.S. Appl. No. 13/247,987 dated Mar. 17, 2016. |
| Notice of Allowance for U.S. Appl. No. 13/826,228 dated Mar. 27, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/192,767 dated Apr. 20, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/319,161 dated May 4, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/319,765 dated Nov. 25, 2016. |
| Notice of Allowance for U.S. Appl. No. 14/326,738 dated Nov. 18, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/473,860 dated Feb. 27, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/552,336 dated Nov. 3, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/581,920 dated Sep. 2, 2016. |
| Notice of Allowance for U.S. Appl. No. 14/734,772 dated Apr. 27, 2016. |
| Notice of Allowance for U.S. Appl. No. 14/746,671 dated Jan. 21, 2016. |
| Notice of Allowance for U.S. Appl. No. 14/815,459 dated Sep. 23, 2016. |
| Notice of Allowance for U.S. Appl. No. 14/849,454 dated May 25, 2016. |
| Notice of Allowance for U.S. Appl. No. 14/923,364 dated May 6, 2016. |
| Notice of Allowance for U.S. Appl. No. 14/948,009 dated May 6, 2016. |
| Official Communication for European Patent Application No. 14187996.5 dated Feb. 19, 2016. |
| Official Communication for European Patent Application No. 14189344.6 dated Feb. 29, 2016. |
| Official Communication for European Patent Application No. 14197938.5 dated Apr. 28, 2015. |
| Official Communication for European Patent Application No. 15165244.3 dated Aug. 27, 2015. |
| Official Communication for European Patent Application No. 15166137.8 dated Sep. 14, 2015. |
| Official Communication for European Patent Application No. 15175106.2 dated Nov. 5, 2015. |
| Official Communication for European Patent Application No. 15175151.8 dated Nov. 25, 2015. |
| Official Communication for European Patent Application No. 15181419.1 dated Sep. 29, 2015. |
| Official Communication for European Patent Application No. 15183721.8 dated Nov. 23, 2015. |
| Official Communication for European Patent Application No. 15201881.8 dated May 23, 2016. |
| Official Communication for European Patent Application No. 15201924.6 dated Apr. 25, 2016. |
| Official Communication for European Patent Application No. 16152984.7 dated Mar. 24, 2016. |
| Official Communication for Netherlands Patent Application No. 2012437 dated Sep. 18, 2015. |
| Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014. |
| Official Communication for U.S. Appl. No. 13/196,788 dated Oct. 23, 2015. |
| Official Communication for U.S. Appl. No. 13/196,788 dated Nov. 25, 2015. |
| Official Communication for U.S. Appl. No. 13/827,491 dated Oct. 9, 2015. |
| Official Communication for U.S. Appl. No. 14/141,252 dated Oct. 8, 2015. |
| Official Communication for U.S. Appl. No. 14/196,814 dated May 5, 2015. |
| Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 26, 2016. |
| Official Communication for U.S. Appl. No. 14/306,138 dated Mar. 17, 2016. |
| Official Communication for U.S. Appl. No. 14/306,147 dated Jun. 3, 2016. |
| Official Communication for U.S. Appl. No. 14/306,154 dated Feb. 1, 2016. |
| Official Communication for U.S. Appl. No. 14/306,154 dated Nov. 16, 2015. |
| Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 17, 2016. |
| Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 1, 2016. |
| Official Communication for U.S. Appl. No. 14/463,615 dated Sep. 10, 2015. |
| Official Communication for U.S. Appl. No. 14/483,527 dated Oct. 28, 2015. |
| Official Communication for U.S. Appl. No. 14/562,524 dated Nov. 10, 2015. |
| Official Communication for U.S. Appl. No. 14/562,524 dated Sep. 14, 2015. |
| Official Communication for U.S. Appl. No. 14/571,098 dated Nov. 10, 2015. |
| Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 24, 2015. |
| Official Communication for U.S. Appl. No. 14/578,389 dated Oct. 21, 2015. |
| Official Communication for U.S. Appl. No. 14/578,389 dated Apr. 22, 2016. |
| Official Communication for U.S. Appl. No. 14/580,218 dated Jun. 7, 2016. |
| Official Communication for U.S. Appl. No. 14/581,920 dated Sep. 2, 2016. |
| Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015. |
| Official Communication for U.S. Appl. No. 14/645,304 dated Jan. 25, 2016. |
| Official Communication for U.S. Appl. No. 14/676,621 dated Oct. 29, 2015. |
| Official Communication for U.S. Appl. No. 14/726,211 dated Apr. 5, 2016. |
| Official Communication for U.S. Appl. No. 14/734,772 dated Oct. 30, 2015. |
| Official Communication for U.S. Appl. No. 14/746,671 dated Nov. 12, 2015. |
| Official Communication for U.S. Appl. No. 14/800,447 dated Mar. 3, 2016. |
| Official Communication for U.S. Appl. No. 14/841,338 dated Feb. 18, 2016. |
| Official Communication for U.S. Appl. No. 14/842,734 dated Nov. 19, 2015. |
| Official Communication for U.S. Appl. No. 14/874,690 dated Jun. 1, 2016. |
| Official Communication for U.S. Appl. No. 14/874,690 dated Dec. 21, 2015. |
| Official Communication for U.S. Appl. No. 14/948,009 dated Feb. 25, 2016. |
| Official Communication for U.S. Appl. No. 14/961,830 dated May 20, 2016. |
| Official Communication for U.S. Appl. No. 14/996,179 dated May 20, 2016. |
| Official Communication for U.S. Appl. No. 15/159,622 dated Feb. 24, 2017. |
| “A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30. |
| “A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2. |
| “A Word About Banks and the Laundering of Drug Money,” Aug. 18, 2012, http://www.golemxiv.co.uk/2012/08/a-word-about-banks-and-the-laundering-of-drug-money/. |
| “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. |
| “Money Laundering Risks and E-Gaming: A European Overview and Assessment,” 2009, http://www.cf.ac.uk/socsi/resources/Levi_Final_Money_Laundering_Risks_egaming.pdf. |
| “Potential Money Laundering Warning Signs,” snapshot taken 2003, https://web.archive.org/web/20030816090055/http:/finsolinc.com/ANTI-MONEY%20LAUNDERING%20TRAINING%20GUIDES.pdf. |
| “Refresh CSS Ellipsis When Resizing Container—Stack Overflow,” Jul. 31, 2013, retrieved from internet http://stackoverflow.com/questions/17964681/refresh-css-ellipsis-when-resizing-container, retrieved on May 18, 2015. |
| “The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29. |
| “Using Whois Based Geolocation and Google Maps API for Support Cybercrime Investigations,” http://wseas.us/e-library/conferences/2013/Dubrovnik/TELECIRC/TELECIRC-32.pdf. |
| “Apache HBase”, http://hbase.apache.org/ printed Sep. 14, 2011 in 1 page. |
| “The Apache Cassandra Project”, http://cassandra.apache.org/ printed Sep. 14, 2011 in 3 pages. |
| Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316. |
| Alfred, Rayner “Summarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering Techniques”, Journal of Computer Science, 2010, vol. 6, No. 7, pp. 775-784. |
| Amnet, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/component/content/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html. |
| Ananiev et al., “The New Modality API,” http://web.archive.org/web/20061211011958/http://java.sun.com/developer/technicalArticles/J2SE/Desktop/javase6/modality/ Jan. 21, 2006, pp. 8. |
| Anonymous, “BackTult _ JD Edwards One World Version Control System,” printed Jul. 23, 2007 in 1 page. |
| Antoshenkov, Gennady, “Dictionary-Based Order-Preserving String Compression”, The VLDB Journal, pp. 26-39, 1997. |
| Appacts, “Smart Thinking for Super Apps,” <http://www.appacts.com> Printed Jul. 18, 2013 in 4 pages. |
| Apsalar, “Data Powered Mobile Advertising,” “Free Mobile App Analytics” and various analytics related screen shots <http://apsalar.com> Printed Jul. 18, 2013 in 8 pages. |
| Baker et al., “Megastore: Providing Scalable, Highly Available Storage for Interactive Services”, 5th Biennial Conference on Innovative Data Systems Research (CIDR '11), Asilomar, California, Jan. 9-12, 2011. |
| Bernstein et al., “Hyder—A Transactional Record Manager for Shared Flash”, 5th Biennial Conference on Innovative Data Systems Research (CIDR '11), vol. 12, Asilomar, California, Jan. 9-12, 2011. |
| Bhosale, Safal V., “Holy Grail of Outlier Detection Technique: A Macro Level Take on the State of the Art,” International Journal of Computer Science & Information Technology, Aug. 1, 2014, retrieved from http://www.ijcsit.com/docs/Volume5/vol5issue04/ijcsit20140504226.pdf retrieved May 3, 2016. |
| Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286. |
| Boyce, Jim, “Microsoft Outlook 2010 Inside Out,” Aug. 1, 2010, retrieved from the internet https://capdtron.files.wordpress.com/2013/01/outlook-2010-inside_out.pdf. |
| Bugzilla@Mozilla, “Bug 18726—[feature] Long-click means of invoking contextual menus not supported,” http://bugzilla.mozilla.org/show_bug.cgi?id=18726 printed Jun. 13, 2013 in 11 pages. |
| Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10. |
| Capptain—Pilot Your Apps, <http://www.capptain.com> Printed Jul. 18, 2013 in 6 pages. |
| Celik, Tantek, “CSS Basic User Interface Module Level 3 (CSS3 UI),” Section 8 Resizing and Overflow, Jan. 17, 2012, retrieved from internet http://www.w3.org/TR/2012/WD-css3-ui-20120117/#resizing-amp-overflow retrieved on May 18, 2015. |
| Chang et al., “A new multi-search engine for querying data through an Internet search service on CORBA”, Computer Networks, vol. 34, Issue 3, Sep. 2000, pp. 467-480. |
| Chang et al., “Bigtable: A Distributed Storage System for Structured Data”, Google, Inc., OSDI'06: Seventh Symposium on Operating System Design and Implementation, Seattle, WA, Nov. 2006. |
| Chaudhuri et al., “An Overview of Business Intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8. |
| 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. |
| Chung, Chin-Wan, “Dataplex: An Access to Heterogeneous Distributed Databases,” Communications of the ACM, Association for Computing Machinery, Inc., vol. 33, No. 1, Jan. 1, 1990, pp. 70-80. |
| Cohn, et al., “Semi-supervised clustering with user feedback,” Constrained Clustering: Advances in Algorithms, Theory, and Applications 4.1 (2003): 17-32. |
| Conner, Nancy, “Google Apps: The Missing Manual,” May 1, 2008, pp. 15. |
| Countly Mobile Analytics, <http://count.ly/> Printed Jul. 18, 2013 in 9 pages. |
| Definition “Identify”, downloaded Jan. 22, 2015, 1 page. |
| Definition “Overlay”, downloaded Jan. 22, 2015, 1 page. |
| Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679. |
| Devanbu et al., “Authentic Third-party Data Publication”, http://www.cs.ucdavis.edu/˜devanbu/authdbpub.pdf, p. 19, 2000. |
| Distimo—App Analytics, <http://www.distimo.com/app-analytics> Printed Jul. 18, 2013 in 5 pages. |
| 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. |
| Dreyer et al., “An Object-Oriented Data Model for a Time Series Management System”, Proceedings of the 7th International Working Conference on Scientific and Statistical Database Management, p. 12, Charlottesville, Virginia, USA, Sep. 28-30, 1994. |
| Elmasri et al., “Fundamentals of Database Systems”, Fourth Edition, pp. 455-491, 2004. |
| Flurry Analytics, <http://www.flurry.com/> Printed Jul. 18, 2013 in 14 pages. |
| 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. |
| Golmohammadi et al., “Data Mining Applications for Fraud Detection in Securities Market,” Intelligence and Security Informatics Conference (EISIC), 2012 European, IEEE, Aug. 22, 2012, pp. 107-114. |
| Google Analytics Official Website—Web Analytics & Reporting, <http://www.google.com/analytics.index.html> Printed Jul. 18, 2013 in 22 pages. |
| Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005, May 6, 2002, 37 pages. |
| Goswami, Gautam, “Quite Writly Said!,” One Brick at a Time, Aug. 21, 2005, pp. 7. |
| Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144. |
| Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32. |
| Gu et al., “BotMiner: Clustering Analysis of Network Traffice for Protocol-and-Structure-Independent Botnet Detection,” Usenix Security Symposium, 2008, 17 pages. |
| Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010. |
| Hardesty, “Privacy Challenges: Analysis: It's Surprisingly Easy to Identify Individuals from Credit-Card Metadata,” MIT News on Campus and Around the World, MIT News Office, Jan. 29, 2015, 3 pages. |
| Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16. |
| Hodge et al., “A Survey of Outlier Detection Methodologies,” Artificial Intelligence Review, vol. 22, No. 2, Oct. 1, 2004. |
| Hogue et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web,” 14th International Conference on World Wide Web, WWW 2005: Chiba, Japan, May 10-14, 2005, pp. 86-95. |
| Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services”, HiPC 2006, LNCS 4297, pp. 277-288, 2006. |
| 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. |
| Kahan et al., “Annotea: an Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, Elsevier Science Publishers B.V., vol. 39, No. 5, dated Aug. 5, 2002, pp. 589-608. |
| Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf> downloaded May 12, 2014 in 8 pages. |
| Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf> downloaded May 12, 2014 in 2 pages. |
| Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, <http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf> downloaded May 12, 2014 in 10 pages. |
| Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21. |
| Klemmer et al., “Where Do Web Sites Come From? Capturing and Interacting with Design History,” Association for Computing Machinery, CHI 2002, Apr. 20-25, 2002, Minneapolis, MN, pp. 8. |
| Kokossi et al., “D7-Dynamic Ontology Management System (Design)”, Information Societies Technology Programme, Jan. 10, 2002, pp. 1-27. |
| Kontagent Mobile Analytics, <http://www.kontagent.com/> Printed Jul. 18, 2013 in 9 pages. |
| Li et al., “Interactive Multimodal Visual Search on Mobile Device,” IEEE Transactions on Multimedia, vol. 15, No. 3, Apr. 1, 2013, pp. 594-607. |
| Li et al., “Identifying the Signs of Fraudulent Accounts using Data Mining Techniques,” Computers in Human Behavior, vol. 28, No. 3, Jan. 16, 2012. |
| 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. |
| Localytics—Mobile App Marketing & Analytics, <http://www.localytics.com/> Printed Jul. 18, 2013 in 12 pages. |
| Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15. |
| Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10. |
| Manske, “File Saving Dialogs,” <http://www.mozilla.org/editor/ui_specs/FileSaveDialogs.html>, Jan. 20, 1999, pp. 7. |
| 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. |
| Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com. |
| Mentzas et al. “An Architecture for Intelligent Assistance in the Forecasting Process,” Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, Jan. 3-6, 1995, vol. 3, pp. 167-176. |
| Microsoft—Developer Network, “Getting Started with VBA in Word 2010,” Apr. 2010, <http://msdn.microsoft.com/en-us/library/ff604039%28v=office.14%29.aspx> as printed Apr. 4, 2014 in 17 pages. |
| Microsoft Office—Visio, “About connecting shapes,” <http://office.microsoft.com/en-us/visio-help/about-connecting-shapes-HP085050369.aspx> printed Aug. 4, 2011 in 6 pages. |
| Microsoft Office—Visio, “Add and glue connectors with the Connector tool,” <http://office.microsoft.com/en-us/visio-help/add-and-glue-connectors-with-the-connector-tool-HA010048532.aspx?CTT=1> printed Aug. 4, 2011 in 1 page. |
| Miklau et al., “Securing History: Privacy and Accountability in Database Systems”, 3rd Biennial Conference on Innovative Data Systems Research (CIDR), pp. 387-396, Asilomar, California, Jan. 7-10, 2007. |
| Mixpanel—Mobile Analytics, <https://mixpanel.com/> Printed Jul. 18, 2013 in 13 pages. |
| Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14. |
| Ngai et al., “The Application of Data Mining Techniques in Financial Fraud Detection: A Classification Frameworok and an Academic Review of Literature,” Decision Support Systems, Elsevier Science Publishers, Amsterdam, Netherlands, vol. 50, No. 3, Feb. 1, 2011. |
| Niepert et al., “A Dynamic Ontology for a Dynamic Reference Work”, Joint Conference on Digital Libraries, Jun. 17-22, 2007, Vancouver, British Columbia, Canada, pp. 1-10. |
| Nierman, “Evaluating Structural Similarity in XML Documents”, 6 pages, 2002. |
| Nolan et al., “MCARTA: A Malicious Code Automated Run-Time Analysis Framework,” Homeland Security (HST) 2012 IEEE Conference on Technologies for, Nov. 13, 2012, pp. 13-17. |
| Olanoff, Drew, “Deep Dive with the New Google Maps for Desktop with Google Earth Integration, It's More than Just a Utility,” May 15, 2013, pp. 1-6, retrieved from the internet: http://web.archive.org/web/20130515230641/http://techcrunch.com/2013/05/15/deep-dive-with-the-new-google-maps-for-desktop-with-google-earth-integration-its-more-than-just-a-utility/. |
| Open Web Analytics (OWA), <http://www.openwebanalytics.com/> Printed Jul. 19, 2013 in 5 pages. |
| Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, pp. 57-64. |
| Peng et al., “Large-scale Incremental Processing Using Distributed Transactions and Notifications”, Proceedings of the 9th Usenix Symposium on Operating Systems Design and Implementation, Usenix, p. 14, 2010. |
| Perdisci et al., “Behavioral Clustering of HTTP-Based Malware and Signature Generation Using Malicious Network Traces,” Usenix, Mar. 18, 2010, pp. 1-14. |
| Piwik—Free Web Analytics Software. <http://piwik.org/> Printed Jul. 19, 2013 in18 pages. |
| Quartert FS “Managing Business Performance and Detecting Outliers in Financial Services,” Oct. 16, 2014, retrieved from https://quartetfs.com/images/pdf/white-papers/Quartet_FS_White_Paper_-_ActivePivot_Sentinel.pdf retrieved on May 3, 2016. |
| Rouse, Margaret, “OLAP Cube,” <http://searchdatamanagement.techtarget.com/definition/OLAP-cube>, Apr. 28, 2012, pp. 16. |
| Shah, Chintan, “Periodic Connections to Control Server Offer New Way to Detect Botnets,” Oct. 24, 2013 in 6 pages, <http://www.blogs.mcafee.com/mcafee-labs/periodic-links-to-control-server-offer-new-way-to-detect-botnets>. |
| Shi et al., “A Scalable Implementation of Malware Detection Based on Network Connection Behaviors,” 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, IEEE, Oct. 10, 2013, pp. 59-66. |
| Sigrist, et al., “Prosite, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166. |
| Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11. |
| StatCounter—Free Invisible Web Tracker, Hit Counter and Web Stats, <http://statcounter.com/> Printed Jul. 19, 2013 in 17 pages. |
| Symantec Corporation, “E-Security Begins with Sound Security Policies,” Announcement Symantec, Jun. 14, 2001. |
| TestFlight—Beta Testing on the Fly, <http://testflightapp.com/> Printed Jul. 18, 2013 in 3 pages. |
| Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011. |
| Thomson et al., “The Case for Determinism in Database Systems”, The 36th International Conference on Very Large Data Bases, Proceedings of the VLDB Endowment, vol. 3, Issue No. 1, p. 11, Singapore, Sep. 13-17, 2010. |
| trak.io, <http://trak.io/> printed Jul. 18, 2013 in 3 pages. |
| Umagandhi et al., “Search Query Recommendations Using Hybrid User Profile with Query Logs,” International Journal of Computer Applications, vol. 80, No. 10, Oct. 1, 2013, pp. 7-18. |
| UserMetrix, <http://usermetrix.com/android-analytics> printed Jul. 18, 2013 in 3 pages. |
| Valentini et al., “Ensembles of Learning Machines”, M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20. |
| Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts]. |
| Wang et al., “Research on a Clustering Data De-Duplication Mechanism Based on Bloom Filter,” IEEE 2010, 5 pages. |
| Wiggerts, T.A., “Using Clustering Algorithms in Legacy Systems Remodularization,” Reverse Engineering, Proceedings of the Fourth Working Conference, Netherlands, Oct. 6-8, 1997, IEEE Computer Soc., pp. 33-43. |
| Wikipedia, “Federated Database System,” Sep. 7, 2013, retrieved from the internet on Jan. 27, 2015 http://en.wikipedia.org/w/index.php?title=Federated_database_system&oldid=571954221. |
| Wikipedia, “Multimap,” Jan. 1, 2013, https://en.wikipedia.org/w/index.php?title=Multimap&oldid=530800748. |
| Wollrath et al., “A Distributed Object Model for the Java System”, Conference on Object-Oriented Technologies and Systems, pp. 219-231, Jun. 17-21, 1996. |
| Wollrath et al., “A Distributed Object Model for the Java System,” Conference on Object-Oriented Technologies and Systems, Jun. 17-21, 1996, pp. 219-231. |
| Yang et al., “HTML Page Analysis Based on Visual Cues”, A129, pp. 859-864, 2001. |
| Yang et al., “Retroactive Answering of Search Queries”, WWW 2006 Edinburgh, Scotland, May 23-26, 2006, pp. 457-466. |
| Notice of Allowance for U.S. Appl. No. 14/102,394 dated Aug. 25, 2014. |
| Notice of Allowance for U.S. Appl. No. 14/108,187 dated Aug. 29, 2014. |
| Notice of Allowance for U.S. Appl. No. 14/135,289 dated Oct. 14, 2014. |
| Notice of Allowance for U.S. Appl. No. 14/139,628 dated Jun. 24, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/139,640 dated Jun. 17, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/139,713 dated Jun. 12, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/148,568 dated Aug. 26, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/192,767 dated Dec. 16, 2014. |
| Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/264,445 dated May 14, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/268,964 dated Dec. 3, 2014. |
| Notice of Allowance for U.S. Appl. No. 14/278,963 dated Sep. 2, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/294,098 dated Dec. 29, 2014. |
| Notice of Allowance for U.S. Appl. No. 14/323,935 dated Oct. 1, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/451,221 dated Aug. 4, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/473,552 dated Jul. 24, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/479,863 dated Mar. 31, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/486,991 dated May 1, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/504,103 dated May 18, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/579,752 dated Apr. 4, 2016. |
| Notice of Allowance for U.S. Appl. No. 14/616,080 dated Apr. 2, 2015. |
| Official Communication for Australian Patent Application No. 2014201511 dated Feb. 27, 2015. |
| Official Communication for Australian Patent Application No. 2014202442 dated Mar. 19, 2015. |
| Official Communication for Australian Patent Application No. 2014210604 dated Jun. 5, 2015. |
| Official Communication for Australian Patent Application No. 2014210614 dated Jun. 5, 2015. |
| Official Communication for Australian Patent Application No. 2014213553 dated May 7, 2015. |
| Official Communication for Australian Patent Application No. 2014250678 dated Jun. 17, 2015. |
| Official Communication for European Patent Application No. 14158861.6 dated Jun. 16, 2014. |
| Official Communication for European Patent Application No. 14159464.8 dated Jul. 31, 2014. |
| Official Communication for European Patent Application No. 14159535.5 dated May 22, 2014. |
| Official Communication for European Patent Application No. 14180142.3 dated Feb. 6, 2015. |
| Official Communication for European Patent Application No. 14180281.9 dated Jan. 26, 2015. |
| Official Communication for European Patent Application No. 14180321.3 dated Apr. 17, 2015. |
| Official Communication for European Patent Application No. 14180432.8 dated Jun. 23, 2015. |
| Official Communication for European Patent Application No. 14186225.0 dated Feb. 13, 2015. |
| Official Communication for European Patent Application No. 14187739.9 dated Jul. 6, 2015. |
| Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015. |
| Official Communication for European Patent Application No. 14189344.6 dated Feb. 20, 2015. |
| Official Communication for European Patent Application No. 14189347.9 dated Mar. 4, 2015. |
| Official Communication for European Patent Application No. 14189802.3 dated May 11, 2015. |
| Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015. |
| Official Communication for European Patent Application No. 14197879.1 dated Apr. 28, 2015. |
| Official Communication for European Patent Application No. 14197895.7 dated Apr. 28, 2015. |
| Official Communication for European Patent Application No. 14199182.8 dated Mar. 13, 2015. |
| Official Communication for European Patent Application No. 14200246.8 dated May 29, 2015. |
| Official Communication for European Patent Application No. 14200298.9 dated May 13, 2015. |
| Official Communication for European Patent Application No. 15155845.9 dated Oct. 6, 2015. |
| Official Communication for European Patent Application No. 15155846.7 dated Jul. 8, 2015. |
| Official Communication for European Patent Application No. 15156004.2 dated Aug. 24, 2015. |
| Official Communication for European Patent Application No. 15175171.8 dated Nov. 25, 2015. |
| Official Communication for European Patent Application No. 15180515.7 dated Dec. 14, 2015. |
| Official Communication for European Patent Application No. 15184764.7 dated Dec. 14, 2015. |
| Official Communication for European Patent Application No. 15193287.8 dated Apr. 1, 2016. |
| Official Communication for European Patent Application No. 15201727.3 dated May 23, 2016. |
| Official Communication for European Patent Application No. 15202090.5 dated May 13, 2016. |
| Official Communication for Great Britain Patent Application No. 1404457.2 dated Aug. 14, 2014. |
| Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015. |
| Official Communication for Great Britain Patent Application No. 1404486.1 dated Aug. 27, 2014. |
| Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015. |
| Official Communication for Great Britain Patent Application No. 1404489.5 dated Aug. 27, 2014. |
| Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015. |
| Official Communication for Great Britain Patent Application No. 1404499.4 dated Aug. 20, 2014. |
| Official Communication for Great Britain Patent Application No. 1404574.4 dated Dec. 18, 2014. |
| Official Communication for Great Britain Patent Application No. 1408025.3 dated Nov. 6, 2014. |
| Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014. |
| Official Communication for Great Britain Patent Application No. 1413935.6 dated Jan. 27, 2015. |
| Official Communication for Netherlands Patent Application No. 2012417 dated Sep. 18, 2015. |
| Official Communication for Netherlands Patent Application No. 2012421 dated Sep. 18, 2015. |
| Official Communication for Netherlands Patent Application No. 2012433 dated Mar. 11, 2016. |
| Official Communication for Netherlands Patent Application No. 2012436 dated Nov. 6, 2015. |
| Official Communication for Netherlands Patent Application No. 2012438 dated Sep. 21, 2015. |
| Official Communication for Netherlands Patent Application No. 2013306 dated Apr. 24, 2015. |
| Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014. |
| Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014. |
| Official Communication for New Zealand Patent Application No. 622517 dated Apr. 3, 2014. |
| Official Communication for New Zealand Patent Application No. 624557 dated May 14, 2014. |
| Official Communication for New Zealand Patent Application No. 627962 dated Aug. 5, 2014. |
| Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014. |
| Official Communication for New Zealand Patent Application No. 628263 dated Aug. 12, 2014. |
| Official Communication for New Zealand Patent Application No. 628495 dated Aug. 19, 2014. |
| Official Communication for New Zealand Patent Application No. 628585 dated Aug. 26, 2014. |
| Official Communication for New Zealand Patent Application No. 628840 dated Aug. 28, 2014. |
| Official Communication for U.S. Appl. No. 12/556,318 dated Jul. 2, 2015. |
| Official Communication for U.S. Appl. No. 13/247,987 dated Apr. 2, 2015. |
| Official Communication for U.S. Appl. No. 13/247,987 dated Sep. 22, 2015. |
| Official Communication for U.S. Appl. No. 13/827,491 dated Dec. 1, 2014. |
| Official Communication for U.S. Appl. No. 13/827,491 dated Jun. 22, 2015. |
| Official Communication for U.S. Appl. No. 13/831,791 dated Mar. 4, 2015. |
| Official Communication for U.S. Appl. No. 13/831,791 dated Aug. 6, 2015. |
| Official Communication for U.S. Appl. No. 13/835,688 dated Jun. 17, 2015. |
| Official Communication for U.S. Appl. No. 13/839,026 dated Aug. 4, 2015. |
| Official Communication for U.S. Appl. No. 14/134,558 dated Oct. 7, 2015. |
| Official Communication for U.S. Appl. No. 14/148,568 dated Oct. 22, 2014. |
| Official Communication for U.S. Appl. No. 14/148,568 dated Mar. 26, 2015. |
| Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014. |
| Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 2, 2015. |
| Official Communication for U.S. Appl. No. 14/225,006 dated Dec. 21, 2015. |
| Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015. |
| Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 11, 2015. |
| Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014. |
| Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015. |
| Official Communication for U.S. Appl. No. 14/225,084 dated Jan. 4, 2016. |
| Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015. |
| Official Communication for U.S. Appl. No. 14/225,160 dated Aug. 12, 2015. |
| Official Communication for U.S. Appl. No. 14/225,160 dated May 20, 2015. |
| Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014. |
| Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014. |
| Official Communication for U.S. Appl. No. 14/251,485 dated Oct. 1, 2015. |
| Official Communication for U.S. Appl. No. 14/264,445 dated Apr. 17, 2015. |
| Official Communication for U.S. Appl. No. 14/268,964 dated Sep. 3, 2014. |
| Official Communication for U.S. Appl. No. 14/278,963 dated Jan. 30, 2015. |
| Official Communication for U.S. Appl. No. 14/289,596 dated Jul. 18, 2014. |
| Official Communication for U.S. Appl. No. 14/289,596 dated Jan. 26, 2015. |
| Official Communication for U.S. Appl. No. 14/289,596 dated Apr. 30, 2015. |
| Official Communication for U.S. Appl. No. 14/289,599 dated Jul. 22, 2014. |
| Official Communication for U.S. Appl. No. 14/289,599 dated May 29, 2015. |
| Official Communication for U.S. Appl. No. 14/289,599 dated Sep. 4, 2015. |
| Official Communication for U.S. Appl. No. 14/294,098 dated Aug. 15, 2014. |
| Official Communication for U.S. Appl. No. 14/294,098 dated Nov. 6, 2014. |
| Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 14, 2015. |
| Official Communication for U.S. Appl. No. 14/306,138 dated Feb. 18, 2015. |
| Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 23, 2014. |
| Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 24, 2015. |
| Official Communication for U.S. Appl. No. 14/306,138 dated May 26, 2015. |
| Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 3, 2015. |
| Official Communication for U.S. Appl. No. 14/306,147 dated Feb. 19, 2015. |
| Official Communication for U.S. Appl. No. 14/306,147 dated Dec. 24, 2015. |
| Official Communication for U.S. Appl. No. 14/306,147 dated Aug. 7, 2015. |
| Official Communication for U.S. Appl. No. 14/306,147 dated Sep. 9, 2014. |
| Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 11, 2015. |
| Official Communication for U.S. Appl. No. 14/306,154 dated May 15, 2015. |
| Official Communication for U.S. Appl. No. 14/306,154 dated Jul. 6, 2015. |
| Official Communication for U.S. Appl. No. 14/306,154 dated Sep. 9, 2014. |
| Official Communication for U.S. Appl. No. 14/319,161 dated Jan. 23, 2015. |
| Official Communication for U.S. Appl. No. 14/319,765 dated Sep. 10, 2015. |
| Official Communication for U.S. Appl. No. 14/319,765 dated Jun. 16, 2015. |
| Official Communication for U.S. Appl. No. 14/319,765 dated Nov. 25, 2014. |
| Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 4, 2015. |
| Official Communication for U.S. Appl. No. 14/323,935 dated Jun. 22, 2015. |
| Official Communication for U.S. Appl. No. 14/323,935 dated Nov. 28, 2014. |
| Official Communication for U.S. Appl. No. 14/323,935 dated Mar. 31, 2015. |
| Official Communication for U.S. Appl. No. 14/326,738 dated Dec. 2, 2014. |
| Official Communication for U.S. Appl. No. 14/326,738 dated Jul. 31, 2015. |
| Official Communication for U.S. Appl. No. 14/326,738 dated Mar. 31, 2015. |
| Official Communication for U.S. Appl. No. 14/451,221 dated Oct. 21, 2014. |
| Official Communication for U.S. Appl. No. 14/451,221 dated Apr. 6, 2015. |
| Official Communication for U.S. Appl. No. 14/463,615 dated Nov. 13, 2014. |
| Official Communication for U.S. Appl. No. 14/463,615 dated May 21, 2015. |
| Official Communication for U.S. Appl. No. 14/463,615 dated Jan. 28, 2015. |
| Official Communication for U.S. Appl. No. 14/463,615 dated Dec. 9, 2015. |
| Official Communication for U.S. Appl. No. 14/473,552 dated Feb. 24, 2015. |
| Official Communication for U.S. Appl. No. 14/479,863 dated Dec. 26, 2014. |
| Official Communication for U.S. Appl. No. 14/483,527 dated Jun. 22, 2015. |
| Official Communication for U.S. Appl. No. 14/483,527 dated Jan. 28, 2015. |
| Official Communication for U.S. Appl. No. 14/486,991 dated Mar. 10, 2015. |
| Official Communication for U.S. Appl. No. 14/490,612 dated Aug. 18, 2015. |
| Official Communication for U.S. Appl. No. 14/504,103 dated Mar. 31, 2015. |
| Official Communication for U.S. Appl. No. 14/504,103 dated Feb. 5, 2015. |
| Official Communication for U.S. Appl. No. 14/518,757 dated Dec. 1, 2015. |
| Official Communication for U.S. Appl. No. 14/518,757 dated Apr. 2, 2015. |
| Official Communication for U.S. Appl. No. 14/518,757 dated Jul. 20, 2015. |
| Official Communication for U.S. Appl. No. 14/552,336 dated Jul. 20, 2015. |
| Official Communication for U.S. Appl. No. 14/571,098 dated Mar. 11, 2015. |
| Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 5, 2015. |
| Official Communication for U.S. Appl. No. 14/579,752 dated Aug. 19, 2015. |
| Official Communication for U.S. Appl. No. 14/579,752 dated May 26, 2015. |
| Official Communication for U.S. Appl. No. 14/579,752 dated Dec. 9, 2015. |
| Official Communication for U.S. Appl. No. 14/580,218 dated Jun. 26, 2015. |
| Official Communication for U.S. Appl. No. 14/581,920 dated Mar. 1, 2016. |
| Official Communication for U.S. Appl. No. 14/581,920 dated Jun. 13, 2016. |
| Official Communication for U.S. Appl. No. 14/581,920 dated May 3, 2016. |
| Official Communication for U.S. Appl. No. 14/639,606 dated Oct. 16, 2015. |
| Official Communication for U.S. Appl. No. 14/639,606 dated May 18, 2015. |
| Official Communication for U.S. Appl. No. 14/639,606 dated Jul. 24, 2015. |
| Official Communication for U.S. Appl. No. 14/639,606 dated Apr. 5, 2016. |
| Official Communication for U.S. Appl. No. 14/676,621 dated Jul. 30, 2015. |
| Official Communication for U.S. Appl. No. 14/698,432 dated Jun. 3, 2016. |
| Official Communication for U.S. Appl. No. 14/726,353 dated Mar. 1, 2016. |
| Official Communication for U.S. Appl. No. 14/726,353 dated Sep. 10, 2015. |
| Official Communication for U.S. Appl. No. 14/734,772 dated Jul. 24, 2015. |
| Official Communication for U.S. Appl. No. 14/746,671 dated Sep. 28, 2015. |
| Official Communication for U.S. Appl. No. 14/800,447 dated Dec. 10, 2015. |
| Official Communication for U.S. Appl. No. 14/813,749 dated Sep. 28, 2015. |
| Official Communication for U.S. Appl. No. 14/857,071 dated Mar. 2, 2016. |
| Official Communication for U.S. Appl. No. 15/072,174 dated Jun. 1, 2016. |
| Restriction Requirement for U.S. Appl. No. 14/857,071 dated Dec. 11, 2015. |
| Notice of Allowance for U.S. Appl. No. 14/584,961 dated Jul. 13, 2017, 58 pages. |
| Notice of Allowance for U.S. Appl. No. 15/152,017 dated Sep. 6, 2016, 12 pages. |
| Notice of Allowance for U.S. Appl. No. 15/159,622 dated Oct. 6, 2017, 56 pages. |
| Official Communication for European Patent Application No. 14189344.6 dated Jun. 27, 2017, 24 pages. |
| Official Communication for European Patent Application No. 14189344.6 dated May 8, 2017, 13 pages. |
| Official Communication for European Patent Application No. 14189344.6 dated Jan. 9, 2017, 12 pages. |
| Official Communication for European Patent Application No. 15201881.8 dated Sep. 27, 2017, 9 pages. |
| Official Communication for European Patent Application No. 15201924.6 dated Oct. 9, 2017, 6 pages. |
| Official Communication for U.S. Appl. No. 14/584,961 dated Mar. 9, 2017, 21 pages. |
| Official Communication for U.S. Appl. No. 14/815,459 dated Jun. 13, 2016, 44 pages. |
| Official Communication for U.S. Appl. No. 15/159,622 dated May 10, 2017, 5 pages. |
| Restriction Requirement for U.S. Appl. No. 13/839,026 dated Apr. 2, 2015, 5 pages. |
| Notice of Acceptance for Australian Patent Application No. 2014250637 dated Mar. 26, 2018, 3 pages. |
| Official Communication for European Patent Application No. 19171133.2 dated Jun. 11, 2019, 5 pages. |
| Official Communication for European Patent Application No. 15201924.6 dated May 18, 2018, 5 Pages. |
| Official Communication for U.S. Appl. No. 15/293,140 dated Jan. 11, 2018, 63 pages. |
| Official Communication for U.S. Appl. No. 14/859,882 dated Mar. 21, 2019, 33 pages. |
| Official Communication for U.S. Appl. No. 14/859,882 dated Sep. 21, 2018, 30 pages. |
| Official Communication for U.S. Appl. No. 14/859,882 dated Feb. 8, 2018, 76 pages. |
| Official Communication for U.S. Appl. No. 15/335,903 dated Jul. 16, 2019, 66 pages. |
| Official Communication for U.S. Appl. No. 15/782,236 dated Jan. 14, 2019, 61 pages. |
| Official Communication for U.S. Appl. No. 15/782,236 dated Mar. 19, 2019, 10 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 62249088 | Oct 2015 | US | |
| 62330465 | May 2016 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15152017 | May 2016 | US |
| Child | 15406195 | US |
