Patent Grant
10885021
The present disclosure relates to systems and techniques for data integration, analysis, and visualization. More specifically, the present disclosure relates to a text-based interactive interpreter and user interface that sequentially allows a user to modify, transform, or filter data sets from a data pipeline.
In a data pipeline system, it can be difficult for users to make API requests to get data from the data pipeline system. For example, a user may be interested in building an application that uses the data or is interested in conducting an investigation using the data. The API requests can be complex and requires the user to have a lot of knowledge about the services to properly request the data. It would be beneficial if users had a way to easily request data from the data pipeline system and to be able to use and/or explore the data in a quick and easy manner. Further, the results of the user's investigation should be shareable with other users, applications, or services.
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.
In some embodiments, the systems and methods described can include a text-based interactive interpreter and user interface that sequentially allows a user to modify, transform, or filter data sets from a data pipeline. A user can enter text-based instructions where the output can be rendered as a table, map, JSON, or other view. A user can easily retrieve a data set from a resource identifier for the data set. First, second, third, etc. instructions and results are presented in a sequential manner down the user interface page. The second, third, etc. instructions can refer to variables and output data from previous blocks in the user interface page. The interpreted user-generated textual instruction blocks retrieve the data set specified in the textual blocks, parses and executes the user's textual instructions to transform, filter, or manipulate the data set. The resulting data set is rendered according to the data type into a table, map, JSON, or other view. Each or a subset of the textual instruction blocks can be persisted, versioned, and permissioned according to access control lists. The particular session of textual instruction blocks and transformations can be published as a service, which, if called again, can dynamically perform the user generated instructions and output the result data.
The described systems and methods for creating custom code and converting to API or service information to be used later can provide a simplified process that can be performed with less technical expertise and in less time. The benefit of clicking one button to generate an API or service makes the whole process easier and requires little to no prior experience with services to generate or service functions.
Accordingly, in various embodiments, large amounts of data are automatically and dynamically calculated interactively in response to user inputs, and the calculated data is efficiently and compactly presented to a user by the system. Thus, in some embodiments, the user interfaces described herein are more efficient as compared to previous user interfaces in which data is not dynamically updated and compactly and efficiently presented to the user in response to interactive inputs.
Further, as described herein, the system may be configured and/or designed to generate user interface data useable for rendering the various interactive user interfaces described. The user interface data may be used by the system, and/or another computer system, device, and/or software program (for example, a browser program), to render the interactive user interfaces. The interactive user interfaces may be displayed on, for example, electronic displays (including, for example, touch-enabled displays).
Additionally, it has been noted that design of computer user interfaces “that are useable and easily learned by humans is a non-trivial problem for software developers.” (Dillon, A. (2003) User Interface Design. MacMillan Encyclopedia of Cognitive Science, Vol. 4, London: MacMillan, 453-458.) The various embodiments of interactive and dynamic user interfaces of the present disclosure are the result of significant research, development, improvement, iteration, and testing. This non-trivial development has resulted in the user interfaces described herein which may provide significant cognitive and ergonomic efficiencies and advantages over previous systems. The interactive and dynamic user interfaces include improved human-computer interactions that may provide reduced mental workloads, improved decision-making, reduced work stress, and/or the like, for a user. For example, user interaction with the interactive user interfaces described herein may provide an interactive, optimized display of data and may enable a user to more quickly access, navigate, assess, and digest such information than previous systems.
In some embodiments, data may be presented in graphical representations, such as visual representations, such as charts and graphs, where appropriate, to allow the user to comfortably review the large amount of data and to take advantage of humans' particularly strong pattern recognition abilities related to visual stimuli. In some embodiments, the system may present aggregate quantities, such as totals, counts, and averages. The system may also utilize the information to interpolate or extrapolate, e.g. forecast, future developments.
Further, the interactive and dynamic user interfaces described herein are enabled by innovations in efficient interactions between the user interfaces and underlying systems and components. For example, disclosed herein are improved methods of receiving user inputs, translation and delivery of those inputs to various system components, automatic and dynamic execution of complex processes in response to the input delivery, automatic interaction among various components and processes of the system, and automatic and dynamic updating of the user interfaces. The interactions and presentation of data via the interactive user interfaces described herein may accordingly provide cognitive and ergonomic efficiencies and advantages over previous systems.
Various embodiments of the present disclosure provide improvements to various technologies and technological fields. For example, as described above, existing data storage and processing technology (including, e.g., in memory databases) is limited in various ways (e.g., manual data review is slow, costly, and less detailed; data is too voluminous; etc.), and various embodiments of the disclosure provide significant improvements over such technology. Additionally, various embodiments of the present disclosure are inextricably tied to computer technology. In particular, various embodiments rely on detection of user inputs via graphical user interfaces, calculation of updates to displayed electronic data based on those user inputs, automatic processing of related electronic data, and presentation of the updates to displayed images via interactive graphical user interfaces. Such features and others (e.g., processing and analysis of large amounts of electronic data) are intimately tied to, and enabled by, computer technology, and would not exist except for computer technology. For example, the interactions with displayed data described below in reference to various embodiments cannot reasonably be performed by humans alone, without the computer technology upon which they are implemented. Further, the implementation of the various embodiments of the present disclosure via computer technology enables many of the advantages described herein, including more efficient interaction with, and presentation of, various types of electronic data.
In some embodiments, the systems and methods described can comprise: a data pipeline system, wherein the data pipeline system is configured to perform data transformations to generate a plurality of data sets; a first non-transitory computer storage medium configured to at least store persisted user generated computer-executable instructions; a second non-transitory computer storage medium configured to at least store computer-executable instructions; and one or more computer hardware processors in communication with the second non-transitory computer storage medium, the one or more computer hardware processors configured to execute the computer-executable instructions to at least: cause presentation of a graphical user interface configured to receive user generated computer-executable instructions; receive, from the graphical user interface, first user generated computer-executable instructions comprising a resource identifier; in response to receiving the first user generated computer-executable instructions, retrieve, from the data pipeline system, a data set from the plurality of data sets associated with the resource identifier; receive, from the graphical user interface, second user generated computer-executable instructions; in response to receiving the second user generated computer-executable instructions, apply the second user generated computer-executable instructions, wherein applying the second user generated computer-executable instructions further comprises: determining, based on automated analysis of the second user generated computer-executable instructions, an operation; performing the determined operation on the data set; and generating output from the operation, wherein the output is different from the data set; causing presentation, in the graphical user interface, of the output; and storing, in the first non-transitory computer storage medium, the first user generated computer-executable instructions and the second user generated computer-executable instructions.
In some embodiments, the systems and methods described can also comprise: receive, from the graphical user interface, third user generated computer-executable instructions; and in response to receiving the third user generated computer-executable instructions, apply the third user generated computer-executable instructions, wherein applying the third user generated computer-executable instructions further comprises: publishing the second user generated computer-executable instructions as a service.
In some embodiments, the systems and methods described can also comprise: execute the service to dynamically retrieve and process data. Also, in some embodiments, the systems and methods described can also comprise: assign, a reference variable to the output from the operation based on the second user generated computer-executable instructions; receive fourth user generated computer-executable instructions comprising the reference variable; and in response to receiving the fourth user generated computer-executable instructions, apply the fourth user generated computer-executable instructions, wherein applying the fourth user generated computer-executable instructions further comprises: determining, based at least on the fourth user generated computer-executable instructions, a second operation; performing the second operation on the output identified by the reference variable; and generating second output from the second operation, wherein the second output is different from the output; and causing presentation, in the graphical user interface, of the second output.
In some embodiments, wherein executing the service to dynamically retrieve and process data further comprises: retrieving, from the first non-transitory computer storage medium, at least one of the first user generated computer-executable instructions or the second user generated computer-executable instructions; and applying at least one of the first user generated computer-executable instructions or the second user generated computer-executable instructions a second time.
Further, in some embodiments, the systems and methods described can also include: the first user generated computer-executable instructions is stored as a first block and the second user generated computer-executable instructions is stored as a second block, at least one of the first user generated computer-executable instructions or the second user generated computer-executable instructions are accessible by a plurality of users, and/or at least one of the first user generated computer-executable instructions or the second user generated computer-executable instructions are accessible to one or more users based at least in part on preconfigured user access restrictions.
Additional embodiments of the disclosure are described below in reference to the appended claims, which may serve as an additional summary of the disclosure.
In various embodiments, systems and/or computer systems are disclosed that comprise a computer readable storage medium having program instructions embodied therewith, and one or more processors configured to execute the program instructions to cause the one or more processors to perform operations comprising one or more aspects of the above- and/or below-described embodiments (including one or more aspects of the appended claims).
In various embodiments, computer-implemented methods are disclosed in which, by one or more processors executing program instructions, one or more aspects of the above- and/or below-described embodiments (including one or more aspects of the appended claims) are implemented and/or performed.
In various embodiments, computer program products comprising a computer readable storage medium are disclosed, wherein the computer readable storage medium has program instructions embodied therewith, the program instructions executable by one or more processors to cause the one or more processors to perform operations comprising one or more aspects of the above- and/or below-described embodiments (including one or more aspects of the appended claims).
Overview
In database systems, analysts interact with and manipulate data. However, in some of these existing systems, simply accessing the data can be a time-consuming process. For example, the data may be stored in a myriad of different locations and/or may require knowledge of various complicated Application Programming Interfaces (APIs). Accordingly, a large and technically complex database system may present a barrier for analysts to analyze, investigate, and manipulate data.
The systems and methods described herein may advantageously provide a simplified application or tool to enable the users to retrieve and interact with data from a database system, such as a database pipeline system. In some embodiments, the systems and methods described herein may advantageously provide a text-based interactive interpreter and user interface that sequentially allows a user to modify, transform, or filter data sets from the database system. Moreover, those interactions and/or customized logic prepared by a user can be shared with other users. In some embodiments, users can prepare instructions in an interactive manner with a programming language (e.g., JavaScript, Python, SQL, PHP, HTML, C++, C Sharp, Java, Visual Basic, or any other programming language) to interact with the system and/or data. For example, a user can execute a command to retrieve a data set, receive the data set, and/or manipulate the data set. A data set can be stored in a designated variable. User generated instructions can modify, transform, or filter data elements in the data set. For example, in some embodiments, portions of multiple data sets can be combined to form one new data set that is formatted in a particular format. A user can enter text-based instructions where the output can be rendered as a table, map, JSON, or other view. A user can easily retrieve a data set from a resource identifier for the data set. First, second, third, etc. instructions and results are presented in a sequential manner down the user interface page. The second, third, etc. instructions can refer to variables and output data from previous blocks in the user interface page. The interpreted user-generated textual instruction blocks retrieve the data set specified in the textual blocks, parses and executes the user's textual instructions to transform, filter, or manipulate the data set. The resulting data set is rendered according to the data type into a table, map, JSON, or other view. Each or a subset of the textual instruction blocks can be persisted, versioned, and permissioned according to access control lists. Some or all the instructions can be shared with other users. Some or all the instructions can be combined and used in or published as a service. The particular session of textual instruction blocks and transformations can be published as a service, which, if called again, can dynamically perform the user generated instructions and output the result data.
In some embodiments, a user can, with one click, automatically compile the written code into a shareable service so that other users can incorporate the steps as a function in their own code, database, or service. What could have taken significant amounts of time and effort and a specialized expertise, now may take less time and minimal knowledge or familiarity with coding and databases. A user can automatically, by the press of a button, create a service to pull data from a data pipeline, modify the data, and output a resulting data set automatically. Further, in some embodiments, a user can use the systems and methods described to focus the user's analysis on portions of a particular data set that is relevant to the user, and then publish the data to a shareable link. So that other users can click the link to view the relevant filtered and customized data that is up-to-date because it is pulling it from the data pipeline upon each refresh. For example, a user can download a data set listing all restaurant locations for a particular business with financial information associated with each branch. The user can modify, transform, and filter the large data set to show only the restaurants with negative profits (i.e., losses) and removing all columns that are not relevant. Then the user can publish the resulting table to a URL to share. Upon selecting the URL, any user can be shown an up-to-date list of restaurants with negative profits based on information that is currently in the data pipeline system. In some embodiments, because the information is pulled from the data pipeline system upon each user selection of the URL, the information will be as up-to-date as it is within the data pipeline system.
The described systems and methods for creating custom instructions and/or publishing a service that can be used later can simplify data interaction processes to be performed with less technical expertise and in less time. The benefit of clicking one button to generate a service can make the process easier and/or may require little to no prior experience with services.
As mentioned above, in some of existing database systems, simply accessing data can be a time-consuming process, let alone enabling an analyst to interact and manipulate the data. For example, the data may be stored in a various database tables, in various electronic resources or files, and/or may require knowledge of various complicated APIs to retrieve the data. Accordingly, a large and technically complex database system may present a barrier for analysts to analyze, investigate, and manipulate data.
Accordingly, the systems and techniques described herein may improve computer technology, the accessibility of data, and/or the reusability of user-generated computer instructions. The systems and techniques described herein can improve computer database technology by enabling users to possibly access and interact with database data quicker. Moreover, providing a framework for sharing and reusing user generated computer instructions can improve computer technology. The user generated instructions may be in one or more programming languages. Thus, the systems and techniques described herein can improve computer technology and/or may be inherently tied to computer technology.
The systems and techniques described herein may improve graphical user interfaces. For example, there may not be an existing graphical user interface similar to the one described herein for providing users the capability of interacting with database and/or file resources as described herein. Accordingly, the systems and techniques described herein can enable users to access data faster, perform analyses faster, and/or interact with one or more user interfaces faster than existing graphical user interface systems (such as by reducing the number of clicks or selections by a user). Thus, the systems and techniques described herein can provide an improved and/or novel user interface for database and/or file resources.
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 exemplary definitions.
Block: a group of one or more user generated instructions, such as computer readable program instructions. For example, using the interactive interpreter system described herein, a user can enter instructions into a user input area. The collection of the user generated instructions can be stored as a “block.” Also as used herein in the context of a flowchart, a “block” can refer to a step in a flowchart.
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).
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.
Data Object or Object: A data container for information representing specific things in the world that have a number of definable properties. For example, a data object can represent an entity such as a person, a place, an organization, a market instrument, or other noun. A data object can represent an event that happens at a point in time or for a duration. A data object can 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 object may be associated with a unique identifier that uniquely identifies the data object. The object's attributes (e.g. metadata about the object) may be represented in one or more properties.
Object Type: Type of a data object (e.g., Person, Event, or Document). Object types may be defined by an ontology and may be modified or updated to include additional object types. An object definition (e.g., in an ontology) may include how the object is related to other objects, such as being a sub-object type of another object type (e.g. an agent may be a sub-object type of a person object type), and the properties the object type may have.
Properties: Attributes of a data object that represent individual data items. At a minimum, each property of a data object has a property type and a value or values.
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 (e.g. a time series), etc.
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.
Link: A connection between two data objects, based on, for example, a relationship, an event, and/or matching properties. Links may be directional, such as one representing a payment from person A to B, or bidirectional.
Link Set: Set of multiple links that are shared between two or more data objects.
Interactive Interpreter System and Graphical User Interface
In
In some embodiments, preparation of data sets by the data pipeline system (e.g., data pipeline system 428) can include formatting the data so that the interactive interpreter system can read the data or interpret the data properly. For example, data may be stored in one or more blocks, such that each block can be assigned an identifier. Also, in some embodiments, the data pipeline system can further filter data based on data access control restrictions. For example, particular users may have access to limited data sets, or limited data/metadata within a data set, and the data pipeline system and prevent transmission of such data. In some embodiments, the interactive interpreter system can include access controls so that even if secure data is retrieved or received from a data pipeline system, that prior to displaying any data to a particular user, the interactive interpreter system can filter the data based on the user access controls. Further, in some embodiments, both the data pipeline system and the interactive interpreter system can work together to filter restricted data from a particular user or multiple users.
Continuing with the example in
Continuing in
In
In
In
In some embodiments, the interactive interpreter system can display an area in the graphical user interface 100, such as the area 114, which can be configured to receive input from a user device (e.g., user device 424 described herein). For example, upon the receipt of inputted text, the graphical user interface 100 can update to display a corresponding area reference label 120 and display the text. When sufficient text has been entered a user can select an execute element 118 to generate an output based on the input text. Various examples showing the result of input text and associated outputs are shown in
In some embodiments, each successive area can depend on the prior areas in order. For example, area 110 (labeled as “$3”) can depend on area 106 (labeled as “$2”), which can depend on area 104 (labeled as “$1”). Calculations, results, and typed instructions can persist while a user continues creating new areas and results. Further, in some embodiments, although variables and data, transformations, and/or variables can persist, the areas comprising instructions (e.g., area 102) can be referenced as well, for example by using the label of “$1.” In some embodiments, for example, a user can prepare a data set in an area which can be referenced by the area label 120 in a later area.
In some embodiments, the results areas (e.g., 104, 108, and 112) can include various presentation formats of data related to the associated input areas. For example, such formats can include tables, graphs, charts, tab delimited data, JavaScript Object Notation (JSON) data, geographical or geocoded data, XML data, or any other data format. In some embodiments, the presentation can default to a particular presentation format based on the data to be presented. For example, if data is returned from multiple sources with the same number and title of columns and rows, then a tabular format can be presented with the data elements. Although in some embodiments, each input area can be presented with a result area showing the output of the inputted instructions, there may be some embodiments or situations where a results area is not shown. For example, a results area may not be shown if data within a dataset is inconsistent with each other for default presentation purposes (i.e., geocoded data for a set of items and a 10 column tabular data set all of which are in a larger data set). In some embodiments, a default format of the data can be presented in those cases, such as by showing the geocoded data and the 10 column tabular data in a JSON data format. For example, in
In some embodiments, it can be advantageous to present a limited amount of information in the result area as a preview result area rather than the full data set returned based on the input area, so that a user can quickly review the results in the graphical user interface 100 and determine additional filtering or steps to add to a current input area or a next input area. The current input area is the input area the user is currently working in and the next input area is an input area that has not been created yet or assigned a label (e.g., “$10”).
The preview result area described can be in the format of a table that is paginated and/or with scroll bars on the sides enabling a user to scroll through the various columns of a table or paginate through pages. In some embodiments, the preview result area can list only a first set of results of the entire set of results to at least show the user what results are returned and how the results look (e.g., by analysis of a table's column names, column numbers, row numbers, and whether any results are returned at all) with or without pagination or scroll bars. However, with some result formats, such as graphical charts (e.g., a pie chart, bar graph, heat map, topographical map, etc.), incorporating all data into the results area may be necessary so that a user is presented with accurate information. For example, a pie chart would potentially be different if some data was withheld from its creation. Thus, depending on the visualization, all data may be useful to present an accurate chart. In cases where all data is not necessary, a portion of the data can be presented and remain accurate even though it is only a subset of the full result. In some embodiments, the result area can comprise a note or description warning the user that content has not been displayed, or is currently hidden from view. Also, when depicting a graphical chart, it may be beneficial to present the chart in a window that can be expanded, zoomed into or out of, or minimized, so that further code development can be performed by the user without an obtrusive pie chart on the screen taking up limited screen space. In some embodiments, there may additionally be a default presentation format for various types of data. For example, if geocoded data is selected, then a map may be the default presentation method so that a map is presented with the various data plotted onto the map and the map zoomed in to the relevant portion of the map showing the data. In some embodiments, with respect to presenting a map, a large portion of data may be in one area (e.g., the United States), and relatively few data may appear in another area (e.g., Australia) either due to outlier information or errors, for example. In this case, the map can be zoomed into to show only the United States where the majority of geocoded data is related to and plotted.
In some embodiments, while, or after, an output or result is generated and displayed in an associated result area, a user can enter additional instructions into the input area to further update the result area contents. Alternatively, or in addition to, a user can begin a new input area and incorporate additional instructions (e.g., by referencing the prior input area and continuing filtering in that way). In some embodiments, if data is returned with a different number of columns or rows, or the columns or rows have different names or data types, the presentation format can be shown in a default format, such as a JSON default format. In some embodiments, a user can select a user interface element (e.g., a button or drop down list) to quickly toggle the preferred format or display settings (e.g., show all data versus a portion, or zoom in or out of a graphical chart or map, etc.).
In some embodiments, various types of programming languages can be supported by the interactive interpreter system for executing instructions. Example programming languages can include JavaScript, Python, SQL, PHP, HTML, C++, C Sharp, Java, Visual Basic, or any other programming language. For example, if text is input into a dynamically interactive input area, the interactive interpreter system 402 and/or user device(s) 424 can parse the input text to execute. In some embodiments, various coding libraries can be loaded into the interactive interpreter system to assist with interpreting the inputs. In some embodiments, the interactive interpreter system (e.g., interactive interpreter system 402) and/or a user device (e.g., user device(s) 424) might require the loading of various software libraries to enable parsing of the inputted text into correct instructions. In some embodiments, the interactive interpreter system may also be limited to one or a few programming languages, or a preconfigured pseudocode format, that a user is limited to using. In some embodiments, there can also be user access controls implemented by the system configured by a system administrator. For example, a user, depending on the interactive interpreter system configuration or user access control settings, may be limited to performing only a limited subset of functions within a programming language or be limited to a particular programming language. For example, the user can primarily use JavaScript, such as in
In some embodiments, a user can select elements 116A-116F to create a service or API based on the current input area and/or previous input areas. A service can be an architectural style that structures an application as a collection of loosely coupled services, which implement business capabilities. For example, in
In some embodiments, the user can save or share this API information to use in other systems going forward. Upon selection of the elements 116A-116F, the interactive interpreter system can reconfigure the instructions to an appropriate format automatically to generate the API. For example, in
In some embodiments, various inputs can be stored in a database and persisted through various system shutdowns or user log-offs. Thus, if the user generated instructions are executed at a later time, the results of the instructions can be determined dynamically. Additionally or alternatively, some of the results of the user generated instructions may be stored. A user may be able to save his or her work and resume the work upon opening the relevant application or browser page and see the prior work and results. Thus, the instructions and/or data can be persisted such that the user can later revisit the instructions and/or data.
At block 302, the interactive interpreter system 402 can cause presentation of a graphical user interface (e.g., the graphical user interface 100 of
At block 303, the user device(s) 424 can receive the display instructions from the interactive interpreter system 402 regarding how to display the graphical user interface. At block 304, the user device(s) 424 displays the graphical user interface such that the graphical user interface includes at least one or more dynamically interactive input areas configured to receive inputs. In some embodiments the inputs can be text and/or instructions (e.g., JavaScript, python, C++, Java, or the like). For example, if text is input into a dynamically interactive input area, the interactive interpreter system 402 and/or user device(s) 424 can parse the input text into instructions for execution. In some embodiments, various software libraries can be used by the interactive interpreter system 402 and/or the user device(s) 424 to interpret the user input including the text and/or instructions.
In some instances, at block 306, the user device(s) 424 receive(s) an input of first user generated computer-executable instructions comprising at least a resource identifier. As described herein, the resource identifier can refer to a resource in a database system, such as a data pipeline system. Then the user device(s) 424 transmit(s) the first user generated computer-executable instructions comprising at least a resource identifier to the interactive interpreter system 402.
At block 308, the interactive interpreter system 402 receives the first user generated computer-executable instructions comprising at least a resource identifier and processes the information. Also, at block 308, the interactive interpreter system 402 receives or retrieves one or more data sets prepared at block 310 by a database system, such as the data pipeline system 428. In some embodiments, the resource identifier can identify a resource location to retrieve the data set, such as a location on a file system.
Additionally or alternatively, processing the information can include looking up the data in a data structure, such as a graph, searching additional databases for data or metadata pertaining to the resource identifier, or any other method desirable user or that would otherwise improve the efficiency of the system. For example, in some embodiments, processing can include traversal of every piece of data in a particular data set to analyze and determine which data is associated with the resource identifier. Additionally or alternatively, the data set can be stored in an index, such as a hash data structure, which contains information about what storage location the data is in. Further, in some embodiments, preparation of data sets by the data pipeline system 428 can include formatting the data so that the interactive interpreter system 402 can read the data or interpret the data properly. Also, in some embodiments, the data pipeline system 428 can further filter data based on data access control restrictions. For example, particular users may have access to limited data sets, or limited data/metadata within a data set, and the data pipeline system 428 and prevent transmission of such data. Thus, an authorization token or user identifier can be retrieved and/or received by the interactive interpreter system 402 for a user of the user device(s) 424. In some embodiments, the interactive interpreter system 402 can include access controls so that even if secure data is retrieved or received from a data pipeline system 428, that prior to displaying any data to a particular user, the interactive interpreter system 402 can filter the data based on the user access controls. Further, in some embodiments, both the data pipeline system 428 and the interactive interpreter system 402 can work together to filter restricted data from a particular user or multiple users. Then, the data set is sent to block 316 described below.
In other instances, at block 312, the user device(s) 424 receive(s) an input of second user generated computer-executable instructions corresponding to a particular operation. Then the user device(s) 424 transmit(s) the second user generated computer-executable instructions corresponding to a particular operation to the interactive interpreter system 402 for processing an execution. In some embodiments, the interactive interpreter system 402 can process and execute the first user generated computer-executable instructions. In other embodiments, the user device(s) 424 can process and execute the first user generated computer-executable instructions. Additionally or alternatively, both the interactive interpreter system 402 and user device(s) 424 can process and/or execute different portions of the first user generated computer-executable instructions. Therefore, in some embodiments, the interactive interpreter system 402 and user device(s) 424 may operate independently with separate capabilities and tasks. In some embodiments, the user device(s) 424 can include the interactive interpreter system 402 and execute the user generated computer-executable instructions within the user device(s) 424.
At block 314, the interactive interpreter system 402 receives the second user generated computer-executable instructions corresponding to a particular operation and processes the information. In some embodiments, processing the information can include executing a software library, such as an interpreter, to parse the instructions and determine one or more operations to be performed. Example operations can include performing one or more logical operations on a data set, extracting data from the data set, modifying data from the data set, merging data from multiple data sets, and/or any other operation supported by a programming language.
At block 316, the interactive interpreter system 402 receives the data set(s) from block 308 and the processed operation from block 314 to perform or execute the determined operation on the data set. At block 318, the interactive interpreter system 402 generates an output from the operation.
At block 320, the interactive interpreter system 402 can cause presentation of a graphical user interface (e.g., the graphical user interface 100 of
At block 322, the user device(s) 424 receive(s) the graphical user interface including the generated output from block 318. Then at block 323, the user device(s) 424 presents the graphical user interface including a presentation of the generated output from block 318.
At block 324, after the user device(s) 424 receive(s) the first user generated computer-executable instructions at block 306 and/or the second user generated computer-executable instructions at block 312, the interactive interpreter system retrieves or receives the first and second user generated computer-executable instructions and stores the instructions. In some embodiments, only one of the first and second user generated computer-executable instructions can be stored. In some embodiments, the first and second user generated computer-executable instructions can be stored in the remote database 426, a local database 420, and/or a relationship database 427. As described herein, the user generated computer-executable instructions can be published as a service. In some embodiments, the user generated computer-executable instructions can include input parameters. Accordingly, a published service can receive input parameters that are used by the user generated computer-executable instructions upon execution.
In some embodiments, a user can cause the interactive interpreter system to store one or more of the user generated blocks. For example, the interactive interpreter system 402 can store all of the blocks from a particular user session, such as all of the blocks that correspond to the input areas of
The interactive interpreter system 402, as described in
In some embodiments, the relationship database 427 may only comprise related metadata. In some embodiments, the data, instructions, or code can be stored in a blockchain or distributed ledger, using distributed ledger technology. For example, data can be converted using the InterPlanetary File System (IPFS) protocol to create a content-addres sable, peer-to-peer method of storing data in a distributed file system. The IPFS protocol would break a particular file into multiple pieces, sign it cryptographically, and store it on difference computer nodes around the world. The protocol would return a hash which can uniquely identify the file. The hash can then be stored on a blockchain or distributed ledger. To retrieve the file, the blockchain or distributed ledger network can be queried to pull out the hash. With the hash, a query can be sent to IPFS network with the retrieved hash. Then the IPFS network will return the original file. This ensures that the uploaded file is secure, stored permanently, and cannot be tampered with.
The input engine 404 interfaces with one or more user device(s) 424 through a local area network or the internet. User device(s) 424 may provide instruction or information to the interactive interpreter system 402. The input engine 404 also interfaces with a remote database 426 and a data pipeline system 428. The remote database 426 and data pipeline system 428 can provide information to the interactive interpreter system 402 through the input engine 404. In some embodiments, data can be pushed to the interactive interpreter system 402 from the remote database 426 or data pipeline system 428, and/or the interactive interpreter system 402 can retrieve data from the remote database 426 or data pipeline system 428. The input engine 404 receives then sends any instructions or information to the central processing engine 406.
The central processing engine 406 receives data and information from the input engine 404 and processes the data depending on the methods described in
The interactive interpreter engine 412 includes preferences 414, input relationships 416, display settings 418, a browser 419, and a relationship database 427. In some embodiments, certain aspects of the interactive interpreter engine 412 can be performed by a back-end server and other aspects can be performed by a user's computing device. In some embodiments, the interactive interpreter system 402 can be just the user device 424 or a back-end server. The preferences 414 can comprise various customizations or preferences one or more user device(s) 424, or administrators, preconfigured on how the one or more users associated with the user device(s) 424 prefers to view the various data, or how members of a group prefer to view the data. In some embodiments, the preferences 414 can be based on the associated user's title or role in a company, or device characteristics (e.g., hardware, software, location, etc.). The data relationships 416 and/or display settings 418 can comprise various customizations or preferences on how the members of a particular group prefer to view the data. For example, user device(s) 424 within a certain department in an organization may be presented with a graphical user interface that is different from what user device(s) 424 in another department are presented with. The display settings 418 can be based partly on the preferences 414 or data relationships 416, but also include any particular preferences for each data set, as opposed to instructions or settings pertaining to data generally. For example, the display settings 418 can include for a particular data set, or set of resources, retrieved from a data pipeline system 428, for example, formatting instructions based on the user, group, administrator, or the like for a data set to appear in a certain way on the graphical user interface, present a certain set of data, and/or be located in a certain location on the graphical user interface. Additionally, the interactive interpreter engine 412 may include an interpreter browser 419 for user device(s) 424 to interact with the graphical user interface (for example, the graphical user interface 100 in
The interface generation engine 410 creates a user interface based on instructions received from the user device(s) 424. Such instructions may include instructions on what graphical user interface to create, and/or what data the interactive interpreter system 402 should obtain from the remote database 426. The remote database 426 may comprise a plurality of databases. Also, for example, the interface generation engine 410 can send a request for data to the remote database 426 and/or data pipeline system 428, which can then send information to the input engine 604, to be processed by the central processing engine 406, and to then be used in the creation of tables, charts, or data sets by the interactive interpreter engine 412, which will then be used to create a graphical user interface by the interface generation engine 410. Upon completion of creating or updating graphical user interface, the rendered graphical user interface is transmitted to the central processing engine 406 to determine any further updating, filtering, formatting, or processing of data.
The display engine 408 receives the final instructions from the central processing engine 406 on how to display the graphical user interface (for example, the graphical user interface 100 in
In an implementation the interactive interpreter system 402 (or one or more aspects of the interactive interpreter system 402) can include, or be implemented in, a “virtual computing environment.” As used herein, the term “virtual computing environment” should be construed broadly to include, for example, computer readable program instructions executed by one or more processors (e.g., as described below in the example of
Implementing one or more aspects of the interactive interpreter system 402 as a virtual computing environment may advantageously enable executing different aspects or modules of the system on different computing devices or processors, which may increase the scalability of the system. Implementing one or more aspects of the interactive interpreter system 402 as a virtual computing environment may further advantageously enable sandboxing various aspects, data, or modules of the system from one another, which may increase security of the system by preventing, e.g., malicious intrusion into the system from spreading. Implementing one or more aspects of the interactive interpreter system 402 as a virtual computing environment may further advantageously enable parallel execution of various aspects or modules of the system, which may increase the scalability of the system. Implementing one or more aspects of the interactive interpreter system 402 as a virtual computing environment may further advantageously enable rapid provisioning (or de-provisioning) of computing resources to the system, which may increase scalability of the system by, e.g., expanding computing resources available to the system or duplicating operation of the system on multiple computing resources. For example, the system may be used by thousands, hundreds of thousands, or even millions of users simultaneously, and many megabytes, gigabytes, or terabytes (or more) of data may be transferred or processed by the system, and scalability of the system may enable such operation in an efficient and/or uninterrupted manner.
Example Data Pipeline Context
The example data pipeline system 450 includes one or more applications 452, one or more services 454, one or more initial data sets 456, and a data transformation process 458 (also referred to herein as a build process). The one or more services 454 can be different from a user generated service from the interactive interpreter system 402 of
The data pipeline system 450, via the one or more services 454, can apply the data transformation process 458. An example data transformation process 458 is shown. The data pipeline system 450 can receive one or more initial data sets 462, 464. The data pipeline system 450 can apply a transformation to the data set(s). For example, the data pipeline system 450 can apply a first transformation 466 to the initial data sets 462, 464, which can include joining the initial data sets 462, 464 (such as or similar to a SQL JOIN), and/or a filtering of the initial data sets 462, 464. The output of the first transformation 466 can include a modified data set 468. A second transformation 470 of the modified data set 468 can result in an output data set 470, such as a report. Each of the steps in the example data transformation process 458 can be recorded by the data pipeline system 450 and made available as a resource to the GUI system 100. For example, a resource can include a data set and/or a data set item, a transformation, or any other step in a data transformation process. As mentioned above, the data transformation process or build 458 can be triggered by the data pipeline system 450, where example triggers can include nightly build processes, detected events, or manual triggers by a user. Additional aspects of data transformations and the data pipeline system 450 are described in further detail below.
The techniques for recording and transforming data in the data pipeline system 450 may include maintaining an immutable history of data recording and transformation actions such as uploading a new data set version to the system 450 and transforming one data set version to another data set version. The immutable history is referred to herein as “the catalog.” The catalog may be stored in a database. Preferably, reads and writes from and to the catalog are performed in the context of ACID-compliant transactions supported by a database management system. For example, the catalog may be stored in a relational database managed by a relational database management system that supports atomic, consistent, isolated, and durable (ACID) transactions.
The catalog can include versioned immutable “data sets.” More specifically, a data set may encompass an ordered set of conceptual data set items. The data set items may be ordered according to their version identifiers recorded in the catalog. Thus, a data set item may correspond to a particular version of the data set. A data set item may represent a snapshot of the data set at a particular version of the data set. As a simple example, a version identifier of ‘ 1’ may be recorded in the catalog for an initial data set item of a data set. If data is later added to the data set, a version identifier of ‘2’ may be recorded in the catalog for a second data set item that conceptually includes the data of the initial data set item and the added data. In this example, data set item ‘2’ may represent the current data set version and is ordered after data set item ‘1’.
As well as being versioned, a data set may be immutable. That is, when a new version of the data set corresponding to a new data set item is created for the data set in the system, pre-existing data set items of the data set are not overwritten by the new data set item. In this way, pre-existing data set items (i.e., pre-existing versions of the data set) are preserved when a new data set item is added to the data set (i.e., when a new version of the data set is created). Note that supporting immutable data sets is not inconsistent with pruning or deleting data set items corresponding to old data set versions. For example, old data set items may be deleted from the system to conserve data storage space.
A version of data set may correspond to a successfully committed transaction against the data set. In these embodiments, a sequence of successfully committed transactions against the data set corresponds to a sequence of data set versions of the data set (i.e., a sequence of data set items of the data set).
A transaction against a data set may add data to the data set, edit existing data in the data set, remove existing data from the data set, or a combination of adding, editing, or removing data. A transaction against a data set may create a new version of the data set (i.e., a new data set item of the data set) without deleting, removing, or modifying pre-existing data set items (i.e., without deleting, removing, or modifying pre-existing data set versions). A successfully committed transaction may correspond to a set of one or more files that contain the data of the data set item created by the successful transaction. The set of files may be stored in a file system.
In the catalog, a data set item of a data set may be identified by the name or identifier of the data set and the data set version corresponding to the data set item. In a preferred embodiment, the data set version corresponds to an identifier assigned to the transaction that created the data set version. The data set item may be associated in the catalog with the set of files that contain the data of the data set item. In a preferred embodiment, the catalog treats the set of files as opaque. That is, the catalog itself may store paths or other identifiers of the set of files but may not otherwise open, read, or write to the files.
In sum, the catalog may store information about data sets. The information may include information identifying different versions (i.e., different data set items) of the data sets. In association with information identifying a particular version (i.e., a particular data set item) of a data set, there may be information identifying one or more files that contain the data of the particular data set version (i.e., the particular data set item).
The catalog may store information representing a non-linear history of a data set. Specifically, the history of a data set may have different data set branches. Branching may be used to allow one set of changes to a data set to be made independent and concurrently of another set of changes to the data set. The catalog may store branch names in association with data set version identifiers for identifying data set items that belong to a particular data set branch.
The catalog may provide data set provenance at the transaction level of granularity. As an example, suppose a transformation is executed in the data pipeline system 450 multiple times that reads data from data set A, reads data from data set B, transforms the data from data set A and the data from data set B in some way to produce data set C. As mentioned, this transformation may be performed multiple times. Each transformation may be performed in the context of a transaction. For example, the transformation may be performed daily after data sets and B are updated daily in the context of transactions. The result being multiple versions of data set A, multiple versions of data set B, and multiple versions of data set C as a result of multiple executions of the transformation. The catalog may contain sufficient information to trace the provenance of any version of data set C to the versions of data sets A and B from which the version of data set C is derived. In addition, the catalog may contain sufficient information the trace the provenance of those versions of data sets A and B to the earlier versions of data sets A and B from which those versions of data sets A and B were derived.
The provenance tracking ability is the result of recording in the catalog for a transaction that creates a new data set version, the transaction or transactions that the given transaction depends on (e.g., is derived from). The information recorded in the catalog may include an identifier of each dependent transaction and a branch name of the data set that the dependent transaction was committed against.
According to some embodiments, provenance tracking extends beyond transaction level granularity to column level granularity. For example, suppose a data set version A is structured as a table of two columns and a data set version B is structured as a table of five columns. Further assume, column three of data set version B is computed from column one of data set version A. In this case, the catalog may store information reflecting the dependency of column three of data set version B on column one of data set version A.
The catalog may also support the notion of permission transitivity. For example, suppose the catalog records information for two transactions executed against a data set referred to in this example as “Transaction 1” and Transaction 2.” Further suppose a third transaction is performed against the data set which is referred to in this example as “Transaction 3.” Transaction 3 may use data created by Transaction 1 and data created by Transaction 2 to create the data set item of Transaction 3. After Transaction 3 is executed, it may be decided according to organizational policy that a particular user should not be allowed to access the data created by Transaction 2. In this case, as a result of the provenance tracking ability, and in particular because the catalog records the dependency of Transaction 3 on Transaction 2, if permission to access the data of Transaction 2 is revoked from the particular user, permission to access the data of Transaction 3 may be transitively revoked from the particular user.
The transitive effect of permission revocation (or permission grant) can apply to an arbitrary number of levels in the provenance tracking. For example, returning to the above example, permission may be transitively revoked for any transaction that depends directly or indirectly on the Transaction 3.
According to some embodiments, where provenance tracking in the catalog has column level granularity. Then permission transitivity may apply at the more fine-grained column-level. In this case, permission may be revoked (or granted) on a particular column of a data set and based on the column-level provenance tracking in the catalog, permission may be transitively revoked on all direct or indirect descendent columns of that column.
A build service can manage transformations which are executed in the system to transform data. The build service may leverage a directed acyclic graph data (DAG) structure to ensure that transformations are executed in proper dependency order. The graph can include a node representing an output data set to be computed based on one or more input data sets each represented by a node in the graph with a directed edge between node(s) representing the input data set(s) and the node representing the output data set. The build service traverses the DAG in data set dependency order so that the most upstream dependent data sets are computed first. The build service traverses the DAG from the most upstream dependent data sets toward the node representing the output data set rebuilding data sets as necessary so that they are up-to-date. Finally, the target output data set is built once all of the dependent data sets are up-to-date.
The data pipeline system 450 can support branching for both data and code. Build branches allow the same transformation code to be executed on multiple branches. For example, transformation code on the master branch can be executed to produce a data set on the master branch or on another branch (e.g., the develop branch). Build branches also allow transformation code on a branch to be executed to produce data sets on that branch. For example, transformation code on a development branch can be executed to produce a data set that is available only on the development branch. Build branches provide isolation of re-computation of graph data across different users and across different execution schedules of a data pipeline. To support branching, the catalog may store information represents a graph of dependencies as opposed to a linear dependency sequence.
The data pipeline system 450 may enable other data transformation systems to perform transformations. For example, suppose the system stores two “raw” data sets R1 and R2 that are both updated daily (e.g., with daily web log data for two web services). Each update creates a new version of the data set and corresponds to a different transaction. The data sets are deemed raw in the sense that transformation code may not be executed by the data pipeline system 450 to produce the data sets. Further suppose there is a transformation A that computes a join between data sets R1 and R2. The join may be performed in a data transformation system such a SQL database system, for example. More generally, the techniques described herein are agnostic to the particular data transformation engine that is used. The data to be transformed and the transformation code to transform the data can be provided to the engine based on information stored in the catalog including where to store the output data.
According to some embodiments, the build service supports a push build. In a push build, rebuilds of all data sets that depend on an upstream data set or an upstream transformation that has been updated are automatically determined based on information in the catalog and rebuilt. In this case, the build service may accept a target data set or a target transformation as an input parameter to a push build command. The build service than determines all downstream data sets that need to be rebuilt, if any.
As an example, if the build service receives a push build command with data set R1 as the target, then the build service would determine all downstream data sets that are not up-to-date with respect to data set R1 and rebuild them. For example, if data set D1 is out-of-date with respect to data set R1, then data set D1 is rebuilt based on the current versions of data sets R1 and R2 and the current version of transformation A. If data set D1 is rebuilt because it is out-of-date, then data set D2 will be rebuilt based on the up-to-date version of data set D1 and the current version of transformation B and so on until all downstream data set of the target data set are rebuilt. The build service may perform similar rebuilding if the target of the push build command is a transformation.
The build service may also support triggers. In this case, a push build may be considered a special case of a trigger. A trigger, generally, is a rebuild action that is performed by the build service that is triggered by the creation of a new version of a data set or a new version of a transformation in the system.
A schema metadata service can store schema information about files that correspond to transactions reflected in the catalog. An identifier of a given file identified in the catalog may be passed to the schema metadata service and the schema metadata service may return schema information for the file. The schema information may encompass data schema related information such as whether the data in the file is structured as a table, the names of the columns of the table, the data types of the columns, user descriptions of the columns, etc.
The schema information can be accessible via the schema metadata service may versioned separately from the data itself in the catalog. This allows the schemas to be updated separately from data sets and those updates to be tracked separately. For example, suppose a comma separated file is uploaded to the system as particular data set version. The catalog may store in association with the particular data set version identifiers of one or more files in which the CSV data is stored. The catalog may also store in association with each of those one or more file identifiers, schema information describing the format and type of data stored in the corresponding file. The schema information for a file may be retrievable via the scheme metadata service given an identifier of the file as input. Note that this versioning scheme in the catalog allows new schema information for a file to be associated with the file and accessible via the schema metadata service. For example, suppose after storing initial schema information for a file in which the CSV data is stored, updated the schema information is stored that reflects a new or better understanding of the CSV data stored in the file. The updated schema information may be retrieved from the schema metadata service for the file without having to create a new version of the CSV data or the file in which the CSV data is stored.
When a transformation is executed, the build service may encapsulate the complexities of the separate versioning of data sets and schema information. For example, suppose transformation A described above in a previous example that accepts the data set R1 and data set R2 as input is the target of a build command issued to the build service. In response to this build command, the build service may determine from the catalog the file or files in which the data of the current versions of data sets R1 and R2 is stored. The build service may then access the schema metadata service to obtain the current versions of the schema information for the file or files. The build service may then provide all of identifiers or paths to the file or files and the obtained schema information to the data transformation engine to execute the transformation A. The underlying data transformation engine interprets the schema information and applies it to the data in the file or files when executing the transformation A.
General API Module
Various third-parties operate electronic services systems. In some instances, these systems may allow access through Application Programming Interfaces (APIs). Typically, each API requires its own set of information about a data object, such as name, age, and height for a data object representing a person. Advantageously, embodiments of the present disclosure may collect information related to a data object, form API requests in the format and containing the information required by the API of each third-party (“third-party format”), collect responses from the API of each third-party, translate the different results back into a uniform format that facilitates comparison, storage and/or processing (“common format”), and show the results to the user. For example, different third-parties may require different types of information, and in different format; for example, third-party A may require a data object's name and age properties, whereas third-party B may require an a data object's age and height properties but not name.
Advantageously, rather than presenting the user with different third-parties' requests to provide different information repeatedly, the system may retrieve the required information from its database and automatically convert it into the format expected by the third-party. Advantageously, the system may then also convert the individual responses received from each API, which may again be in a third-party-specific format, into a common format that may facilitate comparison by the user. Similarly, various embodiments may use external APIs to access other services.
In some embodiments, an API can be generated by the interactive interpreter system so that various users can access previously written methods of accessing and/or interacting with data. For example, a user may export a series of steps into an API that users within the interactive interpreter system can use as a shortcut to determining values related to a particular data set to increase efficiency and effectiveness of an analysis. A notification may also be created for one or more users based on the API created. In another example, users external to the interactive interpreter system can access and use the API with data that may be stored within the interactive interpreter system or, in some cases, external to the interactive interpreter system.
As described below, the various modules of the database system 502 may comprise computer readable program instructions that may, in some embodiments, be logically divided as shown in
In various embodiments, the various external devices and systems may communicate with the database system 502 via any suitable communications medium or protocol. For example, the various external devices and systems may communicate with the database system 502, and/or with one another, via any combination of local and remote network, the Internet, wired or wirelessly, and/or the like. Further, in various embodiments aspects of any of the modules and/or databases of the database system 502, and/or the various external devices and systems, may be organized differently from what is shown in the example illustration of
User and third-party interaction module 522 provides an interface, such as a GUI to user computing devices, such as user computing device 504. Interaction module 522 may be configured to store data received from user computing device 504 in a user database 552, and to store data received from a third-party A 510a in a third-party database. For example, a user may provide, through user computing device 504, various data to third-parties. Similarly, a third-party may provide various information related to a third party. Interaction module 522 may also receive, from both user computing device 504 and/or third party data.
User and third-party interaction module 522 may also receive an indication from user computing device 504 that a user is willing to interact with one or more third-parties, such as third-party A 510a to third-party N 510n. Similarly, user and third-party interaction module 522 may receive an indication from a third-party that a third-party would be willing to enter into such a transaction with a user.
User and third-party interaction module 522 may be configured to generate user interface data useable for rendering the various interactive user interfaces described herein, so as to enable receipt and providing of data to, for example, users and third-parties. The user interface data may be used by the system, and/or another computer system, device, and/or software program (for example, a browser program), to render the interactive user interfaces. The interactive user interfaces may be displayed on, for example, electronic displays (including, for example, touch-enabled displays) of, for example, user computing device 104.
Advantageously, because user and third-party interaction module 522 and request data aggregation module 524 have access to user database 552 and third-party databases 554 (among other aspects and modules of the database system 502), interaction module 522 and request data aggregation module 524 may have a comprehensive view of an interaction, and various transactions associated with the interaction, as well as information about participants in these interactions. As such, interaction module 522 and/or request data aggregation module 524 may receive and package the relevant information from these databases into a request. Request data aggregation module 524 may, additionally, combine or enhance the data stored within database system 502 with external data through external data aggregation module 542. External data aggregation module 542 may access one or more external data sources 508 to request and receive additional data related to a user, a third-party, an interaction, or other entity associated with an interaction. Examples of external data sources 508 may include public records (e.g., government records of names, addresses, and phone numbers, etc.), credit-related data sources, a similar user-entity's database, and/or the like. The external data aggregation module 542 may communicate with the external data sources 508 via any suitable method, including, for example, via API requests, screen scraping, electronic messages, and/or the like.
The information stored in database system 502 may be combined with the external data from data aggregation module 542 in user and third-party interaction module 522. Advantageously, user and third-party interaction module 522 may utilize information related to a user, a third-party, an interaction, and other information (e.g., any information obtained by the external data aggregation module 542 from the external data sources 508). Request data aggregation module 524 may then package, or aggregate, the various items of information, including information related to a user from user database 552, information related to a third-party from third-party database 554, information related to an interaction from interaction database 556, and external data obtained from external data aggregation module 542.
The aggregated data may then be passed to the request format generation module 526. The request format generation module 526 may format, or convert, the data into one or more formats suitable for transmission to third-parties. For example, third-party A 510a may require information transmitted to it to be in a particular binary format, and only comprise certain pieces of information or fields. Third-party N 510n may, conversely, require that information transmitted to it be in a hypertext format and contain certain different fields. Request format generation module 526 may accommodate these different structures and formats for each third-party by referring to format templates stored by the system and associated with each third-party. API interaction module 528 then receives the information, appropriately formatted for each third-party, from request format generation module 526, and transmits it to the various third-parties through their respective APIs. For example, API interaction module 528 may transmit the request as formatted for third-party A 510a through API A, to third-party A 510a. API interaction module 528 may iterate through all potential third-parties, eventually reaching third-party N 110n and accessing that third-party through API N 112n. In some implementations, the user and/or third-party may specify particular third-parties of interest, and to which the system may transmit the information. In various embodiments, different third-parties may be more appropriate than others for particular requests, and the system may determine using various user generated input particular third-party parties to provide the information to.
API interaction module 528 additionally receives responses from the various third-parties through their respective APIs. API interaction module 528 then forwards the received responses to response format standardization module 530, where the various third-parties structures and formats are converted into a common format (as described further below). Response aggregation module 532 gathers the standardized responses from the various third-parties and stores them in the various databases, including user database 552, third-party database 554, and/or interaction database 556, as appropriate. Additionally, response aggregation module 532 may determine particular responses that are to be passed to the interaction module 522 for display in a user interface. For example, as described below, the system may identify the most useful, or best, or a prioritized list of, responses to display to a user. The system may also, by the response aggregation module 532, determine that, for example, a threshold number of responses have not been received, and/or a quality of the responses does not meet a threshold. In such an instance, the system may determine not to present responses to the user.
As indicated in
Implementing one or more aspects of the database system 502 as a virtual computing environment may advantageously enable executing different aspects or modules of the system on different computing devices or processors, which may increase the scalability of the system. Implementing one or more aspects of the database system 502 as a virtual computing environment may further advantageously enable sandboxing various aspects, data, or modules of the system from one another, which may increase security of the system by preventing, e.g., malicious intrusion into the system from spreading. Implementing one or more aspects of the database system 502 as a virtual computing environment may further advantageously enable parallel execution of various aspects or modules of the system, which may increase the scalability of the system. Implementing one or more aspects of the database system 502 as a virtual computing environment may further advantageously enable rapid provisioning (or de-provisioning) of computing resources to the system, which may increase scalability of the system by, e.g., expanding computing resources available to the system or duplicating operation of the system on multiple computing resources. For example, the system may be used by thousands, hundreds of thousands, or even millions of users simultaneously, and many megabytes, gigabytes, or terabytes (or more) of data may be transferred or processed by the system, and scalability of the system may enable such operation in an efficient and/or uninterrupted manner.
With reference to
Additionally, in some implementations communications with one or more API's may be encrypted and/or authenticated. For example, public and/or private key exchanges may take place to establish authenticated and/or encrypted communications between, e.g., the system and computing systems of third-parties, to, e.g., protect user data from exposure to potentially malicious actors.
Notification Module
In some embodiments, an alert and/or notification can automatically be transmitted to a user device based on interactions with the interactive interpreter system. For example, if a particular user runs code or performs any particular action that would be relevant for another user, an alert and/or notification can be generated. The alert and/or notification can be transmitted at the time that the alert and/or notification is generated or at some determined time after generation of the alert and/or notification. When received by the user device, the alert and/or notification can cause the device to display the alert and/or notification via the activation of an application on the device (e.g., a browser, a mobile application, etc.). For example, receipt of the alert and/or notification may automatically activate an application on the user device, such as a messaging application (e.g., SMS or MMS messaging application), a standalone application (e.g., a data analysis application), or a browser, for example, and display information included in the alert and/or notification. If the user device is offline when the alert and/or notification is transmitted, the application may be automatically activated when the user device is online such that the alert and/or notification is displayed. As another example, receipt of the alert and/or notification may cause a browser to open and be redirected to a login page so that the entity can log and view the alert and/or notification. Alternatively, the alert and/or notification may include a URL of a webpage (or other online information) associated with the alert and/or notification, such that when the device (e.g., a mobile device) receives the alert, a browser (or other application) is automatically activated and the URL included in the alert and/or notification is accessed via the Internet.
Access Control
As described herein, preconfigured user access restrictions and/or access control lists can be used for data sets, user generated instructions, blocks, and/or services according to some embodiments of the present disclosure. In some embodiments, the interactive interpreter system 402 uses access control lists to allow a user to specify which other users and/or teams are permitted to view data sets, user generated instructions, blocks, and/or services. Additionally or alternatively, access control lists may further specify the permissions of particular users to view and/or modify data sets, user generated instructions, blocks, and/or services. In some embodiments, an access control list can be stored in a data store and/or data source of the interactive interpreter system 402 uses. An access control list can include one or more access control items and zero or more classifications. Thus, an access control list of the interactive interpreter system 402 can provide a level of granularity to specify sharing rules and/or permissions on a per-data item, block, or service basis. For example, during the creation and/or editing of a block, a user may specify a group corresponding to the one or more blocks. The users belonging to that group may view the search results and/or edit the data sets, user generated instructions, blocks, and/or services. An access control item can be associated with an a data set, user generated instructions, one or more blocks, and/or a service.
An access control item can include a group and a permission. A group can identify a set of users and/or teams. A permission can identify an operation that a user in the set can perform on the data set, user generated instructions, one or more blocks, and/or a service. Additionally or alternatively, a permission can further identify an operation the user in the set can perform on the access control list. Non-limiting examples of permissions include read, write, owner, create, delete, read only, and/or some combination thereof.
In some embodiments, if the access control list has a classification, then a user must be authorized for the classification. Thus, the classification may override the permission 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.
Additional Implementation Details and Embodiments
Various embodiments of the present disclosure may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or mediums) having computer readable program instructions thereon for causing a processor to carry out aspects of the present disclosure.
For example, the functionality described herein may be performed as software instructions are executed by, and/or in response to software instructions being executed by, one or more hardware processors and/or any other suitable computing devices. The software instructions and/or other executable code may be read from a computer readable storage medium (or mediums).
The computer readable storage medium can be a tangible device that can retain and store data and/or instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device (including any volatile and/or non-volatile electronic storage devices), a magnetic storage device, an optical storage device, an electromagnetic storage device, an element storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a solid state drive, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
Computer readable program instructions (as also referred to herein as, for example, “code,” “instructions,” “module,” “application,” “software application,” and/or the like) for carrying out operations of the present disclosure may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. Computer readable program instructions may be callable from other instructions or from itself, and/or may be invoked in response to detected events or interrupts. Computer readable program instructions configured for execution on computing devices may be provided on a computer readable storage medium, and/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) that may then be stored on a computer readable storage medium. Such computer readable program instructions may be stored, partially or fully, on a memory device (e.g., a computer readable storage medium) of the executing computing device, for execution by the computing device. The computer readable program instructions may execute entirely on a user's computer (e.g., the executing computing device), partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present disclosure.
Aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart(s) and/or block diagram(s) block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks. 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 and/or modules into its dynamic memory and send the instructions over a telephone, cable, or optical line using a modem. A modem local to a server computing system may receive the data on the telephone/cable/optical line and use a converter device including the appropriate circuitry to place the data on a bus. The bus may carry the data to a memory, from which a processor may retrieve and execute the instructions. The instructions received by the memory may optionally be stored on a storage device (e.g., a solid state drive) either before or after execution by the computer processor.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. In addition, certain 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.
It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions. For example, any of the processes, methods, algorithms, elements, blocks, applications, or other functionality (or portions of functionality) described in the preceding sections may be embodied in, and/or fully or partially automated via, electronic hardware such application-specific processors (e.g., application-specific integrated circuits (ASICs)), programmable processors (e.g., field programmable gate arrays (FPGAs)), application-specific circuitry, and/or the like (any of which may also combine custom hard-wired logic, logic circuits, ASICs, FPGAs, etc. with custom programming/execution of software instructions to accomplish the techniques).
Any of the above-mentioned processors, and/or devices incorporating any of the above-mentioned processors, may be referred to herein as, for example, “computers,” “computer devices,” “computing devices,” “hardware computing devices,” “hardware processors,” “processing units,” and/or the like. Computing devices of the above-embodiments may generally (but not necessarily) be controlled and/or coordinated by operating system software, such as Mac OS, iOS, Android, Chrome OS, Windows OS (e.g., Windows XP, Windows Vista, Windows 7, Windows 8, Windows 10, Windows Server, etc.), Windows CE, Unix, Linux, SunOS, Solaris, Blackberry OS, VxWorks, or other suitable 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.
For example,
Computer system 600 also includes a main memory 606, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 602 for storing information and instructions to be executed by processor 604. Main memory 606 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 604. Such instructions, when stored in storage media accessible to processor 604, render computer system 600 into a special-purpose machine that is customized to perform the operations specified in the instructions.
Computer system 600 further includes a read only memory (ROM) 608 or other static storage device coupled to bus 602 for storing static information and instructions for processor 604. A storage device 610, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 602 for storing information and instructions.
Computer system 600 may be coupled via bus 602 to a display 612, such as a cathode ray tube (CRT) or LCD display (or touch screen), for displaying information to a computer user. An input device 614, including alphanumeric and other keys, is coupled to bus 602 for communicating information and command selections to processor 604. Another type of user input device is cursor control 616, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 604 and for controlling cursor movement on display 612. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.
Computing system 600 may include a user interface module to implement a GUI that may be stored in a mass storage device as computer executable program instructions that are executed by the computing device(s). Computer system 600 may further, as described below, implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 600 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 600 in response to processor(s) 604 executing one or more sequences of one or more computer readable program instructions contained in main memory 606. Such instructions may be read into main memory 606 from another storage medium, such as storage device 610. Execution of the sequences of instructions contained in main memory 606 causes processor(s) 604 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.
Various forms of computer readable storage media may be involved in carrying one or more sequences of one or more computer readable program instructions to processor 604 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 600 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 602. Bus 602 carries the data to main memory 606, from which processor 604 retrieves and executes the instructions. The instructions received by main memory 606 may optionally be stored on storage device 610 either before or after execution by processor 604.
Computer system 600 also includes a communication interface 618 coupled to bus 602. Communication interface 618 provides a two-way data communication coupling to a network link 620 that is connected to a local network 622. For example, communication interface 618 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 618 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 618 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 620 typically provides data communication through one or more networks to other data devices. For example, network link 620 may provide a connection through local network 622 to a host computer 624 or to data equipment operated by an Internet Service Provider (ISP) 626. ISP 626 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 628. Local network 622 and Internet 628 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 620 and through communication interface 618, which carry the digital data to and from computer system 600, are example forms of transmission media.
Computer system 600 can send messages and receive data, including program code, through the network(s), network link 620 and communication interface 618. In the Internet example, a server 630 might transmit a requested code for an application program through Internet 628, ISP 626, local network 622 and communication interface 618.
The received code may be executed by processor 604 as it is received, and/or stored in storage device 610, or other non-volatile storage for later execution.
As described above, in various embodiments certain functionality may be accessible by a user through a web-based viewer (such as a web browser), or other suitable software program). In such implementations, the user interface may be generated by a server computing system and transmitted to a web browser of the user (e.g., running on the user's computing system). Alternatively, data (e.g., user interface data) necessary for generating the user interface may be provided by the server computing system to the browser, where the user interface may be generated (e.g., the user interface data may be executed by a browser accessing a web service and may be configured to render the user interfaces based on the user interface data). The user may then interact with the user interface through the web-browser. User interfaces of certain implementations may be accessible through one or more dedicated software applications. In certain embodiments, one or more of the computing devices and/or systems of the disclosure may include mobile computing devices, and user interfaces may be accessible through such mobile computing devices (for example, smartphones and/or tablets).
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. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the systems and methods can be practiced in many ways. As is also stated above, the use of particular terminology when describing certain features or aspects of the systems and methods 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 systems and methods with which that terminology is associated.
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 “real time” or “near time” (either of which can be used in conjunction with “substantially”) forms a phrase that will be readily understood by a person of ordinary skill in the art. For example, it is readily understood that such language will include speeds in which no or little delay or waiting is discernible, or where such delay is sufficiently short so as not to be disruptive, irritating, or otherwise vexing to a user.
Conjunctive language such as the phrase “at least one of X, Y, and Z,” or “at least one of X, Y, or Z,” unless specifically stated otherwise, is to be understood with the context as used in general to convey that an item, term, etc. may be either X, Y, or Z, or a combination thereof. For example, the term “or” is used in its inclusive sense (and not in its exclusive sense) so that when used, for example, to connect a list of elements, the term “or” means one, some, or all of the elements in the list. Thus, such conjunctive language is not generally intended to imply that certain embodiments require at least one of X, at least one of Y, and at least one of Z to each be present.
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.
While the above detailed description has shown, described, and pointed out novel features as applied to various embodiments, it may be understood that various omissions, substitutions, and changes in the form and details of the devices or processes illustrated may be made without departing from the spirit of the disclosure. As may be recognized, certain embodiments of the inventions described herein may be embodied within a form that does not provide all of the features and benefits set forth herein, as some features may be used or practiced separately from others. The scope of certain inventions disclosed herein is indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5109399 | Thompson | Apr 1992 | A |
| 5329108 | Lamoure | Jul 1994 | A |
| 5414809 | Hogan et al. | May 1995 | A |
| 5418950 | Li et al. | May 1995 | A |
| 5428737 | Li et al. | Jun 1995 | A |
| 5428776 | Rothfield | Jun 1995 | A |
| 5515488 | Hoppe et al. | May 1996 | A |
| 5542089 | Lindsay et al. | Jul 1996 | A |
| 5608899 | Li et al. | Mar 1997 | A |
| 5613105 | Xbikowski et al. | Mar 1997 | A |
| 5632009 | Rao et al. | May 1997 | A |
| 5670987 | Doi et al. | Sep 1997 | A |
| 5701456 | Jacopi et al. | Dec 1997 | A |
| 5724033 | Burrows | Mar 1998 | A |
| 5724575 | Hoover et al. | Mar 1998 | A |
| 5745894 | Burrows et al. | Apr 1998 | A |
| 5781704 | Rossmo | Jul 1998 | A |
| 5794228 | French et al. | Aug 1998 | A |
| 5794229 | French et al. | Aug 1998 | A |
| 5798769 | Chiu et al. | Aug 1998 | A |
| 5845300 | Comer | Dec 1998 | A |
| 5857329 | Bingham | Jan 1999 | A |
| 5870559 | Leshem et al. | Feb 1999 | A |
| 5911138 | Li et al. | Jun 1999 | A |
| 5918225 | White et al. | Jun 1999 | A |
| 6057757 | Arrowsmith et al. | May 2000 | A |
| 6088032 | Mackinlay | Jul 2000 | A |
| 6091956 | Hollenberg | Jul 2000 | A |
| 6144962 | Weinberg et al. | Nov 2000 | A |
| 6161098 | Wallman | Dec 2000 | A |
| 6208985 | Krehel | Mar 2001 | B1 |
| 6219053 | Tachibana et al. | Apr 2001 | B1 |
| 6232971 | Haynes | May 2001 | B1 |
| 6236994 | Swartz et al. | May 2001 | B1 |
| 6247019 | Davies | Jun 2001 | B1 |
| 6279018 | Kudrolli et al. | Aug 2001 | B1 |
| 6289334 | Reiner et al. | Sep 2001 | B1 |
| 6311181 | Lee et al. | Oct 2001 | B1 |
| 6321274 | Shakib et al. | Nov 2001 | B1 |
| 6341310 | Leshem et al. | Jan 2002 | B1 |
| 6366933 | Ball et al. | Apr 2002 | B1 |
| 6369835 | Lin | Apr 2002 | B1 |
| 6430305 | Decker | Aug 2002 | B1 |
| 6456997 | Shukla | Sep 2002 | B1 |
| 6549944 | Weinberg et al. | Apr 2003 | B1 |
| 6560620 | Ching | May 2003 | B1 |
| 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 |
| 6643613 | McGee et al. | Nov 2003 | B2 |
| 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 |
| 6851108 | Syme et al. | Feb 2005 | B1 |
| 6857120 | Arnold et al. | Feb 2005 | B1 |
| 6877137 | Rivette et al. | Apr 2005 | B1 |
| 6900807 | Liongosari et al. | May 2005 | B1 |
| 6976024 | Chavez et al. | Dec 2005 | B1 |
| 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 |
| 7020847 | Holzheuer | Mar 2006 | B1 |
| 7028223 | Kolawa et al. | Apr 2006 | B1 |
| 7036085 | Barros | Apr 2006 | B2 |
| 7043702 | Chi et al. | May 2006 | B2 |
| 7055110 | Kupka et al. | May 2006 | B2 |
| 7085890 | Kashyap | Aug 2006 | B2 |
| 7139800 | Bellotti et al. | Nov 2006 | B2 |
| 7155728 | Prabhu et al. | Dec 2006 | B1 |
| 7158878 | Rasmussen et al. | Jan 2007 | B2 |
| 7162475 | Ackerman | Jan 2007 | B2 |
| 7168039 | Bertram | Jan 2007 | B2 |
| 7171427 | Witkowski | Jan 2007 | B2 |
| 7216133 | Wu et al. | May 2007 | B2 |
| 7269786 | Malloy et al. | Sep 2007 | B1 |
| 7278105 | Kitts | Oct 2007 | B1 |
| 7290698 | Poslinski et al. | Nov 2007 | B2 |
| 7333998 | Heckerman et al. | Feb 2008 | B2 |
| 7370047 | Gorman | May 2008 | B2 |
| 7379811 | Rasmussen et al. | May 2008 | B2 |
| 7379903 | Caballero et al. | May 2008 | B2 |
| 7406592 | Polyudov | Jul 2008 | B1 |
| 7426654 | Adams et al. | Sep 2008 | B2 |
| 7454466 | Bellotti et al. | Nov 2008 | B2 |
| 7461077 | Greenwood | Dec 2008 | B1 |
| 7467375 | Tondreau et al. | Dec 2008 | B2 |
| 7487139 | Fraleigh et al. | Feb 2009 | B2 |
| 7502786 | Liu et al. | Mar 2009 | B2 |
| 7519589 | Charnock et al. | Apr 2009 | B2 |
| 7525422 | Bishop et al. | Apr 2009 | B2 |
| 7529727 | Arning et al. | May 2009 | B2 |
| 7529734 | Dirisala | May 2009 | B2 |
| 7546353 | Hesselink et al. | Jun 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 |
| 7610290 | Kruy et al. | Oct 2009 | B2 |
| 7614006 | Molander | Nov 2009 | B2 |
| 7617185 | Werner et al. | Nov 2009 | B2 |
| 7617232 | Gabbert et al. | Nov 2009 | B2 |
| 7620628 | Kapur et al. | Nov 2009 | B2 |
| 7624122 | Gaurav et al. | Nov 2009 | B2 |
| 7627489 | Schaeffer et al. | Dec 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 |
| 7730082 | Sah et al. | Jun 2010 | B2 |
| 7730109 | Rohrs et al. | Jun 2010 | B2 |
| 7756843 | Palmer | Jul 2010 | B1 |
| 7770100 | Chamberlain et al. | Aug 2010 | B2 |
| 7783679 | Bley | Aug 2010 | B2 |
| 7805457 | Viola et al. | Sep 2010 | B1 |
| 7809703 | Balabhadrapatruni et al. | Oct 2010 | B2 |
| 7818291 | Ferguson et al. | Oct 2010 | B2 |
| 7818658 | Chen | Oct 2010 | B2 |
| 7853573 | Warner et al. | Dec 2010 | B2 |
| 7870493 | Pall et al. | Jan 2011 | B2 |
| 7877421 | Berger 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 |
| 7908521 | Sridharan et al. | Mar 2011 | B2 |
| 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 |
| 7979424 | Dettinger et al. | Jul 2011 | B2 |
| 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 |
| 8019749 | Leban | Sep 2011 | B2 |
| 8024778 | Cash et al. | Sep 2011 | B2 |
| 8036632 | Cana et al. | Oct 2011 | B1 |
| 8036971 | Aymeloglu et al. | Oct 2011 | B2 |
| 8037046 | Udezue et al. | Oct 2011 | B2 |
| 8042110 | Kawahara et al. | Oct 2011 | B1 |
| 8046283 | Burns | Oct 2011 | B2 |
| 8054756 | Chand et al. | Nov 2011 | B2 |
| 8073857 | Sreekanth | Dec 2011 | B2 |
| 8103543 | Zwicky | Jan 2012 | B1 |
| 8103962 | Embley et al. | Jan 2012 | B2 |
| 8134457 | Velipasalar et al. | Mar 2012 | B2 |
| 8145703 | Frishert et al. | Mar 2012 | B2 |
| 8185819 | Sah et al. | May 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 |
| 8249885 | Berkowitz et al. | Aug 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 |
| 8352881 | Champion et al. | Jan 2013 | B2 |
| 8368695 | Howell et al. | Feb 2013 | B2 |
| 8386377 | Xiong et al. | Feb 2013 | B1 |
| 8397171 | Klassen et al. | Mar 2013 | B2 |
| 8412707 | Mianji | Apr 2013 | B1 |
| 8417715 | Bruckhaus et al. | Apr 2013 | B1 |
| 8429194 | Aymeloglu et al. | Apr 2013 | B2 |
| 8433702 | Carrino et al. | Apr 2013 | B1 |
| 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 |
| 8489331 | Kopf et al. | Jul 2013 | B2 |
| 8489641 | Seefeld et al. | Jul 2013 | B1 |
| 8498984 | Hwang et al. | Jul 2013 | B1 |
| 8499287 | Shafi et al. | Jul 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 | Ouarterman | Oct 2013 | B1 |
| 8560494 | Downing | Oct 2013 | B1 |
| 8577911 | Stepinski et al. | Nov 2013 | B1 |
| 8589273 | Creeden et al. | Nov 2013 | B2 |
| 8595234 | Siripurapu et al. | Nov 2013 | B2 |
| 8620641 | Farnsworth et al. | Dec 2013 | B2 |
| 8639552 | Chen et al. | Jan 2014 | B1 |
| 8646080 | Williamson et al. | Feb 2014 | B2 |
| 8639757 | Adams et al. | Mar 2014 | B1 |
| 8676857 | Adams et al. | Mar 2014 | B1 |
| 8688573 | Rukonic et al. | Apr 2014 | B1 |
| 8689108 | Duffield et al. | Apr 2014 | B1 |
| 8713467 | Goldenberg et al. | Apr 2014 | B1 |
| 8726379 | Stiansen et al. | May 2014 | B1 |
| 8739278 | Varghese | May 2014 | B2 |
| 8799799 | Cervelli et al. | May 2014 | B1 |
| 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 |
| 8787939 | Papakipos et al. | Jul 2014 | B2 |
| 8788407 | Singh et al. | Jul 2014 | B1 |
| 8799867 | Peri-Glass et al. | Aug 2014 | B1 |
| 8806355 | Twiss et al. | Aug 2014 | B2 |
| 8812960 | Sun 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 |
| 8909597 | Aymeloglu et al. | Dec 2014 | B2 |
| 8917274 | Ma et al. | Dec 2014 | B2 |
| 8924388 | Elliot et al. | Dec 2014 | B2 |
| 8924389 | Elliot et al. | Dec 2014 | B2 |
| 8924429 | Fisher et al. | Dec 2014 | B1 |
| 8924872 | Bogomolov et al. | Dec 2014 | B1 |
| 8935201 | Fisher et al. | Jan 2015 | B1 |
| 8937619 | Sharma et al. | Jan 2015 | B2 |
| 8938686 | Erenrich et al. | Jan 2015 | B1 |
| 8949164 | Mohler | Feb 2015 | B1 |
| 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 |
| 9031981 | Potter et al. | May 2015 | B1 |
| 9043696 | Meiklejohn et al. | May 2015 | B1 |
| 9043894 | Dennison et al. | May 2015 | B1 |
| 9069842 | Melby | Jun 2015 | B2 |
| 9100428 | Visbal | Aug 2015 | B1 |
| 9105000 | White et al. | Aug 2015 | B1 |
| 9111281 | Stibel et al. | Aug 2015 | B2 |
| 9116975 | Shankar et al. | Aug 2015 | B2 |
| 9129219 | Robertson et al. | Sep 2015 | B1 |
| 9256664 | Chakerian et al. | Feb 2016 | B2 |
| 9280618 | Bruce et al. | Mar 2016 | B1 |
| 9286373 | Elliot et al. | Mar 2016 | B2 |
| 9292388 | Fisher et al. | Mar 2016 | B2 |
| 9330120 | Colgrove et al. | May 2016 | B2 |
| 9335911 | Elliot et al. | May 2016 | B1 |
| 9348677 | Marinelli, III et al. | May 2016 | B2 |
| 9378526 | Sampson | Jun 2016 | B2 |
| 9483745 | Ackermann et al. | Nov 2016 | B2 |
| 9870389 | Elliot et al. | Jan 2018 | B2 |
| 10157200 | Elliot et al. | Dec 2018 | B2 |
| 10678783 | Elliot et al. | Jun 2020 | B2 |
| 20020033848 | Sciammarella et al. | Mar 2002 | A1 |
| 20020065708 | Senay et al. | May 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 |
| 20020147805 | Leshem et al. | Oct 2002 | A1 |
| 20020174201 | Ramer et al. | Nov 2002 | A1 |
| 20020184111 | Swanson | Dec 2002 | A1 |
| 20020194119 | Wright et al. | Dec 2002 | A1 |
| 20030004770 | Miller et al. | Jan 2003 | A1 |
| 20030023620 | Trotta | Jan 2003 | A1 |
| 20030028560 | Kudrolli et al. | Feb 2003 | A1 |
| 20030036848 | Sheha et al. | Feb 2003 | A1 |
| 20030039948 | Donahue | Feb 2003 | A1 |
| 20030097364 | Bata | May 2003 | A1 |
| 20030105833 | Daniels | Jun 2003 | A1 |
| 20030126102 | Borthwick | Jul 2003 | A1 |
| 20030140106 | Raguseo | Jul 2003 | A1 |
| 20030144868 | MacIntyre et al. | Jul 2003 | A1 |
| 20030163352 | Surpin et al. | Aug 2003 | A1 |
| 20030200217 | Ackerman | Oct 2003 | A1 |
| 20030212670 | Yalamanchi et al. | 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 |
| 20040088177 | Travis et al. | May 2004 | A1 |
| 20040095349 | Bito et al. | May 2004 | A1 |
| 20040098731 | Demsey et al. | May 2004 | A1 |
| 20040103088 | Cragun et al. | May 2004 | A1 |
| 20040111410 | Burgoon et al. | Jun 2004 | A1 |
| 20040111480 | Yue | Jun 2004 | A1 |
| 20040126840 | Cheng et al. | Jul 2004 | A1 |
| 20040139212 | Mukherjee et al. | Jul 2004 | A1 |
| 20040143602 | Ruiz et al. | Jul 2004 | A1 |
| 20040143796 | Lerner et al. | Jul 2004 | A1 |
| 20040153418 | Hanweck | Aug 2004 | A1 |
| 20040153837 | Preston et al. | Aug 2004 | A1 |
| 20040163039 | McPherson et al. | Aug 2004 | A1 |
| 20040193600 | Kaasten et al. | Sep 2004 | A1 |
| 20040193608 | Gollapudi et al. | Sep 2004 | A1 |
| 20040221223 | Yu et al. | Nov 2004 | A1 |
| 20040236688 | Bozeman | Nov 2004 | A1 |
| 20040254658 | Sherriff et al. | Dec 2004 | A1 |
| 20040260702 | Cragun et al. | Dec 2004 | A1 |
| 20040267746 | Marcjan et al. | Dec 2004 | A1 |
| 20050004911 | Goldberg et al. | Jan 2005 | A1 |
| 20050010472 | Quatse et al. | Jan 2005 | A1 |
| 20050021397 | Cui 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 |
| 20050080769 | Gemmell | Apr 2005 | A1 |
| 20050080770 | Lueder et al. | Apr 2005 | A1 |
| 20050086207 | Heuer et al. | Apr 2005 | A1 |
| 20050120080 | Weinreb et al. | Jun 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 |
| 20050226473 | Ramesh | Oct 2005 | A1 |
| 20050246327 | Yeung et al. | Nov 2005 | A1 |
| 20050251786 | Citron et al. | Nov 2005 | A1 |
| 20050278286 | Djugash et al. | Dec 2005 | A1 |
| 20060004740 | Dettinger et al. | Jan 2006 | A1 |
| 20060026120 | Carolan et al. | Feb 2006 | A1 |
| 20060026170 | Kreitler et al. | Feb 2006 | A1 |
| 20060059139 | Robinson | Mar 2006 | A1 |
| 20060070046 | Balakrishnan et al. | Mar 2006 | A1 |
| 20060074881 | Vembu et al. | Apr 2006 | A1 |
| 20060074967 | Shaburov | Apr 2006 | A1 |
| 20060080283 | Shipman | Apr 2006 | A1 |
| 20060080616 | Vogel et al. | Apr 2006 | A1 |
| 20060080619 | Carlson et al. | Apr 2006 | A1 |
| 20060093222 | Saffer et al. | May 2006 | A1 |
| 20060116991 | Calderwood | Jun 2006 | A1 |
| 20060129746 | Porter | Jun 2006 | A1 |
| 20060129992 | Oberholtzer 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 |
| 20060203337 | White | Sep 2006 | A1 |
| 20060209085 | Wong 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 |
| 20060271277 | Hu et al. | Nov 2006 | A1 |
| 20060271838 | Carro | Nov 2006 | A1 |
| 20060271884 | Hurst | Nov 2006 | A1 |
| 20060279630 | Aggarwal et al. | Dec 2006 | A1 |
| 20060288046 | Gupta et al. | Dec 2006 | A1 |
| 20070000999 | Kubo et al. | Jan 2007 | A1 |
| 20070005582 | Navratil et al. | Jan 2007 | A1 |
| 20070011150 | Frank | Jan 2007 | A1 |
| 20070011304 | Error | Jan 2007 | A1 |
| 20070016363 | Huang et al. | Jan 2007 | A1 |
| 20070027851 | Kruy et al. | Feb 2007 | A1 |
| 20070038646 | Thota | Feb 2007 | A1 |
| 20070038962 | Fuchs et al. | Feb 2007 | A1 |
| 20070057966 | Ohno et al. | Mar 2007 | A1 |
| 20070078832 | Ott et al. | Apr 2007 | A1 |
| 20070083541 | Fraleigh et al. | Apr 2007 | A1 |
| 20070088596 | Berkelhamer et al. | Apr 2007 | A1 |
| 20070094248 | McVeigh et al. | Apr 2007 | A1 |
| 20070094389 | Nussey et al. | Apr 2007 | A1 |
| 20070112737 | Carlson et al. | May 2007 | A1 |
| 20070113164 | Hansen et al. | May 2007 | A1 |
| 20070150369 | Zivin | Jun 2007 | A1 |
| 20070150801 | Chidlovskii et al. | Jun 2007 | A1 |
| 20070150805 | Misovski | Jun 2007 | A1 |
| 20070156673 | Maga | Jul 2007 | A1 |
| 20070162454 | D'Albora et al. | Jul 2007 | A1 |
| 20070168336 | Ransil et al. | Jul 2007 | A1 |
| 20070174760 | Chamberlain et al. | Jul 2007 | A1 |
| 20070178501 | Rabinowitz et al. | Aug 2007 | A1 |
| 20070185867 | Maga | Aug 2007 | A1 |
| 20070192122 | Routson et al. | Aug 2007 | A1 |
| 20070192265 | Chopin et al. | Aug 2007 | A1 |
| 20070192281 | Cradick 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 |
| 20070240062 | Christena et al. | Oct 2007 | A1 |
| 20070260582 | Liang | Nov 2007 | A1 |
| 20070266336 | Nojima et al. | Nov 2007 | A1 |
| 20070284433 | Domenica et al. | Dec 2007 | A1 |
| 20070294643 | Kyle | Dec 2007 | 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 |
| 20080065655 | Chakravarthy et al. | Mar 2008 | A1 |
| 20080065665 | Pomroy et al. | Mar 2008 | A1 |
| 20080069081 | Chand et al. | Mar 2008 | A1 |
| 20080077597 | Butler | Mar 2008 | A1 |
| 20080077642 | Carbone et al. | Mar 2008 | A1 |
| 20080082486 | Lermant et al. | Apr 2008 | A1 |
| 20080103996 | Forman et al. | May 2008 | A1 |
| 20080104019 | Nath | May 2008 | A1 |
| 20080126344 | Hoffman et al. | May 2008 | A1 |
| 20080126951 | Sood et al. | May 2008 | A1 |
| 20080148398 | Mezack et al. | Jun 2008 | A1 |
| 20080155440 | Trevor et al. | Jun 2008 | A1 |
| 20080162616 | Gross et al. | Jul 2008 | A1 |
| 20080195417 | Surpin et al. | Aug 2008 | A1 |
| 20080195608 | Clover | Aug 2008 | A1 |
| 20080196016 | Todd | Aug 2008 | A1 |
| 20080201313 | Dettinger et al. | Aug 2008 | A1 |
| 20080208735 | Balet et al. | Aug 2008 | A1 |
| 20080215543 | Huang et al. | Sep 2008 | A1 |
| 20080222295 | Robinson et al. | Sep 2008 | A1 |
| 20080243711 | Aymeloglu et al. | Oct 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 |
| 20080267386 | Cooper | Oct 2008 | A1 |
| 20080270328 | Lafferty et al. | Oct 2008 | A1 |
| 20080276167 | Michael | Nov 2008 | A1 |
| 20080278311 | Grange et al. | Nov 2008 | A1 |
| 20080288306 | MacIntyre et al. | Nov 2008 | A1 |
| 20080288475 | Kim et al. | Nov 2008 | A1 |
| 20080294663 | Heinley et al. | Nov 2008 | A1 |
| 20080301559 | Martinsen et al. | Dec 2008 | A1 |
| 20080301643 | Appleton et al. | Dec 2008 | A1 |
| 20080313132 | Hao et al. | Dec 2008 | A1 |
| 20080313281 | Scheidl et al. | Dec 2008 | A1 |
| 20090002492 | Velipasalar et al. | Jan 2009 | A1 |
| 20090006150 | Prigge et al. | Jan 2009 | A1 |
| 20090007056 | Prigge et al. | Jan 2009 | A1 |
| 20090027418 | Maru et al. | Jan 2009 | A1 |
| 20090030915 | Winter et al. | Jan 2009 | A1 |
| 20090037912 | Stoitsev et al. | Feb 2009 | A1 |
| 20090043762 | Shiverick et al. | Feb 2009 | A1 |
| 20090055251 | Shah et al. | Feb 2009 | A1 |
| 20090055487 | Moraes et al. | Feb 2009 | A1 |
| 20090076845 | Bellin et al. | Mar 2009 | A1 |
| 20090083275 | Jacob et al. | Mar 2009 | A1 |
| 20090088964 | Schaaf et al. | Apr 2009 | A1 |
| 20090094166 | Aymeloglu et al. | Apr 2009 | A1 |
| 20090094217 | Dettinger et al. | Apr 2009 | A1 |
| 20090094270 | Alirez et al. | Apr 2009 | A1 |
| 20090106178 | Chu | Apr 2009 | A1 |
| 20090112745 | Stefanescu | Apr 2009 | A1 |
| 20090119309 | Gibson et al. | May 2009 | A1 |
| 20090125359 | Knapic | May 2009 | A1 |
| 20090125369 | Kloostra 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 |
| 20090144747 | Baker | Jun 2009 | A1 |
| 20090157732 | Hao et al. | Jun 2009 | A1 |
| 20090161147 | Klave | Jun 2009 | A1 |
| 20090164934 | Bhattiprolu et al. | Jun 2009 | A1 |
| 20090171939 | Athsani et al. | Jul 2009 | A1 |
| 20090172511 | Decherd et al. | Jul 2009 | A1 |
| 20090172674 | 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 |
| 20090187556 | Ross et al. | Jul 2009 | A1 |
| 20090193012 | Williams | Jul 2009 | A1 |
| 20090199047 | Vaitheeswaran et al. | Aug 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 |
| 20090248721 | Burton et al. | Oct 2009 | A1 |
| 20090249244 | Robinson et al. | Oct 2009 | A1 |
| 20090254572 | Redlich et al. | Oct 2009 | A1 |
| 20090254842 | Leacock et al. | Oct 2009 | A1 |
| 20090254970 | Agarwal et al. | Oct 2009 | A1 |
| 20090259636 | Labrou et al. | Oct 2009 | A1 |
| 20090271343 | Vaiciulis et al. | Oct 2009 | A1 |
| 20090281839 | Lynn et al. | Nov 2009 | A1 |
| 20090282068 | Shockro et al. | Nov 2009 | A1 |
| 20090287470 | Farnsworth et al. | Nov 2009 | A1 |
| 20090292626 | Oxford | Nov 2009 | A1 |
| 20090299830 | West et al. | Dec 2009 | A1 |
| 20090307049 | Elliott et al. | Dec 2009 | A1 |
| 20090313463 | Pang et al. | Dec 2009 | A1 |
| 20090319418 | Herz | Dec 2009 | A1 |
| 20090319515 | Minton et al. | Dec 2009 | A1 |
| 20090319891 | MacKinlay | Dec 2009 | A1 |
| 20100004857 | Pereira et al. | Jan 2010 | A1 |
| 20100011282 | Dollard et al. | Jan 2010 | A1 |
| 20100030722 | Goodson et al. | Feb 2010 | A1 |
| 20100031141 | Summers et al. | Feb 2010 | A1 |
| 20100037212 | Meijer 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 |
| 20100070448 | Omoigui | Mar 2010 | A1 |
| 20100070464 | 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 |
| 20100073315 | Lee et al. | Mar 2010 | A1 |
| 20100076979 | Wang et al. | Mar 2010 | A1 |
| 20100082671 | Li et al. | Apr 2010 | A1 |
| 20100098318 | Anderson | Apr 2010 | A1 |
| 20100100963 | Mahaffey | Apr 2010 | A1 |
| 20100103124 | Kruzeniski et al. | Apr 2010 | A1 |
| 20100106752 | Eckardt et al. | Apr 2010 | A1 |
| 20100114887 | Conway et al. | May 2010 | A1 |
| 20100114916 | Cooke | May 2010 | A1 |
| 20100122152 | Chamberlain et al. | May 2010 | A1 |
| 20100131457 | Heimendinger | May 2010 | A1 |
| 20100131502 | Fordham | May 2010 | A1 |
| 20100145902 | Boyan et al. | Jun 2010 | A1 |
| 20100161646 | Ceballos et al. | Jun 2010 | A1 |
| 20100161735 | Sharma | Jun 2010 | A1 |
| 20100162176 | Dunton | Jun 2010 | A1 |
| 20100169376 | Chu | Jul 2010 | A1 |
| 20100169405 | Zhang | Jul 2010 | A1 |
| 20100191563 | Schlaifer et al. | Jul 2010 | A1 |
| 20100198684 | Eraker et al. | Aug 2010 | A1 |
| 20100199167 | Uematsu et al. | Aug 2010 | A1 |
| 20100199225 | Coleman et al. | Aug 2010 | A1 |
| 20100211535 | Rosenberger | Aug 2010 | A1 |
| 20100228812 | Uomini | 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 |
| 20100293174 | Bennett et al. | Nov 2010 | A1 |
| 20100306713 | Geisner et al. | Dec 2010 | A1 |
| 20100312837 | Bodapati et al. | Dec 2010 | A1 |
| 20100313119 | Baldwin 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 |
| 20110029526 | Knight et al. | Feb 2011 | A1 |
| 20110035396 | Merz et al. | Feb 2011 | A1 |
| 20110040776 | Najm et al. | Feb 2011 | A1 |
| 20110041084 | Karam | Feb 2011 | A1 |
| 20110047159 | Baid et al. | Feb 2011 | A1 |
| 20110055250 | Nandy | Mar 2011 | A1 |
| 20110060753 | Shaked et al. | Mar 2011 | A1 |
| 20110061013 | Bilicki et al. | Mar 2011 | A1 |
| 20110066497 | Gopinath 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 |
| 20110093327 | Fordyce, III et al. | Apr 2011 | A1 |
| 20110093490 | Schindlauer 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 |
| 20110131547 | Elaasar | Jun 2011 | A1 |
| 20110137766 | Rasmussen et al. | Jun 2011 | A1 |
| 20110145401 | Westlake | Jun 2011 | A1 |
| 20110153384 | Home et al. | Jun 2011 | A1 |
| 20110161096 | Buehler et al. | Jun 2011 | A1 |
| 20110167105 | Ramakrishnan 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 |
| 20110185316 | Reid et al. | Jul 2011 | A1 |
| 20110208565 | Ross et al. | Aug 2011 | A1 |
| 20110208724 | Jones et al. | Aug 2011 | A1 |
| 20110208822 | Rathod | Aug 2011 | A1 |
| 20110213655 | Henkin | Sep 2011 | A1 |
| 20110218934 | Elser | Sep 2011 | A1 |
| 20110218955 | Tang | Sep 2011 | A1 |
| 20110219450 | McDougal et al. | Sep 2011 | A1 |
| 20110225198 | Edwards et al. | Sep 2011 | A1 |
| 20110238495 | Kang | Sep 2011 | A1 |
| 20110238553 | Raj et al. | Sep 2011 | A1 |
| 20110251951 | Kolkowitz | Oct 2011 | A1 |
| 20110252282 | Meek et al. | Oct 2011 | A1 |
| 20110258158 | Resende et al. | Oct 2011 | A1 |
| 20110258216 | Supakkul et al. | Oct 2011 | A1 |
| 20110270604 | Qi et al. | Nov 2011 | A1 |
| 20110270705 | Parker | Nov 2011 | A1 |
| 20110270834 | Sokolan et al. | Nov 2011 | A1 |
| 20110270871 | He 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 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 |
| 20110321008 | Jhoney et al. | Dec 2011 | A1 |
| 20120004904 | Shin 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 |
| 20120078595 | Balandin 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 |
| 20120084287 | Lakshminarayan et al. | Apr 2012 | A1 |
| 20120089606 | Eshwar et al. | Apr 2012 | A1 |
| 20120102022 | Miranker et al. | Apr 2012 | A1 |
| 20120106801 | Jackson | May 2012 | A1 |
| 20120117082 | Koperda et al. | May 2012 | A1 |
| 20120131512 | Takeuchi et al. | May 2012 | A1 |
| 20120137235 | TS et al. | May 2012 | A1 |
| 20120144335 | Abeln et al. | Jun 2012 | A1 |
| 20120158527 | Cannelongo et al. | Jun 2012 | A1 |
| 20120159307 | Chung et al. | Jun 2012 | A1 |
| 20120159362 | Brown et al. | Jun 2012 | A1 |
| 20120159399 | Bastide et al. | Jun 2012 | A1 |
| 20120159449 | Arnold et al. | Jun 2012 | A1 |
| 20120170847 | Tsukidate | Jul 2012 | A1 |
| 20120173381 | Smith | Jul 2012 | A1 |
| 20120173985 | Peppel | Jul 2012 | A1 |
| 20120174057 | Narendra et al. | Jul 2012 | A1 |
| 20120180002 | Campbell et al. | Jul 2012 | A1 |
| 20120188252 | Law | Jul 2012 | A1 |
| 20120196557 | Reich et al. | Aug 2012 | A1 |
| 20120196558 | Reich et al. | Aug 2012 | A1 |
| 20120197651 | Robinson et al. | Aug 2012 | A1 |
| 20120203708 | Psota et al. | Aug 2012 | A1 |
| 20120208636 | Feige | Aug 2012 | A1 |
| 20120215784 | King 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 |
| 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 |
| 20120284345 | Costenaro et al. | Nov 2012 | A1 |
| 20120284719 | Phan 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 |
| 20120311684 | Paulsen et al. | Dec 2012 | A1 |
| 20120323829 | Stokes et al. | Dec 2012 | A1 |
| 20120323888 | Osann, Jr. | Dec 2012 | A1 |
| 20120323889 | Marum et al. | Dec 2012 | A1 |
| 20120330801 | McDougal et al. | Dec 2012 | A1 |
| 20120330973 | Ghuneim et al. | Dec 2012 | A1 |
| 20130006426 | Healey 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 |
| 20130024731 | Shochat et al. | Jan 2013 | A1 |
| 20130046635 | Grigg et al. | Feb 2013 | A1 |
| 20130046842 | Muntz et al. | Feb 2013 | A1 |
| 20130054306 | Bhalla | Feb 2013 | A1 |
| 20130054551 | Lange | Feb 2013 | A1 |
| 20130055145 | Antony et al. | Feb 2013 | A1 |
| 20130057551 | Ebert 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 |
| 20130096968 | Van Pelt et al. | Apr 2013 | A1 |
| 20130096988 | Grossman et al. | Apr 2013 | A1 |
| 20130097482 | Marantz 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 |
| 20130117651 | Waldman et al. | May 2013 | A1 |
| 20130101159 | Rosen | Jun 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 |
| 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 |
| 20130198624 | Aymeloglu et al. | Aug 2013 | A1 |
| 20130218879 | Park et al. | Aug 2013 | A1 |
| 20130224696 | Wolfe et al. | Aug 2013 | A1 |
| 20130225212 | Khan | Aug 2013 | A1 |
| 20130226318 | Procyk | Aug 2013 | A1 |
| 20130226944 | Baid et al. | Aug 2013 | A1 |
| 20130226953 | Markovich et al. | Aug 2013 | A1 |
| 20130232045 | Tai | Sep 2013 | A1 |
| 20130232220 | Sampson | 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 |
| 20130262528 | Foit | Oct 2013 | A1 |
| 20130263019 | Castellanos et al. | Oct 2013 | A1 |
| 20130267207 | Hao et al. | Oct 2013 | A1 |
| 20130268520 | Fisher et al. | Oct 2013 | A1 |
| 20130279757 | Kephart | Oct 2013 | A1 |
| 20130282696 | John et al. | Oct 2013 | A1 |
| 20130288719 | Alonzo | Oct 2013 | A1 |
| 20130290011 | Lynn et al. | Oct 2013 | A1 |
| 20130290825 | Arndt et al. | Oct 2013 | A1 |
| 20130297619 | Chandarsekaran et al. | Nov 2013 | A1 |
| 20130304770 | Boero et al. | Nov 2013 | A1 |
| 20130311375 | Priebatsch | Nov 2013 | A1 |
| 20130318604 | Coates et al. | Nov 2013 | A1 |
| 20140012796 | Petersen et al. | Jan 2014 | A1 |
| 20140012886 | Downing 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 |
| 20140053091 | Hou 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 |
| 20140074888 | Potter et al. | Mar 2014 | A1 |
| 20140081685 | Thacker et al. | Mar 2014 | A1 |
| 20140095273 | Tang et al. | Apr 2014 | A1 |
| 20140095509 | Patton | Apr 2014 | A1 |
| 20140108068 | Williams | Apr 2014 | A1 |
| 20140108074 | Miller et al. | Apr 2014 | A1 |
| 20140108380 | Gotz et al. | Apr 2014 | A1 |
| 20140108985 | Scott et al. | Apr 2014 | A1 |
| 20140115589 | Marinelli, III et al. | Apr 2014 | A1 |
| 20140115610 | Marinelli, III 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 |
| 20140149436 | Bahrami et al. | May 2014 | A1 |
| 20140156527 | Grigg et al. | Jun 2014 | A1 |
| 20140157172 | Peery et al. | Jun 2014 | A1 |
| 20140164502 | Khodorenko 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 |
| 20140214579 | Shen et al. | Jul 2014 | A1 |
| 20140214810 | Takeda | 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 |
| 20140250377 | Bisca et al. | Sep 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 |
| 20140280056 | Kelly | Sep 2014 | A1 |
| 20140282160 | Zarpas | Sep 2014 | A1 |
| 20140310266 | Greenfield | Oct 2014 | A1 |
| 20140316911 | Gross | Oct 2014 | A1 |
| 20140333651 | Cervelli et al. | Nov 2014 | A1 |
| 20140337772 | Cervelli et al. | Nov 2014 | A1 |
| 20140344230 | Krause et al. | Nov 2014 | A1 |
| 20140351070 | Christner et al. | Nov 2014 | A1 |
| 20140358829 | Hurwitz | Dec 2014 | A1 |
| 20140366132 | Stiansen et al. | Dec 2014 | A1 |
| 20140372956 | Bisca et al. | Dec 2014 | A1 |
| 20150019394 | Unser et al. | Jan 2015 | A1 |
| 20150046870 | Goldenberg et al. | Feb 2015 | A1 |
| 20150073929 | Psota et al. | Mar 2015 | A1 |
| 20150073954 | Braff | 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 |
| 20150106170 | Bonica | Apr 2015 | A1 |
| 20150106379 | Elliot et al. | Apr 2015 | A1 |
| 20150106858 | Moran | Apr 2015 | A1 |
| 20150112641 | Faraj | Apr 2015 | A1 |
| 20150134599 | Banerjee et al. | May 2015 | A1 |
| 20150134666 | Gattiker et al. | 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 |
| 20150178007 | Moisa | 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 |
| 20150227295 | Meiklejohn et al. | Aug 2015 | A1 |
| 20150242401 | Liu | Aug 2015 | A1 |
| 20150269030 | Fisher 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 |
| 20150379413 | Robertson et al. | Dec 2015 | A1 |
| 20160004610 | Knight | Jan 2016 | A1 |
| 20160004764 | Chakerian et al. | Jan 2016 | A1 |
| 20160026923 | Erenrich et al. | Jan 2016 | A1 |
| 20160034463 | Brewer | Feb 2016 | A1 |
| 20160180557 | Yousaf et al. | Jun 2016 | A1 |
| 20160267063 | Rajvanshi et al. | Sep 2016 | A1 |
| 20180039399 | Kaltegaertner et al. | Feb 2018 | A1 |
| 20190050445 | Griffith | Feb 2019 | A1 |
| 20190180040 | Marcel | Jun 2019 | A1 |
| Number | Date | Country |
|---|---|---|
| 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 |
| 1647908 | Apr 2006 | EP |
| 1672527 | Jun 2006 | EP |
| 2487610 | Aug 2012 | EP |
| 2551799 | Jan 2013 | EP |
| 2560134 | Feb 2013 | EP |
| 2634745 | Sep 2013 | EP |
| 2743839 | Jun 2014 | EP |
| 2778977 | Sep 2014 | EP |
| 2778986 | 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 |
| 2881868 | Jun 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 |
| 2921975 | Sep 2015 | EP |
| 2940603 | Nov 2015 | EP |
| 2940609 | Nov 2015 | EP |
| 2963595 | Jan 2016 | EP |
| 2996053 | Mar 2016 | EP |
| 3035214 | Jun 2016 | EP |
| 3038002 | Jun 2016 | EP |
| 3040885 | Jul 2016 | EP |
| 3340078 | Jun 2018 | EP |
| 2366498 | Mar 2002 | GB |
| 2508503 | Jan 2015 | GB |
| 2516155 | Jan 2015 | GB |
| 2508293 | Apr 2015 | GB |
| 2518745 | Apr 2015 | GB |
| 1194178 | Sep 2015 | HK |
| 2012778 | Nov 2014 | NL |
| 2013306 | Feb 2015 | NL |
| 624557 | Dec 2014 | NZ |
| 622485 | Mar 2015 | NZ |
| 616212 | May 2015 | NZ |
| 616299 | Jul 2015 | NZ |
| WO 2000009529 | Feb 2000 | WO |
| WO 2000034895 | Jun 2000 | WO |
| WO 2002065353 | Aug 2002 | WO |
| WO 2005104736 | Nov 2005 | WO |
| WO 2005116851 | Dec 2005 | WO |
| WO 2008064207 | May 2008 | WO |
| WO 2009061501 | May 2009 | WO |
| WO 2010000014 | Jan 2010 | WO |
| WO 2010030913 | Mar 2010 | WO |
| WO 2010030917 | Mar 2010 | WO |
| WO 2012061162 | May 2012 | WO |
| WO 2013010157 | Jan 2013 | WO |
| WO 2013030595 | Mar 2013 | WO |
| WO 2013102892 | Jul 2013 | WO |
| Entry |
|---|
| “A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2. |
| “A Tour of Pinboard,” <http://pinboard.in/tour> as printed May 15, 2014 in 6 pages. |
| Alur et al., “Chapter 2: IBM InfoSphere DataStage Stages,” IBM InfoSphere DataStage Data Flow and Job Design, Jul. 1, 2008, pp. 35-137. |
| Anonymous, “Frequently Asked Questions about Office Binder 97,” http://web.archive.org/web/20100210112922/http://support.microsoft.com/kb/843147 printed Dec. 18, 2006 in 5 pages. |
| Bae et al., “Partitioning Algorithms for the Computation of Average Iceberg Queries,” DaWaK 2000, LNCS 1874, pp. 276_286. |
| Ballesteros et al., “Batching: A Design Pattern for Efficient and Flexible Client/Server Interaction,” Transactions on Pattern Languages of Programming, Springer Berlin Heildeberg, 2009, pp. 48-66. |
| Bogle et al., “Reducing Cross-Domain Call Overhead Using Batched Futures,” SIGPLAN No. 29, 10 (Oct. 1994) pp. 341-354. |
| Bogle, Phillip Lee, “Reducing Cross-Domain Call Overhead Using Batched Futures,” May 1994, Massachusetts Institute of Technology, pp. 96. |
| Bouajjani et al., “Analysis of Recursively Parallel Programs,” PLDI09: Proceedings of the 2009 ACM Sigplan Conference on Programming Language Design and Implementation, Jun. 15-20, 2009, Dublin, Ireland, pp. 203-214. |
| Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10. |
| Chazelle et al., “The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables,” SODA '04 Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 30-39. |
| Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679. |
| Delicious, http://delicious.com/> as printed May 15, 2014 in 1 page. |
| Donjerkovic et al., “Probabilistic Optimization of Top N Queries,” Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999, pp. 411-422. |
| Fang et al., “Computing Iceberg Queries Efficiently,” Proceedings of the 24th VLDB Conference New York, 1998, pp. 299-310. |
| “The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29. |
| Frantisek et al., “An Architectural View of Distributed Objects and Components in CORBA, Java RMI and COM/DCOM,” Software—Concepts & Tools, vol. 19, No. 1, Jun. 1, 1998, pp. 14-28. |
| Goldstein et al., “Stacks Lazy Threads: Implementing a Fast Parallel Call,” Journal of Parallel and Distributed Computing, Jan. 1, 1996, pp. 5-20. |
| Han et al., “Efficient Computation of Iceberg Cubes with Complex Measures,” ACM Sigmod, May 21-24, 2001, pp. 1-12. |
| Ivanova et al., “An Architecture for Recycling Intermediates in a Column-Store,” Proceedings of the 35th Sigmod International Conference on Management of Data, Sigmod '09, Jun. 29, 2009, p. 309. |
| Jacques, M., “An extensible math expression parser with plug-ins,” Code Project, Mar. 13, 2008. Retrieved on Jan. 30, 2015 from the internet: <http://www.codeproject.com/Articles/7335/An-extensible-math-expression-parser-with-plug-ins>. |
| “Java Remote Method Invocation: 7—Remote Object Activation,” Dec. 31, 2010, retrieved from the internet Mar. 15, 2016 https://docs.oracle.com/javase/7/docs/platform/rmi/spec/rmi-activation2.html. |
| Jenks et al., “Nomadic Threads: A Migrating Multithreaded Approach to Remote Memory Accesses in Multiprocessors,” Parallel Architectures and Compilation Techniques, 1996, Oct. 20, 1996, pp. 2-11. |
| 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. |
| Karp et al., “A Simple Algorithm for Finding Frequent Elements in Streams and Bags,” ACM Transactions on Database Systems, vol. 28, No. 1, Mar. 2003, pp. 51D55. |
| Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21. |
| Leela et al., “On Incorporating Iceberg Queries in Query Processors,” Technical Report, TR-2002-01, Database Systems for Advanced Applications Lecture Notes in Computer Science, 2004, vol. 2973. |
| Liu et al., “Methods for Mining Frequent Items in Data Streams: An Overview,” Knowledge and Information Systems, vol. 26, No. 1, Jan. 2011, pp. 1-30. |
| Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15. |
| Mendes et al., “TcruziKB: Enabling Complex Queries for Genomic Data Exploration,” IEEE International Conference on Semantic Computing, Aug. 2008, pp. 432-439. |
| Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14. |
| Russell et al., “NITELIGHT: A Graphical Tool for Semantic Query Construction,” 2008, pp. 10. |
| 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. |
| Smart et al., “A Visual Approach to Semantic Query Design Using a Web-Based Graphical Query Designer,” 16th International Conference on Knowledge Engineering and Knowledge Management (EKAW 2008),ÊAcitrezza, Catania, Italy, Sep. Ê29-Oct. 3, 2008, pp. 16. |
| Stamos et al., “Remote Evaluation,” Journal ACM Transactions on Programming Languages and Systems (TOPLAS) vol. 12, Issue 4, Oct. 1990, pp. 537-564. |
| Wikipedia, “Machine Code”, p. 1-5, printed Aug. 11, 2014. |
| Wollrath et al., “A Distributed Object Model for the Java System,” Proceedings of the 2nd Conference on USENEX, Conference on Object-Oriented Technologies (COOTS), Jun. 17, 1996, pp. 219-231. |
| “A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30. |
| “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/, 21 pages. |
| About 80 Minutes, “Palantir in a Number of Parts—Part 6—Graph,” Mar. 21, 2013, pp. 1-6. |
| Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316. |
| 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, 3 pages. |
| 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, “Persistent data structure—Wikipedia”, Aug. 13, 2016, pp. 1-9, Retrieved from the Internet: URL: https://en.wikipedia.org/w/index.php?t itle= Persistent -data -structure&oldid=734240973, retrieved on Feb. 9, 2018. |
| 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. |
| 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, 1111 pages. |
| Brooks et al., “Hoptrees: Branching History Navigation for Hierarchies,” Sep. 2, 2013, Network and Parallel Computing, pp. 316-333. |
| 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. |
| Butkovic et al., “Using Whois Based Geolocation and Google Maps API for Support Cybercrime Investigations,” Recent Advances in Telecommunications and Circuits: Proceedings of the 11th International Conference on Applied Electromagnetics, Wireless and Optical Communications (Electroscience '13), Proceedings of the 2nd International Conference on Circuits, Systems, Communications, Computers and Applications (CSCCA '13), Proceedings of the 1st International Conference on Solid State Circuits (SSC '13), Proceedings of the 1st International Conference on Antennas & Propagation (ANPRO '13) :Dubrovnik, Croatia, Jun. 25-27, 2013, pp. 194-200, 2013. |
| 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, 58 pages. |
| Chaudhuri et al., “An Overview of Business intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8, 11 pages. |
| 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, pp. 17-32. |
| Conner, Nancy, “Google Apps: The Missing Manual,” May 1, 2008, pp. 17. |
| 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. |
| 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, 10 pages. |
| Driscoll, James et al: “Making Data Structures Persistent”, Journal of Computer and System Sciences, vol. 38, Feb. 1, 1989, pp. 86-124. |
| Flurry Analytics, http://www.flurry.com/ Printed Jul. 18, 2013 in 14 pages. |
| Gesher, Ari, “Palantir Screenshots in the Wild: Swing Sightings,” The Palantir Blog, Sep. 11, 2007. pp. 1-6. |
| Gill et al., “Computerised Linking of Medical Records: Methodological Guidelines,” Journal of Epidemiology and Community Health, 1993, vol. 47, pp. 316-319. |
| 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, 2 pages. |
| Glaab et al., “EnrichNet: Network-Based Gene Set Enrichment Analysis,” Bioinformatics 28.18 (2012): pp. i451-i457. |
| 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, 3 pages. |
| 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. |
| 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. |
| 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, 2009, pp. 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. |
| “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. |
| Hur et al., “SciMiner: web-based literature mining tool for target identification and functional enrichment analysis,” Bioinformatics 25.6 (2009): pp. 838-840. |
| IBM, Determining Business Object Structure, IBM, 2004, pp. 9. |
| Kahan et al., “Annotea: An open RDF infrastructure for shared WEB annotations”, Computer Networks 39, pp. 589-608, 2002. |
| Karger, David, “Lecture 2: Persistent Data 1-15 Structures, MIT Course on Advanced Algorithms”, Sep. 9, 2005, pp. 1-5, Retrieved from the Internet URL: https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-854j-advanced-algorithms-fall-2005/lecture-notes/persistent.pdf, retrieved on Feb. 9, 2018, 5 pages. |
| 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-Threatsl.pdf downloaded May 12, 2014 in 10 pages. |
| 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. |
| 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. |
| 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.yahoo.com, 1 page. |
| Map of San Jose, CA. Retrieved Oct. 2. 2013 from http://maps.bing.com, 1 page. |
| Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com, 1 page. |
| 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. |
| Mixpanel—Mobile Analytics, https://mixpanel.coml Printed Jul. 18, 2013 in 13 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, 30 pages. |
| Nierman, “Evaluating Structural Similarity in XML Documents,” 2002, 6 pages. |
| Nolan et al., “MCARTA: A Malicious Code Automated Run-Time Analysis Framework.” Homeland Security, 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. |
| Palantir Technologies, “Palantir Labs—Timeline,” Oct. 1, 2010, retrieved from the internet https://www.youtube.com/watch?v=JCgDW5bru9M. 1 page. |
| Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, pp. 57-64. |
| 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. |
| “Potential Money Laundering Warning Signs,” snapshot taken 2003, https://web.archive.org/web/2003081609055/http:/finsolinc.com/ANTI-MONEY%20LAUDERING%20TRAINING%20GUIDES.pdf, 6 pages. |
| Quest, “Toad for Oracle 11.6—Guide to Using Toad,” Sep. 24, 2012, pp. 1-162. |
| “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, 1 page. |
| Rouse, Margaret, “OLAP Cube,”http://searchdatamanagement.techtarget.com/definition/OLAP-cube Apr. 28, 2012, pp. 16. |
| “SAP Business Objects Explorer Online Help”, SAP Business Objects, Mar. 19, 2012, pp. 68. |
| 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. |
| 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, 12 pages. |
| TestFlight—Beta Testing on the Fly, Kttp://testflightapp.com/ Printed Jul. 18, 2013 in 3 pages. |
| Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011, 3 pages. |
| 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. |
| 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,> 6 pages. |
| Wikipedia, “Multimap,” Jan. 1, 2013, <https://en.wikipedia.org/w/index.php?title=Multimap&oldid=530800748, 2 pages.>. |
| 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,>6 pages. |
| Winkler, William E., “Bureau of the Census Statistical Research Division Record Linkage Software and Methods for Merging Administrative Lists,” Statistical Research Report Series No. RR2001/03, Jul. 23, 2001, https://www.census.gov/srd/papers/pdf/rr2001-03.pdf, retrieved on Mar. 9, 2016,>11 pages. |
| Wright et al., “Palantir Technologies VAST 2010 Challenge Text Records—Investigations into Arms Dealing.” Oct. 29, 2010, pp. 1-10. |
| Yang et al., “HTML Page Analysis Based on Visual Cues,” 2001, pp. 859-864. |
| Zheng et al., “GOEAST: a web-based software toolkit for Gene Ontology enrichment analysis,” Nucleic acids research 36.suppl 2 (2008): pp. W385-W363. |
